| /titanic_51/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()
241 * Prepend to next. in memlist_add_span()
243 if ((address + bytes) == next in memlist_add_span()
337 struct memlist *dst, *next; memlist_delete_span() local
[all...] |
| /titanic_51/usr/src/uts/common/io/mega_sas/ |
| H A D | list.h | 53 * sometimes we already know the next/prev entries and we can
59 struct mlist_head *next, *prev; member
70 (ptr)->next = (ptr); (ptr)->prev = (ptr); \
78 * the prev/next entries already!
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 __list_del(struct mlist_head * prev,struct mlist_head * next) __list_del() argument
[all...] |
| /titanic_51/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()
[all...] |
| /titanic_51/usr/src/uts/common/io/xge/hal/include/ |
| H A D | xge-list.h | 34 * @next: Next list item.
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()
75 * Returns the next item from the header.
76 * Returns NULL if the next item is header itself
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 ! in xge_list_remove()
[all...] |
| /titanic_51/usr/src/uts/intel/io/pci/ |
| H A D | pci_memlist.c | 30 * NOTE: We are only using the next-> link. The prev-> link is
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 in memlist_insert()
225 struct memlist *prev = 0, *next; memlist_find() local
262 struct memlist *next; memlist_find_with_startaddr() local
[all...] |
| /titanic_51/usr/src/uts/sun4u/os/ |
| H A D | memscrub.c | 248 struct memscrub_page_retire_span *next; member
655 * when appropriate, address will be rounded up to start of next
690 /* else go to next struct memlist */ in memscrub_verify_span()
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 in memscrub_add_span_gen()
911 struct memlist *dst, *next; memscrub_delete_span() local
1319 memscrub_page_retire_span_t *prev, *cur, *next; memscrub_page_retire_span_list_update() local
[all...] |
| /titanic_51/usr/src/uts/common/io/mr_sas/ |
| H A D | mr_sas_list.c | 23 * the prev/next entries already!
27 struct mlist_head *next) in __list_add() argument
29 next->prev = new; in __list_add()
30 new->next = next; in __list_add()
32 prev->next = new; in __list_add()
46 __list_add(new, head, head->next); in mlist_add()
64 * Delete a list entry by making the prev/next entries
68 * the prev/next entries already!
71 __list_del(struct mlist_head *prev, struct mlist_head *next) in __list_del() argument
[all...] |
| /titanic_51/usr/src/uts/common/fs/zfs/ |
| H A D | zfs_rlock.c | 273 rl_t *next; in zfs_range_add_reader() local
299 next = prev; in zfs_range_add_reader()
301 next = (rl_t *)avl_nearest(tree, where, AVL_AFTER); in zfs_range_add_reader()
303 if (next == NULL || off + len <= next->r_off) { in zfs_range_add_reader()
309 if (off < next->r_off) { in zfs_range_add_reader()
311 zfs_range_new_proxy(tree, off, next->r_off - off); in zfs_range_add_reader()
321 for (prev = NULL; next; prev = next, next in zfs_range_add_reader()
359 rl_t *prev, *next; zfs_range_lock_reader() local
466 rl_t *rl, *next = NULL; zfs_range_unlock_reader() local
[all...] |
| /titanic_51/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()
174 * Join block with next one if it is free in realloc()
176 if (block->next && block->next->status == FREE) { in realloc()
177 block->size += block->next in realloc()
[all...] |
| /titanic_51/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 in asyn3()
[all...] |
| /titanic_51/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 in del_flt_act()
[all...] |
| /titanic_51/usr/src/lib/gss_mechs/mech_krb5/krb5/asn.1/ |
| H A D | asn1buf.c | 41 begins at base and continues to the octet immediately preceding next.
42 If next == base or mybuf == NULL, then the asn1buf represents an empty
52 next >= base
53 next <= bound+2 (i.e. next should be able to step just past the bound,
55 to being crossed by next.)) */
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 in asn1buf_imbed()
[all...] |
| /titanic_51/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()
[all...] |
| /titanic_51/usr/src/cmd/powertop/common/ |
| H A D | suggestions.c | 48 * to the next.
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 in pt_sugg_add()
[all...] |
| /titanic_51/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; \
[all...] |
| /titanic_51/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 …]
|
| H A D | sfraise.c | 38 Sfpool_t *p, *next; local
42 for(p = &_Sfpool; p; p = next)
44 for(next = p->next; next; next = next->next)
45 if(next->n_sf > 0)
65 reg Sfdisc_t *disc, *next, *d; local
84 { next = disc->disc;
86 f->disc = next;
95 if((disc = next) )
|
| /titanic_51/usr/src/boot/sys/boot/efi/loader/ |
| H A D | memmap.c | 79 struct smap_buf *cur, *next; in efi_getsmap() local
97 next = NULL; in efi_getsmap()
100 if (next == NULL) { in efi_getsmap()
101 next = malloc(sizeof(*next)); in efi_getsmap()
102 if (next == NULL) in efi_getsmap()
105 next->sb_smap.base = p->PhysicalStart; in efi_getsmap()
106 next->sb_smap.length = in efi_getsmap()
114 if (next->sb_smap.base == 0) in efi_getsmap()
118 next in efi_getsmap()
[all...] |
| /titanic_51/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 in split()
[all...] |
| /titanic_51/usr/src/cmd/gencat/ |
| H A D | gencat.c | 78 struct cat_set *next; member
86 struct cat_msg *next; member
176 p->next = NULL;
187 struct cat_set *prev, *next; local
210 current_set->next = first_set;
221 while (current_set->next && current_set->next->set_no < no)
222 current_set = current_set->next;
224 if (current_set->next && current_set->next
248 struct cat_set *prev, *next, *setp; global() local
309 struct cat_msg *prev, *next; global() local
374 struct cat_msg *prev, *next; global() local
[all...] |
| /titanic_51/usr/src/cmd/users/ |
| H A D | users.c | 67 * getopt Extract the next option from the command line
68 * optind The argument count of the next option to extract from
74 * getpwent Get next entry from the /etc/passwd file
75 * getgrent Get next entry from the /etc/group file
113 struct reqgrp *next; member
125 struct reqlogin *next; member
260 * nextblkaddr Address of the next available chunk of aligned
376 struct grpmember *next; member
404 * to the member-name and a pointer to the next item in the structure.
421 new->next in addmember()
486 struct display *next; global() member
[all...] |
| /titanic_51/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()
[all...] |
| /titanic_51/usr/src/contrib/ast/src/lib/libast/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 && s < f->endb) /* 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_
[all...] |
| H A D | sfraise.c | 38 Sfpool_t *p, *next; local
42 for(p = &_Sfpool; p; p = next)
44 for(next = p->next; next; next = next->next)
45 if(next->n_sf > 0)
65 reg Sfdisc_t *disc, *next, * local
[all...] |
| /titanic_51/usr/src/contrib/ast/src/lib/libast/vmalloc/ |
| H A D | vmprofile.c | 62 { Pfobj_t* next; /* next in linked list */ member
105 for(last = NIL(Pfobj_t*), pf = Pftable[n]; pf; last = pf, pf = pf->next)
120 for(fn = Pftable[n]; fn; fn = fn->next)
128 fn->next = Pftable[n];
136 for(pfvm = Pftable[PFTABLE]; pfvm; last = pfvm, pfvm = pfvm->next)
143 { pfvm->next = last->next;
144 last->next = pfvm;
147 { pfvm->next
189 reg Pfobj_t *pf, *next, *last; global() local
256 reg Pfobj_t *one, *two, *next; global() local
361 reg Pfobj_t *pf, *list, *next, *last; global() local
[all...] |