Searched refs:right_node (Results 1 – 3 of 3) sorted by relevance
| /external/jemalloc/test/unit/ |
| D | rb.c | 75 node_t *right_node; in tree_recurse() local
81 right_node = rbtn_right_get(node_t, link, node); in tree_recurse()
91 if (right_node != NULL) in tree_recurse()
92 assert_false(rbtn_red_get(node_t, link, right_node), in tree_recurse()
106 if (right_node != NULL) in tree_recurse()
107 ret += tree_recurse(right_node, black_height, black_depth); in tree_recurse()
|
| /external/iproute2/tc/ |
| D | tc_class.c | 34 struct graph_node *right_node; member
193 node->parent_node->right_node = node; in graph_indent()
196 while (node && node->right_node) { in graph_indent()
202 node = node->right_node; in graph_indent()
|
| /external/v8/src/compiler/arm64/ |
| D | instruction-selector-arm64.cc | 178 Node* node, Node* left_node, Node* right_node, in TryMatchAnyExtend() argument
181 if (!selector->CanCover(node, right_node)) return false; in TryMatchAnyExtend()
183 NodeMatcher nm(right_node); in TryMatchAnyExtend()
186 Int32BinopMatcher mright(right_node); in TryMatchAnyExtend()
196 Int32BinopMatcher mright(right_node); in TryMatchAnyExtend()
238 Node* right_node = m.right().node(); in VisitBinop() local
240 if (g.CanBeImmediate(right_node, operand_mode)) { in VisitBinop()
242 inputs[input_count++] = g.UseImmediate(right_node); in VisitBinop()
245 inputs[input_count++] = g.UseRegister(right_node); in VisitBinop()
248 TryMatchAnyExtend(&g, selector, node, left_node, right_node, in VisitBinop()
[all …]
|