| /kernel/linux/linux-5.10/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 …]
|
| /kernel/linux/linux-4.19/Documentation/process/ |
| D | management-style.rst | 44 manage had better know the details better than you, so if they come to
50 Namely that you are in the wrong job, and that **they** should be managing
112 not. After all, if **they** aren't certain whether it's a good idea, you
113 sure as hell shouldn't encourage them by promising them that what they
114 work on will be included. Make them at least think twice before they
117 Remember: they'd better know more about the details than you do, and
118 they usually already think they have the answer to everything. The best
120 healthy dose of critical thinking on what they do.
124 clear which approach is better, they'll eventually figure it out. The
126 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 …]
|
| /kernel/linux/linux-4.19/Documentation/locking/ |
| D | spinlocks.txt | 32 using spinlocks they tend to expand to areas you might not have noticed
34 shared data structures _everywhere_ they are used. The spinlocks are most
40 touches a shared variable has to agree about the spinlock they want
49 (rw_lock) versions of the spinlocks are sometimes useful. They allow multiple
91 The single spin-lock primitives above are by no means the only ones. They
93 but partly _because_ they are safe they are also fairly slow. They are slower
94 than they'd need to be, because they do have to disable interrupts
135 you can use a non-irq version of read locks everywhere - because they
141 within an interrupt, they only read the queue in order to know whom to
142 wake up. So read-locks are safe (which is good: they are very common
|
| /kernel/linux/linux-5.10/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 …]
|
| /kernel/linux/linux-4.19/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
|
| /kernel/linux/linux-5.10/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
|
| /kernel/linux/linux-5.10/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
|
| /kernel/linux/linux-4.19/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
|
| /kernel/linux/linux-5.10/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
|
| /kernel/linux/linux-5.10/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
|
| /kernel/linux/linux-5.10/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.
|
| /kernel/linux/linux-4.19/Documentation/admin-guide/pm/ |
| D | strategies.rst | 28 ``inactive`` (idle). If they are active, they have to be in power states
29 allowing them to process data and to be accessed by software. In turn, if they
30 are inactive, ideally, they should be in low-power states in which they may not
43 sleep states than when they are runtime idle most of the time.
|
| /kernel/linux/linux-5.10/Documentation/driver-api/usb/ |
| D | dma.rst | 12 though they still must provide DMA-ready buffers (see
13 :doc:`/core-api/dma-api-howto`). 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
|
| /kernel/linux/linux-5.10/tools/perf/pmu-events/arch/x86/cascadelakex/ |
| 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 … 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…
30 … SQRT DPP FM(N)ADD/SUB. DPP and FM(N)ADD/SUB instructions count twice as they perform 2 calculati…
39 … 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…
68 …RCP14 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…
|
| /kernel/linux/linux-5.10/tools/perf/pmu-events/arch/x86/skylakex/ |
| D | floating-point.json | 3 …RCP14 DPP FM(N)ADD/SUB. DPP and FM(N)ADD/SUB instructions count twice as they perform 2 calculati…
12 … SQRT DPP FM(N)ADD/SUB. DPP and FM(N)ADD/SUB instructions count twice as they perform 8 calculati…
21 … SQRT DPP FM(N)ADD/SUB. DPP and FM(N)ADD/SUB instructions count twice as they perform 2 calculati…
30 … SQRT DPP FM(N)ADD/SUB. DPP and FM(N)ADD/SUB instructions count twice as they perform 2 calculati…
39 … SQRT DPP FM(N)ADD/SUB. DPP and FM(N)ADD/SUB instructions count twice as they perform 16 calculat…
48 … SQRT DPP FM(N)ADD/SUB. DPP and FM(N)ADD/SUB instructions count twice as they perform 2 calculati…
68 … 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…
|
| /kernel/linux/linux-4.19/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
|
| /kernel/linux/linux-4.19/arch/hexagon/include/asm/ |
| D | tlbflush.h | 29 * ones from smp.c, else they are some local flavors.
49 * The VM kernel doesn't walk page tables, and they are passed to the VMM
50 * by logical address. There doesn't seem to be any possibility that they
52 * they would only be located by consulting the mm structure, and they
|
| /kernel/linux/linux-4.19/tools/perf/pmu-events/arch/x86/broadwell/ |
| D | floating-point.json | 30 … DIV MIN MAX SQRT FM(N)ADD/SUB. FM(N)ADD/SUB instructions count twice as they perform multiple ca…
39 …AX RCP RSQRT SQRT FM(N)ADD/SUB. FM(N)ADD/SUB instructions count twice as they perform multiple ca…
48 …MAX RSQRT RCP SQRT FM(N)ADD/SUB. FM(N)ADD/SUB instructions count twice as they perform multiple ca…
57 … SQRT DPP FM(N)ADD/SUB. DPP and FM(N)ADD/SUB instructions count twice as they perform multiple ca…
66 … SQRT DPP FM(N)ADD/SUB. DPP and FM(N)ADD/SUB instructions count twice as they perform multiple ca…
75 … SQRT DPP FM(N)ADD/SUB. DPP and 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…
93 … SQRT DPP FM(N)ADD/SUB. DPP and FM(N)ADD/SUB instructions count twice as they perform multiple ca…
102 … SQRT DPP FM(N)ADD/SUB. DPP and FM(N)ADD/SUB instructions count twice as they perform multiple ca…
111 … SQRT DPP FM(N)ADD/SUB. DPP and FM(N)ADD/SUB instructions count twice as they perform multiple ca…
|
| /kernel/linux/linux-5.10/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…
|
| /kernel/linux/linux-4.19/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 … 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…
|
| /kernel/linux/linux-5.10/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…
|
| /kernel/linux/linux-4.19/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…
|
| /kernel/linux/linux-5.10/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 In order to make tests as easy to find as possible, they're grouped into suites
43 If a test subsystem name has multiple components, they should be separated by
73 The KUnit API and tools do not explicitly know about subsystems. They're
86 Test suites are named after the subsystem they are part of. If a subsystem
91 subsystem (e.g., both unit tests and integration tests), they should be put into
131 Tests should be named after what they're testing. This is often the name of the
133 As tests are C functions, they should be named and written in accordance with
|