Home
last modified time | relevance | path

Searched full:runs (Results 1 – 25 of 2826) sorted by relevance

12345678910>>...114

/external/icu/android_icu4j/src/main/java/android/icu/text/
DBidiLine.java40 * The implementation of the access to same-level-runs and of the reordering
46 * same-level-runs is created. Reordering then is done on this vector.
51 * This is inefficient if there are many very short runs. If the average run
133 lineBidi.runs = new BidiRun[0]; in setLine()
279 /* this is done based on runs rather than on levels since levels have in getLogicalRun()
286 iRun = bidi.runs[0]; in getLogicalRun()
289 iRun = bidi.runs[i]; in getLogicalRun()
305 int start = bidi.runs[runIndex].start; in getVisualRun()
307 byte level = bidi.runs[runIndex].level; in getVisualRun()
311 bidi.runs[runIndex].limit - in getVisualRun()
[all …]
/external/icu/icu4j/main/classes/core/src/com/ibm/icu/text/
DBidiLine.java39 * The implementation of the access to same-level-runs and of the reordering
45 * same-level-runs is created. Reordering then is done on this vector.
50 * This is inefficient if there are many very short runs. If the average run
132 lineBidi.runs = new BidiRun[0]; in setLine()
278 /* this is done based on runs rather than on levels since levels have in getLogicalRun()
285 iRun = bidi.runs[0]; in getLogicalRun()
288 iRun = bidi.runs[i]; in getLogicalRun()
304 int start = bidi.runs[runIndex].start; in getVisualRun()
306 byte level = bidi.runs[runIndex].level; in getVisualRun()
310 bidi.runs[runIndex].limit - in getVisualRun()
[all …]
/external/icu/icu4c/source/common/
Dubidiln.c46 * 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; in ubidi_setLine()
316 /* this is done based on runs rather than on levels since levels have in ubidi_getLogicalRun()
320 iRun=pBiDi->runs[0]; in ubidi_getLogicalRun()
323 iRun = pBiDi->runs[i]; in ubidi_getLogicalRun()
347 /* runs API functions ------------------------------------------------------- */
373 start=pBiDi->runs[runIndex].logicalStart; in ubidi_getVisualRun()
379 *pLength=pBiDi->runs[runIndex].visualLimit- in ubidi_getVisualRun()
[all …]
/external/skia/src/core/
DSkRegion.cpp33 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 …]
DSkAntiRun.h55 int16_t* runs = fRuns + offsetX; in add() local
61 SkAlphaRuns::Break(runs, alpha, x, 1); in add()
71 runs += x + 1; in add()
78 SkAlphaRuns::Break(runs, alpha, x, middleCount); in add()
80 runs += x; in add()
84 int n = runs[0]; in add()
87 runs += n; in add()
95 SkAlphaRuns::Break(runs, alpha, x, 1); in add()
109 * Break the runs in the buffer at offsets x and x+count, properly
110 * updating the runs to the right and left.
[all …]
DSkRegionPriv.h25 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 * Given a scanline (including its Bottom value at runs[0]), return the next
121 * scanline. Asserts that there is one (i.e. runs[0] < Sentinel)
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()
[all …]
DSkAlphaRuns.cpp31 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
45 SkDebugf("Runs"); in dump()
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
[all …]
DSkBlitter.h32 /// Blit a horizontal run of antialiased pixels; runs[] is a *sparse*
35 const int16_t runs[]);
60 int16_t runs[3]; in blitAntiH2() local
63 runs[0] = 1; in blitAntiH2()
64 runs[1] = 1; in blitAntiH2()
65 runs[2] = 0; in blitAntiH2()
68 this->blitAntiH(x, y, aa, runs); in blitAntiH2()
73 int16_t runs[2]; in blitAntiV2() local
76 runs[0] = 1; in blitAntiV2()
77 runs[1] = 0; in blitAntiV2()
[all …]
DSkBlitter.cpp46 const int16_t runs[]) { in blitAntiH() argument
54 int16_t runs[2]; in blitV() local
55 runs[0] = 1; in blitV()
56 runs[1] = 0; in blitV()
59 this->blitAntiH(x, y++, &alpha, runs); in blitV()
192 int16_t* runs = runStorage.get(); in blitMask() local
195 sk_memset16((uint16_t*)runs, 1, width); in blitMask()
196 runs[width] = 0; in blitMask()
201 this->blitAntiH(clip.fLeft, y, aa, runs); in blitMask()
249 const int16_t runs[]) {} in blitAntiH() argument
[all …]
DSkBlitter_RGB16.cpp67 const int16_t* runs) override;
94 void blitAntiH(int x, int y, const SkAlpha* antialias, const int16_t* runs) override;
108 void blitAntiH(int x, int y, const SkAlpha* antialias, const int16_t* runs) override;
122 const int16_t* runs) override;
144 const int16_t* runs) override;
232 const int16_t* SK_RESTRICT runs) { in blitAntiH() argument
236 int count = runs[0]; in blitAntiH()
241 runs += count; in blitAntiH()
293 const int16_t* SK_RESTRICT runs) { in blitAntiH() argument
304 int count = runs[0]; in blitAntiH()
[all …]
/external/autotest/client/site_tests/kernel_LTP/
Dltp-diff.py11 # where the results of those runs differ
13 # 0 if all runs had identical results
32 Return dictionary keyed on unique testnames across all runs.
38 runs = {}
41 runs[i] = {}
54 runs[i][testname] = status
59 return (runs, testnames)
63 def compare_results(runs): argument
66 Print any testnames with differing results across runs.
67 Return 1 if any test results across runs differ.
[all …]
/external/autotest/client/tests/ltp/
Dltp-diff.py11 # where the results of those runs differ
13 # 0 if all runs had identical results
31 Return dictionary keyed on unique testnames across all runs.
35 runs = {}
38 runs[i] = {}
51 runs[i][testname] = status
56 return (runs, testnames)
60 def compare_results(runs): argument
63 Print any testnames with differing results across runs.
64 Return 1 if any test results across runs differ.
[all …]
/external/srtp/crypto/math/
Dstat.c76 * runs[i] holds the number of runs of size (i-1)
82 uint16_t runs[6] = { 0, 0, 0, 0, 0, 0 }; in stat_test_runs() local
107 /* check for long runs */ in stat_test_runs()
109 debug_print(mod_stat, ">25 runs: %d", state); in stat_test_runs()
118 return err_status_algo_fail; /* long-runs test failed */ in stat_test_runs()
137 debug_print(mod_stat, ">25 runs (2): %d", state); in stat_test_runs()
138 return err_status_algo_fail; /* long-runs test failed */ in stat_test_runs()
141 state = 6; /* group together runs > 5 */ in stat_test_runs()
143 runs[state-1]++; /* increment run count */ in stat_test_runs()
169 debug_print(mod_stat, "runs test", NULL); in stat_test_runs()
[all …]
/external/llvm/lib/Fuzzer/test/
Dfuzzer-traces.test2 Done1000000: Done 1000000 runs in
4 RUN: not LLVMFuzzer-SimpleCmpTest -use_traces=1 -seed=1 -runs=1000001 2>&1 | FileCheck %s
6 RUN: not LLVMFuzzer-MemcmpTest -use_traces=1 -seed=4294967295 -runs=100000 2>&1 | FileCheck %s
7 RUN: LLVMFuzzer-MemcmpTest -seed=4294967295 -runs=1000000 2>&1 | FileCheck %s --…
9 RUN: not LLVMFuzzer-StrncmpTest -use_traces=1 -seed=1 -runs=100000 2>&1 | FileCheck %s
10 RUN: LLVMFuzzer-StrncmpTest -seed=1 -runs=1000000 2>&1 | FileCheck %s --check-pr…
12 RUN: not LLVMFuzzer-StrcmpTest -use_traces=1 -seed=1 -runs=200000 2>&1 | FileCheck %s
13 RUN: LLVMFuzzer-StrcmpTest -seed=1 -runs=1000000 2>&1 | FileCheck %s --check-pre…
15 RUN: not LLVMFuzzer-SwitchTest -use_traces=1 -seed=1 -runs=1000002 2>&1 | FileCheck %s
16 RUN: LLVMFuzzer-SwitchTest -seed=1 -runs=1000000 2>&1 | FileCheck %s --check-pre…
[all …]
Dfuzzer-dfsan.test9 RUN: not LLVMFuzzer-SimpleCmpTest-DFSan -use_traces=1 -seed=1 -runs=1000000 -timeout=5 2>&1 | FileC…
10 RUN: LLVMFuzzer-SimpleCmpTest-DFSan -use_traces=1 -seed=1 -runs=100 -timeout=5 -verbosity=3 2>&1 | …
12 RUN: not LLVMFuzzer-MemcmpTest-DFSan -use_traces=1 -seed=1 -runs=10000 -timeout=5 2>&1 | FileCheck …
13 RUN: LLVMFuzzer-MemcmpTest-DFSan -use_traces=1 -seed=1 -runs=2 -timeout=5 -verbosity=3 2>&1 | FileC…
15 RUN: not LLVMFuzzer-StrncmpTest-DFSan -use_traces=1 -seed=1 -runs=10000 -timeout=5 2>&1 | FileCheck…
16 RUN: LLVMFuzzer-StrncmpTest-DFSan -use_traces=1 -seed=1 -runs=2 -timeout=5 -verbosity=3 2>&1 | File…
18 RUN: not LLVMFuzzer-StrcmpTest-DFSan -use_traces=1 -seed=1 -runs=10000 -timeout=5 2>&1 | FileCheck …
19 RUN: LLVMFuzzer-StrcmpTest-DFSan -use_traces=1 -seed=1 -runs=2 -timeout=5 -verbosity=3 2>&1…
21 RUN: not LLVMFuzzer-SwitchTest-DFSan -use_traces=1 -seed=1 -runs=100000 -timeout=5 2>&…
22 RUN: LLVMFuzzer-SwitchTest-DFSan -use_traces=1 -seed=1 -runs=2 -timeout=5 -verbosity=3 2>&1…
/external/opencv/cvaux/src/
Dcvprewarp.cpp52 int *runs_1, /* result runs 1 */ in icvFindRuns()
53 int *runs_2, /* result runs 2 */ in icvFindRuns()
54 int *num_runs_1, /* numbers of first runs */ in icvFindRuns()
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()
149 int *runs_1, /* result runs 1 */ in cvFindRuns()
[all …]
/external/autotest/tko/
Dnightly.py50 runs = {} # platform --> list of test runs
64 runs.setdefault(platform, []).append(testrunx)
65 return runs
77 # partition all twoway runs based on name of antagonist progs
81 runs = {}
85 runs.setdefault(antag, []).append(testrunx)
87 twoway_runs[kernel] = runs
91 def collect_raw_scores(runs, metric): argument
92 # get unscaled scores of test runs for 1 test on certain jobs
95 for platform in runs:
[all …]
/external/autotest/client/tests/compilebench/
Dcompilebench.py53 # 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/apache-harmony/jdwp/src/test/java/org/apache/harmony/jpda/tests/jdwp/Events/
DBreakpoint002Test.java35 * <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 …]
/external/eclipse-windowbuilder/propertysheet/src/org/eclipse/wb/internal/core/utils/execution/
DExecutionUtils.java52 * Waits given number of milliseconds and runs events loop every 1 millisecond. At least one
78 * Runs given {@link RunnableEx} and ignores exceptions.
92 * Runs given {@link RunnableEx} and logs exceptions using {@link DesignerPlugin#log(Throwable)}.
107 * Runs given {@link RunnableEx} and re-throws exceptions using {@link RuntimeException}.
118 * Runs given {@link RunnableEx} and re-throws exceptions using {@link RuntimeException}.
130 * Ensures that {@link Beans#isDesignTime()} returns <code>true</code> and runs given
144 * Ensures that {@link Beans#isDesignTime()} returns <code>true</code> and runs given
163 * Runs given {@link RunnableEx} inside of UI thread, using {@link Display#syncExec(Runnable)}.
179 * Runs given {@link RunnableEx} inside of UI thread, using {@link Display#syncExec(Runnable)}.
191 * Runs given {@link RunnableEx} within UI thread using {@link Display#asyncExec(Runnable)}. Logs
[all …]
/external/llvm/unittests/IR/
DPassManagerTest.cpp35 TestFunctionAnalysis(int &Runs) : Runs(Runs) {} in TestFunctionAnalysis() argument
39 ++Runs; in run()
52 int &Runs; member in __anone814850a0111::TestFunctionAnalysis
68 TestModuleAnalysis(int &Runs) : Runs(Runs) {} in TestModuleAnalysis() argument
71 ++Runs; in run()
81 int &Runs; member in __anone814850a0111::TestModuleAnalysis
142 // Typical path just runs the analysis as needed. in run()
245 // Count the runs over a Function. in TEST_F()
264 // Count the runs over a module. in TEST_F()
268 // Count the runs over a Function in a separate manager. in TEST_F()
/external/autotest/client/deps/glbench/src/
Dtestbase.h20 // Runs test->TestFunc() passing it sequential powers of two recording time it
21 // took until reaching a minimum amount of testing time. The last two runs are
25 // Runs Bench on an instance of TestBase and prints out results.
46 // Runs the test case n times.
68 // Runs the test and reports results in mpixels per second, assuming each
71 // Runs the test and reports results in mpixels per second, assuming each
75 // Runs the test three times: with blending on; with depth test enabled and
/external/libchrome/base/message_loop/
Dmessage_loop_test.cc72 // This function runs slowly to simulate a large amount of work being done.
205 // Test that a delayed task still runs after a normal tasks even if the in RunTest_PostDelayedTask_InPostOrder_2()
232 // Test that a delayed task still runs after a pile of normal tasks. The key in RunTest_PostDelayedTask_InPostOrder_3()
390 RUNS, enumerator
697 order->RecordStart(RUNS, cookie); in FuncThatRuns()
702 order->RecordEnd(RUNS, cookie); in FuncThatRuns()
728 FROM_HERE, Bind(&OrderedFunc, &order, 4)); // never runs in RunTest_QuitNow()
734 EXPECT_EQ(order.Get(task_index++), TaskItem(RUNS, 1, true)); in RunTest_QuitNow()
737 EXPECT_EQ(order.Get(task_index++), TaskItem(RUNS, 1, false)); in RunTest_QuitNow()
766 EXPECT_EQ(order.Get(task_index++), TaskItem(RUNS, 1, true)); in RunTest_RunLoopQuitTop()
[all …]
/external/apache-harmony/jdwp/src/test/java/org/apache/harmony/jpda/tests/jdwp/EventModifiers/
DThreadOnlyModifierTest.java56 * <BR>It runs ThreadOnlyModifierDebuggee and sets BREAKPOINT to its
79 * <BR>It runs ThreadOnlyModifierDebuggee and sets METHOD_ENTRY to the
98 * <BR>It runs ThreadOnlyModifierDebuggee and sets METHOD_EXIT to the
118 * <BR>It runs ThreadOnlyModifierDebuggee and sets
139 * <BR>It runs ThreadOnlyModifierDebuggee and sets EXCEPTION to the
161 * <BR>It runs ThreadOnlyModifierDebuggee and requests THREAD_START event.
179 * <BR>It runs ThreadOnlyModifierDebuggee and requests THREAD_END event.
197 * <BR>It runs ThreadOnlyModifierDebuggee and requests FIELD_ACCESS event
221 * <BR>It runs ThreadOnlyModifierDebuggee and requests FIELD_MODIFICATION
/external/google-breakpad/src/client/linux/handler/
Dexception_handler.cc64 // context which it runs in.
136 // Runs before crashing: normal context.
164 // Runs before crashing: normal context.
217 // Runs before crashing: normal context.
247 // Runs before crashing: normal context.
262 // Runs before crashing: normal context.
295 // This function runs in a compromised context: see the top of the file.
296 // Runs on the crashing thread.
314 // This function runs in a compromised context: see the top of the file.
315 // Runs on the crashing thread.
[all …]

12345678910>>...114