/external/opencv/cv/src/ |
H A D | 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 586 icvFindBasicVariables( float **cost, char **is_x, CvNode1D * u, CvNode1D * v, int ssize, int dsize ) argument 711 icvIsOptimal( float **cost, char **is_x, CvNode1D * u, CvNode1D * v, int ssize, int dsize, CvNode2D * enter_x ) argument 916 int ssize = state->ssize, dsize = state->dsize; local [all...] |
H A D | 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, argument 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 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/linux-tools-perf/util/include/linux/ |
H A D | kernel.h | 75 ssize_t ssize = size; local 79 return (i >= ssize) ? (ssize - 1) : i; 85 ssize_t ssize = size; local 92 return (i >= ssize) ? (ssize - 1) : i;
|
/external/qemu/elff/ |
H A D | 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) {
argument 120 return rp >= ss && ss != NULL && (diff_ptr(ss, rend) <= ssize) && rend >= rp;
|
/external/bison/lib/ |
H A D | 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...] |
H A D | 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/ |
H A D | 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/ |
H A D | 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/qemu/distrib/jpeg-6b/ |
H A D | 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/ |
H A D | LeaksParserWorker.js | 39 var match = /^Leak:.*\ssize=(\d+)\s/.exec(line);
|
/external/llvm/lib/Support/ |
H A D | 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) 1393 p->ssize [all...] |
/external/libffi/src/ |
H A D | dlmalloc.c | 3309 size_t ssize = pad_request(sizeof(struct malloc_segment)); local 3310 char* rawsp = old_end - (ssize + FOUR_SIZE_T_SIZES + CHUNK_ALIGN_MASK); 3316 mchunkptr tnext = chunk_plus_offset(sp, ssize); 3325 set_size_and_pinuse_of_inuse_chunk(m, sp, ssize); 3472 size_t ssize = end - br; local 3473 if (ssize > nb + TOP_FOOT_SIZE) { 3475 tsize = ssize;
|
/external/qemu/distrib/sdl-1.2.12/src/stdlib/ |
H A D | SDL_malloc.c | 3321 size_t ssize = pad_request(sizeof(struct malloc_segment)); local 3322 char* rawsp = old_end - (ssize + FOUR_SIZE_T_SIZES + CHUNK_ALIGN_MASK); 3328 mchunkptr tnext = chunk_plus_offset(sp, ssize); 3337 set_size_and_pinuse_of_inuse_chunk(m, sp, ssize); 3484 size_t ssize = end - br; local 3485 if (ssize > nb + TOP_FOOT_SIZE) { 3487 tsize = ssize;
|
/external/guava/guava/src/com/google/common/cache/ |
H A D | LocalCache.java | 2012 final Segment<K, V>[] newSegmentArray(int ssize) { argument 2013 return new Segment[ssize];
|
/external/guava/guava/src/com/google/common/collect/ |
H A D | MapMakerInternalMap.java | 2023 final Segment<K, V>[] newSegmentArray(int ssize) { argument 2024 return new Segment[ssize];
|