that (full) in projects: kernel - OpenGrok search results

Project(s)

Full Search
Definition
Symbol
File Path
History
Type

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

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

/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-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 …]
D	stable-api-nonsense.rst	15 Please realize that this article describes the in kernel interfaces, not 18 The kernel to userspace interface is the one that application programs use, 19 the syscall interface. That interface is very stable over time, and 20 will not break. I have old programs that were built on a pre 0.9something 21 kernel that still work just fine on the latest 2.6 kernel release. 22 That interface is the one that users and application programmers can count 30 you get that only if your driver is in the main kernel tree. You also 40 It's only the odd person who wants to write a kernel driver that needs 47 that describes kernel drivers that do not have their source code 60 Assuming that we had a stable kernel source interface for the kernel, a [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	xfs-delayed-logging-design.rst	15 required for objects that are frequently logged. Some parts of inodes are more 20 The reason that this is such a concern is that XFS allows multiple separate 24 "re-logging". Conceptually, this is quite simple - all it requires is that any 26 changes in the new transaction that is written to the log. 28 That is, if we have a sequence of changes A through to F, and the object was 46 that an object being relogged does not prevent the tail of the log from ever 59 progresses, ensuring that current operation never gets blocked by itself if the 62 Hence it can be seen that the relogging operation is fundamental to the correct 66 the log over and over again. Worse is the fact that objects tend to get 70 Another feature of the XFS transaction subsystem is that most transactions are [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 37 * check that source is not a directory 61 The rules above obviously guarantee that all directories that are going to be 72 That ordering can change. However, the following is true: 102 blocked on source and it means that it doesn't hold any locks. 105 has a child that is also contended. Indeed, suppose that it is held by 107 is blocked on belongs to child of that object due to (1). 109 It means that one of the operations is cross-directory rename. 111 would have a contended child and we had assumed that no object is its [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-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-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-5.10/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 …]
/kernel/linux/linux-5.10/tools/perf/pmu-events/arch/x86/knightslanding/
D	memory.json	18 …"BriefDescription": "Counts any Prefetch requests that accounts for data responses from MCDRAM Far… 29 …"BriefDescription": "Counts any Prefetch requests that accounts for data responses from MCDRAM Loc… 40 …"BriefDescription": "Counts any Prefetch requests that accounts for data responses from DRAM Far.", 51 …"BriefDescription": "Counts any Prefetch requests that accounts for data responses from DRAM Local… 62 …"BriefDescription": "Counts any Read request that accounts for data responses from MCDRAM Far or … 73 …"BriefDescription": "Counts any Read request that accounts for data responses from MCDRAM Local.", 84 … "BriefDescription": "Counts any Read request that accounts for data responses from DRAM Far.", 95 … "BriefDescription": "Counts any Read request that accounts for data responses from DRAM Local.", 106 …"BriefDescription": "Counts Demand code reads and prefetch code read requests that accounts for d… 117 …"BriefDescription": "Counts Demand code reads and prefetch code read requests that accounts for d… [all …]
D	cache.json	8 …that reference a cache line (cacheable requests) exlcuding SW prefetches filling only to L2 cache … 16 …"BriefDescription": "Counts the number of MEC requests that were not accepted into the L2Q because… 44 …: "This event counts the number of load micro-ops retired that miss in L1 Data cache. Note that pr… 50 "BriefDescription": "Counts the number of load micro-ops retired that miss in L1 D cache" 59 "BriefDescription": "Counts the number of load micro-ops retired that hit in the L2", 69 "BriefDescription": "Counts the number of load micro-ops retired that miss in the L2", 78 "BriefDescription": "Counts the number of load micro-ops retired that caused micro TLB miss" 87 …"BriefDescription": "Counts the loads retired that get the data from the other core in the same ti… 124 …"BriefDescription": "Counts any Prefetch requests that are outstanding, per weighted cycle, from t… 135 …"BriefDescription": "Counts any Prefetch requests that accounts for responses from a snoop request… [all …]
/kernel/linux/linux-5.10/tools/perf/pmu-events/arch/x86/silvermont/
D	cache.json	3 …"PublicDescription": "This event counts the number of demand and prefetch transactions that the L2… 9 … "BriefDescription": "Counts the number of request from the L2 that were not accepted into the XQ" 12 …that would have gone directly to the XQ, but are rejected due to a full or nearly full condition, … 18 …"BriefDescription": "Counts the number of request that were not accepted into the L2Q because the … 21 …"PublicDescription": "This event counts requests originating from the core that references a cache… 39 …that fetch is stalled due to an outstanding ICache miss. That is, the decoder queue is able to acc… 49 …"PublicDescription": "This event counts the number of retired loads that were prohibited from rece… 67 …"PublicDescription": "This event counts the number of retire stores that experienced cache line bo… 73 "BriefDescription": "Store uops that split cache line boundary" 77 …"PublicDescription": "This event counts the number of retire loads that experienced cache line bou… [all …]
/kernel/linux/linux-5.10/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-5.10/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 …]
/kernel/linux/linux-5.10/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 …]
/kernel/linux/linux-5.10/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 …]
/kernel/linux/linux-5.10/Documentation/block/
D	inline-encryption.rst	17 encryption context programmed into that keyslot. This is very different from 37 - IE hardware has a limited number of "keyslots" that can be programmed 41 that specified keyslot. When possible, we want to make multiple requests with 46 needs to be able to use that encryption context when it processes the bio. 55 We add a struct bio_crypt_ctx to struct bio that can 64 We introduce a keyslot manager (KSM) that handles the translation from 67 upper layers. The generic mode of operation is: each device driver that wants 69 Upper layers that want to use IE on this device can then use this KSM in 72 that the device supports IE. 76 referencing that keyslot). When a new encryption context needs a keyslot, it [all …]
/kernel/linux/linux-5.10/Documentation/vm/
D	memory-model.rst	12 however, that this range contains small holes that are not accessible 20 whether it is possible to manually override that default. 34 helpers that allow the conversion from PFN to `struct page` and vice 44 In the FLATMEM memory model, there is a global `mem_map` array that 51 usable until the call to :c:func:`memblock_free_all` that hands all the 55 it may free parts of the `mem_map` array that do not cover the 74 things, `pg_data_t` holds the `node_mem_map` array that maps 75 physical pages belonging to that node. The `node_start_pfn` field of 76 `pg_data_t` is the number of the first page frame belonging to that 87 node hosting that page. [all …]
/kernel/linux/linux-5.10/Documentation/core-api/
D	dma-attributes.rst	5 This document describes the semantics of the DMA attributes that are 11 DMA_ATTR_WEAK_ORDERING specifies that reads and writes to the mapping 12 may be weakly ordered, that is that reads and writes may pass each other. 15 those that do not will simply ignore the attribute and exhibit default 21 DMA_ATTR_WRITE_COMBINE specifies that writes to the mapping may be 25 those that do not will simply ignore the attribute and exhibit default 37 that you won't dereference the pointer returned by dma_alloc_attr(). You 38 can treat it as a cookie that must be passed to dma_mmap_attrs() and 39 dma_free_attrs(). Make sure that both of these also get this attribute 43 DMA_ATTR_NO_KERNEL_MAPPING, those that do not will simply ignore the [all …]
/kernel/linux/linux-5.10/Documentation/driver-api/pm/
D	cpuidle.rst	16 Every time one of the logical CPUs in the system (the entities that appear to 18 cores) is idle after an interrupt or equivalent wakeup event, which means that 20 with it, there is an opportunity to save energy for the processor that it 21 belongs to. That can be done by making the idle logical CPU stop fetching 25 However, there may be multiple different idle states that can be used in such a 27 (from the kernel perspective) and ask the processor to use (or "enter") that 28 particular idle state. That is the role of the CPU idle time management 32 principle, so the generic code that in principle need not depend on the hardware 33 or platform design details in it is separate from the code that interacts with 36 to enter, drivers that pass the governors' decisions on to the hardware and [all …]
/kernel/linux/linux-5.10/Documentation/firmware-guide/acpi/
D	osi.rst	10 can evaluate that method, look to see if it supports 'XYZ' 14 that OSPM supports" 22 Linux runs on two groups of machines -- those that are tested by the OEM 23 to be compatible with Linux, and those that were never tested with Linux, 26 The larger group is the systems tested to run only Windows. Not only that, 30 Experience shows that taking untested paths through the BIOS 37 Windows to its list of _OSI strings. So it is possible that additional strings 39 But it is likely that they will all eventually be added. 52 via the linux-acpi@vger.kernel.org mailing list. When that patch 55 by the OS. Linux distributors can back-port that patch for Linux [all …]
/kernel/linux/linux-5.10/include/kunit/
D	test.h	38 * when finished with it. Note that kunit_alloc_resource() does not require a 113 * that makes expectations and assertions (see KUNIT_EXPECT_TRUE() and 174 * A kunit_suite is a collection of related &struct kunit_case s, such that 221 * Because resources is a list that may be updated multiple times (with 266 * an initcall which we don't want as the idea is that for builtins 325 * object that contains the allocation. This is mostly for testing purposes. 422 * specify an @internal_gfp that is compatible with the use context of your 453 * An instance of kunit_resource_match_t that matches a resource whose 543 * Note that the resource will not be immediately freed since it is likely 638 * The opposite of KUNIT_FAIL(), it is an expectation that cannot fail. In other [all …]

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