| /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 | 35 void SkAlphaRuns::Break(int16_t runs[], uint8_t alpha[], int x, int count) {
38 // SkAlphaRuns::BreakAt(runs, alpha, x);
39 // SkAlphaRuns::BreakAt(&runs[x], &alpha[x], count);
41 int16_t* next_runs = runs + x;
45 int n = runs[0];
50 runs[0] = SkToS16(x);
51 runs[x] = SkToS16(n - x);
54 runs += n;
59 runs = next_runs;
64 int n = runs[0]
89 int16_t* runs = fRuns + offsetX; local
144 const int16_t* runs = fRuns; local
155 const int16_t* runs = fRuns; local
176 const int16_t* runs = fRuns; local
[all...] |
| SkAntiRun.h | 46 static void Break(int16_t runs[], uint8_t alpha[], int x, int count);
48 static void BreakAt(int16_t runs[], uint8_t alpha[], int x) {
50 int n = runs[0];
55 runs[0] = SkToS16(x);
56 runs[x] = SkToS16(n - x);
59 runs += n;
|
| SkRegion.cpp | 32 static SkRegion::RunType* skip_scanline(const SkRegion::RunType runs[])
34 while (runs[0] != SkRegion::kRunTypeSentinel)
36 SkASSERT(runs[0] < runs[1]); // valid span
37 runs += 2;
39 return (SkRegion::RunType*)(runs + 1); // return past the X-sentinel
42 // returns true if runs are just a rect
43 bool SkRegion::ComputeRunBounds(const SkRegion::RunType runs[], int count, SkIRect* bounds)
45 assert_sentinel(runs[0], false); // top
49 assert_sentinel(runs[1], false); // botto
[all...] |
| SkBlitter.cpp | 39 const int16_t runs[]) {
47 int16_t runs[2]; local
48 runs[0] = 1;
49 runs[1] = 0;
52 this->blitAntiH(x, y++, &alpha, runs);
161 int16_t* runs = runStorage.get(); local
164 sk_memset16((uint16_t*)runs, 1, width);
165 runs[width] = 0;
170 this->blitAntiH(clip.fLeft, y, aa, runs);
218 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[]);
133 virtual void blitAntiH(int x, int y, const SkAlpha antialias[], const int16_t runs[]);
144 virtual void blitAntiH(int x, int y, const SkAlpha antialias[], const int16_t runs[]);
|
| 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 | 179 const int16_t runs[]) {
189 int count = runs[0];
203 runs += count;
456 const int16_t runs[]) {
461 int count = runs[0];
480 runs += count;
531 const int16_t runs[]) {
540 int count = *runs;
556 runs += count;
562 int count = *runs;
[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
894 Run *runs=pBiDi->runs; local
921 Run *runs=pBiDi->runs; local
941 Run *runs=pBiDi->runs; local
986 Run *runs; local
1122 Run *runs=pBiDi->runs; local
1221 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:__anon9473
811 Run* runs = o->runs_base; local
[all...] |
| /external/opencv/cvaux/src/ |
| cvprewarp.cpp | 52 int *runs_1, /* result runs 1 */
53 int *runs_2, /* result runs 2 */
54 int *num_runs_1, /* numbers of first runs */
90 int *runs, /* result runs */
111 runs[run_index++] = 0;
112 runs[run_index++] = curr_color;
124 runs[run_index++] = index;
125 runs[run_index++] = color;
133 runs[run_index++] = index
[all...] |
| /external/chromium/chrome/browser/ui/views/autocomplete/ |
| autocomplete_result_view.cc | 287 // Split the text into visual runs. We do this first so that we don't need to
295 Runs runs; local
300 // HEBREW is text in the Hebrew language) has two runs: "Google in " which
305 // runs is different depending on the locale direction.
310 runs.push_back(RunData());
311 RunData* current_run = &runs.back();
352 DCHECK(!runs.empty());
355 std::sort(runs.begin(), runs.end(), &SortRunsLogically)
[all...] |
| /libcore/luni/src/main/java/java/text/ |
| Bidi.java | 33 * <p>If the text contains multiple runs, the information of each run can be
35 * direction of the text as well as the nesting level. Left-to-right runs have
36 * even levels while right-to-left runs have odd levels.
332 runs = null;
334 runs = null;
336 runs = ubidi_getRuns(pBidi);
339 if (runCount == 1 && runs[0].getLevel() == baseLevel) {
341 runs = null;
354 private Run[] runs; field in class:Bidi
417 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[]);
|
| /external/srtp/crypto/math/ |
| stat.c | 76 * runs[i] holds the number of runs of size (i-1)
82 uint16_t runs[6] = { 0, 0, 0, 0, 0, 0 }; local
107 /* check for long runs */
109 debug_print(mod_stat, ">25 runs: %d", state);
118 return err_status_algo_fail; /* long-runs test failed */
137 debug_print(mod_stat, ">25 runs (2): %d", state);
138 return err_status_algo_fail; /* long-runs test failed */
141 state = 6; /* group together runs > 5 */
143 runs[state-1]++; /* increment run count *
207 uint16_t runs[6] = { 0, 0, 0, 0, 0, 0 }; local
[all...] |
| /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/chromium/base/i18n/ |
| bidi_line_iterator.cc | 41 const int runs = ubidi_countRuns(bidi_, &error); local
42 return U_SUCCESS(error) ? runs : 0;
|
| /external/valgrind/main/memcheck/tests/ |
| vcpu_fbench.stdout.exp | 7 adjust iteration count so the benchmark runs about five minutes.
|
| /external/webkit/PerformanceTests/SunSpider/tests/sunspider-0.9/ |
| math-cordic.js | 83 function cordic( runs ) {
86 for ( var i = 0 ; i < runs ; i++ ) {
|
| /external/webkit/PerformanceTests/SunSpider/tests/sunspider-0.9.1/ |
| math-cordic.js | 83 function cordic( runs ) {
86 for ( var i = 0 ; i < runs ; i++ ) {
|
| /frameworks/base/core/java/android/text/ |
| TextLine.java | 205 int[] runs = mDirections.mDirections; local
208 int lastRunIndex = runs.length - 2;
209 for (int i = 0; i < runs.length; i += 2) {
210 int runStart = runs[i];
211 int runLimit = runStart + (runs[i+1] & Layout.RUN_LENGTH_MASK);
215 boolean runIsRtl = (runs[i+1] & Layout.RUN_RTL_FLAG) != 0;
303 int[] runs = mDirections.mDirections; local
304 for (int i = 0; i < runs.length; i += 2) {
305 int runStart = runs[i];
306 int runLimit = runStart + (runs[i+1] & Layout.RUN_LENGTH_MASK)
[all...] |
