/linux-master/lib/ |
H A D | radix-tree.c | 45 * of RADIX_TREE_MAX_PATH size to be created, with only the root node shared. 95 static inline gfp_t root_gfp_mask(const struct radix_tree_root *root) argument 97 return root->xa_flags & (__GFP_BITS_MASK & ~GFP_ZONEMASK); 118 static inline void root_tag_set(struct radix_tree_root *root, unsigned tag) argument 120 root->xa_flags |= (__force gfp_t)(1 << (tag + ROOT_TAG_SHIFT)); 123 static inline void root_tag_clear(struct radix_tree_root *root, unsigned tag) argument 125 root->xa_flags &= (__force gfp_t)~(1 << (tag + ROOT_TAG_SHIFT)); 128 static inline void root_tag_clear_all(struct radix_tree_root *root) argument 130 root->xa_flags &= (__force gfp_t)((1 << ROOT_TAG_SHIFT) - 1); 133 static inline int root_tag_get(const struct radix_tree_root *root, unsigne argument 138 root_tags_get(const struct radix_tree_root *root) argument 143 is_idr(const struct radix_tree_root *root) argument 233 radix_tree_node_alloc(gfp_t gfp_mask, struct radix_tree_node *parent, struct radix_tree_root *root, unsigned int shift, unsigned int offset, unsigned int count, unsigned int nr_values) argument 388 radix_tree_load_root(const struct radix_tree_root *root, struct radix_tree_node **nodep, unsigned long *maxindex) argument 408 radix_tree_extend(struct radix_tree_root *root, gfp_t gfp, unsigned long index, unsigned int shift) argument 468 radix_tree_shrink(struct radix_tree_root *root) argument 543 delete_node(struct radix_tree_root *root, struct radix_tree_node *node) argument 598 __radix_tree_create(struct radix_tree_root *root, unsigned long index, struct radix_tree_node **nodep, void __rcu ***slotp) argument 703 radix_tree_insert(struct radix_tree_root *root, unsigned long index, void *item) argument 747 __radix_tree_lookup(const struct radix_tree_root *root, unsigned long index, struct radix_tree_node **nodep, void __rcu ***slotp) argument 794 radix_tree_lookup_slot(const struct radix_tree_root *root, unsigned long index) argument 817 radix_tree_lookup(const struct radix_tree_root *root, unsigned long index) argument 834 node_tag_get(const struct radix_tree_root *root, const struct radix_tree_node *node, unsigned int tag, unsigned int offset) argument 850 calculate_count(struct radix_tree_root *root, struct radix_tree_node *node, void __rcu **slot, void *item, void *old) argument 875 __radix_tree_replace(struct radix_tree_root *root, struct radix_tree_node *node, void __rcu **slot, void *item) argument 914 radix_tree_replace_slot(struct radix_tree_root *root, void __rcu **slot, void *item) argument 931 radix_tree_iter_replace(struct radix_tree_root *root, const struct radix_tree_iter *iter, void __rcu **slot, void *item) argument 938 node_tag_set(struct radix_tree_root *root, struct radix_tree_node *node, unsigned int tag, unsigned int offset) argument 967 radix_tree_tag_set(struct radix_tree_root *root, unsigned long index, unsigned int tag) argument 995 node_tag_clear(struct radix_tree_root *root, struct radix_tree_node *node, unsigned int tag, unsigned int offset) argument 1029 radix_tree_tag_clear(struct radix_tree_root *root, unsigned long index, unsigned int tag) argument 1060 radix_tree_iter_tag_clear(struct radix_tree_root *root, const struct radix_tree_iter *iter, unsigned int tag) argument 1081 radix_tree_tag_get(const struct radix_tree_root *root, unsigned long index, unsigned int tag) argument 1154 radix_tree_next_chunk(const struct radix_tree_root *root, struct radix_tree_iter *iter, unsigned flags) argument 1262 radix_tree_gang_lookup(const struct radix_tree_root *root, void **results, unsigned long first_index, unsigned int max_items) argument 1302 radix_tree_gang_lookup_tag(const struct radix_tree_root *root, void **results, unsigned long first_index, unsigned int max_items, unsigned int tag) argument 1343 radix_tree_gang_lookup_tag_slot(const struct radix_tree_root *root, void __rcu ***results, unsigned long first_index, unsigned int max_items, unsigned int tag) argument 1364 __radix_tree_delete(struct radix_tree_root *root, struct radix_tree_node *node, void __rcu **slot) argument 1394 radix_tree_iter_delete(struct radix_tree_root *root, struct radix_tree_iter *iter, void __rcu **slot) argument 1413 radix_tree_delete_item(struct radix_tree_root *root, unsigned long index, void *item) argument 1445 radix_tree_delete(struct radix_tree_root *root, unsigned long index) argument 1456 radix_tree_tagged(const struct radix_tree_root *root, unsigned int tag) argument 1476 idr_get_free(struct radix_tree_root *root, struct radix_tree_iter *iter, gfp_t gfp, unsigned long max) argument [all...] |
H A D | rbtree_test.c | 27 static struct rb_root_cached root = RB_ROOT_CACHED; variable in typeref:struct:rb_root_cached 32 static void insert(struct test_node *node, struct rb_root_cached *root) argument 34 struct rb_node **new = &root->rb_root.rb_node, *parent = NULL; 46 rb_insert_color(&node->rb, &root->rb_root); 49 static void insert_cached(struct test_node *node, struct rb_root_cached *root) argument 51 struct rb_node **new = &root->rb_root.rb_node, *parent = NULL; 66 rb_insert_color_cached(&node->rb, root, leftmost); 69 static inline void erase(struct test_node *node, struct rb_root_cached *root) argument 71 rb_erase(&node->rb, &root->rb_root); 74 static inline void erase_cached(struct test_node *node, struct rb_root_cached *root) argument 85 insert_augmented(struct test_node *node, struct rb_root_cached *root) argument 109 insert_augmented_cached(struct test_node *node, struct rb_root_cached *root) argument 138 erase_augmented(struct test_node *node, struct rb_root_cached *root) argument 143 erase_augmented_cached(struct test_node *node, struct rb_root_cached *root) argument [all...] |
/linux-master/drivers/md/persistent-data/ |
H A D | dm-btree.h | 95 int dm_btree_empty(struct dm_btree_info *info, dm_block_t *root); 101 int dm_btree_del(struct dm_btree_info *info, dm_block_t root); 110 int dm_btree_lookup(struct dm_btree_info *info, dm_block_t root, 117 int dm_btree_lookup_next(struct dm_btree_info *info, dm_block_t root, 123 int dm_btree_insert(struct dm_btree_info *info, dm_block_t root, 132 int dm_btree_insert_notify(struct dm_btree_info *info, dm_block_t root, 142 int dm_btree_remove(struct dm_btree_info *info, dm_block_t root, 151 int dm_btree_remove_leaves(struct dm_btree_info *info, dm_block_t root, 160 int dm_btree_find_lowest_key(struct dm_btree_info *info, dm_block_t root, 168 int dm_btree_find_highest_key(struct dm_btree_info *info, dm_block_t root, 197 dm_block_t root; member in struct:dm_btree_cursor [all...] |
H A D | dm-bitset.h | 34 * b) Get yourself a root. The root is the index of a block of data on the 36 * pre existing root in your metadata that you wish to use, or you may 41 * root for a _new_ array. If you've incremented the old root, via 43 * it in parallel with the new root. 46 * return a root for a new, updated bitset. 92 * new_root - on success, points to the new root block 103 * root - the root bloc [all...] |
H A D | dm-space-map-disk.h | 24 void *root, size_t len);
|
/linux-master/fs/btrfs/ |
H A D | ctree.h | 51 * btrfs_paths remember the path taken from the root down to the leaf. 88 * The state of btrfs root 94 * first time the root is added to each transaction. So IN_TRANS_SETUP 100 * Set if tree blocks of this root can be shared by other roots. 135 /* Mark dead root stored on device whose cleanup needs to be resumed */ 137 /* The root has a log tree. Used for subvolume roots and the tree root. */ 141 /* We started the orphan cleanup for this root. */ 143 /* This root has a drop operation that was started previously. */ 145 /* This reloc root need 320 btrfs_root_readonly(const struct btrfs_root *root) argument 326 btrfs_root_dead(const struct btrfs_root *root) argument 332 btrfs_root_id(const struct btrfs_root *root) argument 337 btrfs_get_root_log_transid(const struct btrfs_root *root) argument 342 btrfs_set_root_log_transid(struct btrfs_root *root, int log_transid) argument 347 btrfs_get_root_last_log_commit(const struct btrfs_root *root) argument 352 btrfs_set_root_last_log_commit(struct btrfs_root *root, int commit_id) argument 592 btrfs_del_item(struct btrfs_trans_handle *trans, struct btrfs_root *root, struct btrfs_path *path) argument 637 btrfs_insert_empty_item(struct btrfs_trans_handle *trans, struct btrfs_root *root, struct btrfs_path *path, const struct btrfs_key *key, u32 data_size) argument 696 btrfs_next_leaf(struct btrfs_root *root, struct btrfs_path *path) argument 701 btrfs_next_item(struct btrfs_root *root, struct btrfs_path *p) argument 716 btrfs_is_data_reloc_root(const struct btrfs_root *root) argument [all...] |
H A D | dir-item.h | 16 int btrfs_check_dir_item_collision(struct btrfs_root *root, u64 dir, 22 struct btrfs_root *root, 27 struct btrfs_root *root, 30 struct btrfs_dir_item *btrfs_search_dir_index_item(struct btrfs_root *root, 34 struct btrfs_root *root, 38 struct btrfs_root *root, 43 struct btrfs_root *root,
|
H A D | relocation.h | 16 int btrfs_init_reloc_root(struct btrfs_trans_handle *trans, struct btrfs_root *root); 18 struct btrfs_root *root); 22 struct btrfs_root *root, 31 bool btrfs_should_ignore_reloc_root(const struct btrfs_root *root);
|
/linux-master/drivers/mtd/parsers/ |
H A D | ofpart_bcm4908.c | 19 struct device_node *root; local 23 root = of_find_node_by_path("/"); 24 if (!root) 27 of_property_for_each_string(root, "brcm_blparms", prop, s) { 38 of_node_put(root); 42 of_node_put(root); 46 of_node_put(root);
|
/linux-master/tools/testing/radix-tree/ |
H A D | test.c | 12 item_tag_set(struct radix_tree_root *root, unsigned long index, int tag) argument 14 return radix_tree_tag_set(root, index, tag); 18 item_tag_clear(struct radix_tree_root *root, unsigned long index, int tag) argument 20 return radix_tree_tag_clear(root, index, tag); 23 int item_tag_get(struct radix_tree_root *root, unsigned long index, int tag) argument 25 return radix_tree_tag_get(root, index, tag); 37 int item_insert(struct radix_tree_root *root, unsigned long index) argument 40 int err = radix_tree_insert(root, item->index, item); 61 int item_delete(struct radix_tree_root *root, unsigned long index) argument 63 struct item *item = radix_tree_delete(root, inde 91 item_check_present(struct radix_tree_root *root, unsigned long index) argument 100 item_lookup(struct radix_tree_root *root, unsigned long index) argument 105 item_check_absent(struct radix_tree_root *root, unsigned long index) argument 116 item_gang_check_present(struct radix_tree_root *root, unsigned long start, unsigned long nr, int chunk, int hop) argument 143 item_full_scan(struct radix_tree_root *root, unsigned long start, unsigned long nr, int chunk) argument 247 verify_tag_consistency(struct radix_tree_root *root, unsigned int tag) argument 270 tree_verify_min_height(struct radix_tree_root *root, int maxindex) argument [all...] |
/linux-master/fs/btrfs/tests/ |
H A D | qgroup-tests.c | 16 static int insert_normal_tree_ref(struct btrfs_root *root, u64 bytenr, argument 41 ret = btrfs_insert_empty_item(&trans, root, path, &ins, size); 68 static int add_tree_ref(struct btrfs_root *root, u64 bytenr, u64 num_bytes, argument 90 ret = btrfs_search_slot(&trans, root, &key, path, 0, 1); 112 ret = btrfs_insert_empty_item(&trans, root, path, &key, 0); 119 static int remove_extent_item(struct btrfs_root *root, u64 bytenr, argument 139 ret = btrfs_search_slot(&trans, root, &key, path, -1, 1); 145 btrfs_del_item(&trans, root, path); 150 static int remove_extent_ref(struct btrfs_root *root, u64 bytenr, argument 172 ret = btrfs_search_slot(&trans, root, 205 test_no_shared_qgroup(struct btrfs_root *root, u32 sectorsize, u32 nodesize) argument 317 test_multiple_refs(struct btrfs_root *root, u32 sectorsize, u32 nodesize) argument 474 struct btrfs_root *root; local [all...] |
/linux-master/drivers/gpu/drm/i915/gt/ |
H A D | intel_sseu_debugfs.h | 15 void intel_sseu_debugfs_register(struct intel_gt *gt, struct dentry *root);
|
/linux-master/scripts/gdb/linux/ |
H A D | rbtree.py | 13 def rb_first(root): 14 if root.type == rb_root_type.get_type(): 15 node = root.address.cast(rb_root_type.get_type().pointer()) 16 elif root.type != rb_root_type.get_type().pointer(): 17 raise gdb.GdbError("Must be struct rb_root not {}".format(root.type)) 19 node = root['rb_node'] 29 def rb_last(root): 30 if root.type == rb_root_type.get_type(): 31 node = root.address.cast(rb_root_type.get_type().pointer()) 32 elif root [all...] |
H A D | radixtree.py | 33 def lookup(root, index): 34 if root.type == radix_tree_root_type.get_type().pointer(): 35 node = root.dereference() 36 elif root.type != radix_tree_root_type.get_type(): 38 .format(radix_tree_root_type.get_type(), root.type)) 40 node = root['xa_head'] 78 If index is omitted, the root node is dereference and returned.""" 83 def invoke(self, root, index=0): 84 result = lookup(root, index)
|
/linux-master/fs/nfs/ |
H A D | getroot.c | 2 /* getroot.c: get the root dentry for an NFS mount 36 * Set the superblock root dentry. 41 /* The mntroot acts as the dummy root dentry for this superblock */ 65 * get an NFS2/NFS3 root dentry from the root filehandle 72 struct dentry *root; local 82 /* get the actual root for this mount */ 90 nfs_errorf(fc, "NFS: Couldn't getattr on root"); 96 dprintk("nfs_get_root: get root inode failed\n"); 98 nfs_errorf(fc, "NFS: Couldn't get root inod [all...] |
/linux-master/arch/parisc/ |
H A D | defpalo.conf | 10 # You need at least one 'root='! 12 # If you want a root ramdisk, use the next 2 lines 15 --commandline=0/vmlinuz HOME=/ root=/dev/ram initrd=0/ramdisk panic_timeout=60 panic=-1 17 # If you want NFS root, use the following command line (Edit the HOSTNAME!!!) 18 #--commandline=0/vmlinuz HOME=/ root=/dev/nfs nfsroot=HOSTNAME ip=bootp 20 # If you have root on a disk partition, use this (Edit the partition name!!!) 21 #--commandline=0/vmlinuz HOME=/ root=/dev/sda1
|
/linux-master/tools/testing/selftests/net/forwarding/ |
H A D | sch_ets.sh | 25 tc qdisc add dev $swp2 root handle 1: tbf \ 33 tc qdisc del dev $swp2 root
|
/linux-master/sound/firewire/motu/ |
H A D | motu-proc.c | 81 static void add_node(struct snd_motu *motu, struct snd_info_entry *root, argument 88 entry = snd_info_create_card_entry(motu->card, name, root); 95 struct snd_info_entry *root; local 101 root = snd_info_create_card_entry(motu->card, "firewire", 103 if (root == NULL) 105 root->mode = S_IFDIR | 0555; 107 add_node(motu, root, "clock", proc_read_clock); 108 add_node(motu, root, "format", proc_read_format);
|
/linux-master/drivers/gpu/drm/i915/gt/uc/ |
H A D | intel_huc_debugfs.c | 26 void intel_huc_debugfs_register(struct intel_huc *huc, struct dentry *root) argument 35 intel_gt_debugfs_register_files(root, files, ARRAY_SIZE(files), huc);
|
H A D | intel_gsc_uc_debugfs.c | 29 void intel_gsc_uc_debugfs_register(struct intel_gsc_uc *gsc_uc, struct dentry *root) argument 38 intel_gt_debugfs_register_files(root, files, ARRAY_SIZE(files), gsc_uc);
|
/linux-master/drivers/gpu/drm/msm/dp/ |
H A D | dp_debug.h | 37 * @root: connector's debugfs root 47 struct dentry *root, 56 struct dentry *root, 53 dp_debug_get(struct device *dev, struct dp_panel *panel, struct dp_link *link, struct drm_connector *connector, struct dentry *root, bool is_edp) argument
|
/linux-master/include/trace/events/ |
H A D | cgroup.h | 13 TP_PROTO(struct cgroup_root *root), 15 TP_ARGS(root), 18 __field( int, root ) 20 __string( name, root->name ) 24 __entry->root = root->hierarchy_id; 25 __entry->ss_mask = root->subsys_mask; 26 __assign_str(name, root->name); 29 TP_printk("root=%d ss_mask=%#x name=%s", 30 __entry->root, __entr [all...] |
/linux-master/arch/powerpc/platforms/52xx/ |
H A D | efika.c | 74 struct device_node *root; local 77 root = of_find_node_by_path("/"); 78 if (root == NULL) { 80 ": Unable to find the root node\n"); 84 for_each_child_of_node(root, pcictrl) 88 of_node_put(root); 143 struct device_node *root; local 148 root = of_find_node_by_path("/"); 149 if (!root) 152 revision = of_get_property(root, "revisio 198 struct device_node *root = of_find_node_by_path("/"); local [all...] |
/linux-master/drivers/eisa/ |
H A D | eisa-bus.c | 43 struct eisa_root_device *root, 49 x = (root->bus_nr << 8) | edev->slot; 182 static int __init eisa_init_device(struct eisa_root_device *root, argument 190 sig_addr = SLOT_ADDRESS(root, slot) + EISA_VENDOR_ID_OFFSET; 198 edev->state = inb(SLOT_ADDRESS(root, slot) + EISA_CONFIG_OFFSET) 200 edev->base_addr = SLOT_ADDRESS(root, slot); 201 edev->dma_mask = root->dma_mask; /* Default DMA mask */ 203 edev->dev.parent = root->dev; 207 dev_set_name(&edev->dev, "%02X:%02X", root->bus_nr, slot); 217 if (is_forced_dev(enable_dev, enable_dev_count, root, ede 41 is_forced_dev(int *forced_tab, int forced_count, struct eisa_root_device *root, struct eisa_device *edev) argument 255 eisa_request_resources(struct eisa_root_device *root, struct eisa_device *edev, int slot) argument 309 eisa_probe(struct eisa_root_device *root) argument 409 eisa_root_register(struct eisa_root_device *root) argument [all...] |
/linux-master/tools/testing/selftests/cgroup/ |
H A D | test_core.c | 78 static int test_cgcore_destroy(const char *root) argument 85 cg_test = cg_name(root, "cg_test"); 135 * test that after the one process in C is moved to root, 140 static int test_cgcore_populated(const char *root) argument 149 cg_test_a = cg_name(root, "cg_test_a"); 150 cg_test_b = cg_name(root, "cg_test_a/cg_test_b"); 151 cg_test_c = cg_name(root, "cg_test_a/cg_test_b/cg_test_c"); 152 cg_test_d = cg_name(root, "cg_test_a/cg_test_b/cg_test_d"); 184 if (cg_enter_current(root)) 273 static int test_cgcore_invalid_domain(const char *root) argument 335 test_cgcore_parent_becomes_threaded(const char *root) argument 374 test_cgcore_no_internal_process_constraint_on_threads(const char *root) argument 426 test_cgcore_top_down_constraint_enable(const char *root) argument 461 test_cgcore_top_down_constraint_disable(const char *root) argument 502 test_cgcore_internal_process_constraint(const char *root) argument 548 test_cgcore_proc_migration(const char *root) argument 621 test_cgcore_thread_migration(const char *root) argument 684 test_cgcore_lesser_euid_open(const char *root) argument 766 test_cgcore_lesser_ns_open(const char *root) argument 862 char root[PATH_MAX]; local [all...] |