Home
last modified time | relevance | path

Searched refs:old_node (Results 1 – 3 of 3) sorted by relevance

/Linux-v5.4/scripts/dtc/
Dlivetree.c142 struct node *merge_nodes(struct node *old_node, struct node *new_node) in merge_nodes() argument
148 old_node->deleted = 0; in merge_nodes()
152 add_label(&old_node->labels, l->label); in merge_nodes()
163 delete_property_by_name(old_node, new_prop->name); in merge_nodes()
169 for_each_property_withdel(old_node, old_prop) { in merge_nodes()
187 add_property(old_node, new_prop); in merge_nodes()
200 delete_node_by_name(old_node, new_child->name); in merge_nodes()
206 for_each_child_withdel(old_node, old_child) { in merge_nodes()
216 add_child(old_node, new_child); in merge_nodes()
219 old_node->srcpos = srcpos_extend(old_node->srcpos, new_node->srcpos); in merge_nodes()
[all …]
Ddtc.h209 struct node *merge_nodes(struct node *old_node, struct node *new_node);
210 struct node *add_orphan_node(struct node *old_node, struct node *new_node, char *ref);
/Linux-v5.4/drivers/net/ethernet/broadcom/bnxt/
Dbnxt_tc.c1252 struct bnxt_tc_flow_node *new_node, *old_node; in bnxt_tc_add_flow() local
1281 old_node = rhashtable_lookup_fast(&tc_info->flow_table, in bnxt_tc_add_flow()
1284 if (old_node) in bnxt_tc_add_flow()
1285 __bnxt_tc_del_flow(bp, old_node); in bnxt_tc_add_flow()