Home
last modified time | relevance | path

Searched refs:sibling (Results 1 – 6 of 6) sorted by relevance

/dpdk/drivers/common/cnxk/
H A Droc_nix_tm.c590 struct nix_tm_node *node, *sibling; in nix_tm_sq_flush_pre() local
649 TAILQ_FOREACH(sibling, list, node) { in nix_tm_sq_flush_pre()
650 if (sibling->parent != node->parent) in nix_tm_sq_flush_pre()
652 if (!(sibling->flags & NIX_TM_NODE_ENABLED)) in nix_tm_sq_flush_pre()
655 qid = sibling->id; in nix_tm_sq_flush_pre()
703 struct nix_tm_node *node, *sibling; in nix_tm_sq_flush_post() local
730 TAILQ_FOREACH(sibling, list, node) { in nix_tm_sq_flush_post()
731 if (sibling->parent != node->parent) in nix_tm_sq_flush_post()
734 if (sibling->id == qid) in nix_tm_sq_flush_post()
737 if (!(sibling->flags & NIX_TM_NODE_ENABLED)) in nix_tm_sq_flush_post()
[all …]
H A Droc_nix_tm_ops.c835 struct nix_tm_node *node, *sibling; in roc_nix_tm_node_parent_update() local
890 TAILQ_FOREACH(sibling, list, node) { in roc_nix_tm_node_parent_update()
891 if (sibling->parent != node->parent) in roc_nix_tm_node_parent_update()
893 k += nix_tm_sw_xoff_prep(sibling, true, &req->reg[k], in roc_nix_tm_node_parent_update()
915 TAILQ_FOREACH(sibling, list, node) { in roc_nix_tm_node_parent_update()
916 if (sibling->parent != node->parent) in roc_nix_tm_node_parent_update()
918 k += nix_tm_sw_xoff_prep(sibling, false, &req->reg[k], in roc_nix_tm_node_parent_update()
/dpdk/drivers/net/ice/base/
H A Dice_sched.c341 if (p->sibling == node) { in ice_free_sched_node()
342 p->sibling = node->sibling; in ice_free_sched_node()
345 p = p->sibling; in ice_free_sched_node()
351 node->sibling; in ice_free_sched_node()
943 new_node->sibling = NULL; in ice_sched_add_elems()
950 while (prev->sibling) in ice_sched_add_elems()
951 prev = prev->sibling; in ice_sched_add_elems()
1570 node = node->sibling; in ice_sched_get_vsi_node()
1602 node = node->sibling; in ice_sched_get_agg_node()
1709 node = node->sibling; in ice_sched_add_vsi_child_nodes()
[all …]
H A Dice_type.h866 struct ice_sched_node *sibling; /* next sibling in the same layer */ member
/dpdk/doc/guides/prog_guide/
H A Dtraffic_management.rst66 sibling nodes with different priority, while WFQ is used to schedule between
180 weights of all its sibling nodes that have the same priority, with 1 as the
199 its sibling nodes. At this time, since the hierarchy is not fully defined,
/dpdk/app/test-pmd/
H A Dtestpmd.c3282 portid_t sibling; in detach_device() local
3291 RTE_ETH_FOREACH_DEV_OF(sibling, dev) { in detach_device()
3292 if (ports[sibling].port_status != RTE_PORT_CLOSED) { in detach_device()
3293 if (ports[sibling].port_status != RTE_PORT_STOPPED) { in detach_device()
3295 sibling); in detach_device()
3298 port_flow_flush(sibling); in detach_device()