HomeSort by relevance Sort by last modified time
    Searched refs:WorkQ (Results 1 - 10 of 10) sorted by null

  /external/llvm/lib/Target/Hexagon/
RDFDeadCode.cpp 72 SetQueue<NodeId> &WorkQ) {
79 WorkQ.push_back(RA.Id);
84 SetQueue<NodeId> &WorkQ) {
88 WorkQ.push_back(UA.Id);
95 SetQueue<NodeId> &WorkQ) {
98 WorkQ.push_back(DA.Id);
116 SetQueue<NodeId> WorkQ;
119 scanInstr(IA, WorkQ);
121 while (!WorkQ.empty()) {
122 NodeId N = WorkQ.pop_front()
    [all...]
RDFDeadCode.h 60 void scanInstr(NodeAddr<InstrNode*> IA, SetQueue<NodeId> &WorkQ);
61 void processDef(NodeAddr<DefNode*> DA, SetQueue<NodeId> &WorkQ);
62 void processUse(NodeAddr<UseNode*> UA, SetQueue<NodeId> &WorkQ);
HexagonGenPredicate.cpp 303 std::queue<Register> WorkQ;
304 WorkQ.push(PredReg);
306 while (!WorkQ.empty()) {
307 Register PR = WorkQ.front();
308 WorkQ.pop();
335 WorkQ.push(Register(Mo->getReg()));
HexagonSplitDouble.cpp 267 UVect WorkQ;
268 WorkQ.push_back(R);
269 for (unsigned i = 0; i < WorkQ.size(); ++i) {
270 unsigned T = WorkQ[i];
278 WorkQ.push_back(*J);
528 LoopVector WorkQ;
531 WorkQ.push_back(I);
532 for (unsigned i = 0; i < WorkQ.size(); ++i) {
533 for (auto I : *WorkQ[i])
534 WorkQ.push_back(I)
    [all...]
  /external/swiftshader/third_party/llvm-7.0/llvm/lib/Target/Hexagon/
RDFDeadCode.cpp 83 SetQueue<NodeId> &WorkQ) {
90 WorkQ.push_back(RA.Id);
95 SetQueue<NodeId> &WorkQ) {
99 WorkQ.push_back(UA.Id);
106 SetQueue<NodeId> &WorkQ) {
109 WorkQ.push_back(DA.Id);
127 SetQueue<NodeId> WorkQ;
130 scanInstr(IA, WorkQ);
132 while (!WorkQ.empty()) {
133 NodeId N = WorkQ.pop_front()
    [all...]
RDFDeadCode.h 60 void scanInstr(NodeAddr<InstrNode*> IA, SetQueue<NodeId> &WorkQ);
61 void processDef(NodeAddr<DefNode*> DA, SetQueue<NodeId> &WorkQ);
62 void processUse(NodeAddr<UseNode*> UA, SetQueue<NodeId> &WorkQ);
HexagonGenPredicate.cpp 321 std::queue<Register> WorkQ;
322 WorkQ.push(PredReg);
324 while (!WorkQ.empty()) {
325 Register PR = WorkQ.front();
326 WorkQ.pop();
354 WorkQ.push(Register(MO.getReg()));
HexagonSplitDouble.cpp 290 UVect WorkQ;
291 WorkQ.push_back(R);
292 for (unsigned i = 0; i < WorkQ.size(); ++i) {
293 unsigned T = WorkQ[i];
301 WorkQ.push_back(*J);
576 LoopVector WorkQ;
579 WorkQ.push_back(I);
580 for (unsigned i = 0; i < WorkQ.size(); ++i) {
581 for (auto I : *WorkQ[i])
582 WorkQ.push_back(I)
    [all...]
HexagonISelDAGToDAGHVX.cpp 226 std::vector<Node> WorkQ;
230 WorkQ.push_back(N);
233 for (unsigned I = 0; I < WorkQ.size(); ++I) {
234 Node N = WorkQ[I];
927 SetVector<SDNode*> WorkQ;
958 WorkQ.insert(N);
959 for (unsigned i = 0; i != WorkQ.size(); ++i) {
960 SDNode *W = WorkQ[i];
964 WorkQ.insert(W->getOperand(j).getNode());
    [all...]
  /external/python/cpython2/Demo/threads/
find.py 28 # wq = WorkQ()
35 class WorkQ:
111 wq = WorkQ()

Completed in 299 milliseconds