Home
last modified time | relevance | path

Searched full:next (Results 1 – 25 of 4309) sorted by relevance

12345678910>>...173

/linux/scripts/gendwarfksyms/examples/
H A Dkabi_ex.h49 * STABLE-NEXT: }
65 * STABLE-NEXT: enumerator A = 0 ,
66 * STABLE-NEXT: enumerator D = 123456789
67 * STABLE-NEXT: } byte_size(4)
81 * STABLE-NEXT: member base_type int byte_size(4) encoding(5) a data_member_location(0) ,
82 …* STABLE-NEXT: member base_type [[ULONG:long unsigned int|unsigned long]] byte_size(8) encoding(…
83 * STABLE-NEXT: member base_type [[ULONG]] byte_size(8) encoding(7) data_member_location(16)
84 * STABLE-NEXT: } byte_size(24)
95 * STABLE-NEXT: member base_type int byte_size(4) encoding(5) a data_member_location(0) ,
96 * STABLE-NEXT: member base_type [[ULONG]] byte_size(8) encoding(7) data_member_location(8) ,
[all …]
/linux/arch/riscv/mm/
H A Dkasan_init.c54 unsigned long next; in kasan_populate_pmd() local
64 next = pmd_addr_end(vaddr, end); in kasan_populate_pmd()
67 (next - vaddr) >= PMD_SIZE) { in kasan_populate_pmd()
76 kasan_populate_pte(pmdp, vaddr, next); in kasan_populate_pmd()
77 } while (pmdp++, vaddr = next, vaddr != end); in kasan_populate_pmd()
85 unsigned long next; in kasan_populate_pud() local
95 next = pud_addr_end(vaddr, end); in kasan_populate_pud()
98 (next - vaddr) >= PUD_SIZE) { in kasan_populate_pud()
107 kasan_populate_pmd(pudp, vaddr, next); in kasan_populate_pud()
108 } while (pudp++, vaddr = next, vaddr != end); in kasan_populate_pud()
[all …]
/linux/tools/include/linux/
H A Dlist.h15 * sometimes we already know the next/prev entries and we can
27 list->next = list; in INIT_LIST_HEAD()
35 * the prev/next entries already!
40 struct list_head *next) in __list_add() argument
42 next->prev = new; in __list_add()
43 new->next = next; in __list_add()
45 prev->next = new; in __list_add()
50 struct list_head *next);
63 __list_add(new, head, head->next); in list_add()
81 * Delete a list entry by making the prev/next entries
[all …]
/linux/include/linux/
H A Dlist.h18 * sometimes we already know the next/prev entries and we can
45 WRITE_ONCE(list->next, list); in INIT_LIST_HEAD()
63 struct list_head *next);
75 struct list_head *next) in __list_add_valid() argument
81 * With the hardening version, elide checking if next and prev in __list_add_valid()
91 if (likely(next->prev == prev && prev->next == next && new != prev && new != next)) in __list_add_valid()
96 ret &= __list_add_valid_or_report(new, prev, next); in __list_add_valid()
120 struct list_head *next = entry->next; in __list_del_entry_valid() local
123 * With the hardening version, elide checking if next and prev in __list_del_entry_valid()
127 if (likely(prev->next == entry && next->prev == entry)) in __list_del_entry_valid()
[all …]
H A Drculist.h24 WRITE_ONCE(list->next, list); in INIT_LIST_HEAD_RCU()
29 * return the ->next pointer of a list_head in an rcu safe
32 #define list_next_rcu(list) (*((struct list_head __rcu **)(&(list)->next)))
51 for (pos = rcu_dereference((head)->next); \
53 pos = rcu_dereference(pos->next))
95 * the prev/next entries already!
98 struct list_head *prev, struct list_head *next) in __list_add_rcu() argument
100 if (!__list_add_valid(new, prev, next)) in __list_add_rcu()
103 new->next = next; in __list_add_rcu()
106 next->prev = new; in __list_add_rcu()
[all …]
/linux/arch/arm64/boot/dts/renesas/
H A Dr8a78000.dtsi146 next-level-cache = <&L2_CA720_0>;
153 next-level-cache = <&L2_CA720_1>;
160 next-level-cache = <&L2_CA720_2>;
167 next-level-cache = <&L2_CA720_3>;
174 next-level-cache = <&L2_CA720_4>;
181 next-level-cache = <&L2_CA720_5>;
188 next-level-cache = <&L2_CA720_6>;
195 next-level-cache = <&L2_CA720_7>;
202 next-level-cache = <&L2_CA720_8>;
209 next-level-cache = <&L2_CA720_9>;
[all …]
/linux/drivers/net/wireguard/
H A Dqueueing.c50 #define NEXT(skb) ((skb)->prev) macro
55 NEXT(STUB(queue)) = NULL; in wg_prev_queue_init()
60 offsetof(struct sk_buff, next) != offsetof(struct prev_queue, empty.next) - in wg_prev_queue_init()
68 WRITE_ONCE(NEXT(skb), NULL); in __wg_prev_queue_enqueue()
69 WRITE_ONCE(NEXT(xchg_release(&queue->head, skb)), skb); in __wg_prev_queue_enqueue()
82 struct sk_buff *tail = queue->tail, *next = smp_load_acquire(&NEXT(tail)); in wg_prev_queue_dequeue() local
85 if (!next) in wg_prev_queue_dequeue()
87 queue->tail = next; in wg_prev_queue_dequeue()
88 tail = next; in wg_prev_queue_dequeue()
89 next = smp_load_acquire(&NEXT(next)); in wg_prev_queue_dequeue()
[all …]
/linux/tools/usb/usbip/libsrc/
H A Dlist.h14 * sometimes we already know the next/prev entries and we can
20 struct list_head *next, *prev; member
30 list->next = list; in INIT_LIST_HEAD()
38 * the prev/next entries already!
42 struct list_head *next) in __list_add() argument
44 next->prev = new; in __list_add()
45 new->next = next; in __list_add()
47 prev->next = new; in __list_add()
60 __list_add(new, head, head->next); in list_add()
64 * Delete a list entry by making the prev/next entries
[all …]
/linux/drivers/pci/hotplug/
H A Dcpqphp_ctrl.c121 slot = slot->next; in cpqhp_find_slot()
307 if (!((*head)->next)) in sort_by_size()
314 if (((*head)->next) && in sort_by_size()
315 ((*head)->length > (*head)->next->length)) { in sort_by_size()
318 *head = (*head)->next; in sort_by_size()
319 current_res->next = (*head)->next; in sort_by_size()
320 (*head)->next = current_res; in sort_by_size()
325 while (current_res->next && current_res->next->next) { in sort_by_size()
326 if (current_res->next->length > current_res->next->next->length) { in sort_by_size()
328 next_res = current_res->next; in sort_by_size()
[all …]
/linux/drivers/scsi/sym53c8xx_2/
H A Dsym_malloc.c64 while (!h[j].next) { in ___sym_malloc()
66 h[j].next = (m_link_p) M_GET_MEM_CLUSTER(); in ___sym_malloc()
67 if (h[j].next) in ___sym_malloc()
68 h[j].next->next = NULL; in ___sym_malloc()
74 a = h[j].next; in ___sym_malloc()
76 h[j].next = h[j].next->next; in ___sym_malloc()
80 h[j].next = (m_link_p) (a+s); in ___sym_malloc()
81 h[j].next->next = NULL; in ___sym_malloc()
120 ((m_link_p) a)->next = h[i].next; in ___sym_mfree()
121 h[i].next = (m_link_p) a; in ___sym_mfree()
[all …]
/linux/Documentation/networking/
H A Dnexthop-group-resilient.rst4 Resilient Next-hop Groups
7 Resilient groups are a type of next-hop group that is aimed at minimizing
9 weights of constituent next hops.
12 the legacy multipath next-hop group, which uses the hash-threshold
15 To select a next hop, hash-threshold algorithm first assigns a range of
16 hashes to each next hop in the group, and then selects the next hop by
17 comparing the SKB hash with the individual ranges. When a next hop is
19 reassignment of parts of hash space from one next hop to another. RFC 2992
28 Before and after deletion of next hop 3
31 Note how next hop 2 gave up part of the hash space in favor of next hop 1,
[all …]
/linux/drivers/memory/tegra/
H A Dtegra210-emc-cc-r21021.c78 ({ next->ptfv_list[(dev)] = \
79 next->ptfv_list[(dev)] / \
80 next->ptfv_list[PTFV_DVFS_SAMPLES_INDEX]; })
86 ({ next->ptfv_list[(dev)] += \
102 next->ptfv_list[dqs] = \
104 (next->ptfv_list[dqs] * \
105 next->ptfv_list[w])) / \
106 (next->ptfv_list[w] + 1); \
109 __stringify(dev), nval, next->ptfv_list[dqs]); \
184 struct tegra210_emc_timing *next) in periodic_compensation_handler() argument
[all …]
/linux/rust/kernel/
H A Dlist.rs44 /// only have one `ListArc` (for each pair of prev/next pointers), this ensures that the same
45 /// prev/next pointers are not used for several linked lists.
51 /// * All prev/next pointers in `ListLinks` fields of items in the list are valid and form a cycle.
100 /// assert_eq!(iter.next().ok_or(EINVAL)?.value, 15);
101 /// assert_eq!(iter.next().ok_or(EINVAL)?.value, 10);
102 /// assert_eq!(iter.next().ok_or(EINVAL)?.value, 30);
103 /// assert!(iter.next().is_none());
125 /// assert_eq!(iter.next().ok_or(EINVAL)?.value, 30);
126 /// assert_eq!(iter.next().ok_or(EINVAL)?.value, 10);
127 /// assert_eq!(iter.next()
361 next: *mut ListLinksFields, global() field
782 fn next(&mut self) -> Option<ArcBorrow<'a, T>> { next() method
791 let next = unsafe { (*current).next }; next() localVariable
951 next: *mut ListLinksFields, global() field
959 let mut next = self.next; prev_ptr() localVariable
1021 let mut next = unsafe { (*self.next).next }; move_next() localVariable
1186 fn next(&mut self) -> Option<ListArc<T, ID>> { next() method
[all...]
/linux/rust/pin-init/examples/
H A Dlinked_list.rs26 next: Link, field
36 next: unsafe { Link::new_unchecked(this) }, in new()
46 prev: list.next.prev().replace(unsafe { Link::new_unchecked(this)}), in insert_next()
47 next: list.next.replace(unsafe { Link::new_unchecked(this)}), in insert_next()
55 next: list.prev.next().replace(unsafe { Link::new_unchecked(this)}), in insert_prev()
62 pub fn next(&self) -> Option<NonNull<Self>> { in next() method
63 if ptr::eq(self.next.as_ptr(), self) { in next()
66 Some(unsafe { NonNull::new_unchecked(self.next in next()
87 let next = unsafe { &*self.next.as_ptr() }; drop() localVariable
112 fn next(&self) -> &Link { next() method
[all...]
/linux/drivers/usb/host/
H A Dohci-dbg.c23 #define ohci_dbg_sw(ohci, next, size, format, arg...) \ argument
25 if (next != NULL) { \
27 s_len = scnprintf (*next, *size, format, ## arg ); \
28 *size -= s_len; *next += s_len; \
33 /* Version for use where "next" is the address of a local variable */
34 #define ohci_dbg_nosw(ohci, next, size, format, arg...) \ argument
37 s_len = scnprintf(*next, *size, format, ## arg); \
38 *size -= s_len; *next += s_len; \
46 char **next, in ohci_dump_intr_mask() argument
49 ohci_dbg_sw (ohci, next, size, "%s 0x%08x%s%s%s%s%s%s%s%s%s\n", in ohci_dump_intr_mask()
[all …]
H A Dehci-dbg.c108 ehci_dbg(ehci, "%s [%d] itd %p, next %08x, urb %p\n", in dbg_itd()
139 ehci_dbg(ehci, "%s [%d] sitd %p, next %08x, urb %p\n", in dbg_sitd()
379 char *next = *nextp; in qh_lines() local
398 temp = scnprintf(next, size, in qh_lines()
400 " [cur %08x next %08x buf[0] %08x]", in qh_lines()
413 next += temp; in qh_lines()
446 temp = scnprintf(next, size, in qh_lines()
456 next += temp; in qh_lines()
461 temp = scnprintf(next, size, "\n"); in qh_lines()
463 next += temp; in qh_lines()
[all …]
/linux/drivers/gpu/drm/nouveau/nvkm/subdev/fb/
H A Dramgk104.c210 struct nvkm_ram_data *next = ram->base.next; in r1373f4_fini() local
211 u8 v0 = next->bios.ramcfg_11_03_c0; in r1373f4_fini()
212 u8 v1 = next->bios.ramcfg_11_03_30; in r1373f4_fini()
243 u32 next = (prev & ~mask) | data; in gk104_ram_nuts() local
244 nvkm_memx_wr32(fuc->memx, addr, next); in gk104_ram_nuts()
255 struct nvkm_ram_data *next = ram->base.next; in gk104_ram_calc_gddr5() local
256 int vc = !next->bios.ramcfg_11_02_08; in gk104_ram_calc_gddr5()
257 int mv = !next->bios.ramcfg_11_02_04; in gk104_ram_calc_gddr5()
311 switch (next->bios.ramcfg_11_03_c0) { in gk104_ram_calc_gddr5()
318 switch (next->bios.ramcfg_11_03_30) { in gk104_ram_calc_gddr5()
[all …]
/linux/scripts/include/
H A Dlist.h34 * sometimes we already know the next/prev entries and we can
53 list->next = list; in INIT_LIST_HEAD()
61 * the prev/next entries already!
65 struct list_head *next) in __list_add() argument
67 next->prev = new; in __list_add()
68 new->next = next; in __list_add()
70 prev->next = new; in __list_add()
83 __list_add(new, head, head->next); in list_add()
100 * Delete a list entry by making the prev/next entries
104 * the prev/next entries already!
[all …]
/linux/tools/testing/selftests/bpf/progs/
H A Dtest_core_read_macros.c13 struct callback_head___shuffled *next; member
38 /* next pointers for kernel address space have to be initialized from in handler()
41 k_probe_in.next = &k_probe_in; in handler()
42 __builtin_preserve_access_index(({k_core_in.next = &k_core_in;})); in handler()
44 k_probe_out = (long)BPF_PROBE_READ(&k_probe_in, next, next, func); in handler()
45 k_core_out = (long)BPF_CORE_READ(&k_core_in, next, next, func); in handler()
46 u_probe_out = (long)BPF_PROBE_READ_USER(u_probe_in, next, next, func); in handler()
47 u_core_out = (long)BPF_CORE_READ_USER(u_core_in, next, next, func); in handler()
/linux/lib/
H A Dplist.c35 WARN(n->prev != p || p->next != n, in plist_check_prev_next()
38 "next: %p, n: %p, p: %p\n", in plist_check_prev_next()
39 t, t->next, t->prev, in plist_check_prev_next()
40 p, p->next, p->prev, in plist_check_prev_next()
41 n, n->next, n->prev); in plist_check_prev_next()
46 struct list_head *prev = top, *next = top->next; in plist_check_list() local
48 plist_check_prev_next(top, prev, next); in plist_check_list()
49 while (next != top) { in plist_check_list()
50 prev = next; in plist_check_list()
51 next = prev->next; in plist_check_list()
[all …]
/linux/tools/firewire/
H A Dlist.h3 struct list *next, *prev; member
9 list->next = list; in list_init()
16 return list->next == list; in list_empty()
23 new_link->next = link; in list_insert()
24 new_link->prev->next = new_link; in list_insert()
25 new_link->next->prev = new_link; in list_insert()
37 list_insert(list->next, new_link); in list_prepend()
43 link->prev->next = link->next; in list_remove()
44 link->next->prev = link->prev; in list_remove()
51 list_entry((list)->next, type, member)
[all …]
/linux/ipc/
H A Dmsgutil.c25 * The next 2 defines are here bc this is the only file
35 struct msg_msgseg *next; member
36 /* the next part of the message follows immediately */
65 msg->next = NULL; in alloc_msg()
69 pseg = &msg->next; in alloc_msg()
80 seg->next = NULL; in alloc_msg()
81 pseg = &seg->next; in alloc_msg()
107 for (seg = msg->next; seg != NULL; seg = seg->next) { in load_msg()
138 for (dst_pseg = dst->next, src_pseg = src->next; in copy_msg()
140 dst_pseg = dst_pseg->next, src_pseg = src_pseg->next) { in copy_msg()
[all …]
/linux/drivers/gpu/drm/nouveau/nvkm/core/
H A Dmm.c54 struct nvkm_mm_node *next = node(this, next); in nvkm_mm_free() local
62 if (next && next->type == NVKM_MM_TYPE_NONE) { in nvkm_mm_free()
63 next->offset = this->offset; in nvkm_mm_free()
64 next->length += this->length; in nvkm_mm_free()
114 struct nvkm_mm_node *prev, *this, *next; in nvkm_mm_head() local
133 next = node(this, next); in nvkm_mm_head()
134 if (next && next->type != type) in nvkm_mm_head()
150 this->next = NULL; in nvkm_mm_head()
189 struct nvkm_mm_node *prev, *this, *next; in nvkm_mm_tail() local
207 next = node(this, next); in nvkm_mm_tail()
[all …]
/linux/fs/ntfs3/lib/
H A Ddecompress_common.h58 * left-justified; the next bit is always bit 31.
65 /* Pointer to the next byte to be retrieved from the input buffer. */
66 const u8 *next; member
78 is->next = buffer; in init_input_bitstream()
79 is->end = is->next + size; in init_input_bitstream()
91 if (is->end - is->next >= 2) { in bitstream_ensure_bits()
92 is->bitbuf |= (u32)get_unaligned_le16(is->next) in bitstream_ensure_bits()
94 is->next += 2; in bitstream_ensure_bits()
100 /* Return the next @num_bits bits from the bitstream, without removing them.
134 /* Read and return the next @num_bits bits from the bitstream. */
[all …]
/linux/arch/arm64/kvm/hyp/nvhe/
H A Dlist_debug.c31 struct list_head *next) in __list_add_valid_or_report() argument
33 if (NVHE_CHECK_DATA_CORRUPTION(next->prev != prev) || in __list_add_valid_or_report()
34 NVHE_CHECK_DATA_CORRUPTION(prev->next != next) || in __list_add_valid_or_report()
35 NVHE_CHECK_DATA_CORRUPTION(new == prev || new == next)) in __list_add_valid_or_report()
44 struct list_head *prev, *next; in __list_del_entry_valid_or_report() local
47 next = entry->next; in __list_del_entry_valid_or_report()
49 if (NVHE_CHECK_DATA_CORRUPTION(next == LIST_POISON1) || in __list_del_entry_valid_or_report()
51 NVHE_CHECK_DATA_CORRUPTION(prev->next != entry) || in __list_del_entry_valid_or_report()
52 NVHE_CHECK_DATA_CORRUPTION(next->prev != entry)) in __list_del_entry_valid_or_report()

12345678910>>...173