HomeSort by: relevance | last modified time | path
    Searched defs:WorkQ (Results 1 - 4 of 4) sorted by relevancy

  /src/external/apache2/llvm/dist/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...]
HexagonGenPredicate.cpp 324 std::queue<RegisterSubReg> WorkQ;
325 WorkQ.push(PredReg);
327 while (!WorkQ.empty()) {
328 RegisterSubReg PR = WorkQ.front();
329 WorkQ.pop();
357 WorkQ.push(RegisterSubReg(MO.getReg()));
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];
939 SetVector<SDNode*> WorkQ;
943 WorkQ.insert(N);
944 for (unsigned i = 0; i != WorkQ.size(); ++i) {
945 SDNode *W = WorkQ[i];
949 WorkQ.insert(W->getOperand(j).getNode());
HexagonSplitDouble.cpp 289 UVect WorkQ;
290 WorkQ.push_back(R);
291 for (unsigned i = 0; i < WorkQ.size(); ++i) {
292 unsigned T = WorkQ[i];
299 append_range(WorkQ, Asc);
574 LoopVector WorkQ;
576 append_range(WorkQ, *MLI);
577 for (unsigned i = 0; i < WorkQ.size(); ++i)
578 append_range(WorkQ, *WorkQ[i])
    [all...]

Completed in 180 milliseconds