Home
last modified time | relevance | path

Searched full:best (Results 1 – 25 of 830) sorted by relevance

12345678910>>...34

/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()
147 /* Are we inside the best run of 0x00's? */ in inet_ntop6()
148 if (best.base != -1 && i >= best.base && in inet_ntop6()
[all …]
/illumos-gate/usr/src/lib/libxcurses2/src/libc/xcurses/
H A Dmvcur.c117 * row() adds the best sequence for moving the cursor from orow
126 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()
172 * simp_col() adds the best simple sequence for getting from oldcol
181 struct Sequence seqA, seqB, *best, *try; in simp_col() local
189 best = &seqA; in simp_col()
[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()
210 /* Are we inside the best run of 0x00's? */ in inet_cidr_ntop_ipv6()
[all …]
/illumos-gate/usr/src/lib/libxcurses/src/libc/xcurses/
H A Dmvcur.c116 * row() adds the best sequence for moving the cursor from orow
127 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);
173 * simp_col() adds the best simple sequence for getting from oldcol
184 struct Sequence seqA, seqB, *best, *try; local
192 best = &seqA;
[all …]
/illumos-gate/usr/src/contrib/ast/src/lib/libast/regex/
H A Dregnexec.c119 #define BEST 3 /* an unbeatable parse was found */ macro
387 …tdout, "AHA better old ");for (i = 0; i <= env->nsub; i++)showmatch(&env->best[i]);sfprintf(sfstdo… in _better()
397 #define follow(e,r,c,s) ((r)->next?parse(e,(r)->next,c,s):(c)?parse(e,c,0,s):BEST)
422 case BEST: in parserep()
424 return BEST; in parserep()
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()
458 case BEST: in parserep()
459 return BEST; in parserep()
465 return BEST; in parserep()
[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()
796 /* Are we inside the best run of 0x00's? */ in kinet_ntop6()
797 if (best.base != -1 && i >= best.base && 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/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/cmd/sgs/yacc/common/
H A Dy3.c202 int i, j, k, best, count, cbest, times; in go2out() local
208 /* find the best one to make default */ in go2out()
209 best = -1; in go2out()
214 if (tystate[j] == best) in go2out()
223 best = cbest; in go2out()
228 /* best is now the default entry */ in go2out()
231 if (tystate[j] != 0 && tystate[j] != best) { in go2out()
240 (void) fprintf(ftemp, "%d\n", best); in go2out()
355 /* find the best choice for lastred */ in wract()
/illumos-gate/usr/src/cmd/sgs/rtld/common/
H A Dcap.c109 * select the best candidate from these variants. However, we've come in compare()
112 * file is the best, we select neither, and diagnose this suspicious in compare()
1318 * bestcapset is the presently available 'best' capabilities group, and
1327 * with a CA_SUNW_PLAT capability, and the best symbol is, then retain in is_sym_the_best()
1328 * the best capabilities group. If the new symbol is associated with a in is_sym_the_best()
1329 * CA_SUNW_PLAT capability, and the best symbol isn't, then the new in is_sym_the_best()
1340 * associated with a CA_SUNW_MACH capability, and the best symbol is, in is_sym_the_best()
1341 * then retain the best capabilities group. If the new symbol is in is_sym_the_best()
1342 * associated with a CA_SUNW_MACH capability, and the best symbol isn't, in is_sym_the_best()
1352 * Check the hardware capabilities. If the best symbols CA_SUNW_HW_3 in is_sym_the_best()
[all …]
/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/test/zfs-tests/tests/functional/mmp/
H A Dmmp_on_off.ksh29 # 4. Find the current "best" uberblock
31 # 6. Find the current "best" uberblock
35 # 10. Find the current "best" uberblock
H A Dmmp_on_thread.ksh28 # 3. Find the current "best" uberblock
30 # 5. Find the current "best" uberblock
/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.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 …]
/illumos-gate/usr/src/man/man1/
H A Ddpost.130 \fB/usr/lib/font/devpost\fR produce the best and most efficient output. They
198 Use font files for device \fIname\fR as the best description of available
209 you can obtain the best possible looking output by issuing a command line such
234 should give the best results.
H A Doptisa.119 the command will perform best on this machine. In this case, ``best'' is
/illumos-gate/usr/src/cmd/cmd-inet/sbin/dhcpagent/
H A Drequest.c137 * if so, chooses the best one, sends a REQUEST to the
174 * select the best OFFER; all others pitched. in dhcp_requesting()
193 * ugh. the best we can do at this point is in dhcp_requesting()
529 * select_best(): selects the best offer from a list of IPv4 OFFER packets or
533 * output: PKT_LIST *: the best packet, or NULL if none are acceptable
540 PKT_LIST *next, *best = NULL; in select_best() local
544 * pick out the best offer. point system. in select_best()
577 best = current; in select_best()
583 best = current; in select_best()
587 if (best != NULL) { in select_best()
[all …]
/illumos-gate/usr/src/cmd/intrd/
H A Dintrd.pl639 # a delta and determining the best possible assignment of interrupts to CPUs.
656 # be between 0 (best) and 1 (major bad). goodness is determined by evaluating
665 # then we return best-case, since what's to complain about?
1060 # find_goal() and its helper do_find_goal() are used to find the best
1065 # identified as part of the set of interrupts which best meet the goal.
1069 # The best fit is determined by performing a depth-first search. do_find_goal
1075 # 1) What is the best goal-fit if I include ivecs[index]?
1076 # 2) What is the best goal-fit if I exclude ivecs[index]?
1082 # It then compares the two results, decide which one best meets the goals,
1083 # and returns the result. The return value is the best-fit's interrupt load,
[all …]
/illumos-gate/usr/src/man/man4d/
H A Daudio.4d35 the best approximation of an input signal, the highest possible sampling
124 After mixing, conversion is made to the best possible Codec format. The
126 the encoding format that best meets their needs.
/illumos-gate/usr/src/man/man3malloc/
H A Dumem_alloc.3malloc191 \fB\fBallocator\fR=\fBbest\fR\fR
206 Set the underlying allocation strategy. The \fBbest\fR fit strategy tells
208 strategy approximates the best fit strategy in constant cpu time. The
/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
/illumos-gate/usr/src/test/nvme-tests/tests/libnvme/
H A Ddevice-reset.c46 * best 4 KiB namespace format we can that has no metadata. If that doesn't
47 * exist, use the remaining best that we can support.
/illumos-gate/usr/src/lib/libzutil/common/
H A Dzutil_import.c46 * examined every device, we pick the best label txg config for each toplevel
211 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()
463 * start by picking the best config for each toplevel vdev. Once that's done,
[all …]
/illumos-gate/usr/src/man/man3c/
H A Ddirectio.3c126 Small sequential I/O generally performs best with \fBDIRECTIO_OFF\fR.
129 Large sequential I/O generally performs best with \fBDIRECTIO_ON\fR, except

12345678910>>...34