| /src/games/tetris/ |
| tetris.h | 138 * Shapes fall at a rate faster than once per second.
143 * depending on its current value, via the `faster' macro below.
144 * The value eventually reaches a limit, and things stop going faster,
147 extern long fallrate; /* less than 1 million; smaller => faster */
148 #define faster() (fallrate -= fallrate / 3000) macro
|
| input.c | 153 faster(); /* go faster */
|
| /src/crypto/external/apache2/openssl/lib/libcrypto/arch/arm/ |
| 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.
|
| aes-armv4.S | 21 @ Code uses single 1K S-box and is >2 times faster than code generated
|
| /src/crypto/external/bsd/openssl/lib/libcrypto/arch/arm/ |
| 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.
|
| aes-armv4.S | 21 @ Code uses single 1K S-box and is >2 times faster than code generated
|
| /src/crypto/external/bsd/openssl.old/lib/libcrypto/arch/arm/ |
| 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.
|
| sha256-armv4.S | 38 @ byte in 12.5 cycles or 23% faster than integer-only code. Snapdragon
39 @ S4 does it in 12.5 cycles too, but it's 50% faster than integer-only
|
| /src/external/gpl3/gdb/dist/sim/testsuite/bfin/ |
| cec-multi-pending.S | 88 # CEC should have been faster than this ...
115 # CEC should have been faster than this ...
141 # CEC should have been faster than this ...
165 # CEC should have been faster than this ...
|
| /src/external/gpl3/gdb.old/dist/sim/testsuite/bfin/ |
| cec-multi-pending.S | 88 # CEC should have been faster than this ...
115 # CEC should have been faster than this ...
141 # CEC should have been faster than this ...
165 # CEC should have been faster than this ...
|
| /src/external/bsd/unbound/dist/compat/ |
| getentropy_solaris.c | 256 int save_errno = errno, e, pgs = getpagesize(), faster = 0, repeat; local
272 faster = 1;
275 faster = 0;
299 if (!faster) {
|
| getentropy_linux.c | 336 int save_errno = errno, e, pgs = getpagesize(), faster = 0, repeat; local
351 faster = 1;
354 faster = 0;
379 if (!faster) {
|
| getentropy_osx.c | 208 int save_errno = errno, e, pgs = getpagesize(), faster = 0, repeat; local
231 faster = 1;
234 faster = 0;
279 if (!faster) {
|
| /src/external/gpl3/gcc/dist/libgcc/config/arc/ieee-754/arc600/ |
| mulsf3.S | 75 ; We could so this a bit faster here with a 32 bit shift register and
|
| /src/external/gpl3/gcc/dist/libgcc/config/epiphany/ |
| umodsi3-float.S | 36 mov TMP1,%low(0xb0800000) ; ??? this would be faster with small data
|
| udivsi3-float.S | 36 mov TMP1,%low(0xb0800000) ; ??? this would be faster with small data
|
| /src/external/gpl3/gcc.old/dist/libgcc/config/arc/ieee-754/arc600/ |
| mulsf3.S | 75 ; We could so this a bit faster here with a 32 bit shift register and
|
| /src/external/gpl3/gcc.old/dist/libgcc/config/epiphany/ |
| umodsi3-float.S | 36 mov TMP1,%low(0xb0800000) ; ??? this would be faster with small data
|
| udivsi3-float.S | 36 mov TMP1,%low(0xb0800000) ; ??? this would be faster with small data
|
| /src/external/lgpl3/gmp/dist/mpn/x86/k6/ |
| mode1o.asm | 43 C faster, and so isn't used.
46 C only about 5 cycles faster, and so isn't used. When size==1 and
47 C high<divisor it can skip a division and be a full 24 cycles faster, but
|
| /src/external/lgpl3/gmp/dist/mpn/powerpc64/mode64/p8/ |
| invert_limb.asm | 41 C This runs on POWER7 and later, but is faster only on later CPUs.
|
| /src/external/gpl3/gcc/dist/libgcc/config/nds32/ |
| crtzero.S | 64 ! clear BSS, this process can be 4 time faster if data is 4 byte aligned
|
| /src/external/gpl3/gcc.old/dist/libgcc/config/nds32/ |
| crtzero.S | 64 ! clear BSS, this process can be 4 time faster if data is 4 byte aligned
|
| /src/external/lgpl3/gmp/dist/mpn/powerpc32/ |
| mode1o.asm | 50 C 5 cycles faster than the nonsense needed to access binvert_limb_table in
55 C 3-5 cycles faster on 750. For now it doesn't seem worth bothering with.
|
| /src/external/lgpl3/gmp/dist/mpn/x86/k7/ |
| dive_1.asm | 46 C It's a touch faster on size==1 to use the mul-by-inverse than divl.
79 C should be faster than bsfl.
|
