Searched refs:best (Results 51 - 75 of 81) sorted by relevance

1234

/freebsd-10.0-release/sys/dev/usb/controller/
H A Duhci.c2015 uint16_t best; local
2019 best = 0;
2024 best = bit;
2027 sc->sc_intr_stat[best]) {
2028 best = x;
2037 sc->sc_intr_stat[best]++;
2038 xfer->qh_pos = best;
2040 DPRINTFN(3, "best=%d interval=%d\n",
2041 best, xfer->interval);
H A Dehci.c2317 uint16_t best; local
2324 * Find the best QH position corresponding to the given interval:
2327 best = 0;
2332 best = bit;
2335 sc->sc_intr_stat[best]) {
2336 best = x;
2345 sc->sc_intr_stat[best]++;
2346 xfer->qh_pos = best;
2348 DPRINTFN(3, "best=%d interval=%d\n",
2349 best, xfe
[all...]
/freebsd-10.0-release/contrib/gcc/
H A Dpostreload.c600 int best = i; local
613 best = j;
619 tmp = alternative_order[best];
620 alternative_order[best] = alternative_order[i];
624 /* Substitute the operands as determined by op_alt_regno for the best
H A Dloop-invariant.c1007 /* Finds invariant with best gain for moving. Returns the gain, stores
1014 best_gain_for_invariant (struct invariant **best, unsigned *regs_needed, argument
1036 *best = inv;
H A Dhaifa-sched.c268 `schedule_block' when the best insn to schedule is chosen.
306 /* The following array is used to find the best insn from ready when
2073 insns is insns with the best rank (the first insn in READY). To
2079 INDEX will contain index of the best insn in READY. The following
2084 int n, i, all, n_ready, best, delay, tries_num, points = -1;
2088 best = 0;
2105 if (best < top - choice_stack && ready_try [0])
2107 best = top - choice_stack;
2110 if (top->n == max_points || best == all)
2158 return best;
2080 int n, i, all, n_ready, best, delay, tries_num, points = -1; local
[all...]
H A Dc-common.c57 it would be best to do something here to figure out automatically
2994 tree best = t;
3005 best = t, bestalign = thisalign;
3007 return c_alignof (TREE_TYPE (TREE_TYPE (best)));
2981 tree best = t; local
H A Dreload.c2573 int best;
2894 best = MAX_RECOG_OPERANDS * 2 + 600;
3671 if (! bad && best > losers)
3684 best = losers;
3751 if (best == MAX_RECOG_OPERANDS * 2 + 600)
3784 /* If the best alternative is with operands 1 and 2 swapped,
2560 int best; local
/freebsd-10.0-release/sys/dev/sound/pcm/
H A Dsound.c745 int i, best, bestprio, prio; local
747 best = -1;
760 best = i;
764 return (best);
/freebsd-10.0-release/sys/dev/drm2/radeon/
H A Dradeon_gart.c693 struct radeon_fence *best[RADEON_NUM_RINGS] = {}; local
714 if (radeon_fence_is_earlier(fence, best[fence->ring])) {
715 best[fence->ring] = fence;
/freebsd-10.0-release/sys/kern/
H A Dlink_elf.c1329 const Elf_Sym* best = 0; local
1339 best = es;
1343 best = es;
1347 if (best == 0)
1351 *sym = (c_linker_sym_t) best;
H A Dlink_elf_obj.c1095 const Elf_Sym *best = 0; local
1105 best = es;
1109 best = es;
1113 if (best == 0)
1117 *sym = (c_linker_sym_t) best;
H A Dsubr_bus.c1996 driverlink_t best = NULL; local
2061 best = dl;
2077 * best matching driver. Initialise the value
2080 if (best == NULL || result > pri) {
2089 best = dl;
2098 if (best && pri == 0)
2105 /* XXX What happens if we rebid and got no best? */
2106 if (best) {
2124 if (child->state > DS_ALIVE && best->driver != child->driver)
2130 result = device_set_devclass(child, best
[all...]
/freebsd-10.0-release/contrib/bmake/mk/
H A Dmeta.autodep.mk199 # we need a mutex. Obviously, this is best avoided.
H A Ddirdeps.mk69 # It is best to use "no", but this can require fixing some
H A Dlib.mk391 # no-op is the best we can do if not bmake.
/freebsd-10.0-release/contrib/llvm/lib/Support/Unix/
H A DPath.inc137 // The best way is with mkdtemp but that's not available on many systems,
/freebsd-10.0-release/contrib/gcc/cp/
H A Dtypeck.c1162 tree best = NULL_TREE;
1182 if (best == NULL_TREE)
1183 best = trial;
1184 else if (best != trial)
1199 if (best == NULL_TREE)
1200 best = trial;
1201 else if (best != trial)
1205 return best;
1160 tree best = NULL_TREE; local
/freebsd-10.0-release/sys/contrib/dev/ath/ath_hal/ar9300/
H A Dar9300_eeprom.c204 * if we can't find the best template, put any old template in place
623 * identify best lower and higher x calibration measurement
630 /* new best higher x measurement */
639 /* new best lower x measurement */
1967 * identify best lower and higher frequency calibration measurement
1985 * new best higher frequency measurement
1998 * new best lower frequency measurement
3623 ar9300_compression_header_unpack(u_int8_t *best, int *code, int *reference, argument
3628 value[0] = best[0];
3629 value[1] = best[
[all...]
/freebsd-10.0-release/crypto/openssl/
H A DMakefile.org520 gzip --best >../$(TARFILE).gz; \
H A DMakefile522 gzip --best >../$(TARFILE).gz; \
/freebsd-10.0-release/contrib/texinfo/info/
H A Dsession.c2241 int best = -1, min_dist = window->node->nodelen;
2257 best = i;
2261 if (best != -1)
2262 entry = menu[best];
2688 Return the menu entry, or the best guess for what they meant by ARG,
2722 /* Find the node that is the best candidate to list the PROGRAM's
2800 /* We've got our best shot at the invocation node. Now select it. */
2237 int best = -1, min_dist = window->node->nodelen; local
/freebsd-10.0-release/sys/dev/cxgbe/
H A Dt4_sge.c4139 int i, largest, best, delta, start; local
4152 best = start;
4169 best = i;
4174 fl->tag_idx = best; /* Found a buf bigger than bufsize */
/freebsd-10.0-release/sys/geom/mirror/
H A Dg_mirror.c1458 int prio, best; local
1462 best = INT_MAX;
1474 if (prio <= best) {
1476 best = prio;
2161 * I think the best choice here is don't touch
/freebsd-10.0-release/crypto/openssl/util/
H A Dpod2man.pl76 best if you put your Perl man pages in a separate tree, like
/freebsd-10.0-release/contrib/binutils/binutils/
H A Dreadelf.c4842 Elf_Internal_Sym *sym, *best = NULL;
4853 best = sym;
4859 if (best)
4861 *symname = (best->st_name >= strtab_size
4862 ? "<corrupt>" : strtab + best->st_name);
4839 Elf_Internal_Sym *sym, *best = NULL; local

Completed in 312 milliseconds

1234