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

1 2 3 4

  /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/chromium_org/third_party/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...]
SkAntiRun.h 55 int16_t* runs = fRuns + offsetX; local
61 SkAlphaRuns::Break(runs, alpha, x, 1);
71 runs += x + 1;
79 SkAlphaRuns::Break(runs, alpha, x, middleCount);
81 runs += x;
85 int n = runs[0];
88 runs += n;
96 SkAlphaRuns::Break(runs, alpha, x, 1);
110 * Break the runs in the buffer at offsets x and x+count, properly
111 * updating the runs to the right and left
    [all...]
SkBlitBWMaskTemplate.h 97 int runs = full_runs; local
106 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...]
  /external/qemu/android/skin/
region.h 93 SkinRegionRun* runs; member in struct:SkinRegion
  /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...]
SkAntiRun.h 55 int16_t* runs = fRuns + offsetX; local
61 SkAlphaRuns::Break(runs, alpha, x, 1);
71 runs += x + 1;
79 SkAlphaRuns::Break(runs, alpha, x, middleCount);
81 runs += x;
85 int n = runs[0];
88 runs += n;
96 SkAlphaRuns::Break(runs, alpha, x, 1);
110 * Break the runs in the buffer at offsets x and x+count, properly
111 * updating the runs to the right and left
    [all...]
  /external/chromium_org/base/i18n/
bidi_line_iterator.cc 41 const int runs = ubidi_countRuns(bidi_, &error); local
42 return U_SUCCESS(error) ? runs : 0;
  /external/chromium_org/third_party/openssl/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/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;
wait_until.pass.cpp 48 int runs = 0; variable
61 if (runs == 0)
71 ++runs;
  /external/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;
wait_until.pass.cpp 51 int runs = 0; variable
64 if (runs == 0)
74 ++runs;
  /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...]
  /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;
wait_until.pass.cpp 48 int runs = 0; variable
61 if (runs == 0)
71 ++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;
wait_until.pass.cpp 51 int runs = 0; variable
64 if (runs == 0)
74 ++runs;
  /external/chromium_org/media/cast/test/utility/
barcode.cc 88 std::deque<int> runs; local
100 runs.push_back(length);
106 runs.push_back(length);
109 while (runs.size() >= output->size() * 2 + 7) {
110 std::deque<int>::const_iterator i = runs.begin();
135 DCHECK(i <= runs.end());
140 runs.pop_front();
141 runs.pop_front();
  /external/chromium_org/third_party/libsrtp/srtp/crypto/math/
stat.c 111 * runs[i] holds the number of runs of size (i-1)
117 uint16_t runs[6] = { 0, 0, 0, 0, 0, 0 }; local
142 /* check for long runs */
144 debug_print(mod_stat, ">25 runs: %d", state);
153 return err_status_algo_fail; /* long-runs test failed */
172 debug_print(mod_stat, ">25 runs (2): %d", state);
173 return err_status_algo_fail; /* long-runs test failed */
176 state = 6; /* group together runs > 5 */
178 runs[state-1]++; /* increment run count *
242 uint16_t runs[6] = { 0, 0, 0, 0, 0, 0 }; local
    [all...]

Completed in 1508 milliseconds

1 2 3 4