| /kernel/linux/linux-5.10/include/media/ |
| D | v4l2-ioctl.h | 25 * @vidioc_querycap: pointer to the function that implements 27 * @vidioc_enum_fmt_vid_cap: pointer to the function that implements 30 * @vidioc_enum_fmt_vid_overlay: pointer to the function that implements 33 * @vidioc_enum_fmt_vid_out: pointer to the function that implements 36 * @vidioc_enum_fmt_sdr_cap: pointer to the function that implements 39 * @vidioc_enum_fmt_sdr_out: pointer to the function that implements 42 * @vidioc_enum_fmt_meta_cap: pointer to the function that implements 45 * @vidioc_enum_fmt_meta_out: pointer to the function that implements 48 * @vidioc_g_fmt_vid_cap: pointer to the function that implements 51 * @vidioc_g_fmt_vid_overlay: pointer to the function that implements [all …]
|
| /kernel/linux/linux-6.6/tools/perf/pmu-events/arch/x86/goldmont/ |
| D | cache.json | 6 …on which likely indicates back pressure from L2Q. It also counts requests that would have gone dir… 21 …"PublicDescription": "Counts cycles that fetch is stalled due to an outstanding ICache miss. That … 29 …"PublicDescription": "Counts the number of demand and prefetch transactions that the L2 XQ rejects… 36 …"PublicDescription": "Counts memory requests originating from the core that miss in the L2 cache.", 44 …"PublicDescription": "Counts memory requests originating from the core that reference a cache line… 49 "BriefDescription": "Loads retired that came from DRAM (Precise event capable)", 64 …that when the load address was checked by other caching agents (typically another processor) in th… 69 "BriefDescription": "Load uops retired that hit L1 data cache (Precise event capable)", 74 "PublicDescription": "Counts load uops retired that hit the L1 data cache.", 79 "BriefDescription": "Load uops retired that missed L1 data cache (Precise event capable)", [all …]
|
| /kernel/linux/linux-6.6/include/media/ |
| D | v4l2-ioctl.h | 25 * @vidioc_querycap: pointer to the function that implements 27 * @vidioc_enum_fmt_vid_cap: pointer to the function that implements 30 * @vidioc_enum_fmt_vid_overlay: pointer to the function that implements 33 * @vidioc_enum_fmt_vid_out: pointer to the function that implements 36 * @vidioc_enum_fmt_sdr_cap: pointer to the function that implements 39 * @vidioc_enum_fmt_sdr_out: pointer to the function that implements 42 * @vidioc_enum_fmt_meta_cap: pointer to the function that implements 45 * @vidioc_enum_fmt_meta_out: pointer to the function that implements 48 * @vidioc_g_fmt_vid_cap: pointer to the function that implements 51 * @vidioc_g_fmt_vid_overlay: pointer to the function that implements [all …]
|
| /kernel/linux/linux-6.6/tools/perf/pmu-events/arch/arm64/fujitsu/a64fx/ |
| D | other.json | 9 …"PublicDescription": "This event counts every cycle that no operation was committed because the ol… 12 …"BriefDescription": "This event counts every cycle that no operation was committed because the old… 15 …"PublicDescription": "This event counts every cycle that no instruction was committed because the … 18 …"BriefDescription": "This event counts every cycle that no instruction was committed because the o… 21 …"PublicDescription": "This event counts every cycle that no instruction was committed because the … 24 …"BriefDescription": "This event counts every cycle that no instruction was committed because the o… 27 …"PublicDescription": "This event counts every cycle that no instruction was committed because the … 30 …"BriefDescription": "This event counts every cycle that no instruction was committed because the o… 33 …"PublicDescription": "This event counts every cycle that no instruction was committed because the … 36 …"BriefDescription": "This event counts every cycle that no instruction was committed because the o… [all …]
|
| /kernel/linux/linux-6.6/Documentation/process/ |
| D | management-style.rst | 14 to do with reality. It started as a lark, but that doesn't mean that it 27 making it painfully obvious to the questioner that we don't have a clue 37 Everybody thinks managers make decisions, and that decision-making is 39 manager must be to make it. That's very deep and obvious, but it's not 47 competent to make that decision for them. 51 Namely that you are in the wrong job, and that **they** should be managing 60 It helps to realize that the key difference between a big decision and a 62 can be made small by just always making sure that if you were wrong (and 67 And people will even see that as true leadership (*cough* bullshit 71 things that can't be undone. Don't get ushered into a corner from which [all …]
|
| D | 6.Followthrough.rst | 8 patches. One of the biggest mistakes that even experienced kernel 9 developers can make is to conclude that their work is now done. In truth, 13 It is a rare patch which is so good at its first posting that there is no 16 code. You, as the author of that code, will be expected to work with the 17 kernel community to ensure that your code is up to the kernel's quality 32 value and why you went to the trouble of writing it. But that value 36 to substantial rewrites - come from the understanding that Linux will 49 be working on the kernel years from now, but they understand that their 57 the same. Sometimes this means that the clever hack in your driver 61 What all of this comes down to is that, when reviewers send you comments, [all …]
|
| /kernel/linux/linux-5.10/Documentation/process/ |
| D | management-style.rst | 14 to do with reality. It started as a lark, but that doesn't mean that it 27 making it painfully obvious to the questioner that we don't have a clue 37 Everybody thinks managers make decisions, and that decision-making is 39 manager must be to make it. That's very deep and obvious, but it's not 47 competent to make that decision for them. 51 Namely that you are in the wrong job, and that **they** should be managing 60 It helps to realize that the key difference between a big decision and a 62 can be made small by just always making sure that if you were wrong (and 67 And people will even see that as true leadership (*cough* bullshit 71 things that can't be undone. Don't get ushered into a corner from which [all …]
|
| D | 6.Followthrough.rst | 8 patches. One of the biggest mistakes that even experienced kernel 9 developers can make is to conclude that their work is now done. In truth, 13 It is a rare patch which is so good at its first posting that there is no 16 code. You, as the author of that code, will be expected to work with the 17 kernel community to ensure that your code is up to the kernel's quality 32 value and why you went to the trouble of writing it. But that value 36 to substantial rewrites - come from the understanding that Linux will 49 be working on the kernel years from now, but they understand that their 54 What all of this comes down to is that, when reviewers send you comments, 55 you need to pay attention to the technical observations that they are [all …]
|
| /kernel/linux/linux-6.6/tools/memory-model/Documentation/ |
| D | glossary.txt | 9 dependency" extends from that load extending to the later access. 20 address dependency extends from that rcu_dereference() to that 27 Acquire: With respect to a lock, acquiring that lock, for example, 29 a special operation that includes a load and which orders that 30 load before later memory references running on that same CPU. 36 to that same variable, (in other words, the acquire load "reads 37 from" the release store), then all operations preceding that 38 store "happen before" any operations following that load acquire. 56 a "control dependency" extends from that load to that store. 71 that is required. In other cases, the notion of pairing must be [all …]
|
| /kernel/linux/linux-6.6/Documentation/filesystems/ |
| D | xfs-delayed-logging-design.rst | 10 This document describes the design and algorithms that the XFS journalling 11 subsystem is based on. This document describes the design and algorithms that 12 the XFS journalling subsystem is based on so that readers may familiarize 36 chained together by intents, ensuring that journal recovery can restart and 37 finish an operation that was only partially done when the system stopped 47 particularly important in the scope of this document. It suffices to know that 50 performed. The logging subsystem only cares that certain specific rules are 59 transactions. Permanent transaction reservations can take reservations that span 64 place. This means that permanent transactions can be used for one-shot 79 space that was taken at the transaction allocation time. [all …]
|
| D | path-lookup.rst | 22 exploration is needed to discover, is that it is complex. There are 23 many rules, special cases, and implementation alternatives that all 26 tool that we will make extensive use of is "divide and conquer". For 41 of elements: "slashes" that are sequences of one or more "``/``" 42 characters, and "components" that are sequences of one or more 43 non-"``/``" characters. These form two kinds of paths. Those that 52 component, but that isn't always accurate: a pathname can lack both 62 it must identify a directory that already exists, otherwise an error 68 pathname that is just slashes have a final component. If it does 75 tempting to consider that to have an empty final component. In many [all …]
|
| /kernel/linux/linux-5.10/Documentation/filesystems/ |
| D | path-lookup.rst | 22 exploration is needed to discover, is that it is complex. There are 23 many rules, special cases, and implementation alternatives that all 26 tool that we will make extensive use of is "divide and conquer". For 41 of elements: "slashes" that are sequences of one or more "``/``" 42 characters, and "components" that are sequences of one or more 43 non-"``/``" characters. These form two kinds of paths. Those that 52 component, but that isn't always accurate: a pathname can lack both 62 it must identify a directory that already exists, otherwise an error 68 pathname that is just slashes have a final component. If it does 75 tempting to consider that to have an empty final component. In many [all …]
|
| D | directory-locking.rst | 12 that "inode pointer" order in the following. 25 4) rename() that is _not_ cross-directory. Locking rules: caller locks 29 Take the locks that need to be taken, in inode pointer order if need 30 to take both (that can happen only when both source and target are 33 only with RENAME_EXCHANGE, and that won't be removing the target). 39 * check that source is not a directory 62 The rules above obviously guarantee that all directories that are going to be 75 That ordering can change. However, the following is true: 105 blocked on source and it means that it doesn't hold any locks. 108 has a child that is also contended. Indeed, suppose that it is held by [all …]
|
| /kernel/linux/linux-5.10/tools/perf/pmu-events/arch/x86/goldmont/ |
| D | cache.json | 4 …"PublicDescription": "Counts memory requests originating from the core that miss in the L2 cache.", 14 …"PublicDescription": "Counts memory requests originating from the core that reference a cache line… 24 …"PublicDescription": "Counts the number of demand and prefetch transactions that the L2 XQ rejects… 34 …on which likely indicates back pressure from L2Q. It also counts requests that would have gone dir… 54 …"PublicDescription": "Counts cycles that fetch is stalled due to an outstanding ICache miss. That … 92 "BriefDescription": "Load uops retired that split a cache-line (Precise event capable)", 104 "BriefDescription": "Stores uops retired that split a cache-line (Precise event capable)", 116 "BriefDescription": "Memory uops retired that split a cache-line (Precise event capable)", 146 …"PublicDescription": "Counts the number of memory uops retired that is either a loads or a store o… 158 "PublicDescription": "Counts load uops retired that hit the L1 data cache.", [all …]
|
| /kernel/linux/linux-6.6/tools/perf/pmu-events/arch/x86/knightslanding/ |
| D | memory.json | 10 …"BriefDescription": "Counts Demand code reads and prefetch code read requests that accounts for r… 19 …"BriefDescription": "Counts Demand code reads and prefetch code read requests that accounts for d… 28 …"BriefDescription": "Counts Demand code reads and prefetch code read requests that accounts for d… 37 …"BriefDescription": "Counts Demand code reads and prefetch code read requests that accounts for r… 46 …"BriefDescription": "Counts Demand code reads and prefetch code read requests that accounts for d… 55 …"BriefDescription": "Counts Demand code reads and prefetch code read requests that accounts for d… 64 …"BriefDescription": "Counts Demand cacheable data and L1 prefetch data read requests that account… 73 …"BriefDescription": "Counts Demand cacheable data and L1 prefetch data read requests that account… 82 …"BriefDescription": "Counts Demand cacheable data and L1 prefetch data read requests that account… 91 …"BriefDescription": "Counts Demand cacheable data and L1 prefetch data read requests that account… [all …]
|
| /kernel/linux/linux-5.10/Documentation/admin-guide/pm/ |
| D | cpuidle.rst | 33 CPU idle time management operates on CPUs as seen by the *CPU scheduler* (that 35 work in the system). In its view, CPUs are *logical* units. That is, they need 38 entity which appears to be fetching instructions that belong to one sequence 43 program) at a time, it is a CPU. In that case, if the hardware is asked to 44 enter an idle state, that applies to the processor as a whole. 51 time. The entire cores are CPUs in that case and if the hardware is asked to 52 enter an idle state, that applies to the core that asked for it in the first 54 that the core belongs to (in fact, it may apply to an entire hierarchy of larger 57 remaining core asks the processor to enter an idle state, that may trigger it 59 other cores in that unit. [all …]
|
| /kernel/linux/linux-6.6/tools/perf/pmu-events/arch/x86/haswell/ |
| D | virtual-memory.json | 3 "BriefDescription": "Load misses in all DTLB levels that cause page walks", 6 "PublicDescription": "Misses in all TLB levels that cause a page walk of any page size.", 19 …"BriefDescription": "Load operations that miss the first DTLB level but hit the second and do not … 27 "BriefDescription": "Load misses that miss the DTLB and hit the STLB (2M)", 30 …"PublicDescription": "This event counts load operations from a 2M page that miss the first DTLB le… 35 "BriefDescription": "Load misses that miss the DTLB and hit the STLB (4K)", 38 …"PublicDescription": "This event counts load operations from a 4K page that miss the first DTLB le… 43 … Miss in all translation lookaside buffer (TLB) levels causes a page walk that completes of any pa… 51 "BriefDescription": "Load miss in all TLB levels causes a page walk that completes. (1G)", 58 … Miss in all translation lookaside buffer (TLB) levels causes a page walk that completes (2M/4M).", [all …]
|
| /kernel/linux/linux-6.6/tools/perf/pmu-events/arch/x86/haswellx/ |
| D | virtual-memory.json | 3 "BriefDescription": "Load misses in all DTLB levels that cause page walks", 6 "PublicDescription": "Misses in all TLB levels that cause a page walk of any page size.", 19 …"BriefDescription": "Load operations that miss the first DTLB level but hit the second and do not … 27 "BriefDescription": "Load misses that miss the DTLB and hit the STLB (2M)", 30 …"PublicDescription": "This event counts load operations from a 2M page that miss the first DTLB le… 35 "BriefDescription": "Load misses that miss the DTLB and hit the STLB (4K)", 38 …"PublicDescription": "This event counts load operations from a 4K page that miss the first DTLB le… 43 … Miss in all translation lookaside buffer (TLB) levels causes a page walk that completes of any pa… 51 "BriefDescription": "Load miss in all TLB levels causes a page walk that completes. (1G)", 58 … Miss in all translation lookaside buffer (TLB) levels causes a page walk that completes (2M/4M).", [all …]
|
| /kernel/linux/linux-6.6/tools/perf/pmu-events/arch/x86/silvermont/ |
| D | cache.json | 3 …"BriefDescription": "Counts the number of request that were not accepted into the L2Q because the … 6 …that would have gone directly to the XQ, but are rejected due to a full or nearly full condition, … 13 …that fetch is stalled due to an outstanding ICache miss. That is, the decoder queue is able to acc… 18 … "BriefDescription": "Counts the number of request from the L2 that were not accepted into the XQ", 21 …"PublicDescription": "This event counts the number of demand and prefetch transactions that the L2… 36 …"PublicDescription": "This event counts requests originating from the core that references a cache… 61 …"PublicDescription": "This event counts the number of load ops retired that got data from the othe… 69 …ption": "This event counts the number of load ops retired that miss in L1 Data cache. Note that pr… 78 "PublicDescription": "This event counts the number of load ops retired that hit in the L2.", 87 … "PublicDescription": "This event counts the number of load ops retired that miss in the L2.", [all …]
|
| /kernel/linux/linux-6.6/LICENSES/preferred/ |
| D | LGPL-2.1 | 45 price. Our General Public Licenses are designed to make sure that you have 47 service if you wish); that you receive source code or can get it if you 48 want it; that you can change the software and use pieces of it in new free 49 programs; and that you are informed that you can do these things. 51 To protect your rights, we need to make restrictions that forbid 57 a fee, you must give the recipients all the rights that we gave you. You 58 must make sure that they, too, receive or can get the source code. If you 60 the recipients, so that they can relink them with the library after making 68 To protect each distributor, we want to make it very clear that there is no 70 else and passed on, the recipients should know that what they have is not [all …]
|
| D | LGPL-2.0 | 39 General Public Licenses are designed to make sure that you have the freedom 41 wish), that you receive source code or can get it if you want it, that you 42 can change the software or use pieces of it in new free programs; and that 45 To protect your rights, we need to make restrictions that forbid anyone to 51 a fee, you must give the recipients all the rights that we gave you. You 52 must make sure that they, too, receive or can get the source code. If you 54 the recipients so that they can relink them with the library, after making 62 Also, for each distributor's protection, we want to make certain that 63 everyone understands that there is no warranty for this free library. If 65 recipients to know that what they have is not the original version, so that [all …]
|
| /kernel/linux/linux-5.10/LICENSES/preferred/ |
| D | LGPL-2.1 | 43 price. Our General Public Licenses are designed to make sure that you have 45 service if you wish); that you receive source code or can get it if you 46 want it; that you can change the software and use pieces of it in new free 47 programs; and that you are informed that you can do these things. 49 To protect your rights, we need to make restrictions that forbid 55 a fee, you must give the recipients all the rights that we gave you. You 56 must make sure that they, too, receive or can get the source code. If you 58 the recipients, so that they can relink them with the library after making 66 To protect each distributor, we want to make it very clear that there is no 68 else and passed on, the recipients should know that what they have is not [all …]
|
| D | LGPL-2.0 | 39 General Public Licenses are designed to make sure that you have the freedom 41 wish), that you receive source code or can get it if you want it, that you 42 can change the software or use pieces of it in new free programs; and that 45 To protect your rights, we need to make restrictions that forbid anyone to 51 a fee, you must give the recipients all the rights that we gave you. You 52 must make sure that they, too, receive or can get the source code. If you 54 the recipients so that they can relink them with the library, after making 62 Also, for each distributor's protection, we want to make certain that 63 everyone understands that there is no warranty for this free library. If 65 recipients to know that what they have is not the original version, so that [all …]
|
| /kernel/linux/linux-6.6/Documentation/networking/devlink/ |
| D | devlink-trap.rst | 21 kernel so that it will route it as well and generate an ICMP Time Exceeded 39 as it allows users to obtain further visibility into packet drops that would 123 Generic packet traps are used to describe traps that trap well-defined packets 124 or packets that are trapped due to well-defined conditions (e.g., TTL error). 136 - Traps incoming packets that the device decided to drop because of a 140 - Traps incoming packets that the device decided to drop in case of VLAN 145 - Traps incoming packets that the device decided to drop in case they are 146 tagged with a VLAN that is not configured on the ingress bridge port 149 - Traps incoming packets that the device decided to drop in case the STP 153 - Traps packets that the device decided to drop in case they need to be [all …]
|
| /kernel/linux/linux-6.6/include/kunit/ |
| D | test.h | 99 * that makes expectations and assertions (see KUNIT_EXPECT_TRUE() and 197 * is used to lazily generate a series of arbitrarily typed values that fit into 233 * A kunit_suite is a collection of related &struct kunit_case s, such that 238 * Note that @exit and @suite_exit will run even if @init or @suite_init 298 * Because resources is a list that may be updated multiple times (with 383 * This functions identically as kunit_test_suites() except that it suppresses 391 * The only thing this macro does that's different from kunit_test_suites is 392 * that it suffixes the array and suite declarations it makes with _probe; 419 * Note that some internal context data is also allocated with GFP_KERNEL, 432 * Note that some internal context data is also allocated with GFP_KERNEL, [all …]
|