Home
last modified time | relevance | path

Searched refs:primitive (Results 1 – 25 of 60) sorted by relevance

123

/linux/mm/damon/
A Dpaddr.c264 ctx->primitive.init = NULL; in damon_pa_set_primitives()
265 ctx->primitive.update = NULL; in damon_pa_set_primitives()
266 ctx->primitive.prepare_access_checks = damon_pa_prepare_access_checks; in damon_pa_set_primitives()
267 ctx->primitive.check_accesses = damon_pa_check_accesses; in damon_pa_set_primitives()
268 ctx->primitive.reset_aggregated = NULL; in damon_pa_set_primitives()
269 ctx->primitive.target_valid = damon_pa_target_valid; in damon_pa_set_primitives()
270 ctx->primitive.cleanup = NULL; in damon_pa_set_primitives()
271 ctx->primitive.apply_scheme = damon_pa_apply_scheme; in damon_pa_set_primitives()
272 ctx->primitive.get_scheme_score = damon_pa_scheme_score; in damon_pa_set_primitives()
A Dcore.c243 if (ctx->primitive.cleanup) { in damon_destroy_targets()
244 ctx->primitive.cleanup(ctx); in damon_destroy_targets()
624 if (c->primitive.apply_scheme) { in damon_do_apply_schemes()
915 if (!ctx->primitive.target_valid) in kdamond_need_stop()
1018 if (ctx->primitive.init) in kdamond_fn()
1019 ctx->primitive.init(ctx); in kdamond_fn()
1037 if (ctx->primitive.check_accesses) in kdamond_fn()
1055 if (ctx->primitive.update) in kdamond_fn()
1056 ctx->primitive.update(ctx); in kdamond_fn()
1067 if (ctx->primitive.cleanup) in kdamond_fn()
[all …]
A Dvaddr.c652 ctx->primitive.init = damon_va_init; in damon_va_set_primitives()
653 ctx->primitive.update = damon_va_update; in damon_va_set_primitives()
654 ctx->primitive.prepare_access_checks = damon_va_prepare_access_checks; in damon_va_set_primitives()
655 ctx->primitive.check_accesses = damon_va_check_accesses; in damon_va_set_primitives()
656 ctx->primitive.reset_aggregated = NULL; in damon_va_set_primitives()
657 ctx->primitive.target_valid = damon_va_target_valid; in damon_va_set_primitives()
658 ctx->primitive.cleanup = NULL; in damon_va_set_primitives()
659 ctx->primitive.apply_scheme = damon_va_apply_scheme; in damon_va_set_primitives()
660 ctx->primitive.get_scheme_score = damon_va_scheme_score; in damon_va_set_primitives()
A Ddbgfs-test.h86 ctx->primitive.target_valid = NULL; in damon_dbgfs_test_set_targets()
87 ctx->primitive.cleanup = NULL; in damon_dbgfs_test_set_targets()
/linux/net/sctp/
A Ddebug.c129 if (id.primitive <= SCTP_EVENT_PRIMITIVE_MAX) in sctp_pname()
130 return sctp_primitive_tbl[id.primitive]; in sctp_pname()
A DMakefile13 tsnmap.o bind_addr.o socket.o primitive.o \
/linux/Documentation/RCU/
A Dchecklist.rst129 accesses. The rcu_dereference() primitive ensures that
134 The rcu_dereference() primitive is also an excellent
139 just that. The rcu_dereference() primitive therefore also
146 The rcu_dereference() primitive is used by the
166 hlist_add_head_rcu() primitive is required.
169 primitive must be used to keep list_del()'s pointer
172 the hlist_del_rcu() primitive is required.
183 publicized. Use the rcu_assign_pointer() primitive
208 a single non-expedited primitive to cover the entire batch.
262 primitive will correspondingly delay updates. In contrast,
[all …]
A Drcubarrier.rst24 presence? There is a synchronize_rcu() primitive that blocks until all
34 primitive must be used instead. This primitive takes a pointer to an
78 We instead need the rcu_barrier() primitive. Rather than waiting for
290 The rcu_barrier() primitive has seen relatively little use, since most
A DUP.rst6 A common misconception is that, on UP systems, the call_rcu() primitive
117 elsewhere using an _bh variant of the spinlock primitive.
133 the kfree() primitive.
/linux/include/net/sctp/
A Dconstants.h120 enum sctp_event_primitive primitive; member
131 SCTP_SUBTYPE_CONSTRUCTOR(PRIMITIVE, enum sctp_event_primitive, primitive)
/linux/Documentation/vm/damon/
A Dfaq.rst21 Idle page tracking is a low level primitive for access check of the physical
34 specific low level primitive parts including monitoring target regions
/linux/Documentation/networking/
A Datm.rst7 In order to use anything but the most primitive functions of ATM,
/linux/Documentation/devicetree/bindings/devfreq/event/
A Dsamsung,exynos-nocp.yaml15 NoC provides the primitive values to get the performance data. The packets
A Dsamsung,exynos-ppmu.yaml15 each IP. PPMU provides the primitive values to get performance data. These
/linux/Documentation/ABI/obsolete/
A Dsysfs-selinux-disable13 easier for systems with primitive bootloaders that did not allow for
/linux/Documentation/locking/
A Dlocktorture.rst138 primitive a second "Reads" statistics line is printed.
145 -only- be positive if there is a bug in the locking primitive's
A Dmutex-design.rst12 In the Linux kernel, mutexes refer to a particular locking primitive
152 locking primitive.
/linux/Documentation/
A Datomic_t.txt184 subsequent. Therefore a fully ordered primitive is like having an smp_mb()
185 before and an smp_mb() after the primitive.
362 primitive (See Sparc64 for an example).
/linux/include/linux/
A Ddamon.h386 struct damon_primitive primitive; member
/linux/Documentation/staging/
A Dspeculation.rst64 arbitrary read primitive.
/linux/tools/memory-model/Documentation/
A Dordering.txt142 The smp_mb__after_atomic() primitive can be used instead:
149 The smp_mb__after_atomic() primitive emits code only on CPUs whose
167 It is bad practice to place code between the smp__*() primitive and the
222 The Linux kernel's compiler barrier is barrier(). This primitive
512 primitive can be helpful, as can the various ordering primitives discussed
/linux/drivers/dma-buf/
A DKconfig27 synchronization. Useful when there is no hardware primitive backing
/linux/Documentation/x86/x86_64/
A Dfake-numa-for-cpusets.rst23 For the purposes of this introduction, we'll assume a very primitive NUMA
/linux/Documentation/scsi/
A Dlibsas.rst113 received. See sas.h. Grab the lock, set the primitive,
324 - on receiving a primitive
333 - Hard Reset primitive received.
/linux/drivers/scsi/isci/
A Dscu_task_context.h430 struct primitive_task_context primitive; member

Completed in 36 milliseconds

123