/external/chromium_org/third_party/icu/source/tools/tzcode/ |
ialloc.c | 51 register int oldsize, newsize; local 55 oldsize = 0; 58 else oldsize = strlen(old); 59 if ((result = irealloc(old, oldsize + newsize + 1)) != NULL) 61 (void) strcpy(result + oldsize, new);
|
/external/icu/icu4c/source/tools/tzcode/ |
ialloc.c | 51 register int oldsize, newsize; local 55 oldsize = 0; 58 else oldsize = strlen(old); 59 if ((result = irealloc(old, oldsize + newsize + 1)) != NULL) 61 (void) strcpy(result + oldsize, new);
|
/external/chromium_org/courgette/third_party/ |
bsdiff_create.cc | 115 qsufsort(PagedArray<int>& I, PagedArray<int>& V,const unsigned char *old,int oldsize) 121 for(i=0;i<oldsize;i++) buckets[old[i]]++; 126 for(i=0;i<oldsize;i++) I[++buckets[old[i]]]=i; 127 I[0]=oldsize; 128 for(i=0;i<oldsize;i++) V[i]=buckets[old[i]]; 129 V[oldsize]=0; 133 for(h=1;I[0]!=-(oldsize+1);h+=h) { 135 for(i=0;i<oldsize+1;) { 150 for(i=0;i<oldsize+1;i++) I[V[i]]=i; 154 matchlen(const unsigned char *old,int oldsize,const unsigned char *newbuf,int newsize 219 const int oldsize = static_cast<int>(old_stream->Remaining()); local [all...] |
/external/chromium_org/chrome/installer/mac/third_party/bsdiff/ |
goobsdiff.c | 119 static void qsufsort(off_t *I,off_t *V,u_char *old,off_t oldsize) 125 for(i=0;i<oldsize;i++) buckets[old[i]]++; 130 for(i=0;i<oldsize;i++) I[++buckets[old[i]]]=i; 131 I[0]=oldsize; 132 for(i=0;i<oldsize;i++) V[i]=buckets[old[i]]; 133 V[oldsize]=0; 137 for(h=1;I[0]!=-(oldsize+1);h+=h) { 139 for(i=0;i<oldsize+1;) { 154 for(i=0;i<oldsize+1;i++) I[V[i]]=i; 157 static off_t matchlen(u_char *old,off_t oldsize,u_char *new,off_t newsize 336 off_t oldsize,newsize; local [all...] |
goobspatch.c | 371 off_t expect_oldsize, oldsize, newsize, patchsize; local 447 ((oldsize=lseek(fd,0,SEEK_END))==-1) || 448 ((old=malloc(oldsize+1))==NULL) || 450 (read(fd,old,oldsize)!=oldsize) || 452 if (expect_oldsize != oldsize) 454 oldsize, expect_oldsize); 455 SHA1(old, oldsize, sha1); 485 if((oldpos+i>=0) && (oldpos+i<oldsize))
|
/external/jemalloc/include/jemalloc/internal/ |
huge.h | 14 bool huge_ralloc_no_move(void *ptr, size_t oldsize, size_t size, 16 void *huge_ralloc(arena_t *arena, void *ptr, size_t oldsize, size_t size,
|
jemalloc_internal.h | 627 void *iralloct_realign(void *ptr, size_t oldsize, size_t size, size_t extra, 804 iralloct_realign(void *ptr, size_t oldsize, size_t size, size_t extra, 830 copysize = (size < oldsize) ? size : oldsize; 840 size_t oldsize; local 845 oldsize = isalloc(ptr, config_prof); 853 return (iralloct_realign(ptr, oldsize, size, extra, alignment, 858 return (arena_ralloc(arena, ptr, oldsize, size, extra, 862 return (huge_ralloc(arena, ptr, oldsize, size, extra, 877 size_t oldsize; local [all...] |
/external/bsdiff/ |
bsdiff.c | 104 static void qsufsort(off_t *I,off_t *V,u_char *old,off_t oldsize) 110 for(i=0;i<oldsize;i++) buckets[old[i]]++; 115 for(i=0;i<oldsize;i++) I[++buckets[old[i]]]=i; 116 I[0]=oldsize; 117 for(i=0;i<oldsize;i++) V[i]=buckets[old[i]]; 118 V[oldsize]=0; 122 for(h=1;I[0]!=-(oldsize+1);h+=h) { 124 for(i=0;i<oldsize+1;) { 139 for(i=0;i<oldsize+1;i++) I[V[i]]=i; 142 static off_t matchlen(u_char *old,off_t oldsize,u_char *new,off_t newsize 200 off_t oldsize,newsize; local [all...] |
bspatch.c | 64 ssize_t oldsize,newsize; local 137 ((oldsize=lseek(fd,0,SEEK_END))==-1) || 138 ((old=malloc(oldsize+1))==NULL) || 140 (read(fd,old,oldsize)!=oldsize) || 172 if((oldpos+i>=0) && (oldpos+i<oldsize))
|
/bootable/recovery/applypatch/ |
bsdiff.c | 121 static void qsufsort(off_t *I,off_t *V,u_char *old,off_t oldsize) 127 for(i=0;i<oldsize;i++) buckets[old[i]]++; 132 for(i=0;i<oldsize;i++) I[++buckets[old[i]]]=i; 133 I[0]=oldsize; 134 for(i=0;i<oldsize;i++) V[i]=buckets[old[i]]; 135 V[oldsize]=0; 139 for(h=1;I[0]!=-(oldsize+1);h+=h) { 141 for(i=0;i<oldsize+1;) { 156 for(i=0;i<oldsize+1;i++) I[V[i]]=i; 159 static off_t matchlen(u_char *old,off_t oldsize,u_char *new,off_t newsize [all...] |
/external/jemalloc/src/ |
huge.c | 75 huge_ralloc_no_move(void *ptr, size_t oldsize, size_t size, size_t extra) 81 if (oldsize > arena_maxclass 82 && CHUNK_CEILING(oldsize) >= CHUNK_CEILING(size) 83 && CHUNK_CEILING(oldsize) <= CHUNK_CEILING(size+extra)) { 84 assert(CHUNK_CEILING(oldsize) == oldsize); 93 huge_ralloc(arena_t *arena, void *ptr, size_t oldsize, size_t size, 100 if (huge_ralloc_no_move(ptr, oldsize, size, extra) == false) 104 * size and oldsize are different enough that we need to use a 130 copysize = (size < oldsize) ? size : oldsize [all...] |
arena.c | [all...] |
/external/chromium_org/third_party/libevent/ |
evport.c | 238 int oldsize = epdp->ed_nevents; local 239 int newsize = factor * oldsize; 248 memset((char*) (epdp->ed_fds + oldsize), 0, 249 (newsize - oldsize)*sizeof(struct fd_info));
|
/external/chromium_org/third_party/skia/third_party/lua/src/ |
lmem.h | 50 LUAI_FUNC void *luaM_realloc_ (lua_State *L, void *block, size_t oldsize,
|
lparser.c | 168 int oldsize = f->sizelocvars; local 171 while (oldsize < f->sizelocvars) f->locvars[oldsize++].varname = NULL; 233 int oldsize = f->sizeupvalues; local 237 while (oldsize < f->sizeupvalues) f->upvalues[oldsize++].name = NULL; 504 int oldsize = f->sizep; local 506 while (oldsize < f->sizep) f->p[oldsize++] = NULL; [all...] |
/external/bison/lib/ |
ebitset.c | 125 bitset_windex oldsize; local 131 oldsize = EBITSET_SIZE (src); 134 if (oldsize < newsize) 142 /* We need to allocate more memory. When oldsize is 147 if (oldsize == 0) 157 memset (EBITSET_ELTS (src) + oldsize, 0, 158 (newsize - oldsize) * sizeof (ebitset_elt *)); 164 if ((oldsize - newsize) >= oldsize / 2)
|
vbitset.c | 58 bitset_windex oldsize; local 64 oldsize = VBITSET_SIZE (src); 67 if (oldsize < newsize) 75 /* We need to allocate more memory. When oldsize is 80 if (oldsize == 0) 90 memset (VBITSET_WORDS (src) + oldsize, 0, 91 (newsize - oldsize) * sizeof (bitset_word)); 98 if ((oldsize - newsize) >= oldsize / 2)
|
/external/valgrind/main/callgrind/ |
callstack.c | 91 Int oldsize; local 96 oldsize = cs->size; 104 for(i=oldsize; i<cs->size; i++)
|
/external/compiler-rt/lib/sanitizer_common/ |
sanitizer_addrhashmap.h | 264 uptr oldsize = sizeof(*add) + (add->cap - 1) * sizeof(add->cells[0]); local 265 uptr newsize = oldsize * 2;
|
/external/zopfli/src/zopflipng/ |
zopflipng_bin.cc | 131 void PrintResultSize(const char* label, size_t oldsize, size_t newsize) { 133 label, (int) newsize, (int) newsize / 1024, newsize * 100.0 / oldsize);
|
/external/chromium_org/third_party/libxml/src/ |
dict.c | 528 int oldsize, i; local 548 oldsize = dict->size; 552 if (oldsize == MIN_DICT_SIZE) 569 for (i = 0; i < oldsize; i++) { 607 for (i = 0; i < oldsize; i++) { 645 "xmlDictGrow : from %d to %d, %d elems\n", oldsize, size, nbElem);
|
hash.c | 199 int oldsize, i; local 213 oldsize = table->size; 232 for (i = 0; i < oldsize; i++) { 241 for (i = 0; i < oldsize; i++) { 273 "xmlHashGrow : from %d to %d, %d elems\n", oldsize, size, nbElem);
|
xmlmemory.c | 317 size_t oldsize; local 338 oldsize = p->mh_size; 374 "Realloced(%d to %d) Ok\n", oldsize, size);
|
/external/libxml2/ |
dict.c | 630 size_t oldsize, i; local 650 oldsize = dict->size; 654 if (oldsize == MIN_DICT_SIZE) 671 for (i = 0; i < oldsize; i++) { 709 for (i = 0; i < oldsize; i++) { 747 "xmlDictGrow : from %lu to %lu, %u elems\n", oldsize, size, nbElem);
|
hash.c | 231 int oldsize, i; local 245 oldsize = table->size; 264 for (i = 0; i < oldsize; i++) { 273 for (i = 0; i < oldsize; i++) { 305 "xmlHashGrow : from %d to %d, %d elems\n", oldsize, size, nbElem);
|