/linux/tools/include/linux/ |
H A D | list.h | 43 new->next = next; in __list_add() 90 WRITE_ONCE(prev->next, next); in __list_del() 126 new->next = old->next; in list_replace() 207 struct list_head *next = head->next; in list_empty_careful() local 238 list->next = head->next; in __list_cut_position() 284 last->next = next; in __list_splice() 665 n->next = next; in hlist_add_before() 666 next->pprev = &n->next; in hlist_add_before() 673 n->next = prev->next; in hlist_add_behind() 678 n->next->pprev = &n->next; in hlist_add_behind() [all …]
|
/linux/include/linux/ |
H A D | list.h | 83 if (likely(next->prev == prev && prev->next == next && new != prev && new != next)) in __list_add_valid() 112 struct list_head *next = entry->next; in __list_del_entry_valid() local 154 new->next = next; in __list_add() 196 WRITE_ONCE(prev->next, next); in __list_del() 244 new->next = old->next; in list_replace() 327 first->prev->next = last->next; in list_bulk_move_tail() 458 list->next = head->next; in __list_cut_position() 515 list->next = head->next; in list_cut_before() 533 last->next = next; in __list_splice() 1048 WRITE_ONCE(n->next, next); in hlist_add_before() [all …]
|
H A D | rculist.h | 82 new->next = next; in __list_add_rcu() 200 new->next = old->next; in list_replace_rcu() 261 last->next = next; in __list_splice_init_rcu() 527 struct hlist_node *next = old->next; in hlist_replace_rcu() local 529 new->next = next; in hlist_replace_rcu() 533 WRITE_ONCE(new->next->pprev, &new->next); in hlist_replace_rcu() 625 n->next = last->next; in hlist_add_tail_rcu() 655 n->next = next; in hlist_add_before_rcu() 657 WRITE_ONCE(next->pprev, &n->next); in hlist_add_before_rcu() 681 n->next = prev->next; in hlist_add_behind_rcu() [all …]
|
H A D | list_bl.h | 46 h->next = NULL; in INIT_HLIST_BL_NODE() 82 n->next = first; in hlist_bl_add_head() 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() 109 prev->next = n; in hlist_bl_add_behind() 111 if (n->next) in hlist_bl_add_behind() 112 n->next->pprev = &n->next; in hlist_bl_add_behind() 117 struct hlist_bl_node *next = n->next; in __hlist_bl_del() local 127 if (next) in __hlist_bl_del() [all …]
|
/linux/lib/ |
H A 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() 31 prev, next->prev, next) || in __list_add_valid_or_report() 32 CHECK_DATA_CORRUPTION(prev->next != next, in __list_add_valid_or_report() 34 next, prev->next, prev) || in __list_add_valid_or_report() 37 new, prev, next)) in __list_add_valid_or_report() 47 struct list_head *prev, *next; in __list_del_entry_valid_or_report() local 50 next = entry->next; in __list_del_entry_valid_or_report() 52 if (CHECK_DATA_CORRUPTION(next == NULL, in __list_del_entry_valid_or_report() 64 entry, prev->next, prev) || in __list_del_entry_valid_or_report() [all …]
|
H A D | list_sort.c | 25 tail = &a->next; in merge() 26 a = a->next; in merge() 33 tail = &b->next; in merge() 34 b = b->next; in merge() 61 tail->next = a; in merge_final() 64 a = a->next; in merge_final() 68 tail->next = b; in merge_final() 71 b = b->next; in merge_final() 80 tail->next = b; in merge_final() 93 b = b->next; in merge_final() [all …]
|
H A D | cpumask.c | 24 unsigned int next; in cpumask_next_wrap() local 27 next = cpumask_next(n, mask); in cpumask_next_wrap() 29 if (wrap && n < start && next >= start) { in cpumask_next_wrap() 32 } else if (next >= nr_cpumask_bits) { in cpumask_next_wrap() 38 return next; in cpumask_next_wrap() 172 unsigned int next, prev; in cpumask_any_and_distribute() local 179 if (next < nr_cpu_ids) in cpumask_any_and_distribute() 182 return next; in cpumask_any_and_distribute() 194 unsigned int next, prev; in cpumask_any_distribute() local 199 if (next < nr_cpu_ids) in cpumask_any_distribute() [all …]
|
/linux/io_uring/ |
H A D | slist.h | 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() 50 if (!node->next) in wq_list_add_head() 63 prev->next = last->next; in wq_list_cut() 67 last->next = NULL; in wq_list_cut() 73 list->last->next = to->next; in __wq_list_splice() 91 node->next = stack->next; in wq_stack_add_head() [all …]
|
/linux/kernel/locking/ |
H A D | osq_lock.c | 81 if (node->next) { in osq_wait_next() 84 next = xchg(&node->next, NULL); in osq_wait_next() 85 if (next) in osq_wait_next() 86 return next; in osq_wait_next() 101 node->next = NULL; in osq_lock() 129 WRITE_ONCE(prev->next, node); in osq_lock() 193 if (!next) in osq_lock() 205 WRITE_ONCE(prev->next, next); in osq_lock() 226 next = xchg(&node->next, NULL); in osq_unlock() 227 if (next) { in osq_unlock() [all …]
|
/linux/drivers/memory/tegra/ |
H A D | tegra210-emc-cc-r21021.c | 120 struct tegra210_emc_timing *next = emc->next; in update_clock_tree_delay() local 174 next->tree_margin) in update_clock_tree_delay() 201 next->tree_margin) in update_clock_tree_delay() 229 next->tree_margin) in update_clock_tree_delay() 256 next->tree_margin) in update_clock_tree_delay() 311 next->tree_margin) in update_clock_tree_delay() 338 next->tree_margin) in update_clock_tree_delay() 607 struct tegra210_emc_timing *fake, *last = emc->last, *next = emc->next; in tegra210_emc_r21021_set_clock() local 682 next->rate); in tegra210_emc_r21021_set_clock() 743 next); in tegra210_emc_r21021_set_clock() [all …]
|
/linux/tools/usb/usbip/libsrc/ |
H A D | list.h | 20 struct list_head *next, *prev; member 30 list->next = list; in INIT_LIST_HEAD() 44 next->prev = new; in __list_add() 45 new->next = next; in __list_add() 47 prev->next = new; in __list_add() 72 next->prev = prev; in __list_del() 73 prev->next = next; in __list_del() 94 entry->next = LIST_POISON1; in list_del() 112 for (pos = (head)->next; pos != (head); pos = pos->next) 121 for (pos = (head)->next, n = pos->next; pos != (head); \ [all …]
|
/linux/drivers/scsi/sym53c8xx_2/ |
H A D | sym_malloc.c | 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() 81 h[j].next->next = NULL; in ___sym_malloc() 120 ((m_link_p) a)->next = h[i].next; in ___sym_mfree() 127 while (q->next && q->next != (m_link_p) b) { in ___sym_mfree() 128 q = q->next; in ___sym_mfree() 131 ((m_link_p) a)->next = h[i].next; in ___sym_mfree() 135 q->next = q->next->next; in ___sym_mfree() [all …]
|
/linux/arch/riscv/mm/ |
H A D | kasan_init.c | 54 unsigned long next; in kasan_populate_pmd() local 85 unsigned long next; in kasan_populate_pud() local 116 unsigned long next; in kasan_populate_p4d() local 146 unsigned long next; in kasan_populate_pgd() local 169 unsigned long next; in kasan_early_clear_pud() local 194 unsigned long next; in kasan_early_clear_p4d() local 219 unsigned long next; in kasan_early_clear_pgd() local 240 unsigned long next; in kasan_early_populate_pud() local 269 unsigned long next; in kasan_early_populate_p4d() local 306 unsigned long next; in kasan_early_populate_pgd() local [all …]
|
/linux/arch/mips/include/asm/ |
H A D | switch_to.h | 62 next->thread.emulated_fp = 0; \ 88 # define __sanitize_fcr31(next) \ argument 95 next->thread.fpu.fcr31 &= ~fcr31; \ 96 force_fcr31_sig(fcr31, pc, next); \ 100 # define __sanitize_fcr31(next) argument 113 if (tsk_used_math(next)) \ 114 __sanitize_fcr31(next); \ 117 __restore_dsp(next); \ 130 cop2_restore(next); \ 138 __restore_watch(next); \ [all …]
|
/linux/drivers/acpi/acpica/ |
H A D | pstree.c | 74 arg = arg->common.next; in acpi_ps_get_arg() 147 arg = arg->common.next; in acpi_ps_append_arg() 185 if (next) { in acpi_ps_get_depth_next() 187 return (next); in acpi_ps_get_depth_next() 192 next = op->common.next; in acpi_ps_get_depth_next() 193 if (next) { in acpi_ps_get_depth_next() 195 return (next); in acpi_ps_get_depth_next() 207 arg = arg->common.next; in acpi_ps_get_depth_next() 217 if (parent->common.next) { in acpi_ps_get_depth_next() 229 ASL_CV_LABEL_FILENODE(next); in acpi_ps_get_depth_next() [all …]
|
/linux/drivers/pci/hotplug/ |
H A D | cpqphp_ctrl.c | 329 current_res->next = current_res->next->next; in sort_by_size() 846 while (node1->next && node1->next->next) { in cpqhp_resource_sort_and_combine() 850 node1->next = node1->next->next; in cpqhp_resource_sort_and_combine() 867 node1->next = node1->next->next; in cpqhp_resource_sort_and_combine() 970 next = next->next; in cpqhp_slot_create() 1001 while ((next->next != old_slot) && (next->next != NULL)) in slot_remove() 1002 next = next->next; in slot_remove() 1005 next->next = old_slot->next; in slot_remove() 1046 while ((next->next != bridge) && (next->next != NULL)) in bridge_slot_remove() 1047 next = next->next; in bridge_slot_remove() [all …]
|
/linux/arch/x86/mm/ |
H A D | ident_map.c | 24 unsigned long next; in ident_pud_init() local 26 for (; addr < end; addr = next) { in ident_pud_init() 31 if (next > end) in ident_pud_init() 32 next = end; in ident_pud_init() 64 unsigned long next; in ident_p4d_init() local 67 for (; addr < end; addr = next) { in ident_p4d_init() 72 if (next > end) in ident_p4d_init() 73 next = end; in ident_p4d_init() 102 unsigned long next; in kernel_ident_mapping_init() local 117 if (next > end) in kernel_ident_mapping_init() [all …]
|
/linux/net/ax25/ |
H A 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() 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() 143 if (ax25cmp(&listen->next->callsign, callsign) == 0 && listen->next->dev == dev) { in ax25_listen_release() 144 s = listen->next; in ax25_listen_release() 145 listen->next = listen->next->next; in ax25_listen_release() [all …]
|
/linux/drivers/gpu/drm/nouveau/nvkm/subdev/fb/ |
H A D | ramgk104.c | 210 struct nvkm_ram_data *next = ram->base.next; in r1373f4_fini() local 255 struct nvkm_ram_data *next = ram->base.next; in gk104_ram_calc_gddr5() local 326 if (next->bios.ramcfg_11_02_80) in gk104_ram_calc_gddr5() 399 if (!next->bios.ramcfg_11_07_08 && !next->bios.ramcfg_11_07_04) { in gk104_ram_calc_gddr5() 706 struct nvkm_ram_data *next = ram->base.next; in gk104_ram_calc_sddr3() local 731 if (next->bios.ramcfg_DLLoff) in gk104_ram_calc_sddr3() 1063 refclk = next->freq; in gk104_ram_calc_xits() 1090 ram->base.freq = next->freq; in gk104_ram_calc_xits() 1120 if (ram->base.next == NULL) { in gk104_ram_calc() 1236 struct nvkm_ram_data *next = ram->base.next; in gk104_ram_prog() local [all …]
|
H A D | gddr5.c | 41 xd = !ram->next->bios.ramcfg_DLLoff; in nvkm_gddr5_calc() 43 switch (ram->next->bios.ramcfg_ver) { in nvkm_gddr5_calc() 45 pd = ram->next->bios.ramcfg_11_01_80; in nvkm_gddr5_calc() 46 lf = ram->next->bios.ramcfg_11_01_40; in nvkm_gddr5_calc() 47 vh = ram->next->bios.ramcfg_11_02_10; in nvkm_gddr5_calc() 48 vr = ram->next->bios.ramcfg_11_02_04; in nvkm_gddr5_calc() 49 vo = ram->next->bios.ramcfg_11_06; in nvkm_gddr5_calc() 50 l3 = !ram->next->bios.ramcfg_11_07_02; in nvkm_gddr5_calc() 56 switch (ram->next->bios.timing_ver) { in nvkm_gddr5_calc() 63 dt = ram->next->bios.timing_20_2e_03; in nvkm_gddr5_calc() [all …]
|
/linux/mm/kasan/ |
H A D | init.c | 113 unsigned long next; in zero_pmd_populate() local 116 next = pmd_addr_end(addr, end); in zero_pmd_populate() 150 unsigned long next; in zero_pud_populate() local 192 unsigned long next; in zero_p4d_populate() local 242 unsigned long next; in kasan_populate_early_shadow() local 355 unsigned long next; in kasan_remove_pte_table() local 360 if (next > end) in kasan_remove_pte_table() 361 next = end; in kasan_remove_pte_table() 377 unsigned long next; in kasan_remove_pmd_table() local 403 unsigned long next; in kasan_remove_pud_table() local [all …]
|
/linux/tools/lib/ |
H A D | list_sort.c | 24 tail = &a->next; in merge() 25 a = a->next; in merge() 32 tail = &b->next; in merge() 33 b = b->next; in merge() 60 tail->next = a; in merge_final() 63 a = a->next; in merge_final() 67 tail->next = b; in merge_final() 70 b = b->next; in merge_final() 79 tail->next = b; in merge_final() 92 b = b->next; in merge_final() [all …]
|
/linux/drivers/net/ethernet/microchip/sparx5/ |
H A D | sparx5_sdlb.c | 115 u32 itr, next; in sparx5_sdlb_group_get_last() local 124 itr = next; in sparx5_sdlb_group_get_last() 145 *next = *first; 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 174 itr = next; in sparx5_sdlb_group_get_count() 208 u32 itr, next; in sparx5_sdlb_group_get_by_index() local 227 itr = next; in sparx5_sdlb_group_get_by_index() 266 next = idx; in sparx5_sdlb_group_add() 290 next = prev; in sparx5_sdlb_group_del() [all …]
|
/linux/scripts/mod/ |
H A D | list.h | 39 struct list_head *next, *prev; member 56 list->next = list; in INIT_LIST_HEAD() 68 struct list_head *next) in __list_add() argument 70 next->prev = new; in __list_add() 71 new->next = next; in __list_add() 73 prev->next = new; in __list_add() 86 __list_add(new, head, head->next); in list_add() 111 next->prev = prev; in __list_del() 112 prev->next = next; in __list_del() 129 entry->next = LIST_POISON1; in list_del() [all …]
|
/linux/tools/testing/selftests/bpf/progs/ |
H A D | test_core_read_macros.c | 13 struct callback_head___shuffled *next; member 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()
|