HomeSort by relevance Sort by last modified time
    Searched defs:runs (Results 1 - 25 of 56) sorted by null

1 2 3

  /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/qemu/android/skin/
region.h 93 SkinRegionRun* runs; member in struct:SkinRegion
  /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/legacy/src/core/
SkAlphaRuns.cpp 27 void SkAlphaRuns::Break(int16_t runs[], uint8_t alpha[], int x, int count) {
30 // SkAlphaRuns::BreakAt(runs, alpha, x);
31 // SkAlphaRuns::BreakAt(&runs[x], &alpha[x], count);
33 int16_t* next_runs = runs + x;
37 int n = runs[0];
42 runs[0] = SkToS16(x);
43 runs[x] = SkToS16(n - x);
46 runs += n;
51 runs = next_runs;
56 int n = runs[0]
81 int16_t* runs = fRuns + offsetX; local
136 const int16_t* runs = fRuns; local
147 const int16_t* runs = fRuns; local
168 const int16_t* runs = fRuns; local
    [all...]
SkScan_Antihair.cpp 72 int16_t runs[HLINE_STACK_BUFFER + 1]; local
81 runs[0] = SkToS16(n);
82 runs[n] = 0;
83 blitter->blitAntiH(x, y, aa, runs);
120 int16_t runs[2];
123 runs[0] = 1;
124 runs[1] = 0;
133 blitter->blitAntiH(x, lower_y, aa, runs);
134 // the clipping blitters might edit runs, but should not affect us
135 SkASSERT(runs[0] == 1)
    [all...]
SkBlitBWMaskTemplate.h 98 int runs = full_runs; local
107 while (--runs >= 0)
SkBlitter.cpp 31 const int16_t runs[]) {
39 int16_t runs[2]; local
40 runs[0] = 1;
41 runs[1] = 0;
44 this->blitAntiH(x, y++, &alpha, runs);
167 int16_t* runs = runStorage.get(); local
170 sk_memset16((uint16_t*)runs, 1, width);
171 runs[width] = 0;
176 this->blitAntiH(clip.fLeft, y, aa, runs);
224 const int16_t runs[]) {}
    [all...]
  /external/skia/src/core/
SkAlphaRuns.cpp 27 void SkAlphaRuns::Break(int16_t runs[], uint8_t alpha[], int x, int count) {
30 // SkAlphaRuns::BreakAt(runs, alpha, x);
31 // SkAlphaRuns::BreakAt(&runs[x], &alpha[x], count);
33 int16_t* next_runs = runs + x;
37 int n = runs[0];
42 runs[0] = SkToS16(x);
43 runs[x] = SkToS16(n - x);
46 runs += n;
51 runs = next_runs;
56 int n = runs[0]
81 int16_t* runs = fRuns + offsetX; local
136 const int16_t* runs = fRuns; local
147 const int16_t* runs = fRuns; local
168 const int16_t* runs = fRuns; local
    [all...]
SkBlitBWMaskTemplate.h 98 int runs = full_runs; local
107 while (--runs >= 0)
SkScan_Antihair.cpp 72 int16_t runs[HLINE_STACK_BUFFER + 1]; local
81 runs[0] = SkToS16(n);
82 runs[n] = 0;
83 blitter->blitAntiH(x, y, aa, runs);
157 int16_t runs[2];
160 runs[0] = 1;
161 runs[1] = 0;
171 blitter->blitAntiH(x, lower_y, aa, runs);
172 // the clipping blitters might edit runs, but should not affect us
173 SkASSERT(runs[0] == 1)
    [all...]
SkBlitter.cpp 37 const int16_t runs[]) {
45 int16_t runs[2]; local
46 runs[0] = 1;
47 runs[1] = 0;
50 this->blitAntiH(x, y++, &alpha, runs);
173 int16_t* runs = runStorage.get(); local
176 sk_memset16((uint16_t*)runs, 1, width);
177 runs[width] = 0;
182 this->blitAntiH(clip.fLeft, y, aa, runs);
230 const int16_t runs[]) {}
    [all...]
SkMaskFilter.cpp 113 int16_t* runs = (int16_t*)storage.get(); local
114 uint8_t* alpha = (uint8_t*)(runs + innerW + 1);
124 runs[0] = width;
125 runs[width] = 0;
127 blitter->blitAntiH(r.left(), outerR.top() + y, alpha, runs);
137 runs[0] = width;
138 runs[width] = 0;
140 blitter->blitAntiH(r.left(), outerR.bottom() - y - 1, alpha, runs);
  /ndk/sources/cxx-stl/llvm-libc++/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;
wait_until.pass.cpp 48 int runs = 0; variable
61 if (runs == 0)
71 ++runs;
wait_until_pred.pass.cpp 58 int runs = 0; variable
70 if (runs == 0)
82 ++runs;
  /ndk/sources/cxx-stl/llvm-libc++/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;
wait_until.pass.cpp 51 int runs = 0; variable
64 if (runs == 0)
74 ++runs;
wait_until_pred.pass.cpp 62 int runs = 0; variable
74 if (runs == 0)
86 ++runs;
  /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 150 jobjectArray runs = env->NewObjectArray(runCount, JniConstants::bidiRunClass, NULL); local
157 env->SetObjectArrayElement(runs, i, run);
160 return runs;
  /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/webp/src/utils/
huffman_encode.c 356 int runs; local
358 runs = k - i;
360 tokens = CodeRepeatedZeros(runs, tokens);
362 tokens = CodeRepeatedValues(runs, tokens, value, prev_value);
365 i += runs;

Completed in 506 milliseconds

1 2 3