Home
last modified time | relevance | path

Searched refs:WorkQ (Results 1 – 5 of 5) sorted by relevance

/external/llvm/lib/Target/Hexagon/
DRDFDeadCode.cpp72 SetQueue<NodeId> &WorkQ) { in scanInstr() argument
79 WorkQ.push_back(RA.Id); in scanInstr()
84 SetQueue<NodeId> &WorkQ) { in processDef() argument
88 WorkQ.push_back(UA.Id); in processDef()
95 SetQueue<NodeId> &WorkQ) { in processUse() argument
98 WorkQ.push_back(DA.Id); in processUse()
116 SetQueue<NodeId> WorkQ; in collect() local
119 scanInstr(IA, WorkQ); in collect()
121 while (!WorkQ.empty()) { in collect()
122 NodeId N = WorkQ.pop_front(); in collect()
[all …]
DRDFDeadCode.h60 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);
DHexagonGenPredicate.cpp303 std::queue<Register> WorkQ; in isScalarPred() local
304 WorkQ.push(PredReg); in isScalarPred()
306 while (!WorkQ.empty()) { in isScalarPred()
307 Register PR = WorkQ.front(); in isScalarPred()
308 WorkQ.pop(); in isScalarPred()
335 WorkQ.push(Register(Mo->getReg())); in isScalarPred()
DHexagonSplitDouble.cpp267 UVect WorkQ; in partitionRegisters() local
268 WorkQ.push_back(R); in partitionRegisters()
269 for (unsigned i = 0; i < WorkQ.size(); ++i) { in partitionRegisters()
270 unsigned T = WorkQ[i]; in partitionRegisters()
278 WorkQ.push_back(*J); in partitionRegisters()
528 LoopVector WorkQ; in collectIndRegs() local
531 WorkQ.push_back(I); in collectIndRegs()
532 for (unsigned i = 0; i < WorkQ.size(); ++i) { in collectIndRegs()
533 for (auto I : *WorkQ[i]) in collectIndRegs()
534 WorkQ.push_back(I); in collectIndRegs()
[all …]
/external/python/cpython2/Demo/threads/
Dfind.py35 class WorkQ: class
111 wq = WorkQ()