| /linux/include/linux/ |
| H A D | srcutree.h | 4 * tree variant.
53 * Node in SRCU combining tree, similar in function to rcu_data.
61 struct srcu_node *srcu_parent; /* Next up in tree. */
70 struct srcu_node *node; /* Combining tree. */
114 #define SRCU_SIZE_SMALL 0 // No srcu_node combining tree, ->node == NULL
115 #define SRCU_SIZE_ALLOC 1 // An srcu_node tree is being allocated, initialized,
117 #define SRCU_SIZE_WAIT_BARRIER 2 // The srcu_node tree starts being used by everything
120 // are aware of this tree's existence.
121 #define SRCU_SIZE_WAIT_CALL 3 // The srcu_node tree starts being used by call_srcu().
130 #define SRCU_SIZE_BIG 8 // The srcu_node combining tree i
[all...] |
| /linux/drivers/acpi/acpica/ |
| H A D | pswalk.c | 4 * Module Name: pswalk - Parser routines to walk parsed op tree(s)
21 * PARAMETERS: subtree_root - Root of tree (or subtree) to delete
25 * DESCRIPTION: Delete a portion of or an entire parse tree.
50 /* This debug option will print the entire parse tree */ in acpi_ps_delete_parse_tree()
75 /* Still going downward in tree (Op is not completed yet) */ in acpi_ps_delete_parse_tree()
|
| /linux/drivers/firewire/ |
| H A D | core-topology.c | 52 * setting the gap count. As we build the tree bottom up in
59 * contained in a child tree, in which case the max hop count is just
92 * This function builds the tree representation of the topology given
94 * of the tree, the function checks that the self IDs are valid and
339 struct fw_node *tree; in move_tree() local
342 tree = node1->ports[port]; in move_tree()
343 node0->ports[port] = tree; in move_tree()
344 for (i = 0; i < tree->port_count; i++) { in move_tree()
345 if (tree->ports[i] == node1) { in move_tree()
346 tree in move_tree()
[all...] |
| /linux/drivers/gpu/drm/i915/ |
| H A D | i915_active.c | 143 ref->cache = fetch_node(ref->tree.rb_node); in __active_retire()
147 /* Discard all other nodes in the tree */ in __active_retire()
148 rb_erase(&ref->cache->node, &ref->tree); in __active_retire()
149 root = ref->tree; in __active_retire()
151 /* Rebuild the tree with only the cached node */ in __active_retire()
152 rb_link_node(&ref->cache->node, NULL, &ref->tree.rb_node); in __active_retire()
153 rb_insert_color(&ref->cache->node, &ref->tree); in __active_retire()
154 GEM_BUG_ON(ref->tree.rb_node != &ref->cache->node); in __active_retire()
169 /* Finally free the discarded timeline tree */ in __active_retire()
269 /* While active, the tree ca in __active_lookup()
[all...] |
| H A D | i915_syncmap.c | 39 * the root. This allows us to access the whole tree via a single pointer
59 * will build a tree like:
163 /* First climb the tree back to a parent branch */ in i915_syncmap_is_later()
243 /* Climb back up the tree until we find a common prefix */ in __sync_set()
255 * No shortcut, we have to descend the tree to find the right layer in __sync_set()
258 * Each layer in the tree holds 16 (KSYNCMAP) pointers, either fences in __sync_set()
265 * into the tree, and a new leaf node for the target as a descendent in __sync_set()
269 * of the tree. If it has height 0, we have found our leaf and just in __sync_set()
271 * not zero, our slot contains the next layer in the tree (unless in __sync_set()
273 * As descend the tree th in __sync_set()
[all...] |
| /linux/mm/ |
| H A D | shmem_quota.c | 13 * an rb tree which root is stored in mem_dqinfo->dqi_priv for each quota
91 * Free all the quota_id entries in the rb tree and rb_root.
214 /* Load the stored limits from the tree */ in shmem_acquire_dquot()
261 * Store limits from dquot in the tree unless it's fake. If it is fake
262 * remove the id from the tree since there is no useful information in
291 /* We should always find the entry in the rb tree */ in shmem_release_dquot()
292 WARN_ONCE(1, "quota id %u from dquot %p, not in rb tree!\n", id, dquot); in shmem_release_dquot()
299 /* Remove entry from the tree */ in shmem_release_dquot()
303 /* Store the limits in the tree */ in shmem_release_dquot()
|
| /linux/fs/ubifs/ |
| H A D | shrinker.c | 13 * tree when Linux VM needs more RAM.
17 * just walks the TNC tree when searching for znodes to free.
19 * If the root of a TNC sub-tree is clean and old enough, then the children are
49 * shrink_tnc - shrink TNC tree.
55 * This function traverses TNC tree and frees clean znodes. It does not free
71 * Traverse the TNC tree in levelorder manner, so that it is possible in shrink_tnc()
98 * Also note, if the root of a sub-tree is not in 'c->cnext', in shrink_tnc()
99 * then the whole sub-tree is not in 'c->cnext' as well, so it in shrink_tnc()
100 * is safe to dump whole sub-tree. in shrink_tnc()
|
| /linux/scripts/gdb/linux/ |
| H A D | mapletree.py | 3 # Maple tree helpers
37 self.tree = mt.dereference()
41 self.tree = mt
63 return self.tree['ma_root'].cast(maple_enode_type.get_type().pointer())
87 # Empty tree
93 # Single entry tree
216 n = mt_slot(mas.tree, slots, offset)
|
| /linux/Documentation/dev-tools/kunit/api/ |
| H A D | of.rst | 4 Device Tree (OF) API
7 The KUnit device tree API is used to test device tree (of_*) dependent code.
|
| /linux/tools/testing/selftests/net/ |
| H A D | xfrm_policy.sh | 59 # the policies contained within new netmask over when search tree is
74 # adds new nodes to tree (neither network exists yet in policy database).
77 # adds a new node in the 10.0.0.0/24 tree (dst node exists).
88 # 10.0.0.0/24 (node 1 in dst tree of the bin)
89 # 10.1.0.0/24 (node in src tree of dst node 1)
90 # 10.2.0.0/24 (node in src tree of dst node 1)
91 # 10.0.1.0/24 (node 2 in dst tree of the bin)
92 # 10.0.2.0/24 (node in src tree of dst node 2)
93 # 10.2.0.0/24 (node in src tree of dst node 2)
97 # the sub-tree
[all...] |
| /linux/tools/testing/kunit/ |
| H A D | kunit_tool_test.py | 449 tree = kunit_kernel.LinuxSourceTree('', kunitconfig_paths=[dir, other])
450 self.assertTrue(want_kconfig.is_subset_of(tree._kconfig), msg=tree._kconfig)
469 tree = kunit_kernel.LinuxSourceTree('', kconfig_add=['CONFIG_NOT_REAL=y'])
470 self.assertTrue(want_kconfig.is_subset_of(tree._kconfig), msg=tree._kconfig)
481 tree = kunit_kernel.LinuxSourceTree(build_dir)
482 mock.patch.object(tree._ops, 'start', side_effect=fake_start).start()
485 for line in tree.run_kernel(build_dir=build_dir):
497 tree
[all...] |
| /linux/drivers/mtd/ubi/ |
| H A D | ubi.h | 161 * @u.rb: link in the corresponding (free/used) RB-tree
180 * struct ubi_ltree_entry - an entry in the lock tree.
181 * @rb: links RB-tree nodes
190 * &struct ubi_ltree_entry object is inserted to the lock tree (@ubi->ltree).
320 * protected by UBI LEB lock tree.
472 * @ltree_lock: protects the lock tree and @global_sqnum
473 * @ltree: the lock tree
493 * @used: RB-tree of used physical eraseblocks
494 * @erroneous: RB-tree of erroneous used physical eraseblocks
495 * @free: RB-tree o
[all...] |
| /linux/arch/powerpc/kernel/ |
| H A D | eeh_cache.c | 24 * PCI device address resources into a red-black tree, sorted
35 * (Implementation Note: The RB tree seems to be better/faster
116 /* Insert address range into the rb tree. */
125 /* Walk tree, find a place to insert into tree */ in eeh_addr_cache_insert()
180 * ROM BAR) into the tree. in __eeh_addr_cache_insert_dev()
238 * Remove a device from the addr-cache tree.
240 * the tree multiple times (once per resource).
|
| /linux/drivers/memory/ |
| H A D | of_memory.c | 20 * @np: pointer to ddr device tree node
24 * from device tree node. Returns a pointer to the populated
94 * @np_ddr: Pointer to ddr device tree node
101 * tree node. Returns pointer to populated structure. If any error
158 * @np: pointer to ddr device tree node
162 * from device tree node. Returns a pointer to the populated
246 * @np_ddr: Pointer to ddr device tree node
253 * tree node. Returns pointer to populated structure. If any error
308 * @np: Pointer to device tree node containing lpddr2 info
312 * tree nod
[all...] |
| /linux/fs/btrfs/ |
| H A D | backref.h | 91 * caller joined the tree mod log to get a consistent view of b+trees
142 * saving time searching for leaves in a fs tree with file extent items
182 * a given data extent should never exceed the maximum b+tree height.
271 * Now it only supports iteration of tree block in commit root.
308 * of tree blocks (represented by backref_node) and all their parents.
312 * Represent a tree block in the backref cache
332 /* Objectid of tree block owner, can be not uptodate */
342 /* NULL if this node is not tree root */
346 /* Level of the tree block */
391 /* Red black tree o
[all...] |
| H A D | ctree.c | 15 #include "print-tree.h"
19 #include "tree-mod-log.h"
20 #include "tree-checker.h"
23 #include "extent-tree.h"
178 * safely gets a reference on the root node of a tree. A lock
180 * at the root of the tree. See btrfs_lock_root_node for the
184 * it won't disappear. It may stop being the root of the tree
226 /* Want the extent tree to be the last on the list */ in add_root_to_dirty_list()
238 * used by snapshot creation to make a copy of a root for a tree with
315 * check if the tree bloc
[all...] |
| /linux/Documentation/process/ |
| H A D | howto.rst | 63 COPYING in the main directory of the source tree. The Linux kernel licensing
78 The Linux kernel source tree has a large range of documents that are
87 Here is a list of files that are in the kernel source tree that are
133 - Mitigating rapid change within the kernel source tree (or
201 and current projects (both in-tree and out-of-tree). It also describes
213 source tree. Working with the developers in charge of this project, you
214 will learn the basics of getting your patch into the Linux kernel tree,
237 - Linus's mainline tree
240 - linux-next integration testing tree
[all...] |
| /linux/arch/arm64/boot/dts/qcom/ |
| H A D | sc7280-herobrine-herobrine-r1.dts | 3 * Google Herobrine board device tree source
20 * ADDITIONS TO FIXED REGULATORS DEFINED IN PARENT DEVICE TREE FILES
49 /* ADDITIONS TO NODES DEFINED IN PARENT DEVICE TREE FILES */
53 * put the actual definition in the board device tree since different boards
78 * eDP. Like the trackpad, we'll put it in the board device tree file since
129 /* PINCTRL - ADDITIONS TO NODES IN PARENT DEVICE TREE FILES */
|
| /linux/drivers/gpu/drm/xe/ |
| H A D | xe_pt_walk.c | 8 * DOC: GPU page-table tree walking.
11 * the various levels of a page-table tree with an unsigned integer rather
18 * multiple page tables typically form a page table tree with page tables at
59 * xe_pt_walk_range() - Walk a range of a gpu page table tree with callbacks
119 * xe_pt_walk_shared() - Walk shared page tables of a page-table tree.
134 * from the main page-table tree.
|
| /linux/Documentation/devicetree/bindings/fsi/ |
| H A D | fsi.txt | 1 FSI bus & engine generic device tree bindings
7 busses, which are then exposed by the device tree. For example, an FSI engine
8 that is an I2C master - the I2C bus can be described by the device tree under
9 the engine's device tree node.
41 adding subordinate device tree nodes as children of FSI engines.
117 device tree if no extra platform information is required.
|
| /linux/drivers/of/ |
| H A D | platform.c | 29 * @np: Pointer to device tree node
88 * mechanism for creating devices from device tree nodes.
364 * device tree files. in of_platform_bus_create()
385 * of_platform_bus_probe() - Probe the device-tree for platform buses
386 * @root: parent of the first level to probe or NULL for the root of the tree
426 * of_platform_populate() - Populate platform_devices from device tree data
427 * @root: parent of the first level to probe or NULL for the root of the tree
432 * Similar to of_platform_bus_probe(), this function walks the device tree
610 /* Do not touch devices not populated from the device tree */ in of_platform_device_destroy()
633 * of_platform_depopulate() - Remove devices populated from device tree
[all...] |
| /linux/Documentation/translations/zh_CN/core-api/ |
| H A D | generic-radix-tree.rst | 5 :Original: Documentation/core-api/generic-radix-tree.rst
15 通用基数树/稀疏数组的相关内容请见include/linux/generic-radix-tree.h文件中的
23 include/linux/generic-radix-tree.h
|
| /linux/Documentation/filesystems/ext4/ |
| H A D | directory.rst | 64 tree traversal. This format is ``ext4_dir_entry_2``, which is at most
191 Hash Tree Directories
196 balanced tree keyed off a hash of the directory entry name. If the
199 backwards read-only compatibility with ext2, this tree is actually
206 The root of the tree always lives in the first data block of the
209 ``struct ext4_dir_entry_2`` s and not stored in the tree. The rest of
210 the root node contains metadata about the tree and finally a hash->block
214 node, which is indexed by a minor hash. Interior nodes in this tree
225 number. If the tree is flat, the block is a linear array of directory
299 - Length of the tree informatio
[all...] |
| /linux/Documentation/core-api/ |
| H A D | generic-radix-tree.rst | 5 .. kernel-doc:: include/linux/generic-radix-tree.h
8 generic radix tree functions
11 .. kernel-doc:: include/linux/generic-radix-tree.h
|
| /linux/Documentation/devicetree/bindings/pinctrl/ |
| H A D | pinctrl-bindings.txt | 5 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
|