/external/openssl/crypto/rand/ |
H A D | 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[ [all...] |
/external/skia/src/core/ |
H A D | SkAlphaRuns.cpp | 35 void SkAlphaRuns::Break(int16_t runs[], uint8_t alpha[], int x, int count) { argument 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[ 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...] |
H A D | 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) { argument 50 int n = runs[0]; 55 runs[0] = SkToS16(x); 56 runs[x] = SkToS16(n - x); 59 runs += n;
|
H A D | SkRegion.cpp | 32 static SkRegion::RunType* skip_scanline(const SkRegion::RunType runs[]) argument 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[ [all...] |
H A D | 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[]) {} 38 blitAntiH(int x, int y, const SkAlpha antialias[], const int16_t runs[]) argument 217 blitAntiH(int x, int y, const SkAlpha antialias[], const int16_t runs[]) argument 232 compute_anti_width(const int16_t runs[]) argument 280 blitAntiH(int left, int y, const SkAlpha aa[], const int16_t runs[]) argument [all...] |
H A D | 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_RESTRIC 880 count_nonzero_span(const int16_t runs[], const SkAlpha aa[]) argument [all...] |
H A D | SkSpriteBlitter.h | 37 virtual void blitAntiH(int x, int y, const SkAlpha antialias[], const int16_t runs[]);
|
H A D | 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; 178 blitAntiH(int x, int y, const SkAlpha antialias[], const int16_t runs[]) argument 455 blitAntiH(int x, int y, const SkAlpha antialias[], const int16_t runs[]) argument 530 blitAntiH(int x, int y, const SkAlpha antialias[], const int16_t runs[]) argument [all...] |
H A D | 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[]);
|
H A D | SkScan_Antihair.cpp | 80 int16_t runs[HLINE_STACK_BUFFER + 1]; local 89 runs[0] = SkToS16(n); 90 runs[n] = 0; 91 blitter->blitAntiH(x, y, aa, runs); 128 int16_t runs[2]; 131 runs[0] = 1; 132 runs[1] = 0; 141 blitter->blitAntiH(x, lower_y, aa, runs); 142 // the clipping blitters might edit runs, but should not affect us 143 SkASSERT(runs[ [all...] |
H A D | SkBlitBWMaskTemplate.h | 106 int runs = full_runs; local 115 while (--runs >= 0)
|
H A D | 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;
|
H A D | SkBlitter_Sprite.cpp | 43 const int16_t runs[]) { 42 blitAntiH(int x, int y, const SkAlpha antialias[], const int16_t runs[]) argument
|
/external/icu4c/common/ |
H A D | 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[runInde 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/ |
H A D | 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); 201 runs_find_y( Run* runs, int y ) argument 220 runs_set_rect( Run* runs, SkinRect* rect ) argument 485 Run* runs; local 562 Run* runs = runs_find_y( r->runs, y ); local 763 Run* runs; member in struct:__anon7995 811 Run* runs = o->runs_base; local [all...] |
/external/opencv/cvaux/src/ |
H A D | 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_inde 87 icvFindRunsInOneImage( int numLines, uchar * prewarp, int *line_lens, int *runs, int *num_runs ) argument [all...] |
/external/chromium/chrome/browser/ui/views/autocomplete/ |
H A D | 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); 366 for (Runs::iterator i(runs 412 Elide(Runs* runs, int remaining_width) const argument [all...] |
/external/srtp/crypto/math/ |
H A D | 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[stat 207 uint16_t runs[6] = { 0, 0, 0, 0, 0, 0 }; local [all...] |
/external/chromium/base/i18n/ |
H A D | 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/ |
H A D | vcpu_fbench.stdout.exp | 7 adjust iteration count so the benchmark runs about five minutes.
|
/external/webkit/PerformanceTests/SunSpider/tests/sunspider-0.9/ |
H A D | math-cordic.js | 83 function cordic( runs ) { 86 for ( var i = 0 ; i < runs ; i++ ) {
|
/external/webkit/PerformanceTests/SunSpider/tests/sunspider-0.9.1/ |
H A D | math-cordic.js | 83 function cordic( runs ) { 86 for ( var i = 0 ; i < runs ; i++ ) {
|
/external/skia/include/core/ |
H A D | 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[]);
|
H A D | SkRegion.h | 343 * Returns the sequence of runs that make up this region for the specified 380 SkDEBUGCODE(bool debugSetRuns(const RunType runs[], int count);) 392 void allocateRuns(int count); // allocate space for count runs 401 bool setRuns(RunType runs[], int count); 406 RunType runs[kRectRegionRuns]); 407 // returns true if runs are just a rect 408 static bool ComputeRunBounds(const RunType runs[], int count,
|
/external/v8/benchmarks/ |
H A D | base.js | 210 data.runs += n; 219 return { runs: 0, elapsed: 0 }; 223 if (data.runs < 32) return data; 224 var usec = (data.elapsed * 1000) / data.runs;
|