Searched refs:next (Results 901 - 925 of 1144) sorted by relevance

<<31323334353637383940>>

/osnet-11/usr/src/grub/grub2/util/
H A Dgrub-mkimagexx.c579 (*cblock)->next = xmalloc (sizeof (**cblock) + 2 * 0x1000);
580 memset ((*cblock)->next, 0, sizeof (**cblock) + 2 * 0x1000);
581 *cblock = (*cblock)->next;
757 for (lst = lst0; lst; lst = lst->next)
H A Dgrub-mkimage.c685 struct fixup_block_list *next; member in struct:fixup_block_list
710 struct grub_util_path_list *path_list, *p, *next; local
754 for (p = path_list; p; p = p->next)
812 for (p = path_list; p; p = p->next)
1626 next = path_list->next;
1629 path_list = next;
/osnet-11/usr/src/grub/grub-0.97/stage2/
H A Ddisk_io.c576 /* Get the information on next partition on the drive DRIVE.
599 /* Get next BSD partition in current PC slice. */
630 /* Search next valid BSD partition. */
656 /* Get next Solaris partition in current PC slice. */
688 /* Search next valid Solaris partition. */
706 /* Get next PC slice. Be careful of that this function may return
799 /* Get next BSD partition, if any. */
834 auto int next (void);
835 int next (void) function
883 while (next ())
[all...]
/osnet-11/usr/src/cmd/powertop/common/
H A Dpowertop.h223 struct suggestion *next; member in struct:suggestion
/osnet-11/usr/src/cmd/parted/
H A Dtable.c160 list = list->next;
/osnet-11/usr/src/cmd/perl/5.8.4/distrib/lib/Math/BigInt/t/
H A Dmbimbf.inc785 next if /^\s*(#|$)/; # skip comments and empty lines
788 $f = $_; next; # function
/osnet-11/usr/src/lib/libast/common/vmalloc/
H A Dvmtrace.c259 for(seg = vd->seg; seg; seg = seg->next)
/osnet-11/usr/src/lib/lvm/libmeta/common/
H A Dmeta_sp.c99 struct sp_ext_node *ext_next; /* next element */
536 for (namep = cached_list; namep != NULL; namep = namep->next)
557 for (namep = spnlp; namep != NULL; namep = namep->next) {
571 /* not on the same device, check the next one */
928 * find the next node whose offset is greater than
959 sp_ext_node_t *next; local
965 next = ext->ext_next;
967 ext = next;
1292 * alloc_len (see next paragraph) until it reaches
1297 * (see next paragrap
[all...]
/osnet-11/usr/src/lib/lvm/libpreen/common/
H A Dmdpreen.c238 for (p = nlp; (p != NULL); p = p->next) {
/osnet-11/usr/src/lib/nsswitch/compat/common/
H A Dcompat_common.c90 struct setofstrings *next; member in struct:setofstrings
104 nxt = cur->next;
126 new->next = *ssp;
138 for (cur = *ssp; cur != 0; cur = cur->next) {
460 /* Line too long for buffer; toss it and loop for next line */
1084 /* Skip the offending entry, get next */
/osnet-11/usr/src/lib/pam_modules/authtok_get/
H A Dauthtok_get.c287 al[0].next = NULL;
/osnet-11/usr/src/lib/pam_modules/authtok_store/
H A Dauthtok_store.c206 l.next = NULL;
/osnet-11/usr/src/lib/pkcs11/pkcs11_kms/common/
H A DkmsSession.c275 * accessing their "ses_RO" and "next" fields,
283 sp = sp->next;
/osnet-11/usr/src/lib/udapl/udapl_tavor/common/
H A Ddapl_osd.c377 g_dapl_provider_list.head = cur_node->next;
/osnet-11/usr/src/lib/libnisdb/
H A Dldap_op.c402 void *next; member in struct:__anon1943
886 for (lc = ldapCon; lc != 0; lc = lc->next) {
1063 for (tmp = ldapCon; tmp->next != 0;
1064 tmp = tmp->next);
1065 tmp->next = lc;
1095 for (lc = list; lc != 0; lc = lc->next) {
1211 for (tmp = ldapReferralCon; tmp->next != 0;
1212 tmp = tmp->next) {}
1213 tmp->next = lc;
1257 for (lc = ldapCon; lc != 0; lc = lc->next) {
[all...]
/osnet-11/usr/src/lib/efcode/engine/
H A Dforth.c1998 char *next, *dest, *here = ""; local
2003 next = strchr(here, env->input->separator);
2004 if (next) {
2005 len = next - here;
2006 while (*next == env->input->separator) next++;
2009 next = here + len;
2011 env->input->scanptr = next;
2399 new->next = env->catch_frame;
2404 env->catch_frame = new->next;
[all...]
/osnet-11/usr/src/grub/grub2/grub-core/lib/libgcrypt/cipher/
H A Dprimegen.c138 struct primepool_s *next;
159 for (n=0, item = primepool; item; item = item->next, n++)
168 for (i=0, item2 = primepool; item2; item2 = item2->next)
188 item->next = primepool;
205 for (item = primepool; item; item = item->next)
486 /* Get next permutation. */
532 /* Generate next prime candidate:
991 modified array with the next permutation of M elements. Note, that
1539 requirement for the next round is to update offset by N,
1782 the next roun
137 struct primepool_s *next; member in struct:primepool_s
[all...]
/osnet-11/usr/src/grub/grub2/grub-core/lib/libgcrypt-grub/cipher/
H A Dprimegen.c137 struct primepool_s *next;
158 for (n=0, item = primepool; item; item = item->next, n++)
167 for (i=0, item2 = primepool; item2; item2 = item2->next)
187 item->next = primepool;
204 for (item = primepool; item; item = item->next)
485 /* Get next permutation. */
531 /* Generate next prime candidate:
990 modified array with the next permutation of M elements. Note, that
1538 requirement for the next round is to update offset by N,
1781 the next roun
136 struct primepool_s *next; member in struct:primepool_s
[all...]
/osnet-11/usr/src/lib/libc/amd64/gen/
H A Dmemcpy.s1027 movdqa %xmm3,%xmm2 # store off xmm reg for use next iteration
1033 movdqa %xmm0,%xmm1 # store off xmm reg for use next iteration
1402 movdqa %xmm3,%xmm2 # store off xmm reg for use next iteration
1408 movdqa %xmm0,%xmm4 # store off xmm reg for use next iteration
1414 movdqa %xmm5,%xmm1 # store off xmm reg for use next iteration
1428 movdqa %xmm3,%xmm2 # save for use next concat
1483 movdqa %xmm3,%xmm2 # save for use next concat
1538 movdqa %xmm3,%xmm2 # save for use next concat
1593 movdqa %xmm3,%xmm2 # save for use next concat
1648 movdqa %xmm3,%xmm2 # save for use next conca
[all...]
/osnet-11/usr/src/lib/gss_mechs/mech_krb5/krb5/asn.1/
H A Dasn1_k_decode.c48 /* This is used for prefetch of next tag in sequence. */
123 * Get bare field. This also prefetches the next tag. The call to
136 * Checks that the next tag is the expected one; returns with an error
317 * does not prefetch the next tag.
1495 save = subbuf.next;
1499 end = subbuf.next;
2011 start = subbuf.next;
2017 end = subbuf.next;
2028 start = subbuf.next;
2034 end = subbuf.next;
[all...]
/osnet-11/usr/src/lib/gss_mechs/mech_krb5/krb5/krb/
H A Dget_in_tkt.c791 int i, req, next = 0; local
793 if (ktypes[req] == request.ktype[next]) {
794 next++;
797 for (i = next + 1; i < request.nktypes; i++)
804 t = request.ktype[next];
805 request.ktype[next] = request.ktype[i];
807 next++;
813 request.ktype[next] = 0;
814 request.nktypes = next;
1981 /* Return error code, or continue with next iteratio
[all...]
/osnet-11/usr/src/lib/libshell/common/sh/
H A Dname.c1142 for(; fp; fp=fp->next)
1234 * If <flags> & NV_ARRAY then follow array to next subscript
2512 struct optimize *next; member in struct:optimize
2523 for(;op && op->np==np; op=op->next)
2558 for(fp=np->nvfun; fp; fp = fp->next)
2571 opt_free = op->next;
2579 op->next = xp->next;
2580 xp->next = op;
2585 op->next
[all...]
/osnet-11/usr/src/lib/storage/liba5k/common/
H A Dmon.c942 for (dl1 = dl->multipath; dl1 != NULL; dl1 = dl1->next) {
1074 dl1 = dl1->next) {
1127 dl1 = dl1->next) {
1655 Box_list *next = NULL; local
1661 for (; *box_list != NULL; *box_list = next) {
1662 next = (*box_list)->box_next;
2651 ml = ml->next;
3728 seslist = seslist->next;
3753 seslist = seslist->next;
4992 dl = dlt->next;
5052 gfc_map_mp_t *next = NULL; local
[all...]
/osnet-11/usr/src/lib/libshell/common/edit/
H A Dedit.c1668 for(argv=av=(char**)ep->hlist,mp=ep->hfirst; mp;mp= mp->next)
1692 mp->next = mplast;
1706 for(mplast=0; l>=0 && (*av= (char*)mp); mplast=mp,mp=mp->next,av++)
1725 mplast->next = 0;
1730 mplast->next = mp;
1731 mplast->next = 0;
/osnet-11/usr/src/lib/libdladm/common/
H A Dlibdlaggr.c274 char *portstr = NULL, *next; local
368 for (next = portstr, i = 0; i < nports; i++) {
369 if ((status = read_port(handle, &next,
521 char *next; local
525 for (next = orig_portstr, j = 0; j < orig_nports; j++) {
530 status = read_port(handle, &next, &portid);

Completed in 344 milliseconds

<<31323334353637383940>>