| /external/apache-http/src/org/apache/http/conn/routing/ |
| BasicRouteDirector.java | 59 * Provides the next step.
66 * either the next step to perform, or success, or failure.
75 int step = UNREACHABLE; local
78 step = firstStep(plan);
80 step = proxiedStep(plan, fact);
82 step = directStep(plan, fact);
84 return step;
90 * Determines the first step to establish a route.
94 * @return the first step
104 * Determines the next step to establish a direct connection
[all...] |
| /external/opencv/otherlibs/highgui/ |
| grfmt_jpeg.h | 59 bool ReadData( uchar* data, int step, int color );
78 bool WriteImage( const uchar* data, int step,
115 bool ReadData( uchar* data, int step, int color );
156 void ProcessScan( int* idx, int ns, uchar* data, int step, int color );
190 bool WriteImage( const uchar* data, int step,
|
| grfmt_sunras.h | 70 bool ReadData( uchar* data, int step, int color );
93 bool WriteImage( const uchar* data, int step,
|
| /external/skia/bench/ |
| InterpBench.cpp | 56 SkFixed step = SkFloatToFixed(dx); variable
58 dst[i + 0] = TILE(curr, count); curr += step;
59 dst[i + 1] = TILE(curr, count); curr += step;
60 dst[i + 2] = TILE(curr, count); curr += step;
61 dst[i + 3] = TILE(curr, count); curr += step;
75 int64_t step = (int64_t)(dx * 65536 * 655536); variable
80 curr += step;
84 curr += step;
88 curr += step;
92 curr += step;
106 int64_t step = (int64_t)(dx * 65536 * 655536 * 65536); variable
[all...] |
| /external/tremolo/Tremolo/ |
| mdct.c | 64 STIN void presymmetry(DATA_TYPE *in,int n2,int step){
76 XPROD31( s0, s2, T[0], T[1], &aX[0], &aX[2] ); T+=step;
82 XPROD31( s0, s2, T[1], T[0], &aX[0], &aX[2] ); T-=step;
95 XNPROD31( ro2, ro0, T[1], T[0], &aX[0], &aX[2] ); T+=step;
197 STIN void mdct_butterfly_generic(DATA_TYPE *x,int points,int step){
209 XPROD31( s2, s3, T[0], T[1], &x2[1], &x2[3] ); T+=step;
222 XNPROD31( s3, s2, T[0], T[1], &x2[1], &x2[3] ); T-=step;
274 STIN void mdct_step7(DATA_TYPE *x,int n,int step){
277 LOOKUP_T *T = (step>=4)?(sincos_lookup0+(step>>1)):sincos_lookup1
413 int step; local
[all...] |
| /cts/tests/tests/view/src/android/view/cts/ |
| VelocityTrackerTest.java | 144 private void move(long duration, long step) {
147 duration -= step;
148 mTime += step;
149 mPx += (mAx / 2 * step + mVx) * step;
150 mPy += (mAy / 2 * step + mVy) * step;
151 mVx += mAx * step;
152 mVy += mAy * step;
|
| /external/libunwind/tests/ |
| Gperf-simple.c | 58 measure_unwind (int maxlevel, double *step)
86 *step = (stop - start) / (double) level;
93 g1 (int level, int maxlevel, double *step)
96 return measure_unwind (maxlevel, step);
99 return f1 (level + 1, maxlevel, step) + level;
103 f1 (int level, int maxlevel, double *step)
106 return measure_unwind (maxlevel, step);
109 return g1 (level + 1, maxlevel, step) + level;
115 double step, min_step, first_step, sum_step; local
122 f1 (0, maxlevel, &step);
[all...] |
| Gperf-trace.c | 58 measure_unwind (int maxlevel, double *step)
72 *step = (stop - start) / (double) level;
79 g1 (int level, int maxlevel, double *step)
82 return measure_unwind (maxlevel, step);
85 return f1 (level + 1, maxlevel, step) + level;
89 f1 (int level, int maxlevel, double *step)
92 return measure_unwind (maxlevel, step);
95 return g1 (level + 1, maxlevel, step) + level;
101 double step, min_step, first_step, sum_step; local
108 f1 (0, maxlevel, &step);
[all...] |
| /external/v8/src/ |
| uri.h | 57 int* step));
94 int step; local
95 if (UnescapeChar(vector, i, length, &step) >
99 i += step;
116 int step; local
118 UnescapeChar(vector, i, length, &step));
119 i += step;
128 int step; local
130 UnescapeChar(vector, i, length, &step));
131 i += step;
[all...] |
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/test/ |
| test_xrange.py | 13 def pyrange(start, stop, step):
14 if (start - stop) // step < 0:
16 # that are congruent to start modulo step.
17 stop += (start - stop) % step
20 start += step
22 def pyrange_reversed(start, stop, step):
23 stop += (start - stop) % step
24 return pyrange(stop - step, start - step, -step)
[all...] |
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/test/ |
| test_xrange.py | 13 def pyrange(start, stop, step):
14 if (start - stop) // step < 0:
16 # that are congruent to start modulo step.
17 stop += (start - stop) % step
20 start += step
22 def pyrange_reversed(start, stop, step):
23 stop += (start - stop) % step
24 return pyrange(stop - step, start - step, -step)
[all...] |
| /external/opencv/cxcore/src/ |
| cxlogic.cpp | 64 uchar* dst, int step, CvSize size ), (src1, step1, src2, step2, dst, step, size) )\
66 for( ; size.height--; src1 += step1, src2 += step2, dst += step ) \
112 ( const uchar* src0, int step1, uchar* dst0, int step, CvSize size, \
117 for( ; size.height--; src0 += step1, dst0 += step ) \
288 dstbuf.step = cvAlign( dstbuf.step, 8 );
289 buf_size = dstbuf.step ? dstbuf.step*dy : size.width*elem_size;
303 src_step = src->step;
[all...] |
| /external/libxml2/ |
| pattern.c | 92 int flags; /* properties of that step */
114 int *states; /* the array of step indexes */
141 int step; member in struct:_xmlStepState
342 * Add a step to an XSLT Compiled Match
464 xmlPatPushState(xmlStepStates *states, int step, xmlNodePtr node) {
480 states->states[states->nbstates].step = step;
483 fprintf(stderr, "Push: %d, %s\n", step, node->name);
500 xmlStepOpPtr step; local
507 step = &comp->steps[i]
1580 xmlStepOp step; local
1862 xmlStreamStep step; local
[all...] |
| /external/clang/test/SemaCXX/ |
| for-range-examples.cpp | 30 T it, step; member in class:value_range_detail::value_range_step_iter
32 value_range_step_iter(const T &it, const T &step) : it(it), step(step) {}
35 value_range_step_iter &operator++() { it += step; return *this; }
40 T it, step, end_; member in class:value_range_detail::value_range_step
42 value_range_step(const T &it, const T &end, const T &step) :
43 it(it), end_(end), step(step) {}
45 iterator begin() const { return iterator(it, step); }
[all...] |
| /external/v8/test/mjsunit/es6/debug-promises/ |
| throw-in-constructor.js | 13 var step = 0; variable
19 assertEquals(0, step);
25 step++;
39 assertEquals(1, step);
|
| try-reject-in-constructor.js | 13 var step = 0; variable
19 assertEquals(0, step);
25 step++;
41 assertEquals(1, step);
|
| /external/bouncycastle/bcprov/src/main/java/org/bouncycastle/math/ec/ |
| FixedPointUtil.java | 54 int step = 1 << bit; local
55 for (int i = step; i < n; i += (step << 1))
57 lookupTable[i] = lookupTable[i - step].add(pow2);
|
| /external/ceres-solver/internal/ceres/ |
| levenberg_marquardt_strategy.h | 40 // Levenberg-Marquardt step computation and trust region sizing
56 double* step);
60 // Treat the current step as a rejected step with no increase in
79 // allocations in every iteration and reuse when a step fails and
|
| dogleg_strategy.h | 40 // Dogleg step computation and trust region sizing strategy based on
47 // Gauss-Newton step, we compute a regularized version of it. This is
64 double* step);
88 void ComputeTraditionalDoglegStep(double* step);
90 void ComputeSubspaceDoglegStep(double* step);
107 // reports an invalid step, the value of mu_ is increased so that
110 // If a successful step is reported, then the value of mu_ is
144 // problem with the step computed in the last call to ComputeStep,
|
| /external/mesa3d/src/gallium/auxiliary/gallivm/ |
| lp_bld_flow.h | 125 LLVMValueRef step);
130 LLVMValueRef step,
144 LLVMValueRef step; member in struct:lp_build_for_loop_state
156 LLVMValueRef step);
|
| /external/skia/tests/ |
| PathOpsCubicLineIntersectionIdeas.cpp | 54 static double binary_search(const SkDCubic& cubic, double step, const SkDPoint& pt, double t,
56 double firstStep = step;
66 if (step == 0) {
67 SkDebugf("binary search failed: step=%1.9g cubic=", firstStep);
74 double lastStep = step;
75 step /= 2;
80 // use larger x/y difference to choose step
82 t -= step;
92 t += step;
205 double step = 1e-6
[all...] |
| /frameworks/rs/java/tests/ImageProcessing/src/com/android/rs/image/ |
| Histogram.java | 36 int step = 8; local
37 int steps = (h + step - 1) / step;
41 mScript.set_gStep(step);
|
| /frameworks/rs/java/tests/ImageProcessing_jb/src/com/android/rs/image/ |
| Histogram.java | 42 int step = 8; local
43 int steps = (h + step - 1) / step;
47 mScript.set_gStep(step);
|
| /external/deqp/framework/randomshaders/ |
| rsgUtils.hpp | 53 inline float getQuantizedFloat (de::Random& rnd, float min, float max, float step)
55 int numSteps = (int)((max-min)/step);
56 return min + step*rnd.getInt(0, numSteps);
|
| /external/linux-tools-perf/src/tools/perf/arch/x86/util/ |
| header.c | 26 int family = -1, model = -1, step = -1; local
41 step = a & 0xf;
51 nb = scnprintf(buffer, sz, "%s,%u,%u,%u$", vendor, family, model, step);
|
