| /external/skia/src/pathops/ |
| SkPathOpsSimplify.cpp | 23 SkTDArray<SkOpSpanBase*> chase; local
33 SkOpSegment* next = current->findNextWinding(&chase, &nextStart, &nextEnd,
64 SkASSERT(!SkPathOpsDebug::ChaseContains(chase, last));
65 *chase.append() = last;
67 SkDebugf("%s chase.append id=%d", __FUNCTION__, last->segment()->debugID());
75 current = FindChase(&chase, &start, &end);
|
| SkPathOpsOp.cpp | 13 static SkOpSegment* findChaseOp(SkTDArray<SkOpSpanBase*>& chase, SkOpSpanBase** startPtr,
15 while (chase.count()) {
17 chase.pop(&span);
27 *chase.insert(0) = span;
29 *chase.append() = span;
79 // OPTIMIZATION: should this also add to the chase?
88 *chase.insert(0) = span;
90 *chase.append() = span;
109 SkTDArray<SkOpSpanBase*> chase; local
119 SkOpSegment* next = current->findNextOp(&chase, &nextStart, &nextEnd
[all...] |
| /external/tremolo/Tremolo/ |
| codebook.c | 168 long chase=0; local
171 /* chase the tree as far as it's already populated, fill in past */
174 if(chase>=top){
175 if (chase < 0 || chase >= n) return 1;
177 r[chase*2]=top;
178 r[chase*2+1]=0;
180 if (chase < 0 || chase >= n || chase*2+bit > n*2+1) return 1
650 ogg_uint32_t chase=0; local
[all...] |
| /external/mockito/src/test/java/org/mockitousage/customization/ |
| BDDMockitoTest.java | 361 police.chase(car);
365 then(police).should(inOrder).chase(car);
387 void chase(Car car) { method in class:BDDMockitoTest.Police
|
| /external/valgrind/VEX/priv/ |
| ir_opt.c | 1349 static IRExpr* chase ( IRExpr** env, IRExpr* e ) function
[all...] |
