| /external/chromium_org/third_party/openssl/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/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/chromium_org/third_party/skia/src/core/ |
| SkAlphaRuns.cpp | 31 const int16_t* runs = fRuns; local
34 while (*runs) {
36 alpha += *runs;
37 runs += *runs;
42 const int16_t* runs = fRuns; local
45 SkDebugf("Runs");
46 while (*runs) {
47 int n = *runs;
54 runs += n
63 const int16_t* runs = fRuns; local
[all...] |
| SkRegionPriv.h | 25 static int compute_intervalcount(const SkRegion::RunType runs[]) {
26 const SkRegion::RunType* curr = runs;
32 return SkToInt((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[2])
[all...] |
| SkAntiRun.h | 55 int16_t* runs = fRuns + offsetX; local
61 SkAlphaRuns::Break(runs, alpha, x, 1);
71 runs += x + 1;
79 SkAlphaRuns::Break(runs, alpha, x, middleCount);
81 runs += x;
85 int n = runs[0];
88 runs += n;
96 SkAlphaRuns::Break(runs, alpha, x, 1);
110 * Break the runs in the buffer at offsets x and x+count, properly
111 * updating the runs to the right and left
[all...] |
| SkRegion.cpp | 33 static SkRegion::RunType* skip_intervals(const SkRegion::RunType runs[]) {
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[0], false); // to
322 const RunType* runs = fRunHead->findScanline(y); local
417 const RunType* runs = tmpStorage; local
1266 const RunType* runs = fRunHead->readonly_runs(); local
1318 const RunType* runs = fRuns; local
1408 const SkRegion::RunType* runs = rgn.fRunHead->findScanline(y); local
1447 const SkRegion::RunType* runs = fRuns; local
[all...] |
| /external/skia/src/core/ |
| SkAlphaRuns.cpp | 31 const int16_t* runs = fRuns; local
34 while (*runs) {
36 alpha += *runs;
37 runs += *runs;
42 const int16_t* runs = fRuns; local
45 SkDebugf("Runs");
46 while (*runs) {
47 int n = *runs;
54 runs += n
63 const int16_t* runs = fRuns; local
[all...] |
| SkRegionPriv.h | 25 static int compute_intervalcount(const SkRegion::RunType runs[]) {
26 const SkRegion::RunType* curr = runs;
32 return SkToInt((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[2])
[all...] |
| SkAntiRun.h | 55 int16_t* runs = fRuns + offsetX; local
61 SkAlphaRuns::Break(runs, alpha, x, 1);
71 runs += x + 1;
79 SkAlphaRuns::Break(runs, alpha, x, middleCount);
81 runs += x;
85 int n = runs[0];
88 runs += n;
96 SkAlphaRuns::Break(runs, alpha, x, 1);
110 * Break the runs in the buffer at offsets x and x+count, properly
111 * updating the runs to the right and left
[all...] |
| SkRegion.cpp | 33 static SkRegion::RunType* skip_intervals(const SkRegion::RunType runs[]) {
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[0], false); // to
322 const RunType* runs = fRunHead->findScanline(y); local
417 const RunType* runs = tmpStorage; local
1266 const RunType* runs = fRunHead->readonly_runs(); local
1318 const RunType* runs = fRuns; local
1408 const SkRegion::RunType* runs = rgn.fRunHead->findScanline(y); local
1447 const SkRegion::RunType* runs = fRuns; local
[all...] |
| /external/aac/libAACdec/src/arm/ |
| 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/chromium_org/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
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/icu/icu4c/source/common/ |
| 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[runIndex].visualLimit
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/ |
| 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:__anon32910
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_org/media/cast/test/utility/ |
| barcode.cc | 88 std::deque<int> runs; local
100 runs.push_back(length);
106 runs.push_back(length);
109 while (runs.size() >= output->size() * 2 + 7) {
110 std::deque<int>::const_iterator i = runs.begin();
135 DCHECK(i <= runs.end());
140 runs.pop_front();
141 runs.pop_front();
|
| /external/chromium_org/v8/test/mjsunit/regress/ |
| regress-347904.js | 5 // Flags: --allow-natives-syntax --stress-runs=2
|
| /external/libcxx/test/thread/thread.condition/thread.condition.condvar/ |
| wait_for.pass.cpp | 31 int runs = 0; variable
46 if (runs == 0)
56 ++runs;
|
| wait_for_pred.pass.cpp | 41 int runs = 0; variable
54 if (runs == 0)
64 ++runs;
|
| /external/libcxx/test/thread/thread.condition/thread.condition.condvarany/ |
| wait_for.pass.cpp | 34 int runs = 0; variable
49 if (runs == 0)
59 ++runs;
|
| wait_for_pred.pass.cpp | 44 int runs = 0; variable
57 if (runs == 0)
67 ++runs;
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/thread/thread.condition/thread.condition.condvar/ |
| wait_for.pass.cpp | 31 int runs = 0; variable
46 if (runs == 0)
56 ++runs;
|
| wait_for_pred.pass.cpp | 41 int runs = 0; variable
54 if (runs == 0)
64 ++runs;
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/thread/thread.condition/thread.condition.condvarany/ |
| wait_for.pass.cpp | 34 int runs = 0; variable
49 if (runs == 0)
59 ++runs;
|
| wait_for_pred.pass.cpp | 44 int runs = 0; variable
57 if (runs == 0)
67 ++runs;
|
