| /linux/tools/memory-model/Documentation/ |
| A D | glossary.txt | 9 dependency" extends from that load extending to the later access.
20 address dependency extends from that rcu_dereference() to that
29 a special operation that includes a load and which orders that
30 load before later memory references running on that same CPU.
37 from" the release store), then all operations preceding that
56 a "control dependency" extends from that load to that store.
81 with that of CPU 2, which in turn interacts with that of CPU 0
90 extends from that load to that later store. For example:
120 that orders all of its CPU's prior accesses, itself, and
167 a special operation that includes a store and which orders that
[all …]
|
| /linux/Documentation/admin-guide/sysctl/ |
| A D | user.rst | 15 limits on the number of namespaces and other objects that have
18 The primary purpose of these limits is to stop programs that
21 intention that the defaults of these limits are set high enough that
26 verified to be below the per user limit in that user namespace.
33 This recursive counting of created objects ensures that creating a
47 The maximum number of ipc namespaces that any user in the current
59 The maximum number of network namespaces that any user in the
65 The maximum number of pid namespaces that any user in the current
71 The maximum number of time namespaces that any user in the current
77 The maximum number of user namespaces that any user in the current
[all …]
|
| /linux/Documentation/core-api/ |
| A 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
57 (usually it means that the cache has been flushed or invalidated
87 - You know that the accesses to this memory won't thrash the TLB.
88 You might know that the accesses are likely to be sequential or
89 that they aren't sequential but it's unlikely you'll ping-pong
92 - You know that the penalty of TLB misses while accessing the
[all …]
|
| /linux/Documentation/process/ |
| A D | management-style.rst | 14 to do with reality. It started as a lark, but that doesn't mean that it
47 competent to make that decision for them.
51 Namely that you are in the wrong job, and that **they** should be managing
67 And people will even see that as true leadership (*cough* bullshit
80 back-tracking is very easy: just tell everybody that you were an
95 deleting it, you may have irrevocably lost the trust of that
126 answer may end up being that both teams get so frustrated by the
127 situation that they just give up.
186 While it turns out that most people are idiots, the corollary to that is
187 sadly that you are one too, and that while we can all bask in the secure
[all …]
|
| A 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
62 Note that you do not have to agree with every change suggested by
70 that you don't realize that something is fundamentally wrong or, perhaps,
81 that your patches go nowhere.
101 in mind, of course, that he may not agree with you either.
181 it with the assumption that you will not be around to maintain it
[all …]
|
| /linux/Documentation/networking/devlink/ |
| A 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
163 - Traps packets that the device decided to drop in case they hit a
230 - Traps unicast IPv4 packets that did not match any route
233 - Traps unicast IPv6 packets that did not match any route
306 This is required, for example, when the address that needs to be
468 This would mean that port number 0 was used or that the header is
481 - Traps packets that the device decided to drop in case they hit a
485 - Traps incoming packets that the device decided to drop because
598 packet rates that are several orders of magnitude higher compared to those that
[all …]
|
| /linux/Documentation/networking/ |
| A D | nexthop-group-resilient.rst | 7 Resilient groups are a type of next-hop group that is aimed at minimizing
34 that they resolve to.
56 the buckets that held it are simply reassigned to other next hops::
86 Next hops that have fewer buckets than their wants count, are called
95 be considered "idle". Buckets that are not idle are busy.
100 1) that have no assigned next hop, or
102 3) that are idle and their next hop is overweight,
149 error code. The use case for this is that the driver notifies the HW that a
236 that contain the next hop with this ID.
271 Note the two buckets that have a shorter idle time. Those are the ones that
[all …]
|
| /linux/Documentation/vm/ |
| A D | active_mm.rst | 14 Cc'd to linux-kernel, because I don't write explanations all that often,
27 difference is that an anonymous address space doesn't care about the
32 The obvious use for a "anonymous address space" is any thread that
34 this category, but even "real" threads can temporarily say that for
36 and that the scheduler might as well try to avoid wasting time on
38 sync does that.
57 To support all that, the "struct mm_struct" now has two counters: a
62 Usually there is at least one real user, but it could be that the real
69 Also, a new rule is that _nobody_ ever has "init_mm" as a real MM any
72 no real VM has yet been created. So code that used to check
[all …]
|
| A 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.
40 In the FLATMEM memory model, there is a global `mem_map` array that
73 that contains `section_mem_map` that is, logically, a pointer to an
77 `MAX_PHYSMEM_BITS` constants defined by each architecture that
79 physical address that an architecture supports, the
111 and uses high bits of a PFN to access the section that maps that page
117 `struct page` objects. A PFN is an index to that array and the
118 offset of the `struct page` from `vmemmap` is the PFN of that
123 map and make sure that `vmemmap` points to that range. In addition,
[all …]
|
| /linux/Documentation/power/ |
| A 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
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
101 IV. Why do we do that?
125 to allocate additional memory and we prevent them from doing that by
134 safeguards against race conditions that might occur in such a case.
145 avoid *that*, there's no question about that. And I suspect that stopping
169 changed and may start to work incorrectly because of that.
188 now doing the sorts of things that kernel threads do
[all …]
|
| /linux/Documentation/filesystems/ |
| A D | path-lookup.rst | 96 changes that affect that lookup. One fairly extreme case is that if
119 that will be particularly relevant is that it is closely integrated
223 that is found there.
311 to the instance of ``d_alloc_parallel()`` that won the race and that
473 not call ``walk_component()`` that last time. Handling that final
525 further up the path and that something that was thought to be valid
583 report that there was an error, that there was nothing to mount, or
1007 It might seem that the name remnants are all that needs to be stored on
1038 on the dentry. This means that the mechanisms that pathname lookup
1242 update the atime on that symlink.
[all …]
|
| A 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
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.
117 would again have an infinite set of contended objects). But that
131 would have to be equal to or a descendent of source. But that means that
[all …]
|
| /linux/Documentation/powerpc/ |
| A D | qe_firmware.rst | 31 the particular license, please see the license text that is distributed with
45 integers that compose the actual QE microcode.
47 The term 'firmware' refers to a binary blob that contains the microcode as
48 well as other data that
55 Firmware files are binary files that contain only a firmware.
70 needs split I-RAM. Split I-RAM is only meaningful for SOCs that have
91 This structure contains 6 words that the application should copy to some
194 'Q', 'E', and 'F'. This is an identifier that indicates that this
219 The 'model' field is a 16-bit number that matches the actual SOC. The
248 'traps' is an array of 16 words that contain hardware trap values
[all …]
|
| /linux/Documentation/RCU/ |
| A D | stallwarn.rst | 33 - Booting Linux using a console connection that is too slow to
40 - Anything that prevents RCU's grace-period kthreads from running.
56 - A CPU-bound real-time task in a CONFIG_PREEMPT_RT kernel that
67 help avoid this problem. However, please note that doing this
74 Note that certain high-overhead debugging options, for example
86 interrupt on a CPU that is not in dyntick-idle mode. This
90 - A hardware or software issue that prevents time-based wakeups
115 leading the realization that the CPU had failed.
118 Note that SRCU does *not* have CPU stall warnings. Please note that
210 This message indicates that CPU 32 detected that CPUs 2 and 16 were both
[all …]
|
| A D | rcu_dereference.rst | 17 bugs due to games that compilers and DEC Alpha can play.
44 bits of that pointer. This clearly means that the pointer
137 that was initialized "a long time ago." The reason
138 this is safe is that even if misordering occurs, the
139 misordering will not affect the accesses that follow
151 - During some prior acquisition of the lock that
182 However, please note that if the compiler knows that the
252 that it loaded into "r2". The fact that this same result can occur due
255 But suppose that the reader needs a consistent view?
380 anything that disables interrupts, or anything that disables
[all …]
|
| /linux/Documentation/driver-api/driver-model/ |
| A D | binding.rst | 6 driver that can control it. Bus drivers have typically handled this
15 The bus type structure contains a list of all devices that are on that bus
18 list of all drivers of that bus type. When driver_register is called
27 to find one that supports it. In order to determine that, the device
28 ID of the device must match one of the device IDs that the driver
39 chance to verify that it really does support the hardware, and that
47 class, and that is set in the driver's devclass field.
63 A symlink is created in the bus's 'devices' directory that points to
66 A symlink is created in the driver's 'devices' directory that points
70 symlink is created in that directory that points to the device's
[all …]
|
| /linux/Documentation/firmware-guide/acpi/ |
| A D | osi.rst | 10 can evaluate that method, look to see if it supports 'XYZ'
14 that OSPM supports"
30 Experience shows that taking untested paths through the BIOS
39 But it is likely that they will all eventually be added.
63 the string when that support is added to the kernel.
71 "object that evaluates to a string that identifies the operating system."
81 the BIOS could use _OS to enable devices that an OS
94 that anybody would install those old operating systems
125 a BIOS that has been tested only with that _OSI returning TRUE.
139 for all BIOS's that invoke it.
[all …]
|
| /linux/Documentation/userspace-api/media/cec/ |
| A D | cec-ioc-dqevent.rst | 40 the new one. This means that intermediate results can be thrown away but
41 that the latest event is always available. This also means that is it
42 possible to read two successive events that have the same value (e.g.
45 it is guaranteed that the state did change in between the two events.
91 size of the message queue guarantees that all messages received in
145 called an initial event will be generated for that filehandle with
146 the CEC Adapter's state at that time.
172 Only applies to adapters that have the ``CEC_CAP_MONITOR_PIN``
181 Only applies to adapters that have the ``CEC_CAP_MONITOR_PIN``
190 Only applies to adapters that have the ``CEC_CAP_MONITOR_PIN``
[all …]
|
| /linux/Documentation/RCU/Design/Expedited-Grace-Periods/ |
| A D | Expedited-Grace-Periods.rst | 21 given that they for all intents and purposes hammer every CPU that
24 The one saving grace is that the hammer has grown a bit smaller
30 of that quiescent state.
49 or a state that is reached after some time.
65 CPUs that might have RCU read-side critical sections.
135 quiescent state at that time.
168 RCU expedited grace period. This means that only those CPUs that have
282 wait for that grace period to complete. However, that is the topic of
425 has already been acquired at that point. This approach ensures that the
429 required, guaranteeing that the four that are provided are sufficient.
[all …]
|
| /linux/Documentation/i2c/ |
| A D | fault-codes.rst | 19 at all, just that the outcome wasn't on the "golden path".
64 or that the reset was attempted but failed.
85 Returned by any component that can't allocate memory when
92 means there's nothing listening at that address.
94 Returned by driver probe() methods to indicate that they
99 that it doesn't, or can't, support.
101 For example, this would be returned when an adapter that
103 one. In that case, the driver making that request should
104 have verified that functionality was supported before it
105 made that block transfer request.
[all …]
|
| /linux/Documentation/filesystems/nfs/ |
| A 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.
104 2. make sure that d_splice_alias is used rather than d_add
[all …]
|
| /linux/Documentation/maintainer/ |
| A 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
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
58 testing services. If you do expose a branch that may be unstable in
80 likely, invalidates much of the testing that was done. A reparented
104 Many projects require that branches in pull requests be based on the
124 usually a summary of the changes that will come with that pull.
132 history into your tree, you cannot rebase that branch, even if you
[all …]
|
| /linux/Documentation/userspace-api/media/v4l/ |
| A 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
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
40 standard that defines spectral weighting functions that model the
41 perception of color. Specifically that standard defines functions that
76 This has resulted in a variety of colorspaces that are used for
88 constructed that transforms CIE XYZ colors to colors in the new
105 The final piece that defines a colorspace is a function that transforms
[all …]
|
| /linux/drivers/pinctrl/intel/ |
| A D | Kconfig | 23 Cherryview/Braswell pinctrl driver provides an interface that
36 provides an interface that allows configuring of PCH pins and
47 interface that allows configuring of SoC pins and using them as
63 This pinctrl driver provides an interface that allows configuring
71 Broxton pinctrl driver provides an interface that allows
79 This pinctrl driver provides an interface that allows configuring
87 This pinctrl driver provides an interface that allows configuring
95 This pinctrl driver provides an interface that allows configuring
103 This pinctrl driver provides an interface that allows configuring
111 This pinctrl driver provides an interface that allows configuring
[all …]
|
| /linux/LICENSES/preferred/ |
| A D | LGPL-2.1 | 47 programs; and that you are informed that you can do these things.
70 affected by problems that might be introduced by others.
116 freedom, it does ensure that the user of a program that is linked with the
158 program that uses the Library does.
178 that you changed the files and the date of any change.
193 application. Therefore, Subsection 2d requires that any
220 this, you must alter all the notices that refer to this License, so that
232 Library into a program that is not a library.
309 with the version that the work was made with.
321 or that you have already sent this user a copy.
[all …]
|