Home
last modified time | relevance | path

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

/external/libchrome/base/task/sequence_manager/
Dintrusive_heap.h184 size_t child_pos = hole * 2; in MoveHoleDownAndFillWithElement() local
185 while (child_pos < size_) { in MoveHoleDownAndFillWithElement()
186 if (nodes_[child_pos + 1] <= nodes_[child_pos]) in MoveHoleDownAndFillWithElement()
187 child_pos++; in MoveHoleDownAndFillWithElement()
189 if (element <= nodes_[child_pos]) in MoveHoleDownAndFillWithElement()
192 hole = MoveHole(child_pos, hole); in MoveHoleDownAndFillWithElement()
193 child_pos *= 2; in MoveHoleDownAndFillWithElement()
195 if (child_pos == size_ && !(element <= nodes_[child_pos])) in MoveHoleDownAndFillWithElement()
196 hole = MoveHole(child_pos, hole); in MoveHoleDownAndFillWithElement()
207 size_t child_pos = hole * 2; in MoveHoleDownAndFillWithLeafElement() local
[all …]
/external/llvm-project/polly/lib/External/isl/
Disl_schedule_node_private.h29 int *child_pos; member
35 __isl_take isl_schedule_tree_list *ancestors, int *child_pos);
Disl_schedule_node.c28 __isl_take isl_schedule_tree_list *ancestors, int *child_pos) in isl_schedule_node_alloc() argument
38 if (n > 0 && !child_pos) in isl_schedule_node_alloc()
48 node->child_pos = isl_alloc_array(ctx, int, n); in isl_schedule_node_alloc()
49 if (n && !node->child_pos) in isl_schedule_node_alloc()
52 node->child_pos[i] = child_pos[i]; in isl_schedule_node_alloc()
196 node->child_pos); in isl_schedule_node_dup()
237 free(node->child_pos); in isl_schedule_node_free()
268 if (node1->child_pos[i] != node2->child_pos[i]) in isl_schedule_node_is_equal()
999 return n < 0 ? isl_size_error : node->child_pos[n - 1]; in isl_schedule_node_get_child_position()
1021 return isl_bool_ok(node->child_pos[n - 1] > 0); in isl_schedule_node_has_previous_sibling()
[all …]
Disl_schedule_tree.h264 int n_ancestor, int *child_pos);
Disl_schedule_tree.c2773 int n_ancestor, int *child_pos) in isl_printer_print_schedule_tree_mark() argument
2866 if (n_ancestor > 0 && child_pos[0] == i) in isl_printer_print_schedule_tree_mark()
2868 n_ancestor - 1, child_pos + 1); in isl_printer_print_schedule_tree_mark()