diff options
| author | Matthew Pickering <matthewtpickering@gmail.com> | 2021-09-15 13:06:07 +0100 |
|---|---|---|
| committer | Marge Bot <ben+marge-bot@smart-cactus.org> | 2021-09-17 09:44:53 -0400 |
| commit | b041ea7784f036dd7cfc5fae6380db4f3c392ab4 (patch) | |
| tree | 9b8b91e76dfe579cc8424f52c082456c0cf41120 /compiler/GHC/Unit/Module/ModGuts.hs | |
| parent | 44e7120dacad683829194b0dbedcfb679d5ffe93 (diff) | |
| download | haskell-b041ea7784f036dd7cfc5fae6380db4f3c392ab4.tar.gz | |
Code Gen: Optimise successors calculation in loop calculation
Before this change, the whole map would be traversed in order to delete
a node from the graph before calculating successors. This is quite
inefficient if the CFG is big, as was the case in the mmark package. A
more efficient alternative is to leave the CFG untouched and then just
delete the node once after the lookups have been performed.
Ticket: #19471
Diffstat (limited to 'compiler/GHC/Unit/Module/ModGuts.hs')
0 files changed, 0 insertions, 0 deletions