| /llvm-project-15.0.7/llvm/test/CodeGen/Thumb2/ |
| H A D | thumb2-jtb.ll | 17 codeRepl127.exitStub: ; preds = %_getopt_internal.exit.ce 28 bb1.i.exitStub: ; preds = %_getopt_internal.exit.ce 31 bb90.i.exitStub: ; preds = %_getopt_internal.exit.ce 34 codeRepl104.exitStub: ; preds = %_getopt_internal.exit.ce 37 codeRepl113.exitStub: ; preds = %_getopt_internal.exit.ce 40 codeRepl51.exitStub: ; preds = %_getopt_internal.exit.ce 43 codeRepl70.exitStub: ; preds = %_getopt_internal.exit.ce 49 codeRepl93.exitStub: ; preds = %_getopt_internal.exit.ce 58 codeRepl89.exitStub: ; preds = %_getopt_internal.exit.ce 104 br label %_getopt_internal.exit.ce [all …]
|
| /llvm-project-15.0.7/compiler-rt/lib/builtins/hexagon/ |
| H A D | fastmath2_ldlib_asm.S | 63 #define ce P0 macro 73 ce = CMP.GT(expa, expb); define 78 if ( ce) expa = #1 79 if (!ce) expb = #1 86 if (!ce) expa = add(expd, #1) 87 if ( ce) expb = add(expd, #1) 162 #define ce P0 macro 172 ce = CMP.GT(expa, expb); define 177 if ( ce) expa = #1 178 if (!ce) expb = #1 [all …]
|
| H A D | fastmath2_dlib_asm.S | 73 #define ce P0 macro 82 ce = CMP.GT(expa, expb); define 86 if ( ce) expa = #1 87 if (!ce) expb = #1 91 if (!ce) expa = add(expd, #1) 92 if ( ce) expb = add(expd, #1) 174 #define ce P0 macro 183 ce = CMP.GT(expa, expb); define 187 if ( ce) expa = #1 188 if (!ce) expb = #1 [all …]
|
| H A D | fastmath_dlib_asm.S | 81 #define ce P0 macro 90 ce = CMP.GT(expa, expb); define 94 if ( ce) expa = #1 95 if (!ce) expb = #1 99 if (!ce) expa = add(expd, #1) 100 if ( ce) expb = add(expd, #1) 216 #define ce P0 macro 225 ce = CMP.GT(expa, expb); define 229 if ( ce) expa = #1 230 if (!ce) expb = #1 [all …]
|
| /llvm-project-15.0.7/lldb/third_party/Python/module/pexpect-4.6/pexpect/ |
| H A D | screen.py | 153 def fill_region (self, rs,cs, re,ce, ch=SPACE): argument 161 ce = constrain (ce, 1, self.cols) 164 if cs > ce: 165 cs, ce = ce, cs 167 for c in range (cs, ce + 1): 252 def get_region (self, rs,cs, re,ce): argument 259 ce = constrain (ce, 1, self.cols) 262 if cs > ce: 263 cs, ce = ce, cs 267 for c in range (cs, ce + 1):
|
| /llvm-project-15.0.7/libcxx/test/std/input.output/filesystems/class.directory_entry/directory_entry.obs/ |
| H A D | comparisons.pass.cpp | 31 static_assert(std::is_same<decltype(ce Op ce), bool>::value, ""); \ 32 static_assert(noexcept(ce Op ce), "Operation must be noexcept" ) 40 directory_entry const ce(p); in test_comparison_signatures() local
|
| /llvm-project-15.0.7/clang/test/OpenMP/ |
| H A D | atomic_compare_codegen.cpp | 30 cx = cx > ce ? ce : cx; in foo() 32 cx = cx < ce ? ce : cx; in foo() 34 cx = ce > cx ? ce : cx; in foo() 36 cx = ce < cx ? ce : cx; in foo() 94 cx = cx > ce ? ce : cx; in foo() 96 cx = cx < ce ? ce : cx; in foo() 98 cx = ce > cx ? ce : cx; in foo() 100 cx = ce < cx ? ce : cx; in foo() 158 cx = cx > ce ? ce : cx; in foo() 160 cx = cx < ce ? ce : cx; in foo() [all …]
|
| /llvm-project-15.0.7/libcxx/test/std/ranges/range.access/ |
| H A D | rbegin.pass.cpp | 296 char cb, ce; member 308 char cb, ce; member 317 return bidirectional_iterator<const char*>(&v.ce); in end() 326 char cb, ce; member 333 return bidirectional_iterator<const char*>(&v.ce); in end() 342 char cb, ce; member 426 assert(base(std::ranges::crbegin(a).base()) == &a.ce); in testBeginEnd() 427 assert(base(std::ranges::rbegin(aa).base()) == &aa.ce); in testBeginEnd() 433 assert(base(std::ranges::crbegin(b).base()) == &b.ce); in testBeginEnd() 440 assert(base(std::ranges::crbegin(c).base()) == &c.ce); in testBeginEnd() [all …]
|
| H A D | rend.pass.cpp | 321 char cb, ce; member 325 …idirectional_iterator<const char*> end() const { return bidirectional_iterator<const char*>(&ce); } in end() 333 char cb, ce; member 342 return bidirectional_iterator<const char*>(&v.ce); in end() 351 char cb, ce; member 358 return bidirectional_iterator<const char*>(&v.ce); in end() 367 char cb, ce; member 375 …idirectional_iterator<const char*> end() const { return bidirectional_iterator<const char*>(&ce); } in end()
|
| /llvm-project-15.0.7/llvm/test/Transforms/HotColdSplit/ |
| H A D | phi-with-distinct-outlined-values.ll | 7 ; CHECK: phi i32 [ 0, %entry ], [ %p.ce.reload, %codeRepl ] 11 ; CHECK: %p.ce = phi i32 [ 1, %coldbb ], [ 3, %coldbb2 ] 12 ; CHECK-NEXT: store i32 %p.ce, ptr %p.ce.out
|
| H A D | split-phis-in-exit-blocks.ll | 8 ; CHECK-NEXT: %tmp8.ce.loc = alloca i1 16 ; CHECK-NEXT: call void @pluto.cold.1(ptr %tmp8.ce.loc) 17 ; CHECK-NEXT: %tmp8.ce.reload = load i1, ptr %tmp8.ce.loc 22 ; CHECK: %tmp8 = phi i1 [ true, %bb ], [ true, %bb ], [ %tmp8.ce.reload, %codeRepl ]
|
| H A D | succ-block-with-self-edge.ll | 9 ; CHECK: phi i32 [ 0, %entry ], [ %p.ce.reload, %codeRepl ] 32 ; CHECK: phi i32 [ 0, %entry ], [ %p.ce.reload, %codeRepl ]
|
| H A D | duplicate-phi-preds-crash.ll | 18 ; CHECK: call {{.*}}@realloc2.cold.1(i64 %size, i8* %ptr, i8** %retval.0.ce.loc) 20 ; CHECK-NEXT: phi i8* [ null, %if.then ], [ %call, %if.end ], [ %retval.0.ce.reload, %codeRepl ]
|
| /llvm-project-15.0.7/compiler-rt/lib/tsan/rtl-old/ |
| H A D | tsan_clock.cpp | 199 for (ClockElem &ce : *sc) { in releaseStoreAcquire() 201 if (clk_[i] < ce.epoch) { in releaseStoreAcquire() 202 clk_[i] = ce.epoch; in releaseStoreAcquire() 205 ce.epoch = tmp; in releaseStoreAcquire() 206 ce.reused = 0; in releaseStoreAcquire() 251 for (ClockElem &ce : *dst) { in release() 252 ce.epoch = max(ce.epoch, clk_[i]); in release() 253 ce.reused = 0; in release() 312 ce.epoch = clk_[i]; in ReleaseStore() 313 ce.reused = 0; in ReleaseStore() [all …]
|
| /llvm-project-15.0.7/libcxx/test/std/strings/basic.string/string.iterators/ |
| H A D | rend.pass.cpp | 27 typename S::const_reverse_iterator ce = cs.rend(); in test() local 31 assert(ce == cs.rbegin()); in test() 34 assert(static_cast<std::size_t>(ce - cs.rbegin()) == cs.size()); in test()
|
| H A D | end.pass.cpp | 27 typename S::const_iterator ce = cs.end(); in test() local 31 assert(ce == cs.begin()); in test() 34 assert(static_cast<std::size_t>(ce - cs.begin()) == cs.size()); in test()
|
| H A D | crend.pass.cpp | 23 typename S::const_reverse_iterator ce = s.crend(); in test() local 24 assert(ce == s.rend()); in test()
|
| H A D | cend.pass.cpp | 23 typename S::const_iterator ce = s.cend(); in test() local 24 assert(ce == s.end()); in test()
|
| /llvm-project-15.0.7/lld/test/MachO/ |
| H A D | literal-dedup.s | 34 # CHECK-NEXT: [[#%.16x,FEEDFACE16:]] ce fa ed fe ce fa ed fe ce fa ed fe ce fa ed fe 35 # CHECK-NEXT: [[#%.16x,DEADBEEF8:]] ef be ad de ef be ad de ce fa ed fe ce fa ed fe 36 # CHECK-NEXT: [[#%.16x,DEADBEEF4:]] ef be ad de ce fa ed fe
|
| /llvm-project-15.0.7/llvm/test/MC/WebAssembly/ |
| H A D | custom-section-alignment.ll | 6 !1 = !{ !"__clangast", !"\fe\ed\fa\ce" } 10 ; CHECK: {{(([0-9a-f]{2} ){4})*}}fe ed fa ce
|
| /llvm-project-15.0.7/clang/test/CXX/special/class.inhctor/ |
| H A D | p2.cpp | 93 constexpr ConstexprEval3 ce{4, "foobar"}; variable 94 static_assert(ce.k == 'a', ""); 95 static_assert(ce.k2 == 'x', "");
|
| /llvm-project-15.0.7/llvm/test/tools/llvm-objcopy/ELF/ |
| H A D | strip-sections.test | 6 ## Validate the DATA-NOT line by showing that "fe ed fa ce" appears 43 # DATA-NOT: fe ed fa ce 45 # VALIDATE: {{^[^[:blank:]]+}} de ad be ef ca fe ba be fe ed fa ce
|
| /llvm-project-15.0.7/llvm/test/tools/llvm-extract/ |
| H A D | extract-blocks-with-groups.ll | 7 ; CHECK: define dso_local void @foo.if.split(i32 %arg1, i32 %arg, ptr %tmp.0.ce.out) { 29 ; CHECK: %tmp.0.ce = phi i32 [ %tmp13, %then ], [ %tmp25, %else ] 30 ; CHECK: store i32 %tmp.0.ce, ptr %tmp.0.ce.out
|
| /llvm-project-15.0.7/llvm/test/Analysis/ScalarEvolution/ |
| H A D | exit-count-select.ll | 5 ; https://alive2.llvm.org/ce/z/ZTNXgY 36 ; https://alive2.llvm.org/ce/z/rCVMmp 67 ; https://alive2.llvm.org/ce/z/rlaN4a 100 ; https://alive2.llvm.org/ce/z/8_p-zu 130 ; https://alive2.llvm.org/ce/z/RQmJiq 161 ; https://alive2.llvm.org/ce/z/zcHS_d 192 ; https://alive2.llvm.org/ce/z/-dUmmc 225 ; https://alive2.llvm.org/ce/z/VaCu9C
|
| /llvm-project-15.0.7/llvm/test/tools/llvm-profgen/Inputs/ |
| H A D | unique-linkage-name-probe.perfscript | 3 2017ce
|