| /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/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...] |
| SkBlitter.cpp | 40 void SkBlitter::blitAntiH(int x, int y, const SkAlpha antialias[], const int16_t runs[])
51 int16_t runs[2]; local
52 runs[0] = 1;
53 runs[1] = 0;
56 this->blitAntiH(x, y++, &alpha, runs);
181 int16_t* runs = runStorage.get(); local
184 sk_memset16((uint16_t*)runs, 1, width);
185 runs[width] = 0;
191 this->blitAntiH(clip.fLeft, y, aa, runs);
241 void SkNullBlitter::blitAntiH(int x, int y, const SkAlpha antialias[], const int16_t runs[])
[all...] |
| SkCoreBlitters.h | 57 virtual void blitAntiH(int x, int y, const SkAlpha antialias[], const int16_t runs[]);
77 virtual void blitAntiH(int x, int y, const SkAlpha antialias[], const int16_t runs[]);
97 virtual void blitAntiH(int x, int y, const SkAlpha antialias[], const int16_t runs[]);
130 virtual void blitAntiH(int x, int y, const SkAlpha antialias[], const int16_t runs[]);
141 virtual void blitAntiH(int x, int y, const SkAlpha antialias[], const int16_t runs[]);
|
| SkScan_Antihair.cpp | 83 int16_t runs[HLINE_STACK_BUFFER + 1]; local
92 runs[0] = SkToS16(n);
93 runs[n] = 0;
94 blitter->blitAntiH(x, y, aa, runs);
131 int16_t runs[2];
134 runs[0] = 1;
135 runs[1] = 0;
145 blitter->blitAntiH(x, lower_y, aa, runs);
146 // the clipping blitters might edit runs, but should not affect us
147 SkASSERT(runs[0] == 1)
[all...] |
| SkBlitter_RGB16.cpp | 66 virtual void blitAntiH(int x, int y, const SkAlpha antialias[], const int16_t runs[]);
91 virtual void blitAntiH(int x, int y, const SkAlpha antialias[], const int16_t runs[]);
105 virtual void blitAntiH(int x, int y, const SkAlpha antialias[], const int16_t runs[]);
117 virtual void blitAntiH(int x, int y, const SkAlpha antialias[], const int16_t runs[]);
137 virtual void blitAntiH(int x, int y, const SkAlpha antialias[], const int16_t runs[]);
149 virtual void blitAntiH(int x, int y, const SkAlpha antialias[], const int16_t runs[]);
238 const int16_t* SK_RESTRICT runs)
243 int count = runs[0];
248 runs += count;
301 const int16_t* SK_RESTRICT runs) SK_RESTRICT
[all...] |
| SkSpriteBlitter.h | 37 virtual void blitAntiH(int x, int y, const SkAlpha antialias[], const int16_t runs[]);
|
| SkBlitter_ARGB32.cpp | 76 const int16_t runs[]) {
86 int count = runs[0];
100 runs += count;
365 const int16_t runs[]) {
370 int count = runs[0];
389 runs += count;
440 const int16_t runs[]) {
449 int count = *runs;
465 runs += count;
471 int count = *runs;
[all...] |
| SkBlitBWMaskTemplate.h | 106 int runs = full_runs; local
115 while (--runs >= 0)
|
| SkRegion_path.cpp | 42 void copyToRgn(SkRegion::RunType runs[]) const;
190 void SkRgnBuilder::copyToRgn(SkRegion::RunType runs[]) const {
197 *runs++ = fTop;
199 *runs++ = (SkRegion::RunType)(line->fLastY + 1);
202 memcpy(runs, line->firstX(), count * sizeof(SkRegion::RunType));
203 runs += count;
205 *runs++ = SkRegion::kRunTypeSentinel;
209 *runs = SkRegion::kRunTypeSentinel;
|
| SkBlitter_Sprite.cpp | 46 void SkSpriteBlitter::blitAntiH(int x, int y, const SkAlpha antialias[], const int16_t runs[])
|
| /external/chromium/third_party/icu/source/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/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:__anon5732
811 Run* runs = o->runs_base; local
[all...] |
| /libcore/luni/src/main/java/java/text/ |
| Bidi.java | 37 * If the text contains multiple runs, the information of each run can be
39 * direction of the text as well as the nesting level. Left-to-right runs have
40 * even levels while right-to-left runs have odd levels.
309 runs = null;
311 runs = null;
313 runs = NativeBidi.ubidi_getRuns(pBidi);
316 if (runCount == 1 && runs[0].getLevel() == baseLevel) {
318 runs = null;
331 private BidiRun[] runs; field in class:Bidi
394 result.runs = null
[all...] |
| /external/skia/include/core/ |
| SkBlitter.h | 33 virtual void blitAntiH(int x, int y, const SkAlpha[], const int16_t runs[]);
75 virtual void blitAntiH(int x, int y, const SkAlpha[], const int16_t runs[]);
96 virtual void blitAntiH(int x, int y, const SkAlpha[], const int16_t runs[]);
121 virtual void blitAntiH(int x, int y, const SkAlpha[], const int16_t runs[]);
|
| SkRegion.h | 284 /** Returns the sequence of runs that make up this region for the specified
312 SkDEBUGCODE(bool debugSetRuns(const RunType runs[], int count);)
324 void allocateRuns(int count); // allocate space for count runs
333 bool setRuns(RunType runs[], int count);
338 RunType runs[kRectRegionRuns]);
339 // returns true if runs are just a rect
340 static bool ComputeRunBounds(const RunType runs[], int count,
|
| /bionic/libc/arch-arm/bionic/ |
| crtbegin_dynamic.S | 35 # runs.
49 # by the dynamic linker before this code runs
|
| crtbegin_static.S | 35 # runs.
49 # by the dynamic linker before this code runs
|
| /bionic/libc/arch-sh/bionic/ |
| crtbegin_static.S | 35 # runs.
49 # by the dynamic linker before this code runs
|
| crtbegin_dynamic.S | 35 # runs.
49 # by the dynamic linker before this code runs
|
| /external/webkit/SunSpider/tests/sunspider-0.9/ |
| math-cordic.js | 83 function cordic( runs ) {
86 for ( var i = 0 ; i < runs ; i++ ) {
|
| /external/webkit/SunSpider/tests/sunspider-0.9.1/ |
| math-cordic.js | 83 function cordic( runs ) {
86 for ( var i = 0 ; i < runs ; i++ ) {
|
