56 typedef BlockFrequencyInfoImplBase::BlockNode BlockNode;  typedef
110 void Distribution::add(const BlockNode &Node, uint64_t Amount,  in add()
165   typedef DenseMap<BlockNode::IndexType, Weight> HashTable;  in combineWeightsByHashing()
263                                            const BlockNode &Pred,  in addToDist()
264                                            const BlockNode &Succ,  in addToDist()
269   auto isLoopHeader = [&OuterLoop](const BlockNode &Node) {  in addToDist()
273   BlockNode Resolved = Working[Succ.Index].getResolvedNode();  in addToDist()
368   for (const BlockNode &M : Loop.Nodes) {  in packageLoop()
376 void BlockFrequencyInfoImplBase::distributeMass(const BlockNode &Source,  in distributeMass()
386   auto debugAssign = [&](const BlockNode &T, const BlockMass &M,  in distributeMass()
413       DEBUG(debugAssign(BlockNode(), Taken, "back"));  in distributeMass()
465   for (const BlockNode &N : Loop.Nodes) {  in unwrapLoop()
507 BlockFrequencyInfoImplBase::getBlockFreq(const BlockNode &Node) const {  in getBlockFreq()
513 BlockFrequencyInfoImplBase::getFloatingBlockFreq(const BlockNode &Node) const {  in getFloatingBlockFreq()
520 BlockFrequencyInfoImplBase::getBlockName(const BlockNode &Node) const {  in getBlockName()
530                                            const BlockNode &Node) const {  in printBlockFreq()
561 void IrreducibleGraph::addEdge(IrrNode &Irr, const BlockNode &Succ,  in addEdge()