| /dpdk/app/test-cmdline/ |
| H A D | cmdline_test.py | 15 def runTest(child, test): argument 16 child.send(test["Sequence"]) 19 child.expect(test["Result"], 1) 33 def runHistoryTest(child): argument 62 child = pexpect.spawn(test_app_path) variable 68 runTest(child, test) 72 print(child) 76 child = pexpect.spawn(test_app_path) variable 80 runHistoryTest(child) 84 print(child) [all …]
|
| /dpdk/drivers/common/dpaax/ |
| H A D | dpaa_of.h | 137 #define for_each_child_node(parent, child) \ argument 138 for (child = of_get_next_child(parent, NULL); child != NULL; \ 139 child = of_get_next_child(parent, child))
|
| /dpdk/drivers/common/cnxk/ |
| H A D | roc_nix_tm.c | 151 if (child->flags & NIX_TM_NODE_HWRES && child->parent && in nix_tm_update_parent_info() 155 child->max_prio = UINT32_MAX; in nix_tm_update_parent_info() 984 if (child->parent == node) in nix_tm_node_delete() 1021 struct nix_tm_node *child; in nix_tm_assign_hw_id() local 1039 if (!child->parent) in nix_tm_assign_hw_id() 1047 nix_tm_hwlvl2str(child->hw_lvl), child->hw_id, in nix_tm_assign_hw_id() 1048 child->id, child); in nix_tm_assign_hw_id() 1066 child->id, child->lvl, child); in nix_tm_assign_hw_id() 1081 nix_tm_hwlvl2str(child->hw_lvl), schq, child->lvl, in nix_tm_assign_hw_id() 1082 child->id, child); in nix_tm_assign_hw_id() [all …]
|
| H A D | roc_nix_tm_utils.c | 469 struct nix_tm_node *child; in nix_tm_child_res_valid() local 471 TAILQ_FOREACH(child, list, node) { in nix_tm_child_res_valid() 472 if (child->parent != parent) in nix_tm_child_res_valid() 474 if (!(child->flags & NIX_TM_NODE_HWRES)) in nix_tm_child_res_valid() 516 uint64_t parent = 0, child = 0; in nix_tm_topology_reg_prep() local 537 child = nix_tm_find_prio_anchor(nix, node->id, tree); in nix_tm_topology_reg_prep() 544 child = 0; in nix_tm_topology_reg_prep() 550 parent, node->lvl, node->id, child, rr_prio, node); in nix_tm_topology_reg_prep() 580 regval[k] = (child << 32) | (rr_prio << 1); in nix_tm_topology_reg_prep() 597 regval[k] = (child << 32) | (rr_prio << 1); in nix_tm_topology_reg_prep() [all …]
|
| H A D | roc_nix_tm_ops.c | 304 struct nix_tm_node *node, *child; in roc_nix_tm_node_pkt_mode_update() local 322 TAILQ_FOREACH(child, list, node) { in roc_nix_tm_node_pkt_mode_update() 323 if (child->parent == node) in roc_nix_tm_node_pkt_mode_update()
|
| /dpdk/drivers/net/bnxt/tf_core/ |
| H A D | tf_rm.c | 421 int parent, child; in tf_rm_update_parent_reservations() local 455 for (child = 0; child < num_elements; child++) { in tf_rm_update_parent_reservations() 457 if (cfg[child].cfg_type == in tf_rm_update_parent_reservations() 460 alloc_cnt[child]) { in tf_rm_update_parent_reservations() 465 c_slices = cfg[child].slices; in tf_rm_update_parent_reservations() 470 cfg[child].hcapi_type, in tf_rm_update_parent_reservations() 475 tf_tbl_type_2_str(child), in tf_rm_update_parent_reservations() 476 alloc_cnt[child], in tf_rm_update_parent_reservations() 483 cnt = alloc_cnt[child] / c_slices; in tf_rm_update_parent_reservations() 485 if (alloc_cnt[child] % c_slices) in tf_rm_update_parent_reservations() [all …]
|
| /dpdk/lib/rib/ |
| H A D | rte_rib.c | 207 struct rte_rib_node *cur, *prev, *child; in rte_rib_remove() local 218 child = (cur->left == NULL) ? cur->right : cur->left; in rte_rib_remove() 219 if (child != NULL) in rte_rib_remove() 220 child->parent = cur->parent; in rte_rib_remove() 222 rib->tree = child; in rte_rib_remove() 227 cur->parent->left = child; in rte_rib_remove() 229 cur->parent->right = child; in rte_rib_remove()
|
| H A D | rte_rib6.c | 254 struct rte_rib6_node *cur, *prev, *child; in rte_rib6_remove() local 265 child = (cur->left == NULL) ? cur->right : cur->left; in rte_rib6_remove() 266 if (child != NULL) in rte_rib6_remove() 267 child->parent = cur->parent; in rte_rib6_remove() 269 rib->tree = child; in rte_rib6_remove() 274 cur->parent->left = child; in rte_rib6_remove() 276 cur->parent->right = child; in rte_rib6_remove()
|
| /dpdk/drivers/common/mlx5/linux/ |
| H A D | mlx5_common_auxiliary.c | 23 char *child, size_t size) in mlx5_auxiliary_get_child_name() argument 44 if (rte_strscpy(child, dent->d_name, size) < 0) in mlx5_auxiliary_get_child_name()
|
| /dpdk/lib/acl/ |
| H A D | acl_gen.c | 117 struct rte_acl_node *child; in acl_node_fill_dfa() local 128 child = node->ptrs[x].ptr; in acl_node_fill_dfa() 129 if (child == NULL) in acl_node_fill_dfa() 138 dfa[n] = resolved ? child->node_index : x; in acl_node_fill_dfa()
|
| /dpdk/drivers/bus/fslmc/ |
| H A D | fslmc_vfio.h | 26 struct fslmc_vfio_device *child; /* Child object */ member
|
| /dpdk/lib/gpudev/ |
| H A D | gpudev.c | 322 int16_t dev_id, child; in rte_gpu_release() local 329 RTE_GPU_FOREACH_CHILD(child, dev_id) { in rte_gpu_release() 331 dev_id, child); in rte_gpu_release()
|
| /dpdk/doc/guides/gpus/ |
| H A D | cuda.rst | 130 in the CUDA driver library as child devices having as parent a GPU physical device. 146 - Register new child devices aka new CUDA Driver contexts.
|
| /dpdk/doc/guides/prog_guide/ |
| H A D | gpudev.rst | 54 that will be registered internally by the driver as an additional device (child) 56 Each device (parent or child) is represented through a ID
|
| H A D | traffic_management.rst | 179 weights. The WFQ weight of a given child node is relative to the sum of the
|
| /dpdk/drivers/common/mlx5/ |
| H A D | mlx5_common.h | 258 char *child, size_t size);
|
| /dpdk/doc/guides/rel_notes/ |
| H A D | release_21_08.rst | 14 An auxiliary bus provides a way to split a function into child-devices
|
| /dpdk/drivers/net/ice/base/ |
| H A D | ice_sched.c | 1439 struct ice_sched_node *child = base->children[i]; in ice_sched_find_node_in_subtree() local 1441 if (node == child) in ice_sched_find_node_in_subtree() 1444 if (child->tx_sched_layer > node->tx_sched_layer) in ice_sched_find_node_in_subtree() 1450 if (ice_sched_find_node_in_subtree(hw, child, node)) in ice_sched_find_node_in_subtree()
|