That (full) in projects: Linux-v6.1 - OpenGrok search results

Project(s)

Full Search
Definition
Symbol
File Path
History
Type

Searched full:that (Results 1 – 25 of 7636) sorted by relevance

12 3 4 5 6 7 8 9 10 >>...306

/Linux-v6.1/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 …]
/Linux-v6.1/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 …]
/Linux-v6.1/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 …]
D	handling-regressions.rst	10 user's point of view; if you never read that text, go and at least skim over it 20 * When receiving a mailed report that did not CC the list, bring it into the 68 * When you receive a report by mail that did not CC the list, immediately bring 70 try to ensure it gets CCed again in case you reply to a reply that omitted 93 you want to see tracked; that's important, as regzbot will later look out 104 Regzbot will then automatically associate patches with the report that 126 these tags are of great value for everyone (you included) that might be looking 142 a kernel with a regression that seriously impacts usage", "continue running an 145 supported kernel series that lack required features". 170 more urgency than regressions in mainline pre-releases. That changes after [all …]
/Linux-v6.1/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 …]
/Linux-v6.1/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 …]
/Linux-v6.1/tools/perf/pmu-events/arch/x86/goldmont/
D	cache.json	8 …on which likely indicates back pressure from L2Q. It also counts requests that would have gone dir… 27 …"PublicDescription": "Counts cycles that fetch is stalled due to an outstanding ICache miss. That … 37 …"PublicDescription": "Counts the number of demand and prefetch transactions that the L2 XQ rejects… 46 …"PublicDescription": "Counts memory requests originating from the core that miss in the L2 cache.", 56 …"PublicDescription": "Counts memory requests originating from the core that reference a cache line… 61 "BriefDescription": "Loads retired that came from DRAM (Precise event capable)", 80 …that when the load address was checked by other caching agents (typically another processor) in th… 85 "BriefDescription": "Load uops retired that hit L1 data cache (Precise event capable)", 92 "PublicDescription": "Counts load uops retired that hit the L1 data cache.", 97 "BriefDescription": "Load uops retired that missed L1 data cache (Precise event capable)", [all …]
/Linux-v6.1/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 …]
/Linux-v6.1/include/kunit/
D	test.h	70 * that makes expectations and assertions (see KUNIT_EXPECT_TRUE() and 141 * is used to lazily generate a series of arbitrarily typed values that fit into 162 * A kunit_suite is a collection of related &struct kunit_case s, such that 217 * Because resources is a list that may be updated multiple times (with 287 * This functions identically as kunit_test_suites() except that it suppresses 295 * The only thing this macro does that's different from kunit_test_suites is 296 * that it suffixes the array and suite declarations it makes with _probe; 466 * The opposite of KUNIT_FAIL(), it is an expectation that cannot fail. In other 507 * The opposite of KUNIT_SUCCEED(), it is an expectation that always fails. In 558 * Unfortunately, there is no common type that all types can be promoted to for [all …]
/Linux-v6.1/Documentation/admin-guide/
D	reporting-issues.rst	15 you don't find any, install `the latest release from that series 31 If it shows the problem, search for the change that fixed it in mainline and 47 Once the report is out, answer any questions that come up and help where you 48 can. That includes keeping the ball rolling by occasionally retesting with newer 55 developers. It might be all that's needed for people already familiar with 63 a slightly different order. That's in your interest, to make sure you notice 64 early if an issue that looks like a Linux kernel problem is actually caused by 80 issue, or a really severe problem: those are 'issues of high priority' that 81 need special handling in some steps that are about to follow. 83 * Make sure it's not the kernel's surroundings that are causing the issue [all …]
/Linux-v6.1/Documentation/power/
D	freezing-of-tasks.rst	17 There are three per-task flags used for that, PF_NOFREEZE, PF_FROZEN 18 and PF_FREEZER_SKIP (the last one is auxiliary). The tasks that have 28 sets this variable. After this, it executes try_to_freeze_tasks() that sends a 30 All freezable tasks must react to that by calling try_to_freeze(), which 33 it loop until PF_FROZEN is cleared for it. Then, we say that the task is 40 try_to_freeze() function (defined in include/linux/freezer.h), that checks 47 that combine interruptible sleep with checking if the task is to be frozen and 69 order to clear the PF_FROZEN flag for each frozen task. Then, the tasks that 101 IV. Why do we do that? 111 filesystem-related information that must be consistent with the state of the [all …]
/Linux-v6.1/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 …]
/Linux-v6.1/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 …]
/Linux-v6.1/tools/perf/pmu-events/arch/x86/knightslanding/
D	memory.json	11 …"BriefDescription": "Counts Demand code reads and prefetch code read requests that accounts for r… 22 …"BriefDescription": "Counts Demand code reads and prefetch code read requests that accounts for d… 33 …"BriefDescription": "Counts Demand code reads and prefetch code read requests that accounts for d… 44 …"BriefDescription": "Counts Demand code reads and prefetch code read requests that accounts for r… 55 …"BriefDescription": "Counts Demand code reads and prefetch code read requests that accounts for d… 66 …"BriefDescription": "Counts Demand code reads and prefetch code read requests that accounts for d… 77 …"BriefDescription": "Counts Demand cacheable data and L1 prefetch data read requests that account… 88 …"BriefDescription": "Counts Demand cacheable data and L1 prefetch data read requests that account… 99 …"BriefDescription": "Counts Demand cacheable data and L1 prefetch data read requests that account… 110 …"BriefDescription": "Counts Demand cacheable data and L1 prefetch data read requests that account… [all …]
/Linux-v6.1/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 … 7 …that would have gone directly to the XQ, but are rejected due to a full or nearly full condition, … 15 …that fetch is stalled due to an outstanding ICache miss. That is, the decoder queue is able to acc… 20 … "BriefDescription": "Counts the number of request from the L2 that were not accepted into the XQ", 24 …"PublicDescription": "This event counts the number of demand and prefetch transactions that the L2… 41 …"PublicDescription": "This event counts requests originating from the core that references a cache… 69 …"PublicDescription": "This event counts the number of load ops retired that got data from the othe… 78 …ption": "This event counts the number of load ops retired that miss in L1 Data cache. Note that pr… 88 "PublicDescription": "This event counts the number of load ops retired that hit in the L2.", 98 … "PublicDescription": "This event counts the number of load ops retired that miss in the L2.", [all …]
/Linux-v6.1/Documentation/RCU/
D	checklist.rst	9 that make use of RCU. Violating any of the rules listed below will 10 result in the same sorts of problems that leaving out a locking primitive 17 performance measurements show that RCU is nonetheless the right 35 approach provides the same potential simplifications that garbage 54 information relating to itself that other tasks can read, there 55 by definition can be no bottleneck). Note that the definition 73 Please not that you cannot rely on code known to be built 86 any locks or atomic operations. This means that readers will 93 RCU-protected data structures that have been added to 99 locks (that are acquired by both readers and writers) [all …]
/Linux-v6.1/Documentation/filesystems/nfs/
D	exporting.rst	12 applications that access a filesystem via a remote filesystem protocol 35 tree. This means that if any filesystem object is in the dcache, then 36 all of the ancestors of that filesystem object are also in the dcache. 44 the dcache that are not needed for normal filesystem access. 46 1. The dcache must sometimes contain objects that are not part of the 47 proper prefix. i.e that are not connected to the root. 50 that dentry into place (based on the parent and name in the 52 it is a dcache invariant that directories only have one dentry. 57 any dentry that might not be part of the proper prefix. 62 kept in the dcache. If a dentry that is not already in the dcache [all …]
/Linux-v6.1/Documentation/userspace-api/media/v4l/
D	colorspaces.rst	10 biology. Just because you have three numbers that describe the 'red', 11 'green' and 'blue' components of the color of a pixel does not mean that 12 you can accurately display that color. A colorspace defines what it 13 actually means to have an RGB value of e.g. (255, 0, 0). That is, 17 In order to do that we first need to have a good definition of color, 18 i.e. some way to uniquely and unambiguously define a color so that 20 the human eye has color receptors that are sensitive to three different 34 possible that different SPDs will result in the same stimulation of 39 between SPDs and the perceived color and that resulted in the CIE 1931 40 standard that defines spectral weighting functions that model the [all …]
/Linux-v6.1/Documentation/locking/
D	rt-mutex-design.rst	11 It doesn't describe the reasons why rtmutex.c exists. For that please see 13 that happen without this code, but that is in the concept to understand 17 inheritance (PI) algorithm that is used, as well as reasons for the 18 decisions that were made to implement PI in the manner that was done. 27 to use a resource that a lower priority process has (a mutex for example), 30 is something called unbounded priority inversion. That is when the high 37 that C owns and must wait and lets C run to release the lock. But in the 71 inherited priority, and A then can continue with the resource that C had. 76 Here I explain some terminology that is used in this document to help describe 77 the design that is used to implement PI. [all …]
/Linux-v6.1/Documentation/maintainer/
D	rebasing-and-merging.rst	12 those tools incorrectly, but avoiding problems is not actually all that 15 One thing to be aware of in general is that, unlike many other projects, 26 within a repository. There are two different types of operations that are 43 history; used improperly, it can obscure that history and introduce bugs. 45 There are a few rules of thumb that can help developers to avoid the worst 48 - History that has been exposed to the world beyond your private system 51 work is in need of rebasing, that is usually a sign that it is not yet 54 That said, there are always exceptions. Some trees (linux-next being 58 testing services. If you do expose a branch that may be unstable in 59 this way, be sure that prospective users know not to base work on it. [all …]
/Linux-v6.1/tools/perf/pmu-events/arch/x86/sandybridge/
D	uncore-cache.json	3 … "BriefDescription": "L3 Lookup any request that access cache and found line in E or S-state.", 8 … "PublicDescription": "L3 Lookup any request that access cache and found line in E or S-state.", 13 "BriefDescription": "L3 Lookup any request that access cache and found line in I-state.", 18 "PublicDescription": "L3 Lookup any request that access cache and found line in I-state.", 23 "BriefDescription": "L3 Lookup any request that access cache and found line in M-state.", 28 "PublicDescription": "L3 Lookup any request that access cache and found line in M-state.", 33 "BriefDescription": "L3 Lookup any request that access cache and found line in MESI-state.", 38 … "PublicDescription": "L3 Lookup any request that access cache and found line in MESI-state.", 43 …"BriefDescription": "L3 Lookup external snoop request that access cache and found line in E or S-s… 48 …"PublicDescription": "L3 Lookup external snoop request that access cache and found line in E or S-… [all …]
/Linux-v6.1/tools/perf/pmu-events/arch/x86/haswell/
D	uncore-cache.json	3 … "BriefDescription": "L3 Lookup any request that access cache and found line in E or S-state.", 8 … "PublicDescription": "L3 Lookup any request that access cache and found line in E or S-state.", 13 "BriefDescription": "L3 Lookup any request that access cache and found line in I-state.", 18 "PublicDescription": "L3 Lookup any request that access cache and found line in I-state.", 23 "BriefDescription": "L3 Lookup any request that access cache and found line in M-state.", 28 "PublicDescription": "L3 Lookup any request that access cache and found line in M-state.", 33 "BriefDescription": "L3 Lookup any request that access cache and found line in MESI-state.", 38 … "PublicDescription": "L3 Lookup any request that access cache and found line in MESI-state.", 43 …"BriefDescription": "L3 Lookup external snoop request that access cache and found line in E or S-s… 48 …"PublicDescription": "L3 Lookup external snoop request that access cache and found line in E or S-… [all …]

12 3 4 5 6 7 8 9 10 >>...306