Searched refs:BlockIdx (Results 1 – 7 of 7) sorted by relevance
288 for (int BlockIdx = (int)BlockLabels.size() - 1; BlockIdx > 0; --BlockIdx) { in printDefs() local289 const auto *Label = BlockLabels[BlockIdx]; in printDefs()290 Out << LoopPOT.getBlockAt(BlockIdx)->getName().str() << "(" << BlockIdx in printDefs()360 int BlockIdx = 0; in computeJoinPoints() local367 BlockIdx = std::max<int>(BlockIdx, SuccIdx); in computeJoinPoints()383 for (; BlockIdx >= FloorIdx; --BlockIdx) { in computeJoinPoints()387 const auto *Label = BlockLabels[BlockIdx]; in computeJoinPoints()392 const auto *Block = LoopPOT.getBlockAt(BlockIdx); in computeJoinPoints()
369 for (unsigned BlockIdx = 0; BlockIdx < RegsRequired; ++BlockIdx) { in AllocateRegBlock() local370 if (isAllocated(Regs[StartIdx + BlockIdx])) { in AllocateRegBlock()377 for (unsigned BlockIdx = 0; BlockIdx < RegsRequired; ++BlockIdx) { in AllocateRegBlock() local378 MarkAllocated(Regs[StartIdx + BlockIdx]); in AllocateRegBlock()
516 for (int BlockIdx = (int)CyclePOT.size() - 1; BlockIdx >= 0; --BlockIdx) { in printDefs() local517 const auto *Block = CyclePOT[BlockIdx]; in printDefs()519 Out << Context.print(Block) << "(" << BlockIdx << ") : "; in printDefs()619 auto BlockIdx = FreshLabels.find_last(); in computeJoinPoints() local620 if (BlockIdx == -1 || BlockIdx < FloorIdx) in computeJoinPoints()625 FreshLabels.reset(BlockIdx); in computeJoinPoints()626 if (BlockIdx == DivTermIdx) { in computeJoinPoints()631 const auto *Block = CyclePOT[BlockIdx]; in computeJoinPoints()633 << BlockIdx << "\n"); in computeJoinPoints()
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()
216 int BlockIdx = PN->getBasicBlockIndex(OrigBlock); in NewLeafBlock() local217 assert(BlockIdx != -1 && "Switch didn't go to this successor??"); in NewLeafBlock()218 PN->setIncomingBlock((unsigned)BlockIdx, NewLeaf); in NewLeafBlock()
666 std::vector<FlowJump *> findShortestPath(uint64_t BlockIdx) { in findShortestPath() argument668 auto ForwardPath = findShortestPath(Func.Entry, BlockIdx); in findShortestPath()670 auto BackwardPath = findShortestPath(BlockIdx, AnyExitBlock); in findShortestPath()