HomeSort by relevance Sort by last modified time
    Searched defs:count2 (Results 1 - 25 of 39) sorted by null

1 2

  /external/icu4c/i18n/
ucol_wgt.h 30 uint32_t count2; member in struct:WeightRange
ucol_wgt.cpp 116 range->count2*=countBytes;
353 /* set the length2 and count2 fields */
356 ranges[i].count2=(uint32_t)ranges[i].count;
367 lengthCounts[ranges[i].length2]+=ranges[i].count2;
376 maxCount+=ranges[rangeCount].count2;
383 } else if(n<=ranges[0].count2*countBytes) {
385 uint32_t count1, count2, power_1, power; local
389 /* calculate how to split the range between maxLength-1 (count1) and maxLength (count2) */
392 count2=(n+power-1)/power;
393 count1=ranges[0].count-count2;
    [all...]
  /external/valgrind/main/drd/tests/
pth_detached.c 49 const int count2 = argc > 2 ? atoi(argv[2]) : 100; local
50 int thread_arg[count1 > count2 ? count1 : count2];
55 for (i = 0; i < count1 || i < count2; i++)
72 // Create count2 detached threads by letting the threads detach themselves.
76 for (i = 0; i < count2; i++)
84 while (get_finished_count() < count1 + count2)
pth_detached_sem.c 44 const int count2 = argc > 2 ? atoi(argv[2]) : 100; local
45 int thread_arg[count1 > count2 ? count1 : count2];
50 for (i = 0; i < count1 || i < count2; i++)
67 // Create count2 detached threads by letting the threads detach themselves.
71 for (i = 0; i < count2; i++)
79 for (i = 0; i < count1 + count2; i++)
  /external/skia/src/images/
SkImageRefPool.cpp 153 int count2 = 0; local
156 count2 += 1;
159 SkASSERT(count2 == count);
  /external/skia/gpu/src/
GrTextStrike.cpp 95 int count2 = 0; local
98 count2 += 1;
101 GrAssert(count == count2);
103 count2 = 0;
106 count2 += 1;
109 GrAssert(count == count2);
  /external/srec/srec/crec/
srec_debug.c 80 int count, count2; local
87 count2 = count_fsmarc_token_list(rec, rec->active_fsmarc_tokens);
88 printf("number active: %d fsmnodes %d fsmarcs\n", count, count2);
  /packages/apps/Contacts/src/com/android/contacts/format/
FormatUtils.java 66 int count2 = array2.length; local
69 while (count1 > 0 && count2 > 0 && array1[count1 - 1] == array2[count2 - 1]) {
71 count2--;
74 int size = count2;
  /dalvik/tests/055-enum-performance/src/
Main.java 18 int count2 = test2(500); local
27 System.out.println("test2: performed " + count2 + " iterations");
31 double msec2 = (time2 - time1) / (double) count2 / 1000000;
  /dalvik/vm/
ReferenceTable.cpp 200 size_t count2 = getElementCount(obj2); local
201 if (count1 != count2) {
202 return count1 - count2;
  /external/freetype/src/sfnt/
ttkern.c 261 FT_UInt count2; local
264 for ( count2 = num_pairs; count2 > 0; count2-- )
ttsbit.c 543 FT_ULong count2 = strike->num_ranges; local
555 while ( count2 > 0 )
561 count2--;
568 count2 = strike->num_ranges;
570 while ( count2 > 0 )
587 count2--;
    [all...]
  /external/qemu/distrib/sdl-1.2.12/src/joystick/macos/
SDL_sysjoystick.c 154 UInt32 count, gotCount, count2; local
158 count2 = 0;
183 count2 += gotCount;
190 &(joystick->hwdata->refs[count2]));
194 count2 += gotCount;
201 &(joystick->hwdata->refs[count2]));
205 count2 += gotCount;
  /external/skia/tests/
UtilsTest.cpp 126 size_t count2 = SkUTF16_CountUnichars(buf, 2); local
127 REPORTER_ASSERT(reporter, count2 == 1);
  /external/freetype/src/pshinter/
pshglob.c 476 FT_UInt count1, count2; local
500 count2 = family->count;
502 for ( ; count2 > 0; count2--, zone2++ )
pshrec.c 383 FT_UInt count2 = mask2->num_bits; local
387 count = ( count1 <= count2 ) ? count1 : count2;
430 FT_UInt count2 = mask2->num_bits; local
434 if ( count2 > 0 )
441 /* if "count2" is greater than "count1", we need to grow the */
443 if ( count2 > count1 )
445 error = ps_mask_ensure( mask1, count2, memory );
449 for ( pos = count1; pos < count2; pos++ )
456 pos = (FT_UInt)( ( count2 + 7 ) >> 3 )
1008 FT_UInt count2 = dim[1].hints.num_hints; local
1053 FT_UInt count2 = dim[1].hints.num_hints; local
    [all...]
  /external/qemu/android/utils/
stralloc.c 303 int count2; local
314 count2 = 4 + 3*(max_count - count);
315 stralloc_readyplus( s, count2 );
316 memset( s->s + s->n, ' ', count2 );
317 s->n += count2;
  /external/apache-harmony/luni/src/test/api/common/org/apache/harmony/luni/tests/java/net/
ExcludedProxyTest.java 82 int count2 = 0; local
83 while ((count2 = is2.read(b2)) > 0)
84 response2 += new String(b2, 0, count2);
  /external/icu4c/test/cintltst/
utransts.c 182 int32_t idLength, id2Length, count, count2; local
232 count2=uenum_count(uenum, &errorCode);
234 log_err("2nd uenum_count(transliterator IDs)=%d - %s\n", count2, u_errorName(errorCode));
235 } else if(count!=count2) {
236 log_err("uenum_unext(transliterator IDs) returned %d IDs but uenum_count() after uenum_reset() claims there are %d\n", count, count2);
  /external/icu4c/test/intltest/
tchcfmt.cpp 490 int32_t count2 = 0; local
491 const double *limits2 = fmt2.getLimits(count2);
492 const UBool *closures2 = fmt2.getClosures(count2);
494 if((count2 != 6) || !limits2 || !closures2) {
497 for(i=0;i<count2;i++) {
499 i, count2,
  /external/tremolo/Tremolo/
bitwise.c 689 long j,count=0,count2=0,bitcount=0; local
719 count2=(bitcount+7)>>3;
728 while(count2){
733 if(ilen>count2)ilen=count2;
746 count2-=ilen;
  /libcore/luni/src/main/java/java/util/
TimSort.java 675 int count2 = 0; // Number of times in a row that second run won
685 count2++;
692 count2 = 0;
696 } while ((count1 | count2) < minGallop);
718 count2 = gallopLeft(tmp[cursor1], a, cursor2, len2, 0, c);
719 if (count2 != 0) {
720 System.arraycopy(a, cursor2, a, dest, count2);
721 dest += count2;
722 cursor2 += count2;
723 len2 -= count2;
794 int count2 = 0; \/\/ Number of times in a row that second run won local
    [all...]
  /external/icu4c/common/
uhash.c 882 int32_t count1, count2, pos, i; local
909 count2 = uhash_count(hash2);
910 if(count1!=count2){
    [all...]
  /external/webkit/Source/WebKit/android/nav/
FindCanvas.cpp 88 int count2 = clonePaint.textToGlyphs(lower, byteLength, mLowerGlyphs); local
89 SkASSERT(mCount == count2);
90 count2 = clonePaint.textToGlyphs(upper, byteLength, mUpperGlyphs);
91 SkASSERT(mCount == count2);
  /system/media/mca/filterfw/native/core/
shader_program.cpp 664 GLint count1, count2; local
666 glGetIntegerv(GL_MAX_FRAGMENT_UNIFORM_VECTORS, &count2);
667 return count1 < count2 ? count1 : count2;
    [all...]

Completed in 1456 milliseconds

1 2