Searched refs:old (Results 1 – 4 of 4) sorted by relevance
/bootable/recovery/applypatch/ |
D | applypatch.sh | 83 run_command rm $WORK_DIR/old.file 103 OLD_SHA1=$(sha1 $DATA_DIR/old.file) 118 $ADB push $DATA_DIR/old.file $WORK_DIR 121 run_command $WORK_DIR/applypatch -c $WORK_DIR/old.file $OLD_SHA1 || fail 124 run_command $WORK_DIR/applypatch -c $WORK_DIR/old.file $BAD1_SHA1 $OLD_SHA1 $BAD2_SHA1|| fail 127 run_command $WORK_DIR/applypatch -c $WORK_DIR/old.file $BAD2_SHA1 $BAD1_SHA1 && fail 129 $ADB push $DATA_DIR/old.file $CACHE_TEMP_SOURCE 131 run_command dd if=/dev/urandom of=$WORK_DIR/old.file count=100 bs=1024 || fail 134 run_command $WORK_DIR/applypatch -c $WORK_DIR/old.file $OLD_SHA1 || fail 137 run_command $WORK_DIR/applypatch -c $WORK_DIR/old.file $BAD1_SHA1 $OLD_SHA1 $BAD2_SHA1|| fail [all …]
|
D | bsdiff.cpp | 121 static void qsufsort(off_t *I,off_t *V,u_char *old,off_t oldsize) in qsufsort() argument 127 for(i=0;i<oldsize;i++) buckets[old[i]]++; in qsufsort() 132 for(i=0;i<oldsize;i++) I[++buckets[old[i]]]=i; in qsufsort() 134 for(i=0;i<oldsize;i++) V[i]=buckets[old[i]]; in qsufsort() 169 static off_t search(off_t *I,u_char *old,off_t oldsize, in search() argument 175 x=matchlen(old+I[st],oldsize-I[st],newdata,newsize); in search() 176 y=matchlen(old+I[en],oldsize-I[en],newdata,newsize); in search() 188 if(memcmp(old+I[x],newdata,MIN(oldsize-I[x],newsize))<0) { in search() 189 return search(I,old,oldsize,newdata,newsize,x,en,pos); in search() 191 return search(I,old,oldsize,newdata,newsize,st,x,pos); in search() [all …]
|
D | imgdiff.cpp | 183 int bsdiff(u_char* old, off_t oldsize, off_t** IP, u_char* newdata, off_t newsize,
|
/bootable/recovery/edify/ |
D | README | 3 the old one ("amend"). This is a brief overview of the new language.
|