| /external/skqp/src/core/ |
| SkScan_Antihair.cpp | 71 int16_t runs[HLINE_STACK_BUFFER + 1]; local
80 runs[0] = SkToS16(n);
81 runs[n] = 0;
82 blitter->blitAntiH(x, y, aa, runs);
|
| SkBlitter.cpp | 39 const int16_t runs[]) {
53 int runSize = bounds.width() + 1; // +1 so we can set runs[bounds.width()] = 0
55 int16_t* runs = reinterpret_cast<int16_t*>(storage); local
56 SkAlpha* alphas = reinterpret_cast<SkAlpha*>(runs + runSize);
58 runs[0] = 1;
59 runs[1] = bounds.width() - 2;
60 runs[bounds.width() - 1] = 1;
61 runs[bounds.width()] = 0;
71 this->blitAntiH(bounds.fLeft, bounds.fTop, alphas, runs);
79 this->blitAntiH(bounds.fLeft, bounds.fBottom - 1, alphas, runs);
86 int16_t* runs = reinterpret_cast<int16_t*>(storage); local
154 int16_t runs[2]; local
297 int16_t* runs = runStorage.get(); local
[all...] |
| SkMaskFilter.cpp | 141 int16_t* runs = (int16_t*)storage.get(); local
142 uint8_t* alpha = (uint8_t*)(runs + innerW + 1);
152 runs[0] = width;
153 runs[width] = 0;
155 blitter->blitAntiH(r.left(), outerR.top() + y, alpha, runs);
165 runs[0] = width;
166 runs[width] = 0;
168 blitter->blitAntiH(r.left(), outerR.bottom() - y - 1, alpha, runs);
|
| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/thread/thread.condition/thread.condition.condvar/ |
| wait_until_pred.pass.cpp | 60 int runs = 0; variable
72 if (runs == 0)
84 ++runs;
|
| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/thread/thread.condition/thread.condition.condvarany/ |
| wait_until_pred.pass.cpp | 64 int runs = 0; variable
76 if (runs == 0)
88 ++runs;
|
| /external/libvncserver/libvncserver/ |
| zrleencodetemplate.c | 127 /* First find the palette and the number of runs */
131 int runs = 0; local
154 runs++;
182 plainRleBytes = ((BPPOUT/8)+1) * (runs + singlePixels);
190 int paletteRleBytes = (BPPOUT/8) * ph->size + 2 * runs + singlePixels;
|
| /frameworks/base/core/java/com/android/internal/graphics/palette/ |
| VariationalKMeansQuantizer.java | 49 * consistent results across multiple runs.
130 int runs = mInitializations; local
131 while (runs > 0) {
133 Log.d(TAG, "k-means run: " + runs);
144 runs--;
|
| /frameworks/minikin/include/minikin/ |
| MeasuredText.h | 171 std::vector<std::unique_ptr<Run>> runs; member in class:minikin::MeasuredText
198 MeasuredText(const U16StringPiece& textBuf, std::vector<std::unique_ptr<Run>>&& runs,
200 : widths(textBuf.size()), extents(textBuf.size()), runs(std::move(runs)) {
|
| /tools/apkzlib/src/test/java/com/android/tools/build/apkzlib/zip/ |
| FileUseMapTest.java | 36 * is not significantly downgraded. This test creates a map and does several runs until
42 * <p>After all runs are completed, the average time of the first runs (the head time) and
43 * the average time of the last runs (the tail time) is computed, as well as the average
67 long[] runs = new long[MAX_RUNS]; local
72 && currentRun < runs.length) {
86 runs[currentRun] = runStopwatch.elapsed(TimeUnit.NANOSECONDS);
92 initialAvg += runs[i];
99 endAvg += runs[i];
105 for (int i = 0; i < runs.length; i++)
[all...] |
| /external/aac/libDRCdec/src/ |
| drcGainDec_process.cpp | 176 /* runs = ceil((stop - start - start_offset)/stepsize). This works for
178 INT runs = (INT)(stop - start - start_offset + stepsize - 1) >> local
188 interpolateDrcGain_func1(buffer, a, a_step, n_min, runs);
192 for (int i = 0; i < runs; i++) {
|
| /external/skia/src/pathops/ |
| SkPathWriter.cpp | 203 SkOpPtT const* const* runs = fEndPtTs.begin(); // starts, ends of partial contours local
209 const SkOpPtT* eStart = runs[index];
210 const SkOpPtT* eEnd = runs[index + 1];
232 const SkOpPtT* oPtT = runs[rIndex];
234 const SkOpPtT* iPtT = runs[iIndex];
|
| /external/skqp/src/pathops/ |
| SkPathWriter.cpp | 203 SkOpPtT const* const* runs = fEndPtTs.begin(); // starts, ends of partial contours local
209 const SkOpPtT* eStart = runs[index];
210 const SkOpPtT* eEnd = runs[index + 1];
232 const SkOpPtT* oPtT = runs[rIndex];
234 const SkOpPtT* iPtT = runs[iIndex];
|
| /external/webp/src/utils/ |
| huffman_encode_utils.c | 337 int runs; local
339 runs = k - i;
341 tokens = CodeRepeatedZeros(runs, tokens);
343 tokens = CodeRepeatedValues(runs, tokens, value, prev_value);
346 i += runs;
|
| /frameworks/minikin/tests/unittest/ |
| FontCollectionItemizeTest.cpp | 104 std::vector<FontCollection::Run> runs; local
111 itemize(collection, "'a' 'b' 'c' 'd' 'e'", kRegularStyle, &runs);
112 ASSERT_EQ(1U, runs.size());
113 EXPECT_EQ(0, runs[0].start);
114 EXPECT_EQ(5, runs[0].end);
115 EXPECT_EQ(kLatinFont, getFontName(runs[0]));
116 EXPECT_FALSE(runs[0].fakedFont.fakery.isFakeBold());
117 EXPECT_FALSE(runs[0].fakedFont.fakery.isFakeItalic());
119 itemize(collection, "'a' 'b' 'c' 'd' 'e'", kItalicStyle, &runs);
120 ASSERT_EQ(1U, runs.size())
176 std::vector<FontCollection::Run> runs; local
217 std::vector<FontCollection::Run> runs; local
278 std::vector<FontCollection::Run> runs; local
363 std::vector<FontCollection::Run> runs; local
400 std::vector<FontCollection::Run> runs; local
537 std::vector<FontCollection::Run> runs; local
660 std::vector<FontCollection::Run> runs; local
684 std::vector<FontCollection::Run> runs; local
733 std::vector<FontCollection::Run> runs; local
744 std::vector<FontCollection::Run> runs; local
952 std::vector<FontCollection::Run> runs; local
1269 std::vector<FontCollection::Run> runs; local
1278 std::vector<FontCollection::Run> runs; local
1358 std::vector<FontCollection::Run> runs; local
1438 std::vector<FontCollection::Run> runs; local
1475 std::vector<FontCollection::Run> runs; local
1493 std::vector<FontCollection::Run> runs; local
1528 std::vector<FontCollection::Run> runs; local
1552 std::vector<FontCollection::Run> runs; local
1568 std::vector<FontCollection::Run> runs; local
[all...] |
| /external/compiler-rt/lib/profile/ |
| GCDAProfiling.c | 427 uint32_t runs = 1; local
454 runs += read_32bit_value(); /* Add previous run count to new counter. */
464 write_32bit_value(runs);
473 fprintf(stderr, "llvmgcda: %u runs\n", runs);
|
| /external/icu/android_icu4j/src/main/java/android/icu/text/ |
| 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];
281 /* this is done based on runs rather than on levels since levels have
288 iRun = bidi.runs[0];
291 iRun = bidi.runs[i];
307 int start = bidi.runs[runIndex].start;
309 byte level = bidi.runs[runIndex].level;
313 bidi.runs[runIndex].limit
371 BidiRun[] runs; local
451 BidiRun[] runs = bidi.runs; local
528 BidiRun[] runs; local
822 BidiRun[] runs = bidi.runs; local
848 BidiRun runs[] = bidi.runs; local
868 BidiRun[] runs = bidi.runs; local
913 BidiRun[] runs; local
1021 BidiRun[] runs = bidi.runs; local
1112 BidiRun[] runs = bidi.runs; local
[all...] |
| /external/icu/icu4c/source/common/ |
| 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;
318 /* this is done based on runs rather than on levels since levels have
322 iRun=pBiDi->runs[0];
325 iRun = pBiDi->runs[i];
349 /* runs API functions ------------------------------------------------------- */
375 start=pBiDi->runs[runIndex].logicalStart;
381 *pLength=pBiDi->runs[runIndex].visualLimit
438 Run *runs, tempRun; local
521 Run *runs=pBiDi->runs; local
600 Run *runs; local
896 Run *runs=pBiDi->runs; local
923 Run *runs=pBiDi->runs; local
943 Run *runs=pBiDi->runs; local
988 Run *runs; local
1124 Run *runs=pBiDi->runs; local
1223 Run *runs=pBiDi->runs, *runsLimit=runs+pBiDi->runCount; local
[all...] |
| /external/icu/icu4j/main/classes/core/src/com/ibm/icu/text/ |
| 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];
280 /* this is done based on runs rather than on levels since levels have
287 iRun = bidi.runs[0];
290 iRun = bidi.runs[i];
306 int start = bidi.runs[runIndex].start;
308 byte level = bidi.runs[runIndex].level;
312 bidi.runs[runIndex].limit
370 BidiRun[] runs; local
450 BidiRun[] runs = bidi.runs; local
527 BidiRun[] runs; local
821 BidiRun[] runs = bidi.runs; local
847 BidiRun runs[] = bidi.runs; local
867 BidiRun[] runs = bidi.runs; local
912 BidiRun[] runs; local
1020 BidiRun[] runs = bidi.runs; local
1111 BidiRun[] runs = bidi.runs; local
[all...] |
| /external/skia/src/core/ |
| SkBlitter.cpp | 40 const int16_t runs[]) {
54 int runSize = bounds.width() + 1; // +1 so we can set runs[bounds.width()] = 0
56 int16_t* runs = reinterpret_cast<int16_t*>(storage); local
57 SkAlpha* alphas = reinterpret_cast<SkAlpha*>(runs + runSize);
59 runs[0] = 1;
60 runs[1] = bounds.width() - 2;
61 runs[bounds.width() - 1] = 1;
62 runs[bounds.width()] = 0;
72 this->blitAntiH(bounds.fLeft, bounds.fTop, alphas, runs);
80 this->blitAntiH(bounds.fLeft, bounds.fBottom - 1, alphas, runs);
89 int16_t* runs = alloc->makeArrayDefault<int16_t>(runSize); local
161 int16_t runs[2]; local
304 int16_t* runs = runStorage.get(); local
[all...] |
| SkMaskFilter.cpp | 142 int16_t* runs = (int16_t*)storage.get(); local
143 uint8_t* alpha = (uint8_t*)(runs + innerW + 1);
153 runs[0] = width;
154 runs[width] = 0;
156 blitter->blitAntiH(r.left(), outerR.top() + y, alpha, runs);
166 runs[0] = width;
167 runs[width] = 0;
169 blitter->blitAntiH(r.left(), outerR.bottom() - y - 1, alpha, runs);
|
| /frameworks/base/tests/JankBench/app/src/main/java/com/android/benchmark/results/ |
| GlobalResultsStore.java | 360 ArrayList<UiBenchmarkResult> runs = detailedResults.get(test); local
361 for (int i = 0; i < runs.size(); i++) {
362 UiBenchmarkResult run = runs.get(i);
|
| /external/skia/tools/shape/ |
| SkShaper_harfbuzz.cpp | 415 const SkTArray<ShapedRun>& runs = *fRuns; local
416 SkASSERT(fRunIndex < runs.count());
417 SkASSERT(fGlyphIndex < runs[fRunIndex].fNumGlyphs);
420 if (fGlyphIndex == runs[fRunIndex].fNumGlyphs) {
423 if (fRunIndex >= runs.count()) {
427 return &runs[fRunIndex].fGlyphs[fGlyphIndex];
431 const SkTArray<ShapedRun>& runs = *fRuns;
432 if (fRunIndex >= runs.count()) {
435 return &runs[fRunIndex].fGlyphs[fGlyphIndex];
492 SkTArray<ShapedRun> runs; local
[all...] |
| /external/skqp/tools/shape/ |
| SkShaper_harfbuzz.cpp | 413 const SkTArray<ShapedRun>& runs = *fRuns; local
414 SkASSERT(fRunIndex < runs.count());
415 SkASSERT(fGlyphIndex < runs[fRunIndex].fNumGlyphs);
418 if (fGlyphIndex == runs[fRunIndex].fNumGlyphs) {
421 if (fRunIndex >= runs.count()) {
425 return &runs[fRunIndex].fGlyphs[fGlyphIndex];
429 const SkTArray<ShapedRun>& runs = *fRuns;
430 if (fRunIndex >= runs.count()) {
433 return &runs[fRunIndex].fGlyphs[fGlyphIndex];
487 SkTArray<ShapedRun> runs; local
[all...] |
| /external/toolchain-utils/cros_utils/ |
| tabulator.py | 25 runs = [[{"k1": "10", "k2": "12", "k5": "40", "k6": "40",
34 tg = TableGenerator(runs, labels, TableGenerator.SORT_BY_VALUES_DESC)
166 We have the following runs:
214 runs and a list of baseline runs.
799 # Check to see if any runs passed, and update all_failed.
833 # all the test runs failed, we need to a 'Results' row to the output
1206 runs = [[{ variable
1242 runs = [[{ variable
[all...] |
| /external/jemalloc/include/jemalloc/internal/ |
| arena.h | 94 * Following are example bit patterns for the three types of runs.
171 * runs, rather than directly embedding linkage.
176 /* Linkage for list of dirty runs. */
179 /* Profile counters, used for large object runs. */
269 * Metadata used to manipulate bitmaps for runs associated with this
323 * All operations on runcur, runs, and stats require that lock be
337 * Heap of non-full runs. This heap is used when looking for an
343 arena_run_heap_t runs; member in struct:arena_bin_s
418 /* Number of pages in active runs and huge regions. */
422 * Current count of pages within unused runs that are potentiall
[all...] |
