| /kernel/linux/linux-6.6/include/uapi/linux/ |
| D | coresight-stm.h | 12 * The CoreSight STM supports guaranteed and invariant timing
13 * transactions. Guaranteed transactions are guaranteed to be
16 * timing transactions are not guaranteed to be traced, they
|
| /kernel/linux/linux-5.10/include/uapi/linux/ |
| D | coresight-stm.h | 12 * The CoreSight STM supports guaranteed and invariant timing
13 * transactions. Guaranteed transactions are guaranteed to be
16 * timing transactions are not guaranteed to be traced, they
|
| /kernel/linux/linux-5.10/lib/ |
| D | iomap_copy.c | 16 * time. Order of access is not guaranteed, nor is a memory barrier
39 * time. Order of access is not guaranteed, nor is a memory barrier
60 * time. Order of access is not guaranteed, nor is a memory barrier
|
| /kernel/linux/linux-6.6/lib/ |
| D | iomap_copy.c | 16 * time. Order of access is not guaranteed, nor is a memory barrier
39 * time. Order of access is not guaranteed, nor is a memory barrier
60 * time. Order of access is not guaranteed, nor is a memory barrier
|
| /kernel/linux/linux-5.10/mm/ |
| D | mempool.c | 6 * for guaranteed, deadlock-free memory allocations during
195 * First pre-allocate the guaranteed number of buffers. in mempool_init_node()
215 * @min_nr: the minimum number of elements guaranteed to be
237 * @min_nr: the minimum number of elements guaranteed to be
243 * this function creates and allocates a guaranteed size, preallocated
283 * @new_min_nr: the new minimum number of elements guaranteed to be
287 * it cannot be guaranteed that the pool will be grown to the new
474 * For correctness, we need a test which is guaranteed to trigger in mempool_free()
481 * min_nr is guaranteed to see curr_nr < min_nr unless curr_nr gets in mempool_free()
|
| /kernel/linux/linux-6.6/mm/ |
| D | mempool.c | 6 * for guaranteed, deadlock-free memory allocations during
202 * First pre-allocate the guaranteed number of buffers. in mempool_init_node()
222 * @min_nr: the minimum number of elements guaranteed to be
244 * @min_nr: the minimum number of elements guaranteed to be
250 * this function creates and allocates a guaranteed size, preallocated
290 * @new_min_nr: the new minimum number of elements guaranteed to be
294 * it cannot be guaranteed that the pool will be grown to the new
481 * For correctness, we need a test which is guaranteed to trigger in mempool_free()
488 * min_nr is guaranteed to see curr_nr < min_nr unless curr_nr gets in mempool_free()
|
| /kernel/linux/linux-5.10/drivers/hwtracing/coresight/ |
| D | coresight-stm.c | 14 * Guaranteed timing and support for various packet type coming from the
103 * @guaraneed: is the channel delivery guaranteed.
108 unsigned long *guaranteed; member
390 set_bit(channel, drvdata->chs.guaranteed); in stm_generic_set_options()
394 clear_bit(channel, drvdata->chs.guaranteed); in stm_generic_set_options()
427 stm_flags |= test_bit(channel, drvdata->chs.guaranteed) ? in stm_generic_packet()
830 bitmap_clear(drvdata->chs.guaranteed, 0, drvdata->numsp); in stm_init_default_data()
858 unsigned long *guaranteed; in stm_probe() local
907 guaranteed = devm_kzalloc(dev, bitmap_size, GFP_KERNEL); in stm_probe()
908 if (!guaranteed) in stm_probe()
[all …]
|
| /kernel/linux/linux-6.6/tools/memory-model/litmus-tests/ |
| D | MP+polocks.litmus | 9 * given lock), a CPU is not only guaranteed to see the accesses that other
10 * CPUs made while previously holding that lock, it is also guaranteed
|
| D | MP+porevlocks.litmus | 9 * given lock), a CPU is not only guaranteed to see the accesses that other
10 * CPUs made while previously holding that lock, it is also guaranteed to
|
| /kernel/linux/linux-5.10/tools/memory-model/litmus-tests/ |
| D | MP+polocks.litmus | 9 * given lock), a CPU is not only guaranteed to see the accesses that other
10 * CPUs made while previously holding that lock, it is also guaranteed
|
| D | MP+porevlocks.litmus | 9 * given lock), a CPU is not only guaranteed to see the accesses that other
10 * CPUs made while previously holding that lock, it is also guaranteed to
|
| /kernel/linux/linux-5.10/fs/iomap/ |
| D | apply.c | 36 * span multiple pages - it is only guaranteed to return a range of a in iomap_apply()
41 * that the allocation is guaranteed to succeed later on. Once we copy in iomap_apply()
73 * Now that we have guaranteed that the space allocation will succeed, in iomap_apply()
|
| /kernel/linux/linux-5.10/kernel/locking/ |
| D | percpu-rwsem.c | 56 * writer is guaranteed to see the reader's increment. in __percpu_down_read_trylock()
59 * the writer looks are guaranteed to see the sem->block value, which in __percpu_down_read_trylock()
60 * in turn means that they are guaranteed to immediately decrement in __percpu_down_read_trylock()
232 * If they don't see our store of sem->block, then we are guaranteed to in percpu_down_write()
|
| /kernel/linux/linux-6.6/kernel/locking/ |
| D | percpu-rwsem.c | 58 * writer is guaranteed to see the reader's increment. in __percpu_down_read_trylock()
61 * the writer looks are guaranteed to see the sem->block value, which in __percpu_down_read_trylock()
62 * in turn means that they are guaranteed to immediately decrement in __percpu_down_read_trylock()
243 * If they don't see our store of sem->block, then we are guaranteed to in percpu_down_write()
|
| /kernel/linux/linux-6.6/include/linux/ |
| D | mbcache.h | 24 * guaranteed to be hashed while e_refcnt > 0.
29 * While refcount > 0, the entry is guaranteed to stay in the hash and
|
| D | cgroup.h | 171 * css which finished ->css_online() is guaranteed to be visible in the
194 * css which finished ->css_online() is guaranteed to be visible in the
224 * while inheriting. The state update to the parent is guaranteed to be
255 * css which finished ->css_online() is guaranteed to be visible in the
282 * Also, all are guaranteed to share the same source and destination csses.
445 * reference on and return it. This function is guaranteed to return a
620 * that the new kthreads are guaranteed to stay in the root until in cgroup_init_kthreadd()
|
| /kernel/linux/linux-5.10/include/linux/ |
| D | mbcache.h | 24 * guaranteed to be hashed while e_refcnt > 0.
29 * While refcount > 0, the entry is guaranteed to stay in the hash and
|
| /kernel/linux/linux-6.6/drivers/hwtracing/coresight/ |
| D | coresight-stm.c | 14 * Guaranteed timing and support for various packet type coming from the
104 * @guaraneed: is the channel delivery guaranteed.
109 unsigned long *guaranteed; member
384 set_bit(channel, drvdata->chs.guaranteed); in stm_generic_set_options()
388 clear_bit(channel, drvdata->chs.guaranteed); in stm_generic_set_options()
421 stm_flags |= test_bit(channel, drvdata->chs.guaranteed) ? in stm_generic_packet()
783 bitmap_clear(drvdata->chs.guaranteed, 0, drvdata->numsp); in stm_init_default_data()
857 drvdata->chs.guaranteed = devm_bitmap_zalloc(dev, drvdata->numsp, in stm_probe()
859 if (!drvdata->chs.guaranteed) in stm_probe()
|
| /kernel/linux/linux-6.6/drivers/platform/surface/aggregator/ |
| D | ssh_request_layer.c | 287 * guaranteed that requests cannot be re-submitted), or the in ssh_rtl_tx_try_process_one()
530 * request, we are guaranteed that the completion callback will run on in ssh_rtl_complete()
532 * received. Similarly, this function is guaranteed to run on the in ssh_rtl_complete()
533 * receiver thread. Thus we are guaranteed that if the packet has been in ssh_rtl_complete()
594 * submission process is guaranteed to have entered the critical in ssh_rtl_cancel_nonpending()
597 * guaranteed that, due to the "locked" check in ssh_rtl_submit(), the in ssh_rtl_cancel_nonpending()
599 * from the queue, where we are now guaranteed that the packet is or has in ssh_rtl_cancel_nonpending()
602 * Note that if the cmpxchg() fails, we are guaranteed that ptl has in ssh_rtl_cancel_nonpending()
664 * Now that we have locked the packet, we have guaranteed that it can't in ssh_rtl_cancel_pending()
794 * request. Note that, at this point, the request is guaranteed to have in ssh_rtl_packet_callback()
[all …]
|
| /kernel/linux/linux-5.10/crypto/ |
| D | dh.c | 16 MPI p; /* Value is guaranteed to be set. */
18 MPI g; /* Value is guaranteed to be set. */
19 MPI xa; /* Value is guaranteed to be set. */
|
| /kernel/linux/linux-6.6/Documentation/devicetree/bindings/net/ |
| D | mediatek-bluetooth.txt | 75 guaranteed.
78 design should be guaranteed.
|
| /kernel/linux/linux-5.10/drivers/gpu/drm/vmwgfx/device_include/ |
| D | svga3d_limits.h | 114 * The maximum number of vertex arrays we're guaranteed to support in
120 * The maximum number of primitive ranges we're guaranteed to support
|
| /kernel/linux/linux-5.10/Documentation/devicetree/bindings/net/ |
| D | mediatek-bluetooth.txt | 75 guaranteed.
78 design should be guaranteed.
|
| /kernel/linux/linux-5.10/Documentation/networking/ |
| D | netdevices.rst | 60 Note: netif_running() is guaranteed false
93 Notes: netif_queue_stopped() is guaranteed true
|
| /kernel/linux/linux-5.10/Documentation/core-api/ |
| D | atomic_ops.rst | 42 are guaranteed to be correct reflecting the initialized value if the
63 all threads are guaranteed to be correct reflecting either the value that has
66 is guaranteed to be readable with atomic_read from another thread.
73 The read is atomic in that the return value is guaranteed to be one of the
88 and atomic_set(). This is not uniformly guaranteed, and may change in
331 be guaranteed that no other entity can be accessing the object::
|