| /linux/drivers/net/ethernet/mellanox/mlx4/ |
| H A D | srq.c | 8 * COPYING in the main directory of this source tree, or the
49 srq = radix_tree_lookup(&srq_table->tree, srqn & (dev->caps.num_srqs - 1)); in mlx4_srq_event()
176 err = radix_tree_insert(&srq_table->tree, srq->srqn, srq); in mlx4_srq_alloc()
213 radix_tree_delete(&srq_table->tree, srq->srqn); in mlx4_srq_alloc()
232 radix_tree_delete(&srq_table->tree, srq->srqn); in mlx4_srq_free()
277 INIT_RADIX_TREE(&srq_table->tree, GFP_ATOMIC); in mlx4_init_srq_table()
298 srq = radix_tree_lookup(&srq_table->tree, in mlx4_srq_lookup()
|
| /linux/Documentation/process/ |
| H A D | stable-api-nonsense.rst | 30 you get that only if your driver is in the main kernel tree. You also
32 tree, all of which has made Linux into such a strong, stable, and mature
105 keep a Linux kernel driver that is not in the main kernel tree up to
167 tree, what are you, a developer, supposed to do? Releasing a binary
172 Simple, get your kernel driver into the main kernel tree (remember we are
175 you leech). If your driver is in the tree, and a kernel interface changes,
180 The very good side effects of having your driver in the main kernel tree
|
| H A D | 2.Process.rst | 64 touch no in-tree code, they cannot cause regressions and should be safe to
174 subsystem tree and into the -next trees (described below). When the
229 tree, usually (but certainly not always) using the git source management
244 For example, the networking tree is built from patches which accumulated
274 started). The -mm tree integrates patches from a long list of subsystem
280 no designated subsystem tree. As a result, -mm operates as a sort of
281 subsystem tree of last resort; if there is no other obvious path for a
284 an appropriate subsystem tree or be sent directly to Linus. In a typical
293 Use of the MMOTM tree is likely to be a frustrating experience, though;
296 The primary tree fo
[all...] |
| H A D | 6.Followthrough.rst | 116 entry into a subsystem maintainer's tree. How that works varies from one
118 things. In particular, there may be more than one tree - one, perhaps,
122 For patches applying to areas for which there is no obvious subsystem tree
123 (memory management patches, for example), the default tree often ends up
125 through the -mm tree.
127 Inclusion into a subsystem tree can bring a higher level of visibility to a
128 patch. Now other developers working with that tree will get the patch by
141 blessings: before the advent of the linux-next tree, these conflicts often
|
| H A D | maintainer-soc.rst | 28 tree as a dedicated branch covering multiple subsystems.
30 The main SoC tree is housed on git.kernel.org:
48 sending pull requests to the main SoC tree. These trees are usually, but not
51 What the SoC tree is not, however, is a location for architecture-specific code
157 inclusion, leading to some historical directory names in the tree.
176 Just as the main SoC tree has several branches, it is expected that
191 SoC tree. An example here would be one branch for devicetree warning fixes, one
|
| /linux/Documentation/admin-guide/LSM/ |
| H A D | SafeSetID.rst | 22 While it is possible to implement a tree of processes by giving full
24 tree of processes under non-root user(s) in the first place. Specifically,
68 Another possible approach would be to run a given process tree in its own user
69 namespace and give programs in the tree setid capabilities. In this way,
70 programs in the tree could change to any desired UID/GID in the context of their
90 None of the other in-tree LSMs have the capability to gate setid transitions, or
|
| /linux/fs/ext4/ |
| H A D | extents_status.h | 91 * least one extent in the extents status tree with delayed and unwritten
99 * used with the extents status tree to implement reserved cluster/block
116 * in the extents status tree, but might be more rapidly accessed in
119 * The pending cluster reservation set is implemented as a red-black tree
134 extern void ext4_es_init_tree(struct ext4_es_tree *tree);
246 extern void ext4_init_pending_tree(struct ext4_pending_tree *tree);
|
| /linux/Documentation/mm/damon/ |
| H A D | maintainer-profile.rst | 10 linux-mm@kvack.org. Patches should be made against the `mm-new tree
28 Note again the patches for `mm-new tree
30 subsystem maintainer. If the patches requires some patches in `damon/next tree
49 <https://github.com/damonitor/damon-tests/tree/master/corr>`_ for normal
52 <https://github.com/damonitor/damon-tests/tree/master/perf>`_ for performance
|
| /linux/Documentation/devicetree/bindings/clock/ti/ |
| H A D | dra7-atl.txt | 1 Device Tree Clock bindings for ATL (Audio Tracking Logic) of DRA7 SoC.
12 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/arch/powerpc/boot/ |
| H A D | simpleboot.c | 4 * tree or any platform configuration information.
5 * All data is extracted from an embedded device tree
34 fatal("Invalid device tree blob\n"); in platform_init()
80 /* prepare the device tree and find the console */ in platform_init()
|
| /linux/Documentation/networking/dsa/ |
| H A D | dsa.rst | 34 of multiple switches connected to each other is called a "switch tree".
121 switch tree use the same tagging protocol. In case of a packet transiting a
137 It still remains the case that, if the DSA switch tree is configured for the
147 tree. The DSA links are viewed as simply a pair of a DSA conduit (the out-facing
151 The tagging protocol of the attached DSA switch tree can be viewed through the
157 tree can be changed at runtime. This is done by writing the new tagging
388 the conduit network device this switch tree is attached to needs to be
393 the tagging protocol supported by the switch tree, and which receive/transmit
396 referenced to address individual switches in the tree.
398 - ``dsa_switch``: structure describing a switch device in the tree, referencin
[all...] |
| /linux/tools/rcu/ |
| H A D | rcu-cbs.py | 22 rdp0 = prog.variable('rcu_preempt_data', 'kernel/rcu/tree.c');
29 'kernel/rcu/tree.c');
34 rdp0 = prog.variable('rcu_data', 'kernel/rcu/tree.c');
|
| /linux/Documentation/admin-guide/device-mapper/ |
| H A D | vdo-design.rst | 279 a leaf of a radix tree which consists of block map pages at each level.
281 robin fashion. (If there are L logical zones, tree n will belong to zone n
283 0-811 belong to tree 0, logical addresses 812-1623 belong to tree 1, and so
287 tree roots is allocated at format time. All other block map pages are
366 3. The data_vio traverses the block map tree to ensure that all the
367 necessary internal tree nodes have been allocated, by trying to find
368 the leaf page for its logical address. If any interior tree page is
372 a. If any page-node in the tree has not yet been allocated, it must be
383 the tree usin
[all...] |
| /linux/fs/btrfs/ |
| H A D | root-tree.c | 16 #include "root-tree.h"
20 * Read a root item from the tree. In case we detect a root item smaller then
55 * root: the root of the root tree
58 * root_item: the root item of the tree we look for
59 * root_key: the root key of the tree we look for
150 "unable to find root key (%llu %u %llu) in tree %llu", in btrfs_update_root()
316 /* drop the root item for 'key' from the tree root */
406 * For a forward ref, the root_id is the id of the tree referencing
410 * ref_id is the id of the tree referencing it.
505 * and root tree, th
[all...] |
| H A D | fs.h | 21 #include <linux/radix-tree.h>
29 #include "extent-io-tree.h"
117 /* Indicates there was an error cleaning up a log tree. */
167 /* Indicate that we can't trust the free space tree for caching yet */
170 /* Indicate whether there are any tree modification log users */
195 * Indicate that we have found a tree block which is only aligned to
283 * Features under developmen like Extent tree v2 support is enabled
440 /* The log root tree is a directory of all the other log roots */
443 /* The tree that holds the global roots (csum, extent, etc) */
465 * Block reservation for extent, checksum, root tree an
[all...] |
| H A D | tree-checker.h | 17 /* All the extra info needed to verify the parentness of a tree block. */
20 * The owner check against the tree block.
37 * e.g. reading the tree root, doing backref walk.
|
| /linux/fs/befs/ |
| H A D | btree.c | 16 * Marcus J. Ranum, author of the b+tree package in
40 /* Befs B+tree structure:
42 * The first thing in the tree is the tree superblock. It tells you
43 * all kinds of useful things about the tree, like where the rootnode
47 * The rest of the tree consists of a series of nodes. Nodes contain a header
52 * datastream containing the tree.
227 * befs_btree_find - Find a key in a befs B+tree
239 * Read the superblock and rootnode of the b+tree.
406 * Get the first leafnode of the tree
[all...] |
| /linux/tools/perf/util/ |
| H A D | srcline.c | 977 void srcline__tree_insert(struct rb_root_cached *tree, u64 addr, char *srcline) in srcline__tree_insert() argument
979 struct rb_node **p = &tree->rb_root.rb_node; in srcline__tree_insert()
1004 rb_insert_color_cached(&node->rb_node, tree, leftmost); in srcline__tree_insert()
1007 char *srcline__tree_find(struct rb_root_cached *tree, u64 addr) in srcline__tree_find() argument
1009 struct rb_node *n = tree->rb_root.rb_node; in srcline__tree_find()
1026 void srcline__tree_delete(struct rb_root_cached *tree) in srcline__tree_delete() argument
1029 struct rb_node *next = rb_first_cached(tree); in srcline__tree_delete()
1034 rb_erase_cached(&pos->rb_node, tree); in srcline__tree_delete()
1068 void inlines__tree_insert(struct rb_root_cached *tree, in inlines__tree_insert() argument
1071 struct rb_node **p = &tree in inlines__tree_insert()
1091 inlines__tree_find(struct rb_root_cached * tree,u64 addr) inlines__tree_find() argument
1110 inlines__tree_delete(struct rb_root_cached * tree) inlines__tree_delete() argument
[all...] |
| /linux/scripts/ |
| H A D | check-uapi.sh | 24 will use any dirty changes in tree to UAPI files. If there are no
139 # Check if git tree is dirty
147 local -r tree="$(get_header_tree "$ref")"
150 find "$tree" -type f -name '*.h' -printf '%P\n' | grep -v -f "$INCOMPAT_LIST"
208 printf "Installing user-facing UAPI headers from %s... " "${ref:-dirty tree}"
227 # Print the path to the headers_install tree for a given ref
244 printf "Checking changes to UAPI headers between %s and %s...\n" "$past_ref" "${base_ref:-dirty tree}"
384 printf "\n%s did not change between %s and %s...\n" "$file" "$past_ref" "${base_ref:-dirty tree}"
452 if ! git rev-parse --is-inside-work-tree > /dev/null 2>&1; then
453 eprintf "error - this script requires the kernel tree t
[all...] |
| /linux/kernel/ |
| H A D | auditfilter.c | 158 krule->inode_f || krule->watch || krule->tree || in audit_to_inode()
615 if (entry->rule.tree) in audit_data_to_entry()
616 audit_put_tree(entry->rule.tree); /* that's the temporary one */ in audit_data_to_entry()
677 audit_tree_path(krule->tree)); in audit_krule_to_data()
742 if (strcmp(audit_tree_path(a->tree), in audit_compare_rule()
743 audit_tree_path(b->tree))) in audit_compare_rule()
847 * never dereferences tree and we can't get false positives there in audit_dupe_rule()
852 new->tree = old->tree; in audit_dupe_rule()
944 struct audit_tree *tree in audit_add_rule() local
1027 struct audit_tree *tree = entry->rule.tree; audit_del_rule() local
[all...] |
| /linux/net/dsa/ |
| H A D | dsa.c | 54 * @dst: Tree in which to record the mapping.
55 * @lag: LAG structure that is to be mapped to the tree's array.
85 * @dst: Tree in which the mapping is recorded.
381 /* Assign the default CPU port (the first one in the tree) to all ports of the
390 pr_err("DSA: tree %d has no CPU port\n", dst->index); in dsa_tree_setup_default_cpu()
425 * using the first CPU port in the switch tree if the port does not have a CPU
881 pr_err("DSA: tree %d already setup! Disjoint trees?\n", in dsa_tree_setup()
912 pr_info("DSA: tree %d setup\n", dst->index); in dsa_tree_setup()
947 pr_info("DSA: tree %d torn down\n", dst->index); in dsa_tree_teardown()
961 /* Notify the switches from this tree abou in dsa_tree_bind_tag_proto()
[all...] |
| /linux/fs/verity/ |
| H A D | Kconfig | 13 filesystem to build a Merkle tree for the file. The filesystem
15 against the Merkle tree. The file is also made read-only.
18 Merkle tree root hash also allows efficiently supporting
|
| /linux/arch/arm/mach-mvebu/ |
| H A D | board-v7.c | 3 * Device Tree support for Armada 370 and XP platforms.
159 DT_MACHINE_START(ARMADA_370_XP_DT, "Marvell Armada 370/XP (Device Tree)")
175 DT_MACHINE_START(ARMADA_375_DT, "Marvell Armada 375 (Device Tree)")
190 DT_MACHINE_START(ARMADA_38X_DT, "Marvell Armada 380/385 (Device Tree)")
204 DT_MACHINE_START(ARMADA_39X_DT, "Marvell Armada 39x (Device Tree)")
|
| /linux/tools/testing/selftests/kexec/ |
| H A D | kexec_common_lib.sh | 68 # On powerpc platform, check device-tree property
69 # /proc/device-tree/ibm,secureboot/os-secureboot-enforcing
73 local secure_boot_file="/proc/device-tree/ibm,secureboot/os-secureboot-enforcing"
76 log_info "Secureboot is enabled (Device tree)"
79 log_info "Secureboot is not enabled (Device tree)"
|
| /linux/fs/xfs/scrub/ |
| H A D | dirtree.c | 34 * Directory Tree Structure Validation
37 * Validating the tree qualities of the directory tree structure can be
38 * difficult. If the tree is frozen, running a depth (or breadth) first search
41 * disconnected cycles. If the tree is not frozen, directory updates can move
45 * validation of the tree structure. Instead of using one thread to scan the
61 * directory tree structure. Second, because we're walking upwards in a tree
169 * If this path is more than 2 billion steps long, this directory tree in xchk_dirpath_append()
274 * directory tree toward
[all...] |