Re: [GHC] #1257: Bytecode generator can't handle unboxed tuples

#1257: Bytecode generator can't handle unboxed tuples -------------------------------------+------------------------------------- Reporter: igloo | Owner: Type: bug | Status: closed Priority: high | Milestone: 7.4.1 Component: GHCi | Version: 6.6 Resolution: wontfix | Keywords: Operating System: | Architecture: Unknown/Multiple Unknown/Multiple | Difficulty: Unknown Type of failure: | Blocked By: None/Unknown | Related Tickets: Test Case: dsrun014 | Blocking: | Differential Revisions: | -------------------------------------+------------------------------------- Comment (by simonmar): The problem is at the boundary between compiled code and interpreted code. We have a few special-purpose stack frames that do the impedence matching between the two worlds, one for each return convention. The problem with unboxed tuples is that there aren't a fixed number of return conventions, so we can't cover all the cases with a few stack frames. I haven't thought about this for a long term, but perhaps there's a way to make a generic stack frame that takes some kind of descriptor to describe the convention. -- Ticket URL: http://ghc.haskell.org/trac/ghc/ticket/1257#comment:11 GHC http://www.haskell.org/ghc/ The Glasgow Haskell Compiler
participants (1)
-
GHC