Home
last modified time | relevance | path

Searched refs:GT (Results 1 – 25 of 694) sorted by relevance

12345678910>>...28

/external/llvm/test/CodeGen/Mips/
Dcountleading.ll1 ; RUN: llc -march=mipsel -mcpu=mips32 < %s | FileCheck -check-prefixes=ALL,MIPS32-R1-R2,MIPS32-GT…
2 ; RUN: llc -march=mipsel -mcpu=mips32r2 < %s | FileCheck -check-prefixes=ALL,MIPS32-R1-R2,MIPS32-GT…
3 ; RUN: llc -march=mipsel -mcpu=mips32r6 < %s | FileCheck -check-prefixes=ALL,MIPS32-R6,MIPS32-GT-R1…
5 ; RUN: llc -march=mips64el -mcpu=mips64 < %s | FileCheck -check-prefixes=ALL,MIPS64-GT-R1 %s
6 ; RUN: llc -march=mips64el -mcpu=mips64r2 < %s | FileCheck -check-prefixes=ALL,MIPS64-GT-R1 %s
7 ; RUN: llc -march=mips64el -mcpu=mips64r6 < %s | FileCheck -check-prefixes=ALL,MIPS64-GT-R1 %s
12 ; MIPS32-GT-R1 - MIPS64r1 and above (does not include MIPS64's)
13 ; MIPS64-GT-R1 - MIPS64r1 and above
21 ; MIPS32-GT-R1: clz $2, $4
23 ; MIPS64-GT-R1: clz $2, $4
[all …]
/external/swiftshader/third_party/llvm-7.0/llvm/test/CodeGen/Mips/
Dcountleading.ll1 ; RUN: llc -march=mipsel -mcpu=mips32 < %s | FileCheck -check-prefixes=ALL,MIPS32-R1-R2,MIPS32-GT…
2 ; RUN: llc -march=mipsel -mcpu=mips32r2 < %s | FileCheck -check-prefixes=ALL,MIPS32-R1-R2,MIPS32-GT…
3 ; RUN: llc -march=mipsel -mcpu=mips32r6 < %s | FileCheck -check-prefixes=ALL,MIPS32-R6,MIPS32-GT-R1…
5 ; RUN: llc -march=mips64el -mcpu=mips64 < %s | FileCheck -check-prefixes=ALL,MIPS64-GT-R1 %s
6 ; RUN: llc -march=mips64el -mcpu=mips64r2 < %s | FileCheck -check-prefixes=ALL,MIPS64-GT-R1 %s
7 ; RUN: llc -march=mips64el -mcpu=mips64r6 < %s | FileCheck -check-prefixes=ALL,MIPS64-GT-R1 %s
11 ; MIPS32-GT-R1 - MIPS64r1 and above (does not include MIPS64's)
12 ; MIPS64-GT-R1 - MIPS64r1 and above
20 ; MIPS32-GT-R1: clz $2, $4
22 ; MIPS64-GT-R1: clz $2, $4
[all …]
/external/swiftshader/third_party/llvm-7.0/llvm/include/llvm/ADT/
DSCCIterator.h42 template <class GraphT, class GT = GraphTraits<GraphT>>
44 scc_iterator<GraphT, GT>, std::forward_iterator_tag,
45 const std::vector<typename GT::NodeRef>, ptrdiff_t> {
46 using NodeRef = typename GT::NodeRef;
47 using ChildItTy = typename GT::ChildIteratorType;
103 return scc_iterator(GT::getEntryNode(G)); in begin()
143 template <class GraphT, class GT>
144 void scc_iterator<GraphT, GT>::DFSVisitOne(NodeRef N) { in DFSVisitOne()
148 VisitStack.push_back(StackElement(N, GT::child_begin(N), visitNum)); in DFSVisitOne()
155 template <class GraphT, class GT>
[all …]
DPostOrderIterator.h95 bool ExtStorage = false, class GT = GraphTraits<GraphT>>
97 : public std::iterator<std::forward_iterator_tag, typename GT::NodeRef>,
99 using super = std::iterator<std::forward_iterator_tag, typename GT::NodeRef>;
100 using NodeRef = typename GT::NodeRef;
101 using ChildItTy = typename GT::ChildIteratorType;
109 VisitStack.push_back(std::make_pair(BB, GT::child_begin(BB))); in po_iterator()
118 VisitStack.push_back(std::make_pair(BB, GT::child_begin(BB))); in po_iterator()
128 while (VisitStack.back().second != GT::child_end(VisitStack.back().first)) { in traverseChild()
132 VisitStack.push_back(std::make_pair(BB, GT::child_begin(BB))); in traverseChild()
142 return po_iterator(GT::getEntryNode(G)); in begin()
[all …]
DBreadthFirstIterator.h47 class GT = GraphTraits<GraphT>>
49 : public std::iterator<std::forward_iterator_tag, typename GT::NodeRef>,
51 using super = std::iterator<std::forward_iterator_tag, typename GT::NodeRef>;
53 using NodeRef = typename GT::NodeRef;
54 using ChildItTy = typename GT::ChildIteratorType;
85 ChildIt.emplace(GT::child_begin(Node)); in toNext()
86 while (*ChildIt != GT::child_end(Node)) { in toNext()
115 return bf_iterator(GT::getEntryNode(G)); in begin()
/external/llvm/include/llvm/ADT/
DSCCIterator.h39 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)); in begin()
141 template <class GraphT, class GT>
142 void scc_iterator<GraphT, GT>::DFSVisitOne(NodeType *N) { in DFSVisitOne()
146 VisitStack.push_back(StackElement(N, GT::child_begin(N), visitNum)); in DFSVisitOne()
153 template <class GraphT, class GT>
[all …]
DPostOrderIterator.h92 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)) { in traverseChild()
110 VisitStack.push_back(std::make_pair(BB, GT::child_begin(BB))); in traverseChild()
117 VisitStack.push_back(std::make_pair(BB, GT::child_begin(BB))); in po_iterator()
125 VisitStack.push_back(std::make_pair(BB, GT::child_begin(BB))); in po_iterator()
138 return po_iterator(GT::getEntryNode(G)); in begin()
[all …]
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;
84 std::make_pair(PointerIntTy(Node, 0), GT::child_begin(Node))); in df_iterator()
93 std::make_pair(PointerIntTy(Node, 0), GT::child_begin(Node))); in df_iterator()
109 It = GT::child_begin(Node); in toNext()
113 while (It != GT::child_end(Node)) { in toNext()
119 std::make_pair(PointerIntTy(Next, 0), GT::child_begin(Next))); in toNext()
[all …]
/external/deqp/modules/gles2/functional/
Des2fShaderOperatorTests.cpp218 GT = VALUE_FLOAT_GENTYPE, enumerator
961 …<< BuiltinOperInfo("plus", "+", GT, Value(GT, -1.0f, 1.0f), notUsed, notUsed, 0.5f, 0.5f, P… in init()
963 …<< BuiltinOperInfo("minus", "-", GT, Value(GT, -1.0f, 1.0f), notUsed, notUsed, 0.5f, 0.5f, … in init()
968 …<< BuiltinSideEffOperInfo ("pre_increment_effect", "++", GT, Value(GT, -1.0f, 1.0f), notUsed, no… in init()
970 …<< BuiltinSideEffOperInfo ("pre_decrement_effect", "--", GT, Value(GT, -1.0f, 1.0f), notUsed, no… in init()
972 …<< BuiltinPostSideEffOperInfo ("post_increment_effect", "++", GT, Value(GT, -1.0f, 1.0f), notUsed… in init()
974 …<< BuiltinPostSideEffOperInfo ("post_decrement_effect", "--", GT, Value(GT, -1.0f, 1.0f), notUsed… in init()
978 …<< BuiltinOperInfo ("pre_increment_result", "++", GT, Value(GT, -1.0f, 1.0f), notUsed, notUsed… in init()
980 …<< BuiltinOperInfo ("pre_decrement_result", "--", GT, Value(GT, -1.0f, 1.0f), notUsed, notUsed… in init()
982 …<< BuiltinPostOperInfo ("post_increment_result", "++", GT, Value(GT, -1.0f, 1.0f), notUsed, not… in init()
[all …]
/external/epid-sdk/epid/common/math/unittests/
Dtatepairing-test.cc85 this->params->GT, &ps)); in TEST_F()
101 this->params->GT, &ps)); in TEST_F()
109 this->params->GT, &ps)); in TEST_F()
112 this->params->GT, &ps)); in TEST_F()
120 this->params->GT, nullptr)); in TEST_F()
128 this->params->GT, &ps)); in TEST_F()
137 this->params->GT, &ps)); in TEST_F()
172 FfElementObj r(&this->params->GT); in TEST_F()
178 this->params->GT, &ps)); in TEST_F()
182 THROW_ON_EPIDERR(WriteFfElement(this->params->GT, r, &r_str, sizeof(r_str))); in TEST_F()
[all …]
Dpairing-test.cc95 this->params->GT, &this->t_str, true, &ps)); in TEST_F()
112 this->params->GT, &this->t_str, true, &ps)); in TEST_F()
120 NewPairingState(nullptr, this->params->G2, this->params->GT, in TEST_F()
124 NewPairingState(this->params->G1, nullptr, this->params->GT, in TEST_F()
132 this->params->GT, nullptr, true, &ps)); in TEST_F()
136 this->params->GT, &this->t_str, true, nullptr)); in TEST_F()
146 NewPairingState(&ga, this->params->G2, this->params->GT, in TEST_F()
158 NewPairingState(this->params->G1, &gb, this->params->GT, in TEST_F()
214 FfElementObj r(&this->params->GT); in TEST_F()
220 this->params->GT, &this->t_str, neg, &ps)); in TEST_F()
[all …]
/external/swiftshader/third_party/llvm-7.0/llvm/unittests/ADT/
DSCCIteratorTest.cpp25 typedef Graph<NUM_NODES> GT; in TEST() typedef
31 GT G; in TEST()
50 GT::NodeSubset NodesInSomeSCC; in TEST()
52 for (scc_iterator<GT> I = scc_begin(G), E = scc_end(G); I != E; ++I) { in TEST()
53 const std::vector<GT::NodeType *> &SCC = *I; in TEST()
56 GT::NodeSubset NodesInThisSCC; in TEST()
77 GT::NodeSubset NodesReachableFromSCC = G.NodesReachableFrom(i); in TEST()
78 GT::NodeSubset ReachableButNotInSCC = in TEST()
107 GT::NodeSubset NodesReachableFromSCC = G.NodesReachableFrom(i); in TEST()
/external/swiftshader/third_party/LLVM/include/llvm/ADT/
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))); in DFSVisitOne()
82 while (VisitStack.back().second != GT::child_end(VisitStack.back().first)) { in DFSVisitChildren()
103 assert(VisitStack.back().second ==GT::child_end(VisitStack.back().first)); in GetNextSCC()
138 typedef scc_iterator<GraphT, GT> _Self;
141 static inline _Self begin(const GraphT &G){return _Self(GT::getEntryNode(G));} in begin()
[all …]
DPostOrderIterator.h51 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)) { in traverseChild()
68 VisitStack.push_back(std::make_pair(BB, GT::child_begin(BB))); in traverseChild()
75 VisitStack.push_back(std::make_pair(BB, GT::child_begin(BB))); in po_iterator()
83 VisitStack.push_back(std::make_pair(BB, GT::child_begin(BB))); in po_iterator()
93 typedef po_iterator<GraphT, SetType, ExtStorage, GT> _Self;
[all …]
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))); in df_iterator()
92 GT::child_begin(Node))); in df_iterator()
108 It = GT::child_begin(Node); in toNext()
112 while (It != GT::child_end(Node)) { in toNext()
119 GT::child_begin(Next))); in toNext()
[all …]
/external/deqp/external/vulkancts/modules/vulkan/shaderrender/
DvktShaderRenderOperatorTests.cpp262 GT = VALUE_FLOAT_GENTYPE, enumerator
1348 …<< BuiltinOperInfo ("plus", "+", GT, Value(GT, -1.0f, 1.0f), notUsed, notUsed, 0.5f, 0.5f… in init()
1351 …<< BuiltinOperInfo ("minus", "-", GT, Value(GT, -1.0f, 1.0f), notUsed, notUsed, 0.5f, 0.5… in init()
1359 …<< BuiltinSideEffOperInfo ("pre_increment_effect", "++", GT, Value(GT, -1.0f, 1.0f), notUsed, no… in init()
1362 …<< BuiltinSideEffOperInfo ("pre_decrement_effect", "--", GT, Value(GT, -1.0f, 1.0f), notUsed, no… in init()
1365 …<< BuiltinPostSideEffOperInfo ("post_increment_effect", "++", GT, Value(GT, -1.0f, 1.0f), notUsed… in init()
1368 …<< BuiltinPostSideEffOperInfo ("post_decrement_effect", "--", GT, Value(GT, -1.0f, 1.0f), notUsed… in init()
1373 …<< BuiltinOperInfo ("pre_increment_result", "++", GT, Value(GT, -1.0f, 1.0f), notUsed, notUsed… in init()
1376 …<< BuiltinOperInfo ("pre_decrement_result", "--", GT, Value(GT, -1.0f, 1.0f), notUsed, notUsed… in init()
1379 …<< BuiltinPostOperInfo ("post_increment_result", "++", GT, Value(GT, -1.0f, 1.0f), notUsed, not… in init()
[all …]
/external/epid-sdk/epid/verifier/1.1/src/
Dcontext.c145 result = NewFfElement(verifier_ctx->epid11_params->GT, &verifier_ctx->e12); in Epid11VerifierCreate()
148 result = NewFfElement(verifier_ctx->epid11_params->GT, &verifier_ctx->e22); in Epid11VerifierCreate()
151 result = NewFfElement(verifier_ctx->epid11_params->GT, &verifier_ctx->e2w); in Epid11VerifierCreate()
201 FiniteField* GT = NULL; // Finite field GT(Fq6) in Epid11VerifierWritePrecomp() local
203 !(ctx->epid11_params->GT) || !ctx->pub_key || !precomp) { in Epid11VerifierWritePrecomp()
209 GT = ctx->epid11_params->GT; in Epid11VerifierWritePrecomp()
212 result = WriteFfElement(GT, e12, &(precomp->e12), sizeof(precomp->e12)); in Epid11VerifierWritePrecomp()
216 result = WriteFfElement(GT, e22, &(precomp->e22), sizeof(precomp->e22)); in Epid11VerifierWritePrecomp()
220 result = WriteFfElement(GT, e2w, &(precomp->e2w), sizeof(precomp->e2w)); in Epid11VerifierWritePrecomp()
375 if (!ctx->epid11_params || !ctx->epid11_params->GT || in DoPrecomputation()
[all …]
/external/deqp/modules/gles3/functional/
Des3fShaderOperatorTests.cpp282 GT = VALUE_FLOAT_GENTYPE, enumerator
1377 …<< BuiltinOperInfo ("plus", "+", GT, Value(GT, -1.0f, 1.0f), notUsed, notUsed, 0.5f, 0.5f… in init()
1380 …<< BuiltinOperInfo ("minus", "-", GT, Value(GT, -1.0f, 1.0f), notUsed, notUsed, 0.5f, 0.5… in init()
1390 …<< BuiltinSideEffOperInfo ("pre_increment_effect", "++", GT, Value(GT, -1.0f, 1.0f), notUsed, no… in init()
1393 …<< BuiltinSideEffOperInfo ("pre_decrement_effect", "--", GT, Value(GT, -1.0f, 1.0f), notUsed, no… in init()
1396 …<< BuiltinPostSideEffOperInfo ("post_increment_effect", "++", GT, Value(GT, -1.0f, 1.0f), notUsed… in init()
1399 …<< BuiltinPostSideEffOperInfo ("post_decrement_effect", "--", GT, Value(GT, -1.0f, 1.0f), notUsed… in init()
1404 …<< BuiltinOperInfo ("pre_increment_result", "++", GT, Value(GT, -1.0f, 1.0f), notUsed, notUsed… in init()
1407 …<< BuiltinOperInfo ("pre_decrement_result", "--", GT, Value(GT, -1.0f, 1.0f), notUsed, notUsed… in init()
1410 …<< BuiltinPostOperInfo ("post_increment_result", "++", GT, Value(GT, -1.0f, 1.0f), notUsed, not… in init()
[all …]
/external/epid-sdk/epid/member/src/
Dprecomp.c45 FiniteField* GT = epid2_params->GT; in PrecomputeMemberPairing() local
52 sts = NewFfElement(GT, &e); in PrecomputeMemberPairing()
58 sts = WriteFfElement(GT, e, &precomp->e12, sizeof(precomp->e12)); in PrecomputeMemberPairing()
64 sts = WriteFfElement(GT, e, &precomp->e22, sizeof(precomp->e22)); in PrecomputeMemberPairing()
70 sts = WriteFfElement(GT, e, &precomp->e2w, sizeof(precomp->e2w)); in PrecomputeMemberPairing()
80 sts = WriteFfElement(GT, e, &precomp->ea2, sizeof(precomp->ea2)); in PrecomputeMemberPairing()
Dstartup.c105 FiniteField* GT = ctx->epid2_params->GT; in MemberReadPrecomputation() local
111 sts = ReadFfElement(GT, &precomp->e12, sizeof(precomp->e12), e12); in MemberReadPrecomputation()
114 sts = ReadFfElement(GT, &precomp->e22, sizeof(precomp->e22), e22); in MemberReadPrecomputation()
117 sts = ReadFfElement(GT, &precomp->e2w, sizeof(precomp->e2w), e2w); in MemberReadPrecomputation()
120 sts = ReadFfElement(GT, &precomp->ea2, sizeof(precomp->ea2), ea2); in MemberReadPrecomputation()
/external/epid-sdk/epid/verifier/src/
Dcontext.c154 result = NewFfElement(verifier_ctx->epid2_params->GT, &verifier_ctx->e12); in EpidVerifierCreate()
159 result = NewFfElement(verifier_ctx->epid2_params->GT, &verifier_ctx->e22); in EpidVerifierCreate()
164 result = NewFfElement(verifier_ctx->epid2_params->GT, &verifier_ctx->e2w); in EpidVerifierCreate()
169 result = NewFfElement(verifier_ctx->epid2_params->GT, &verifier_ctx->eg12); in EpidVerifierCreate()
232 FiniteField* GT = NULL; // Finite field GT(Fq12 ) in EpidVerifierWritePrecomp() local
240 !ctx->epid2_params->GT || !ctx->pub_key) { in EpidVerifierWritePrecomp()
247 GT = ctx->epid2_params->GT; in EpidVerifierWritePrecomp()
249 result = WriteFfElement(GT, e12, &(precomp->e12), sizeof(precomp->e12)); in EpidVerifierWritePrecomp()
253 result = WriteFfElement(GT, e22, &(precomp->e22), sizeof(precomp->e22)); in EpidVerifierWritePrecomp()
257 result = WriteFfElement(GT, e2w, &(precomp->e2w), sizeof(precomp->e2w)); in EpidVerifierWritePrecomp()
[all …]
/external/swiftshader/third_party/LLVM/unittests/ADT/
DSCCIteratorTest.cpp252 typedef Graph<NUM_NODES> GT; in TEST() typedef
258 GT G; in TEST()
277 GT::NodeSubset NodesInSomeSCC; in TEST()
279 for (scc_iterator<GT> I = scc_begin(G), E = scc_end(G); I != E; ++I) { in TEST()
280 std::vector<GT::NodeType*> &SCC = *I; in TEST()
283 GT::NodeSubset NodesInThisSCC; in TEST()
303 GT::NodeSubset NodesReachableFromSCC = G.NodesReachableFrom(i); in TEST()
304 GT::NodeSubset ReachableButNotInSCC = in TEST()
332 GT::NodeSubset NodesReachableFromSCC = G.NodesReachableFrom(i); in TEST()
/external/llvm/unittests/ADT/
DSCCIteratorTest.cpp250 typedef Graph<NUM_NODES> GT; in TEST() typedef
256 GT G; in TEST()
275 GT::NodeSubset NodesInSomeSCC; in TEST()
277 for (scc_iterator<GT> I = scc_begin(G), E = scc_end(G); I != E; ++I) { in TEST()
278 const std::vector<GT::NodeType *> &SCC = *I; in TEST()
281 GT::NodeSubset NodesInThisSCC; in TEST()
301 GT::NodeSubset NodesReachableFromSCC = G.NodesReachableFrom(i); in TEST()
302 GT::NodeSubset ReachableButNotInSCC = in TEST()
330 GT::NodeSubset NodesReachableFromSCC = G.NodesReachableFrom(i); in TEST()
/external/swiftshader/third_party/LLVM/include/llvm/Analysis/
DIntervalIterator.h88 template<class NodeTy, class OrigContainer_t, class GT = GraphTraits<NodeTy*>,
174 for (typename GT::ChildIteratorType I = GT::child_begin(Node), in ProcessInterval()
175 E = GT::child_end(Node); I != E; ++I) in ProcessInterval()
228 for (typename GT::ChildIteratorType It = GT::child_begin(Node), in ProcessNode()
229 End = GT::child_end(Node); It != End; ++It) in ProcessNode()
/external/swiftshader/third_party/llvm-7.0/llvm/lib/Target/ARM/Utils/
DARMBaseInfo.h44 GT, // Greater than Greater than enumerator
64 case GT: return LE; in getOppositeCondition()
65 case LE: return GT; in getOppositeCondition()
84 case ARMCC::GT: return "gt"; in ARMCondCodeToString()
107 .Case("gt", ARMCC::GT) in ARMCondCodeFromString()

12345678910>>...28