137 typedef MapVector<Block *, BlockSet> BlockBlockSetMap;
211     BlockSet Live;  in Calculate()
237       BlockSet Splits;  in Calculate()
238       BlockSet Removed;  in Calculate()
309     void GetBlocksOut(Block *Source, BlockSet &Entries,  in Calculate()
310                       BlockSet *LimitTo = nullptr) {  in Calculate()
318                    BlockSet &From) {  in Calculate()
342     Shape *MakeSimple(BlockSet &Blocks, Block *Inner, BlockSet &NextEntries) {  in Calculate()
351         BlockSet JustInner;  in Calculate()
359     Shape *MakeLoop(BlockSet &Blocks, BlockSet &Entries,  in Calculate()
360                     BlockSet &NextEntries) {  in Calculate()
364       BlockSet InnerBlocks;  in Calculate()
365       BlockSet Queue = Entries;  in Calculate()
411     void FindIndependentGroups(BlockSet &Entries,  in Calculate()
413                                BlockSet *Ignore = nullptr) {  in Calculate()
507         BlockSet &CurrGroup = IndependentGroups[iter];  in Calculate()
532     Shape *MakeMultiple(BlockSet &Blocks, BlockSet &Entries,  in Calculate()
534                         BlockSet &NextEntries) {  in Calculate()
538       BlockSet CurrEntries;  in Calculate()
541         BlockSet &CurrBlocks = iter.second;  in Calculate()
586     Shape *Process(BlockSet &Blocks, BlockSet &InitialEntries, Shape *Prev) {  in Calculate()
587       BlockSet *Entries = &InitialEntries;  in Calculate()
588       BlockSet TempEntries[2];  in Calculate()
590       BlockSet *NextEntries;  in Calculate()
641             BlockSet &Group = iter->second;  in Calculate()
643             for (BlockSet::iterator iterBranch = Entry->BranchesIn.begin();  in Calculate()
685               BlockSet &SmallGroup = IndependentGroups[SmallEntry];  in Calculate()
721   BlockSet AllBlocks;  in Calculate()
726   BlockSet Entries;  in Calculate()
762     void FollowNaturalFlow(Shape *S, BlockSet &Out) {  in Calculate()
799       BlockSet NaturalBlocks;  in Calculate()