/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/legacy/src/core/ |
H A D | SkAlphaRuns.cpp | 27 void SkAlphaRuns::Break(int16_t runs[], uint8_t alpha[], int x, int count) { argument 30 // SkAlphaRuns::BreakAt(runs, alpha, x); 31 // SkAlphaRuns::BreakAt(&runs[x], &alpha[x], count); 33 int16_t* next_runs = runs + x; 37 int n = runs[0]; 42 runs[0] = SkToS16(x); 43 runs[x] = SkToS16(n - x); 46 runs += n; 51 runs = next_runs; 56 int n = runs[ 81 int16_t* runs = fRuns + offsetX; local 136 const int16_t* runs = fRuns; local 147 const int16_t* runs = fRuns; local 168 const int16_t* runs = fRuns; local [all...] |
H A D | SkAntiRun.h | 55 * Break the runs in the buffer at offsets x and x+count, properly 56 * updating the runs to the right and left. 59 * Allows add() to sum another run to some of the new sub-runs. 62 static void Break(int16_t runs[], uint8_t alpha[], int x, int count); 65 * Cut (at offset x in the buffer) a run into two shorter runs with 70 static void BreakAt(int16_t runs[], uint8_t alpha[], int x) { argument 72 int n = runs[0]; 77 runs[0] = SkToS16(x); 78 runs[x] = SkToS16(n - x); 81 runs [all...] |
H A D | SkRegion.cpp | 20 static SkRegion::RunType* skip_scanline(const SkRegion::RunType runs[]) argument 22 while (runs[0] != SkRegion::kRunTypeSentinel) 24 SkASSERT(runs[0] < runs[1]); // valid span 25 runs += 2; 27 return (SkRegion::RunType*)(runs + 1); // return past the X-sentinel 30 // returns true if runs are just a rect 31 bool SkRegion::ComputeRunBounds(const SkRegion::RunType runs[], int count, SkIRect* bounds) 33 assert_sentinel(runs[0], false); // top 37 assert_sentinel(runs[ [all...] |
H A D | SkBlitter.cpp | 31 const int16_t runs[]) { 39 int16_t runs[2]; local 40 runs[0] = 1; 41 runs[1] = 0; 44 this->blitAntiH(x, y++, &alpha, runs); 167 int16_t* runs = runStorage.get(); local 170 sk_memset16((uint16_t*)runs, 1, width); 171 runs[width] = 0; 176 this->blitAntiH(clip.fLeft, y, aa, runs); 224 const int16_t runs[]) {} 30 blitAntiH(int x, int y, const SkAlpha antialias[], const int16_t runs[]) argument 223 blitAntiH(int x, int y, const SkAlpha antialias[], const int16_t runs[]) argument 238 compute_anti_width(const int16_t runs[]) argument 284 blitAntiH(int left, int y, const SkAlpha aa[], const int16_t runs[]) argument [all...] |
H A D | SkBlitter_ARGB32.cpp | 79 const int16_t runs[]) { 89 int count = runs[0]; 103 runs += count; 229 const int16_t runs[]) { 234 int count = runs[0]; 253 runs += count; 302 const int16_t runs[]) { 311 int count = *runs; 327 runs += count; 333 int count = *runs; 78 blitAntiH(int x, int y, const SkAlpha antialias[], const int16_t runs[]) argument 228 blitAntiH(int x, int y, const SkAlpha antialias[], const int16_t runs[]) argument 301 blitAntiH(int x, int y, const SkAlpha antialias[], const int16_t runs[]) argument [all...] |
H A D | SkBlitter_RGB16.cpp | 59 const int16_t* runs); 86 const int16_t* runs); 102 const int16_t* runs); 115 const int16_t* runs); 136 const int16_t* runs); 149 const int16_t* runs); 237 const int16_t* SK_RESTRICT runs) { 241 int count = runs[0]; 246 runs += count; 299 const int16_t* SK_RESTRICT runs) { 235 blitAntiH(int x, int y, const SkAlpha* SK_RESTRICT antialias, const int16_t* SK_RESTRICT runs) argument 297 blitAntiH(int x, int y, const SkAlpha* SK_RESTRICT antialias, const int16_t* SK_RESTRICT runs) argument 582 blitAntiH(int x, int y, const SkAlpha* SK_RESTRICT antialias, const int16_t* SK_RESTRICT runs) argument 759 blitAntiH(int x, int y, const SkAlpha* SK_RESTRICT antialias, const int16_t* SK_RESTRICT runs) argument 877 count_nonzero_span(const int16_t runs[], const SkAlpha aa[]) argument 891 blitAntiH(int x, int y, const SkAlpha* SK_RESTRICT antialias, const int16_t* SK_RESTRICT runs) argument 968 blitAntiH(int x, int y, const SkAlpha* SK_RESTRICT antialias, const int16_t* SK_RESTRICT runs) argument [all...] |
/external/skia/src/core/ |
H A D | SkAlphaRuns.cpp | 27 void SkAlphaRuns::Break(int16_t runs[], uint8_t alpha[], int x, int count) { argument 30 // SkAlphaRuns::BreakAt(runs, alpha, x); 31 // SkAlphaRuns::BreakAt(&runs[x], &alpha[x], count); 33 int16_t* next_runs = runs + x; 37 int n = runs[0]; 42 runs[0] = SkToS16(x); 43 runs[x] = SkToS16(n - x); 46 runs += n; 51 runs = next_runs; 56 int n = runs[ 81 int16_t* runs = fRuns + offsetX; local 136 const int16_t* runs = fRuns; local 147 const int16_t* runs = fRuns; local 168 const int16_t* runs = fRuns; local [all...] |
H A D | SkRegionPriv.h | 25 static int compute_intervalcount(const SkRegion::RunType runs[]) { argument 26 const SkRegion::RunType* curr = runs; 32 return (curr - runs) >> 1; 117 * Given a scanline (including its Bottom value at runs[0]), return the next 118 * scanline. Asserts that there is one (i.e. runs[0] < Sentinel) 120 static SkRegion::RunType* SkipEntireScanline(const SkRegion::RunType runs[]) { 122 SkASSERT(runs[0] < SkRegion::kRunTypeSentinel); 124 const int intervals = runs[1]; 125 SkASSERT(runs[2 + intervals * 2] == SkRegion::kRunTypeSentinel); 128 int n = compute_intervalcount(&runs[ [all...] |
H A D | SkAntiRun.h | 55 * Break the runs in the buffer at offsets x and x+count, properly 56 * updating the runs to the right and left. 59 * Allows add() to sum another run to some of the new sub-runs. 62 static void Break(int16_t runs[], uint8_t alpha[], int x, int count); 65 * Cut (at offset x in the buffer) a run into two shorter runs with 70 static void BreakAt(int16_t runs[], uint8_t alpha[], int x) { argument 72 int n = runs[0]; 77 runs[0] = SkToS16(x); 78 runs[x] = SkToS16(n - x); 81 runs [all...] |
H A D | SkRegion.cpp | 33 static SkRegion::RunType* skip_intervals(const SkRegion::RunType runs[]) { argument 34 int intervals = runs[-1]; 37 SkASSERT(runs[0] < runs[1]); 38 SkASSERT(runs[1] < SkRegion::kRunTypeSentinel); 41 SkASSERT(SkRegion::kRunTypeSentinel == runs[0]); 44 runs += intervals * 2 + 1; 45 return const_cast<SkRegion::RunType*>(runs); 48 bool SkRegion::RunsAreARect(const SkRegion::RunType runs[], int count, 50 assert_sentinel(runs[ 228 setRuns(RunType runs[], int count) argument 296 BuildRectRuns(const SkIRect& bounds, RunType runs[kRectRegionRuns]) argument 318 const RunType* runs = fRunHead->findScanline(y); local 341 scanline_bottom(const SkRegion::RunType runs[]) argument 345 scanline_next(const SkRegion::RunType runs[]) argument 350 scanline_contains(const SkRegion::RunType runs[], SkRegion::RunType L, SkRegion::RunType R) argument 413 const RunType* runs = tmpStorage; local 430 scanline_intersects(const SkRegion::RunType runs[], SkRegion::RunType L, SkRegion::RunType R) argument 1159 skip_intervals_slow(const SkRegion::RunType runs[]) argument [all...] |
H A D | SkScan_Antihair.cpp | 72 int16_t runs[HLINE_STACK_BUFFER + 1]; local 81 runs[0] = SkToS16(n); 82 runs[n] = 0; 83 blitter->blitAntiH(x, y, aa, runs); 157 int16_t runs[2]; 160 runs[0] = 1; 161 runs[1] = 0; 171 blitter->blitAntiH(x, lower_y, aa, runs); 172 // the clipping blitters might edit runs, but should not affect us 173 SkASSERT(runs[ [all...] |
H A D | SkBlitter.cpp | 37 const int16_t runs[]) { 45 int16_t runs[2]; local 46 runs[0] = 1; 47 runs[1] = 0; 50 this->blitAntiH(x, y++, &alpha, runs); 173 int16_t* runs = runStorage.get(); local 176 sk_memset16((uint16_t*)runs, 1, width); 177 runs[width] = 0; 182 this->blitAntiH(clip.fLeft, y, aa, runs); 230 const int16_t runs[]) {} 36 blitAntiH(int x, int y, const SkAlpha antialias[], const int16_t runs[]) argument 229 blitAntiH(int x, int y, const SkAlpha antialias[], const int16_t runs[]) argument 246 compute_anti_width(const int16_t runs[]) argument 292 blitAntiH(int left, int y, const SkAlpha aa[], const int16_t runs[]) argument [all...] |
H A D | SkBlitter_RGB16.cpp | 59 const int16_t* runs); 86 const int16_t* runs); 102 const int16_t* runs); 115 const int16_t* runs); 136 const int16_t* runs); 149 const int16_t* runs); 237 const int16_t* SK_RESTRICT runs) { 241 int count = runs[0]; 246 runs += count; 299 const int16_t* SK_RESTRICT runs) { 235 blitAntiH(int x, int y, const SkAlpha* SK_RESTRICT antialias, const int16_t* SK_RESTRICT runs) argument 297 blitAntiH(int x, int y, const SkAlpha* SK_RESTRICT antialias, const int16_t* SK_RESTRICT runs) argument 582 blitAntiH(int x, int y, const SkAlpha* SK_RESTRICT antialias, const int16_t* SK_RESTRICT runs) argument 759 blitAntiH(int x, int y, const SkAlpha* SK_RESTRICT antialias, const int16_t* SK_RESTRICT runs) argument 877 count_nonzero_span(const int16_t runs[], const SkAlpha aa[]) argument 891 blitAntiH(int x, int y, const SkAlpha* SK_RESTRICT antialias, const int16_t* SK_RESTRICT runs) argument 968 blitAntiH(int x, int y, const SkAlpha* SK_RESTRICT antialias, const int16_t* SK_RESTRICT runs) argument [all...] |
/external/aac/libAACdec/src/arm/ |
H A D | block_arm.cpp | 112 int runs = band_offset; local 114 runs = band_offset - runs; /* is always a multiple of 4 */ 133 } while ((runs = runs-4) != 0); 137 pSpectrum+= runs;
|
/external/icu4c/common/ |
H A D | ubidiln.c | 50 * The implementation of the access to same-level-runs and of the reordering 56 * same-level-runs is created. Reordering then is done on this vector. 61 * This is inefficient if there are many very short runs. If the average run 157 pLineBiDi->runs=NULL; 320 /* this is done based on runs rather than on levels since levels have 324 iRun=pBiDi->runs[0]; 327 iRun = pBiDi->runs[i]; 351 /* runs API functions ------------------------------------------------------- */ 377 start=pBiDi->runs[runIndex].logicalStart; 383 *pLength=pBiDi->runs[runInde 440 Run *runs, tempRun; local 523 Run *runs=pBiDi->runs; local 602 Run *runs; local 898 Run *runs=pBiDi->runs; local 925 Run *runs=pBiDi->runs; local 945 Run *runs=pBiDi->runs; local 990 Run *runs; local 1126 Run *runs=pBiDi->runs; local 1225 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:__anon11133 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/legacy/include/core/ |
H A D | SkBlitter.h | 29 /// Blit a horizontal run of antialiased pixels; runs[] is a *sparse* 32 const int16_t runs[]); 90 const int16_t runs[]) SK_OVERRIDE; 111 const int16_t runs[]) SK_OVERRIDE; 138 const int16_t runs[]) SK_OVERRIDE;
|