Home
last modified time | relevance | path

Searched refs:start_node (Results 1 – 4 of 4) sorted by relevance

/freebsd-13.1/sys/contrib/octeon-sdk/
H A Dcvmx-dfa.h373 …uint64_t start_node : 22; /**< Node to start the walk from, includes ID and snrepl, … member
471 …uint32_t start_node; /**< Start node index for the root of the graph, incl.… member
714 static inline void cvmx_dfa_submit(const cvmx_dfa_graph_t *graph, int start_node, in cvmx_dfa_submit() argument
729 command.s.start_node = start_node; // includes snrepl (PASS3/CN58XX) in cvmx_dfa_submit()
/freebsd-13.1/sys/dev/ice/
H A Dice_sched.c84 ice_sched_find_node_by_teid(struct ice_sched_node *start_node, u32 teid) in ice_sched_find_node_by_teid() argument
89 if (ICE_TXSCHED_GET_NODE_TEID(start_node) == teid) in ice_sched_find_node_by_teid()
90 return start_node; in ice_sched_find_node_by_teid()
93 if (!start_node->num_children || in ice_sched_find_node_by_teid()
94 start_node->tx_sched_layer >= ICE_AQC_TOPO_MAX_LEVEL_NUM || in ice_sched_find_node_by_teid()
95 start_node->info.data.elem_type == ICE_AQC_ELEM_TYPE_LEAF) in ice_sched_find_node_by_teid()
99 for (i = 0; i < start_node->num_children; i++) in ice_sched_find_node_by_teid()
100 if (ICE_TXSCHED_GET_NODE_TEID(start_node->children[i]) == teid) in ice_sched_find_node_by_teid()
101 return start_node->children[i]; in ice_sched_find_node_by_teid()
104 for (i = 0; i < start_node->num_children; i++) { in ice_sched_find_node_by_teid()
[all …]
H A Dice_sched.h128 ice_sched_find_node_by_teid(struct ice_sched_node *start_node, u32 teid);
/freebsd-13.1/contrib/ofed/opensm/opensm/
H A Dosm_ucast_dfsssp.c724 cdg_node_t * start_node) in search_cycle_in_channel_dep_graph() argument
727 cdg_node_t *current = start_node, *next_node = NULL, *tmp = NULL; in search_cycle_in_channel_dep_graph()