/external/icu4c/tools/tzcode/ |
H A D | 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/bsdiff/ |
H A D | 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) || 167 if((oldpos+i>=0) && (oldpos+i<oldsize))
|
H A D | bsdiff.c | 104 static void qsufsort(off_t *I,off_t *V,u_char *old,off_t oldsize) argument 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_cha argument 152 search(off_t *I,u_char *old,off_t oldsize, u_char *new,off_t newsize,off_t st,off_t en,off_t *pos) argument 200 off_t oldsize,newsize; local [all...] |
/external/valgrind/main/callgrind/ |
H A D | callstack.c | 91 Int oldsize; local 96 oldsize = cs->size; 104 for(i=oldsize; i<cs->size; i++)
|
/external/chromium/third_party/libevent/ |
H A D | 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/bison/lib/ |
H A D | 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)
|
H A D | 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)
|
/external/libxml2/ |
H A D | dict.c | 561 int oldsize, i; local 581 oldsize = dict->size; 585 if (oldsize == MIN_DICT_SIZE) 602 for (i = 0; i < oldsize; i++) { 640 for (i = 0; i < oldsize; i++) { 678 "xmlDictGrow : from %d to %d, %d elems\n", oldsize, size, nbElem);
|
H A D | hash.c | 235 int oldsize, i; local 249 oldsize = table->size; 268 for (i = 0; i < oldsize; i++) { 277 for (i = 0; i < oldsize; i++) { 309 "xmlHashGrow : from %d to %d, %d elems\n", oldsize, size, nbElem);
|
H A D | xmlmemory.c | 319 size_t oldsize; local 340 oldsize = p->mh_size; 377 "Realloced(%d to %d) Ok\n", oldsize, size);
|
/external/mksh/src/ |
H A D | eval.c | 1349 int oldsize = XPsize(*wp); local 1354 qsort(XPptrv(*wp) + oldsize, XPsize(*wp) - oldsize, 1370 int oldsize = XPsize(*wp); local 1378 return (XPsize(*wp) - oldsize);
|
H A D | edit.c | 697 size_t pathlen, patlen, oldsize, newsize, i, j; local 729 oldsize = XPsize(*wp); 736 for (i = j = oldsize; i < newsize; i++) { 1746 int oldsize; local 1759 oldsize = x_size_str(xbuf); 1767 x_redraw(oldsize); 2911 int oldsize = x_size_str(xbuf); local 2922 x_redraw(oldsize);
|
/external/libffi/src/ |
H A D | dlmalloc.c | 3181 size_t oldsize = chunksize(oldp); local 3185 if (oldsize >= nb + SIZE_T_SIZE && 3186 (oldsize - nb) <= (mparams.granularity << 1)) 3190 size_t oldmmsize = oldsize + offset + MMAP_FOOT_PAD; 3779 size_t oldsize = chunksize(oldp); local 3780 mchunkptr next = chunk_plus_offset(oldp, oldsize); 3791 else if (oldsize >= nb) { /* already big enough */ 3792 size_t rsize = oldsize - nb; 3801 else if (next == m->top && oldsize + m->topsize > nb) { 3803 size_t newsize = oldsize [all...] |
/external/qemu/distrib/sdl-1.2.12/src/stdlib/ |
H A D | SDL_malloc.c | 3193 size_t oldsize = chunksize(oldp); local 3197 if (oldsize >= nb + SIZE_T_SIZE && 3198 (oldsize - nb) <= (mparams.granularity << 1)) 3202 size_t oldmmsize = oldsize + offset + MMAP_FOOT_PAD; 3789 size_t oldsize = chunksize(oldp); local 3790 mchunkptr next = chunk_plus_offset(oldp, oldsize); 3801 else if (oldsize >= nb) { /* already big enough */ 3802 size_t rsize = oldsize - nb; 3811 else if (next == m->top && oldsize + m->topsize > nb) { 3813 size_t newsize = oldsize [all...] |