they (full) in projects: Linux-v5.4 - OpenGrok search results

Project(s)

Full Search
Definition
Symbol
File Path
History
Type

Searched full:they (Results 1 – 25 of 4825) sorted by relevance

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

/Linux-v5.4/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	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
D	stable-api-nonsense.rst	42 the world, they neither see this interface, nor do they care about it at 50 the technical issues here (not to make light of the legal issues, they 54 kernel source interfaces. They both depend on each other, but we will 110 current interfaces, or figure out a better way to do things. If they do 111 that, they then fix the current interfaces to work better. When they do 138 important changes that needed to be made, and they were made, with 159 well as they can be (unused interfaces are pretty much impossible to
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 127 Some kernels are designated "long term" kernels; they will receive support 171 developers on that list reply with any comments they may have. This 187 make those changes or justify why they should not be made. If your 230 of the kernel they manage; they are the ones who will (usually) accept a 241 the patches they have selected for merging from their repositories. If 284 mailing list, or they may apply to a part of the kernel for which there is 305 lists when they are assembled; they can be downloaded from: [all …]
/Linux-v5.4/tools/perf/pmu-events/arch/x86/icelake/
D	floating-point.json	16 … DIV MIN MAX SQRT FM(N)ADD/SUB. FM(N)ADD/SUB instructions count twice as they perform 2 calculati… 23 … SQRT DPP FM(N)ADD/SUB. DPP and FM(N)ADD/SUB instructions count twice as they perform 2 calculati… 27 …AX SQRT RSQRT RCP FM(N)ADD/SUB. FM(N)ADD/SUB instructions count twice as they perform 2 calculati… 34 … SQRT DPP FM(N)ADD/SUB. DPP and FM(N)ADD/SUB instructions count twice as they perform 2 calculati… 38 … SQRT DPP FM(N)ADD/SUB. DPP and FM(N)ADD/SUB instructions count twice as they perform 2 calculati… 45 …RANGE DPP FM(N)ADD/SUB. DPP and FM(N)ADD/SUB instructions count twice as they perform 2 calculati… 49 …T RCP DPP FM(N)ADD/SUB. DPP and FM(N)ADD/SUB instructions count twice as they perform 2 calculati… 56 … SQRT DPP FM(N)ADD/SUB. DPP and FM(N)ADD/SUB instructions count twice as they perform 2 calculati… 60 … DIV MIN MAX SQRT FM(N)ADD/SUB. FM(N)ADD/SUB instructions count twice as they perform 2 calculati… 67 … SQRT DPP FM(N)ADD/SUB. DPP and FM(N)ADD/SUB instructions count twice as they perform 2 calculati… [all …]
/Linux-v5.4/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
/Linux-v5.4/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-v5.4/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-v5.4/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-v5.4/tools/perf/pmu-events/arch/x86/cascadelakex/
D	floating-point.json	5 … SQRT DPP FM(N)ADD/SUB. DPP and FM(N)ADD/SUB instructions count twice as they perform multiple ca… 14 … SQRT DPP FM(N)ADD/SUB. DPP and FM(N)ADD/SUB instructions count twice as they perform multiple ca… 23 …RCP14 DPP FM(N)ADD/SUB. DPP and FM(N)ADD/SUB instructions count twice as they perform 2 calculati… 32 … SQRT DPP FM(N)ADD/SUB. DPP and FM(N)ADD/SUB instructions count twice as they perform 4 calculati… 41 … SQRT DPP FM(N)ADD/SUB. DPP and FM(N)ADD/SUB instructions count twice as they perform 4 calculati… 50 … SQRT DPP FM(N)ADD/SUB. DPP and FM(N)ADD/SUB instructions count twice as they perform 8 calculati… 59 … SQRT DPP FM(N)ADD/SUB. DPP and FM(N)ADD/SUB instructions count twice as they perform 8 calculati… 68 … SQRT DPP FM(N)ADD/SUB. DPP and FM(N)ADD/SUB instructions count twice as they perform 16 calculat…
/Linux-v5.4/Documentation/driver-api/usb/
D	dma.rst	12 though they still must provide DMA-ready buffers (see 13 ``Documentation/DMA-API-HOWTO.txt``). 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-v5.4/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-v5.4/tools/perf/pmu-events/arch/x86/broadwellx/
D	floating-point.json	27 … DIV MIN MAX SQRT FM(N)ADD/SUB. FM(N)ADD/SUB instructions count twice as they perform multiple ca… 36 …AX RCP RSQRT SQRT FM(N)ADD/SUB. FM(N)ADD/SUB instructions count twice as they perform multiple ca… 45 …MAX RSQRT RCP SQRT FM(N)ADD/SUB. FM(N)ADD/SUB instructions count twice as they perform multiple ca… 54 … SQRT DPP FM(N)ADD/SUB. DPP and FM(N)ADD/SUB instructions count twice as they perform multiple ca… 63 …RSQRT DPP FM(N)ADD/SUB. DPP and FM(N)ADD/SUB instructions count twice as they perform multiple ca… 72 … SQRT DPP FM(N)ADD/SUB. DPP and FM(N)ADD/SUB instructions count twice as they perform multiple ca… 81 … SQRT DPP FM(N)ADD/SUB. DPP and FM(N)ADD/SUB instructions count twice as they perform multiple ca… 90 …RSQRT DPP FM(N)ADD/SUB. DPP and FM(N)ADD/SUB instructions count twice as they perform multiple ca… 99 … SQRT DPP FM(N)ADD/SUB. DPP and FM(N)ADD/SUB instructions count twice as they perform multiple ca… 108 … SQRT DPP FM(N)ADD/SUB. DPP and FM(N)ADD/SUB instructions count twice as they perform multiple ca…
/Linux-v5.4/tools/perf/pmu-events/arch/x86/broadwellde/
D	floating-point.json	27 … DIV MIN MAX SQRT FM(N)ADD/SUB. FM(N)ADD/SUB instructions count twice as they perform multiple ca… 36 …AX RCP RSQRT SQRT FM(N)ADD/SUB. FM(N)ADD/SUB instructions count twice as they perform multiple ca… 45 …MAX RSQRT RCP SQRT FM(N)ADD/SUB. FM(N)ADD/SUB instructions count twice as they perform multiple ca… 54 … SQRT DPP FM(N)ADD/SUB. DPP and FM(N)ADD/SUB instructions count twice as they perform multiple ca… 63 … SQRT DPP FM(N)ADD/SUB. DPP and FM(N)ADD/SUB instructions count twice as they perform multiple ca… 72 … SQRT DPP FM(N)ADD/SUB. DPP and FM(N)ADD/SUB instructions count twice as they perform multiple ca… 81 … SQRT DPP FM(N)ADD/SUB. DPP and FM(N)ADD/SUB instructions count twice as they perform multiple ca… 90 … SQRT DPP FM(N)ADD/SUB. DPP and FM(N)ADD/SUB instructions count twice as they perform multiple ca… 99 … SQRT DPP FM(N)ADD/SUB. DPP and FM(N)ADD/SUB instructions count twice as they perform multiple ca… 108 … SQRT DPP FM(N)ADD/SUB. DPP and FM(N)ADD/SUB instructions count twice as they perform multiple ca…
/Linux-v5.4/tools/perf/pmu-events/arch/x86/broadwell/
D	floating-point.json	32 … DIV MIN MAX SQRT FM(N)ADD/SUB. FM(N)ADD/SUB instructions count twice as they perform multiple ca… 41 …AX RCP RSQRT SQRT FM(N)ADD/SUB. FM(N)ADD/SUB instructions count twice as they perform multiple ca… 50 …MAX RSQRT RCP SQRT FM(N)ADD/SUB. FM(N)ADD/SUB instructions count twice as they perform multiple ca… 59 … SQRT DPP FM(N)ADD/SUB. DPP and FM(N)ADD/SUB instructions count twice as they perform multiple ca… 68 …RSQRT DPP FM(N)ADD/SUB. DPP and FM(N)ADD/SUB instructions count twice as they perform multiple ca… 77 … SQRT DPP FM(N)ADD/SUB. DPP and FM(N)ADD/SUB instructions count twice as they perform multiple ca… 86 … SQRT DPP FM(N)ADD/SUB. DPP and FM(N)ADD/SUB instructions count twice as they perform multiple ca… 95 …RSQRT DPP FM(N)ADD/SUB. DPP and FM(N)ADD/SUB instructions count twice as they perform multiple ca… 104 … SQRT DPP FM(N)ADD/SUB. DPP and FM(N)ADD/SUB instructions count twice as they perform multiple ca… 113 … SQRT DPP FM(N)ADD/SUB. DPP and FM(N)ADD/SUB instructions count twice as they perform multiple ca…
/Linux-v5.4/drivers/gpu/drm/i915/
D	i915_priolist_types.h	`35 * another context. They get scheduled with their default priority and 36 * once they reach the execlist ports we ensure that they stick on the 37 * HW until finished by pretending that they have maximum priority,`
/Linux-v5.4/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-v5.4/tools/perf/pmu-events/arch/x86/skylake/
D	floating-point.json	8 … DIV MIN MAX SQRT FM(N)ADD/SUB. FM(N)ADD/SUB instructions count twice as they perform multiple ca… 17 …AX RCP RSQRT SQRT FM(N)ADD/SUB. FM(N)ADD/SUB instructions count twice as they perform multiple ca… 26 … SQRT DPP FM(N)ADD/SUB. DPP and FM(N)ADD/SUB instructions count twice as they perform multiple ca… 35 … SQRT DPP FM(N)ADD/SUB. DPP and FM(N)ADD/SUB instructions count twice as they perform multiple ca… 44 … SQRT DPP FM(N)ADD/SUB. DPP and FM(N)ADD/SUB instructions count twice as they perform multiple ca… 53 … SQRT DPP FM(N)ADD/SUB. DPP and FM(N)ADD/SUB instructions count twice as they perform multiple ca…
/Linux-v5.4/arch/mips/dec/
D	ioasic-irq.c	`72 * so that if they retrigger before the handler has completed, usually as 73 * a side effect of actions taken by the handler, then they are reissued. 79 * taken and this also means they will not retrigger. Therefore they use 84 * set so that they are run with the interrupt line masked.`
/Linux-v5.4/Documentation/ABI/
D	README	`26 programs can start to rely on these interfaces, but they must be 57 sure they are working in a proper way and do not need to 70 developers feel they are finished. They cannot be removed from the 73 It's up to the developer to place their interfaces in the category they`
/Linux-v5.4/tools/perf/pmu-events/arch/x86/skylakex/
D	floating-point.json	5 … DIV MIN MAX SQRT FM(N)ADD/SUB. FM(N)ADD/SUB instructions count twice as they perform multiple ca… 14 …AX RCP RSQRT SQRT FM(N)ADD/SUB. FM(N)ADD/SUB instructions count twice as they perform multiple ca… 23 … SQRT DPP FM(N)ADD/SUB. DPP and FM(N)ADD/SUB instructions count twice as they perform multiple ca… 32 … SQRT DPP FM(N)ADD/SUB. DPP and FM(N)ADD/SUB instructions count twice as they perform multiple ca… 41 … SQRT DPP FM(N)ADD/SUB. DPP and FM(N)ADD/SUB instructions count twice as they perform multiple ca… 50 … SQRT DPP FM(N)ADD/SUB. DPP and FM(N)ADD/SUB instructions count twice as they perform multiple ca…
/Linux-v5.4/arch/powerpc/platforms/powernv/
D	subcore.c	89 * Non-zero threads are sent to a NAP loop, they don't exit the loop until they 96 * out of NAP. They will then see the core unsplit and exit the NAP loop. 106 * means they must not be running in virtual mode when the split occurs. The 110 * To begin with secondary threads are sent to an assembly routine. There they 111 * switch to real mode, so they are immune to the uninitialised SDR1 value. 112 * Once in real mode they indicate that they are in real mode, and spin waiting 120 * Concurrently the secondaries will notice the split. When they do they set up 121 * their SPRs, notably SDR1, and then they can return to virtual mode and exit
/Linux-v5.4/Documentation/livepatch/
D	livepatch.rst	55 they need to be aware of each other and not step over each other's toes. 66 Functions are there for a reason. They take some input parameters, get or 71 example, they add a NULL pointer or a boundary check, fix a race by adding 128 3. For idle "swapper" tasks, since they don't ever exit the kernel, they 138 especially applies to kthreads. They may not be woken up and would need 213 a) patching user tasks when they cross the kernel/user space 243 sources. A good practice is to add a prefix to the names so that they 245 they can be declared as static because they are not called directly 248 The patch contains only functions that are really modified. But they 285 only when they are available. [all …]
/Linux-v5.4/Documentation/hid/
D	hid-transport.rst	61 They allocate HID device objects and register them with HID core. Transport 72 device failures. Once transport drivers detect unplug or failure events, they 85 driver in whatever way they like. They might just be the same as asynchronous 86 channels, but they can also provide acknowledgement reports, automatic 96 will describe them as two bi-directional channels as they have several 122 - OUTPUT Report: Output reports change device states. They are sent from host 238 Called from HID device drivers once they want to use the device. Transport 247 Called from HID device drivers once they are done with a device. Transport 252 Transport drivers are free to ignore it and deinitialize devices after they 259 Called from HID device drivers once they are interested in data reports. [all …]

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