| /kernel/linux/linux-4.19/include/uapi/linux/ |
| D | coresight-stm.h | 11 * The CoreSight STM supports guaranteed and invariant timing
12 * transactions. Guaranteed transactions are guaranteed to be
15 * 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-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-4.19/mm/ |
| D | mempool.c | 6 * for guaranteed, deadlock-free memory allocations during
197 * First pre-allocate the guaranteed number of buffers. in mempool_init_node()
217 * @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
281 * @new_min_nr: the new minimum number of elements guaranteed to be
285 * it cannot be guaranteed that the pool will be grown to the new
468 * For correctness, we need a test which is guaranteed to trigger in mempool_free()
475 * min_nr is guaranteed to see curr_nr < min_nr unless curr_nr gets in mempool_free()
|
| /kernel/linux/linux-4.19/drivers/hwtracing/coresight/ |
| D | coresight-stm.c | 14 * Guaranteed timing and support for various packet type coming from the
102 * @guaraneed: is the channel delivery guaranteed.
107 unsigned long *guaranteed; member
389 set_bit(channel, drvdata->chs.guaranteed); in stm_generic_set_options()
393 clear_bit(channel, drvdata->chs.guaranteed); in stm_generic_set_options()
424 flags |= test_bit(channel, drvdata->chs.guaranteed) ? in stm_generic_packet()
763 bitmap_clear(drvdata->chs.guaranteed, 0, drvdata->numsp); in stm_init_default_data()
790 unsigned long *guaranteed; in stm_probe() local
847 guaranteed = devm_kzalloc(dev, bitmap_size, GFP_KERNEL); in stm_probe()
848 if (!guaranteed) in stm_probe()
[all …]
|
| /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-4.19/lib/ |
| D | iomap_copy.c | 28 * time. Order of access is not guaranteed, nor is a memory barrier
51 * time. Order of access is not guaranteed, nor is a memory barrier
72 * time. Order of access is not guaranteed, nor is a memory barrier
|
| /kernel/linux/linux-4.19/kernel/locking/ |
| D | percpu-rwsem.c | 49 * the writer is guaranteed to see the reader's increment. in __percpu_down_read()
52 * the writer looks are guaranteed to see the readers_block value, in __percpu_down_read()
53 * which in turn means that they are guaranteed to immediately in __percpu_down_read()
157 * guaranteed to see their sem->read_count increment, and therefore in percpu_down_write()
|
| /kernel/linux/linux-4.19/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+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
|
| 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
|
| /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-4.19/arch/alpha/include/asm/ |
| D | barrier.h | 16 * over this barrier. All reads preceding this primitive are guaranteed
26 * Ordering is not guaranteed by anything other than these primitives,
|
| /kernel/linux/linux-4.19/crypto/ |
| D | dh.c | 19 MPI p; /* Value is guaranteed to be set. */
21 MPI g; /* Value is guaranteed to be set. */
22 MPI xa; /* Value is guaranteed to be set. */
|
| /kernel/linux/linux-4.19/drivers/clocksource/ |
| D | riscv_timer.c | 22 * operations on the current hart. There is guaranteed to be exactly one timer
42 * It is guaranteed that all the timers across all the harts are synchronized
|
| /kernel/linux/linux-4.19/drivers/gpu/drm/vmwgfx/device_include/ |
| D | svga3d_limits.h | 91 * The maximum number of vertex arrays we're guaranteed to support in
97 * The maximum number of primitive ranges we're guaranteed to support
|
| /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-5.10/Documentation/devicetree/bindings/net/ |
| D | mediatek-bluetooth.txt | 75 guaranteed.
78 design should be guaranteed.
|
| /kernel/linux/linux-4.19/Documentation/networking/ |
| D | netdevices.txt | 57 Note: netif_running() is guaranteed false
89 Notes: netif_queue_stopped() is guaranteed true
|
| /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-4.19/Documentation/acpi/ |
| D | acpi-lid.txt | 36 changed to "opened". Thus the "opened" notification is not guaranteed. But
37 it is guaranteed that the AML tables always notify "closed" when the lid
|
| /kernel/linux/linux-4.19/drivers/media/platform/vicodec/ |
| D | vicodec-codec.h | 39 * guaranteed not to occur in the compressed frame data. This header
51 * be guaranteed that the magic 8 byte sequence (see below) can
|