| /external/icu/icu4j/main/classes/core/src/com/ibm/icu/text/ |
| D | BidiLine.java | 134 lineBidi.runs = new BidiRun[0]; in setLine()
287 iRun = bidi.runs[0]; in getLogicalRun()
290 iRun = bidi.runs[i]; in getLogicalRun()
306 int start = bidi.runs[runIndex].start; in getVisualRun()
308 byte level = bidi.runs[runIndex].level; in getVisualRun()
312 bidi.runs[runIndex].limit - in getVisualRun()
313 bidi.runs[runIndex - 1].limit; in getVisualRun()
315 limit = start + bidi.runs[0].limit; in getVisualRun()
323 bidi.runs = bidi.simpleRuns; in getSingleRun()
327 bidi.runs[0] = new BidiRun(0, bidi.length, level); in getSingleRun()
[all …]
|
| /external/icu/android_icu4j/src/main/java/android/icu/text/ |
| D | BidiLine.java | 135 lineBidi.runs = new BidiRun[0]; in setLine()
288 iRun = bidi.runs[0]; in getLogicalRun()
291 iRun = bidi.runs[i]; in getLogicalRun()
307 int start = bidi.runs[runIndex].start; in getVisualRun()
309 byte level = bidi.runs[runIndex].level; in getVisualRun()
313 bidi.runs[runIndex].limit - in getVisualRun()
314 bidi.runs[runIndex - 1].limit; in getVisualRun()
316 limit = start + bidi.runs[0].limit; in getVisualRun()
324 bidi.runs = bidi.simpleRuns; in getSingleRun()
328 bidi.runs[0] = new BidiRun(0, bidi.length, level); in getSingleRun()
[all …]
|
| /external/skia/src/core/ |
| D | SkRegionPriv.h | 46 static int compute_intervalcount(const SkRegionPriv::RunType runs[]) { in compute_intervalcount() argument
47 const SkRegionPriv::RunType* curr = runs; in compute_intervalcount()
53 return SkToInt((curr - runs) >> 1); in compute_intervalcount()
146 static SkRegion::RunType* SkipEntireScanline(const SkRegion::RunType runs[]) { in SkipEntireScanline()
148 SkASSERT(runs[0] < SkRegion_kRunTypeSentinel); in SkipEntireScanline()
150 const int intervals = runs[1]; in SkipEntireScanline()
151 SkASSERT(runs[2 + intervals * 2] == SkRegion_kRunTypeSentinel); in SkipEntireScanline()
154 int n = compute_intervalcount(&runs[2]); in SkipEntireScanline()
160 runs += 1 + 1 + intervals * 2 + 1; in SkipEntireScanline()
161 return const_cast<SkRegion::RunType*>(runs); in SkipEntireScanline()
[all …]
|
| D | SkAntiRun.h | 60 int16_t* runs = fRuns + offsetX; in add() local
66 SkAlphaRuns::Break(runs, alpha, x, 1); in add()
76 runs += x + 1; in add()
83 SkAlphaRuns::Break(runs, alpha, x, middleCount); in add()
85 runs += x; in add()
89 int n = runs[0]; in add()
92 runs += n; in add()
100 SkAlphaRuns::Break(runs, alpha, x, 1); in add()
121 static void Break(int16_t runs[], uint8_t alpha[], int x, int count) {
127 int16_t* next_runs = runs + x;
[all …]
|
| D | SkRegion.cpp | 76 static SkRegionPriv::RunType* skip_intervals(const SkRegionPriv::RunType runs[]) { in skip_intervals() argument
77 int intervals = runs[-1]; in skip_intervals()
80 SkASSERT(runs[0] < runs[1]); in skip_intervals()
81 SkASSERT(runs[1] < SkRegion_kRunTypeSentinel); in skip_intervals()
84 SkASSERT(SkRegion_kRunTypeSentinel == runs[0]); in skip_intervals()
87 runs += intervals * 2 + 1; in skip_intervals()
88 return const_cast<SkRegionPriv::RunType*>(runs); in skip_intervals()
91 bool SkRegion::RunsAreARect(const SkRegion::RunType runs[], int count, in RunsAreARect() argument
93 assert_sentinel(runs[0], false); // top in RunsAreARect()
97 assert_sentinel(runs[1], false); // bottom in RunsAreARect()
[all …]
|
| D | SkAlphaRuns.cpp | 30 const int16_t* runs = fRuns; in assertValid() local
33 while (*runs) { in assertValid()
35 alpha += *runs; in assertValid()
36 runs += *runs; in assertValid()
41 const int16_t* runs = fRuns; in dump() local
45 while (*runs) { in dump()
46 int n = *runs; in dump()
53 runs += n; in dump()
62 const int16_t* runs = fRuns; in validate() local
64 while (*runs) { in validate()
[all …]
|
| D | SkBlitter.h | 51 virtual void blitAntiH(int x, int y, const SkAlpha antialias[], const int16_t runs[]) = 0;
82 int16_t runs[3]; in blitAntiH2() local
85 runs[0] = 1; in blitAntiH2()
86 runs[1] = 1; in blitAntiH2()
87 runs[2] = 0; in blitAntiH2()
90 this->blitAntiH(x, y, aa, runs); in blitAntiH2()
95 int16_t runs[2]; in blitAntiV2() local
98 runs[0] = 1; in blitAntiV2()
99 runs[1] = 0; in blitAntiV2()
101 this->blitAntiH(x, y, aa, runs); in blitAntiV2()
[all …]
|
| D | SkBlitter.cpp | 75 int16_t* runs = reinterpret_cast<int16_t*>(storage); in blitFatAntiRect() local
76 SkAlpha* alphas = reinterpret_cast<SkAlpha*>(runs + runSize); in blitFatAntiRect()
78 runs[0] = 1; in blitFatAntiRect()
79 runs[1] = bounds.width() - 2; in blitFatAntiRect()
80 runs[bounds.width() - 1] = 1; in blitFatAntiRect()
81 runs[bounds.width()] = 0; in blitFatAntiRect()
95 this->blitAntiH(bounds.fLeft, bounds.fTop, alphas, runs); in blitFatAntiRect()
106 this->blitAntiH(bounds.fLeft, bounds.fBottom - 1, alphas, runs); in blitFatAntiRect()
114 int16_t runs[2]; in blitV() local
115 runs[0] = 1; in blitV()
[all …]
|
| /external/skqp/src/core/ |
| D | SkRegionPriv.h | 46 static int compute_intervalcount(const SkRegionPriv::RunType runs[]) { in compute_intervalcount() argument
47 const SkRegionPriv::RunType* curr = runs; in compute_intervalcount()
53 return SkToInt((curr - runs) >> 1); in compute_intervalcount()
146 static SkRegion::RunType* SkipEntireScanline(const SkRegion::RunType runs[]) { in SkipEntireScanline()
148 SkASSERT(runs[0] < SkRegion_kRunTypeSentinel); in SkipEntireScanline()
150 const int intervals = runs[1]; in SkipEntireScanline()
151 SkASSERT(runs[2 + intervals * 2] == SkRegion_kRunTypeSentinel); in SkipEntireScanline()
154 int n = compute_intervalcount(&runs[2]); in SkipEntireScanline()
160 runs += 1 + 1 + intervals * 2 + 1; in SkipEntireScanline()
161 return const_cast<SkRegion::RunType*>(runs); in SkipEntireScanline()
[all …]
|
| D | SkAntiRun.h | 60 int16_t* runs = fRuns + offsetX; in add() local
66 SkAlphaRuns::Break(runs, alpha, x, 1); in add()
76 runs += x + 1; in add()
83 SkAlphaRuns::Break(runs, alpha, x, middleCount); in add()
85 runs += x; in add()
89 int n = runs[0]; in add()
92 runs += n; in add()
100 SkAlphaRuns::Break(runs, alpha, x, 1); in add()
121 static void Break(int16_t runs[], uint8_t alpha[], int x, int count) {
127 int16_t* next_runs = runs + x;
[all …]
|
| D | SkRegion.cpp | 77 static SkRegionPriv::RunType* skip_intervals(const SkRegionPriv::RunType runs[]) { in skip_intervals() argument
78 int intervals = runs[-1]; in skip_intervals()
81 SkASSERT(runs[0] < runs[1]); in skip_intervals()
82 SkASSERT(runs[1] < SkRegion_kRunTypeSentinel); in skip_intervals()
85 SkASSERT(SkRegion_kRunTypeSentinel == runs[0]); in skip_intervals()
88 runs += intervals * 2 + 1; in skip_intervals()
89 return const_cast<SkRegionPriv::RunType*>(runs); in skip_intervals()
92 bool SkRegion::RunsAreARect(const SkRegion::RunType runs[], int count, in RunsAreARect() argument
94 assert_sentinel(runs[0], false); // top in RunsAreARect()
98 assert_sentinel(runs[1], false); // bottom in RunsAreARect()
[all …]
|
| D | SkAlphaRuns.cpp | 30 const int16_t* runs = fRuns; in assertValid() local
33 while (*runs) { in assertValid()
35 alpha += *runs; in assertValid()
36 runs += *runs; in assertValid()
41 const int16_t* runs = fRuns; in dump() local
45 while (*runs) { in dump()
46 int n = *runs; in dump()
53 runs += n; in dump()
62 const int16_t* runs = fRuns; in validate() local
64 while (*runs) { in validate()
[all …]
|
| D | SkBlitter.h | 57 virtual void blitAntiH(int x, int y, const SkAlpha antialias[], const int16_t runs[]) = 0;
88 int16_t runs[3]; in blitAntiH2() local
91 runs[0] = 1; in blitAntiH2()
92 runs[1] = 1; in blitAntiH2()
93 runs[2] = 0; in blitAntiH2()
96 this->blitAntiH(x, y, aa, runs); in blitAntiH2()
101 int16_t runs[2]; in blitAntiV2() local
104 runs[0] = 1; in blitAntiV2()
105 runs[1] = 0; in blitAntiV2()
107 this->blitAntiH(x, y, aa, runs); in blitAntiV2()
[all …]
|
| /external/icu/icu4c/source/common/ |
| D | ubidiln.cpp | 155 pLineBiDi->runs=NULL; in ubidi_setLine()
322 iRun=pBiDi->runs[0]; in ubidi_getLogicalRun()
325 iRun = pBiDi->runs[i]; in ubidi_getLogicalRun()
375 start=pBiDi->runs[runIndex].logicalStart; in ubidi_getVisualRun()
381 *pLength=pBiDi->runs[runIndex].visualLimit- in ubidi_getVisualRun()
382 pBiDi->runs[runIndex-1].visualLimit; in ubidi_getVisualRun()
384 *pLength=pBiDi->runs[0].visualLimit; in ubidi_getVisualRun()
394 pBiDi->runs=pBiDi->simpleRuns; in getSingleRun()
398 pBiDi->runs[0].logicalStart=MAKE_INDEX_ODD_PAIR(0, level); in getSingleRun()
399 pBiDi->runs[0].visualLimit=pBiDi->length; in getSingleRun()
[all …]
|
| /external/grpc-grpc-java/core/src/test/java/io/grpc/internal/ |
| D | SerializingExecutorTest.java | 38 private List<Integer> runs = new ArrayList<>(); field in SerializingExecutorTest
49 runs.add(val); in run()
78 assertThat(runs).containsExactly(2); in resumable()
85 assertEquals(Collections.<Integer>emptyList(), runs); in serial() local
87 assertEquals(Arrays.asList(1), runs); in serial()
90 assertEquals(Arrays.asList(1), runs); in serial()
92 assertEquals(Arrays.asList(1, 2), runs); in serial()
100 assertEquals(Collections.<Integer>emptyList(), runs); in parallel() local
102 assertEquals(Arrays.asList(1, 2, 3), runs); in parallel()
111 runs.add(1); in reentrant()
[all …]
|
| /external/rust/crates/unicode-bidi/src/ |
| D | prepare.rs | 31 pub runs: Vec<LevelRun>, field
50 let runs = level_runs(levels, original_classes); in isolating_run_sequences() localVariable
54 let mut sequences = Vec::with_capacity(runs.len()); in isolating_run_sequences()
60 for run in runs { in isolating_run_sequences()
129 runs: sequence, in isolating_run_sequences()
143 let mut runs = Vec::new(); in level_runs() localVariable
145 return runs; in level_runs()
153 runs.push(current_run_start..i); in level_runs()
158 runs.push(current_run_start..levels.len()); in level_runs()
160 runs in level_runs()
[all …]
|
| D | deprecated.rs | 32 let mut runs = Vec::new(); in visual_runs() localVariable
43 runs.push(start..i); in visual_runs()
51 runs.push(start..line.end); in visual_runs()
53 let run_count = runs.len(); in visual_runs()
65 if levels[runs[seq_start].start] < max_level { in visual_runs()
73 if levels[runs[seq_end].start] < max_level { in visual_runs()
80 runs[seq_start..seq_end].reverse(); in visual_runs()
89 runs in visual_runs()
|
| /external/llvm/lib/Fuzzer/test/ |
| D | fuzzer-dfsan.test | 11 RUN: not LLVMFuzzer-SimpleCmpTest-DFSan -use_traces=1 -seed=1 -runs=10000000 -timeout=5 2>&1 | File…
12 RUN: LLVMFuzzer-SimpleCmpTest-DFSan -use_traces=1 -seed=1 -runs=100 -timeout=5 -verbosity=3 2>&1 | …
14 RUN: not LLVMFuzzer-MemcmpTest-DFSan -use_traces=1 -seed=1 -runs=100000 -timeout=5 2>&1 | FileCheck…
15 RUN: LLVMFuzzer-MemcmpTest-DFSan -use_traces=1 -seed=1 -runs=2 -timeout=5 -verbosity=3 2>&1 | FileC…
17 RUN: not LLVMFuzzer-StrncmpTest-DFSan -use_traces=1 -seed=1 -runs=10000 -timeout=5 2>&1 | FileCheck…
18 RUN: LLVMFuzzer-StrncmpTest-DFSan -use_traces=1 -seed=1 -runs=2 -timeout=5 -verbosity=3 2>&1 | File…
20 RUN: not LLVMFuzzer-StrcmpTest-DFSan -use_traces=1 -seed=1 -runs=10000 -timeout=5 2>&1 | FileCheck …
21 RUN: LLVMFuzzer-StrcmpTest-DFSan -use_traces=1 -seed=1 -runs=2 -timeout=5 -verbosity=3 2>&1…
23 RUN: not LLVMFuzzer-SwitchTest-DFSan -use_traces=1 -seed=1 -runs=100000 -timeout=5 2>&…
24 RUN: LLVMFuzzer-SwitchTest-DFSan -use_traces=1 -seed=1 -runs=2 -timeout=5 -verbosity=3 2>&1…
|
| D | fuzzer-traces-hooks.test | 6 Done1000000: Done 1000000 runs in
8 RUN: not LLVMFuzzer-MemcmpTest -seed=4294967295 -runs=100000 2>&1 | FileCheck %s
9 RUN: LLVMFuzzer-MemcmpTest -use_memcmp=0 -seed=4294967295 -runs=1000000 2>&1 | FileCheck %s --…
11 RUN: not LLVMFuzzer-StrncmpTest -seed=2 -runs=100000 2>&1 | FileCheck %s
12 RUN: LLVMFuzzer-StrncmpTest -use_memcmp=0 -seed=3 -runs=1000000 2>&1 | FileCheck %s --check-pr…
14 RUN: not LLVMFuzzer-StrcmpTest -seed=4 -runs=200000 2>&1 | FileCheck %s
15 RUN: LLVMFuzzer-StrcmpTest -use_memcmp=0 -seed=5 -runs=1000000 2>&1 | FileCheck %s --check-pre…
18 RUN: LLVMFuzzer-RepeatedMemcmp -seed=10 -runs=100000 2>&1 | FileCheck %s --check-prefix=RECOMMENDED…
|
| D | fuzzer-traces.test | 2 Done1000000: Done 1000000 runs in
3 RUN: not LLVMFuzzer-SimpleCmpTest -use_traces=1 -seed=1 -runs=10000001 2>&1 | FileCheck %s
5 RUN: not LLVMFuzzer-SwitchTest -use_traces=1 -seed=6 -runs=1000002 2>&1 | FileCheck %s
6 RUN: LLVMFuzzer-SwitchTest -seed=7 -runs=1000000 2>&1 | FileCheck %s --check-pre…
8 RUN: not LLVMFuzzer-SimpleHashTest -use_traces=1 -seed=8 -runs=1000000 -max_len=16 2>&1 | FileChec…
9 RUN: LLVMFuzzer-SimpleHashTest -seed=9 -runs=1000000 -max_len=16 2>&1 | FileCheck…
|
| /external/flatbuffers/tests/FlatBuffers.Benchmarks.swift/Sources/FlatBuffers.Benchmarks.swift/ |
| D | main.swift | 11 func run(name: String, runs: Int, action: () -> Void) -> Benchmark {
14 for _ in 0..<runs {
18 let value = Double(ends - start) / Double(runs)
63 func benchmark(numberOfRuns runs: Int) { in benchmark()
66 benchmarks.append(run(name: "500_000", runs: runs, action: benchmarkFiveHundredAdds)) in benchmark()
67 benchmarks.append(run(name: "10 str", runs: runs, action: create10Strings)) in benchmark()
68 let hundredStr = run(name: "100 str", runs: runs) { in benchmark()
|
| /external/aac/libAACdec/src/arm/ |
| D | block_arm.cpp | 115 int runs = band_offset; in CBlock_ScaleSpectralData_func1() local
117 runs = band_offset - runs; /* is always a multiple of 4 */ in CBlock_ScaleSpectralData_func1()
118 FDK_ASSERT((runs & 3) == 0); in CBlock_ScaleSpectralData_func1()
137 } while ((runs = runs - 4) != 0); in CBlock_ScaleSpectralData_func1()
139 pSpectrum += runs; in CBlock_ScaleSpectralData_func1()
|
| /external/llvm-project/libc/AOR_v20.02/math/test/ |
| D | runulp.sh | 129 runs=
130 check __s_exp 1 && runs=1
228 exp __s_exp $runs
233 log __s_log $runs
238 pow __s_pow $runs
243 sin __s_sin $runs
248 cos __s_cos $runs
253 expf __s_expf $runs
258 expf_1u __s_expf_1u $runs
262 exp2f __s_exp2f $runs
[all …]
|
| /external/llvm-project/compiler-rt/test/fuzzer/ |
| D | max-number-of-runs.test | 3 RUN: %run %t-AccumulateAllocationsTest -seed=1 -runs=2 2>&1 | FileCheck %s --check-prefix=CHECK1
4 CHECK1: Done 2 runs
6 RUN: %run %t-AccumulateAllocationsTest -seed=1 -runs=3 2>&1 | FileCheck %s --check-prefix=CHECK2
7 CHECK2: Done 3 runs
9 RUN: %run %t-AccumulateAllocationsTest -seed=1 -runs=4 2>&1 | FileCheck %s --check-prefix=CHECK3
10 CHECK3: Done 4 runs
|
| D | fuzzer-leak.test | 8 RUN: not %run %t-LeakTest -runs=100000 -detect_leaks=1 %t-corpus 2>&1 | FileCheck %s --check-prefix…
17 RUN: %run %t-LeakTest -runs=0 %t-corpus
19 RUN: not %run %t-LeakTest -runs=0 -detect_leaks=1 %S 2>&1 | FileCheck %s --check-prefix=LEAK_IN_COR…
23 RUN: not %run %t-LeakTest -runs=100000000 %S/hi.txt 2>&1 | FileCheck %s --check-prefix=MULTI_RUN_LE…
27 RUN: not %run %t-LeakTest -runs=100000 -detect_leaks=0 2>&1 | FileCheck %s --check-prefix=LEAK_AFTER
28 RUN: not %run %t-LeakTest -runs=100000 2>&1 | FileCheck %s --check-prefix=LEAK_DURI…
29 RUN: not %run %t-ThreadedLeakTest -runs=100000 -detect_leaks=0 2>&1 | FileCheck %s --check-prefix=L…
30 RUN: not %run %t-ThreadedLeakTest -runs=100000 2>&1 | FileCheck %s --check-prefix=L…
31 LEAK_AFTER: Done 100000 runs in
34 RUN: not %run %t-LeakTest -runs=100000 -max_len=1 2>&1 | FileCheck %s --check-prefix=MAX_LEN_1
|