Searched defs:start_idx (Results 1 - 10 of 10) sorted by relevance

/external/freetype/src/cff/
H A Dcf2stack.c206 CF2_Int start_idx, idx, i; local
251 start_idx = -1;
258 if ( start_idx == idx )
260 start_idx++;
261 idx = start_idx;
/external/mesa3d/src/gallium/state_trackers/vega/
H A Dutil_array.h99 int start_idx,
103 memcpy(adata + (start_idx * array->datatype_size), data,
97 array_change_data(struct array *array, const void *data, int start_idx, int num_elements) argument
/external/libopus/silk/
H A Ddecode_core.c45 opus_int i, k, lag = 0, start_idx, sLTP_buf_idx, NLSF_interpolation_flag, signalType; local
142 start_idx = psDec->ltp_mem_length - lag - psDec->LPC_order - LTP_ORDER / 2;
143 silk_assert( start_idx > 0 );
149 silk_LPC_analysis_filter( &sLTP[ start_idx ], &psDec->outBuf[ start_idx + k * psDec->subfr_length ],
150 A_Q12, psDec->ltp_mem_length - start_idx, psDec->LPC_order );
H A DNSQ.c89 opus_int k, lag, start_idx, LSF_interpolation_flag; local
140 start_idx = psEncC->ltp_mem_length - lag - psEncC->predictLPCOrder - LTP_ORDER / 2;
141 silk_assert( start_idx > 0 );
143 silk_LPC_analysis_filter( &sLTP[ start_idx ], &NSQ->xq[ start_idx + k * psEncC->subfr_length ],
144 A_Q12, psEncC->ltp_mem_length - start_idx, psEncC->predictLPCOrder );
H A DNSQ_del_dec.c127 opus_int i, k, lag, start_idx, LSF_interpolation_flag, Winner_ind, subfr; local
243 start_idx = psEncC->ltp_mem_length - lag - psEncC->predictLPCOrder - LTP_ORDER / 2;
244 silk_assert( start_idx > 0 );
246 silk_LPC_analysis_filter( &sLTP[ start_idx ], &NSQ->xq[ start_idx + k * psEncC->subfr_length ],
247 A_Q12, psEncC->ltp_mem_length - start_idx, psEncC->predictLPCOrder );
/external/elfutils/libcpu/
H A Di386_disasm.c704 size_t start_idx = bufcnt; local
1107 while (bufcnt + prefix_size - non_printing < start_idx + width)
/external/opencv/cv/src/
H A Dcvhough.cpp998 int start_idx = nz_count - 1; local
1037 float r_cur = ddata[sort_buf[(j + start_idx)/2]];
1038 if( (start_idx - j)*r_best >= max_count*r_cur ||
1039 (r_best < FLT_EPSILON && start_idx - j >= max_count) )
1042 max_count = start_idx - j;
1045 start_idx = j;
/external/opencv/cxcore/src/
H A Dcxdatastructs.cpp3073 cvFindGraphEdge( const CvGraph* graph, int start_idx, int end_idx ) argument
3086 start_vtx = cvGetGraphVtx( graph, start_idx );
3176 int start_idx, int end_idx,
3191 start_vtx = cvGetGraphVtx( graph, start_idx );
3269 cvGraphRemoveEdge( CvGraph* graph, int start_idx, int end_idx ) argument
3281 start_vtx = cvGetGraphVtx( graph, start_idx );
3175 cvGraphAddEdge( CvGraph* graph, int start_idx, int end_idx, const CvGraphEdge* _edge, CvGraphEdge ** _inserted_edge ) argument
/external/opencv3/modules/imgproc/src/
H A Dhough.cpp1175 int nz_count1 = k, start_idx = nz_count1 - 1; local
1193 float r_cur = ddata[sort_buf[(j + start_idx)/2]];
1194 if( (start_idx - j)*r_best >= max_count*r_cur ||
1195 (r_best < FLT_EPSILON && start_idx - j >= max_count) )
1198 max_count = start_idx - j;
1201 start_idx = j;
/external/opencv3/modules/core/src/
H A Ddatastructs.cpp2727 cvFindGraphEdge( const CvGraph* graph, int start_idx, int end_idx ) argument
2735 start_vtx = cvGetGraphVtx( graph, start_idx );
2816 int start_idx, int end_idx,
2826 start_vtx = cvGetGraphVtx( graph, start_idx );
2894 cvGraphRemoveEdge( CvGraph* graph, int start_idx, int end_idx ) argument
2902 start_vtx = cvGetGraphVtx( graph, start_idx );
2815 cvGraphAddEdge( CvGraph* graph, int start_idx, int end_idx, const CvGraphEdge* _edge, CvGraphEdge ** _inserted_edge ) argument

Completed in 216 milliseconds