| /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", \
|
| /external/llvm/lib/Target/NVPTX/ |
| NVPTX.h | 39 GT,
54 case NVPTXCC::GT:
55 return "gt";
158 GT,
|
| /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/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;
133 typename GT::ChildIteratorType
170 for (typename GT::ChildIteratorType
218 for (typename GT::ChildIteratorType
295 for (typename GT::ChildIteratorType
|
| /external/dexmaker/src/main/java/com/google/dexmaker/ |
| Comparison.java | 57 GT() {
|
| /external/valgrind/main/none/tests/s390x/ |
| cgij.c | 19 #define GT 2
90 CGIJ(7,GT,8,2a) "\n\t" /* 0x2a == 42 */
|
| cij.c | 19 #define GT 2
90 CIJ(7,GT,8,2a) "\n\t" /* 0x2a == 42 */
|
| clgij.c | 19 #define GT 2
90 CLGIJ(7,GT,8,2a) "\n\t" /* 0x2a == 42 */
|
| clij.c | 19 #define GT 2
90 CLIJ(7,GT,8,2a) "\n\t" /* 0x2a == 42 */
|
| cgrj.c | 19 #define GT 2
99 CGRJ(7,8,8,GT) "\n\t"
|
| clgrj.c | 19 #define GT 2
99 CLGRJ(7,8,8,GT) "\n\t"
|
| clrj.c | 19 #define GT 2
99 CLRJ(7,8,8,GT) "\n\t"
|
| crj.c | 19 #define GT 2
99 CRJ(7,8,8,GT) "\n\t"
|
| /frameworks/av/include/media/stagefright/foundation/ |
| ADebug.h | 56 MAKE_COMPARATOR(GT,>)
76 #define CHECK_GT(x,y) CHECK_OP(x,y,GT,>)
|
| /external/chromium_org/v8/src/ |
| token.h | 117 T(GT, ">", 10) \
221 return op == LT || op == LTE || op == GT || op == GTE;
245 case GT: return LTE;
246 case LTE: return GT;
261 case LT: return GT;
262 case GT: return LT;
|
| /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/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/chromium_org/chrome/browser/download/ |
| download_query.cc | 173 enum ComparisonType {LT, EQ, GT};
188 case GT: return accessor.Run(item) > value;
232 if (left_value > right_value) return GT;
292 return AddFilter(BuildFilter<std::string>(value, GT, &GetEndTime));
298 return AddFilter(BuildFilter<std::string>(value, GT, &GetStartTime));
306 return AddFilter(BuildFilter<int>(value, GT, &GetTotalBytes));
331 // iterates over the sorters until a callback returns ComparisonType LT or GT.
381 case GT: return term->direction == DownloadQuery::DESCENDING;
|
| /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 | |
| /ndk/sources/host-tools/nawk-20071023/ |
| maketab.c | 51 { GT, "relop", " > " },
|
