90 using BlockNode = BlockFrequencyInfoImplBase::BlockNode;  typedef
145 void Distribution::add(const BlockNode &Node, uint64_t Amount,  in add()
201   using HashTable = DenseMap<BlockNode::IndexType, Weight>;  in combineWeightsByHashing()
314                                            const BlockNode &Pred,  in addToDist()
315                                            const BlockNode &Succ,  in addToDist()
320   auto isLoopHeader = [&OuterLoop](const BlockNode &Node) {  in addToDist()
324   BlockNode Resolved = Working[Succ.Index].getResolvedNode();  in addToDist()
426   for (const BlockNode &M : Loop.Nodes) {  in packageLoop()
436                         const DitheringDistributer &D, const BlockNode &T,  in debugAssign()
447 void BlockFrequencyInfoImplBase::distributeMass(const BlockNode &Source,  in distributeMass()
526   for (const BlockNode &N : Loop.Nodes) {  in unwrapLoop()
568 BlockFrequencyInfoImplBase::getBlockFreq(const BlockNode &Node) const {  in getBlockFreq()
585                                                  const BlockNode &Node,  in getBlockProfileCount()
607 BlockFrequencyInfoImplBase::isIrrLoopHeader(const BlockNode &Node) {  in isIrrLoopHeader()
614 BlockFrequencyInfoImplBase::getFloatingBlockFreq(const BlockNode &Node) const {  in getFloatingBlockFreq()
620 void BlockFrequencyInfoImplBase::setBlockFreq(const BlockNode &Node,  in setBlockFreq()
628 BlockFrequencyInfoImplBase::getBlockName(const BlockNode &Node) const {  in getBlockName()
673 void IrreducibleGraph::addEdge(IrrNode &Irr, const BlockNode &Succ,  in addEdge()