| /external/tremolo/Tremolo/ |
| codebook.c | 162 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*2+bit > n*2+1) return 1
631 ogg_uint32_t chase=0; local
[all...] |
| dpen.s | 97 MOV r7, #0 @ r7 = chase
100 ADC r2, r6, r7, LSL #1 @ r8 = &t[chase*2+C]
106 AND r7, r7, #0x7F @ r7 = chase
112 MOV r0, r7 @ return chase
123 MOV r7, r10 @ r7 = chase=next
125 ADC r8, r6, r7 @ r8 = t+chase+bit
126 LDRB r10,[r8], -r6 @ r10= next=t[chase+bit] r8=chase+bit
139 CMP r8, r7 @ if bit==0 (chase+bit==chase) (sets C
[all...] |
| /external/chromium_org/third_party/skia/src/pathops/ |
| SkPathOpsOp.cpp | 12 static SkOpSegment* findChaseOp(SkTDArray<SkOpSpan*>& chase, int* tIndex, int* endIndex) {
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, &nextStart, &nextEnd
[all...] |
| SkPathOpsCommon.h | 17 // FIXME: find chase uses insert, so it can't be converted to SkTArray yet
18 SkOpSegment* FindChase(SkTDArray<SkOpSpan*>* chase, int* tIndex, int* endIndex);
|
| SkPathOpsSimplify.cpp | 37 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);
|
| SkPathOpsDebug.h | 198 void Dump(const SkTDArray<SkOpSpan* >& chase);
199 void Dump(const SkTDArray<SkOpSpan* >* chase);
|
| SkPathOpsCommon.cpp | 137 SkOpSegment* FindChase(SkTDArray<SkOpSpan*>* chase, int* tIndex, int* endIndex) {
138 while (chase->count()) {
140 chase->pop(&span);
152 *chase->insert(0) = span;
154 *chase->append() = span;
215 *chase->insert(0) = span;
|
| SkOpSegment.h | 316 SkOpSegment* findNextOp(SkTDArray<SkOpSpan*>* chase, int* nextStart, int* nextEnd,
318 SkOpSegment* findNextWinding(SkTDArray<SkOpSpan*>* chase, int* nextStart, int* nextEnd,
|
| SkOpSegment.cpp | [all...] |
| /external/skia/src/pathops/ |
| SkPathOpsOp.cpp | 12 static SkOpSegment* findChaseOp(SkTDArray<SkOpSpan*>& chase, int* tIndex, int* endIndex) {
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, &nextStart, &nextEnd
[all...] |
| SkPathOpsCommon.h | 17 // FIXME: find chase uses insert, so it can't be converted to SkTArray yet
18 SkOpSegment* FindChase(SkTDArray<SkOpSpan*>* chase, int* tIndex, int* endIndex);
|
| SkPathOpsSimplify.cpp | 37 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);
|
| SkPathOpsDebug.h | 197 void Dump(const SkTDArray<SkOpSpan* >& chase);
198 void Dump(const SkTDArray<SkOpSpan* >* chase);
|
| SkPathOpsCommon.cpp | 137 SkOpSegment* FindChase(SkTDArray<SkOpSpan*>* chase, int* tIndex, int* endIndex) {
138 while (chase->count()) {
140 chase->pop(&span);
152 *chase->insert(0) = span;
154 *chase->append() = span;
215 *chase->insert(0) = span;
|
| SkOpSegment.h | 314 SkOpSegment* findNextOp(SkTDArray<SkOpSpan*>* chase, int* nextStart, int* nextEnd,
316 SkOpSegment* findNextWinding(SkTDArray<SkOpSpan*>* chase, int* nextStart, int* nextEnd,
|
| SkOpSegment.cpp | [all...] |
| /external/chromium_org/third_party/skia/experimental/Intersection/ |
| ShapeOps.cpp | 16 // FIXME: this and find chase should be merge together, along with
20 static Segment* findChaseOp(SkTDArray<Span*>& chase, int& nextStart, int& nextEnd) {
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;
|
| Simplify.cpp | [all...] |
| /external/skia/experimental/Intersection/ |
| ShapeOps.cpp | 16 // FIXME: this and find chase should be merge together, along with
20 static Segment* findChaseOp(SkTDArray<Span*>& chase, int& nextStart, int& nextEnd) {
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;
|
| Simplify.cpp | [all...] |
| /external/skia/tests/ |
| PathOpsDebug.cpp | 608 void Dump(const SkTDArray<SkOpSpan *>& chase) {
609 SkPathOpsDebug::DumpSpans(chase);
612 void Dump(const SkTDArray<SkOpSpan *>* chase) {
613 SkPathOpsDebug::DumpSpans(*chase);
|
| /external/chromium_org/third_party/skia/tests/ |
| PathOpsDebug.cpp | 740 void Dump(const SkTDArray<SkOpSpan *>& chase) {
741 SkPathOpsDebug::DumpSpans(chase);
744 void Dump(const SkTDArray<SkOpSpan *>* chase) {
745 SkPathOpsDebug::DumpSpans(*chase);
|
| /external/valgrind/main/none/tests/ |
| cmdline2.stdout.exp | 151 --vex-guest-chase-thresh=<0..99> [10]
152 --vex-guest-chase-cond=no|yes [no]
|
| /external/chromium_org/sdch/open-vcdiff/ |
| ltmain.sh | [all...] |
| /external/chromium_org/third_party/libxml/src/ |
| ltmain.sh | [all...] |
