/linux-4.19.296/include/linux/ |
D | list.h | 28 WRITE_ONCE(list->next, list); in INIT_LIST_HEAD() 35 struct list_head *next); 40 struct list_head *next) in __list_add_valid() argument 58 struct list_head *next) in __list_add() argument 60 if (!__list_add_valid(new, prev, next)) in __list_add() 63 next->prev = new; in __list_add() 64 new->next = next; in __list_add() 66 WRITE_ONCE(prev->next, new); in __list_add() 79 __list_add(new, head, head->next); in list_add() 103 static inline void __list_del(struct list_head * prev, struct list_head * next) in __list_del() argument [all …]
|
D | rculist.h | 33 WRITE_ONCE(list->next, list); in INIT_LIST_HEAD_RCU() 41 #define list_next_rcu(list) (*((struct list_head __rcu **)(&(list)->next))) 50 struct list_head *prev, struct list_head *next) in __list_add_rcu() argument 52 if (!__list_add_valid(new, prev, next)) in __list_add_rcu() 55 new->next = next; in __list_add_rcu() 58 next->prev = new; in __list_add_rcu() 79 __list_add_rcu(new, head, head->next); in list_add_rcu() 173 new->next = old->next; in list_replace_rcu() 176 new->next->prev = new; in list_replace_rcu() 201 struct list_head *next, in __list_splice_init_rcu() argument [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() 91 struct hlist_bl_node *next = n->next; in __hlist_bl_del() local 99 ((unsigned long)next | in __hlist_bl_del() 101 if (next) in __hlist_bl_del() 102 next->pprev = pprev; in __hlist_bl_del() 108 n->next = LIST_POISON1; in hlist_bl_del() 147 pos = pos->next) [all …]
|
D | list_nulls.h | 26 struct hlist_nulls_node *next, **pprev; member 74 n->next = first; in hlist_nulls_add_head() 78 WRITE_ONCE(first->pprev, &n->next); in hlist_nulls_add_head() 83 struct hlist_nulls_node *next = n->next; in __hlist_nulls_del() local 86 WRITE_ONCE(*pprev, next); in __hlist_nulls_del() 87 if (!is_a_nulls(next)) in __hlist_nulls_del() 88 WRITE_ONCE(next->pprev, pprev); in __hlist_nulls_del() 109 pos = pos->next) 121 pos = pos->next)
|
/linux-4.19.296/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() 27 CHECK_DATA_CORRUPTION(next->prev != prev, in __list_add_valid() 29 prev, next->prev, next) || in __list_add_valid() 30 CHECK_DATA_CORRUPTION(prev->next != next, 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() 35 new, prev, next)) in __list_add_valid() 44 struct list_head *prev, *next; in __list_del_entry_valid() local 47 next = entry->next; in __list_del_entry_valid() [all …]
|
D | list_sort.c | 27 tail->next = a; in merge() 28 a = a->next; in merge() 30 tail->next = b; in merge() 31 b = b->next; in merge() 33 tail = tail->next; in merge() 35 tail->next = a?:b; in merge() 36 return head.next; in merge() 58 tail->next = a; in merge_and_restore_back_links() 60 a = a->next; in merge_and_restore_back_links() 62 tail->next = b; in merge_and_restore_back_links() [all …]
|
D | ioremap.c | 83 unsigned long next; in ioremap_pmd_range() local 90 next = pmd_addr_end(addr, end); in ioremap_pmd_range() 93 ((next - addr) == PMD_SIZE) && in ioremap_pmd_range() 100 if (ioremap_pte_range(pmd, addr, next, phys_addr + addr, prot)) in ioremap_pmd_range() 102 } while (pmd++, addr = next, addr != end); in ioremap_pmd_range() 110 unsigned long next; in ioremap_pud_range() local 117 next = pud_addr_end(addr, end); in ioremap_pud_range() 120 ((next - addr) == PUD_SIZE) && in ioremap_pud_range() 127 if (ioremap_pmd_range(pud, addr, next, phys_addr + addr, prot)) in ioremap_pud_range() 129 } while (pud++, addr = next, addr != end); in ioremap_pud_range() [all …]
|
D | plist.c | 36 WARN(n->prev != p || p->next != n, in plist_check_prev_next() 40 t, t->next, t->prev, in plist_check_prev_next() 41 p, p->next, p->prev, in plist_check_prev_next() 42 n, n->next, n->prev); in plist_check_prev_next() 47 struct list_head *prev = top, *next = top->next; in plist_check_list() local 49 plist_check_prev_next(top, prev, next); in plist_check_list() 50 while (next != top) { in plist_check_list() 51 prev = next; in plist_check_list() 52 next = prev->next; in plist_check_list() 53 plist_check_prev_next(top, prev, next); in plist_check_list() [all …]
|
D | llist.c | 44 new_last->next = first = READ_ONCE(head->first); in llist_add_batch() 67 struct llist_node *entry, *old_entry, *next; in llist_del_first() local 74 next = READ_ONCE(entry->next); in llist_del_first() 75 entry = cmpxchg(&head->first, old_entry, next); in llist_del_first() 97 head = head->next; in llist_reverse_order() 98 tmp->next = new_head; in llist_reverse_order()
|
/linux-4.19.296/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 …]
|
D | ibmphp_res.c | 395 range_cur = range_cur->next; in add_bus_range() 411 range->next = range_cur; in add_bus_range() 416 range->next = NULL; in add_bus_range() 417 range_prev->next = range; in add_bus_range() 422 range_prev->next = range; in add_bus_range() 423 range->next = range_cur; in add_bus_range() 430 range_cur = range_cur->next; in add_bus_range() 467 if (res->next) in update_resources() 468 res = res->next; in update_resources() 481 res = res->next; in update_resources() [all …]
|
D | cpqphp_pci.c | 558 struct pci_func *next; in cpqhp_save_base_addr_length() local 577 next = cpqhp_slot_list[sub_bus]; in cpqhp_save_base_addr_length() 579 while (next != NULL) { in cpqhp_save_base_addr_length() 580 rc = cpqhp_save_base_addr_length(ctrl, next); in cpqhp_save_base_addr_length() 584 next = next->next; in cpqhp_save_base_addr_length() 738 bus_node->next = func->bus_head; in cpqhp_save_used_resources() 753 io_node->next = func->io_head; in cpqhp_save_used_resources() 769 mem_node->next = func->mem_head; in cpqhp_save_used_resources() 785 p_mem_node->next = func->p_mem_head; in cpqhp_save_used_resources() 818 io_node->next = func->io_head; in cpqhp_save_used_resources() [all …]
|
/linux-4.19.296/block/ |
D | cmdline-parser.c | 43 char *next = strchr(++partdef, ')'); in parse_subpart() local 45 if (!next) { in parse_subpart() 51 length = min_t(int, next - partdef, in parse_subpart() 56 partdef = ++next; in parse_subpart() 93 char *next; in parse_parts() local 105 next = strchr(bdevdef, ':'); in parse_parts() 106 if (!next) { in parse_parts() 111 length = min_t(int, next - bdevdef, sizeof(newparts->name) - 1); in parse_parts() 118 while (next && *(++next)) { in parse_parts() 119 bdevdef = next; in parse_parts() [all …]
|
D | blk-merge.c | 564 struct request *next) in req_attempt_discard_merge() argument 570 if (blk_rq_sectors(req) + bio_sectors(next->bio) > in req_attempt_discard_merge() 574 req->nr_phys_segments = segments + blk_rq_nr_discard_segments(next); in req_attempt_discard_merge() 582 struct request *next) in ll_merge_requests_fn() argument 586 req->biotail->bi_seg_back_size + next->bio->bi_seg_front_size; in ll_merge_requests_fn() 592 if (req_no_special_merge(req) || req_no_special_merge(next)) in ll_merge_requests_fn() 595 if (req_gap_back_merge(req, next->bio)) in ll_merge_requests_fn() 601 if ((blk_rq_sectors(req) + blk_rq_sectors(next)) > in ll_merge_requests_fn() 605 total_phys_segments = req->nr_phys_segments + next->nr_phys_segments; in ll_merge_requests_fn() 606 if (blk_phys_contig_segment(q, req->biotail, next->bio)) { in ll_merge_requests_fn() [all …]
|
/linux-4.19.296/include/drm/ |
D | spsc_queue.h | 35 struct spsc_node *next; member 69 node->next = NULL; in spsc_queue_push() 73 tail = (struct spsc_node **)atomic_long_xchg(&queue->tail, (long)&node->next); in spsc_queue_push() 91 struct spsc_node *next, *node; in spsc_queue_pop() local 101 next = READ_ONCE(node->next); in spsc_queue_pop() 102 WRITE_ONCE(queue->head, next); in spsc_queue_pop() 104 if (unlikely(!next)) { in spsc_queue_pop() 108 (long)&node->next, (long) &queue->head) != (long)&node->next) { in spsc_queue_pop() 112 } while (unlikely(!(queue->head = READ_ONCE(node->next)))); in spsc_queue_pop()
|
/linux-4.19.296/lib/lzo/ |
D | lzo1x_decompress_safe.c | 43 size_t t, next; in lzo1x_decompress_safe() local 57 next = t; in lzo1x_decompress_safe() 110 next = t & 3; in lzo1x_decompress_safe() 121 next = t & 3; in lzo1x_decompress_safe() 128 next = t & 3; in lzo1x_decompress_safe() 152 next = get_unaligned_le16(ip); in lzo1x_decompress_safe() 154 m_pos -= next >> 2; in lzo1x_decompress_safe() 155 next &= 3; in lzo1x_decompress_safe() 176 next = get_unaligned_le16(ip); in lzo1x_decompress_safe() 178 m_pos -= next >> 2; in lzo1x_decompress_safe() [all …]
|
/linux-4.19.296/fs/cachefiles/ |
D | namei.c | 493 struct dentry *dir, *next = NULL; in cachefiles_walk_to_object() local 536 next = lookup_one_len(name, dir, nlen); in cachefiles_walk_to_object() 538 if (IS_ERR(next)) { in cachefiles_walk_to_object() 539 trace_cachefiles_lookup(object, next, NULL); in cachefiles_walk_to_object() 543 inode = d_backing_inode(next); in cachefiles_walk_to_object() 544 trace_cachefiles_lookup(object, next, inode); in cachefiles_walk_to_object() 545 _debug("next -> %p %s", next, inode ? "positive" : "negative"); in cachefiles_walk_to_object() 553 if (d_is_negative(next)) in cachefiles_walk_to_object() 559 if (d_is_negative(next)) { in cachefiles_walk_to_object() 565 ret = security_path_mkdir(&path, next, 0); in cachefiles_walk_to_object() [all …]
|
/linux-4.19.296/drivers/isdn/i4l/ |
D | isdn_net.h | 87 nd->queue = nd->queue->next; in isdn_net_get_locked_lp() 94 nd->queue = nd->queue->next; in isdn_net_get_locked_lp() 118 lp->last->next = nlp; in isdn_net_add_to_bundle() 120 nlp->next = lp; in isdn_net_add_to_bundle() 139 lp->last->next = lp->next; in isdn_net_rm_from_bundle() 140 lp->next->last = lp->last; in isdn_net_rm_from_bundle() 142 master_lp->netdev->queue = lp->next; in isdn_net_rm_from_bundle() 143 if (lp->next == lp) { /* last in queue */ in isdn_net_rm_from_bundle() 147 lp->next = lp->last = lp; /* (re)set own pointers */ in isdn_net_rm_from_bundle()
|
/linux-4.19.296/drivers/parisc/ |
D | hppb.c | 29 struct hppb_card *next; member 34 .next = NULL, 53 while(card->next) { in hppb_probe() 54 card = card->next; in hppb_probe() 58 card->next = kzalloc(sizeof(struct hppb_card), GFP_KERNEL); in hppb_probe() 59 if(!card->next) { in hppb_probe() 63 card = card->next; in hppb_probe()
|
/linux-4.19.296/fs/jfs/ |
D | jfs_txnmgr.c | 204 TxAnchor.freelock = TxLock[lid].next; in txLockAlloc() 218 TxLock[lid].next = TxAnchor.freelock; in txLockFree() 289 TxBlock[k].next = k + 1; in txInit() 293 TxBlock[k].next = 0; in txInit() 317 TxLock[k].next = k + 1; in txInit() 318 TxLock[k].next = 0; in txInit() 416 if ((tblk->next == 0) && !(flag & COMMIT_FORCE)) { in txBegin() 424 TxAnchor.freetid = tblk->next; in txBegin() 436 tblk->next = tblk->last = tblk->xflag = tblk->flag = tblk->lsn = 0; in txBegin() 541 assert(tblk->next == 0); in txEnd() [all …]
|
/linux-4.19.296/drivers/of/ |
D | base.c | 253 for (pp = np->properties; pp; pp = pp->next) { in __of_find_property() 721 struct device_node *next; in __of_get_next_child() local 726 next = prev ? prev->sibling : node->child; in __of_get_next_child() 727 for (; next; next = next->sibling) in __of_get_next_child() 728 if (of_node_get(next)) in __of_get_next_child() 731 return next; in __of_get_next_child() 749 struct device_node *next; in of_get_next_child() local 753 next = __of_get_next_child(node, prev); in of_get_next_child() 755 return next; in of_get_next_child() 770 struct device_node *next; in of_get_next_available_child() local [all …]
|
/linux-4.19.296/fs/orangefs/ |
D | dir.c | 11 struct orangefs_dir_part *next; member 141 if (part->next) in parse_readdir() 142 part = part->next; in parse_readdir() 148 new->next = NULL; in parse_readdir() 154 part->next = new; in parse_readdir() 221 goto next; in fill_from_part() 224 goto next; in fill_from_part() 235 next: in fill_from_part() 251 while (part->next && count) { in orangefs_dir_fill() 253 part = part->next; in orangefs_dir_fill() [all …]
|
/linux-4.19.296/drivers/char/agp/ |
D | frontend.c | 59 curr = curr->next; in agp_find_mem_by_key() 69 struct agp_memory *next; in agp_remove_from_pool() local 75 next = temp->next; in agp_remove_from_pool() 79 prev->next = next; in agp_remove_from_pool() 80 if (next != NULL) in agp_remove_from_pool() 81 next->prev = prev; in agp_remove_from_pool() 85 if (next != NULL) in agp_remove_from_pool() 86 next->prev = NULL; in agp_remove_from_pool() 88 agp_fe.current_controller->pool = next; in agp_remove_from_pool() 207 temp->next = prev; in agp_insert_into_pool() [all …]
|
/linux-4.19.296/fs/btrfs/ |
D | extent_map.c | 186 static int mergable_maps(struct extent_map *prev, struct extent_map *next) in mergable_maps() argument 199 test_bit(EXTENT_FLAG_LOGGING, &next->flags)) in mergable_maps() 207 if (!list_empty(&prev->list) || !list_empty(&next->list)) in mergable_maps() 210 if (extent_map_end(prev) == next->start && in mergable_maps() 211 prev->flags == next->flags && in mergable_maps() 212 prev->bdev == next->bdev && in mergable_maps() 213 ((next->block_start == EXTENT_MAP_HOLE && in mergable_maps() 215 (next->block_start == EXTENT_MAP_INLINE && in mergable_maps() 217 (next->block_start == EXTENT_MAP_DELALLOC && in mergable_maps() 219 (next->block_start < EXTENT_MAP_LAST_BYTE - 1 && in mergable_maps() [all …]
|
/linux-4.19.296/drivers/isdn/divert/ |
D | isdn_divert.c | 29 struct call_struc *next; /* pointer to next entry */ member 38 struct deflect_struc *next, *prev; member 94 cs->prev->next = cs->next; /* forward link */ in deflect_timer_expire() 96 divert_head = cs->next; in deflect_timer_expire() 97 if (cs->next) in deflect_timer_expire() 98 cs->next->prev = cs->prev; /* back link */ in deflect_timer_expire() 191 cs->next = divert_head; in cf_command() 214 cs = cs->next; in deflect_extern_action() 287 ds1 = ds1->next; in insertrule() 294 ds->next = NULL; /* end of chain */ in insertrule() [all …]
|