Searched refs:step (Results 1 - 25 of 819) sorted by last modified time

1234567891011>>

/external/yaffs2/yaffs2/
H A Dyaffs_fs.c1885 int step = offset;
1888 /* Get proc_file_read() to step 'offset' by one on each sucessive call.
1897 if (step == 0) {
1909 if (n < step) {
/external/zlib/
H A DAndroid.mk73 # step towards killing libunz. If you're reading this in the K release or
/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_coding/codecs/isac/fix/source/
H A Dpitch_filter_armv6.S120 @ to avoid overflow in the next saturation 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/xmp_toolkit/XMPCore/src/com/adobe/xmp/impl/xpath/
H A DXMPPathParser.java41 * In the most verbose case steps are separated by '/', and each step can be
345 throw new XMPException("Empty initial XMPPath step", XMPError.BADXPATH);
352 // add schema xpath step
359 // add schema xpath step and base step of alias
532 /** the begin of a step */
534 /** the end of a step */
/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/VEX/switchback/
H A Dbinary_switchback.pl366 # Calculate next step:
369 my $step = $diff / 2;
371 if ($step < 0) {
372 print "Error: step = $step\n";
377 if ($step!=0) {
378 $N = $N_LAST_GOOD + $step; # Keep on going...
387 print "EOL: s=$step\n";
/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.c234 "resume_info step %d sig %d stepping %d\n",
235 resume_info->step,
245 stepping = resume_info->step;
599 to decide which thread to step and/or send the specified
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/valgrind/main/gdbserver_tests/
H A Dmake_local_links80 # by default, we can run tests needed next/step/...
81 # But on ARM, we need at least 7.1 to run the 'next/step/...' tests.
85 check_version 7.1 gdbserver_tests/gdb.step "gdbserver next/step/... tests ARM"
87 check_version 7.0 gdbserver_tests/gdb.step "gdbserver next/step/... tests"
H A Dmcbreak.stdoutB.exp8 old_pc has changed after step
10 old_pc has changed after step
13 old_pc has changed after step
19 old_pc has changed after step
21 old_pc has changed after step
50 old_pc has changed after step
/external/valgrind/main/none/tests/
H A Dcmdline1.stdout.exp20 full is slower but provides precise watchpoint/step
H A Dcmdline2.stdout.exp20 full is slower but provides precise watchpoint/step
/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...]
H A Dmdct.h64 int step,
H A DmdctARM.s55 @ r3 = step
114 @ r3 = step
184 @ <> = step
189 LDMFD r12,{r8,r9,r10} @ r8 = step
223 @ <> = step
228 LDMFD r12,{r8,r9,r10} @ r8 = step
304 MOV r2,r2,LSL r3 @ r2 = step = 2<<shift
309 @ r2 = step
323 LDR r10,[r5],r2,LSL #2 @ r10= T[0] T += step
347 LDR r11,[r5],-r2,LSL #2 @ r11= T[0] T -= step
[all...]

Completed in 2859 milliseconds

1234567891011>>