Searched refs:BlockIdx (Results 1 – 5 of 5) sorted by relevance
374 for (unsigned BlockIdx = 0; BlockIdx < RegsRequired; ++BlockIdx) { in AllocateRegBlock() local375 if (isAllocated(Regs[StartIdx + BlockIdx])) { in AllocateRegBlock()382 for (unsigned BlockIdx = 0; BlockIdx < RegsRequired; ++BlockIdx) { in AllocateRegBlock() local383 MarkAllocated(Regs[StartIdx + BlockIdx]); in AllocateRegBlock()
532 for (int BlockIdx = (int)CyclePOT.size() - 1; BlockIdx >= 0; --BlockIdx) { in printDefs() local533 const auto *Block = CyclePOT[BlockIdx]; in printDefs()535 Out << Context.print(Block) << "(" << BlockIdx << ") : "; in printDefs()654 auto BlockIdx = FreshLabels.find_last(); in computeJoinPoints() local655 if (BlockIdx == -1) in computeJoinPoints()658 const auto *Block = CyclePOT[BlockIdx]; in computeJoinPoints()667 FreshLabels.reset(BlockIdx); in computeJoinPoints()668 if (BlockIdx == DivTermIdx) { in computeJoinPoints()674 << BlockIdx << "\n"); in computeJoinPoints()
147 PrettyStackTraceCFGElement(const CFGElement &Element, int BlockIdx, in PrettyStackTraceCFGElement() argument149 : Element(Element), BlockIdx(BlockIdx), ElementIdx(ElementIdx), in PrettyStackTraceCFGElement()153 OS << Message << ": Element [B" << BlockIdx << "." << ElementIdx << "]\n"; in print()163 int BlockIdx; member in clang::dataflow::__anon57fc8b7a0211::PrettyStackTraceCFGElement
213 int BlockIdx = PN->getBasicBlockIndex(OrigBlock); in NewLeafBlock() local214 assert(BlockIdx != -1 && "Switch didn't go to this successor??"); in NewLeafBlock()215 PN->setIncomingBlock((unsigned)BlockIdx, NewLeaf); in NewLeafBlock()
667 std::vector<FlowJump *> findShortestPath(uint64_t BlockIdx) { in findShortestPath() argument669 auto ForwardPath = findShortestPath(Func.Entry, BlockIdx); in findShortestPath()671 auto BackwardPath = findShortestPath(BlockIdx, AnyExitBlock); in findShortestPath()