Searched refs:next (Results 1 - 25 of 2394) sorted by relevance

1234567891011>>

/illumos-gate/usr/src/lib/libast/common/stdio/
H A Dfcloseall.c32 Sfpool_t* next; local
42 for(p = &_Sfpool; p; p = next)
43 { /* find the next legitimate pool */
44 for(next = p->next; next; next = next->next)
45 if(next
[all...]
/illumos-gate/usr/src/cmd/bnu/
H A Dpkdefs.c36 char next[8] ={ 1,2,3,4,5,6,7,0}; /* packet sequence numbers */ variable
/illumos-gate/usr/src/uts/common/io/mr_sas/
H A Dmr_sas_list.c23 * the prev/next entries already!
27 struct mlist_head *next)
29 next->prev = new;
30 new->next = next;
32 prev->next = new;
46 __list_add(new, head, head->next);
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) argument
26 __list_add(struct mlist_head *new, struct mlist_head *prev, struct mlist_head *next) argument
[all...]
H A Dmr_sas_list.h48 * sometimes we already know the next/prev entries and we can
54 struct mlist_head *next, *prev; member in struct:mlist_head
65 (ptr)->next = (ptr); (ptr)->prev = (ptr); \
91 for (pos = (head)->next, prefetch(pos->next); pos != (head); \
92 pos = pos->next, prefetch(pos->next))
102 for (pos = (head)->next, n = pos->next; pos != (head); \
103 pos = n, n = pos->next)
[all...]
/illumos-gate/usr/src/uts/common/io/mega_sas/
H A Dlist.h53 * sometimes we already know the next/prev entries and we can
59 struct mlist_head *next, *prev; member in struct:mlist_head
70 (ptr)->next = (ptr); (ptr)->prev = (ptr); \
78 * the prev/next entries already!
82 struct mlist_head *next)
84 next->prev = new;
85 new->next = next;
87 prev->next = new;
101 __list_add(new, head, head->next);
80 __list_add(struct mlist_head *new, struct mlist_head *prev, struct mlist_head *next) argument
127 __list_del(struct mlist_head *prev, struct mlist_head *next) argument
[all...]
/illumos-gate/usr/src/uts/common/io/xge/hal/include/
H A Dxge-list.h34 * @next: Next list item.
40 struct xge_list_t* next; member in struct:xge_list_t
52 header->next = header;
68 return header->next == header;
75 * Returns the next item from the header.
76 * Returns NULL if the next item is header itself
82 xge_assert(header->next != NULL);
85 if(header->next == header)
88 return header->next;
101 xge_assert(item->next !
[all...]
/illumos-gate/usr/src/uts/common/os/
H A Dmemlist_new.c203 struct memlist *prev, *next; local
231 for (prev = NULL, next = *curmemlistp; next != NULL;
232 prev = next, next = next->ml_next) {
233 if (address > (next->ml_address + next->ml_size))
241 * Prepend to next.
243 if ((address + bytes) == next
337 struct memlist *dst, *next; local
[all...]
/illumos-gate/usr/src/lib/libslp/javalib/com/sun/slp/
H A DServiceLocationEnumeration.java48 Object next() throws ServiceLocationException; method in interface:ServiceLocationEnumeration
/illumos-gate/usr/src/cmd/mail/
H A Ddel_recipl.c47 if (r->next != (struct recip *)NULL) {
48 for (r = r->next; r != (struct recip *)NULL; ) {
50 r = old->next;
/illumos-gate/usr/src/uts/common/io/qede/
H A Dqede_list.h40 struct qede_list_s *next; member in struct:qede_list_s
87 list->next = list;
96 qede_list_t *next)
98 next->prev = new;
99 new->next = next;
101 prev->next = new;
107 return (entry->next == entry);
111 qede_list_del(qede_list_t *prev, qede_list_t *next) argument
113 next
94 qede_list_add(qede_list_t *new, qede_list_t *prev, qede_list_t *next) argument
136 list_splice(const qede_list_t *list, qede_list_t *prev, qede_list_t *next) argument
[all...]
/illumos-gate/usr/src/uts/common/gssapi/mechs/krb5/mech/
H A Dutil_set.c40 struct _g_set_elt *next; member in struct:_g_set_elt
53 g_set next;
56 next = (*s)->next;
58 *s = next;
74 first->next = *s;
85 for (p=s; *p; p = &((*p)->next)) {
87 g_set_elt next = (*p)->next; local
89 *p = next;
[all...]
/illumos-gate/usr/src/uts/intel/io/pci/
H A Dpci_memlist.c30 * NOTE: We are only using the next-> link. The prev-> link is
71 struct memlist *next, *buf; local
73 next = *list;
74 while (next) {
75 buf = next;
76 next = buf->ml_next;
88 struct memlist *prev = 0, *next; local
91 next = *listp;
92 while (next && next
225 struct memlist *prev = 0, *next; local
262 struct memlist *next; local
[all...]
/illumos-gate/usr/src/lib/libdwarf/common/
H A Dpro_alloc.c96 lp->next = lp->prev = lp;
101 nextblock = dbglp->next;
104 dbglp->next = lp;
106 lp->next = nextblock;
153 lp->prev->next = lp->next;
154 lp->next->prev = lp->prev;
176 while (dbglp->next != dbglp) {
177 _dwarf_p_dealloc(dbg, LIST_TO_BLOCK(dbglp->next));
179 if (dbglp->next !
[all...]
/illumos-gate/usr/src/lib/libast/common/sfio/
H A Dsfraise.c38 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...]
/illumos-gate/usr/src/uts/common/ipp/ipgpc/
H A Dtable.c80 } else if (table[x].next == NULL) {
81 table[x].next = kmem_cache_alloc(ht_node_cache, KM_SLEEP);
82 table[x].next->elements = NULL;
83 table[x].next->next = NULL;
84 table[x].next->key = key;
85 table[x].next->info = 1;
86 (void) ipgpc_list_insert(&table[x].next->elements, id);
88 p = table[x].next;
100 p = p->next;
[all...]
/illumos-gate/usr/src/cmd/isns/isnsd/
H A Disns_cfg.h37 struct ctrl_node *next; member in struct:ctrl_node
/illumos-gate/usr/src/cmd/mandoc/
H A Dmandoc_xr.h19 struct mandoc_xr *next; member in struct:mandoc_xr
/illumos-gate/usr/src/tools/smatch/src/
H A Dcheck_zero_to_err_ptr.c36 struct expression *next; local
41 next = strip_expr(__next_stmt->if_conditional);
42 while (next->type == EXPR_PREOP && next->op == '!')
43 next = strip_expr(next->unop);
44 if (expr_equiv(expr, next))
51 struct expression *next; local
63 next = strip_expr(__next_stmt->if_conditional);
64 while (next
[all...]
/illumos-gate/usr/src/cmd/mailx/
H A Dmyfopen.c72 newnode->next = (NODE *)NULL;
81 for (tmp = fplist; tmp != (NODE *)NULL; tmp = tmp->next)
97 newnode->next = curptr->next;
98 curptr->next = newnode;
108 for (prev = cur = fplist; cur != (NODE *)NULL; cur = cur->next) {
111 cur = fplist = cur->next;
113 prev->next = cur->next;
114 cur = prev->next
[all...]
/illumos-gate/usr/src/lib/gss_mechs/mech_krb5/et/
H A Derror_table.h17 /*@dependent@*//*@null@*/ struct et_list *next; member in struct:et_list
22 /*@only@*//*@null@*/ struct dynamic_et_list *next; member in struct:dynamic_et_list
/illumos-gate/usr/src/lib/libfru/libfru/
H A DParser.h52 PathDef *next; member in struct:PathDef
54 ~PathDef() { delete next; }
/illumos-gate/usr/src/cmd/mdb/common/modules/genunix/
H A Dlog.c39 mblk_t next; local
76 if (mdb_vread(&next, sizeof (next), addr) == -1) {
81 if (mdb_vread(&lctl, sizeof (lctl), (uintptr_t)next.b_rptr) == -1) {
82 mdb_warn("failed to read log_ctl_t at %p", next.b_rptr);
86 if (mdb_vread(&cont, sizeof (cont), (uintptr_t)next.b_cont) == -1) {
87 mdb_warn("failed to read msgb structure at %p", next.b_cont);
97 mdb_printf("%Y %?p ", lctl.ttime, next.b_rptr);
/illumos-gate/usr/src/cmd/stat/common/
H A Ddsr.h43 struct list_of_disks *next; /* link to next one */ member in struct:list_of_disks
54 struct mnt_info *next; member in struct:mnt_info
/illumos-gate/usr/src/lib/libast/common/vmalloc/
H A Dvmclose.c41 Seg_t *seg, *vmseg, *next; local
64 for(last = Vmheap, v = last->next; v; last = v, v = v->next)
66 { last->next = v->next;
73 for(seg = vd->seg; seg; seg = next)
74 { next = seg->next;
/illumos-gate/usr/src/cmd/krb5/krb5kdc/
H A Dreplay.c40 struct _krb5_kdc_replay_ent *next; member in struct:_krb5_kdc_replay_ent
86 if (root_ptr.next) {
87 for (last = &root_ptr, eptr = root_ptr.next;
89 eptr = eptr->next) {
107 last->next = eptr->next;
153 eptr->next = root_ptr.next;
154 root_ptr.next = eptr;
164 if (root_ptr.next) {
[all...]

Completed in 88 milliseconds

1234567891011>>