Home
last modified time | relevance | path

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

12345678910>>...205

/linux/lib/
H A 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 …]
H A Dllist.c18 * 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 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/net/netfilter/
H A Dnft_set_pipapo_avx2.c88 * @start: First bit to set
142 * @last: Return index of first set bit, if this is the last field
151 * Return: first set bit index if @last, index of first filled word otherwise.
194 * @first: If this is the first field, don't source previous result
195 * @last: Last field: stop at the first match and return bit index
199 * this is the first field in the set, simply AND the buckets together
213 * Return: -1 on no match, rule index of match if @last, otherwise first long
214 * word index to be checked next (i.e. first fille
217 nft_pipapo_avx2_lookup_4b_2(unsigned long * map,unsigned long * fill,const struct nft_pipapo_field * f,int offset,const u8 * pkt,bool first,bool last) nft_pipapo_avx2_lookup_4b_2() argument
280 nft_pipapo_avx2_lookup_4b_4(unsigned long * map,unsigned long * fill,const struct nft_pipapo_field * f,int offset,const u8 * pkt,bool first,bool last) nft_pipapo_avx2_lookup_4b_4() argument
357 nft_pipapo_avx2_lookup_4b_8(unsigned long * map,unsigned long * fill,const struct nft_pipapo_field * f,int offset,const u8 * pkt,bool first,bool last) nft_pipapo_avx2_lookup_4b_8() argument
453 nft_pipapo_avx2_lookup_4b_12(unsigned long * map,unsigned long * fill,const struct nft_pipapo_field * f,int offset,const u8 * pkt,bool first,bool last) nft_pipapo_avx2_lookup_4b_12() argument
543 nft_pipapo_avx2_lookup_4b_32(unsigned long * map,unsigned long * fill,const struct nft_pipapo_field * f,int offset,const u8 * pkt,bool first,bool last) nft_pipapo_avx2_lookup_4b_32() argument
679 nft_pipapo_avx2_lookup_8b_1(unsigned long * map,unsigned long * fill,const struct nft_pipapo_field * f,int offset,const u8 * pkt,bool first,bool last) nft_pipapo_avx2_lookup_8b_1() argument
737 nft_pipapo_avx2_lookup_8b_2(unsigned long * map,unsigned long * fill,const struct nft_pipapo_field * f,int offset,const u8 * pkt,bool first,bool last) nft_pipapo_avx2_lookup_8b_2() argument
802 nft_pipapo_avx2_lookup_8b_4(unsigned long * map,unsigned long * fill,const struct nft_pipapo_field * f,int offset,const u8 * pkt,bool first,bool last) nft_pipapo_avx2_lookup_8b_4() argument
878 nft_pipapo_avx2_lookup_8b_6(unsigned long * map,unsigned long * fill,const struct nft_pipapo_field * f,int offset,const u8 * pkt,bool first,bool last) nft_pipapo_avx2_lookup_8b_6() argument
964 nft_pipapo_avx2_lookup_8b_16(unsigned long * map,unsigned long * fill,const struct nft_pipapo_field * f,int offset,const u8 * pkt,bool first,bool last) nft_pipapo_avx2_lookup_8b_16() argument
1059 nft_pipapo_avx2_lookup_slow(const struct nft_pipapo_match * mdata,unsigned long * map,unsigned long * fill,const struct nft_pipapo_field * f,const u8 * pkt,bool first,bool last) nft_pipapo_avx2_lookup_slow() argument
1169 bool last = i == m->field_count - 1, first = !i; pipapo_get_avx2() local
[all...]
/linux/kernel/bpf/
H A Dpercpu_freelist.c18 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/arch/alpha/lib/
H A 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 …]
H A Dstxcpy.S43 t0 == the first destination word for masking back in
44 t1 == the first source word. */
51 mskql t0, a1, t0 # e0 : assemble the first output word
57 t0 == the first destination word for masking back in
108 /* We are co-aligned; take care of a partial first word. */
109 ldq_u t1, 0(a1) # e0 : load first src word
123 /* We know just enough now to be able to assemble the first
128 t0 == the first dest word, for masking back in, if needed else 0
129 t1 == the low bits of the first source word
155 stq_u t1, 0(a0) # e0 : store first output word
[all …]
/linux/Documentation/userspace-api/media/v4l/
H A Dfield-order.rst31 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/tools/testing/selftests/bpf/
H A Dbpf_arena_list.h16 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, in list_add_head()
[all...]
/linux/include/linux/
H A Dlist.h348 * @first: first entry to move
349 * @last: last entry to move, can be the same as first
351 * Move all entries between @first and including @last before @head.
355 struct list_head *first, in list_bulk_move_tail() argument
358 first->prev->next = last->next; in list_bulk_move_tail()
359 last->next->prev = first->prev; in list_bulk_move_tail()
361 head->prev->next = first; in list_bulk_move_tail()
362 first->prev = head->prev; in list_bulk_move_tail()
369 * list_is_first -- tests whether @list is the first entry in list @head
450 struct list_head *first; in list_rotate_left() local
[all …]
/linux/drivers/net/wireless/broadcom/brcm80211/brcmsmac/
H A 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/kernel/trace/
H A Drethook.c47 * 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/drivers/video/fbdev/core/
H A Dfb_fillrect.h111 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/kvm/lib/
H A 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()
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 Dx25-iface.rst21 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 Dn_gsm.rst52 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/tools/perf/pmu-events/arch/x86/pantherlake/
H A Dmemory.json96 "BriefDescription": "Counts randomly selected loads when the latency from first dispatch to completion is greater than 1024 cycles.",
103 "PublicDescription": "Counts randomly selected loads when the latency from first dispatch to completion is greater than 1024 cycles. Reported latency may be longer than just the memory latency. Available PDIST counters: 0,1",
109 "BriefDescription": "Counts randomly selected loads when the latency from first dispatch to completion is greater than 128 cycles.",
116 "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. Available PDIST counters: 0,1",
122 "BriefDescription": "Counts randomly selected loads when the latency from first dispatch to completion is greater than 16 cycles.",
129 "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. Available PDIST counters: 0,1",
135 "BriefDescription": "Counts randomly selected loads when the latency from first dispatch to completion is greater than 2048 cycles.",
142 "PublicDescription": "Counts randomly selected loads when the latency from first dispatch to completion is greater than 2048 cycles. Reported latency may be longer than just the memory latency. Available PDIST counters: 0,1",
148 "BriefDescription": "Counts randomly selected loads when the latency from first dispatch to completion is greater than 256 cycles.",
155 "PublicDescription": "Counts randomly selected loads when the latency from first dispatc
[all...]
/linux/tools/include/linux/
H A Dlist.h173 * list_is_first -- tests whether @list is the first entry in list @head
227 struct list_head *first; in list_rotate_left() local
230 first = head->next; in list_rotate_left()
231 list_move_tail(first, head); in list_rotate_left()
288 struct list_head *first = list->next; in __list_splice() local
291 first->prev = prev; in __list_splice()
292 prev->next = first; in __list_splice()
301 * @head: the place to add it in the first list.
313 * @head: the place to add it in the first list.
325 * @head: the place to add it in the first list.
[all …]
/linux/tools/perf/pmu-events/arch/x86/tigerlake/
H A Dmemory.json21 "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/fs/
H A Dbinfmt_script.c19 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()
/linux/tools/perf/util/
H A Devsel_fprintf.c20 static int comma_fprintf(FILE *fp, bool *first, const char *fmt, ...) in comma_fprintf() argument
25 if (!*first) { in comma_fprintf()
29 *first = false; in comma_fprintf()
45 bool first = true; in evsel__fprintf() local
70 __print_attr__fprintf, &first); in evsel__fprintf()
77 printed += comma_fprintf(fp, &first, " %s=%" PRIu64, in evsel__fprintf()
87 printed += comma_fprintf(fp, &first, " (not a tracepoint)"); in evsel__fprintf()
94 printed += comma_fprintf(fp, &first, " (no trace field)"); in evsel__fprintf()
98 printed += comma_fprintf(fp, &first, " trace_fields: %s", field->name); in evsel__fprintf()
102 printed += comma_fprintf(fp, &first, " in evsel__fprintf()
129 bool first = true; sample__fprintf_callchain() local
[all...]
H A Daddr2line.c152 bool first, in read_addr2line_record()
178 * Read the first line. Without an error this will be: in read_addr2line_record()
179 * - for the first line an address like 0x1234, in read_addr2line_record()
192 } else if (style == GNU_BINUTILS && (!first || addr != 0)) { in read_addr2line_record()
210 if (first && !zero_count) { in read_addr2line_record()
229 /* Read the second function name line (if inline data then this is the first line). */ in read_addr2line_record()
230 if (first && (io__getline(io, &line, &line_len) < 0 || !line_len)) in read_addr2line_record()
321 * ","). This causes addr2line to first write out the answer to our in cmd__addr2line()
336 switch (read_addr2line_record(&io, cmd_a2l_style, dso_name, addr, /*first=*/true, in cmd__addr2line()
340 pr_warning("%s %s: could not read first recor in cmd__addr2line()
155 read_addr2line_record(struct io * io,enum cmd_a2l_style style,const char * dso_name,u64 addr,bool first,char ** function,char ** filename,unsigned int * line_nr) read_addr2line_record() argument
[all...]
/linux/drivers/net/wireguard/
H A Dsend.c242 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/drivers/net/ethernet/intel/ice/
H A Dice_txrx.c37 struct ice_tx_buf *tx_buf, *first; in ice_prgm_fdir_fltr() local
69 first = &tx_ring->tx_buf[i]; in ice_prgm_fdir_fltr()
101 first->next_to_watch = tx_desc; in ice_prgm_fdir_fltr()
821 * First, try to clean "cleaned_count" Rx buffers. Then refill the cleaned Rx
1390 * @first: first buffer info buffer to use
1393 * This function loops over the skb data pointed to by *first
1398 ice_tx_map(struct ice_tx_ring *tx_ring, struct ice_tx_buf *first, in ice_tx_map() argument
1414 skb = first->skb; in ice_tx_map()
1421 if (first->tx_flags & ICE_TX_FLAGS_HW_VLAN) { in ice_tx_map()
1423 td_tag = first->vid; in ice_tx_map()
[all …]
/linux/rust/kernel/
H A Dlist.rs49 /// * If the list is empty, then `first` is null. Otherwise, `first` points at the `ListLinks`
50 /// field of the first element in the list.
280 first: *mut ListLinksFields,
486 first: ptr::null_mut(),
493 self.first.is_null() in insert_inner()
498 /// Returns a pointer to the newly inserted element. Never changes `self.first` unless the list in insert_inner()
530 self.first = item; in insert_inner()
552 // * `self.first` is null or in the list.
553 // * `self.first` i
264 first: *mut ListLinksFields, global() field
960 let first = self.list.first; prev_ptr() localVariable
[all...]

12345678910>>...205