Home
last modified time | relevance | path

Searched refs:tree (Results 1 – 25 of 46) sorted by relevance

12

/dpdk/drivers/bus/dpaa/include/
H A Ddpaa_rbtree.h43 tree->head = tree->tail = NULL; in dpa_rbtree_init()
52 struct rb_node *node = tree->head; \
54 tree->head = tree->tail = &obj->node_field; \
63 if (tree->head == node) \
64 tree->head = &obj->node_field; \
77 tree->tail = &obj->node_field; \
85 tree->head = tree->tail = NULL; \
88 tree->head = tree->head->next; \
89 tree->head->prev = NULL; \
94 tree->tail = tree->tail->prev; \
[all …]
/dpdk/drivers/common/cnxk/
H A Droc_nix_tm.c197 enum roc_nix_tm_tree tree; in nix_tm_node_add() local
205 tree = node->tree; in nix_tm_node_add()
212 if (tree >= ROC_NIX_TM_TREE_MAX) in nix_tm_node_add()
592 enum roc_nix_tm_tree tree; in nix_tm_sq_flush_pre() local
608 tree = nix->tm_tree; in nix_tm_sq_flush_pre()
705 enum roc_nix_tm_tree tree; in nix_tm_sq_flush_post() local
719 tree = nix->tm_tree; in nix_tm_sq_flush_post()
1494 node->tree = ROC_NIX_TM_PFC; in roc_nix_tm_pfc_prepare_tree()
1516 node->tree = ROC_NIX_TM_PFC; in roc_nix_tm_pfc_prepare_tree()
1607 enum roc_nix_tm_tree tree; in nix_tm_free_resources() local
[all …]
H A Droc_nix_priv.h68 enum roc_nix_tm_tree tree; member
329 return &nix->trees[tree]; in nix_tm_node_list()
354 nix_tm_tree2str(enum roc_nix_tm_tree tree) in nix_tm_tree2str() argument
356 if (tree == ROC_NIX_TM_DEFAULT) in nix_tm_tree2str()
358 else if (tree == ROC_NIX_TM_RLIMIT) in nix_tm_tree2str()
360 else if (tree == ROC_NIX_TM_USER) in nix_tm_tree2str()
379 enum roc_nix_tm_tree tree, bool free);
415 uint32_t priority, enum roc_nix_tm_tree tree);
417 enum roc_nix_tm_tree tree);
423 enum roc_nix_tm_tree tree, uint32_t *rr_prio,
[all …]
H A Droc_nix_tm_ops.c294 node->tree = ROC_NIX_TM_USER; in roc_nix_tm_node_add()
372 enum roc_nix_tm_tree tree; in roc_nix_smq_flush() local
379 tree = nix->tm_tree; in roc_nix_smq_flush()
380 list = nix_tm_node_list(nix, tree); in roc_nix_smq_flush()
425 enum roc_nix_tm_tree tree; in roc_nix_tm_hierarchy_disable() local
437 tree = nix->tm_tree; in roc_nix_tm_hierarchy_disable()
438 list = nix_tm_node_list(nix, tree); in roc_nix_tm_hierarchy_disable()
563 if (tree >= ROC_NIX_TM_TREE_MAX) in roc_nix_tm_hierarchy_enable()
567 if (nix->tm_tree != tree) in roc_nix_tm_hierarchy_enable()
577 tree_mask &= ~BIT(tree); in roc_nix_tm_hierarchy_enable()
[all …]
H A Droc_nix_tm_utils.c83 enum roc_nix_tm_tree tree) in nix_tm_find_prio_anchor() argument
88 list = nix_tm_node_list(nix, tree); in nix_tm_find_prio_anchor()
120 list = nix_tm_node_list(nix, tree); in nix_tm_node_search()
364 list = nix_tm_node_list(nix, tree); in nix_tm_check_rr()
421 uint32_t priority, enum roc_nix_tm_tree tree) in nix_tm_validate_prio() argument
429 list = nix_tm_node_list(nix, tree); in nix_tm_validate_prio()
517 enum roc_nix_tm_tree tree; in nix_tm_topology_reg_prep() local
521 tree = node->tree; in nix_tm_topology_reg_prep()
921 enum roc_nix_tm_tree tree) in nix_tm_resource_estimate() argument
928 list = nix_tm_node_list(nix, tree); in nix_tm_resource_estimate()
[all …]
/dpdk/lib/rib/
H A Drte_rib.c43 struct rte_rib_node *tree; member
107 cur = rib->tree; in rte_rib_lookup()
134 cur = rib->tree; in __rib_lookup_exact()
176 tmp = rib->tree; in rte_rib_get_nxt()
222 rib->tree = child; in rte_rib_remove()
252 tmp = &rib->tree; in rte_rib_insert()
454 rib->tree = NULL; in rte_rib_create()
H A Drte_rib6.c42 struct rte_rib6_node *tree; member
141 cur = rib->tree; in rte_rib6_lookup()
178 cur = rib->tree; in rte_rib6_lookup_exact()
222 tmp = rib->tree; in rte_rib6_get_nxt()
269 rib->tree = child; in rte_rib6_remove()
302 tmp = &rib->tree; in rte_rib6_insert()
526 rib->tree = NULL; in rte_rib6_create()
/dpdk/doc/guides/contributing/
H A Dpatches.rst27 * Patches should be sent to the target repository or sub-tree, see below.
74 There are maintainers for the trees and for components within the tree.
90 * ``M`` is a tree or component maintainer.
91 * ``T`` is a repository tree.
108 The role of the tree maintainers is to:
110 * Maintain the overall quality of their tree.
115 * Prepare the tree for integration.
117 tree maintainer can't perform their role.
124 The backup maintainer for the main tree should be selected
125 from the existing sub-tree maintainers of the project.
[all …]
H A Dabi_policy.rst94 ABI version increment and the HEAD label of the git tree, with the condition
138 no maintainer is available for the component, the tree/sub-tree maintainer
352 After the experimental tag has been formally removed, a tree/sub-tree maintainer
H A Dunit_test.rst8 tests to the in-tree DPDK test suites.
19 The in-tree testing infrastructure for DPDK consists of
/dpdk/devtools/cocci/
H A Dprefix_mbuf_offload_flags.cocci6 // for f in $(git ls-tree --full-tree -r --name-only HEAD); do
/dpdk/doc/guides/windows_gsg/
H A Drun_apps.rst34 Refer to `Windows documentation <https://git.dpdk.org/dpdk-kmods/tree/windows>`_
70 Refer to `NetUIO documentation <https://git.dpdk.org/dpdk-kmods/tree/windows/netuio/README.rst>`_
/dpdk/devtools/
H A Dcheck-doc-vs-code.sh25 files=$(git diff-tree --name-only -r $trusted_commit..)
H A Dcheck-git-log.sh77 files=$(git diff-tree --no-commit-id --name-only -r $commit)
/dpdk/doc/guides/prog_guide/
H A Drib_lib.rst30 Internally RIB is represented as a binary tree as shown in :numref:`figure_rib_internals`:
38 The binary tree consists of two types of nodes:
42 * Intermediate Nodes which are used internally to preserve the binary tree structure.
H A Dtraffic_management.rst65 level/position in the tree. The SP algorithm is used to schedule between
164 The TM hierarchical tree consists of leaf nodes and non-leaf nodes. Each leaf
189 scheduling tree. The first node that is added to the hierarchy becomes the root
/dpdk/doc/guides/rel_notes/
H A Drelease_22_03.rst299 * Driver version(in-tree): 5.1.0-k (ixgbe)
300 * Driver version(out-tree): 5.13.4 (ixgbe)
313 * Driver version(out-tree): 2.17.15 (i40e)
314 * Driver version(in-tree): 2.8.20-k (i40e)
320 * Driver version(out-tree): 2.17.15 (i40e)
321 * Driver version(in-tree): 2.8.20-k (i40e)
H A Drelease_21_02.rst170 ``ethdev_vdev.h`` and ``ethdev_pci.h`` respectively in the source tree, to
177 tree, to reflect the fact that they are non-public headers.
/dpdk/doc/guides/nics/
H A Dmvneta.rst127 MVNETA PMD requires extra out of tree kernel modules to function properly.
H A Dmvpp2.rst84 - Out of tree `mvpp2x_sysfs` kernel module sources
143 MVPP2 PMD requires extra out of tree kernel modules to function properly.
636 Internally TM is represented by a hierarchy (tree) of nodes.
H A Dtap.rst237 instructions. The C array of eBPF instructions is part of TAP PMD tree and
261 Embed the C array in your TAP PMD tree.
H A Dqede.rst86 …repository <http://git.kernel.org/pub/scm/linux/kernel/git/firmware/linux-firmware.git/tree/qed>`_.
/dpdk/doc/guides/tools/
H A Dcomp_perf.rst9 compress tree. User can use multiple cores to run tests on but only
/dpdk/doc/guides/sample_app_ug/
H A Dl2_forward_cat.rst54 and the DPDK source tree and go to the example directory:
/dpdk/doc/guides/linux_gsg/
H A Dsys_reqs.rst209 See the Documentation/admin-guide/kernel-parameters.txt file in your Linux source tree for further …

12