Searched refs:GT (Results 1 - 25 of 66) sorted by relevance

123

/macosx-10.9.5/llvmCore-3425.0.33/include/llvm/ADT/
H A DSCCIterator.h35 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 DPostOrderIterator.h90 class GT = GraphTraits<GraphT> >
92 typename GT::NodeType, ptrdiff_t>,
95 typename GT::NodeType, ptrdiff_t> super;
96 typedef typename GT::NodeType NodeType;
97 typedef typename GT::ChildIteratorType ChildItTy;
104 while (VisitStack.back().second != GT::child_end(VisitStack.back().first)) {
108 VisitStack.push_back(std::make_pair(BB, GT::child_begin(BB)));
115 VisitStack.push_back(std::make_pair(BB, GT::child_begin(BB)));
123 VisitStack.push_back(std::make_pair(BB, GT::child_begin(BB)));
133 typedef po_iterator<GraphT, SetType, ExtStorage, GT> _Sel
[all...]
H A DDepthFirstIterator.h64 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...]
/macosx-10.9.5/llvmCore-3425.0.33/unittests/ADT/
H A DSCCIteratorTest.cpp252 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);
/macosx-10.9.5/llvmCore-3425.0.33/lib/Target/NVPTX/
H A DNVPTX.h37 GT, enumerator in enum:llvm::NVPTXCC::CondCodes
48 case NVPTXCC::GT: return "gt";
/macosx-10.9.5/llvmCore-3425.0.33/tools/opt/
H A DGraphPrinters.cpp27 const GraphType &GT) {
34 WriteGraph(F.os(), GT);
26 WriteGraphToFile(raw_ostream &O, const std::string &GraphName, const GraphType &GT) argument
/macosx-10.9.5/llvmCore-3425.0.33/include/llvm/Analysis/
H A DIntervalIterator.h88 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)
H A DBlockFrequencyImpl.h49 typedef GraphTraits< Inverse<BlockT *> > GT; typedef in class:llvm::BlockFrequencyImpl
156 typename GT::ChildIteratorType
193 for (typename GT::ChildIteratorType
237 for (typename GT::ChildIteratorType
289 for (typename GT::ChildIteratorType
/macosx-10.9.5/Security-55471.14.18/include/security_codesigning/
H A DRequirementParserTokenTypes.hpp48 GT = 36, enumerator in enum:RequirementParserTokenTypes::__anon3629
/macosx-10.9.5/Security-55471.14.18/libsecurity_codesigning/lib/
H A DRequirementParserTokenTypes.hpp48 GT = 36, enumerator in enum:RequirementParserTokenTypes::__anon4341
/macosx-10.9.5/llvmCore-3425.0.33/lib/Target/MBlaze/
H A DMBlazeISelLowering.h30 GT, enumerator in enum:llvm::MBlazeCC::CC
41 case GT: return LE;
53 case GT: return "gt";
/macosx-10.9.5/awk-18/src/
H A Dytab.h70 GT = 286, enumerator in enum:yytokentype
167 #define GT 286 macro
H A Dytabh.bak59 GT = 285,
154 #define GT 285
H A Dmaketab.c51 { GT, "relop", " > " },
H A Dawkgram.y54 %token <i> AND BOR APPEND EQ GE GT LE LT NE IN
81 %nonassoc APPEND EQ GE GT LE LT NE MATCHOP IN '|'
229 | pattern GT pattern { $$ = op2($2, $1, $3); }
301 | print prarg GT term {
470 case LE: case LT: case EQ: case NE: case GT: case GE:
/macosx-10.9.5/BerkeleyDB-21/db/examples_c/csv/
H A Dcsv.h65 typedef enum { EQ=1, NEQ, GT, GTEQ, LT, LTEQ, WC, NWC } OPERATOR; enumerator in enum:__anon328
H A Dutil.c194 case GT:
237 case GT:
261 case GT:
290 case GT:
H A Dquery.c175 operator = GT;
H A DDbRecord.c292 if (op == GT)
432 if (op == GT) {
/macosx-10.9.5/llvmCore-3425.0.33/lib/Target/ARM/MCTargetDesc/
H A DARMBaseInfo.h42 GT, // Greater than Greater than enumerator in enum:llvm::ARMCC::CondCodes
62 case GT: return LE;
63 case LE: return GT;
82 case ARMCC::GT: return "gt";
/macosx-10.9.5/ruby-104/ruby/lib/rexml/
H A Dentity.rb156 GT = Entity.new( 'gt', '>' )
H A Ddoctype.rb19 'gt'=>EntityConst::GT,
/macosx-10.9.5/ncurses-42/ncurses/progs/
H A Dtset.c272 #define GT 0x01 macro
276 #define GE (GT | EQ)
418 if (mapp->conditional & GT)
425 mapp->conditional |= GT;
463 mapp->conditional = ~mapp->conditional & (EQ | GT | LT);
480 if (mapp->conditional & GT) {
481 (void) printf("GT");
517 case GT:
/macosx-10.9.5/bash-92/bash-3.2/
H A Dtest.c81 #define GT 3 macro
348 case GT: return (l > r);
392 case 'g': return (arithcomp (arg1, arg2, GT, flags)); /* -gt */
/macosx-10.9.5/JavaScriptCore-7537.78.1/parser/
H A DParserTokens.h127 GT = 10 | BINARY_OP_PRECEDENCE(7), enumerator in enum:JSC::JSTokenType

Completed in 239 milliseconds

123