Searched refs:stages (Results 1 - 25 of 101) sorted by relevance

12345

/external/webrtc/webrtc/common_audio/signal_processing/
H A Dcomplex_bit_reverse.c19 /* Indexes for the case of stages == 7. */
30 /* Indexes for the case of stages == 8. */
49 void WebRtcSpl_ComplexBitReverse(int16_t* __restrict complex_data, int stages) { argument
50 /* For any specific value of stages, we know exactly the indexes that are
52 * stages are 7 and 8, so we use tables to save unnecessary iterations and
55 if (stages == 7 || stages == 8) {
60 if (stages == 8) {
81 int n = 1 << stages;
101 * This is similar to the loop in the stages
[all...]
H A Dcomplex_bit_reverse_mips.c64 void WebRtcSpl_ComplexBitReverse(int16_t frfi[], int stages) { argument
71 if (stages == 8) {
123 } else if (stages == 7) {
H A Dcomplex_fft_mips.c22 int WebRtcSpl_ComplexFFT(int16_t frfi[], int stages, int mode) { argument
40 n = 1 << stages;
151 int WebRtcSpl_ComplexIFFT(int16_t frfi[], int stages, int mode) { argument
161 n = 1 << stages;
H A Dcomplex_bit_reverse_arm.S33 mov r1, r3, asl r1 @ n = 1 << stages;
92 index_7: @ Indexes for stages == 7.
102 index_8: @ Indexes for stages == 8.
H A Dcomplex_fft.c29 int WebRtcSpl_ComplexFFT(int16_t frfi[], int stages, int mode) argument
36 * and should not be changed depending on the input parameter 'stages'
38 n = 1 << stages;
44 depending on the input parameter 'stages' */
59 * parameter 'stages'. It will result in 0 <= j < N_SINE_WAVE/2
99 * parameter 'stages'. It will result in 0 <= j < N_SINE_WAVE/2
158 int WebRtcSpl_ComplexIFFT(int16_t frfi[], int stages, int mode) argument
167 * and should not be changed depending on the input parameter 'stages'
169 n = 1 << stages;
177 depending on the input parameter 'stages' */
[all...]
/external/adhd/scripts/audio_tuning/
H A Dconf2ini2.py94 stages = []
96 stages.append(print_drc)
98 stages.append(print_eq)
100 if is_true(d, 'global.enable_swap') and len(stages) >= 2:
101 stages[0], stages[1] = stages[1], stages[0]
103 for i in range(len(stages)):
106 dst = 'dst' if i == len(stages)
[all...]
/external/skia/src/jumper/
H A Dbuild_stages.py15 stages = 'src/jumper/SkJumper_stages.cpp' variable
23 stages = sys.argv[4] if len(sys.argv) > 4 else stages variable
39 ['-c', stages] +
42 ['-c', stages] +
45 ['-c', stages] +
48 ['-c', stages] +
66 ['-c', stages] +
69 ['-c', stages] +
81 ['-c', stages]
[all...]
/external/skqp/src/jumper/
H A Dbuild_stages.py15 stages = 'src/jumper/SkJumper_stages.cpp' variable
23 stages = sys.argv[4] if len(sys.argv) > 4 else stages variable
39 ['-c', stages] +
42 ['-c', stages] +
45 ['-c', stages] +
48 ['-c', stages] +
66 ['-c', stages] +
69 ['-c', stages] +
81 ['-c', stages]
[all...]
/external/skia/src/core/
H A DSkRasterPipeline.cpp38 auto stages = fAlloc->makeArrayDefault<StageList>(src.fNumStages); local
43 stages[n] = *st;
44 stages[n].prev = &stages[n-1];
47 stages[0] = *st;
48 stages[0].prev = fStages;
50 fStages = &stages[src.fNumStages - 1];
56 SkDebugf("SkRasterPipeline, %d stages\n", fNumStages);
57 std::vector<const char*> stages; local
65 stages
[all...]
/external/skqp/src/core/
H A DSkRasterPipeline.cpp38 auto stages = fAlloc->makeArrayDefault<StageList>(src.fNumStages); local
43 stages[n] = *st;
44 stages[n].prev = &stages[n-1];
47 stages[0] = *st;
48 stages[0].prev = fStages;
50 fStages = &stages[src.fNumStages - 1];
56 SkDebugf("SkRasterPipeline, %d stages\n", fNumStages);
57 std::vector<const char*> stages; local
65 stages
[all...]
/external/apache-commons-math/src/main/java/org/apache/commons/math/ode/nonstiff/
H A DRungeKuttaIntegrator.java106 final int stages = c.length + 1;
110 final double[][] yDotK = new double[stages][];
111 for (int i = 0; i < stages; ++i) {
124 interpolator = new DummyStepInterpolator(yTmp, yDotK[stages - 1], forward);
145 // next stages
146 for (int k = 1; k < stages; ++k) {
163 for (int l = 1; l < stages; ++l) {
172 System.arraycopy(yDotK[stages - 1], 0, yDotTmp, 0, y0.length);
H A DEmbeddedRungeKuttaIntegrator.java56 * has s stages. This behaviour is true only for successful steps, if
203 final int stages = c.length + 1;
207 final double[][] yDotK = new double[stages][y0.length];
218 interpolator = new DummyStepInterpolator(yTmp, yDotK[stages - 1], forward);
264 // next stages
265 for (int k = 1; k < stages; ++k) {
282 for (int l = 1; l < stages; ++l) {
303 System.arraycopy(yDotK[stages - 1], 0, yDotTmp, 0, y0.length);
369 * @param yDotK derivatives computed during the first stages
/external/mesa3d/src/gallium/drivers/ilo/core/
H A Dilo_state_urb.c106 * Same for other stages.
624 } stages[4]; local
630 stages[0].alloc_8kb = conf->vs_urb_alloc_8kb;
631 stages[1].alloc_8kb = conf->hs_urb_alloc_8kb;
632 stages[2].alloc_8kb = conf->ds_urb_alloc_8kb;
633 stages[3].alloc_8kb = conf->gs_urb_alloc_8kb;
635 stages[0].entry_rows = conf->vs_entry_rows;
636 stages[1].entry_rows = conf->hs_entry_rows;
637 stages[2].entry_rows = conf->ds_entry_rows;
638 stages[
[all...]
/external/mesa3d/src/mesa/tnl/
H A Dt_pipeline.h41 const struct tnl_pipeline_stage **stages );
H A Dt_pipeline.c39 const struct tnl_pipeline_stage **stages )
48 for (i = 0 ; i < MAX_PIPELINE_STAGES && stages[i] ; i++) {
49 struct tnl_pipeline_stage *s = &tnl->pipeline.stages[i];
50 memcpy(s, stages[i], sizeof(*s));
64 struct tnl_pipeline_stage *s = &tnl->pipeline.stages[i];
211 struct tnl_pipeline_stage *s = &tnl->pipeline.stages[i];
240 struct tnl_pipeline_stage *s = &tnl->pipeline.stages[i];
254 * tampering with the internals of these stages in the way that
255 * drivers did in Mesa 3.4. These stages are basically black boxes,
260 * - removing redundant stages (makin
[all...]
/external/harfbuzz_ng/src/
H A Dhb-ot-map-private.hh119 assert (stage <= stages[table_index].len);
120 unsigned int start = stage ? stages[table_index][stage - 1].last_lookup : 0;
121 unsigned int end = stage < stages[table_index].len ? stages[table_index][stage].last_lookup : lookups[table_index].len;
138 stages[table_index].finish ();
152 hb_prealloced_array_t<stage_map_t, 4> stages[2]; /* GSUB/GPOS */
194 stages[table_index].finish ();
246 hb_prealloced_array_t<stage_info_t, 8> stages[2]; /* GSUB/GPOS */ variable
H A Dhb-ot-map.cc127 stage_info_t *s = stages[table_index].push ();
326 if (stage_index < stages[table_index].len && stages[table_index][stage_index].index == stage) {
327 hb_ot_map_t::stage_map_t *stage_map = m.stages[table_index].push ();
330 stage_map->pause_func = stages[table_index][stage_index].pause_func;
/external/tensorflow/tensorflow/contrib/mpi_collectives/
H A Dmpi_allreduce_test.py58 stages = 13
69 for i in range(stages):
78 for i in range(stages):
88 for i in range(stages):
117 for i in range(stages):
/external/mesa3d/src/mesa/main/
H A Dpipelineobj.h75 _mesa_UseProgramStages(GLuint pipeline, GLbitfield stages, GLuint program);
H A Dpipelineobj.c222 * Bound program to severals stages of the pipeline
225 _mesa_UseProgramStages(GLuint pipeline, GLbitfield stages, GLuint program) argument
235 pipeline, stages, program);
249 * "If stages is not the special value ALL_SHADER_BITS, and has a bit
261 if (stages != GL_ALL_SHADER_BITS && (stages & ~any_valid_stages) != 0) {
297 * shader stages in the pipeline program pipeline object are not
314 /* Enable individual stages from the program as requested by the
324 * stages, it is as if the pipeline object has no programmable stage
325 * configured for the indicated shader stages
[all...]
/external/syslinux/com32/modules/
H A Dkontron_wdt.h108 int stages; member in struct:kempld_watchdog_data
H A Dkontron_wdt.c162 wdt->stages = 0;
182 wdt->stages++;
184 /* assign available stages to timeout and pretimeout */
185 if (wdt->stages == 1)
187 else if (wdt->stages == 2) {
199 printf("Cannot allocate stages\n");
369 /* probe how many usable stages we have */
/external/webrtc/webrtc/modules/audio_processing/ns/
H A Dnsx_core_c.c75 (inst->stages + 11);
89 nShifts = 7 - inst->stages; // WIDTH_PR_MAP_SHIFT - inst->stages + 5;
150 normTmp = WEBRTC_SPL_MIN(20 - inst->stages,
153 tmpU32no1 = inst->featureSpecDiff << normTmp; // Q(normTmp-2*stages)
154 tmpU32no2 = inst->timeAvgMagnEnergy >> (20 - inst->stages - normTmp);
156 // Q(20 - inst->stages)
H A Dnsx_core.c346 tabind = inst->stages - inst->normData;
356 // magn is in Q(-stages), and the real lmagn values are:
357 // real_lmagn(i)=log(magn(i)*2^stages)=log(magn(i))+log(2^stages)
370 // + log(2^stages)
461 (int16_t)(inst->noiseSupFilter[i])) >> 14); // Q(normData-stages)
463 (int16_t)(inst->noiseSupFilter[i])) >> 14); // Q(normData-stages)
603 // Output in Q(minNorm-stages)
604 tmp32no1 += (inst->minNorm - inst->stages) << 11;
619 // Shift fractional part to Q(minNorm-stages)
[all...]
/external/libopus/celt/
H A Dkiss_fft.c359 int stages=0; local
382 facbuf[2*stages] = p;
383 if (p==2 && stages > 1)
385 facbuf[2*stages] = 4;
388 stages++;
394 for (i=0;i<stages/2;i++)
398 facbuf[2*i] = facbuf[2*(stages-i-1)];
399 facbuf[2*(stages-i-1)] = tmp;
401 for (i=0;i<stages;i++)

Completed in 545 milliseconds

12345