Searched refs:next (Results 276 - 300 of 2472) sorted by relevance

<<11121314151617181920>>

/illumos-gate/usr/src/cmd/rcm_daemon/common/
H A Ddump_rcm.c60 struct dump_conf *next; member in struct:dump_conf
150 cache = cache->next;
452 for (ent = cache; ent != NULL; ent = ent->next) {
476 ent = ent->next;
487 ent = ent->next;
494 ent = ent->next;
508 ent = ent->next;
523 for (dc = cache; dc != NULL; dc = dc->next) {
538 ent->next = cache;
539 if (ent->next)
[all...]
/illumos-gate/usr/src/boot/lib/libz/
H A Dgzread.c159 state->x.next = state->out;
161 memcpy(state->x.next, strm->next_in, strm->avail_in);
171 On return, state->x.have and state->x.next point to the just decompressed
173 the next gzip stream or raw data, once state->x.have is depleted. Returns 0
213 state->x.next = strm->next_out - state->x.have;
246 state->x.next = state->out;
272 state->x.next += n;
335 memcpy(buf, state->x.next, n);
336 state->x.next += n;
411 return *(state->x.next)
[all...]
H A Dinfback.c93 static code *next; local
101 next = fixed;
102 lenfix = next;
104 inflate_table(LENS, state->lens, 288, &(next), &(bits), state->work);
109 distfix = next;
111 inflate_table(DISTS, state->lens, 32, &(next), &(bits), state->work);
132 next = strm->next_in; \
143 strm->next_in = next; \
161 have = in(in_desc, &next); \
163 next
258 z_const unsigned char FAR *next; /* next input */ local
[all...]
/illumos-gate/usr/src/lib/libdiskmgt/common/
H A Dinuse_mnt.c52 struct mntpnt_list *next; member in struct:mntpnt_list
113 listp = listp->next;
140 listp = listp->next;
152 listp = listp->next;
169 nextp = listp->next;
188 listp = listp->next;
250 prevp->next = currp;
253 currp->next = NULL;
304 prevp->next = currp;
307 currp->next
[all...]
/illumos-gate/usr/src/lib/librcm/
H A Dlibrcm_event.c164 struct door_result *next; member in struct:door_result
192 result->next = NULL;
204 while (tmp->next) {
205 tmp = tmp->next;
207 tmp->next = result;
224 tmp = tmp->next;
235 prev->next = tmp->next;
237 cook->results = tmp->next;
398 cookie->results = tmp->next;
[all...]
/illumos-gate/usr/src/lib/udapl/udapl_tavor/common/
H A Ddapl_provider.c196 g_dapl_provider_list.head->next = g_dapl_provider_list.tail;
224 g_dapl_provider_list.head = cur_node->next;
276 cur_node->next = next_node;
279 prev_node->next = cur_node;
310 for (cur_node = g_dapl_provider_list.head->next;
312 cur_node = cur_node->next) {
337 for (cur_node = g_dapl_provider_list.head->next;
339 cur_node = cur_node->next) {
342 next_node = cur_node->next;
344 prev_node->next
[all...]
/illumos-gate/usr/src/lib/libast/common/comp/
H A Dwaitpid.c91 struct zombie* next;
119 if (pp) pp->next = zp->next;
120 else zombies = zp->next;
191 zp->next = zombies;
/illumos-gate/usr/src/cmd/lvm/metassist/layout/
H A Dlayout_svm_util.c120 struct svm_snap_entry *next; member in struct:svm_snap_entry
237 for (listp = headp; listp != NULL && error == 0; listp = listp->next) {
429 for (iter = _disksets; iter != NULL; iter = iter->next) {
464 for (iter = _disksets; iter != NULL; iter = iter->next) {
491 for (iter = _disksets; iter != NULL; iter = iter->next) {
551 for (iter = _disksets; iter != NULL; iter = iter->next) {
618 for (iter = _disksets; iter != NULL; iter = iter->next) {
687 for (iter = _disksets; iter != NULL; iter = iter->next) {
786 iter = iter->next) {
853 iter = iter->next) {
1364 int next = 0; local
1426 int next = 0; local
1475 int next = 0; local
[all...]
/illumos-gate/usr/src/cmd/fm/fmadm/common/
H A Dfaulty.c162 struct name_list *next; member in struct:name_list
174 struct ari_list *next; member in struct:ari_list
178 struct uurec *next; member in struct:uurec
188 struct uurec_select *next; member in struct:uurec_select
202 struct host_id_list *next; member in struct:host_id_list
221 struct sr_list *next; member in struct:sr_list
227 struct resource_list *next; member in struct:resource_list
296 hostp = hostp->next;
306 hostp->next = host_list;
421 lp = lp->next;
[all...]
/illumos-gate/usr/src/uts/common/io/fibre-channel/fca/emlxs/
H A Demlxs_clock.c282 IOCBQ *next; local
325 next = (IOCBQ *)iocbq->next;
332 if (next == NULL) {
339 q_first = (uint8_t *)next;
341 prev->next = next;
344 iocbq->next = NULL;
356 ((IOCBQ *)tmo.q_last)->next =
368 iocbq->next
1330 IOCBQ *next; local
[all...]
/illumos-gate/usr/src/cmd/mandoc/
H A Dmdoc_term.c272 if (n->child->next->child != NULL)
275 n->child->next->child);
279 n = n->next;
301 n = n->next;
350 if (n->next != NULL && ! (n->next->flags & MDOC_LINE))
785 if (NULL != n->next &&
786 NULL != n->next->child &&
787 (MDOC_Bl == n->next->child->tok ||
788 MDOC_Bd == n->next
[all...]
H A Deqn_term.c56 (bp->type == EQN_PILE && (bp->prev || bp->next)) ||
81 child = child->next;
89 child = child->next;
104 child = child->next;
111 (bp->type == EQN_PILE && (bp->prev || bp->next)) ||
115 if (bp->parent->type == EQN_SUBEXPR && bp->next != NULL)
H A Dtbl.c113 tbl->first_row = rp->next;
116 rp->first = cp->next;
123 tbl->first_span = sp->next;
126 sp->first = dp->next;
154 span = tbl->current_span ? tbl->current_span->next
176 sp = sp->next;
/illumos-gate/usr/src/lib/gss_mechs/mech_krb5/profile/
H A Dprof_file.c90 for (d = g_shared_trees; d; d = d->next) { \
189 d->next = NULL;
251 for (data = g_shared_trees; data; data = data->next) {
298 data->next = g_shared_trees;
581 g_shared_trees = data->next;
583 prf_data_t prev, next; local
585 next = prev->next;
586 while (next) {
587 if (next
[all...]
/illumos-gate/usr/src/lib/libldap5/sources/ldap/util/
H A Dline64.c253 * str_getline - return the next "line" (minus newline) of input from a
270 str_getline( char **next )
276 if ( *next == NULL || **next == '\n' || **next == '\0' ) {
280 while ( **next == '#' ) { /* skip comment lines */
281 if (( *next = strchr( *next, '\n' )) == NULL ) {
284 (*next)++;
287 l = *next;
[all...]
/illumos-gate/usr/src/lib/libadm/common/
H A Dckitem.c50 static struct _choice_ *next(struct _choice_ *);
270 chp = chp->next;
289 chp = chp->next;
335 chp = chp->next;
418 base = base->next;
421 last->next = chp;
435 base = base->next;
438 chp->next = last->next;
439 last->next
551 next(struct _choice_ *chp) function
[all...]
/illumos-gate/usr/src/uts/sun4/os/
H A Dintr.c348 intr_vec_t *iv, *next, *prev; local
361 next = mcpu->intr_head[pil];
364 while (next != NULL) {
365 if (next == iv)
367 prev = next;
368 next = IV_GET_PIL_NEXT(next, cpu_id);
371 if (next != NULL) {
372 intr_vec_t *next_iv = IV_GET_PIL_NEXT(next, cpu_id);
460 new->next
[all...]
/illumos-gate/usr/src/cmd/logins/
H A Dlogins.c112 struct reqgrp *next; /* Next item in the list */ member in struct:reqgrp
119 struct reqlogin *next; /* Next item in the list */ member in struct:reqlogin
140 struct secgrp *next; /* Next item in the list */ member in struct:secgrp
268 struct grpmember *next; member in struct:grpmember
279 * to the member-name and a pointer to the next item in the
295 new->next = membershead;
325 for (pmem = membershead; !found && pmem; pmem = pmem->next) {
338 * pointer to the next item in the list. The list is ordered alpha-
358 * free-field (comment), and the next structure in the
616 psecgrp->next
1094 struct localpw *next; member in struct:localpw
1130 struct localpw *next, *cur; local
[all...]
/illumos-gate/usr/src/lib/libnisdb/
H A Ddb_index_entry_c.x39 % * via the 'next' pointer and form the hash bucket
69 db_index_entry* next;
86 % db_index_entry* next;
114 % index entries. These may be changed after the next call to 'lookup'
122 %/* Return the next entry in the bucket starting with this entry
126 %/* Return the next entry in the bucket. */
127 % db_index_entry* getnextentry() {return next;}
129 %/* Return the next entry in the 'next_result' chain. */
135 %/* Assign the given pointer as the next result after this entry. */
/illumos-gate/usr/src/lib/libnsl/rpc/
H A Drpcb_prot.c96 rpcblist_ptr next; local
107 * the case of freeing we must remember the next object
111 next = (*rp)->rpcb_next;
116 next_copy = next;
121 * but next itself survives.
165 rpcb_entry_list_ptr next; local
176 * the case of freeing we must remember the next object
180 next = (*rp)->rpcb_entry_next;
186 next_copy = next;
191 * but next itsel
[all...]
/illumos-gate/usr/src/lib/libpicltree/
H A Dptree_impl.h91 struct hash_elem *next; member in struct:hash_elem
108 struct prop_list *next; member in struct:prop_list
189 struct eventq *next; member in struct:eventq
204 struct eh_list *next; member in struct:eh_list
214 struct picld_plugin_reg_list *next; member in struct:picld_plugin_reg_list
221 struct picld_plinfo *next; member in struct:picld_plinfo
/illumos-gate/usr/src/cmd/power/
H A Dsysstat.c63 struct activity_data *next; member in struct:activity_data
78 struct diskinfo *next; member in struct:diskinfo
202 lastdisk->next = snip;
211 if (disk->next) {
212 disk = disk->next;
214 safe_zalloc((void **)&disk->next,
216 disk = disk->next;
217 disk->next = NULLDISK;
229 while (kscmp(disk->ks, comp->next->ks) > 0) {
230 comp = comp->next;
[all...]
/illumos-gate/usr/src/cmd/rcap/rcapd/
H A Drcapd_collection.c169 lcollection_t *next; local
173 next = lcol->lcol_next;
176 lcol = next;
230 lprocess_t *next; local
234 next = lpc->lpc_next;
237 lpc = next;
/illumos-gate/usr/src/cmd/geniconvtbl/
H A Ditmcomp.h88 struct _itmc_map_name_type *next; member in struct:_itmc_map_name_type
131 struct _itmc_obj *next; member in struct:_itmc_obj
153 struct _itmc_map *next; member in struct:_itmc_map
164 struct _itmc_ref_link *next; member in struct:_itmc_ref_link
176 struct _itmc_name *next; member in struct:_itmc_name
185 struct _itmc_ref *next; member in struct:_itmc_ref
/illumos-gate/usr/src/lib/libc/port/gen/
H A Dgettxt.c67 struct db_list *next; member in struct:db_list
73 struct db_cache *next; member in struct:db_cache
139 dbl = dbl->next;
144 dbc = dbc->next;
160 dbc->next = db_cache;
198 dbl->next = dbc->info;

Completed in 97 milliseconds

<<11121314151617181920>>