Home
last modified time | relevance | path

Searched refs:next (Results 1 – 25 of 171) sorted by relevance

1234567

/xen/xen/include/xen/
A Dlist.h67 new->next = next; in __list_add()
108 new->next = next; in __list_add_rcu()
169 prev->next = next; in __list_del()
226 new->next = old->next; in list_replace()
771 new->next = next; in hlist_replace_rcu()
826 n->next = next; in hlist_add_before()
834 next->next = n->next; in hlist_add_after()
835 n->next = next; in hlist_add_after()
838 if(next->next) in hlist_add_after()
839 next->next->pprev = &next->next; in hlist_add_after()
[all …]
A Dmm.h322 return head->next; in page_list_first()
344 if ( head->next ) in page_list_add()
346 page->list.next = page_to_pdx(head->next); in page_list_add()
361 if ( head->next ) in page_list_add_tail()
382 head->next = next; in __page_list_del_head()
401 struct page_info *next = pdx_to_page(page->list.next); in page_list_del() local
407 prev->list.next = page->list.next; in page_list_del()
414 struct page_info *next = pdx_to_page(page->list.next); in page_list_del2() local
421 prev->list.next = page->list.next; in page_list_del2()
453 head->next = list->next; in page_list_splice()
[all …]
A Drcupdate.h70 struct rcu_head *next; member
74 #define RCU_HEAD_INIT { .next = NULL, .func = NULL }
77 (ptr)->next = NULL; (ptr)->func = NULL; \
/xen/tools/xenstore/
A Dlist.h62 new->next = next; in __list_add()
103 new->next = next; in __list_add_rcu()
145 prev->next = next; in __list_del()
276 for (pos = (head)->next; pos != (head); pos = pos->next)
293 for (pos = (head)->next, n = pos->next; pos != (head); \
377 struct hlist_node *next = n->next; in __hlist_del() local
380 if (next) in __hlist_del()
442 n->next = next; in hlist_add_before()
443 next->pprev = &n->next; in hlist_add_before()
450 next->next = n->next; in hlist_add_after()
[all …]
A Dhashtable.c100 h->table[i] = e->next; in hashtable_expand()
102 e->next = newtable[index]; in hashtable_expand()
122 pE = &(e->next); in hashtable_expand()
126 *pE = e->next; in hashtable_expand()
127 e->next = newtable[index]; in hashtable_expand()
167 e->next = h->table[index]; in hashtable_insert()
185 e = e->next; in hashtable_search()
211 *pE = e->next; in hashtable_remove()
218 pE = &(e->next); in hashtable_remove()
219 e = e->next; in hashtable_remove()
[all …]
A Dtalloc.c132 (p)->next = (list); \
142 (list) = (p)->next; \
145 if ((p)->prev) (p)->prev->next = (p)->next; \
146 if ((p)->next) (p)->next->prev = (p)->prev; \
590 if (tc->prev) tc->prev->next = tc->next; in talloc_free()
591 if (tc->next) tc->next->prev = tc->prev; in talloc_free()
662 if (tc->next) { in _talloc_realloc()
698 if (tc->prev) tc->prev->next = tc->next; in talloc_steal()
699 if (tc->next) tc->next->prev = tc->prev; in talloc_steal()
718 if (tc->prev) tc->prev->next = tc->next; in talloc_steal()
[all …]
/xen/xen/common/
A Dlist_sort.c38 tail->next = a; in merge()
39 a = a->next; in merge()
41 tail->next = b; in merge()
42 b = b->next; in merge()
46 tail->next = a?:b; in merge()
47 return head.next; in merge()
69 tail->next = a; in merge_and_restore_back_links()
71 a = a->next; in merge_and_restore_back_links()
73 tail->next = b; in merge_and_restore_back_links()
75 b = b->next; in merge_and_restore_back_links()
[all …]
A Drandom.c13 unsigned int next = this_cpu(seed), val = arch_get_random(); in get_random() local
15 if ( unlikely(!next) ) in get_random()
16 next = val ?: NOW(); in get_random()
24 next = next * 1103515245 + 12345; in get_random()
25 val |= ((next >> 16) & 0x7ff) << i; in get_random()
29 this_cpu(seed) = next; in get_random()
A Dlzo.c144 size_t t, next; in lzo1x_decompress_safe() local
158 next = t; in lzo1x_decompress_safe()
211 next = t & 3; in lzo1x_decompress_safe()
222 next = t & 3; in lzo1x_decompress_safe()
229 next = t & 3; in lzo1x_decompress_safe()
255 m_pos -= next >> 2; in lzo1x_decompress_safe()
256 next &= 3; in lzo1x_decompress_safe()
279 m_pos -= next >> 2; in lzo1x_decompress_safe()
280 next &= 3; in lzo1x_decompress_safe()
326 state = next; in lzo1x_decompress_safe()
[all …]
A Drangeset.c73 if ( x->list.next == &r->range_list ) in next_range()
310 struct range *prev, *next; in rangeset_claim_range() local
316 next; in rangeset_claim_range()
317 prev = next, next = next_range(r, next) ) in rangeset_claim_range()
322 if ( next->e == ~0UL ) in rangeset_claim_range()
325 start = next->e + 1; in rangeset_claim_range()
338 next = alloc_range(r); in rangeset_claim_range()
339 if ( !next ) in rangeset_claim_range()
345 next->s = start; in rangeset_claim_range()
346 next->e = start + size - 1; in rangeset_claim_range()
[all …]
A Dnotifier.c27 while ( chain->next != &nh->head ) in notifier_chain_register()
29 nb = list_entry(chain->next, struct notifier_block, chain); in notifier_chain_register()
32 chain = chain->next; in notifier_chain_register()
80 cursor = reverse ? cursor->prev : cursor->next; in notifier_call_chain()
A Dcore_parking.c35 unsigned int (*next)(unsigned int event); member
183 cpu = core_parking_policy->next(CORE_PARKING_INCREMENT); in core_parking_helper()
196 cpu = core_parking_policy->next(CORE_PARKING_DECREMENT); in core_parking_helper()
244 .next = core_parking_power,
249 .next = core_parking_performance,
254 if ( !policy || !policy->next ) in register_core_parking_policy()
/xen/xen/tools/kconfig/
A Dlist.h25 struct list_head *next, *prev; member
63 n = list_entry(pos->member.next, typeof(*pos), member); \
73 return head->next == head; in list_empty()
84 struct list_head *next) in __list_add() argument
86 next->prev = _new; in __list_add()
87 _new->next = next; in __list_add()
89 prev->next = _new; in __list_add()
114 next->prev = prev; in __list_del()
115 prev->next = next; in __list_del()
128 __list_del(entry->prev, entry->next); in list_del()
[all …]
A Dmenu.c59 last_entry_ptr = &menu->next; in menu_add_entry()
73 last_entry_ptr = &current_menu->next; in menu_end_menu()
448 for (menu = parent->next; menu; menu = menu->next) { in menu_finalize()
455 goto next; in menu_finalize()
478 next: in menu_finalize()
485 parent->list = parent->next; in menu_finalize()
486 parent->next = last_menu->next; in menu_finalize()
487 last_menu->next = NULL; in menu_finalize()
564 if (!last_menu->next) in menu_finalize()
567 last_menu->next = menu->next; in menu_finalize()
[all …]
A Dexpr.h21 struct file *next; member
85 struct symbol *next; member
134 …bols(i, sym) for (i = 0; i < SYMBOL_HASHSIZE; i++) for (sym = symbol_hash[i]; sym; sym = sym->next)
193 struct property *next; /* next property - null if last */ member
207 for (st = sym->prop; st; st = st->next) \
212 for (st = sym->prop; st; st = st->next) \
223 struct menu *next; member
/xen/xen/xsm/flask/ss/
A Debitmap.c34 n1 = n1->next; in ebitmap_cmp()
35 n2 = n2->next; in ebitmap_cmp()
61 new->next = NULL; in ebitmap_cpy()
67 n = n->next; in ebitmap_cpy()
97 n1 = n1->next; in ebitmap_contains()
98 n2 = n2->next; in ebitmap_contains()
119 n = n->next; in ebitmap_get_bit()
163 prev->next = n->next; in ebitmap_set_bit()
172 n = n->next; in ebitmap_set_bit()
191 new->next = prev->next; in ebitmap_set_bit()
[all …]
A Dsidtab.c56 cur = cur->next; in sidtab_insert()
81 newnode->next = prev->next; in sidtab_insert()
83 prev->next = newnode; in sidtab_insert()
110 cur = cur->next; in sidtab_search()
119 cur = cur->next; in sidtab_search()
144 cur = cur->next; in sidtab_map()
171 last->next = cur->next; in sidtab_map_remove_on_error()
179 cur = cur->next; in sidtab_map_remove_on_error()
187 cur = cur->next; in sidtab_map_remove_on_error()
208 cur = cur->next; in sidtab_search_context()
[all …]
A Dhashtab.c51 cur = cur->next; in hashtab_insert()
64 newnode->next = prev->next; in hashtab_insert()
65 prev->next = newnode; in hashtab_insert()
69 newnode->next = h->htable[hvalue]; in hashtab_insert()
88 cur = cur->next; in hashtab_search()
110 cur = cur->next; in hashtab_destroy()
141 cur = cur->next; in hashtab_map()
165 cur = cur->next; in hashtab_stat()
A Dconditional.c35 for ( cur = expr; cur != NULL; cur = cur->next ) in cond_evaluate_expr()
138 struct cond_av_list *cur, *next; in cond_av_list_destroy() local
139 for ( cur = list; cur != NULL; cur = next ) in cond_av_list_destroy()
141 next = cur->next; in cond_av_list_destroy()
153 next_expr = cur_expr->next; in cond_node_destroy()
163 struct cond_node *next, *cur; in cond_list_destroy() local
168 for ( cur = list; cur != NULL; cur = next ) in cond_list_destroy()
170 next = cur->next; in cond_list_destroy()
353 data->tail->next = list; in cond_insertf()
458 last->next = expr; in cond_read_node()
[all …]
A Dservices.c1493 c = c->next; in security_irq_sid()
1533 c = c->next; in security_iomem_sid()
1566 c = c->next; in security_iterate_iomem_sids()
1593 c = c->next; in security_iterate_iomem_sids()
1621 c = c->next; in security_ioport_sid()
2039 add->next = prev->next; in security_ocontext_add()
2072 add->next = prev->next; in security_ocontext_add()
2142 before_c->next = c->next; in security_ocontext_del()
2168 before_c->next = c->next; in security_ocontext_del()
2194 before_c->next = c->next; in security_ocontext_del()
[all …]
A Dconditional.h34 struct cond_expr *next; member
44 struct cond_av_list *next; member
59 struct cond_node *next; member
/xen/tools/libxl/
A Dlibxl_vnuma.c219 uint64_t next; in libxl__vnuma_build_vmemrange_pv_generic() local
224 next = 0; in libxl__vnuma_build_vmemrange_pv_generic()
228 v[i].start = next; in libxl__vnuma_build_vmemrange_pv_generic()
233 next = v[i].end; in libxl__vnuma_build_vmemrange_pv_generic()
259 uint64_t hole_start, hole_end, next; in libxl__vnuma_build_vmemrange_hvm() local
276 next = 0; in libxl__vnuma_build_vmemrange_hvm()
296 if (next >= hole_start && next < hole_end) in libxl__vnuma_build_vmemrange_hvm()
297 next = hole_end; in libxl__vnuma_build_vmemrange_hvm()
298 if ((next < hole_start) && (next + remaining_bytes >= hole_start)) in libxl__vnuma_build_vmemrange_hvm()
299 count = hole_start - next; in libxl__vnuma_build_vmemrange_hvm()
[all …]
/xen/tools/firmware/rombios/32bit/
A Dpmm.c130 struct memblk *next; // points the very next of this memblk member
185 #define memblk_size(_mb) ((void *)((_mb)->next) - (void *)(_mb))
197 (_mb) = (_mb)->next)
202 (_mb) = (_mb)->next)
226 sb->next = mb->next; in split_memblk()
229 mb->next = sb; in split_memblk()
247 memblk_t *nb = mb->next; in collect_avail_memblks()
252 mb->next = nb; in collect_avail_memblks()
260 mb->next = (memblk_t *)ALIGN_DOWN(to_addr, HEAP_ALIGNMENT); in pmm_init_heap()
264 heap->end = mb->next; in pmm_init_heap()
[all …]
/xen/xen/arch/arm/arm32/lib/
A Dfindbit.S33 add r2, r2, #8 @ next bit pointer
57 b 2b @ loop for next bit
74 add r2, r2, #8 @ next bit pointer
97 b 2b @ loop for next bit
112 add r2, r2, #8 @ next bit pointer
133 b 2b @ loop for next bit
146 add r2, r2, #8 @ next bit pointer
166 b 2b @ loop for next bit
/xen/stubdom/
A Dlwip.patch-cvs553 - mem2->next = mem->next;
556 - mem->next = ptr2;
586 + mem2->next = mem->next;
601 + * also can't move mem->next directly behind mem, since mem->next
613 - * also can't move mem->next directly behind mem, since mem->next
845 + for (last = r; last->next != NULL; last = last->next);
905 + in_end->next = NULL;
933 + netif = netif->next;
1227 - next = cseg->next;
1234 + next = cseg->next;
[all …]

Completed in 45 milliseconds

1234567