| /external/skia/src/core/ |
| SkAlphaRuns.cpp | 32 void SkAlphaRuns::Break(int16_t runs[], uint8_t alpha[], int x, int count)
36 // SkAlphaRuns::BreakAt(runs, alpha, x);
37 // SkAlphaRuns::BreakAt(&runs[x], &alpha[x], count);
39 int16_t* next_runs = runs + x;
44 int n = runs[0];
50 runs[0] = SkToS16(x);
51 runs[x] = SkToS16(n - x);
54 runs += n;
59 runs = next_runs;
65 int n = runs[0]
89 int16_t* runs = fRuns; local
138 const int16_t* runs = fRuns; local
151 const int16_t* runs = fRuns; local
173 const int16_t* runs = fRuns; local
[all...] |
| SkRegion.cpp | 28 static SkRegion::RunType* skip_scanline(const SkRegion::RunType runs[])
30 while (runs[0] != SkRegion::kRunTypeSentinel)
32 SkASSERT(runs[0] < runs[1]); // valid span
33 runs += 2;
35 return (SkRegion::RunType*)(runs + 1); // return past the X-sentinel
38 static SkRegion::RunType* find_y(const SkRegion::RunType runs[], int y)
40 int top = *runs++;
45 int bot = *runs++;
48 if (bot == SkRegion::kRunTypeSentinel || *runs == SkRegion::kRunTypeSentinel
[all...] |
| SkAntiRun.h | 108 int16_t runs[2];
109 runs[0] = 1;
110 runs[1] = 0;
114 blitter->blitAntiH(x, y, &fStartAlpha, runs);
123 blitter->blitAntiH(x, y, &fStopAlpha, runs);
158 static void Break(int16_t runs[], uint8_t alpha[], int x, int count);
159 static void BreakAt(int16_t runs[], uint8_t alpha[], int x)
163 int n = runs[0];
169 runs[0] = SkToS16(x);
170 runs[x] = SkToS16(n - x)
[all...] |
| /dalvik/dx/tests/040-dex-constructor/ |
| info.txt | 2 conversion runs without failure, though the contents of the converted
|
| /dalvik/libcore/security/src/main/java/org/bouncycastle/i18n/filter/ |
| Filter.java | 8 * Runs the filter on the input String and returns the filtered String
|
| /external/openssl/crypto/rand/ |
| randtest.c | 74 unsigned long runs[2][34]; local
88 for (i=0; i<34; i++) runs[0][i]=runs[1][i]=0;
110 runs[sign][nsign-1]++;
112 runs[sign][5]++;
123 if (nsign != 0) runs[sign][nsign-1]++;
159 if (!((2267 < runs[i][0]) && (runs[i][0] < 2733)))
162 i,1,runs[i][0]);
165 if (!((1079 < runs[i][1]) && (runs[i][1] < 1421))
[all...] |
| /external/icu4c/common/ |
| ubidiln.c | 46 * The implementation of the access to same-level-runs and of the reordering
52 * same-level-runs is created. Reordering then is done on this vector.
57 * This is inefficient if there are many very short runs. If the average run
153 pLineBiDi->runs=NULL;
316 /* this is done based on runs rather than on levels since levels have
320 iRun=pBiDi->runs[0];
323 iRun = pBiDi->runs[i];
347 /* runs API functions ------------------------------------------------------- */
373 start=pBiDi->runs[runIndex].logicalStart;
379 *pLength=pBiDi->runs[runIndex].visualLimit
436 Run *runs, tempRun; local
519 Run *runs=pBiDi->runs; local
598 Run *runs; local
893 Run *runs=pBiDi->runs; local
920 Run *runs=pBiDi->runs; local
940 Run *runs=pBiDi->runs; local
985 Run *runs; local
1121 Run *runs=pBiDi->runs; local
1220 Run *runs=pBiDi->runs, *runsLimit=runs+pBiDi->runCount; local
[all...] |
| /external/qemu/android/skin/ |
| region.c | 86 return r->runs == RUNS_EMPTY;
92 return r->runs == RUNS_RECT;
98 return r->runs != RUNS_EMPTY && r->runs != RUNS_RECT;
101 /** RunStore: ref-counted storage for runs
161 runstore_from_runs( Run* runs )
163 RASSERT(runs != RUNS_EMPTY);
164 RASSERT(runs != RUNS_RECT);
165 return (RunStore*)runs - 1;
182 s = runstore_from_runs(r->runs);
485 Run* runs; local
562 Run* runs = runs_find_y( r->runs, y ); local
763 Run* runs; member in struct:__anon4158
811 Run* runs = o->runs_base; local
[all...] |
| /dalvik/dx/src/junit/framework/ |
| Test.java | 14 * Runs a test and collects its result in a TestResult instance.
|
| /dalvik/dx/tests/035-dex-instance-var/ |
| info.txt | 2 conversion runs without failure, though the contents of the converted
|
| /dalvik/dx/tests/036-dex-static-var/ |
| info.txt | 2 conversion runs without failure, though the contents of the converted
|
| /dalvik/dx/tests/037-dex-static-final-var/ |
| info.txt | 2 conversion runs without failure, though the contents of the converted
|
| /dalvik/dx/tests/038-dex-instance-method/ |
| info.txt | 2 conversion runs without failure, though the contents of the converted
|
| /dalvik/dx/tests/039-dex-static-method/ |
| info.txt | 2 conversion runs without failure, though the contents of the converted
|
| /dalvik/dx/tests/041-dex-abstract-method/ |
| info.txt | 2 conversion runs without failure, though the contents of the converted
|
| /dalvik/dx/tests/042-dex-ignore-result/ |
| info.txt | 2 conversion runs without failure, though the contents of the converted
|
| /dalvik/dx/tests/043-dex-two-classes/ |
| info.txt | 2 conversion runs without failure, though the contents of the converted
|
| /dalvik/dx/tests/089-dex-define-object/ |
| info.txt | 3 runs without failure, though the contents of the converted file are
|
| /dalvik/dx/tests/092-ssa-cfg-edge-cases/ |
| info.txt | 1 This test case runs a few odd control flow graphs through the optimizer.
|
| /dalvik/libcore/junit/src/main/java/junit/framework/ |
| Test.java | 14 * Runs a test and collects its result in a TestResult instance.
|
| /dalvik/tests/057-iteration-performance/ |
| expected.txt | 9 Done with runs.
|
| /external/junit/src/junit/framework/ |
| Test.java | 14 * Runs a test and collects its result in a TestResult instance.
|
| /dalvik/dx/tests/088-ssa-combine-blocks/ |
| info.txt | 1 This is a test case for the identical-block combining algorithm, which runs after the SSA optimizer to recombine identical blocks (usually exception handlers) created during edge-splitting.
|
| /external/icu4c/test/intltest/ |
| tfsmalls.h | 18 * runs tests in 4 local routines,
|
| /external/icu4c/tools/genprops/misc/ |
| ucdstrip.pl | 6 # The Perl option -p above runs a while(<>) loop and prints the expression output.
|
