Home
last modified time | relevance | path

Searched refs:nodes (Results 1 – 200 of 674) sorted by relevance

1234

/linux-4.1.27/mm/
Dmempolicy.c146 int (*create)(struct mempolicy *pol, const nodemask_t *nodes);
161 void (*rebind)(struct mempolicy *pol, const nodemask_t *nodes,
178 static int mpol_new_interleave(struct mempolicy *pol, const nodemask_t *nodes) in mpol_new_interleave() argument
180 if (nodes_empty(*nodes)) in mpol_new_interleave()
182 pol->v.nodes = *nodes; in mpol_new_interleave()
186 static int mpol_new_preferred(struct mempolicy *pol, const nodemask_t *nodes) in mpol_new_preferred() argument
188 if (!nodes) in mpol_new_preferred()
190 else if (nodes_empty(*nodes)) in mpol_new_preferred()
193 pol->v.preferred_node = first_node(*nodes); in mpol_new_preferred()
197 static int mpol_new_bind(struct mempolicy *pol, const nodemask_t *nodes) in mpol_new_bind() argument
[all …]
Dmmzone.c45 static inline int zref_in_nodemask(struct zoneref *zref, nodemask_t *nodes) in zref_in_nodemask() argument
48 return node_isset(zonelist_node_idx(zref), *nodes); in zref_in_nodemask()
57 nodemask_t *nodes) in next_zones_zonelist() argument
63 if (likely(nodes == NULL)) in next_zones_zonelist()
68 (z->zone && !zref_in_nodemask(z, nodes))) in next_zones_zonelist()
/linux-4.1.27/drivers/md/persistent-data/
Ddm-btree-spine.c131 s->nodes[0] = NULL; in init_ro_spine()
132 s->nodes[1] = NULL; in init_ro_spine()
140 int r2 = unlock_block(s->info, s->nodes[i]); in exit_ro_spine()
153 r = unlock_block(s->info, s->nodes[0]); in ro_step()
156 s->nodes[0] = s->nodes[1]; in ro_step()
160 r = bn_read_lock(s->info, new_child, s->nodes + s->count); in ro_step()
171 unlock_block(s->info, s->nodes[s->count]); in ro_pop()
179 block = s->nodes[s->count - 1]; in ro_node()
197 int r2 = unlock_block(s->info, s->nodes[i]); in exit_shadow_spine()
211 r = unlock_block(s->info, s->nodes[0]); in shadow_step()
[all …]
Ddm-btree-internal.h67 struct dm_block *nodes[2]; member
80 struct dm_block *nodes[2]; member
Ddm-btree.c479 s->nodes[1] = left; in btree_split_sibling()
482 s->nodes[1] = right; in btree_split_sibling()
579 if (s->nodes[0] != new_parent) { in btree_split_beneath()
580 unlock_block(s->info, s->nodes[0]); in btree_split_beneath()
581 s->nodes[0] = new_parent; in btree_split_beneath()
585 s->nodes[1] = left; in btree_split_beneath()
588 s->nodes[1] = right; in btree_split_beneath()
/linux-4.1.27/lib/
Dinterval_tree_test.c12 static struct interval_tree_node nodes[NODES]; variable
36 nodes[i].start = a; in init()
37 nodes[i].last = b; in init()
39 nodes[i].start = b; in init()
40 nodes[i].last = a; in init()
62 interval_tree_insert(nodes + j, &root); in interval_tree_test_init()
64 interval_tree_remove(nodes + j, &root); in interval_tree_test_init()
76 interval_tree_insert(nodes + j, &root); in interval_tree_test_init()
Drbtree_test.c20 static struct test_node nodes[NODES]; variable
99 nodes[i].key = prandom_u32_state(&rnd); in init()
100 nodes[i].val = prandom_u32_state(&rnd); in init()
189 insert(nodes + j, &root); in rbtree_test_init()
191 erase(nodes + j, &root); in rbtree_test_init()
204 insert(nodes + j, &root); in rbtree_test_init()
208 erase(nodes + j, &root); in rbtree_test_init()
221 insert_augmented(nodes + j, &root); in rbtree_test_init()
223 erase_augmented(nodes + j, &root); in rbtree_test_init()
236 insert_augmented(nodes + j, &root); in rbtree_test_init()
[all …]
Dradix-tree.c68 struct radix_tree_node *nodes[RADIX_TREE_PRELOAD_SIZE]; member
200 ret = rtp->nodes[rtp->nr - 1]; in radix_tree_node_alloc()
201 rtp->nodes[rtp->nr - 1] = NULL; in radix_tree_node_alloc()
260 while (rtp->nr < ARRAY_SIZE(rtp->nodes)) { in __radix_tree_preload()
267 if (rtp->nr < ARRAY_SIZE(rtp->nodes)) in __radix_tree_preload()
268 rtp->nodes[rtp->nr++] = node; in __radix_tree_preload()
1480 rtp->nodes[rtp->nr-1]); in radix_tree_callback()
1481 rtp->nodes[rtp->nr-1] = NULL; in radix_tree_callback()
/linux-4.1.27/fs/btrfs/
Dinode-item.c36 leaf = path->nodes[0]; in find_name_in_backref()
66 leaf = path->nodes[0]; in btrfs_find_name_in_ext_backref()
165 leaf = path->nodes[0]; in btrfs_del_inode_extref()
233 leaf = path->nodes[0]; in btrfs_del_inode_ref()
306 leaf = path->nodes[0]; in btrfs_insert_inode_extref()
312 btrfs_set_inode_extref_name_len(path->nodes[0], extref, name_len); in btrfs_insert_inode_extref()
313 btrfs_set_inode_extref_index(path->nodes[0], extref, index); in btrfs_insert_inode_extref()
314 btrfs_set_inode_extref_parent(path->nodes[0], extref, ref_objectid); in btrfs_insert_inode_extref()
317 write_extent_buffer(path->nodes[0], name, ptr, name_len); in btrfs_insert_inode_extref()
318 btrfs_mark_buffer_dirty(path->nodes[0]); in btrfs_insert_inode_extref()
[all …]
Dctree.c60 if (!p->nodes[i] || !p->locks[i]) in btrfs_set_path_blocking()
62 btrfs_set_lock_blocking_rw(p->nodes[i], p->locks[i]); in btrfs_set_path_blocking()
93 if (p->nodes[i] && p->locks[i]) { in btrfs_clear_path_blocking()
94 btrfs_clear_lock_blocking_rw(p->nodes[i], p->locks[i]); in btrfs_clear_path_blocking()
127 if (!p->nodes[i]) in btrfs_release_path()
130 btrfs_tree_unlock_rw(p->nodes[i], p->locks[i]); in btrfs_release_path()
133 free_extent_buffer(p->nodes[i]); in btrfs_release_path()
134 p->nodes[i] = NULL; in btrfs_release_path()
1897 mid = path->nodes[level]; in balance_level()
1906 parent = path->nodes[level + 1]; in balance_level()
[all …]
Dulist.c49 INIT_LIST_HEAD(&ulist->nodes); in ulist_init()
66 list_for_each_entry_safe(node, next, &ulist->nodes, list) { in ulist_fini()
70 INIT_LIST_HEAD(&ulist->nodes); in ulist_fini()
206 list_add_tail(&node->list, &ulist->nodes); in ulist_add_merge()
232 if (list_empty(&ulist->nodes)) in ulist_next()
234 if (uiter->cur_list && uiter->cur_list->next == &ulist->nodes) in ulist_next()
239 uiter->cur_list = ulist->nodes.next; in ulist_next()
Dtree-log.c370 u32 dst_size = btrfs_item_size_nr(path->nodes[0], in overwrite_item()
390 dst_ptr = btrfs_item_ptr_offset(path->nodes[0], path->slots[0]); in overwrite_item()
391 read_extent_buffer(path->nodes[0], dst_copy, dst_ptr, in overwrite_item()
417 item = btrfs_item_ptr(path->nodes[0], path->slots[0], in overwrite_item()
419 nbytes = btrfs_inode_nbytes(path->nodes[0], item); in overwrite_item()
464 found_size = btrfs_item_size_nr(path->nodes[0], in overwrite_item()
474 dst_ptr = btrfs_item_ptr_offset(path->nodes[0], in overwrite_item()
494 struct extent_buffer *dst_eb = path->nodes[0]; in overwrite_item()
518 S_ISDIR(btrfs_inode_mode(path->nodes[0], dst_item))) { in overwrite_item()
520 saved_i_size = btrfs_inode_size(path->nodes[0], in overwrite_item()
[all …]
Dfile-item.c66 leaf = path->nodes[0]; in btrfs_insert_file_extent()
107 leaf = path->nodes[0]; in btrfs_lookup_csum()
257 btrfs_item_key_to_cpu(path->nodes[0], &found_key, in __btrfs_lookup_bio_sums()
261 item_size = btrfs_item_size_nr(path->nodes[0], in __btrfs_lookup_bio_sums()
266 item = btrfs_item_ptr(path->nodes[0], path->slots[0], in __btrfs_lookup_bio_sums()
278 read_extent_buffer(path->nodes[0], csum, in __btrfs_lookup_bio_sums()
343 leaf = path->nodes[0]; in btrfs_lookup_csums_range()
356 leaf = path->nodes[0]; in btrfs_lookup_csums_range()
363 leaf = path->nodes[0]; in btrfs_lookup_csums_range()
383 item = btrfs_item_ptr(path->nodes[0], path->slots[0], in btrfs_lookup_csums_range()
[all …]
Droot-tree.c105 l = path->nodes[0]; in btrfs_find_root()
157 btrfs_print_leaf(root, path->nodes[0]); in btrfs_update_root()
163 l = path->nodes[0]; in btrfs_update_root()
194 l = path->nodes[0]; in btrfs_update_root()
206 btrfs_mark_buffer_dirty(path->nodes[0]); in btrfs_update_root()
254 leaf = path->nodes[0]; in btrfs_find_orphan_roots()
261 leaf = path->nodes[0]; in btrfs_find_orphan_roots()
373 leaf = path->nodes[0]; in btrfs_del_root_ref()
447 leaf = path->nodes[0]; in btrfs_add_root_ref()
Ddir-item.c56 leaf = path->nodes[0]; in insert_with_overflow()
95 leaf = path->nodes[0]; in btrfs_insert_xattr_item()
107 btrfs_mark_buffer_dirty(path->nodes[0]); in btrfs_insert_xattr_item()
156 leaf = path->nodes[0]; in btrfs_insert_dir_item()
261 leaf = path->nodes[0]; in btrfs_check_dir_item_collision()
326 leaf = path->nodes[0]; in btrfs_search_dir_index_item()
336 leaf = path->nodes[0]; in btrfs_search_dir_index_item()
393 leaf = path->nodes[0]; in btrfs_match_dir_item_name()
431 leaf = path->nodes[0]; in btrfs_delete_one_dir_name()
Dtree-defrag.c101 if (!path->nodes[1]) { in btrfs_defrag_leaves()
105 path->slots[1] = btrfs_header_nritems(path->nodes[1]); in btrfs_defrag_leaves()
109 path->nodes[1], 0, in btrfs_defrag_leaves()
Dsend.c803 ii = btrfs_item_ptr(path->nodes[0], path->slots[0], in __get_inode_info()
806 *size = btrfs_inode_size(path->nodes[0], ii); in __get_inode_info()
808 *gen = btrfs_inode_generation(path->nodes[0], ii); in __get_inode_info()
810 *mode = btrfs_inode_mode(path->nodes[0], ii); in __get_inode_info()
812 *uid = btrfs_inode_uid(path->nodes[0], ii); in __get_inode_info()
814 *gid = btrfs_inode_gid(path->nodes[0], ii); in __get_inode_info()
816 *rdev = btrfs_inode_rdev(path->nodes[0], ii); in __get_inode_info()
854 struct extent_buffer *eb = path->nodes[0]; in iterate_inode_ref()
1003 eb = path->nodes[0]; in iterate_dir_item()
1125 btrfs_item_key_to_cpu(p->nodes[0], &found_key, p->slots[0]); in get_inode_path()
[all …]
Duuid-tree.c65 eb = path->nodes[0]; in btrfs_uuid_tree_lookup()
126 eb = path->nodes[0]; in btrfs_uuid_tree_add()
135 eb = path->nodes[0]; in btrfs_uuid_tree_add()
196 eb = path->nodes[0]; in btrfs_uuid_tree_rem()
291 leaf = path->nodes[0]; in btrfs_uuid_tree_iterate()
Drelocation.c767 eb = path1->nodes[0];
778 eb = path1->nodes[0];
923 eb = path2->nodes[level];
930 if (!path2->nodes[level]) {
946 eb = path2->nodes[level];
1600 leaf = path->nodes[0];
1747 btrfs_node_key(path->nodes[level], &key2, path->slots[level]);
1786 btrfs_node_key_to_cpu(path->nodes[lowest_level], &key, slot);
1827 eb = path->nodes[level];
1877 btrfs_node_key_to_cpu(path->nodes[level], &key,
[all …]
Ddelayed-inode.h47 int nodes; /* for delayed nodes */ member
94 delayed_root->nodes = 0; in btrfs_init_delayed_root()
Dextent-tree.c427 leaf = path->nodes[0]; in caching_thread()
458 leaf = path->nodes[0]; in caching_thread()
792 btrfs_item_key_to_cpu(path->nodes[0], &key, in btrfs_lookup_extent_info()
802 leaf = path->nodes[0]; in btrfs_lookup_extent_info()
996 leaf = path->nodes[0]; in convert_extent_item_v0()
1011 leaf = path->nodes[0]; in convert_extent_item_v0()
1040 leaf = path->nodes[0]; in convert_extent_item_v0()
1145 leaf = path->nodes[0]; in lookup_extent_data_ref()
1155 leaf = path->nodes[0]; in lookup_extent_data_ref()
1212 leaf = path->nodes[0]; in insert_extent_data_ref()
[all …]
Dbackref.c241 eb = path->nodes[level]; in add_all_parents()
253 if (path->slots[0] >= btrfs_header_nritems(path->nodes[0])) in add_all_parents()
257 eb = path->nodes[0]; in add_all_parents()
359 eb = path->nodes[level]; in __resolve_indirect_ref()
366 eb = path->nodes[level]; in __resolve_indirect_ref()
697 leaf = path->nodes[0]; in __add_inline_refs()
811 leaf = path->nodes[0]; in __add_keyed_refs()
981 leaf = path->nodes[0];
1287 leaf = path->nodes[0];
1390 eb = path->nodes[0];
[all …]
Dxattr.c60 leaf = path->nodes[0]; in __btrfs_getxattr()
151 btrfs_assert_tree_locked(path->nodes[0]); in do_setxattr()
179 struct extent_buffer *leaf = path->nodes[0]; in do_setxattr()
294 leaf = path->nodes[0]; in btrfs_listxattr()
/linux-4.1.27/Documentation/devicetree/bindings/arm/
Dtopology.txt16 The cpu nodes (bindings defined in [1]) represent the devices that
22 For instance in a system where CPUs support SMT, "cpu" nodes represent all
24 In systems where SMT is not supported "cpu" nodes represent all cores present
27 ARM topology bindings allow one to associate cpu nodes with hierarchical groups
29 tree nodes.
39 A topology description containing phandles to cpu nodes that are not compliant
48 nodes are listed.
64 The cpu-map node's child nodes can be:
66 - one or more cluster nodes
70 The cpu-map node can only contain three types of child nodes:
[all …]
Dpsci.txt53 Device tree nodes that require usage of PSCI CPU_SUSPEND function (ie idle
54 state nodes, as per bindings in [1]) must specify the following properties:
57 Usage: Required for state nodes[1] if the corresponding
Dgic-v3.txt52 Sub-nodes:
57 These nodes must have the following properties:
65 nodes.
Darm-boards12 Required nodes:
90 Required nodes:
113 Required nodes:
/linux-4.1.27/Documentation/devicetree/bindings/pinctrl/
Dmeson,pinctrl.txt7 === GPIO sub-nodes ===
10 represented as sub-nodes and each of them acts as a GPIO controller.
12 Required properties for sub-nodes are:
25 === Other sub-nodes ===
27 Child nodes without the "gpio-controller" represent some desired
28 configuration for a pin or a group. Those nodes can be pinmux nodes or
29 configuration nodes.
31 Required properties for pinmux nodes are:
38 Required properties for configuration nodes:
41 Configuration nodes support the generic properties "bias-disable",
Dxlnx,zynq-pinctrl.txt12 Zynq's pin configuration nodes act as a container for an arbitrary number of
18 Each configuration node can consist of multiple nodes describing the pinmux and
19 pinconf options. Those nodes can be pinmux nodes or pinconf nodes.
24 Required properties for pinmux nodes are:
29 Required properties for configuration nodes:
Dpinctrl-bindings.txt21 for client device device tree nodes to map those state names to the pin
28 nodes. The decision to do this or not somewhat rests with the author of
48 node. These referenced pin configuration nodes must be child
49 nodes of the pin controller that they configure. Multiple
52 from multiple nodes for a single pin controller, each
55 pin configuration nodes.
101 Pin controller devices should contain the pin configuration nodes that client
120 The contents of each of those pin configuration child nodes is defined
124 The pin configuration nodes need not be direct children of the pin controller
127 nodes, is again defined entirely by the binding for the individual pin
[all …]
Dfsl,mxs-pinctrl.txt36 having these pins defined in several group nodes. It also means each of
50 and config nodes to identify a pin. The mux selection in the integer takes
56 - reg: Should be the index of the group nodes for same function. This property
57 is required only for group nodes, and should not be present in any config
58 nodes.
119 applied on all these pins. And config nodes mmc-cd-cfg and mmc-sck-cfg are
122 to be listed in the config nodes.
Drenesas,pfc-pinctrl.txt35 The PFC node also acts as a container for pin configuration nodes. Please refer
44 Pin configuration nodes contain pin configuration properties, either directly
54 All pin configuration nodes and subnodes names are ignored. All of those nodes
88 The syntax of the gpio specifier used by client nodes should be the following
Dsamsung-pinctrl.txt26 - Pin banks as child nodes: Pin banks of the controller are represented by child
27 nodes of the controller node. Bank name is taken from name of the node. Each
45 - Pin mux/config groups as child nodes: The pin mux (selecting pin function
47 as child nodes of the pin-controller node. There should be atleast one
48 child node and there is no limit on the count of these child nodes. It is
49 also possible for a child node to consist of several further child nodes
51 level child nodes is exactly the same as for first level ones and is
92 The client nodes that require a particular pin function selection and/or
171 All the pin controller nodes should be represented in the aliases node using
Dabilis,tb10x-iomux.txt15 Functions are defined (and referenced) by sub-nodes of the pin controller.
19 controller sub-nodes.
Drockchip,pinctrl.txt19 defined as gpio sub-nodes of the pinmux controller.
39 Required properties for gpio sub nodes:
53 Deprecated properties for gpio sub nodes:
Dfsl,imx27-pinctrl.txt55 The iomux controller has gpio child nodes which are embedded in the iomux
56 control registers. They have to be defined as child nodes of the iomux device
/linux-4.1.27/arch/sparc/kernel/
Dcpumap.c52 struct cpuinfo_node nodes[0]; member
211 node = &new_tree->nodes[n]; in build_cpuinfo_tree()
252 node = &new_tree->nodes[level_rover[level]]; in build_cpuinfo_tree()
277 node = &new_tree->nodes[n]; in build_cpuinfo_tree()
299 struct cpuinfo_node *node = &t->nodes[node_index]; in increment_rover()
302 top_level = t->nodes[root_index].level; in increment_rover()
314 node = &t->nodes[node->parent_index]; in increment_rover()
338 for (level = t->nodes[root_index].level; level < CPUINFO_LVL_MAX; in iterate_cpu()
340 new_index = t->nodes[index].rover; in iterate_cpu()
366 for (i = 0; i < cpuinfo_tree->nodes[0].num_cpus; i++) in _cpu_map_rebuild()
[all …]
/linux-4.1.27/Documentation/vm/
Dnuma_memory_policy.txt13 which is an administrative mechanism for restricting the nodes from which
31 default policy will be set to interleave allocations across all nodes
140 optional set of nodes. The mode determines the behavior of the policy,
142 optional set of nodes can be viewed as the arguments to the policy
162 does not use the optional set of nodes.
164 It is an error for the set of nodes specified for this policy to
168 set of nodes specified by the policy. Memory will be allocated from
174 allocation fails, the kernel will search other nodes, in order of
192 interleaved, on a page granularity, across the nodes specified in
197 Interleave mode indexes the set of nodes specified by the policy
[all …]
Dnuma45 abstractions called "nodes". Linux maps the nodes onto the physical cells
47 architectures. As with physical cells, software nodes may contain 0 or more
49 "closer" nodes--nodes that map to closer cells--will generally experience
60 the emulation of additional nodes. For NUMA emulation, linux will carve up
61 the existing nodes--or the system memory for non-NUMA platforms--into multiple
62 nodes. Each emulated node will manage a fraction of the underlying cells'
72 an ordered "zonelist". A zonelist specifies the zones/nodes to visit when a
77 Because some nodes contain multiple zones containing different types of
93 nodes' zones in the selected zonelist looking for the first zone in the list
104 Thus, under sufficient imbalance, tasks can migrate between nodes, remote
[all …]
Dhugetlbpage.txt91 over all the set of allowed nodes specified by the NUMA memory policy of the
92 task that modifies nr_hugepages. The default for the allowed nodes--when the
93 task has default memory policy--is all on-line nodes with memory. Allowed
94 nodes with insufficient available, contiguous memory for a huge page will be
102 some nodes in a NUMA system, it will attempt to make up the difference by
103 allocating extra pages on other nodes with sufficient available contiguous
131 across all nodes in the memory policy of the task modifying nr_hugepages.
132 Any free huge pages on the selected nodes will be freed back to the kernel's
172 nodes from which huge pages are allocated or freed are controlled by the
187 This will allocate or free abs(20 - nr_hugepages) to or from the nodes
[all …]
Dpage_migration5 nodes in a numa system while the process is running. This means that the
17 migrate_pages function call takes two sets of nodes and moves pages of a
18 process that are located on the from nodes to the destination nodes.
39 sections of nodes. Paul Jackson has equipped cpusets with the ability to
45 of processes in a cpuset are moved if the allowed memory nodes of a
49 within a group of nodes for all migration techniques which will preserve a
/linux-4.1.27/arch/mips/sgi-ip27/
DKconfig9 The nodes of Origin, Onyx, Fuel and Tezro systems can be configured
10 in either N-Modes which allows for more nodes or M-Mode which allows
17 The nodes of Origin, Onyx, Fuel and Tezro systems can be configured
18 in either N-Modes which allows for more nodes or M-Mode which allows
38 nodes in a NUMA cluster. This trades memory for speed.
45 across multiple nodes in a NUMA cluster. This trades memory for
DTODO8 5. Is it okay to set calias space on all nodes as 0, instead of 8k as
11 being invoked on all nodes in ip27-memory.c.
/linux-4.1.27/Documentation/devicetree/bindings/video/
Dsimple-framebuffer.txt7 Since simplefb nodes represent runtime information they must be sub-nodes of
8 the chosen node (*). Simplefb nodes must be named "framebuffer@<address>".
10 If the devicetree contains nodes for the display hardware used by a simplefb,
14 real hardware. The bindings for the hw nodes must specify which node is
29 nodes, so that the firmware only needs to update the mode information and
31 added, the simplefb nodes will already contain this info and the firmware
34 If pre-filled framebuffer nodes are used, the firmware may need extra
86 nodes found under chosen and then check for other compatible nodes.
Dti,omap4-dss.txt17 Required nodes:
20 Optional nodes:
50 Optional nodes:
66 Optional nodes:
87 Optional nodes:
110 Optional nodes:
Dti,omap5-dss.txt17 Required nodes:
20 Optional nodes:
50 Optional nodes:
68 Optional nodes:
91 Optional nodes:
Dexynos_dsim.txt26 Child nodes:
27 Should contain DSI peripheral nodes (see MIPI DSI bindings [1]).
30 Device node can contain video interface port nodes according to [2].
31 The following are properties specific to those nodes:
Dti,dra7-dss.txt28 Required nodes:
31 Optional nodes:
64 Optional nodes:
Danalog-tv-connector.txt10 Required nodes:
Dtoppoly,td028ttec1.txt10 Required nodes:
Dsony,acx565akm.txt11 Required nodes:
Dhdmi-connector.txt12 Required nodes:
Dtpo,td043mtea1.txt11 Required nodes:
Dti,tfp410.txt10 Required nodes:
Dpanel-dsi-cm.txt12 Required nodes:
Dlgphilips,lb035q02.txt11 Required nodes:
Dti,tpd12s015.txt10 Required nodes:
Drockchip-drm.txt5 vop devices or other display interface nodes that comprise the
/linux-4.1.27/Documentation/devicetree/bindings/media/
Dexynos4-fimc-is.txt29 The following are the FIMC-IS peripheral device nodes and can be specified
30 either standalone or as the fimc-is node child nodes.
32 i2c-isp (ISP I2C bus controller) nodes
43 For the above nodes it is required to specify a pinctrl state named "default",
46 Device tree nodes of the image sensors' controlled directly by the FIMC-IS
47 firmware must be child nodes of their corresponding ISP I2C bus controller node.
Dvideo-interfaces.txt10 SoC internal blocks are described by DT nodes, placed similarly to other SoC
11 blocks. External devices are represented as child nodes of their respective
12 bus controller nodes, e.g. I2C.
14 Data interfaces on all video devices are described by their child 'port' nodes.
40 All 'port' nodes can be grouped under optional 'ports' node, which allows to
42 and 'endpoint' nodes and any child device nodes a device might have.
44 Two 'endpoint' nodes are linked with each other through their 'remote-endpoint'
47 cases properties at the peer 'endpoint' nodes will be identical, however they
63 property is present in port and/or endpoint nodes the following properties
Dsamsung-fimc.txt5 represented by separate device tree nodes. Currently this includes: FIMC (in
8 The sub-subdevices are defined as child nodes of the common 'camera' node which
46 'fimc' device nodes
96 This node should contain child 'port' nodes specifying active parallel video
98 port nodes specifies data input - 0, 1 indicates input A, B respectively.
105 Image sensor nodes
108 The sensor device nodes should be added to their control bus controller (e.g.
109 I2C0) nodes and linked to a port node in the csis or the parallel-ports node,
Dti,omap3isp.txt26 Port nodes (optional)
45 Endpoint nodes
/linux-4.1.27/drivers/gpu/drm/nouveau/nvkm/core/
Dmm.c26 #define node(root, dir) ((root)->nl_entry.dir == &mm->nodes) ? NULL : \
36 list_for_each_entry(node, &mm->nodes, nl_entry) { in nvkm_mm_dump()
244 prev = list_last_entry(&mm->nodes, typeof(*node), nl_entry); in nvkm_mm_init()
253 list_add_tail(&node->nl_entry, &mm->nodes); in nvkm_mm_init()
257 INIT_LIST_HEAD(&mm->nodes); in nvkm_mm_init()
273 list_add_tail(&node->nl_entry, &mm->nodes); in nvkm_mm_init()
283 int nodes = 0; in nvkm_mm_fini() local
288 list_for_each_entry(node, &mm->nodes, nl_entry) { in nvkm_mm_fini()
290 if (++nodes > mm->heap_nodes) { in nvkm_mm_fini()
297 list_for_each_entry_safe(node, temp, &mm->nodes, nl_entry) { in nvkm_mm_fini()
/linux-4.1.27/Documentation/devicetree/bindings/net/
Dmarvell-pxa168.txt11 - #address-cells: must be 1 when using sub-nodes.
12 - #size-cells: must be 0 when using sub-nodes.
16 Sub-nodes:
19 Sub-nodes required properties:
Dbrcm,unimac-mdio.txt22 Child nodes of this MDIO bus controller node are standard Ethernet PHY device
23 nodes as described in Documentation/devicetree/bindings/net/phy.txt
Dapm-xgene-enet.txt1 APM X-Gene SoC Ethernet nodes
3 Ethernet nodes are defined to describe on-chip ethernet interfaces in
Dmdio-mux.txt4 numbered uniquely in a device dependent manner. The nodes for an MDIO
15 Required properties for child nodes:
/linux-4.1.27/Documentation/devicetree/bindings/i2c/
Di2c-mux.txt4 numbered uniquely in a device dependent manner. The nodes for an i2c bus
12 Required properties for child nodes:
17 Optional properties for child nodes:
19 - Child nodes conforming to i2c bus binding
Di2c-versatile.txt10 - Child nodes conforming to i2c bus binding
Di2c-st-ddci2c.txt12 - Child nodes conforming to i2c bus binding
Di2c-xiic.txt11 - Child nodes conforming to i2c bus binding
Di2c-cbus-gpio.txt10 - child nodes conforming to i2c bus binding
/linux-4.1.27/Documentation/acpi/
Dscan_handlers.txt13 acpi_device objects are referred to as "device nodes" in what follows, but they
17 During ACPI-based device hot-remove device nodes representing pieces of hardware
21 initialization of device nodes, such as retrieving common configuration
42 where ids is the list of IDs of device nodes the given handler is supposed to
45 executed, respectively, after registration of new device nodes and before
46 unregistration of device nodes the handler attached to previously.
49 device nodes in the given namespace scope with the driver core. Then, it tries
66 callbacks from the scan handlers of all device nodes in the given namespace
68 nodes in that scope.
73 is the order in which they are matched against device nodes during namespace
/linux-4.1.27/Documentation/devicetree/bindings/pwm/
Dpwm-tipwmss.txt6 - address-cells: Specify the number of u32 entries needed in child nodes.
8 - size-cells: specify number of u32 entries needed to specify child nodes size
16 Also child nodes should also populated under PWMSS DT node.
30 /* child nodes go here */
Dpwm.txt4 1) PWM user nodes
57 2) PWM controller nodes
60 PWM controller nodes must specify the number of cells used for the
/linux-4.1.27/Documentation/devicetree/bindings/
Dgraph.txt10 There already is a simple directed graph between devices tree nodes using
11 phandle properties pointing to other nodes to describe connections that
30 Ports are described by child 'port' nodes contained in the device node.
37 and 'reg' properties is used number the nodes.
66 All 'port' nodes can be grouped under an optional 'ports' node, which
68 nodes independently from any other child device nodes a device might
118 property is present in port and/or endpoint nodes the following properties
Dmarvell.txt6 system. In this section, we define device tree nodes to describe
47 The system-controller node contains child nodes for each system
70 2) Child nodes of /system-controller
100 of nodes. The first level describes an ethernet silicon block
101 and the second level describes up to 3 ethernet nodes within
105 shared register set, and the "ethernet" nodes describe ethernet
155 c) Marvell Discovery PHY nodes
172 d) Marvell Discovery SDMA nodes
195 e) Marvell Discovery BRG nodes
222 f) Marvell Discovery CUNIT nodes
[all …]
Dunittest.txt23 Children nodes contain unittest i2c devices.
53 Children nodes contain unittest i2c bus nodes per channel.
/linux-4.1.27/Documentation/
Dmd-cluster.txt45 Each node has to communicate with other nodes when starting or ending
52 3.1.1 METADATA_UPDATED: informs other nodes that the metadata has been
56 3.1.2 RESYNC: informs other nodes that a resync is initiated or ended
61 The DLM LVB is used to communicate within nodes of the cluster. There
72 acknowledged by all nodes in the cluster. The BAST of the resource
137 environment when a resync is performed, it needs to tell other nodes
144 to other nodes and other nodes remove the corresponding entry from
155 For adding a new device, it is necessary that all nodes "see" the new device
161 3. Other nodes issue kobject_uevent_env with uuid and slot number
165 5. Other nodes issue either of the following depending on whether the disk
[all …]
Dassoc_array.txt19 - Splitting and collapsing nodes.
66 The implementation uses a tree of 16-pointer nodes internally that are indexed
69 what would otherwise be a series of single-occupancy nodes. Further, nodes
285 to reduce the number of nodes in it.
357 Poor scattering isn't too much of a problem as there are shortcuts and nodes
372 constructed of two types of metadata blocks: nodes and shortcuts.
388 Ignoring shortcuts for the moment, the nodes form a multilevel tree. The index
389 key space is strictly subdivided by the nodes in the tree and nodes occur on
422 In the above example, there are 7 nodes (A-G), each with 16 slots (0-f).
423 Assuming no other meta data nodes in the tree, the key space is divided thusly:
[all …]
Drbtree.txt12 to insert/access/delete nodes) and hash tables (which are not kept sorted to
59 Data nodes in an rbtree tree are structures containing a struct rb_node member:
180 NULL when there are no more nodes left.
198 the contents of all nodes in the subtree rooted at N. This data can
203 and erasing nodes.
258 (max_hi) value among all the nodes that are its descendants. This
281 * Some nodes in left subtree satisfy Cond2.
285 * matching interval as nodes to the right of N
/linux-4.1.27/Documentation/devicetree/bindings/clock/
Dst,nomadik.txt23 PLL nodes: these nodes represent the two PLLs on the system,
27 Required properties for the two PLL nodes:
34 HCLK nodes: these represent the clock gates on individual
38 Requires properties for the HCLK nodes:
Dclock-bindings.txt5 tree. Those nodes are designated as clock providers. Clock consumer
6 nodes use a phandle and clock specifier pair to connect clock provider
17 #clock-cells: Number of cells in a clock specifier; Typically 0 for nodes
18 with a single clock output and 1 for nodes with multiple
32 Clock consumer nodes must never directly reference
43 "ckil" and the second named "ckih". Consumer nodes always reference
76 clock-ranges: Empty property indicating that child nodes can inherit named
77 clocks from this node. Useful for bus nodes to provide a
165 conflicting parent or rate configuration in multiple consumer nodes for
Dexynos3250-clock.txt20 Each clock is assigned an identifier and client nodes can use this identifier
27 Example 1: Examples of clock controller nodes are listed below.
/linux-4.1.27/Documentation/devicetree/bindings/iio/
Diio-bindings.txt5 tree. Those nodes are designated as IIO providers. IIO consumer
6 nodes use a phandle and IIO specifier pair to connect IIO provider
17 #io-channel-cells: Number of cells in an IIO specifier; Typically 0 for nodes
18 with a single IIO output and 1 for nodes with multiple
60 Empty property indicating that child nodes can inherit named
61 IIO channels from this node. Useful for bus nodes to provide
/linux-4.1.27/Documentation/dvb/
Dudev.txt9 DVB device nodes are created automatically.
12 creating the DVB device nodes manually up to now due to the missing sysfs
16 device nodes manually.
31 1. You need to create a proper udev rule that will create the device nodes
41 If you want more control over the device nodes (for example a special group membership)
/linux-4.1.27/Documentation/x86/x86_64/
Dfake-numa-for-cpusets6 you can create fake NUMA nodes that represent contiguous chunks of memory and
14 configuring fake nodes, see Documentation/x86/x86_64/boot-options.txt.
20 you'll determine a better setup to minimize the number of nodes you have to deal
36 Documentation/cgroups/cpusets.txt, you can assign fake nodes (i.e. contiguous memory
46 Now this cpuset, 'ddset', will only allowed access to fake nodes 0 and 1 for
50 available to them according to the fake nodes assigned as mems:
/linux-4.1.27/sound/hda/
Dhdac_sysfs.c15 struct kobject **nodes; member
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()
367 tree->nodes = kcalloc(codec->num_nodes + 1, sizeof(*tree->nodes), in widget_tree_create()
369 if (!tree->nodes) in widget_tree_create()
374 &tree->nodes[i]); in widget_tree_create()
/linux-4.1.27/arch/arm/boot/dts/
Ds3c6400.dtsi6 * Samsung's S3C6400 SoC device nodes are listed in this file. S3C6400
10 * Note: This file does not include device nodes for all the controllers in
12 * nodes can be added to this file.
Dexynos4212.dtsi7 * Samsung's Exynos4212 SoC device nodes are listed in this file. Exynos4212
11 * Note: This file does not include device nodes for all the controllers in
13 * nodes can be added to this file.
Ds3c6410.dtsi6 * Samsung's S3C6410 SoC device nodes are listed in this file. S3C6410
10 * Note: This file does not include device nodes for all the controllers in
12 * nodes can be added to this file.
Dexynos4412.dtsi7 * Samsung's Exynos4412 SoC device nodes are listed in this file. Exynos4412
11 * Note: This file does not include device nodes for all the controllers in
13 * nodes can be added to this file.
Ds3c64xx.dtsi6 * Samsung's S3C64xx SoC series device nodes are listed in this file.
10 * Note: This file does not include device nodes for all the controllers in
12 * nodes can be added to this file.
Dexynos4210.dtsi9 * Samsung's Exynos4210 SoC device nodes are listed in this file. Exynos4210
13 * Note: This file does not include device nodes for all the controllers in
15 * nodes can be added to this file.
/linux-4.1.27/Documentation/devicetree/bindings/spmi/
Dspmi.txt4 controller is modelled in device tree as a node with zero or more child nodes,
11 Child nodes:
13 An SPMI controller node can contain zero or more child nodes representing slave
/linux-4.1.27/Documentation/filesystems/
Dceph.txt10 * Seamless scaling from 1 to many thousands of nodes
12 * N-way replication of data across storage nodes
25 storage nodes run entirely as user space daemons. Storage nodes
28 across storage nodes in large chunks to distribute workload and
29 facilitate high throughputs. When storage nodes fail, data is
30 re-replicated in a distributed fashion by the storage nodes themselves
47 from a small cluster of just a few nodes to many hundreds, without
50 When the file system approaches full, new nodes can be easily added
/linux-4.1.27/Documentation/devicetree/bindings/ata/
Dahci-platform.txt3 SATA nodes are defined to describe on-chip Serial ATA controllers.
38 Required properties when using sub-nodes:
43 Sub-nodes required properties:
64 With sub-nodes:
Dfsl-sata.txt1 * Freescale 8xxx/3.0 Gb/s SATA nodes
3 SATA nodes are defined to describe on-chip Serial ATA controllers.
Dapm-xgene.txt1 * APM X-Gene 6.0 Gb/s SATA host controller nodes
3 SATA host controller nodes are defined to describe on-chip Serial ATA
/linux-4.1.27/fs/btrfs/tests/
Dqgroup-tests.c66 leaf = path->nodes[0]; in insert_normal_tree_ref()
116 item = btrfs_item_ptr(path->nodes[0], path->slots[0], in add_tree_ref()
118 refs = btrfs_extent_refs(path->nodes[0], item); in add_tree_ref()
119 btrfs_set_extent_refs(path->nodes[0], item, refs + 1); in add_tree_ref()
200 item = btrfs_item_ptr(path->nodes[0], path->slots[0], in remove_extent_ref()
202 refs = btrfs_extent_refs(path->nodes[0], item); in remove_extent_ref()
203 btrfs_set_extent_refs(path->nodes[0], item, refs - 1); in remove_extent_ref()
/linux-4.1.27/fs/jffs2/
DREADME.Locking22 When writing new nodes, the alloc_sem must be held until the new nodes
25 nodes to an inode may obsolete old ones, and by holding the alloc_sem
28 was written afterwards. Hence, we can ensure the newly-obsoleted nodes
76 (NB) the per-inode list of physical nodes. The latter is a special
84 Note that the per-inode list of physical nodes (f->nodes) is a special
85 case. Any changes to _valid_ nodes (i.e. ->flash_offset & 1 == 0) in
87 may remove _obsolete_ nodes from the list while holding only the
126 The latter function on NAND flash must read _obsolete_ nodes to
DTODO24 By writing _new_ nodes to one block, and garbage-collected REF_PRISTINE
25 nodes to a different one, we can separate clean nodes from those which
/linux-4.1.27/Documentation/devicetree/bindings/phy/
Dphy-miphy365x.txt14 Required nodes : A sub-node is required for each channel the controller
17 nodes to describe the controller's topology. These nodes
66 Device nodes should specify the configuration required in their "phys"
Dberlin-sata-phy.txt14 Sub-nodes:
17 Sub-nodes required properties:
Drockchip-usb-phy.txt10 Sub-nodes:
13 Sub-nodes
Dphy-miphy28lp.txt12 Required nodes : A sub-node is required for each channel the controller
15 nodes to describe the controller's topology. These nodes
104 Device nodes should specify the configuration required in their "phys"
/linux-4.1.27/Documentation/devicetree/bindings/power/
Drenesas,sysc-rmobile.txt22 Optional nodes:
23 - pm-domains: This node contains a hierarchy of PM domain nodes, which should
30 Each of the PM domain nodes represents a PM domain, as documented by the
34 The nodes should be named by the real power area names, and thus their names
Dpower_domain.txt18 Typically 0 for nodes representing a single PM domain and 1 for nodes
58 The nodes above define two power controllers: 'parent' and 'child'.
/linux-4.1.27/fs/dlm/
Dmember.c523 if (rv->nodes[i].nodeid == nodeid) in find_config_node()
524 return &rv->nodes[i]; in find_config_node()
567 node = &rv->nodes[i]; in dlm_recover_members()
677 struct dlm_config_node *nodes; in dlm_ls_start() local
684 error = dlm_config_nodes(ls->ls_name, &nodes, &count); in dlm_ls_start()
699 rv->nodes = nodes; in dlm_ls_start()
709 kfree(rv_old->nodes); in dlm_ls_start()
719 kfree(nodes); in dlm_ls_start()
/linux-4.1.27/Documentation/devicetree/bindings/pci/
Dralink,rt3883-pci.txt26 2) Child nodes
28 The main node must have two child nodes which describes the built-in
38 address. The value must be 0. As such, 'interrupt-map' nodes do not
74 The PCI host bridge node migh have additional sub-nodes representing
96 Besides the required properties the sub-nodes may have these optional
/linux-4.1.27/Documentation/devicetree/bindings/bus/
Domap-ocp2scp.txt7 - #address-cells, #size-cells : Must be present if the device has sub-nodes
11 Sub-nodes:
Dti-gpmc.txt3 The actual devices are instantiated from the child nodes of a GPMC node.
36 Timing properties for child nodes. All are optional and default to 0.
92 GPMC chip-select settings properties for child nodes. All are optional.
129 /* child nodes go here */
/linux-4.1.27/Documentation/devicetree/bindings/powerpc/fsl/
Dmpc5200.txt66 soc child nodes
68 Any on chip SOC devices available to Linux must appear as soc5200 child nodes.
73 Required soc5200 child nodes:
81 Recommended soc5200 child nodes; populate as needed for your board
102 fsl,mpc5200-gpt nodes
138 fsl,mpc5200-psc nodes
151 fsl,mpc5200-gpio and fsl,mpc5200-gpio-wkup nodes
158 fsl,mpc5200-fec nodes
179 The interrupts property for device nodes using the mpc5200 pic consists
196 fsl,mpc5200-mscan nodes
Dmpc5121-psc.txt7 are specified by fsl,mpc5121-psc-uart nodes in the
11 fsl,mpc5121-psc-uart nodes
Draideng.txt1 * Freescale 85xx RAID Engine nodes
3 RAID Engine nodes are defined to describe on-chip RAID accelerators. Each RAID
/linux-4.1.27/fs/ubifs/
Dgc.c256 list_for_each_entry_safe(snod, tmp, &sleb->nodes, list) { in sort_nodes()
298 list_sort(c, &sleb->nodes, &data_nodes_cmp); in sort_nodes()
301 err = dbg_check_data_nodes_order(c, &sleb->nodes); in sort_nodes()
375 list_for_each_entry_safe(snod, tmp, &sleb->nodes, list) { in move_nodes()
414 if (list_empty(&sleb->nodes) && list_empty(&nondata)) in move_nodes()
429 list_splice_tail(&nondata, &sleb->nodes); in move_nodes()
520 ubifs_assert(!list_empty(&sleb->nodes)); in ubifs_garbage_collect_leb()
521 snod = list_entry(sleb->nodes.next, struct ubifs_scan_node, list); in ubifs_garbage_collect_leb()
528 list_for_each_entry(snod, &sleb->nodes, list) { in ubifs_garbage_collect_leb()
Dscan.c150 INIT_LIST_HEAD(&sleb->nodes); in ubifs_start_scan()
226 list_add_tail(&snod->list, &sleb->nodes); in ubifs_add_snod()
372 head = &sleb->nodes; in ubifs_scan_destroy()
/linux-4.1.27/arch/x86/kernel/apic/
Dapic_numachip.c161 u32 nodes = 1; in fixup_cpu_id() local
168 nodes = ((val >> 3) & 7) + 1; in fixup_cpu_id()
171 c->phys_proc_id = node / nodes; in fixup_cpu_id()
/linux-4.1.27/Documentation/devicetree/bindings/sound/
Dimx-audmux.txt11 An initial configuration can be setup using child nodes.
13 Required properties of optional child nodes:
/linux-4.1.27/Documentation/devicetree/bindings/regulator/
Dmax8925-regulator.txt3 Required nodes:
4 -nodes:
Dtps65217.txt8 - regulators: This is the list of child nodes that specify the regulator
10 device need to be present. The definition for each of these nodes is defined
Dlp872x.txt32 Sub nodes for regulator_init_data
33 LP8720 has maximum 6 nodes. (child name: ldo1 ~ 5 and buck)
34 LP8725 has maximum 9 nodes. (child name: ldo1 ~ 5, lilo1,2 and buck1,2)
Das3722-regulator.txt21 Optional nodes:
26 description of standard properties for these sub-nodes.
Dpalmas-pmic.txt21 Optional nodes:
25 description of standard properties for these sub-nodes.
Dltc3589.txt8 - regulators: Contains eight regulator child nodes sw1, sw2, sw3, bb-out,
13 nodes for sw1, sw2, sw3, bb-out, ldo1, and ldo2 additionally need to specify
/linux-4.1.27/Documentation/devicetree/bindings/powerpc/4xx/
Dppc440spe-adma.txt3 Device nodes needed for operation of the ppc440spe-adma driver
4 are specified hereby. These are I2O/DMA, DMA and XOR nodes
7 the PPC440SPe. In addition to the nodes and properties described
/linux-4.1.27/Documentation/devicetree/bindings/net/dsa/
Ddsa.txt17 A DSA node can contain multiple switch chips which are therefore child nodes of
18 the parent DSA node. The maximum number of allowed child nodes is 4
20 Each of these switch child nodes should have the following required properties:
35 A switch may have multiple "port" children nodes
/linux-4.1.27/Documentation/misc-devices/
Dspear-pcie-gadget.txt23 This driver has several nodes which can be read/written by configfs interface.
28 Description of different nodes:
31 read behavior of nodes:
44 write behavior of nodes:
71 Now you have all the nodes in this directory.
/linux-4.1.27/Documentation/devicetree/
Dof_unittest.txt72 a particular level the child node and all the sibling nodes will have a parent
114 attach_node_and_children() uses of_attach_node() to attach the nodes into the
130 required to attach the root('/') node. All other nodes are attached by calling
190 order to remove the device nodes attached initially (first the leaf nodes are
191 detached and then moving up the parent nodes are removed, and eventually the
193 of_detach_node() to detach the nodes from the live device tree.
Dusage-model.txt19 Structurally, the DT is a tree, or acyclic graph with named nodes, and
20 nodes may have an arbitrary number of named properties encapsulating
32 or create new ones by defining new nodes and properties. Be wary,
250 platform devices roughly correspond to device nodes at the root of the
251 tree and children of simple memory mapped bus nodes.
319 this DT and decide which nodes to create platform_devices for.
322 at all. The /chosen, /aliases, and /memory nodes are informational
323 nodes that don't describe devices (although arguably memory could be
332 for nodes that have a 'compatible' property. First, it is generally
337 For each of these nodes, Linux allocates and registers a
[all …]
Dtodo.txt4 - Switch from custom lists to (h)list_head for nodes and properties structure
Dbooting-without-of.txt31 5) Required nodes and properties
34 c) The /cpus/* nodes
43 VI - System-on-a-chip devices and nodes
44 1) Defining child nodes of an SOC
79 linux,phandle is made optional, only nodes
80 that are referenced by other nodes need it.
140 to represent every device in the system and only requires some nodes
146 recommended to define nodes for on chip devices and other buses that
515 required types of nodes & properties for the kernel, this is done
520 nodes, each node having two or more named properties. A property can
[all …]
/linux-4.1.27/Documentation/devicetree/bindings/soc/qcom/
Dqcom,gsbi.txt3 The GSBI controller is modeled as a node with zero or more child nodes, each
30 A GSBI controller node can contain 0 or more child nodes representing serial
57 /* child nodes go under here */
/linux-4.1.27/Documentation/devicetree/bindings/mfd/
Dda9052-i2c.txt7 Sub-nodes:
8 - regulators : Contain the regulator nodes. The DA9052/53 regulators are
Ds2mpa01.txt20 Optional nodes:
22 included in a sub-node named 'regulators'. Regulator nodes and constraints
26 Properties for BUCK regulator nodes:
Ds2mps11.txt19 Optional nodes:
29 is assigned an identifier and client nodes use this identifier to specify
41 included in a sub-node named 'regulators'. Regulator nodes included in this
74 The regulator constraints inside the regulator nodes use the standard regulator
Dtwl-familly.txt22 - Child nodes contain in the twl. The twl family is made of several variants
24 The children nodes will thus depend of the capability of the variant.
Dmax14577.txt17 Required nodes:
41 Optional nodes:
55 properties for these sub-nodes.
Das3722.txt51 different nodes of pin control settings. These nodes represents
53 nodes contains different subnodes to represents some desired
100 Optional sub nodes for regulators:
107 of standard properties for these sub-nodes.
Dda9055.txt31 Sub-nodes:
32 - regulators : Contain the regulator nodes. The DA9055 regulators are
Dmc13xxx.txt12 Sub-nodes:
16 - leds : Contain the led nodes and initial register values in property
25 - regulators : Contain the regulator nodes. The regulators are bound using
Dqcom,spmi-pmic.txt37 Required properties for peripheral child nodes:
40 Optional properties for peripheral child nodes:
Dtps6507x.txt6 - regulators: This is the list of child nodes that specify the regulator
8 given device need to be present. The definition for each of these nodes
Dsky81452.txt7 Required child nodes:
/linux-4.1.27/Documentation/devicetree/bindings/arm/exynos/
Dsmp-sysram.txt8 Therefore reserved section sub-nodes have to be added to the mmio-sram
9 declaration. These nodes are of two types depending upon secure or
/linux-4.1.27/Documentation/devicetree/bindings/dma/
Dmv-xor.txt10 The DT node must also contains sub-nodes for each XOR channel that the
11 XOR engine has. Those sub-nodes have the following required
Dapm-xgene-dma.txt1 Applied Micro X-Gene SoC DMA nodes
3 DMA nodes are defined to describe on-chip DMA interfaces in
/linux-4.1.27/Documentation/devicetree/bindings/usb/
Dkeystone-usb.txt7 - #address-cells, #size-cells : should be '1' if the device has sub-nodes
18 Sub-nodes:
Ddwc3-st.txt19 - #address-cells, #size-cells : should be '1' if the device has sub-nodes
31 Sub-nodes:
/linux-4.1.27/Documentation/devicetree/bindings/thermal/
Dthermal.txt14 There are five types of nodes involved to describe thermal bindings:
27 Thermal sensor devices are nodes providing temperature sensing capabilities on
29 nodes providing temperature data to thermal zones. Thermal sensor devices may
35 Size: one cell nodes with only one sensor, and at least 1 on nodes
41 * Cooling device nodes
43 Cooling devices are nodes providing control on power dissipation. There
130 * Thermal zone nodes
135 containing trip nodes and one sub-node containing all the zone cooling maps.
151 - trips: A sub-node which is a container of only trip point nodes
155 Type: sub-node map nodes, used to describe the relation between trips
[all …]
/linux-4.1.27/Documentation/devicetree/bindings/gpio/
D8xxx_gpio.txt13 interrupt client nodes section) for details how to specify this GPIO
18 nodes section in bindings/interrupt-controller/interrupts.txt for
45 Example of gpio-controller nodes for a MPC8347 SoC:
Dgpio-tz1090.txt21 nodes should have the following values.
42 client nodes should have the following values.
/linux-4.1.27/Documentation/devicetree/bindings/misc/
Dsram.txt28 Required properties in the area nodes:
32 Optional properties in the area nodes:
/linux-4.1.27/Documentation/devicetree/bindings/mtd/
Dsunxi-nand.txt14 Optional children nodes:
15 Children nodes represent the available nand chips.
Dgpio-control-nand.txt12 - #address-cells, #size-cells : Must be present if the device has sub-nodes
28 The device tree may optionally contain sub-nodes describing partitions of the
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/drm/atmel/
Dhlcdc-dc.txt13 Required children nodes:
14 Children nodes are encoding available output ports and their connections
/linux-4.1.27/Documentation/ABI/stable/
Dfirewire-cdev15 be remote or local nodes. Operations on a /dev/fw* file have
40 nodes' Configuration ROM
47 nodes' Configuration ROM
97 nodes' Configuration ROM. Deallocate isochronous channels and
/linux-4.1.27/include/trace/events/
Dbcache.h275 TP_PROTO(unsigned nodes),
276 TP_ARGS(nodes),
279 __field(unsigned, nodes )
283 __entry->nodes = nodes;
286 TP_printk("coalesced %u nodes", __entry->nodes)
/linux-4.1.27/Documentation/devicetree/bindings/hwmon/
Dads1015.txt43 The node contains child nodes for each channel that the platform uses.
56 2) channel nodes
/linux-4.1.27/Documentation/devicetree/bindings/powerpc/fsl/cpm_qe/qe/
Dpar_io.txt6 See the definition of the Pin configuration nodes below for more
25 Note that "par_io" nodes are obsolete, and should not be used for
/linux-4.1.27/tools/perf/bench/
Dnuma.c819 int nodes; in count_process_nodes() local
837 nodes = 0; in count_process_nodes()
840 nodes += node_present[n]; in count_process_nodes()
842 return nodes; in count_process_nodes()
886 unsigned int nodes = count_process_nodes(p); in calc_convergence_compression() local
888 if (!nodes) { in calc_convergence_compression()
893 nodes_min = min(nodes, nodes_min); in calc_convergence_compression()
894 nodes_max = max(nodes, nodes_max); in calc_convergence_compression()
910 int nodes[MAX_NR_NODES]; in calc_convergence() local
925 nodes[node] = 0; in calc_convergence()
[all …]
/linux-4.1.27/Documentation/blockdev/drbd/
Ddata-structure-v9.txt8 devices (aka volumes) and connections to other nodes ("peer nodes"). Each DRBD
/linux-4.1.27/Documentation/devicetree/bindings/reserved-memory/
Dreserved-memory.txt5 one can create child nodes describing particular reserved (excluded from
10 with the following nodes:
19 /reserved-memory/ child nodes
74 nodes by adding a memory-region property to the device node.
/linux-4.1.27/Documentation/devicetree/bindings/interrupt-controller/
Dinterrupts.txt4 1) Interrupt client nodes
22 interrupt client node or in any of its parent nodes. Interrupts listed in the
33 2) Interrupt controller nodes
/linux-4.1.27/Documentation/devicetree/bindings/spi/
Dspi-samsung.txt43 SPI Controller specific data in SPI slave nodes:
45 - The spi slave nodes should provide the following information which is required
59 - All the SPI controller nodes should be represented in the aliases node using
Dspi_pl022.txt11 The gpios will be referred to as reg = <index> in the SPI child nodes.
26 SPI slave nodes must be children of the SPI master node and can
/linux-4.1.27/Documentation/devicetree/bindings/mmc/
Datmel-hsmci.txt20 The node contains child nodes for each slot that the platform uses
36 2) slot nodes
/linux-4.1.27/Documentation/devicetree/bindings/net/can/
Dmpc5xxx-mscan.txt7 fsl,mpc5200-mscan nodes
18 fsl,mpc5121-mscan nodes
/linux-4.1.27/Documentation/devicetree/bindings/arm/omap/
Dctrl.txt5 described in [1]. Typically some clock nodes are also under control module.
9 See [2] for documentation about clock/clockdomain nodes.
/linux-4.1.27/drivers/base/regmap/
Dregcache-rbtree.c145 int nodes = 0; in rbtree_show() local
164 nodes++; in rbtree_show()
168 if (nodes) in rbtree_show()
169 average = registers / nodes; in rbtree_show()
174 nodes, registers, average, mem_size); in rbtree_show()
/linux-4.1.27/arch/powerpc/oprofile/cell/
Dspu_task_sync.c451 int nodes = 0; in number_of_online_nodes() local
454 if (tmp > nodes) in number_of_online_nodes()
455 nodes++; in number_of_online_nodes()
457 return nodes; in number_of_online_nodes()
/linux-4.1.27/drivers/staging/board/
DTODO1 * replace platform device code with DT nodes once the driver supports DT
/linux-4.1.27/Documentation/ABI/testing/
Dsysfs-kernel-mm-ksm49 Description: Control merging pages across different NUMA nodes.
52 otherwise pages from all nodes can be merged together (default).
/linux-4.1.27/arch/x86/kernel/cpu/
Damd.c294 u32 nodes, cores_per_cu = 1; in amd_get_topology() local
303 nodes = ((ecx >> 8) & 7) + 1; in amd_get_topology()
314 nodes = ((value >> 3) & 7) + 1; in amd_get_topology()
320 if (nodes > 1) { in amd_get_topology()
325 cores_per_node = c->x86_max_cores / nodes; in amd_get_topology()
/linux-4.1.27/Documentation/blockdev/
Dzram.txt12 Statistics for individual zram devices are exported through sysfs nodes at
101 Per-device statistics are exported as various nodes under /sys/block/zram<id>/
135 -- the existing RW nodes will be downgraded to WO nodes (in linux 4.11)
136 -- deprecated RO sysfs nodes will eventually be removed (in linux 4.11)
/linux-4.1.27/Documentation/devicetree/bindings/drm/imx/
Dfsl-imx-drm.txt5 IPU or other display interface nodes that comprise the graphics subsystem.
32 - port@[0-3]: Port nodes with endpoint definitions as defined in
/linux-4.1.27/Documentation/devicetree/bindings/arm/tegra/
Dnvidia,tegra20-emc.txt9 - nvidia,use-ram-code : If present, the sub-nodes will be addressed
14 Child device nodes describe the memory settings for different configurations and clock rates.
29 next level of nodes below the emc table are used to specify which settings
/linux-4.1.27/Documentation/devicetree/bindings/memory-controllers/
Dti-aemif.txt50 - clock-ranges: Empty property indicating that child nodes can inherit
56 Child chip-select (cs) nodes contain the memory devices nodes connected to
66 - ranges: Empty property indicating that child nodes can inherit
69 - clock-ranges: Empty property indicating that child nodes can inherit
/linux-4.1.27/Documentation/arm64/
Dlegacy_instructions.txt7 The emulation mode can be controlled by writing to sysctl nodes
9 behaviours and the corresponding values of the sysctl nodes -
/linux-4.1.27/net/xfrm/
DKconfig40 where mobile nodes change their attachment point to the Internet.
79 environment with IPsec configuration where mobile nodes
/linux-4.1.27/Documentation/arm/
DCCN.txt6 so nodes (devices) 0 and 1 are connected to crosspoint 0,
7 nodes 2 and 3 to crosspoint 1 etc.
/linux-4.1.27/Documentation/devicetree/bindings/c6x/
Dsoc.txt15 - nodes for IP blocks within SoC
/linux-4.1.27/drivers/md/bcache/
Dbtree.c1253 gc->nodes++; in btree_gc_mark_node()
1300 unsigned i, nodes = 0, keys = 0, blocks; in btree_gc_coalesce() local
1314 while (nodes < GC_MERGE_NODES && !IS_ERR_OR_NULL(r[nodes].b)) in btree_gc_coalesce()
1315 keys += r[nodes++].keys; in btree_gc_coalesce()
1319 if (nodes < 2 || in btree_gc_coalesce()
1321 block_bytes(b->c)) > blocks * (nodes - 1)) in btree_gc_coalesce()
1324 for (i = 0; i < nodes; i++) { in btree_gc_coalesce()
1339 for (i = 0; i < nodes; i++) in btree_gc_coalesce()
1342 for (i = nodes - 1; i > 0; --i) { in btree_gc_coalesce()
1408 for (i = 0; i < nodes; i++) in btree_gc_coalesce()
[all …]
/linux-4.1.27/drivers/staging/rtl8188eu/include/
Drtw_event.h103 struct event_node nodes[C2HEVENT_SZ]; member
/linux-4.1.27/drivers/hwmon/
Dapplesmc.c117 struct applesmc_dev_attr *nodes; /* dynamic node array */ member
1092 for (grp = groups; grp->nodes; grp++) { in applesmc_destroy_nodes()
1093 for (node = grp->nodes; node->sda.dev_attr.attr.name; node++) in applesmc_destroy_nodes()
1096 kfree(grp->nodes); in applesmc_destroy_nodes()
1097 grp->nodes = NULL; in applesmc_destroy_nodes()
1112 grp->nodes = kcalloc(num + 1, sizeof(*node), GFP_KERNEL); in applesmc_create_nodes()
1113 if (!grp->nodes) { in applesmc_create_nodes()
1118 node = &grp->nodes[i]; in applesmc_create_nodes()
/linux-4.1.27/drivers/staging/rtl8712/
Drtl871x_event.h100 struct event_node nodes[C2HEVENT_SZ]; member
/linux-4.1.27/Documentation/devicetree/bindings/metag/
Dmeta-intc.txt22 'interrupt-map' nodes do not have to specify a parent unit address.
50 // No address cells so that 'interrupt-map' nodes which
/linux-4.1.27/Documentation/devicetree/bindings/lpddr2/
Dlpddr2.txt34 Child nodes:
35 - The lpddr2 node may have one or more child nodes of type "lpddr2-timings".
/linux-4.1.27/Documentation/devicetree/bindings/leds/
Dcommon.txt11 by child nodes of the parent LED device binding.
13 Optional properties for child nodes:
/linux-4.1.27/Documentation/devicetree/bindings/arm/bcm/
Dbrcm,brcmstb.txt16 Further, syscon nodes that map platform-specific registers used for general
46 Lastly, nodes that allow for support of SMP initialization and reboot are
/linux-4.1.27/net/decnet/netfilter/
DKconfig14 unless you just want to monitor routing messages from other nodes.
/linux-4.1.27/Documentation/video4linux/
Dfimc.txt88 At the capture and mem-to-mem video nodes only the multi-planar API is
125 5. Device mapping to video and subdev device nodes
128 There are associated two video device nodes with each device instance in
138 (note that udev, if present, might still have rearranged the video nodes),
/linux-4.1.27/drivers/md/
Dmd-cluster.h12 int (*join)(struct mddev *mddev, int nodes);
/linux-4.1.27/drivers/target/sbp/
DKconfig6 This enables you to expose SCSI devices to other nodes on the FireWire
/linux-4.1.27/drivers/net/wireless/ath/ath9k/
Ddynack.c90 list_for_each_entry(an, &da->nodes, list) in ath_dynack_compute_ackto()
289 list_add_tail(&an->list, &da->nodes); in ath_dynack_node_init()
348 INIT_LIST_HEAD(&da->nodes); in ath_dynack_init()
/linux-4.1.27/drivers/gpu/drm/nouveau/include/nvkm/core/
Dmm.h20 struct list_head nodes; member
/linux-4.1.27/Documentation/xtensa/
Dmmu.txt50 for details on the syntax and semantic of simple-bus nodes. The following
53 1. Only top level simple-bus nodes are considered
/linux-4.1.27/kernel/power/
Dsnapshot.c287 struct list_head nodes; /* Radix Tree inner nodes */ member
376 &zone->nodes); in add_rtree_block()
399 &zone->nodes); in add_rtree_block()
441 INIT_LIST_HEAD(&zone->nodes); in create_zone_bm_rtree()
469 list_for_each_entry(node, &zone->nodes, list) in free_zone_bm_rtree()
1043 unsigned int rtree, nodes; in snapshot_additional_pages() local
1045 rtree = nodes = DIV_ROUND_UP(zone->spanned_pages, BM_BITS_PER_BLOCK); in snapshot_additional_pages()
1048 while (nodes > 1) { in snapshot_additional_pages()
1049 nodes = DIV_ROUND_UP(nodes, BM_ENTRIES_PER_LEVEL); in snapshot_additional_pages()
1050 rtree += nodes; in snapshot_additional_pages()

1234