| /external/llvm/include/llvm/ADT/ |
| 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...] |
| 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::child_begin(Next)))
[all...] |
| 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::getEntryNode(G))
[all...] |
| /external/swiftshader/third_party/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 | 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> _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...] |
| /frameworks/support/v7/recyclerview/src/android/support/v7/widget/ |
| ViewBoundsCheck.java | 31 static final int GT = 1 << 0;
40 static final int FLAG_CVS_GT_PVS = GT << CVS_PVS_POS;
43 * The child view's start can be equal to its parent view's start. This flag follows with GT
58 static final int FLAG_CVS_GT_PVE = GT << CVS_PVE_POS;
61 * The child view's start can be equal to its parent view's end. This flag follows with GT
76 static final int FLAG_CVE_GT_PVS = GT << CVE_PVS_POS;
79 * The child view's end can be equal to its parent view's start. This flag follows with GT
94 static final int FLAG_CVE_GT_PVE = GT << CVE_PVE_POS;
97 * The child view's end can be equal to its parent view's end. This flag follows with GT
107 static final int MASK = GT | EQ | LT
[all...] |
| /external/deqp/modules/gles2/functional/ |
| es2fShaderOperatorTests.cpp | 218 GT = VALUE_FLOAT_GENTYPE,
[all...] |
| /external/llvm/unittests/ADT/ |
| SCCIteratorTest.cpp | 250 typedef Graph<NUM_NODES> GT;
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/swiftshader/third_party/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/jacoco/org.jacoco.report/src/org/jacoco/report/internal/xml/ |
| XMLElement.java | 33 private static final char GT = '>';
82 writer.append(GT);
116 case GT:
117 writer.write(">");
257 writer.write(GT);
|
| /external/swiftshader/third_party/LLVM/tools/opt/ |
| GraphPrinters.cpp | 27 const GraphType >) {
34 WriteGraph(F.os(), GT);
|
| /external/llvm/include/llvm/Analysis/ |
| 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/ |
| 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/v8/src/parsing/ |
| token.h | 96 T(GT, ">", 10) \
239 return op == LT || op == LTE || op == GT || op == GTE;
263 case GT: return LTE;
264 case LTE: return GT;
279 case LT: return GT;
280 case GT: return LT;
296 case Token::GT: return (op1 > op2);
|
| /external/dexmaker/dexmaker/src/main/java/com/android/dx/ |
| Comparison.java | 61 GT() {
|
| /device/linaro/bootloader/edk2/BaseTools/Source/Python/Common/ |
| Expression.py | 123 'GT' : '>' , 'LT' : '<',
138 "(?<=\W)EQ(?=\W)|(?<=\W)NE(?=\W)|(?<=\W)GT(?=\W)|(?<=\W)LT(?=\W)|(?<=\W)GE(?=\W)|(?<=\W)LE(?=\W)"
352 return self._ExprFuncTemplate(self._AddExpr, ["<=", ">=", "<", ">", "LE", "GE", "LT", "GT"])
583 # Script operator: LT, GT, LE, GE, EQ, NE, and, or, xor, not
|
| /external/llvm/lib/Target/NVPTX/ |
| NVPTX.h | 39 GT,
147 GT,
|
| /external/valgrind/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 */
|
| /prebuilts/go/darwin-x86/src/runtime/ |
| memmove_arm.s | 178 MOVW.GT $24, RSHIFT /* (R(n)<<8)|(R(n-1)>>24) */
179 MOVW.GT $8, LSHIFT
180 MOVW.GT $3, OFFSET
226 MOVW.GT $24, RSHIFT /* (R(n+1)<<8)|(R(n)>>24) */
227 MOVW.GT $8, LSHIFT
228 MOVW.GT $1, OFFSET
|
| /prebuilts/go/linux-x86/src/runtime/ |
| memmove_arm.s | 178 MOVW.GT $24, RSHIFT /* (R(n)<<8)|(R(n-1)>>24) */
179 MOVW.GT $8, LSHIFT
180 MOVW.GT $3, OFFSET
226 MOVW.GT $24, RSHIFT /* (R(n+1)<<8)|(R(n)>>24) */
227 MOVW.GT $8, LSHIFT
228 MOVW.GT $1, OFFSET
|
| /external/deqp/modules/gles3/functional/ |
| es3fShaderOperatorTests.cpp | 282 GT = VALUE_FLOAT_GENTYPE,
[all...] |
