Searched defs:step (Results 1 - 25 of 440) sorted by last modified time

1234567891011>>

/external/zlib/src/contrib/testzlib/
H A Dtestzlib.c196 int step=0; local
212 step++;
220 printf("total compress size = %u, in %u step\n",lSizeCpr,step);
237 int step=0; local
253 step++;
261 printf("total uncompress size = %u, in %u step\n",lSizeUncpr,step);
/external/zlib/src/test/
H A Dinfcover.c276 text to include in an error message, step is how much input data to feed
284 local void inf(char *hex, char *what, unsigned step, int win, unsigned len, argument
312 if (step == 0 || step > have)
313 step = have;
314 strm.avail_in = step;
315 have -= step;
339 strm.avail_in = step > have ? have : step;
/external/webrtc/src/modules/audio_processing/aec/
H A Daec_core.c651 const float step = 0.1f; local
719 aec->dMinPow[i] = (aec->dPow[i] + step * (aec->dMinPow[i] -
/external/webp/src/dsp/
H A Ddec.c477 static WEBP_INLINE void do_filter2(uint8_t* p, int step) { argument
478 const int p1 = p[-2*step], p0 = p[-step], q0 = p[0], q1 = p[step];
482 p[-step] = VP8kclip1[p0 + a2];
487 static WEBP_INLINE void do_filter4(uint8_t* p, int step) { argument
488 const int p1 = p[-2*step], p0 = p[-step], q0 = p[0], q1 = p[step];
493 p[-2*step]
500 do_filter6(uint8_t* p, int step) argument
516 hev(const uint8_t* p, int step, int thresh) argument
521 needs_filter(const uint8_t* p, int step, int t) argument
526 needs_filter2(const uint8_t* p, int step, int t, int it) argument
[all...]
H A Ddec_mips32.c28 static WEBP_INLINE void do_filter2(uint8_t* p, int step) { argument
29 const int p1 = p[-2 * step], p0 = p[-step], q0 = p[0], q1 = p[step];
33 p[-step] = VP8kclip1[p0 + a2];
38 static WEBP_INLINE void do_filter4(uint8_t* p, int step) { argument
39 const int p1 = p[-2 * step], p0 = p[-step], q0 = p[0], q1 = p[step];
44 p[-2 * step]
51 do_filter6(uint8_t* p, int step) argument
66 hev(const uint8_t* p, int step, int thresh) argument
71 needs_filter(const uint8_t* p, int step, int thresh) argument
76 needs_filter2(const uint8_t* p, int step, int t, int it) argument
[all...]
H A Dlossless.c1011 const int step = (quality < 25) ? 32 : (quality > 50) ? 8 : 16; local
1017 (1 + (max_green_to_blue - min_green_to_blue) / step) *
1018 (1 + (max_red_to_blue - min_red_to_blue) / step);
1027 green_to_blue += step) {
1032 red_to_blue += step) {
/external/webp/src/enc/
H A Dpicture_csp.c150 GammaToLinear((ptr)[step]) + \
152 GammaToLinear((ptr)[rgb_stride + step]), 0) \
155 LinearToGamma(GammaToLinear((ptr)[0]) + GammaToLinear((ptr)[step]), 1)
162 const int src = (2 * (step * (x) + (y) * rgb_stride)); \
175 int step, // bytes per pixel
182 const int has_alpha = CheckNonOpaque(a_ptr, width, height, step, rgb_stride);
201 const int offset = step * x + y * rgb_stride;
225 assert(step >= 4);
230 a_ptr[step * x + y * rgb_stride];
335 int step, in
171 ImportYUVAFromRGBA(const uint8_t* const r_ptr, const uint8_t* const g_ptr, const uint8_t* const b_ptr, const uint8_t* const a_ptr, int step, int rgb_stride, float dithering, WebPPicture* const picture) argument
333 Import(WebPPicture* const picture, const uint8_t* const rgb, int rgb_stride, int step, int swap_rb, int import_alpha) argument
[all...]
/external/webp/src/utils/
H A Dhuffman.c190 int step = HUFF_LUT_BITS; local
218 if (--step == 0) {
/external/valgrind/main/coregrind/m_gdbserver/
H A Dserver.c895 void myresume (int step, int sig) argument
900 if (step || sig) {
901 resume_info[0].step = step;
905 resume_info[n].step = 0;
H A Dtarget.h80 /* If non-zero, we want to single-step. */
81 int step; member in struct:thread_resume
122 (i.e. step one instruction).
/external/tinyxml/
H A Dtinyxmlparser.cpp280 int step = TiXmlBase::utf8ByteTable[*((unsigned char*)p)]; local
281 if ( step == 0 )
282 step = 1; // Error case from bad encoding, but handle gracefully.
283 p += step;
/external/tremolo/Tremolo/
H A Dcodebook.c818 int step=n/book->dim; local
823 for (j=0;j<step;j++){
825 for(i=0,o=j;i<book->dim;i++,o+=step)
H A Dmdct.c64 STIN void presymmetry(DATA_TYPE *in,int n2,int step){ argument
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){ argument
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){ argument
277 LOOKUP_T *T = (step>=4)?(sincos_lookup0+(step>>
320 mdct_step8(DATA_TYPE *x, int n, int step) argument
413 int step; local
468 mdct_unroll_lap(int n0,int n1, int lW,int W, DATA_TYPE *in, DATA_TYPE *right, LOOKUP_T *w0, LOOKUP_T *w1, ogg_int16_t *out, int step, int start, int end ) argument
[all...]
/external/svox/pico/lib/
H A Dpicodata.h510 picodata_puStepMethod step; member in struct:picodata_processing_unit
/external/sqlite/dist/orig/
H A Dsqlite3ext.h140 int (*step)(sqlite3_stmt*); member in struct:sqlite3_api_routines
370 #define sqlite3_step sqlite3_api->step
/external/sqlite/dist/
H A Dsqlite3ext.h140 int (*step)(sqlite3_stmt*); member in struct:sqlite3_api_routines
370 #define sqlite3_step sqlite3_api->step
/external/sonivox/arm-hybrid-22k/lib_src/
H A Deas_pcmdata.h56 EAS_I32 step; /* current ADPCM step size */ member in struct:s_decoder_state_tag
/external/sonivox/arm-wt-22k/lib_src/
H A Deas_pcmdata.h56 EAS_I32 step; /* current ADPCM step size */ member in struct:s_decoder_state_tag
/external/skia/samplecode/
H A DSampleAnimatedGradient.cpp49 SkScalar step = SK_ScalarPI / (10); local
50 SkScalar angle = t * step;
H A DSampleCircle.cpp80 SkScalar step = SK_ScalarPI * 2 / n; local
83 angle += step;
H A DSampleSpiral.cpp45 SkScalar step = SK_ScalarPI / (55 - i); local
46 SkScalar angle = t * step;
H A DSampleStringArt.cpp35 SkScalar step = angle; variable
42 SkPoint rp = SkPoint::Make(length*SkScalarCos(step) + center.fX,
43 length*SkScalarSin(step) + center.fY);
46 step += angle;
/external/skia/src/effects/
H A DSkCornerPathEffect.cpp20 SkPoint* step) {
23 step->set(b.fX - a.fX, b.fY - a.fY);
26 step->scale(SK_ScalarHalf);
29 step->scale(SkScalarDiv(radius, dist));
46 SkVector firstStep, step; local
71 bool drawSegment = ComputeStep(pts[0], pts[1], fRadius, &step);
74 dst->moveTo(moveTo + step);
77 dst->quadTo(pts[0].fX, pts[0].fY, pts[0].fX + step.fX,
78 pts[0].fY + step.fY);
81 dst->lineTo(pts[1].fX - step
19 ComputeStep(const SkPoint& a, const SkPoint& b, SkScalar radius, SkPoint* step) argument
[all...]
/external/skia/src/pathops/
H A DSkOpSegment.cpp512 SkOpAngle* SkOpSegment::addSingletonAngles(int step) { argument
515 if (step > 0) {
1663 int step = index < endIndex ? 1 : -1;
1670 index += step;
2594 int oEnd, int step, SkPoint* startPt, SkPoint* endPt, double* endT) const {
2600 const SkOpSpan* lastSpan = &other->span(step > 0 ? other->count() - 1 : 0);
2652 otherSpan += step;
2682 int step = SkSign32(endIndex - startIndex);
2684 SkOpSegment* other = isSimple(nextStart, &step);
2700 *nextEnd += step;
[all...]
H A DSkPathOpsCubic.cpp21 double step = (t - min) / 2; local
26 double priorT = t - step;
35 SkDebugf("t=%1.9g calc=%1.9g dist=%1.9g step=%1.9g less=%1.9g\n", t, calcPos, calcDist,
36 step, lessDist);
38 double lastStep = step;
39 step /= 2;

Completed in 372 milliseconds

1234567891011>>