Home
last modified time | relevance | path

Searched full:first (Results 1 – 25 of 5321) sorted by relevance

12345678910>>...213

/Linux-v6.1/ipc/
Dsyscall.c20 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-v6.1/lib/
Dsiphash.c113 * @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 …]
Dllist.c20 * @new_first: first entry in batch to be added
29 struct llist_node *first; in llist_add_batch() local
32 new_last->next = first = READ_ONCE(head->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-v6.1/tools/power/cpupower/lib/
Dcpufreq.c273 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-v6.1/Documentation/admin-guide/
Ddevices.txt21 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-v6.1/io_uring/
Dslist.h7 for (pos = (head)->first, prv = NULL; pos; prv = pos, pos = (pos)->next)
12 #define wq_list_empty(list) (READ_ONCE((list)->first) == NULL)
15 (list)->first = NULL; \
31 * wq_list_merge - merge the second list to the first one.
32 * @list0: the first list
34 * Return the first node after mergence.
41 if (!list0->first) { in wq_list_merge()
42 ret = list1->first; in wq_list_merge()
44 ret = list0->first; in wq_list_merge()
45 list0->last->next = list1->first; in wq_list_merge()
[all …]
/Linux-v6.1/net/netfilter/
Dnft_set_pipapo_avx2.c91 * @start: First bit to set
145 * @last: Return index of first set bit, if this is the last field
153 * Return: first set bit index if @last, index of first filled word otherwise.
195 * @first: If this is the first field, don't source previous result
196 * @last: Last field: stop at the first match and return bit index
200 * this is the first field in the set, simply AND the buckets together
214 * Return: -1 on no match, rule index of match if @last, otherwise first long
215 * word index to be checked next (i.e. first filled word).
219 const u8 *pkt, bool first, bool last) in nft_pipapo_avx2_lookup_4b_2() argument
229 if (first) { in nft_pipapo_avx2_lookup_4b_2()
[all …]
/Linux-v6.1/kernel/bpf/
Dpercpu_freelist.c18 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-v6.1/drivers/video/fbdev/core/
Dsysfillrect.c28 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 …]
Dcfbfillrect.c38 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 …]
Dsyscopyarea.c31 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-v6.1/arch/alpha/lib/
Dcsum_partial_copy.c129 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-v6.1/Documentation/userspace-api/media/v4l/
Dfield-order.rst30 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 …]
Ddev-raw-vbi.rst92 :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-v6.1/drivers/net/ethernet/ibm/
Dibmvnic.h248 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-v6.1/include/linux/
Dlist_bl.h13 * 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 …]
Dlist_nulls.h22 struct hlist_nulls_node *first; member
30 ((ptr)->first = (struct hlist_nulls_node *) NULLS_MARKER(nulls))
88 return is_a_nulls(READ_ONCE(h->first)); in hlist_nulls_empty()
94 struct hlist_nulls_node *first = h->first; in hlist_nulls_add_head() local
96 n->next = first; in hlist_nulls_add_head()
97 WRITE_ONCE(n->pprev, &h->first); in hlist_nulls_add_head()
98 h->first = n; in hlist_nulls_add_head()
99 if (!is_a_nulls(first)) in hlist_nulls_add_head()
100 WRITE_ONCE(first->pprev, &n->next); in hlist_nulls_add_head()
128 for (pos = (head)->first; \
Dllist.h16 * 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()
105 * @node: the first entry of deleted list entries
124 * @node: the first entry of deleted list entries
163 * @node: the first entry of deleted list entries.
191 return READ_ONCE(head->first) == NULL; in llist_empty()
207 new_last->next = head->first; in __llist_add_batch()
208 head->first = new_first; in __llist_add_batch()
[all …]
/Linux-v6.1/arch/loongarch/kernel/
Dunwind_prologue.c18 else if (state->first) in unwind_get_return_address()
69 if (state->first) in unwind_by_prologue()
70 goto first; in unwind_by_prologue()
86 if (state->first) { in unwind_by_prologue()
88 goto first; in unwind_by_prologue()
93 if (state->first) in unwind_by_prologue()
94 state->first = false; in unwind_by_prologue()
100 first: in unwind_by_prologue()
101 state->first = false; in unwind_by_prologue()
123 state->first = true; in unwind_start()
[all …]
/Linux-v6.1/fs/reiserfs/
Dlbalance.c36 * 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-v6.1/drivers/net/wireless/broadcom/brcm80211/brcmsmac/
Dphy_shim.h80 /* 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-v6.1/Documentation/driver-api/tty/
Dn_gsm.rst46 uint32_t first;
58 being able to answer to the first MUX packet so a delay
75 /* get first gsmtty device node */
76 ioctl(fd, GSMIOC_GETFIRST, &first);
77 printf("first muxed line: /dev/gsmtty%i\n", first);
90 #. First close all virtual ports before closing the physical port.
123 uint32_t first;
145 /* get first gsmtty device node */
146 ioctl(fd, GSMIOC_GETFIRST, &first);
147 printf("first muxed line: /dev/gsmtty%i\n", first);
/Linux-v6.1/Documentation/networking/
Dx25-iface.rst22 over the LAPB link. The first byte of the skbuff indicates the meaning of
29 First Byte = 0x00 (X25_IFACE_DATA)
35 First Byte = 0x01 (X25_IFACE_CONNECT)
40 First Byte = 0x02 (X25_IFACE_DISCONNECT)
45 First Byte = 0x03 (X25_IFACE_PARAMS)
53 First Byte = 0x00 (X25_IFACE_DATA)
58 First Byte = 0x01 (X25_IFACE_CONNECT)
63 First Byte = 0x02 (X25_IFACE_DISCONNECT)
68 First Byte = 0x03 (X25_IFACE_PARAMS)
/Linux-v6.1/tools/testing/selftests/kvm/lib/
Dsparsebit.c55 * 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()
975 /* First clear any bits already set in the destination */ in sparsebit_copy()
993 /* With num > 0, the first bit must be set. */ in sparsebit_is_set_num()
1024 /* With num > 0, the first bit must be cleared. */ in sparsebit_is_clear_num()
1085 /* Returns the index of the first set bit. Abort if no bits are set.
1098 /* Returns the index of the first cleared bit. Abort if
1108 /* If no nodes or first node index > 0 then lowest cleared is 0 */ in sparsebit_first_clear()
[all …]
/Linux-v6.1/kernel/trace/
Drethook.c204 node = tsk->rethooks.first; in __rethook_find_ret_addr()
232 * first call, but '@cur' itself must NOT NULL.
274 struct llist_node *first, *node = NULL; in rethook_trampoline_handler() local
297 first = current->rethooks.first; in rethook_trampoline_handler()
298 while (first) { in rethook_trampoline_handler()
299 rhn = container_of(first, struct rethook_node, llist); in rethook_trampoline_handler()
306 if (first == node) in rethook_trampoline_handler()
308 first = first->next; in rethook_trampoline_handler()
315 first = current->rethooks.first; in rethook_trampoline_handler()
316 current->rethooks.first = node->next; in rethook_trampoline_handler()
[all …]

12345678910>>...213