/external/clang/test/Preprocessor/ |
include-macros.c | 3 // This should not be expanded into FOO because pr2086.h undefs 'test'.
|
/external/llvm/test/CodeGen/SystemZ/ |
vec-const-04.ll | 29 ; Test that undefs are treated as zero (mask 0x8c00).
|
vec-const-06.ll | 29 ; Test that undefs are treated as zero (mask 0x8c00).
|
vec-const-13.ll | 117 ; Retest f1 with arbitrary undefs instead of 0s. 128 ; Try a case where we want consistent undefs to be treated as 0. 150 ; Try a case where we want consistent undefs to be treated as -1. 172 ; Repeat f9 with arbitrary undefs. 183 ; Try a case where we want some consistent undefs to be treated as 0
|
vec-const-02.ll | 31 ; Test that undefs are treated as zero.
|
vec-const-03.ll | 29 ; Test that undefs are treated as zero (mask 0x8076).
|
vec-const-05.ll | 31 ; Test that undefs are treated as zero (mask 0xc031).
|
vec-const-10.ll | 155 ; Repeat f14 with undefs optimistically treated as 32767. 163 ; Repeat f18 with undefs optimistically treated as -2.
|
vec-const-12.ll | 155 ; Repeat f14 with undefs optimistically treated as 32767. 163 ; Repeat f18 with undefs optimistically treated as -2.
|
vec-const-01.ll | 35 ; Test that undefs are treated as zero.
|
vec-const-08.ll | 173 ; Repeat f14 with undefs optimistically treated as 0. 182 ; Repeat f18 with undefs optimistically treated as -1.
|
vec-const-09.ll | 155 ; Repeat f14 with undefs optimistically treated as 0, 32767. 163 ; Repeat f18 with undefs optimistically treated as -2, -1.
|
vec-const-11.ll | 173 ; Repeat f14 with undefs optimistically treated as 0, 32767. 182 ; Repeat f18 with undefs optimistically treated as -2, -1.
|
vec-const-07.ll | 209 ; Repeat f14 with undefs optimistically treated as 0. 220 ; Repeat f18 with undefs optimistically treated as -1.
|
vec-const-14.ll | 97 ; Retest f1 with arbitrary undefs instead of 0s.
|
vec-perm-07.ll | 57 ; Test a v16i8 shift in which some of the indices are undefs.
|
/external/clang/test/CodeGen/ |
global-init.c | 20 // PR6168 "too many undefs"
|
2008-08-07-AlignPadding1.c | 23 // The idea is that there are 6 undefs in this structure initializer to cover
|
/external/llvm/utils/ |
GenLibDeps.pl | 205 open UNDEFS, 208 while (<UNDEFS>) { 228 close UNDEFS or die "nm failed"; 231 open UNDEFS, "$nmPath -u $Directory/$lib |"; 232 while (<UNDEFS>) { 253 close UNDEFS or die "nm failed";
|
/external/llvm/test/CodeGen/X86/ |
shift-combine-crash.ll | 8 ; The first shift of the legalized sequence would be a shift by all undefs.
|
/external/llvm/lib/LTO/ |
LTOCodeGenerator.cpp | 111 const std::vector<const char *> &undefs = Mod->getAsmUndefinedRefs(); local 112 for (int i = 0, e = undefs.size(); i != e; ++i) 113 AsmUndefinedRefs[undefs[i]] = 1; 127 const std::vector<const char*> &Undefs = Mod->getAsmUndefinedRefs(); 128 for (int I = 0, E = Undefs.size(); I != E; ++I) 129 AsmUndefinedRefs[Undefs[I]] = 1;
|
/external/llvm/utils/PerfectShuffle/ |
PerfectShuffle.cpp | 50 /// hasUndefElements - Return true if any of the elements in the mask are undefs 67 return Mask & 0xBBBB; // Keep only LHS and Undefs. 204 // If this value has already been evaluated, it is free. FIXME: match undefs. 239 // operation left in the table. Second, make sure that values with undefs 253 // there are 3 undefs, the number rises to 729 entries we have to scan,
|
/external/llvm/test/CodeGen/AArch64/ |
fcvt_combine.ll | 103 ; Don't combine all undefs.
|
/prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/lib/gcc/x86_64-w64-mingw32/4.8.3/plugin/include/config/i386/ |
mingw32.h | 97 Make the unwind registration references strong undefs. */
|
/toolchain/binutils/binutils-2.25/include/ |
bfdlink.h | 168 struct bfd_link_hash_entry *undefs; 169 /* Entries are added to the tail of the undefs list. */ 204 /* Add an entry to the undefs list. */ 208 /* Remove symbols from the undefs list that don't belong there. */ 167 struct bfd_link_hash_entry *undefs; member in struct:bfd_link_hash_table
|