Searched full:which (Results 1 – 25 of 2429) sorted by relevance
12345678910>>...98
| /Documentation/process/ |
| D | 4.Coding.rst | 8 code. It is the code which will be examined by other developers and merged
9 (or not) into the mainline tree. So it is the quality of this code which
13 number of ways in which kernel developers can go wrong. Then the focus
14 will shift toward doing things right and the tools which can help in that
28 which does not meet the coding style guidelines. The presence of that code
46 The other trap is to assume that code which is already in the kernel is
56 The coding style document also should not be read as an absolute law which
58 style (a line which becomes far less readable if split to fit within the
81 At a simple level, consider a function which has an argument which is
84 provides. By that time, though, chances are good that the code which
[all …]
|
| D | 1.Intro.rst | 27 :ref:`development_coding` is about the coding process; several pitfalls which
30 which can help to ensure that kernel patches are correct.
56 kernel has evolved into a best-of-breed operating system component which
75 offer this kind of openness, which is a characteristic of the free software
84 evolved its own distinct ways of operating which allow it to function
132 - Code which has been merged into the mainline kernel is available to all
133 Linux users. It will automatically be present on all distributions which
148 Code which is in the mainline, instead, does not require this work as the
151 which has been merged into the mainline has significantly lower
154 - Beyond that, code which is in the kernel will often be improved by other
[all …]
|
| D | 3.Early-stage.rst | 32 misuse of the LSM framework (which is not intended to confer privileges
33 onto processes which they would not otherwise have) and a risk to system
61 - What, exactly, is the problem which needs to be solved?
63 - Who are the users affected by this problem? Which use cases should the
78 - It may well be that the problem is addressed by the kernel in ways which
80 features and capabilities which are not immediately obvious. Not all
83 driver which duplicated an existing driver that the new author had been
84 unaware of. Code which reinvents existing wheels is not only wasteful;
87 - There may be elements of the proposed solution which will not be
96 clear lesson: kernel code which is designed and developed behind closed
[all …]
|
| D | license-rules.rst | 19 which is required to be compatible with the GPL-2.0::
32 The User-space API (UAPI) header files, which describe the interface of
35 which does not extend the GPL requirements to any software which uses it to
37 into any source files which create an executable running on the Linux
43 tools which are used in the context of license compliance.
48 under which the content of the file is contributed. SPDX license
64 possible line in a file which can contain a comment. For the majority
65 of files this is the first line, except for scripts which require the
84 appropriate comment mechanism which the tool accepts shall be used. This
88 there are still older assembler tools which cannot handle C++ style
[all …]
|
| D | volatile-considered-harmful.rst | 11 as a sort of easy atomic variable, which they are not. The use of volatile in
15 to suppress optimization, which is almost never what one really wants to
17 unwanted concurrent access, which is very much a different task. The
21 Like volatile, the kernel primitives which make concurrent access to data
36 change unexpectedly while the_lock is held. Any other code which might
81 - Inline assembly code which changes memory, but which has no other
92 - Pointers to data structures in coherent memory which might be modified
95 indicate which descriptors have been processed, is an example of this
105 they come with a justification which shows that the concurrency issues have
|
| /Documentation/x86/ |
| D | mds.rst | 17 MSBDS leaks Store Buffer Entries which can be speculatively forwarded to a
20 memory address, which can be exploited under certain conditions. Store
23 buffer is repartitioned which can expose data from one thread to the other.
26 L1 miss situations and to hold data which is returned or sent in response
29 deallocated it can retain the stale data of the preceding operations which
30 can then be forwarded to a faulting or assisting load operation, which can
37 contain stale data from a previous operation which can be forwarded to
38 faulting or assisting loads under certain conditions, which again can be
56 - to have a disclosure gadget which exposes the speculatively accessed
59 - to control the pointer through which the disclosure gadget exposes the
[all …]
|
| /Documentation/timers/ |
| D | hpet.rst | 10 each of which can generate oneshot interrupts and at least one of which has
12 also called "timers", which can be misleading since usually timers are
17 role. Many x86 BIOS writers don't route HPET interrupts at all, which
24 platform code which uses timer 0 or 1 as the main timer to intercept HPET
28 The driver provides a userspace API which resembles the API found in the
|
| D | highres.rst | 6 and beyond". The paper is part of the OLS 2006 Proceedings Volume 1, which can
13 The slides contain five figures (pages 2, 15, 18, 20, 22), which illustrate the
37 The main differences to the timer wheel, which holds the armed timer_list type
51 sources, which are registered in the framework and selected on a quality based
53 initializes data structures, which are used by the generic time keeping code to
91 service handler, which is almost inherently hardware dependent.
114 a function pointer in the device description structure, which has to be called
125 The framework adds about 700 lines of code which results in a 2KB increase of
153 which inform hrtimers about availability of new hardware. hrtimers validates
155 switching to high resolution mode. This ensures also that a kernel which is
[all …]
|
| /Documentation/filesystems/ |
| D | ext2.txt | 45 resuid=n The user ID which may use the reserved blocks.
46 resgid=n The group ID which may use the reserved blocks.
85 which is decided when the filesystem is created. Smaller blocks mean
97 bitmap and the inode usage bitmap which show which blocks and inodes
104 in the same block group as the inode which contains them.
126 and which OS created it.
141 structure contains pointers to the filesystem blocks which contain the
148 There are some reserved fields which are currently unused in the inode
149 structure and several which are overloaded. One field is reserved for the
153 by the HURD to reference the inode of a program which will be used to
[all …]
|
| D | ocfs2-online-filecheck.txt | 12 Then, a mount option (errors=continue) is introduced, which would return the
20 This effort is to check/fix small issues which may hinder day-to-day operations
28 This feature is not suited for extravagant checks which involve dependency of
40 by the inode number which caused the error. This inode number would be the
47 Here, <devname> indicates the name of OCFS2 volume device which has been already
49 communicate with kernel space, tell which file(inode number) will be checked or
50 fixed. Currently, three operations are supported, which includes checking
92 small linked list buffer which would contain the last (N) inodes
93 fixed/checked, the detailed errors which were fixed/checked are printed in the
|
| D | sysfs-tagging.txt | 23 and KOBJ_NS_TYPES, and ns will point to the namespace to which it
38 - call kobj_ns_type_register() with its kobj_ns_type_operations which has
39 - current_ns() which returns current's namespace
40 - netlink_ns() which returns a socket's namespace
41 - initial_ns() which returns the initial namesapce
|
| D | seq_file.txt | 17 however. It is not that hard to make a virtual file which returns a
26 which are designed to make it easy for virtual file creators to get it
32 * An iterator interface which lets a virtual file implementation
38 * A set of canned file_operations which implement most operations on
42 loadable module which creates a file called /proc/sequence. The file, when
59 Note that the above article uses create_proc_entry which was removed in
88 the generator of the data, which need not be aware of how a position
97 argument, returning an iterator which will start reading at that
121 also a special value which can be returned by the start() function
166 passed back to user space. This function can also return SEQ_SKIP, which
[all …]
|
| /Documentation/security/ |
| D | sak.rst | 8 An operating system's Secure Attention Key is a security tool which is
10 is an undefeatable way of killing all programs which could be
42 systems which implement C2 level security. This author does not
46 2. On the PC keyboard, SAK kills all applications which have
49 Unfortunately this includes a number of things which you don't
54 You can identify processes which will be killed by SAK with the
67 initscript which launches gpm and changing it thusly:
86 These commands cause **all** daemons which are launched by the
|
| /Documentation/trace/ |
| D | intel_th.rst | 23 - Software Trace Hub (STH), trace source, which is a System Trace
25 - Memory Storage Unit (MSU), trace output, which allows storing
29 - Global Trace Hub (GTH), which is a switch and a central component
34 notable of them is "active", which enables or disables trace output
41 STH registers an stm class device, through which it provides interface
46 buffer, which can later on be read from its device nodes via read() or
59 created and assigned an id number that reflects the order in which TH
61 begin with this id: 0-gth, 0-msc0, 0-msc1, 0-pti, 0-sth, which is
71 # figure out which GTH port is the first memory controller::
108 capture from a remote debug host, which should be connected via one of
[all …]
|
| /Documentation/devicetree/bindings/clock/ |
| D | ux500.txt | 10 CLKRST4, which does not exist.
14 reset, control unit) clocks. The cell indicates which PRCMU
18 The first cell indicates which PRCC block the consumer
20 cell indicates which clock inside the PRCC block it wants,
24 The first cell indicates which PRCC block the consumer
26 cell indicates which clock inside the PRCC block it wants,
|
| D | exynos5433-clock.txt | 10 which generates clocks for IMEM/FSYS/G3D/GSCL/HEVC/MSCL/G2D/MFC/PERIC/PERIS
13 which generates clocks for LLI (Low Latency Interface) IP.
15 which generates clocks for DRAM Memory Controller domain.
17 which generates clocks for UART/I2C/SPI/I2S/PCM/SPDIF/PWM/SLIMBUS IPs.
19 which generates clocks for PMU/TMU/MCT/WDT/RTC/SECKEY/TZPC IPs.
21 which generates clocks for USB/UFS/SDMMC/TSI/PDMA IPs.
23 which generates clocks for G2D/MDMA IPs.
25 which generates clocks for Display (DECON/HDMI/DSIM/MIXER) IPs.
27 which generates clocks for Cortex-A5/BUS/AUDIO clocks.
30 which generates global data buses clock and global peripheral buses clock.
[all …]
|
| /Documentation/filesystems/nfs/ |
| D | knfsd-stats.txt | 6 which the kernel NFS server makes available to userspace. These
8 which is described separately below.
26 The first line is a comment which describes the fields present in
36 The id number of the NFS thread pool to which this line applies.
43 which contains all the nfsd threads and all the CPUs in the system,
53 effects (such as Large Receive Offload) which can combine packets
55 of NFS calls received (which statistic is available elsewhere).
72 pool for the NFS workload (the workload is thread-limited), in which
81 network-facing NFS work is being handled quickly, which is a good
96 - Currently the rate at which the counter is incremented is quite
|
| /Documentation/devicetree/bindings/timer/ |
| D | arm,arch_timer.yaml | 13 ARM cores may have a per-core architected timer, which provides per-cpu timers,
14 or a memory mapped architected timer, which provides up to 8 frames with a
45 only where necessary to work around broken firmware which does not configure
56 description: Indicates the presence of QorIQ erratum A-008585, which says
63 description: Indicates the presence of Hisilicon erratum 161010101, which
71 registers, which contain their architecturally-defined reset values. Only
72 supported for 32-bit systems which follow the ARMv7 architected reset
|
| /Documentation/i2c/ |
| D | instantiating-devices.rst | 6 level. Instead, the software must know which devices are connected on each
17 which is known in advance. It is thus possible to pre-declare the I2C
18 devices which live on this bus. This is done with an array of struct
19 i2c_board_info which is registered by calling i2c_register_board_info().
81 additional properties which might be needed to set up the device, please refer
89 which is currently located at Documentation/firmware-guide/acpi/enumeration.rst.
118 The above code instantiates 1 I2C device on the I2C bus which is on the
122 present or not (for example for an optional feature which is not present
148 The above code instantiates up to 1 I2C device on the I2C bus which is on
153 The driver which instantiated the I2C device is responsible for destroying
[all …]
|
| /Documentation/vm/ |
| D | z3fold.rst | 9 It is a zbud derivative which allows for higher compression
21 up to 3 pages unlike zbud which can store at most 2. Therefore the
26 handle which encodes actual location of the allocated object.
30 which makes it a better fit for small and response-critical systems.
|
| /Documentation/ABI/obsolete/ |
| D | sysfs-driver-hid-roccat-savu | 4 Description: The mouse can store 5 profiles which can be switched by the
11 Which profile to write is determined by the profile number
14 which profile to read.
20 Description: When written, this file lets one select which data from which
28 Description: The mouse can store 5 profiles which can be switched by the
35 Which profile to write is determined by the profile number
56 which profile and key to read.
62 Description: The mouse can store 5 profiles which can be switched by the
|
| /Documentation/admin-guide/ |
| D | cgroup-v2.rst | 109 although there are utility controllers which serve purposes other than
122 processes which belong to the cgroups consisting the inclusive
141 controllers which support v2 and are not bound to a v1 hierarchy are
143 Controllers which are not in active use in the v2 hierarchy can be
196 Initially, only the root cgroup exists to which all processes belong.
203 "cgroup.procs". When read, it lists the PIDs of all processes which
221 A cgroup which doesn't have any children or live processes can be
222 destroyed by removing the directory. Note that a cgroup which doesn't
251 process belong to the same cgroup, which also serves as the resource
252 domain to host resource consumptions which are not specific to a
[all …]
|
| /Documentation/devicetree/bindings/iommu/ |
| D | mediatek,iommu.txt | 54 smi-common. GALS can been seen as a "asynchronous fifo" which could help
59 "mediatek,mt2701-m4u" for mt2701 which uses generation one m4u HW.
60 "mediatek,mt2712-m4u" for mt2712 which uses generation two m4u HW.
61 "mediatek,mt7623-m4u", "mediatek,mt2701-m4u" for mt7623 which uses
63 "mediatek,mt8173-m4u" for mt8173 which uses generation two m4u HW.
64 "mediatek,mt8183-m4u" for mt8183 which uses generation two m4u HW.
70 Here is the list which require this "bclk":
72 Note that m4u use the EMI clock which always has been enabled before kernel
|
| /Documentation/devicetree/bindings/memory-controllers/ |
| D | nvidia,tegra20-emc.txt | 33 next level of nodes below the emc table are used to specify which settings
34 apply for which ram-code settings.
43 for which this node (and children) are valid.
53 There are two ways of specifying which tables to use:
56 and they will always be used (based on which frequency is used).
66 used to select which tables to use.
72 the valid frequency for which the table should be used (in kHz).
73 - clock-frequency : the clock frequency for the EMC at which this
|
| /Documentation/virt/kvm/ |
| D | timekeeping.txt | 23 present some of the problems which arise and solutions available, giving
27 timekeeping which may be difficult to find elsewhere, specifically,
42 channels which can be programmed to deliver periodic or one-shot interrupts.
85 line is set high, a countdown is initiated (which does not stop if the gate is
86 lowered), during which the output is set low. When the count reaches zero,
96 determines the length of the pulse, which alternates between high and low
104 which generates sine-like tones by low-pass filtering the square wave output.
113 (which does not stop if the gate is lowered). When the counter reaches zero,
182 The second device which was available in the original PC was the MC146818 real
186 The RTC is accessed through CMOS variables, which uses an index register to
[all …]
|
12345678910>>...98