Searched refs:next (Results 576 - 600 of 1144) sorted by relevance

<<21222324252627282930>>

/osnet-11/usr/src/lib/nsswitch/files/common/
H A Dgetprofattr.c192 if (pa->next != NULL)
193 res = combine_attrs(at, pa->next, args, res, fl);
251 if (pa->next != NULL) {
/osnet-11/usr/src/lib/pkcs11/libpkcs11/common/
H A DmetaSessionManager.c341 sp->next = NULL;
346 ses_delay_freed.last->next = sp;
356 tmp = ses_delay_freed.first->next;
/osnet-11/usr/src/lib/storage/libg_fc/common/hdrs/
H A Dgfc.h153 struct al_rls *next; member in struct:al_rls
162 struct dlist *next; member in struct:dlist
196 struct hotplug_disk_list *next; member in struct:hotplug_disk_list
/osnet-11/usr/src/lib/sun_sas/common/
H A DSun_sasScsiInquiry.c148 hba_port_ptr = hba_port_ptr->next) {
180 hba_disco_port = hba_disco_port->next) {
213 mapping_ptr = mapping_ptr->next) {
H A DSun_sasScsiReadCapacity.c136 hba_port_ptr = hba_port_ptr->next) {
168 hba_disco_port = hba_disco_port->next) {
201 mapping_ptr = mapping_ptr->next) {
/osnet-11/usr/src/lib/libnsl/rpc/
H A Dsvc.c136 struct _svc_user_fd_node *next; member in struct:__anon2028
158 #define LIST_ISEMPTY(l) ((_svc_user_fd_node *) &(l.lnk) == l.lnk.next)
160 (l.lnk.previous = l.lnk.next = (_svc_user_fd_node *) &(l.lnk))
293 node = svc_userfds[fd].lnk.next;
307 _svc_user_fd_node *next = node->lnk.next; local
331 node = next;
366 node = svc_userfds[one_fd].lnk.next;
370 node = node->lnk.next;
397 one_node = svc_userfds[fd].lnk.next;
506 _svc_user_fd_node* next; local
[all...]
H A Dsvc_run.c125 static int svc_next_pending; /* next one to be processed */
169 static int svc_next_pollfd; /* next fd to processin svc_pollset */
189 svcxprt_list_t::next, svcxprt_ext_t::my_xlist,
447 * Get the next active file descriptor to process.
805 * select_next_pollfd() - Select the next active fd in svc_pollset.
853 xret = xlist->next;
855 xlist->next = xret->next;
856 xret->next = NULL;
892 xlist->next
[all...]
/osnet-11/usr/src/lib/storage/libg_fc/common/
H A Dmap.c117 struct impl_map_dev_prop *next; member in struct:impl_map_dev_prop
126 struct impl_map_dev *next; member in struct:impl_map_dev
294 * If it's found, continue to next path.
452 * adds a nwwn, pwwn entry to the next entry in wwn_list_found list
554 * wwn_list_p should point to the next
735 WWN_list_found *next = NULL; local
741 for (; *wwn_list_found != NULL; *wwn_list_found = next) {
742 next = (*wwn_list_found)->wwn_next;
751 WWN_list *next = NULL; local
758 for (; *wwn_list != NULL; *wwn_list = next) {
[all...]
/osnet-11/usr/src/lib/libdevinfo/
H A Ddevinfo.c527 DPRINTF((DI_TRACE, "next node on per driver list:"
531 if (DI_NODE(node)->next == (di_off_t)-1) {
538 if (DI_NODE(node)->next == NULL) {
543 return (DI_NODE(pa + DI_NODE(node)->next));
551 struct node_list *next; member in struct:node_list
562 *headp = (*headp)->next;
581 while (tmp->next)
582 tmp = tmp->next;
584 tmp->next = list;
601 while (list->next)
3057 struct di_prom_prop *next; /* form a linked list */ member in struct:di_prom_prop
[all...]
/osnet-11/usr/src/lib/krb5/kdb/
H A Dkdb5.c75 krb5_keylist_node *cur, *next; local
77 for (cur = mkey_list; cur != NULL; cur = next) {
78 next = cur->next;
141 temp = temp->next;
154 temp = temp->next;
166 temp = temp->next;
462 curr_elt = curr_elt->next;
472 prev_elt->next = *lib;
510 lib_list = lib->next; /* firs
880 krb5_tl_data *prev, *curr, *next; local
[all...]
/osnet-11/usr/src/lib/libldap4/ber/
H A Dencode.c29 #else /* next || vms */
31 #endif /* next || vms */
413 Seqorset *next; local
436 if ( (next = (*sos)->sos_next) == NULLSEQORSET ) {
511 next->sos_clen += (taglen + lenlen + len);
512 next->sos_ptr += (taglen + lenlen + len);
517 *sos = next;
600 case 't': /* tag for the next element */
/osnet-11/usr/src/lib/libldap5/sources/ldap/ber/
H A Dencode.c429 Seqorset *next; local
451 if ( (next = (*sos)->sos_next) == NULLSEQORSET ) {
527 next->sos_clen += (taglen + lenlen + len);
528 next->sos_ptr += (taglen + lenlen + len);
540 *sos = next;
629 case 't': /* tag for the next element */
/osnet-11/usr/src/lib/libfstyp/common/
H A Dlibfstyp.c68 struct fstyp_module *next; member in struct:fstyp_module
187 for (mp = h->modules; mp != NULL; mp = mp->next) {
346 for (mp = h->modules; mp != NULL; mp = mp->next) {
398 h->modules_tail->next = mp;
468 mp_next = mp->next;
/osnet-11/usr/src/grub/grub2/grub-core/disk/
H A Dpata.c55 struct grub_pata_device *next; member in struct:grub_pata_device
318 dev->next = NULL;
321 for (devp = &grub_pata_devices; *devp; devp = &(*devp)->next);
467 for (dev = grub_pata_devices; dev; dev = dev->next)
501 for (dev = grub_pata_devices; dev; dev = dev->next)
/osnet-11/usr/src/grub/grub2/grub-core/term/
H A Dterminfo.c189 data->next = terminfo_outputs;
201 ptr = &((struct grub_terminfo_output_state *) (*ptr)->data)->next)
205 *ptr = ((struct grub_terminfo_output_state *) (*ptr)->data)->next;
612 cur = ((struct grub_terminfo_output_state *) cur->data)->next)
676 cur = ((struct grub_terminfo_output_state *) cur->data)->next)
/osnet-11/usr/src/cmd/sendmail/db/btree/
H A Dbtree_auto.c24 fileid, meta_lsn, page_lsn, pgno, ptype, next)
34 db_pgno_t next;
55 + sizeof(next);
82 memcpy(bp, &next, sizeof(next));
83 bp += sizeof(next);
134 printf("\tnext: %lu\n", (u_long)argp->next);
174 memcpy(&argp->next, bp, sizeof(argp->next));
175 bp += sizeof(argp->next);
[all...]
/osnet-11/usr/src/cmd/hal/hald/
H A Ddevice_store.c224 for (iter = store->devices; iter != NULL; iter = iter->next) {
244 for (iter = store->devices; iter != NULL; iter = iter->next) {
290 for (iter = store->devices; iter != NULL; iter = iter->next) {
319 for (iter = store->devices; iter != NULL; iter = iter->next) {
349 for (iter = store->devices; iter != NULL; iter = iter->next) {
/osnet-11/usr/src/lib/libsldap/common/
H A Dns_reads.c422 ns_ldap_range_attr_t *attr, *next; local
429 for (attr = (*info)->range_attr; attr != NULL; attr = next) {
434 next = attr->next;
443 * machine to collect the next range of the attribute values.
450 * the attribute's range value for the next search. Either
455 * readily used in the attribute list for the next
506 * generate the "attribute type + option" for the next search:
537 attr->next = info->range_attr;
540 for (attr = info->range_attr; attr != NULL; attr = attr->next) {
1343 ns_ldap_range_attr_t *prev, *next; local
4366 ns_ldap_cookie_t *c, *next; local
5745 resync_str(char *str, char *next, char c) argument
5785 char *next; local
5810 char *next; local
5929 char *next; local
[all...]
/osnet-11/usr/src/grub/grub2/grub-core/kern/
H A Dmisc.c339 next word (or the end of string) and "reset" the needle. */
1161 struct grub_preboot *next; member in struct:grub_preboot
1173 for (cur = preboots_head; cur; cur = cur->next)
1222 for (cur = preboots_head; cur && cur->prio > prio; cur = cur->next);
1226 new_preboot->next = cur;
1232 new_preboot->next = 0;
1237 new_preboot->prev->next = new_preboot;
1249 if (preb->next)
1250 preb->next->prev = preb->prev;
1254 preb->prev->next
[all...]
/osnet-11/usr/src/grub/grub-0.97/netboot/
H A Dns8390.c491 unsigned char rstat, curr, next; local
506 next = inb(eth_nic_base+D8390_P0_BOUND)+1;
507 if (next >= eth_memsize) next = eth_rx_start;
512 if (curr == next) return(0);
529 pktoff = next << 8;
576 next = pkthdr.next; /* frame number of next packet */
577 if (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/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/udapl/udapl_tavor/tavor/
H A Ddapl_tavor_wr.c83 * any "unsignaled" completions to go directly to the next "signaled"
101 * the next entry in the container.
146 * can move on to the next container).
221 * next container (if there is one). Note: the only real
574 * If the container is empty, then there is no next entry. So just
579 * If the container is not empty, then find the next entry and return
586 * We don't need to calculate the "next" head pointer here
587 * because "head" should already point to the next entry on
609 dapls_tavor_wrid_list_hdr_t *prev, *next; local
617 next
1010 dapls_tavor_wrid_list_hdr_t *prev, *next; local
[all...]
/osnet-11/usr/src/lib/libresolv2/common/isc/
H A Dlogging.c181 for (lcl = lc->categories[i]; lcl != NULL; lcl = lcl->next)
262 for ( /* nothing */; lcl != NULL; lcl = lcl->next) {
353 for ( /* nothing */; lcl != NULL; lcl = lcl->next) {
477 lcl_next = lcl->next;
502 lcl->next = lc->categories[category];
521 next_lcl = lcl->next;
525 prev_lcl->next = next_lcl;
617 * be the next multiple.
/osnet-11/usr/src/lib/libfsmgt/common/
H A Dfs_dfstab.c44 struct dfstab_entry *next; member in struct:dfstab_entry
87 tailptr->next = dfstablist;
90 dfstablist = dfstablist->next;
138 tmp = headp->next;
154 headp->next = NULL;
568 * Retrives and returns the next entry in the list.
577 return (listptr->next);
683 dfstablist = dfstablist->next;

Completed in 137 milliseconds

<<21222324252627282930>>