| /linux/lib/ |
| H A D | siphash.c | 113 * @first: first u64
116 u64 siphash_1u64(const u64 first, const siphash_key_t *key) in siphash_1u64() argument
119 v3 ^= first; in siphash_1u64()
122 v0 ^= first; in siphash_1u64()
129 * @first: first u64
133 u64 siphash_2u64(const u64 first, const u64 second, const siphash_key_t *key) in siphash_2u64() argument
136 v3 ^= first; in siphash_2u64()
139 v0 ^= first; in siphash_2u64()
150 * @first: first u64
155 u64 siphash_3u64(const u64 first, const u64 second, const u64 third, in siphash_3u64() argument
[all …]
|
| H A D | llist.c | 18 * llist_del_first - delete the first entry of lock-less list
21 * If list is empty, return NULL, otherwise, return the first entry
27 * llist_add) sequence in another user may change @head->first->next,
28 * but keep @head->first. If multiple consumers are needed, please
35 entry = smp_load_acquire(&head->first); in llist_del_first()
40 } while (!try_cmpxchg(&head->first, &entry, next)); in llist_del_first()
47 * llist_del_first_this - delete given entry of lock-less list if it is first
63 entry = smp_load_acquire(&head->first); in llist_del_first_this()
68 } while (!try_cmpxchg(&head->first, &entry, next)); in llist_del_first_this()
76 * @head: first item of the list to be reversed
[all …]
|
| /linux/ipc/ |
| H A D | syscall.c | 20 int ksys_ipc(unsigned int call, int first, unsigned long second, in ksys_ipc() argument
30 return ksys_semtimedop(first, (struct sembuf __user *)ptr, in ksys_ipc()
34 return ksys_semtimedop(first, ptr, second, in ksys_ipc()
37 return compat_ksys_semtimedop(first, ptr, second, in ksys_ipc()
43 return ksys_semget(first, second, third); in ksys_ipc()
50 return ksys_old_semctl(first, second, third, arg); in ksys_ipc()
54 return ksys_msgsnd(first, (struct msgbuf __user *) ptr, in ksys_ipc()
67 return ksys_msgrcv(first, tmp.msgp, second, in ksys_ipc()
71 return ksys_msgrcv(first, in ksys_ipc()
76 return ksys_msgget((key_t) first, second); in ksys_ipc()
[all …]
|
| /linux/Documentation/admin-guide/ |
| H A D | devices.txt | 21 0 = /dev/ram0 First RAM disk
32 0 = /dev/ptyp0 First PTY master
107 0 = /dev/ttyp0 First PTY slave
115 3 block First MFM, RLL and IDE hard disk/CD-ROM interface
121 1 = /dev/hd?1 First partition
134 1 = /dev/tty1 First virtual console
137 64 = /dev/ttyS0 First UART serial port
192 0 = /dev/loop0 First loop device
201 0 = /dev/sda First SCSI disk whole disk
212 0 = /dev/st0 First SCSI tape, mode 0
[all …]
|
| /linux/net/netfilter/ |
| H A D | nft_set_pipapo_avx2.c | 88 * @start: First bit to set
142 * @last: Return index of first set bit, if this is the last field
150 * Return: first set bit index if @last, index of first filled word otherwise.
192 * @first: If this is the first field, don't source previous result
193 * @last: Last field: stop at the first match and return bit index
197 * this is the first field in the set, simply AND the buckets together
211 * Return: -1 on no match, rule index of match if @last, otherwise first long
212 * word index to be checked next (i.e. first filled word).
217 bool first, bool last) in nft_pipapo_avx2_lookup_4b_2() argument
227 if (first) { in nft_pipapo_avx2_lookup_4b_2()
[all …]
|
| /linux/kernel/bpf/ |
| H A D | percpu_freelist.c | 18 head->first = NULL; in pcpu_freelist_init()
31 node->next = head->first; in pcpu_freelist_push_node()
32 WRITE_ONCE(head->first, node); in pcpu_freelist_push_node()
108 if (!READ_ONCE(head->first)) in pcpu_freelist_populate()
112 node = head->first; in pcpu_freelist_populate()
114 WRITE_ONCE(head->first, node->next); in pcpu_freelist_populate()
|
| /linux/include/linux/ |
| H A D | llist.h | 16 * needed. This is because llist_del_first depends on list->first->next not
19 * preempted back, the list->first is the same as before causing the cmpxchg in
57 struct llist_node *first; member
73 list->first = NULL; in init_llist_head()
132 * @node: the first entry of deleted list entries
151 * @node: the first entry of deleted list entries
190 * @node: the first entry of deleted list entries.
218 return READ_ONCE(head->first) == NULL; in llist_empty()
228 * @new_first: first entry in batch to be added
238 struct llist_node *first = READ_ONCE(head->first); in llist_add_batch() local
[all …]
|
| H A D | list_bl.h | 13 * For modification operations, the 0 bit of hlist_bl_head->first
35 struct hlist_bl_node *first; member
42 ((ptr)->first = NULL)
60 ((unsigned long)h->first & ~LIST_BL_LOCKMASK); in hlist_bl_first()
67 LIST_BL_BUG_ON(((unsigned long)h->first & LIST_BL_LOCKMASK) != in hlist_bl_set_first()
69 h->first = (struct hlist_bl_node *)((unsigned long)n | LIST_BL_LOCKMASK); in hlist_bl_set_first()
74 return !((unsigned long)READ_ONCE(h->first) & ~LIST_BL_LOCKMASK); in hlist_bl_empty()
80 struct hlist_bl_node *first = hlist_bl_first(h); in hlist_bl_add_head() local
82 n->next = first; in hlist_bl_add_head()
83 if (first) in hlist_bl_add_head()
[all …]
|
| H A D | list.h | 317 * @first: first entry to move
318 * @last: last entry to move, can be the same as first
320 * Move all entries between @first and including @last before @head.
324 struct list_head *first, in list_bulk_move_tail() argument
327 first->prev->next = last->next; in list_bulk_move_tail()
328 last->next->prev = first->prev; in list_bulk_move_tail()
330 head->prev->next = first; in list_bulk_move_tail()
331 first->prev = head->prev; in list_bulk_move_tail()
338 * list_is_first -- tests whether @list is the first entry in list @head
419 struct list_head *first; in list_rotate_left() local
[all …]
|
| /linux/arch/alpha/lib/ |
| H A D | csum_partial_copy.c | 129 unsigned long first; in csum_partial_cfu_dest_aligned() local
134 if (__get_word(ldq_u, first,src)) in csum_partial_cfu_dest_aligned()
142 extql(first, soff, word); in csum_partial_cfu_dest_aligned()
145 extqh(second, soff, first); in csum_partial_cfu_dest_aligned()
147 word |= first; in csum_partial_cfu_dest_aligned()
148 first = second; in csum_partial_cfu_dest_aligned()
162 extql(first, soff, word); in csum_partial_cfu_dest_aligned()
163 extqh(second, soff, first); in csum_partial_cfu_dest_aligned()
164 word |= first; in csum_partial_cfu_dest_aligned()
243 unsigned long first; in csum_partial_cfu_unaligned() local
[all …]
|
| /linux/Documentation/userspace-api/media/v4l/ |
| H A D | field-order.rst | 30 even) fields, the *spatial order*: The first line of the top field is
31 the first line of an interlaced frame, the first line of the bottom
49 captured first (is the older field), the top field is also transmitted
50 first on the bus.
108 - Images contain both fields, the top field lines are stored first
110 are always stored in temporal order, the older one first in
115 first in memory, immediately followed by the top field lines.
116 Fields are always stored in temporal order, the older one first in
121 temporal order, i. e. the older one first. To indicate the field
136 first. The top field is the older field.
[all …]
|
| H A D | dev-raw-vbi.rst | 92 :ref:`VIDIOC_STREAMON` ioctl and the first :c:func:`read()`
118 first sample in the VBI image will be located ``offset`` /
136 - This is the scanning system line number associated with the first
137 line of the VBI image, of the first and the second field
149 - The number of lines in the first and second field image,
158 An application can set the first or second ``count`` value to zero
170 must first determine the current video standard selection. The
195 between fields. Normally the VBI image stores the first field
196 (lower scanning line numbers) first in memory. This may be a top
198 set the first or second field may be stored first, however the
[all …]
|
| /linux/tools/testing/selftests/bpf/ |
| H A D | bpf_arena_list.h | 16 struct arena_list_node __arena *first; member
37 for (void * ___tmp = (pos = list_entry_safe((head)->first, \
45 arena_list_node_t *first = h->first, * __arena *tmp; in list_add_head() local
47 cast_user(first); in list_add_head()
49 WRITE_ONCE(n->next, first); in list_add_head()
50 cast_kern(first); in list_add_head()
51 if (first) { in list_add_head()
54 WRITE_ONCE(first->pprev, tmp); in list_add_head()
57 WRITE_ONCE(h->first, n); in list_add_head()
59 tmp = &h->first; in list_add_head()
|
| /linux/io_uring/ |
| H A D | slist.h | 7 for (pos = (head)->first; pos; pos = (pos)->next)
10 for (pos = (head)->first, prv = NULL; pos; prv = pos, pos = (pos)->next)
15 #define wq_list_empty(list) (READ_ONCE((list)->first) == NULL)
18 (list)->first = NULL; \
37 if (!list->first) { in wq_list_add_tail()
39 WRITE_ONCE(list->first, node); in wq_list_add_tail()
49 node->next = list->first; in wq_list_add_head()
52 WRITE_ONCE(list->first, node); in wq_list_add_head()
59 /* first in the list, if prev==NULL */ in wq_list_cut()
61 WRITE_ONCE(list->first, last->next); in wq_list_cut()
[all …]
|
| /linux/drivers/net/wireless/broadcom/brcm80211/brcmsmac/ |
| H A D | phy_shim.h | 80 /* Index for first 20MHz OFDM SISO rate */
82 /* Index for first 20MHz OFDM CDD rate */
84 /* Index for first 40MHz OFDM SISO rate */
86 /* Index for first 40MHz OFDM CDD rate */
89 /* Index for first 20MHz MCS SISO rate */
91 /* Index for first 20MHz MCS CDD rate */
93 /* Index for first 20MHz MCS STBC rate */
95 /* Index for first 20MHz MCS SDM rate */
97 /* Index for first 40MHz MCS SISO rate */
99 /* Index for first 40MHz MCS CDD rate */
[all …]
|
| /linux/kernel/trace/ |
| H A D | rethook.c | 47 * call this first and wait RCU, and call rethook_free().
212 node = tsk->rethooks.first; in __rethook_find_ret_addr()
240 * first call, but '@cur' itself must NOT NULL.
282 struct llist_node *first, *node = NULL; in rethook_trampoline_handler() local
305 first = current->rethooks.first; in rethook_trampoline_handler()
306 while (first) { in rethook_trampoline_handler()
307 rhn = container_of(first, struct rethook_node, llist); in rethook_trampoline_handler()
315 if (first == node) in rethook_trampoline_handler()
317 first = first->next; in rethook_trampoline_handler()
324 first = current->rethooks.first; in rethook_trampoline_handler()
[all …]
|
| /linux/tools/testing/selftests/kvm/lib/ |
| H A D | sparsebit.c | 55 * The index of the first bit set needs to be obtained via
86 * The idx member contains the bit index of the first bit described by this
87 * node, while the mask member stores the setting of the first 32-bits.
617 * by first remembering the location of the next in node_reduce()
974 /* First clear any bits already set in the destination */ in sparsebit_copy()
992 /* With num > 0, the first bit must be set. */ in sparsebit_is_set_num()
1023 /* With num > 0, the first bit must be cleared. */ in sparsebit_is_clear_num()
1084 /* Returns the index of the first set bit. Abort if no bits are set.
1097 /* Returns the index of the first cleared bit. Abort if
1107 /* If no nodes or first node index > 0 then lowest cleared is 0 */ in sparsebit_first_clear()
[all …]
|
| /linux/Documentation/networking/ |
| H A D | x25-iface.rst | 21 over the LAPB link. The first byte of the skbuff indicates the meaning of
28 First Byte = 0x00 (X25_IFACE_DATA)
34 First Byte = 0x01 (X25_IFACE_CONNECT)
39 First Byte = 0x02 (X25_IFACE_DISCONNECT)
44 First Byte = 0x03 (X25_IFACE_PARAMS)
52 First Byte = 0x00 (X25_IFACE_DATA)
57 First Byte = 0x01 (X25_IFACE_CONNECT)
62 First Byte = 0x02 (X25_IFACE_DISCONNECT)
67 First Byte = 0x03 (X25_IFACE_PARAMS)
|
| /linux/Documentation/driver-api/tty/ |
| H A D | n_gsm.rst | 52 uint32_t first;
64 being able to answer to the first MUX packet so a delay
90 /* the first user channel gets a higher priority */
94 /* get first gsmtty device node */
95 ioctl(fd, GSMIOC_GETFIRST, &first);
96 printf("first muxed line: /dev/gsmtty%i\n", first);
109 #. First close all virtual ports before closing the physical port.
149 uint32_t first;
180 /* the first user channel gets a higher priority */
184 /* get first gsmtty device node */
[all …]
|
| /linux/arch/loongarch/kernel/ |
| H A D | unwind_prologue.c | 82 * As we meet ftrace_regs_entry, reset first flag like first doing
125 state->first = true; in unwind_by_prologue()
134 * When first is not set, the PC is a return address in the previous frame. in unwind_by_prologue()
137 pc = state->pc - (state->first ? 0 : LOONGARCH_INSN_SIZE); in unwind_by_prologue()
155 * first being true is reasonable, otherwise indicate analysis is broken. in unwind_by_prologue()
158 if (state->first) in unwind_by_prologue()
159 goto first; in unwind_by_prologue()
176 if (state->first) { in unwind_by_prologue()
178 goto first; in unwind_by_prologue()
187 first: in unwind_by_prologue()
[all …]
|
| /linux/tools/perf/pmu-events/arch/x86/tigerlake/ |
| H A D | memory.json | 21 "BriefDescription": "Counts randomly selected loads when the latency from first dispatch to completion is greater than 128 cycles.",
28 "PublicDescription": "Counts randomly selected loads when the latency from first dispatch to completion is greater than 128 cycles. Reported latency may be longer than just the memory latency.",
33 "BriefDescription": "Counts randomly selected loads when the latency from first dispatch to completion is greater than 16 cycles.",
40 "PublicDescription": "Counts randomly selected loads when the latency from first dispatch to completion is greater than 16 cycles. Reported latency may be longer than just the memory latency.",
45 "BriefDescription": "Counts randomly selected loads when the latency from first dispatch to completion is greater than 256 cycles.",
52 "PublicDescription": "Counts randomly selected loads when the latency from first dispatch to completion is greater than 256 cycles. Reported latency may be longer than just the memory latency.",
57 "BriefDescription": "Counts randomly selected loads when the latency from first dispatch to completion is greater than 32 cycles.",
64 "PublicDescription": "Counts randomly selected loads when the latency from first dispatch to completion is greater than 32 cycles. Reported latency may be longer than just the memory latency.",
69 "BriefDescription": "Counts randomly selected loads when the latency from first dispatch to completion is greater than 4 cycles.",
76 "PublicDescription": "Counts randomly selected loads when the latency from first dispatc
[all...] |
| /linux/rust/kernel/ |
| H A D | list.rs | 33 /// * If the list is empty, then `first` is null. Otherwise, `first` points at the `ListLinks`
34 /// field of the first element in the list.
147 first: *mut ListLinksFields, field
346 first: ptr::null_mut(), in new()
353 self.first.is_null() in is_empty()
358 /// Returns a pointer to the newly inserted element. Never changes `self.first` unless the list
390 self.first = item; in insert_inner()
412 // * `self.first` is null or in the list. in push_back()
413 // * `self.first` is only null if the list is empty. in push_back()
414 unsafe { self.insert_inner(item, self.first) }; in push_back()
[all …]
|
| /linux/tools/include/linux/ |
| H A D | list.h | 217 struct list_head *first; in list_rotate_left() local
220 first = head->next; in list_rotate_left()
221 list_move_tail(first, head); in list_rotate_left()
278 struct list_head *first = list->next; in __list_splice() local
281 first->prev = prev; in __list_splice()
282 prev->next = first; in __list_splice()
291 * @head: the place to add it in the first list.
303 * @head: the place to add it in the first list.
315 * @head: the place to add it in the first list.
331 * @head: the place to add it in the first list.
[all …]
|
| /linux/drivers/net/wireguard/ |
| H A D | send.c | 242 static void wg_packet_create_data_done(struct wg_peer *peer, struct sk_buff *first) in wg_packet_create_data_done() argument
249 skb_list_walk_safe(first, skb, next) { in wg_packet_create_data_done()
267 struct sk_buff *first; in wg_packet_tx_worker() local
269 while ((first = wg_prev_queue_peek(&peer->tx_queue)) != NULL && in wg_packet_tx_worker()
270 (state = atomic_read_acquire(&PACKET_CB(first)->state)) != in wg_packet_tx_worker()
273 keypair = PACKET_CB(first)->keypair; in wg_packet_tx_worker()
276 wg_packet_create_data_done(peer, first); in wg_packet_tx_worker()
278 kfree_skb_list(first); in wg_packet_tx_worker()
291 struct sk_buff *first, *skb, *next; in wg_packet_encrypt_worker() local
293 while ((first = ptr_ring_consume_bh(&queue->ring)) != NULL) { in wg_packet_encrypt_worker()
[all …]
|
| /linux/fs/ |
| H A D | binfmt_script.c | 19 static inline const char *next_non_spacetab(const char *first, const char *last) in next_non_spacetab() argument
21 for (; first <= last; first++) in next_non_spacetab()
22 if (!spacetab(*first)) in next_non_spacetab()
23 return first; in next_non_spacetab()
26 static inline const char *next_terminator(const char *first, const char *last) in next_terminator() argument
28 for (; first <= last; first++) in next_terminator()
29 if (spacetab(*first) || !*first) in next_terminator()
30 return first; in next_terminator()
|