Searched refs:tree (Results 1 - 15 of 15) sorted by relevance

/drivers/sh/intc/
H A Dvirq.c15 #include <linux/radix-tree.h>
31 * Tags for the radix tree
65 * fast-path out if the tree is untagged, so there is no
66 * need to explicitly test the root tree.
68 tagged = radix_tree_tag_get(&d->tree, enum_id,
73 ptr = radix_tree_lookup(&d->tree, enum_id);
151 mapped = radix_tree_lookup(&d->tree, subgroup->parent_id);
176 err = radix_tree_insert(&d->tree, entry->enum_id, entry);
180 radix_tree_tag_set(&d->tree, entry->enum_id,
208 nr_found = radix_tree_gang_lookup_tag_slot(&d->tree,
[all...]
H A Dinternals.h6 #include <linux/radix-tree.h>
55 struct radix_tree_root tree; member in struct:intc_desc_int
H A Dcore.c32 #include <linux/radix-tree.h>
84 * it in to the radix tree.
89 radix_tree_insert(&d->tree, enum_id, intc_irq_xlate_get(irq));
205 INIT_RADIX_TREE(&d->tree, GFP_ATOMIC);
/drivers/net/ethernet/mellanox/mlx4/
H A Dcq.c11 * COPYING in the main directory of this source tree, or the
60 cq = radix_tree_lookup(&mlx4_priv(dev)->cq_table.tree,
79 cq = radix_tree_lookup(&cq_table->tree, cqn & (dev->caps.num_cqs - 1));
264 err = radix_tree_insert(&cq_table->tree, cq->cqn, cq);
303 radix_tree_delete(&cq_table->tree, cq->cqn);
326 radix_tree_delete(&cq_table->tree, cq->cqn);
343 INIT_RADIX_TREE(&cq_table->tree, GFP_ATOMIC);
H A Dsrq.c8 * COPYING in the main directory of this source tree, or the
50 srq = radix_tree_lookup(&srq_table->tree, srqn & (dev->caps.num_srqs - 1));
179 err = radix_tree_insert(&srq_table->tree, srq->srqn, srq);
218 radix_tree_delete(&srq_table->tree, srq->srqn);
237 radix_tree_delete(&srq_table->tree, srq->srqn);
283 INIT_RADIX_TREE(&srq_table->tree, GFP_ATOMIC);
H A Dmlx4.h11 * COPYING in the main directory of this source tree, or the
41 #include <linux/radix-tree.h>
486 /* tree for each resources */
565 struct radix_tree_root tree; member in struct:mlx4_cq_table
586 struct radix_tree_root tree; member in struct:mlx4_srq_table
/drivers/pinctrl/
H A Dcore.h13 #include <linux/radix-tree.h>
25 * this radix tree
H A Dpinmux.c21 #include <linux/radix-tree.h>
/drivers/firewire/
H A Dcore-topology.c137 * setting the gap count. As we build the tree bottom up in
144 * containted in a child tree, in which case the max hop count is just
177 * This function builds the tree representation of the topology given
179 * of the tree, the function checks that the self IDs are valid and
404 struct fw_node *tree; local
407 tree = node1->ports[port];
408 node0->ports[port] = tree;
409 for (i = 0; i < tree->port_count; i++) {
410 if (tree->ports[i] == node1) {
411 tree
[all...]
/drivers/input/
H A DKconfig50 option is only useful for out-of-tree drivers since
51 in-tree drivers select it automatically.
63 useful for out-of-tree drivers since in-tree drivers
/drivers/usb/
H A DKconfig97 connected to a single USB host in a tree structure.
99 The USB host is the root of the tree, the peripherals are the
/drivers/md/
H A DKconfig382 a pre-generated tree of cryptographic checksums stored on a second
/drivers/hwspinlock/
H A Dhwspinlock_core.c26 #include <linux/radix-tree.h>
33 /* radix tree tags */
37 * A radix tree is used to maintain the available hwspinlock instances.
38 * The tree associates hwspinlock pointers with their integer key id,
47 * The radix tree API supports tagging items in the tree, which this
50 * tree, looking for an unused hwspinlock instance, is now reduced to a
51 * single radix tree API call.
56 * Synchronization of access to the tree is achieved using this mutex,
57 * as the radix-tree AP
[all...]
/drivers/block/
H A Dbrd.c19 #include <linux/radix-tree.h>
65 * This is strictly true for the radix-tree nodes as well (ie. we
67 * documented feature of the radix-tree API so it is better to be
68 * safe here (we don't have total exclusion from radix tree updates
157 * Free all backing store pages and radix tree. This must only be called when
187 * many pages as possible. If the radix-tree code changes,
/drivers/net/tokenring/
H A Dsmctr.c756 DECODE_TREE_NODE *tree; local
768 tree = (DECODE_TREE_NODE *)(fw->data + TREE_OFFSET);
776 while((tree + branch)->tag != LEAF && weight)
778 branch = *ucode & bit ? (tree + branch)->llink
779 : (tree + branch)->rlink;
791 buff |= (tree + branch)->info << shift;

Completed in 396 milliseconds