Searched defs:chase (Results 1 - 12 of 12) sorted by relevance

/external/chromium_org/third_party/skia/src/pathops/
H A DSkPathOpsSimplify.cpp37 SkTDArray<SkOpSpan*> chase; local
47 SkOpSegment* next = current->findNextWinding(&chase, &nextStart, &nextEnd,
82 SkASSERT(!SkPathOpsDebug::ChaseContains(chase, last));
84 *chase.append() = last;
86 SkDebugf("%s chase.append id=%d windSum=%d small=%d\n", __FUNCTION__,
92 current = FindChase(&chase, &index, &endIndex);
H A DSkPathOpsOp.cpp12 static SkOpSegment* findChaseOp(SkTDArray<SkOpSpan*>& chase, int* tIndex, int* endIndex) { argument
13 while (chase.count()) {
15 chase.pop(&span);
30 *chase.insert(0) = span;
32 *chase.append() = span;
76 // OPTIMIZATION: should this also add to the chase?
83 *chase.insert(0) = span;
85 *chase.append() = span;
154 SkTDArray<SkOpSpan*> chase; local
164 SkOpSegment* next = current->findNextOp(&chase,
[all...]
H A DSkPathOpsCommon.cpp137 SkOpSegment* FindChase(SkTDArray<SkOpSpan*>* chase, int* tIndex, int* endIndex) { argument
138 while (chase->count()) {
140 chase->pop(&span);
152 *chase->insert(0) = span;
154 *chase->append() = span;
215 *chase->insert(0) = span;
/external/skia/src/pathops/
H A DSkPathOpsSimplify.cpp37 SkTDArray<SkOpSpan*> chase; local
47 SkOpSegment* next = current->findNextWinding(&chase, &nextStart, &nextEnd,
82 SkASSERT(!SkPathOpsDebug::ChaseContains(chase, last));
84 *chase.append() = last;
86 SkDebugf("%s chase.append id=%d windSum=%d small=%d\n", __FUNCTION__,
92 current = FindChase(&chase, &index, &endIndex);
H A DSkPathOpsOp.cpp12 static SkOpSegment* findChaseOp(SkTDArray<SkOpSpan*>& chase, int* tIndex, int* endIndex) { argument
13 while (chase.count()) {
15 chase.pop(&span);
30 *chase.insert(0) = span;
32 *chase.append() = span;
76 // OPTIMIZATION: should this also add to the chase?
83 *chase.insert(0) = span;
85 *chase.append() = span;
154 SkTDArray<SkOpSpan*> chase; local
164 SkOpSegment* next = current->findNextOp(&chase,
[all...]
H A DSkPathOpsCommon.cpp137 SkOpSegment* FindChase(SkTDArray<SkOpSpan*>* chase, int* tIndex, int* endIndex) { argument
138 while (chase->count()) {
140 chase->pop(&span);
152 *chase->insert(0) = span;
154 *chase->append() = span;
215 *chase->insert(0) = span;
/external/chromium_org/third_party/skia/experimental/Intersection/
H A DShapeOps.cpp16 // FIXME: this and find chase should be merge together, along with
20 static Segment* findChaseOp(SkTDArray<Span*>& chase, int& nextStart, int& nextEnd) { argument
21 while (chase.count()) {
23 chase.pop(&span);
34 *chase.insert(0) = span;
36 *chase.append() = span;
94 *chase.insert(0) = span;
96 *chase.append() = span;
/external/skia/experimental/Intersection/
H A DShapeOps.cpp16 // FIXME: this and find chase should be merge together, along with
20 static Segment* findChaseOp(SkTDArray<Span*>& chase, int& nextStart, int& nextEnd) { argument
21 while (chase.count()) {
23 chase.pop(&span);
34 *chase.insert(0) = span;
36 *chase.append() = span;
94 *chase.insert(0) = span;
96 *chase.append() = span;
/external/tremolo/Tremolo/
H A Dcodebook.c162 long chase=0; local
165 /* chase the tree as far as it's already populated, fill in past */
168 if(chase>=top){
169 if (chase < 0 || chase >= n) return 1;
171 r[chase*2]=top;
172 r[chase*2+1]=0;
174 if (chase < 0 || chase >= n || chase*
631 ogg_uint32_t chase=0; local
[all...]
/external/skia/tests/
H A DPathOpsDebug.cpp608 void Dump(const SkTDArray<SkOpSpan *>& chase) { argument
609 SkPathOpsDebug::DumpSpans(chase);
612 void Dump(const SkTDArray<SkOpSpan *>* chase) { argument
613 SkPathOpsDebug::DumpSpans(*chase);
/external/chromium_org/third_party/skia/tests/
H A DPathOpsDebug.cpp740 void Dump(const SkTDArray<SkOpSpan *>& chase) { argument
741 SkPathOpsDebug::DumpSpans(chase);
744 void Dump(const SkTDArray<SkOpSpan *>* chase) { argument
745 SkPathOpsDebug::DumpSpans(*chase);
/external/valgrind/main/VEX/priv/
H A Dir_opt.c1335 static IRExpr* chase ( IRExpr** env, IRExpr* e ) function
1341 if (0) { vex_printf("chase "); ppIRExpr(e); vex_printf("\n"); }
2263 IRExpr* a1 = chase(env, e->Iex.Binop.arg1);

Completed in 6839 milliseconds