Searched refs:BlockIdx (Results 1 – 6 of 6) sorted by relevance
287 for (int BlockIdx = (int)BlockLabels.size() - 1; BlockIdx > 0; --BlockIdx) { in printDefs() local288 const auto *Label = BlockLabels[BlockIdx]; in printDefs()289 Out << LoopPOT.getBlockAt(BlockIdx)->getName().str() << "(" << BlockIdx in printDefs()359 int BlockIdx = 0; in computeJoinPoints() local366 BlockIdx = std::max<int>(BlockIdx, SuccIdx); in computeJoinPoints()382 for (; BlockIdx >= FloorIdx; --BlockIdx) { in computeJoinPoints()386 const auto *Label = BlockLabels[BlockIdx]; in computeJoinPoints()391 const auto *Block = LoopPOT.getBlockAt(BlockIdx); in computeJoinPoints()
390 for (unsigned BlockIdx = 0; BlockIdx < RegsRequired; ++BlockIdx) { in AllocateRegBlock() local391 if (isAllocated(Regs[StartIdx + BlockIdx])) { in AllocateRegBlock()398 for (unsigned BlockIdx = 0; BlockIdx < RegsRequired; ++BlockIdx) { in AllocateRegBlock() local399 MarkAllocated(Regs[StartIdx + BlockIdx]); in AllocateRegBlock()
20 static inline bool BlockIsEntry(size_t BlockIdx) { in BlockIsEntry() argument21 return __dft.PCsBeg[BlockIdx * 2 + 1] & PCFLAG_FUNC_ENTRY; in BlockIsEntry()
79 static inline bool BlockIsEntry(size_t BlockIdx) { in BlockIsEntry() argument80 return __dft.PCsBeg[BlockIdx * 2 + 1] & PCFLAG_FUNC_ENTRY; in BlockIsEntry()
217 int BlockIdx = PN->getBasicBlockIndex(OrigBlock); in NewLeafBlock() local218 assert(BlockIdx != -1 && "Switch didn't go to this successor??"); in NewLeafBlock()219 PN->setIncomingBlock((unsigned)BlockIdx, NewLeaf); in NewLeafBlock()
655 std::vector<FlowJump *> findShortestPath(uint64_t BlockIdx) { in findShortestPath() argument657 auto ForwardPath = findShortestPath(Func.Entry, BlockIdx); in findShortestPath()659 auto BackwardPath = findShortestPath(BlockIdx, AnyExitBlock); in findShortestPath()