/linux-4.1.27/include/linux/ |
H A D | list_bl.h | 38 struct hlist_bl_node *next, **pprev; member in struct:hlist_bl_node 46 h->pprev = NULL; INIT_HLIST_BL_NODE() 53 return !h->pprev; hlist_bl_unhashed() 83 first->pprev = &n->next; hlist_bl_add_head() 84 n->pprev = &h->first; hlist_bl_add_head() 91 struct hlist_bl_node **pprev = n->pprev; __hlist_bl_del() local 95 /* pprev may be `first`, so be careful not to lose the lock bit */ __hlist_bl_del() 96 *pprev = (struct hlist_bl_node *) __hlist_bl_del() 98 ((unsigned long)*pprev & LIST_BL_LOCKMASK)); __hlist_bl_del() 100 next->pprev = pprev; __hlist_bl_del() 107 n->pprev = LIST_POISON2; hlist_bl_del()
|
H A D | list_nulls.h | 25 struct hlist_nulls_node *next, **pprev; member in struct:hlist_nulls_node 55 return !h->pprev; hlist_nulls_unhashed() 69 n->pprev = &h->first; hlist_nulls_add_head() 72 first->pprev = &n->next; hlist_nulls_add_head() 78 struct hlist_nulls_node **pprev = n->pprev; __hlist_nulls_del() local 79 *pprev = next; __hlist_nulls_del() 81 next->pprev = pprev; __hlist_nulls_del() 87 n->pprev = LIST_POISON2; hlist_nulls_del()
|
H A D | rculist_bl.h | 36 * zero the pprev pointer so list_unhashed() will return true after 50 n->pprev = NULL; hlist_bl_del_init_rcu() 76 n->pprev = LIST_POISON2; hlist_bl_del_rcu() 108 first->pprev = &n->next; hlist_bl_add_head_rcu() 109 n->pprev = &h->first; hlist_bl_add_head_rcu()
|
H A D | rculist_nulls.h | 22 * zero the pprev pointer so list_unhashed() will return true after 36 n->pprev = NULL; hlist_nulls_del_init_rcu() 68 n->pprev = LIST_POISON2; hlist_nulls_del_rcu() 96 n->pprev = &h->first; hlist_nulls_add_head_rcu() 99 first->pprev = &n->next; hlist_nulls_add_head_rcu()
|
H A D | rculist.h | 145 * zero the pprev pointer so list_unhashed() will return true after 159 n->pprev = NULL; hlist_del_init_rcu() 346 n->pprev = LIST_POISON2; hlist_del_rcu() 362 new->pprev = old->pprev; hlist_replace_rcu() 363 rcu_assign_pointer(*(struct hlist_node __rcu **)new->pprev, new); hlist_replace_rcu() 365 new->next->pprev = &new->next; hlist_replace_rcu() 366 old->pprev = LIST_POISON2; hlist_replace_rcu() 374 #define hlist_pprev_rcu(node) (*((struct hlist_node __rcu **)((node)->pprev))) 401 n->pprev = &h->first; hlist_add_head_rcu() 404 first->pprev = &n->next; hlist_add_head_rcu() 428 n->pprev = next->pprev; hlist_add_before_rcu() 431 next->pprev = &n->next; hlist_add_before_rcu() 456 n->pprev = &prev->next; hlist_add_behind_rcu() 459 n->next->pprev = &n->next; hlist_add_behind_rcu()
|
H A D | list.h | 601 h->pprev = NULL; INIT_HLIST_NODE() 606 return !h->pprev; hlist_unhashed() 617 struct hlist_node **pprev = n->pprev; __hlist_del() local 618 *pprev = next; __hlist_del() 620 next->pprev = pprev; __hlist_del() 627 n->pprev = LIST_POISON2; hlist_del() 643 first->pprev = &n->next; hlist_add_head() 645 n->pprev = &h->first; hlist_add_head() 652 n->pprev = next->pprev; hlist_add_before() 654 next->pprev = &n->next; hlist_add_before() 655 *(n->pprev) = n; hlist_add_before() 663 n->pprev = &prev->next; hlist_add_behind() 666 n->next->pprev = &n->next; hlist_add_behind() 672 n->pprev = &n->next; hlist_add_fake() 676 * Move a list from one list head to another. Fixup the pprev 684 new->first->pprev = &new->first; hlist_move_list()
|
H A D | init_task.h | 84 .pid_chain = { .next = NULL, .pprev = NULL }, \ 92 .pprev = NULL, \
|
H A D | types.h | 194 struct hlist_node *next, **pprev; member in struct:hlist_node
|
H A D | rhashtable.h | 745 struct rhash_head __rcu **pprev; __rhashtable_remove_fast() local 756 pprev = &tbl->buckets[hash]; rht_for_each() 759 pprev = &he->next; rht_for_each() 763 rcu_assign_pointer(*pprev, obj->next); rht_for_each()
|
H A D | mm.h | 1289 struct vm_area_struct **pprev, unsigned long start, 1983 struct vm_area_struct **pprev);
|
/linux-4.1.27/net/ipv4/ |
H A D | tunnel4.c | 28 struct xfrm_tunnel __rcu **pprev; xfrm4_tunnel_register() local 36 for (pprev = fam_handlers(family); xfrm4_tunnel_register() 37 (t = rcu_dereference_protected(*pprev, xfrm4_tunnel_register() 39 pprev = &t->next) { xfrm4_tunnel_register() 46 handler->next = *pprev; xfrm4_tunnel_register() 47 rcu_assign_pointer(*pprev, handler); xfrm4_tunnel_register() 60 struct xfrm_tunnel __rcu **pprev; xfrm4_tunnel_deregister() local 66 for (pprev = fam_handlers(family); xfrm4_tunnel_deregister() 67 (t = rcu_dereference_protected(*pprev, xfrm4_tunnel_deregister() 69 pprev = &t->next) { xfrm4_tunnel_deregister() 71 *pprev = handler->next; xfrm4_tunnel_deregister()
|
H A D | xfrm4_protocol.c | 214 struct xfrm4_protocol __rcu **pprev; xfrm4_protocol_register() local 229 for (pprev = proto_handlers(protocol); xfrm4_protocol_register() 230 (t = rcu_dereference_protected(*pprev, xfrm4_protocol_register() 232 pprev = &t->next) { xfrm4_protocol_register() 239 handler->next = *pprev; xfrm4_protocol_register() 240 rcu_assign_pointer(*pprev, handler); xfrm4_protocol_register() 261 struct xfrm4_protocol __rcu **pprev; xfrm4_protocol_deregister() local 270 for (pprev = proto_handlers(protocol); xfrm4_protocol_deregister() 271 (t = rcu_dereference_protected(*pprev, xfrm4_protocol_deregister() 273 pprev = &t->next) { xfrm4_protocol_deregister() 275 *pprev = handler->next; xfrm4_protocol_deregister()
|
H A D | fib_trie.c | 1442 struct hlist_node **pprev = old->fa_list.pprev; fib_remove_alias() local 1443 struct fib_alias *fa = hlist_entry(pprev, typeof(*fa), fa_list.next); fib_remove_alias() 1459 if (*pprev) fib_remove_alias()
|
/linux-4.1.27/net/ipv6/ |
H A D | tunnel6.c | 40 struct xfrm6_tunnel __rcu **pprev; xfrm6_tunnel_register() local 47 for (pprev = (family == AF_INET6) ? &tunnel6_handlers : &tunnel46_handlers; xfrm6_tunnel_register() 48 (t = rcu_dereference_protected(*pprev, xfrm6_tunnel_register() 50 pprev = &t->next) { xfrm6_tunnel_register() 57 handler->next = *pprev; xfrm6_tunnel_register() 58 rcu_assign_pointer(*pprev, handler); xfrm6_tunnel_register() 71 struct xfrm6_tunnel __rcu **pprev; xfrm6_tunnel_deregister() local 77 for (pprev = (family == AF_INET6) ? &tunnel6_handlers : &tunnel46_handlers; xfrm6_tunnel_deregister() 78 (t = rcu_dereference_protected(*pprev, xfrm6_tunnel_deregister() 80 pprev = &t->next) { xfrm6_tunnel_deregister() 82 *pprev = handler->next; xfrm6_tunnel_deregister()
|
H A D | xfrm6_protocol.c | 188 struct xfrm6_protocol __rcu **pprev; xfrm6_protocol_register() local 203 for (pprev = proto_handlers(protocol); xfrm6_protocol_register() 204 (t = rcu_dereference_protected(*pprev, xfrm6_protocol_register() 206 pprev = &t->next) { xfrm6_protocol_register() 213 handler->next = *pprev; xfrm6_protocol_register() 214 rcu_assign_pointer(*pprev, handler); xfrm6_protocol_register() 235 struct xfrm6_protocol __rcu **pprev; xfrm6_protocol_deregister() local 244 for (pprev = proto_handlers(protocol); xfrm6_protocol_deregister() 245 (t = rcu_dereference_protected(*pprev, xfrm6_protocol_deregister() 247 pprev = &t->next) { xfrm6_protocol_deregister() 249 *pprev = handler->next; xfrm6_protocol_deregister()
|
H A D | route.c | 1405 struct dst_entry *dst, **pprev; icmp6_dst_gc() local 1409 pprev = &icmp6_dst_gc_list; icmp6_dst_gc() 1411 while ((dst = *pprev) != NULL) { icmp6_dst_gc() 1413 *pprev = dst->next; icmp6_dst_gc() 1416 pprev = &dst->next; icmp6_dst_gc() 1429 struct dst_entry *dst, **pprev; icmp6_clean_all() local 1432 pprev = &icmp6_dst_gc_list; icmp6_clean_all() 1433 while ((dst = *pprev) != NULL) { icmp6_clean_all() 1436 *pprev = dst->next; icmp6_clean_all() 1439 pprev = &dst->next; icmp6_clean_all()
|
/linux-4.1.27/kernel/ |
H A D | task_work.c | 55 struct callback_head **pprev = &task->task_works; task_work_cancel() local 59 * If cmpxchg() fails we continue without updating pprev. task_work_cancel() 62 * we raced with task_work_run(), *pprev == NULL/exited. task_work_cancel() 65 while ((work = ACCESS_ONCE(*pprev))) { task_work_cancel() 68 pprev = &work->next; task_work_cancel() 69 else if (cmpxchg(pprev, work, work->next) == work) task_work_cancel()
|
H A D | fork.c | 392 struct vm_area_struct *mpnt, *tmp, *prev, **pprev; dup_mmap() local 416 pprev = &mm->mmap; dup_mmap() 484 *pprev = tmp; dup_mmap() 485 pprev = &tmp->vm_next; dup_mmap()
|
H A D | workqueue.c | 1599 (worker->hentry.next || worker->hentry.pprev))) worker_enter_idle()
|
/linux-4.1.27/arch/mn10300/mm/ |
H A D | pgtable.c | 120 struct page *next, **pprev, *page = virt_to_page(pgd); pgd_list_del() local 122 pprev = (struct page **) page_private(page); pgd_list_del() 123 *pprev = next; pgd_list_del() 125 set_page_private(next, (unsigned long) pprev); pgd_list_del()
|
/linux-4.1.27/arch/frv/mm/ |
H A D | pgalloc.c | 101 struct page *next, **pprev, *page = virt_to_page(pgd); pgd_list_del() local 103 pprev = (struct page **) page_private(page); pgd_list_del() 104 *pprev = next; pgd_list_del() 106 set_page_private(next, (unsigned long) pprev); pgd_list_del()
|
/linux-4.1.27/tools/include/linux/ |
H A D | types.h | 72 struct hlist_node *next, **pprev; member in struct:hlist_node
|
/linux-4.1.27/mm/ |
H A D | mprotect.c | 256 mprotect_fixup(struct vm_area_struct *vma, struct vm_area_struct **pprev, mprotect_fixup() argument 268 *pprev = vma; mprotect_fixup() 292 *pprev = vma_merge(mm, *pprev, start, end, newflags, mprotect_fixup() 294 if (*pprev) { mprotect_fixup() 295 vma = *pprev; mprotect_fixup() 299 *pprev = vma; mprotect_fixup()
|
H A D | vmalloc.c | 2284 * @pprev: out arg for the previous vmap_area 2290 * NULL, *pnext->va_end > @end and *pprev->va_end <= @end. 2294 struct vmap_area **pprev) pvm_find_next_prev() 2314 *pprev = node_to_va(rb_prev(&(*pnext)->rb_node)); pvm_find_next_prev() 2316 *pprev = va; pvm_find_next_prev() 2317 *pnext = node_to_va(rb_next(&(*pprev)->rb_node)); pvm_find_next_prev() 2325 * @pprev: in/out arg for the previous vmap_area 2330 * Find the highest aligned address between *@pnext and *@pprev below 2331 * VMALLOC_END. *@pnext and *@pprev are adjusted so that the aligned 2339 struct vmap_area **pprev, pvm_determine_end() 2350 while (*pprev && (*pprev)->va_end > addr) { pvm_determine_end() 2351 *pnext = *pprev; pvm_determine_end() 2352 *pprev = node_to_va(rb_prev(&(*pnext)->rb_node)); pvm_determine_end() 2292 pvm_find_next_prev(unsigned long end, struct vmap_area **pnext, struct vmap_area **pprev) pvm_find_next_prev() argument 2338 pvm_determine_end(struct vmap_area **pnext, struct vmap_area **pprev, unsigned long align) pvm_determine_end() argument
|
H A D | mmap.c | 554 unsigned long end, struct vm_area_struct **pprev, find_vma_links() 579 *pprev = NULL; find_vma_links() 581 *pprev = rb_entry(rb_prev, struct vm_area_struct, vm_rb); find_vma_links() 2066 * Same as find_vma, but also return a pointer to the previous VMA in *pprev. 2070 struct vm_area_struct **pprev) find_vma_prev() 2076 *pprev = vma->vm_prev; find_vma_prev() 2079 *pprev = NULL; find_vma_prev() 2081 *pprev = rb_entry(rb_node, struct vm_area_struct, vm_rb); find_vma_prev() 553 find_vma_links(struct mm_struct *mm, unsigned long addr, unsigned long end, struct vm_area_struct **pprev, struct rb_node ***rb_link, struct rb_node **rb_parent) find_vma_links() argument 2069 find_vma_prev(struct mm_struct *mm, unsigned long addr, struct vm_area_struct **pprev) find_vma_prev() argument
|
/linux-4.1.27/arch/avr32/kernel/ |
H A D | setup.c | 110 struct resource *new, *next, **pprev; add_physical_memory() local 112 for (pprev = &system_ram, next = system_ram; next; add_physical_memory() 113 pprev = &next->sibling, next = next->sibling) { add_physical_memory() 139 *pprev = new; add_physical_memory() 146 struct resource *new, *next, **pprev; add_reserved_region() local 154 for (pprev = &reserved, next = reserved; next; add_reserved_region() 155 pprev = &next->sibling, next = next->sibling) { add_reserved_region() 169 *pprev = new; add_reserved_region()
|
/linux-4.1.27/lib/ |
H A D | rhashtable.c | 163 struct rhash_head __rcu **pprev = &old_tbl->buckets[old_hash]; rhashtable_rehash_one() local 176 pprev = &entry->next; rht_for_each() 198 rcu_assign_pointer(*pprev, next);
|
/linux-4.1.27/drivers/staging/lustre/lustre/include/ |
H A D | lustre_capa.h | 244 LASSERT(!hnode->next && !hnode->pprev); capa_put()
|
/linux-4.1.27/net/netfilter/ |
H A D | nf_conntrack_core.c | 596 hash = *(unsigned long *)&ct->tuplehash[IP_CT_DIR_REPLY].hnnode.pprev; __nf_conntrack_confirm() 827 ct->tuplehash[IP_CT_DIR_ORIGINAL].hnnode.pprev = NULL; __nf_conntrack_alloc() 830 *(unsigned long *)(&ct->tuplehash[IP_CT_DIR_REPLY].hnnode.pprev) = hash; __nf_conntrack_alloc()
|
/linux-4.1.27/drivers/staging/lustre/lustre/libcfs/ |
H A D | hash.c | 367 dh->dh_tail = (hnd->pprev == &dh->dh_head.first) ? NULL : cfs_hash_dh_hnode_del() 368 container_of(hnd->pprev, struct hlist_node, next); cfs_hash_dh_hnode_del() 422 dh->dd_tail = (hnd->pprev == &dh->dd_head.first) ? NULL : cfs_hash_dd_hnode_del() 423 container_of(hnd->pprev, struct hlist_node, next); cfs_hash_dd_hnode_del()
|
/linux-4.1.27/include/net/ |
H A D | sock.h | 538 node->pprev = NULL; sk_node_init() 543 node->pprev = NULL; sk_nulls_node_init() 932 memset(&sk->sk_node.pprev, 0, sk_prot_clear_nulls() 933 size - offsetof(struct sock, sk_node.pprev)); sk_prot_clear_nulls()
|
/linux-4.1.27/drivers/staging/lustre/lustre/obdclass/ |
H A D | lu_object.c | 89 && top->loh_hash.pprev == NULL); lu_object_put()
|
/linux-4.1.27/fs/ |
H A D | dcache.c | 484 dentry->d_hash.pprev = NULL; __d_drop()
|