| /frameworks/minikin/tests/ |
| FontCollectionItemizeTest.cpp | 85 std::vector<FontCollection::Run> runs; local
92 itemize(collection.get(), "'a' 'b' 'c' 'd' 'e'", kRegularStyle, &runs);
93 ASSERT_EQ(1U, runs.size());
94 EXPECT_EQ(0, runs[0].start);
95 EXPECT_EQ(5, runs[0].end);
96 EXPECT_EQ(kLatinFont, getFontPath(runs[0]));
97 EXPECT_FALSE(runs[0].fakedFont.fakery.isFakeBold());
98 EXPECT_FALSE(runs[0].fakedFont.fakery.isFakeItalic());
100 itemize(collection.get(), "'a' 'b' 'c' 'd' 'e'", kItalicStyle, &runs);
101 ASSERT_EQ(1U, runs.size())
155 std::vector<FontCollection::Run> runs; local
216 std::vector<FontCollection::Run> runs; local
305 std::vector<FontCollection::Run> runs; local
344 std::vector<FontCollection::Run> runs; local
483 std::vector<FontCollection::Run> runs; local
608 std::vector<FontCollection::Run> runs; local
632 std::vector<FontCollection::Run> runs; local
687 std::vector<FontCollection::Run> runs; local
831 std::vector<FontCollection::Run> runs; local
1144 std::vector<FontCollection::Run> runs; local
1155 std::vector<FontCollection::Run> runs; local
1237 std::vector<FontCollection::Run> runs; local
1319 std::vector<FontCollection::Run> runs; local
1358 std::vector<FontCollection::Run> runs; local
[all...] |
| /external/skia/src/core/ |
| SkAlphaRuns.cpp | 31 const int16_t* runs = fRuns; local
34 while (*runs) {
36 alpha += *runs;
37 runs += *runs;
42 const int16_t* runs = fRuns; local
45 SkDebugf("Runs");
46 while (*runs) {
47 int n = *runs;
54 runs += n
63 const int16_t* runs = fRuns; local
[all...] |
| SkRegionPriv.h | 25 static int compute_intervalcount(const SkRegion::RunType runs[]) {
26 const SkRegion::RunType* curr = runs;
32 return SkToInt((curr - runs) >> 1);
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[]) {
125 SkASSERT(runs[0] < SkRegion::kRunTypeSentinel);
127 const int intervals = runs[1];
128 SkASSERT(runs[2 + intervals * 2] == SkRegion::kRunTypeSentinel);
131 int n = compute_intervalcount(&runs[2])
[all...] |
| SkAntiRun.h | 55 int16_t* runs = fRuns + offsetX; local
61 SkAlphaRuns::Break(runs, alpha, x, 1);
71 runs += x + 1;
78 SkAlphaRuns::Break(runs, alpha, x, middleCount);
80 runs += x;
84 int n = runs[0];
87 runs += n;
95 SkAlphaRuns::Break(runs, alpha, x, 1);
109 * Break the runs in the buffer at offsets x and x+count, properly
110 * updating the runs to the right and left
[all...] |
| SkRegion.cpp | 33 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,
50 assert_sentinel(runs[0], false); // to
322 const RunType* runs = fRunHead->findScanline(y); local
417 const RunType* runs = tmpStorage; local
1266 const RunType* runs = fRunHead->readonly_runs(); local
1318 const RunType* runs = fRuns; local
1408 const SkRegion::RunType* runs = rgn.fRunHead->findScanline(y); local
1447 const SkRegion::RunType* runs = fRuns; local
[all...] |
| SkBlitter.h | 32 /// Blit a horizontal run of antialiased pixels; runs[] is a *sparse*
35 const int16_t runs[]);
60 int16_t runs[3]; local
63 runs[0] = 1;
64 runs[1] = 1;
65 runs[2] = 0;
68 this->blitAntiH(x, y, aa, runs);
73 int16_t runs[2]; local
76 runs[0] = 1;
77 runs[1] = 0
[all...] |
| /external/autotest/client/site_tests/kernel_LTP/ |
| ltp-diff.py | 11 # 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):
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/ |
| ltp-diff.py | 11 # 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):
63 Print any testnames with differing results across runs.
64 Return 1 if any test results across runs differ
[all...] |
| /external/aac/libAACdec/src/arm/ |
| block_arm.cpp | 112 int runs = band_offset; local
114 runs = band_offset - runs; /* is always a multiple of 4 */
133 } while ((runs = runs-4) != 0);
137 pSpectrum+= runs;
|
| /external/icu/icu4c/source/common/ |
| ubidiln.c | 46 * 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;
316 /* this is done based on runs rather than on levels since levels have
320 iRun=pBiDi->runs[0];
323 iRun = pBiDi->runs[i];
347 /* runs API functions ------------------------------------------------------- */
373 start=pBiDi->runs[runIndex].logicalStart;
379 *pLength=pBiDi->runs[runIndex].visualLimit
436 Run *runs, tempRun; local
519 Run *runs=pBiDi->runs; local
598 Run *runs; local
894 Run *runs=pBiDi->runs; local
921 Run *runs=pBiDi->runs; local
941 Run *runs=pBiDi->runs; local
986 Run *runs; local
1122 Run *runs=pBiDi->runs; local
1221 Run *runs=pBiDi->runs, *runsLimit=runs+pBiDi->runCount; local
[all...] |
| /external/icu/android_icu4j/src/main/java/android/icu/text/ |
| BidiLine.java | 40 * 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];
279 /* this is done based on runs rather than on levels since levels have
286 iRun = bidi.runs[0];
289 iRun = bidi.runs[i];
305 int start = bidi.runs[runIndex].start;
307 byte level = bidi.runs[runIndex].level;
311 bidi.runs[runIndex].limit
369 BidiRun[] runs; local
449 BidiRun[] runs = bidi.runs; local
526 BidiRun[] runs; local
820 BidiRun[] runs = bidi.runs; local
846 BidiRun runs[] = bidi.runs; local
866 BidiRun[] runs = bidi.runs; local
911 BidiRun[] runs; local
1019 BidiRun[] runs = bidi.runs; local
1110 BidiRun[] runs = bidi.runs; local
[all...] |
| /external/icu/icu4j/main/classes/core/src/com/ibm/icu/text/ |
| BidiLine.java | 39 * 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];
278 /* this is done based on runs rather than on levels since levels have
285 iRun = bidi.runs[0];
288 iRun = bidi.runs[i];
304 int start = bidi.runs[runIndex].start;
306 byte level = bidi.runs[runIndex].level;
310 bidi.runs[runIndex].limit
368 BidiRun[] runs; local
448 BidiRun[] runs = bidi.runs; local
525 BidiRun[] runs; local
819 BidiRun[] runs = bidi.runs; local
845 BidiRun runs[] = bidi.runs; local
865 BidiRun[] runs = bidi.runs; local
910 BidiRun[] runs; local
1018 BidiRun[] runs = bidi.runs; local
1109 BidiRun[] runs = bidi.runs; local
[all...] |
| /external/opencv/cvaux/src/ |
| cvprewarp.cpp | 52 int *runs_1, /* result runs 1 */
53 int *runs_2, /* result runs 2 */
54 int *num_runs_1, /* numbers of first runs */
90 int *runs, /* result runs */
111 runs[run_index++] = 0;
112 runs[run_index++] = curr_color;
124 runs[run_index++] = index;
125 runs[run_index++] = color;
133 runs[run_index++] = index
[all...] |
| /external/opencv3/modules/core/perf/ |
| perf_merge.cpp | 33 int runs = (sz.width <= 640) ? 8 : 1; local
34 TEST_CYCLE_MULTIRUN(runs) merge( (vector<Mat> &)mv, dst );
|
| perf_split.cpp | 29 int runs = (sz.width <= 640) ? 8 : 1; local
30 TEST_CYCLE_MULTIRUN(runs) split(m, (vector<Mat>&)mv);
|
| /external/v8/test/mjsunit/regress/ |
| regress-347904.js | 5 // Flags: --allow-natives-syntax --stress-runs=2
|
| /external/libcxx/test/std/thread/thread.condition/thread.condition.condvar/ |
| wait_for.pass.cpp | 33 int runs = 0; variable
48 if (runs == 0)
58 ++runs;
|
| wait_for_pred.pass.cpp | 43 int runs = 0; variable
56 if (runs == 0)
66 ++runs;
|
| /external/libcxx/test/std/thread/thread.condition/thread.condition.condvarany/ |
| wait_for.pass.cpp | 36 int runs = 0; variable
51 if (runs == 0)
61 ++runs;
|
| wait_for_pred.pass.cpp | 46 int runs = 0; variable
59 if (runs == 0)
69 ++runs;
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/thread/thread.condition/thread.condition.condvar/ |
| wait_for.pass.cpp | 31 int runs = 0; variable
46 if (runs == 0)
56 ++runs;
|
| wait_for_pred.pass.cpp | 41 int runs = 0; variable
54 if (runs == 0)
64 ++runs;
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/thread/thread.condition/thread.condition.condvarany/ |
| wait_for.pass.cpp | 34 int runs = 0; variable
49 if (runs == 0)
59 ++runs;
|
| wait_for_pred.pass.cpp | 44 int runs = 0; variable
57 if (runs == 0)
67 ++runs;
|
| /external/v8/test/cctest/compiler/ |
| test-basic-block-profiler.cc | 101 uint32_t runs[] = {0, 1, 500, 10000}; local
102 for (size_t i = 0; i < arraysize(runs); i++) {
104 CHECK_EQ(1, m.Call(static_cast<int>(runs[i])));
105 uint32_t expected[] = {1, runs[i] + 1, runs[i], 1};
|
