Searched defs:next (Results 301 - 325 of 577) sorted by relevance

<<11121314151617181920>>

/osnet-11/usr/src/lib/libast/common/vmalloc/
H A Dvmdebug.c39 { Dbfile_t* next; member in struct:_dbfile_s
230 { for(last = NIL(Dbfile_t*), db = Dbfile; db; last = db, db = db->next)
237 db->next = Dbfile;
238 Dbfile = db->next;
242 { last->next = db->next;
243 db->next = Dbfile;
244 Dbfile = db->next;
288 for(seg = vd->seg; seg; seg = seg->next)
352 for(seg = vd->seg; seg; seg = seg->next)
[all...]
/osnet-11/usr/src/lib/libc/i386/sys/
H A Dptrace.c68 struct cstatus *next; /* linked list */ member in struct:cstatus
409 for (cp = childp; cp != NULLCP; cp = cp->next)
426 cstatus_t *next = cp->next; local
430 cp = next;
566 cp->next = childp;
590 childp = cp->next;
594 for (pcp = childp; pcp != NULLCP; pcp = pcp->next) {
595 if (pcp->next == cp) {
596 pcp->next
[all...]
/osnet-11/usr/src/lib/libc/port/gen/
H A Dhsearch.c119 struct node *next; member in struct:node
254 p = p -> next;
313 i = (i + c) % length; /* Advance to next slot */
435 q = &(p->next);
436 p = p->next;
455 *build(last, next, item)
457 NODE *next; /* Link to next list item */
469 p->next = next;
[all...]
H A Dnsparse.c63 struct cons_cell_v1 *next; member in struct:cons_cell_v1
68 struct cons_cell *next; member in struct:cons_cell
167 lkq = &lkp->next;
218 /* p better be the next switch_err */
287 break; /* process next naming service */
361 lkq = &lkp->next;
404 /* p better be the next switch_err */
446 break; /* process next naming service */
594 * go ahead with the next line.
691 * go ahead with the next lin
[all...]
/osnet-11/usr/src/lib/libc/sparc/sys/
H A Dptrace.c68 struct cstatus *next; /* linked list */ member in struct:cstatus
417 for (cp = childp; cp != NULLCP; cp = cp->next)
434 cstatus_t *next = cp->next; local
438 cp = next;
574 cp->next = childp;
598 childp = cp->next;
602 for (pcp = childp; pcp != NULLCP; pcp = pcp->next) {
603 if (pcp->next == cp) {
604 pcp->next
[all...]
/osnet-11/usr/src/lib/libumem/common/
H A Denvvar.c722 const char *end, *next; local
736 for (end = value; *end != '\0'; value = next) {
739 next = end + 1; /* skip the comma */
741 next = end = value + strlen(value);
/osnet-11/usr/src/lib/libuutil/common/
H A Duu_avl.c69 uu_avl_pool_t *pp, *next, *prev; local
104 pp->uap_next = next = &uu_null_apool;
105 pp->uap_prev = prev = next->uap_prev;
106 next->uap_prev = pp;
212 uu_avl_t *ap, *next, *prev; local
237 next = &pp->uap_null_avl;
238 prev = UU_PTR_DECODE(next->ua_prev_enc);
239 ap->ua_next_enc = UU_PTR_ENCODE(next);
241 next->ua_prev_enc = UU_PTR_ENCODE(ap);
310 uu_avl_walk_t *next, *pre local
[all...]
H A Duu_list.c66 uu_list_pool_t *pp, *next, *prev; local
100 pp->ulp_next = next = &uu_null_lpool;
101 pp->ulp_prev = prev = next->ulp_prev;
102 next->ulp_prev = pp;
182 uu_list_t *lp, *next, *prev; local
219 next = &pp->ulp_null_list;
220 prev = UU_PTR_DECODE(next->ul_prev_enc);
221 lp->ul_next_enc = UU_PTR_ENCODE(next);
223 next->ul_prev_enc = UU_PTR_ENCODE(lp);
264 uu_list_node_impl_t *next)
263 list_insert(uu_list_t *lp, uu_list_node_impl_t *np, uu_list_node_impl_t *prev, uu_list_node_impl_t *next) argument
399 uu_list_walk_t *next, *prev; local
430 uu_list_node_impl_t *next; local
[all...]
/osnet-11/usr/src/lib/libzfs/common/
H A Dlibzfs_graph.c284 zfs_vertex_t *current, *next; local
289 next = current->zv_next;
291 current = next;
/osnet-11/usr/src/lib/lvm/libmeta/common/
H A Dmeta_mh.c207 for (p = dnlp; (p != NULL); p = p->next)
221 for (p = dnlp, i = 0; (i < ndev); p = p->next, ++i) {
346 for (p = dnlp; (p != NULL); p = p->next)
360 for (p = dnlp, i = 0; (i < ndev); p = p->next, ++i) {
452 for (p = dslp; (p != NULL); p = p->next)
466 for (p = dslp, i = 0; (i < ndev); p = p->next, ++i) {
492 for (p = dslp, i = 0; (i < ndev); p = p->next, ++i) {
532 for (p = dnlp; (p != NULL); p = p->next) {
536 tailp = &dsp->next;
552 md_disk_status_list_t *next local
[all...]
/osnet-11/usr/src/lib/pkcs11/pkcs11_kms/common/
H A DkmsObject.h57 struct attribute_info *next; member in struct:attribute_info
77 struct object *next; member in struct:object
99 CK_ULONG next_result_index; /* next result object to return */
/osnet-11/usr/src/lib/pkcs11/pkcs11_softtoken/common/
H A DsoftSession.h87 struct session *next; /* points to next session on the list */ member in struct:session
/osnet-11/usr/src/lib/pkcs11/pkcs11_tpm/common/
H A Dobj_mgr.c399 CK_BYTE next[8]; local
428 (void) compute_next_token_obj_name(current, next);
431 next, 8);
585 CK_BYTE next[8]; local
612 (void) compute_next_token_obj_name(current, next);
614 next, 8);
776 CK_BYTE next[8]; local
803 (void) compute_next_token_obj_name(current, next);
805 next, 8);
1042 node = node->next;
1482 DL_NODE *next = NULL; local
1544 DL_NODE *next = NULL; local
1599 DL_NODE * next = NULL; local
1973 DL_NODE * next = NULL; local
2084 DL_NODE * next = NULL; local
2204 DL_NODE *next = NULL; local
[all...]
/osnet-11/usr/src/lib/libresolv2/common/irs/
H A Ddns_ho.c111 struct dns_res_target *next; member in struct:dns_res_target
201 ho->next = ho_next;
295 for (p = q; p; p = p->next) {
379 q->next = q2;
457 for (p = q; p; p = p->next) {
586 q->next = q2;
622 for (p = q; p; p = p->next) {
H A Dgetaddrinfo.c290 struct addrinfo *next; local
293 next = ai->ai_next;
298 ai = next;
/osnet-11/usr/src/lib/libresolv2/common/isc/
H A Dctl_clnt.c340 struct ctl_tran *this, *next; local
375 for (this = HEAD(ctx->tran); this != NULL; this = next) {
376 next = NEXT(this, link);
H A Dctl_srvr.c278 struct ctl_sess *this, *next; local
290 for (this = HEAD(ctx->sess); this != NULL; this = next) {
291 next = NEXT(this, link);
764 const struct ctl_verb *this = respctx, *next = this + 1; local
773 if (lastverb_p(next))
775 ctl_response(sess, sess->helpcode, this->help, respflags, next,
/osnet-11/usr/src/lib/libresolv2/common/resolv/
H A Dres_mkupdate.c578 /* next name */
948 struct valuelist * next; member in struct:valuelist
979 slp->next = servicelist;
993 slp_next = slp->next;
1021 slp->next = protolist;
1035 plp_next = plp->next;
1047 for (; lp != NULL; lp = lp->next)
1050 lp->prev->next = lp->next;
1051 if (lp->next)
[all...]
/osnet-11/usr/src/lib/libresolv2/include/
H A Dirs.h42 struct group * (*next) __P((struct irs_gr *)); member in struct:irs_gr
60 struct passwd * (*next) __P((struct irs_pw *)); member in struct:irs_pw
79 struct servent *(*next) __P((struct irs_sv *)); member in struct:irs_sv
95 struct protoent *(*next) __P((struct irs_pr *)); member in struct:irs_pr
113 struct hostent *(*next) __P((struct irs_ho *)); member in struct:irs_ho
131 struct nwent * (*next) __P((struct irs_nw *)); member in struct:irs_nw
145 int (*next) __P((struct irs_ng *, const char **, member in struct:irs_ng
/osnet-11/usr/src/lib/librstp/common/
H A Dport.h57 struct port_t* next; member in struct:port_t
/osnet-11/usr/src/lib/libsasl/lib/
H A Dauxprop.c59 struct proppool *next; member in struct:proppool
83 struct auxprop_plug_list *next; member in struct:auxprop_plug_list
196 pool = pool->next;
244 (*ctx)->mem_base = tmp->next;
361 * return value persists until next call to
372 * return value persists until next call to
395 goto next;
402 next:
440 ctx->mem_base = tmp->next;
617 ctx->mem_cur->next
[all...]
/osnet-11/usr/src/lib/libshell/common/sh/
H A Dnvtree.c77 while(fp=fp->next)
140 for(fp=np->nvfun;fp;fp=fp->next)
150 char *next,*last; local
172 if(!(next=nextdot(last)))
174 *next = 0;
176 *next = '.';
180 name = next+1;
210 next = 0;
211 else if(next= nextdot(last))
213 c = *next;
[all...]
H A Dsubshell.c52 struct Link *next; member in struct:Link
222 for(lp=sp->svar; lp; lp = lp->next)
256 for(lp=sp->svar; lp;lp = lp->next)
288 lp->next = subshell_data->svar;
314 lq = lp->next;
/osnet-11/usr/src/lib/libsldap/common/
H A Dns_connmgmt.h54 struct ns_conn_waiter *next, *prev; member in struct:ns_conn_waiter
101 struct ns_conn_user *next; /* next conn_user in the linked list */ member in struct:ns_conn_user
140 * management, waiting for the next user. It will be closed when
153 struct ns_conn_mt *next; /* next conn_mt in the linked list */ member in struct:ns_conn_mt
H A Dns_mapping.c132 ns_hash_t *next; local
135 next = p->h_next;
138 return (next);
149 ns_hash_t *next; local
155 next = config->hashTbl[i];
156 while (next != NULL) {
157 next = ns_free_hash(next);

Completed in 1553 milliseconds

<<11121314151617181920>>