Home
last modified time | relevance | path

Searched full:step (Results 1 – 25 of 4196) sorted by relevance

12345678910>>...168

/third_party/libsnd/src/GSM610/
Dlpc.c92 # define STEP(k) L_ACF [k] += (int32_t) (sl * sp [- (k)]) ; in Autocorrelation() macro
97 # define STEP(k) L_ACF [k] += ((int32_t) sl * sp [- (k)]) ; in Autocorrelation()
105 STEP (0) ; in Autocorrelation()
107 STEP (0) ; STEP (1) ; in Autocorrelation()
109 STEP (0) ; STEP (1) ; STEP (2) ; in Autocorrelation()
111 STEP (0) ; STEP (1) ; STEP (2) ; STEP (3) ; in Autocorrelation()
113 STEP (0) ; STEP (1) ; STEP (2) ; STEP (3) ; STEP (4) ; in Autocorrelation()
115 STEP (0) ; STEP (1) ; STEP (2) ; STEP (3) ; STEP (4) ; STEP (5) ; in Autocorrelation()
117 STEP (0) ; STEP (1) ; STEP (2) ; STEP (3) ; STEP (4) ; STEP (5) ; STEP (6) ; in Autocorrelation()
119 STEP (0) ; STEP (1) ; STEP (2) ; STEP (3) ; STEP (4) ; STEP (5) ; STEP (6) ; STEP (7) ; in Autocorrelation()
[all …]
Drpe.c56 #undef STEP in Weighting_filter()
57 #define STEP(i, H) (e [k + i] * (int32_t) H) in Weighting_filter() macro
65 L_result += STEP (0, -134) ; in Weighting_filter()
66 L_result += STEP (1, -374) ; in Weighting_filter()
67 /* + STEP (2, 0) */ in Weighting_filter()
68 L_result += STEP (3, 2054) ; in Weighting_filter()
69 L_result += STEP (4, 5741) ; in Weighting_filter()
70 L_result += STEP (5, 8192) ; in Weighting_filter()
71 L_result += STEP (6, 5741) ; in Weighting_filter()
72 L_result += STEP (7, 2054) ; in Weighting_filter()
[all …]
Dlong_term.c197 # undef STEP in Calculation_of_the_LTP_parameters()
198 # define STEP(k) (int32_t) wt [k] * dp [k - lambda] in Calculation_of_the_LTP_parameters() macro
202 L_result = STEP (0) ; L_result += STEP (1) ; in Calculation_of_the_LTP_parameters()
203 L_result += STEP (2) ; L_result += STEP (3) ; in Calculation_of_the_LTP_parameters()
204 L_result += STEP (4) ; L_result += STEP (5) ; in Calculation_of_the_LTP_parameters()
205 L_result += STEP (6) ; L_result += STEP (7) ; in Calculation_of_the_LTP_parameters()
206 L_result += STEP (8) ; L_result += STEP (9) ; in Calculation_of_the_LTP_parameters()
207 L_result += STEP (10) ; L_result += STEP (11) ; in Calculation_of_the_LTP_parameters()
208 L_result += STEP (12) ; L_result += STEP (13) ; in Calculation_of_the_LTP_parameters()
209 L_result += STEP (14) ; L_result += STEP (15) ; in Calculation_of_the_LTP_parameters()
[all …]
/third_party/skia/third_party/externals/freetype/src/base/
Dmd5.c60 #define STEP(f, a, b, c, d, x, t, s) \ macro
120 STEP(F, a, b, c, d, SET(0), 0xd76aa478, 7) in body()
121 STEP(F, d, a, b, c, SET(1), 0xe8c7b756, 12) in body()
122 STEP(F, c, d, a, b, SET(2), 0x242070db, 17) in body()
123 STEP(F, b, c, d, a, SET(3), 0xc1bdceee, 22) in body()
124 STEP(F, a, b, c, d, SET(4), 0xf57c0faf, 7) in body()
125 STEP(F, d, a, b, c, SET(5), 0x4787c62a, 12) in body()
126 STEP(F, c, d, a, b, SET(6), 0xa8304613, 17) in body()
127 STEP(F, b, c, d, a, SET(7), 0xfd469501, 22) in body()
128 STEP(F, a, b, c, d, SET(8), 0x698098d8, 7) in body()
[all …]
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Support/
DMD5.cpp61 #define STEP(f, a, b, c, d, x, t, s) \ macro
99 STEP(F, a, b, c, d, SET(0), 0xd76aa478, 7) in body()
100 STEP(F, d, a, b, c, SET(1), 0xe8c7b756, 12) in body()
101 STEP(F, c, d, a, b, SET(2), 0x242070db, 17) in body()
102 STEP(F, b, c, d, a, SET(3), 0xc1bdceee, 22) in body()
103 STEP(F, a, b, c, d, SET(4), 0xf57c0faf, 7) in body()
104 STEP(F, d, a, b, c, SET(5), 0x4787c62a, 12) in body()
105 STEP(F, c, d, a, b, SET(6), 0xa8304613, 17) in body()
106 STEP(F, b, c, d, a, SET(7), 0xfd469501, 22) in body()
107 STEP(F, a, b, c, d, SET(8), 0x698098d8, 7) in body()
[all …]
/third_party/python/Objects/
Dsliceobject.c109 /* start, stop, and step are python objects with None indicating no
114 PySlice_New(PyObject *start, PyObject *stop, PyObject *step) in PySlice_New() argument
116 if (step == NULL) { in PySlice_New()
117 step = Py_None; in PySlice_New()
140 Py_INCREF(step); in PySlice_New()
141 obj->step = step; in PySlice_New()
172 Py_ssize_t *start, Py_ssize_t *stop, Py_ssize_t *step) in PySlice_GetIndices() argument
176 if (r->step == Py_None) { in PySlice_GetIndices()
177 *step = 1; in PySlice_GetIndices()
179 if (!PyLong_Check(r->step)) return -1; in PySlice_GetIndices()
[all …]
Drangeobject.c20 PyObject *step; member
24 /* Helper function for validating step. Always returns a new reference or
28 validate_step(PyObject *step) in validate_step() argument
30 /* No step specified, use a step of 1. */ in validate_step()
31 if (!step) in validate_step()
34 step = PyNumber_Index(step); in validate_step()
35 if (step && _PyLong_Sign(step) == 0) { in validate_step()
38 Py_CLEAR(step); in validate_step()
41 return step; in validate_step()
45 compute_range_length(PyObject *start, PyObject *stop, PyObject *step);
[all …]
/third_party/mbedtls/tests/suites/
Dtest_suite_md.data203 generic multi step mbedtls_md5 Test vector RFC1321 #1
207 generic multi step mbedtls_md5 Test vector RFC1321 #2
211 generic multi step mbedtls_md5 Test vector RFC1321 #3
215 generic multi step mbedtls_md5 Test vector RFC1321 #4
219 generic multi step mbedtls_md5 Test vector RFC1321 #5
223 generic multi step mbedtls_md5 Test vector RFC1321 #6
227 generic multi step mbedtls_md5 Test vector RFC1321 #7
231 generic multi step mbedtls_ripemd160 Test vector from paper #1
235 generic multi step mbedtls_ripemd160 Test vector from paper #2
239 generic multi step mbedtls_ripemd160 Test vector from paper #3
[all …]
/third_party/cups-filters/cupsfilters/
Dpack.c36 const int step) /* I - Step value between pixels */ in cupsPackHorizontal() argument
51 ipixels += step; in cupsPackHorizontal()
54 ipixels += step; in cupsPackHorizontal()
57 ipixels += step; in cupsPackHorizontal()
60 ipixels += step; in cupsPackHorizontal()
63 ipixels += step; in cupsPackHorizontal()
66 ipixels += step; in cupsPackHorizontal()
69 ipixels += step; in cupsPackHorizontal()
72 ipixels += step; in cupsPackHorizontal()
88 if (ipixels[6 * step]) in cupsPackHorizontal()
[all …]
/third_party/ffmpeg/libavcodec/
Dmss34dsp.c64 #define DCT_TEMPLATE(blk, step, SOP, shift) \ argument
65 const unsigned t0 =-39409U * blk[7 * step] - 58980U * blk[1 * step]; \
66 const unsigned t1 = 39410U * blk[1 * step] - 58980U * blk[7 * step]; \
67 const unsigned t2 =-33410U * blk[5 * step] -167963U * blk[3 * step]; \
68 const unsigned t3 = 33410U * blk[3 * step] -167963U * blk[5 * step]; \
69 const unsigned t4 = blk[3 * step] + blk[7 * step]; \
70 const unsigned t5 = blk[1 * step] + blk[5 * step]; \
73 const unsigned t8 = 35470U * blk[2 * step] - 85623U * blk[6 * step]; \
74 const unsigned t9 = 35470U * blk[6 * step] + 85623U * blk[2 * step]; \
75 const unsigned tA = SOP(blk[0 * step] - blk[4 * step]); \
[all …]
Drv40dsp.c318 const ptrdiff_t step = C ? stride : 1;\
320 OP(dst[0], (A*src[0] + E*src[step+0] + bias));\
321 OP(dst[1], (A*src[1] + E*src[step+1] + bias));\
322 OP(dst[2], (A*src[2] + E*src[step+2] + bias));\
323 OP(dst[3], (A*src[3] + E*src[step+3] + bias));\
358 const ptrdiff_t step = C ? stride : 1;\
360 OP(dst[0], (A*src[0] + E*src[step+0] + bias));\
361 OP(dst[1], (A*src[1] + E*src[step+1] + bias));\
362 OP(dst[2], (A*src[2] + E*src[step+2] + bias));\
363 OP(dst[3], (A*src[3] + E*src[step+3] + bias));\
[all …]
/third_party/skia/resources/sksl/intrinsics/
DStep.sksl10 return (step(0.5, testInputs.x) == expectedA.x &&
11 step(0.5, testInputs.xy) == expectedA.xy &&
12 step(0.5, testInputs.xyz) == expectedA.xyz &&
13 step(0.5, testInputs.xyzw) == expectedA.xyzw &&
14 step(0.5, constVal.x) == expectedA.x &&
15 step(0.5, constVal.xy) == expectedA.xy &&
16 step(0.5, constVal.xyz) == expectedA.xyz &&
17 step(0.5, constVal.xyzw) == expectedA.xyzw &&
18 step(testInputs.x, constGreen.x) == expectedB.x &&
19 step(testInputs.xy, constGreen.xy) == expectedB.xy &&
[all …]
/third_party/curl/lib/
Dmd5.c316 #define STEP(f, a, b, c, d, x, t, s) \ macro
370 STEP(F, a, b, c, d, SET(0), 0xd76aa478, 7) in body()
371 STEP(F, d, a, b, c, SET(1), 0xe8c7b756, 12) in body()
372 STEP(F, c, d, a, b, SET(2), 0x242070db, 17) in body()
373 STEP(F, b, c, d, a, SET(3), 0xc1bdceee, 22) in body()
374 STEP(F, a, b, c, d, SET(4), 0xf57c0faf, 7) in body()
375 STEP(F, d, a, b, c, SET(5), 0x4787c62a, 12) in body()
376 STEP(F, c, d, a, b, SET(6), 0xa8304613, 17) in body()
377 STEP(F, b, c, d, a, SET(7), 0xfd469501, 22) in body()
378 STEP(F, a, b, c, d, SET(8), 0x698098d8, 7) in body()
[all …]
Dmd4.c285 #define STEP(f, a, b, c, d, x, s) \ macro
338 STEP(F, a, b, c, d, SET(0), 3) in body()
339 STEP(F, d, a, b, c, SET(1), 7) in body()
340 STEP(F, c, d, a, b, SET(2), 11) in body()
341 STEP(F, b, c, d, a, SET(3), 19) in body()
342 STEP(F, a, b, c, d, SET(4), 3) in body()
343 STEP(F, d, a, b, c, SET(5), 7) in body()
344 STEP(F, c, d, a, b, SET(6), 11) in body()
345 STEP(F, b, c, d, a, SET(7), 19) in body()
346 STEP(F, a, b, c, d, SET(8), 3) in body()
[all …]
/third_party/ffmpeg/libpostproc/
Dpostprocess.c384 static av_always_inline void do_a_deblock_C(uint8_t *src, int step, in do_a_deblock_C() argument
392 src+= step*4; // src points to begin of the 8x8 Block in do_a_deblock_C()
396 numEq += ((unsigned)(src[-1*step] - src[0*step] + dcOffset)) < dcThreshold; in do_a_deblock_C()
397 numEq += ((unsigned)(src[ 0*step] - src[1*step] + dcOffset)) < dcThreshold; in do_a_deblock_C()
398 numEq += ((unsigned)(src[ 1*step] - src[2*step] + dcOffset)) < dcThreshold; in do_a_deblock_C()
399 numEq += ((unsigned)(src[ 2*step] - src[3*step] + dcOffset)) < dcThreshold; in do_a_deblock_C()
400 numEq += ((unsigned)(src[ 3*step] - src[4*step] + dcOffset)) < dcThreshold; in do_a_deblock_C()
401 numEq += ((unsigned)(src[ 4*step] - src[5*step] + dcOffset)) < dcThreshold; in do_a_deblock_C()
402 numEq += ((unsigned)(src[ 5*step] - src[6*step] + dcOffset)) < dcThreshold; in do_a_deblock_C()
403 numEq += ((unsigned)(src[ 6*step] - src[7*step] + dcOffset)) < dcThreshold; in do_a_deblock_C()
[all …]
/third_party/node/test/fixtures/wpt/streams/piping/
Dflow-control.any.js172 …// Returns promise which resolves when step `n` is reached. Also schedules step n + 1 to happen sh…
234 …assert_array_equals(chunksFinishedWriting, [], 'at step 2, zero chunks must have finished writing'…
235 … assert_array_equals(ws.events, ['write', 'a'], 'at step 2, one chunk must have been written');
240 … 'at step 2, the desiredSize at the last enqueue (step 1) must have been 1');
241 assert_equals(rs.controller.desiredSize, 1, 'at step 2, the current desiredSize must be 1');
245 …assert_array_equals(chunksFinishedWriting, [], 'at step 4, zero chunks must have finished writing'…
246 … assert_array_equals(ws.events, ['write', 'a'], 'at step 4, one chunk must have been written');
248 …// When 'b' was enqueued at step 3, the queue was also empty, since immediately after enqueuing 'a…
249 …// step 1, it was dequeued in order to fulfill the read() call that was made at step 0. Thus the q…
252 … 'at step 4, the desiredSize at the last enqueue (step 3) must have been 0');
[all …]
/third_party/rust/crates/minimal-lexical/etc/
Dbellerophon_table.py32 step: BASE{0}_STEP,
45 def next_fp(fp, base, step = 1): argument
48 return (fp[0] * (base**step), fp[1])
51 def prev_fp(fp, base, step = 1): argument
54 return (fp[0] // (base**step), fp[1])
81 def generate_large(base, step): argument
87 bitshift = calculate_bitshift(base, abs(min_exp - step))
94 for exp in range(-step, min_exp-step, -step):
95 fp = prev_fp(fp, base, step)
101 for exp in range(step, max_exp, step):
[all …]
/third_party/python/Lib/encodings/
Didna.py62 # Step 1: try ASCII
67 # Skip to step 3: UseSTD3ASCIIRules is false, so
68 # Skip to step 8.
73 # Step 2: nameprep
76 # Step 3: UseSTD3ASCIIRules is false
77 # Step 4: try ASCII
83 # Skip to step 8.
88 # Step 5: Check ACE prefix
92 # Step 6: Encode with PUNYCODE
95 # Step 7: Prepend ACE prefix
[all …]
/third_party/skia/third_party/externals/angle2/src/tests/egl_tests/
DEGLContextASANTest.cpp62 enum class Step in TEST_P() enum
71 Step currentStep = Step::Start; in TEST_P()
75 auto waitForStep = [&](Step waitStep) -> bool { in TEST_P()
80 if (currentStep == Step::Abort) in TEST_P()
89 auto nextStep = [&](Step newStep) { in TEST_P()
100 AbortOnFailure(Step *currentStep, std::mutex *mutex, std::condition_variable *condVar) in TEST_P()
109 isAborting = *mCurrentStep != Step::Finish; in TEST_P()
113 *mCurrentStep = Step::Abort; in TEST_P()
120 Step *mCurrentStep; in TEST_P()
133 ASSERT_TRUE(waitForStep(Step::Thread1Draw)); in TEST_P()
[all …]
/third_party/glslang/Test/
Dhlsl.init2.frag25 const float step = origStep;
28 normalize(float3(1, 1, 1)) * (n += step),
29 normalize(float3(-1, -1, -1)) * (n += step),
30 normalize(float3(-1, -1, 1)) * (n += step),
31 normalize(float3(-1, 1, -1)) * (n += step),
32 normalize(float3(-1, 1, 1)) * (n += step),
33 normalize(float3(1, -1, -1)) * (n += step),
34 normalize(float3(1, -1, 1)) * (n += step),
35 normalize(float3(1, 1, -1)) * (n += step) };
37 const struct one { float3 a; } oneNonConst = { normalize(float3(-1, 1, 1)) * (n += step) };
[all …]
/third_party/skia/third_party/externals/brotli/java/org/brotli/dec/
DHuffman.java22 int step = 1 << (len - 1); in getNextKey() local
23 while ((key & step) != 0) { in getNextKey()
24 step >>= 1; in getNextKey()
26 return (key & (step - 1)) + step; in getNextKey()
30 * Stores {@code item} in {@code table[0], table[step], table[2 * step] .., table[end]}.
32 * <p> Assumes that end is an integer multiple of step.
34 private static void replicateValue(int[] table, int offset, int step, int end, int item) { in replicateValue() argument
36 end -= step; in replicateValue()
107 for (int len = 1, step = 2; len <= rootBits; len++, step <<= 1) { in buildHuffmanTable()
109 replicateValue(tableGroup, tableOffset + key, step, tableSize, in buildHuffmanTable()
[all …]
/third_party/skia/third_party/externals/brotli/csharp/org/brotli/dec/
DHuffman.cs26 int step = 1 << (len - 1); in GetNextKey()
27 while ((key & step) != 0) in GetNextKey()
29 step >>= 1; in GetNextKey()
31 return (key & (step - 1)) + step; in GetNextKey()
38 /// <c>table[0], table[step], table[2 * step] .., table[end]</c>
40 /// <p> Assumes that end is an integer multiple of step.
42 private static void ReplicateValue(int[] table, int offset, int step, int end, int item) in ReplicateValue() argument
46 end -= step; in ReplicateValue()
118 for (int len = 1, step = 2; len <= rootBits; len++, step <<= 1) in BuildHuffmanTable()
122 ReplicateValue(rootTable, tableOffset + key, step, tableSize, len << 16 | sorted[symbol++]); in BuildHuffmanTable()
[all …]
/third_party/mbedtls/library/
Dpsa_crypto_pake.h53 /** Get output for a step of a password-authenticated key exchange.
61 * \param step The step of the algorithm for which the output is
64 * format appropriate for this driver \p step. Refer to
69 * primitive, \p step) where \p alg and
71 * in the operation's cipher suite, and \p step is
72 * the output step.
87 psa_crypto_driver_pake_step_t step,
92 /** Provide input for a step of a password-authenticated key exchange.
102 * \param step The driver step for which the input is provided.
104 * appropriate for this \p step. Refer to the
[all …]
/third_party/gn/infra/recipes/
Dgn.py19 'recipe_engine/step',
35 lines = api.step(
69 sysroot = '--sysroot=%s' % api.step(
103 with api.step.nest('git'), api.context(infra_steps=True):
104 api.step('init', ['git', 'init', src_dir])
112 api.step('fetch', ['git', 'fetch', '--tags', repository, ref])
113 api.step('checkout', ['git', 'checkout', 'FETCH_HEAD'])
114 revision = api.step(
118 api.step('fetch %s/%s' % (change.change, change.patchset), [
123 api.step('checkout %s/%s' % (change.change, change.patchset),
[all …]
/third_party/node/deps/openssl/openssl/crypto/ffc/
Dffc_params_generate.c102 /* Step (2): choose h (where 1 < h)*/ in generate_unverifiable_g()
107 /* Step (3): g = h^e % p */ in generate_unverifiable_g()
110 /* Step (4): Finish if g > 1 */ in generate_unverifiable_g()
114 /* Step (2) Choose any h in the range 1 < h < (p-1) */ in generate_unverifiable_g()
152 * A.2.3 Step (4) & (5) in generate_canonical_g()
153 * A.2.4 Step (6) & (7) in generate_canonical_g()
158 * A.2.3 Step (7) & (8) & (9) in generate_canonical_g()
159 * A.2.4 Step (9) & (10) & (11) in generate_canonical_g()
177 * A.2.3 Step (10) in generate_canonical_g()
178 * A.2.4 Step (12) in generate_canonical_g()
[all …]

12345678910>>...168