Home
last modified time | relevance | path

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

1234

/illumos-gate/usr/src/lib/libc/port/inet/
H A Dinet_ntop.c107 struct { int base, len; } best, cur; in inet_ntop6() local
119 best.base = -1; in inet_ntop6()
129 if (best.base == -1 || cur.len > best.len) in inet_ntop6()
130 best = cur; in inet_ntop6()
136 if (best.base == -1 || cur.len > best.len) in inet_ntop6()
137 best = cur; in inet_ntop6()
139 if (best.base != -1 && best.len < 2) in inet_ntop6()
140 best.base = -1; in inet_ntop6()
148 if (best.base != -1 && i >= best.base && in inet_ntop6()
149 i < (best.base + best.len)) { in inet_ntop6()
[all …]
/illumos-gate/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.base != -1 && best.len < 2) in inet_cidr_ntop_ipv6()
203 best.base = -1; in inet_cidr_ntop_ipv6()
211 if (best.base != -1 && i >= best.base && in inet_cidr_ntop_ipv6()
[all …]
/illumos-gate/usr/src/lib/libxcurses2/src/libc/xcurses/
H A Dmvcur.c126 struct Sequence *best = &seqA; in row() local
144 zero_seq(best); in row()
145 add_op(best, __MOVE_ROW, nrow, 0); in row()
150 Make_seq_best(best, try); in row()
155 Make_seq_best(best, try); in row()
157 add_seq(outseq, best); in row()
181 struct Sequence seqA, seqB, *best, *try; in simp_col() local
189 best = &seqA; in simp_col()
230 zero_seq(best); in simp_col()
231 add_op(best, dir->_tab, tabs, 0); in simp_col()
[all …]
/illumos-gate/usr/src/lib/libxcurses/src/libc/xcurses/
H A Dmvcur.c127 struct Sequence* best = &seqA; local
145 zero_seq(best);
146 add_op(best, __MOVE_ROW, nrow, 0);
151 Make_seq_best(best, try);
156 Make_seq_best(best, try);
158 add_seq(outseq, best);
184 struct Sequence seqA, seqB, *best, *try; local
192 best = &seqA;
233 zero_seq(best);
234 add_op(best, dir->_tab, tabs, 0);
[all …]
/illumos-gate/usr/src/uts/common/rpc/
H A Drpc_subr.c752 struct { int base, len; } best, cur; in kinet_ntop6() local
766 best.base = -1; in kinet_ntop6()
777 if (best.base == -1 || cur.len > best.len) in kinet_ntop6()
778 best = cur; in kinet_ntop6()
784 if (best.base == -1 || cur.len > best.len) in kinet_ntop6()
785 best = cur; in kinet_ntop6()
788 if (best.base != -1 && best.len < 2) in kinet_ntop6()
789 best.base = -1; in kinet_ntop6()
797 if (best.base != -1 && i >= best.base && in kinet_ntop6()
798 i < (best.base + best.len)) { in kinet_ntop6()
[all …]
/illumos-gate/usr/src/contrib/ast/src/lib/libast/astsa/
H A Dstrmatch.c83 Group_t best; member
286 …&& (!mp->best.next_s || (flags & STR_MAXIMAL) && mp->current.next_s > mp->best.next_s || !(flags &… 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_M… in onematch()
336 mp->best = mp->current; in onematch()
337 mp->best.next_s = olds; in onematch()
338 mp->best.groups = g; in onematch()
558 match.best.next_s = 0; in strgrpmatch()
560 if ((i = grpmatch(&match, 0, s, (char*)p, e, flags)) || match.best.next_s) in strgrpmatch()
563 match.current = match.best; in strgrpmatch()
/illumos-gate/usr/src/contrib/ast/src/lib/libast/regex/
H A Dregnexec.c387 …tdout, "AHA better old ");for (i = 0; i <= env->nsub; i++)showmatch(&env->best[i]);sfprintf(sfstdo… in _better()
444 …->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()
452 …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()
1040 …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()
1041 if ((i = env->best[0].rm_eo) >= 0) in parse()
1061 env->best[0].rm_eo = n; in parse()
1062 memcpy(&env->best[1], &env->match[1], r * sizeof(regmatch_t)); in parse()
1071 …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()
1366 env->best[0].rm_so = t - s - n; in parse()
1397 env->best[0].rm_so = t - s - n; in parse()
[all …]
/illumos-gate/usr/src/cmd/refer/
H A Dhunt2.c40 int nf = 0, best = 0, nterm = 0, i, g, j; in doquery() local
256 best = 0; in doquery()
258 if (coord[j] > best) best = coord[j]; in doquery()
260 fprintf(stderr, "colevel %d best %d\n", colevel, best); in doquery()
262 reached = best; in doquery()
264 if (coord[j] == best) { in doquery()
/illumos-gate/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()
/illumos-gate/usr/src/cmd/sgs/yacc/common/
H A Dy3.c202 int i, j, k, best, count, cbest, times; in go2out() local
209 best = -1; in go2out()
214 if (tystate[j] == best) in go2out()
223 best = cbest; in go2out()
231 if (tystate[j] != 0 && tystate[j] != best) { in go2out()
240 (void) fprintf(ftemp, "%d\n", best); in go2out()
/illumos-gate/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
/illumos-gate/usr/src/stand/lib/inet/
H A Ddhcpv4.c450 PKT_LIST *wk, *tk, *best; in select_best() local
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()
582 printf("%s: Found best: points: %d\n", s_n, best->offset); in select_best()
584 remove_list(best, B_FALSE); in select_best()
590 return (best); in select_best()
/illumos-gate/usr/src/boot/common/
H A Dmodule.c861 struct kernel_module *mp, *best; in file_findmodule() local
872 best = NULL; in file_findmodule()
884 best = mp; in file_findmodule()
889 return (best); in file_findmodule()
1039 uchar_t *cp, *recptr, *bufend, *best; in mod_search_hints() local
1054 best = cp = NULL; in mod_search_hints()
1079 best = cp; in mod_search_hints()
1093 else if (best) in mod_search_hints()
1094 result = file_lookup(mdp->d_path, (char *)best, blen, NULL); in mod_search_hints()
H A Dpart.c970 struct pentry *entry, *best; in ptable_getbestpart() local
976 best = NULL; in ptable_getbestpart()
1016 best = entry; in ptable_getbestpart()
1019 if (best != NULL) { in ptable_getbestpart()
1020 memcpy(part, &best->part, sizeof (*part)); in ptable_getbestpart()
/illumos-gate/usr/src/cmd/cmd-inet/sbin/dhcpagent/
H A Drequest.c539 PKT_LIST *next, *best = NULL; in select_best() local
576 best = current; in select_best()
582 best = current; in select_best()
586 if (best != NULL) { in select_best()
588 remque(best); in select_best()
593 return (best); in select_best()
/illumos-gate/usr/src/tools/smatch/src/smatch_data/
H A Dwine.ignored_macros3 * it's best to ignore them.
H A Dkernel.ignored_macros3 * it's best to ignore them.
/illumos-gate/usr/src/lib/libzutil/common/
H A Dzutil_import.c211 name_entry_t *ne, *best; in fix_paths() local
241 best = NULL; in fix_paths()
248 best = ne; in fix_paths()
263 if (count > matched || best == NULL) { in fix_paths()
264 best = ne; in fix_paths()
270 if (best == NULL) in fix_paths()
273 if (nvlist_add_string(nv, ZPOOL_CONFIG_PATH, best->ne_name) != 0) in fix_paths()
276 if ((devid = devid_str_from_path(best->ne_name)) == NULL) { in fix_paths()
/illumos-gate/usr/src/common/ficl/
H A Dtools.c150 double best; in ficlPrimitiveHashSummary() local
185 best = (double)nDepth/nWords; in ficlPrimitiveHashSummary()
190 avg, best, 100.0 * best / avg); in ficlPrimitiveHashSummary()
/illumos-gate/usr/src/common/ficl/emu/
H A Dgfx_fb.c631 uint32_t best, dist, k; in gfx_fb_putimage() local
635 best = 256 * 256 * 256; in gfx_fb_putimage()
644 if (dist < best) { in gfx_fb_putimage()
646 best = dist; in gfx_fb_putimage()
/illumos-gate/usr/src/cmd/mailx/
H A Doptim.c53 static char best(int src, int dest);
816 n = best(state, *cp); in prefer()
828 best(int src, int dest) in best() function
/illumos-gate/usr/src/uts/i86pc/dboot/
H A Ddboot_startkern.c1995 uint64_t best; in do_mem_alloc() local
2012 best = (uint64_t)-size; in do_mem_alloc()
2024 best = next_avail_addr; in do_mem_alloc()
2031 if (start > next_avail_addr && start < best && in do_mem_alloc()
2033 best = RNDUP(start, align); in do_mem_alloc()
2041 next_avail_addr = best + size; in do_mem_alloc()
2048 (void) memset((void *)(uintptr_t)best, 0, size); in do_mem_alloc()
2049 return ((void *)(uintptr_t)best); in do_mem_alloc()
/illumos-gate/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()
/illumos-gate/usr/src/cmd/cmd-inet/usr.sbin/in.routed/
H A Dif.c496 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()
/illumos-gate/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

1234