HomeSort by relevance Sort by last modified time
    Searched refs:GT (Results 1 - 25 of 94) sorted by null

1 2 3 4

  /external/llvm/include/llvm/ADT/
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::getEntryNode(G));
    [all...]
PostOrderIterator.h 90 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> _Self
    [all...]
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::child_begin(Next)))
    [all...]
  /hardware/ti/omap3/dspbridge/inc/
dbc.h 30 * Requires that the GT->ERROR function has been defaulted to a valid
51 #include <gt.h>
55 (*GT->ERRORFXN)("%s, line %d: Assertion (" #exp ") failed.\n", \
gt.h 19 * ======== gt.h ========
31 *! 02-Feb-2000 rr: Renamed this file to gtce.h. GT CLASS and trace definitions
55 extern struct GT_Config *GT;
63 * New GT Class defenitions.
258 (*GT->ERRORFXN)("assertion violation: %s, line %d\n", \
  /external/llvm/unittests/ADT/
SCCIteratorTest.cpp 252 typedef Graph<NUM_NODES> GT;
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/llvm/lib/Target/NVPTX/
NVPTX.h 37 GT,
48 case NVPTXCC::GT: return "gt";
  /external/llvm/tools/opt/
GraphPrinters.cpp 27 const GraphType &GT) {
34 WriteGraph(F.os(), GT);
  /external/llvm/include/llvm/Analysis/
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)
BlockFrequencyImpl.h 49 typedef GraphTraits< Inverse<BlockT *> > GT;
156 typename GT::ChildIteratorType
193 for (typename GT::ChildIteratorType
237 for (typename GT::ChildIteratorType
289 for (typename GT::ChildIteratorType
  /external/llvm/lib/Target/MBlaze/
MBlazeISelLowering.h 30 GT,
41 case GT: return LE;
53 case GT: return "gt";
  /external/dexmaker/src/main/java/com/google/dexmaker/
Comparison.java 57 GT() {
  /frameworks/av/include/media/stagefright/foundation/
ADebug.h 56 MAKE_COMPARATOR(GT,>)
76 #define CHECK_GT(x,y) CHECK_OP(x,y,GT,>)
  /external/v8/src/
token.h 116 T(GT, ">", 10) \
219 return op == LT || op == LTE || op == GT || op == GTE;
233 case GT: return LTE;
234 case LTE: return GT;
247 case LT: return GT;
248 case GT: return LT;
  /external/webkit/Source/JavaScriptCore/assembler/
MacroAssemblerSH4.cpp 36 const Condition MacroAssemblerSH4::GreaterThan = SH4Assembler::GT;
53 const Condition MacroAssemblerSH4::DoubleGreaterThan = SH4Assembler::GT;
  /external/llvm/lib/Target/ARM/MCTargetDesc/
ARMBaseInfo.h 42 GT, // Greater than Greater than
62 case GT: return LE;
63 case LE: return GT;
82 case ARMCC::GT: return "gt";
  /external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime.Test/
TestExpressionFeatures.g3 61 GT = '>';
  /external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/org.eclipse.build.tools/
bugTools.jar 
  /external/webkit/Source/JavaScriptCore/parser/
JSParser.h 125 GT = 10 | BINARY_OP_PRECEDENCE(7),
  /ndk/sources/host-tools/nawk-20071023/
maketab.c 51 { GT, "relop", " > " },
awkgram.y 54 %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 {
469 case LE: case LT: case EQ: case NE: case GT: case GE:
  /external/skia/third_party/glu/libtess/
priorityq.c 94 #define GT(x,y) (! LEQ(x,y))
141 do { ++i; } while( GT( **i, *piv ));
  /external/chromium/googleurl/base/
logging.h 269 DEFINE_DCHECK_OP_IMPL(GT, > )
302 #define DCHECK_GT(val1, val2) DCHECK_OP(GT, > , val1, val2)
  /external/chromium/base/
logging.h 520 DEFINE_CHECK_OP_IMPL(GT, > )
528 #define CHECK_GT(val1, val2) CHECK_OP(GT, > , val1, val2)
706 #define DCHECK_GT(val1, val2) DCHECK_OP(GT, > , val1, val2)
    [all...]
  /external/llvm/include/llvm/MC/
MCExpr.h 316 GT, ///< Signed greater than comparison (result is either 0 or some
367 return Create(GT, LHS, RHS, Ctx);

Completed in 1452 milliseconds

1 2 3 4