| /dpdk/lib/graph/ |
| H A D | node.c | 31 struct node *node; in node_from_name() local
43 struct node *node; in node_has_duplicate_entry() local
59 struct node *node; in __rte_node_register() local
141 node_clone(struct node *node, const char *name) in node_clone()
184 struct node *node; in rte_node_clone() local
198 struct node *node; in rte_node_from_name() local
210 struct node *node; in rte_node_id_to_name() local
224 struct node *node; in rte_node_edge_count() local
293 struct node *node; in rte_node_edge_shrink() local
354 struct node *node; in rte_node_edge_get() local
[all …]
|
| H A D | graph_private.h | 48 struct node { struct
50 char name[RTE_NODE_NAMESIZE]; /**< Name of the node. */ argument
52 rte_node_process_t process; /**< Node process function. */ argument
53 rte_node_init_t init; /**< Node init function. */ argument
54 rte_node_fini_t fini; /**< Node fini function. */ argument
55 rte_node_t id; /**< Allocated identifier for the node. */ argument
56 rte_node_t parent_id; /**< Parent node identifier. */ argument
57 rte_edge_t nb_edges; /**< Number of edges from this node. */ argument
58 char next_nodes[][RTE_NODE_NAMESIZE]; /**< Names of next nodes. */ argument
68 struct node *node; /**< Pointer to internal node. */ member
|
| H A D | rte_graph_worker.h | 137 struct rte_node *node; in rte_graph_walk() local
191 __rte_node_enqueue_tail_update(struct rte_graph *graph, struct rte_node *node) in __rte_node_enqueue_tail_update()
218 __rte_node_enqueue_prologue(struct rte_graph *graph, struct rte_node *node, in __rte_node_enqueue_prologue()
244 __rte_node_next_node_get(struct rte_node *node, rte_edge_t next) in __rte_node_next_node_get()
271 rte_node_enqueue(struct rte_graph *graph, struct rte_node *node, in rte_node_enqueue()
298 rte_node_enqueue_x1(struct rte_graph *graph, struct rte_node *node, in rte_node_enqueue_x1()
328 rte_node_enqueue_x2(struct rte_graph *graph, struct rte_node *node, in rte_node_enqueue_x2()
363 rte_node_enqueue_x4(struct rte_graph *graph, struct rte_node *node, in rte_node_enqueue_x4()
397 rte_node_enqueue_next(struct rte_graph *graph, struct rte_node *node, in rte_node_enqueue_next()
427 rte_node_next_stream_get(struct rte_graph *graph, struct rte_node *node, in rte_node_next_stream_get()
[all …]
|
| H A D | graph_populate.c | 74 struct rte_node *node = RTE_PTR_ADD(graph, off); in graph_nodes_populate() local
108 struct rte_node *node; in graph_node_id_to_ptr() local
122 struct rte_node *node; in graph_node_name_to_ptr() local
136 struct rte_node *node; in graph_node_nexts_populate() local
159 struct rte_node *node; in graph_src_nodes_populate() local
218 struct rte_node *node; in graph_nodes_mem_destroy() local
|
| H A D | graph.c | 44 graph_node_add(struct graph *graph, struct node *node) in graph_node_add()
76 node_to_graph_node(struct graph *graph, struct node *node) in node_to_graph_node()
145 struct node *node; in expand_pattern_to_node() local
215 struct rte_node *node; in graph_mem_fixup_node_ctx() local
419 struct rte_node *node; in rte_graph_node_get() local
441 struct rte_node *node; in rte_graph_node_get_by_name() local
461 __rte_node_stream_alloc(struct rte_graph *graph, struct rte_node *node) in __rte_node_stream_alloc()
476 __rte_node_stream_alloc_size(struct rte_graph *graph, struct rte_node *node, in __rte_node_stream_alloc_size()
|
| /dpdk/examples/server_node_efd/server/ |
| H A D | init.h | 17 struct node { struct
19 unsigned int node_id; argument
20 /* these stats hold how many packets the node will actually receive, argument
32 extern struct node *nodes; argument
|
| /dpdk/lib/vhost/ |
| H A D | iotlb.c | 31 struct vhost_iotlb_entry *node, *temp_node; in vhost_user_iotlb_pending_remove_all() local
47 struct vhost_iotlb_entry *node; in vhost_user_iotlb_pending_miss() local
68 struct vhost_iotlb_entry *node; in vhost_user_iotlb_pending_insert() local
103 struct vhost_iotlb_entry *node, *temp_node; in vhost_user_iotlb_pending_remove() local
125 struct vhost_iotlb_entry *node, *temp_node; in vhost_user_iotlb_cache_remove_all() local
142 struct vhost_iotlb_entry *node, *temp_node; in vhost_user_iotlb_cache_random_evict() local
167 struct vhost_iotlb_entry *node, *new_node; in vhost_user_iotlb_cache_insert() local
224 struct vhost_iotlb_entry *node, *temp_node; in vhost_user_iotlb_cache_remove() local
250 struct vhost_iotlb_entry *node; in vhost_user_iotlb_cache_find() local
|
| /dpdk/drivers/common/cnxk/ |
| H A D | cnxk_telemetry_nix.c | 26 struct nix_tel_node *node, *roc_node = NULL; in nix_tel_node_get() local
42 struct nix_tel_node *node; in nix_tel_node_add() local
72 struct nix_tel_node *node; in nix_tel_node_del() local
89 struct nix_tel_node *node, *roc_node = NULL; in nix_tel_node_get_by_pcidev_name() local
105 struct nix_tel_node *node; in nix_tel_node_add_rq() local
119 struct nix_tel_node *node; in nix_tel_node_add_cq() local
133 struct nix_tel_node *node; in nix_tel_node_add_sq() local
721 struct nix_tel_node *node; in cnxk_nix_tel_handle_list() local
739 struct nix_tel_node *node; in cnxk_nix_tel_handle_info() local
758 struct nix_tel_node *node; in cnxk_nix_tel_handle_info_x() local
|
| H A D | roc_nix_tm.c | 102 struct nix_tm_node *node; in nix_tm_txsch_reg_config() local
331 struct nix_tm_node *node; in nix_tm_bp_config_set() local
410 struct nix_tm_node *node; in nix_tm_bp_config_get() local
501 struct nix_tm_node *node; in nix_tm_leaf_data_get() local
590 struct nix_tm_node *node, *sibling; in nix_tm_sq_flush_pre() local
703 struct nix_tm_node *node, *sibling; in nix_tm_sq_flush_post() local
970 struct nix_tm_node *node, *child; in nix_tm_node_delete() local
1312 struct nix_tm_node *node = NULL; in nix_tm_prepare_default_tree() local
1381 struct nix_tm_node *node = NULL; in roc_nix_tm_prepare_rate_limited_tree() local
1473 struct nix_tm_node *node = NULL; in roc_nix_tm_pfc_prepare_tree() local
[all …]
|
| H A D | roc_nix_tm_utils.c | 118 struct nix_tm_node *node; in nix_tm_node_search() local
355 struct nix_tm_node *node; in nix_tm_check_rr() local
425 struct nix_tm_node *node; in nix_tm_validate_prio() local
709 nix_tm_shaper_reg_prep(struct nix_tm_node *node, in nix_tm_shaper_reg_prep()
836 nix_tm_sw_xoff_prep(struct nix_tm_node *node, bool enable, in nix_tm_sw_xoff_prep()
990 struct nix_tm_node *node; in roc_nix_tm_leaf_cnt() local
1007 struct nix_tm_node *node; in roc_nix_tm_node_lvl() local
1020 struct nix_tm_node *node; in roc_nix_tm_node_get() local
1077 struct nix_tm_node *node; in nix_tm_node_alloc() local
1088 nix_tm_node_free(struct nix_tm_node *node) in nix_tm_node_free()
[all …]
|
| H A D | roc_nix_tm_ops.c | 282 struct nix_tm_node *node; in roc_nix_tm_node_add() local
304 struct nix_tm_node *node, *child; in roc_nix_tm_node_pkt_mode_update() local
345 struct nix_tm_node *node; in roc_nix_tm_node_name_get() local
373 struct nix_tm_node *node; in roc_nix_smq_flush() local
426 struct nix_tm_node *node; in roc_nix_tm_hierarchy_disable() local
557 struct nix_tm_node *node; in roc_nix_tm_hierarchy_enable() local
673 struct nix_tm_node *node; in roc_nix_tm_node_suspend_resume() local
760 struct nix_tm_node *node; in roc_nix_tm_node_shaper_update() local
835 struct nix_tm_node *node, *sibling; in roc_nix_tm_node_parent_update() local
974 struct nix_tm_node *node, *parent; in roc_nix_tm_rlimit_sq() local
|
| /dpdk/drivers/net/mvpp2/ |
| H A D | mrvl_tm.c | 95 struct mrvl_tm_node *node = LIST_FIRST(&priv->nodes); in mrvl_tm_deinit() local
124 struct mrvl_tm_node *node; in mrvl_node_from_id() local
147 struct mrvl_tm_node *node; in mrvl_node_type_get() local
310 struct mrvl_tm_node *node; in mrvl_node_capabilities_get() local
610 struct mrvl_tm_node *node, *parent = NULL; in mrvl_node_add() local
701 struct mrvl_tm_node *node; in mrvl_node_delete() local
769 struct mrvl_tm_node *node, *tmp; in mrvl_node_suspend() local
815 struct mrvl_tm_node *node; in mrvl_node_resume() local
856 struct mrvl_tm_node *node; in mrvl_hierarchy_commit() local
967 struct mrvl_tm_node *node; in mrvl_node_stats_read() local
[all …]
|
| /dpdk/drivers/net/dpaa2/ |
| H A D | dpaa2_tm.c | 37 struct dpaa2_tm_node *node = LIST_FIRST(&priv->nodes); in dpaa2_tm_deinit() local
59 struct dpaa2_tm_node *node; in dpaa2_node_from_id() local
185 struct dpaa2_tm_node *node; in dpaa2_node_capabilities_get() local
238 struct dpaa2_tm_node *node; in dpaa2_node_type_get() local
439 struct dpaa2_tm_node *node, *parent = NULL; in dpaa2_node_add() local
532 struct dpaa2_tm_node *node; in dpaa2_node_delete() local
565 dpaa2_tm_configure_queue(struct rte_eth_dev *dev, struct dpaa2_tm_node *node) in dpaa2_tm_configure_queue()
683 struct dpaa2_tm_node *node; in dpaa2_hierarchy_commit() local
901 struct dpaa2_tm_node *node; in dpaa2_node_stats_read() local
|
| /dpdk/lib/rib/ |
| H A D | rte_rib.c | 51 is_valid_node(struct rte_rib_node *node) in is_valid_node()
57 is_right_node(struct rte_rib_node *node) in is_right_node()
72 get_nxt_node(struct rte_rib_node *node, uint32_t ip) in get_nxt_node()
343 rte_rib_get_ip(const struct rte_rib_node *node, uint32_t *ip) in rte_rib_get_ip()
354 rte_rib_get_depth(const struct rte_rib_node *node, uint8_t *depth) in rte_rib_get_depth()
365 rte_rib_get_ext(struct rte_rib_node *node) in rte_rib_get_ext()
371 rte_rib_get_nh(const struct rte_rib_node *node, uint64_t *nh) in rte_rib_get_nh()
382 rte_rib_set_nh(struct rte_rib_node *node, uint64_t nh) in rte_rib_set_nh()
|
| H A D | rte_rib6.c | 50 is_valid_node(struct rte_rib6_node *node) in is_valid_node()
56 is_right_node(struct rte_rib6_node *node) in is_right_node()
101 get_nxt_node(struct rte_rib6_node *node, in get_nxt_node()
413 rte_rib6_get_ip(const struct rte_rib6_node *node, in rte_rib6_get_ip()
425 rte_rib6_get_depth(const struct rte_rib6_node *node, uint8_t *depth) in rte_rib6_get_depth()
436 rte_rib6_get_ext(struct rte_rib6_node *node) in rte_rib6_get_ext()
442 rte_rib6_get_nh(const struct rte_rib6_node *node, uint64_t *nh) in rte_rib6_get_nh()
453 rte_rib6_set_nh(struct rte_rib6_node *node, uint64_t nh) in rte_rib6_set_nh()
|
| /dpdk/lib/acl/ |
| H A D | acl_gen.c | 60 acl_dfa_gen_idx(const struct rte_acl_node *node, uint32_t index) in acl_dfa_gen_idx()
77 acl_dfa_fill_gr64(const struct rte_acl_node *node, in acl_dfa_fill_gr64()
112 acl_node_fill_dfa(const struct rte_acl_node *node, in acl_node_fill_dfa()
196 acl_count_fanout(struct rte_acl_node *node) in acl_count_fanout()
221 struct rte_acl_node *node, uint64_t no_match, int force_dfa) in acl_count_trie_types()
277 acl_add_ptrs(struct rte_acl_node *node, uint64_t *node_array, uint64_t no_match, in acl_add_ptrs()
331 acl_gen_node(struct rte_acl_node *node, uint64_t *node_array, in acl_gen_node()
|
| H A D | acl_bld.c | 72 uint32_t node; member
156 struct rte_acl_node *node; in acl_alloc_node() local
182 struct rte_acl_node *node) in acl_free_node()
248 struct rte_acl_node *node, in acl_add_ptr()
308 struct rte_acl_node *node, in acl_add_ptr_range()
438 struct rte_acl_node *node, int index) in acl_deref_ptr()
784 struct rte_acl_node *node, *prev; in acl_gen_full_range() local
800 struct rte_acl_node *node; in acl_gen_range_mdl() local
811 struct rte_acl_node *node; in acl_gen_range_low() local
836 struct rte_acl_node *node; in acl_gen_range_high() local
[all …]
|
| /dpdk/app/test/ |
| H A D | test_graph.c | 93 struct test_node_register node; member
143 node_init(const struct rte_graph *graph, struct rte_node *node) in node_init()
169 test_node_worker_source(struct rte_graph *graph, struct rte_node *node, in test_node_worker_source()
214 test_node0_worker(struct rte_graph *graph, struct rte_node *node, void **objs, in test_node0_worker()
297 test_node1_worker(struct rte_graph *graph, struct rte_node *node, void **objs, in test_node1_worker()
351 test_node2_worker(struct rte_graph *graph, struct rte_node *node, void **objs, in test_node2_worker()
407 test_node3_worker(struct rte_graph *graph, struct rte_node *node, void **objs, in test_node3_worker()
683 struct rte_node *node; in test_graph_lookup_functions() local
|
| H A D | test_rib.c | 136 struct rte_rib_node *node, *node1; in test_insert_invalid() local
179 struct rte_rib_node *node; in test_get_fn() local
259 struct rte_rib_node *node; in test_basic() local
314 struct rte_rib_node *node; in test_tree_traversal() local
|
| H A D | test_rib6.c | 137 struct rte_rib6_node *node, *node1; in test_insert_invalid() local
180 struct rte_rib6_node *node; in test_get_fn() local
261 struct rte_rib6_node *node; in test_basic() local
317 struct rte_rib6_node *node; in test_tree_traversal() local
|
| /dpdk/lib/node/ |
| H A D | ethdev_tx.c | 15 ethdev_tx_node_process(struct rte_graph *graph, struct rte_node *node, in ethdev_tx_node_process()
39 ethdev_tx_node_init(const struct rte_graph *graph, struct rte_node *node) in ethdev_tx_node_init()
|
| H A D | ethdev_rx.c | 17 ethdev_rx_node_process_inline(struct rte_graph *graph, struct rte_node *node, in ethdev_rx_node_process_inline()
41 ethdev_rx_node_process(struct rte_graph *graph, struct rte_node *node, in ethdev_rx_node_process()
179 ethdev_rx_node_init(const struct rte_graph *graph, struct rte_node *node) in ethdev_rx_node_init()
|
| /dpdk/drivers/net/ice/base/ |
| H A D | ice_sched.c | 155 struct ice_sched_node *node; in ice_sched_add_node() local
1146 struct ice_sched_node *node; in ice_rm_dflt_leaf_node() local
1174 struct ice_sched_node *node; in ice_sched_rm_dflt_nodes() local
1309 struct ice_sched_node *node; in ice_sched_get_node() local
1560 struct ice_sched_node *node; in ice_sched_get_vsi_node() local
1589 struct ice_sched_node *node; in ice_sched_get_agg_node() local
1733 struct ice_sched_node *node; in ice_sched_calc_vsi_support_nodes() local
2278 struct ice_sched_node *node; in ice_sched_move_nodes() local
3598 struct ice_sched_node *node; in ice_cfg_vsi_q_priority() local
4420 struct ice_sched_node *node; in ice_sched_set_q_bw_lmt() local
[all …]
|
| /dpdk/drivers/common/dpaax/ |
| H A D | dpaa_of.h | 76 struct device_node node; /**< Property of node */ member
86 struct dt_node node; member
100 struct dt_node node; member
|
| /dpdk/lib/bpf/ |
| H A D | bpf_validate.c | 1778 get_next_node(struct bpf_verifier *bvf, struct inst_node *node) in get_next_node()
1793 set_node_colour(struct bpf_verifier *bvf, struct inst_node *node, in set_node_colour()
1836 set_edge_type(struct bpf_verifier *bvf, struct inst_node *node, in set_edge_type()
1862 get_prev_node(struct bpf_verifier *bvf, struct inst_node *node) in get_prev_node()
1876 struct inst_node *next, *node; in dfs() local
1919 struct inst_node *node; in log_unreachable() local
1940 struct inst_node *node; in log_loop() local
1969 struct inst_node *node; in validate() local
2139 save_eval_state(struct bpf_verifier *bvf, struct inst_node *node) in save_eval_state()
2169 restore_eval_state(struct bpf_verifier *bvf, struct inst_node *node) in restore_eval_state()
[all …]
|