| /libcore/luni/src/main/native/ |
| java_text_Bidi.cpp | 150 jobjectArray runs = env->NewObjectArray(runCount, JniConstants::bidiRunClass, NULL); local
157 env->SetObjectArrayElement(runs, i, run);
160 return runs;
|
| /external/skia/src/core/ |
| SkBlitter.cpp | 45 const int16_t runs[]) {
53 int16_t runs[2]; local
54 runs[0] = 1;
55 runs[1] = 0;
58 this->blitAntiH(x, y++, &alpha, runs);
181 int16_t* runs = runStorage.get(); local
184 sk_memset16((uint16_t*)runs, 1, width);
185 runs[width] = 0;
190 this->blitAntiH(clip.fLeft, y, aa, runs);
238 const int16_t runs[]) {}
[all...] |
| SkMaskFilter.cpp | 139 int16_t* runs = (int16_t*)storage.get(); local
140 uint8_t* alpha = (uint8_t*)(runs + innerW + 1);
150 runs[0] = width;
151 runs[width] = 0;
153 blitter->blitAntiH(r.left(), outerR.top() + y, alpha, runs);
163 runs[0] = width;
164 runs[width] = 0;
166 blitter->blitAntiH(r.left(), outerR.bottom() - y - 1, alpha, runs);
|
| 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...] |
| /external/v8/test/perf-test/Collections/ |
| base.js | 113 // Runs all registered benchmark suites and optionally yields between
265 // Runs a single benchmark for at least a second and computes the
288 data.runs += i;
295 data = { runs: 0, elapsed: 0 };
300 return { runs: 0, elapsed: 0 };
304 if (data.runs < benchmark.minIterations) return data;
305 var usec = (data.elapsed * 1000) / data.runs;
|
| /external/webp/src/utils/ |
| huffman_encode.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;
|
| /external/compiler-rt/lib/profile/ |
| GCDAProfiling.c | 439 uint32_t runs = 1; local
466 runs += read_32bit_value(); /* Add previous run count to new counter. */
476 write_32bit_value(runs);
485 fprintf(stderr, "llvmgcda: %u runs\n", runs);
|
| /external/icu/icu4c/source/common/ |
| ubidiln.c | 50 * The implementation of the access to same-level-runs and of the reordering
56 * same-level-runs is created. Reordering then is done on this vector.
61 * This is inefficient if there are many very short runs. If the average run
157 pLineBiDi->runs=NULL;
320 /* this is done based on runs rather than on levels since levels have
324 iRun=pBiDi->runs[0];
327 iRun = pBiDi->runs[i];
351 /* runs API functions ------------------------------------------------------- */
377 start=pBiDi->runs[runIndex].logicalStart;
383 *pLength=pBiDi->runs[runIndex].visualLimit
440 Run *runs, tempRun; local
523 Run *runs=pBiDi->runs; local
602 Run *runs; local
898 Run *runs=pBiDi->runs; local
925 Run *runs=pBiDi->runs; local
945 Run *runs=pBiDi->runs; local
990 Run *runs; local
1126 Run *runs=pBiDi->runs; local
1225 Run *runs=pBiDi->runs, *runsLimit=runs+pBiDi->runCount; 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/skia/src/pathops/ |
| SkPathOpsCommon.cpp | 210 SkTDArray<const SkOpContour* > runs; // indices of partial contours local
221 SkDebugf("[%d]", runs.count());
232 *runs.append() = eContour;
234 int count = runs.count();
250 const SkOpContour* oContour = runs[rIndex >> 1];
255 const SkOpContour* iContour = runs[iIndex >> 1];
327 const SkOpContour* contour = runs[rIndex];
|
| /libcore/luni/src/main/java/java/text/ |
| Bidi.java | 33 * <p>If the text contains multiple runs, the information of each run can be
35 * direction of the text as well as the nesting level. Left-to-right runs have
36 * even levels while right-to-left runs have odd levels.
332 runs = null;
334 runs = null;
336 runs = ubidi_getRuns(pBidi);
339 if (runCount == 1 && runs[0].getLevel() == baseLevel) {
341 runs = null;
354 private Run[] runs; field in class:Bidi
417 result.runs = null
[all...] |
| /external/bison/lib/ |
| bitset_stats.c | 95 unsigned int runs; member in struct:bitset_stats_info_struct
214 if (bitset_stats_info->runs > 1)
215 fprintf (file, _("Accumulated runs = %u\n"), bitset_stats_info->runs);
266 bitset_stats_info_data.runs++;
|
| /external/jemalloc/include/jemalloc/internal/ |
| arena.h | 69 * Following are example bit patterns for the three types of runs.
139 * runs, rather than directly embedding linkage.
144 /* Linkage for list of dirty runs. */
147 /* Profile counters, used for large object runs. */
230 * Metadata used to manipulate bitmaps for runs associated with this
241 * All operations on runcur, runs, and stats require that lock be
255 * Tree of non-full runs. This tree is used when looking for an
261 arena_run_tree_t runs; member in struct:arena_bin_s
319 /* Number of pages in active runs and huge regions. */
323 * Current count of pages within unused runs that are potentiall
[all...] |
| /external/skia/bench/ |
| nanobench.cpp | 909 int runs = 0; local
[all...] |
| /frameworks/base/core/java/android/text/ |
| TextLine.java | 206 int[] runs = mDirections.mDirections; local
209 int lastRunIndex = runs.length - 2;
210 for (int i = 0; i < runs.length; i += 2) {
211 int runStart = runs[i];
212 int runLimit = runStart + (runs[i+1] & Layout.RUN_LENGTH_MASK);
216 boolean runIsRtl = (runs[i+1] & Layout.RUN_RTL_FLAG) != 0;
304 int[] runs = mDirections.mDirections; local
305 for (int i = 0; i < runs.length; i += 2) {
306 int runStart = runs[i];
307 int runLimit = runStart + (runs[i+1] & Layout.RUN_LENGTH_MASK)
[all...] |
| /prebuilts/gcc/darwin-x86/aarch64/aarch64-linux-android-4.9/lib/gcc/aarch64-linux-android/4.9.x-google/gcov-src/ |
| gcov-io.h | 140 count-summary: int32:num int32:runs int64:sum
153 several runs concatenated, or the data might be merged.
353 gcov_unsigned_t runs; /* number of program runs */ member in struct:gcov_ctr_summary
|
| /prebuilts/gcc/darwin-x86/arm/arm-linux-androideabi-4.9/lib/gcc/arm-linux-androideabi/4.9.x-google/gcov-src/ |
| gcov-io.h | 140 count-summary: int32:num int32:runs int64:sum
153 several runs concatenated, or the data might be merged.
353 gcov_unsigned_t runs; /* number of program runs */ member in struct:gcov_ctr_summary
|
| /prebuilts/gcc/darwin-x86/mips/mips64el-linux-android-4.9/lib/gcc/mips64el-linux-android/4.9/gcov-src/ |
| gcov-io.h | 140 count-summary: int32:num int32:runs int64:sum
153 several runs concatenated, or the data might be merged.
353 gcov_unsigned_t runs; /* number of program runs */ member in struct:gcov_ctr_summary
|
| /prebuilts/gcc/darwin-x86/x86/x86_64-linux-android-4.9/lib/gcc/x86_64-linux-android/4.9/gcov-src/ |
| gcov-io.h | 140 count-summary: int32:num int32:runs int64:sum
153 several runs concatenated, or the data might be merged.
353 gcov_unsigned_t runs; /* number of program runs */ member in struct:gcov_ctr_summary
|
| /prebuilts/gcc/linux-x86/aarch64/aarch64-linux-android-4.9/lib/gcc/aarch64-linux-android/4.9.x-google/gcov-src/ |
| gcov-io.h | 140 count-summary: int32:num int32:runs int64:sum
153 several runs concatenated, or the data might be merged.
353 gcov_unsigned_t runs; /* number of program runs */ member in struct:gcov_ctr_summary
|
| /prebuilts/gcc/linux-x86/arm/arm-linux-androideabi-4.9/lib/gcc/arm-linux-androideabi/4.9.x-google/gcov-src/ |
| gcov-io.h | 140 count-summary: int32:num int32:runs int64:sum
153 several runs concatenated, or the data might be merged.
353 gcov_unsigned_t runs; /* number of program runs */ member in struct:gcov_ctr_summary
|
| /prebuilts/gcc/linux-x86/mips/mips64el-linux-android-4.9/lib/gcc/mips64el-linux-android/4.9/gcov-src/ |
| gcov-io.h | 140 count-summary: int32:num int32:runs int64:sum
153 several runs concatenated, or the data might be merged.
353 gcov_unsigned_t runs; /* number of program runs */ member in struct:gcov_ctr_summary
|
| /prebuilts/gcc/linux-x86/x86/x86_64-linux-android-4.9/lib/gcc/x86_64-linux-android/4.9/gcov-src/ |
| gcov-io.h | 140 count-summary: int32:num int32:runs int64:sum
153 several runs concatenated, or the data might be merged.
353 gcov_unsigned_t runs; /* number of program runs */ member in struct:gcov_ctr_summary
|
| /external/opencv/cv/src/ |
| cvcontours.cpp | 1161 CvSeq* runs; local
[all...] |
| /art/runtime/gc/allocator/ |
| rosalloc.cc | 1170 std::vector<Run*> runs; local
1172 std::unordered_set<Run*, hash_run, eq_run> runs; local
1895 std::vector<Run*> runs; local
[all...] |
