HomeSort by: relevance | last modified time | path
    Searched refs:optimal (Results 1 - 25 of 29) sorted by relevancy

1 2

  /src/external/bsd/ntp/dist/scripts/calc_tickadj/
calc_tickadj-opts.def 7 prog-title = 'Calculates "optimal" value for tick given ntp drift file.';
35 The @code{calc_tickadj} script uses provided ntp drift file to generate optimal
  /src/sys/external/bsd/drm2/dist/drm/i915/
intel_pm.c 1347 struct g4x_wm_state *wm_state = &crtc_state->wm.g4x.optimal;
1435 const struct g4x_wm_state *optimal = &new_crtc_state->wm.g4x.optimal; local
1440 const struct g4x_wm_state *active = &old_crtc_state->wm.g4x.optimal;
1444 *intermediate = *optimal;
1451 intermediate->cxsr = optimal->cxsr && active->cxsr &&
1453 intermediate->hpll_en = optimal->hpll_en && active->hpll_en &&
1455 intermediate->fbc_en = optimal->fbc_en && active->fbc_en;
1459 max(optimal->wm.plane[plane_id],
1466 intermediate->sr.plane = max(optimal->sr.plane
2073 const struct vlv_wm_state *optimal = &new_crtc_state->wm.vlv.optimal; local
    [all...]
  /src/external/public-domain/xz/dist/src/liblzma/lzma/
lzma_encoder_optimum_normal.c 199 // Optimal //
203 make_literal(lzma_optimal *optimal)
205 optimal->back_prev = UINT32_MAX;
206 optimal->prev_1_is_literal = false;
211 make_short_rep(lzma_optimal *optimal)
213 optimal->back_prev = 0;
214 optimal->prev_1_is_literal = false;
218 #define is_short_rep(optimal) \
219 ((optimal).back_prev == 0)
  /src/external/mit/lua/dist/src/
ltable.c 394 ** Compute the optimal size for the array part of table 't'. 'nums' is a
398 ** will go to the array part; return the optimal size. (The condition
403 unsigned int twotoi; /* 2^i (candidate for optimal size) */
406 unsigned int optimal = 0; /* optimal size for array part */ local
413 optimal = twotoi; /* optimal size (till now) */
414 na = a; /* all elements up to 'optimal' will go to array part */
417 lua_assert((optimal == 0 || optimal / 2 < na) && na <= optimal)
    [all...]
  /src/sys/external/bsd/drm2/dist/drm/i915/display/
intel_display_types.h 731 * Optimal watermarks, programmed post-vblank
734 struct intel_pipe_wm optimal; member in struct:intel_crtc_wm_state::__anon4920::__anon4921
739 struct skl_pipe_wm optimal; member in struct:intel_crtc_wm_state::__anon4920::__anon4922
750 /* optimal watermarks (inverted) */
751 struct vlv_wm_state optimal; member in struct:intel_crtc_wm_state::__anon4920::__anon4923
761 /* optimal watermarks */
762 struct g4x_wm_state optimal; member in struct:intel_crtc_wm_state::__anon4920::__anon4924
769 * safe intermediate watermarks to the optimal final
  /src/external/lgpl3/gmp/dist/mpn/arm64/
lshift.asm 33 C cycles/limb assumed optimal c/l
lshiftc.asm 33 C cycles/limb assumed optimal c/l
rsh1aors_n.asm 35 C cycles/limb assumed optimal c/l
rshift.asm 33 C cycles/limb assumed optimal c/l
  /src/external/lgpl3/gmp/dist/mpn/ia64/
sqr_diag_addlsh1.asm 50 C important than optimal cycle counts.
  /src/external/lgpl3/gmp/dist/mpn/x86/k6/mmx/
popham.asm 43 C The code here isn't optimal, but it's already a 2x speedup over the plain
  /src/external/lgpl3/gmp/dist/mpn/x86/k7/mmx/
popham.asm 44 C The code here is almost certainly not optimal, but is already a 3x speedup
  /src/external/lgpl3/gmp/dist/mpn/x86_64/core2/
popcount.asm 58 C * This was hand-written without too much thought about optimal insn
hamdist.asm 58 C * This was hand-written without too much thought about optimal insn
  /src/external/lgpl3/gmp/dist/mpn/arm/neon/
lshiftc.asm 62 C * Optimise. It is not clear that this loop insn permutation is optimal for
lorrshift.asm 62 C * Optimise. It is not clear that this loop insn permutation is optimal for
  /src/external/lgpl3/gmp/dist/mpn/powerpc32/
divrem_2.asm 47 C * Make sure mul operands and optimal for early-out.
  /src/external/lgpl3/gmp/dist/mpn/sparc64/ultrasparc1234/
sqr_diagonal.asm 38 C UltraSPARC-1/2, three cycles slower than theoretically possible for optimal
  /src/external/lgpl3/gmp/dist/mpn/x86_64/coreisbr/
sqr_basecase.asm 65 C quite sub-optimal here. Write specific code, and add code for n = 4.
  /src/external/lgpl3/gmp/dist/mpn/x86_64/zen/
sbpi1_bdiv_r.asm 49 C quotient limb generation might not be in the optimal spot.
  /src/crypto/external/apache2/openssl/dist/crypto/bn/asm/
ia64-mont.pl 248 // that its performance would be ~20% lower than optimal one. No
  /src/crypto/external/bsd/openssl/dist/crypto/bn/asm/
ia64-mont.pl 248 // that its performance would be ~20% lower than optimal one. No
  /src/crypto/external/bsd/openssl.old/dist/crypto/bn/asm/
ia64-mont.pl 247 // that its performance would be ~20% lower than optimal one. No
  /src/external/lgpl3/gmp/dist/mpn/x86/p6/mmx/
divrem_1.asm 382 C This loop runs at about 25 cycles, which is probably sub-optimal, and
  /src/external/gpl3/gcc.old/dist/libphobos/src/std/
string.d 4906 Replaces spaces in `s` with the optimal number of tabs.
4946 Replaces spaces in range `r` with the optimal number of tabs.

Completed in 34 milliseconds

1 2