| /kernel/linux/linux-6.6/lib/ |
| D | list_debug.c | 23 struct list_head *next) in __list_add_valid_or_report() argument
27 CHECK_DATA_CORRUPTION(next == 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, 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, 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, in __list_add_valid_or_report()
[all …]
|
| /kernel/linux/linux-5.10/lib/ |
| D | list_debug.c | 21 struct list_head *next) in __list_add_valid() argument
25 CHECK_DATA_CORRUPTION(next == NULL, in __list_add_valid()
26 "list_add corruption. next is NULL.\n") || in __list_add_valid()
27 CHECK_DATA_CORRUPTION(next->prev != prev, in __list_add_valid()
28 "list_add corruption. next->prev should be prev (%px), but was %px. (next=%px).\n", in __list_add_valid()
29 prev, next->prev, next) || in __list_add_valid()
30 CHECK_DATA_CORRUPTION(prev->next != next, in __list_add_valid()
31 "list_add corruption. prev->next should be next (%px), but was %px. (prev=%px).\n", in __list_add_valid()
32 next, prev->next, prev) || in __list_add_valid()
33 CHECK_DATA_CORRUPTION(new == prev || new == next, in __list_add_valid()
[all …]
|
| /kernel/linux/linux-5.10/drivers/block/zram/zram_group/ |
| D | zlist.c | 38 struct zlist_node *next) in zlist_before_add_check() argument
40 assert(idx2node(prev->next, tab) == next); in zlist_before_add_check()
41 assert(idx2node(next->prev, tab) == prev); in zlist_before_add_check()
43 assert(idx2node(node->next, tab) == node); in zlist_before_add_check()
48 struct zlist_node *next) in zlist_after_add_check() argument
50 assert(idx2node(prev->next, tab) == node); in zlist_after_add_check()
51 assert(idx2node(next->prev, tab) == node); in zlist_after_add_check()
53 assert(idx2node(node->next, tab) == next); in zlist_after_add_check()
58 struct zlist_node *next) in zlist_before_del_check() argument
60 assert(idx2node(prev->next, tab) == node); in zlist_before_del_check()
[all …]
|
| /kernel/linux/linux-6.6/drivers/block/zram/zram_group/ |
| D | zlist.c | 38 struct zlist_node *next) in zlist_before_add_check() argument
40 assert(idx2node(prev->next, tab) == next); in zlist_before_add_check()
41 assert(idx2node(next->prev, tab) == prev); in zlist_before_add_check()
43 assert(idx2node(node->next, tab) == node); in zlist_before_add_check()
48 struct zlist_node *next) in zlist_after_add_check() argument
50 assert(idx2node(prev->next, tab) == node); in zlist_after_add_check()
51 assert(idx2node(next->prev, tab) == node); in zlist_after_add_check()
53 assert(idx2node(node->next, tab) == next); in zlist_after_add_check()
58 struct zlist_node *next) in zlist_before_del_check() argument
60 assert(idx2node(prev->next, tab) == node); in zlist_before_del_check()
[all …]
|
| /kernel/linux/linux-6.6/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 …]
|
| /kernel/linux/linux-5.10/drivers/soc/mediatek/ |
| D | mtk-mmsys.c | 105 enum mtk_ddp_comp_id next, in mtk_mmsys_ddp_mout_en() argument
110 if (cur == DDP_COMPONENT_OVL0 && next == DDP_COMPONENT_COLOR0) { in mtk_mmsys_ddp_mout_en()
113 } else if (cur == DDP_COMPONENT_OVL0 && next == DDP_COMPONENT_RDMA0) { in mtk_mmsys_ddp_mout_en()
116 } else if (cur == DDP_COMPONENT_OD0 && next == DDP_COMPONENT_RDMA0) { in mtk_mmsys_ddp_mout_en()
119 } else if (cur == DDP_COMPONENT_UFOE && next == DDP_COMPONENT_DSI0) { in mtk_mmsys_ddp_mout_en()
122 } else if (cur == DDP_COMPONENT_OVL1 && next == DDP_COMPONENT_COLOR1) { in mtk_mmsys_ddp_mout_en()
125 } else if (cur == DDP_COMPONENT_GAMMA && next == DDP_COMPONENT_RDMA1) { in mtk_mmsys_ddp_mout_en()
128 } else if (cur == DDP_COMPONENT_OD1 && next == DDP_COMPONENT_RDMA1) { in mtk_mmsys_ddp_mout_en()
131 } else if (cur == DDP_COMPONENT_RDMA0 && next == DDP_COMPONENT_DPI0) { in mtk_mmsys_ddp_mout_en()
134 } else if (cur == DDP_COMPONENT_RDMA0 && next == DDP_COMPONENT_DPI1) { in mtk_mmsys_ddp_mout_en()
[all …]
|
| /kernel/linux/linux-5.10/kernel/locking/ |
| D | osq_lock.c | 38 * Get a stable @node->next pointer, either for unlock() or unqueue() purposes.
46 struct optimistic_spin_node *next = NULL; in osq_wait_next() local
69 * We must xchg() the @node->next value, because if we were to in osq_wait_next()
71 * @node->next might complete Step-A and think its @prev is in osq_wait_next()
76 * wait for a new @node->next from its Step-C. in osq_wait_next()
78 if (node->next) { in osq_wait_next()
79 next = xchg(&node->next, NULL); in osq_wait_next()
80 if (next) in osq_wait_next()
87 return next; in osq_wait_next()
93 struct optimistic_spin_node *prev, *next; in osq_lock() local
[all …]
|
| /kernel/linux/linux-6.6/kernel/locking/ |
| D | osq_lock.c | 38 * Get a stable @node->next pointer, either for unlock() or unqueue() purposes.
46 struct optimistic_spin_node *next = NULL; in osq_wait_next() local
69 * We must xchg() the @node->next value, because if we were to in osq_wait_next()
71 * @node->next might complete Step-A and think its @prev is in osq_wait_next()
76 * wait for a new @node->next from its Step-C. in osq_wait_next()
78 if (node->next) { in osq_wait_next()
79 next = xchg(&node->next, NULL); in osq_wait_next()
80 if (next) in osq_wait_next()
87 return next; in osq_wait_next()
93 struct optimistic_spin_node *prev, *next; in osq_lock() local
[all …]
|
| /kernel/linux/linux-5.10/drivers/memory/tegra/ |
| D | tegra210-emc-cc-r21021.c | 78 ({ next->ptfv_list[PTFV_DQSOSC_MOVAVG_ ## dev ## _INDEX] = \
79 next->ptfv_list[PTFV_DQSOSC_MOVAVG_ ## dev ## _INDEX] / \
80 next->ptfv_list[PTFV_DVFS_SAMPLES_INDEX]; })
86 ({ next->ptfv_list[PTFV_DQSOSC_MOVAVG_ ## dev ## _INDEX] += \
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]); \
120 struct tegra210_emc_timing *next = emc->next; in update_clock_tree_delay() local
[all …]
|
| /kernel/linux/linux-6.6/drivers/memory/tegra/ |
| D | tegra210-emc-cc-r21021.c | 78 ({ next->ptfv_list[PTFV_DQSOSC_MOVAVG_ ## dev ## _INDEX] = \
79 next->ptfv_list[PTFV_DQSOSC_MOVAVG_ ## dev ## _INDEX] / \
80 next->ptfv_list[PTFV_DVFS_SAMPLES_INDEX]; })
86 ({ next->ptfv_list[PTFV_DQSOSC_MOVAVG_ ## dev ## _INDEX] += \
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]); \
120 struct tegra210_emc_timing *next = emc->next; in update_clock_tree_delay() local
[all …]
|
| /kernel/linux/linux-5.10/arch/loongarch/boot/dts/loongson/ |
| D | loongson3.dtsi | 16 next-level-cache = <&scache0>;
24 next-level-cache = <&scache0>;
32 next-level-cache = <&scache0>;
40 next-level-cache = <&scache0>;
48 next-level-cache = <&scache1>;
56 next-level-cache = <&scache1>;
64 next-level-cache = <&scache1>;
72 next-level-cache = <&scache1>;
80 next-level-cache = <&scache2>;
88 next-level-cache = <&scache2>;
[all …]
|
| /kernel/linux/linux-5.10/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 …]
|
| /kernel/linux/linux-6.6/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 …]
|
| /kernel/linux/linux-6.6/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 …]
|
| /kernel/linux/linux-6.6/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 …]
|
| /kernel/linux/linux-5.10/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 …]
|
| /kernel/linux/linux-6.6/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 …]
|
| /kernel/linux/linux-5.10/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 …]
|
| /kernel/linux/linux-6.6/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 …]
|
| /kernel/linux/linux-5.10/include/linux/ |
| D | list.h | 16 * sometimes we already know the next/prev entries and we can
35 WRITE_ONCE(list->next, list); in INIT_LIST_HEAD()
42 struct list_head *next);
47 struct list_head *next) in __list_add_valid() argument
61 * the prev/next entries already!
65 struct list_head *next) in __list_add() argument
67 if (!__list_add_valid(new, prev, next)) in __list_add()
70 next->prev = new; in __list_add()
71 new->next = next; in __list_add()
73 WRITE_ONCE(prev->next, new); in __list_add()
[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 …]
|
| /kernel/linux/linux-6.6/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 …]
|
| /kernel/linux/linux-5.10/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 …]
|
| /kernel/linux/linux-6.6/drivers/net/ethernet/microchip/sparx5/ |
| D | sparx5_sdlb.c | 115 u32 itr, next; in sparx5_sdlb_group_get_last() local
120 next = sparx5_sdlb_group_get_next(sparx5, group, itr); in sparx5_sdlb_group_get_last()
121 if (itr == next) in sparx5_sdlb_group_get_last()
124 itr = next; in sparx5_sdlb_group_get_last()
138 u32 idx, u32 *prev, u32 *next, in sparx5_sdlb_group_get_adjacent() argument
145 *next = *first; in sparx5_sdlb_group_get_adjacent()
149 *next = sparx5_sdlb_group_get_next(sparx5, group, itr); in sparx5_sdlb_group_get_adjacent()
154 if (itr == *next) in sparx5_sdlb_group_get_adjacent()
158 itr = *next; in sparx5_sdlb_group_get_adjacent()
164 u32 itr, next; in sparx5_sdlb_group_get_count() local
[all …]
|