/linux-master/kernel/ |
H A D | auditfilter.c | 158 krule->inode_f || krule->watch || krule->tree || 614 if (entry->rule.tree) 615 audit_put_tree(entry->rule.tree); /* that's the temporary one */ 676 audit_tree_path(krule->tree)); 741 if (strcmp(audit_tree_path(a->tree), 742 audit_tree_path(b->tree))) 846 * never dereferences tree and we can't get false positives there 851 new->tree = old->tree; 943 struct audit_tree *tree local 1026 struct audit_tree *tree = entry->rule.tree; local [all...] |
H A D | audit.h | 261 /* audit watch/mark/tree functions */ 291 struct audit_tree *tree); 297 extern const char *audit_tree_path(struct audit_tree *tree); 298 extern void audit_put_tree(struct audit_tree *tree); 327 #define audit_put_tree(tree) do { } while (0)
|
/linux-master/drivers/md/bcache/ |
H A D | bset.c | 256 * the auxiliar search tree - when we're done searching the bset_float tree we 260 * we're touching one fewer cacheline in the bset tree in exchange for one more 303 kfree(t->tree); 305 free_pages((unsigned long) t->tree, 311 t->tree = NULL; 329 t->tree = bset_tree_bytes(b) < PAGE_SIZE 332 if (!t->tree) 365 /* Binary tree stuff for auxiliary search trees */ 369 * of a binary tree whic [all...] |
/linux-master/tools/testing/radix-tree/ |
H A D | regression4.c | 5 #include <linux/radix-tree.h>
|
H A D | regression2.c | 5 * Toshiyuki Okajima describes the following radix-tree bug: 10 * 0. The radix tree contains RADIX_TREE_MAP_SIZE items. And the tag of 18 * 2. An item is added into the radix tree and then the level of it is 19 * extended into 2 from 1. At that time, the new radix tree node succeeds 20 * the tag status of the root tag. Therefore the tag of the new radix tree 22 * PAGECACHE_TAG_TOWRITE tag in the child node of the new radix tree node. 26 * radix tree.) As the result, the slot of the radix tree node is NULL but 31 * slot of the radix tree node is NULL, but the tag which corresponds to 49 #include <linux/radix-tree [all...] |
H A D | regression3.c | 23 #include <linux/radix-tree.h>
|
/linux-master/drivers/gpu/drm/amd/display/dc/dcn10/ |
H A D | dcn10_mpc.h | 143 struct mpc_tree *tree, 152 struct mpc_tree *tree, 186 struct mpc_tree *tree); 193 struct mpc_tree *tree,
|
/linux-master/scripts/dtc/ |
H A D | yamltree.c | 178 static void yaml_tree(struct node *tree, yaml_emitter_t *emitter) argument 184 if (tree->deleted) 191 for_each_property(tree, prop) 195 for_each_child(tree, child) {
|
H A D | flattree.c | 236 static void flatten_tree(struct node *tree, struct emitter *emit, argument 244 if (tree->deleted) 247 emit->beginnode(etarget, tree->labels); 250 emit->string(etarget, tree->fullpath, 0); 252 emit->string(etarget, tree->name, 0); 256 for_each_property(tree, prop) { 277 emit->cell(etarget, tree->basenamelen+1); 280 if ((vi->flags & FTF_VARALIGN) && ((tree->basenamelen+1) >= 8)) 283 emit->string(etarget, tree->name, tree 810 struct node *tree; local [all...] |
/linux-master/fs/hfsplus/ |
H A D | inode.c | 65 struct hfs_btree *tree; local 73 tree = HFSPLUS_SB(sb)->ext_tree; 76 tree = HFSPLUS_SB(sb)->cat_tree; 79 tree = HFSPLUS_SB(sb)->attr_tree; 85 if (!tree) 87 if (tree->node_size >= PAGE_SIZE) { 89 (tree->node_size_shift - PAGE_SHIFT); 90 spin_lock(&tree->hash_lock); 91 node = hfs_bnode_findhash(tree, nidx); 100 spin_unlock(&tree [all...] |
H A D | extents.c | 104 res = hfs_bmap_reserve(fd->tree, fd->tree->depth + 1); 345 /* Mapping the allocation file may lock the extent tree */ 429 mutex_unlock(&fd.tree->tree_lock); 433 mutex_lock(&fd.tree->tree_lock); 590 mutex_unlock(&fd.tree->tree_lock); 595 mutex_lock(&fd.tree->tree_lock); 605 mutex_unlock(&fd.tree->tree_lock); 609 mutex_lock(&fd.tree->tree_lock);
|
H A D | attributes.c | 7 * Handling of records in attributes tree 221 err = hfs_bmap_reserve(fd.tree, fd.tree->depth + 1); 326 err = hfs_bmap_reserve(fd.tree, fd.tree->depth);
|
/linux-master/fs/btrfs/tests/ |
H A D | extent-io-tests.c | 91 static void dump_extent_io_tree(const struct extent_io_tree *tree) argument 96 node = rb_first(&tree->state); 97 test_msg("io tree content:"); 542 * Test again for case where the tree block is sectorsize aligned but 562 struct extent_io_tree tree; local 568 extent_io_tree_init(NULL, &tree, IO_TREE_SELFTEST); 570 /* Test correct handling of empty tree */ 571 find_first_clear_extent_bit(&tree, 0, &start, &end, CHUNK_TRIMMED); 574 "error getting a range from completely empty tree: start %llu end %llu", 582 set_extent_bit(&tree, SZ_1 [all...] |
/linux-master/tools/perf/util/ |
H A D | srcline.c | 917 void srcline__tree_insert(struct rb_root_cached *tree, u64 addr, char *srcline) argument 919 struct rb_node **p = &tree->rb_root.rb_node; 944 rb_insert_color_cached(&node->rb_node, tree, leftmost); 947 char *srcline__tree_find(struct rb_root_cached *tree, u64 addr) argument 949 struct rb_node *n = tree->rb_root.rb_node; 966 void srcline__tree_delete(struct rb_root_cached *tree) argument 969 struct rb_node *next = rb_first_cached(tree); 974 rb_erase_cached(&pos->rb_node, tree); 1008 void inlines__tree_insert(struct rb_root_cached *tree, argument 1011 struct rb_node **p = &tree 1031 inlines__tree_find(struct rb_root_cached *tree, u64 addr) argument 1050 inlines__tree_delete(struct rb_root_cached *tree) argument [all...] |
/linux-master/drivers/infiniband/sw/rxe/ |
H A D | rxe_mcast.c | 13 * a red-black tree using the mgid. This data structure is searched 57 * __rxe_insert_mcg - insert an mcg into red-black tree (rxe->mcg_tree) 58 * @mcg: mcg object with an embedded red-black tree node 61 * is responsible to avoid adding the same mcg twice to the tree. 65 struct rb_root *tree = &mcg->rxe->mcg_tree; local 66 struct rb_node **link = &tree->rb_node; 83 rb_insert_color(&mcg->node, tree); 87 * __rxe_remove_mcg - remove an mcg from red-black tree holding lock 88 * @mcg: mcast group object with an embedded red-black tree node 108 struct rb_root *tree local [all...] |
/linux-master/fs/hfs/ |
H A D | inode.c | 71 struct hfs_btree *tree; local 79 tree = HFS_SB(sb)->ext_tree; 82 tree = HFS_SB(sb)->cat_tree; 89 if (!tree) 92 if (tree->node_size >= PAGE_SIZE) { 93 nidx = folio->index >> (tree->node_size_shift - PAGE_SHIFT); 94 spin_lock(&tree->hash_lock); 95 node = hfs_bnode_findhash(tree, nidx); 104 spin_unlock(&tree->hash_lock); 106 nidx = folio->index << (PAGE_SHIFT - tree [all...] |
H A D | btree.h | 16 /* B-tree mutex nested subclasses */ 54 struct hfs_btree *tree; member in struct:hfs_bnode 80 struct hfs_btree *tree; member in struct:hfs_find_data 143 #define HFS_NODE_HEADER 0x01 /* The tree header node (node 0) */ 148 __be16 depth; /* (V) The number of levels in this B-tree */ 165 #define BTREE_ATTR_BADCLOSE 0x00000001 /* b-tree not closed properly. not 171 b-tree but not in extents 172 b-tree (hfsplus). */
|
/linux-master/net/core/ |
H A D | dev_addr_lists.c | 24 struct rb_node **ins_point = &list->tree.rb_node, *parent = NULL; 45 rb_insert_color(&new->node, &list->tree); 78 struct rb_node **ins_point = &list->tree.rb_node, *parent = NULL; 123 rb_insert_color(&ha->node, &list->tree); 158 rb_erase(&ha->node, &list->tree); 172 node = list->tree.rb_node; 487 list->tree = RB_ROOT; 499 list->tree = RB_ROOT; 580 rb_erase(&ha->node, &dev->dev_addrs.tree);
|
/linux-master/scripts/ |
H A D | spdxcheck.py | 53 lictree = repo.head.commit.tree['LICENSES'] 292 def scan_git_tree(tree, basedir, dirdepth): 294 for el in tree.traverse(): 303 def scan_git_subtree(tree, path, dirdepth): 305 tree = tree[p] 306 scan_git_tree(tree, path.strip('/'), dirdepth) 325 ap.add_argument('path', nargs='*', help='Check path or file. If not given full git tree scan. For stdin use "-"') 386 scan_git_subtree(repo.head.reference.commit.tree, p, 392 # Full git tree sca [all...] |
/linux-master/net/netfilter/ |
H A D | nf_conncount.c | 286 /* caller must hold tree nf_conncount_locks[] lock */ 304 static void schedule_gc_worker(struct nf_conncount_data *data, int tree) argument 306 set_bit(tree, data->pending_trees); 461 unsigned int tree, next_tree, gc_count = 0; local 463 tree = data->gc_tree % CONNCOUNT_SLOTS; 464 root = &data->root[tree]; 478 spin_lock_bh(&nf_conncount_locks[tree]); 500 clear_bit(tree, data->pending_trees); 502 next_tree = (tree + 1) % CONNCOUNT_SLOTS; 510 spin_unlock_bh(&nf_conncount_locks[tree]); [all...] |
/linux-master/drivers/gpu/drm/nouveau/nvkm/core/ |
H A D | object.c | 202 list_for_each_entry_reverse(child, &object->tree, head) { 229 list_for_each_entry_continue_reverse(child, &object->tree, head) { 251 list_for_each_entry(child, &object->tree, head) { 262 list_for_each_entry_continue_reverse(child, &object->tree, head) 280 list_for_each_entry_safe(child, ctemp, &object->tree, head) { 320 INIT_LIST_HEAD(&object->tree);
|
/linux-master/drivers/net/ethernet/mellanox/mlx4/ |
H A D | cq.c | 11 * COPYING in the main directory of this source tree, or the 109 cq = radix_tree_lookup(&mlx4_priv(dev)->cq_table.tree, 132 cq = radix_tree_lookup(&cq_table->tree, cqn & (dev->caps.num_cqs - 1)); 365 err = radix_tree_insert(&cq_table->tree, cq->cqn, cq); 426 radix_tree_delete(&cq_table->tree, cq->cqn); 447 radix_tree_delete(&cq_table->tree, cq->cqn); 468 INIT_RADIX_TREE(&cq_table->tree, GFP_ATOMIC);
|
/linux-master/fs/ocfs2/ |
H A D | refcounttree.h | 28 struct ocfs2_refcount_tree **tree, 31 struct ocfs2_refcount_tree *tree, 53 * Some refcount caller need to do more work after we modify the data b-tree
|
/linux-master/fs/xfs/scrub/ |
H A D | dqiterate.c | 149 struct radix_tree_root *tree = xfs_dquot_tree(qi, cursor->dqtype); local 156 nr_found = radix_tree_gang_lookup(tree, (void **)&dq, cursor->id, 1);
|
/linux-master/drivers/sh/intc/ |
H A D | internals.h | 8 #include <linux/radix-tree.h> 57 struct radix_tree_root tree; member in struct:intc_desc_int
|