usr/src/boot/common/gfx_fb.c

419

uint32_t color, best, dist, k;

usr/src/boot/common/gfx_fb.c

423

best = 255 * 255 * 255;

usr/src/boot/common/gfx_fb.c

436

if (dist < best) {

usr/src/boot/common/gfx_fb.c

438

best = dist;

usr/src/boot/common/module.c

1036

uchar_t *cp, *recptr, *bufend, *best;

usr/src/boot/common/module.c

1051

best = cp = NULL;

usr/src/boot/common/module.c

1076

best = cp;

usr/src/boot/common/module.c

1090

else if (best)

usr/src/boot/common/module.c

1091

result = file_lookup(mdp->d_path, (char *)best, blen, NULL);

usr/src/boot/common/module.c

858

struct kernel_module *mp, *best;

usr/src/boot/common/module.c

869

best = NULL;

usr/src/boot/common/module.c

881

best = mp;

usr/src/boot/common/module.c

886

return (best);

usr/src/boot/common/part.c

1016

best = entry;

usr/src/boot/common/part.c

1019

if (best != NULL) {

usr/src/boot/common/part.c

1020

memcpy(part, &best->part, sizeof (*part));

usr/src/boot/common/part.c

970

struct pentry *entry, *best;

usr/src/boot/common/part.c

976

best = NULL;

usr/src/cmd/cmd-inet/sbin/dhcpagent/request.c

540

PKT_LIST *next, *best = NULL;

usr/src/cmd/cmd-inet/sbin/dhcpagent/request.c

577

best = current;

usr/src/cmd/cmd-inet/sbin/dhcpagent/request.c

583

best = current;

usr/src/cmd/cmd-inet/sbin/dhcpagent/request.c

587

if (best != NULL) {

usr/src/cmd/cmd-inet/sbin/dhcpagent/request.c

589

remque(best);

usr/src/cmd/cmd-inet/sbin/dhcpagent/request.c

594

return (best);

usr/src/cmd/cmd-inet/usr.sbin/in.routed/if.c

496

struct interface **best)

usr/src/cmd/cmd-inet/usr.sbin/in.routed/if.c

498

struct interface *p_best = *best;

usr/src/cmd/cmd-inet/usr.sbin/in.routed/if.c

508

*best = NULL;

usr/src/cmd/cmd-inet/usr.sbin/in.routed/if.c

517

*best = NULL;

usr/src/cmd/cmd-inet/usr.sbin/in.routed/if.c

525

*best = ifp;

usr/src/cmd/cmd-inet/usr.sbin/in.routed/table.c

2906

struct interface *best = NULL;

usr/src/cmd/cmd-inet/usr.sbin/in.routed/table.c

2924

if (addr_on_ifp(addr, ifp, &best))

usr/src/cmd/cmd-inet/usr.sbin/in.routed/table.c

2928

return (best);

usr/src/cmd/mailx/optim.c

53

static char best(int src, int dest);

usr/src/cmd/mailx/optim.c

816

n = best(state, *cp);

usr/src/cmd/nvmeadm/nvmeadm_nsmgmt.c

231

const nvme_nvm_lba_fmt_t *best = NULL;

usr/src/cmd/nvmeadm/nvmeadm_nsmgmt.c

251

best = fmt;

usr/src/cmd/nvmeadm/nvmeadm_nsmgmt.c

255

if (best == NULL) {

usr/src/cmd/nvmeadm/nvmeadm_nsmgmt.c

260

return (best);

usr/src/cmd/refer/hunt2.c

256

best = 0;

usr/src/cmd/refer/hunt2.c

258

if (coord[j] > best) best = coord[j];

usr/src/cmd/refer/hunt2.c

260

fprintf(stderr, "colevel %d best %d\n", colevel, best);

usr/src/cmd/refer/hunt2.c

262

reached = best;

usr/src/cmd/refer/hunt2.c

264

if (coord[j] == best) {

usr/src/cmd/refer/hunt2.c

40

int nf = 0, best = 0, nterm = 0, i, g, j;

usr/src/cmd/sgs/yacc/common/y3.c

202

int i, j, k, best, count, cbest, times;

usr/src/cmd/sgs/yacc/common/y3.c

209

best = -1;

usr/src/cmd/sgs/yacc/common/y3.c

214

if (tystate[j] == best)

usr/src/cmd/sgs/yacc/common/y3.c

223

best = cbest;

usr/src/cmd/sgs/yacc/common/y3.c

231

if (tystate[j] != 0 && tystate[j] != best) {

usr/src/cmd/sgs/yacc/common/y3.c

240

(void) fprintf(ftemp, "%d\n", best);

usr/src/common/ficl/emu/gfx_fb.c

631

uint32_t best, dist, k;

usr/src/common/ficl/emu/gfx_fb.c

635

best = 256 * 256 * 256;

usr/src/common/ficl/emu/gfx_fb.c

644

if (dist < best) {

usr/src/common/ficl/emu/gfx_fb.c

646

best = dist;

usr/src/common/ficl/tools.c

150

double best;

usr/src/common/ficl/tools.c

185

best = (double)nDepth/nWords;

usr/src/common/ficl/tools.c

190

avg, best, 100.0 * best / avg);

usr/src/lib/gss_mechs/mech_krb5/krb5/ccache/cc_retr.c

216

} fetched, best;

usr/src/lib/gss_mechs/mech_krb5/krb5/ccache/cc_retr.c

222

memset(&best, 0, sizeof (best));

usr/src/lib/gss_mechs/mech_krb5/krb5/ccache/cc_retr.c

245

else if (!have_creds || fetched.pref < best.pref) {

usr/src/lib/gss_mechs/mech_krb5/krb5/ccache/cc_retr.c

247

krb5_free_cred_contents (context, &best.creds);

usr/src/lib/gss_mechs/mech_krb5/krb5/ccache/cc_retr.c

250

best = fetched;

usr/src/lib/gss_mechs/mech_krb5/krb5/ccache/cc_retr.c

273

*creds = best.creds;

usr/src/lib/libc/port/inet/inet_ntop.c

107

struct { int base, len; } best, cur;

usr/src/lib/libc/port/inet/inet_ntop.c

119

best.base = -1;

usr/src/lib/libc/port/inet/inet_ntop.c

129

if (best.base == -1 || cur.len > best.len)

usr/src/lib/libc/port/inet/inet_ntop.c

130

best = cur;

usr/src/lib/libc/port/inet/inet_ntop.c

136

if (best.base == -1 || cur.len > best.len)

usr/src/lib/libc/port/inet/inet_ntop.c

137

best = cur;

usr/src/lib/libc/port/inet/inet_ntop.c

139

if (best.base != -1 && best.len < 2)

usr/src/lib/libc/port/inet/inet_ntop.c

140

best.base = -1;

usr/src/lib/libc/port/inet/inet_ntop.c

148

if (best.base != -1 && i >= best.base &&

usr/src/lib/libc/port/inet/inet_ntop.c

149

i < (best.base + best.len)) {

usr/src/lib/libc/port/inet/inet_ntop.c

150

if (i == best.base)

usr/src/lib/libc/port/inet/inet_ntop.c

158

if (i == 6 && best.base == 0 &&

usr/src/lib/libc/port/inet/inet_ntop.c

159

(best.len == 6 || (best.len == 5 && words[5] == 0xffff))) {

usr/src/lib/libc/port/inet/inet_ntop.c

168

if (best.base != -1 && (best.base + best.len) == (IN6ADDRSZ / INT16SZ))

usr/src/lib/libresolv2/common/inet/inet_cidr_ntop.c

163

struct { int base, len; } best, cur;

usr/src/lib/libresolv2/common/inet/inet_cidr_ntop.c

180

best.base = -1;

usr/src/lib/libresolv2/common/inet/inet_cidr_ntop.c

181

best.len = 0;

usr/src/lib/libresolv2/common/inet/inet_cidr_ntop.c

192

if (best.base == -1 || cur.len > best.len)

usr/src/lib/libresolv2/common/inet/inet_cidr_ntop.c

193

best = cur;

usr/src/lib/libresolv2/common/inet/inet_cidr_ntop.c

199

if (best.base == -1 || cur.len > best.len)

usr/src/lib/libresolv2/common/inet/inet_cidr_ntop.c

200

best = cur;

usr/src/lib/libresolv2/common/inet/inet_cidr_ntop.c

202

if (best.base != -1 && best.len < 2)

usr/src/lib/libresolv2/common/inet/inet_cidr_ntop.c

203

best.base = -1;

usr/src/lib/libresolv2/common/inet/inet_cidr_ntop.c

211

if (best.base != -1 && i >= best.base &&

usr/src/lib/libresolv2/common/inet/inet_cidr_ntop.c

212

i < (best.base + best.len)) {

usr/src/lib/libresolv2/common/inet/inet_cidr_ntop.c

213

if (i == best.base)

usr/src/lib/libresolv2/common/inet/inet_cidr_ntop.c

221

if (i == 6 && best.base == 0 && (best.len == 6 ||

usr/src/lib/libresolv2/common/inet/inet_cidr_ntop.c

222

(best.len == 7 && words[7] != 0x0001) ||

usr/src/lib/libresolv2/common/inet/inet_cidr_ntop.c

223

(best.len == 5 && words[5] == 0xffff))) {

usr/src/lib/libresolv2/common/inet/inet_cidr_ntop.c

244

if (best.base != -1 && (best.base + best.len) ==

usr/src/lib/libxcurses/src/libc/xcurses/mvcur.c

127

struct Sequence* best = &seqA;

usr/src/lib/libxcurses/src/libc/xcurses/mvcur.c

145

zero_seq(best);

usr/src/lib/libxcurses/src/libc/xcurses/mvcur.c

146

add_op(best, __MOVE_ROW, nrow, 0);

usr/src/lib/libxcurses/src/libc/xcurses/mvcur.c

151

Make_seq_best(best, try);

usr/src/lib/libxcurses/src/libc/xcurses/mvcur.c

156

Make_seq_best(best, try);

usr/src/lib/libxcurses/src/libc/xcurses/mvcur.c

158

add_seq(outseq, best);

usr/src/lib/libxcurses/src/libc/xcurses/mvcur.c

184

struct Sequence seqA, seqB, *best, *try;

usr/src/lib/libxcurses/src/libc/xcurses/mvcur.c

192

best = &seqA;

usr/src/lib/libxcurses/src/libc/xcurses/mvcur.c

233

zero_seq(best);

usr/src/lib/libxcurses/src/libc/xcurses/mvcur.c

234

add_op(best, dir->_tab, tabs, 0);

usr/src/lib/libxcurses/src/libc/xcurses/mvcur.c

235

add_seq(outseq, best);

usr/src/lib/libxcurses/src/libc/xcurses/mvcur.c

249

zero_seq(best);

usr/src/lib/libxcurses/src/libc/xcurses/mvcur.c

250

add_op(best, dir->_one, dist, 0);

usr/src/lib/libxcurses/src/libc/xcurses/mvcur.c

269

Make_seq_best(best, try);

usr/src/lib/libxcurses/src/libc/xcurses/mvcur.c

272

add_seq(outseq, best);

usr/src/lib/libxcurses/src/libc/xcurses/mvcur.c

288

struct Sequence* best = &seqA;

usr/src/lib/libxcurses/src/libc/xcurses/mvcur.c

296

zero_seq(best);

usr/src/lib/libxcurses/src/libc/xcurses/mvcur.c

297

add_op(best, __MOVE_COLUMN, ncol, 0);

usr/src/lib/libxcurses/src/libc/xcurses/mvcur.c

309

Make_seq_best(best, try);

usr/src/lib/libxcurses/src/libc/xcurses/mvcur.c

316

Make_seq_best(best, try);

usr/src/lib/libxcurses/src/libc/xcurses/mvcur.c

322

Make_seq_best(best, try);

usr/src/lib/libxcurses/src/libc/xcurses/mvcur.c

324

add_seq(outseq, best);

usr/src/lib/libxcurses/src/libc/xcurses/mvcur.c

379

struct Sequence* best = &seqA; /* best sequence so far */

usr/src/lib/libxcurses/src/libc/xcurses/mvcur.c

392

zero_seq(best);

usr/src/lib/libxcurses/src/libc/xcurses/mvcur.c

395

add_op(best, __MOVE_ROW_COLUMN, newrow, newcol);

usr/src/lib/libxcurses/src/libc/xcurses/mvcur.c

405

Make_seq_best(best, try);

usr/src/lib/libxcurses/src/libc/xcurses/mvcur.c

417

Make_seq_best(best, try);

usr/src/lib/libxcurses/src/libc/xcurses/mvcur.c

426

Make_seq_best(best, try);

usr/src/lib/libxcurses/src/libc/xcurses/mvcur.c

431

return __m_return_code("__m_mvcur", out_seq(best, putout));

usr/src/lib/libxcurses2/src/libc/xcurses/mvcur.c

126

struct Sequence *best = &seqA;

usr/src/lib/libxcurses2/src/libc/xcurses/mvcur.c

144

zero_seq(best);

usr/src/lib/libxcurses2/src/libc/xcurses/mvcur.c

145

add_op(best, __MOVE_ROW, nrow, 0);

usr/src/lib/libxcurses2/src/libc/xcurses/mvcur.c

150

Make_seq_best(best, try);

usr/src/lib/libxcurses2/src/libc/xcurses/mvcur.c

155

Make_seq_best(best, try);

usr/src/lib/libxcurses2/src/libc/xcurses/mvcur.c

157

add_seq(outseq, best);

usr/src/lib/libxcurses2/src/libc/xcurses/mvcur.c

181

struct Sequence seqA, seqB, *best, *try;

usr/src/lib/libxcurses2/src/libc/xcurses/mvcur.c

189

best = &seqA;

usr/src/lib/libxcurses2/src/libc/xcurses/mvcur.c

230

zero_seq(best);

usr/src/lib/libxcurses2/src/libc/xcurses/mvcur.c

231

add_op(best, dir->_tab, tabs, 0);

usr/src/lib/libxcurses2/src/libc/xcurses/mvcur.c

232

add_seq(outseq, best);

usr/src/lib/libxcurses2/src/libc/xcurses/mvcur.c

247

zero_seq(best);

usr/src/lib/libxcurses2/src/libc/xcurses/mvcur.c

248

add_op(best, dir->_one, dist, 0);

usr/src/lib/libxcurses2/src/libc/xcurses/mvcur.c

269

Make_seq_best(best, try);

usr/src/lib/libxcurses2/src/libc/xcurses/mvcur.c

272

add_seq(outseq, best);

usr/src/lib/libxcurses2/src/libc/xcurses/mvcur.c

286

struct Sequence *best = &seqA;

usr/src/lib/libxcurses2/src/libc/xcurses/mvcur.c

294

zero_seq(best);

usr/src/lib/libxcurses2/src/libc/xcurses/mvcur.c

295

add_op(best, __MOVE_COLUMN, ncol, 0);

usr/src/lib/libxcurses2/src/libc/xcurses/mvcur.c

307

Make_seq_best(best, try);

usr/src/lib/libxcurses2/src/libc/xcurses/mvcur.c

314

Make_seq_best(best, try);

usr/src/lib/libxcurses2/src/libc/xcurses/mvcur.c

320

Make_seq_best(best, try);

usr/src/lib/libxcurses2/src/libc/xcurses/mvcur.c

322

add_seq(outseq, best);

usr/src/lib/libxcurses2/src/libc/xcurses/mvcur.c

369

struct Sequence *best = &seqA; /* best sequence so far */

usr/src/lib/libxcurses2/src/libc/xcurses/mvcur.c

375

zero_seq(best);

usr/src/lib/libxcurses2/src/libc/xcurses/mvcur.c

378

add_op(best, __MOVE_ROW_COLUMN, newrow, newcol);

usr/src/lib/libxcurses2/src/libc/xcurses/mvcur.c

383

return (out_seq(best, putout));

usr/src/lib/libxcurses2/src/libc/xcurses/mvcur.c

393

Make_seq_best(best, try);

usr/src/lib/libxcurses2/src/libc/xcurses/mvcur.c

405

Make_seq_best(best, try);

usr/src/lib/libxcurses2/src/libc/xcurses/mvcur.c

414

Make_seq_best(best, try);

usr/src/lib/libxcurses2/src/libc/xcurses/mvcur.c

419

return (out_seq(best, putout));

usr/src/lib/libzutil/common/zutil_import.c

211

name_entry_t *ne, *best;

usr/src/lib/libzutil/common/zutil_import.c

241

best = NULL;

usr/src/lib/libzutil/common/zutil_import.c

248

best = ne;

usr/src/lib/libzutil/common/zutil_import.c

263

if (count > matched || best == NULL) {

usr/src/lib/libzutil/common/zutil_import.c

264

best = ne;

usr/src/lib/libzutil/common/zutil_import.c

270

if (best == NULL)

usr/src/lib/libzutil/common/zutil_import.c

273

if (nvlist_add_string(nv, ZPOOL_CONFIG_PATH, best->ne_name) != 0)

usr/src/lib/libzutil/common/zutil_import.c

276

if ((devid = devid_str_from_path(best->ne_name)) == NULL) {

usr/src/stand/lib/inet/dhcpv4.c

450

PKT_LIST *wk, *tk, *best;

usr/src/stand/lib/inet/dhcpv4.c

495

best = NULL;

usr/src/stand/lib/inet/dhcpv4.c

573

if (!best)

usr/src/stand/lib/inet/dhcpv4.c

574

best = wk;

usr/src/stand/lib/inet/dhcpv4.c

576

if (best->offset < wk->offset)

usr/src/stand/lib/inet/dhcpv4.c

577

best = wk;

usr/src/stand/lib/inet/dhcpv4.c

580

if (best) {

usr/src/stand/lib/inet/dhcpv4.c

582

printf("%s: Found best: points: %d\n", s_n, best->offset);

usr/src/stand/lib/inet/dhcpv4.c

584

remove_list(best, B_FALSE);

usr/src/stand/lib/inet/dhcpv4.c

590

return (best);

usr/src/tools/cscope-fast/cgrep.c

1163

(void) memmove(*b, best, bestlen);

usr/src/tools/cscope-fast/cgrep.c

201

(void) memmove(best, tmp, bestlen = _p-tmp); }

usr/src/tools/cscope-fast/cgrep.c

223

static uchar_t tmp[MAXLIT], best[MAXLIT];

usr/src/uts/common/disp/disp.c

2627

pri_t best = SHRT_MAX;

usr/src/uts/common/disp/disp.c

2647

if (score < best) {

usr/src/uts/common/disp/disp.c

2648

best = score;

usr/src/uts/common/disp/disp.c

2658

if (bestcpu != NULL && tpri > (best / 2))

usr/src/uts/common/dtrace/dtrace.c

8080

int len, rc, best = INT_MAX, nmatched = 0;

usr/src/uts/common/dtrace/dtrace.c

8110

(len = dtrace_hash_collisions(dtrace_bymod, &template)) < best) {

usr/src/uts/common/dtrace/dtrace.c

8111

best = len;

usr/src/uts/common/dtrace/dtrace.c

8116

(len = dtrace_hash_collisions(dtrace_byfunc, &template)) < best) {

usr/src/uts/common/dtrace/dtrace.c

8117

best = len;

usr/src/uts/common/dtrace/dtrace.c

8122

(len = dtrace_hash_collisions(dtrace_byname, &template)) < best) {

usr/src/uts/common/dtrace/dtrace.c

8123

best = len;

usr/src/uts/common/inet/ip/spd.c

1945

ipsec_find_policy_chain(ipsec_policy_t *best, ipsec_policy_t *chain,

usr/src/uts/common/inet/ip/spd.c

1950

int bpri = best ? best->ipsp_prio : 0;

usr/src/uts/common/inet/ip/spd.c

2005

best = p;

usr/src/uts/common/inet/ip/spd.c

2009

return (best);

usr/src/uts/common/inet/ip/spd.c

2021

ipsec_find_policy_head(ipsec_policy_t *best, ipsec_policy_head_t *head,

usr/src/uts/common/inet/ip/spd.c

2029

curbest = best;

usr/src/uts/common/inet/ip/spd.c

2063

if (curbest != best) {

usr/src/uts/common/inet/ip/spd.c

2067

if (best != NULL) {

usr/src/uts/common/inet/ip/spd.c

2068

IPPOL_REFRELE(best);

usr/src/uts/common/io/scsi/targets/st.c

8233

uchar_t best;

usr/src/uts/common/io/scsi/targets/st.c

8235

for (best = 0xff, ix = 0; ix < NDENSITIES; ix++) {

usr/src/uts/common/io/scsi/targets/st.c

8238

best = ix;

usr/src/uts/common/io/scsi/targets/st.c

8252

if (best < NDENSITIES) {

usr/src/uts/common/io/scsi/targets/st.c

8256

un->un_dp->densities[best]);

usr/src/uts/common/io/scsi/targets/st.c

8257

un->un_mspl->density = un->un_dp->densities[best];

usr/src/uts/common/rpc/rpc_subr.c

767

struct { int base, len; } best, cur;

usr/src/uts/common/rpc/rpc_subr.c

781

best.base = -1;

usr/src/uts/common/rpc/rpc_subr.c

792

if (best.base == -1 || cur.len > best.len)

usr/src/uts/common/rpc/rpc_subr.c

793

best = cur;

usr/src/uts/common/rpc/rpc_subr.c

799

if (best.base == -1 || cur.len > best.len)

usr/src/uts/common/rpc/rpc_subr.c

800

best = cur;

usr/src/uts/common/rpc/rpc_subr.c

803

if (best.base != -1 && best.len < 2)

usr/src/uts/common/rpc/rpc_subr.c

804

best.base = -1;

usr/src/uts/common/rpc/rpc_subr.c

812

if (best.base != -1 && i >= best.base &&

usr/src/uts/common/rpc/rpc_subr.c

813

i < (best.base + best.len)) {

usr/src/uts/common/rpc/rpc_subr.c

814

if (i == best.base)

usr/src/uts/common/rpc/rpc_subr.c

826

if (best.base != -1 && (best.base + best.len) == (IN6ADDRSZ / INT16SZ))

usr/src/uts/common/syscall/lgrpsys.c

590

lgrp_id_t best;

usr/src/uts/common/syscall/lgrpsys.c

636

best = best_lpl->lpl_lgrpid;

usr/src/uts/common/syscall/lgrpsys.c

637

if (affs[best] > affs[home] || (affs[best] == affs[home] &&

usr/src/uts/common/syscall/lgrpsys.c

638

best == lgrp))

usr/src/uts/i86pc/dboot/dboot_startkern.c

2001

uint64_t best;

usr/src/uts/i86pc/dboot/dboot_startkern.c

2018

best = (uint64_t)-size;

usr/src/uts/i86pc/dboot/dboot_startkern.c

2030

best = next_avail_addr;

usr/src/uts/i86pc/dboot/dboot_startkern.c

2037

if (start > next_avail_addr && start < best &&

usr/src/uts/i86pc/dboot/dboot_startkern.c

2039

best = RNDUP(start, align);

usr/src/uts/i86pc/dboot/dboot_startkern.c

2047

next_avail_addr = best + size;

usr/src/uts/i86pc/dboot/dboot_startkern.c

2054

(void) memset((void *)(uintptr_t)best, 0, size);

usr/src/uts/i86pc/dboot/dboot_startkern.c

2055

return ((void *)(uintptr_t)best);

usr/src/uts/sun4/io/trapstat.c

756

hrtime_t ts, best = INT64_MAX;

usr/src/uts/sun4/io/trapstat.c

764

if ((ts = rdtick() - ts) < best)

usr/src/uts/sun4/io/trapstat.c

765

best = ts;

usr/src/uts/sun4/io/trapstat.c

769

return (best);