Home
last modified time | relevance | path

Searched refs:best (Results 1 – 25 of 92) sorted by relevance

1234

/titanic_51/usr/src/lib/libnsl/nss/
H A Dinet_ntop.c113 struct { int base, len; } best, cur; in inet_ntop6() local
125 best.base = -1; in inet_ntop6()
135 if (best.base == -1 || cur.len > best.len) in inet_ntop6()
136 best = cur; in inet_ntop6()
142 if (best.base == -1 || cur.len > best.len) in inet_ntop6()
143 best = cur; in inet_ntop6()
145 if (best.base != -1 && best in inet_ntop6()
[all...]
/titanic_51/usr/src/lib/libresolv2/common/inet/
H A Dinet_cidr_ntop.c163 struct { int base, len; } best, cur; in inet_cidr_ntop_ipv6() local
180 best.base = -1; in inet_cidr_ntop_ipv6()
181 best.len = 0; in inet_cidr_ntop_ipv6()
192 if (best.base == -1 || cur.len > best.len) in inet_cidr_ntop_ipv6()
193 best = cur; in inet_cidr_ntop_ipv6()
199 if (best.base == -1 || cur.len > best.len) in inet_cidr_ntop_ipv6()
200 best = cur; in inet_cidr_ntop_ipv6()
202 if (best in inet_cidr_ntop_ipv6()
[all...]
/titanic_51/usr/src/lib/libxcurses2/src/libc/xcurses/
H A Dmvcur.c119 * row() adds the best sequence for moving the cursor from orow
128 struct Sequence *best = &seqA; in row() local
146 zero_seq(best); in row()
147 add_op(best, __MOVE_ROW, nrow, 0); in row()
152 Make_seq_best(best, try); in row()
157 Make_seq_best(best, try); in row()
159 add_seq(outseq, best); in row()
174 * simp_col() adds the best simple sequence for getting from oldcol
183 struct Sequence seqA, seqB, *best, *try; in simp_col() local
191 best in simp_col()
288 struct Sequence *best = &seqA; column() local
371 struct Sequence *best = &seqA; /* best sequence so far */ __m_mvcur() local
[all...]
/titanic_51/usr/src/lib/libxcurses/src/libc/xcurses/
H A Dmvcur.c118 * row() adds the best sequence for moving the cursor from orow
129 struct Sequence* best = &seqA; local
147 zero_seq(best);
148 add_op(best, __MOVE_ROW, nrow, 0);
153 Make_seq_best(best, try);
158 Make_seq_best(best, try);
160 add_seq(outseq, best);
175 * simp_col() adds the best simple sequence for getting from oldcol
186 struct Sequence seqA, seqB, *best, *try; local
194 best
290 struct Sequence* best = &seqA; global() local
381 struct Sequence* best = &seqA; /* best sequence so far */ global() variable
[all...]
/titanic_51/usr/src/uts/common/rpc/
H A Drpc_subr.c755 struct { int base, len; } best, cur; local
769 best.base = -1;
780 if (best.base == -1 || cur.len > best.len)
781 best = cur;
787 if (best.base == -1 || cur.len > best.len)
788 best = cur;
791 if (best.base != -1 && best
[all...]
/titanic_51/usr/src/contrib/ast/src/lib/libast/astsa/
H A Dstrmatch.c83 Group_t best; member
286 if (!pc && (!mp->best.next_s || (flags & STR_MAXIMAL) && mp->current.next_s > mp->best.next_s || !(flags & STR_MAXIMAL) && mp->current.next_s < mp->best.next_s)) in onematch()
287 mp->best = mp->current; in onematch()
334 if (!pc && (!mp->best.next_s || (flags & STR_MAXIMAL) && olds > mp->best.next_s || !(flags & STR_MAXIMAL) && olds < mp->best.next_s)) in onematch()
336 mp->best = mp->current; in onematch()
337 mp->best in onematch()
[all...]
/titanic_51/usr/src/contrib/ast/src/lib/libast/regex/
H A Dregnexec.c387 DEBUG_CODE(0x0040,{sfprintf(sfstdout, "AHA better old ");for (i = 0; i <= env->nsub; i++)showmatch(&env->best[i]);sfprintf(sfstdout, "\n new ");for (i = 0; i <= env->nsub; i++)showmatch(&env->match[i]);sfprintf(sfstdout, "\n");},{0;}); in _better()
444 DEBUG_TEST(0x0004,(sfprintf(sfstdout,"AHA#%04d 0x%04x PUSH %d (%z,%z)(%z,%z)(%z,%z) (%z,%z)(%z,%z)(%z,%z)\n", __LINE__, debug_flag, rex->re.group.number, env->best[0].rm_so, env->best[0].rm_eo, env->best[1].rm_so, env->best[1].rm_eo, env->best[2].rm_so, env->best[2].rm_eo, env->match[0].rm_so, env->match[0].rm_eo, env->match[1].rm_so, env->match[1].rm_eo, env->match[2].rm_so, env->match[2].rm_eo)),(0)); in parserep()
452 DEBUG_TEST(0x0004,(sfprintf(sfstdout,"AHA#%04d 0x%04x POP %d %d (%z,%z)(%z,%z)(%z,%z) (%z,%z)(%z,%z)(%z,%z)\n", __LINE__, debug_flag, rex->re.group.number, r, env->best[0].rm_so, env->best[0].rm_eo, env->best[ in parserep()
[all...]
/titanic_51/usr/src/lib/libast/common/regex/
H A Dregnexec.c388 …tdout, "AHA better old ");for (i = 0; i <= env->nsub; i++)showmatch(&env->best[i]);sfprintf(sfstdo… in _better()
445 …->re.group.number, env->best[0].rm_so, env->best[0].rm_eo, env->best[1].rm_so, env->best[1].rm_eo,… in parserep()
453 …e.group.number, r, env->best[0].rm_so, env->best[0].rm_eo, env->best[1].rm_so, env->best[1].rm_eo,… in parserep()
1041 …nv->best[0].rm_so, env->best[0].rm_eo, env->best[1].rm_so, env->best[1].rm_eo, env->best[2].rm_so,… in parse()
1042 if ((i = env->best[0].rm_eo) >= 0) in parse()
1062 env->best[0].rm_eo = n; in parse()
1063 memcpy(&env->best[1], &env->match[1], r * sizeof(regmatch_t)); in parse()
1072 …nv->best[0].rm_so, env->best[0].rm_eo, env->best[1].rm_so, env->best[1].rm_eo, env->best[2].rm_so,… in parse()
1367 env->best[0].rm_so = t - s - n; in parse()
1398 env->best[0].rm_so = t - s - n; in parse()
[all …]
/titanic_51/usr/src/cmd/refer/
H A Dhunt2.c42 int nf = 0, best = 0, nterm = 0, i, g, j; in doquery() local
258 best = 0; in doquery()
260 if (coord[j] > best) best = coord[j]; in doquery()
262 fprintf(stderr, "colevel %d best %d\n", colevel, best); in doquery()
264 reached = best; in doquery()
266 if (coord[j] == best) { in doquery()
/titanic_51/usr/src/lib/gss_mechs/mech_krb5/krb5/ccache/
H A Dcc_retr.c216 } fetched, best; in krb5_cc_retrieve_cred_seq() local
222 memset(&best, 0, sizeof (best)); in krb5_cc_retrieve_cred_seq()
245 else if (!have_creds || fetched.pref < best.pref) { in krb5_cc_retrieve_cred_seq()
247 krb5_free_cred_contents (context, &best.creds); in krb5_cc_retrieve_cred_seq()
250 best = fetched; in krb5_cc_retrieve_cred_seq()
273 *creds = best.creds; in krb5_cc_retrieve_cred_seq()
/titanic_51/usr/src/cmd/sendmail/cf/feature/
H A Dbestmx_is_local.m431 # If we are the best MX for a site, then we want to accept
34 # listed us as their best MX.
37 # lower cost method is to list all the expected best MX hosts
/titanic_51/usr/src/cmd/sgs/yacc/common/
H A Dy3.c206 int i, j, k, best, count, cbest, times; in go2out() local
212 /* find the best one to make default */ in go2out()
213 best = -1; in go2out()
218 if (tystate[j] == best) in go2out()
227 best = cbest; in go2out()
232 /* best is now the default entry */ in go2out()
235 if (tystate[j] != 0 && tystate[j] != best) { in go2out()
244 (void) fprintf(ftemp, "%d\n", best); in go2out()
358 /* find the best choice for lastred */ in wract()
/titanic_51/usr/src/stand/lib/inet/
H A Ddhcpv4.c428 * This function scans the list of OFFERS, and returns the "best" offer.
431 * The best:
450 PKT_LIST *wk, *tk, *best; in select_best() local
484 * Pass two. Pick out the best offer. Point system. in select_best()
495 best = NULL; in select_best()
573 if (!best) in select_best()
574 best = wk; in select_best()
576 if (best->offset < wk->offset) in select_best()
577 best = wk; in select_best()
580 if (best) { in select_best()
[all...]
/titanic_51/usr/src/boot/sys/boot/common/
H A Dmodule.c698 struct kernel_module *mp, *best; in file_findmodule() local
709 best = NULL; in file_findmodule()
721 best = mp; in file_findmodule()
726 return (best); in file_findmodule()
871 u_char *cp, *recptr, *bufend, *best; in mod_search_hints() local
885 best = cp = NULL; in mod_search_hints()
909 best = cp; in mod_search_hints()
923 else if (best) in mod_search_hints()
924 result = file_lookup(mdp->d_path, (char *)best, blen, NULL); in mod_search_hints()
H A Dpart.c922 struct pentry *entry, *best; in ptable_getbestpart() local
928 best = NULL; in ptable_getbestpart()
968 best = entry; in ptable_getbestpart()
971 if (best != NULL) { in ptable_getbestpart()
972 memcpy(part, &best->part, sizeof (*part)); in ptable_getbestpart()
/titanic_51/usr/src/cmd/cmd-inet/sbin/dhcpagent/
H A Drequest.c136 * if so, chooses the best one, sends a REQUEST to the
173 * select the best OFFER; all others pitched. in dhcp_requesting()
192 * ugh. the best we can do at this point is in dhcp_requesting()
524 * select_best(): selects the best offer from a list of IPv4 OFFER packets or
528 * output: PKT_LIST *: the best packet, or NULL if none are acceptable
535 PKT_LIST *next, *best = NULL; in select_best() local
539 * pick out the best offer. point system. in select_best()
572 best = current; in select_best()
578 best = current; in select_best()
582 if (best ! in select_best()
[all...]
/titanic_51/usr/src/lib/libzfs/common/
H A Dlibzfs_import.c39 * examined every device, we pick the best label txg config for each toplevel
133 name_entry_t *ne, *best; in fix_paths() local
163 best = NULL; in fix_paths()
170 best = ne; in fix_paths()
185 if (count > matched || best == NULL) { in fix_paths()
186 best = ne; in fix_paths()
192 if (best == NULL) in fix_paths()
195 if (nvlist_add_string(nv, ZPOOL_CONFIG_PATH, best->ne_name) != 0) in fix_paths()
198 if ((devid = get_devid(best->ne_name)) == NULL) { in fix_paths()
430 * start by picking the best confi
[all...]
/titanic_51/usr/src/common/ficl/
H A Dtools.c149 double best; in ficlPrimitiveHashSummary() local
180 /* Calc best possible performance with this size hash */ in ficlPrimitiveHashSummary()
184 best = (double)nDepth/nWords; in ficlPrimitiveHashSummary()
189 avg, best, 100.0 * best / avg); in ficlPrimitiveHashSummary()
/titanic_51/usr/src/uts/i86pc/dboot/
H A Ddboot_startkern.c1633 uint64_t best; in do_mem_alloc() local
1650 best = (uint64_t)-size; in do_mem_alloc()
1662 best = next_avail_addr; in do_mem_alloc()
1667 * if not is this address the best so far? in do_mem_alloc()
1669 if (start > next_avail_addr && start < best && in do_mem_alloc()
1671 best = RNDUP(start, align); in do_mem_alloc()
1676 * end of a memory region. Return the best found memory address. in do_mem_alloc()
1679 next_avail_addr = best + size; in do_mem_alloc()
1686 (void) memset((void *)(uintptr_t)best, 0, size); in do_mem_alloc()
1687 return ((void *)(uintptr_t)best); in do_mem_alloc()
[all...]
/titanic_51/usr/src/cmd/mailx/
H A Doptim.c56 static char best(int src, int dest);
819 n = best(state, *cp); in prefer()
827 * Return the best network separator for the given machine pair.
831 best(int src, int dest) in best() function
/titanic_51/usr/src/uts/common/syscall/
H A Dlgrpsys.c590 lgrp_id_t best; in lgrp_affinity_set_thread() local
636 best = best_lpl->lpl_lgrpid; in lgrp_affinity_set_thread()
637 if (affs[best] > affs[home] || (affs[best] == affs[home] && in lgrp_affinity_set_thread()
638 best == lgrp)) in lgrp_affinity_set_thread()
/titanic_51/usr/src/cmd/cmd-inet/usr.sbin/in.routed/
H A Dif.c491 * false and sets best if an ifp matches partially and is a better
492 * match than the previous one passed via best.
496 struct interface **best) in addr_on_ifp() argument
498 struct interface *p_best = *best; in addr_on_ifp()
508 *best = NULL; in addr_on_ifp()
517 *best = NULL; in addr_on_ifp()
525 *best = ifp; in addr_on_ifp()
572 * If no interface is specified, look for the best fitting interface.
/titanic_51/usr/src/contrib/ast/src/cmd/ksh93/
H A Dbuiltins.mm79 It is best to set the value of the environment variable
105 it is best to use
192 It really is best to use \f5nmake\fP because the 2 line Makefile above
274 The best thing to do is to include the header file \f5<shell.h>\fP.
334 For error messages it is best to use the \f5ast\fP library
372 For consistency with the rest of \f5ksh\fP, it is best
467 The best way to to allocate variable sized storage is
/titanic_51/usr/src/uts/sun4/io/
H A Dtrapstat.c748 * TLB's reach) nlaps times, taking the best time as our time (thereby
756 hrtime_t ts, best = INT64_MAX; in trapstat_probe_laps() local
764 if ((ts = rdtick() - ts) < best) in trapstat_probe_laps()
765 best = ts; in trapstat_probe_laps()
769 return (best); in trapstat_probe_laps()
/titanic_51/usr/src/cmd/loadkeys/type_4/
H A Dcanada58 # best place has already been used up with ^^.

1234