aboutsummaryrefslogtreecommitdiffstats
path: root/lib/common_test
diff options
context:
space:
mode:
authorHans Bolinder <[email protected]>2017-01-19 16:22:06 +0100
committerHans Bolinder <[email protected]>2017-02-03 08:58:00 +0100
commitda2a7ff4d340db6d139c3c6abdcfa978dcadb4c2 (patch)
tree7e67f452859ad8027e8fc5fb865b01a7ebfc45c6 /lib/common_test
parent643b7dbdb7f208ff69265b4f6b14f79175865c2b (diff)
downloadotp-da2a7ff4d340db6d139c3c6abdcfa978dcadb4c2.tar.gz
otp-da2a7ff4d340db6d139c3c6abdcfa978dcadb4c2.tar.bz2
otp-da2a7ff4d340db6d139c3c6abdcfa978dcadb4c2.zip
dialyzer: Sort graphs topologically
Although some variable names indicate that lists of SCCs and modules are sorted, that was not always the case. The effect on the execution time of sorting them doesn't seem to be significant. dialyzer_coordinator:sccs_to_pids() should now always return an empty second list (not yet started workers). Since the condensation of graphs often needs a lot of heap memory, it is run in a separate process.
Diffstat (limited to 'lib/common_test')
0 files changed, 0 insertions, 0 deletions