Searched full:guarantee (Results 1 – 25 of 144) sorted by relevance
123456
| /Documentation/sh/ |
| D | booting.rst | 8 guarantee any particular initial register state, kernels built to
|
| /Documentation/networking/ |
| D | page_pool.rst | 63 This lockless guarantee naturally comes from running under a NAPI softirq.
64 The protection doesn't strictly have to be NAPI, any guarantee that allocating
87 must guarantee safe context (e.g NAPI), since it will recycle the page
|
| /Documentation/litmus-tests/rcu/ |
| D | RCU+sync+read.litmus | 10 * This is one implication of the RCU grace-period guarantee, which says (among
|
| D | RCU+sync+free.litmus | 14 * This is one implication of the RCU grace-period guarantee, which says (among
|
| /Documentation/locking/ |
| D | spinlocks.rst | 19 spinlock itself will guarantee the global lock, so it will guarantee that
117 guarantee the same kind of exclusive access, and it will be much faster.
|
| /Documentation/driver-api/usb/ |
| D | anchors.rst | 55 Therefore no guarantee is made that the URBs have been unlinked when
82 destinations in one anchor you have no guarantee the chronologically
|
| /Documentation/core-api/ |
| D | refcount-vs-atomic.rst | 84 Memory ordering guarantee changes:
97 Memory ordering guarantee changes:
108 Memory ordering guarantee changes:
|
| D | this_cpu_ops.rst | 112 surrounding code this_cpu_inc() will only guarantee that one of the
114 guarantee that the OS will not move the process directly before or
230 These operations have no guarantee against concurrent interrupts or
|
| D | workqueue.rst | 140 Forward progress guarantee relies on that workers can be created when
159 forward progress guarantee, flush and work item attributes. ``@flags``
342 * A wq serves as a domain for forward progress guarantee
|
| /Documentation/litmus-tests/ |
| D | README | 34 Both the above litmus tests demonstrate the RCU grace period guarantee
|
| /Documentation/hwmon/ |
| D | shtc1.rst | 54 non-blocking mode. Blocking mode will guarantee the fastest result but
|
| D | sht3x.rst | 34 non-blocking mode. Blocking mode will guarantee the fastest result but
|
| /Documentation/vm/ |
| D | free_page_reporting.rst | 15 pointer used to process the scatterlist. It must also guarantee that it can
|
| D | overcommit-accounting.rst | 30 Useful for applications that want to guarantee their memory
|
| /Documentation/translations/ |
| D | index.rst | 31 no guarantee that a translation is up to date. If what you read in a
|
| /Documentation/RCU/ |
| D | UP.rst | 47 its arguments would cause it to fail to make the fundamental guarantee
76 It is far better to guarantee that callbacks are invoked
|
| /Documentation/block/ |
| D | stat.rst | 15 By having a single file, the kernel can guarantee that the statistics
18 each, it would be impossible to guarantee that a set of readings
|
| D | bfq-iosched.rst | 364 terms of I/O-request dispatches. To guarantee that the actual service
399 the above conditions are needed to guarantee that every BFQ queue
453 means to guarantee a lower latency to them.
460 (at the cost of giving up any strong guarantee on fairness and low
518 The resource-sharing guarantee for a group may partially or totally
|
| D | deadline-iosched.rst | 19 The goal of the deadline io scheduler is to attempt to guarantee a start
|
| /Documentation/filesystems/ |
| D | directory-locking.rst | 62 The rules above obviously guarantee that all directories that are going to be
123 But locking rules for cross-directory rename guarantee that we do not
|
| /Documentation/ |
| D | memory-barriers.txt | 332 of the standard containing this guarantee is Section 3.14, which
382 A write memory barrier gives a guarantee that all the STORE operations
436 A read barrier is a data dependency barrier plus a guarantee that all the
453 A general memory barrier gives a guarantee that all the LOAD and STORE
524 There are certain things that the Linux kernel memory barriers do not guarantee:
526 (*) There is no guarantee that any of the memory accesses specified before a
531 (*) There is no guarantee that issuing a memory barrier on one CPU will have
536 (*) There is no guarantee that a CPU will see the correct order of effects
541 (*) There is no guarantee that some intervening piece of off-the-CPU
878 However, they do -not- guarantee any other sort of ordering:
[all …]
|
| /Documentation/userspace-api/media/v4l/ |
| D | pixfmt-intro.rst | 32 more bytes of padding to guarantee that each row of pixel data has a
|
| /Documentation/RCU/Design/Requirements/ |
| D | Requirements.rst | 58 #. `Grace-Period Guarantee`_
59 #. `Publish/Subscribe Guarantee`_
64 Grace-Period Guarantee
67 RCU's grace-period guarantee is unusual in being premeditated: Jack
68 Slingwine and I had this guarantee firmly in mind when we started work
71 understanding of this guarantee.
73 RCU's grace-period guarantee allows updaters to wait for the completion
83 This guarantee allows ordering to be enforced with extremely low
174 the ``synchronize_rcu()`` in ``start_recovery()`` to guarantee that
196 Although RCU's grace-period guarantee is useful in and of itself, with
[all …]
|
| /Documentation/RCU/Design/Memory-Ordering/ |
| D | Tree-RCU-Memory-Ordering.rst | 13 grace-period memory ordering guarantee is provided.
15 What Is Tree RCU's Grace Period Memory Ordering Guarantee?
33 RCU updaters use this guarantee by splitting their updates into
42 The RCU implementation provides this guarantee using a network
116 RCU's grace-period memory ordering guarantee to extend to any
230 Tree RCU's grace-period memory-ordering guarantee is provided by a
248 If RCU's grace-period guarantee is to mean anything at all, any access
251 portion of RCU's grace period guarantee is shown in the following
|
| /Documentation/infiniband/ |
| D | core_locking.rst | 78 simultaneously. The driver must guarantee that only one CQ event
|
123456