Home
last modified time | relevance | path

Searched refs:num_nodes (Results 1 – 11 of 11) sorted by relevance

/f-stack/dpdk/examples/server_node_efd/server/
H A Dinit.c71 const unsigned int num_mbufs = (num_nodes * MBUFS_PER_NODE) + in init_mbuf_pools()
102 const uint16_t rx_rings = 1, tx_rings = num_nodes; in init_port()
180 sizeof(*nodes) * num_nodes, 0); in init_shm_rings()
185 for (i = 0; i < num_nodes; i++) { in init_shm_rings()
227 node_id = i % num_nodes; in populate_efd_table()
360 info->num_nodes = num_nodes; in init()
H A Dmain.c117 for (i = 0; i < num_nodes; i++) { in do_stats_display()
154 for (i = 0; i < num_nodes; i++) { in do_stats_display()
207 for (i = 0; i < num_nodes; i++) in clear_stats()
275 if (node >= num_nodes) { in process_packets()
288 for (i = 0; i < num_nodes; i++) in process_packets()
328 cl_rx_buf = calloc(num_nodes, sizeof(cl_rx_buf[0])); in main()
H A Dargs.c23 uint8_t num_nodes; variable
96 num_nodes = (uint8_t)temp; in parse_num_nodes()
160 if (info->num_ports == 0 || num_nodes == 0) { in parse_app_args()
H A Dinit.h41 extern uint8_t num_nodes;
/f-stack/dpdk/drivers/net/ice/base/
H A Dice_sched.c995 if (!num_nodes) in ice_sched_add_nodes_to_layer()
1719 num_nodes[i]++; in ice_sched_calc_vsi_support_nodes()
1740 num_nodes[i]++; in ice_sched_calc_vsi_support_nodes()
1818 num_nodes); in ice_sched_add_vsi_to_topo()
2174 u16 *num_nodes) in ice_sched_get_free_vsi_parent() argument
2189 num_nodes[l] = 0; in ice_sched_get_free_vsi_parent()
2198 num_nodes); in ice_sched_get_free_vsi_parent()
2343 num_nodes[i] = 1; in ice_sched_move_vsi_to_agg()
2349 num_nodes); in ice_sched_move_vsi_to_agg()
2584 num_nodes[aggl] = 1; in ice_sched_add_agg_cfg()
[all …]
H A Dice_sched.h81 ice_aq_cfg_l2_node_cgd(struct ice_hw *hw, u16 num_nodes,
H A Dice_adminq_cmd.h1183 __le32 num_nodes; /* Response only */ member
/f-stack/dpdk/examples/server_node_efd/shared/
H A Dcommon.h38 uint8_t num_nodes; member
/f-stack/dpdk/doc/guides/sample_app_ug/
H A Dserver_node_efd.rst51 node_id = i % num_nodes; /* Target node id is generated */
166 node_id = i % num_nodes;
210 if (node >= num_nodes) {
223 for (i = 0; i < num_nodes; i++)
287 uint32_t num_flows_node = info->num_flows / info->num_nodes;
321 target_node = i % info->num_nodes;
399 for (i = 0; i < num_nodes; i++) {
436 for (i = 0; i < num_nodes; i++) {
/f-stack/dpdk/examples/server_node_efd/node/
H A Dnode.c195 uint32_t num_flows_node = info->num_flows / info->num_nodes; in create_hash_table()
229 target_node = i % info->num_nodes; in populate_hash_table()
/f-stack/dpdk/lib/librte_acl/
H A Dacl_bld.c73 uint32_t num_nodes; member
171 context->num_nodes++; in acl_alloc_node()
207 context->num_nodes--; in acl_free_node()
1048 node_count = context->num_nodes; in build_trie()
1055 node_count = context->num_nodes - node_count; in build_trie()
1424 ctx->num_nodes, in acl_build_log()