Searched +refs:is +refs:merge +refs:attempt (Results 1 – 24 of 24) sorted by relevance
| /linux-6.15/Documentation/block/ |
| D | deadline-iosched.rst | 19 The goal of the deadline io scheduler is to attempt to guarantee a start
20 service time for a request. As we focus mainly on read latencies, this is
21 tunable. When a read request first enters the io scheduler, it is assigned
22 a deadline that is the current time + the read_expire value in units of
41 throughput. When low latency is the primary concern, smaller is better (where
60 Sometimes it happens that a request enters the io scheduler that is contiguous
61 with a request that is already on the queue. Either it fits in the back of that
62 request, or it fits at the front. That is called either a back merge candidate
63 or a front merge candidate. Due to the way files are typically laid out,
65 may even know that it is a waste of time to spend any time attempting to
[all …]
|
| /linux-6.15/Documentation/process/ |
| D | 7.AdvancedTopics.rst | 7 works. There is still more to learn, however! This section will cover a
25 edges and poses certain hazards; it is a young and powerful tool which is
26 still being civilized by its developers. This document will not attempt to
38 The first order of business is to read the above sites and get a solid
43 rewriting of history (such as rebase) is also useful. Git comes with its
54 server with git-daemon is relatively straightforward if you have a system
55 which is accessible to the Internet. Otherwise, free, public hosting sites
62 maintained independently. Branches in git are cheap, there is no reason to
65 Publicly-available branches should be created with care; merge in patches
91 changes should not be rewritten. Git will attempt to enforce this rule if
[all …]
|
| D | backporting.rst | 19 when a merge conflict does pop up, it can be daunting. Luckily,
20 resolving conflicts is a skill like any other, and there are many useful
36 If you've ever used ``git am``, you probably already know that it is
41 It is strongly recommended to instead find an appropriate base version
53 problem with applying the patch to the "wrong" base is that it may pull
57 A good reason to prefer ``git cherry-pick`` over ``git am`` is that git
76 Note that if you are submitting a patch for stable, the format is
101 to. However, the reverse is also possible. In any case, the result is a
106 the conflict is and how the two branches have diverged. Resolving the
118 We will not cover using dedicated merge tools here beyond providing some
[all …]
|
| D | 5.Posting.rst | 6 Sooner or later, the time comes when your work is ready to be presented to
11 document will attempt to cover these expectations in reasonable detail;
20 There is a constant temptation to avoid posting patches before they are
21 completely "ready." For simple patches, that is not a problem. If the
22 work being done is complex, though, there is a lot to be gained by getting
23 feedback from the community before the work is complete. So you should
27 When posting code which is not yet considered ready for inclusion, it is a
45 - Make sure your code is compliant with the kernel coding style
49 benchmarks showing what the impact (or benefit) of your change is; a
64 but, once again, attempting to save time here is not generally advisable
[all …]
|
| D | 1.Intro.rst | 18 release cycle, and the mechanics of the merge window. The various phases in
19 the patch development, review, and merging cycle are covered. There is some
27 :ref:`development_coding` is about the coding process; several pitfalls which
29 patches are covered, and there is an introduction to some of the tools
39 job is far from done at that point. Working with reviewers is a crucial part
42 assuming that the job is done when a patch is merged into the mainline.
50 What this document is about
54 contributors to each release, is one of the largest and most active free
58 supercomputers in existence, and all types of systems in between. It is a
72 One of the most compelling features of Linux is that it is accessible to
[all …]
|
| D | maintainer-pgp-guide.rst | 9 This document is aimed at Linux kernel developers, and especially at
20 PGP helps ensure the integrity of the code that is produced by the Linux
24 The Linux kernel source code is available in two main formats:
51 The above guiding principle is the reason why this guide is needed. We
54 The goal is to provide a set of guidelines developers can use to create
73 version that is prior than 2.2, then some commands from this guide may
79 The GnuPG agent is a helper tool that will start automatically whenever
86 The default is 600 (10 minutes).
90 default is 30 minutes.
101 It is no longer necessary to start gpg-agent manually at the
[all …]
|
| D | applying-patches.rst | 11 This document is obsolete. In most cases, rather than using ``patch``
14 A frequently asked question on the Linux Kernel Mailing List is how to apply
21 their specific patches) is also provided.
24 What is a patch?
27 A patch is a small text document containing a delta of changes between two
50 Since this is unlikely to match the name of the kernel source dir on your
51 local machine (but is often useful info to see what version an otherwise
87 If your patch file is compressed with gzip or xz and you don't want to
105 except for errors which is nice to prevent errors from scrolling out of the
125 One example of something that's not 'quite right' that patch will attempt to
[all …]
|
| D | submitting-patches.rst | 8 with "the system." This text is a collection of suggestions which
41 the tree is not listed there.
48 Describe your problem. Whether your patch is a one-line bug fix or
50 motivated you to do this work. Convince the reviewer that there is a
72 Once the problem is established, describe what you are actually doing
74 in plain English for the reviewer to verify that the code is behaving
87 say that this is version N of the patch (series). Don't expect the
101 the commit, to make it easier for reviewers to know what it is about.
112 there is no collision with your six-character ID now, that condition may
116 can be found on the web, add 'Link:' tags pointing to it. If the patch is a
[all …]
|
| /linux-6.15/Documentation/ABI/stable/ |
| D | sysfs-block | 5 Storage devices may report a physical block size that is
9 indicates how many bytes the beginning of the device is
21 device is offset from the internal allocation unit's
29 size reported by the device. This parameter is relevant
71 one is reported by the device. This value must be a
74 Any attempt to merge atomic write I/Os must not result in a
83 sequence number, which is a monotonically increasing
86 every time the backing file is changed.
87 The value type is 64 bit unsigned.
99 The value type is unsigned int.
[all …]
|
| /linux-6.15/Documentation/admin-guide/ |
| D | bug-bisect.rst | 19 fixed, or is caused by a .config change you or your Linux distributor performed.
57 If it is broken, run::
63 ensure what you tell Git is correct; it is thus often wise to spend a few
64 minutes more on testing in case your reproducer is unreliable.
71 is the first bad commit', then you have finished the bisection. In that case
90 codebase and check if that fixes your bug; if that is the case, it validates
99 Git might reject this, for example when the bisection landed on a merge
100 commit. In that case, abandon the attempt. Do the same, if Git fails to revert
108 With that the process is complete. Now report the regression as described by
123 linux-next release (found in the 'master' branch) is based on -- the former
[all …]
|
| D | kernel-parameters.txt | 4 By default, unaccepted memory is accepted lazily to
6 some runtime overhead until all memory is eventually
7 accepted. In most cases the overhead is negligible.
62 This option is useful for developers to identify the
88 Some values produce so much output that the system is
100 is denied; legacy drivers trying to access reserved
102 lax: access to resources claimed by ACPI is allowed;
104 will bind successfully but a warning message is logged.
110 By default, this is disabled due to x86 early mapping
142 This feature is enabled by default.
[all …]
|
| D | spkguide.txt | 13 Permission is granted to copy, distribute and/or modify this document
17 copy of the license is included in the section entitled "GNU Free
22 The purpose of this document is to familiarize users with the user
25 http://linux-speakup.org/. Speakup is a set of patches to the standard
30 Speakup. If Speakup is built as a part of a monolithic kernel, and the
31 user is using a hardware synthesizer, then Speakup will be able to
32 provide speech access from the time the kernel is loaded, until the time
33 the system is shutdown. This means that if you have obtained Linux
44 is to boot your system, and Speakup should come up talking. This
45 assumes of course that your synthesizer is a supported hardware
[all …]
|
| /linux-6.15/Documentation/filesystems/ |
| D | fiemap.rst | 7 The fiemap ioctl is an efficient method for userspace to get file
15 A fiemap request is encoded within struct fiemap:
22 those on disk - that is, the logical offset of the 1st returned extent
29 the set of flags which caused the error. If the kernel is compatible
31 It is up to userspace to determine whether rejection of a particular
32 flag is fatal to its operation. This scheme is intended to allow the
37 that can be used to return extents. If fm_extent_count is zero, then the
38 fm_extents[] array is ignored (no extents will be returned), and the
40 fm_extents[] to hold the file's current mapping. Note that there is
46 If this flag is set, the kernel will sync the file before mapping extents.
[all …]
|
| D | zonefs.rst | 10 zonefs is a very simple file system exposing each zone of a zoned block device
17 As such, zonefs is in essence closer to a raw block device access interface
18 than to a full-featured POSIX file system. The goal of zonefs is to simplify
22 example of this approach is the implementation of LSM (log-structured merge)
26 of the higher level construct "one file is one zone" can help reducing the
34 space that is divided into zones. A zone is a group of consecutive LBAs and all
54 The NVMe Zoned NameSpace (ZNS) is a technical proposal of the NVMe standard
62 by sub-directories. This file structure is built entirely using zone information
69 zonefs on-disk metadata is reduced to an immutable super block which
76 The super block is always written on disk at sector 0. The first zone of the
[all …]
|
| /linux-6.15/Documentation/userspace-api/media/v4l/ |
| D | dev-overlay.rst | 24 The default function of a ``/dev/video`` device is video
25 capturing. The overlay function is only available after calling
30 frame rate of the video standard is not guaranteed. Frames may be
40 A common application of two file descriptors is the X11
76 set these parameters, respectively. The :ref:`VIDIOC_S_FBUF <VIDIOC_G_FBUF>` ioctl is
85 card. In this case the frame buffer is not modified by the video device,
87 driver. The :ref:`VIDIOC_S_FBUF <VIDIOC_G_FBUF>` ioctl is not privileged. An application
98 the overlaid image. When the bit is set, the corresponding video
99 pixel is displayed, otherwise a pixel of the graphics surface.
103 video is displayed, so the graphics surface can be seen here.
[all …]
|
| /linux-6.15/Documentation/networking/device_drivers/wifi/intel/ |
| D | ipw2200.rst | 15 PRO/Wireless 2200BG Driver for Linux is a unified driver that works on
57 satellites, and other licensed and unlicensed devices, it is sometimes
59 interference with these devices. In many instances Intel is required to
62 product is granted. Intel's wireless LAN's EEPROM, firmware, and
90 requirements is the responsibility of the individual developer. As
101 The following sections attempt to provide a brief introduction to using
104 This document is not meant to be a comprehensive manual on
133 The distinction between officially supported and enabled is a reflection
145 is via the command line.
147 The general form is::
[all …]
|
| /linux-6.15/Documentation/mm/ |
| D | unevictable-lru.rst | 17 implementation. The latter design rationale is discussed in the context of an
28 folios and to hide these folios from vmscan. This mechanism is based on a patch
58 The Unevictable LRU folio list is a lie. It was never an LRU-ordered
60 inactive folio lists; and now it is not even a folio list. But following
66 indicate that the folio is being managed on the unevictable list.
68 The PG_unevictable flag is analogous to, and mutually exclusive with, the
70 PG_lru is set.
88 anonymous, swap-backed folios. This differentiation is only important
108 not attempt to reclaim pages on the unevictable list. This has a couple of
128 address space flag is provided, and this can be manipulated by a filesystem
[all …]
|
| /linux-6.15/Documentation/core-api/ |
| D | dma-api.rst | 10 This API is split into two pieces. Part I describes the basic API.
13 non-consistent platforms (this is usually only legacy platforms) you
36 Consistent memory is memory for which a write by either the device or
54 The simplest way to do that is to use the dma_pool calls (see below).
99 The "name" is for diagnostics (like a struct kmem_cache name); dev and size
101 alignment requirement for this type of data is "align" (which is expressed
113 allocation attempt succeeded.
136 This puts memory back into the pool. The pool is what was passed to
158 Checks to see if the mask is possible and updates the device
159 streaming and coherent DMA mask parameters if it is.
[all …]
|
| D | dma-api-howto.rst | 9 This is a guide to device driver writers on how to use the DMA API
20 kmalloc(), vmalloc(), and similar interfaces is a virtual address and can
27 address is not directly useful to a driver; it must use ioremap() to map
70 is stored in a struct resource and usually exposed via /proc/iomem. When a
82 Y. But in many others, there is IOMMU hardware that translates DMA
83 addresses to physical addresses, e.g., it translates Z to Y. This is part
107 is in your driver, which provides the definition of dma_addr_t. This type
111 What memory is DMA'able?
114 The first piece of information you must know is what kernel memory can
116 set of rules regarding this, and this text is an attempt to finally
[all …]
|
| /linux-6.15/Documentation/virt/uml/ |
| D | user_mode_linux_howto_v2.rst | 15 User Mode Linux is the first Open Source virtualization platform (first
18 How is UML Different from a VM using Virtualization package X?
28 is not a single real device in sight. It is 100% artificial or if
34 packages is that there is a distinct difference between the way the UML
36 The UML kernel is just a process running on Linux - same as any other
39 The UML userspace, however, is a bit different. The Linux kernel on the
41 on a UML instance is trying to do and making the UML kernel handle all
43 This is different from other virtualization packages which do not make any
53 * If User Mode Linux kernel crashes, your host kernel is still fine. It
54 is not accelerated in any way (vhost, kvm, etc) and it is not trying to
[all …]
|
| /linux-6.15/Documentation/driver-api/media/ |
| D | v4l2-controls.rst | 11 is actually not driver specific and can be moved to the V4L core framework.
13 After all, the only part that a driver developer is interested in is:
23 All the rest is something that can be done centrally.
43 :c:type:`v4l2_ctrl_handler` is the object that keeps track of controls. It
89 The second argument is a hint telling the function how many controls this
90 handler is expected to handle. It will allocate a hashtable based on this
91 information. It is a hint only.
203 control ops, then there is no need to store it.
211 The :c:func:`v4l2_ctrl_new_std_menu` function is very similar but it is
212 used for menu controls. There is no min argument since that is always 0 for
[all …]
|
| /linux-6.15/LICENSES/deprecated/ |
| D | GFDL-1.2 | 27 Everyone is permitted to copy and distribute verbatim copies
28 of this license document, but changing it is not allowed.
33 The purpose of this License is to make a manual, textbook, or other
41 This License is a kind of "copyleft", which means that derivative
43 complements the GNU General Public License, which is a copyleft
49 software does. But this License is not limited to software manuals;
51 whether it is published as a printed book. We recommend this License
52 principally for works whose purpose is instruction or reference.
62 refers to any such manual or work. Any member of the public is a
63 licensee, and is addressed as "you". You accept the license if you
[all …]
|
| /linux-6.15/init/ |
| D | Kconfig | 6 This is used in unclear ways:
8 - Re-run Kconfig when the compiler is updated
10 CC_VERSION_TEXT so it is recorded in include/config/auto.conf.cmd.
11 When the compiler is updated, Kconfig will be invoked.
13 - Ensure full rebuild when the compiler is updated
16 auto-generated dependency. When the compiler is updated, syncconfig
43 # Use clang version if this is the integrated assembler
73 This shows whether a suitable Rust toolchain is available (found).
78 In particular, the Makefile target 'rustavailable' is useful to check
79 why the Rust toolchain is not being detected.
[all …]
|
| /linux-6.15/Documentation/ |
| D | memory-barriers.txt | 14 This document is not a specification; it is intentionally (for the sake of
15 brevity) and unintentionally (due to being human) incomplete. This document is
23 To repeat, this document is not a specification of what Linux expects from
26 The purpose of this document is twofold:
35 that, that architecture is incorrect.
37 Note also that it is possible that a barrier may be a no-op for an
136 abstract CPU, memory operation ordering is very relaxed, and a CPU may actually
189 There is an obvious address dependency here, as the value loaded into D depends
205 locations, but the order in which the control registers are accessed is very
270 WRITE_ONCE(). Without them, the compiler is within its rights to
[all …]
|