Searched defs:best (Results 1 - 25 of 28) sorted by relevance

12

/illumos-gate/usr/src/lib/libnsl/nss/
H A Dinet_ntop.c113 struct { int base, len; } best, cur; local
125 best.base = -1;
135 if (best.base == -1 || cur.len > best.len)
136 best = cur;
142 if (best.base == -1 || cur.len > best.len)
143 best = cur;
145 if (best.base != -1 && best
[all...]
/illumos-gate/usr/src/lib/libresolv2/common/inet/
H A Dinet_cidr_ntop.c163 struct { int base, len; } best, cur; local
180 best.base = -1;
181 best.len = 0;
192 if (best.base == -1 || cur.len > best.len)
193 best = cur;
199 if (best.base == -1 || cur.len > best.len)
200 best = cur;
202 if (best
[all...]
/illumos-gate/usr/src/cmd/refer/
H A Dhunt2.c42 int nf = 0, best = 0, nterm = 0, i, g, j; local
258 best = 0;
260 if (coord[j] > best) best = coord[j];
262 fprintf(stderr, "colevel %d best %d\n", colevel, best);
264 reached = best;
266 if (coord[j] == best) {
/illumos-gate/usr/src/uts/common/io/drm/
H A Ddrm_mm.c245 struct drm_mm_node *best; local
249 best = NULL;
270 best = entry;
276 return (best);
/illumos-gate/usr/src/lib/gss_mechs/mech_krb5/krb5/ccache/
H A Dcc_retr.c216 } fetched, best; local
222 memset(&best, 0, sizeof (best));
245 else if (!have_creds || fetched.pref < best.pref) {
247 krb5_free_cred_contents (context, &best.creds);
250 best = fetched;
273 *creds = best.creds;
/illumos-gate/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; local
381 struct Sequence* best = &seqA; /* best sequence so far */ local
[all...]
/illumos-gate/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; local
146 zero_seq(best);
147 add_op(best, __MOVE_ROW, nrow, 0);
152 Make_seq_best(best, try);
157 Make_seq_best(best, try);
159 add_seq(outseq, best);
174 * simp_col() adds the best simple sequence for getting from oldcol
183 struct Sequence seqA, seqB, *best, *try; local
191 best
288 struct Sequence *best = &seqA; local
371 struct Sequence *best = &seqA; /* best sequence so far */ local
[all...]
/illumos-gate/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.
192 * ugh. the best we can do at this point is
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; local
539 * pick out the best offer. point system.
572 best = current;
578 best = current;
582 if (best !
[all...]
/illumos-gate/usr/src/cmd/sgs/yacc/common/
H A Dy3.c206 int i, j, k, best, count, cbest, times; local
212 /* find the best one to make default */
213 best = -1;
218 if (tystate[j] == best)
227 best = cbest;
232 /* best is now the default entry */
235 if (tystate[j] != 0 && tystate[j] != best) {
244 (void) fprintf(ftemp, "%d\n", best);
358 /* find the best choice for lastred */
/illumos-gate/usr/src/lib/libpp/common/
H A Dppcontrol.c275 struct map* best; member in union:__anon3783
524 var.best = 0;
532 var.best = map;
538 if (map = var.best)
/illumos-gate/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...]
/illumos-gate/usr/src/common/ficl/
H A Dtools.c149 double best; local
180 /* Calc best possible performance with this size hash */
184 best = (double)nDepth/nWords;
189 avg, best, 100.0 * best / avg);
/illumos-gate/usr/src/cmd/mailx/
H A Doptim.c56 static char best(int src, int dest);
819 n = best(state, *cp);
827 * Return the best network separator for the given machine pair.
831 best(int src, int dest) function
/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; local
484 * Pass two. Pick out the best offer. Point system.
495 best = NULL;
573 if (!best)
574 best = wk;
576 if (best->offset < wk->offset)
577 best = wk;
580 if (best) {
[all...]
/illumos-gate/usr/src/boot/sys/boot/common/
H A Dmodule.c597 struct kernel_module *mp, *best; local
608 best = NULL;
620 best = mp;
625 return (best);
770 u_char *cp, *recptr, *bufend, *best; local
784 best = cp = NULL;
808 best = cp;
822 else if (best)
823 result = file_lookup(mdp->d_path, (char *)best, blen, NULL);
H A Dpart.c887 struct pentry *entry, *best; local
893 best = NULL;
933 best = entry;
936 if (best != NULL) {
937 memcpy(part, &best->part, sizeof(*part));
/illumos-gate/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)
498 struct interface *p_best = *best;
508 *best = NULL;
517 *best = NULL;
525 *best = ifp;
572 * If no interface is specified, look for the best fitting interface.
495 addr_on_ifp(in_addr_t addr, struct interface *ifp, struct interface **best) argument
H A Dtable.c436 * Prefer the best route if their metrics
2419 /* find the best alternative among the spares */
2443 /* find the best alternative among the spares */
2907 struct interface *best = NULL; local
2925 if (addr_on_ifp(addr, ifp, &best))
2928 /* No exact match found but return any best match found */
2929 return (best);
/illumos-gate/usr/src/uts/i86pc/dboot/
H A Ddboot_startkern.c1224 uint64_t best; local
1241 best = (uint64_t)-size;
1253 best = next_avail_addr;
1258 * if not is this address the best so far?
1260 if (start > next_avail_addr && start < best &&
1262 best = RNDUP(start, align);
1267 * end of a memory region. Return the best found memory address.
1270 next_avail_addr = best + size;
1277 (void) memset((void *)(uintptr_t)best, 0, size);
1278 return ((void *)(uintptr_t)best);
[all...]
/illumos-gate/usr/src/uts/common/syscall/
H A Dlgrpsys.c590 lgrp_id_t best; local
636 best = best_lpl->lpl_lgrpid;
637 if (affs[best] > affs[home] || (affs[best] == affs[home] &&
638 best == lgrp))
/illumos-gate/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; local
764 if ((ts = rdtick() - ts) < best)
765 best = ts;
769 return (best);
/illumos-gate/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; local
163 best = NULL;
170 best = ne;
185 if (count > matched || best == NULL) {
186 best = ne;
192 if (best == NULL)
195 if (nvlist_add_string(nv, ZPOOL_CONFIG_PATH, best->ne_name) != 0)
198 if ((devid = get_devid(best->ne_name)) == NULL) {
430 * start by picking the best confi
[all...]
/illumos-gate/usr/src/tools/cscope-fast/
H A Dcgrep.c204 (void) memmove(best, tmp, bestlen = _p-tmp); }
226 static uchar_t tmp[MAXLIT], best[MAXLIT]; variable
1168 (void) memmove(*b, best, bestlen);
/illumos-gate/usr/src/lib/libast/common/regex/
H A Dreglib.h536 Vector_t* bestpos; /* ditto for best match */
538 regmatch_t* best; /* ditto in best match yet */ member in struct:reglib_s
/illumos-gate/usr/src/cmd/cmd-inet/usr.lib/mdnsd/
H A DuDNS.c244 // the next best match server below
1372 // Note that we may not be doing the best thing if an error occurs after we've sent a second request
1415 // Note that we may not be doing the best thing if an error occurs after we've sent a second request
1732 int best = 0; local
1738 for (x = hostcount < srvcount ? hostcount : srvcount; x > 0 && x > best; x--)
1740 { best = x; besthi = hi; }
3788 // This seems bad to do with PCP, but best not change it now.

Completed in 112 milliseconds

12