Home
last modified time | relevance | path

Searched refs:cur_idx (Results 1 – 12 of 12) sorted by relevance

/external/llvm-project/lldb/source/Target/
DUnwindLLDB.cpp125 uint32_t cur_idx = m_frames.size(); in GetOneMoreFrame() local
129 m_thread, prev_frame->reg_ctx_lldb_sp, cursor_sp->sctx, cur_idx, *this)); in GetOneMoreFrame()
141 if (cur_idx >= max_stack_depth) { in GetOneMoreFrame()
145 cur_idx < 100 ? cur_idx : 100, "", cur_idx); in GetOneMoreFrame()
164 cur_idx < 100 ? cur_idx : 100, "", cur_idx); in GetOneMoreFrame()
185 cur_idx < 100 ? cur_idx : 100, "", cur_idx); in GetOneMoreFrame()
204 cur_idx < 100 ? cur_idx : 100, "", cur_idx); in GetOneMoreFrame()
233 cur_idx < 100 ? cur_idx : 100, "", cur_idx); in GetOneMoreFrame()
240 cur_idx < 100 ? cur_idx : 100, "", cur_idx); in GetOneMoreFrame()
260 cur_idx < 100 ? cur_idx : 100, "", cur_idx); in GetOneMoreFrame()
[all …]
/external/llvm-project/libcxx/test/libcxx/memory/trivial_abi/
Dunique_ptr_destruction_order.pass.cpp27 int* cur_idx; member
31 : shared_buff(buf), cur_idx(idx), id(ch) {} in Base()
32 ~Base() { shared_buff[(*cur_idx)++] = id; } in ~Base()
54 int cur_idx = 0; in main() local
56 func(A(shared_buf, &cur_idx), std::unique_ptr<B>(new B(shared_buf, &cur_idx)), in main()
57 C(shared_buf, &cur_idx)); in main()
/external/freetype/src/autofit/
Dafangles.c215 FT_UInt cur_idx; in af_sort_and_quantize_widths() local
238 cur_idx = 0; in af_sort_and_quantize_widths()
239 cur_val = table[cur_idx].org; in af_sort_and_quantize_widths()
257 for ( j = cur_idx; j < i; j++ ) in af_sort_and_quantize_widths()
262 table[cur_idx].org = sum / (FT_Pos)j; in af_sort_and_quantize_widths()
266 cur_idx = i + 1; in af_sort_and_quantize_widths()
267 cur_val = table[cur_idx].org; in af_sort_and_quantize_widths()
272 cur_idx = 1; in af_sort_and_quantize_widths()
278 table[cur_idx++] = table[i]; in af_sort_and_quantize_widths()
281 *count = cur_idx; in af_sort_and_quantize_widths()
/external/llvm-project/compiler-rt/lib/sanitizer_common/
Dsanitizer_deadlock_detector.h204 uptr cur_idx = nodeToIndex(cur_node); in onLockBefore() local
205 return g_.isReachable(cur_idx, dtls->getLocks(current_epoch_)); in onLockBefore()
215 uptr cur_idx = nodeToIndex(cur_node); variable
216 dtls->addLock(cur_idx, current_epoch_, stk);
226 uptr cur_idx = nodeToIndexUnchecked(cur_node); in hasAllEdges() local
228 if (!g_.hasEdge(dtls->getLock(i), cur_idx)) in hasAllEdges()
243 uptr cur_idx = nodeToIndex(cur_node); in addEdges() local
245 uptr n_added_edges = g_.addEdges(dtls->getLocks(current_epoch_), cur_idx, in addEdges()
249 Edge e = {(u16)added_edges[i], (u16)cur_idx, in addEdges()
290 uptr cur_idx = nodeToIndex(cur_node); variable
[all …]
/external/compiler-rt/lib/sanitizer_common/
Dsanitizer_deadlock_detector.h208 uptr cur_idx = nodeToIndex(cur_node); in onLockBefore() local
209 return g_.isReachable(cur_idx, dtls->getLocks(current_epoch_)); in onLockBefore()
219 uptr cur_idx = nodeToIndex(cur_node); variable
220 dtls->addLock(cur_idx, current_epoch_, stk);
230 uptr cur_idx = nodeToIndexUnchecked(cur_node); in hasAllEdges() local
232 if (!g_.hasEdge(dtls->getLock(i), cur_idx)) in hasAllEdges()
247 uptr cur_idx = nodeToIndex(cur_node); in addEdges() local
249 uptr n_added_edges = g_.addEdges(dtls->getLocks(current_epoch_), cur_idx, in addEdges()
253 Edge e = {(u16)added_edges[i], (u16)cur_idx, in addEdges()
296 uptr cur_idx = nodeToIndex(cur_node); variable
[all …]
/external/libchrome/libchrome_tools/uprev/
Dgenerate_filtered_tree.py211 lambda cur_idx, tot_cnt, cur_hash:
213 print('Reading', cur_hash, '%d/%d' % (cur_idx, tot_cnt),
237 lambda cur_idx, tot_cnt, cur_hash, cur_meta: (
239 cur_hash, '%d/%d' % (cur_idx, tot_cnt),
243 seconds=int((tot_cnt - cur_idx) / timing(timing_deque)))),
/external/llvm-project/llvm/test/CodeGen/AMDGPU/
Dfix-frame-ptr-reg-copy-livein.ll29 %cur_idx = add nuw nsw i32 %idx, 1
30 %lp_term_cond = icmp eq i32 %cur_idx, 20
34 %idx = phi i32 [ 0, %begin ], [ %cur_idx, %lp_end ]
/external/tensorflow/tensorflow/core/kernels/boosted_trees/quantiles/
Dweighted_quantiles_summary.h303 for (size_t cur_idx = 0, rank = 0; rank <= num_quantiles; ++rank) { in GenerateQuantiles() local
307 size_t next_idx = cur_idx + 1; in GenerateQuantiles()
312 cur_idx = next_idx - 1; in GenerateQuantiles()
316 d_2 < entries_[cur_idx].NextMinRank() + in GenerateQuantiles()
318 output.push_back(entries_[cur_idx].value); in GenerateQuantiles()
/external/pdfium/samples/
Dpdfium_test.cc393 size_t cur_idx = 1; in ParseCommandLine() local
395 for (; cur_idx < args.size(); ++cur_idx) { in ParseCommandLine()
396 const std::string& cur_arg = args[cur_idx]; in ParseCommandLine()
610 for (size_t i = cur_idx; i < args.size(); i++) in ParseCommandLine()
/external/rust/crates/clap/src/app/
Dparser.rs78 cur_idx: Cell<usize>, field
89 cur_idx: Cell::new(0), in with_name()
1628 self.cur_idx.set(self.cur_idx.get() + 1); in parse_long_arg()
1721 self.cur_idx.set(self.cur_idx.get() + 1); in parse_short_arg()
1900 self.cur_idx.set(self.cur_idx.get() + 1); in add_single_val_to_arg()
1911 matcher.add_index_to(arg.name(), self.cur_idx.get()); in add_single_val_to_arg()
1934 matcher.add_index_to(flag.b.name, self.cur_idx.get()); in parse_flag()
/external/llvm-project/lldb/tools/compact-unwind/
Dcompact-unwind-dumper.c1374 uint32_t cur_idx = 0; in print_index_sections() local
1377 while (cur_idx < index_count) { in print_index_sections()
1378 baton.current_index_table_number = cur_idx; in print_index_sections()
1384 cur_idx, index_entry.functionOffset, in print_index_sections()
1429 cur_idx++; in print_index_sections()
/external/libaom/libaom/av1/encoder/
Dpass2_strategy.c390 const int frames_since_key, const int cur_idx, const int can_disable_arf, in accumulate_next_frame_stats() argument
414 if ((frames_since_key + cur_idx - 1) > 1) { in accumulate_next_frame_stats()
423 detect_transition_to_still(twopass, min_gf_interval, cur_idx, 5, in accumulate_next_frame_stats()