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

  /src/external/apache2/llvm/dist/llvm/lib/Transforms/Scalar/
ConstantHoisting.cpp 254 // in Orders.
256 SmallVector<BasicBlock *, 16> Orders;
257 Orders.push_back(Entry);
258 while (Idx != Orders.size()) {
259 BasicBlock *Node = Orders[Idx++];
262 Orders.push_back(ChildDomNode->getBlock());
266 // Visit Orders in bottom-up order.
273 InsertPtsMap.reserve(Orders.size() + 1);
274 for (auto RIt = Orders.rbegin(); RIt != Orders.rend(); RIt++)
    [all...]
  /src/external/apache2/llvm/dist/llvm/lib/CodeGen/
InlineSpiller.cpp 129 SmallVectorImpl<MachineDomTreeNode *> &Orders,
1308 SmallVectorImpl<MachineDomTreeNode *> &Orders,
1365 // in Orders. Orders will be used for hoisting in runHoistSpills.
1367 Orders.push_back(MDT.getBase().getNode(Root));
1369 MachineDomTreeNode *Node = Orders[idx++];
1372 Orders.push_back(Child);
1374 } while (idx != Orders.size());
1375 assert(Orders.size() == WorkSet.size() &&
1376 "Orders have different size with WorkSet")
    [all...]
  /src/external/apache2/llvm/dist/llvm/utils/TableGen/
CodeGenRegisters.h 295 // Allocation orders. Order[0] always contains all registers in Members.
296 std::vector<SmallVector<Record*, 16>> Orders;
431 return Orders[No];
434 // Return the total number of allocation orders available.
435 unsigned getNumOrders() const { return Orders.size(); }

Completed in 19 milliseconds