aboutsummaryrefslogtreecommitdiffstats
path: root/scripts/patch-kernel.sh
blob: 5455a0cf8d53dfe87fb5b71a9354c96736e7db82 (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
#! /bin/sh
# A little script I whipped up to make it easy to
# patch source trees and have sane error handling
# -Erik
#
# (c) 2002 Erik Andersen <andersen@codepoet.org>

# Set directories from arguments, or use defaults.
targetdir=${1-.}
patchdir=${2-../kernel-patches}
patchpattern=${3-*}

if [ ! -d "${targetdir}" ] ; then
    echo "Aborting.  '${targetdir}' is not a directory."
    exit 1
fi
if [ ! -d "${patchdir}" ] ; then
    echo "Aborting.  '${patchdir}' is not a directory."
    exit 1
fi
    
for i in ${patchdir}/${patchpattern} ; do 
    case "$i" in
	*.gz)
	type="gzip"; uncomp="gunzip -dc"; ;; 
	*.bz)
	type="bzip"; uncomp="bunzip -dc"; ;; 
	*.bz2)
	type="bzip2"; uncomp="bunzip2 -dc"; ;; 
	*.zip)
	type="zip"; uncomp="unzip -d"; ;; 
	*.Z)
	type="compress"; uncomp="uncompress -c"; ;; 
	*)
	type="plaintext"; uncomp="cat"; ;; 
    esac
    [ -d "${i}" ] && echo "Ignoring subdirectory ${i}" && continue	
    echo ""
    echo "Applying ${i} using ${type}: " 
    ${uncomp} ${i} | patch -p1 -E -d ${targetdir} 
    if [ $? != 0 ] ; then
        echo "Patch failed!  Please fix $i!"
	exit 1
    fi
done

# Check for rejects...
if [ "`find $targetdir/ '(' -name '*.rej' -o -name '.*.rej' ')' -print`" ] ; then
    echo "Aborting.  Reject files found."
    exit 1
fi

# Remove backup files
find $targetdir/ '(' -name '*.orig' -o -name '.*.orig' ')' -exec rm -f {} \;
="p">=> Null_Flist); -- Get the chain for a free flist for large length. It is stored at the -- first element of the list. function Free_Next (Flist : Flist_Type) return Flist_Type is begin return Flist_Type (Els.Table (Flistt.Table (Flist).Els)); end Free_Next; function Create_Flist (Len : Natural) return Flist_Type is Res : Flist_Type; Prev : Flist_Type; Next : Flist_Type; begin if Len >= Free_Flists'Last then -- Large length. Res := Free_Flists (Free_Flists'Last); Prev := Null_Flist; while Res /= Null_Flist and then Length (Res) /= Len loop Prev := Res; Res := Free_Next (Res); end loop; if Res /= Null_Flist then Next := Free_Next (Res); if Prev = Null_Flist then Free_Flists (Free_Flists'Last) := Next; else Els.Table (Flistt.Table (Prev).Els) := El_Type (Next); end if; end if; else -- Small length. The Len field contains the next free list. Res := Free_Flists (Len); if Res /= Null_Flist then Free_Flists (Len) := Flist_Type (Flistt.Table (Res).Len); Flistt.Table (Res).Len := Nat32 (Len); elsif Len = 0 then -- Quick case for len = 0. Res := Flistt.Allocate (1); Flistt.Table (Res) := (Els => 0, Len => 0); return Res; end if; end if; if Res = Null_Flist then Res := Flistt.Allocate (1); Flistt.Table (Res) := (Els => Els.Allocate (Len), Len => Nat32 (Len)); end if; -- Clear the list. declare Idx : constant El_Index_Type := Flistt.Table (Res).Els; begin Els.Table (Idx .. Idx + El_Index_Type (Len) - 1) := (others => 0); end; return Res; end Create_Flist; procedure Destroy_Flist (Flist : in out Flist_Type) is Len : constant Natural := Length (Flist); Prev : Flist_Type; begin -- Prepend to the array of free flists. if Len >= Free_Flists'Last then Prev := Free_Flists (Free_Flists'Last); Free_Flists (Free_Flists'Last) := Flist; Els.Table (Flistt.Table (Flist).Els) := El_Type (Prev); else Prev := Free_Flists (Len); Free_Flists (Len) := Flist; Flistt.Table (Flist).Len := Nat32 (Prev); end if; Flist := Null_Flist; end Destroy_Flist; function Flast (Flist : Flist_Type) return Integer is begin return Integer (Flistt.Table (Flist).Len - 1); end Flast; function Length (Flist : Flist_Type) return Natural is begin return Natural (Flistt.Table (Flist).Len); end Length; function Get_Nth_Element (Flist : Flist_Type; N : Natural) return El_Type is E : Entry_Type renames Flistt.Table (Flist); begin pragma Assert (N < Natural (E.Len)); return Els.Table (E.Els + El_Index_Type (N)); end Get_Nth_Element; procedure Set_Nth_Element (Flist : Flist_Type; N : Natural; V : El_Type) is E : Entry_Type renames Flistt.Table (Flist); begin pragma Assert (N < Natural (E.Len)); Els.Table (E.Els + El_Index_Type (N)) := V; end Set_Nth_Element; end Flists;