Home
last modified time | relevance | path

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

/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/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/tensorflow/tensorflow/core/kernels/boosted_trees/quantiles/
Dweighted_quantiles_summary.h275 for (size_t cur_idx = 0, rank = 0; rank <= num_quantiles; ++rank) { in GenerateQuantiles() local
279 size_t next_idx = cur_idx + 1; in GenerateQuantiles()
284 cur_idx = next_idx - 1; in GenerateQuantiles()
288 d_2 < entries_[cur_idx].NextMinRank() + in GenerateQuantiles()
290 output.push_back(entries_[cur_idx].value); in GenerateQuantiles()
/external/tensorflow/tensorflow/contrib/boosted_trees/lib/quantiles/
Dweighted_quantiles_summary.h267 for (size_t cur_idx = 0, rank = 0; rank <= num_quantiles; ++rank) { in GenerateQuantiles() local
271 size_t next_idx = cur_idx + 1; in GenerateQuantiles()
276 cur_idx = next_idx - 1; in GenerateQuantiles()
280 d_2 < entries_[cur_idx].NextMinRank() + in GenerateQuantiles()
282 output.push_back(entries_[cur_idx].value); in GenerateQuantiles()
/external/pdfium/samples/
Dpdfium_test.cc725 size_t cur_idx = 1; in ParseCommandLine() local
726 for (; cur_idx < args.size(); ++cur_idx) { in ParseCommandLine()
727 const std::string& cur_arg = args[cur_idx]; in ParseCommandLine()
860 for (size_t i = cur_idx; i < args.size(); i++) in ParseCommandLine()