| /linux-6.12.1/ipc/ |
| 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-6.12.1/lib/ |
| 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 …]
|
| D | llist.c | 20 * @new_first: first entry in batch to be added
29 struct llist_node *first = READ_ONCE(head->first); in llist_add_batch() local
32 new_last->next = first; in llist_add_batch()
33 } while (!try_cmpxchg(&head->first, &first, new_first)); in llist_add_batch()
35 return !first; in llist_add_batch()
40 * llist_del_first - delete the first entry of lock-less list
43 * If list is empty, return NULL, otherwise, return the first entry
49 * llist_add) sequence in another user may change @head->first->next,
50 * but keep @head->first. If multiple consumers are needed, please
57 entry = smp_load_acquire(&head->first); in llist_del_first()
[all …]
|
| /linux-6.12.1/tools/power/cpupower/lib/ |
| D | cpufreq.c | 273 struct cpufreq_available_governors *first = NULL; in cpufreq_get_available_governors() local
295 first = malloc(sizeof(*first)); in cpufreq_get_available_governors()
296 if (!first) in cpufreq_get_available_governors()
298 current = first; in cpufreq_get_available_governors()
300 current->first = first; in cpufreq_get_available_governors()
313 return first; in cpufreq_get_available_governors()
316 while (first) { in cpufreq_get_available_governors()
317 current = first->next; in cpufreq_get_available_governors()
318 if (first->governor) in cpufreq_get_available_governors()
319 free(first->governor); in cpufreq_get_available_governors()
[all …]
|
| /linux-6.12.1/Documentation/admin-guide/ |
| 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-6.12.1/net/netfilter/ |
| 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-6.12.1/kernel/bpf/ |
| D | percpu_freelist.c | 18 head->first = NULL; in pcpu_freelist_init()
21 s->extralist.first = NULL; in pcpu_freelist_init()
33 node->next = head->first; in pcpu_freelist_push_node()
34 WRITE_ONCE(head->first, node); in pcpu_freelist_push_node()
129 if (!READ_ONCE(head->first)) in ___pcpu_freelist_pop()
132 node = head->first; in ___pcpu_freelist_pop()
134 WRITE_ONCE(head->first, node->next); in ___pcpu_freelist_pop()
142 if (!READ_ONCE(s->extralist.first)) in ___pcpu_freelist_pop()
145 node = s->extralist.first; in ___pcpu_freelist_pop()
147 WRITE_ONCE(s->extralist.first, node->next); in ___pcpu_freelist_pop()
[all …]
|
| /linux-6.12.1/tools/perf/pmu-events/arch/x86/lunarlake/ |
| D | memory.json | 3 …"BriefDescription": "Counts randomly selected loads when the latency from first dispatch to comple…
11 …"PublicDescription": "Counts randomly selected loads when the latency from first dispatch to compl…
17 …"BriefDescription": "Counts randomly selected loads when the latency from first dispatch to comple…
25 …"PublicDescription": "Counts randomly selected loads when the latency from first dispatch to compl…
31 …"BriefDescription": "Counts randomly selected loads when the latency from first dispatch to comple…
39 …"PublicDescription": "Counts randomly selected loads when the latency from first dispatch to compl…
45 …"BriefDescription": "Counts randomly selected loads when the latency from first dispatch to comple…
53 …"PublicDescription": "Counts randomly selected loads when the latency from first dispatch to compl…
59 …"BriefDescription": "Counts randomly selected loads when the latency from first dispatch to comple…
67 …"PublicDescription": "Counts randomly selected loads when the latency from first dispatch to compl…
[all …]
|
| /linux-6.12.1/drivers/video/fbdev/core/ |
| D | sysfillrect.c | 28 unsigned long first, last; in bitfill_aligned() local
33 first = FB_SHIFT_HIGH(p, ~0UL, dst_idx); in bitfill_aligned()
39 first &= last; in bitfill_aligned()
40 *dst = comp(pat, *dst, first); in bitfill_aligned()
45 if (first!= ~0UL) { in bitfill_aligned()
46 *dst = comp(pat, *dst, first); in bitfill_aligned()
74 unsigned long first, last; in bitfill_unaligned() local
79 first = FB_SHIFT_HIGH(p, ~0UL, dst_idx); in bitfill_unaligned()
85 first &= last; in bitfill_unaligned()
86 *dst = comp(pat, *dst, first); in bitfill_unaligned()
[all …]
|
| D | cfbfillrect.c | 38 unsigned long first, last; in bitfill_aligned() local
43 first = fb_shifted_pixels_mask_long(p, dst_idx, bswapmask); in bitfill_aligned()
49 first &= last; in bitfill_aligned()
50 FB_WRITEL(comp(pat, FB_READL(dst), first), dst); in bitfill_aligned()
55 if (first!= ~0UL) { in bitfill_aligned()
56 FB_WRITEL(comp(pat, FB_READL(dst), first), dst); in bitfill_aligned()
95 unsigned long first, last; in bitfill_unaligned() local
100 first = FB_SHIFT_HIGH(p, ~0UL, dst_idx); in bitfill_unaligned()
106 first &= last; in bitfill_unaligned()
107 FB_WRITEL(comp(pat, FB_READL(dst), first), dst); in bitfill_unaligned()
[all …]
|
| D | syscopyarea.c | 31 unsigned long first, last; in bitcpy() local
35 first = FB_SHIFT_HIGH(p, ~0UL, dst_idx); in bitcpy()
43 first &= last; in bitcpy()
44 *dst = comp(*src, *dst, first); in bitcpy()
48 if (first != ~0UL) { in bitcpy()
49 *dst = comp(*src, *dst, first); in bitcpy()
86 first &= last; in bitcpy()
89 *dst = comp(*src << left, *dst, first); in bitcpy()
92 *dst = comp(*src >> right, *dst, first); in bitcpy()
98 first); in bitcpy()
[all …]
|
| /linux-6.12.1/arch/alpha/lib/ |
| 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-6.12.1/io_uring/ |
| 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-6.12.1/tools/testing/selftests/bpf/ |
| 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-6.12.1/Documentation/userspace-api/media/v4l/ |
| 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 …]
|
| /linux-6.12.1/drivers/net/ethernet/ibm/ |
| D | ibmvnic.h | 248 u8 first; member
264 u8 first; member
291 u8 first; member
303 u8 first; member
311 u8 first; member
324 u8 first; member
340 u8 first; member
345 u8 first; member
360 u8 first; member
367 u8 first; member
[all …]
|
| /linux-6.12.1/include/linux/ |
| 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 …]
|
| 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-6.12.1/tools/perf/pmu-events/arch/x86/graniterapids/ |
| D | memory.json | 68 …"BriefDescription": "Counts randomly selected loads when the latency from first dispatch to comple…
76 …"PublicDescription": "Counts randomly selected loads when the latency from first dispatch to compl…
81 …"BriefDescription": "Counts randomly selected loads when the latency from first dispatch to comple…
89 …"PublicDescription": "Counts randomly selected loads when the latency from first dispatch to compl…
94 …"BriefDescription": "Counts randomly selected loads when the latency from first dispatch to comple…
102 …"PublicDescription": "Counts randomly selected loads when the latency from first dispatch to compl…
107 …"BriefDescription": "Counts randomly selected loads when the latency from first dispatch to comple…
115 …"PublicDescription": "Counts randomly selected loads when the latency from first dispatch to compl…
120 …"BriefDescription": "Counts randomly selected loads when the latency from first dispatch to comple…
128 …"PublicDescription": "Counts randomly selected loads when the latency from first dispatch to compl…
[all …]
|
| /linux-6.12.1/fs/reiserfs/ |
| D | lbalance.c | 36 * length of all record to be copied and first byte of in leaf_copy_dir_entries()
52 /* when copy last to first, dest buffer can contain 0 items */ in leaf_copy_dir_entries()
59 * if there are no items in dest or the first/last item in in leaf_copy_dir_entries()
128 * Copy the first (if last_first == FIRST_TO_LAST) or last
147 * if ( DEST is empty or first item of SOURCE and last item of in leaf_copy_boundary_item()
174 * copy part of the body of the first item of SOURCE in leaf_copy_boundary_item()
196 * merge first item (or its part) of src buffer with the last in leaf_copy_boundary_item()
217 * (DEST is empty or last item of SOURCE and first item of DEST in leaf_copy_boundary_item()
244 * begin of the body of the first item of the DEST; part defined in leaf_copy_boundary_item()
246 * change first item key of the DEST; don't create new item header in leaf_copy_boundary_item()
[all …]
|
| /linux-6.12.1/drivers/net/wireless/broadcom/brcm80211/brcmsmac/ |
| 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-6.12.1/drivers/net/ethernet/microchip/sparx5/ |
| D | sparx5_sdlb.c | 139 u32 *first) in sparx5_sdlb_group_get_adjacent() argument
143 *first = sparx5_sdlb_group_get_first(sparx5, group); in sparx5_sdlb_group_get_adjacent()
144 *prev = *first; in sparx5_sdlb_group_get_adjacent()
145 *next = *first; in sparx5_sdlb_group_get_adjacent()
146 itr = *first; in sparx5_sdlb_group_get_adjacent()
235 u32 first, u32 next, bool empty) in sparx5_sdlb_group_link() argument
248 /* Set the first lb */ in sparx5_sdlb_group_link()
249 spx5_wr(ANA_AC_SDLB_XLB_START_LBSET_START_SET(first), sparx5, in sparx5_sdlb_group_link()
260 u32 first, next; in sparx5_sdlb_group_add() local
263 first = idx; in sparx5_sdlb_group_add()
[all …]
|
| /linux-6.12.1/Documentation/networking/ |
| 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-6.12.1/rust/kernel/ |
| 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.
39 first: *mut ListLinksFields, field
238 first: ptr::null_mut(), in new()
245 self.first.is_null() in is_empty()
262 if self.first.is_null() { in push_back()
263 self.first = item; in push_back()
271 let next = self.first; in push_back()
302 if self.first.is_null() { in push_front()
310 let next = self.first; in push_front()
[all …]
|
| /linux-6.12.1/kernel/trace/ |
| 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 …]
|