HomeSort by relevance Sort by last modified time
    Searched refs:cur_idx (Results 1 - 10 of 10) sorted by null

  /external/freetype/src/autofit/
afangles.c 215 FT_UInt cur_idx; local
238 cur_idx = 0;
239 cur_val = table[cur_idx].org;
257 for ( j = cur_idx; j < i; j++ )
262 table[cur_idx].org = sum / (FT_Pos)j;
266 cur_idx = i + 1;
267 cur_val = table[cur_idx].org;
272 cur_idx = 1;
278 table[cur_idx++] = table[i];
281 *count = cur_idx;
    [all...]
  /external/libgdx/extensions/gdx-freetype/jni/freetype-2.6.2/src/autofit/
afangles.c 215 FT_UInt cur_idx; local
238 cur_idx = 0;
239 cur_val = table[cur_idx].org;
257 for ( j = cur_idx; j < i; j++ )
262 table[cur_idx].org = sum / (FT_Pos)j;
266 cur_idx = i + 1;
267 cur_val = table[cur_idx].org;
272 cur_idx = 1;
278 table[cur_idx++] = table[i];
281 *count = cur_idx;
    [all...]
  /external/opencv3/modules/cudastereo/src/
stereocsbp.cpp 238 int cur_idx = 0; local
246 init_data_cost(left.ptr<uchar>(), right.ptr<uchar>(), temp_.ptr<uchar>(), left.step, left.rows, left.cols, disp_selected_pyr[cur_idx].ptr<float>(), data_cost_selected.ptr<float>(),
251 compute_data_cost(left.ptr<uchar>(), right.ptr<uchar>(), left.step, disp_selected_pyr[cur_idx].ptr<float>(), data_cost.ptr<float>(), elem_step,
254 int new_idx = (cur_idx + 1) & 1;
258 u[cur_idx].ptr<float>(), d[cur_idx].ptr<float>(), l[cur_idx].ptr<float>(), r[cur_idx].ptr<float>(),
259 disp_selected_pyr[new_idx].ptr<float>(), disp_selected_pyr[cur_idx].ptr<float>(),
263 cur_idx = new_idx
    [all...]
  /external/compiler-rt/lib/sanitizer_common/
sanitizer_deadlock_detector.h 208 uptr cur_idx = nodeToIndex(cur_node); local
209 return g_.isReachable(cur_idx, dtls->getLocks(current_epoch_));
219 uptr cur_idx = nodeToIndex(cur_node); local
220 dtls->addLock(cur_idx, current_epoch_, stk);
230 uptr cur_idx = nodeToIndexUnchecked(cur_node); local
232 if (!g_.hasEdge(dtls->getLock(i), cur_idx))
247 uptr cur_idx = nodeToIndex(cur_node); local
249 uptr n_added_edges = g_.addEdges(dtls->getLocks(current_epoch_), cur_idx,
253 Edge e = {(u16)added_edges[i], (u16)cur_idx,
259 // n_edges_, stk, added_edges[i], cur_idx, unique_tid)
296 uptr cur_idx = nodeToIndex(cur_node); local
    [all...]
  /frameworks/compile/mclinker/lib/LD/
EhFrameReader.cpp 51 size_t cur_idx = 0; local
54 uint32_t length = data[cur_idx++];
66 extended = data[cur_idx++];
68 extended |= data[cur_idx++];
79 uint32_t ID = data[cur_idx++];
  /external/pdfium/samples/
pdfium_test.cc 258 size_t cur_idx = 1; local
259 for (; cur_idx < args.size(); ++cur_idx) {
260 const std::string& cur_arg = args[cur_idx];
318 if (cur_idx >= args.size()) {
322 for (size_t i = cur_idx; i < args.size(); i++) {
  /system/extras/micro_bench/
micro_bench.cpp 139 static inline double computeRunningAvg(double avg, double running_avg, size_t cur_idx) {
140 return (running_avg / (cur_idx + 1)) * cur_idx + (avg / (cur_idx + 1));
143 static inline double computeRunningSquareAvg(double avg, double square_avg, size_t cur_idx) {
144 return (square_avg / (cur_idx + 1)) * cur_idx + (avg / (cur_idx + 1)) * avg;
    [all...]
  /system/bt/bta/ag/
bta_ag_sco.c 313 if (!only_active || p_scb->sco_idx == bta_ag_cb.sco.cur_idx)
369 bta_ag_cb.sco.cur_idx = p_scb->sco_idx;
587 bta_ag_cb.sco.cur_idx = p_scb->sco_idx;
605 bta_ag_cb.sco.cur_idx = p_scb->sco_idx;
    [all...]
bta_ag_int.h 311 UINT16 cur_idx; /* SCO handle */ member in struct:__anon73148
  /external/fio/
options.c 799 unsigned int cur_idx; local
803 for (cur_idx = 0; ; cur_idx++)
808 return cur_idx;
817 unsigned int cur_idx; local
824 for (cur_idx = 0; cur_idx <= index; cur_idx++)
    [all...]

Completed in 1062 milliseconds