Searched refs:next (Results 651 - 675 of 1144) sorted by relevance

<<21222324252627282930>>

/osnet-11/usr/src/grub/grub2/grub-core/kern/x86_64/
H A Ddl.c69 for (seg = mod->segment; seg; seg = seg->next)
/osnet-11/usr/src/grub/grub2/include/grub/
H A Data.h212 /* The next scsi device. */
213 struct grub_ata_dev *next; member in struct:grub_ata_dev
/osnet-11/usr/src/lib/cfgadm_plugins/scsi/common/
H A Dcfga_utils.c40 struct strlist *next; member in struct:strlist
672 dummy.next = NULL;
689 sp->next = NULL;
690 tailp->next = sp;
715 for (sp = dummy.next; sp != NULL; sp = sp->next) {
730 sp = dummy.next;
732 savep = sp->next;
1076 lp = olp->next;
/osnet-11/usr/src/cmd/sendmail/aux/
H A Dvacation.c278 struct entry *next; member in struct:entry
305 for (which = first; which != NULL; which = which->next) {
322 new_entry->next = NULL;
333 new_entry->next = NULL;
338 new_entry->when > curr->when; curr = curr->next)
341 last->next = new_entry;
343 new_entry->next = NULL;
346 new_entry->next = curr;
351 curr->prev->next = new_entry;
490 * of the next lin
[all...]
/osnet-11/usr/src/lib/libast/common/sfio/
H A Dsfnew.c120 f->endb = f->endr = f->endw = f->next = f->data;
H A Dsfsk.c58 f->next = f->endb = f->endr = f->endw = f->data;
/osnet-11/usr/src/lib/libc/sparc/gen/
H A Dstrncpy.s159 add %i4, 3, %i2 ! round up to next word boundary
160 and %i2, -4, %l1 ! pointer to next word boundary
246 ba .storebyte ! next word
263 ba .storehalfword ! next dword
272 bnz,a .shortcpy ! nope, next byte
279 bnz,a .padbyte2 ! if n != 0, next byte
/osnet-11/usr/src/lib/libc/sparcv9/gen/
H A Dmemset.s121 inc %o5 ! next byte
/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/nsswitch/ldap/common/
H A Dgetexecattr.c106 if (exec->next != (execstr_t *)NULL) {
107 (void) fprintf(stdout, " next: [%s]\n", exec->next->name);
109 _print_execstr(exec->next);
237 for (entry = be->result->entry; entry != NULL; entry = entry->next) {
/osnet-11/usr/src/lib/passwdutil/
H A Dpasswdutil.h82 struct attrlist_s *next; member in struct:attrlist_s
/osnet-11/usr/src/lib/pkcs11/libpkcs11/common/
H A DmetaObjectManager.c497 * in the list (object->next == NULL && object->prev == NULL)
501 if (object->next) {
502 *list_head = object->next;
503 object->next->prev = NULL;
508 } else if (object->next != NULL || object->prev != NULL) {
509 if (object->next) {
510 object->prev->next = object->next;
511 object->next->prev = object->prev;
514 object->prev->next
[all...]
/osnet-11/usr/src/lib/pkcs11/pkcs11_kernel/common/
H A DkernelSession.h89 struct session *next; /* points to next session on the list */ member in struct:session
H A DkernelUtil.c1064 objp = objp->next;
1080 objp = objp->next;
1083 sp = sp->next;
1113 objp1->next = NULL;
1117 objp1->next = new_tobj_list;
1135 /* Process next one */
1148 if (objp->next == NULL) {
1151 objp = objp->next;
1156 objp->next = pslot->sl_tobj_list;
1170 objp1 = objp->next;
[all...]
/osnet-11/usr/src/lib/pkcs11/pkcs11_kms/common/
H A DkmsSession.h90 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 Dtemplate.c439 node = node->next;
619 node = node->next;
693 node = node->next;
872 node = node->next;
900 node = node->next;
931 node = node->next;
1004 node = node->next;
1095 node = node->next;
1185 node = node->next;
/osnet-11/usr/src/lib/storage/libg_fc/common/hdrs/
H A Dg_state.h155 struct mplist_struct *next; member in struct:mplist_struct
/osnet-11/usr/src/lib/udapl/udapl_tavor/tavor/
H A Ddapl_tavor_hw.h330 * This segment contains the address of the next WQE to be executed and the
332 * next WQE. The "Ctrl" part of this segment contains the control
437 * This bit must be set in the next/ctrl field of all Receive WQEs
523 #define TAVOR_WQE_LINKNEXT(prev, ctrl, next) \
526 ((uint64_t *)(prev))[0] = HTOBE_64((next)); \
529 #define TAVOR_WQE_LINKFIRST(prev, next) \
531 ((uint64_t *)(prev))[0] = HTOBE_64((next)); \
/osnet-11/usr/src/lib/fm/topo/libtopo/common/
H A Dtopo_xml.c258 for (cn = xn->xmlChildrenNode; cn != NULL; cn = cn->next)
312 for (cn = xn->xmlChildrenNode; cn != NULL; cn = cn->next)
328 for (cn = xn->xmlChildrenNode; cn != NULL; cn = cn->next)
352 for (cn = xn->xmlChildrenNode; cn != NULL; cn = cn->next) {
371 for (cn = xn->xmlChildrenNode; cn != NULL; cn = cn->next) {
406 for (cn = xn->xmlChildrenNode; cn != NULL; cn = cn->next) {
425 for (cn = xn->xmlChildrenNode; cn != NULL; cn = cn->next) {
443 for (cn = xn->xmlChildrenNode; cn != NULL; cn = cn->next) {
461 for (cn = xn->xmlChildrenNode; cn != NULL; cn = cn->next) {
576 for (cn = pxn->xmlChildrenNode; cn != NULL; cn = cn->next) {
[all...]
/osnet-11/usr/src/lib/libnisdb/
H A Dldap_val.c1690 /* Find the next delimiter, or end-of-string */
1746 char *mstr, *next, *start = 0, *tmpstr; local
1789 * ahead and determine the start of the next formatting element.
1790 * If successful, 'next' will be the start of the fmt element
1791 * after the next one; we don't care about that, other than to
1795 * we don't know a priori if the first occurence of the next
1800 while ((next = scanMappingFormat(f, curf+1, nf, tmpstr, 0,
1802 char *tmp = next;
1812 tmpstr = next;
1820 if (next
[all...]
/osnet-11/usr/src/lib/libshell/common/sh/
H A Djobs.c58 struct jobsave *next; member in struct:jobsave
73 jp->next = job_savelist;
215 * return next on link list of jobsave free list
226 job_savelist = jp->next;
233 jp->next = bck.list;
253 for(csp=job.colist; csp; csp = csp->next)
277 for(csp=(struct cosh*)job.colist;csp;csp=csp->next)
1253 jpnext = jp->next;
1922 if(pid==0 && !jp->next)
1925 jp = jp->next;
[all...]
/osnet-11/usr/src/lib/libdevalloc/common/
H A Dlibdevalloc.c1842 for (nentry = dentry; nentry != NULL; nentry = nentry->next) {
1867 pentry->next = nentry;
1912 nentry->next = NULL;
1933 pentry->next = NULL;
2021 current = current->next) {
2037 current = current->next) {
2087 prev->next = current->next;
2092 if (prev->next) {
2095 * in the list. make the next entr
[all...]
/osnet-11/usr/src/lib/libnsl/rpc/
H A Dclnt_vc.c134 struct nb_reg_node *next; member in struct:nb_reg_node
149 #define LIST_ADD(l, node) (node->next = l->next, l = node)
150 #define LIST_EXTRACT(l, node) (node = l, l = l->next)
152 for (node = l; node != (struct nb_reg_node *)&l; node = node->next)
1800 n[i].next = &(n[i+1]);
1802 n[CHUNK_SIZE-1].next = (struct nb_reg_node *)&nb_free;
1845 if (node->next->ct == ct) {
1847 struct nb_reg_node *n = node->next;
1848 node->next
[all...]
/osnet-11/usr/src/cmd/perl/5.8.4/distrib/
H A Dregcomp.c681 regnode *scan = *scanp, *next; local
700 next = scan + NODE_SZ_STR(scan);
707 if (OP(n) == TAIL || n > next)
711 next = n + NODE_STEP_REGNODE;
726 next = n + NODE_SZ_STR(n);
730 stop = next - 1;
791 /* Follow the next-chain of the current node and optimize
817 next = regnext(scan);
820 if (OP(next) == code || code == IFTHEN || code == SUSPEND) {
840 next
2640 register char *next; local
4533 register regnode *next; local
[all...]
/osnet-11/usr/src/lib/libkmf/libkmf/common/
H A Dgeneralop.c225 node = node->next;
256 phead = phead->next;
387 handle->plugins->next = NULL;
391 while (n->next != NULL)
392 n = n->next;
393 n->next = (KMF_PLUGIN_LIST *)malloc(sizeof (KMF_PLUGIN_LIST));
394 if (n->next == NULL)
397 n->next->plugin = plugin;
398 n->next->next
418 KMF_PLUGIN_LIST *next = handle->plugins->next; local
2562 conf_entrylist_t *next; local
[all...]

Completed in 128 milliseconds

<<21222324252627282930>>