Home
last modified time | relevance | path

Searched refs:tree (Results 1 – 200 of 889) sorted by relevance

12345

/linux-4.1.27/fs/hfs/
Dbtree.c20 struct hfs_btree *tree; in hfs_btree_open() local
26 tree = kzalloc(sizeof(*tree), GFP_KERNEL); in hfs_btree_open()
27 if (!tree) in hfs_btree_open()
30 mutex_init(&tree->tree_lock); in hfs_btree_open()
31 spin_lock_init(&tree->hash_lock); in hfs_btree_open()
33 tree->sb = sb; in hfs_btree_open()
34 tree->cnid = id; in hfs_btree_open()
35 tree->keycmp = keycmp; in hfs_btree_open()
37 tree->inode = iget_locked(sb, id); in hfs_btree_open()
38 if (!tree->inode) in hfs_btree_open()
[all …]
Dbrec.c15 static int hfs_btree_inc_height(struct hfs_btree *tree);
23 dataoff = node->tree->node_size - (rec + 2) * 2; in hfs_brec_lenoff()
38 !(node->tree->attributes & HFS_TREE_VARIDXKEYS)) { in hfs_brec_keylen()
39 if (node->tree->attributes & HFS_TREE_BIGKEYS) in hfs_brec_keylen()
40 retval = node->tree->max_key_len + 2; in hfs_brec_keylen()
42 retval = node->tree->max_key_len + 1; in hfs_brec_keylen()
44 recoff = hfs_bnode_read_u16(node, node->tree->node_size - (rec + 1) * 2); in hfs_brec_keylen()
47 if (node->tree->attributes & HFS_TREE_BIGKEYS) { in hfs_brec_keylen()
49 if (retval > node->tree->max_key_len + 2) { in hfs_brec_keylen()
55 if (retval > node->tree->max_key_len + 1) { in hfs_brec_keylen()
[all …]
Dbnode.c47 struct hfs_btree *tree; in hfs_bnode_read_key() local
50 tree = node->tree; in hfs_bnode_read_key()
52 tree->attributes & HFS_TREE_VARIDXKEYS) in hfs_bnode_read_key()
55 key_len = tree->max_key_len + 1; in hfs_bnode_read_key()
100 struct hfs_btree *tree; in hfs_bnode_copy() local
106 tree = src_node->tree; in hfs_bnode_copy()
147 off = node->tree->node_size - 2; in hfs_bnode_dump()
154 if (node->tree->attributes & HFS_TREE_VARIDXKEYS) in hfs_bnode_dump()
157 tmp = node->tree->max_key_len + 1; in hfs_bnode_dump()
174 struct hfs_btree *tree; in hfs_bnode_unlink() local
[all …]
Dbfind.c14 int hfs_find_init(struct hfs_btree *tree, struct hfs_find_data *fd) in hfs_find_init() argument
18 fd->tree = tree; in hfs_find_init()
20 ptr = kmalloc(tree->max_key_len * 2 + 4, GFP_KERNEL); in hfs_find_init()
24 fd->key = ptr + tree->max_key_len + 2; in hfs_find_init()
26 tree->cnid, __builtin_return_address(0)); in hfs_find_init()
27 mutex_lock(&tree->tree_lock); in hfs_find_init()
36 fd->tree->cnid, __builtin_return_address(0)); in hfs_find_exit()
37 mutex_unlock(&fd->tree->tree_lock); in hfs_find_exit()
38 fd->tree = NULL; in hfs_find_exit()
62 cmpval = bnode->tree->keycmp(fd->key, fd->search_key); in __hfs_brec_find()
[all …]
Dinode.c74 struct hfs_btree *tree; in hfs_releasepage() local
81 tree = HFS_SB(sb)->ext_tree; in hfs_releasepage()
84 tree = HFS_SB(sb)->cat_tree; in hfs_releasepage()
91 if (!tree) in hfs_releasepage()
94 if (tree->node_size >= PAGE_CACHE_SIZE) { in hfs_releasepage()
95 nidx = page->index >> (tree->node_size_shift - PAGE_CACHE_SHIFT); in hfs_releasepage()
96 spin_lock(&tree->hash_lock); in hfs_releasepage()
97 node = hfs_bnode_findhash(tree, nidx); in hfs_releasepage()
106 spin_unlock(&tree->hash_lock); in hfs_releasepage()
108 nidx = page->index << (PAGE_CACHE_SHIFT - tree->node_size_shift); in hfs_releasepage()
[all …]
Dbtree.h46 struct hfs_btree *tree; member
72 struct hfs_btree *tree; member
/linux-4.1.27/fs/hfsplus/
Dbtree.c134 struct hfs_btree *tree; in hfs_btree_open() local
141 tree = kzalloc(sizeof(*tree), GFP_KERNEL); in hfs_btree_open()
142 if (!tree) in hfs_btree_open()
145 mutex_init(&tree->tree_lock); in hfs_btree_open()
146 spin_lock_init(&tree->hash_lock); in hfs_btree_open()
147 tree->sb = sb; in hfs_btree_open()
148 tree->cnid = id; in hfs_btree_open()
152 tree->inode = inode; in hfs_btree_open()
154 if (!HFSPLUS_I(tree->inode)->first_blocks) { in hfs_btree_open()
159 mapping = tree->inode->i_mapping; in hfs_btree_open()
[all …]
Dbrec.c24 dataoff = node->tree->node_size - (rec + 2) * 2; in hfs_brec_lenoff()
39 !(node->tree->attributes & HFS_TREE_VARIDXKEYS) && in hfs_brec_keylen()
40 (node->tree->cnid != HFSPLUS_ATTR_CNID)) { in hfs_brec_keylen()
41 retval = node->tree->max_key_len + 2; in hfs_brec_keylen()
44 node->tree->node_size - (rec + 1) * 2); in hfs_brec_keylen()
47 if (recoff > node->tree->node_size - 2) { in hfs_brec_keylen()
53 if (retval > node->tree->max_key_len + 2) { in hfs_brec_keylen()
64 struct hfs_btree *tree; in hfs_brec_insert() local
71 tree = fd->tree; in hfs_brec_insert()
73 if (!tree->root) in hfs_brec_insert()
[all …]
Dbnode.c60 struct hfs_btree *tree; in hfs_bnode_read_key() local
63 tree = node->tree; in hfs_bnode_read_key()
65 tree->attributes & HFS_TREE_VARIDXKEYS || in hfs_bnode_read_key()
66 node->tree->cnid == HFSPLUS_ATTR_CNID) in hfs_bnode_read_key()
69 key_len = tree->max_key_len + 2; in hfs_bnode_read_key()
129 struct hfs_btree *tree; in hfs_bnode_copy() local
136 tree = src_node->tree; in hfs_bnode_copy()
311 off = node->tree->node_size - 2; in hfs_bnode_dump()
318 if (node->tree->attributes & HFS_TREE_VARIDXKEYS || in hfs_bnode_dump()
319 node->tree->cnid == HFSPLUS_ATTR_CNID) in hfs_bnode_dump()
[all …]
Dbfind.c14 int hfs_find_init(struct hfs_btree *tree, struct hfs_find_data *fd) in hfs_find_init() argument
18 fd->tree = tree; in hfs_find_init()
20 ptr = kmalloc(tree->max_key_len * 2 + 4, GFP_KERNEL); in hfs_find_init()
24 fd->key = ptr + tree->max_key_len + 2; in hfs_find_init()
26 tree->cnid, __builtin_return_address(0)); in hfs_find_init()
27 switch (tree->cnid) { in hfs_find_init()
29 mutex_lock_nested(&tree->tree_lock, CATALOG_BTREE_MUTEX); in hfs_find_init()
32 mutex_lock_nested(&tree->tree_lock, EXTENTS_BTREE_MUTEX); in hfs_find_init()
35 mutex_lock_nested(&tree->tree_lock, ATTR_BTREE_MUTEX); in hfs_find_init()
48 fd->tree->cnid, __builtin_return_address(0)); in hfs_find_exit()
[all …]
Dinode.c69 struct hfs_btree *tree; in hfsplus_releasepage() local
76 tree = HFSPLUS_SB(sb)->ext_tree; in hfsplus_releasepage()
79 tree = HFSPLUS_SB(sb)->cat_tree; in hfsplus_releasepage()
82 tree = HFSPLUS_SB(sb)->attr_tree; in hfsplus_releasepage()
88 if (!tree) in hfsplus_releasepage()
90 if (tree->node_size >= PAGE_CACHE_SIZE) { in hfsplus_releasepage()
92 (tree->node_size_shift - PAGE_CACHE_SHIFT); in hfsplus_releasepage()
93 spin_lock(&tree->hash_lock); in hfsplus_releasepage()
94 node = hfs_bnode_findhash(tree, nidx); in hfsplus_releasepage()
103 spin_unlock(&tree->hash_lock); in hfsplus_releasepage()
[all …]
Dhfsplus_fs.h104 struct hfs_btree *tree; member
287 struct hfs_btree *tree; member
395 void hfs_btree_close(struct hfs_btree *tree);
396 int hfs_btree_write(struct hfs_btree *tree);
397 struct hfs_bnode *hfs_bmap_alloc(struct hfs_btree *tree);
413 struct hfs_bnode *hfs_bnode_findhash(struct hfs_btree *tree, u32 cnid);
415 struct hfs_bnode *hfs_bnode_find(struct hfs_btree *tree, u32 num);
417 struct hfs_bnode *hfs_bnode_create(struct hfs_btree *tree, u32 num);
420 bool hfs_bnode_need_zeroout(struct hfs_btree *tree);
429 int hfs_find_init(struct hfs_btree *tree, struct hfs_find_data *fd);
Dsuper.c102 struct hfs_btree *tree = NULL; in hfsplus_system_write_inode() local
107 tree = sbi->ext_tree; in hfsplus_system_write_inode()
111 tree = sbi->cat_tree; in hfsplus_system_write_inode()
121 tree = sbi->attr_tree; in hfsplus_system_write_inode()
132 if (tree) { in hfsplus_system_write_inode()
133 int err = hfs_btree_write(tree); in hfsplus_system_write_inode()
/linux-4.1.27/kernel/
Daudit_tree.c76 struct audit_tree *tree; in alloc_tree() local
78 tree = kmalloc(sizeof(struct audit_tree) + strlen(s) + 1, GFP_KERNEL); in alloc_tree()
79 if (tree) { in alloc_tree()
80 atomic_set(&tree->count, 1); in alloc_tree()
81 tree->goner = 0; in alloc_tree()
82 INIT_LIST_HEAD(&tree->chunks); in alloc_tree()
83 INIT_LIST_HEAD(&tree->rules); in alloc_tree()
84 INIT_LIST_HEAD(&tree->list); in alloc_tree()
85 INIT_LIST_HEAD(&tree->same_root); in alloc_tree()
86 tree->root = NULL; in alloc_tree()
[all …]
Dauditfilter.c166 krule->inode_f || krule->watch || krule->tree || in audit_to_inode()
554 if (entry->rule.tree) in audit_data_to_entry()
555 audit_put_tree(entry->rule.tree); /* that's the temporary one */ in audit_data_to_entry()
614 audit_tree_path(krule->tree)); in audit_krule_to_data()
674 if (strcmp(audit_tree_path(a->tree), in audit_compare_rule()
675 audit_tree_path(b->tree))) in audit_compare_rule()
778 new->tree = old->tree; in audit_dupe_rule()
864 struct audit_tree *tree = entry->rule.tree; in audit_add_rule() local
882 if (tree) in audit_add_rule()
883 audit_put_tree(tree); in audit_add_rule()
[all …]
/linux-4.1.27/mm/
Dzswap.c311 static void zswap_entry_put(struct zswap_tree *tree, in zswap_entry_put() argument
318 zswap_rb_erase(&tree->rbroot, entry); in zswap_entry_put()
536 struct zswap_tree *tree; in zswap_writeback_entry() local
551 tree = zswap_trees[swp_type(swpentry)]; in zswap_writeback_entry()
555 spin_lock(&tree->lock); in zswap_writeback_entry()
556 entry = zswap_entry_find_get(&tree->rbroot, offset); in zswap_writeback_entry()
559 spin_unlock(&tree->lock); in zswap_writeback_entry()
562 spin_unlock(&tree->lock); in zswap_writeback_entry()
602 spin_lock(&tree->lock); in zswap_writeback_entry()
604 zswap_entry_put(tree, entry); in zswap_writeback_entry()
[all …]
/linux-4.1.27/fs/btrfs/
Dextent_io.c85 #define btrfs_debug_check_extent_io_range(tree, start, end) \ argument
86 __btrfs_debug_check_extent_io_range(__func__, (tree), (start), (end))
88 struct extent_io_tree *tree, u64 start, u64 end) in __btrfs_debug_check_extent_io_range() argument
93 if (!tree->mapping) in __btrfs_debug_check_extent_io_range()
96 inode = tree->mapping->host; in __btrfs_debug_check_extent_io_range()
121 struct extent_io_tree *tree; member
136 tree_fs_info(struct extent_io_tree *tree) in tree_fs_info() argument
138 if (!tree->mapping) in tree_fs_info()
140 return btrfs_sb(tree->mapping->host->i_sb); in tree_fs_info()
198 void extent_io_tree_init(struct extent_io_tree *tree, in extent_io_tree_init() argument
[all …]
Dordered-data.c151 static inline struct rb_node *tree_search(struct btrfs_ordered_inode_tree *tree, in tree_search() argument
154 struct rb_root *root = &tree->tree; in tree_search()
159 if (tree->last) { in tree_search()
160 entry = rb_entry(tree->last, struct btrfs_ordered_extent, in tree_search()
163 return tree->last; in tree_search()
169 tree->last = ret; in tree_search()
189 struct btrfs_ordered_inode_tree *tree; in __btrfs_add_ordered_extent() local
193 tree = &BTRFS_I(inode)->ordered_tree; in __btrfs_add_ordered_extent()
227 spin_lock_irq(&tree->lock); in __btrfs_add_ordered_extent()
228 node = tree_insert(&tree->tree, file_offset, in __btrfs_add_ordered_extent()
[all …]
Dextent_map.c34 void extent_map_tree_init(struct extent_map_tree *tree) in extent_map_tree_init() argument
36 tree->map = RB_ROOT; in extent_map_tree_init()
37 INIT_LIST_HEAD(&tree->modified_extents); in extent_map_tree_init()
38 rwlock_init(&tree->lock); in extent_map_tree_init()
225 static void try_merge_map(struct extent_map_tree *tree, struct extent_map *em) in try_merge_map() argument
244 rb_erase(&merge->rb_node, &tree->map); in try_merge_map()
256 rb_erase(&merge->rb_node, &tree->map); in try_merge_map()
275 int unpin_extent_cache(struct extent_map_tree *tree, u64 start, u64 len, in unpin_extent_cache() argument
282 write_lock(&tree->lock); in unpin_extent_cache()
283 em = lookup_extent_mapping(tree, start, len); in unpin_extent_cache()
[all …]
Dextent_io.h183 void extent_io_tree_init(struct extent_io_tree *tree,
186 struct extent_io_tree *tree, struct page *page,
189 int lock_extent(struct extent_io_tree *tree, u64 start, u64 end);
190 int lock_extent_bits(struct extent_io_tree *tree, u64 start, u64 end,
192 int unlock_extent(struct extent_io_tree *tree, u64 start, u64 end);
193 int unlock_extent_cached(struct extent_io_tree *tree, u64 start, u64 end,
195 int try_lock_extent(struct extent_io_tree *tree, u64 start, u64 end);
196 int extent_read_full_page(struct extent_io_tree *tree, struct page *page,
198 int extent_read_full_page_nolock(struct extent_io_tree *tree, struct page *page,
203 u64 count_range_bits(struct extent_io_tree *tree,
[all …]
Dextent_map.h66 void extent_map_tree_init(struct extent_map_tree *tree);
67 struct extent_map *lookup_extent_mapping(struct extent_map_tree *tree,
69 int add_extent_mapping(struct extent_map_tree *tree,
71 int remove_extent_mapping(struct extent_map_tree *tree, struct extent_map *em);
72 void replace_extent_mapping(struct extent_map_tree *tree,
81 int unpin_extent_cache(struct extent_map_tree *tree, u64 start, u64 len, u64 gen);
82 void clear_em_logging(struct extent_map_tree *tree, struct extent_map *em);
83 struct extent_map *search_extent_mapping(struct extent_map_tree *tree,
DMakefile4 btrfs-y += super.o ctree.o extent-tree.o print-tree.o root-tree.o dir-item.o \
6 transaction.o inode.o file.o tree-defrag.o \
9 export.o tree-log.o free-space-cache.o zlib.o lzo.o \
12 uuid-tree.o props.o hash.o
Dcompression.c271 struct extent_io_tree *tree; in end_compressed_bio_write() local
290 tree = &BTRFS_I(inode)->io_tree; in end_compressed_bio_write()
292 tree->ops->writepage_end_io_hook(cb->compressed_pages[0], in end_compressed_bio_write()
458 struct extent_io_tree *tree; in add_ra_bio_pages() local
465 tree = &BTRFS_I(inode)->io_tree; in add_ra_bio_pages()
506 lock_extent(tree, last_offset, end); in add_ra_bio_pages()
516 unlock_extent(tree, last_offset, end); in add_ra_bio_pages()
544 unlock_extent(tree, last_offset, end); in add_ra_bio_pages()
570 struct extent_io_tree *tree; in btrfs_submit_compressed_read() local
589 tree = &BTRFS_I(inode)->io_tree; in btrfs_submit_compressed_read()
[all …]
Dordered-data.h25 struct rb_root tree; member
160 t->tree = RB_ROOT; in btrfs_ordered_inode_tree_init()
/linux-4.1.27/scripts/dtc/
Dfstree.c31 struct node *tree; in read_fstree() local
37 tree = build_node(NULL, NULL); in read_fstree()
64 add_property(tree, prop); in read_fstree()
72 add_child(tree, newchild); in read_fstree()
79 return tree; in read_fstree()
84 struct node *tree; in dt_from_fs() local
86 tree = read_fstree(dirname); in dt_from_fs()
87 tree = name_node(tree, ""); in dt_from_fs()
89 return build_boot_info(NULL, tree, guess_boot_cpuid(tree)); in dt_from_fs()
Dlivetree.c339 struct node *tree, uint32_t boot_cpuid_phys) in build_boot_info() argument
345 bi->dt = tree; in build_boot_info()
380 struct property *get_property_by_label(struct node *tree, const char *label, in get_property_by_label() argument
386 *node = tree; in get_property_by_label()
388 for_each_property(tree, prop) { in get_property_by_label()
396 for_each_child(tree, c) { in get_property_by_label()
406 struct marker *get_marker_label(struct node *tree, const char *label, in get_marker_label() argument
413 *node = tree; in get_marker_label()
415 for_each_property(tree, p) { in get_marker_label()
423 for_each_child(tree, c) { in get_marker_label()
[all …]
Ddtc.c33 static void fill_fullpaths(struct node *tree, const char *prefix) in fill_fullpaths() argument
38 tree->fullpath = join_path(prefix, tree->name); in fill_fullpaths()
40 unit = strchr(tree->name, '@'); in fill_fullpaths()
42 tree->basenamelen = unit - tree->name; in fill_fullpaths()
44 tree->basenamelen = strlen(tree->name); in fill_fullpaths()
46 for_each_child(tree, child) in fill_fullpaths()
47 fill_fullpaths(child, tree->fullpath); in fill_fullpaths()
Ddtc.h208 struct property *get_property_by_label(struct node *tree, const char *label,
210 struct marker *get_marker_label(struct node *tree, const char *label,
213 struct node *get_node_by_path(struct node *tree, const char *path);
214 struct node *get_node_by_label(struct node *tree, const char *label);
215 struct node *get_node_by_phandle(struct node *tree, cell_t phandle);
216 struct node *get_node_by_ref(struct node *tree, const char *ref);
219 uint32_t guess_boot_cpuid(struct node *tree);
245 struct node *tree, uint32_t boot_cpuid_phys);
Dtreesource.c236 static void write_tree_source_node(FILE *f, struct node *tree, int level) in write_tree_source_node() argument
243 for_each_label(tree->labels, l) in write_tree_source_node()
245 if (tree->name && (*tree->name)) in write_tree_source_node()
246 fprintf(f, "%s {\n", tree->name); in write_tree_source_node()
250 for_each_property(tree, prop) { in write_tree_source_node()
257 for_each_child(tree, child) { in write_tree_source_node()
Dflattree.c258 static void flatten_tree(struct node *tree, struct emitter *emit, in flatten_tree() argument
266 if (tree->deleted) in flatten_tree()
269 emit->beginnode(etarget, tree->labels); in flatten_tree()
272 emit->string(etarget, tree->fullpath, 0); in flatten_tree()
274 emit->string(etarget, tree->name, 0); in flatten_tree()
278 for_each_property(tree, prop) { in flatten_tree()
299 emit->cell(etarget, tree->basenamelen+1); in flatten_tree()
302 if ((vi->flags & FTF_VARALIGN) && ((tree->basenamelen+1) >= 8)) in flatten_tree()
305 emit->string(etarget, tree->name, tree->basenamelen); in flatten_tree()
309 for_each_child(tree, child) { in flatten_tree()
[all …]
/linux-4.1.27/scripts/tracing/
Ddraw_functrace.py59 tree = self
60 while tree != CallTree.ROOT and tree._func != func:
61 tree = tree._parent
62 if tree == CallTree.ROOT:
65 return tree
114 tree = CallTree.ROOT
123 tree = tree.getParent(caller)
124 tree = tree.calls(callee, calltime)
/linux-4.1.27/net/sched/
Dematch.c166 static inline struct tcf_ematch *tcf_em_get_match(struct tcf_ematch_tree *tree, in tcf_em_get_match() argument
169 return &tree->matches[index]; in tcf_em_get_match()
305 struct tcf_ematch_tree *tree) in tcf_em_tree_validate() argument
313 memset(tree, 0, sizeof(*tree)); in tcf_em_tree_validate()
329 memcpy(&tree->hdr, tree_hdr, sizeof(*tree_hdr)); in tcf_em_tree_validate()
335 tree->matches = kzalloc(matches_len, GFP_KERNEL); in tcf_em_tree_validate()
336 if (tree->matches == NULL) in tcf_em_tree_validate()
360 em = tcf_em_get_match(tree, idx); in tcf_em_tree_validate()
384 tcf_em_tree_destroy(tree); in tcf_em_tree_validate()
399 void tcf_em_tree_destroy(struct tcf_ematch_tree *tree) in tcf_em_tree_destroy() argument
[all …]
/linux-4.1.27/lib/zlib_deflate/
Ddeftree.c137 static void pqdownheap (deflate_state *s, ct_data *tree, int k);
139 static void gen_codes (ct_data *tree, int max_code, ush *bl_count);
141 static void scan_tree (deflate_state *s, ct_data *tree, int max_code);
142 static void send_tree (deflate_state *s, ct_data *tree, int max_code);
156 # define send_code(s, c, tree) send_bits(s, tree[c].Code, tree[c].Len) argument
160 # define send_code(s, c, tree) \ argument
162 send_bits(s, tree[c].Code, tree[c].Len); }
350 #define pqremove(s, tree, top) \ argument
354 pqdownheap(s, tree, SMALLEST); \
361 #define smaller(tree, n, m, depth) \ argument
[all …]
/linux-4.1.27/sound/hda/
Dhdac_sysfs.c313 struct hdac_widget_tree *tree = codec->widgets; in widget_tree_free() local
316 if (!tree) in widget_tree_free()
318 free_widget_node(tree->afg, &widget_afg_group); in widget_tree_free()
319 if (tree->nodes) { in widget_tree_free()
320 for (p = tree->nodes; *p; p++) in widget_tree_free()
322 kfree(tree->nodes); in widget_tree_free()
324 if (tree->root) in widget_tree_free()
325 kobject_put(tree->root); in widget_tree_free()
326 kfree(tree); in widget_tree_free()
355 struct hdac_widget_tree *tree; in widget_tree_create() local
[all …]
/linux-4.1.27/Documentation/devicetree/
Dof_unittest.txt9 is attached to the live tree dynamically, independent of the machine's
19 from the unflattened device tree data structure. This interface is used by
55 Un-flattened device tree structure:
57 Un-flattened device tree consists of connected device_node(s) in form of a tree
60 // following struct members are used to construct the tree
69 Figure 1, describes a generic structure of machine's un-flattened device tree
71 *parent, that is used to traverse the tree in the reverse direction. So, at
98 Figure 1: Generic structure of un-flattened device tree
102 machine's device tree (if present). So, when selftest_data_add() is called,
103 at first it reads the flattened device tree data linked into the kernel image
[all …]
Dchangesets.txt2 in the live tree in such a way that either the full set of changes
4 through applying the changeset, then the tree will be rolled back to the
8 When a changeset is applied, all of the changes get applied to the tree
10 receiver sees a complete and consistent state of the tree when it
17 2. A number of DT tree change calls, of_changeset_attach_node(),
20 a set of changes. No changes to the active tree are made at this point.
27 4. of_changeset_apply() - Apply the changes to the tree. Either the
28 entire changeset will get applied, or if there is an error the tree will
Ddynamic-resolution-notes.txt11 The resolver is given as an input an arbitrary tree compiled with the
17 1. Get the maximum device tree phandle value from the live tree + 1.
18 2. Adjust all the local phandles of the tree to resolve by that amount.
22 in the live tree. This is the label used to tag the node.
Dbooting-without-of.txt22 2) Device tree generalities
23 3) Device tree "structure" block
24 4) Device tree "strings" block
26 III - Required content of the device tree
39 IV - "dtc", the device tree compiler
68 small device tree, though it is encouraged
96 - Add a chapter about the device-tree
98 the tree that can be "compiled" by dtc.
108 - Add some definitions of interrupt tree (simple/complex)
130 but no new board support will be accepted in the main tree that
[all …]
Dtodo.txt7 - Switch to RCU for tree updates and get rid of global spinlock
10 - pseries: Get rid of open-coded tree modification from arch/powerpc/platforms/pseries/dlpar.c
Dusage-model.txt3 The Linux usage model for device tree data
7 This article describes how Linux uses the device tree. An overview of
8 the device tree data format can be found on the device tree usage page
19 Structurally, the DT is a tree, or acyclic graph with named nodes, and
22 links from one node to another outside of the natural tree structure.
25 is defined for how data should appear in the tree to describe typical
100 perfectly by the device tree in a consistent and reliable manner.
110 table and selects the machine_desc which best matches the device tree
112 property in the root device tree node, and comparing it with the
202 several times with different helper callbacks to parse device tree
[all …]
Doverlay-notes.txt5 device tree overlay functionality residing in drivers/of/overlay.c and is a
12 A Device Tree's overlay purpose is to modify the kernel's live tree, and
19 Lets take an example where we have a foo board with the following base tree
133 contains the information required to map from a phandle to a tree location.
/linux-4.1.27/Documentation/ABI/testing/
Dsysfs-firmware-ofw6 hardware, the device tree structure will be exposed in this
9 It is possible for multiple device-tree directories to exist.
10 Some device drivers use a separate detached device tree which
11 have no attachment to the system tree and will appear in a
15 path directly, but instead should follow /proc/device-tree
19 The /proc/device-tree symlink replaces the devicetree /proc
24 hierarchy of directories, one per device tree node. The
28 binary data from the device tree.
Dsysfs-devices5 The /sys/devices tree contains a snapshot of the
6 internal state of the kernel device tree. Devices will
9 devices within this tree will change.
11 Please do not rely on the format of this tree because of
13 the tree, please use the /sys/class structure and rely
15 within the /sys/devices tree of the individual devices.
17 devices being added and removed from this tree to find
Dsysfs-class11 All programs that use this directory tree must be able
/linux-4.1.27/fs/ocfs2/
Duptodate.c173 unsigned int tree, to_purge, purged; in ocfs2_metadata_cache_purge() local
179 tree = !(ci->ci_flags & OCFS2_CACHE_FL_INLINE); in ocfs2_metadata_cache_purge()
184 to_purge, tree); in ocfs2_metadata_cache_purge()
189 if (tree) in ocfs2_metadata_cache_purge()
199 if (tree && purged != to_purge) in ocfs2_metadata_cache_purge()
366 struct ocfs2_meta_cache_item **tree) in ocfs2_expand_cache() argument
381 tree[i]->c_block = ci->ci_cache.ci_array[i]; in ocfs2_expand_cache()
389 __ocfs2_insert_cache_tree(ci, tree[i]); in ocfs2_expand_cache()
390 tree[i] = NULL; in ocfs2_expand_cache()
406 struct ocfs2_meta_cache_item *tree[OCFS2_CACHE_INFO_MAX_ARRAY] = in __ocfs2_set_buffer_uptodate() local
[all …]
Drefcounttree.c206 struct ocfs2_refcount_tree *tree = NULL; in ocfs2_find_refcount_tree() local
209 tree = rb_entry(n, struct ocfs2_refcount_tree, rf_node); in ocfs2_find_refcount_tree()
211 if (blkno < tree->rf_blkno) in ocfs2_find_refcount_tree()
213 else if (blkno > tree->rf_blkno) in ocfs2_find_refcount_tree()
216 return tree; in ocfs2_find_refcount_tree()
253 static void ocfs2_free_refcount_tree(struct ocfs2_refcount_tree *tree) in ocfs2_free_refcount_tree() argument
255 ocfs2_metadata_cache_exit(&tree->rf_ci); in ocfs2_free_refcount_tree()
256 ocfs2_simple_drop_lockres(OCFS2_SB(tree->rf_sb), &tree->rf_lockres); in ocfs2_free_refcount_tree()
257 ocfs2_lock_res_free(&tree->rf_lockres); in ocfs2_free_refcount_tree()
258 kfree(tree); in ocfs2_free_refcount_tree()
[all …]
Drefcounttree.h38 struct ocfs2_refcount_tree **tree,
41 struct ocfs2_refcount_tree *tree,
/linux-4.1.27/scripts/
Dtags.sh23 tree=
25 tree=${srctree}/
29 ignore="$ignore ( -path ${tree}tools ) -prune -o"
35 for arch in `ls ${tree}arch`; do
53 find ${tree}arch/$1 $ignore $subarchprune $prune -name "$2" \
60 include=$(find ${tree}arch/$1/ $subarchprune \
71 find ${tree}include $ignore -name config -prune -o -name "$1" \
79 find ${tree}* $ignore \
297 subarchdir=$(find ${tree}arch/$SRCARCH/ -name "mach-*" -type d -o \
/linux-4.1.27/drivers/of/
Doverlay.c264 struct device_node *tree) in of_build_overlay_info() argument
272 for_each_child_of_node(tree, node) in of_build_overlay_info()
280 for_each_child_of_node(tree, node) { in of_build_overlay_info()
338 int of_overlay_create(struct device_node *tree) in of_overlay_create() argument
358 __func__, tree->full_name); in of_overlay_create()
365 err = of_build_overlay_info(ov, tree); in of_overlay_create()
368 __func__, tree->full_name); in of_overlay_create()
376 __func__, tree->full_name); in of_overlay_create()
384 __func__, tree->full_name); in of_overlay_create()
410 static int overlay_subtree_check(struct device_node *tree, in overlay_subtree_check() argument
[all …]
DKconfig15 This option builds in test cases for the device tree infrastructure
39 On some platforms, the device tree can be manipulated at runtime.
41 can enable it manually to improve device tree unit test coverage.
96 device tree with dynamically loaded data.
98 enable it manually to improve device tree unit test coverage.
/linux-4.1.27/fs/ext4/
Dextents_status.c168 void ext4_es_init_tree(struct ext4_es_tree *tree) in ext4_es_init_tree() argument
170 tree->root = RB_ROOT; in ext4_es_init_tree()
171 tree->cache_es = NULL; in ext4_es_init_tree()
177 struct ext4_es_tree *tree; in ext4_es_print_tree() local
181 tree = &EXT4_I(inode)->i_es_tree; in ext4_es_print_tree()
182 node = rb_first(&tree->root); in ext4_es_print_tree()
248 struct ext4_es_tree *tree = NULL; in ext4_es_find_delayed_extent_range() local
257 tree = &EXT4_I(inode)->i_es_tree; in ext4_es_find_delayed_extent_range()
261 if (tree->cache_es) { in ext4_es_find_delayed_extent_range()
262 es1 = tree->cache_es; in ext4_es_find_delayed_extent_range()
[all …]
/linux-4.1.27/arch/arm/mach-spear/
DKconfig33 Supports ST SPEAr1310 machine configured via the device-tree
40 Supports ST SPEAr1340 machine configured via the device-tree
59 Supports ST SPEAr300 machine configured via the device-tree
65 Supports ST SPEAr310 machine configured via the device-tree
71 Supports ST SPEAr320 machine configured via the device-tree
87 Supports ST SPEAr600 boards configured via the device-tree
/linux-4.1.27/drivers/sh/intc/
Dvirq.c68 tagged = radix_tree_tag_get(&d->tree, enum_id, in intc_irq_lookup()
73 ptr = radix_tree_lookup(&d->tree, enum_id); in intc_irq_lookup()
151 mapped = radix_tree_lookup(&d->tree, subgroup->parent_id); in intc_subgroup_init_one()
176 err = radix_tree_insert(&d->tree, entry->enum_id, entry); in intc_subgroup_init_one()
180 radix_tree_tag_set(&d->tree, entry->enum_id, in intc_subgroup_init_one()
208 nr_found = radix_tree_gang_lookup_tag_slot(&d->tree, in intc_subgroup_map()
249 radix_tree_tag_clear(&d->tree, entry->enum_id, in intc_subgroup_map()
263 if (radix_tree_tagged(&d->tree, INTC_TAG_VIRQ_NEEDS_ALLOC)) in intc_finalize()
/linux-4.1.27/arch/parisc/mm/
Dfault.c125 while (tree != vm_avl_empty) {
126 if (tree->vm_start > addr) {
127 tree = tree->vm_avl_left;
129 prev = tree;
134 tree = tree->vm_avl_right;
/linux-4.1.27/drivers/gpu/drm/nouveau/nvkm/core/
Dhandle.c45 list_for_each_entry(item, &handle->tree, head) { in nvkm_handle_init()
55 list_for_each_entry_continue_reverse(item, &handle->tree, head) { in nvkm_handle_init()
71 list_for_each_entry(item, &handle->tree, head) { in nvkm_handle_fini()
88 list_for_each_entry_continue_reverse(item, &handle->tree, head) { in nvkm_handle_fini()
114 INIT_LIST_HEAD(&handle->tree); in nvkm_handle_create()
140 list_add(&handle->head, &handle->parent->tree); in nvkm_handle_create()
156 list_for_each_entry_safe(item, temp, &handle->tree, head) { in nvkm_handle_destroy()
/linux-4.1.27/Documentation/powerpc/
Dbootwrapper.txt26 tree). This image embeds a device tree blob inside
27 the image. The boot wrapper, kernel and device tree
31 tree before jumping into the kernel.
36 which populates the embedded device tree with data
42 dtbImage.%: Similar to zImage, except device tree blob is embedded
47 interface for passing a device tree directly.
59 a device tree blob. This image is a flat binary that
63 the embedded device tree for all information.
86 tree blob inside the image.
91 a device tree to the kernel at boot. If using an older
[all …]
/linux-4.1.27/arch/arm/mach-mvebu/
DKconfig35 on the Marvell Armada 370 SoC with device tree.
50 on the Marvell Armada 375 SoC with device tree.
65 on the Marvell Armada 380/385 SoC with device tree.
79 on the Marvell Armada 39x SoC with device tree.
89 on the Marvell Armada XP SoC with device tree.
102 Marvell Dove using flattened device tree.
117 on the Marvell Kirkwood device tree.
/linux-4.1.27/Documentation/filesystems/
Dsharedsubtree.txt174 To begin with, the administrator can mark the entire mount tree
204 If the entire mount tree is visible at multiple locations, then
369 propagates to. A new propagation tree containing 'C1',..,'Cn' is
370 created. This propagation tree is identical to the propagation tree of
378 propagates to. A new propagation tree is set containing all new mounts
380 propagation tree for 'B'.
386 'B' propagates to. A new propagation tree containing the new mounts
387 'C','C1',.. 'Cn' is created. This propagation tree is identical to the
388 propagation tree for 'B'. And finally the mount 'C' and its peer group
418 replicates all the mounts in the tree belonging to the specified mount.
[all …]
Dqnx6.txt50 data and the addressing levels in that specific tree.
56 to 16 * 256 * 256 = 1048576 blocks that can be addressed by such a tree).
61 tree levels.
87 For more than 16 blocks an indirect addressing in form of another tree is
106 With that longfilename inode number, the longfilename tree can be walked
127 Long filenames are stored in a separate addressing tree. The staring point
129 Each data block (tree leaves) holds one long filename. That filename is
138 The qnx6fs filesystem allocation bitmap is stored in a tree under bitmap
162 tree structures are treated as system blocks.
/linux-4.1.27/lib/
DKconfig68 This option is provided for the case where no in-kernel-tree
70 the kernel tree does. Such modules that use library CRC-CCITT
76 This option is provided for the case where no in-kernel-tree
78 the kernel tree does. Such modules that use library CRC16
87 kernel tree needs to calculate CRC checks for use with the
93 This option is provided for the case where no in-kernel-tree
95 the kernel tree does. Such modules that use library CRC ITU-T V.41
103 This option is provided for the case where no in-kernel-tree
105 the kernel tree does. Such modules that use library CRC32/CRC32c
168 This option is provided for the case where no in-kernel-tree
[all …]
/linux-4.1.27/Documentation/
Drbtree.txt9 Red-black trees are a type of self-balancing binary search tree, used for
18 three rotations, respectively, to balance the tree), with slightly slower
28 red-black tree. Virtual memory areas (VMAs) are tracked with red-black
49 tree implementations. Instead of using pointers to separate rb_node and data
52 users are expected to write their own tree search and insert functions
59 Data nodes in an rbtree tree are structures containing a struct rb_node member:
78 Writing a search function for your tree is fairly straightforward: start at the
106 Inserting data in the tree involves first searching for the place to insert the
107 new node, then inserting the node and rebalancing ("recoloring") the tree.
133 /* Add new node and rebalance tree. */
[all …]
Dstable_kernel_rules.txt4 "-stable" tree:
27 - It or an equivalent fix must already exist in Linus' tree (upstream).
30 Procedure for submitting patches to the -stable tree:
42 To have the patch automatically included in the stable tree, add the tag
45 the stable tree without anything else needing to be done by the author
50 After the patch has been merged to Linus' tree, send an email to
64 git tree (for instance, because it deserves more regression testing first).
92 For each "-stable" tree starting with the specified version.
115 - Security patches will be accepted into the -stable tree directly from the
Dassoc_array.txt17 - Basic internal tree layout.
66 The implementation uses a tree of 16-pointer nodes internally that are indexed
68 tree. To improve memory efficiency, shortcuts can be emplaced to skip over
93 preallocated metadata blocks that will be installed in the internal tree and
94 keeps track of the metadata blocks that will be removed from the tree when the
284 The internal tree will be packed down if possible as part of the iteration
331 This walks through the array's internal tree directly to the object
355 The better the scattering, the wider and lower the internal tree will be.
371 The associative array data structure has an internal tree. This tree is
388 Ignoring shortcuts for the moment, the nodes form a multilevel tree. The index
[all …]
DHOWTO60 file, COPYING, in the main directory of the source tree, for details on
73 The Linux kernel source tree has a large range of documents that are
83 Here is a list of files that are in the kernel source tree that are
124 - Mitigating rapid change within the kernel source tree (or
183 and current projects (both in-tree and out-of-tree). It also describes
193 source tree. Working with the developers in charge of this project, you
194 will learn the basics of getting your patch into the Linux kernel tree,
199 tree, but need some help getting it in the proper form, the
221 - main 4.x kernel tree
222 - 4.x.y -stable kernel tree
[all …]
Dapplying-patches.txt22 different versions of a source tree. Patches are created with the `diff'
25 and what new version the patch will change the source tree into. These
33 (or patch) file and makes the changes to the source tree described in it.
128 anyway, then there's a high risk that either your local source tree or the
131 to start with a fresh tree downloaded in full from kernel.org.
178 a patch from kernel.org to the correct version of an unmodified source tree.
180 assume that either your patch file or your tree is broken and I'd advise you
181 to start over with a fresh download of a full kernel tree and the patch you
308 tool) tree to be in a reasonably sane state adequate for testing.
352 These are daily snapshots of Linus' kernel tree (managed in a git
[all …]
DSubmittingDrivers30 No new drivers are accepted for this kernel tree.
33 No new drivers are accepted for this kernel tree.
116 other people already in the tree don't expect 'we are the
122 tree. Anyone who tells you otherwise isn't telling the
129 Linux kernel master tree:
Dsparse.txt68 annotation is needed. The tree annotations above are for cases where
82 DaveJ has hourly generated tarballs of the git tree available at..
99 be recompiled or not. The latter is a fast way to check the whole tree if you
Dstable_api_nonsense.txt21 you get that only if your driver is in the main kernel tree. You also
23 tree, all of which has made Linux into such a strong, stable, and mature
92 keep a Linux kernel driver that is not in the main kernel tree up to
153 tree, what are you, a developer, supposed to do? Releasing a binary
158 Simple, get your kernel driver into the main kernel tree (remember we
162 driver is in the tree, and a kernel interface changes, it will be fixed
167 The very good side effects of having your driver in the main kernel tree
/linux-4.1.27/Documentation/devicetree/bindings/arm/
Dtegra.txt1 NVIDIA Tegra device tree bindings
7 Each device tree must specify which Tegra SoC it uses, using one of the
16 Each device tree must specify which one or more of the following
Ddigicolor.txt3 Each device tree must specify which Conexant Digicolor SoC it uses.
Dcavium-thunder.txt1 Cavium Thunder platform device tree bindings
Daxxia.txt1 Axxia AXM55xx device tree bindings
Dmoxart.txt1 MOXA ART device tree bindings
Dsunxi.txt3 Each device tree must specify which Allwinner SoC it uses,
Daltera.txt1 Altera's SoCFPGA platform device tree bindings
Damlogic.txt1 Amlogic MesonX device tree bindings
Dsirf.txt1 CSR SiRFprimaII and SiRFmarco device tree bindings.
/linux-4.1.27/drivers/fmc/
Dfmc-sdb.c253 signed long fmc_find_sdb_device(struct sdb_array *tree, in fmc_find_sdb_device() argument
260 int i, n = tree->len; in fmc_find_sdb_device()
265 r = &tree->record[i]; in fmc_find_sdb_device()
269 if (!IS_ERR(tree->subtree[i])) in fmc_find_sdb_device()
270 res = fmc_find_sdb_device(tree->subtree[i], in fmc_find_sdb_device()
273 return res + tree->baseaddr; in fmc_find_sdb_device()
285 return first + tree->baseaddr; in fmc_find_sdb_device()
/linux-4.1.27/drivers/staging/lustre/lustre/ldlm/
Dldlm_extent.c205 struct ldlm_interval_tree *tree; in ldlm_extent_unlink_lock() local
213 tree = &res->lr_itree[idx]; in ldlm_extent_unlink_lock()
215 LASSERT(tree->lit_root != NULL); /* assure the tree is not null */ in ldlm_extent_unlink_lock()
217 tree->lit_size--; in ldlm_extent_unlink_lock()
220 interval_erase(&node->li_node, &tree->lit_root); in ldlm_extent_unlink_lock()
/linux-4.1.27/drivers/net/ethernet/mellanox/mlx5/core/
Dsrq.c48 srq = radix_tree_lookup(&table->tree, srqn); in mlx5_srq_event()
72 srq = radix_tree_lookup(&table->tree, srqn); in mlx5_core_get_srq()
106 err = radix_tree_insert(&table->tree, srq->srqn, srq); in mlx5_core_create_srq()
134 tmp = radix_tree_delete(&table->tree, srq->srqn); in mlx5_core_destroy_srq()
217 INIT_RADIX_TREE(&table->tree, GFP_ATOMIC); in mlx5_init_srq_table()
Dcq.c48 cq = radix_tree_lookup(&table->tree, cqn); in mlx5_cq_completion()
73 cq = radix_tree_lookup(&table->tree, cqn); in mlx5_cq_event()
116 err = radix_tree_insert(&table->tree, cq->cqn, cq); in mlx5_core_create_cq()
147 tmp = radix_tree_delete(&table->tree, cq->cqn); in mlx5_core_destroy_cq()
228 INIT_RADIX_TREE(&table->tree, GFP_ATOMIC); in mlx5_init_cq_table()
Dmr.c44 INIT_RADIX_TREE(&table->tree, GFP_ATOMIC); in mlx5_init_mr_table()
95 err = radix_tree_insert(&table->tree, mlx5_base_mkey(mr->key), mr); in mlx5_core_create_mkey()
120 deleted_mr = radix_tree_delete(&table->tree, mlx5_base_mkey(mr->key)); in mlx5_core_destroy_mkey()
Dqp.c50 common = radix_tree_lookup(&table->tree, rsn); in mlx5_get_rsc()
211 err = radix_tree_insert(&table->tree, qp->qpn, qp); in mlx5_core_create_qp()
253 radix_tree_delete(&table->tree, qp->qpn); in mlx5_core_destroy_qp()
342 INIT_RADIX_TREE(&table->tree, GFP_ATOMIC); in mlx5_init_qp_table()
/linux-4.1.27/kernel/rcu/
DMakefile4 obj-$(CONFIG_TREE_RCU) += tree.o
5 obj-$(CONFIG_PREEMPT_RCU) += tree.o
/linux-4.1.27/sound/soc/fsl/
DKconfig12 This option is only useful for out-of-tree drivers since
13 in-tree drivers select it automatically.
23 This option is only useful for out-of-tree drivers since
24 in-tree drivers select it automatically.
34 This option is only useful for out-of-tree drivers since
35 in-tree drivers select it automatically.
45 This option is only useful for out-of-tree drivers since
46 in-tree drivers select it automatically.
55 This option is only useful for out-of-tree drivers since
56 in-tree drivers select it automatically.
[all …]
/linux-4.1.27/arch/mips/netlogic/
DKconfig5 bool "Built-in device tree for XLP EVP boards"
15 bool "Built-in device tree for XLP SVP boards"
25 bool "Built-in device tree for XLP FVP boards"
35 bool "Built-in device tree for XLP GVP boards"
45 bool "Built-in device tree for XLP RVP boards"
/linux-4.1.27/Documentation/devicetree/bindings/arm/bcm/
Dbrcm,bcm21664.txt1 Broadcom BCM21664 device tree bindings
4 This document describes the device tree bindings for boards with the BCM21664
Dbrcm,bcm4708.txt1 Broadcom BCM4708 device tree bindings
Dbrcm,bcm2835.txt1 Broadcom BCM2835 device tree bindings
Dbrcm,bcm63138.txt1 Broadcom BCM63138 DSL System-on-a-Chip device tree bindings
Dbrcm,bcm11351.txt1 Broadcom BCM11351 device tree bindings
Dbrcm,cygnus.txt1 Broadcom Cygnus device tree bindings
/linux-4.1.27/drivers/md/bcache/
Dbset.c299 kfree(t->tree); in bch_btree_keys_free()
301 free_pages((unsigned long) t->tree, in bch_btree_keys_free()
307 t->tree = NULL; in bch_btree_keys_free()
324 t->tree = bset_tree_bytes(b) < PAGE_SIZE in bch_btree_keys_alloc()
327 if (!t->tree) in bch_btree_keys_alloc()
523 return cacheline_to_bkey(t, to_inorder(j, t), t->tree[j].m); in tree_to_bkey()
556 struct bkey_float *f = &t->tree[j]; in make_bfloat()
595 t->tree = t[-1].tree + j; in bset_alloc_tree()
612 if (t->tree != b->set->tree + btree_keys_cachelines(b)) { in bch_bset_build_unwritten_tree()
646 b->set->tree + btree_keys_cachelines(b) - t->tree); in bch_bset_build_written_tree()
[all …]
/linux-4.1.27/drivers/net/ethernet/mellanox/mlx4/
Dsrq.c50 srq = radix_tree_lookup(&srq_table->tree, srqn & (dev->caps.num_srqs - 1)); in mlx4_srq_event()
179 err = radix_tree_insert(&srq_table->tree, srq->srqn, srq); in mlx4_srq_alloc()
216 radix_tree_delete(&srq_table->tree, srq->srqn); in mlx4_srq_alloc()
235 radix_tree_delete(&srq_table->tree, srq->srqn); in mlx4_srq_free()
281 INIT_RADIX_TREE(&srq_table->tree, GFP_ATOMIC); in mlx4_init_srq_table()
307 srq = radix_tree_lookup(&srq_table->tree, in mlx4_srq_lookup()
Dcq.c104 cq = radix_tree_lookup(&mlx4_priv(dev)->cq_table.tree, in mlx4_cq_completion()
123 cq = radix_tree_lookup(&cq_table->tree, cqn & (dev->caps.num_cqs - 1)); in mlx4_cq_event()
305 err = radix_tree_insert(&cq_table->tree, cq->cqn, cq); in mlx4_cq_alloc()
351 radix_tree_delete(&cq_table->tree, cq->cqn); in mlx4_cq_alloc()
374 radix_tree_delete(&cq_table->tree, cq->cqn); in mlx4_cq_free()
391 INIT_RADIX_TREE(&cq_table->tree, GFP_ATOMIC); in mlx4_init_cq_table()
/linux-4.1.27/arch/nios2/platform/
DKconfig.platform16 comment "Device tree"
39 bool "Compile and link device tree into kernel image"
42 This allows you to specify a dts (device tree source) file
46 string "Device tree source file"
50 Absolute path to the device tree source (dts) file describing your
102 boot (where the information from device tree is not yet available).
/linux-4.1.27/Documentation/devicetree/bindings/mips/
Dralink.txt1 Ralink MIPS SoC device tree bindings
5 Each device tree must specify a compatible value for the Ralink SoC
/linux-4.1.27/Documentation/devicetree/bindings/memory-controllers/
Dti-aemif.txt1 * Device tree bindings for Texas instruments AEMIF controller
42 if clock tree data present in device tree.
46 tree data present in device tree, in another case don't
51 named clocks. Required only if clock tree data present
52 in device tree.
70 named clocks. Required only if clock tree data present
71 in device tree.
/linux-4.1.27/Documentation/block/
Dcfq-iosched.txt26 Setting slice_idle to 0 will remove all the idling on queues/service tree
240 All cfq queues doing synchronous sequential IO go on to sync-idle tree.
241 On this tree we idle on each queue individually.
243 All synchronous non-sequential queues go on sync-noidle tree. Also any
244 request which are marked with REQ_NOIDLE go on this service tree. On this
245 tree we do not idle on individual queues instead idle on the whole group
246 of queues or the tree. So if there are 4 queues waiting for IO to dispatch
248 no more IO on this service tree.
250 All async writes go on async service tree. There is no idling on async
256 all the queues move to sync-noidle tree and only tree idle remains. This
[all …]
/linux-4.1.27/Documentation/networking/
Dnetdev-FAQ.txt9 (i.e. hardware specific drivers) in the Linux source tree.
26 by David Miller, the main network maintainer. There is the "net" tree,
27 and the "net-next" tree. As you can probably guess from the names, the
28 net tree is for fixes to existing code already in the mainline tree from
35 Q: How often do changes from these trees make it to the mainline Linus tree?
40 stuff to Linus for merging into the mainline tree. After the two weeks,
50 the net-next tree will be closed - no new changes/features. The
53 the "net" tree will start accumulating fixes for this pulled content
60 period during which net-next tree is closed.
63 tree for net-next reopens to collect content for the next (vX.Y+1) release.
[all …]
/linux-4.1.27/Documentation/development-process/
D7.AdvancedTopics38 the tree, use branches, etc. An understanding of git's tools for the
78 turning a tested (hopefully) kernel tree into an untested one. But, beyond
91 an exported tree. Moving changesets between trees to avoid conflicts in
97 As the mainline (or other tree upon which a set of changes is based)
98 advances, it is tempting to merge with that tree to stay on the leading
100 another tree, but rebasing is not an option once a tree is exported to the
114 thing happening; putting up a git tree with unreviewed or off-topic patches
127 importantly, do not use a git tree to bypass the review process. Post an
128 occasional summary of the tree to the relevant list, and, when the time is
129 right, request that the tree be included in linux-next.
[all …]
/linux-4.1.27/fs/dlm/
Ddebug_fs.c424 struct rb_root *tree; in table_seq_start() local
453 tree = toss ? &ls->ls_rsbtbl[bucket].toss : &ls->ls_rsbtbl[bucket].keep; in table_seq_start()
456 if (!RB_EMPTY_ROOT(tree)) { in table_seq_start()
457 for (node = rb_first(tree); node; node = rb_next(node)) { in table_seq_start()
485 tree = toss ? &ls->ls_rsbtbl[bucket].toss : &ls->ls_rsbtbl[bucket].keep; in table_seq_start()
488 if (!RB_EMPTY_ROOT(tree)) { in table_seq_start()
489 node = rb_first(tree); in table_seq_start()
506 struct rb_root *tree; in table_seq_next() local
550 tree = toss ? &ls->ls_rsbtbl[bucket].toss : &ls->ls_rsbtbl[bucket].keep; in table_seq_next()
553 if (!RB_EMPTY_ROOT(tree)) { in table_seq_next()
[all …]
/linux-4.1.27/Documentation/devicetree/bindings/leds/
Dleds-ns2.txt9 - cmd-gpio: Command LED GPIO. See OF device-tree GPIO specification.
10 - slow-gpio: Slow LED GPIO. See OF device-tree GPIO specification.
/linux-4.1.27/Documentation/devicetree/bindings/video/bridge/
Dps8622.txt6 - sleep-gpios: OF device-tree gpio specification for PD_ pin.
7 - reset-gpios: OF device-tree gpio specification for RST_ pin.
Dptn3460.txt6 - powerdown-gpio: OF device-tree gpio specification for PD_N pin.
7 - reset-gpio: OF device-tree gpio specification for RST_N pin.
/linux-4.1.27/arch/arm/mach-versatile/
DKconfig21 bool "Support Versatile platform from device tree"
26 using the device tree for discovery
/linux-4.1.27/Documentation/devicetree/bindings/iommu/
Diommu.txt1 This document describes the generic device tree binding for IOMMUs and their
33 The device tree node of the IOMMU device's parent bus must contain a valid
43 The meaning of the IOMMU specifier is defined by the device tree binding of
79 When an "iommus" property is specified in a device tree node, the IOMMU will
83 parent shall take effect. Note that merely disabling a device tree node does
86 disable the IOMMU's device tree node in the first place because it would
96 are not explicitly listed in the device tree (e.g. PCI devices). However, the
/linux-4.1.27/Documentation/device-mapper/
Dverity.txt33 This is the device that supplies the hash tree data. It may be
52 to the root block of the hash tree.
93 tree, the root hash, then the I/O will fail. This should detect
104 Each node in the tree is a cryptographic hash. If it is a leaf node, the hash
108 Each entry in the tree is a collection of neighboring nodes that fit in one
114 The tree looks something like:
161 the hash tree or activate the kernel device. This is available from
/linux-4.1.27/Documentation/devicetree/bindings/metag/
Dmeta.txt3 This binding specifies what properties must be available in the device tree
4 representation of a Meta Processor Core, which is the root node in the tree.
/linux-4.1.27/Documentation/devicetree/bindings/net/
Ddavinci-mdio.txt15 Future plan is to migrate hwmod data base contents into device tree
16 blob so that, all the required data will be used from device tree dts
Dcpsw.txt41 Future plan is to migrate hwmod data base contents into device tree
42 blob so that, all the required data will be used from device tree dts
/linux-4.1.27/Documentation/vm/
Dpage_migration109 6. The radix tree lock is taken. This will cause all processes trying
110 to access the page via the mapping to block on the radix tree spinlock.
115 8. The radix tree is checked and if it does not contain the pointer to this
116 page then we back out because someone else modified the radix tree.
118 9. The radix tree is changed to point to the new page.
120 10. The reference count of the old page is dropped because the radix tree
122 the new page is referenced to by the radix tree.
124 11. The radix tree lock is dropped. With that lookups in the mapping
/linux-4.1.27/arch/arm/boot/dts/
Dexynos4412-odroidx2.dts2 * Hardkernel's Exynos4412 based ODROID-X2 board device tree source
6 * Device tree source file for Hardkernel's ODROID-X2 board which is based
Ds3c6400.dtsi2 * Samsung's S3C6400 SoC device tree source
11 * S3C6400 SoC. As device tree coverage for S3C6400 increases, additional
Dexynos4212.dtsi2 * Samsung's Exynos4212 SoC device tree source
12 * Exynos4212 SoC. As device tree coverage for Exynos4212 increases, additional
Dexynos4412-odroidu3.dts2 * Hardkernel's Exynos4412 based ODROID-U3 board device tree source
6 * Device tree source file for Hardkernel's ODROID-U3 board which is based
Ds3c6410.dtsi2 * Samsung's S3C6410 SoC device tree source
11 * S3C6410 SoC. As device tree coverage for S3C6410 increases, additional
Dexynos4412-tiny4412.dts2 * FriendlyARM's Exynos4412 based TINY4412 board device tree source
6 * Device tree source file for FriendlyARM's TINY4412 board which is based on
Ds5pv210-smdkc110.dts2 * Samsung's S5PV210 SoC device tree source
9 * Board device tree source for YIC System SMDC110 board.
Dexynos4412.dtsi2 * Samsung's Exynos4412 SoC device tree source
12 * Exynos4412 SoC. As device tree coverage for Exynos4412 increases, additional
Dexynos4412-odroidx.dts2 * Hardkernel's Exynos4412 based ODROID-X board device tree source
6 * Device tree source file for Hardkernel's ODROID-X board which is based
Ds5pv210-torbreck.dts2 * Samsung's S5PV210 SoC device tree source
9 * Board device tree source for Torbreck board.
Ds3c6410-smdk6410.dts2 * Samsung S3C6410 based SMDK6410 board device tree source.
6 * Device tree source file for SAMSUNG SMDK6410 board which is based on
Dskeleton.dtsi2 * Skeleton device tree; the bare minimum needed to boot; just include and
Dskeleton64.dtsi2 * Skeleton device tree in the 64 bits version; the bare minimum
Dexynos4412-smdk4412.dts2 * Samsung's Exynos4412 based SMDK board device tree source
7 * Device tree source file for Samsung's SMDK4412 board which is based on
Dwm8750-apc8750.dts3 * - Device tree file for VIA APC8750
Dwm8505-ref.dts2 * wm8505-ref.dts - Device tree file for Wondermedia WM8505 reference netbook
Dvt8500-bv07.dts2 * vt8500-bv07.dts - Device tree file for Benign BV07 Netbook
Dwm8650-mid.dts2 * wm8650-mid.dts - Device tree file for Wondermedia WM8650-MID Tablet
Dexynos5440-trip-points.dtsi2 * Device tree sources for default Exynos5440 thermal zone definition
Dexynos4210-smdkv310.dts2 * Samsung's Exynos4210 based SMDKV310 board device tree source
9 * Device tree source file for Samsung's SMDKV310 board which is based on
Dexynos4412-tmu-sensor-conf.dtsi2 * Device tree sources for Exynos4412 TMU sensor configuration
Dexynos5440-tmu-sensor-conf.dtsi2 * Device tree sources for Exynos5440 TMU sensor configuration
/linux-4.1.27/Documentation/devicetree/bindings/i2c/
Di2c-omap.txt19 Future plan is to migrate hwmod data base contents into device tree
20 blob so that, all the required data will be used from device tree dts
Di2c-cbus-gpio.txt1 Device tree bindings for i2c-cbus-gpio driver
Di2c-xlp9xx.txt1 Device tree configuration for the I2C controller on the XLP9xx/5xx SoC
/linux-4.1.27/arch/mips/bmips/
DKconfig4 prompt "Built-in device tree"
8 a device tree that matches the target board.
/linux-4.1.27/Documentation/arm64/
Dbooting.txt25 2. Setup the device tree
43 2. Setup the device tree
48 The device tree blob (dtb) must be placed on an 8-byte boundary within
121 memreserve region in the device tree) will be considered as available to
131 x0 = physical address of device tree blob (dtb) in system RAM.
187 kernel image. The device tree blob passed by this CPU must contain
191 It is expected that the bootloader will generate these device tree
200 device tree) polling their cpu-release-addr location, which must be
212 to the kernel by a /memreserve/ region in the device tree). The
217 The device tree should contain a 'psci' node, as described in
/linux-4.1.27/drivers/firewire/
Dcore-topology.c404 struct fw_node *tree; in move_tree() local
407 tree = node1->ports[port]; in move_tree()
408 node0->ports[port] = tree; in move_tree()
409 for (i = 0; i < tree->port_count; i++) { in move_tree()
410 if (tree->ports[i] == node1) { in move_tree()
411 tree->ports[i] = node0; in move_tree()
/linux-4.1.27/Documentation/devicetree/bindings/clock/
Demev2-clock.txt1 Device tree Clock bindings for Renesas EMMA Mobile EV2
63 Example of clock-tree description:
65 This describes a clock path in the clock tree
Dmaxim,max77686.txt3 This is a part of device tree bindings of MAX77686 multi-function device.
25 header and can be used in device tree sources.
Dmaxim,max77802.txt3 This is a part of device tree bindings of MAX77802 multi-function device.
23 header and can be used in device tree sources.
Dsamsung,s5pv210-clock.txt21 dt-bindings/clock/s5pv210.h header and can be used in device tree sources.
34 board device tree, including the system base clock, as selected by XOM[0]
Dst,nomadik.txt35 lines from the HCLK clock tree and the gate for individual
36 lines from the PCLK clock tree.
Dexynos7-clock.txt4 independently from the device-tree. These clock controllers
12 device tree sources.
Dti-keystone-pllctrl.txt1 * Device tree bindings for Texas Instruments keystone pll controller
/linux-4.1.27/Documentation/devicetree/bindings/
Dgraph.txt6 The hierarchical organisation of the device tree is well suited to describe
10 There already is a simple directed graph between devices tree nodes using
12 can not be inferred from device tree parent-child relationships. The device
13 tree graph bindings described herein abstract more complex devices that can
Dxilinx.txt17 The new approach is to export the parameters into the device tree and
18 generate a new device tree each time the FPGA bitstream changes. The
74 becomes the following device tree node:
121 It would result in the following device tree nodes:
147 to the devices. The device tree structure should reflect the bus
201 Gives this device tree (some properties removed for clarity):
233 device tree. The following are bindings for specific devices:
/linux-4.1.27/arch/arm/mach-mmp/
DKconfig88 bool "Support MMP (ARMv5) platforms from device tree"
97 the device tree. Needn't select any other machine while
101 bool "Support MMP2 (ARMv7) platforms from device tree"
111 the device tree.
/linux-4.1.27/drivers/input/
DKconfig46 option is only useful for out-of-tree drivers since
47 in-tree drivers select it automatically.
59 useful for out-of-tree drivers since in-tree drivers
72 useful for out-of-tree drivers since in-tree drivers
/linux-4.1.27/arch/arm/mach-imx/
DKconfig124 bool "Support i.MX1 platforms from device tree"
128 using the device tree for discovery.
219 bool "Support i.MX27 platforms from device tree"
223 using the device tree for discovery
396 bool "Support i.MX31 platforms from device tree"
400 using the device tree for discovery.
405 bool "Support i.MX35 platforms from device tree"
409 using the device tree for discovery.
501 comment "Device tree only"
515 comment "Device tree only"
/linux-4.1.27/Documentation/hwmon/
Dibmpowernv15 The driver uses the platform device infrastructure. It probes the device tree
17 'hwmon' populates the 'sysfs' tree having attribute files, each for a given
Dina2xx54 The shunt value in micro-ohms can be set via platform data or device tree at
57 if the device tree is used.
/linux-4.1.27/Documentation/devicetree/bindings/net/can/
Dc_can.txt23 Future plan is to migrate hwmod data base contents into device tree
24 blob so that, all the required data will be used from device tree dts
/linux-4.1.27/include/net/
Dpkt_cls.h287 struct tcf_ematch_tree *tree, in tcf_em_tree_match() argument
290 if (tree->hdr.nmatches) in tcf_em_tree_match()
291 return __tcf_em_tree_match(skb, tree, info); in tcf_em_tree_match()
/linux-4.1.27/Documentation/devicetree/bindings/power/
Dpower_domain.txt7 This device tree binding can be used to bind PM domain consumer devices with
9 represented by any node in the device tree and can provide one or more PM
20 as specified by device tree binding documentation of particular provider.
/linux-4.1.27/fs/jfs/
Djfs_dmap.c1133 if (dp->tree.leafidx != cpu_to_le32(LEAFIND)) { in dbAllocNext()
1140 leaf = dp->tree.stree + le32_to_cpu(dp->tree.leafidx); in dbAllocNext()
1263 if (dp->tree.leafidx != cpu_to_le32(LEAFIND)) { in dbAllocNear()
1268 leaf = dp->tree.stree + le32_to_cpu(dp->tree.leafidx); in dbAllocNear()
1895 if (dp->tree.stree[ROOT] != L2BPERDMAP) { in dbAllocCtl()
2010 if (dbFindLeaf((dmtree_t *) & dp->tree, l2nb, &leafidx)) in dbAllocDmapLev()
2022 if (dp->tree.stree[leafidx + LEAFIND] < BUDMIN) in dbAllocDmapLev()
2069 oldroot = dp->tree.stree[ROOT]; in dbAllocDmap()
2075 if (dp->tree.stree[ROOT] == oldroot) in dbAllocDmap()
2082 if ((rc = dbAdjCtl(bmp, blkno, dp->tree.stree[ROOT], 1, 0))) in dbAllocDmap()
[all …]
/linux-4.1.27/Documentation/thermal/
Dcpu-cooling-api.txt32 the name "thermal-cpufreq-%x" linking it with a device tree node, in
36 np: pointer to the cooling device device tree node
/linux-4.1.27/Documentation/devicetree/bindings/usb/
Dtwlxxxx-usb.txt10 - usb-supply : phandle to the regulator device tree node. It should be vusb
28 - <supply-name>-supply : phandle to the regulator device tree node.
/linux-4.1.27/arch/powerpc/boot/dts/
Dmpc5121ads.dts56 device-tree@3ec0000 {
57 label = "device-tree";
58 reg = <0x03ec0000 0x00040000>; // one sector for device tree
/linux-4.1.27/Documentation/devicetree/bindings/clock/ti/
Ddra7-atl.txt12 Clock tree binding:
14 To be able to integrate the ATL clocks with DT clock tree.
17 for the DT clock tree, the IP driver is needed to handle the actual configuration
/linux-4.1.27/Documentation/devicetree/bindings/net/dsa/
Ddsa.txt7 and second cell is the address in the switch tree.
81 reg = <16 0>; /* MDIO address 16, switch 0 in tree */
109 reg = <17 1>; /* MDIO address 17, switch 1 in tree */
/linux-4.1.27/Documentation/devicetree/bindings/media/xilinx/
Dvideo.txt9 tree using bindings documented in this directory. Connections between the IP
13 tree using bindings documented in ./xlnx,video.txt.
/linux-4.1.27/Documentation/devicetree/bindings/watchdog/
Dtwl4030-wdt.txt1 Device tree bindings for twl4030-wdt driver (TWL4030 watchdog)
/linux-4.1.27/Documentation/devicetree/bindings/input/
Dpwm-beeper.txt1 * PWM beeper device tree bindings
Dgpio-beeper.txt1 * GPIO beeper device tree bindings
Dclps711x-keypad.txt1 * Cirrus Logic CLPS711X matrix keypad device tree bindings
/linux-4.1.27/arch/mips/fw/arc/
DMakefile6 misc.o salone.o time.o tree.o
/linux-4.1.27/drivers/staging/skein/
DTODO8 staging tree mailinglist.
/linux-4.1.27/Documentation/devicetree/bindings/pwm/
Dpwm-fsl-ftm.txt4 device tree provides a property to describing this so that an operating system
15 modes in device tree.
/linux-4.1.27/arch/arm64/boot/dts/
Dskeleton.dtsi2 * Skeleton device tree; the bare minimum needed to boot; just include and
/linux-4.1.27/arch/metag/boot/dts/
Dskeleton.dtsi2 * Skeleton device tree; the bare minimum needed to boot; just include and
/linux-4.1.27/drivers/staging/octeon-usb/
DTODO8 - device tree bindings
/linux-4.1.27/Documentation/devicetree/bindings/mmc/
Dmmci.txt12 - vmmc-supply : phandle to the regulator device tree node, mentioned
18 - vqmmc-supply : phandle to the regulator device tree node, mentioned
/linux-4.1.27/Documentation/devicetree/bindings/mtd/
Darm-versatile.txt7 The device tree may optionally contain sub-nodes describing partitions of the
Datmel-dataflash.txt6 The device tree may optionally contain sub-nodes describing partitions of the
/linux-4.1.27/Documentation/devicetree/bindings/iio/magnetometer/
Dak8975.txt10 - gpios : should be device tree identifier of the magnetometer DRDY pin
Dhmc5843.txt14 - gpios : should be device tree identifier of the magnetometer DRDY pin
/linux-4.1.27/include/linux/
Dfmc-sdb.h36 extern signed long fmc_find_sdb_device(struct sdb_array *tree, uint64_t vendor,
/linux-4.1.27/Documentation/devicetree/bindings/mfd/
Datmel-gpbr.txt1 * Device tree bindings for Atmel GPBR (General Purpose Backup Registers)
Dti-keystone-devctrl.txt1 * Device tree bindings for Texas Instruments keystone device state control
Datmel-smc.txt1 * Device tree bindings for Atmel SMC (Static Memory Controller)
/linux-4.1.27/sound/aoa/fabrics/
DKconfig8 based on the device-tree's layout-id property.
/linux-4.1.27/Documentation/devicetree/bindings/pinctrl/
Dfsl,imx25-pinctrl.txt22 Refer to imx25-pinfunc.h in device tree source folder for all available
Dpinctrl-bindings.txt5 controllers. Each pin controller must be represented as a node in device tree,
10 node in device tree, just like any other hardware module.
21 for client device device tree nodes to map those state names to the pin
29 individual board device tree files, and any requirements imposed by the
42 defined in its device tree node, and whether to define the set of state
/linux-4.1.27/Documentation/kbuild/
Dmodules.txt3 This document describes how to build an out-of-tree kernel module.
39 both in-tree and out-of-tree is provided. The method for building
41 out-of-tree.
44 in building out-of-tree (or "external") modules. The author of an
61 exists solely as a simple way to prepare a kernel source tree for
382 root of the kernel tree (the argument to "-C") and therefore an
410 calling "make." This has effect when installing both in-tree
411 and out-of-tree modules.
463 tree. If a Module.symvers file is present in the directory
540 in-tree modules when testing for CONFIG_ definitions.
/linux-4.1.27/drivers/gpu/drm/nouveau/include/nvkm/core/
Dhandle.h11 struct list_head tree; member
/linux-4.1.27/Documentation/ABI/stable/
Dsysfs-devices8 Any device associated with a device-tree node will have
/linux-4.1.27/Documentation/devicetree/bindings/nios2/
Dnios2.txt3 This binding specifies what properties available in the device tree
6 Users can use sopc2dts tool for generating device tree sources (dts) from a
/linux-4.1.27/Documentation/devicetree/bindings/w1/
Dfsl-imx-owire.txt9 clock bindings use device tree)
/linux-4.1.27/fs/befs/
DTODO9 * See if Alexander Viro's option parser made it into the kernel tree.
/linux-4.1.27/Documentation/ABI/removed/
Ddevfs10 kernel tree.
/linux-4.1.27/Documentation/arm/SA1100/
DFreeBird6 Based on the Nicolas's strongarm kernel tree.
/linux-4.1.27/Documentation/devicetree/bindings/rtc/
Disil,isl12057.txt3 ISL12057 is a trivial I2C device (it has simple device tree bindings,
9 on at least three in-tree users of the chip (NETGEAR ReadyNAS 102, 104
/linux-4.1.27/Documentation/fmc/
DAPI.txt43 an SDB tree. You can pass -1 as sdb_entry to disable such scan.
44 Otherwise, the function fails if no tree is found at the specified
/linux-4.1.27/Documentation/scheduler/
Dsched-design-CFS.txt62 side of the tree as much as possible.
69 p->se.vruntime key. CFS picks the "leftmost" task from this tree and sticks to it.
70 As the system progresses forwards, the executed tasks are put into the tree
162 It puts the scheduling entity (task) into the red-black tree and
168 corresponding scheduling entity out of the red-black tree. It decrements
175 entity at the right-most end of the red-black tree.
/linux-4.1.27/Documentation/devicetree/bindings/input/touchscreen/
Dgoodix.txt1 Device tree bindings for Goodix GT9xx series touchscreen controller
/linux-4.1.27/Documentation/arm/
DBooting71 tree. set the machine type to all ones (~0). This is not strictly
116 4b. Setup the device tree
119 The boot loader must load a device tree image (dtb) into system ram
145 A safe location is just above the device tree blob which itself will
180 physical address of device tree block (dtb) in system RAM
/linux-4.1.27/Documentation/devicetree/bindings/regulator/
Dpwm-regulator.txt5 - pwms: OF device-tree PWM specification (see PWM binding pwm.txt)

12345