| /netbsd-6-1-5-RELEASE/external/bsd/libpcap/dist/msdos/ |
| H A D | ndis_0.asm | 31 CB_DSEG EQU <SEG _DATA> ; 16bit is small/large model
|
| H A D | pkt_rx0.asm | 149 ja @skip ; no, packet to large for us
|
| /netbsd-6-1-5-RELEASE/external/gpl3/gcc/dist/gcc/ |
| H A D | sched-rgn.c | 551 in the region. Return true if the region is "too large" for interblock
1297 int num_bbs = 0, j, num_insns = 0, large;
1299 large = too_large (bbn, &num_bbs, &num_insns);
1313 if (!large)
1320 if ((large = too_large (succn, &num_bbs, &num_insns)))
1325 if (large)
1351 BLOCK_TO_BB (succn) = large ? 0 : num_bbs++;
1354 if (large)
1372 if (!large)
1296 int num_bbs = 0, j, num_insns = 0, large; local
|
| /netbsd-6-1-5-RELEASE/gnu/dist/gcc4/gcc/config/sparc/ |
| H A D | lb1spc.asm | 112 * Current estimate for non-large dividend is
114 * A large dividend is one greater than 2^(31-TOPBITS) and takes a
461 * Current estimate for non-large dividend is
463 * A large dividend is one greater than 2^(31-TOPBITS) and takes a
|
| /netbsd-6-1-5-RELEASE/crypto/external/bsd/heimdal/dist/tools/ |
| H A D | kdc-log-analyze.pl | 480 } elsif (/Too large time skew -- (.*)$/) {
|
| /netbsd-6-1-5-RELEASE/sys/arch/mvme68k/stand/sboot/ |
| H A D | oc_cksum.s | 74 | me why.) So, since 16 was good for both large and small counts,
|
| /netbsd-6-1-5-RELEASE/sys/arch/m68k/m68k/ |
| H A D | oc_cksum.s | 70 | me why.) So, since 16 was good for both large and small counts,
|
| /netbsd-6-1-5-RELEASE/external/lgpl3/gmp/dist/mpn/x86/k6/ |
| H A D | aorsmul_1.asm | 39 dnl K6: large multipliers small multipliers
123 C measurements showing small multipliers running faster than large ones.
|
| /netbsd-6-1-5-RELEASE/tests/lib/libm/ |
| H A D | t_ldexp.c | 473 TEST(ldexp_denormal_large, large)
|
| /netbsd-6-1-5-RELEASE/common/dist/zlib/contrib/delphi/ |
| H A D | ZLib.pas | 79 indicator when you are writing a large chunk of data to the compression
114 large chunk of data from the decompression stream in a single call.}
|
| /netbsd-6-1-5-RELEASE/crypto/external/bsd/openssl/dist/crypto/rc4/asm/ |
| H A D | rc4-parisc.pl | 168 cmpib,*>>= 6,$len,L\$oop1 ; is $len large enough to bother?
|
| /netbsd-6-1-5-RELEASE/external/gpl3/gcc/dist/zlib/contrib/delphi/ |
| H A D | ZLib.pas | 79 indicator when you are writing a large chunk of data to the compression
114 large chunk of data from the decompression stream in a single call.}
|
| /netbsd-6-1-5-RELEASE/external/lgpl3/gmp/dist/mpn/powerpc32/vmx/ |
| H A D | mod_34lsub1.asm | 62 bge L(large)
131 L(large):
|
| /netbsd-6-1-5-RELEASE/external/bsd/bind/dist/bin/tests/ |
| H A D | named.conf | 80 // it and it was used by large sites
|
| /netbsd-6-1-5-RELEASE/external/gpl3/gcc/dist/gcc/config/picochip/libgccExtras/ |
| H A D | divmod15.asm | 61 // large value by a small value) will run as fast as possible
|
| /netbsd-6-1-5-RELEASE/gnu/dist/gcc4/gcc/config/ia64/ |
| H A D | crtbegin.asm | 80 * We make the call by indirection, because in large programs the
|
| /netbsd-6-1-5-RELEASE/external/lgpl3/gmp/dist/mpn/x86/ |
| H A D | mul_basecase.asm | 44 C part of the function, but since it is not very large, that would be
|
| /netbsd-6-1-5-RELEASE/external/gpl3/gcc/dist/gcc/config/arm/ |
| H A D | ieee754-sf.S | 88 @ If exponent difference is too large, return largest argument
993 bls 2f @ value is too large
1036 bmi 2f @ value is too large
|
| H A D | ieee754-df.S | 116 @ If exponent difference is too large, return largest argument
1308 bls 3f @ value is too large
1351 bmi 3f @ value is too large
|
| /netbsd-6-1-5-RELEASE/gnu/dist/gcc4/gcc/config/arm/ |
| H A D | ieee754-sf.S | 90 @ If exponent difference is too large, return largest argument
911 bls 2f @ value is too large
952 bmi 2f @ value is too large
|
| H A D | ieee754-df.S | 118 @ If exponent difference is too large, return largest argument
1207 bls 3f @ value is too large
1248 bmi 3f @ value is too large
|
| /netbsd-6-1-5-RELEASE/crypto/external/bsd/heimdal/dist/lib/hcrypto/libtommath/ |
| H A D | bn.tex | 76 large integer numbers. It was written in portable ISO C source code so that it will build on any platform with a conforming
169 In the file tommath\_class.h you will see a large list of C ``defines'' followed by a series of ``ifdefs''
282 would require when working with large integers.
441 Certain algorithms require more than one large integer. In these instances it is ideal to initialize all of the mp\_int
1159 should only be used with very large inputs. This is followed by the Karatsuba multiplications which are for moderate
1242 Toom-Cook has incredible overhead and is probably only useful for very large inputs. So far no known cutoff points
1583 the algorithm requires raising $a$ to the power of $b$ it is not ideal to attempt to find roots for large
1584 values of $b$. If particularly large roots are required then a factor method could be used instead. For example,
|
| /netbsd-6-1-5-RELEASE/external/bsd/ntp/dist/ntpq/ |
| H A D | ntpq-opts.def | 158 large distances in terms of network topology.
|
| /netbsd-6-1-5-RELEASE/gnu/dist/gcc4/libcpp/ |
| H A D | expr.c | 271 int large = (result & CPP_N_WIDTH) == CPP_N_LARGE; local
273 if (u_or_i || (large && CPP_OPTION (pfile, warn_long_long)))
376 "integer constant is too large for its type");
388 "integer constant is so large that it is unsigned");
|
| /netbsd-6-1-5-RELEASE/external/lgpl3/gmp/dist/mpn/powerpc64/vmx/ |
| H A D | popcount.asm | 72 C in vsum4ubs. For large operands, we work in chunks, of size LIMBS_PER_CHUNK.
|