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

1234567891011>>

/osnet-11/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...]
/osnet-11/usr/src/lib/libntfs/common/include/ntfs/
H A Dlist.h33 * sometimes we already know the next/prev entries and we can
38 struct list_head *next, *prev; member in struct:list_head
47 (ptr)->next = (ptr); (ptr)->prev = (ptr); \
54 * @next:
56 * This is only for internal list manipulation where we know the prev/next
60 struct list_head * prev, struct list_head * next)
62 next->prev = new;
63 new->next = next;
65 prev->next
59 __list_add(struct list_head * new, struct list_head * prev, struct list_head * next) argument
104 __list_del(struct list_head * prev, struct list_head * next) argument
[all...]
/osnet-11/usr/src/lib/libslp/javalib/com/sun/slp/
H A DServiceLocationEnumeration.java48 Object next() throws ServiceLocationException; method in interface:ServiceLocationEnumeration
/osnet-11/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...]
H A Dsfwrite.c38 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_
[all...]
/osnet-11/usr/src/grub/grub2/include/grub/util/
H A Dresolve.h25 struct grub_util_path_list *next; member in struct:grub_util_path_list
/osnet-11/usr/src/lib/libfru/libfru/
H A DParser.h52 PathDef *next; member in struct:PathDef
54 ~PathDef() { delete next; }
/osnet-11/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
/osnet-11/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;
/osnet-11/usr/src/lib/libresolv2/include/isc/
H A Dlist.h26 #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...]
/osnet-11/usr/src/cmd/powertop/common/
H A Dsuggestions.c48 * to the next.
96 new->next = NULL;
98 for (n = sugg; n != NULL; n = n->next) {
125 for (n = sugg; n->next != NULL; n = n->next)
128 n->next = new;
130 new->next = NULL;
136 new->next = sugg;
145 new->next = pos;
147 pos->prev->next
[all...]
/osnet-11/usr/src/grub/grub2/grub-core/kern/
H A Dlist.c27 item->next = *head;
36 for (p = head, q = *p; q; p = &(q->next), q = q->next)
39 *p = q->next;
63 for (p = head, q = *p; q; p = &(q->next), q = q->next)
83 nitem->next = q;
/osnet-11/usr/src/lib/sun_sas/common/
H A DSun_sasCloseAdapter.c57 } else if (global_hba_head->open_handles->next == NULL) {
70 global_hba_head->open_handles = open_handle_ptr->next;
73 for (open_handle_ptr = open_handle_ptr->next,
77 open_handle_ptr = open_handle_ptr->next) {
79 open_handle_prev_ptr->next =
80 open_handle_ptr->next;
86 open_handle_prev_ptr->next;
/osnet-11/usr/src/lib/libast/common/misc/
H A Dsetenviron.c47 static char** next; /* next free slot */ local
63 environ = next = p;
64 *++next = 0;
104 next = p;
107 else if (next == last)
113 next = last - INCREMENT;
131 next--;
143 p = next;
144 *++next
[all...]
/osnet-11/usr/src/lib/gss_mechs/mech_krb5/krb5/os/
H A Ddnssrv.c43 struct srv_dns_entry *next; local
45 next = p->next;
48 p = next;
155 srv->next = head;
161 * The next person has a higher priority (lower priorities
164 * There is no next entry (we're at the end)
166 for (entry = head; entry != NULL; entry = entry->next) {
167 if ((entry->next &&
168 entry->next
[all...]
/osnet-11/usr/src/grub/grub2/include/grub/
H A Dlist.h29 struct grub_list *next; member in struct:grub_list
36 #define FOR_LIST_ELEMENTS(var, list) for ((var) = (list); (var); (var) = (var)->next)
56 (GRUB_FIELD_MATCH (ptr, grub_list_t, next) ? \
60 (GRUB_FIELD_MATCH (*pptr, grub_list_t, next) ? \
65 struct grub_named_list *next; member in struct:grub_named_list
74 ((GRUB_FIELD_MATCH (ptr, grub_named_list_t, next) && \
79 ((GRUB_FIELD_MATCH (*pptr, grub_named_list_t, next) && \
88 struct grub_prio_list *next; member in struct:grub_prio_list
100 if ((item->prio & GRUB_PRIO_LIST_FLAG_ACTIVE) && (item->next))
101 item->next
[all...]
H A Denv_private.h41 struct grub_env_sorted_var *next; member in struct:grub_env_sorted_var
/osnet-11/usr/src/lib/libast/common/cdt/
H A Ddtwalk.c39 reg Void_t *obj, *next; local
46 next = dtnext(dt,obj);
49 obj = next;
/osnet-11/usr/src/lib/gss_mechs/mech_krb5/krb5/asn.1/
H A Dasn1buf.c43 * begins at base and continues to the octet immediately preceding next.
44 * If next == base or mybuf == NULL, then the asn1buf represents an empty
56 * next >= base
57 * next <= bound+2 (i.e. next should be able to step just past the bound,
59 * to being crossed by next.))
93 (*buf)->next = NULL;
101 buf->next = buf->base = code->data;
109 if (buf->next > buf->bound + 1) return ASN1_OVERRUN;
110 subbuf->base = subbuf->next
[all...]
/osnet-11/usr/src/lib/libmapmalloc/common/
H A Dtextmem.c63 struct block *next; member in struct:block
69 struct page *next; member in struct:page
117 for (page = memstart; page; page = page->next) {
118 for (block = page->block; block; block = block->next) {
137 page->next = memstart;
141 block->next = 0;
175 * Join block with next one if it is free
177 if (block->next && block->next->status == FREE) {
178 block->size += block->next
[all...]
/osnet-11/usr/src/lib/libresolv2/common/isc/
H A Dev_waits.c62 new->next = NULL;
64 wl->last->next = new;
93 ctx->waitDone.last->next = first;
118 prev = this, this = this->next)
122 prev->next = this->next;
124 wl->first = this->next;
137 prev = this, this = this->next)
141 prev->next = this->next;
[all...]
/osnet-11/usr/src/lib/libnsctl/common/
H A Dnsc_hash.h34 struct hash_node_s *next; member in struct:hash_node_s
/osnet-11/usr/src/lib/libeti/panel/common/
H A Dbottom.c65 obs -> next = panel -> obscured -> next;
66 panel->obscured = panel->obscured->next = obs;
69 obs -> next = panel -> obscured = obs;
/osnet-11/usr/src/common/mpi/
H A Dmpprime.c92 mp_digit next = 0; local
99 next = (next << CHAR_BIT) | (RANDOM() & UCHAR_MAX);
101 DIGIT(a, ix) = next;
/osnet-11/usr/src/lib/libxcurses2/src/libc/xcurses/
H A Dwdelch.c61 int next, width, y, x; local
66 next = __m_cc_next(w, y, x);
73 (void) memcpy(&w->_line[y][x], &w->_line[y][next],
74 (w->_maxx - next) * sizeof (**w->_line));

Completed in 36 milliseconds

1234567891011>>