Searched refs:cur_idx (Results 1 - 6 of 6) sorted by relevance
/freebsd-11-stable/contrib/llvm-project/lldb/source/Plugins/Process/Utility/ |
H A D | UnwindLLDB.cpp | 126 uint32_t cur_idx = m_frames.size(); local 130 m_thread, prev_frame->reg_ctx_lldb_sp, cursor_sp->sctx, cur_idx, *this)); 142 if (cur_idx >= max_stack_depth) { 146 cur_idx < 100 ? cur_idx : 100, "", cur_idx); 165 cur_idx < 100 ? cur_idx : 100, "", cur_idx); 186 cur_idx < 10 [all...] |
/freebsd-11-stable/contrib/llvm-project/compiler-rt/lib/sanitizer_common/ |
H A D | 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, 290 uptr cur_idx local [all...] |
/freebsd-11-stable/contrib/libgnuregex/ |
H A D | regex_internal.h | 344 int cur_idx; member in struct:re_string_t 404 ((pstr)->mbs[(pstr)->cur_idx + offset]) 406 ((pstr)->mbs[(pstr)->cur_idx++]) 412 #define re_string_eoi(pstr) ((pstr)->stop <= (pstr)->cur_idx) 413 #define re_string_cur_idx(pstr) ((pstr)->cur_idx) 417 #define re_string_skip_bytes(pstr,idx) ((pstr)->cur_idx += (idx)) 418 #define re_string_set_index(pstr,idx) ((pstr)->cur_idx = (idx))
|
H A D | regexec.c | 63 int cur_idx, int nmatch) internal_function; 1543 regmatch_t *prev_idx_match, int cur_node, int cur_idx, int nmatch) 1553 pmatch[reg_num].rm_so = cur_idx; 1563 if (pmatch[reg_num].rm_so < cur_idx) 1565 pmatch[reg_num].rm_eo = cur_idx; 1583 pmatch[reg_num].rm_eo = cur_idx; 2341 int cur_idx = re_string_cur_idx (&mctx->input); 2343 if (cur_idx > mctx->state_log_top) 2345 mctx->state_log[cur_idx] = next_state; 2346 mctx->state_log_top = cur_idx; 1539 update_regs(const re_dfa_t *dfa, regmatch_t *pmatch, regmatch_t *prev_idx_match, int cur_node, int cur_idx, int nmatch) argument 2337 int cur_idx = re_string_cur_idx (&mctx->input); local 3066 int cur_idx; local [all...] |
H A D | regex_internal.c | 830 pstr->cur_idx = 0; 846 && ! re_string_is_single_byte_char (pstr, pstr->cur_idx + idx)) 850 off = pstr->cur_idx + idx; 862 since peek_byte_case doesn't advance cur_idx in any way. */ 889 if (!re_string_first_byte (pstr, pstr->cur_idx)) 892 off = pstr->offsets[pstr->cur_idx]; 899 re_string_char_size_at (pstr, pstr->cur_idx)); 904 return pstr->raw_mbs[pstr->raw_mbs_idx + pstr->cur_idx++];
|
/freebsd-11-stable/contrib/llvm-project/lldb/tools/compact-unwind/ |
H A D | compact-unwind-dumper.c | 1374 uint32_t cur_idx = 0; local 1377 while (cur_idx < index_count) { 1378 baton.current_index_table_number = cur_idx; 1384 cur_idx, index_entry.functionOffset, 1429 cur_idx++;
|
Completed in 195 milliseconds