Home
last modified time | relevance | path

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

/dpdk/drivers/net/ice/base/
H A Dice_sched.c34 if (!root->children) { in ice_sched_add_root_node()
73 return start_node->children[i]; in ice_sched_find_node_by_teid()
186 if (!node->children) { in ice_sched_add_node()
333 parent->children[j - 1] = in ice_free_sched_node()
334 parent->children[j]; in ice_free_sched_node()
355 if (node->children) in ice_free_sched_node()
356 ice_free(hw, node->children); in ice_free_sched_node()
1152 node = node->children[0]; in ice_rm_dflt_leaf_node()
1190 node = node->children[0]; in ice_sched_rm_dflt_nodes()
2252 old_parent->children[j]; in ice_sched_update_parent()
[all …]
H A Dice_dcb.c1554 teid1 = LE32_TO_CPU(pi->root->children[i]->info.node_teid); in ice_update_port_tc_tree_cfg()
1563 pi->root->children[i]->in_use = false; in ice_update_port_tc_tree_cfg()
1572 tc_node = pi->root->children[i]; in ice_update_port_tc_tree_cfg()
H A Dice_type.h867 struct ice_sched_node **children; member
/dpdk/doc/guides/prog_guide/
H A Dtraffic_management.rst171 Each non-leaf node has multiple inputs (its children nodes) and single output
176 The children nodes with different priorities are scheduled using the SP
195 children nodes to it.
/dpdk/drivers/common/cnxk/
H A Droc_nix_tm_utils.c357 uint32_t children = 0; in nix_tm_check_rr() local
374 children++; in nix_tm_check_rr()
396 if (i > 1 || (children == 1)) in nix_tm_check_rr()