Home
last modified time | relevance | path

Searched refs:GT (Results 1 – 25 of 133) sorted by relevance

123456

/llvm-project-15.0.7/llvm/include/llvm/ADT/
H A DSCCIterator.h49 using NodeRef = typename GT::NodeRef;
50 using ChildItTy = typename GT::ChildIteratorType;
106 return scc_iterator(GT::getEntryNode(G)); in begin()
149 template <class GraphT, class GT>
161 template <class GraphT, class GT>
181 template <class GraphT, class GT> void scc_iterator<GraphT, GT>::GetNextSCC() { in GetNextSCC()
218 template <class GraphT, class GT>
224 for (ChildItTy CI = GT::child_begin(N), CE = GT::child_end(N); CI != CE; in hasCycle()
253 using NodeType = typename GT::NodeType;
254 using EdgeType = typename GT::EdgeType;
[all …]
H A DBreadthFirstIterator.h47 class GT = GraphTraits<GraphT>>
51 using value_type = typename GT::NodeRef;
57 using NodeRef = typename GT::NodeRef;
58 using ChildItTy = typename GT::ChildIteratorType;
88 ChildIt.emplace(GT::child_begin(Node)); in toNext()
89 while (*ChildIt != GT::child_end(Node)) { in toNext()
116 return bf_iterator(GT::getEntryNode(G)); in begin()
H A DPostOrderIterator.h95 bool ExtStorage = false, class GT = GraphTraits<GraphT>>
99 using value_type = typename GT::NodeRef;
105 using NodeRef = typename GT::NodeRef;
106 using ChildItTy = typename GT::ChildIteratorType;
114 VisitStack.push_back(std::make_pair(BB, GT::child_begin(BB))); in po_iterator()
123 VisitStack.push_back(std::make_pair(BB, GT::child_begin(BB))); in po_iterator()
137 VisitStack.push_back(std::make_pair(BB, GT::child_begin(BB))); in traverseChild()
145 return po_iterator(GT::getEntryNode(G)); in begin()
150 return po_iterator(GT::getEntryNode(G), S); in begin()
290 template<class GraphT, class GT = GraphTraits<GraphT>>
[all …]
H A DDepthFirstIterator.h85 bool ExtStorage = false, class GT = GraphTraits<GraphT>>
89 using value_type = typename GT::NodeRef;
95 using NodeRef = typename GT::NodeRef;
96 using ChildItTy = typename GT::ChildIteratorType;
130 Opt.emplace(GT::child_begin(Node)); in toNext()
135 while (*Opt != GT::child_end(Node)) { in toNext()
154 return df_iterator(GT::getEntryNode(G)); in begin()
160 return df_iterator(GT::getEntryNode(G), S); in begin()
/llvm-project-15.0.7/llvm/unittests/ADT/
H A DSCCIteratorTest.cpp24 typedef Graph<NUM_NODES> GT; in TEST() typedef
30 GT G; in TEST()
49 GT::NodeSubset NodesInSomeSCC; in TEST()
51 for (scc_iterator<GT> I = scc_begin(G), E = scc_end(G); I != E; ++I) { in TEST()
52 const std::vector<GT::NodeType *> &SCC = *I; in TEST()
55 GT::NodeSubset NodesInThisSCC; in TEST()
76 GT::NodeSubset NodesReachableFromSCC = G.NodesReachableFrom(i); in TEST()
77 GT::NodeSubset ReachableButNotInSCC = in TEST()
106 GT::NodeSubset NodesReachableFromSCC = G.NodesReachableFrom(i); in TEST()
/llvm-project-15.0.7/llvm/test/CodeGen/Mips/
H A Dcountleading.ll5 ; RUN: llc -march=mips64el -mcpu=mips64 < %s | FileCheck -check-prefixes=MIPS-GT-R1,MIPS64-GT-R1 …
6 ; RUN: llc -march=mips64el -mcpu=mips64r2 < %s | FileCheck -check-prefixes=MIPS-GT-R1,MIPS64-GT-R1 …
7 ; RUN: llc -march=mips64el -mcpu=mips64r6 < %s | FileCheck -check-prefixes=MIPS-GT-R1,MIPS64-GT-R1 …
16 ; MIPS-GT-R1-LABEL: ctlz_i32:
18 ; MIPS-GT-R1-NEXT: jr $ra
19 ; MIPS-GT-R1-NEXT: clz $2, $4
65 ; MIPS-GT-R1-LABEL: ctlo_i32:
67 ; MIPS-GT-R1-NEXT: jr $ra
68 ; MIPS-GT-R1-NEXT: clo $2, $4
136 ; MIPS64-GT-R1-NEXT: jr $ra
[all …]
/llvm-project-15.0.7/llvm/lib/Target/ARM/Utils/
H A DARMBaseInfo.h43 GT, // Greater than Greater than enumerator
63 case GT: return LE; in getOppositeCondition()
64 case LE: return GT; in getOppositeCondition()
81 case ARMCC::LT: return ARMCC::GT; in getSwappedCondition()
82 case ARMCC::GT: return ARMCC::LT; in getSwappedCondition()
160 case ARMCC::GT: return "gt"; in ARMCondCodeToString()
183 .Case("gt", ARMCC::GT) in ARMCondCodeFromString()
/llvm-project-15.0.7/llvm/include/llvm/Analysis/
H A DIntervalIterator.h86 template<class NodeTy, class OrigContainer_t, class GT = GraphTraits<NodeTy *>,
183 for (typename GT::ChildIteratorType I = GT::child_begin(Node), in ProcessInterval()
184 E = GT::child_end(Node); I != E; ++I) in ProcessInterval()
234 for (typename GT::ChildIteratorType It = GT::child_begin(Node), in ProcessNode()
235 End = GT::child_end(Node); It != End; ++It) in ProcessNode()
H A DCFG.h135 class GT = GraphTraits<NodeT>>
151 for (NodeT Succ : make_range(GT::child_begin(Node), GT::child_end(Node))) { in containsIrreducibleCFG()
/llvm-project-15.0.7/compiler-rt/test/fuzzer/
H A DRepeatedBytesTest.cpp22 int GT = CurA > MaxA; in LLVMFuzzerTestOneInput() local
23 MaxA = GT * CurA + (!GT) * MaxA; in LLVMFuzzerTestOneInput()
/llvm-project-15.0.7/llvm/test/CodeGen/AVR/
H A Drust-avr-bug-95.ll9 define void @"_ZN65_$LT$lib..str..Chars$LT$$u27$a$GT$$u20$as$u20$lib..fmt..Debug$GT$3fmt17h76a537e2…
10 ; CHECK-LABEL: "_ZN65_$LT$lib..str..Chars$LT$$u27$a$GT$$u20$as$u20$lib..fmt..Debug$GT$3fmt17h76a537…
H A Dissue-regalloc-stackframe-folding-earlyclobber.ll99 …bel %"_ZN4core5slice70_$LT$impl$u20$core..ops..IndexMut$LT$I$GT$$u20$for$u20$$u5b$T$u5d$$GT$9index…
104 "_ZN4core5slice70_$LT$impl$u20$core..ops..IndexMut$LT$I$GT$$u20$for$u20$$u5b$T$u5d$$GT$9index_mut17…
109 …15, %"_ZN4core5slice70_$LT$impl$u20$core..ops..IndexMut$LT$I$GT$$u20$for$u20$$u5b$T$u5d$$GT$9index…
/llvm-project-15.0.7/llvm/lib/Target/AArch64/
H A DAArch64ConditionOptimizer.cpp232 case AArch64CC::GT: return AArch64CC::GE; in getAdjustedCmp()
233 case AArch64CC::GE: return AArch64CC::GT; in getAdjustedCmp()
251 int Correction = (Cmp == AArch64CC::GT) ? 1 : -1; in adjustCmp()
398 if (((HeadCmp == AArch64CC::GT && TrueCmp == AArch64CC::LT) || in runOnMachineFunction()
399 (HeadCmp == AArch64CC::LT && TrueCmp == AArch64CC::GT)) && in runOnMachineFunction()
419 } else if (((HeadCmp == AArch64CC::GT && TrueCmp == AArch64CC::GT) || in runOnMachineFunction()
/llvm-project-15.0.7/third-party/benchmark/test/
H A Dperf_counters_test.cc17 CHECK_COUNTER_VALUE(e, double, "CYCLES", GT, 0); in CheckSimple()
18 CHECK_COUNTER_VALUE(e, double, "BRANCHES", GT, 0.0); in CheckSimple()
/llvm-project-15.0.7/llvm/test/CodeGen/Hexagon/
H A Dhwloop-long.ll4 ; Tests signed/unsigned GT, EQ, and NEQ cases.
6 ; signed GT case
27 ; unsigned signed GT case
/llvm-project-15.0.7/llvm/test/CodeGen/WebAssembly/
H A Dumulo-i64.ll5 ; CHECK-LABEL: _ZN4core3num21_$LT$impl$u20$u64$GT$15overflowing_mul17h07be88b4cbac028fE:
8 define void @"_ZN4core3num21_$LT$impl$u20$u64$GT$15overflowing_mul17h07be88b4cbac028fE"(i64, i64) u…
/llvm-project-15.0.7/llvm/lib/Target/SPIRV/
H A DSPIRVDuplicatesTracker.h113 SPIRVDuplicatesTracker<GlobalVariable> GT; variable
142 GT.add(GV, MF, R); in add()
162 return GT.find(const_cast<GlobalVariable *>(GV), MF); in find()
/llvm-project-15.0.7/llvm/lib/Target/NVPTX/
H A DNVPTX.h32 GT, enumerator
156 GT, enumerator
/llvm-project-15.0.7/llvm/test/tools/llvm-ml/
H A Dnamed_operators.asm54 t8 BYTE 5 GT 6
55 BYTE 6 GT 6
56 BYTE 7 GT 6
/llvm-project-15.0.7/llvm/test/CodeGen/PowerPC/
H A Dregalloc-fast-debug-spill.ll207 …cess_inner66_$LT$impl$u20$std..sys..unix..process..process_common..Command$GT$7do_fork10HAS_CLONE3…
219 …$alloc..vec..Vec$LT$T$C$A$GT$$u20$as$u20$alloc..vec..spec_extend..SpecExtend$LT$$RF$T$C$core..slic…
231 …lice<u8, alloc::alloc::Global>", linkageName: "_ZN5alloc3vec16Vec$LT$T$C$A$GT$17extend_from_slice1…
238 …ame: "_ZN82_$LT$std..io..buffered..bufreader..BufReader$LT$R$GT$$u20$as$u20$std..io..Read$GT$11rea…
244 …linkageName: "_ZN59_$LT$std..io..stdio..StdinLock$u20$as$u20$std..io..Read$GT$11read_to_end17h3899…
248 …d", linkageName: "_ZN55_$LT$std..io..stdio..Stdin$u20$as$u20$std..io..Read$GT$11read_to_end17haba7…
/llvm-project-15.0.7/llvm/include/llvm/MC/
H A DMCSymbolWasm.h135 void setGlobalType(wasm::WasmGlobalType GT) { GlobalType = GT; } in setGlobalType() argument
/llvm-project-15.0.7/llvm/lib/Target/AArch64/GISel/
H A DAArch64GlobalISelUtils.cpp110 CondCode = AArch64CC::GT; in changeFCMPPredToAArch64CC()
123 CondCode2 = AArch64CC::GT; in changeFCMPPredToAArch64CC()
/llvm-project-15.0.7/llvm/lib/Target/ARC/MCTargetDesc/
H A DARCInfo.h34 GT = 0x9, enumerator
/llvm-project-15.0.7/llvm/test/MC/ARM/
H A Dmve-vcmp.s38 …]:10: {{error|note}}: condition code for floating-point comparison must be EQ, NE, LT, GT, LE or GE
41 …]:10: {{error|note}}: condition code for floating-point comparison must be EQ, NE, LT, GT, LE or GE
74 …]:10: {{error|note}}: condition code for floating-point comparison must be EQ, NE, LT, GT, LE or GE
77 …]:10: {{error|note}}: condition code for floating-point comparison must be EQ, NE, LT, GT, LE or GE
126 …]]:9: {{error|note}}: condition code for signed integer comparison must be EQ, NE, LT, GT, LE or GE
173 …]:10: {{error|note}}: condition code for signed integer comparison must be EQ, NE, LT, GT, LE or GE
220 …]:10: {{error|note}}: condition code for signed integer comparison must be EQ, NE, LT, GT, LE or GE
/llvm-project-15.0.7/flang/lib/Common/
H A DFortran.cpp58 case RelationalOperator::GT: in AsFortran()

123456