/netbsd-src/external/bsd/unbound/dist/compat/ |
H A D | getentropy_solaris.c | 256 int save_errno = errno, e, pgs = getpagesize(), faster = 0, repeat; in getentropy_fallback() local 272 faster = 1; in getentropy_fallback() 275 faster = 0; in getentropy_fallback() 299 if (!faster) { in getentropy_fallback()
|
H A D | getentropy_osx.c | 208 int save_errno = errno, e, pgs = getpagesize(), faster = 0, repeat; in getentropy_fallback() local 231 faster = 1; in getentropy_fallback() 234 faster = 0; in getentropy_fallback() 279 if (!faster) { in getentropy_fallback()
|
H A D | getentropy_linux.c | 336 int save_errno = errno, e, pgs = getpagesize(), faster = 0, repeat; in getentropy_fallback() local 351 faster = 1; in getentropy_fallback() 354 faster = 0; in getentropy_fallback() 379 if (!faster) { in getentropy_fallback()
|
/netbsd-src/crypto/external/bsd/openssl.old/lib/libcrypto/arch/arm/ |
H A D | sha512-armv4.S | 21 @ This code is ~4.5 (four and a half) times faster than code generated 38 @ one byte in 23.3 cycles or ~60% faster than integer-only code.
|
/netbsd-src/crypto/external/bsd/openssl/lib/libcrypto/arch/arm/ |
H A D | sha512-armv4.S | 21 @ This code is ~4.5 (four and a half) times faster than code generated 38 @ one byte in 23.3 cycles or ~60% faster than integer-only code.
|
/netbsd-src/external/gpl2/grep/dist/ |
H A D | TODO | 30 claim that his algo. is faster then Boyer-More ???? 42 Better and faster !!
|
/netbsd-src/external/bsd/flex/dist/examples/fastwc/ |
H A D | README | 35 wc2.l somewhat faster; adds rules to match multiple tokens at once 37 wc3.l faster still; adds more rules to match longer runs of tokens
|
/netbsd-src/external/gpl3/gdb/dist/sim/testsuite/bfin/ |
H A D | cec-multi-pending.S | 88 # CEC should have been faster than this ... 141 # CEC should have been faster than this ...
|
/netbsd-src/crypto/external/bsd/openssl/lib/libdes/ |
H A D | VERSION | 32 Even faster inner loop in the DES assembler for x86 and a modification 33 for IP/FP which is faster on x86. Both of these changes are 35 changes make the assembler run %40 faster on a pentium. This is just 57 made things faster :-). I've known about this one for some 265 for motivating me to look for a faster system :-) 317 other will be faster. This was inspired by 368 set_key is 4 times faster and takes less space. 374 This version is quite a bit faster that 1.51 398 Still need to fix des_set_key (make it faster).
|
/netbsd-src/crypto/external/bsd/openssl.old/lib/libdes/ |
H A D | VERSION | 32 Even faster inner loop in the DES assembler for x86 and a modification 33 for IP/FP which is faster on x86. Both of these changes are 35 changes make the assembler run %40 faster on a pentium. This is just 57 made things faster :-). I've known about this one for some 265 for motivating me to look for a faster system :-) 317 other will be faster. This was inspired by 368 set_key is 4 times faster and takes less space. 374 This version is quite a bit faster that 1.51 398 Still need to fix des_set_key (make it faster).
|
/netbsd-src/crypto/external/bsd/openssl.old/dist/doc/man3/ |
H A D | BF_encrypt.pod | 39 of the faster block ciphers. It is quite a bit faster than DES, and much 40 faster than IDEA or RC2.
|
/netbsd-src/external/lgpl3/gmp/dist/tune/ |
H A D | README | 264 an ordinary loop for the remainder, it can happen that it's actually faster 273 ought to be faster (or at least not slower) than shifting by, say, 2 bits. 278 if the lshift isn't faster there's an obvious improvement that's possible. 283 destination is one of the sources is faster than a separate destination. 290 using a right shift because it'll be significantly faster than an actual 291 division. The following shows by what factor mpn_rshift is faster than 382 a ".<r>" parameter, or decimal by default. Power of 2 bases are much faster 396 a ".<r>" parameter, or decimal by default. Power of 2 bases are faster than 402 faster than the general case, basically by giving the compiler a chance to
|
/netbsd-src/crypto/external/bsd/openssl/dist/doc/man3/ |
H A D | BF_encrypt.pod | 47 of the faster block ciphers. It is quite a bit faster than DES, and much 48 faster than IDEA or RC2.
|
/netbsd-src/games/tetris/ |
H A D | tetris.h | 148 #define faster() (fallrate -= fallrate / 3000) macro
|
H A D | input.c | 153 faster(); /* go faster */ in tgetchar()
|
/netbsd-src/external/bsd/unbound/dist/ |
H A D | README | 6 little faster.
|
/netbsd-src/external/lgpl3/gmp/dist/ |
H A D | NEWS | 153 * Square root is now faster when the remainder is not needed. Also the speed 207 * Plain division of large operands is faster and more monotonous in operand 577 (1) Plain "schoolbook" division is reimplemented using faster quotient 588 * The function mpz_powm is now faster for all sizes. Its complexity has 591 faster for even modulus, since it now partially factors such modulus 601 * A new algorithm makes mpz_perfect_power_p asymptotically faster. 603 * The function mpz_remove uses a much faster algorithm, is better tuned, 698 * Improved schoolbook division by means of faster quotient approximation. 702 * The mpz_nextprime function uses sieving and is much faster. 807 * Computation of n-factorial much faster. [all …]
|
H A D | README | 47 GNU MP is believed to be faster than any other similar library. Its advantage 49 cases has asymptotically faster algorithms.
|
/netbsd-src/external/gpl2/texinfo/dist/makeinfo/ |
H A D | README | 17 job, but makeinfo is faster and gives better error messages.
|
/netbsd-src/sys/arch/mvme68k/stand/sboot/ |
H A D | oc_cksum.s | 53 | 68010 "loop mode" would almost certainly be faster than this 106 | case is header checksums) so we give that the faster
|
/netbsd-src/external/gpl3/gcc.old/dist/libgcc/config/epiphany/ |
H A D | umodsi3-float.S | 36 mov TMP1,%low(0xb0800000) ; ??? this would be faster with small data
|
/netbsd-src/external/gpl3/gcc/dist/libgcc/config/epiphany/ |
H A D | umodsi3-float.S | 36 mov TMP1,%low(0xb0800000) ; ??? this would be faster with small data
|
/netbsd-src/external/bsd/bzip2/dist/ |
H A D | README | 68 effort to upgrade to use version 1.0, since it is both faster and more 147 * Approx 10% faster compression, 30% faster decompression
|
/netbsd-src/usr.bin/compress/doc/ |
H A D | revision.log | 51 * Junk chaining; replace with the simpler (and, on the VAX, faster) 100 * save much memory. Do unsigned compares where possible (faster on
|
/netbsd-src/external/bsd/liblzf/dist/ |
H A D | Changes | 34 3-15% faster than fastlz while still maintaining a similar ratio. 122 - much better fine-tuning, faster and better than 0.1.
|