Searched refs:bCount (Results 1 – 9 of 9) sorted by relevance
40 b[bCount++] = bStr; in addB()69 if (max > bCount) max = bCount; in checkMatch()80 bTop = bCount; in checkMatch()84 if (aCount - maxSame < EQUALSIZE || bCount - maxSame < EQUALSIZE) return; in checkMatch()87 int match = find(a, aCount-EQUALSIZE, aCount, b, maxSame, bCount); in checkMatch()93 match = find(b, bCount-EQUALSIZE, bCount, a, maxSame, aCount); in checkMatch()95 bTop = bCount-EQUALSIZE; in checkMatch()99 if (aCount >= STACKSIZE || bCount >= STACKSIZE) { in checkMatch()102 bCount = (bCount + maxSame) / 2; in checkMatch()135 int newCount = bCount-bTop; in flush()[all …]
41 b[bCount++] = bStr; in addB()82 if (max > bCount) max = bCount; in checkMatch()95 bTop = bCount; in checkMatch()100 if (aCount - maxSame < EQUALSIZE || bCount - maxSame < EQUALSIZE) return; in checkMatch()103 int match = find(a, aCount - EQUALSIZE, aCount, b, maxSame, bCount); in checkMatch()110 match = find(b, bCount - EQUALSIZE, bCount, a, maxSame, aCount); in checkMatch()112 bTop = bCount - EQUALSIZE; in checkMatch()117 if (aCount >= STACKSIZE || bCount >= STACKSIZE) { in checkMatch()120 bCount = (bCount + maxSame) / 2; in checkMatch()154 int newCount = bCount - bTop; in flush()[all …]
170 static void run_concat_test(skiatest::Reporter* reporter, int aCount, int bCount) { in run_concat_test() argument178 for (int i = 0; i < bCount; ++i) { in run_concat_test()182 REPORTER_ASSERT(reporter, listA.count() == aCount && listB.count() == bCount); in run_concat_test()183 REPORTER_ASSERT(reporter, C::gInstCnt == aCount + bCount); in run_concat_test()187 REPORTER_ASSERT(reporter, listA.count() == aCount + bCount); in run_concat_test()192 REPORTER_ASSERT(reporter, C::gInstCnt == aCount + bCount); in run_concat_test()200 REPORTER_ASSERT(reporter, i == (aCount + bCount)); in run_concat_test()204 static void run_concat_trivial_test(skiatest::Reporter* reporter, int aCount, int bCount) { in run_concat_trivial_test() argument215 for (int i = 0; i < bCount; ++i) { in run_concat_trivial_test()219 REPORTER_ASSERT(reporter, listA.count() == aCount && listB.count() == bCount); in run_concat_trivial_test()[all …]
217 int bCount = TYPENAME##HashIter_getValue(&iter); \219 int count = deMax32(aCount, bCount); \220 if (bCount && !TYPENAME##_setKeyCount(a, key, aCount + bCount)) \236 int bCount = TYPENAME##_getKeyValue(b, key); \237 int count = deMin32(aCount, bCount); \264 int bCount = TYPENAME##HashIter_getValue(&iter); \265 int count = aCount + bCount; \281 int bCount = TYPENAME##_getKeyValue(b, key); \282 int count = deMax32(0, aCount - bCount); \
147 final int bCount = lblocks.length; in getAggregate() local148 data [0] += bCount; in getAggregate()150 for (int bID = 0; bID < bCount; ++ bID) in getAggregate()
174 final int bCount = lblocks.length; in getAggregate() local175 data [0] += bCount; in getAggregate()177 for (int bID = 0; bID < bCount; ++ bID) in getAggregate()
145 void initialize(@Named("b") Count bCount) { in testCreationTimeInjectionOrdering()146 value = bCount.value + 1; in testCreationTimeInjectionOrdering()
66 __u8 bCount; member
META-INF/ META-INF/MANIFEST.MF com/ com/vladium/ com/ ...