| /external/qemu/android/skin/ |
| region.h | 93 SkinRegionRun* runs; member in struct:SkinRegion
|
| region.c | 86 return r->runs == RUNS_EMPTY;
92 return r->runs == RUNS_RECT;
98 return r->runs != RUNS_EMPTY && r->runs != RUNS_RECT;
101 /** RunStore: ref-counted storage for runs
161 runstore_from_runs( Run* runs )
163 RASSERT(runs != RUNS_EMPTY);
164 RASSERT(runs != RUNS_RECT);
165 return (RunStore*)runs - 1;
182 s = runstore_from_runs(r->runs);
485 Run* runs; local
562 Run* runs = runs_find_y( r->runs, y ); local
763 Run* runs; member in struct:__anon9282
811 Run* runs = o->runs_base; local
[all...] |
| /external/chromium/base/i18n/ |
| bidi_line_iterator.cc | 41 const int runs = ubidi_countRuns(bidi_, &error); local
42 return U_SUCCESS(error) ? runs : 0;
|
| /external/openssl/crypto/rand/ |
| randtest.c | 74 unsigned long runs[2][34]; local
88 for (i=0; i<34; i++) runs[0][i]=runs[1][i]=0;
110 runs[sign][nsign-1]++;
112 runs[sign][5]++;
123 if (nsign != 0) runs[sign][nsign-1]++;
159 if (!((2267 < runs[i][0]) && (runs[i][0] < 2733)))
162 i,1,runs[i][0]);
165 if (!((1079 < runs[i][1]) && (runs[i][1] < 1421))
[all...] |
| /external/skia/src/core/ |
| SkAlphaRuns.cpp | 35 void SkAlphaRuns::Break(int16_t runs[], uint8_t alpha[], int x, int count) {
38 // SkAlphaRuns::BreakAt(runs, alpha, x);
39 // SkAlphaRuns::BreakAt(&runs[x], &alpha[x], count);
41 int16_t* next_runs = runs + x;
45 int n = runs[0];
50 runs[0] = SkToS16(x);
51 runs[x] = SkToS16(n - x);
54 runs += n;
59 runs = next_runs;
64 int n = runs[0]
89 int16_t* runs = fRuns + offsetX; local
144 const int16_t* runs = fRuns; local
155 const int16_t* runs = fRuns; local
176 const int16_t* runs = fRuns; local
[all...] |
| SkScan_Antihair.cpp | 80 int16_t runs[HLINE_STACK_BUFFER + 1]; local
89 runs[0] = SkToS16(n);
90 runs[n] = 0;
91 blitter->blitAntiH(x, y, aa, runs);
128 int16_t runs[2];
131 runs[0] = 1;
132 runs[1] = 0;
141 blitter->blitAntiH(x, lower_y, aa, runs);
142 // the clipping blitters might edit runs, but should not affect us
143 SkASSERT(runs[0] == 1)
[all...] |
| SkBlitBWMaskTemplate.h | 106 int runs = full_runs; local
115 while (--runs >= 0)
|
| SkBlitter.cpp | 39 const int16_t runs[]) {
47 int16_t runs[2]; local
48 runs[0] = 1;
49 runs[1] = 0;
52 this->blitAntiH(x, y++, &alpha, runs);
161 int16_t* runs = runStorage.get(); local
164 sk_memset16((uint16_t*)runs, 1, width);
165 runs[width] = 0;
170 this->blitAntiH(clip.fLeft, y, aa, runs);
218 const int16_t runs[]) {}
[all...] |
| /external/srtp/crypto/math/ |
| stat.c | 76 * runs[i] holds the number of runs of size (i-1)
82 uint16_t runs[6] = { 0, 0, 0, 0, 0, 0 }; local
107 /* check for long runs */
109 debug_print(mod_stat, ">25 runs: %d", state);
118 return err_status_algo_fail; /* long-runs test failed */
137 debug_print(mod_stat, ">25 runs (2): %d", state);
138 return err_status_algo_fail; /* long-runs test failed */
141 state = 6; /* group together runs > 5 */
143 runs[state-1]++; /* increment run count *
207 uint16_t runs[6] = { 0, 0, 0, 0, 0, 0 }; local
[all...] |
| /libcore/luni/src/main/native/ |
| java_text_Bidi.cpp | 148 jobjectArray runs = env->NewObjectArray(runCount, JniConstants::bidiRunClass, NULL); local
155 env->SetObjectArrayElement(runs, i, run);
158 return runs;
|
| /external/bluetooth/glib/tests/ |
| threadpool-test.c | 176 guint runs; local
183 runs = 300;
184 for (i = 0; i < runs; i++)
199 g_assert (runs * 3 == abs_thread_counter + leftover_task_counter);
|
| /external/chromium/chrome/browser/ui/views/autocomplete/ |
| autocomplete_result_view.cc | 287 // Split the text into visual runs. We do this first so that we don't need to
295 Runs runs; local
300 // HEBREW is text in the Hebrew language) has two runs: "Google in " which
305 // runs is different depending on the locale direction.
310 runs.push_back(RunData());
311 RunData* current_run = &runs.back();
352 DCHECK(!runs.empty());
355 std::sort(runs.begin(), runs.end(), &SortRunsLogically)
[all...] |
| /external/icu4c/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...] |
| ubidiimp.h | 67 /* special flag for multiple runs from explicit embedding codes */
285 int32_t runCount; /* ==-1: runs not set up yet */
286 Run *runs; member in struct:UBiDi
288 /* for non-mixed text, we only need a tiny array of runs (no malloc()) */
|
| ubidi.c | 217 * realloc, but it is needed when adding runs using getRunsMemory()
549 * perform that resolution on same-level-runs.
554 * On one hand, the paragraph has to be scanned for same-level-runs, but
719 * explicit codes because we will later look at same-level runs (X10).
1582 Run *runs; local
[all...] |
| /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/webkit/Source/WebCore/platform/text/ |
| BidiResolver.h | 188 BidiRunList<Run>& runs() { return m_runs; } function in class:WebCore::BidiResolver
196 // pass in some sort of Traits object which knows how to create runs for appending.
|
| /frameworks/base/core/java/android/text/ |
| TextLine.java | 197 int[] runs = mDirections.mDirections; local
200 int lastRunIndex = runs.length - 2;
201 for (int i = 0; i < runs.length; i += 2) {
202 int runStart = runs[i];
203 int runLimit = runStart + (runs[i+1] & Layout.RUN_LENGTH_MASK);
207 boolean runIsRtl = (runs[i+1] & Layout.RUN_RTL_FLAG) != 0;
295 int[] runs = mDirections.mDirections; local
296 for (int i = 0; i < runs.length; i += 2) {
297 int runStart = runs[i];
298 int runLimit = runStart + (runs[i+1] & Layout.RUN_LENGTH_MASK)
[all...] |
| Layout.java | 658 int[] runs = dirs.mDirections; local
663 int runIndex = offset == lineStart ? 0 : runs.length - 2;
664 return ((runs[runIndex + 1] >>> RUN_LEVEL_SHIFT) & RUN_LEVEL_MASK) != paraLevel;
668 for (int i = 0; i < runs.length; i += 2) {
669 if (offset == runs[i]) {
690 int[] runs = dirs.mDirections; local
692 for (int i = 0; i < runs.length; i += 2) {
693 int start = lineStart + (runs[i] & RUN_LENGTH_MASK);
697 int level = (runs[i+1] >>> RUN_LEVEL_SHIFT) & RUN_LEVEL_MASK;
709 int[] runs = getLineDirections(line).mDirections local
[all...] |
| /external/opencv/cv/src/ |
| cvcontours.cpp | 1161 CvSeq* runs; local
[all...] |
| /prebuilt/common/tradefed/ |
| tradefed-prebuilt.jar | |
| /prebuilt/linux-x86/swt/ |
| swt.jar | |
| /prebuilt/linux-x86_64/swt/ |
| swt.jar | |
| /prebuilt/windows/swt/ |
| swt.jar | |
