Home
last modified time | relevance | path

Searched full:primitive (Results 1 – 25 of 165) sorted by relevance

1234567

/linux/include/linux/
H A Drculist.h119 * with another list-mutation primitive, such as list_add_rcu()
140 * with another list-mutation primitive, such as list_add_tail_rcu()
165 * with another list-mutation primitive, such as list_del_rcu()
197 * primitive, such as list_bidir_del_rcu() or list_add_rcu(), running on
230 * list-mutation primitive, such as hlist_add_head_rcu() or
389 * This primitive may safely run concurrently with the _rcu list-mutation
433 * This primitive may safely run concurrently with the _rcu list-mutation
452 * This primitive may safely run concurrently with the _rcu list-mutation
471 * This list-traversal primitive may safely run concurrently with
488 * This list-traversal primitive may safely run concurrently with
[all …]
H A Drslib.h26 * @prim: Primitive element, index form
28 * @gfpoly: The primitive generator polynominal
89 * must be primitive;
92 * @prim: primitive element to generate polynomial roots
H A Dprocessor.h15 * cpu_relax, or any "spin" or sleep type of primitive including nested uses
43 * for the uncontended case before using this primitive.
/linux/rust/kernel/
H A Dslice.rs
H A Dnum.rs12 /// Designates unsigned primitive types.
15 /// Designates signed primitive types.
/linux/Documentation/RCU/
H A Dchecklist.rst10 result in the same sorts of problems that leaving out a locking primitive
146 accesses. The rcu_dereference() primitive ensures that
151 The rcu_dereference() primitive is also an excellent
156 just that. The rcu_dereference() primitive therefore also
162 The rcu_dereference() primitive is used by the
182 hlist_add_head_rcu() primitive is required.
185 primitive must be used to keep list_del()'s pointer
188 the hlist_del_rcu() primitive is required.
199 publicized. Use the rcu_assign_pointer() primitive
229 a single non-expedited primitive to cover the entire batch.
[all …]
H A DUP.rst6 A common misconception is that, on UP systems, the call_rcu() primitive
126 elsewhere using an _bh variant of the spinlock primitive.
142 the kfree() primitive.
/linux/rust/zerocopy-derive/
H A Drepr.rs42 Primitive(Prim), enumerator
94 Primitive(prim) => prim.with(|prim| match prim { in repr_type_name()
123 matches!(self, Repr::Compound(Spanned { t: Primitive(_), span: _ }, _align)) in is_primitive()
177 if let Compound(Spanned { t: Primitive(p), span: _ }, _align) = self { in get_primitive()
220 Primitive(prim) => prim.with(|prim| Spanned::new(prim, self.span).to_tokens(ts)), in to_tokens()
336 .map(CompoundRepr::Primitive) in try_from()
775 u8 => Primitive(U8), in test()
776 u16 => Primitive(U16), in test()
777 u32 => Primitive(U32), in test()
778 u64 => Primitive(U64), in test()
[all …]
/linux/net/sctp/
H A Ddebug.c126 /* Lookup primitive debug name. */
129 if (id.primitive <= SCTP_EVENT_PRIMITIVE_MAX) in sctp_pname()
130 return sctp_primitive_tbl[id.primitive]; in sctp_pname()
H A Dprimitive.c8 * These functions implement the SCTP primitive functions from Section 10.
63 * This primitive allows the upper layer to initiate an association to a
139 * send primitive) within the life time variable. However, the
/linux/lib/reed_solomon/
H A Dreed_solomon.c63 * @prim: primitive element to generate polynomial roots
124 /* If it's not primitive, exit */ in codec_init()
203 * must be primitive;
209 * @prim: primitive element to generate polynomial roots
281 * must be primitive;
284 * @prim: primitive element to generate polynomial roots
304 * @prim: primitive element to generate polynomial roots
/linux/include/crypto/
H A Dkdf_sp800108.h49 * SP800-108 allows the use of either a HMAC or a hash primitive. When
50 * the caller intends to use a hash primitive, the call to
/linux/rust/syn/
H A Dexport.rs30 pub type bool = std::primitive::bool;
32 pub type str = std::primitive::str;
/linux/include/crypto/internal/
H A Dkpp.h155 * Function registers an implementation of a key-agreement protocol primitive
165 * crypto_unregister_kpp() -- Unregister key-agreement protocol primitive
168 * Function unregisters an implementation of a key-agreement protocol primitive
/linux/drivers/net/ethernet/altera/
H A Daltera_sgdma.c442 * primitive to avoid simultaneous pushes/pops to the list.
453 * primitive to avoid simultaneous pushes/pops to the list.
464 * primitive to avoid simultaneous pushes/pops to the list.
477 * primitive to avoid simultaneous pushes/pops to the list.
490 * primitive to avoid simultaneous pushes/pops to the list while the
/linux/arch/alpha/kernel/
H A Dtime.c85 * The RTC as a clock_event_device primitive.
134 * The QEMU clock as a clocksource primitive.
154 * The QEMU alarm as a clock_event_device primitive.
251 * The RPCC as a clocksource primitive.
/linux/rust/zerocopy-derive/derive/
H A Dtry_from_bytes.rs195 /// - `repr(int)`: <https://doc.rust-lang.org/reference/type-layout.html#primitive-representation-o…
196 /// - `repr(C, int)`: <https://doc.rust-lang.org/reference/type-layout.html#combining-primitive-rep…
377 ) -> #core::primitive::bool in derive_is_bit_valid()
410 // primitive integer. in derive_is_bit_valid()
582 ) -> #core::primitive::bool in derive_try_from_bytes_struct()
630 ) -> #core::primitive::bool in derive_try_from_bytes_union()
720 ) -> #core::primitive::bool in try_gen_trivial_is_bit_valid()
758 ) -> #core::primitive::bool in gen_trivial_is_bit_valid_unchecked()
/linux/drivers/message/fusion/lsi/
H A Dmpi_log_fc.h42 …NFO_FC_INIT_ERROR_BAD_START_OF_FRAME = 0x20000002, /* Bad Rx Frame, bad start of frame primitive */
43 …GINFO_FC_INIT_ERROR_BAD_END_OF_FRAME = 0x20000003, /* Bad Rx Frame, bad end of frame primitive */
/linux/rust/kernel/sync/
H A Dcompletion.rs11 /// Synchronization primitive to signal when a certain task has been completed.
13 /// The [`Completion`] synchronization primitive signals when a certain task has been completed by
/linux/rust/kernel/num/
H A Dbounded.rs163 /// Infallible conversions from a primitive integer to a large-enough [`Bounded`] are supported.
192 /// Infallible conversions from a [`Bounded`] to a primitive integer are also supported, and
224 /// Fallible conversions from any primitive integer to any [`Bounded`] are also supported using the
975 /// Implementations for infallibly converting a primitive type into a [`Bounded`] that can contain
1010 /// Generates `From` implementations from a primitive type into a [`Bounded`] with
1045 /// Local trait expressing the fact that a given [`Bounded`] fits into a primitive type of `N` bits,
1049 /// Implementations for infallibly converting a [`Bounded`] into a primitive type that can contain
1057 // Number of bits that fit into a 8-bits primitive.
1062 // Other number of bits that fit into a 16-bits primitive.
1067 // Other number of bits that fit into a 32-bits primitive.
[all …]
/linux/Documentation/
H 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/tools/memory-model/Documentation/
H 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/Documentation/locking/
H 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
/linux/Documentation/networking/
H A Datm.rst7 In order to use anything but the most primitive functions of ATM,
/linux/include/math-emu/
H A Dop-1.h136 /* Given a 1W * 1W => 2W primitive, do the extended multiplication. */
199 /* GCC's longlong.h defines a 2W / 1W => (1W,1W) primitive udiv_qrnnd
200 that may be useful in this situation. This first is for a primitive

1234567