| /src/crypto/external/apache2/openssl/dist/util/perl/OpenSSL/Config/ |
| Query.pm | 35 module makes querying this structure simpler, through diverse methods.
|
| /src/crypto/external/bsd/openssl/dist/util/perl/OpenSSL/Config/ |
| Query.pm | 35 module makes querying this structure simpler, through diverse methods.
|
| /src/external/lgpl3/gmp/dist/mpn/powerpc32/ |
| mod_34lsub1.asm | 55 C simpler code.
|
| /src/usr.bin/make/unit-tests/ |
| directive-for-empty.mk | 54 # expressions like '${i:Modifiers}', this is simpler as a single
|
| /src/crypto/external/apache2/openssl/dist/demos/pkey/ |
| dsa.inc | 109 * There are simpler ways to print using EVP_PKEY_print_XXXX().
|
| /src/crypto/external/bsd/openssl/dist/demos/pkey/ |
| dsa.inc | 109 * There are simpler ways to print using EVP_PKEY_print_XXXX().
|
| /src/external/gpl3/gdb/dist/gdb/contrib/ari/ |
| update-web-ari.sh | 838 Mechanisms that have been replaced with something better, simpler,
|
| /src/external/gpl3/gdb.old/dist/gdb/contrib/ari/ |
| update-web-ari.sh | 838 Mechanisms that have been replaced with something better, simpler,
|
| /src/external/lgpl3/gmp/dist/mpn/x86/k6/ |
| aorsmul_1.asm | 107 C Attempts at a simpler main loop, with less unrolling, haven't yielded much
|
| /src/external/mit/isl/dist/ |
| isl_ast_build_expr.c | 692 /* Is the affine expression of constraint "c" "simpler" than data->nonneg
707 int simpler; local
714 simpler = isl_val_lt(v1, v2);
718 return simpler;
722 * of data->div modulo data->d. If so, and if "c" is "simpler" than
|
| /src/sys/arch/m68k/060sp/dist/ |
| ilsp.s | 293 # if the divisor msw is 0, use simpler algorithm then the full blown
300 # a simpler algorithm may be used :
|
| /src/external/lgpl3/gmp/dist/mpn/x86/pentium4/sse2/ |
| divrem_1.asm | 100 dnl simpler), so start the mul from 5 limbs.
|
| /src/external/lgpl3/gmp/dist/mpn/ia64/ |
| addmul_1.asm | 47 C smaller than this due to better loop scheduling and thus simpler feed-in
|
| /src/external/lgpl3/gmp/dist/mpn/sparc64/ultrasparc1234/ |
| mul_1.asm | 55 C since we'll be summing 48-bit quantities, which might be simpler.
|
| addmul_1.asm | 56 C since we'll be summing 48-bit quantities, which might be simpler.
|
| /src/external/lgpl3/gmp/dist/mpn/x86/k7/mmx/ |
| divrem_1.asm | 545 C q1_ff special case. This make the code a bit smaller and simpler, and
|
| /src/external/lgpl3/gmp/dist/mpn/x86/p6/mmx/ |
| divrem_1.asm | 489 C q1_ff special case. This make the code a bit smaller and simpler, and
|
| /src/bin/ksh/ |
| emacs.c | 308 * default, but its simpler/faster/smaller than using termcap
|
| /src/external/gpl2/dtc/dist/Documentation/ |
| dtc-paper.tex | 253 In many cases a flat tree can be simpler than a typical OF provided
|
| /src/external/gpl3/autoconf/dist/ |
| maint.mk | 186 # construct instead of the simpler prohibited construct.
|
| /src/external/gpl3/gcc.old/dist/libphobos/src/std/uni/ |
| package.d | 193 // same thing but simpler and checked at compile-time
755 // or simpler and statically-checked look
2032 $(P See also $(LREF unicode) for simpler construction of sets
4262 See_Also: $(LREF toTrie), which is even simpler.
7758 This function uses simpler comparison rule thus achieving better performance
|
| /src/external/gpl2/gmake/dist/config/ |
| texinfo.tex | 3240 % this will be simpler.
|
| /src/external/gpl2/groff/dist/doc/ |
| texinfo.tex | 3159 % @, this will be simpler.
|
| /src/external/gpl2/texinfo/dist/doc/ |
| texinfo.tex | 3159 % @, this will be simpler.
|
| /src/external/bsd/am-utils/dist/doc/ |
| texinfo.tex | 4416 % this will be simpler.
|
