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

1 2 3 4 5

  /external/aac/libAACdec/src/arm/
block_arm.cpp 115 int runs = band_offset; local
117 runs = band_offset - runs; /* is always a multiple of 4 */
118 FDK_ASSERT((runs & 3) == 0);
137 } while ((runs = runs - 4) != 0);
139 pSpectrum += runs;
  /external/skia/src/core/
SkAlphaRuns.cpp 30 const int16_t* runs = fRuns; local
33 while (*runs) {
35 alpha += *runs;
36 runs += *runs;
41 const int16_t* runs = fRuns; local
44 SkDebugf("Runs");
45 while (*runs) {
46 int n = *runs;
53 runs += n
62 const int16_t* runs = fRuns; local
    [all...]
SkAntiRun.h 60 int16_t* runs = fRuns + offsetX; local
66 SkAlphaRuns::Break(runs, alpha, x, 1);
76 runs += x + 1;
83 SkAlphaRuns::Break(runs, alpha, x, middleCount);
85 runs += x;
89 int n = runs[0];
92 runs += n;
100 SkAlphaRuns::Break(runs, alpha, x, 1);
114 * Break the runs in the buffer at offsets x and x+count, properly
115 * updating the runs to the right and left
    [all...]
SkBlitBWMaskTemplate.h 96 int runs = full_runs; local
105 while (--runs >= 0)
SkBlitter.h 45 /// Blit a horizontal run of antialiased pixels; runs[] is a *sparse*
47 /// The runs[] and antialias[] work together to represent long runs of pixels with the same
48 /// alphas. The runs[] contains the number of pixels with the same alpha, and antialias[]
49 /// contain the coverage value for that number of pixels. The runs[] (and antialias[]) are
50 /// encoded in a clever way. The runs array is zero terminated, and has enough entries for
52 /// in the runs array contains the number of pixels (np) that have the same alpha value. The
53 /// next np value is found np entries away. For example, if runs[0] = 7, then the next valid
54 /// entry will by at runs[7]. The runs array and antialias[] are coupled by index. So, if th
88 int16_t runs[3]; local
101 int16_t runs[2]; local
    [all...]
SkScan_Antihair.cpp 71 int16_t runs[HLINE_STACK_BUFFER + 1]; local
80 runs[0] = SkToS16(n);
81 runs[n] = 0;
82 blitter->blitAntiH(x, y, aa, runs);
  /external/skqp/src/core/
SkAlphaRuns.cpp 30 const int16_t* runs = fRuns; local
33 while (*runs) {
35 alpha += *runs;
36 runs += *runs;
41 const int16_t* runs = fRuns; local
44 SkDebugf("Runs");
45 while (*runs) {
46 int n = *runs;
53 runs += n
62 const int16_t* runs = fRuns; local
    [all...]
SkAntiRun.h 60 int16_t* runs = fRuns + offsetX; local
66 SkAlphaRuns::Break(runs, alpha, x, 1);
76 runs += x + 1;
83 SkAlphaRuns::Break(runs, alpha, x, middleCount);
85 runs += x;
89 int n = runs[0];
92 runs += n;
100 SkAlphaRuns::Break(runs, alpha, x, 1);
114 * Break the runs in the buffer at offsets x and x+count, properly
115 * updating the runs to the right and left
    [all...]
SkBlitBWMaskTemplate.h 96 int runs = full_runs; local
105 while (--runs >= 0)
SkBlitter.h 44 /// Blit a horizontal run of antialiased pixels; runs[] is a *sparse*
46 /// The runs[] and antialias[] work together to represent long runs of pixels with the same
47 /// alphas. The runs[] contains the number of pixels with the same alpha, and antialias[]
48 /// contain the coverage value for that number of pixels. The runs[] (and antialias[]) are
49 /// encoded in a clever way. The runs array is zero terminated, and has enough entries for
51 /// in the runs array contains the number of pixels (np) that have the same alpha value. The
52 /// next np value is found np entries away. For example, if runs[0] = 7, then the next valid
53 /// entry will by at runs[7]. The runs array and antialias[] are coupled by index. So, if th
87 int16_t runs[3]; local
100 int16_t runs[2]; local
    [all...]
  /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
57 if (runs == 0)
67 ++runs;
wait_until.pass.cpp 50 int runs = 0; variable
63 if (runs == 0)
73 ++runs;
wait_until_pred.pass.cpp 60 int runs = 0; variable
72 if (runs == 0)
84 ++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
61 if (runs == 0)
71 ++runs;
wait_until.pass.cpp 53 int runs = 0; variable
66 if (runs == 0)
76 ++runs;
wait_until_pred.pass.cpp 64 int runs = 0; variable
76 if (runs == 0)
88 ++runs;
  /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/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
57 if (runs == 0)
67 ++runs;
wait_until.pass.cpp 50 int runs = 0; variable
63 if (runs == 0)
73 ++runs;
  /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/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
61 if (runs == 0)
71 ++runs;
wait_until.pass.cpp 53 int runs = 0; variable
66 if (runs == 0)
76 ++runs;
  /frameworks/layoutlib/bridge/tests/src/com/android/layoutlib/bridge/intensive/util/perf/
PerformanceRunner.java 47 mRuns = classConfig != null && classConfig.runs() != -1 ?
48 classConfig.runs() :
55 int runs; local
61 runs = methodConfig != null && methodConfig.runs() != -1 ?
62 methodConfig.runs() :
64 return new TimedStatement(super.methodInvoker(method, test), warmUpIterations, runs,
78 int runs() default -1;

Completed in 345 milliseconds

1 2 3 4 5