/openbmc/linux/net/llc/ |
H A D | llc_s_ac.c | 49 * primitive from the network layer. Verifies event is a primitive type of 50 * event. Verify the primitive is a UNITDATA REQUEST. 74 * primitive from the network layer. Verify event is a primitive type 75 * event. Verify the primitive is a XID REQUEST. 130 * primitive from the network layer. Verify event is a primitive type 131 * event; verify the primitive is a TEST REQUEST. 197 * primitive. 211 * primitive. Verify our event is a PDU type event.
|
/openbmc/linux/include/linux/ |
H A D | rculist.h | 98 * with another list-mutation primitive, such as list_add_rcu() 119 * with another list-mutation primitive, such as list_add_tail_rcu() 144 * with another list-mutation primitive, such as list_del_rcu() 176 * list-mutation primitive, such as hlist_add_head_rcu() or 303 * This primitive may safely run concurrently with the _rcu list-mutation 347 * This primitive may safely run concurrently with the _rcu list-mutation 366 * This primitive may safely run concurrently with the _rcu list-mutation 385 * This list-traversal primitive may safely run concurrently with 402 * This list-traversal primitive may safely run concurrently with 420 * This primitive may safely run concurrently with the _rcu [all …]
|
H A D | rculist_nulls.h | 28 * list-mutation primitive, such as hlist_nulls_add_head_rcu() or 68 * with another list-mutation primitive, such as hlist_nulls_add_head_rcu() 91 * with another list-mutation primitive, such as hlist_nulls_add_head_rcu() 97 * list-traversal primitive must be guarded by rcu_read_lock(). 122 * with another list-mutation primitive, such as hlist_nulls_add_head_rcu() 128 * list-traversal primitive must be guarded by rcu_read_lock().
|
H A D | rslib.h | 27 * @prim: Primitive element, index form 29 * @gfpoly: The primitive generator polynominal 90 * must be primitive; 93 * @prim: primitive element to generate polynomial roots
|
H A D | rculist_bl.h | 40 * with another list-mutation primitive, such as hlist_bl_add_head_rcu() 63 * with another list-mutation primitive, such as hlist_bl_add_head_rcu() 69 * list-traversal primitive must be guarded by rcu_read_lock().
|
H A D | processor.h | 15 * cpu_relax, or any "spin" or sleep type of primitive including nested uses 43 * for the uncontended case before using this primitive.
|
H A D | intel_rapl.h | 79 /* below are not raw primitive data */ 146 * @rpi: internal pointer to interface primitive info
|
/openbmc/linux/Documentation/RCU/ |
H A D | checklist.rst | 10 result in the same sorts of problems that leaving out a locking primitive 139 accesses. The rcu_dereference() primitive ensures that 144 The rcu_dereference() primitive is also an excellent 149 just that. The rcu_dereference() primitive therefore also 155 The rcu_dereference() primitive is used by the 175 hlist_add_head_rcu() primitive is required. 178 primitive must be used to keep list_del()'s pointer 181 the hlist_del_rcu() primitive is required. 192 publicized. Use the rcu_assign_pointer() primitive 223 a single non-expedited primitive to cover the entire batch. [all …]
|
H A D | UP.rst | 6 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.
|
/openbmc/linux/drivers/gpu/drm/amd/display/include/ |
H A D | dal_asic_id.h | 74 /* KV1 with Spectre GFX core, 8-8-1-2 (CU-Pix-Primitive-RB) */ 78 * 3-4-1-1 (CU-Pix-Primitive-RB) */ 81 /* KB with Kalindi GFX core, 2-4-1-1 (CU-Pix-Primitive-RB) */ 84 /* KB with Kalindi GFX core, 2-4-1-1 (CU-Pix-Primitive-RB) */ 87 /* BV with Kalindi GFX core, 2-4-1-1 (CU-Pix-Primitive-RB) */ 90 /* ML with Godavari GFX core, 2-4-1-1 (CU-Pix-Primitive-RB) */ 93 /* ML with Godavari GFX core, 2-4-1-1 (CU-Pix-Primitive-RB) */
|
/openbmc/linux/include/kunit/ |
H A D | test.h | 866 * @left: an arbitrary expression that evaluates to a primitive C type. 867 * @right: an arbitrary expression that evaluates to a primitive C type. 908 * @left: an arbitrary expression that evaluates to a primitive C type. 909 * @right: an arbitrary expression that evaluates to a primitive C type. 950 * @left: an arbitrary expression that evaluates to a primitive C type. 951 * @right: an arbitrary expression that evaluates to a primitive C type. 971 * @left: an arbitrary expression that evaluates to a primitive C type. 972 * @right: an arbitrary expression that evaluates to a primitive C type. 992 * @left: an arbitrary expression that evaluates to a primitive C type. 993 * @right: an arbitrary expression that evaluates to a primitive C type. [all …]
|
/openbmc/openbmc/poky/meta/recipes-graphics/xorg-lib/ |
H A D | libxshmfence_1.3.2.bb | 1 SUMMARY = "Shared memory 'SyncFence' synchronization primitive" 3 DESCRIPTION = "This library offers a CPU-based synchronization primitive compatible \
|
/openbmc/linux/net/sctp/ |
H A D | debug.c | 126 /* 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 D | primitive.c | 8 * 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
|
/openbmc/linux/lib/reed_solomon/ |
H A D | reed_solomon.c | 63 * @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
|
/openbmc/linux/include/crypto/ |
H A D | kdf_sp800108.h | 49 * 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
|
/openbmc/linux/include/crypto/internal/ |
H A D | kpp.h | 155 * 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
|
/openbmc/linux/drivers/net/ethernet/altera/ |
H A D | altera_sgdma.c | 442 * 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
|
/openbmc/linux/drivers/message/fusion/lsi/ |
H A D | mpi_log_fc.h | 42 …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 */
|
/openbmc/linux/include/net/sctp/ |
H A D | constants.h | 96 /* These are primitive requests from the ULP. */ 120 enum sctp_event_primitive primitive; member 131 SCTP_SUBTYPE_CONSTRUCTOR(PRIMITIVE, enum sctp_event_primitive, primitive)
|
/openbmc/linux/arch/alpha/kernel/ |
H A D | time.c | 85 * 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.
|
/openbmc/sdeventplus/src/sdeventplus/ |
H A D | types.hpp | 16 * sd_event primitive */
|
/openbmc/linux/Documentation/networking/ |
H A D | atm.rst | 7 In order to use anything but the most primitive functions of ATM,
|
/openbmc/linux/Documentation/ |
H A D | atomic_t.txt | 184 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).
|
/openbmc/linux/tools/memory-model/Documentation/ |
H A D | ordering.txt | 142 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
|