/external/webrtc/webrtc/common_audio/signal_processing/ |
complex_bit_reverse.c | 19 /* 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) { 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 == 7 or 8 cases [all...] |
complex_bit_reverse_mips.c | 64 void WebRtcSpl_ComplexBitReverse(int16_t frfi[], int stages) { 71 if (stages == 8) { 123 } else if (stages == 7) {
|
complex_fft_mips.c | 22 int WebRtcSpl_ComplexFFT(int16_t frfi[], int stages, int mode) { 40 n = 1 << stages; 151 int WebRtcSpl_ComplexIFFT(int16_t frfi[], int stages, int mode) { 161 n = 1 << stages;
|
complex_bit_reverse_arm.S | 33 mov r1, r3, asl r1 @ n = 1 << stages; 92 index_7: @ Indexes for stages == 7. 102 index_8: @ Indexes for stages == 8.
|
complex_fft.c | 29 int WebRtcSpl_ComplexFFT(int16_t frfi[], int stages, int mode) 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) 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/apache-commons-math/src/main/java/org/apache/commons/math/ode/nonstiff/ |
RungeKuttaIntegrator.java | 106 final int stages = c.length + 1; local 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);
|
EmbeddedRungeKuttaIntegrator.java | 56 * has s stages. This behaviour is true only for successful steps, if 203 final int stages = c.length + 1; local 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/mesa/tnl/ |
t_pipeline.c | 39 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]; 133 struct tnl_pipeline_stage *s = &tnl->pipeline.stages[i]; 162 struct tnl_pipeline_stage *s = &tnl->pipeline.stages[i]; 176 * tampering with the internals of these stages in the way that 177 * drivers did in Mesa 3.4. These stages are basically black boxes, 182 * - removing redundant stages (making sure that the software rasterize [all...] |
t_pipeline.h | 41 const struct tnl_pipeline_stage **stages );
|
/external/opencv3/modules/objdetect/src/ |
HaarStructs.h | 53 HaarStage* stages; member in struct:__anon21768
|
cascadedetect_convert.cpp | 53 #define ICV_HAAR_STAGES_NAME "stages" 133 std::vector<HaarStageClassifier> stages(nstages); 138 HaarStageClassifier& stage = stages[i]; 203 maxWeakCount = std::max(maxWeakCount, (int)stages[i].weaks.size()); 217 << "stages" << "["; 221 int nweaks = (int)stages[i].weaks.size(); 223 << "stageThreshold" << stages[i].threshold 227 const HaarClassifier& c = stages[i].weaks[j];
|
cascadedetect.hpp | 217 std::vector<Stage> stages; member in class:cv::CascadeClassifierImpl::Data 249 #define CC_STAGES "stages" 506 int nstages = (int)cascade.data.stages.size(); 512 CascadeClassifierImpl::Data::Stage* cascadeStages = &cascade.data.stages[0]; 546 int nstages = (int)cascade.data.stages.size(); 554 CascadeClassifierImpl::Data::Stage* cascadeStages = &cascade.data.stages[0]; 591 const CascadeClassifierImpl::Data::Stage* cascadeStages = &cascade.data.stages[0]; 593 int nstages = (int)cascade.data.stages.size(); 626 int nstages = (int)cascade.data.stages.size(); 631 const CascadeClassifierImpl::Data::Stage* cascadeStages = &cascade.data.stages[0] [all...] |
cascadedetect.cpp | 928 return !oldCascade && data.stages.empty(); 1049 result = -(int)classifier->data.stages.size(); 1050 if( classifier->data.stages.size() + result == 0 ) [all...] |
/external/harfbuzz_ng/src/ |
hb-ot-map-private.hh | 113 assert (stage <= stages[table_index].len); 114 unsigned int start = stage ? stages[table_index][stage - 1].last_lookup : 0; 115 unsigned int end = stage < stages[table_index].len ? stages[table_index][stage].last_lookup : lookups[table_index].len; 132 stages[table_index].finish (); 152 hb_prealloced_array_t<stage_map_t, 4> stages[2]; /* GSUB/GPOS */ 191 stages[table_index].finish (); 230 hb_prealloced_array_t<stage_info_t, 8> stages[2]; /* GSUB/GPOS */ variable
|
hb-ot-map.cc | 121 stage_info_t *s = stages[table_index].push (); 301 if (stage_index < stages[table_index].len && stages[table_index][stage_index].index == stage) { 302 hb_ot_map_t::stage_map_t *stage_map = m.stages[table_index].push (); 305 stage_map->pause_func = stages[table_index][stage_index].pause_func;
|
/external/tremolo/Tremolo/ |
res012.c | 89 if(k+1>info->stages)info->stages=k+1; 134 for(s=0;s<info->stages;s++){ 204 for(s=0;s<info->stages;s++){
|
codec_internal.h | 144 char stages; member in struct:vorbis_info_residue
|
/external/webrtc/webrtc/modules/audio_processing/ns/ |
nsx_core_c.c | 75 (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)
|
nsx_core.c | 346 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...] |
nsx_core_mips.c | 110 (inst->stages + 11); 124 nShifts = 7 - inst->stages; // WIDTH_PR_MAP_SHIFT - inst->stages + 5; 185 normTmp = WEBRTC_SPL_MIN(20 - inst->stages, 188 tmpU32no1 = inst->featureSpecDiff << normTmp; // Q(normTmp-2*stages) 189 tmpU32no2 = inst->timeAvgMagnEnergy >> (20 - inst->stages - normTmp); 191 // Q(20 - inst->stages) [all...] |
/external/deqp/external/vulkancts/modules/vulkan/pipeline/ |
vktPipelineTimestampTests.cpp | 168 TimestampTestParam (const VkPipelineStageFlagBits* stages, 182 TimestampTestParam::TimestampTestParam(const VkPipelineStageFlagBits* stages, 189 m_stageVec.push_back(stages[ndx]); 238 TransferTimestampTestParam (const VkPipelineStageFlagBits* stages, 250 TransferTimestampTestParam::TransferTimestampTestParam(const VkPipelineStageFlagBits* stages, 254 : TimestampTestParam(stages, stageCount, inRenderPass) 632 const StageFlagVector& stages, 670 const StageFlagVector& stages, 673 , m_stages (stages) [all...] |
/external/libvorbis/lib/ |
res0.c | 45 int stages; member in struct:__anon17007 132 for(k=0;k<look->stages;k++) 286 int stages=ilog(info->secondstages[j]); local 287 if(stages){ 288 if(stages>maxstage)maxstage=stages; 289 look->partbooks[j]=_ogg_calloc(stages,sizeof(*look->partbooks[j])); 290 for(k=0;k<stages;k++) 305 look->stages=maxstage; 576 for(s=0;s<look->stages;s++) [all...] |
/external/opencv3/modules/cudaobjdetect/src/cuda/ |
lbp.cu | 200 : stages(_stages), nstages(_nstages), nodes(_nodes), leaves(_leaves), subsets(_subsets), features(_features), subsetSize(_subsetSize){} 210 Stage stage = stages[s]; 232 const Stage* stages;
|
/external/opencv3/modules/cudaobjdetect/src/ |
cascadeclassifier.cpp | 646 const char *CUDA_CC_STAGES = "stages"; 681 std::vector<Stage> stages; 682 stages.reserve(fn.size()); 703 stages.push_back(st);// (int, int, float) 705 cl_trees.reserve(stages[si].first + stages[si].ntrees); 765 stage_mat.upload(cv::Mat(1, (int) (stages.size() * sizeof(Stage)), CV_8UC1, (uchar*)&(stages[0]) ));
|
/external/opencv3/modules/rsobjdetect/src/ |
innerloop.cpp | 27 const HaarStage* cascadeStages = &hf.stages[0];
|