Searched refs:best (Results 1 - 25 of 82) sorted by relevance

1234

/freebsd-10.1-release/lib/libc/inet/
H A Dinet_ntop.c116 struct { int base, len; } best, cur; local
128 best.base = -1;
129 best.len = 0;
140 if (best.base == -1 || cur.len > best.len)
141 best = cur;
147 if (best.base == -1 || cur.len > best.len)
148 best = cur;
150 if (best
[all...]
H A Dinet_cidr_ntop.c165 struct { int base, len; } best, cur; local
182 best.base = -1;
183 best.len = 0;
194 if (best.base == -1 || cur.len > best.len)
195 best = cur;
201 if (best.base == -1 || cur.len > best.len)
202 best = cur;
204 if (best
[all...]
/freebsd-10.1-release/sys/libkern/
H A Dinet_ntop.c103 struct { int base, len; } best, cur; local
117 best.base = -1;
118 best.len = 0;
129 if (best.base == -1 || cur.len > best.len)
130 best = cur;
136 if (best.base == -1 || cur.len > best.len)
137 best = cur;
139 if (best
[all...]
/freebsd-10.1-release/contrib/ntp/lib/isc/
H A Dinet_ntop.c124 struct { int base, len; } best, cur; local
136 best.base = -1;
138 best.len = cur.len = 0;
147 if (best.base == -1 || cur.len > best.len)
148 best = cur;
154 if (best.base == -1 || cur.len > best.len)
155 best = cur;
157 if (best
[all...]
/freebsd-10.1-release/contrib/ldns/compat/
H A Dinet_ntop.c124 struct { int base, len; } best, cur; local
137 best.base = -1;
138 best.len = 0;
149 if (best.base == -1 || cur.len > best.len)
150 best = cur;
156 if (best.base == -1 || cur.len > best.len)
157 best = cur;
159 if (best
[all...]
/freebsd-10.1-release/contrib/unbound/compat/
H A Dinet_ntop.c124 struct { int base, len; } best, cur; local
137 best.base = -1;
138 best.len = 0;
149 if (best.base == -1 || cur.len > best.len)
150 best = cur;
156 if (best.base == -1 || cur.len > best.len)
157 best = cur;
159 if (best
[all...]
/freebsd-10.1-release/contrib/tcpdump/missing/
H A Dinet_ntop.c117 } best, cur; local
129 best.base = -1;
141 if (best.base == -1 || cur.len > best.len)
142 best = cur;
146 if ((cur.base != -1) && (best.base == -1 || cur.len > best.len))
147 best = cur;
148 if (best.base != -1 && best
[all...]
/freebsd-10.1-release/crypto/openssh/openbsd-compat/
H A Dinet_ntop.c119 struct { int base, len; } best, cur; local
132 best.base = -1;
142 if (best.base == -1 || cur.len > best.len)
143 best = cur;
149 if (best.base == -1 || cur.len > best.len)
150 best = cur;
152 if (best.base != -1 && best
[all...]
/freebsd-10.1-release/contrib/apr/network_io/unix/
H A Dinet_ntop.c150 struct { int base, len; } best = {-1, 0}, cur = {-1, 0}; local
181 if (best.base == -1 || cur.len > best.len) {
182 best = cur;
192 if (best.base == -1 || cur.len > best.len) {
193 best = cur;
196 if (best.base != -1 && best.len < 2) {
197 best
[all...]
/freebsd-10.1-release/contrib/gcc/
H A Dtracer.c121 edge best = NULL; local
125 if (!best || better_p (e, best))
126 best = e;
127 if (!best || ignore_bb_p (best->dest))
129 if (best->probability <= probability_cutoff)
131 return best;
140 edge best = NULL; local
144 if (!best || better_
331 edge e, best = NULL; local
[all...]
H A Dbb-reorder.c297 /* Information about the best end (end after rotation) of the loop. */
302 /* The best edge is preferred when its destination is not visited yet
321 /* The best edge is preferred. */
483 /* The probability and frequency of the best edge. */
547 /* If the best destination has multiple predecessors, and can be
843 best edge (details are in function). The probability of edge E is PROB. The
844 frequency of the successor is FREQ. The current best probability is
845 BEST_PROB, the best frequency is BEST_FREQ.
855 /* The BEST_* values do not have to be best, but can be a bit smaller than
861 /* The edge has higher probability than the temporary best edg
930 edge e, best; local
[all...]
/freebsd-10.1-release/contrib/groff/src/devices/xditview/
H A Dfont.c58 DviFontSizeList *fs, *best = 0, *smallest = 0; local
67 for (best = f->sizes; best; best = best->next)
68 if (best->size == decipointsize)
69 return best;
70 best = (DviFontSizeList *) XtMalloc(sizeof *best);
71 best
[all...]
/freebsd-10.1-release/crypto/openssh/
H A Ddh.c149 int best, bestcount, which; local
161 best = bestcount = 0;
172 if ((dhg.size > wantbits && dhg.size < best) ||
173 (dhg.size > best && best < wantbits)) {
174 best = dhg.size;
177 if (dhg.size == best)
194 dhg.size != best ||
/freebsd-10.1-release/contrib/ncurses/ncurses/tinfo/
H A Dlib_termcap.c131 int best = 0; local
134 if (LAST_SEQ < MyCache[best].sequence) {
135 best = CacheInx;
138 CacheInx = best;
/freebsd-10.1-release/libexec/talkd/
H A Dprocess.c188 time_t best = 0; local
197 if (*tty == '\0' || best != 0) {
198 if (best == 0)
206 if (statb.st_atime > best) {
207 best = statb.st_atime;
/freebsd-10.1-release/contrib/apr-util/misc/
H A Dapr_rmm.c100 apr_rmm_off_t best = 0; local
111 * We need the most thorough best-fit logic, since we can
116 best = next;
124 struct rmm_block_t *blk = (rmm_block_t*)((char*)rmm->base + best);
125 struct rmm_block_t *new = (rmm_block_t*)((char*)rmm->base + best + size);
129 new->prev = best;
132 blk->next = best + size;
136 blk->prev = best + size;
140 return best;
/freebsd-10.1-release/sys/x86/acpica/
H A Dmadt.c362 int i, best; local
364 best = -1;
369 if (best == -1 ||
370 ioapics[best].io_vector < ioapics[i].io_vector)
371 best = i;
373 if (best == -1)
375 *apic = ioapics[best].io_apic;
376 *pin = intr - ioapics[best].io_vector;
/freebsd-10.1-release/sys/geom/raid/
H A Dtr_raid1e.c438 int disk, copy, best; local
462 best = g_raid_tr_raid1e_select_read_disk(vol, disk,
464 if (best < 0) {
468 } else if (best != copy) {
481 ((disk + best >= vol->v_disks_count) ? vol->v_strip_size : 0);
486 bp->bio_caller1 = &vol->v_subdisks[(disk + best) % vol->v_disks_count];
645 int i, best, prio, bestprio; local
647 best = -1;
686 best = i;
689 return (best);
702 int best; local
898 int error, do_write, copy, disk, best; local
[all...]
/freebsd-10.1-release/sys/opencrypto/
H A Dcrypto.c339 struct cryptocap *cap, *best; local
351 best = NULL;
367 if (best == NULL ||
368 cap->cc_sessions < best->cc_sessions)
369 best = cap;
372 if (best != NULL)
373 return best;
379 return best;
868 struct cryptocap *cap, *best, *blocked; local
880 best
[all...]
/freebsd-10.1-release/usr.sbin/IPXrouted/
H A Dsap_tables.c128 register struct sap_entry *best = NULL; local
139 best = sap;
140 besthops = ntohs(best->sap.hops);
143 return best;
/freebsd-10.1-release/contrib/bsnmp/snmp_mibII/
H A DmibII_route.c307 struct sroute *best; local
351 best = NULL;
365 if (best == NULL || sroute_compare(s, best) < 0)
367 best = s;
371 return (best);
/freebsd-10.1-release/sys/dev/drm2/
H A Ddrm_mm.c335 struct drm_mm_node *best; local
338 best = NULL;
352 best = entry;
357 return best;
368 struct drm_mm_node *best; local
373 best = NULL;
390 best = entry;
395 return best;
/freebsd-10.1-release/sys/dev/drm/
H A Ddrm_mm.c288 struct drm_mm_node *best; local
292 best = NULL;
312 best = entry;
318 return best;
/freebsd-10.1-release/sys/dev/drm2/radeon/
H A Dradeon_sa.c258 unsigned i, soffset, best, tmp; local
269 best = sa_manager->size * 2;
299 if (tmp < best) {
301 best = tmp;
/freebsd-10.1-release/contrib/gperf/src/
H A Dsearch.cc342 Positions best; local
353 /* We prefer 'try' to 'best' if it produces less duplicates,
359 best = tryal;
368 current = best;
376 Positions best; local
387 /* We prefer 'try' to 'best' if it produces less duplicates,
393 best = tryal;
402 current = best;
410 Positions best; local
427 /* We prefer 'try' to 'best' i
[all...]

Completed in 311 milliseconds

1234