| /onnv-gate/usr/src/uts/common/os/ |
| H A D | memlist_new.c | 203 struct memlist *prev, *next; in memlist_add_span() local
231 for (prev = NULL, next = *curmemlistp; next != NULL; in memlist_add_span()
232 prev = next, next = next->ml_next) { in memlist_add_span()
233 if (address > (next->ml_address + next->ml_size)) in memlist_add_span()
243 if ((address + bytes) == next->ml_address) { in memlist_add_span()
246 next->ml_address = address; in memlist_add_span()
247 next->ml_size += bytes; in memlist_add_span()
255 if (address == (next->ml_address + next->ml_size)) { in memlist_add_span()
258 if (next->ml_next) { in memlist_add_span()
263 next->ml_next->ml_address) { in memlist_add_span()
[all …]
|
| /onnv-gate/usr/src/common/openssl/crypto/pqueue/ |
| H A D | pqueue.c | 80 item->next = NULL; in pitem_new()
115 pitem *curr, *next; in pqueue_insert() local
123 for(curr = NULL, next = pq->items; in pqueue_insert()
124 next != NULL; in pqueue_insert()
125 curr = next, next = next->next) in pqueue_insert()
127 if (pq_64bit_gt(&(next->priority), &(item->priority))) in pqueue_insert()
129 item->next = next; in pqueue_insert()
134 curr->next = item; in pqueue_insert()
139 if (pq_64bit_eq(&(item->priority), &(next->priority))) in pqueue_insert()
143 item->next = NULL; in pqueue_insert()
[all …]
|
| /onnv-gate/usr/src/uts/common/io/mega_sas/ |
| H A D | list.h | 59 struct mlist_head *next, *prev; member
70 (ptr)->next = (ptr); (ptr)->prev = (ptr); \
82 struct mlist_head *next) in __list_add() argument
84 next->prev = new; in __list_add()
85 new->next = next; in __list_add()
87 prev->next = new; in __list_add()
101 __list_add(new, head, head->next); in mlist_add()
128 struct mlist_head *next) in __list_del() argument
130 next->prev = prev; in __list_del()
131 prev->next = next; in __list_del()
[all …]
|
| /onnv-gate/usr/src/uts/common/ipp/ipgpc/ |
| H A D | table.c | 80 } else if (table[x].next == NULL) { in ht_insert()
81 table[x].next = kmem_cache_alloc(ht_node_cache, KM_SLEEP); in ht_insert()
82 table[x].next->elements = NULL; in ht_insert()
83 table[x].next->next = NULL; in ht_insert()
84 table[x].next->key = key; in ht_insert()
85 table[x].next->info = 1; in ht_insert()
86 (void) ipgpc_list_insert(&table[x].next->elements, id); in ht_insert()
88 p = table[x].next; in ht_insert()
100 p = p->next; in ht_insert()
104 p->next = NULL; in ht_insert()
[all …]
|
| /onnv-gate/usr/src/uts/common/io/mr_sas/ |
| H A D | mr_sas_list.h | 59 struct mlist_head *next, *prev; member
70 (ptr)->next = (ptr); (ptr)->prev = (ptr); \
82 struct mlist_head *next) in __list_add() argument
84 next->prev = new; in __list_add()
85 new->next = next; in __list_add()
87 prev->next = new; in __list_add()
101 __list_add(new, head, head->next); in mlist_add()
128 struct mlist_head *next) in __list_del() argument
130 next->prev = prev; in __list_del()
131 prev->next = next; in __list_del()
[all …]
|
| /onnv-gate/usr/src/lib/libntfs/common/include/ntfs/ |
| H A D | list.h | 38 struct list_head *next, *prev; member
47 (ptr)->next = (ptr); (ptr)->prev = (ptr); \
60 struct list_head * prev, struct list_head * next) in __list_add() argument
62 next->prev = new; in __list_add()
63 new->next = next; in __list_add()
65 prev->next = new; in __list_add()
78 __list_add(new, head, head->next); in list_add()
105 struct list_head * next) in __list_del() argument
107 next->prev = prev; in __list_del()
108 prev->next = next; in __list_del()
[all …]
|
| /onnv-gate/usr/src/uts/common/io/xge/hal/include/ |
| H A D | xge-list.h | 40 struct xge_list_t* next; member
52 header->next = header; in xge_list_init()
68 return header->next == header; in xge_list_is_empty()
82 xge_assert(header->next != NULL); in xge_list_first_get()
85 if(header->next == header) in xge_list_first_get()
88 return header->next; in xge_list_first_get()
101 xge_assert(item->next != NULL); in xge_list_remove()
104 item->next->prev = item->prev; in xge_list_remove()
105 item->prev->next = item->next; in xge_list_remove()
107 item->next = item->prev = NULL; in xge_list_remove()
[all …]
|
| /onnv-gate/usr/src/uts/intel/io/pci/ |
| H A D | pci_memlist.c | 71 struct memlist *next, *buf; in memlist_free_all() local
73 next = *list; in memlist_free_all()
74 while (next) { in memlist_free_all()
75 buf = next; in memlist_free_all()
76 next = buf->ml_next; in memlist_free_all()
88 struct memlist *prev = 0, *next; in memlist_insert() local
91 next = *listp; in memlist_insert()
92 while (next && next->ml_address <= addr) { in memlist_insert()
97 if (next->ml_address <= addr && in memlist_insert()
98 next->ml_address + next->ml_size >= addr + size) { in memlist_insert()
[all …]
|
| /onnv-gate/usr/src/lib/libparted/common/libparted/fs/jfs/ |
| H A D | jfs_types.h | 298 struct type *next;\
303 struct cdll_entry *next; member
340 (elm)->field.next = (header)->head;\
357 (elm)->field.next = (void *)(header);\
362 (header)->tail->field.next = (elm);\
375 (elm)->field.next = (listelm)->field.next;\
377 if ((listelm)->field.next == (void *)(header))\
380 (listelm)->field.next->field.prev = (elm);\
381 (listelm)->field.next = (elm);\
393 (elm)->field.next = (listelm);\
[all …]
|
| /onnv-gate/usr/src/uts/sun4u/os/ |
| H A D | memscrub.c | 248 struct memscrub_page_retire_span *next; member
768 struct memlist *prev, *next; in memscrub_add_span_gen() local
800 for (prev = NULL, next = *list; in memscrub_add_span_gen()
801 next != NULL; in memscrub_add_span_gen()
802 prev = next, next = next->ml_next) { in memscrub_add_span_gen()
803 if (address > (next->ml_address + next->ml_size)) in memscrub_add_span_gen()
813 if ((address + bytes) == next->ml_address) { in memscrub_add_span_gen()
816 next->ml_address = address; in memscrub_add_span_gen()
817 next->ml_size += bytes; in memscrub_add_span_gen()
825 if (address == (next->ml_address + next->ml_size)) { in memscrub_add_span_gen()
[all …]
|
| /onnv-gate/usr/src/uts/intel/io/drm/ |
| H A D | i915_mem.c | 85 list[(unsigned)list[i].next].prev = list[i].prev; in mark_block()
86 list[(unsigned)list[i].prev].next = list[i].next; in mark_block()
91 list[i].next = list[nr].next; in mark_block()
92 list[(unsigned)list[nr].next].prev = (unsigned char)i; in mark_block()
93 list[nr].next = (unsigned char)i; in mark_block()
112 newblock->next = p->next; in split_block()
114 p->next->prev = newblock; in split_block()
115 p->next = newblock; in split_block()
129 newblock->next = p->next; in split_block()
131 p->next->prev = newblock; in split_block()
[all …]
|
| H A D | radeon_mem.c | 62 newblock->next = p->next; in split_block()
64 p->next->prev = newblock; in split_block()
65 p->next = newblock; in split_block()
79 newblock->next = p->next; in split_block()
81 p->next->prev = newblock; in split_block()
82 p->next = newblock; in split_block()
98 for (p = heap->next; p != heap; p = p->next) { in alloc_block()
112 for (p = heap->next; p != heap; p = p->next) in find_block()
128 if (p->next->filp == 0) { in free_block()
129 struct mem_block *q = p->next; in free_block()
[all …]
|
| /onnv-gate/usr/src/uts/common/io/drm/ |
| H A D | drm_linux_list.h | 44 struct list_head *next, *prev; member
52 (head)->next = head; \
58 (head)->next->prev = entry; \
59 (entry)->next = (head)->next; \
61 (head)->next = entry; \
67 (entry)->next = head; \
68 (head)->prev->next = entry; \
74 (entry)->next->prev = (entry)->prev; \
75 (entry)->prev->next = (entry)->next; \
80 for (entry = (head)->next; entry != head; entry = (entry)->next)
[all …]
|
| /onnv-gate/usr/src/uts/common/fs/zfs/ |
| H A D | zfs_rlock.c | 270 rl_t *next; in zfs_range_add_reader() local
296 next = prev; in zfs_range_add_reader()
298 next = (rl_t *)avl_nearest(tree, where, AVL_AFTER); in zfs_range_add_reader()
300 if (next == NULL || off + len <= next->r_off) { in zfs_range_add_reader()
306 if (off < next->r_off) { in zfs_range_add_reader()
308 zfs_range_new_proxy(tree, off, next->r_off - off); in zfs_range_add_reader()
318 for (prev = NULL; next; prev = next, next = AVL_NEXT(tree, next)) { in zfs_range_add_reader()
319 if (off + len <= next->r_off) in zfs_range_add_reader()
321 if (prev && prev->r_off + prev->r_len < next->r_off) { in zfs_range_add_reader()
323 ASSERT3U(next->r_off, >, prev->r_off + prev->r_len); in zfs_range_add_reader()
[all …]
|
| /onnv-gate/usr/src/lib/libmapmalloc/common/ |
| H A D | textmem.c | 66 struct block *next; member
72 struct page *next; member
120 for (page = memstart; page; page = page->next) { in malloc_unlocked()
121 for (block = page->block; block; block = block->next) { in malloc_unlocked()
140 page->next = memstart; in malloc_unlocked()
144 block->next = 0; in malloc_unlocked()
176 if (block->next && block->next->status == FREE) { in realloc()
177 block->size += block->next->size + HDR_BLOCK; in realloc()
178 block->next = block->next->next; in realloc()
230 newblock->next = block->next; in split()
[all …]
|
| /onnv-gate/usr/src/cmd/csh/ |
| H A D | sh.parse.c | 59 asyntax(lex->next, lex); in alias()
75 p1 = p1->next; in asyntax()
91 for (p = p1; p != p2; p = p->next) in asyn0()
105 if (p->next != p2 && eq(p->next->word, S_AND /* "&"*/)) in asyn0()
106 p = p->next; in asyn0()
116 asyntax(p->next, p2); in asyn0()
139 if (p2 == p1->next) in asyn3()
141 asyn0(p1->next, p2); in asyn3()
157 if (p1->word[0] && eq(p1->word, alout.next->word)) { in asyn3()
158 tchar *cp = alout.next->word; in asyn3()
[all …]
|
| /onnv-gate/usr/src/cmd/lp/cmd/lpsched/ |
| H A D | flt.c | 40 FLT * next; member
87 f->next = Fault_List->next; in add_flt_act()
88 Fault_List->next = f; in add_flt_act()
104 for (f = Fault_List; f->next; f = f->next) in del_flt_act()
105 if (f->next->type == type && f->next->ident == md) in del_flt_act()
107 fp = f->next; in del_flt_act()
108 f->next = f->next->next; in del_flt_act()
128 for (f = Fault_List; f && f->next; f = f->next) in do_flt_acts()
129 if (f->next->ident == md) in do_flt_acts()
131 fp = f->next; in do_flt_acts()
[all …]
|
| /onnv-gate/usr/src/cmd/cmd-inet/usr.lib/in.dhcpd/ |
| H A D | hash.c | 94 hash_member *prev, *next, *unfree = NULL; in hashi_FreeMember() local
98 for (prev = *bucketptr; prev; prev = next) { in hashi_FreeMember()
99 next = prev->next; in hashi_FreeMember()
100 prev->next = NULL; in hashi_FreeMember()
105 prev->next = unfree; in hashi_FreeMember()
147 hash_member *next; in hashi_Dfree() local
149 next = memberptr->next; in hashi_Dfree()
150 memberptr->next = NULL; in hashi_Dfree()
154 memberptr->next = next; in hashi_Dfree()
254 (void) hashi_FreeMember(&bucketptr->next, free_data, B_TRUE); in hash_Reset()
[all …]
|
| /onnv-gate/usr/src/lib/gss_mechs/mech_krb5/krb5/asn.1/ |
| H A D | asn1buf.c | 72 (*buf)->next = NULL; in asn1buf_create()
79 buf->next = buf->base = code->data; in asn1buf_wrap_data()
86 if (buf->next > buf->bound + 1) return ASN1_OVERRUN; in asn1buf_imbed()
87 subbuf->base = subbuf->next = buf->next; in asn1buf_imbed()
89 if (length > (size_t)(buf->bound + 1 - buf->next)) return ASN1_OVERRUN; in asn1buf_imbed()
104 buf->next = subbuf->bound + 1; in asn1buf_sync()
111 buf->next = subbuf->next; in asn1buf_sync()
124 if (length <= buf->bound - buf->next + 1) in asn1buf_skiptail()
125 buf->next += length; in asn1buf_skiptail()
130 if (buf->bound - buf->next + 1 <= 0) in asn1buf_skiptail()
[all …]
|
| /onnv-gate/usr/src/lib/libresolv2/common/isc/ |
| H A D | ev_waits.c | 62 new->next = NULL; in evWaitFor()
64 wl->last->next = new; in evWaitFor()
93 ctx->waitDone.last->next = first; in evDo()
118 prev = this, this = this->next) in evUnwait()
122 prev->next = this->next; in evUnwait()
124 wl->first = this->next; in evUnwait()
137 prev = this, this = this->next) in evUnwait()
141 prev->next = this->next; in evUnwait()
143 ctx->waitDone.first = this->next; in evUnwait()
172 new->next = NULL; in evDefer()
[all …]
|
| /onnv-gate/usr/src/cmd/powertop/common/ |
| H A D | suggestions.c | 96 new->next = NULL; in pt_sugg_add()
98 for (n = sugg; n != NULL; n = n->next) { in pt_sugg_add()
125 for (n = sugg; n->next != NULL; n = n->next) in pt_sugg_add()
128 n->next = new; in pt_sugg_add()
130 new->next = NULL; in pt_sugg_add()
136 new->next = sugg; in pt_sugg_add()
145 new->next = pos; in pt_sugg_add()
147 pos->prev->next = new; in pt_sugg_add()
163 for (n = sugg; n != NULL; n = n->next) { in pt_sugg_remove()
167 if (sugg->next == NULL) { in pt_sugg_remove()
[all …]
|
| /onnv-gate/usr/src/lib/libast/common/sfio/ |
| H A D | sfwrite.c | 38 reg uchar *s, *begs, *next; local
55 if((uchar*)buf != f->next &&
82 f->next += n;
95 w = f->endb - f->next;
97 if(s == f->next) /* after sfreserve */
100 f->next = (s += w);
109 if((w = f->endb - f->next) < (ssize_t)n)
111 { if(f->next > f->data)
118 else if(f->next > f->data)
121 if((w = f->endb - f->next) < (ssize_t)n &&
[all …]
|
| /onnv-gate/usr/src/lib/libresolv2/include/isc/ |
| H A D | list.h | 26 #define LINK(type) struct { type *prev, *next; }
30 (elt)->link.next = (type *)(-1); \
35 (void *)((elt)->link.next) != (void *)(-1))
49 (elt)->link.next = (list).head; \
57 (list).tail->link.next = (elt); \
61 (elt)->link.next = NULL; \
68 if ((elt)->link.next != NULL) \
69 (elt)->link.next->link.prev = (elt)->link.prev; \
75 (elt)->link.prev->link.next = (elt)->link.next; \
78 (list).head = (elt)->link.next; \
[all …]
|
| /onnv-gate/usr/src/cmd/sgs/rtld/common/ |
| H A D | malloc.c | 55 struct block *next; member
61 struct page *next; member
111 for (block = page->block; block; block = block->next) { in defrag()
116 for (block2 = block->next; block2 && in defrag()
117 block2->status == FREE; block2 = block2->next) { in defrag()
118 block->next = block2->next; in defrag()
142 newblock->next = block->next; in split()
143 block->next = newblock; in split()
169 for (page = memstart; page; page = page->next) { in malloc()
170 for (block = page->block; block; block = block->next) { in malloc()
[all …]
|
| /onnv-gate/usr/src/uts/common/gssapi/mechs/krb5/mech/ |
| H A D | util_set.c | 40 struct _g_set_elt *next; member
53 g_set next;
56 next = (*s)->next;
58 *s = next;
74 first->next = *s; in g_set_entry_add()
85 for (p=s; *p; p = &((*p)->next)) { in g_set_entry_delete()
87 g_set_elt next = (*p)->next; in g_set_entry_delete() local
89 *p = next; in g_set_entry_delete()
102 for (p = *s; p; p = p->next) { in g_set_entry_get()
|