| /netbsd-src/external/bsd/less/dist/ |
| H A D | screen.c | 264 static char *cheaper(char *t1, char *t2, char *def);
1409 sc_home = cheaper(t1, t2, "|\b^"); in get_term()
1426 sc_lower_left = cheaper(t1, t2, "\r"); in get_term()
1453 sc_addline = cheaper(t1, t2, ""); in get_term()
1494 static char * cheaper(char *t1, char *t2, char *def) in cheaper() function
|
| /netbsd-src/external/apache2/llvm/dist/llvm/docs/ |
| H A D | FaultMaps.rst | 14 is profitable to make the non-failing case cheaper even if it makes
|
| H A D | SpeculativeLoadHardening.md | 934 marginally cheaper than embedding into `%rsp` for entering functions.
|
| /netbsd-src/external/apache2/llvm/dist/llvm/lib/CodeGen/ |
| H A D | README.txt | 110 the load / store instructions would be folded then spilling is cheaper because
|
| /netbsd-src/external/apache2/llvm/dist/llvm/lib/Target/ARM/ |
| H A D | README-Thumb.txt | 188 cheaper sequence if we know it's ok to clobber the condition register.
|
| /netbsd-src/external/apache2/llvm/dist/llvm/lib/Target/X86/ |
| H A D | README-SSE.txt | 723 operations is cheaper than SSE. SciMark montecarlo contains code like this
755 cheaper to do fld1 than load from a constant pool for example, so
|
| H A D | README.txt | 1328 On Nehalem, it may even be cheaper to just use movups when unaligned than to
|
| H A D | X86InstrShiftRotate.td | 53 // 'add reg,reg' is cheaper (and we have a Pat pattern for shift-by-one).
|
| /netbsd-src/external/apache2/llvm/dist/clang/docs/analyzer/developer-docs/ |
| H A D | RegionStore.rst | 152 bound as a Default value. This makes copying arrays and structs much cheaper
|
| /netbsd-src/external/apache2/llvm/dist/llvm/docs/HistoricalNotes/ |
| H A D | 2000-11-18-EarlyDesignIdeasResp.txt | 125 would generally be used to make IP optimizations cheaper for the
|
| /netbsd-src/external/apache2/llvm/dist/llvm/lib/Target/RISCV/ |
| H A D | RISCVInstrInfoD.td | 351 // is cheaper than fcvt.lu.d+sext.w.
|
| H A D | RISCVInstrInfoZfh.td | 350 // is cheaper than fcvt.lu.h+sext.w.
|
| H A D | RISCVInstrInfoF.td | 391 // is cheaper than fcvt.lu.s+sext.w.
|
| /netbsd-src/distrib/sets/ |
| H A D | sets.subr | 66 # implement cheaper versions of basename and dirname
|
| /netbsd-src/external/bsd/less/dist/lesstest/lt/ |
| H A D | subsearch.lt | 292 static char *cheaper(char *t1, char *t2, char *def);
1426 sc_home = cheaper(t1, t2, "|\b^");
1443 sc_lower_left = cheaper(t1, t2, "\r");
1470 sc_addline = cheaper(t1, t2, "");
1511 static char * cheaper(char *t1, char *t2, char *def)
|
| /netbsd-src/external/apache2/llvm/dist/llvm/docs/GlobalISel/ |
| H A D | GenericOpcode.rst | 103 instructions that are cheaper than the constituent shifts as the optimizer is
|
| /netbsd-src/external/gpl3/gcc/dist/libstdc++-v3/include/std/ |
| H A D | ostream | 719 // Use concepts if possible because they're cheaper to evaluate.
|
| /netbsd-src/external/gpl3/gcc/dist/libcody/ |
| H A D | README.md | 471 calls. Perhaps using a common resource would be cheaper?
|
| /netbsd-src/external/apache2/llvm/dist/llvm/lib/Target/ |
| H A D | README.txt | 664 being a mulhi to being a mul lo (cheaper). Testcase:
1352 that path the value of %177 is actually just %171-1. A sub is cheaper than a
1715 and cheaper on most targets.
|
| /netbsd-src/games/hack/ |
| H A D | rumors | 503 Your dog can buy cheaper than you do.
|
| /netbsd-src/external/apache2/llvm/dist/llvm/include/llvm/Target/ |
| H A D | GenericOpcodes.td | 59 // instructions that are cheaper than the constituent shifts as the optimizer is
|
| /netbsd-src/external/bsd/openldap/dist/doc/guide/admin/ |
| H A D | access-control.sdf | 1044 and cheaper manner. Examples:
|
| /netbsd-src/external/gpl3/gcc.old/dist/libstdc++-v3/include/ext/ |
| H A D | rope | 164 // appending an entire array is cheaper than appending element by element.
|
| /netbsd-src/external/gpl3/gcc.old/dist/gcc/config/mcore/ |
| H A D | mcore.md | 685 /* Convert adds to subtracts if this makes loading the constant cheaper.
|
| /netbsd-src/external/gpl3/gcc/dist/libstdc++-v3/include/ext/ |
| H A D | rope | 164 // appending an entire array is cheaper than appending element by element.
|