Searched refs:node_idx (Results 1 - 3 of 3) sorted by relevance
| /third_party/skia/third_party/externals/harfbuzz/src/ |
| H A D | hb-repacker.hh | 444 | hb_map([&] (unsigned node_idx) { in isolate_subgraph()
445 if (index_map.has (node_idx)) return index_map[node_idx]; in isolate_subgraph()
446 return node_idx; in isolate_subgraph()
467 void find_subgraph (unsigned node_idx, hb_hashmap_t<unsigned, unsigned>& subgraph) in find_subgraph()
469 for (const auto& link : vertices_[node_idx].obj.links) in find_subgraph()
481 void find_subgraph (unsigned node_idx, hb_set_t& subgraph) in find_subgraph()
483 if (subgraph.has (node_idx)) return; in find_subgraph()
484 subgraph.add (node_idx); in find_subgraph()
485 for (const auto& link : vertices_[node_idx] in find_subgraph()
[all...] |
| /third_party/jerryscript/jerry-core/api/ |
| H A D | jerry-snapshot.c | 1399 lit_utf8_size_t node_idx, /**< index of parent node */ in jerry_save_literals_heap_max()
1403 lit_utf8_size_t max_idx = node_idx; in jerry_save_literals_heap_max()
1426 lit_utf8_size_t node_idx) /**< index of parent node */ in jerry_save_literals_down_heap()
1432 node_idx, in jerry_save_literals_down_heap()
1433 2 * node_idx + 1, in jerry_save_literals_down_heap()
1434 2 * node_idx + 2); in jerry_save_literals_down_heap()
1435 if (max_idx == node_idx) in jerry_save_literals_down_heap()
1440 ecma_string_t *tmp_str_p = literals[node_idx]; in jerry_save_literals_down_heap()
1441 literals[node_idx] = literals[max_idx]; in jerry_save_literals_down_heap()
1444 node_idx in jerry_save_literals_down_heap()
1397 jerry_save_literals_heap_max(ecma_string_t *literals[], lit_utf8_size_t num_of_nodes, lit_utf8_size_t node_idx, lit_utf8_size_t child_idx1, lit_utf8_size_t child_idx2) jerry_save_literals_heap_max() argument
1424 jerry_save_literals_down_heap(ecma_string_t *literals[], lit_utf8_size_t num_of_nodes, lit_utf8_size_t node_idx) jerry_save_literals_down_heap() argument
[all...] |
| /third_party/ffmpeg/libavcodec/ |
| H A D | agm.c | 937 int node_idx[1024]; in make_new_tree() local
955 node_idx[i] = 257 + i; in make_new_tree()
959 node_idx[512] = 256; in make_new_tree()
968 int p = node_idx[nindex - 1 + 512]; in make_new_tree()
989 p = node_idx[nindex - 1 + 512]; in make_new_tree()
990 ch = node_idx[last]; in make_new_tree()
1004 node_idx[512 + i] = old_idx[i]; in make_new_tree()
|
Completed in 9 milliseconds