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

1 2 3 4 5 6 7 8 91011>>

  /src/usr.bin/make/unit-tests/
var-scope-global.mk 3 # Tests for global variables, which are the most common variables.
recursive.mk 34 # therefore that's acceptable. In most practical cases, the missing
  /src/lib/libc/arch/vax/string/
bcmp.S 53 bicl3 $-4,%r0,%r3 # handle at most 3 extra bytes
memcmp.S 50 bicl3 $-4,%r0,%r3 # handle at most 3 extra bytes
  /src/external/lgpl3/gmp/dist/mpn/power/
lshift.asm 47 lu 0,-4(4) C read most significant limb
50 lu 0,-4(4) C read 2:nd most significant limb
51 sreq 7,0,8 C compute most significant limb of result
rshift.asm 55 Lend: stu 7,4(9) C store 2:nd most significant limb
56 Lend2: sre 7,0,6 C compute most significant limb
  /src/external/gpl3/gdb/dist/gdb/testsuite/gdb.python/
py-mi-cmd.exp 124 [string_to_regexp {Traceback (most recent call last):\n}]
  /src/external/bsd/zstd/dist/contrib/match_finders/
README.md 8 * Zstandard for the use case of patching: the most common scenario being
11 * is generally tiny (most of the new file will be identical to
  /src/external/lgpl3/gmp/dist/mpn/sparc32/v9/
submul_1.asm 217 srl %g3, 0, %g3 C zero most significant 32 bits
248 srl %g3, 0, %g3 C zero most significant 32 bits
267 srl %g3, 0, %g3 C zero most significant 32 bits
282 srl %g3, 0, %g3 C zero most significant 32 bits
295 srl %g3, 0, %g3 C zero most significant 32 bits
306 srl %g3, 0, %g3 C zero most significant 32 bits
  /src/common/dist/zlib/examples/
enough.c 281 // we can use at most this many bit patterns, lest there not be enough
283 // no limit to the code length, this would become: most = left - 1)
284 int most = (((code_t)left << (g.max - len)) - syms) / local
289 for (int use = least; use <= most; use++) {
418 // we can use at most this many bit patterns, lest there not be enough
420 // no limit to the code length, this would become: most = left - 1)
421 int most = (((code_t)left << (g.max - len)) - syms) / local
434 for (use = least; use <= most; use++) {
532 // make sure that the calculation of most will not overflow
  /src/sys/arch/m68k/m68k/
trap_subr.s 65 moveml (%sp)+,#0x7FFF | restore most user regs
82 moveml (%sp)+,#0x7FFF | no, restore most user regs
  /src/external/gpl3/binutils/dist/zlib/examples/
enough.c 281 // we can use at most this many bit patterns, lest there not be enough
283 // no limit to the code length, this would become: most = left - 1)
284 int most = (((code_t)left << (g.max - len)) - syms) / local
289 for (int use = least; use <= most; use++) {
418 // we can use at most this many bit patterns, lest there not be enough
420 // no limit to the code length, this would become: most = left - 1)
421 int most = (((code_t)left << (g.max - len)) - syms) / local
434 for (use = least; use <= most; use++) {
532 // make sure that the calculation of most will not overflow
  /src/external/gpl3/binutils.old/dist/zlib/examples/
enough.c 281 // we can use at most this many bit patterns, lest there not be enough
283 // no limit to the code length, this would become: most = left - 1)
284 int most = (((code_t)left << (g.max - len)) - syms) / local
289 for (int use = least; use <= most; use++) {
418 // we can use at most this many bit patterns, lest there not be enough
420 // no limit to the code length, this would become: most = left - 1)
421 int most = (((code_t)left << (g.max - len)) - syms) / local
434 for (use = least; use <= most; use++) {
532 // make sure that the calculation of most will not overflow
  /src/external/gpl3/gdb/dist/zlib/examples/
enough.c 281 // we can use at most this many bit patterns, lest there not be enough
283 // no limit to the code length, this would become: most = left - 1)
284 int most = (((code_t)left << (g.max - len)) - syms) / local
289 for (int use = least; use <= most; use++) {
418 // we can use at most this many bit patterns, lest there not be enough
420 // no limit to the code length, this would become: most = left - 1)
421 int most = (((code_t)left << (g.max - len)) - syms) / local
434 for (use = least; use <= most; use++) {
532 // make sure that the calculation of most will not overflow
  /src/external/gpl3/gdb.old/dist/zlib/examples/
enough.c 281 // we can use at most this many bit patterns, lest there not be enough
283 // no limit to the code length, this would become: most = left - 1)
284 int most = (((code_t)left << (g.max - len)) - syms) / local
289 for (int use = least; use <= most; use++) {
418 // we can use at most this many bit patterns, lest there not be enough
420 // no limit to the code length, this would become: most = left - 1)
421 int most = (((code_t)left << (g.max - len)) - syms) / local
434 for (use = least; use <= most; use++) {
532 // make sure that the calculation of most will not overflow
  /src/external/lgpl3/gmp/dist/mpn/x86/
rshift.asm 90 shrl %cl,%eax C compute most significant limb
100 L(end): shrl %cl,%ebx C compute most significant limb
  /src/compat/
exec.mk 31 # most kvm-using tools are happier with 64 bit.
  /src/doc/
TODO.modules 52 6. Many (most?) drivers are not yet modularized
227 most of the modules getting unloaded a few seconds later. We don't
  /src/crypto/external/apache2/openssl/dist/util/perl/OpenSSL/Config/
Query.pm 51 A reference to a unified information hash table, most commonly known as
56 A reference to a config information hash table, most commonly known as
  /src/crypto/external/bsd/openssl/dist/util/perl/OpenSSL/Config/
Query.pm 51 A reference to a unified information hash table, most commonly known as
56 A reference to a config information hash table, most commonly known as
  /src/external/bsd/ntp/dist/scripts/ntp-wait/
ntp-wait-opts.def 57 will send at most
  /src/external/lgpl3/gmp/dist/mpn/m88k/
add_n.s 110 st r8,r2,28 ; store most significant limb
113 addu.ci r2,r0,r0 ; return carry-out from most sign. limb
  /src/usr.sbin/sysinst/
README.md_defs 3 The following is trying to document the most important machine dependent
44 PART_BOOT is in BYTE (not MB), while most other sizes
  /src/external/gpl3/gcc/dist/libgcc/config/rl78/
smaxdi3.S 40 ; use 16-bit compares from the most significant words downto the least significant ones
smindi3.S 40 ; use 16-bit compares from the most significant words downto the least significant ones

Completed in 43 milliseconds

1 2 3 4 5 6 7 8 91011>>