| /linux-6.14.4/lib/ |
| D | list_debug.c | 23 struct list_head *next) in __list_add_valid_or_report() argument
27 CHECK_DATA_CORRUPTION(next == NULL, NULL, in __list_add_valid_or_report()
28 "list_add corruption. next is NULL.\n") || in __list_add_valid_or_report()
29 CHECK_DATA_CORRUPTION(next->prev != prev, next, in __list_add_valid_or_report()
30 "list_add corruption. next->prev should be prev (%px), but was %px. (next=%px).\n", in __list_add_valid_or_report()
31 prev, next->prev, next) || in __list_add_valid_or_report()
32 CHECK_DATA_CORRUPTION(prev->next != next, prev, in __list_add_valid_or_report()
33 "list_add corruption. prev->next should be next (%px), but was %px. (prev=%px).\n", in __list_add_valid_or_report()
34 next, prev->next, prev) || in __list_add_valid_or_report()
35 CHECK_DATA_CORRUPTION(new == prev || new == next, NULL, in __list_add_valid_or_report()
[all …]
|
| /linux-6.14.4/scripts/gendwarfksyms/examples/ |
| D | kabi_ex.h | 43 * STABLE-NEXT: }
59 * STABLE-NEXT: enumerator A = 0 ,
60 * STABLE-NEXT: enumerator D = 123456789
61 * STABLE-NEXT: } byte_size(4)
75 * STABLE-NEXT: member base_type int byte_size(4) encoding(5) a data_member_location(0) ,
76 …* STABLE-NEXT: member base_type [[ULONG:long unsigned int|unsigned long]] byte_size(8) encoding(…
77 * STABLE-NEXT: member base_type [[ULONG]] byte_size(8) encoding(7) data_member_location(16)
78 * STABLE-NEXT: } byte_size(24)
89 * STABLE-NEXT: member base_type int byte_size(4) encoding(5) a data_member_location(0) ,
90 * STABLE-NEXT: member base_type [[ULONG]] byte_size(8) encoding(7) data_member_location(8) ,
[all …]
|
| /linux-6.14.4/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)
13 for (; pos; prv = pos, pos = (pos)->next)
25 struct io_wq_work_node *next = pos->next; in wq_list_add_after() local
27 pos->next = node; in wq_list_add_after()
28 node->next = next; in wq_list_add_after()
29 if (!next) in wq_list_add_after()
36 node->next = NULL; in wq_list_add_tail()
41 list->last->next = node; in wq_list_add_tail()
49 node->next = list->first; in wq_list_add_head()
[all …]
|
| /linux-6.14.4/kernel/locking/ |
| D | osq_lock.c | 16 struct optimistic_spin_node *next, *prev; member
45 * Get a stable @node->next pointer, either for unlock() or unqueue() purposes.
72 * We must xchg() the @node->next value, because if we were to in osq_wait_next()
74 * @node->next might complete Step-A and think its @prev is in osq_wait_next()
79 * wait for a new @node->next from its Step-C. in osq_wait_next()
81 if (node->next) { in osq_wait_next()
82 struct optimistic_spin_node *next; in osq_wait_next() local
84 next = xchg(&node->next, NULL); in osq_wait_next()
85 if (next) in osq_wait_next()
86 return next; in osq_wait_next()
[all …]
|
| /linux-6.14.4/arch/riscv/mm/ |
| D | kasan_init.c | 54 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-6.14.4/tools/include/linux/ |
| D | list.h | 15 * 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-6.14.4/include/linux/ |
| D | list.h | 18 * sometimes we already know the next/prev entries and we can
37 WRITE_ONCE(list->next, list); in INIT_LIST_HEAD()
55 struct list_head *next);
67 struct list_head *next) in __list_add_valid() argument
73 * With the hardening version, elide checking if next and prev in __list_add_valid()
83 if (likely(next->prev == prev && prev->next == next && new != prev && new != next)) in __list_add_valid()
88 ret &= __list_add_valid_or_report(new, prev, next); in __list_add_valid()
112 struct list_head *next = entry->next; in __list_del_entry_valid() local
115 * With the hardening version, elide checking if next and prev in __list_del_entry_valid()
119 if (likely(prev->next == entry && next->prev == entry)) in __list_del_entry_valid()
[all …]
|
| D | list_bl.h | 39 struct hlist_bl_node *next, **pprev; member
46 h->next = NULL; in INIT_HLIST_BL_NODE()
82 n->next = first; in hlist_bl_add_head()
84 first->pprev = &n->next; in hlist_bl_add_head()
90 struct hlist_bl_node *next) in hlist_bl_add_before() argument
92 struct hlist_bl_node **pprev = next->pprev; in hlist_bl_add_before()
95 n->next = next; in hlist_bl_add_before()
96 next->pprev = &n->next; in hlist_bl_add_before()
107 n->next = prev->next; in hlist_bl_add_behind()
108 n->pprev = &prev->next; in hlist_bl_add_behind()
[all …]
|
| /linux-6.14.4/drivers/net/wireguard/ |
| D | queueing.c | 50 #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-6.14.4/tools/usb/usbip/libsrc/ |
| D | list.h | 14 * 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-6.14.4/drivers/scsi/sym53c8xx_2/ |
| D | sym_malloc.c | 64 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-6.14.4/drivers/net/ethernet/microchip/sparx5/ |
| D | sparx5_sdlb.c | 116 u32 itr, next; in sparx5_sdlb_group_get_last() local
121 next = sparx5_sdlb_group_get_next(sparx5, group, itr); in sparx5_sdlb_group_get_last()
122 if (itr == next) in sparx5_sdlb_group_get_last()
125 itr = next; in sparx5_sdlb_group_get_last()
139 u32 idx, u32 *prev, u32 *next, in sparx5_sdlb_group_get_adjacent() argument
146 *next = *first; in sparx5_sdlb_group_get_adjacent()
150 *next = sparx5_sdlb_group_get_next(sparx5, group, itr); in sparx5_sdlb_group_get_adjacent()
155 if (itr == *next) in sparx5_sdlb_group_get_adjacent()
159 itr = *next; in sparx5_sdlb_group_get_adjacent()
165 u32 itr, next; in sparx5_sdlb_group_get_count() local
[all …]
|
| /linux-6.14.4/Documentation/networking/ |
| D | nexthop-group-resilient.rst | 4 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-6.14.4/drivers/pci/hotplug/ |
| D | cpqphp_ctrl.c | 121 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-6.14.4/arch/mips/include/asm/ |
| D | switch_to.h | 26 * @next: The task to begin executing.
27 * @next_ti: task_thread_info(next).
30 * the context of next. Returns prev.
33 struct task_struct *next, struct thread_info *next_ti);
62 next->thread.emulated_fp = 0; \
88 # define __sanitize_fcr31(next) \ argument
90 unsigned long fcr31 = mask_fcr31_x(next->thread.fpu.fcr31); \
94 pc = (void __user *)task_pt_regs(next)->cp0_epc; \
95 next->thread.fpu.fcr31 &= ~fcr31; \
96 force_fcr31_sig(fcr31, pc, next); \
[all …]
|
| /linux-6.14.4/drivers/memory/tegra/ |
| D | tegra210-emc-cc-r21021.c | 78 ({ 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-6.14.4/mm/kasan/ |
| D | init.c | 113 unsigned long next; in zero_pmd_populate() local
116 next = pmd_addr_end(addr, end); in zero_pmd_populate()
138 zero_pte_populate(pmd, addr, next); in zero_pmd_populate()
139 } while (pmd++, addr = next, addr != end); in zero_pmd_populate()
148 unsigned long next; in zero_pud_populate() local
151 next = pud_addr_end(addr, end); in zero_pud_populate()
176 zero_pmd_populate(pud, addr, next); in zero_pud_populate()
177 } while (pud++, addr = next, addr != end); in zero_pud_populate()
186 unsigned long next; in zero_p4d_populate() local
189 next = p4d_addr_end(addr, end); in zero_p4d_populate()
[all …]
|
| /linux-6.14.4/net/ax25/ |
| D | ax25_iface.c | 35 struct listen_struct *next; member
48 ap->next = protocol_list; in ax25_register_pid()
65 protocol_list = protocol->next; in ax25_protocol_release()
69 while (protocol != NULL && protocol->next != NULL) { in ax25_protocol_release()
70 if (protocol->next->pid == pid) { in ax25_protocol_release()
71 protocol->next = protocol->next->next; in ax25_protocol_release()
75 protocol = protocol->next; in ax25_protocol_release()
115 listen->next = listen_list; in ax25_listen_register()
136 listen_list = listen->next; in ax25_listen_release()
142 while (listen != NULL && listen->next != NULL) { in ax25_listen_release()
[all …]
|
| /linux-6.14.4/drivers/md/dm-vdo/ |
| D | funnel-queue.c | 25 queue->stub.next = NULL; in vdo_make_funnel_queue()
41 * Barrier requirements: We need a read barrier between reading a "next" field pointer in get_oldest()
46 struct funnel_queue_entry *next = READ_ONCE(oldest->next); in get_oldest() local
53 if (next == NULL) in get_oldest()
59 oldest = next; in get_oldest()
61 next = READ_ONCE(oldest->next); in get_oldest()
68 if (next == NULL) { in get_oldest()
74 * assigned previous->next. The queue is really still empty. in get_oldest()
86 next = READ_ONCE(oldest->next); in get_oldest()
87 if (next == NULL) { in get_oldest()
[all …]
|
| /linux-6.14.4/drivers/usb/host/ |
| D | ohci-dbg.c | 23 #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 …]
|
| D | ehci-dbg.c | 108 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-6.14.4/drivers/gpu/drm/nouveau/nvkm/subdev/fb/ |
| D | ramgk104.c | 210 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-6.14.4/tools/testing/selftests/bpf/progs/ |
| D | test_core_read_macros.c | 13 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-6.14.4/arch/x86/mm/ |
| D | ident_map.c | 97 unsigned long next; in ident_pud_init() local
99 for (; addr < end; addr = next) { in ident_pud_init()
104 next = (addr & PUD_MASK) + PUD_SIZE; in ident_pud_init()
105 if (next > end) in ident_pud_init()
106 next = end; in ident_pud_init()
119 use_gbpage &= ((next & ~PUD_MASK) == 0); in ident_pud_init()
134 ident_pmd_init(info, pmd, addr, next); in ident_pud_init()
140 ident_pmd_init(info, pmd, addr, next); in ident_pud_init()
150 unsigned long next; in ident_p4d_init() local
153 for (; addr < end; addr = next) { in ident_p4d_init()
[all …]
|
| /linux-6.14.4/scripts/include/ |
| D | list.h | 34 * 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 …]
|