| /external/opencv/cv/src/ |
| cvemd.cpp | 85 int ssize, dsize; member in struct:CvEMDState
125 CvNode1D * u, CvNode1D * v, int ssize, int dsize );
129 int ssize, int dsize, CvNode2D * enter_x );
270 /* if ssize = 1 or dsize = 1 then we are done, else ... */
271 if( state.ssize > 1 && state.dsize > 1 )
279 state.u, state.v, state.ssize, state.dsize );
286 state.ssize, state.dsize, state.enter_x );
343 int ssize = 0, dsize = 0; local
405 state->s[ssize] = weight;
406 state->idx1[ssize++] = i
916 int ssize = state->ssize, dsize = state->dsize; local
[all...] |
| cvimgwarp.cpp | 55 #define ICV_WARP_CLIP_X(x) ((unsigned)(x) < (unsigned)ssize.width ? \
56 (x) : (x) < 0 ? 0 : ssize.width - 1)
57 #define ICV_WARP_CLIP_Y(y) ((unsigned)(y) < (unsigned)ssize.height ? \
58 (y) : (y) < 0 ? 0 : ssize.height - 1)
124 icvResize_NN_8u_C1R( const uchar* src, int srcstep, CvSize ssize,
133 t = (ssize.width*x*2 + MIN(ssize.width, dsize.width) - 1)/(dsize.width*2);
134 t -= t >= ssize.width;
141 t = (ssize.height*y*2 + MIN(ssize.height, dsize.height) - 1)/(dsize.height*2)
636 CvSize ssize, dsize; local
1093 CvSize ssize, dsize; local
1368 CvSize ssize, dsize; local
1993 CvSize ssize, dsize; local
2159 CvSize ssize, dsize; local
[all...] |
| /external/qemu/elff/ |
| elf_defs.h | 111 * ssize - Size of the section that should contain the checking range.
117 is_in_section(const void* rp, size_t rsize, const void* ss, size_t ssize) {
120 return rp >= ss && ss != NULL && (diff_ptr(ss, rend) <= ssize) && rend >= rp;
|
| /ndk/sources/host-tools/ndk-stack/elff/ |
| elf_defs.h | 111 * ssize - Size of the section that should contain the checking range.
117 is_in_section(const void* rp, size_t rsize, const void* ss, size_t ssize) {
120 return rp >= ss && ss != NULL && (diff_ptr(ss, rend) <= ssize) && rend >= rp;
|
| /external/bison/lib/ |
| vbitset.c | 385 bitset_windex ssize; local
395 ssize = VBITSET_SIZE (src);
398 memcpy (dstp, srcp, sizeof (bitset_word) * ssize);
400 memset (dstp + sizeof (bitset_word) * ssize, 0,
401 sizeof (bitset_word) * (dsize - ssize));
411 bitset_windex ssize; local
418 ssize = VBITSET_SIZE (src);
421 for (i = 0; i < ssize; i++)
425 memset (dstp + sizeof (bitset_word) * ssize, 0,
426 sizeof (bitset_word) * (dsize - ssize));
436 bitset_windex ssize = VBITSET_SIZE (src); local
466 bitset_windex ssize = VBITSET_SIZE (src); local
490 bitset_windex ssize = VBITSET_SIZE (src); local
[all...] |
| ebitset.c | 956 bitset_windex ssize; local
962 ssize = EBITSET_SIZE (src);
965 for (j = 0; j < ssize; j++)
971 selt = j < ssize ? selts[j] : 0;
998 bitset_windex ssize; local
1004 ssize = EBITSET_SIZE (src);
1007 for (j = 0; j < ssize; j++)
1013 selt = j < ssize ? selts[j] : 0;
|
| /external/dropbear/ |
| rsa.c | 276 unsigned int nsize, ssize; local
347 ssize = mp_unsigned_bin_size(&rsa_s);
348 dropbear_assert(ssize <= nsize);
349 for (i = 0; i < nsize-ssize; i++) {
353 if (mp_to_unsigned_bin(&rsa_s, buf_getwriteptr(buf, ssize)) != MP_OKAY) {
356 buf_incrwritepos(buf, ssize);
|
| /external/jpeg/ |
| jdmaster.c | 150 int ssize = cinfo->min_DCT_scaled_size; local
151 while (ssize < DCTSIZE &&
152 (compptr->h_samp_factor * ssize * 2 <=
154 (compptr->v_samp_factor * ssize * 2 <=
156 ssize = ssize * 2;
158 compptr->DCT_scaled_size = ssize;
|
| /external/webkit/Tools/BuildSlaveSupport/build.webkit.org-config/public_html/LeaksViewer/ |
| LeaksParserWorker.js | 39 var match = /^Leak:.*\ssize=(\d+)\s/.exec(line);
|
| /bionic/libc/regex/ |
| regcomp.c | 60 sopno ssize; /* malloced strip size (allocated) */ member in struct:parse
178 p->ssize = len/(size_t)2*(size_t)3 + (size_t)1; /* ugh */
179 p->strip = (sop *)calloc(p->ssize, sizeof(sop));
1285 enlarge(p, p->ssize + len); /* this many unexpected additions */
1286 assert(p->ssize >= p->slen + len);
1311 if (p->slen >= p->ssize)
1312 enlarge(p, (p->ssize+1) / 2 * 3); /* +50% */
1313 assert(p->slen < p->ssize);
1376 if (p->ssize >= size)
1385 p->ssize = size
[all...] |
| /external/llvm/lib/Support/ |
| regcomp.c | 61 sopno ssize; /* malloced strip size (allocated) */ member in struct:parse
186 p->ssize = len/(size_t)2*(size_t)3 + (size_t)1; /* ugh */
187 p->strip = (sop *)calloc(p->ssize, sizeof(sop));
1293 enlarge(p, p->ssize + len); /* this many unexpected additions */
1294 assert(p->ssize >= p->slen + len);
1319 if (p->slen >= p->ssize)
1320 enlarge(p, (p->ssize+1) / 2 * 3); /* +50% */
1321 assert(p->slen < p->ssize);
1384 if (p->ssize >= size)
[all...] |
| /ndk/sources/host-tools/ndk-stack/regex/ |
| regcomp.c | 60 sopno ssize; /* malloced strip size (allocated) */ member in struct:parse
178 p->ssize = len/(size_t)2*(size_t)3 + (size_t)1; /* ugh */
179 p->strip = (sop *)calloc(p->ssize, sizeof(sop));
1285 enlarge(p, p->ssize + len); /* this many unexpected additions */
1286 assert(p->ssize >= p->slen + len);
1311 if (p->slen >= p->ssize)
1312 enlarge(p, (p->ssize+1) / 2 * 3); /* +50% */
1313 assert(p->slen < p->ssize);
1376 if (p->ssize >= size)
1385 p->ssize = size
[all...] |
| /libcore/luni/src/main/java/java/util/concurrent/ |
| ConcurrentHashMap.java | 593 int ssize = 1; local
594 while (ssize < concurrencyLevel) {
596 ssize <<= 1;
599 segmentMask = ssize - 1;
600 this.segments = Segment.newArray(ssize);
604 int c = initialCapacity / ssize;
605 if (c * ssize < initialCapacity)
[all...] |
| /system/core/adb/ |
| file_sync_client.c | 577 int ssize = slen + nlen + 2; local
580 copyinfo *ci = malloc(sizeof(copyinfo) + ssize + dsize);
592 ci->dst = ci->src + ssize;
593 snprintf((char*) ci->src, ssize, isdir ? "%s%s/" : "%s%s", spath, name);
|
| /bionic/libc/bionic/ |
| dlmalloc.c | 3461 size_t ssize = pad_request(sizeof(struct malloc_segment)); local
3650 size_t ssize = end - br; local
[all...] |
| /external/libffi/src/ |
| dlmalloc.c | 3309 size_t ssize = pad_request(sizeof(struct malloc_segment)); local
3472 size_t ssize = end - br; local
[all...] |
| /external/qemu/distrib/sdl-1.2.12/src/stdlib/ |
| SDL_malloc.c | 3321 size_t ssize = pad_request(sizeof(struct malloc_segment)); local
3484 size_t ssize = end - br; local
[all...] |
| /external/guava/src/com/google/common/collect/ |
| CustomConcurrentHashMap.java | 671 Segment[] newSegmentArray(int ssize) {
677 return (Segment[]) Array.newInstance(Segment.class, ssize);
[all...] |
