59 unsigned BasicBlock::addPredecessor(BasicBlock *Pred) {  in addPredecessor()
73 void BasicBlock::reservePredecessors(unsigned NumPreds) {  in reservePredecessors()
158 int BasicBlock::renumberInstrs(int ID) {  in renumberInstrs()
171 int BasicBlock::topologicalSort(SimpleArray<BasicBlock*>& Blocks, int ID) {  in topologicalSort()
194 int BasicBlock::topologicalFinalSort(SimpleArray<BasicBlock*>& Blocks, int ID) {  in topologicalFinalSort()
212 void BasicBlock::computeDominator() {  in computeDominator()
213   BasicBlock *Candidate = nullptr;  in computeDominator()
239 void BasicBlock::computePostDominator() {  in computePostDominator()
240   BasicBlock *Candidate = nullptr;  in computePostDominator()
272 static inline void computeNodeSize(BasicBlock *B,  in computeNodeSize()
273                                    BasicBlock::TopologyNode BasicBlock::*TN) {  in computeNodeSize()
274   BasicBlock::TopologyNode *N = &(B->*TN);  in computeNodeSize()
276     BasicBlock::TopologyNode *P = &(N->Parent->*TN);  in computeNodeSize()
283 static inline void computeNodeID(BasicBlock *B,  in computeNodeID()
284                                  BasicBlock::TopologyNode BasicBlock::*TN) {  in computeNodeID()
285   BasicBlock::TopologyNode *N = &(B->*TN);  in computeNodeID()
287     BasicBlock::TopologyNode *P = &(N->Parent->*TN);  in computeNodeID()
327     computeNodeSize(Block, &BasicBlock::DominatorNode);  in computeNormalForm()
332     computeNodeID(Block, &BasicBlock::DominatorNode);  in computeNormalForm()
333     computeNodeSize(Block, &BasicBlock::PostDominatorNode);  in computeNormalForm()
337     computeNodeID(Block, &BasicBlock::PostDominatorNode);  in computeNormalForm()