39 BuildResult<Node> buildInterval(llvm::BitVector &Partitioned,  in buildInterval()  argument
44   Partitioned.set(getID(*Header));  in buildInterval()
51   llvm::BitVector Workset(Partitioned.size(), false);  in buildInterval()
54       if (auto SID = getID(*S); !Partitioned.test(SID)) {  in buildInterval()
83       Partitioned.set(ID);  in buildInterval()
87               !Partitioned.test(SID) && !Workset.test(SID)) {  in buildInterval()
108                       llvm::BitVector &Partitioned, const Node *Header) {  in fillIntervalNode()  argument
109   BuildResult<Node> Result = buildInterval(Partitioned, Header);  in fillIntervalNode()
155   llvm::BitVector Partitioned(NumBlockIDs, false);  in partitionIntoIntervalsImpl()  local
158   fillIntervalNode(Graph, Index, Successors, Partitioned, EntryBlock);  in partitionIntoIntervalsImpl()
165     if (Partitioned.test(getID(*B)))  in partitionIntoIntervalsImpl()
168     // B has not been partitioned, but it has a predecessor that has. Create a  in partitionIntoIntervalsImpl()
170     fillIntervalNode(Graph, Index, Successors, Partitioned, B);  in partitionIntoIntervalsImpl()
200   llvm::BitVector Partitioned(Header->getParent()->getNumBlockIDs(), false);  in buildInterval()  local
201   return buildInterval(Partitioned, Header).Nodes;  in buildInterval()