projects / ghc-hetmet.git / commit
? search:
summary | shortlog | log | commit | commitdiff | tree
(parent: 22b3498) | patch
Avoid quadratic complexity in occurrence analysis (fix Trac #1969)
authorsimonpj@microsoft.com <unknown>
Mon, 23 Mar 2009 10:38:26 +0000 (10:38 +0000)
committersimonpj@microsoft.com <unknown>
Mon, 23 Mar 2009 10:38:26 +0000 (10:38 +0000)
commit3733f4b27c7a2c5eb58b020319abbbf9146707c0
treeb570f562390570088d7560c823c9d0f0ab6efaabtree | snapshot
parent22b34988e2b156593d7cfc9b72d6cc0ab471a1d2commit | diff
Avoid quadratic complexity in occurrence analysis (fix Trac #1969)

  The occurrence analyser could go out to lunch in bad cases, because
  of its clever loop-breaking algorithm. This patch makes it bale out
  in bad cases.  Somewhat ad-hoc: a nicer solution would be welcome.

  See Note [Complexity of loop breaking] for the details.
compiler/simplCore/OccurAnal.lhs diff | blob | history
Glasgow Haskell Compiler with heterogeneous metaprogramming (generalized arrows and modal types)