| /external/icu/icu4j/main/classes/core/src/com/ibm/icu/text/ |
| D | BidiLine.java | 41 * The implementation of the access to same-level-runs and of the reordering
47 * same-level-runs is created. Reordering then is done on this vector.
52 * This is inefficient if there are many very short runs. If the average run
134 lineBidi.runs = new BidiRun[0]; in setLine()
280 /* this is done based on runs rather than on levels since levels have in getLogicalRun()
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()
[all …]
|
| /external/icu/android_icu4j/src/main/java/android/icu/text/ |
| D | BidiLine.java | 42 * The implementation of the access to same-level-runs and of the reordering
48 * same-level-runs is created. Reordering then is done on this vector.
53 * This is inefficient if there are many very short runs. If the average run
135 lineBidi.runs = new BidiRun[0]; in setLine()
281 /* this is done based on runs rather than on levels since levels have in getLogicalRun()
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()
[all …]
|
| /external/cronet/third_party/icu/source/common/ |
| D | ubidiln.cpp | 48 * The implementation of the access to same-level-runs and of the reordering
54 * same-level-runs is created. Reordering then is done on this vector.
59 * This is inefficient if there are many very short runs. If the average run
155 pLineBiDi->runs=NULL; in ubidi_setLine()
318 /* this is done based on runs rather than on levels since levels have in ubidi_getLogicalRun()
322 iRun=pBiDi->runs[0]; in ubidi_getLogicalRun()
325 iRun = pBiDi->runs[i]; in ubidi_getLogicalRun()
349 /* runs API functions ------------------------------------------------------- */
375 start=pBiDi->runs[runIndex].logicalStart; in ubidi_getVisualRun()
381 *pLength=pBiDi->runs[runIndex].visualLimit- in ubidi_getVisualRun()
[all …]
|
| /external/icu/icu4c/source/common/ |
| D | ubidiln.cpp | 48 * The implementation of the access to same-level-runs and of the reordering
54 * same-level-runs is created. Reordering then is done on this vector.
59 * This is inefficient if there are many very short runs. If the average run
155 pLineBiDi->runs=NULL; in ubidi_setLine()
318 /* this is done based on runs rather than on levels since levels have in ubidi_getLogicalRun()
322 iRun=pBiDi->runs[0]; in ubidi_getLogicalRun()
325 iRun = pBiDi->runs[i]; in ubidi_getLogicalRun()
349 /* runs API functions ------------------------------------------------------- */
375 start=pBiDi->runs[runIndex].logicalStart; in ubidi_getVisualRun()
381 *pLength=pBiDi->runs[runIndex].visualLimit- in ubidi_getVisualRun()
[all …]
|
| /external/skia/src/core/ |
| 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()
114 * Break the runs in the buffer at offsets x and x+count, properly
115 * updating the runs to the right and left.
[all …]
|
| D | SkRegionPriv.h | 48 static int compute_intervalcount(const SkRegionPriv::RunType runs[]) { in compute_intervalcount() argument
49 const SkRegionPriv::RunType* curr = runs; in compute_intervalcount()
55 return SkToInt((curr - runs) >> 1); in compute_intervalcount()
145 * Given a scanline (including its Bottom value at runs[0]), return the next
146 * scanline. Asserts that there is one (i.e. runs[0] < Sentinel)
148 static SkRegion::RunType* SkipEntireScanline(const SkRegion::RunType runs[]) { in SkipEntireScanline()
150 SkASSERT(runs[0] < SkRegion_kRunTypeSentinel); in SkipEntireScanline()
152 const int intervals = runs[1]; in SkipEntireScanline()
153 SkASSERT(runs[2 + intervals * 2] == SkRegion_kRunTypeSentinel); in SkipEntireScanline()
156 int n = compute_intervalcount(&runs[2]); in SkipEntireScanline()
[all …]
|
| D | SkRegion.cpp | 79 static SkRegionPriv::RunType* skip_intervals(const SkRegionPriv::RunType runs[]) { in skip_intervals() argument
80 int intervals = runs[-1]; in skip_intervals()
83 SkASSERT(runs[0] < runs[1]); in skip_intervals()
84 SkASSERT(runs[1] < SkRegion_kRunTypeSentinel); in skip_intervals()
87 SkASSERT(SkRegion_kRunTypeSentinel == runs[0]); in skip_intervals()
90 runs += intervals * 2 + 1; in skip_intervals()
91 return const_cast<SkRegionPriv::RunType*>(runs); in skip_intervals()
94 bool SkRegion::RunsAreARect(const SkRegion::RunType runs[], int count, in RunsAreARect() argument
96 assert_sentinel(runs[0], false); // top in RunsAreARect()
100 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
44 SkDebugf("Runs"); in dump()
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
[all …]
|
| D | SkBlitter.h | 39 /// Blit a horizontal run of antialiased pixels; runs[] is a *sparse*
41 /// The runs[] and antialias[] work together to represent long runs of pixels with the same
42 /// alphas. The runs[] contains the number of pixels with the same alpha, and antialias[]
43 /// contain the coverage value for that number of pixels. The runs[] (and antialias[]) are
44 /// encoded in a clever way. The runs array is zero terminated, and has enough entries for
46 /// in the runs array contains the number of pixels (np) that have the same alpha value. The
47 /// next np value is found np entries away. For example, if runs[0] = 7, then the next valid
48 /// entry will by at runs[7]. The runs array and antialias[] are coupled by index. So, if the
49 /// np entry is at runs[45] = 12 then the alpha value can be found at antialias[45] = 0x88.
51 virtual void blitAntiH(int x, int y, const SkAlpha antialias[], const int16_t runs[]) = 0;
[all …]
|
| /external/rust/crates/unicode-bidi/src/ |
| D | prepare.rs | 29 pub runs: Vec<LevelRun>, field
36 /// An isolating run sequence is a maximal sequence of level runs such that for all level runs
47 let runs = level_runs(levels, original_classes); in isolating_run_sequences() localVariable
51 let mut sequences = Vec::with_capacity(runs.len()); in isolating_run_sequences()
57 for run in runs { in isolating_run_sequences()
93 runs: sequence, in isolating_run_sequences()
98 let start_of_seq = result.runs[0].start; in isolating_run_sequences()
99 let runs_len = result.runs.len(); in isolating_run_sequences()
100 let end_of_seq = result.runs[runs_len - 1].end; in isolating_run_sequences()
120 for run in result.runs.clone() { in isolating_run_sequences()
[all …]
|
| D | deprecated.rs | 16 /// Find the level runs within a line and return them in visual order.
34 let mut runs = Vec::new(); in visual_runs() localVariable
36 // Find consecutive level runs. in visual_runs()
45 runs.push(start..i); in visual_runs()
53 runs.push(start..line.end); in visual_runs()
55 let run_count = runs.len(); in visual_runs()
57 // Re-order the odd runs. in visual_runs()
64 // Look for the start of a sequence of consecutive runs of max_level or higher. in visual_runs()
67 if levels[runs[seq_start].start] < max_level { in visual_runs()
75 if levels[runs[seq_end].start] < max_level { in visual_runs()
[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/fsverity-utils/.github/workflows/ |
| D | ci.yml | 14 runs-on: ubuntu-latest
21 runs-on: ubuntu-latest
28 runs-on: ubuntu-latest
35 runs-on: ubuntu-latest
42 runs-on: ubuntu-latest
49 runs-on: ubuntu-latest
56 runs-on: ubuntu-latest
63 runs-on: ubuntu-latest
74 runs-on: ubuntu-latest
86 runs-on: ubuntu-latest
[all …]
|
| /external/llvm/unittests/Analysis/ |
| D | CGSCCPassManagerTest.cpp | 35 TestModuleAnalysis(int &Runs) : Runs(Runs) {} in TestModuleAnalysis() argument
38 ++Runs; in run()
45 int &Runs; member in __anon671acdfb0111::TestModuleAnalysis
60 TestSCCAnalysis(int &Runs) : Runs(Runs) {} in TestSCCAnalysis() argument
63 ++Runs; in run()
70 int &Runs; member in __anon671acdfb0111::TestSCCAnalysis
85 TestFunctionAnalysis(int &Runs) : Runs(Runs) {} in TestFunctionAnalysis() argument
88 ++Runs; in run()
100 int &Runs; member in __anon671acdfb0111::TestFunctionAnalysis
114 TestImmutableFunctionAnalysis(int &Runs) : Runs(Runs) {} in TestImmutableFunctionAnalysis() argument
[all …]
|
| /external/ltp/utils/benchmark/kernbench-0.42/ |
| D | README | 12 It runs a kernel at various numbers of concurrent jobs: 1/2 number of cpus,
15 for the average of each group of runs and logs them to kernbench.log
37 kernbench [-n runs] [-o jobs] [-s] [-H] [-O] [-M] [-h] [-v]
40 s : perform single threaded runs (default don't)
41 H : don't perform half load runs (default do)
42 O : don't perform optimal load runs (default do)
43 M : don't perform maximal load runs (default do)
55 v0.40 Made all runs use the oldconfig if it exists. Changed to only do one
61 preparation and drops number of runs to 3. Modified half loads to
65 v0.20 Change to average of runs, add options to choose which runs to perform
[all …]
|
| /external/zstd/.github/workflows/ |
| D | dev-long-tests.yml | 14 runs-on: ubuntu-latest
22 runs-on: ubuntu-latest
33 runs-on: macos-latest
40 runs-on: ubuntu-latest
47 runs-on: ubuntu-latest
55 runs-on: ubuntu-latest
63 runs-on: ubuntu-latest
73 runs-on: ubuntu-latest
86 runs-on: ubuntu-latest
95 runs-on: ubuntu-latest
[all …]
|
| D | dev-short-tests.yml | 15 runs-on: ubuntu-latest
22 runs-on: ubuntu-latest
29 runs-on: ubuntu-latest
39 runs-on: ubuntu-latest
51 runs-on: ubuntu-latest
66 runs-on: ubuntu-latest
77 runs-on: ubuntu-latest
91 runs-on: ubuntu-latest
102 runs-on: ubuntu-latest
112 runs-on: ubuntu-latest
[all …]
|
| /external/autotest/client/tests/compilebench/ |
| D | compilebench.py | 53 # intial create total runs 10 avg 149.82 MB/s (user 0.63s sys 0.85s)
54 # create total runs 5 avg 27.50 MB/s (user 0.62s sys 0.83s)
55 # patch total runs 4 avg 15.01 MB/s (user 0.33s sys 0.63s)
56 # compile total runs 7 avg 41.47 MB/s (user 0.14s sys 0.75s)
57 # clean total runs 4 avg 697.77 MB/s (user 0.02s sys 0.08s)
58 # read tree total runs 2 avg 23.68 MB/s (user 0.85s sys 1.59s)
59 # read compiled tree total runs 1 avg 25.27 MB/s (user 0.98s sys 2.84s)
60 # delete tree total runs 2 avg 1.48 seconds (user 0.35s sys 0.45s)
61 # no runs for delete compiled tree
62 # stat tree total runs 4 avg 1.46 seconds (user 0.35s sys 0.26s)
[all …]
|
| /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…
|
| /external/linux-kselftest/tools/testing/selftests/resctrl/ |
| D | mbm_test.c | 22 int runs, ret, avg_diff_per; in show_bw_info() local
29 for (runs = 1; runs < NUM_OF_RUNS ; runs++) { in show_bw_info()
30 sum_bw_imc += bw_imc[runs]; in show_bw_info()
31 sum_bw_resc += bw_resc[runs]; in show_bw_info()
55 int runs, ret; in check_results() local
67 runs = 0; in check_results()
77 bw_resc[runs] = strtoul(token_array[5], NULL, 0); in check_results()
78 bw_imc[runs] = strtoul(token_array[3], NULL, 0); in check_results()
79 runs++; in check_results()
|
| D | mba_test.c | 56 int allocation, runs; in show_mba_info() local
72 for (runs = NUM_OF_RUNS * allocation + 1; in show_mba_info()
73 runs < NUM_OF_RUNS * allocation + NUM_OF_RUNS ; runs++) { in show_mba_info()
74 sum_bw_imc += bw_imc[runs]; in show_mba_info()
75 sum_bw_resc += bw_resc[runs]; in show_mba_info()
106 int runs; in check_results() local
116 runs = 0; in check_results()
127 bw_imc[runs] = strtoul(token_array[3], NULL, 0); in check_results()
129 bw_resc[runs] = strtoul(token_array[5], NULL, 0); in check_results()
130 runs++; in check_results()
|
| /external/libsrtp2/crypto/math/ |
| D | stat.c | 112 * runs[i] holds the number of runs of size (i-1)
118 uint16_t runs[6] = { 0, 0, 0, 0, 0, 0 }; in stat_test_runs() local
140 /* check for long runs */ in stat_test_runs()
142 debug_print(srtp_mod_stat, ">25 runs: %d", state); in stat_test_runs()
150 return srtp_err_status_algo_fail; /* long-runs test in stat_test_runs()
167 debug_print(srtp_mod_stat, ">25 runs (2): %d", state); in stat_test_runs()
168 return srtp_err_status_algo_fail; /* long-runs test in stat_test_runs()
172 state = 6; /* group together runs > 5 */ in stat_test_runs()
174 runs[state - 1]++; /* increment run count */ in stat_test_runs()
199 debug_print(srtp_mod_stat, "runs test", NULL); in stat_test_runs()
[all …]
|
| /external/rust/crates/rayon/src/slice/ |
| D | mergesort.rs | 111 /// Merges non-decreasing runs `v[..mid]` and `v[mid..]` using `buf` as temporary storage, and
235 /// Examines the stack of runs and identifies the next pair of runs to merge. More specifically,
236 /// if `Some(r)` is returned, that means `runs[r]` and `runs[r + 1]` must be merged next. If the
242 /// The gist of the story is: we must enforce the invariants on the top four runs on the stack.
244 /// hold for *all* runs in the stack.
246 /// This function correctly checks invariants for the top four runs. Additionally, if the top
250 fn collapse(runs: &[Run]) -> Option<usize> { in collapse()
251 let n = runs.len(); in collapse()
254 && (runs[n - 1].start == 0 in collapse()
255 || runs[n - 2].len <= runs[n - 1].len in collapse()
[all …]
|
| /external/apache-harmony/jdwp/src/test/java/org/apache/harmony/jpda/tests/jdwp/Events/ |
| D | Breakpoint002Test.java | 35 * <BR>It runs Breakpoint002Debuggee and sets breakpoint in the
45 * <BR>It runs Breakpoint002Debuggee and sets breakpoint in the
56 * <BR>It runs Breakpoint002Debuggee and sets breakpoint in the
67 * <BR>It runs Breakpoint002Debuggee and sets breakpoint in the
78 * <BR>It runs Breakpoint002Debuggee and sets breakpoint in the
89 * <BR>It runs Breakpoint002Debuggee and sets breakpoint in the
100 * <BR>It runs Breakpoint002Debuggee and sets breakpoint in the
110 * <BR>It runs Breakpoint002Debuggee and sets breakpoint in the
120 * <BR>It runs Breakpoint002Debuggee and sets breakpoint in the
130 * <BR>It runs Breakpoint002Debuggee and sets breakpoint in the
[all …]
|