[GHC] #367: Infinite loops can hang Concurrent Haskell

[GHC]

#367: Infinite loops can hang Concurrent Haskell
------------------------------------------+---------------------------------
  Reporter:  simonpj                      |          Owner:  ezyang              
      Type:  bug                          |         Status:  new                 
  Priority:  lowest                       |      Milestone:  _|_                 
 Component:  Compiler                     |        Version:  6.4.1               
Resolution:  None                         |       Keywords:  scheduler allocation
        Os:  Unknown/Multiple             |   Architecture:  Unknown/Multiple    
   Failure:  Incorrect result at runtime  |     Difficulty:  Unknown             
  Testcase:                               |      Blockedby:                      
  Blocking:                               |        Related:                      
------------------------------------------+---------------------------------

Comment(by simonmar):

 Yes, thanks Edward.  I don't know why we didn't do this ages ago!

 Regarding the CPU-hogging primitives, we should rewrite them so that they
 include a regular yield check.  For example in `newArray#` we can do a
 yield check every 1000 iterations of the loop, which won't have a
 measurable impact on performance.

 Perhaps `-fno-omit-yields` for the flag?  Where `-fomit-yields` is an
 optimisation that we enable by default.

-- 
Ticket URL: <http://hackage.haskell.org/trac/ghc/ticket/367#comment:33>
GHC <http://www.haskell.org/ghc/>
The Glasgow Haskell Compiler