| /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/tools/power/cpupower/lib/ |
| H A D | cpufreq.c | 291 struct cpufreq_available_governors *first = NULL; in cpufreq_get_available_governors() local
313 first = malloc(sizeof(*first)); in cpufreq_get_available_governors()
314 if (!first) in cpufreq_get_available_governors()
316 current = first; in cpufreq_get_available_governors()
318 current->first = first; in cpufreq_get_available_governors()
331 return first; in cpufreq_get_available_governors()
334 while (first) { in cpufreq_get_available_governors()
335 current = first->next; in cpufreq_get_available_governors()
336 if (first->governor) in cpufreq_get_available_governors()
337 free(first->governor); in cpufreq_get_available_governors()
[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/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 | 325 * @first: first entry to move
326 * @last: last entry to move, can be the same as first
328 * Move all entries between @first and including @last before @head.
332 struct list_head *first, in list_bulk_move_tail() argument
335 first->prev->next = last->next; in list_bulk_move_tail()
336 last->next->prev = first->prev; in list_bulk_move_tail()
338 head->prev->next = first; in list_bulk_move_tail()
339 first->prev = head->prev; in list_bulk_move_tail()
346 * list_is_first -- tests whether @list is the first entry in list @head
427 struct list_head *first; in list_rotate_left() local
[all …]
|
| H A D | list_nulls.h | 22 struct hlist_nulls_node *first; member
30 ((ptr)->first = (struct hlist_nulls_node *) NULLS_MARKER(nulls))
31 #define HLIST_NULLS_HEAD_INIT(nulls) {.first = (struct hlist_nulls_node *)NULLS_MARKER(nulls)}
89 return is_a_nulls(READ_ONCE(h->first)); in hlist_nulls_empty()
95 struct hlist_nulls_node *first = h->first; in hlist_nulls_add_head() local
97 n->next = first; in hlist_nulls_add_head()
98 WRITE_ONCE(n->pprev, &h->first); in hlist_nulls_add_head()
99 h->first = n; in hlist_nulls_add_head()
100 if (!is_a_nulls(first)) in hlist_nulls_add_head()
101 WRITE_ONCE(first->pprev, &n->next); in hlist_nulls_add_head()
[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/drivers/net/ethernet/ibm/ |
| H A D | ibmvnic.h | 254 u8 first; member
270 u8 first; member
297 u8 first; member
309 u8 first; member
317 u8 first; member
330 u8 first; member
346 u8 first; member
351 u8 first; member
366 u8 first; member
373 u8 first; member
[all …]
|
| /linux/drivers/video/fbdev/core/ |
| H A D | fb_copyarea.h | 54 unsigned long first, last; in fb_copy_aligned_fwd() local
56 first = fb_pixel_mask(dst->bits, reverse); in fb_copy_aligned_fwd()
62 last = last ? (last & first) : first; in fb_copy_aligned_fwd()
71 int offset = first != ~0UL; in fb_copy_aligned_fwd()
75 fb_copy_offset_masked(first, 0, dst, src); in fb_copy_aligned_fwd()
100 unsigned long first, last; in fb_copy_aligned_rev() local
102 first = fb_pixel_mask(dst->bits, reverse); in fb_copy_aligned_rev()
108 first &= last; in fb_copy_aligned_rev()
109 if (first == ~0UL) in fb_copy_aligned_rev()
112 fb_copy_offset_masked(first, 0, dst, src); in fb_copy_aligned_rev()
[all …]
|
| H A D | fb_fillrect.h | 111 unsigned long first, last; in bitfill() local
114 first = fb_pixel_mask(dst->bits, pattern->reverse); in bitfill()
118 last = last ? (last & first) : first; in bitfill()
119 first = get(pattern); in bitfill()
121 fb_write_offset(first, 0, dst); in bitfill()
123 fb_modify_offset(first, last, 0, dst); in bitfill()
125 int offset = first != ~0UL; in bitfill()
128 fb_modify_offset(get(pattern), first, 0, dst); in bitfill()
159 unsigned long first, last; in bitinvert() local
163 first = fb_pixel_mask(dst->bits, pattern->reverse); in bitinvert()
[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/Documentation/userspace-api/media/v4l/ |
| H A D | field-order.rst | 31 even) fields, the *spatial order*: The first line of the top field is
32 the first line of an interlaced frame, the first line of the bottom
50 captured first (is the older field), the top field is also transmitted
51 first on the bus.
109 - Images contain both fields, the top field lines are stored first
111 are always stored in temporal order, the older one first in
116 first in memory, immediately followed by the top field lines.
117 Fields are always stored in temporal order, the older one first in
122 temporal order, i. e. the older one first. To indicate the field
137 first. The top field is the older field.
[all …]
|
| /linux/drivers/crypto/marvell/cesa/ |
| H A D | tdma.c | 42 if (engine->chain_sw.first == dreq->chain.first) { in mv_cesa_dma_step()
43 engine->chain_sw.first = NULL; in mv_cesa_dma_step()
46 engine->chain_hw.first = dreq->chain.first; in mv_cesa_dma_step()
60 writel_relaxed(dreq->chain.first->cur_dma, in mv_cesa_dma_step()
71 for (tdma = dreq->chain.first; tdma;) { in mv_cesa_dma_cleanup()
84 dreq->chain.first = NULL; in mv_cesa_dma_cleanup()
93 for (tdma = dreq->chain.first; tdma; tdma = tdma->next) { in mv_cesa_dma_prepare()
114 if (!last || dreq->chain.first->flags & CESA_TDMA_SET_STATE) in mv_cesa_tdma_chain()
115 engine->chain_sw.first = dreq->chain.first; in mv_cesa_tdma_chain()
117 last->next = dreq->chain.first; in mv_cesa_tdma_chain()
[all …]
|
| /linux/drivers/net/ethernet/microchip/sparx5/ |
| H A D | sparx5_sdlb.c | 140 u32 *first) in sparx5_sdlb_group_get_adjacent() argument
144 *first = sparx5_sdlb_group_get_first(sparx5, group); in sparx5_sdlb_group_get_adjacent()
145 *prev = *first; in sparx5_sdlb_group_get_adjacent()
146 *next = *first; in sparx5_sdlb_group_get_adjacent()
147 itr = *first; in sparx5_sdlb_group_get_adjacent()
237 u32 first, u32 next, bool empty) in sparx5_sdlb_group_link() argument
250 /* Set the first lb */ in sparx5_sdlb_group_link()
251 spx5_wr(ANA_AC_SDLB_XLB_START_LBSET_START_SET(first), sparx5, in sparx5_sdlb_group_link()
262 u32 first, next; in sparx5_sdlb_group_add() local
265 first = idx; in sparx5_sdlb_group_add()
[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/arch/loongarch/kernel/ |
| H A D | unwind_prologue.c | 78 * As we meet ftrace_regs_entry, reset first flag like first doing
121 state->first = true; in unwind_by_prologue()
130 * When first is not set, the PC is a return address in the previous frame. in unwind_by_prologue()
133 pc = state->pc - (state->first ? 0 : LOONGARCH_INSN_SIZE); in unwind_by_prologue()
151 * first being true is reasonable, otherwise indicate analysis is broken. in unwind_by_prologue()
154 if (state->first) in unwind_by_prologue()
155 goto first; in unwind_by_prologue()
172 if (state->first) { in unwind_by_prologue()
174 goto first; in unwind_by_prologue()
183 first: in unwind_by_prologue()
[all …]
|
| /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/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/tools/perf/pmu-events/arch/x86/pantherlake/ |
| H A D | memory.json | 40 …"BriefDescription": "Counts randomly selected loads when the latency from first dispatch to comple…
47 …"PublicDescription": "Counts randomly selected loads when the latency from first dispatch to compl…
53 …"BriefDescription": "Counts randomly selected loads when the latency from first dispatch to comple…
60 …"PublicDescription": "Counts randomly selected loads when the latency from first dispatch to compl…
66 …"BriefDescription": "Counts randomly selected loads when the latency from first dispatch to comple…
73 …"PublicDescription": "Counts randomly selected loads when the latency from first dispatch to compl…
79 …"BriefDescription": "Counts randomly selected loads when the latency from first dispatch to comple…
86 …"PublicDescription": "Counts randomly selected loads when the latency from first dispatch to compl…
92 …"BriefDescription": "Counts randomly selected loads when the latency from first dispatch to comple…
99 …"PublicDescription": "Counts randomly selected loads when the latency from first dispatch to compl…
[all …]
|