Home
last modified time | relevance | path

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

12345678910>>...149

/third_party/icu/icu4j/main/classes/core/src/com/ibm/icu/text/
DBidiLine.java41 * 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 …]
/third_party/icu/ohos_icu4j/src/main/java/ohos/global/icu/text/
DBidiLine.java42 * 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 …]
/third_party/skia/src/core/
DSkAntiRun.h60 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 …]
DSkRegionPriv.h46 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()
143 * Given a scanline (including its Bottom value at runs[0]), return the next
144 * scanline. Asserts that there is one (i.e. runs[0] < Sentinel)
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()
[all …]
DSkAlphaRuns.cpp30 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 …]
DSkRegion.cpp78 static SkRegionPriv::RunType* skip_intervals(const SkRegionPriv::RunType runs[]) { in skip_intervals() argument
79 int intervals = runs[-1]; in skip_intervals()
82 SkASSERT(runs[0] < runs[1]); in skip_intervals()
83 SkASSERT(runs[1] < SkRegion_kRunTypeSentinel); in skip_intervals()
86 SkASSERT(SkRegion_kRunTypeSentinel == runs[0]); in skip_intervals()
89 runs += intervals * 2 + 1; in skip_intervals()
90 return const_cast<SkRegionPriv::RunType*>(runs); in skip_intervals()
93 bool SkRegion::RunsAreARect(const SkRegion::RunType runs[], int count, in RunsAreARect() argument
95 assert_sentinel(runs[0], false); // top in RunsAreARect()
99 assert_sentinel(runs[1], false); // bottom in RunsAreARect()
[all …]
DSkBlitter.h39 /// 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 …]
DSkBlitter.cpp49 const int16_t runs[]) {
74 int runSize = bounds.width() + 1; // +1 so we can set runs[bounds.width()] = 0 in blitFatAntiRect()
76 int16_t* runs = reinterpret_cast<int16_t*>(storage); in blitFatAntiRect() local
77 SkAlpha* alphas = reinterpret_cast<SkAlpha*>(runs + runSize); in blitFatAntiRect()
79 runs[0] = 1; in blitFatAntiRect()
80 runs[1] = bounds.width() - 2; in blitFatAntiRect()
81 runs[bounds.width() - 1] = 1; in blitFatAntiRect()
82 runs[bounds.width()] = 0; in blitFatAntiRect()
96 this->blitAntiH(bounds.fLeft, bounds.fTop, alphas, runs); in blitFatAntiRect()
107 this->blitAntiH(bounds.fLeft, bounds.fBottom - 1, alphas, runs); in blitFatAntiRect()
[all …]
/third_party/skia/m133/src/core/
DSkAlphaRuns.h65 int16_t* runs = fRuns + offsetX; in add() local
71 SkAlphaRuns::Break(runs, alpha, x, 1); in add()
81 runs += x + 1; in add()
88 SkAlphaRuns::Break(runs, alpha, x, middleCount); in add()
90 runs += x; in add()
94 int n = runs[0]; in add()
97 runs += n; in add()
105 SkAlphaRuns::Break(runs, alpha, x, 1); in add()
119 * Break the runs in the buffer at offsets x and x+count, properly
120 * updating the runs to the right and left.
[all …]
DSkRegionPriv.h48 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 …]
DSkAlphaRuns.cpp29 const int16_t* runs = fRuns; in assertValid() local
32 while (*runs) { in assertValid()
34 alpha += *runs; in assertValid()
35 runs += *runs; in assertValid()
40 const int16_t* runs = fRuns; in dump() local
43 SkDebugf("Runs"); in dump()
44 while (*runs) { in dump()
45 int n = *runs; in dump()
52 runs += n; in dump()
61 const int16_t* runs = fRuns; in validate() local
[all …]
DSkRegion.cpp86 static SkRegionPriv::RunType* skip_intervals(const SkRegionPriv::RunType runs[]) { in skip_intervals() argument
87 int intervals = runs[-1]; in skip_intervals()
90 SkASSERT(runs[0] < runs[1]); in skip_intervals()
91 SkASSERT(runs[1] < SkRegion_kRunTypeSentinel); in skip_intervals()
94 SkASSERT(SkRegion_kRunTypeSentinel == runs[0]); in skip_intervals()
97 runs += intervals * 2 + 1; in skip_intervals()
98 return const_cast<SkRegionPriv::RunType*>(runs); in skip_intervals()
101 bool SkRegion::RunsAreARect(const SkRegion::RunType runs[], int count, in RunsAreARect() argument
103 assert_sentinel(runs[0], false); // top in RunsAreARect()
107 assert_sentinel(runs[1], false); // bottom in RunsAreARect()
[all …]
DSkBlitter.h45 /// Blit a horizontal run of antialiased pixels; runs[] is a *sparse*
47 /// The runs[] and antialias[] work together to represent long runs of pixels with the same
48 /// alphas. The runs[] contains the number of pixels with the same alpha, and antialias[]
49 /// contain the coverage value for that number of pixels. The runs[] (and antialias[]) are
50 /// encoded in a clever way. The runs array is zero terminated, and has enough entries for
52 /// in the runs array contains the number of pixels (np) that have the same alpha value. The
53 /// next np value is found np entries away. For example, if runs[0] = 7, then the next valid
54 /// entry will by at runs[7]. The runs array and antialias[] are coupled by index. So, if the
55 /// np entry is at runs[45] = 12 then the alpha value can be found at antialias[45] = 0x88.
57 virtual void blitAntiH(int x, int y, const SkAlpha antialias[], const int16_t runs[]) = 0;
[all …]
DSkBlitter.cpp57 const int16_t runs[]) {
82 int runSize = bounds.width() + 1; // +1 so we can set runs[bounds.width()] = 0 in blitFatAntiRect()
84 int16_t* runs = reinterpret_cast<int16_t*>(storage); in blitFatAntiRect() local
85 SkAlpha* alphas = reinterpret_cast<SkAlpha*>(runs + runSize); in blitFatAntiRect()
87 runs[0] = 1; in blitFatAntiRect()
88 runs[1] = bounds.width() - 2; in blitFatAntiRect()
89 runs[bounds.width() - 1] = 1; in blitFatAntiRect()
90 runs[bounds.width()] = 0; in blitFatAntiRect()
104 this->blitAntiH(bounds.fLeft, bounds.fTop, alphas, runs); in blitFatAntiRect()
115 this->blitAntiH(bounds.fLeft, bounds.fBottom - 1, alphas, runs); in blitFatAntiRect()
[all …]
/third_party/icu/icu4c/source/common/
Dubidiln.cpp48 * 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 …]
/third_party/skia/third_party/externals/icu/source/common/
Dubidiln.cpp48 * 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 …]
/third_party/skia/m133/third_party/externals/icu/source/common/
Dubidiln.cpp48 * 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=nullptr; 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 …]
/third_party/fsverity-utils/.github/workflows/
Dci.yml14 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 …]
/third_party/json/tests/thirdparty/Fuzzer/test/
Dfuzzer-traces-hooks.test6 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…
17 RUN: not LLVMFuzzer-StrstrTest -seed=6 -runs=200000 2>&1 | FileCheck %s
18 RUN: LLVMFuzzer-StrstrTest -use_memmem=0 -seed=7 -runs=1000000 2>&1 | FileCheck %s --check-pre…
20 RUN: LLVMFuzzer-RepeatedMemcmp -seed=10 -runs=100000 2>&1 | FileCheck %s --check-prefix=RECOMMENDED…
Dfuzzer-leak.test2 RUN: not LLVMFuzzer-LeakTest -runs=100000 -detect_leaks=1 2>&1 | FileCheck %s --check-prefix=LEAK_D…
10 RUN: not LLVMFuzzer-LeakTest -runs=0 -detect_leaks=1 %S 2>&1 | FileCheck %s --check-prefix=LEAK_IN_…
14 RUN: not LLVMFuzzer-LeakTest -runs=100000000 %S/hi.txt 2>&1 | FileCheck %s --check-prefix=MULTI_RUN…
18 RUN: not LLVMFuzzer-LeakTest -runs=100000 -detect_leaks=0 2>&1 | FileCheck %s --check-prefix=LEAK_A…
19 RUN: not LLVMFuzzer-LeakTest -runs=100000 2>&1 | FileCheck %s --check-prefix=LEAK_D…
20 RUN: not LLVMFuzzer-ThreadedLeakTest -runs=100000 -detect_leaks=0 2>&1 | FileCheck %s --check-prefi…
21 RUN: not LLVMFuzzer-ThreadedLeakTest -runs=100000 2>&1 | FileCheck %s --check-prefi…
22 LEAK_AFTER: Done 100000 runs in
25 RUN: not LLVMFuzzer-LeakTest -runs=100000 -max_len=1 2>&1 | FileCheck %s --check-prefix=MAX_LEN_1
32 RUN: LLVMFuzzer-AccumulateAllocationsTest -detect_leaks=1 -runs=100000 2>&1 | FileCheck %s --check-…
Dfuzzer-threaded.test1 CHECK: Done 1000 runs in
3 RUN: LLVMFuzzer-ThreadedTest -use_traces=1 -runs=1000 2>&1 | FileCheck %s
4 RUN: LLVMFuzzer-ThreadedTest -use_traces=1 -runs=1000 2>&1 | FileCheck %s
5 RUN: LLVMFuzzer-ThreadedTest -use_traces=1 -runs=1000 2>&1 | FileCheck %s
6 RUN: LLVMFuzzer-ThreadedTest -use_traces=1 -runs=1000 2>&1 | FileCheck %s
/third_party/ltp/utils/benchmark/kernbench-0.42/
DREADME12 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 …]
/third_party/ntfs-3g/ntfsprogs/
Dcluster.c53 runlist *runs; in cluster_find() local
81 runs = ntfs_mapping_pairs_decompress(vol, a_ctx->attr, NULL); in cluster_find()
82 if (!runs) { in cluster_find()
83 ntfs_log_error("Couldn't read the data runs.\n"); in cluster_find()
91 for (j = 0; runs[j].length > 0; j++) { in cluster_find()
92 LCN a_begin = runs[j].lcn; in cluster_find()
93 LCN a_end = a_begin + runs[j].length - 1; in cluster_find()
99 (long long)runs[j].vcn, in cluster_find()
100 (long long)runs[j].lcn, in cluster_find()
101 (long long)(runs[j].lcn + in cluster_find()
[all …]
/third_party/ffmpeg/libavcodec/
Dfaxcompr.c129 unsigned int *pix_left, int **runs, in decode_uncompressed() argument
164 *(*runs)++ = saved_run; in decode_uncompressed()
165 if (*runs >= runend) { in decode_uncompressed()
181 *(*runs)++ = saved_run; in decode_uncompressed()
182 if (*runs >= runend) { in decode_uncompressed()
196 *(*runs)++ = 0; in decode_uncompressed()
197 if (*runs >= runend) { in decode_uncompressed()
207 unsigned int pix_left, int *runs, in decode_group3_1d_line() argument
219 *runs++ = run; in decode_group3_1d_line()
220 if (runs >= runend) { in decode_group3_1d_line()
[all …]
/third_party/rust/crates/serde/.github/workflows/
Dci.yml18 runs-on: ubuntu-latest
27 runs-on: windows-latest
36 runs-on: ubuntu-latest
52 runs-on: ${{matrix.os}}-latest
76 runs-on: ubuntu-latest
93 runs-on: ubuntu-latest
104 runs-on: ubuntu-latest
113 runs-on: ubuntu-latest
123 runs-on: ubuntu-latest
137 runs-on: ubuntu-latest
[all …]

12345678910>>...149