Home
last modified time | relevance | path

Searched refs:stages (Results 1 – 25 of 107) sorted by relevance

12345

/external/webrtc/webrtc/common_audio/signal_processing/
Dcomplex_bit_reverse.c49 void WebRtcSpl_ComplexBitReverse(int16_t* __restrict complex_data, int stages) { in WebRtcSpl_ComplexBitReverse() argument
55 if (stages == 7 || stages == 8) { in WebRtcSpl_ComplexBitReverse()
60 if (stages == 8) { in WebRtcSpl_ComplexBitReverse()
81 int n = 1 << stages; in WebRtcSpl_ComplexBitReverse()
Dcomplex_fft_mips.c22 int WebRtcSpl_ComplexFFT(int16_t frfi[], int stages, int mode) { in WebRtcSpl_ComplexFFT() argument
40 n = 1 << stages; in WebRtcSpl_ComplexFFT()
151 int WebRtcSpl_ComplexIFFT(int16_t frfi[], int stages, int mode) { in WebRtcSpl_ComplexIFFT() argument
161 n = 1 << stages; in WebRtcSpl_ComplexIFFT()
Dcomplex_bit_reverse_mips.c64 void WebRtcSpl_ComplexBitReverse(int16_t frfi[], int stages) { in WebRtcSpl_ComplexBitReverse() argument
71 if (stages == 8) { in WebRtcSpl_ComplexBitReverse()
123 } else if (stages == 7) { in WebRtcSpl_ComplexBitReverse()
Dcomplex_fft.c29 int WebRtcSpl_ComplexFFT(int16_t frfi[], int stages, int mode) in WebRtcSpl_ComplexFFT() argument
38 n = 1 << stages; in WebRtcSpl_ComplexFFT()
158 int WebRtcSpl_ComplexIFFT(int16_t frfi[], int stages, int mode) in WebRtcSpl_ComplexIFFT() argument
169 n = 1 << stages; in WebRtcSpl_ComplexIFFT()
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.
/external/mesa3d/src/mesa/tnl/
Dt_pipeline.c39 const struct tnl_pipeline_stage **stages ) in _tnl_install_pipeline() argument
48 for (i = 0 ; i < MAX_PIPELINE_STAGES && stages[i] ; i++) { in _tnl_install_pipeline()
49 struct tnl_pipeline_stage *s = &tnl->pipeline.stages[i]; in _tnl_install_pipeline()
50 memcpy(s, stages[i], sizeof(*s)); in _tnl_install_pipeline()
64 struct tnl_pipeline_stage *s = &tnl->pipeline.stages[i]; in _tnl_destroy_pipeline()
133 struct tnl_pipeline_stage *s = &tnl->pipeline.stages[i]; in _tnl_run_pipeline()
162 struct tnl_pipeline_stage *s = &tnl->pipeline.stages[i]; in _tnl_run_pipeline()
/external/harfbuzz_ng/src/
Dhb-ot-map-private.hh113 assert (stage <= stages[table_index].len); in get_stage_lookups()
114 unsigned int start = stage ? stages[table_index][stage - 1].last_lookup : 0; in get_stage_lookups()
115 …unsigned int end = stage < stages[table_index].len ? stages[table_index][stage].last_lookup : lo… in get_stage_lookups()
132 stages[table_index].finish (); in finish()
152 hb_prealloced_array_t<stage_map_t, 4> stages[2]; /* GSUB/GPOS */ member
191 stages[table_index].finish (); in finish()
230 hb_prealloced_array_t<stage_info_t, 8> stages[2]; /* GSUB/GPOS */ member
Dhb-ot-map.cc121 stage_info_t *s = stages[table_index].push (); in add_pause()
301 … if (stage_index < stages[table_index].len && stages[table_index][stage_index].index == stage) { in compile()
302 hb_ot_map_t::stage_map_t *stage_map = m.stages[table_index].push (); in compile()
305 stage_map->pause_func = stages[table_index][stage_index].pause_func; in compile()
/external/apache-commons-math/src/main/java/org/apache/commons/math/ode/nonstiff/
DRungeKuttaIntegrator.java106 final int stages = c.length + 1; in integrate() local
110 final double[][] yDotK = new double[stages][]; in integrate()
111 for (int i = 0; i < stages; ++i) { in integrate()
124 interpolator = new DummyStepInterpolator(yTmp, yDotK[stages - 1], forward); in integrate()
146 for (int k = 1; k < stages; ++k) { in integrate()
163 for (int l = 1; l < stages; ++l) { in integrate()
172 System.arraycopy(yDotK[stages - 1], 0, yDotTmp, 0, y0.length); in integrate()
DEmbeddedRungeKuttaIntegrator.java203 final int stages = c.length + 1; in integrate() local
207 final double[][] yDotK = new double[stages][y0.length]; in integrate()
218 interpolator = new DummyStepInterpolator(yTmp, yDotK[stages - 1], forward); in integrate()
265 for (int k = 1; k < stages; ++k) { in integrate()
282 for (int l = 1; l < stages; ++l) { in integrate()
303 System.arraycopy(yDotK[stages - 1], 0, yDotTmp, 0, y0.length); in integrate()
/external/opencv3/modules/objdetect/src/
Dcascadedetect_convert.cpp133 std::vector<HaarStageClassifier> stages(nstages); in convert() local
138 HaarStageClassifier& stage = stages[i]; in convert()
203 maxWeakCount = std::max(maxWeakCount, (int)stages[i].weaks.size()); in convert()
221 int nweaks = (int)stages[i].weaks.size(); in convert()
223 << "stageThreshold" << stages[i].threshold in convert()
227 const HaarClassifier& c = stages[i].weaks[j]; in convert()
Dcascadedetect.hpp217 std::vector<Stage> stages; member in cv::CascadeClassifierImpl::Data
506 int nstages = (int)cascade.data.stages.size(); in predictOrdered()
512 CascadeClassifierImpl::Data::Stage* cascadeStages = &cascade.data.stages[0]; in predictOrdered()
546 int nstages = (int)cascade.data.stages.size(); in predictCategorical()
554 CascadeClassifierImpl::Data::Stage* cascadeStages = &cascade.data.stages[0]; in predictCategorical()
591 const CascadeClassifierImpl::Data::Stage* cascadeStages = &cascade.data.stages[0]; in predictOrderedStump()
593 int nstages = (int)cascade.data.stages.size(); in predictOrderedStump()
626 int nstages = (int)cascade.data.stages.size(); in predictCategoricalStump()
631 const CascadeClassifierImpl::Data::Stage* cascadeStages = &cascade.data.stages[0]; in predictCategoricalStump()
Dcascadedetect.cpp928 return !oldCascade && data.stages.empty(); in empty()
1049 result = -(int)classifier->data.stages.size(); in operator ()()
1050 if( classifier->data.stages.size() + result == 0 ) in operator ()()
1114 copyVectorToUMat(data.stages, ustages); in ocl_detectMultiScaleNoGrouping()
1124 int nstages = (int)data.stages.size(); in ocl_detectMultiScaleNoGrouping()
1445 int nstages = (int) data.stages.size(); in setHaarVars()
1449 st.first = data.stages[j].first; in setHaarVars()
1450 st.ntrees = data.stages[j].ntrees; in setHaarVars()
1451 st.threshold = data.stages[j].threshold; in setHaarVars()
1454 hf.stages = &stageArr[0]; in setHaarVars()
[all …]
/external/webrtc/webrtc/modules/audio_processing/ns/
Dnsx_core.c346 tabind = inst->stages - inst->normData; in NoiseEstimationC()
604 tmp32no1 += (inst->minNorm - inst->stages) << 11; in WebRtcNsx_CalcParametricNoiseEstimate()
647 inst->stages = 7; in WebRtcNsx_InitCore()
655 inst->stages = 8; in WebRtcNsx_InitCore()
667 inst->real_fft = WebRtcSpl_CreateRealFFT(inst->stages); in WebRtcNsx_InitCore()
859 histIndex = ((inst->featureSpecDiff * 5) >> inst->stages) / in WebRtcNsx_FeatureParameterExtraction()
899 tmp32 = (int32_t)((tmpU32 << (9 + inst->stages)) / numHistLrt / in WebRtcNsx_FeatureParameterExtraction()
1064 logCurSpectralFlatness += ((int32_t)(inst->stages - 1) << (inst->stages + 7)); // Q(8+stages-1) in WebRtcNsx_ComputeSpectralFlatness()
1065 logCurSpectralFlatness -= (tmp32 << (inst->stages - 1)); in WebRtcNsx_ComputeSpectralFlatness()
1066 logCurSpectralFlatness <<= (10 - inst->stages); // Q17 in WebRtcNsx_ComputeSpectralFlatness()
[all …]
Dnsx_core_c.c75 (inst->stages + 11); in WebRtcNsx_SpeechNoiseProb()
89 nShifts = 7 - inst->stages; // WIDTH_PR_MAP_SHIFT - inst->stages + 5; in WebRtcNsx_SpeechNoiseProb()
150 normTmp = WEBRTC_SPL_MIN(20 - inst->stages, in WebRtcNsx_SpeechNoiseProb()
154 tmpU32no2 = inst->timeAvgMagnEnergy >> (20 - inst->stages - normTmp); in WebRtcNsx_SpeechNoiseProb()
Dnsx_core_mips.c110 (inst->stages + 11); in WebRtcNsx_SpeechNoiseProb()
124 nShifts = 7 - inst->stages; // WIDTH_PR_MAP_SHIFT - inst->stages + 5; in WebRtcNsx_SpeechNoiseProb()
185 normTmp = WEBRTC_SPL_MIN(20 - inst->stages, in WebRtcNsx_SpeechNoiseProb()
189 tmpU32no2 = inst->timeAvgMagnEnergy >> (20 - inst->stages - normTmp); in WebRtcNsx_SpeechNoiseProb()
/external/deqp/doc/testspecs/GLES31/
Dfunctional.separate_shader.txt27 + Replacement of pipeline stages
30 + Interface compatibility between shader stages
31 + glProgramUniform on the pipeline's stages
60 returns the correct programs for vertex and shader stages.
67 and then possibly replace either or both of the stages with a new
/external/opencv3/modules/objdetect/src/opencl/
Dcascadedetect.cl77 __global const Stage* stages,
171 int ntrees = stages[stageIdx].ntrees;
221 if( s < stages[stageIdx].threshold )
246 … __global const Stump* stump = (__global const Stump*)nodes + stages[stageIdx].first;
248 __global const Node* node = nodes + stages[stageIdx].first*NODE_COUNT;
249 __global const float* leaves = leaves0 + stages[stageIdx].first*(NODE_COUNT+1);
252 int ntrees = stages[stageIdx].ntrees;
330 if( s >= stages[stageIdx].threshold )
372 __global const Stage* stages,
411 int i, ntrees = stages[stageIdx].ntrees;
[all …]
/external/deqp/external/vulkancts/modules/vulkan/pipeline/
DvktPipelineTimestampTests.cpp168 TimestampTestParam (const VkPipelineStageFlagBits* stages,
182 TimestampTestParam::TimestampTestParam(const VkPipelineStageFlagBits* stages, in TimestampTestParam() argument
189 m_stageVec.push_back(stages[ndx]); in TimestampTestParam()
238 TransferTimestampTestParam (const VkPipelineStageFlagBits* stages,
250 TransferTimestampTestParam::TransferTimestampTestParam(const VkPipelineStageFlagBits* stages, in TransferTimestampTestParam() argument
254 : TimestampTestParam(stages, stageCount, inRenderPass) in TransferTimestampTestParam()
632 const StageFlagVector& stages,
670 const StageFlagVector& stages, in TimestampTestInstance() argument
673 , m_stages (stages) in TimestampTestInstance()
962 const StageFlagVector stages,
[all …]
/external/libvorbis/lib/
Dres0.c45 int stages; member
286 int stages=ilog(info->secondstages[j]); in res0_look() local
287 if(stages){ in res0_look()
288 if(stages>maxstage)maxstage=stages; in res0_look()
289 look->partbooks[j]=_ogg_calloc(stages,sizeof(*look->partbooks[j])); in res0_look()
290 for(k=0;k<stages;k++) in res0_look()
305 look->stages=maxstage; in res0_look()
576 for(s=0;s<look->stages;s++){ in _01forward()
680 for(s=0;s<look->stages;s++){ in _01inverse()
825 for(s=0;s<look->stages;s++){ in res2_inverse()
/external/tremolo/Tremolo/
Dres012.c89 if(k+1>info->stages)info->stages=k+1; in res_unpack()
134 for(s=0;s<info->stages;s++){ in res_inverse()
204 for(s=0;s<info->stages;s++){ in res_inverse()
/external/mesa3d/src/gallium/docs/source/
Dpipeline.txt91 | (NOTE: these stages may emit |
128 accessible to all shader stages.
/external/opencv3/doc/py_tutorials/py_objdetect/py_face_detection/
Dpy_face_detection.markdown69 features on a window, group the features into different stages of classifiers and apply one-by-one.
70 (Normally first few stages will contain very less number of features). If a window fails the first
72 of features and continue the process. The window which passes all stages is a face region. How is
75 Authors' detector had 6000+ features with 38 stages with 1, 10, 25, 25 and 50 features in first five
76 stages. (Two features in the above image is actually obtained as the best two features from
/external/opencv3/modules/rsobjdetect/src/rs/
DdetectAt.rs55 static HaarStage stages[numStages];
115 const HaarStage stage = stages[stageIdx];
151 stages[currStage] = h;
/external/autotest/client/tests/aiostress/
Daio-stress.c89 long stages = 0; variable
793 if (stages & (1 << READ))
796 if (!new_rw && stages & (1 << RWRITE))
799 if (!new_rw && stages & (1 << RREAD))
1370 stages |= 1 << i;
1441 if (!stages) {
1442 stages = (1 << WRITE) | (1 << READ) | (1 << RREAD) | (1 << RWRITE);
1445 if (stages & (1 << i)) {

12345