| /linux/tools/perf/tests/ |
| H A D | maps.c | 1 // SPDX-License-Identifier: GPL-2.0
18 struct map_def *merged; member
25 struct map_def *merged = &args->merged[args->i]; in check_maps_cb() local
27 if (map__start(map) != merged->star in check_maps_cb()
48 check_maps(struct map_def * merged,unsigned int size,struct maps * maps) check_maps() argument
[all...] |
| /linux/tools/crypto/tcrypt/ |
| H A D | tcrypt_speed_compare.py | 2 # SPDX-License-Identifier: GPL-2.0
31 lsmod | grep pcrypt && modprobe -r pcrypt
32 dmesg -C
38 lsmod | grep pcrypt && modprobe -r pcrypt
39 dmesg -C
43 lsmod | grep pcrypt && modprobe -r pcrypt
49 grep 'average' -A2 -B0 --group-separator="" ${seq_num}_compare.log
114 merged = {}
116 merged[alg] = {}
118 if op not in merged[alg]:
[all …]
|
| /linux/Documentation/admin-guide/mm/ |
| H A D | ksm.rst | 8 KSM is a memory-saving de-duplication feature, enabled by CONFIG_KSM=y,
19 content which can be replaced by a single write-protected page (which
26 KSM's merged pages were originally locked into kernel memory, but can now
46 unmerges whatever it merged in that range. Note: this unmerging call
47 may suddenly require more memory than is available - possibly failing
48 with EAGAIN, but more probably arousing the Out-Of-Memory killer.
60 will exceed ``vm.max_map_count`` (see Documentation/admin-guide/sysctl/vm.rst).
68 restricting its use to areas likely to benefit. KSM's scans may use a lot
84 been set to scan-time.
95 specifies if pages from different NUMA nodes can be merged.
[all …]
|
| /linux/Documentation/process/ |
| H A D | 6.Followthrough.rst | 17 kernel community to ensure that your code is up to the kernel's quality
23 ----------------------
31 - If you have explained your patch well, reviewers will understand its
35 Many of the changes you may be asked to make - from coding style tweaks
36 to substantial rewrites - come from the understanding that Linux will
39 - Code review is hard work, and it is a relatively thankless occupation;
47 - Similarly, code reviewers are not trying to promote their employers'
54 - Be prepared for seemingly silly requests for coding style changes
112 -----------------
116 entry into a subsystem maintainer's tree. How that works varies from one
[all …]
|
| H A D | 1.Intro.rst | 7 -----------------
12 merged into the official ("mainline") kernel, including automatic
15 Linux kernel must be made available under a GPL-compatible license.
24 :ref:`development_early_stage` covers early-stage project planning, with an
42 assuming that the job is done when a patch is merged into the mainline.
51 ---------------------------
56 kernel has evolved into a best-of-breed operating system component which
57 runs on pocket-sized digital music players, desktop PCs, the largest
66 capable and well-suited to the task at hand as possible. Distributors and
77 free software projects. A typical three-month kernel development cycle can
[all …]
|
| H A D | 2.Process.rst | 6 Linux kernel development in the early 1990's was a pretty loose affair,
14 ---------------
16 The kernel developers use a loosely time-based release process, with a new
39 community) is merged into the mainline kernel. The bulk of changes for a
40 new development cycle (and all of the major changes) will be merged during
53 be called 5.6-rc1. The -rc1 release is the signal that the time to
63 exception is made for drivers for previously-unsupported hardware; if they
64 touch no in-tree code, they cannot cause regressions and should be safe to
68 time. Linus releases new -rc kernels about once a week; a normal series
69 will get up to somewhere between -rc6 and -rc9 before the kernel is
[all …]
|
| /linux/tools/testing/selftests/mm/ |
| H A D | ksm_tests.c | 1 // SPDX-License-Identifier: GPL-2.0
20 #define KSM_FP(s) (KSM_SYSFS_PATH s) argument
64 fprintf(stderr, "f %s\n", file_path); in ksm_write_sysfs()
83 fprintf(stderr, "f %s\n", file_path); in ksm_read_sysfs()
133 fprintf(stderr, "f %s\n", file_name); in ksm_print_procfs()
139 printf("%s", buffer); in ksm_print_procfs()
160 printf("usage: ksm_tests [-h] <test type> [-a prot] [-p page_count] [-l timeout]\n" in print_help()
161 "[-z use_zero_pages] [-m merge_across_nodes] [-s size]\n"); in print_help()
164 " -M (page merging)\n" in print_help()
165 " -Z (zero pages merging)\n" in print_help()
[all …]
|
| /linux/Documentation/devicetree/bindings/mfd/ |
| H A D | dlg,da9063.yaml | 1 # SPDX-License-Identifier: (GPL-2.0-only OR BSD-2-Clause)
3 ---
5 $schema: http://devicetree.org/meta-schemas/core.yaml#
10 - Steve Twiss <stwiss.opensource@diasemi.com>
13 For device-tree bindings of other sub-modules refer to the binding documents
14 under the respective sub-system directories.
15 Using regulator-{uv,ov}-{warn,error,protection}-microvolt requires special
21 - https://www.dialog-semiconductor.com/products/da9063l
22 - https://www.dialog-semiconductor.com/products/da9063
23 - https://www.dialog-semiconductor.com/products/da9062
[all …]
|
| /linux/block/ |
| H A D | badblocks.c | 1 // SPDX-License-Identifier: GPL-2.0
5 * - Heavily based on MD badblocks code from Neil Brown
41 * prefix E, and the setting bad blocks range is naming with prefix S)
45 * +--------+
46 * | S |
47 * +--------+
48 * +-------------+ +-------------+
50 * +-------------+ +-------------+
52 * free slot from the bad blocks table to mark the setting range S. The
54 * +-------------+ +--------+ +-------------+
[all …]
|
| H A D | elevator.c | 1 // SPDX-License-Identifier: GPL-2.0
3 * Block device elevator/IO-scheduler.
11 * - elevator_fn, inserts a new request in the queue list
12 * - elevator_merge_fn, decides whether a new buffer can be merged with
14 * - elevator_dequeue_fn, called when a request is taken off the active list
17 * Removed tests for max-bomb-segments, which was breaking elvtune
18 * when run without -bN
21 * - Rework again to work with bio instead of buffer_heads
22 * - loose bi_dev comparisons, partition handling is right now
23 * - completely modularize elevator setup and teardown
[all …]
|
| /linux/Documentation/filesystems/xfs/ |
| H A D | xfs-maintainer-entry-profile.rst | 5 --------
6 XFS is a well known high-performance filesystem in the Linux kernel.
10 Patches are generally merged to the for-next branch of the appropriate
12 After a testing period, the for-next branch is merged to the master
15 Kernel code are merged to the xfs-linux tree[0].
16 Userspace code are merged to the xfsprogs tree[1].
17 Test cases are merged to the xfstests tree[2].
18 Ondisk format documentation are merged to the xfs-documentation tree[3].
21 list linux-xfs@vger.kernel.org.
24 -----
[all …]
|
| /linux/Documentation/filesystems/ |
| H A D | overlayfs.rst | 1 .. SPDX-License-Identifier: GPL-2.0
10 overlay-filesystem functionality in Linux (sometimes referred to as
11 union-filesystems). An overlay-filesystem tries to present a
17 ---------------
25 While directories will report an st_dev from the overlay-filesystem,
26 non-directory objects may report an st_dev from the lower filesystem or
29 over the lifetime of a non-directory object. Many applications and
48 The "xino" feature can be enabled with the "-o xino=on" overlay mount option.
51 the lifetime of the filesystem. The "-o xino=auto" overlay mount option
60 +--------------+------------+------------+-----------------+----------------+
[all …]
|
| /linux/fs/btrfs/ |
| H A D | extent_map.c | 1 // SPDX-License-Identifier: GPL-2.0
11 #include "disk-io.h"
21 return -ENOMEM; in extent_map_init()
36 tree->root = 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()
51 RB_CLEAR_NODE(&em->rb_node); in alloc_extent_map()
52 refcount_set(&em->refs, 1); in alloc_extent_map()
53 INIT_LIST_HEAD(&em->list); in alloc_extent_map()
65 if (refcount_dec_and_test(&em->refs)) { in free_extent_map()
[all …]
|
| /linux/fs/bcachefs/ |
| H A D | checksum.c | 1 // SPDX-License-Identifier: GPL-2.0
6 #include "super-io.h"
20 #include <keys/user-type.h>
26 * for hash-like algorithms, a state needs to be stored
39 switch (state->type) { in bch2_checksum_init()
43 state->seed = 0; in bch2_checksum_init()
46 state->seed = U32_MAX; in bch2_checksum_init()
49 state->seed = U64_MAX; in bch2_checksum_init()
52 xxh64_reset(&state->h64state, 0); in bch2_checksum_init()
61 switch (state->type) { in bch2_checksum_final()
[all …]
|
| /linux/tools/testing/vma/ |
| H A D | vma.c | 1 // SPDX-License-Identifier: GPL-2.0-or-later
7 #include "generated/bit-length.h"
9 #include "maple-shared.h"
19 (fail_prealloc ? -ENOMEM : mas_preallocate(&(vmi)->mas, (vma), GFP_KERNEL))
23 * provides userland-equivalen
158 struct vm_area_struct *merged; try_merge_new_vma() local
395 bool merged; test_merge_new() local
[all...] |
| /linux/Documentation/block/ |
| H A D | stat.rst | 30 read merges requests number of read I/Os merged with in-queue I/O
34 write merges requests number of write I/Os merged with in-queue I/O
41 discard merges requests number of discard I/Os merged with in-queue I/O
48 read I/Os, write I/Os, discard I/0s
64 These values increment when an I/O request is merged with an
65 already-queued I/O request.
72 standard UNIX 512-byte sectors, not any device- or filesystem-specific
|
| /linux/Documentation/admin-guide/ |
| H A D | iostats.rst | 56 or long-lived system; so applications should be prepared to deal with
58 int (32 bit) or unsigned long (32-bit or 64-bit, depending on your
59 machine) as noted per-field below. Unless your observations are very
63 system-wide stats you'll have to find all the devices and sum them all up.
65 Field 1 -- # of reads completed (unsigned long)
68 Field 2 -- # of reads merged, field 6 -- # of writes merged (unsigned long)
69 Reads and writes which are adjacent to each other may be merged for
74 Field 3 -- # of sectors read (unsigned long)
77 Field 4 -- # of milliseconds spent reading (unsigned int)
81 Field 5 -- # of writes completed (unsigned long)
[all …]
|
| /linux/tools/lib/perf/ |
| H A D | cpumap.c | 1 // SPDX-License-Identifier: GPL-2.0-only
16 RC_CHK_ACCESS(map)->nr = nr_cpus; in perf_cpu_map__set_nr()
29 cpus->nr = nr_cpus; in perf_cpu_map__alloc()
30 refcount_set(&cpus->refcnt, 1);
40 RC_CHK_ACCESS(cpus)->map[0].cpu = -1;
94 RC_CHK_ACCESS(cpus)->ma in cpu_map__new_sysconf()
421 struct perf_cpu_map *merged; perf_cpu_map__merge() local
465 struct perf_cpu_map *merged = NULL; perf_cpu_map__intersect() local
[all...] |
| /linux/drivers/net/ethernet/netronome/nfp/flower/ |
| H A D | conntrack.h | 1 /* SPDX-License-Identifier: (GPL-2.0-only OR BSD-2-Clause) */
38 * struct nfp_fl_ct_zone_entry - Zone entry containing conntrack flow information
50 * @tc_merge_tb: The table of merged tc flows
51 * @tc_merge_count: Keep count of the number of merged tc entries
56 * @nft_merge_tb: The table of merged tc+nft flows
57 * @nft_merge_count: Keep count of the number of merged tc+nft entries
114 * struct nfp_fl_ct_flow_entry - Flow entry containing conntrack flow information
128 * @type: Type of ct-entry from enum ct_entry_type
140 struct nfp_fl_nft_tc_merge *prev_m_entries[NFP_MAX_RECIRC_CT_ZONES - 1];
148 * struct nfp_fl_ct_tc_merge - Merge of two flows from tc
[all …]
|
| /linux/Documentation/ABI/obsolete/ |
| H A D | sysfs-bus-iio | 3 Contact: linux-iio@vger.kernel.org
14 Contact: linux-iio@vger.kernel.org
26 Contact: linux-iio@vger.kernel.org
31 Since kernel 5.11 the scan_elements attributes are merged into
50 What: /sys/.../iio:deviceX/scan_elements/in_voltageY-voltageZ_en
62 Contact: linux-iio@vger.kernel.org
66 Since kernel 5.11 the scan_elements attributes are merged into
86 Contact: linux-iio@vger.kernel.org
89 and hence the form in which it is read from user-space.
90 Form is [be|le]:[s|u]bits/storagebits[>>shift].
[all …]
|
| /linux/drivers/hwtracing/stm/ |
| H A D | policy.c | 1 // SPDX-License-Identifier: GPL-2.0
36 /* this is the one that's exposed to the attributes */
45 return pn->priv; in stp_policy_node_priv()
54 *mstart = policy_node->first_master; in stp_policy_node_get_ranges()
55 *mend = policy_node->last_master; in stp_policy_node_get_ranges()
56 *cstart = policy_node->first_channel; in stp_policy_node_get_ranges()
57 *cend = policy_node->last_channel; in stp_policy_node_get_ranges()
90 count = sprintf(page, "%u %u\n", policy_node->first_master, in stp_policy_node_masters_show()
91 policy_node->last_master); in stp_policy_node_masters_show()
104 ssize_t ret = -ENODEV; in stp_policy_node_masters_store()
[all …]
|
| /linux/net/batman-adv/ |
| H A D | fragmentation.c | 1 // SPDX-License-Identifier: GPL-2.0
26 #include "hard-interface.h"
31 * batadv_frag_clear_chain() - delete entries in the fragment buffer chain
43 hlist_del(&entry->list); in batadv_frag_clear_chain()
46 kfree_skb(entry->skb); in batadv_frag_clear_chain()
48 consume_skb(entry->skb); in batadv_frag_clear_chain()
55 * batadv_frag_purge_orig() - free fragments associated to an orig
66 chain = &orig_node->fragments[i]; in batadv_frag_purge_orig()
67 spin_lock_bh(&chain->lock); in batadv_frag_purge_orig()
70 batadv_frag_clear_chain(&chain->fragment_list, true); in batadv_frag_purge_orig()
[all …]
|
| /linux/lib/ |
| H A D | list_sort.c | 1 // SPDX-License-Identifier: GPL-2.0
9 * to chaining of merge() calls: null-terminated, no reserved or
19 /* if equal, take 'a' -- important for sort stability */ in merge()
22 tail = &a->next; in merge()
23 a = a->next; in merge()
30 tail = &b->next; in merge()
31 b = b->next; in merge()
42 * Combine final list merge with restoration of standard doubly-linked
45 * prev-link restoration pass, or maintaining the prev links
56 /* if equal, take 'a' -- important for sort stability */ in merge_final()
[all …]
|
| /linux/mm/ |
| H A D | vma.c | 1 // SPDX-License-Identifier: GPL-2.0-or-later
4 * VMA-specific functions.
47 .mm = (map_)->mm, \
48 .vmi = (map_)->vmi, \
49 .start = (map_)->addr, \
50 .end = (map_)->end, \
51 .flags = (map_)->flags, \
52 .pgoff = (map_)->pgoff, \
53 .file = (map_)->file, \
54 .prev = (map_)->prev, \
[all …]
|
| /linux/security/landlock/ |
| H A D | ruleset.h | 1 /* SPDX-License-Identifier: GPL-2.0-only */
3 * Landlock LSM - Ruleset management
5 * Copyright © 2016-2020 Mickaël Salaün <mic@digikod.net>
6 * Copyright © 2018-2020 ANSSI
26 * by a ruleset/layer. This must be ORed with all ruleset->access_masks[]
29 /* clang-format off */
32 /* clang-format on */
65 * struct landlock_layer - Access rights for a given layer
80 * union landlock_key - Key of a ruleset's red-black tree
88 * @data: Raw data to identify an arbitrary 32-bit value
[all …]
|