| /external/openssl/crypto/rand/ |
| D | randtest.c | 74 unsigned long runs[2][34]; in main() local
88 for (i=0; i<34; i++) runs[0][i]=runs[1][i]=0; in main()
110 runs[sign][nsign-1]++; in main()
112 runs[sign][5]++; in main()
123 if (nsign != 0) runs[sign][nsign-1]++; in main()
159 if (!((2267 < runs[i][0]) && (runs[i][0] < 2733))) in main()
162 i,1,runs[i][0]); in main()
165 if (!((1079 < runs[i][1]) && (runs[i][1] < 1421))) in main()
168 i,2,runs[i][1]); in main()
171 if (!(( 502 < runs[i][2]) && (runs[i][2] < 748))) in main()
[all …]
|
| /external/skia/src/core/ |
| D | SkRegionPriv.h | 25 static int compute_intervalcount(const SkRegion::RunType runs[]) { in compute_intervalcount() argument
26 const SkRegion::RunType* curr = runs; in compute_intervalcount()
32 return SkToInt((curr - runs) >> 1); in compute_intervalcount()
123 static SkRegion::RunType* SkipEntireScanline(const SkRegion::RunType runs[]) { in SkipEntireScanline()
125 SkASSERT(runs[0] < SkRegion::kRunTypeSentinel); in SkipEntireScanline()
127 const int intervals = runs[1]; in SkipEntireScanline()
128 SkASSERT(runs[2 + intervals * 2] == SkRegion::kRunTypeSentinel); in SkipEntireScanline()
131 int n = compute_intervalcount(&runs[2]); in SkipEntireScanline()
137 runs += 1 + 1 + intervals * 2 + 1; in SkipEntireScanline()
138 return const_cast<SkRegion::RunType*>(runs); in SkipEntireScanline()
[all …]
|
| D | 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, in RunsAreARect() argument
50 assert_sentinel(runs[0], false); // top in RunsAreARect()
54 assert_sentinel(runs[1], false); // bottom in RunsAreARect()
[all …]
|
| D | SkAntiRun.h | 55 int16_t* runs = fRuns + offsetX; in add() local
61 SkAlphaRuns::Break(runs, alpha, x, 1); in add()
71 runs += x + 1; in add()
79 SkAlphaRuns::Break(runs, alpha, x, middleCount); in add()
81 runs += x; in add()
85 int n = runs[0]; in add()
88 runs += n; in add()
96 SkAlphaRuns::Break(runs, alpha, x, 1); in add()
117 static void Break(int16_t runs[], uint8_t alpha[], int x, int count) {
123 int16_t* next_runs = runs + x;
[all …]
|
| D | SkAlphaRuns.cpp | 31 const int16_t* runs = fRuns; in assertValid() local
34 while (*runs) { in assertValid()
36 alpha += *runs; in assertValid()
37 runs += *runs; in assertValid()
42 const int16_t* runs = fRuns; in dump() local
46 while (*runs) { in dump()
47 int n = *runs; in dump()
54 runs += n; in dump()
63 const int16_t* runs = fRuns; in validate() local
65 while (*runs) { in validate()
[all …]
|
| D | SkScan_Antihair.cpp | 72 int16_t runs[HLINE_STACK_BUFFER + 1]; in call_hline_blitter() local
81 runs[0] = SkToS16(n); in call_hline_blitter()
82 runs[n] = 0; in call_hline_blitter()
83 blitter->blitAntiH(x, y, aa, runs); in call_hline_blitter()
157 int16_t runs[2]; in drawCap() local
160 runs[0] = 1; in drawCap()
161 runs[1] = 0; in drawCap()
171 blitter->blitAntiH(x, lower_y, aa, runs); in drawCap()
173 SkASSERT(runs[0] == 1); in drawCap()
174 SkASSERT(runs[1] == 0); in drawCap()
[all …]
|
| D | SkBlitter_RGB16.cpp | 58 const int16_t* runs);
85 const int16_t* runs);
101 const int16_t* runs);
115 const int16_t* runs);
137 const int16_t* runs);
151 const int16_t* runs);
239 const int16_t* SK_RESTRICT runs) { in blitAntiH() argument
243 int count = runs[0]; in blitAntiH()
248 runs += count; in blitAntiH()
301 const int16_t* SK_RESTRICT runs) { in blitAntiH() argument
[all …]
|
| D | SkBlitter.cpp | 44 const int16_t runs[]) { in blitAntiH() argument
52 int16_t runs[2]; in blitV() local
53 runs[0] = 1; in blitV()
54 runs[1] = 0; in blitV()
57 this->blitAntiH(x, y++, &alpha, runs); in blitV()
180 int16_t* runs = runStorage.get(); in blitMask() local
183 sk_memset16((uint16_t*)runs, 1, width); in blitMask()
184 runs[width] = 0; in blitMask()
189 this->blitAntiH(clip.fLeft, y, aa, runs); in blitMask()
237 const int16_t runs[]) {} in blitAntiH() argument
[all …]
|
| /external/chromium_org/third_party/skia/src/core/ |
| D | SkRegionPriv.h | 25 static int compute_intervalcount(const SkRegion::RunType runs[]) { in compute_intervalcount() argument
26 const SkRegion::RunType* curr = runs; in compute_intervalcount()
32 return SkToInt((curr - runs) >> 1); in compute_intervalcount()
120 static SkRegion::RunType* SkipEntireScanline(const SkRegion::RunType runs[]) { in SkipEntireScanline()
122 SkASSERT(runs[0] < SkRegion::kRunTypeSentinel); in SkipEntireScanline()
124 const int intervals = runs[1]; in SkipEntireScanline()
125 SkASSERT(runs[2 + intervals * 2] == SkRegion::kRunTypeSentinel); in SkipEntireScanline()
128 int n = compute_intervalcount(&runs[2]); in SkipEntireScanline()
134 runs += 1 + 1 + intervals * 2 + 1; in SkipEntireScanline()
135 return const_cast<SkRegion::RunType*>(runs); in SkipEntireScanline()
[all …]
|
| D | 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, in RunsAreARect() argument
50 assert_sentinel(runs[0], false); // top in RunsAreARect()
54 assert_sentinel(runs[1], false); // bottom in RunsAreARect()
[all …]
|
| D | SkAntiRun.h | 55 int16_t* runs = fRuns + offsetX; in add() local
61 SkAlphaRuns::Break(runs, alpha, x, 1); in add()
71 runs += x + 1; in add()
79 SkAlphaRuns::Break(runs, alpha, x, middleCount); in add()
81 runs += x; in add()
85 int n = runs[0]; in add()
88 runs += n; in add()
96 SkAlphaRuns::Break(runs, alpha, x, 1); in add()
117 static void Break(int16_t runs[], uint8_t alpha[], int x, int count) {
123 int16_t* next_runs = runs + x;
[all …]
|
| D | SkAlphaRuns.cpp | 31 const int16_t* runs = fRuns; in assertValid() local
34 while (*runs) { in assertValid()
36 alpha += *runs; in assertValid()
37 runs += *runs; in assertValid()
42 const int16_t* runs = fRuns; in dump() local
46 while (*runs) { in dump()
47 int n = *runs; in dump()
54 runs += n; in dump()
63 const int16_t* runs = fRuns; in validate() local
65 while (*runs) { in validate()
[all …]
|
| D | SkScan_Antihair.cpp | 72 int16_t runs[HLINE_STACK_BUFFER + 1]; in call_hline_blitter() local
81 runs[0] = SkToS16(n); in call_hline_blitter()
82 runs[n] = 0; in call_hline_blitter()
83 blitter->blitAntiH(x, y, aa, runs); in call_hline_blitter()
157 int16_t runs[2]; in drawCap() local
160 runs[0] = 1; in drawCap()
161 runs[1] = 0; in drawCap()
171 blitter->blitAntiH(x, lower_y, aa, runs); in drawCap()
173 SkASSERT(runs[0] == 1); in drawCap()
174 SkASSERT(runs[1] == 0); in drawCap()
[all …]
|
| D | SkBlitter_RGB16.cpp | 64 const int16_t* runs);
91 const int16_t* runs);
107 const int16_t* runs);
121 const int16_t* runs);
143 const int16_t* runs);
157 const int16_t* runs);
245 const int16_t* SK_RESTRICT runs) { in blitAntiH() argument
249 int count = runs[0]; in blitAntiH()
254 runs += count; in blitAntiH()
307 const int16_t* SK_RESTRICT runs) { in blitAntiH() argument
[all …]
|
| D | SkBlitter.cpp | 44 const int16_t runs[]) { in blitAntiH() argument
52 int16_t runs[2]; in blitV() local
53 runs[0] = 1; in blitV()
54 runs[1] = 0; in blitV()
57 this->blitAntiH(x, y++, &alpha, runs); in blitV()
180 int16_t* runs = runStorage.get(); in blitMask() local
183 sk_memset16((uint16_t*)runs, 1, width); in blitMask()
184 runs[width] = 0; in blitMask()
189 this->blitAntiH(clip.fLeft, y, aa, runs); in blitMask()
237 const int16_t runs[]) {} in blitAntiH() argument
[all …]
|
| /external/icu/icu4c/source/common/ |
| D | ubidiln.c | 157 pLineBiDi->runs=NULL; in ubidi_setLine()
324 iRun=pBiDi->runs[0]; in ubidi_getLogicalRun()
327 iRun = pBiDi->runs[i]; in ubidi_getLogicalRun()
377 start=pBiDi->runs[runIndex].logicalStart; in ubidi_getVisualRun()
383 *pLength=pBiDi->runs[runIndex].visualLimit- in ubidi_getVisualRun()
384 pBiDi->runs[runIndex-1].visualLimit; in ubidi_getVisualRun()
386 *pLength=pBiDi->runs[0].visualLimit; in ubidi_getVisualRun()
396 pBiDi->runs=pBiDi->simpleRuns; in getSingleRun()
400 pBiDi->runs[0].logicalStart=MAKE_INDEX_ODD_PAIR(0, level); in getSingleRun()
401 pBiDi->runs[0].visualLimit=pBiDi->length; in getSingleRun()
[all …]
|
| /external/chromium_org/third_party/icu/source/common/ |
| D | ubidiln.c | 157 pLineBiDi->runs=NULL; in ubidi_setLine()
324 iRun=pBiDi->runs[0]; in ubidi_getLogicalRun()
327 iRun = pBiDi->runs[i]; in ubidi_getLogicalRun()
377 start=pBiDi->runs[runIndex].logicalStart; in ubidi_getVisualRun()
383 *pLength=pBiDi->runs[runIndex].visualLimit- in ubidi_getVisualRun()
384 pBiDi->runs[runIndex-1].visualLimit; in ubidi_getVisualRun()
386 *pLength=pBiDi->runs[0].visualLimit; in ubidi_getVisualRun()
396 pBiDi->runs=pBiDi->simpleRuns; in getSingleRun()
400 pBiDi->runs[0].logicalStart=MAKE_INDEX_ODD_PAIR(0, level); in getSingleRun()
401 pBiDi->runs[0].visualLimit=pBiDi->length; in getSingleRun()
[all …]
|
| /external/qemu/android/skin/ |
| D | region.c | 86 return r->runs == RUNS_EMPTY; in region_isEmpty()
92 return r->runs == RUNS_RECT; in region_isRect()
98 return r->runs != RUNS_EMPTY && r->runs != RUNS_RECT; in region_isComplex()
161 runstore_from_runs( Run* runs ) in runstore_from_runs() argument
163 RASSERT(runs != RUNS_EMPTY); in runstore_from_runs()
164 RASSERT(runs != RUNS_RECT); in runstore_from_runs()
165 return (RunStore*)runs - 1; in runstore_from_runs()
182 s = runstore_from_runs(r->runs); in region_edit()
184 r->runs = runstore_to_runs(s); in region_edit()
185 return r->runs; in region_edit()
[all …]
|
| /external/chromium_org/third_party/WebKit/PerformanceTests/Dromaeo/resources/dromaeo/web/ |
| D | webrunner.js | 96 var runs = 0;
103 runs++;
117 times.push( (runs * 1000) / (cur - start) );
151 function compute(times, runs){ argument
152 var results = {runs: runs}, num = times.length; property
190 results.sem = (results.deviation / Math.sqrt(results.runs)) * tDistribution;
456 var runs = {};
471 runs[data.id] = data;
472 runs[data.id].mean = 0;
473 runs[data.id].error = 0;
[all …]
|
| /external/aac/libAACdec/src/arm/ |
| D | block_arm.cpp | 112 int runs = band_offset; in CBlock_ScaleSpectralData_func1() local
114 runs = band_offset - runs; /* is always a multiple of 4 */ in CBlock_ScaleSpectralData_func1()
133 } while ((runs = runs-4) != 0); in CBlock_ScaleSpectralData_func1()
137 pSpectrum+= runs; in CBlock_ScaleSpectralData_func1()
|
| /external/chromium_org/media/formats/mp4/ |
| D | track_run_iterator_unittest.cc | 187 moof.tracks[0].runs.resize(2); in CreateFragment()
188 moof.tracks[0].runs[0].sample_count = 10; in CreateFragment()
189 moof.tracks[0].runs[0].data_offset = 100; in CreateFragment()
190 SetAscending(&moof.tracks[0].runs[0].sample_sizes); in CreateFragment()
192 moof.tracks[0].runs[1].sample_count = 10; in CreateFragment()
193 moof.tracks[0].runs[1].data_offset = 10000; in CreateFragment()
198 moof.tracks[1].runs.resize(1); in CreateFragment()
199 moof.tracks[1].runs[0].sample_count = 10; in CreateFragment()
200 moof.tracks[1].runs[0].data_offset = 200; in CreateFragment()
201 SetAscending(&moof.tracks[1].runs[0].sample_sizes); in CreateFragment()
[all …]
|
| /external/opencv/cvaux/src/ |
| D | cvprewarp.cpp | 90 int *runs, /* result runs */ in icvFindRunsInOneImage() argument
111 runs[run_index++] = 0; in icvFindRunsInOneImage()
112 runs[run_index++] = curr_color; in icvFindRunsInOneImage()
124 runs[run_index++] = index; in icvFindRunsInOneImage()
125 runs[run_index++] = color; in icvFindRunsInOneImage()
133 runs[run_index++] = index; in icvFindRunsInOneImage()
|
| /external/srtp/crypto/math/ |
| D | stat.c | 82 uint16_t runs[6] = { 0, 0, 0, 0, 0, 0 }; in stat_test_runs() local
143 runs[state-1]++; /* increment run count */ in stat_test_runs()
171 debug_print(mod_stat, " runs[]: %d", runs[i]); in stat_test_runs()
178 if ( (runs[i] < lo_value[i] ) || (runs[i] > hi_value[i]) in stat_test_runs()
207 uint16_t runs[6] = { 0, 0, 0, 0, 0, 0 }; in stat_test_rand_source() local
289 runs[state-1]++; /* increment run count */ in stat_test_rand_source()
343 if ((runs[i] < lo_value[i] ) || (runs[i] > hi_value[i]) in stat_test_rand_source()
|
| /external/chromium_org/third_party/libsrtp/srtp/crypto/math/ |
| D | stat.c | 117 uint16_t runs[6] = { 0, 0, 0, 0, 0, 0 }; in stat_test_runs() local
178 runs[state-1]++; /* increment run count */ in stat_test_runs()
206 debug_print(mod_stat, " runs[]: %d", runs[i]); in stat_test_runs()
213 if ( (runs[i] < lo_value[i] ) || (runs[i] > hi_value[i]) in stat_test_runs()
242 uint16_t runs[6] = { 0, 0, 0, 0, 0, 0 }; in stat_test_rand_source() local
324 runs[state-1]++; /* increment run count */ in stat_test_rand_source()
378 if ((runs[i] < lo_value[i] ) || (runs[i] > hi_value[i]) in stat_test_rand_source()
|
| /external/chromium_org/third_party/WebKit/Source/platform/text/ |
| D | BidiResolver.h | 249 BidiRunList<Run>& runs() { return m_runs; } in runs() function
328 void BidiResolver<Iterator, Run>::appendRun(BidiRunList<Run>& runs) in appendRun() argument
340 runs.addRun(new Run(startOffset, endOffset + 1, context(), m_direction)); in appendRun()
380 void BidiResolver<Iterator, Run>::lowerExplicitEmbeddingLevel(BidiRunList<Run>& runs, WTF::Unicode:… in lowerExplicitEmbeddingLevel() argument
392 appendRun(runs); in lowerExplicitEmbeddingLevel()
396 appendRun(runs); in lowerExplicitEmbeddingLevel()
398 appendRun(runs); in lowerExplicitEmbeddingLevel()
402 appendRun(runs); in lowerExplicitEmbeddingLevel()
408 appendRun(runs); in lowerExplicitEmbeddingLevel()
418 void BidiResolver<Iterator, Run>::raiseExplicitEmbeddingLevel(BidiRunList<Run>& runs, WTF::Unicode:… in raiseExplicitEmbeddingLevel() argument
[all …]
|