Searched full:they (Results 1 – 25 of 4760) sorted by relevance
12345678910>>...191
/Linux-v6.1/Documentation/process/ |
D | management-style.rst | 45 manage had better know the details better than you, so if they come to 51 Namely that you are in the wrong job, and that **they** should be managing 113 not. After all, if **they** aren't certain whether it's a good idea, you 114 sure as hell shouldn't encourage them by promising them that what they 115 work on will be included. Make them at least think twice before they 118 Remember: they'd better know more about the details than you do, and 119 they usually already think they have the answer to everything. The best 121 healthy dose of critical thinking on what they do. 125 clear which approach is better, they'll eventually figure it out. The 127 situation that they just give up. [all …]
|
D | 6.Followthrough.rst | 26 developers as they review the code. Working with reviewers can be, for 42 they see the same mistakes being made over and over again. If you get a 49 be working on the kernel years from now, but they understand that their 50 employer could change. They truly are, almost without exception, 51 working toward the creation of the best kernel they can; they are not 55 you need to pay attention to the technical observations that they are 78 One fatal mistake is to ignore review comments in the hope that they will 79 go away. They will not go away. If you repost code without having 89 time; if you help them get a running start, they will be in a better mood 90 when they revisit your code. [all …]
|
D | 2.Process.rst | 45 merge window do not come out of thin air; they have been collected, tested, 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 128 Some kernels are designated "long term" kernels; they will receive support 166 developers on that list reply with any comments they may have. This 182 make those changes or justify why they should not be made. If your 225 of the kernel they manage; they are the ones who will (usually) accept a 236 the patches they have selected for merging from their repositories. If 279 mailing list, or they may apply to a part of the kernel for which there is 300 lists when they are assembled; they can be downloaded from: [all …]
|
D | volatile-considered-harmful.rst | 8 changed outside of the current thread of execution; as a result, they are 10 being used. In other words, they have been known to treat volatile types 11 as a sort of easy atomic variable, which they are not. The use of volatile in 23 unwanted optimization. If they are being used properly, there will be no 38 primitives act as memory barriers - they are explicitly written to do so - 101 volatile should take a step back and think about what they are truly trying 105 they come with a justification which shows that the concurrency issues have
|
/Linux-v6.1/tools/perf/pmu-events/arch/x86/icelakex/ |
D | floating-point.json | 15 … SQRT DPP FM(N)ADD/SUB. DPP and FM(N)ADD/SUB instructions count twice as they perform 2 calculati… 21 … SQRT DPP FM(N)ADD/SUB. DPP and FM(N)ADD/SUB instructions count twice as they perform 2 calculati… 26 … SQRT DPP FM(N)ADD/SUB. DPP and FM(N)ADD/SUB instructions count twice as they perform 2 calculati… 32 …T RCP DPP FM(N)ADD/SUB. DPP and FM(N)ADD/SUB instructions count twice as they perform 2 calculati… 37 … DIV MIN MAX SQRT FM(N)ADD/SUB. FM(N)ADD/SUB instructions count twice as they perform 2 calculati… 43 … DIV MIN MAX SQRT FM(N)ADD/SUB. FM(N)ADD/SUB instructions count twice as they perform 2 calculati… 48 …T RCP DPP FM(N)ADD/SUB. DPP and FM(N)ADD/SUB instructions count twice as they perform 2 calculati… 54 …T RCP DPP FM(N)ADD/SUB. DPP and FM(N)ADD/SUB instructions count twice as they perform 2 calculati… 59 …SQRT RSQRT14 RCP14 FM(N)ADD/SUB. FM(N)ADD/SUB instructions count twice as they perform 2 calculati… 65 …SQRT RSQRT14 RCP14 FM(N)ADD/SUB. FM(N)ADD/SUB instructions count twice as they perform 2 calculati… [all …]
|
/Linux-v6.1/tools/perf/pmu-events/arch/x86/icelake/ |
D | floating-point.json | 15 … SQRT DPP FM(N)ADD/SUB. DPP and FM(N)ADD/SUB instructions count twice as they perform 2 calculati… 21 … SQRT DPP FM(N)ADD/SUB. DPP and FM(N)ADD/SUB instructions count twice as they perform 2 calculati… 26 … SQRT DPP FM(N)ADD/SUB. DPP and FM(N)ADD/SUB instructions count twice as they perform 2 calculati… 32 …T RCP DPP FM(N)ADD/SUB. DPP and FM(N)ADD/SUB instructions count twice as they perform 2 calculati… 37 … DIV MIN MAX SQRT FM(N)ADD/SUB. FM(N)ADD/SUB instructions count twice as they perform 2 calculati… 43 … DIV MIN MAX SQRT FM(N)ADD/SUB. FM(N)ADD/SUB instructions count twice as they perform 2 calculati… 48 …T RCP DPP FM(N)ADD/SUB. DPP and FM(N)ADD/SUB instructions count twice as they perform 2 calculati… 54 …T RCP DPP FM(N)ADD/SUB. DPP and FM(N)ADD/SUB instructions count twice as they perform 2 calculati… 59 …SQRT RSQRT14 RCP14 FM(N)ADD/SUB. FM(N)ADD/SUB instructions count twice as they perform 2 calculati… 65 …SQRT RSQRT14 RCP14 FM(N)ADD/SUB. FM(N)ADD/SUB instructions count twice as they perform 2 calculati… [all …]
|
/Linux-v6.1/tools/perf/pmu-events/arch/x86/tigerlake/ |
D | floating-point.json | 14 … SQRT DPP FM(N)ADD/SUB. DPP and FM(N)ADD/SUB instructions count twice as they perform 2 calculati… 20 … SQRT DPP FM(N)ADD/SUB. DPP and FM(N)ADD/SUB instructions count twice as they perform 2 calculati… 25 … SQRT DPP FM(N)ADD/SUB. DPP and FM(N)ADD/SUB instructions count twice as they perform 2 calculati… 31 …T RCP DPP FM(N)ADD/SUB. DPP and FM(N)ADD/SUB instructions count twice as they perform 2 calculati… 36 … DIV MIN MAX SQRT FM(N)ADD/SUB. FM(N)ADD/SUB instructions count twice as they perform 2 calculati… 42 … DIV MIN MAX SQRT FM(N)ADD/SUB. FM(N)ADD/SUB instructions count twice as they perform 2 calculati… 47 …T RCP DPP FM(N)ADD/SUB. DPP and FM(N)ADD/SUB instructions count twice as they perform 2 calculati… 53 …T RCP DPP FM(N)ADD/SUB. DPP and FM(N)ADD/SUB instructions count twice as they perform 2 calculati… 58 …SQRT RSQRT14 RCP14 FM(N)ADD/SUB. FM(N)ADD/SUB instructions count twice as they perform 2 calculati… 64 …SQRT RSQRT14 RCP14 FM(N)ADD/SUB. FM(N)ADD/SUB instructions count twice as they perform 2 calculati… [all …]
|
/Linux-v6.1/Documentation/core-api/ |
D | errseq.rst | 39 can tell whether the value has changed since they last checked it. 54 They're all handing him work to do -- so much he can't keep track of who 56 just want to know when he's finished all of the work they've handed him so 57 far and whether he made any mistakes since they last asked. 59 He might have made the mistake on work they didn't actually hand him, 75 The supervisors come in and get an initial read for the day. They 88 Now they start handing him tasks to do. Every few minutes they ask him to 89 finish up all of the work they've handed him so far. Then they ask him 106 and they each get the error when they next check. Subsequent calls will 111 whether one was made since they last checked, and the latest value
|
D | asm-annotations.rst | 31 When these macros are used correctly, they help assemblers generate a nice 96 ``.text``. Data do not contain instructions, so they have to be treated 97 specially by the tools: they should not treat the bytes as instructions, 110 most frequent markings**. They are used for functions with standard calling 111 conventions -- global and local. Like in C, they both align the functions to 162 ``SYM_{CODE,FUNC}_START`` and ``SYM_{CODE,FUNC}_END``. They are very similar 163 to C labels, except they can be made global. An example of use:: 200 In the end, they expand to ``SYM_DATA_START`` with ``SYM_DATA_END`` 211 symbol marked by them. They are used either in ``_LABEL`` variants of the
|
/Linux-v6.1/tools/perf/pmu-events/arch/x86/broadwellx/ |
D | floating-point.json | 3 … SQRT DPP FM(N)ADD/SUB. DPP and FM(N)ADD/SUB instructions count twice as they perform 2 calculati… 8 … SQRT DPP FM(N)ADD/SUB. DPP and FM(N)ADD/SUB instructions count twice as they perform 2 calculati… 13 …T RCP DPP FM(N)ADD/SUB. DPP and FM(N)ADD/SUB instructions count twice as they perform 4 calculati… 18 …T RCP DPP FM(N)ADD/SUB. DPP and FM(N)ADD/SUB instructions count twice as they perform 2 calculati… 23 … DIV MIN MAX SQRT FM(N)ADD/SUB. FM(N)ADD/SUB instructions count twice as they perform 4 calculati… 28 … DIV MIN MAX SQRT FM(N)ADD/SUB. FM(N)ADD/SUB instructions count twice as they perform 2 calculati… 33 …T RCP DPP FM(N)ADD/SUB. DPP and FM(N)ADD/SUB instructions count twice as they perform 8 calculati… 38 …T RCP DPP FM(N)ADD/SUB. DPP and FM(N)ADD/SUB instructions count twice as they perform 2 calculati… 43 … SQRT DPP FM(N)ADD/SUB. DPP and FM(N)ADD/SUB instructions count twice as they perform multiple ca… 52 …T RCP DPP FM(N)ADD/SUB. DPP and FM(N)ADD/SUB instructions count twice as they perform multiple ca… [all …]
|
/Linux-v6.1/Documentation/locking/ |
D | spinlocks.rst | 39 using spinlocks they tend to expand to areas you might not have noticed 41 shared data structures **everywhere** they are used. The spinlocks are most 47 touches a shared variable has to agree about the spinlock they want 57 (rw_lock) versions of the spinlocks are sometimes useful. They allow multiple 100 The single spin-lock primitives above are by no means the only ones. They 102 but partly **because** they are safe they are also fairly slow. They are slower 103 than they'd need to be, because they do have to disable interrupts
|
/Linux-v6.1/tools/perf/pmu-events/arch/x86/sapphirerapids/ |
D | floating-point.json | 71 … SQRT DPP FM(N)ADD/SUB. DPP and FM(N)ADD/SUB instructions count twice as they perform 2 calculati… 77 … SQRT DPP FM(N)ADD/SUB. DPP and FM(N)ADD/SUB instructions count twice as they perform 2 calculati… 82 … SQRT DPP FM(N)ADD/SUB. DPP and FM(N)ADD/SUB instructions count twice as they perform 2 calculati… 88 …T RCP DPP FM(N)ADD/SUB. DPP and FM(N)ADD/SUB instructions count twice as they perform 2 calculati… 93 … DIV MIN MAX SQRT FM(N)ADD/SUB. FM(N)ADD/SUB instructions count twice as they perform 2 calculati… 99 … DIV MIN MAX SQRT FM(N)ADD/SUB. FM(N)ADD/SUB instructions count twice as they perform 2 calculati… 104 …T RCP DPP FM(N)ADD/SUB. DPP and FM(N)ADD/SUB instructions count twice as they perform 2 calculati… 110 …T RCP DPP FM(N)ADD/SUB. DPP and FM(N)ADD/SUB instructions count twice as they perform 2 calculati… 115 …SQRT RSQRT14 RCP14 FM(N)ADD/SUB. FM(N)ADD/SUB instructions count twice as they perform 2 calculati… 121 …SQRT RSQRT14 RCP14 FM(N)ADD/SUB. FM(N)ADD/SUB instructions count twice as they perform 2 calculati… [all …]
|
/Linux-v6.1/Documentation/input/ |
D | gamepad.rst | 56 all devices have both or any, but they are present at most times. 80 bugs, if they don't. 83 the buttons from this protocol. However, they try to do this in a compatible 111 If only 2 action-buttons are present, they are reported as BTN_SOUTH and 117 If only 3 action-buttons are present, they are reported as (from left 119 If the buttons are aligned perfectly vertically, they are reported as 124 If all 4 action-buttons are present, they can be aligned in two 125 different formations. If diamond-shaped, they are reported as BTN_NORTH, 152 If analog-sticks provide digital buttons, they are mapped accordingly as 167 If only one trigger-button combination is present (upper+lower), they are
|
/Linux-v6.1/arch/hexagon/include/asm/ |
D | tlbflush.h | 16 * ones from smp.c, else they are some local flavors. 36 * The VM kernel doesn't walk page tables, and they are passed to the VMM 37 * by logical address. There doesn't seem to be any possibility that they 39 * they would only be located by consulting the mm structure, and they
|
/Linux-v6.1/tools/perf/pmu-events/arch/x86/skylakex/ |
D | floating-point.json | 8 … SQRT DPP FM(N)ADD/SUB. DPP and FM(N)ADD/SUB instructions count twice as they perform 2 calculati… 18 …T RCP DPP FM(N)ADD/SUB. DPP and FM(N)ADD/SUB instructions count twice as they perform 2 calculati… 28 … DIV MIN MAX SQRT FM(N)ADD/SUB. FM(N)ADD/SUB instructions count twice as they perform 2 calculati… 38 …T RCP DPP FM(N)ADD/SUB. DPP and FM(N)ADD/SUB instructions count twice as they perform 2 calculati… 43 …SQRT RSQRT14 RCP14 FM(N)ADD/SUB. FM(N)ADD/SUB instructions count twice as they perform 2 calculati… 48 …SQRT RSQRT14 RCP14 FM(N)ADD/SUB. FM(N)ADD/SUB instructions count twice as they perform 2 calculati… 53 …SQRT RSQRT14 RCP14 FM(N)ADD/SUB. FM(N)ADD/SUB instructions count twice as they perform 2 calculati… 58 …SQRT RSQRT14 RCP14 FM(N)ADD/SUB. FM(N)ADD/SUB instructions count twice as they perform 2 calculati… 68 … DIV MIN MAX SQRT FM(N)ADD/SUB. FM(N)ADD/SUB instructions count twice as they perform 2 calculati… 78 …AX SQRT RSQRT RCP FM(N)ADD/SUB. FM(N)ADD/SUB instructions count twice as they perform 2 calculati…
|
/Linux-v6.1/Documentation/driver-api/usb/ |
D | dma.rst | 12 though they still must provide DMA-ready buffers (see 13 Documentation/core-api/dma-api-howto.rst). That's how they've worked through 14 the 2.4 (and earlier) kernels, or they can now be DMA-aware. 45 memory. They work like kmalloc and kfree versions that give you the right 55 Most drivers should **NOT** be using these primitives; they don't need 112 - Some drivers may prefer to work with the model that they're mapping large 131 They cannot be used for setup_packet buffers in control requests. 134 they don't have current users. See the source code. Other than the dmasync
|
/Linux-v6.1/Documentation/networking/devlink/ |
D | devlink-trap.rst | 145 - Traps incoming packets that the device decided to drop in case they are 153 - Traps packets that the device decided to drop in case they need to be 159 forwarding the only port from which they should be transmitted through 160 is the port from which they were received 163 - Traps packets that the device decided to drop in case they hit a 171 - Traps packets that the device decided to drop because they could not be 175 - Traps packets that the device decided to drop because they need to 179 - Traps packets that the device decided to drop because they need to be 180 routed and they have a unicast destination IP and a multicast destination 184 - Traps packets that the device decided to drop because they need to be [all …]
|
/Linux-v6.1/Documentation/admin-guide/pm/ |
D | strategies.rst | 32 ``inactive`` (idle). If they are active, they have to be in power states 33 allowing them to process data and to be accessed by software. In turn, if they 34 are inactive, ideally, they should be in low-power states in which they may not 47 sleep states than when they are runtime idle most of the time.
|
/Linux-v6.1/tools/perf/pmu-events/arch/x86/broadwell/ |
D | floating-point.json | 3 … SQRT DPP FM(N)ADD/SUB. DPP and FM(N)ADD/SUB instructions count twice as they perform 2 calculati… 12 …T RCP DPP FM(N)ADD/SUB. DPP and FM(N)ADD/SUB instructions count twice as they perform 4 calculati… 21 … DIV MIN MAX SQRT FM(N)ADD/SUB. FM(N)ADD/SUB instructions count twice as they perform 4 calculati… 30 …T RCP DPP FM(N)ADD/SUB. DPP and FM(N)ADD/SUB instructions count twice as they perform 8 calculati… 39 … SQRT DPP FM(N)ADD/SUB. DPP and FM(N)ADD/SUB instructions count twice as they perform multiple ca… 48 …T RCP DPP FM(N)ADD/SUB. DPP and FM(N)ADD/SUB instructions count twice as they perform multiple ca… 57 …MAX SQRT RSQRT RCP FM(N)ADD/SUB. FM(N)ADD/SUB instructions count twice as they perform multiple ca… 66 … DIV MIN MAX SQRT FM(N)ADD/SUB. FM(N)ADD/SUB instructions count twice as they perform multiple ca… 75 …AX SQRT RSQRT RCP FM(N)ADD/SUB. FM(N)ADD/SUB instructions count twice as they perform multiple ca… 84 … SQRT DPP FM(N)ADD/SUB. DPP and FM(N)ADD/SUB instructions count twice as they perform multiple ca… [all …]
|
/Linux-v6.1/tools/perf/pmu-events/arch/x86/broadwellde/ |
D | floating-point.json | 3 … SQRT DPP FM(N)ADD/SUB. DPP and FM(N)ADD/SUB instructions count twice as they perform multiple ca… 12 … SQRT DPP FM(N)ADD/SUB. DPP and FM(N)ADD/SUB instructions count twice as they perform multiple ca… 21 … SQRT DPP FM(N)ADD/SUB. DPP and FM(N)ADD/SUB instructions count twice as they perform multiple ca… 30 … SQRT DPP FM(N)ADD/SUB. DPP and FM(N)ADD/SUB instructions count twice as they perform multiple ca… 39 … SQRT DPP FM(N)ADD/SUB. DPP and FM(N)ADD/SUB instructions count twice as they perform multiple ca… 48 … SQRT DPP FM(N)ADD/SUB. DPP and FM(N)ADD/SUB instructions count twice as they perform multiple ca… 57 …MAX RSQRT RCP SQRT FM(N)ADD/SUB. FM(N)ADD/SUB instructions count twice as they perform multiple ca… 66 … DIV MIN MAX SQRT FM(N)ADD/SUB. FM(N)ADD/SUB instructions count twice as they perform multiple ca… 75 …AX RCP RSQRT SQRT FM(N)ADD/SUB. FM(N)ADD/SUB instructions count twice as they perform multiple ca… 84 … SQRT DPP FM(N)ADD/SUB. DPP and FM(N)ADD/SUB instructions count twice as they perform multiple ca… [all …]
|
/Linux-v6.1/Documentation/dev-tools/kunit/ |
D | style.rst | 8 strongly encouraged that they are named and written according to the guidelines 10 they may break some tooling, may conflict with other tests, and may not be run 23 To make tests easy to find, they are grouped into suites and subsystems. A test 42 If a test subsystem name has multiple components, they should be separated by 71 The KUnit API and tools do not explicitly know about subsystems. They are 84 Test suites are named after the subsystem they are part of. If a subsystem 89 subsystem (for example, both unit tests and integration tests), they should be 128 Tests should be named after what they are testing. This is often the name of the 130 As tests are C functions, they should be named and written in accordance with
|
/Linux-v6.1/drivers/gpu/drm/i915/ |
D | i915_priolist_types.h | 32 * another context. They get scheduled with their default priority and 33 * once they reach the execlist ports we ensure that they stick on the 34 * HW until finished by pretending that they have maximum priority,
|
/Linux-v6.1/Documentation/filesystems/ |
D | idmappings.rst | 6 Most filesystem developers will have encountered idmappings. They are used when 76 range of the first idmapping anymore (However they are order isomorphic over 136 The kernel is mostly concerned with kernel ids. They are used when performing 155 going to be concerned with how idmappings are created nor how they are used 345 but they are exclusively used when determining file ownership which is why they 346 are called "filesystem ids". They are usually identical to the uid and gid of 347 the caller but can differ. We will just assume they are always identical to not 375 they can solve the problems we observed before. 564 ``chown()``. For example, they could change ownership so that ``dir`` and all 566 idmapping. Let's assume they change ownership so it is compatible with the [all …]
|
/Linux-v6.1/Documentation/driver-api/acpi/ |
D | scan_handlers.rst | 19 acpi_device objects are referred to as "device nodes" in what follows, but they 29 appropriate data, but some of them require additional handling after they have 38 basis of the device node's hardware ID (HID). They are performed by objects 73 scope (if they have scan handlers). Next, it unregisters all of the device 79 is the order in which they are matched against device nodes during namespace 83 first time and they cannot be removed from it.
|
/Linux-v6.1/tools/perf/pmu-events/arch/x86/cascadelakex/ |
D | floating-point.json | 8 … SQRT DPP FM(N)ADD/SUB. DPP and FM(N)ADD/SUB instructions count twice as they perform 2 calculati… 18 …T RCP DPP FM(N)ADD/SUB. DPP and FM(N)ADD/SUB instructions count twice as they perform 2 calculati… 28 … DIV MIN MAX SQRT FM(N)ADD/SUB. FM(N)ADD/SUB instructions count twice as they perform 2 calculati… 38 …T RCP DPP FM(N)ADD/SUB. DPP and FM(N)ADD/SUB instructions count twice as they perform 2 calculati… 43 … SQRT DPP FM(N)ADD/SUB. DPP and FM(N)ADD/SUB instructions count twice as they perform 2 calculati… 48 … SQRT DPP FM(N)ADD/SUB. DPP and FM(N)ADD/SUB instructions count twice as they perform 2 calculati… 53 … SQRT DPP FM(N)ADD/SUB. DPP and FM(N)ADD/SUB instructions count twice as they perform 2 calculati… 58 … SQRT DPP FM(N)ADD/SUB. DPP and FM(N)ADD/SUB instructions count twice as they perform 2 calculati… 68 … DIV MIN MAX SQRT FM(N)ADD/SUB. FM(N)ADD/SUB instructions count twice as they perform 2 calculati… 78 …AX SQRT RSQRT RCP FM(N)ADD/SUB. FM(N)ADD/SUB instructions count twice as they perform 2 calculati…
|
12345678910>>...191