/external/lldb/source/Plugins/Process/Utility/ |
UnwindLLDB.cpp | 118 uint32_t cur_idx = m_frames.size (); 120 m_frames[cur_idx - 1]->reg_ctx_lldb_sp, 122 cur_idx, 132 if (cur_idx > 300000) 136 cur_idx < 100 ? cur_idx : 100, "", cur_idx); 148 cur_idx < 100 ? cur_idx : 100, "", cur_idx); [all...] |
/external/chromium_org/third_party/freetype/src/autofit/ |
afangles.c | 275 FT_UInt cur_idx; local 298 cur_idx = 0; 299 cur_val = table[cur_idx].org; 317 for ( j = cur_idx; j < i; j++ ) 322 table[cur_idx].org = sum / j; 326 cur_idx = i + 1; 327 cur_val = table[cur_idx].org; 332 cur_idx = 1; 338 table[cur_idx++] = table[i]; 341 *count = cur_idx; [all...] |
/external/freetype/src/autofit/ |
afangles.c | 275 FT_UInt cur_idx; local 298 cur_idx = 0; 299 cur_val = table[cur_idx].org; 317 for ( j = cur_idx; j < i; j++ ) 322 table[cur_idx].org = sum / j; 326 cur_idx = i + 1; 327 cur_val = table[cur_idx].org; 332 cur_idx = 1; 338 table[cur_idx++] = table[i]; 341 *count = cur_idx; [all...] |
/external/compiler-rt/lib/sanitizer_common/ |
sanitizer_deadlock_detector.h | 204 uptr cur_idx = nodeToIndex(cur_node); local 205 return g_.isReachable(cur_idx, dtls->getLocks(current_epoch_)); 215 uptr cur_idx = nodeToIndex(cur_node); local 216 dtls->addLock(cur_idx, current_epoch_, stk); 226 uptr cur_idx = nodeToIndexUnchecked(cur_node); local 228 if (!g_.hasEdge(dtls->getLock(i), cur_idx)) 243 uptr cur_idx = nodeToIndex(cur_node); local 245 uptr n_added_edges = g_.addEdges(dtls->getLocks(current_epoch_), cur_idx, 249 Edge e = {(u16)added_edges[i], (u16)cur_idx, 255 // n_edges_, stk, added_edges[i], cur_idx, unique_tid) 292 uptr cur_idx = nodeToIndex(cur_node); local [all...] |
/frameworks/compile/mclinker/lib/LD/ |
EhFrameReader.cpp | 55 size_t cur_idx = 0; local 58 uint32_t length = data[cur_idx++]; 70 extended = data[cur_idx++]; 72 extended |= data[cur_idx++]; 84 uint32_t ID = data[cur_idx++];
|
/ndk/sources/host-tools/sed-4.2.1/lib/ |
regex_internal.h | 387 Idx cur_idx; member in struct:re_string_t 445 ((pstr)->mbs[(pstr)->cur_idx + offset]) 447 ((pstr)->mbs[(pstr)->cur_idx++]) 453 #define re_string_eoi(pstr) ((pstr)->stop <= (pstr)->cur_idx) 454 #define re_string_cur_idx(pstr) ((pstr)->cur_idx) 458 #define re_string_skip_bytes(pstr,idx) ((pstr)->cur_idx += (idx)) 459 #define re_string_set_index(pstr,idx) ((pstr)->cur_idx = (idx))
|
regexec.c | 69 Idx cur_idx, Idx nmatch) internal_function; 2356 Idx cur_idx = re_string_cur_idx (&mctx->input); local 3088 Idx cur_idx; local [all...] |
regex_internal.c | 831 pstr->cur_idx = 0; 848 && ! re_string_is_single_byte_char (pstr, pstr->cur_idx + idx)) 852 off = pstr->cur_idx + idx; 864 since peek_byte_case doesn't advance cur_idx in any way. */ 892 if (!re_string_first_byte (pstr, pstr->cur_idx)) 895 off = pstr->offsets[pstr->cur_idx]; 902 re_string_char_size_at (pstr, pstr->cur_idx)); 907 return pstr->raw_mbs[pstr->raw_mbs_idx + pstr->cur_idx++]; [all...] |
/external/chromium_org/third_party/brotli/src/brotli/enc/ |
block_splitter.cc | 251 int cur_idx = 0; local 255 block_index[i] = cur_idx; 260 ++cur_idx;
|
/system/extras/micro_bench/ |
micro_bench.cpp | 130 static inline double computeRunningAvg(double avg, double running_avg, size_t cur_idx) { 131 return (running_avg / (cur_idx + 1)) * cur_idx + (avg / (cur_idx + 1)); 134 static inline double computeRunningSquareAvg(double avg, double square_avg, size_t cur_idx) { 135 return (square_avg / (cur_idx + 1)) * cur_idx + (avg / (cur_idx + 1)) * avg; [all...] |
/external/bluetooth/bluedroid/bta/ag/ |
bta_ag_sco.c | 320 if (!only_active || p_scb->sco_idx == bta_ag_cb.sco.cur_idx) 376 bta_ag_cb.sco.cur_idx = p_scb->sco_idx; 594 bta_ag_cb.sco.cur_idx = p_scb->sco_idx; 612 bta_ag_cb.sco.cur_idx = p_scb->sco_idx; [all...] |
bta_ag_int.h | 309 UINT16 cur_idx; /* SCO handle */ member in struct:__anon5044
|
/external/fio/ |
options.c | 812 unsigned int cur_idx; local 816 for (cur_idx = 0; ; cur_idx++) 821 return cur_idx; 830 unsigned int cur_idx; local 837 for (cur_idx = 0; cur_idx <= index; cur_idx++) [all...] |