/external/llvm/include/llvm/ADT/ |
H A D | SCCIterator.h | 39 template <class GraphT, class GT = GraphTraits<GraphT>> 42 scc_iterator<GraphT, GT>, std::forward_iterator_tag, 43 const std::vector<typename GT::NodeType *>, ptrdiff_t> { 44 typedef typename GT::NodeType NodeType; 45 typedef typename GT::ChildIteratorType ChildItTy; 101 return scc_iterator(GT::getEntryNode(G)); 141 template <class GraphT, class GT> 142 void scc_iterator<GraphT, GT>::DFSVisitOne(NodeType *N) { 146 VisitStack.push_back(StackElement(N, GT::child_begin(N), visitNum)); 153 template <class GraphT, class GT> [all...] |
H A D | PostOrderIterator.h | 92 class GT = GraphTraits<GraphT> > 94 typename GT::NodeType, ptrdiff_t>, 97 typename GT::NodeType, ptrdiff_t> super; 98 typedef typename GT::NodeType NodeType; 99 typedef typename GT::ChildIteratorType ChildItTy; 106 while (VisitStack.back().second != GT::child_end(VisitStack.back().first)) { 110 VisitStack.push_back(std::make_pair(BB, GT::child_begin(BB))); 117 VisitStack.push_back(std::make_pair(BB, GT::child_begin(BB))); 125 VisitStack.push_back(std::make_pair(BB, GT::child_begin(BB))); 138 return po_iterator(GT [all...] |
H A D | DepthFirstIterator.h | 64 bool ExtStorage = false, class GT = GraphTraits<GraphT> > 66 typename GT::NodeType, ptrdiff_t>, 69 typename GT::NodeType, ptrdiff_t> super; 71 typedef typename GT::NodeType NodeType; 72 typedef typename GT::ChildIteratorType ChildItTy; 84 std::make_pair(PointerIntTy(Node, 0), GT::child_begin(Node))); 93 std::make_pair(PointerIntTy(Node, 0), GT::child_begin(Node))); 109 It = GT::child_begin(Node); 113 while (It != GT::child_end(Node)) { 119 std::make_pair(PointerIntTy(Next, 0), GT [all...] |
/external/swiftshader/third_party/LLVM/include/llvm/ADT/ |
H A D | SCCIterator.h | 35 template<class GraphT, class GT = GraphTraits<GraphT> > 38 std::vector<typename GT::NodeType>, ptrdiff_t> { 39 typedef typename GT::NodeType NodeType; 40 typedef typename GT::ChildIteratorType ChildItTy; 43 std::vector<typename GT::NodeType>, ptrdiff_t> super; 74 VisitStack.push_back(std::make_pair(N, GT::child_begin(N))); 82 while (VisitStack.back().second != GT::child_end(VisitStack.back().first)) { 103 assert(VisitStack.back().second ==GT::child_end(VisitStack.back().first)); 138 typedef scc_iterator<GraphT, GT> _Self; 141 static inline _Self begin(const GraphT &G){return _Self(GT [all...] |
H A D | PostOrderIterator.h | 51 class GT = GraphTraits<GraphT> > 53 typename GT::NodeType, ptrdiff_t>, 56 typename GT::NodeType, ptrdiff_t> super; 57 typedef typename GT::NodeType NodeType; 58 typedef typename GT::ChildIteratorType ChildItTy; 65 while (VisitStack.back().second != GT::child_end(VisitStack.back().first)) { 68 VisitStack.push_back(std::make_pair(BB, GT::child_begin(BB))); 75 VisitStack.push_back(std::make_pair(BB, GT::child_begin(BB))); 83 VisitStack.push_back(std::make_pair(BB, GT::child_begin(BB))); 93 typedef po_iterator<GraphT, SetType, ExtStorage, GT> _Sel [all...] |
H A D | DepthFirstIterator.h | 64 bool ExtStorage = false, class GT = GraphTraits<GraphT> > 66 typename GT::NodeType, ptrdiff_t>, 69 typename GT::NodeType, ptrdiff_t> super; 71 typedef typename GT::NodeType NodeType; 72 typedef typename GT::ChildIteratorType ChildItTy; 83 GT::child_begin(Node))); 92 GT::child_begin(Node))); 108 It = GT::child_begin(Node); 112 while (It != GT::child_end(Node)) { 119 GT [all...] |
/external/deqp/modules/gles2/functional/ |
H A D | es2fShaderOperatorTests.cpp | 218 GT = VALUE_FLOAT_GENTYPE, enumerator in enum:deqp::gles2::Functional::ValueType 961 << BuiltinOperInfo("plus", "+", GT, Value(GT, -1.0f, 1.0f), notUsed, notUsed, 0.5f, 0.5f, PRECMASK_ALL, FLOAT_GENTYPE_FUNCS(nop)) 963 << BuiltinOperInfo("minus", "-", GT, Value(GT, -1.0f, 1.0f), notUsed, notUsed, 0.5f, 0.5f, PRECMASK_ALL, FLOAT_GENTYPE_FUNCS(negate)) 968 << BuiltinSideEffOperInfo ("pre_increment_effect", "++", GT, Value(GT, -1.0f, 1.0f), notUsed, notUsed, 0.5f, 0.0f, PRECMASK_ALL, FLOAT_GENTYPE_FUNCS(addOne)) 970 << BuiltinSideEffOperInfo ("pre_decrement_effect", "--", GT, Value(GT, -1.0f, 1.0f), notUsed, notUsed, 0.5f, 1.0f, PRECMASK_ALL, FLOAT_GENTYPE_FUNCS(subOne)) 972 << BuiltinPostSideEffOperInfo ("post_increment_effect", "++", GT, Valu [all...] |
/external/r8/src/main/java/com/android/tools/r8/ir/code/ |
H A D | If.java | 17 EQ, GE, GT, LE, LT, NE; enum constant in enum:If.Type 27 case GT: 32 return Type.GT; 44 case GT: 47 return Type.GT; 165 case GT:
|
/external/jacoco/org.jacoco.report/src/org/jacoco/report/internal/xml/ |
H A D | XMLElement.java | 33 private static final char GT = '>'; field in class:XMLElement 82 writer.append(GT); 116 case GT: 257 writer.write(GT);
|
/external/llvm/unittests/ADT/ |
H A D | SCCIteratorTest.cpp | 250 typedef Graph<NUM_NODES> GT; typedef 256 GT G; 275 GT::NodeSubset NodesInSomeSCC; 277 for (scc_iterator<GT> I = scc_begin(G), E = scc_end(G); I != E; ++I) { 278 const std::vector<GT::NodeType *> &SCC = *I; 281 GT::NodeSubset NodesInThisSCC; 301 GT::NodeSubset NodesReachableFromSCC = G.NodesReachableFrom(i); 302 GT::NodeSubset ReachableButNotInSCC = 330 GT::NodeSubset NodesReachableFromSCC = G.NodesReachableFrom(i);
|
/external/ltp/testcases/lib/ |
H A D | tst_kvcmp.c | 29 GT, enumerator in enum:op 49 return GT; 143 case GT: 188 case GT:
|
/external/r8/src/main/java/com/android/tools/r8/code/ |
H A D | IfGt.java | 36 return Type.GT;
|
H A D | IfGtz.java | 36 return Type.GT;
|
H A D | CmpgDouble.java | 38 builder.addCmp(NumericType.DOUBLE, Bias.GT, AA, BB, CC);
|
H A D | CmpgFloat.java | 38 builder.addCmp(NumericType.FLOAT, Bias.GT, AA, BB, CC);
|
/external/swiftshader/third_party/LLVM/unittests/ADT/ |
H A D | SCCIteratorTest.cpp | 252 typedef Graph<NUM_NODES> GT; typedef 258 GT G; 277 GT::NodeSubset NodesInSomeSCC; 279 for (scc_iterator<GT> I = scc_begin(G), E = scc_end(G); I != E; ++I) { 280 std::vector<GT::NodeType*> &SCC = *I; 283 GT::NodeSubset NodesInThisSCC; 303 GT::NodeSubset NodesReachableFromSCC = G.NodesReachableFrom(i); 304 GT::NodeSubset ReachableButNotInSCC = 332 GT::NodeSubset NodesReachableFromSCC = G.NodesReachableFrom(i);
|
/external/swiftshader/third_party/LLVM/tools/opt/ |
H A D | GraphPrinters.cpp | 27 const GraphType >) {
34 WriteGraph(F.os(), GT);
26 WriteGraphToFile(raw_ostream &O, const std::string &GraphName, const GraphType >) argument
|
/external/llvm/include/llvm/Analysis/ |
H A D | IntervalIterator.h | 88 template<class NodeTy, class OrigContainer_t, class GT = GraphTraits<NodeTy*>, 183 for (typename GT::ChildIteratorType I = GT::child_begin(Node), 184 E = GT::child_end(Node); I != E; ++I) 237 for (typename GT::ChildIteratorType It = GT::child_begin(Node), 238 End = GT::child_end(Node); It != End; ++It)
|
/external/swiftshader/third_party/LLVM/include/llvm/Analysis/ |
H A D | IntervalIterator.h | 88 template<class NodeTy, class OrigContainer_t, class GT = GraphTraits<NodeTy*>, 174 for (typename GT::ChildIteratorType I = GT::child_begin(Node), 175 E = GT::child_end(Node); I != E; ++I) 228 for (typename GT::ChildIteratorType It = GT::child_begin(Node), 229 End = GT::child_end(Node); It != End; ++It)
|
/external/dexmaker/dexmaker/src/main/java/com/android/dx/ |
H A D | Comparison.java | 61 GT() { method in enum:Comparison
|
/external/llvm/lib/Target/NVPTX/ |
H A D | NVPTX.h | 39 GT, enumerator in enum:llvm::NVPTXCC::CondCodes 147 GT, enumerator in enum:llvm::NVPTX::PTXCmpMode::CmpMode
|
/external/valgrind/none/tests/s390x/ |
H A D | cgij.c | 19 #define GT 2 macro 90 CGIJ(7,GT,8,2a) "\n\t" /* 0x2a == 42 */
|
H A D | cij.c | 19 #define GT 2 macro 90 CIJ(7,GT,8,2a) "\n\t" /* 0x2a == 42 */
|
H A D | clgij.c | 19 #define GT 2 macro 90 CLGIJ(7,GT,8,2a) "\n\t" /* 0x2a == 42 */
|
H A D | clij.c | 19 #define GT 2 macro 90 CLIJ(7,GT,8,2a) "\n\t" /* 0x2a == 42 */
|