PageRenderTime 67ms CodeModel.GetById 19ms RepoModel.GetById 0ms app.codeStats 1ms

/compiler/cmm/CmmParse.hs

https://bitbucket.org/khibino/ghc-hack
Haskell | 2918 lines | 2369 code | 304 blank | 245 comment | 4 complexity | 90c8cd7fec70ee4facecca680ea27f78 MD5 | raw file
Possible License(s): BSD-3-Clause, BSD-2-Clause, LGPL-3.0 
    

  1. {-# OPTIONS_GHC -w #-}
    2. 

  2. {-# OPTIONS -fglasgow-exts -cpp #-}
    3. 

  3. {-# LANGUAGE BangPatterns #-} -- required for versions of Happy before 1.18.6
    4. 

  4. {-# OPTIONS -Wwarn -w #-}
    5. 

  5. -- The above warning supression flag is a temporary kludge.
    6. 

  6. -- While working on this module you are encouraged to remove it and fix
    7. 

  7. -- any warnings in the module. See
    8. 

  8. --     http://hackage.haskell.org/trac/ghc/wiki/Commentary/CodingStyle#Warnings
    9. 

  9. -- for details
    10. 

  10. 

  11. module CmmParse ( parseCmmFile ) where
    12. 

  12. 

  13. import CgMonad		hiding (getDynFlags)
    14. 

  14. import CgExtCode
    15. 

  15. import CgHeapery
    16. 

  16. import CgUtils
    17. 

  17. import CgProf
    18. 

  18. import CgTicky
    19. 

  19. import CgInfoTbls
    20. 

  20. import CgForeignCall
    21. 

  21. import CgTailCall
    22. 

  22. import CgStackery
    23. 

  23. import ClosureInfo
    24. 

  24. import CgCallConv
    25. 

  25. import CgClosure
    26. 

  26. import CostCentre
    27. 

  27. 

  28. import BlockId
    29. 

  29. import OldCmm
    30. 

  30. import OldPprCmm()
    31. 

  31. import CmmUtils
    32. 

  32. import CmmLex
    33. 

  33. import CLabel
    34. 

  34. import SMRep
    35. 

  35. import Lexer
    36. 

  36. 

  37. import ForeignCall
    38. 

  38. import Module
    39. 

  39. import Literal
    40. 

  40. import Unique
    41. 

  41. import UniqFM
    42. 

  42. import SrcLoc
    43. 

  43. import DynFlags
    44. 

  44. import StaticFlags
    45. 

  45. import ErrUtils
    46. 

  46. import StringBuffer
    47. 

  47. import FastString
    48. 

  48. import Panic
    49. 

  49. import Constants
    50. 

  50. import Outputable
    51. 

  51. import BasicTypes
    52. 

  52. import Bag              ( emptyBag, unitBag )
    53. 

  53. import Var
    54. 

  54. 

  55. import Control.Monad
    56. 

  56. import Data.Array
    57. 

  57. import Data.Char	( ord )
    58. 

  58. import System.Exit
    59. 

  59. 

  60. #include "HsVersions.h"
    61. 

  61. import qualified Data.Array as Happy_Data_Array
    62. 

  62. import qualified GHC.Exts as Happy_GHC_Exts
    63. 

  63. 

  64. -- parser produced by Happy Version 1.18.6
    65. 

  65. 

  66. newtype HappyAbsSyn  = HappyAbsSyn HappyAny
    67. 

  67. #if __GLASGOW_HASKELL__ >= 607
    68. 

  68. type HappyAny = Happy_GHC_Exts.Any
    69. 

  69. #else
    70. 

  70. type HappyAny = forall a . a
    71. 

  71. #endif
    72. 

  72. happyIn4 :: (ExtCode) -> (HappyAbsSyn )
    73. 

  73. happyIn4 x = Happy_GHC_Exts.unsafeCoerce# x
    74. 

  74. {-# INLINE happyIn4 #-}
    75. 

  75. happyOut4 :: (HappyAbsSyn ) -> (ExtCode)
    76. 

  76. happyOut4 x = Happy_GHC_Exts.unsafeCoerce# x
    77. 

  77. {-# INLINE happyOut4 #-}
    78. 

  78. happyIn5 :: (ExtCode) -> (HappyAbsSyn )
    79. 

  79. happyIn5 x = Happy_GHC_Exts.unsafeCoerce# x
    80. 

  80. {-# INLINE happyIn5 #-}
    81. 

  81. happyOut5 :: (HappyAbsSyn ) -> (ExtCode)
    82. 

  82. happyOut5 x = Happy_GHC_Exts.unsafeCoerce# x
    83. 

  83. {-# INLINE happyOut5 #-}
    84. 

  84. happyIn6 :: (ExtCode) -> (HappyAbsSyn )
    85. 

  85. happyIn6 x = Happy_GHC_Exts.unsafeCoerce# x
    86. 

  86. {-# INLINE happyIn6 #-}
    87. 

  87. happyOut6 :: (HappyAbsSyn ) -> (ExtCode)
    88. 

  88. happyOut6 x = Happy_GHC_Exts.unsafeCoerce# x
    89. 

  89. {-# INLINE happyOut6 #-}
    90. 

  90. happyIn7 :: (ExtFCode CLabel) -> (HappyAbsSyn )
    91. 

  91. happyIn7 x = Happy_GHC_Exts.unsafeCoerce# x
    92. 

  92. {-# INLINE happyIn7 #-}
    93. 

  93. happyOut7 :: (HappyAbsSyn ) -> (ExtFCode CLabel)
    94. 

  94. happyOut7 x = Happy_GHC_Exts.unsafeCoerce# x
    95. 

  95. {-# INLINE happyOut7 #-}
    96. 

  96. happyIn8 :: ([ExtFCode [CmmStatic]]) -> (HappyAbsSyn )
    97. 

  97. happyIn8 x = Happy_GHC_Exts.unsafeCoerce# x
    98. 

  98. {-# INLINE happyIn8 #-}
    99. 

  99. happyOut8 :: (HappyAbsSyn ) -> ([ExtFCode [CmmStatic]])
    100. 

  100. happyOut8 x = Happy_GHC_Exts.unsafeCoerce# x
    101. 

  101. {-# INLINE happyOut8 #-}
    102. 

  102. happyIn9 :: (ExtFCode [CmmStatic]) -> (HappyAbsSyn )
    103. 

  103. happyIn9 x = Happy_GHC_Exts.unsafeCoerce# x
    104. 

  104. {-# INLINE happyIn9 #-}
    105. 

  105. happyOut9 :: (HappyAbsSyn ) -> (ExtFCode [CmmStatic])
    106. 

  106. happyOut9 x = Happy_GHC_Exts.unsafeCoerce# x
    107. 

  107. {-# INLINE happyOut9 #-}
    108. 

  108. happyIn10 :: ([ExtFCode CmmExpr]) -> (HappyAbsSyn )
    109. 

  109. happyIn10 x = Happy_GHC_Exts.unsafeCoerce# x
    110. 

  110. {-# INLINE happyIn10 #-}
    111. 

  111. happyOut10 :: (HappyAbsSyn ) -> ([ExtFCode CmmExpr])
    112. 

  112. happyOut10 x = Happy_GHC_Exts.unsafeCoerce# x
    113. 

  113. {-# INLINE happyOut10 #-}
    114. 

  114. happyIn11 :: (ExtCode) -> (HappyAbsSyn )
    115. 

  115. happyIn11 x = Happy_GHC_Exts.unsafeCoerce# x
    116. 

  116. {-# INLINE happyIn11 #-}
    117. 

  117. happyOut11 :: (HappyAbsSyn ) -> (ExtCode)
    118. 

  118. happyOut11 x = Happy_GHC_Exts.unsafeCoerce# x
    119. 

  119. {-# INLINE happyOut11 #-}
    120. 

  120. happyIn12 :: (ExtFCode (CLabel, CmmInfoTable, [Maybe LocalReg])) -> (HappyAbsSyn )
    121. 

  121. happyIn12 x = Happy_GHC_Exts.unsafeCoerce# x
    122. 

  122. {-# INLINE happyIn12 #-}
    123. 

  123. happyOut12 :: (HappyAbsSyn ) -> (ExtFCode (CLabel, CmmInfoTable, [Maybe LocalReg]))
    124. 

  124. happyOut12 x = Happy_GHC_Exts.unsafeCoerce# x
    125. 

  125. {-# INLINE happyOut12 #-}
    126. 

  126. happyIn13 :: (ExtCode) -> (HappyAbsSyn )
    127. 

  127. happyIn13 x = Happy_GHC_Exts.unsafeCoerce# x
    128. 

  128. {-# INLINE happyIn13 #-}
    129. 

  129. happyOut13 :: (HappyAbsSyn ) -> (ExtCode)
    130. 

  130. happyOut13 x = Happy_GHC_Exts.unsafeCoerce# x
    131. 

  131. {-# INLINE happyOut13 #-}
    132. 

  132. happyIn14 :: (ExtCode) -> (HappyAbsSyn )
    133. 

  133. happyIn14 x = Happy_GHC_Exts.unsafeCoerce# x
    134. 

  134. {-# INLINE happyIn14 #-}
    135. 

  135. happyOut14 :: (HappyAbsSyn ) -> (ExtCode)
    136. 

  136. happyOut14 x = Happy_GHC_Exts.unsafeCoerce# x
    137. 

  137. {-# INLINE happyOut14 #-}
    138. 

  138. happyIn15 :: ([(FastString, CLabel)]) -> (HappyAbsSyn )
    139. 

  139. happyIn15 x = Happy_GHC_Exts.unsafeCoerce# x
    140. 

  140. {-# INLINE happyIn15 #-}
    141. 

  141. happyOut15 :: (HappyAbsSyn ) -> ([(FastString, CLabel)])
    142. 

  142. happyOut15 x = Happy_GHC_Exts.unsafeCoerce# x
    143. 

  143. {-# INLINE happyOut15 #-}
    144. 

  144. happyIn16 :: ((FastString,  CLabel)) -> (HappyAbsSyn )
    145. 

  145. happyIn16 x = Happy_GHC_Exts.unsafeCoerce# x
    146. 

  146. {-# INLINE happyIn16 #-}
    147. 

  147. happyOut16 :: (HappyAbsSyn ) -> ((FastString,  CLabel))
    148. 

  148. happyOut16 x = Happy_GHC_Exts.unsafeCoerce# x
    149. 

  149. {-# INLINE happyOut16 #-}
    150. 

  150. happyIn17 :: ([FastString]) -> (HappyAbsSyn )
    151. 

  151. happyIn17 x = Happy_GHC_Exts.unsafeCoerce# x
    152. 

  152. {-# INLINE happyIn17 #-}
    153. 

  153. happyOut17 :: (HappyAbsSyn ) -> ([FastString])
    154. 

  154. happyOut17 x = Happy_GHC_Exts.unsafeCoerce# x
    155. 

  155. {-# INLINE happyOut17 #-}
    156. 

  156. happyIn18 :: (ExtCode) -> (HappyAbsSyn )
    157. 

  157. happyIn18 x = Happy_GHC_Exts.unsafeCoerce# x
    158. 

  158. {-# INLINE happyIn18 #-}
    159. 

  159. happyOut18 :: (HappyAbsSyn ) -> (ExtCode)
    160. 

  160. happyOut18 x = Happy_GHC_Exts.unsafeCoerce# x
    161. 

  161. {-# INLINE happyOut18 #-}
    162. 

  162. happyIn19 :: (CmmReturnInfo) -> (HappyAbsSyn )
    163. 

  163. happyIn19 x = Happy_GHC_Exts.unsafeCoerce# x
    164. 

  164. {-# INLINE happyIn19 #-}
    165. 

  165. happyOut19 :: (HappyAbsSyn ) -> (CmmReturnInfo)
    166. 

  166. happyOut19 x = Happy_GHC_Exts.unsafeCoerce# x
    167. 

  167. {-# INLINE happyOut19 #-}
    168. 

  168. happyIn20 :: (ExtFCode BoolExpr) -> (HappyAbsSyn )
    169. 

  169. happyIn20 x = Happy_GHC_Exts.unsafeCoerce# x
    170. 

  170. {-# INLINE happyIn20 #-}
    171. 

  171. happyOut20 :: (HappyAbsSyn ) -> (ExtFCode BoolExpr)
    172. 

  172. happyOut20 x = Happy_GHC_Exts.unsafeCoerce# x
    173. 

  173. {-# INLINE happyOut20 #-}
    174. 

  174. happyIn21 :: (ExtFCode BoolExpr) -> (HappyAbsSyn )
    175. 

  175. happyIn21 x = Happy_GHC_Exts.unsafeCoerce# x
    176. 

  176. {-# INLINE happyIn21 #-}
    177. 

  177. happyOut21 :: (HappyAbsSyn ) -> (ExtFCode BoolExpr)
    178. 

  178. happyOut21 x = Happy_GHC_Exts.unsafeCoerce# x
    179. 

  179. {-# INLINE happyOut21 #-}
    180. 

  180. happyIn22 :: (CmmSafety) -> (HappyAbsSyn )
    181. 

  181. happyIn22 x = Happy_GHC_Exts.unsafeCoerce# x
    182. 

  182. {-# INLINE happyIn22 #-}
    183. 

  183. happyOut22 :: (HappyAbsSyn ) -> (CmmSafety)
    184. 

  184. happyOut22 x = Happy_GHC_Exts.unsafeCoerce# x
    185. 

  185. {-# INLINE happyOut22 #-}
    186. 

  186. happyIn23 :: (Maybe [GlobalReg]) -> (HappyAbsSyn )
    187. 

  187. happyIn23 x = Happy_GHC_Exts.unsafeCoerce# x
    188. 

  188. {-# INLINE happyIn23 #-}
    189. 

  189. happyOut23 :: (HappyAbsSyn ) -> (Maybe [GlobalReg])
    190. 

  190. happyOut23 x = Happy_GHC_Exts.unsafeCoerce# x
    191. 

  191. {-# INLINE happyOut23 #-}
    192. 

  192. happyIn24 :: ([GlobalReg]) -> (HappyAbsSyn )
    193. 

  193. happyIn24 x = Happy_GHC_Exts.unsafeCoerce# x
    194. 

  194. {-# INLINE happyIn24 #-}
    195. 

  195. happyOut24 :: (HappyAbsSyn ) -> ([GlobalReg])
    196. 

  196. happyOut24 x = Happy_GHC_Exts.unsafeCoerce# x
    197. 

  197. {-# INLINE happyOut24 #-}
    198. 

  198. happyIn25 :: (Maybe (Int,Int)) -> (HappyAbsSyn )
    199. 

  199. happyIn25 x = Happy_GHC_Exts.unsafeCoerce# x
    200. 

  200. {-# INLINE happyIn25 #-}
    201. 

  201. happyOut25 :: (HappyAbsSyn ) -> (Maybe (Int,Int))
    202. 

  202. happyOut25 x = Happy_GHC_Exts.unsafeCoerce# x
    203. 

  203. {-# INLINE happyOut25 #-}
    204. 

  204. happyIn26 :: ([ExtFCode ([Int],Either BlockId ExtCode)]) -> (HappyAbsSyn )
    205. 

  205. happyIn26 x = Happy_GHC_Exts.unsafeCoerce# x
    206. 

  206. {-# INLINE happyIn26 #-}
    207. 

  207. happyOut26 :: (HappyAbsSyn ) -> ([ExtFCode ([Int],Either BlockId ExtCode)])
    208. 

  208. happyOut26 x = Happy_GHC_Exts.unsafeCoerce# x
    209. 

  209. {-# INLINE happyOut26 #-}
    210. 

  210. happyIn27 :: (ExtFCode ([Int],Either BlockId ExtCode)) -> (HappyAbsSyn )
    211. 

  211. happyIn27 x = Happy_GHC_Exts.unsafeCoerce# x
    212. 

  212. {-# INLINE happyIn27 #-}
    213. 

  213. happyOut27 :: (HappyAbsSyn ) -> (ExtFCode ([Int],Either BlockId ExtCode))
    214. 

  214. happyOut27 x = Happy_GHC_Exts.unsafeCoerce# x
    215. 

  215. {-# INLINE happyOut27 #-}
    216. 

  216. happyIn28 :: (ExtFCode (Either BlockId ExtCode)) -> (HappyAbsSyn )
    217. 

  217. happyIn28 x = Happy_GHC_Exts.unsafeCoerce# x
    218. 

  218. {-# INLINE happyIn28 #-}
    219. 

  219. happyOut28 :: (HappyAbsSyn ) -> (ExtFCode (Either BlockId ExtCode))
    220. 

  220. happyOut28 x = Happy_GHC_Exts.unsafeCoerce# x
    221. 

  221. {-# INLINE happyOut28 #-}
    222. 

  222. happyIn29 :: ([Int]) -> (HappyAbsSyn )
    223. 

  223. happyIn29 x = Happy_GHC_Exts.unsafeCoerce# x
    224. 

  224. {-# INLINE happyIn29 #-}
    225. 

  225. happyOut29 :: (HappyAbsSyn ) -> ([Int])
    226. 

  226. happyOut29 x = Happy_GHC_Exts.unsafeCoerce# x
    227. 

  227. {-# INLINE happyOut29 #-}
    228. 

  228. happyIn30 :: (Maybe ExtCode) -> (HappyAbsSyn )
    229. 

  229. happyIn30 x = Happy_GHC_Exts.unsafeCoerce# x
    230. 

  230. {-# INLINE happyIn30 #-}
    231. 

  231. happyOut30 :: (HappyAbsSyn ) -> (Maybe ExtCode)
    232. 

  232. happyOut30 x = Happy_GHC_Exts.unsafeCoerce# x
    233. 

  233. {-# INLINE happyOut30 #-}
    234. 

  234. happyIn31 :: (ExtCode) -> (HappyAbsSyn )
    235. 

  235. happyIn31 x = Happy_GHC_Exts.unsafeCoerce# x
    236. 

  236. {-# INLINE happyIn31 #-}
    237. 

  237. happyOut31 :: (HappyAbsSyn ) -> (ExtCode)
    238. 

  238. happyOut31 x = Happy_GHC_Exts.unsafeCoerce# x
    239. 

  239. {-# INLINE happyOut31 #-}
    240. 

  240. happyIn32 :: (ExtFCode CmmExpr) -> (HappyAbsSyn )
    241. 

  241. happyIn32 x = Happy_GHC_Exts.unsafeCoerce# x
    242. 

  242. {-# INLINE happyIn32 #-}
    243. 

  243. happyOut32 :: (HappyAbsSyn ) -> (ExtFCode CmmExpr)
    244. 

  244. happyOut32 x = Happy_GHC_Exts.unsafeCoerce# x
    245. 

  245. {-# INLINE happyOut32 #-}
    246. 

  246. happyIn33 :: (ExtFCode CmmExpr) -> (HappyAbsSyn )
    247. 

  247. happyIn33 x = Happy_GHC_Exts.unsafeCoerce# x
    248. 

  248. {-# INLINE happyIn33 #-}
    249. 

  249. happyOut33 :: (HappyAbsSyn ) -> (ExtFCode CmmExpr)
    250. 

  250. happyOut33 x = Happy_GHC_Exts.unsafeCoerce# x
    251. 

  251. {-# INLINE happyOut33 #-}
    252. 

  252. happyIn34 :: (CmmType) -> (HappyAbsSyn )
    253. 

  253. happyIn34 x = Happy_GHC_Exts.unsafeCoerce# x
    254. 

  254. {-# INLINE happyIn34 #-}
    255. 

  255. happyOut34 :: (HappyAbsSyn ) -> (CmmType)
    256. 

  256. happyOut34 x = Happy_GHC_Exts.unsafeCoerce# x
    257. 

  257. {-# INLINE happyOut34 #-}
    258. 

  258. happyIn35 :: ([ExtFCode HintedCmmActual]) -> (HappyAbsSyn )
    259. 

  259. happyIn35 x = Happy_GHC_Exts.unsafeCoerce# x
    260. 

  260. {-# INLINE happyIn35 #-}
    261. 

  261. happyOut35 :: (HappyAbsSyn ) -> ([ExtFCode HintedCmmActual])
    262. 

  262. happyOut35 x = Happy_GHC_Exts.unsafeCoerce# x
    263. 

  263. {-# INLINE happyOut35 #-}
    264. 

  264. happyIn36 :: ([ExtFCode HintedCmmActual]) -> (HappyAbsSyn )
    265. 

  265. happyIn36 x = Happy_GHC_Exts.unsafeCoerce# x
    266. 

  266. {-# INLINE happyIn36 #-}
    267. 

  267. happyOut36 :: (HappyAbsSyn ) -> ([ExtFCode HintedCmmActual])
    268. 

  268. happyOut36 x = Happy_GHC_Exts.unsafeCoerce# x
    269. 

  269. {-# INLINE happyOut36 #-}
    270. 

  270. happyIn37 :: ([ExtFCode HintedCmmActual]) -> (HappyAbsSyn )
    271. 

  271. happyIn37 x = Happy_GHC_Exts.unsafeCoerce# x
    272. 

  272. {-# INLINE happyIn37 #-}
    273. 

  273. happyOut37 :: (HappyAbsSyn ) -> ([ExtFCode HintedCmmActual])
    274. 

  274. happyOut37 x = Happy_GHC_Exts.unsafeCoerce# x
    275. 

  275. {-# INLINE happyOut37 #-}
    276. 

  276. happyIn38 :: (ExtFCode HintedCmmActual) -> (HappyAbsSyn )
    277. 

  277. happyIn38 x = Happy_GHC_Exts.unsafeCoerce# x
    278. 

  278. {-# INLINE happyIn38 #-}
    279. 

  279. happyOut38 :: (HappyAbsSyn ) -> (ExtFCode HintedCmmActual)
    280. 

  280. happyOut38 x = Happy_GHC_Exts.unsafeCoerce# x
    281. 

  281. {-# INLINE happyOut38 #-}
    282. 

  282. happyIn39 :: ([ExtFCode CmmExpr]) -> (HappyAbsSyn )
    283. 

  283. happyIn39 x = Happy_GHC_Exts.unsafeCoerce# x
    284. 

  284. {-# INLINE happyIn39 #-}
    285. 

  285. happyOut39 :: (HappyAbsSyn ) -> ([ExtFCode CmmExpr])
    286. 

  286. happyOut39 x = Happy_GHC_Exts.unsafeCoerce# x
    287. 

  287. {-# INLINE happyOut39 #-}
    288. 

  288. happyIn40 :: ([ExtFCode CmmExpr]) -> (HappyAbsSyn )
    289. 

  289. happyIn40 x = Happy_GHC_Exts.unsafeCoerce# x
    290. 

  290. {-# INLINE happyIn40 #-}
    291. 

  291. happyOut40 :: (HappyAbsSyn ) -> ([ExtFCode CmmExpr])
    292. 

  292. happyOut40 x = Happy_GHC_Exts.unsafeCoerce# x
    293. 

  293. {-# INLINE happyOut40 #-}
    294. 

  294. happyIn41 :: (ExtFCode CmmExpr) -> (HappyAbsSyn )
    295. 

  295. happyIn41 x = Happy_GHC_Exts.unsafeCoerce# x
    296. 

  296. {-# INLINE happyIn41 #-}
    297. 

  297. happyOut41 :: (HappyAbsSyn ) -> (ExtFCode CmmExpr)
    298. 

  298. happyOut41 x = Happy_GHC_Exts.unsafeCoerce# x
    299. 

  299. {-# INLINE happyOut41 #-}
    300. 

  300. happyIn42 :: ([ExtFCode HintedCmmFormal]) -> (HappyAbsSyn )
    301. 

  301. happyIn42 x = Happy_GHC_Exts.unsafeCoerce# x
    302. 

  302. {-# INLINE happyIn42 #-}
    303. 

  303. happyOut42 :: (HappyAbsSyn ) -> ([ExtFCode HintedCmmFormal])
    304. 

  304. happyOut42 x = Happy_GHC_Exts.unsafeCoerce# x
    305. 

  305. {-# INLINE happyOut42 #-}
    306. 

  306. happyIn43 :: ([ExtFCode HintedCmmFormal]) -> (HappyAbsSyn )
    307. 

  307. happyIn43 x = Happy_GHC_Exts.unsafeCoerce# x
    308. 

  308. {-# INLINE happyIn43 #-}
    309. 

  309. happyOut43 :: (HappyAbsSyn ) -> ([ExtFCode HintedCmmFormal])
    310. 

  310. happyOut43 x = Happy_GHC_Exts.unsafeCoerce# x
    311. 

  311. {-# INLINE happyOut43 #-}
    312. 

  312. happyIn44 :: (ExtFCode HintedCmmFormal) -> (HappyAbsSyn )
    313. 

  313. happyIn44 x = Happy_GHC_Exts.unsafeCoerce# x
    314. 

  314. {-# INLINE happyIn44 #-}
    315. 

  315. happyOut44 :: (HappyAbsSyn ) -> (ExtFCode HintedCmmFormal)
    316. 

  316. happyOut44 x = Happy_GHC_Exts.unsafeCoerce# x
    317. 

  317. {-# INLINE happyOut44 #-}
    318. 

  318. happyIn45 :: (ExtFCode LocalReg) -> (HappyAbsSyn )
    319. 

  319. happyIn45 x = Happy_GHC_Exts.unsafeCoerce# x
    320. 

  320. {-# INLINE happyIn45 #-}
    321. 

  321. happyOut45 :: (HappyAbsSyn ) -> (ExtFCode LocalReg)
    322. 

  322. happyOut45 x = Happy_GHC_Exts.unsafeCoerce# x
    323. 

  323. {-# INLINE happyOut45 #-}
    324. 

  324. happyIn46 :: (ExtFCode CmmReg) -> (HappyAbsSyn )
    325. 

  325. happyIn46 x = Happy_GHC_Exts.unsafeCoerce# x
    326. 

  326. {-# INLINE happyIn46 #-}
    327. 

  327. happyOut46 :: (HappyAbsSyn ) -> (ExtFCode CmmReg)
    328. 

  328. happyOut46 x = Happy_GHC_Exts.unsafeCoerce# x
    329. 

  329. {-# INLINE happyOut46 #-}
    330. 

  330. happyIn47 :: ([ExtFCode LocalReg]) -> (HappyAbsSyn )
    331. 

  331. happyIn47 x = Happy_GHC_Exts.unsafeCoerce# x
    332. 

  332. {-# INLINE happyIn47 #-}
    333. 

  333. happyOut47 :: (HappyAbsSyn ) -> ([ExtFCode LocalReg])
    334. 

  334. happyOut47 x = Happy_GHC_Exts.unsafeCoerce# x
    335. 

  335. {-# INLINE happyOut47 #-}
    336. 

  336. happyIn48 :: ([ExtFCode LocalReg]) -> (HappyAbsSyn )
    337. 

  337. happyIn48 x = Happy_GHC_Exts.unsafeCoerce# x
    338. 

  338. {-# INLINE happyIn48 #-}
    339. 

  339. happyOut48 :: (HappyAbsSyn ) -> ([ExtFCode LocalReg])
    340. 

  340. happyOut48 x = Happy_GHC_Exts.unsafeCoerce# x
    341. 

  341. {-# INLINE happyOut48 #-}
    342. 

  342. happyIn49 :: ([ExtFCode LocalReg]) -> (HappyAbsSyn )
    343. 

  343. happyIn49 x = Happy_GHC_Exts.unsafeCoerce# x
    344. 

  344. {-# INLINE happyIn49 #-}
    345. 

  345. happyOut49 :: (HappyAbsSyn ) -> ([ExtFCode LocalReg])
    346. 

  346. happyOut49 x = Happy_GHC_Exts.unsafeCoerce# x
    347. 

  347. {-# INLINE happyOut49 #-}
    348. 

  348. happyIn50 :: (ExtFCode LocalReg) -> (HappyAbsSyn )
    349. 

  349. happyIn50 x = Happy_GHC_Exts.unsafeCoerce# x
    350. 

  350. {-# INLINE happyIn50 #-}
    351. 

  351. happyOut50 :: (HappyAbsSyn ) -> (ExtFCode LocalReg)
    352. 

  352. happyOut50 x = Happy_GHC_Exts.unsafeCoerce# x
    353. 

  353. {-# INLINE happyOut50 #-}
    354. 

  354. happyIn51 :: (ExtFCode (Maybe UpdateFrame)) -> (HappyAbsSyn )
    355. 

  355. happyIn51 x = Happy_GHC_Exts.unsafeCoerce# x
    356. 

  356. {-# INLINE happyIn51 #-}
    357. 

  357. happyOut51 :: (HappyAbsSyn ) -> (ExtFCode (Maybe UpdateFrame))
    358. 

  358. happyOut51 x = Happy_GHC_Exts.unsafeCoerce# x
    359. 

  359. {-# INLINE happyOut51 #-}
    360. 

  360. happyIn52 :: (ExtFCode (Maybe BlockId)) -> (HappyAbsSyn )
    361. 

  361. happyIn52 x = Happy_GHC_Exts.unsafeCoerce# x
    362. 

  362. {-# INLINE happyIn52 #-}
    363. 

  363. happyOut52 :: (HappyAbsSyn ) -> (ExtFCode (Maybe BlockId))
    364. 

  364. happyOut52 x = Happy_GHC_Exts.unsafeCoerce# x
    365. 

  365. {-# INLINE happyOut52 #-}
    366. 

  366. happyIn53 :: (CmmType) -> (HappyAbsSyn )
    367. 

  367. happyIn53 x = Happy_GHC_Exts.unsafeCoerce# x
    368. 

  368. {-# INLINE happyIn53 #-}
    369. 

  369. happyOut53 :: (HappyAbsSyn ) -> (CmmType)
    370. 

  370. happyOut53 x = Happy_GHC_Exts.unsafeCoerce# x
    371. 

  371. {-# INLINE happyOut53 #-}
    372. 

  372. happyIn54 :: (CmmType) -> (HappyAbsSyn )
    373. 

  373. happyIn54 x = Happy_GHC_Exts.unsafeCoerce# x
    374. 

  374. {-# INLINE happyIn54 #-}
    375. 

  375. happyOut54 :: (HappyAbsSyn ) -> (CmmType)
    376. 

  376. happyOut54 x = Happy_GHC_Exts.unsafeCoerce# x
    377. 

  377. {-# INLINE happyOut54 #-}
    378. 

  378. happyInTok :: (Located CmmToken) -> (HappyAbsSyn )
    379. 

  379. happyInTok x = Happy_GHC_Exts.unsafeCoerce# x
    380. 

  380. {-# INLINE happyInTok #-}
    381. 

  381. happyOutTok :: (HappyAbsSyn ) -> (Located CmmToken)
    382. 

  382. happyOutTok x = Happy_GHC_Exts.unsafeCoerce# x
    383. 

  383. {-# INLINE happyOutTok #-}
    384. 

  384. 

  385. 

  386. happyActOffsets :: HappyAddr
    387. 

  387. happyActOffsets = HappyA# "\x37\x01\x00\x00\x34\x03\x37\x01\x00\x00\x00\x00\x6f\x03\x00\x00\x26\x03\x00\x00\x6e\x03\x6c\x03\x66\x03\x61\x03\x60\x03\x5e\x03\x23\x03\x1c\x03\x22\x01\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x51\x03\x2b\x03\x94\x00\x54\x03\x37\x03\x00\x00\x15\x03\x44\x03\x3b\x03\x21\x03\x13\x03\x08\x03\x06\x03\x05\x03\x03\x03\xf8\x02\x33\x03\x05\x00\x00\x00\xf7\x02\x00\x00\xf3\x02\x00\x00\x20\x03\x17\x03\x12\x03\x11\x03\x07\x03\x01\x03\xe6\x02\x00\x00\xe3\x02\x00\x00\x22\x01\x00\x00\x10\x03\x00\x00\x00\x03\xd5\x02\xe5\x02\x0a\x03\x61\x00\x00\x00\x94\x00\x00\x00\x00\x00\x3c\x00\x02\x03\x00\x00\xc6\x02\xc3\x02\xb5\x02\xb4\x02\xa3\x02\xb3\x02\x00\x00\xf2\x02\x1a\x00\xf1\x02\xf0\x02\x0c\x00\xe7\x02\xe2\x02\xd7\x02\x00\x00\xe4\x02\x3c\x00\xff\xff\xe1\x02\xe0\x02\xde\x02\x00\x00\x27\x02\xcc\x02\x00\x00\xd8\x02\x61\x00\x61\x00\x98\x02\x61\x00\x00\x00\x00\x00\x00\x00\xbe\x02\xbe\x02\x1a\x00\xd1\x02\x1a\x00\x1a\x00\xe7\xff\xc4\x02\x0d\x00\x00\x00\x0b\x01\x93\x02\x54\x00\x61\x00\xc1\x02\xc2\x02\x00\x00\x14\x00\x00\x00\x94\x00\x00\x00\xd2\x00\xb6\x02\x00\x00\x3f\x02\x61\x00\x86\x02\x61\x00\x61\x00\x61\x00\x61\x00\x61\x00\x61\x00\x61\x00\x61\x00\x61\x00\x61\x00\x61\x00\x61\x00\x61\x00\x61\x00\x61\x00\x61\x00\x61\x00\x02\x00\x77\x02\x83\x02\x94\x01\x00\x00\x00\x00\x00\x00\x81\x02\x76\x02\x73\x02\x00\x00\x94\x00\x65\x02\xab\x02\x61\x00\xa1\x02\x00\x00\x9a\x03\x96\x02\xa0\x02\xa5\x02\x92\x02\x90\x02\x87\x02\x00\x00\x91\x02\x80\x02\x52\x02\x89\x02\xc2\x03\xc2\x03\xc2\x03\xc2\x03\x7b\x00\x7b\x00\xc2\x03\xc2\x03\xd6\x03\xfc\x00\xdd\x03\xd2\x00\xd2\x00\x00\x00\x00\x00\x00\x00\x86\x03\x84\x02\x00\x00\x7b\x02\xdc\x01\x00\x00\x61\x00\x00\x00\x00\x00\x61\x00\x61\x00\x49\x02\x82\x02\x61\x00\x0e\x02\x08\x00\x00\x00\xae\x03\x54\x00\x54\x00\x75\x02\x61\x02\x5a\x02\x00\x00\x00\x00\x3a\x02\x61\x00\x61\x00\x21\x02\x53\x02\x00\x00\x00\x00\x00\x00\x17\x02\x61\x00\x80\x01\xc2\x01\x00\x00\x0b\x01\x4f\x02\x00\x00\x00\x00\x0d\x01\x4e\x02\x3f\x02\x1a\x00\x54\x00\x54\x00\x15\x02\x48\x02\x99\x00\x41\x02\x00\x00\x32\x02\x00\x00\x28\x02\xa8\x01\x37\x02\x36\x02\x00\x00\x43\x00\x00\x00\x61\x00\x3b\x02\x30\x02\x29\x02\x2e\x02\xee\x01\xe5\x01\xe4\x01\x00\x00\xe2\x01\x00\x00\x00\x00\x0f\x02\x03\x02\x02\x02\x01\x02\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x0b\x02\xe0\x01\xcc\x01\x61\x00\x00\x00\x00\x00\x00\x00\x00\x00\x0d\x01\xec\x01\x07\x02\x00\x00\x00\x00\x00\x00\xf7\x01\x00\x00\xf5\x01\xf8\x01\x61\x00\x61\x00\x61\x00\xd6\x01\x00\x00\xef\x01\xc6\x01\xbe\x01\xb1\x01\x00\x00\xa6\x01\xb0\x01\xa5\x01\xa4\x01\xce\x01\xcd\x01\xc5\x01\xd2\x01\xd7\x01\xc3\x01\x00\x00\xc9\x01\xcb\x01\x00\x00\x00\x00\xc8\x01\x6c\x01\xb9\x01\xb8\x01\x89\x01\x89\x01\x00\x00\x1a\x00\xaa\x01\x00\x00\x87\x01\x24\x00\x00\x00\x7e\x01\x7d\x01\x6b\x01\xa2\x01\x83\x01\x6f\x01\x00\x00\x1a\x00\x58\x01\x00\x00\x1a\x00\x93\x01\x7f\x01\x00\x00\x7f\x01\x81\x01\x06\x00\x46\x01\x00\x00\x66\x01\x64\x01\x5b\x01\x12\x01\x0c\x01\x00\x00\x45\x01\x41\x01\x00\x00\x00\x00\x00\x00\x3c\x01\x08\x01\x29\x01\x00\x00\x02\x01\x00\x00\xe3\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00"#
    388. 

  388. 

  389. happyGotoOffsets :: HappyAddr
    390. 

  390. happyGotoOffsets = HappyA# "\xb9\x00\x00\x00\x00\x00\x2b\x00\x00\x00\x00\x00\x0e\x01\x00\x00\x1a\x01\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x17\x01\x00\x00\x10\x01\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xf5\x00\xee\x00\x3b\x01\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xe5\x00\x00\x00\xe4\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x04\x01\x00\x00\x03\x01\x00\x00\xed\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xce\x00\x00\x00\x5f\x03\x00\x00\x40\x00\x00\x00\x00\x00\xab\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x06\x01\xfe\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xfe\xff\x5d\x03\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x4f\x03\x4d\x03\x00\x00\x3f\x03\x00\x00\x00\x00\x00\x00\xdc\x00\xd7\x00\xf9\x00\x00\x00\xf7\x00\xe8\x00\x00\x00\x00\x00\xd9\x00\x00\x00\x95\x00\x00\x00\x33\x01\x3d\x03\xc3\x00\xcf\x00\x00\x00\x00\x00\x00\x00\xb7\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x2f\x03\x00\x00\x7d\x02\x2d\x03\x1f\x03\x1d\x03\x0f\x03\x0d\x03\xff\x02\xfd\x02\xef\x02\xed\x02\xdf\x02\xdd\x02\xcf\x02\xcd\x02\xbf\x02\xbd\x02\xaf\x02\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x38\x00\x00\x00\x00\x00\xad\x02\x00\x00\x00\x00\xd3\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xc4\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x6d\x02\x00\x00\x00\x00\x63\x02\x9f\x02\x00\x00\x00\x00\x51\x02\xb6\x00\x00\x00\x00\x00\x00\x00\x25\x01\x23\x01\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x9f\x00\x9d\x02\x8f\x02\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x8d\x02\x00\x00\x00\x00\x00\x00\xf6\xff\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xcd\x00\x15\x01\xf4\xff\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xf2\xff\x00\x00\x7f\x02\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x9b\x00\x00\x00\x5c\x02\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x4a\x02\x43\x02\x20\x01\xa7\x00\x00\x00\x00\x00\xa5\x00\x4a\x00\x5a\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x86\x00\x0e\x00\x00\x00\xca\x00\x00\x00\x00\x00\x4e\x00\x1e\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xbd\x00\x00\x00\x00\x00\xbb\x00\x00\x00\x1b\x00\x00\x00\x07\x00\x00\x00\x16\x00\x04\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xf5\xff\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00"#
    391. 

  391. 

  392. happyDefActions :: HappyAddr
    393. 

  393. happyDefActions = HappyA# "\xfe\xff\x00\x00\x00\x00\xfe\xff\xfb\xff\xfc\xff\x79\xff\xfa\xff\x00\x00\x6c\xff\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x6d\xff\x6b\xff\x6a\xff\x69\xff\x68\xff\x67\xff\x66\xff\x79\xff\x6f\xff\x77\xff\x00\x00\xdd\xff\xdb\xff\x00\x00\x00\x00\x00\x00\xd9\xff\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x6f\xff\xfd\xff\x71\xff\xeb\xff\x00\x00\xe0\xff\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xde\xff\x00\x00\xda\xff\x00\x00\xdf\xff\x00\x00\x76\xff\x74\xff\x00\x00\x71\xff\x00\x00\x00\x00\x72\xff\x75\xff\x78\xff\xdc\xff\xf6\xff\x00\x00\xd8\xff\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x6e\xff\x00\x00\xe3\xff\xee\xff\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xf7\xff\x00\x00\xf6\xff\x00\x00\x6c\xff\x00\x00\x6d\xff\x73\xff\x00\x00\x9b\xff\x97\xff\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x84\xff\x85\xff\x98\xff\x93\xff\x93\xff\xe3\xff\x00\x00\xe3\xff\xe3\xff\x00\x00\x00\x00\x00\x00\xd7\xff\x00\x00\x00\x00\x00\x00\x00\x00\x91\xff\xba\xff\x7a\xff\x7b\xff\x99\xff\x00\x00\x9a\xff\x9d\xff\x00\x00\x9e\xff\x00\x00\x00\x00\x00\x00\x89\xff\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xf3\xff\xf5\xff\xf8\xff\x00\x00\x00\x00\x00\x00\xe5\xff\x77\xff\x00\x00\x00\x00\x00\x00\x00\x00\xec\xff\xee\xff\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xf4\xff\x00\x00\xee\xff\x00\x00\x00\x00\xa0\xff\x9f\xff\xa2\xff\xa4\xff\xa8\xff\xa9\xff\xa1\xff\xa3\xff\xa5\xff\xa6\xff\xa7\xff\xaa\xff\xab\xff\xac\xff\xad\xff\xae\xff\x87\xff\x00\x00\x88\xff\x00\x00\x00\x00\x94\xff\x89\xff\x92\xff\xd6\xff\x89\xff\x00\x00\x00\x00\x00\x00\x8f\xff\x91\xff\x00\x00\xc8\xff\xc7\xff\x00\x00\x00\x00\x00\x00\x00\x00\x81\xff\x7e\xff\x7c\xff\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xe1\xff\xe2\xff\xea\xff\x00\x00\x00\x00\x00\x00\x00\x00\x7d\xff\x80\xff\x00\x00\xcf\xff\xc4\xff\x00\x00\xc8\xff\xc7\xff\xe3\xff\x00\x00\x00\x00\x00\x00\x00\x00\x8b\xff\x00\x00\x8e\xff\x8d\xff\xcd\xff\x00\x00\x00\x00\x00\x00\x00\x00\x96\xff\x00\x00\x70\xff\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xe4\xff\x00\x00\xf9\xff\xed\xff\x00\x00\x00\x00\x00\x00\x00\x00\xf0\xff\xef\xff\xf2\xff\xf1\xff\x86\xff\x9c\xff\x95\xff\x00\x00\xb9\xff\x00\x00\x00\x00\x90\xff\x8a\xff\xce\xff\xcc\xff\xc5\xff\xc6\xff\x00\x00\xc3\xff\x82\xff\x7f\xff\x00\x00\xd5\xff\x00\x00\x00\x00\x8f\xff\x8f\xff\x00\x00\xb0\xff\x8c\xff\x00\x00\xb1\xff\xb9\xff\x00\x00\xd1\xff\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xb4\xff\xb8\xff\x00\x00\x00\x00\xbb\xff\xcb\xff\x00\x00\x00\x00\x00\x00\x00\x00\xc2\xff\xc2\xff\xd4\xff\xe3\xff\x00\x00\xd0\xff\x00\x00\x00\x00\xe6\xff\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xb7\xff\xe3\xff\x00\x00\xb3\xff\xe3\xff\x00\x00\xc0\xff\xc1\xff\xc0\xff\x00\x00\x00\x00\xca\xff\xaf\xff\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xe9\xff\x00\x00\x00\x00\xb6\xff\xb5\xff\xb2\xff\x00\x00\x00\x00\x00\x00\xbf\xff\xbd\xff\xd2\xff\x00\x00\xbe\xff\xc9\xff\xd3\xff\xe7\xff\xe8\xff\xbc\xff"#
    394. 

  394. 

  395. happyCheck :: HappyAddr
    396. 

  396. happyCheck = HappyA# "\xff\xff\x02\x00\x04\x00\x05\x00\x10\x00\x11\x00\x07\x00\x02\x00\x06\x00\x14\x00\x0b\x00\x03\x00\x06\x00\x0e\x00\x0f\x00\x1d\x00\x1c\x00\x1d\x00\x05\x00\x0f\x00\x08\x00\x01\x00\x2f\x00\x25\x00\x31\x00\x25\x00\x13\x00\x07\x00\x02\x00\x27\x00\x28\x00\x29\x00\x12\x00\x07\x00\x16\x00\x31\x00\x32\x00\x31\x00\x32\x00\x03\x00\x20\x00\x21\x00\x14\x00\x00\x00\x01\x00\x02\x00\x13\x00\x31\x00\x32\x00\x2c\x00\x07\x00\x08\x00\x2c\x00\x0a\x00\x18\x00\x38\x00\x39\x00\x3a\x00\x3b\x00\x3c\x00\x3d\x00\x3e\x00\x3f\x00\x40\x00\x41\x00\x42\x00\x43\x00\x29\x00\x42\x00\x3f\x00\x2c\x00\x2d\x00\x2e\x00\x2f\x00\x07\x00\x31\x00\x32\x00\x40\x00\x34\x00\x35\x00\x2c\x00\x0e\x00\x38\x00\x39\x00\x3a\x00\x3b\x00\x3c\x00\x3d\x00\x3e\x00\x3f\x00\x40\x00\x07\x00\x31\x00\x32\x00\x22\x00\x0b\x00\x16\x00\x17\x00\x0e\x00\x0f\x00\x2c\x00\x2d\x00\x2e\x00\x19\x00\x07\x00\x31\x00\x32\x00\x17\x00\x0b\x00\x2d\x00\x2e\x00\x0e\x00\x0f\x00\x31\x00\x32\x00\x19\x00\x38\x00\x39\x00\x3a\x00\x3b\x00\x3c\x00\x3d\x00\x3e\x00\x38\x00\x39\x00\x3a\x00\x3b\x00\x3c\x00\x3d\x00\x3e\x00\x3f\x00\x40\x00\x41\x00\x42\x00\x43\x00\x0c\x00\x0d\x00\x0e\x00\x0f\x00\x10\x00\x38\x00\x39\x00\x3a\x00\x3b\x00\x3c\x00\x3d\x00\x3e\x00\x3f\x00\x40\x00\x41\x00\x42\x00\x43\x00\x12\x00\x38\x00\x39\x00\x3a\x00\x3b\x00\x3c\x00\x3d\x00\x3e\x00\x3f\x00\x40\x00\x41\x00\x42\x00\x43\x00\x0c\x00\x0d\x00\x0e\x00\x0f\x00\x10\x00\x11\x00\x12\x00\x13\x00\x14\x00\x15\x00\x04\x00\x05\x00\x16\x00\x17\x00\x1a\x00\x1b\x00\x1c\x00\x1d\x00\x1e\x00\x1f\x00\x00\x00\x01\x00\x02\x00\x27\x00\x28\x00\x29\x00\x1a\x00\x07\x00\x08\x00\x1b\x00\x0a\x00\x09\x00\x0a\x00\x09\x00\x0a\x00\x29\x00\x0e\x00\x06\x00\x0e\x00\x38\x00\x39\x00\x3a\x00\x3b\x00\x3c\x00\x3d\x00\x3e\x00\x09\x00\x0a\x00\x1f\x00\x09\x00\x0a\x00\x0e\x00\x06\x00\x41\x00\x0e\x00\x31\x00\x32\x00\x0c\x00\x0d\x00\x0e\x00\x26\x00\x1f\x00\x26\x00\x15\x00\x2a\x00\x0d\x00\x2a\x00\x31\x00\x32\x00\x31\x00\x32\x00\x31\x00\x32\x00\x31\x00\x32\x00\x26\x00\x09\x00\x0a\x00\x26\x00\x2a\x00\x1e\x00\x0e\x00\x2a\x00\x0b\x00\x0c\x00\x1e\x00\x31\x00\x32\x00\x2f\x00\x31\x00\x32\x00\x09\x00\x0a\x00\x09\x00\x0a\x00\x06\x00\x0e\x00\x03\x00\x0e\x00\x0c\x00\x0d\x00\x0e\x00\x0f\x00\x10\x00\x11\x00\x26\x00\x09\x00\x0a\x00\x0d\x00\x2a\x00\x2f\x00\x0e\x00\x30\x00\x1a\x00\x1b\x00\x16\x00\x31\x00\x32\x00\x0b\x00\x0c\x00\x26\x00\x30\x00\x26\x00\x2b\x00\x2a\x00\x3f\x00\x2a\x00\x0d\x00\x10\x00\x11\x00\x0d\x00\x31\x00\x32\x00\x31\x00\x32\x00\x26\x00\x20\x00\x21\x00\x06\x00\x2a\x00\x1c\x00\x1d\x00\x10\x00\x11\x00\x10\x00\x11\x00\x31\x00\x32\x00\x2b\x00\x25\x00\x33\x00\x1c\x00\x1d\x00\x02\x00\x1c\x00\x1d\x00\x1c\x00\x1d\x00\x10\x00\x11\x00\x25\x00\x31\x00\x32\x00\x25\x00\x08\x00\x25\x00\x40\x00\x41\x00\x08\x00\x42\x00\x1c\x00\x1d\x00\x31\x00\x32\x00\x41\x00\x31\x00\x32\x00\x31\x00\x32\x00\x25\x00\x22\x00\x23\x00\x24\x00\x25\x00\x26\x00\x27\x00\x04\x00\x29\x00\x2a\x00\x40\x00\x41\x00\x31\x00\x32\x00\x02\x00\x2c\x00\x2d\x00\x2e\x00\x04\x00\x34\x00\x31\x00\x32\x00\x02\x00\x38\x00\x39\x00\x3a\x00\x3b\x00\x3c\x00\x3d\x00\x3e\x00\x30\x00\x40\x00\x0c\x00\x0d\x00\x0e\x00\x0f\x00\x10\x00\x11\x00\x12\x00\x13\x00\x14\x00\x15\x00\x02\x00\x02\x00\x05\x00\x16\x00\x1a\x00\x1b\x00\x1c\x00\x1d\x00\x1e\x00\x1f\x00\x0c\x00\x0d\x00\x0e\x00\x0f\x00\x10\x00\x11\x00\x12\x00\x13\x00\x14\x00\x15\x00\x02\x00\x04\x00\x40\x00\x16\x00\x1a\x00\x1b\x00\x1c\x00\x1d\x00\x1e\x00\x1f\x00\x0c\x00\x0d\x00\x0e\x00\x0f\x00\x10\x00\x11\x00\x12\x00\x13\x00\x14\x00\x15\x00\x08\x00\x03\x00\x41\x00\x03\x00\x1a\x00\x1b\x00\x1c\x00\x1d\x00\x1e\x00\x1f\x00\x0c\x00\x0d\x00\x0e\x00\x0f\x00\x10\x00\x11\x00\x12\x00\x13\x00\x14\x00\x15\x00\x41\x00\x41\x00\x08\x00\x08\x00\x1a\x00\x1b\x00\x1c\x00\x1d\x00\x1e\x00\x1f\x00\x06\x00\x42\x00\x41\x00\x03\x00\x01\x00\x04\x00\x0c\x00\x0d\x00\x0e\x00\x0f\x00\x10\x00\x11\x00\x12\x00\x13\x00\x14\x00\x15\x00\x01\x00\x16\x00\x08\x00\x16\x00\x1a\x00\x1b\x00\x1c\x00\x1d\x00\x1e\x00\x1f\x00\x06\x00\x16\x00\x16\x00\x41\x00\x41\x00\x41\x00\x0c\x00\x0d\x00\x0e\x00\x0f\x00\x10\x00\x11\x00\x12\x00\x13\x00\x14\x00\x15\x00\x42\x00\x42\x00\x36\x00\x06\x00\x1a\x00\x1b\x00\x1c\x00\x1d\x00\x1e\x00\x1f\x00\x07\x00\x37\x00\x28\x00\x07\x00\x09\x00\x0c\x00\x0d\x00\x0e\x00\x0f\x00\x10\x00\x11\x00\x12\x00\x13\x00\x14\x00\x15\x00\x04\x00\x20\x00\x02\x00\x42\x00\x1a\x00\x1b\x00\x1c\x00\x1d\x00\x1e\x00\x1f\x00\x07\x00\x36\x00\x16\x00\x16\x00\x16\x00\x0c\x00\x0d\x00\x0e\x00\x0f\x00\x10\x00\x11\x00\x12\x00\x13\x00\x14\x00\x15\x00\x42\x00\x16\x00\x42\x00\x42\x00\x1a\x00\x1b\x00\x1c\x00\x1d\x00\x1e\x00\x1f\x00\x07\x00\x41\x00\x02\x00\x08\x00\x02\x00\x0c\x00\x0d\x00\x0e\x00\x0f\x00\x10\x00\x11\x00\x12\x00\x13\x00\x14\x00\x15\x00\x02\x00\x08\x00\x08\x00\x18\x00\x1a\x00\x1b\x00\x1c\x00\x1d\x00\x1e\x00\x1f\x00\x08\x00\x16\x00\x08\x00\x02\x00\x0c\x00\x0d\x00\x0e\x00\x0f\x00\x10\x00\x11\x00\x12\x00\x13\x00\x14\x00\x15\x00\x40\x00\x08\x00\x40\x00\x09\x00\x1a\x00\x1b\x00\x1c\x00\x1d\x00\x1e\x00\x1f\x00\x1c\x00\x1d\x00\x0e\x00\x41\x00\x20\x00\x21\x00\x22\x00\x1c\x00\x1d\x00\x25\x00\x08\x00\x20\x00\x21\x00\x22\x00\x1c\x00\x1d\x00\x25\x00\x16\x00\x20\x00\x21\x00\x22\x00\x31\x00\x32\x00\x25\x00\x02\x00\x1c\x00\x1d\x00\x40\x00\x31\x00\x32\x00\x21\x00\x22\x00\x1c\x00\x1d\x00\x25\x00\x31\x00\x32\x00\x02\x00\x0a\x00\x23\x00\x24\x00\x25\x00\x1c\x00\x1d\x00\x42\x00\x08\x00\x31\x00\x32\x00\x06\x00\x23\x00\x24\x00\x25\x00\x41\x00\x31\x00\x32\x00\x16\x00\x06\x00\x02\x00\x1c\x00\x1d\x00\x1c\x00\x1d\x00\x16\x00\x31\x00\x32\x00\x23\x00\x24\x00\x25\x00\x24\x00\x25\x00\x04\x00\x16\x00\x42\x00\x16\x00\x1c\x00\x1d\x00\x1c\x00\x1d\x00\x08\x00\x31\x00\x32\x00\x31\x00\x32\x00\x25\x00\x08\x00\x25\x00\x42\x00\x16\x00\x40\x00\x42\x00\x1c\x00\x1d\x00\x1c\x00\x1d\x00\x07\x00\x31\x00\x32\x00\x31\x00\x32\x00\x25\x00\x42\x00\x25\x00\x42\x00\x40\x00\x05\x00\x07\x00\x1c\x00\x1d\x00\x1c\x00\x1d\x00\x09\x00\x31\x00\x32\x00\x31\x00\x32\x00\x25\x00\x40\x00\x25\x00\x04\x00\x0a\x00\x19\x00\x40\x00\x1c\x00\x1d\x00\x1c\x00\x1d\x00\x05\x00\x31\x00\x32\x00\x31\x00\x32\x00\x25\x00\x05\x00\x25\x00\x42\x00\x05\x00\x07\x00\x04\x00\x1c\x00\x1d\x00\x1c\x00\x1d\x00\x16\x00\x31\x00\x32\x00\x31\x00\x32\x00\x25\x00\x40\x00\x25\x00\x03\x00\x42\x00\x42\x00\x16\x00\x1c\x00\x1d\x00\x1c\x00\x1d\x00\x16\x00\x31\x00\x32\x00\x31\x00\x32\x00\x25\x00\x01\x00\x25\x00\x42\x00\x16\x00\x16\x00\x42\x00\x1c\x00\x1d\x00\x1c\x00\x1d\x00\x03\x00\x31\x00\x32\x00\x31\x00\x32\x00\x25\x00\x2e\x00\x25\x00\x40\x00\x16\x00\x16\x00\x08\x00\x1c\x00\x1d\x00\x1c\x00\x1d\x00\x16\x00\x31\x00\x32\x00\x31\x00\x32\x00\x25\x00\x40\x00\x25\x00\x2e\x00\x40\x00\x16\x00\x16\x00\x1c\x00\x1d\x00\x1c\x00\x1d\x00\x16\x00\x31\x00\x32\x00\x31\x00\x32\x00\x25\x00\x40\x00\x25\x00\x02\x00\x16\x00\x16\x00\x40\x00\x1c\x00\x1d\x00\x1c\x00\x1d\x00\x02\x00\x31\x00\x32\x00\x31\x00\x32\x00\x25\x00\x40\x00\x25\x00\x40\x00\x40\x00\x03\x00\x40\x00\x1c\x00\x1d\x00\x1c\x00\x1d\x00\x16\x00\x31\x00\x32\x00\x31\x00\x32\x00\x25\x00\x40\x00\x25\x00\x40\x00\x02\x00\x2c\x00\x07\x00\x1c\x00\x1d\x00\x1c\x00\x1d\x00\x41\x00\x31\x00\x32\x00\x31\x00\x32\x00\x25\x00\x40\x00\x25\x00\x07\x00\x40\x00\x07\x00\x07\x00\x1c\x00\x1d\x00\x1c\x00\x1d\x00\x07\x00\x31\x00\x32\x00\x31\x00\x32\x00\x25\x00\x07\x00\x25\x00\x07\x00\x07\x00\xff\xff\x44\x00\x1c\x00\x1d\x00\x1c\x00\x1d\x00\xff\xff\x31\x00\x32\x00\x31\x00\x32\x00\x25\x00\xff\xff\x25\x00\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\x31\x00\x32\x00\x31\x00\x32\x00\x0c\x00\x0d\x00\x0e\x00\x0f\x00\x10\x00\x11\x00\x12\x00\x13\x00\x14\x00\x15\x00\x16\x00\xff\xff\xff\xff\xff\xff\x1a\x00\x1b\x00\x1c\x00\x1d\x00\x1e\x00\x1f\x00\x0c\x00\x0d\x00\x0e\x00\x0f\x00\x10\x00\x11\x00\x12\x00\x13\x00\x14\x00\x15\x00\x16\x00\xff\xff\xff\xff\xff\xff\x1a\x00\x1b\x00\x1c\x00\x1d\x00\x1e\x00\x1f\x00\x0c\x00\x0d\x00\x0e\x00\x0f\x00\x10\x00\x11\x00\x12\x00\x13\x00\x14\x00\x15\x00\xff\xff\xff\xff\xff\xff\xff\xff\x1a\x00\x1b\x00\x1c\x00\x1d\x00\x1e\x00\x1f\x00\x0c\x00\x0d\x00\x0e\x00\x0f\x00\x10\x00\x11\x00\x12\x00\x13\x00\x14\x00\x15\x00\xff\xff\xff\xff\xff\xff\xff\xff\x1a\x00\x1b\x00\x1c\x00\x1d\x00\x1e\x00\x1f\x00\x0c\x00\x0d\x00\x0e\x00\x0f\x00\x10\x00\x11\x00\x12\x00\x0c\x00\x0d\x00\x0e\x00\x0f\x00\x10\x00\xff\xff\xff\xff\x1a\x00\x1b\x00\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\x1a\x00\x1b\x00\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff"#
    397. 

  397. 

  398. happyTable :: HappyAddr
    399. 

  399. happyTable = HappyA# "\x00\x00\x9e\x00\x9e\x00\x5c\x00\x23\x01\xd6\x00\x67\x00\x2f\x00\xb5\x00\x7d\x01\x68\x00\xf4\x00\x75\x01\x69\x00\x6a\x00\x19\x01\xd7\x00\x63\x00\xe1\x00\x71\x01\xa4\x00\xcf\x00\xe3\x00\x64\x00\xe4\x00\x64\x00\x62\x01\xd0\x00\x77\x00\x28\x01\xdc\x00\xdd\x00\x5f\x01\x78\x00\xa5\x00\x65\x00\x09\x00\x65\x00\x09\x00\x5b\x01\xf5\x00\xf6\x00\x73\x01\x2c\x00\x03\x00\x04\x00\x64\x01\x5d\x00\x5e\x00\x30\x00\x05\x00\x06\x00\xf7\x00\x07\x00\x59\x01\x14\x00\x15\x00\x16\x00\x17\x00\x18\x00\x19\x00\x1a\x00\x6b\x00\x6c\x00\x6d\x00\x6e\x00\x6f\x00\x11\x00\xb6\x00\x76\x01\x79\x00\x7a\x00\x7b\x00\x83\xff\x67\x00\x83\xff\x7c\x00\x24\x00\x13\x00\x7d\x00\x5c\x01\x69\x00\x14\x00\x15\x00\x16\x00\x17\x00\x18\x00\x19\x00\x1a\x00\x7e\x00\x7f\x00\xd9\x00\x08\x00\x09\x00\x60\x00\x68\x00\x41\x01\x34\x01\x69\x00\x6a\x00\xad\x00\x3e\x00\x3f\x00\x5c\x01\x67\x00\x40\x00\x09\x00\xda\x00\x68\x00\x61\x00\x3f\x00\x69\x00\x6a\x00\x40\x00\x09\x00\x3f\x01\x61\x00\x15\x00\x16\x00\x17\x00\x18\x00\x19\x00\x1a\x00\x14\x00\x15\x00\x16\x00\x17\x00\x18\x00\x19\x00\x1a\x00\x6b\x00\x6c\x00\x6d\x00\x6e\x00\x6f\x00\x8a\x00\x8b\x00\x8c\x00\x8d\x00\x8e\x00\x14\x00\x15\x00\x16\x00\x17\x00\x18\x00\x19\x00\x1a\x00\x6b\x00\x6c\x00\x6d\x00\x6e\x00\x6f\x00\x61\x01\x14\x00\x15\x00\x16\x00\x17\x00\x18\x00\x19\x00\x1a\x00\x6b\x00\x6c\x00\x6d\x00\x6e\x00\x6f\x00\x8a\x00\x8b\x00\x8c\x00\x8d\x00\x8e\x00\x8f\x00\x90\x00\x91\x00\x92\x00\x93\x00\x5b\x00\x5c\x00\x33\x01\x34\x01\x94\x00\x95\x00\x96\x00\x97\x00\x98\x00\x99\x00\x02\x00\x03\x00\x04\x00\xdb\x00\xdc\x00\xdd\x00\x42\x01\x05\x00\x06\x00\x45\x01\x07\x00\x66\x01\x71\x00\x68\x01\x71\x00\xeb\x00\x72\x00\x07\x01\x72\x00\x14\x00\x15\x00\x16\x00\x17\x00\x18\x00\x19\x00\x1a\x00\x5e\x01\x71\x00\xf7\x00\x25\x01\x71\x00\x72\x00\x0f\x01\x21\x01\x72\x00\x5d\x00\x5e\x00\x8a\x00\x8b\x00\x8c\x00\x73\x00\xd2\x00\x73\x00\xd0\x00\x74\x00\x2a\x00\x74\x00\xcd\x00\x09\x00\x08\x00\x09\x00\x75\x00\x09\x00\x75\x00\x09\x00\x73\x00\xe4\x00\x71\x00\x73\x00\x74\x00\x7f\x00\x72\x00\x74\x00\x47\x00\x1e\x00\x81\x00\x75\x00\x09\x00\x42\x00\x75\x00\x09\x00\xe5\x00\x71\x00\x70\x00\x71\x00\xa6\x00\x72\x00\x48\x00\x72\x00\x8a\x00\x8b\x00\x8c\x00\x8d\x00\x8e\x00\x8f\x00\x73\x00\xa8\x00\x71\x00\x4a\x00\x74\x00\x52\x00\x72\x00\x2d\x00\x94\x00\x95\x00\x78\x01\x75\x00\x09\x00\x1d\x00\x1e\x00\x73\x00\x41\x00\x73\x00\x1b\x00\x74\x00\x76\x01\x74\x00\x22\x00\x24\x01\xd6\x00\x2a\x00\x75\x00\x09\x00\x75\x00\x09\x00\x73\x00\xf5\x00\xf6\x00\x79\x01\x74\x00\xd7\x00\x63\x00\xef\x00\xd6\x00\xf0\x00\xf1\x00\x75\x00\x09\x00\x2b\x00\x64\x00\x7a\x01\x47\x01\x63\x00\x7b\x01\xd7\x00\x63\x00\xf2\x00\x63\x00\xd5\x00\xd6\x00\x64\x00\x65\x00\x09\x00\x64\x00\x7c\x01\x64\x00\xdf\x00\xe0\x00\x7d\x01\x6d\x01\xd7\x00\x63\x00\x65\x00\x09\x00\x6e\x01\x65\x00\x09\x00\x65\x00\x09\x00\x64\x00\x0b\x00\x0c\x00\x0d\x00\x0e\x00\x0f\x00\x10\x00\x6f\x01\x11\x00\x12\x00\x20\x00\x21\x00\x65\x00\x09\x00\x70\x01\x3d\x00\x3e\x00\x3f\x00\x71\x01\x13\x00\x40\x00\x09\x00\x4d\x01\x14\x00\x15\x00\x16\x00\x17\x00\x18\x00\x19\x00\x1a\x00\x73\x01\x1b\x00\x8a\x00\x8b\x00\x8c\x00\x8d\x00\x8e\x00\x8f\x00\x90\x00\x91\x00\x92\x00\x93\x00\x2b\x01\x77\x01\x64\x01\x6a\x01\x94\x00\x95\x00\x96\x00\x97\x00\x98\x00\x99\x00\x8a\x00\x8b\x00\x8c\x00\x8d\x00\x8e\x00\x8f\x00\x90\x00\x91\x00\x92\x00\x93\x00\xb2\x00\x66\x01\x68\x01\x6b\x01\x94\x00\x95\x00\x96\x00\x97\x00\x98\x00\x99\x00\x8a\x00\x8b\x00\x8c\x00\x8d\x00\x8e\x00\x8f\x00\x90\x00\x91\x00\x92\x00\x93\x00\x6c\x01\x1d\x01\x57\x01\x5e\x01\x94\x00\x95\x00\x96\x00\x97\x00\x98\x00\x99\x00\x8a\x00\x8b\x00\x8c\x00\x8d\x00\x8e\x00\x8f\x00\x90\x00\x91\x00\x92\x00\x93\x00\x58\x01\x59\x01\x4b\x01\x4c\x01\x94\x00\x95\x00\x96\x00\x97\x00\x98\x00\x99\x00\x2a\x01\x41\x01\x61\x01\x4e\x01\x4f\x01\x50\x01\x8a\x00\x8b\x00\x8c\x00\x8d\x00\x8e\x00\x8f\x00\x90\x00\x91\x00\x92\x00\x93\x00\x52\x01\x51\x01\x53\x01\x54\x01\x94\x00\x95\x00\x96\x00\x97\x00\x98\x00\x99\x00\x02\x01\x55\x01\x56\x01\x3c\x01\x3d\x01\x3f\x01\x8a\x00\x8b\x00\x8c\x00\x8d\x00\x8e\x00\x8f\x00\x90\x00\x91\x00\x92\x00\x93\x00\x3e\x01\x41\x01\x36\x01\x45\x01\x94\x00\x95\x00\x96\x00\x97\x00\x98\x00\x99\x00\x2f\x01\x44\x01\x47\x01\x2e\x01\x30\x01\x8a\x00\x8b\x00\x8c\x00\x8d\x00\x8e\x00\x8f\x00\x90\x00\x91\x00\x92\x00\x93\x00\x31\x01\xf5\x00\x37\x01\x33\x01\x94\x00\x95\x00\x96\x00\x97\x00\x98\x00\x99\x00\xd4\x00\x36\x01\x38\x01\x39\x01\x3a\x01\x8a\x00\x8b\x00\x8c\x00\x8d\x00\x8e\x00\x8f\x00\x90\x00\x91\x00\x92\x00\x93\x00\x11\x01\x3b\x01\x12\x01\x13\x01\x94\x00\x95\x00\x96\x00\x97\x00\x98\x00\x99\x00\x89\x00\x14\x01\x15\x01\x16\x01\x17\x01\x8a\x00\x8b\x00\x8c\x00\x8d\x00\x8e\x00\x8f\x00\x90\x00\x91\x00\x92\x00\x93\x00\x18\x01\x1b\x01\x1c\x01\x1e\x01\x94\x00\x95\x00\x96\x00\x97\x00\x98\x00\x99\x00\xcc\x00\x1f\x01\x20\x01\x22\x01\x8a\x00\x8b\x00\x8c\x00\x8d\x00\x8e\x00\x8f\x00\x90\x00\x91\x00\x92\x00\x93\x00\x23\x01\x27\x01\x2d\x01\x28\x01\x94\x00\x95\x00\x96\x00\x97\x00\x98\x00\x99\x00\xf8\x00\x63\x00\xe8\x00\xe9\x00\x48\x01\xfa\x00\xfb\x00\xf8\x00\x63\x00\x64\x00\xee\x00\x49\x01\xfa\x00\xfb\x00\xf8\x00\x63\x00\x64\x00\xed\x00\xf9\x00\xfa\x00\xfb\x00\x65\x00\x09\x00\x64\x00\xef\x00\xf8\x00\x63\x00\xdf\x00\x65\x00\x09\x00\x31\x01\xfb\x00\xc6\x00\x63\x00\x64\x00\x65\x00\x09\x00\xfd\x00\x03\x01\xff\x00\xc8\x00\x64\x00\xc6\x00\x63\x00\xfe\x00\x04\x01\x65\x00\x09\x00\x06\x01\x00\x01\xc8\x00\x64\x00\x07\x01\x65\x00\x09\x00\xa8\x00\x09\x01\x0f\x01\xc6\x00\x63\x00\xc6\x00\x63\x00\x0a\x01\x65\x00\x09\x00\xc7\x00\xc8\x00\x64\x00\x18\x01\x64\x00\xaa\x00\x0b\x01\xad\x00\x0c\x01\x2b\x01\x63\x00\xe9\x00\x63\x00\x0d\x01\x65\x00\x09\x00\x65\x00\x09\x00\x64\x00\xac\x00\x64\x00\xaf\x00\x0e\x01\xb4\x00\xb0\x00\xea\x00\x63\x00\xfe\x00\x63\x00\xcd\x00\x65\x00\x09\x00\x65\x00\x09\x00\x64\x00\xb1\x00\x64\x00\xb3\x00\xca\x00\xd2\x00\xd4\x00\xaa\x00\x63\x00\xb6\x00\x63\x00\xe2\x00\x65\x00\x09\x00\x65\x00\x09\x00\x64\x00\xdb\x00\x64\x00\xe7\x00\x88\x00\x81\x00\x84\x00\xb7\x00\x63\x00\xb8\x00\x63\x00\x87\x00\x65\x00\x09\x00\x65\x00\x09\x00\x64\x00\x9a\x00\x64\x00\x56\x00\x9c\x00\x9b\x00\xa0\x00\xb9\x00\x63\x00\xba\x00\x63\x00\xa1\x00\x65\x00\x09\x00\x65\x00\x09\x00\x64\x00\x55\x00\x64\x00\x54\x00\x57\x00\x58\x00\xa2\x00\xbb\x00\x63\x00\xbc\x00\x63\x00\xa3\x00\x65\x00\x09\x00\x65\x00\x09\x00\x64\x00\x5b\x00\x64\x00\x59\x00\xa6\x00\xa8\x00\x5a\x00\xbd\x00\x63\x00\xbe\x00\x63\x00\x70\x00\x65\x00\x09\x00\x65\x00\x09\x00\x64\x00\x44\x00\x64\x00\x45\x00\x46\x00\x4c\x00\x47\x00\xbf\x00\x63\x00\xc0\x00\x63\x00\x4d\x00\x65\x00\x09\x00\x65\x00\x09\x00\x64\x00\x4a\x00\x64\x00\x44\x00\x24\x00\x4e\x00\x4f\x00\xc1\x00\x63\x00\xc2\x00\x63\x00\x50\x00\x65\x00\x09\x00\x65\x00\x09\x00\x64\x00\x52\x00\x64\x00\x31\x00\x51\x00\x38\x00\x32\x00\xc3\x00\x63\x00\xc4\x00\x63\x00\x39\x00\x65\x00\x09\x00\x65\x00\x09\x00\x64\x00\x33\x00\x64\x00\x34\x00\x35\x00\x3a\x00\x36\x00\xc5\x00\x63\x00\xca\x00\x63\x00\x3c\x00\x65\x00\x09\x00\x65\x00\x09\x00\x64\x00\x37\x00\x64\x00\x3b\x00\x3d\x00\x30\x00\x1d\x00\xd4\x00\x63\x00\x82\x00\x63\x00\x22\x00\x65\x00\x09\x00\x65\x00\x09\x00\x64\x00\x24\x00\x64\x00\x25\x00\x24\x00\x26\x00\x27\x00\x84\x00\x63\x00\x85\x00\x63\x00\x28\x00\x65\x00\x09\x00\x65\x00\x09\x00\x64\x00\x29\x00\x64\x00\x2a\x00\x1d\x00\x00\x00\xff\xff\x9c\x00\x63\x00\x62\x00\x63\x00\x00\x00\x65\x00\x09\x00\x65\x00\x09\x00\x64\x00\x00\x00\x64\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x65\x00\x09\x00\x65\x00\x09\x00\x8a\x00\x8b\x00\x8c\x00\x8d\x00\x8e\x00\x8f\x00\x90\x00\x91\x00\x92\x00\x93\x00\x05\x01\x00\x00\x00\x00\x00\x00\x94\x00\x95\x00\x96\x00\x97\x00\x98\x00\x99\x00\x8a\x00\x8b\x00\x8c\x00\x8d\x00\x8e\x00\x8f\x00\x90\x00\x91\x00\x92\x00\x93\x00\xa8\x00\x00\x00\x00\x00\x00\x00\x94\x00\x95\x00\x96\x00\x97\x00\x98\x00\x99\x00\x8a\x00\x8b\x00\x8c\x00\x8d\x00\x8e\x00\x8f\x00\x90\x00\x91\x00\x92\x00\x93\x00\x00\x00\x00\x00\x00\x00\x00\x00\x94\x00\x95\x00\x96\x00\x97\x00\x98\x00\x99\x00\x8a\x00\x8b\x00\x8c\x00\x8d\x00\x8e\x00\x8f\x00\x90\x00\x91\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x94\x00\x95\x00\x00\x00\x00\x00\x00\x00\x00\x00\x8a\x00\x8b\x00\x8c\x00\x8d\x00\x8e\x00\x8f\x00\x90\x00\x8a\x00\x8b\x00\x8c\x00\x8d\x00\x8e\x00\x00\x00\x00\x00\x94\x00\x95\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x94\x00\x95\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00"#
    400. 

  400. 

  401. happyReduceArr = Happy_Data_Array.array (1, 153) [
    402. 

  402. 	(1 , happyReduce_1),
    403. 

  403. 	(2 , happyReduce_2),
    404. 

  404. 	(3 , happyReduce_3),
    405. 

  405. 	(4 , happyReduce_4),
    406. 

  406. 	(5 , happyReduce_5),
    407. 

  407. 	(6 , happyReduce_6),
    408. 

  408. 	(7 , happyReduce_7),
    409. 

  409. 	(8 , happyReduce_8),
    410. 

  410. 	(9 , happyReduce_9),
    411. 

  411. 	(10 , happyReduce_10),
    412. 

  412. 	(11 , happyReduce_11),
    413. 

  413. 	(12 , happyReduce_12),
    414. 

  414. 	(13 , happyReduce_13),
    415. 

  415. 	(14 , happyReduce_14),
    416. 

  416. 	(15 , happyReduce_15),
    417. 

  417. 	(16 , happyReduce_16),
    418. 

  418. 	(17 , happyReduce_17),
    419. 

  419. 	(18 , happyReduce_18),
    420. 

  420. 	(19 , happyReduce_19),
    421. 

  421. 	(20 , happyReduce_20),
    422. 

  422. 	(21 , happyReduce_21),
    423. 

  423. 	(22 , happyReduce_22),
    424. 

  424. 	(23 , happyReduce_23),
    425. 

  425. 	(24 , happyReduce_24),
    426. 

  426. 	(25 , happyReduce_25),
    427. 

  427. 	(26 , happyReduce_26),
    428. 

  428. 	(27 , happyReduce_27),
    429. 

  429. 	(28 , happyReduce_28),
    430. 

  430. 	(29 , happyReduce_29),
    431. 

  431. 	(30 , happyReduce_30),
    432. 

  432. 	(31 , happyReduce_31),
    433. 

  433. 	(32 , happyReduce_32),
    434. 

  434. 	(33 , happyReduce_33),
    435. 

  435. 	(34 , happyReduce_34),
    436. 

  436. 	(35 , happyReduce_35),
    437. 

  437. 	(36 , happyReduce_36),
    438. 

  438. 	(37 , happyReduce_37),
    439. 

  439. 	(38 , happyReduce_38),
    440. 

  440. 	(39 , happyReduce_39),
    441. 

  441. 	(40 , happyReduce_40),
    442. 

  442. 	(41 , happyReduce_41),
    443. 

  443. 	(42 , happyReduce_42),
    444. 

  444. 	(43 , happyReduce_43),
    445. 

  445. 	(44 , happyReduce_44),
    446. 

  446. 	(45 , happyReduce_45),
    447. 

  447. 	(46 , happyReduce_46),
    448. 

  448. 	(47 , happyReduce_47),
    449. 

  449. 	(48 , happyReduce_48),
    450. 

  450. 	(49 , happyReduce_49),
    451. 

  451. 	(50 , happyReduce_50),
    452. 

  452. 	(51 , happyReduce_51),
    453. 

  453. 	(52 , happyReduce_52),
    454. 

  454. 	(53 , happyReduce_53),
    455. 

  455. 	(54 , happyReduce_54),
    456. 

  456. 	(55 , happyReduce_55),
    457. 

  457. 	(56 , happyReduce_56),
    458. 

  458. 	(57 , happyReduce_57),
    459. 

  459. 	(58 , happyReduce_58),
    460. 

  460. 	(59 , happyReduce_59),
    461. 

  461. 	(60 , happyReduce_60),
    462. 

  462. 	(61 , happyReduce_61),
    463. 

  463. 	(62 , happyReduce_62),
    464. 

  464. 	(63 , happyReduce_63),
    465. 

  465. 	(64 , happyReduce_64),
    466. 

  466. 	(65 , happyReduce_65),
    467. 

  467. 	(66 , happyReduce_66),
    468. 

  468. 	(67 , happyReduce_67),
    469. 

  469. 	(68 , happyReduce_68),
    470. 

  470. 	(69 , happyReduce_69),
    471. 

  471. 	(70 , happyReduce_70),
    472. 

  472. 	(71 , happyReduce_71),
    473. 

  473. 	(72 , happyReduce_72),
    474. 

  474. 	(73 , happyReduce_73),
    475. 

  475. 	(74 , happyReduce_74),
    476. 

  476. 	(75 , happyReduce_75),
    477. 

  477. 	(76 , happyReduce_76),
    478. 

  478. 	(77 , happyReduce_77),
    479. 

  479. 	(78 , happyReduce_78),
    480. 

  480. 	(79 , happyReduce_79),
    481. 

  481. 	(80 , happyReduce_80),
    482. 

  482. 	(81 , happyReduce_81),
    483. 

  483. 	(82 , happyReduce_82),
    484. 

  484. 	(83 , happyReduce_83),
    485. 

  485. 	(84 , happyReduce_84),
    486. 

  486. 	(85 , happyReduce_85),
    487. 

  487. 	(86 , happyReduce_86),
    488. 

  488. 	(87 , happyReduce_87),
    489. 

  489. 	(88 , happyReduce_88),
    490. 

  490. 	(89 , happyReduce_89),
    491. 

  491. 	(90 , happyReduce_90),
    492. 

  492. 	(91 , happyReduce_91),
    493. 

  493. 	(92 , happyReduce_92),
    494. 

  494. 	(93 , happyReduce_93),
    495. 

  495. 	(94 , happyReduce_94),
    496. 

  496. 	(95 , happyReduce_95),
    497. 

  497. 	(96 , happyReduce_96),
    498. 

  498. 	(97 , happyReduce_97),
    499. 

  499. 	(98 , happyReduce_98),
    500. 

  500. 	(99 , happyReduce_99),
    501. 

  501. 	(100 , happyReduce_100),
    502. 

  502. 	(101 , happyReduce_101),
    503. 

  503. 	(102 , happyReduce_102),
    504. 

  504. 	(103 , happyReduce_103),
    505. 

  505. 	(104 , happyReduce_104),
    506. 

  506. 	(105 , happyReduce_105),
    507. 

  507. 	(106 , happyReduce_106),
    508. 

  508. 	(107 , happyReduce_107),
    509. 

  509. 	(108 , happyReduce_108),
    510. 

  510. 	(109 , happyReduce_109),
    511. 

  511. 	(110 , happyReduce_110),
    512. 

  512. 	(111 , happyReduce_111),
    513. 

  513. 	(112 , happyReduce_112),
    514. 

  514. 	(113 , happyReduce_113),
    515. 

  515. 	(114 , happyReduce_114),
    516. 

  516. 	(115 , happyReduce_115),
    517. 

  517. 	(116 , happyReduce_116),
    518. 

  518. 	(117 , happyReduce_117),
    519. 

  519. 	(118 , happyReduce_118),
    520. 

  520. 	(119 , happyReduce_119),
    521. 

  521. 	(120 , happyReduce_120),
    522. 

  522. 	(121 , happyReduce_121),
    523. 

  523. 	(122 , happyReduce_122),
    524. 

  524. 	(123 , happyReduce_123),
    525. 

  525. 	(124 , happyReduce_124),
    526. 

  526. 	(125 , happyReduce_125),
    527. 

  527. 	(126 , happyReduce_126),
    528. 

  528. 	(127 , happyReduce_127),
    529. 

  529. 	(128 , happyReduce_128),
    530. 

  530. 	(129 , happyReduce_129),
    531. 

  531. 	(130 , happyReduce_130),
    532. 

  532. 	(131 , happyReduce_131),
    533. 

  533. 	(132 , happyReduce_132),
    534. 

  534. 	(133 , happyReduce_133),
    535. 

  535. 	(134 , happyReduce_134),
    536. 

  536. 	(135 , happyReduce_135),
    537. 

  537. 	(136 , happyReduce_136),
    538. 

  538. 	(137 , happyReduce_137),
    539. 

  539. 	(138 , happyReduce_138),
    540. 

  540. 	(139 , happyReduce_139),
    541. 

  541. 	(140 , happyReduce_140),
    542. 

  542. 	(141 , happyReduce_141),
    543. 

  543. 	(142 , happyReduce_142),
    544. 

  544. 	(143 , happyReduce_143),
    545. 

  545. 	(144 , happyReduce_144),
    546. 

  546. 	(145 , happyReduce_145),
    547. 

  547. 	(146 , happyReduce_146),
    548. 

  548. 	(147 , happyReduce_147),
    549. 

  549. 	(148 , happyReduce_148),
    550. 

  550. 	(149 , happyReduce_149),
    551. 

  551. 	(150 , happyReduce_150),
    552. 

  552. 	(151 , happyReduce_151),
    553. 

  553. 	(152 , happyReduce_152),
    554. 

  554. 	(153 , happyReduce_153)
    555. 

  555. 	]
    556. 

  556. 

  557. happy_n_terms = 69 :: Int
    558. 

  558. happy_n_nonterms = 51 :: Int
    559. 

  559. 

  560. happyReduce_1 = happySpecReduce_0  0# happyReduction_1
    561. 

  561. happyReduction_1  =  happyIn4
    562. 

  562. 		 (return ()
    563. 

  563. 	)
    564. 

  564. 

  565. happyReduce_2 = happySpecReduce_2  0# happyReduction_2
    566. 

  566. happyReduction_2 happy_x_2
    567. 

  567. 	happy_x_1
    568. 

  568. 	 =  case happyOut5 happy_x_1 of { happy_var_1 -> 
    569. 

  569. 	case happyOut4 happy_x_2 of { happy_var_2 -> 
    570. 

  570. 	happyIn4
    571. 

  571. 		 (do happy_var_1; happy_var_2
    572. 

  572. 	)}}
    573. 

  573. 

  574. happyReduce_3 = happySpecReduce_1  1# happyReduction_3
    575. 

  575. happyReduction_3 happy_x_1
    576. 

  576. 	 =  case happyOut11 happy_x_1 of { happy_var_1 -> 
    577. 

  577. 	happyIn5
    578. 

  578. 		 (happy_var_1
    579. 

  579. 	)}
    580. 

  580. 

  581. happyReduce_4 = happySpecReduce_1  1# happyReduction_4
    582. 

  582. happyReduction_4 happy_x_1
    583. 

  583. 	 =  case happyOut6 happy_x_1 of { happy_var_1 -> 
    584. 

  584. 	happyIn5
    585. 

  585. 		 (happy_var_1
    586. 

  586. 	)}
    587. 

  587. 

  588. happyReduce_5 = happySpecReduce_1  1# happyReduction_5
    589. 

  589. happyReduction_5 happy_x_1
    590. 

  590. 	 =  case happyOut14 happy_x_1 of { happy_var_1 -> 
    591. 

  591. 	happyIn5
    592. 

  592. 		 (happy_var_1
    593. 

  593. 	)}
    594. 

  594. 

  595. happyReduce_6 = happyMonadReduce 8# 1# happyReduction_6
    596. 

  596. happyReduction_6 (happy_x_8 `HappyStk`
    597. 

  597. 	happy_x_7 `HappyStk`
    598. 

  598. 	happy_x_6 `HappyStk`
    599. 

  599. 	happy_x_5 `HappyStk`
    600. 

  600. 	happy_x_4 `HappyStk`
    601. 

  601. 	happy_x_3 `HappyStk`
    602. 

  602. 	happy_x_2 `HappyStk`
    603. 

  603. 	happy_x_1 `HappyStk`
    604. 

  604. 	happyRest) tk
    605. 

  605. 	 = happyThen (case happyOutTok happy_x_3 of { (L _ (CmmT_Name	happy_var_3)) -> 
    606. 

  606. 	case happyOutTok happy_x_5 of { (L _ (CmmT_Name	happy_var_5)) -> 
    607. 

  607. 	case happyOut10 happy_x_6 of { happy_var_6 -> 
    608. 

  608. 	( withThisPackage $ \pkg -> 
    609. 

  609. 		   do lits <- sequence happy_var_6;
    610. 

  610. 		      staticClosure pkg happy_var_3 happy_var_5 (map getLit lits))}}}
    611. 

  611. 	) (\r -> happyReturn (happyIn5 r))
    612. 

  612. 

  613. happyReduce_7 = happyReduce 6# 2# happyReduction_7
    614. 

  614. happyReduction_7 (happy_x_6 `HappyStk`
    615. 

  615. 	happy_x_5 `HappyStk`
    616. 

  616. 	happy_x_4 `HappyStk`
    617. 

  617. 	happy_x_3 `HappyStk`
    618. 

  618. 	happy_x_2 `HappyStk`
    619. 

  619. 	happy_x_1 `HappyStk`
    620. 

  620. 	happyRest)
    621. 

  621. 	 = case happyOutTok happy_x_2 of { (L _ (CmmT_String	happy_var_2)) -> 
    622. 

  622. 	case happyOut7 happy_x_4 of { happy_var_4 -> 
    623. 

  623. 	case happyOut8 happy_x_5 of { happy_var_5 -> 
    624. 

  624. 	happyIn6
    625. 

  625. 		 (do lbl <- happy_var_4;
    626. 

  626. 		     ss <- sequence happy_var_5;
    627. 

  627. 		     code (emitDecl (CmmData (section happy_var_2) (Statics lbl $ concat ss)))
    628. 

  628. 	) `HappyStk` happyRest}}}
    629. 

  629. 

  630. happyReduce_8 = happyMonadReduce 2# 3# happyReduction_8
    631. 

  631. happyReduction_8 (happy_x_2 `HappyStk`
    632. 

  632. 	happy_x_1 `HappyStk`
    633. 

  633. 	happyRest) tk
    634. 

  634. 	 = happyThen (case happyOutTok happy_x_1 of { (L _ (CmmT_Name	happy_var_1)) -> 
    635. 

  635. 	( withThisPackage $ \pkg -> 
    636. 

  636. 		   return (mkCmmDataLabel pkg happy_var_1))}
    637. 

  637. 	) (\r -> happyReturn (happyIn7 r))
    638. 

  638. 

  639. happyReduce_9 = happySpecReduce_0  4# happyReduction_9
    640. 

  640. happyReduction_9  =  happyIn8
    641. 

  641. 		 ([]
    642. 

  642. 	)
    643. 

  643. 

  644. happyReduce_10 = happySpecReduce_2  4# happyReduction_10
    645. 

  645. happyReduction_10 happy_x_2
    646. 

  646. 	happy_x_1
    647. 

  647. 	 =  case happyOut9 happy_x_1 of { happy_var_1 -> 
    648. 

  648. 	case happyOut8 happy_x_2 of { happy_var_2 -> 
    649. 

  649. 	happyIn8
    650. 

  650. 		 (happy_var_1 : happy_var_2
    651. 

  651. 	)}}
    652. 

  652. 

  653. happyReduce_11 = happySpecReduce_3  5# happyReduction_11
    654. 

  654. happyReduction_11 happy_x_3
    655. 

  655. 	happy_x_2
    656. 

  656. 	happy_x_1
    657. 

  657. 	 =  case happyOut32 happy_x_2 of { happy_var_2 -> 
    658. 

  658. 	happyIn9
    659. 

  659. 		 (do e <- happy_var_2;
    660. 

  660. 			     return [CmmStaticLit (getLit e)]
    661. 

  661. 	)}
    662. 

  662. 

  663. happyReduce_12 = happySpecReduce_2  5# happyReduction_12
    664. 

  664. happyReduction_12 happy_x_2
    665. 

  665. 	happy_x_1
    666. 

  666. 	 =  case happyOut53 happy_x_1 of { happy_var_1 -> 
    667. 

  667. 	happyIn9
    668. 

  668. 		 (return [CmmUninitialised
    669. 

  669. 							(widthInBytes (typeWidth happy_var_1))]
    670. 

  670. 	)}
    671. 

  671. 

  672. happyReduce_13 = happyReduce 5# 5# happyReduction_13
    673. 

  673. happyReduction_13 (happy_x_5 `HappyStk`
    674. 

  674. 	happy_x_4 `HappyStk`
    675. 

  675. 	happy_x_3 `HappyStk`
    676. 

  676. 	happy_x_2 `HappyStk`
    677. 

  677. 	happy_x_1 `HappyStk`
    678. 

  678. 	happyRest)
    679. 

  679. 	 = case happyOutTok happy_x_4 of { (L _ (CmmT_String	happy_var_4)) -> 
    680. 

  680. 	happyIn9
    681. 

  681. 		 (return [mkString happy_var_4]
    682. 

  682. 	) `HappyStk` happyRest}
    683. 

  683. 

  684. happyReduce_14 = happyReduce 5# 5# happyReduction_14
    685. 

  685. happyReduction_14 (happy_x_5 `HappyStk`
    686. 

  686. 	happy_x_4 `HappyStk`
    687. 

  687. 	happy_x_3 `HappyStk`
    688. 

  688. 	happy_x_2 `HappyStk`
    689. 

  689. 	happy_x_1 `HappyStk`
    690. 

  690. 	happyRest)
    691. 

  691. 	 = case happyOutTok happy_x_3 of { (L _ (CmmT_Int		happy_var_3)) -> 
    692. 

  692. 	happyIn9
    693. 

  693. 		 (return [CmmUninitialised 
    694. 

  694. 							(fromIntegral happy_var_3)]
    695. 

  695. 	) `HappyStk` happyRest}
    696. 

  696. 

  697. happyReduce_15 = happyReduce 5# 5# happyReduction_15
    698. 

  698. happyReduction_15 (happy_x_5 `HappyStk`
    699. 

  699. 	happy_x_4 `HappyStk`
    700. 

  700. 	happy_x_3 `HappyStk`
    701. 

  701. 	happy_x_2 `HappyStk`
    702. 

  702. 	happy_x_1 `HappyStk`
    703. 

  703. 	happyRest)
    704. 

  704. 	 = case happyOut54 happy_x_1 of { happy_var_1 -> 
    705. 

  705. 	case happyOutTok happy_x_3 of { (L _ (CmmT_Int		happy_var_3)) -> 
    706. 

  706. 	happyIn9
    707. 

  707. 		 (return [CmmUninitialised 
    708. 

  708. 						(widthInBytes (typeWidth happy_var_1) * 
    709. 

  709. 							fromIntegral happy_var_3)]
    710. 

  710. 	) `HappyStk` happyRest}}
    711. 

  711. 

  712. happyReduce_16 = happyReduce 5# 5# happyReduction_16
    713. 

  713. happyReduction_16 (happy_x_5 `HappyStk`
    714. 

  714. 	happy_x_4 `HappyStk`
    715. 

  715. 	happy_x_3 `HappyStk`
    716. 

  716. 	happy_x_2 `HappyStk`
    717. 

  717. 	happy_x_1 `HappyStk`
    718. 

  718. 	happyRest)
    719. 

  719. 	 = case happyOutTok happy_x_3 of { (L _ (CmmT_Name	happy_var_3)) -> 
    720. 

  720. 	case happyOut10 happy_x_4 of { happy_var_4 -> 
    721. 

  721. 	happyIn9
    722. 

  722. 		 (do lits <- sequence happy_var_4;
    723. 

  723. 		     return $ map CmmStaticLit $
    724. 

  724.                        mkStaticClosure (mkForeignLabel happy_var_3 Nothing ForeignLabelInExternalPackage IsData)
    725. 

  725.                          -- mkForeignLabel because these are only used
    726. 

  726.                          -- for CHARLIKE and INTLIKE closures in the RTS.
    727. 

  727. 			 dontCareCCS (map getLit lits) [] [] []
    728. 

  728. 	) `HappyStk` happyRest}}
    729. 

  729. 

  730. happyReduce_17 = happySpecReduce_0  6# happyReduction_17
    731. 

  731. happyReduction_17  =  happyIn10
    732. 

  732. 		 ([]
    733. 

  733. 	)
    734. 

  734. 

  735. happyReduce_18 = happySpecReduce_3  6# happyReduction_18
    736. 

  736. happyReduction_18 happy_x_3
    737. 

  737. 	happy_x_2
    738. 

  738. 	happy_x_1
    739. 

  739. 	 =  case happyOut32 happy_x_2 of { happy_var_2 -> 
    740. 

  740. 	case happyOut10 happy_x_3 of { happy_var_3 -> 
    741. 

  741. 	happyIn10
    742. 

  742. 		 (happy_var_2 : happy_var_3
    743. 

  743. 	)}}
    744. 

  744. 

  745. happyReduce_19 = happyReduce 7# 7# happyReduction_19
    746. 

  746. happyReduction_19 (happy_x_7 `HappyStk`
    747. 

  747. 	happy_x_6 `HappyStk`
    748. 

  748. 	happy_x_5 `HappyStk`
    749. 

  749. 	happy_x_4 `HappyStk`
    750. 

  750. 	happy_x_3 `HappyStk`
    751. 

  751. 	happy_x_2 `HappyStk`
    752. 

  752. 	happy_x_1 `HappyStk`
    753. 

  753. 	happyRest)
    754. 

  754. 	 = case happyOut12 happy_x_1 of { happy_var_1 -> 
    755. 

  755. 	case happyOut47 happy_x_2 of { happy_var_2 -> 
    756. 

  756. 	case happyOut52 happy_x_3 of { happy_var_3 -> 
    757. 

  757. 	case happyOut51 happy_x_4 of { happy_var_4 -> 
    758. 

  758. 	case happyOut13 happy_x_6 of { happy_var_6 -> 
    759. 

  759. 	happyIn11
    760. 

  760. 		 (do ((entry_ret_label, info, live, formals, gc_block, frame), stmts) <-
    761. 

  761. 		       getCgStmtsEC' $ loopDecls $ do {
    762. 

  762. 		         (entry_ret_label, info, live) <- happy_var_1;
    763. 

  763. 		         formals <- sequence happy_var_2;
    764. 

  764. 		         gc_block <- happy_var_3;
    765. 

  765. 		         frame <- happy_var_4;
    766. 

  766. 		         happy_var_6;
    767. 

  767. 		         return (entry_ret_label, info, live, formals, gc_block, frame) }
    768. 

  768. 		     blks <- code (cgStmtsToBlocks stmts)
    769. 

  769. 		     code (emitInfoTableAndCode entry_ret_label (CmmInfo gc_block frame info) formals blks)
    770. 

  770. 	) `HappyStk` happyRest}}}}}
    771. 

  771. 

  772. happyReduce_20 = happySpecReduce_3  7# happyReduction_20
    773. 

  773. happyReduction_20 happy_x_3
    774. 

  774. 	happy_x_2
    775. 

  775. 	happy_x_1
    776. 

  776. 	 =  case happyOut12 happy_x_1 of { happy_var_1 -> 
    777. 

  777. 	case happyOut47 happy_x_2 of { happy_var_2 -> 
    778. 

  778. 	happyIn11
    779. 

  779. 		 (do (entry_ret_label, info, live) <- happy_var_1;
    780. 

  780. 		     formals <- sequence happy_var_2;
    781. 

  781. 		     code (emitInfoTableAndCode entry_ret_label (CmmInfo Nothing Nothing info) formals [])
    782. 

  782. 	)}}
    783. 

  783. 

  784. happyReduce_21 = happyMonadReduce 7# 7# happyReduction_21
    785. 

  785. happyReduction_21 (happy_x_7 `HappyStk`
    786. 

  786. 	happy_x_6 `HappyStk`
    787. 

  787. 	happy_x_5 `HappyStk`
    788. 

  788. 	happy_x_4 `HappyStk`
    789. 

  789. 	happy_x_3 `HappyStk`
    790. 

  790. 	happy_x_2 `HappyStk`
    791. 

  791. 	happy_x_1 `HappyStk`
    792. 

  792. 	happyRest) tk
    793. 

  793. 	 = happyThen (case happyOutTok happy_x_1 of { (L _ (CmmT_Name	happy_var_1)) -> 
    794. 

  794. 	case happyOut47 happy_x_2 of { happy_var_2 -> 
    795. 

  795. 	case happyOut52 happy_x_3 of { happy_var_3 -> 
    796. 

  796. 	case happyOut51 happy_x_4 of { happy_var_4 -> 
    797. 

  797. 	case happyOut13 happy_x_6 of { happy_var_6 -> 
    798. 

  798. 	( withThisPackage $ \pkg ->
    799. 

  799. 		   do	newFunctionName happy_var_1 pkg
    800. 

  800. 		   	((formals, gc_block, frame), stmts) <-
    801. 

  801. 			 	getCgStmtsEC' $ loopDecls $ do {
    802. 

  802. 		          		formals <- sequence happy_var_2;
    803. 

  803. 		          		gc_block <- happy_var_3;
    804. 

  804. 			  		frame <- happy_var_4;
    805. 

  805. 		          		happy_var_6;
    806. 

  806. 		          		return (formals, gc_block, frame) }
    807. 

  807. 			blks <- code (cgStmtsToBlocks stmts)
    808. 

  808. 			code (emitProc (CmmInfo gc_block frame CmmNonInfoTable) (mkCmmCodeLabel pkg happy_var_1) formals blks))}}}}}
    809. 

  809. 	) (\r -> happyReturn (happyIn11 r))
    810. 

  810. 

  811. happyReduce_22 = happyMonadReduce 14# 8# happyReduction_22
    812. 

  812. happyReduction_22 (happy_x_14 `HappyStk`
    813. 

  813. 	happy_x_13 `HappyStk`
    814. 

  814. 	happy_x_12 `HappyStk`
    815. 

  815. 	happy_x_11 `HappyStk`
    816. 

  816. 	happy_x_10 `HappyStk`
    817. 

  817. 	happy_x_9 `HappyStk`
    818. 

  818. 	happy_x_8 `HappyStk`
    819. 

  819. 	happy_x_7 `HappyStk`
    820. 

  820. 	happy_x_6 `HappyStk`
    821. 

  821. 	happy_x_5 `HappyStk`
    822. 

  822. 	happy_x_4 `HappyStk`
    823. 

  823. 	happy_x_3 `HappyStk`
    824. 

  824. 	happy_x_2 `HappyStk`
    825. 

  825. 	happy_x_1 `HappyStk`
    826. 

  826. 	happyRest) tk
    827. 

  827. 	 = happyThen (case happyOutTok happy_x_3 of { (L _ (CmmT_Name	happy_var_3)) -> 
    828. 

  828. 	case happyOutTok happy_x_5 of { (L _ (CmmT_Int		happy_var_5)) -> 
    829. 

  829. 	case happyOutTok happy_x_7 of { (L _ (CmmT_Int		happy_var_7)) -> 
    830. 

  830. 	case happyOutTok happy_x_9 of { (L _ (CmmT_Int		happy_var_9)) -> 
    831. 

  831. 	case happyOutTok happy_x_11 of { (L _ (CmmT_String	happy_var_11)) -> 
    832. 

  832. 	case happyOutTok happy_x_13 of { (L _ (CmmT_String	happy_var_13)) -> 
    833. 

  833. 	( withThisPackage $ \pkg ->
    834. 

  834. 		   do let prof = profilingInfo happy_var_11 happy_var_13
    835. 

  835.                           rep  = mkRTSRep (fromIntegral happy_var_9) $
    836. 

  836.                                    mkHeapRep False (fromIntegral happy_var_5)
    837. 

  837.                                                    (fromIntegral happy_var_7) Thunk
    838. 

  838.                               -- not really Thunk, but that makes the info table
    839. 

  839.                               -- we want.
    840. 

  840.                       return (mkCmmEntryLabel pkg happy_var_3,
    841. 

  841. 			      CmmInfoTable { cit_lbl = mkCmmInfoLabel pkg happy_var_3
    842. 

  842. 				           , cit_rep = rep
    843. 

  843.                				   , cit_prof = prof, cit_srt = NoC_SRT },
    844. 

  844. 			      []))}}}}}}
    845. 

  845. 	) (\r -> happyReturn (happyIn12 r))
    846. 

  846. 

  847. happyReduce_23 = happyMonadReduce 16# 8# happyReduction_23
    848. 

  848. happyReduction_23 (happy_x_16 `HappyStk`
    849. 

  849. 	happy_x_15 `HappyStk`
    850. 

  850. 	happy_x_14 `HappyStk`
    851. 

  851. 	happy_x_13 `HappyStk`
    852. 

  852. 	happy_x_12 `HappyStk`
    853. 

  853. 	happy_x_11 `HappyStk`
    854. 

  854. 	happy_x_10 `HappyStk`
    855. 

  855. 	happy_x_9 `HappyStk`
    856. 

  856. 	happy_x_8 `HappyStk`
    857. 

  857. 	happy_x_7 `HappyStk`
    858. 

  858. 	happy_x_6 `HappyStk`
    859. 

  859. 	happy_x_5 `HappyStk`
    860. 

  860. 	happy_x_4 `HappyStk`
    861. 

  861. 	happy_x_3 `HappyStk`
    862. 

  862. 	happy_x_2 `HappyStk`
    863. 

  863. 	happy_x_1 `HappyStk`
    864. 

  864. 	happyRest) tk
    865. 

  865. 	 = happyThen (case happyOutTok happy_x_3 of { (L _ (CmmT_Name	happy_var_3)) -> 
    866. 

  866. 	case happyOutTok happy_x_5 of { (L _ (CmmT_Int		happy_var_5)) -> 
    867. 

  867. 	case happyOutTok happy_x_7 of { (L _ (CmmT_Int		happy_var_7)) -> 
    868. 

  868. 	case happyOutTok happy_x_9 of { (L _ (CmmT_Int		happy_var_9)) -> 
    869. 

  869. 	case happyOutTok happy_x_11 of { (L _ (CmmT_String	happy_var_11)) -> 
    870. 

  870. 	case happyOutTok happy_x_13 of { (L _ (CmmT_String	happy_var_13)) -> 
    871. 

  871. 	case happyOutTok happy_x_15 of { (L _ (CmmT_Int		happy_var_15)) -> 
    872. 

  872. 	( withThisPackage $ \pkg -> 
    873. 

  873. 		   do let prof = profilingInfo happy_var_11 happy_var_13
    874. 

  874.                           ty   = Fun 0 (ArgSpec (fromIntegral happy_var_15))
    875. 

  875.                                 -- Arity zero, arg_type happy_var_15
    876. 

  876.                           rep = mkRTSRep (fromIntegral happy_var_9) $
    877. 

  877.                                     mkHeapRep False (fromIntegral happy_var_5)
    878. 

  878.                                                     (fromIntegral happy_var_7) ty
    879. 

  879.                       return (mkCmmEntryLabel pkg happy_var_3,
    880. 

  880. 			      CmmInfoTable { cit_lbl = mkCmmInfoLabel pkg happy_var_3
    881. 

  881. 				           , cit_rep = rep
    882. 

  882.                				   , cit_prof = prof, cit_srt = NoC_SRT },
    883. 

  883. 			      []))}}}}}}}
    884. 

  884. 	) (\r -> happyReturn (happyIn12 r))
    885. 

  885. 

  886. happyReduce_24 = happyMonadReduce 16# 8# happyReduction_24
    887. 

  887. happyReduction_24 (happy_x_16 `HappyStk`
    888. 

  888. 	happy_x_15 `HappyStk`
    889. 

  889. 	happy_x_14 `HappyStk`
    890. 

  890. 	happy_x_13 `HappyStk`
    891. 

  891. 	happy_x_12 `HappyStk`
    892. 

  892. 	happy_x_11 `HappyStk`
    893. 

  893. 	happy_x_10 `HappyStk`
    894. 

  894. 	happy_x_9 `HappyStk`
    895. 

  895. 	happy_x_8 `HappyStk`
    896. 

  896. 	happy_x_7 `HappyStk`
    897. 

  897. 	happy_x_6 `HappyStk`
    898. 

  898. 	happy_x_5 `HappyStk`
    899. 

  899. 	happy_x_4 `HappyStk`
    900. 

  900. 	happy_x_3 `HappyStk`
    901. 

  901. 	happy_x_2 `HappyStk`
    902. 

  902. 	happy_x_1 `HappyStk`
    903. 

  903. 	happyRest) tk
    904. 

  904. 	 = happyThen (case happyOutTok happy_x_3 of { (L _ (CmmT_Name	happy_var_3)) -> 
    905. 

  905. 	case happyOutTok happy_x_5 of { (L _ (CmmT_Int		happy_var_5)) -> 
    906. 

  906. 	case happyOutTok happy_x_7 of { (L _ (CmmT_Int		happy_var_7)) -> 
    907. 

  907. 	case happyOutTok happy_x_9 of { (L _ (CmmT_Int		happy_var_9)) -> 
    908. 

  908. 	case happyOutTok happy_x_11 of { (L _ (CmmT_Int		happy_var_11)) -> 
    909. 

  909. 	case happyOutTok happy_x_13 of { (L _ (CmmT_String	happy_var_13)) -> 
    910. 

  910. 	case happyOutTok happy_x_15 of { (L _ (CmmT_String	happy_var_15)) -> 
    911. 

  911. 	( withThisPackage $ \pkg ->
    912. 

  912. 		   do let prof = profilingInfo happy_var_13 happy_var_15
    913. 

  913.                           ty  = Constr (fromIntegral happy_var_9)  -- Tag
    914. 

  914. 	                           	(stringToWord8s happy_var_13)
    915. 

  915.                           rep = mkRTSRep (fromIntegral happy_var_11) $
    916. 

  916.                                   mkHeapRep False (fromIntegral happy_var_5)
    917. 

  917.                                                   (fromIntegral happy_var_7) ty
    918. 

  918.                       return (mkCmmEntryLabel pkg happy_var_3,
    919. 

  919. 			      CmmInfoTable { cit_lbl = mkCmmInfoLabel pkg happy_var_3
    920. 

  920. 				           , cit_rep = rep
    921. 

  921.                				   , cit_prof = prof, cit_srt = NoC_SRT },
    922. 

  922. 			      []))}}}}}}}
    923. 

  923. 	) (\r -> happyReturn (happyIn12 r))
    924. 

  924. 

  925. happyReduce_25 = happyMonadReduce 12# 8# happyReduction_25
    926. 

  926. happyReduction_25 (happy_x_12 `HappyStk`
    927. 

  927. 	happy_x_11 `HappyStk`
    928. 

  928. 	happy_x_10 `HappyStk`
    929. 

  929. 	happy_x_9 `HappyStk`
    930. 

  930. 	happy_x_8 `HappyStk`
    931. 

  931. 	happy_x_7 `HappyStk`
    932. 

  932. 	happy_x_6 `HappyStk`
    933. 

  933. 	happy_x_5 `HappyStk`
    934. 

  934. 	happy_x_4 `HappyStk`
    935. 

  935. 	happy_x_3 `HappyStk`
    936. 

  936. 	happy_x_2 `HappyStk`
    937. 

  937. 	happy_x_1 `HappyStk`
    938. 

  938. 	happyRest) tk
    939. 

  939. 	 = happyThen (case happyOutTok happy_x_3 of { (L _ (CmmT_Name	happy_var_3)) -> 
    940. 

  940. 	case happyOutTok happy_x_5 of { (L _ (CmmT_Int		happy_var_5)) -> 
    941. 

  941. 	case happyOutTok happy_x_7 of { (L _ (CmmT_Int		happy_var_7)) -> 
    942. 

  942. 	case happyOutTok happy_x_9 of { (L _ (CmmT_String	happy_var_9)) -> 
    943. 

  943. 	case happyOutTok happy_x_11 of { (L _ (CmmT_String	happy_var_11)) -> 
    944. 

  944. 	( withThisPackage $ \pkg ->
    945. 

  945. 		   do let prof = profilingInfo happy_var_9 happy_var_11
    946. 

  946.                           ty  = ThunkSelector (fromIntegral happy_var_5)
    947. 

  947.                           rep = mkRTSRep (fromIntegral happy_var_7) $
    948. 

  948.                                    mkHeapRep False 0 0 ty
    949. 

  949.                       return (mkCmmEntryLabel pkg happy_var_3,
    950. 

  950. 			      CmmInfoTable { cit_lbl = mkCmmInfoLabel pkg happy_var_3
    951. 

  951. 				           , cit_rep = rep
    952. 

  952.                				   , cit_prof = prof, cit_srt = NoC_SRT },
    953. 

  953. 			      []))}}}}}
    954. 

  954. 	) (\r -> happyReturn (happyIn12 r))
    955. 

  955. 

  956. happyReduce_26 = happyMonadReduce 6# 8# happyReduction_26
    957. 

  957. happyReduction_26 (happy_x_6 `HappyStk`
    958. 

  958. 	happy_x_5 `HappyStk`
    959. 

  959. 	happy_x_4 `HappyStk`
    960. 

  960. 	happy_x_3 `HappyStk`
    961. 

  961. 	happy_x_2 `HappyStk`
    962. 

  962. 	happy_x_1 `HappyStk`
    963. 

  963. 	happyRest) tk
    964. 

  964. 	 = happyThen (case happyOutTok happy_x_3 of { (L _ (CmmT_Name	happy_var_3)) -> 
    965. 

  965. 	case happyOutTok happy_x_5 of { (L _ (CmmT_Int		happy_var_5)) -> 
    966. 

  966. 	( withThisPackage $ \pkg ->
    967. 

  967. 		   do let prof = NoProfilingInfo
    968. 

  968.                           rep  = mkRTSRep (fromIntegral happy_var_5) $ mkStackRep []
    969. 

  969.                       return (mkCmmRetLabel pkg happy_var_3,
    970. 

  970. 			      CmmInfoTable { cit_lbl = mkCmmInfoLabel pkg happy_var_3
    971. 

  971. 				           , cit_rep = rep
    972. 

  972.                				   , cit_prof = prof, cit_srt = NoC_SRT },
    973. 

  973. 			      []))}}
    974. 

  974. 	) (\r -> happyReturn (happyIn12 r))
    975. 

  975. 

  976. happyReduce_27 = happyMonadReduce 8# 8# happyReduction_27
    977. 

  977. happyReduction_27 (happy_x_8 `HappyStk`
    978. 

  978. 	happy_x_7 `HappyStk`
    979. 

  979. 	happy_x_6 `HappyStk`
    980. 

  980. 	happy_x_5 `HappyStk`
    981. 

  981. 	happy_x_4 `HappyStk`
    982. 

  982. 	happy_x_3 `HappyStk`
    983. 

  983. 	happy_x_2 `HappyStk`
    984. 

  984. 	happy_x_1 `HappyStk`
    985. 

  985. 	happyRest) tk
    986. 

  986. 	 = happyThen (case happyOutTok happy_x_3 of { (L _ (CmmT_Name	happy_var_3)) -> 
    987. 

  987. 	case happyOutTok happy_x_5 of { (L _ (CmmT_Int		happy_var_5)) -> 
    988. 

  988. 	case happyOut48 happy_x_7 of { happy_var_7 -> 
    989. 

  989. 	( withThisPackage $ \pkg ->
    990. 

  990. 		   do live <- sequence (map (liftM Just) happy_var_7)
    991. 

  991. 		      let prof = NoProfilingInfo
    992. 

  992.                           bitmap = mkLiveness live
    993. 

  993.                           rep  = mkRTSRep (fromIntegral happy_var_5) $ mkStackRep bitmap
    994. 

  994.                       return (mkCmmRetLabel pkg happy_var_3,
    995. 

  995. 			      CmmInfoTable { cit_lbl = mkCmmInfoLabel pkg happy_var_3
    996. 

  996. 				           , cit_rep = rep
    997. 

  997.                				   , cit_prof = prof, cit_srt = NoC_SRT },
    998. 

  998. 			      []))}}}
    999. 

  999. 	) (\r -> happyReturn (happyIn12 r))
    1000. 

  1000. 

  1001. happyReduce_28 = happySpecReduce_0  9# happyReduction_28
    1002. 

  1002. happyReduction_28  =  happyIn13
    1003. 

  1003. 		 (return ()
    1004. 

  1004. 	)
    1005. 

  1005. 

  1006. happyReduce_29 = happySpecReduce_2  9# happyReduction_29
    1007. 

  1007. happyReduction_29 happy_x_2
    1008. 

  1008. 	happy_x_1
    1009. 

  1009. 	 =  case happyOut14 happy_x_1 of { happy_var_1 -> 
    1010. 

  1010. 	case happyOut13 happy_x_2 of { happy_var_2 -> 
    1011. 

  1011. 	happyIn13
    1012. 

  1012. 		 (do happy_var_1; happy_var_2
    1013. 

  1013. 	)}}
    1014. 

  1014. 

  1015. happyReduce_30 = happySpecReduce_2  9# happyReduction_30
    1016. 

  1016. happyReduction_30 happy_x_2
    1017. 

  1017. 	happy_x_1
    1018. 

  1018. 	 =  case happyOut18 happy_x_1 of { happy_var_1 -> 
    1019. 

  1019. 	case happyOut13 happy_x_2 of { happy_var_2 -> 
    1020. 

  1020. 	happyIn13
    1021. 

  1021. 		 (do happy_var_1; happy_var_2
    1022. 

  1022. 	)}}
    1023. 

  1023. 

  1024. happyReduce_31 = happySpecReduce_3  10# happyReduction_31
    1025. 

  1025. happyReduction_31 happy_x_3
    1026. 

  1026. 	happy_x_2
    1027. 

  1027. 	happy_x_1
    1028. 

  1028. 	 =  case happyOut53 happy_x_1 of { happy_var_1 -> 
    1029. 

  1029. 	case happyOut17 happy_x_2 of { happy_var_2 -> 
    1030. 

  1030. 	happyIn14
    1031. 

  1031. 		 (mapM_ (newLocal happy_var_1) happy_var_2
    1032. 

  1032. 	)}}
    1033. 

  1033. 

  1034. happyReduce_32 = happySpecReduce_3  10# happyReduction_32
    1035. 

  1035. happyReduction_32 happy_x_3
    1036. 

  1036. 	happy_x_2
    1037. 

  1037. 	happy_x_1
    1038. 

  1038. 	 =  case happyOut15 happy_x_2 of { happy_var_2 -> 
    1039. 

  1039. 	happyIn14
    1040. 

  1040. 		 (mapM_ newImport happy_var_2
    1041. 

  1041. 	)}
    1042. 

  1042. 

  1043. happyReduce_33 = happySpecReduce_3  10# happyReduction_33
    1044. 

  1044. happyReduction_33 happy_x_3
    1045. 

  1045. 	happy_x_2
    1046. 

  1046. 	happy_x_1
    1047. 

  1047. 	 =  happyIn14
    1048. 

  1048. 		 (return ()
    1049. 

  1049. 	)
    1050. 

  1050. 

  1051. happyReduce_34 = happySpecReduce_1  11# happyReduction_34
    1052. 

  1052. happyReduction_34 happy_x_1
    1053. 

  1053. 	 =  case happyOut16 happy_x_1 of { happy_var_1 -> 
    1054. 

  1054. 	happyIn15
    1055. 

  1055. 		 ([happy_var_1]
    1056. 

  1056. 	)}
    1057. 

  1057. 

  1058. happyReduce_35 = happySpecReduce_3  11# happyReduction_35
    1059. 

  1059. happyReduction_35 happy_x_3
    1060. 

  1060. 	happy_x_2
    1061. 

  1061. 	happy_x_1
    1062. 

  1062. 	 =  case happyOut16 happy_x_1 of { happy_var_1 -> 
    1063. 

  1063. 	case happyOut15 happy_x_3 of { happy_var_3 -> 
    1064. 

  1064. 	happyIn15
    1065. 

  1065. 		 (happy_var_1 : happy_var_3
    1066. 

  1066. 	)}}
    1067. 

  1067. 

  1068. happyReduce_36 = happySpecReduce_1  12# happyReduction_36
    1069. 

  1069. happyReduction_36 happy_x_1
    1070. 

  1070. 	 =  case happyOutTok happy_x_1 of { (L _ (CmmT_Name	happy_var_1)) -> 
    1071. 

  1071. 	happyIn16
    1072. 

  1072. 		 ((happy_var_1, mkForeignLabel happy_var_1 Nothing ForeignLabelInExternalPackage IsFunction)
    1073. 

  1073. 	)}
    1074. 

  1074. 

  1075. happyReduce_37 = happySpecReduce_2  12# happyReduction_37
    1076. 

  1076. happyReduction_37 happy_x_2
    1077. 

  1077. 	happy_x_1
    1078. 

  1078. 	 =  case happyOutTok happy_x_1 of { (L _ (CmmT_String	happy_var_1)) -> 
    1079. 

  1079. 	case happyOutTok happy_x_2 of { (L _ (CmmT_Name	happy_var_2)) -> 
    1080. 

  1080. 	happyIn16
    1081. 

  1081. 		 ((happy_var_2, mkCmmCodeLabel (fsToPackageId (mkFastString happy_var_1)) happy_var_2)
    1082. 

  1082. 	)}}
    1083. 

  1083. 

  1084. happyReduce_38 = happySpecReduce_1  13# happyReduction_38
    1085. 

  1085. happyReduction_38 happy_x_1
    1086. 

  1086. 	 =  case happyOutTok happy_x_1 of { (L _ (CmmT_Name	happy_var_1)) -> 
    1087. 

  1087. 	happyIn17
    1088. 

  1088. 		 ([happy_var_1]
    1089. 

  1089. 	)}
    1090. 

  1090. 

  1091. happyReduce_39 = happySpecReduce_3  13# happyReduction_39
    1092. 

  1092. happyReduction_39 happy_x_3
    1093. 

  1093. 	happy_x_2
    1094. 

  1094. 	happy_x_1
    1095. 

  1095. 	 =  case happyOutTok happy_x_1 of { (L _ (CmmT_Name	happy_var_1)) -> 
    1096. 

  1096. 	case happyOut17 happy_x_3 of { happy_var_3 -> 
    1097. 

  1097. 	happyIn17
    1098. 

  1098. 		 (happy_var_1 : happy_var_3
    1099. 

  1099. 	)}}
    1100. 

  1100. 

  1101. happyReduce_40 = happySpecReduce_1  14# happyReduction_40
    1102. 

  1102. happyReduction_40 happy_x_1
    1103. 

  1103. 	 =  happyIn18
    1104. 

  1104. 		 (nopEC
    1105. 

  1105. 	)
    1106. 

  1106. 

  1107. happyReduce_41 = happySpecReduce_2  14# happyReduction_41
    1108. 

  1108. happyReduction_41 happy_x_2
    1109. 

  1109. 	happy_x_1
    1110. 

  1110. 	 =  case happyOutTok happy_x_1 of { (L _ (CmmT_Name	happy_var_1)) -> 
    1111. 

  1111. 	happyIn18
    1112. 

  1112. 		 (do l <- newLabel happy_var_1; code (labelC l)
    1113. 

  1113. 	)}
    1114. 

  1114. 

  1115. happyReduce_42 = happyReduce 4# 14# happyReduction_42
    1116. 

  1116. happyReduction_42 (happy_x_4 `HappyStk`
    1117. 

  1117. 	happy_x_3 `HappyStk`
    1118. 

  1118. 	happy_x_2 `HappyStk`
    1119. 

  1119. 	happy_x_1 `HappyStk`
    1120. 

  1120. 	happyRest)
    1121. 

  1121. 	 = case happyOut46 happy_x_1 of { happy_var_1 -> 
    1122. 

  1122. 	case happyOut32 happy_x_3 of { happy_var_3 -> 
    1123. 

  1123. 	happyIn18
    1124. 

  1124. 		 (do reg <- happy_var_1; e <- happy_var_3; stmtEC (CmmAssign reg e)
    1125. 

  1125. 	) `HappyStk` happyRest}}
    1126. 

  1126. 

  1127. happyReduce_43 = happyReduce 7# 14# happyReduction_43
    1128. 

  1128. happyReduction_43 (happy_x_7 `HappyStk`
    1129. 

  1129. 	happy_x_6 `HappyStk`
    1130. 

  1130. 	happy_x_5 `HappyStk`
    1131. 

  1131. 	happy_x_4 `HappyStk`
    1132. 

  1132. 	happy_x_3 `HappyStk`
    1133. 

  1133. 	happy_x_2 `HappyStk`
    1134. 

  1134. 	happy_x_1 `HappyStk`
    1135. 

  1135. 	happyRest)
    1136. 

  1136. 	 = case happyOut53 happy_x_1 of { happy_var_1 -> 
    1137. 

  1137. 	case happyOut32 happy_x_3 of { happy_var_3 -> 
    1138. 

  1138. 	case happyOut32 happy_x_6 of { happy_var_6 -> 
    1139. 

  1139. 	happyIn18
    1140. 

  1140. 		 (doStore happy_var_1 happy_var_3 happy_var_6
    1141. 

  1141. 	) `HappyStk` happyRest}}}
    1142. 

  1142. 

  1143. happyReduce_44 = happyMonadReduce 11# 14# happyReduction_44
    1144. 

  1144. happyReduction_44 (happy_x_11 `HappyStk`
    1145. 

  1145. 	happy_x_10 `HappyStk`
    1146. 

  1146. 	happy_x_9 `HappyStk`
    1147. 

  1147. 	happy_x_8 `HappyStk`
    1148. 

  1148. 	happy_x_7 `HappyStk`
    1149. 

  1149. 	happy_x_6 `HappyStk`
    1150. 

  1150. 	happy_x_5 `HappyStk`
    1151. 

  1151. 	happy_x_4 `HappyStk`
    1152. 

  1152. 	happy_x_3 `HappyStk`
    1153. 

  1153. 	happy_x_2 `HappyStk`
    1154. 

  1154. 	happy_x_1 `HappyStk`
    1155. 

  1155. 	happyRest) tk
    1156. 

  1156. 	 = happyThen (case happyOut42 happy_x_1 of { happy_var_1 -> 
    1157. 

  1157. 	case happyOutTok happy_x_3 of { (L _ (CmmT_String	happy_var_3)) -> 
    1158. 

  1158. 	case happyOut32 happy_x_4 of { happy_var_4 -> 
    1159. 

  1159. 	case happyOut36 happy_x_6 of { happy_var_6 -> 
    1160. 

  1160. 	case happyOut22 happy_x_8 of { happy_var_8 -> 
    1161. 

  1161. 	case happyOut23 happy_x_9 of { happy_var_9 -> 
    1162. 

  1162. 	case happyOut19 happy_x_10 of { happy_var_10 -> 
    1163. 

  1163. 	( foreignCall happy_var_3 happy_var_1 happy_var_4 happy_var_6 happy_var_9 happy_var_8 happy_var_10)}}}}}}}
    1164. 

  1164. 	) (\r -> happyReturn (happyIn18 r))
    1165. 

  1165. 

  1166. happyReduce_45 = happyMonadReduce 10# 14# happyReduction_45
    1167. 

  1167. happyReduction_45 (happy_x_10 `HappyStk`
    1168. 

  1168. 	happy_x_9 `HappyStk`
    1169. 

  1169. 	happy_x_8 `HappyStk`
    1170. 

  1170. 	happy_x_7 `HappyStk`
    1171. 

  1171. 	happy_x_6 `HappyStk`
    1172. 

  1172. 	happy_x_5 `HappyStk`
    1173. 

  1173. 	happy_x_4 `HappyStk`
    1174. 

  1174. 	happy_x_3 `HappyStk`
    1175. 

  1175. 	happy_x_2 `HappyStk`
    1176. 

  1176. 	happy_x_1 `HappyStk`
    1177. 

  1177. 	happyRest) tk
    1178. 

  1178. 	 = happyThen (case happyOut42 happy_x_1 of { happy_var_1 -> 
    1179. 

  1179. 	case happyOutTok happy_x_4 of { (L _ (CmmT_Name	happy_var_4)) -> 
    1180. 

  1180. 	case happyOut36 happy_x_6 of { happy_var_6 -> 
    1181. 

  1181. 	case happyOut22 happy_x_8 of { happy_var_8 -> 
    1182. 

  1182. 	case happyOut23 happy_x_9 of { happy_var_9 -> 
    1183. 

  1183. 	( primCall happy_var_1 happy_var_4 happy_var_6 happy_var_9 happy_var_8)}}}}}
    1184. 

  1184. 	) (\r -> happyReturn (happyIn18 r))
    1185. 

  1185. 

  1186. happyReduce_46 = happyMonadReduce 5# 14# happyReduction_46
    1187. 

  1187. happyReduction_46 (happy_x_5 `HappyStk`
    1188. 

  1188. 	happy_x_4 `HappyStk`
    1189. 

  1189. 	happy_x_3 `HappyStk`
    1190. 

  1190. 	happy_x_2 `HappyStk`
    1191. 

  1191. 	happy_x_1 `HappyStk`
    1192. 

  1192. 	happyRest) tk
    1193. 

  1193. 	 = happyThen (case happyOutTok happy_x_1 of { (L _ (CmmT_Name	happy_var_1)) -> 
    1194. 

  1194. 	case happyOut39 happy_x_3 of { happy_var_3 -> 
    1195. 

  1195. 	( stmtMacro happy_var_1 happy_var_3)}}
    1196. 

  1196. 	) (\r -> happyReturn (happyIn18 r))
    1197. 

  1197. 

  1198. happyReduce_47 = happyReduce 7# 14# happyReduction_47
    1199. 

  1199. happyReduction_47 (happy_x_7 `HappyStk`
    1200. 

  1200. 	happy_x_6 `HappyStk`
    1201. 

  1201. 	happy_x_5 `HappyStk`
    1202. 

  1202. 	happy_x_4 `HappyStk`
    1203. 

  1203. 	happy_x_3 `HappyStk`
    1204. 

  1204. 	happy_x_2 `HappyStk`
    1205. 

  1205. 	happy_x_1 `HappyStk`
    1206. 

  1206. 	happyRest)
    1207. 

  1207. 	 = case happyOut25 happy_x_2 of { happy_var_2 -> 
    1208. 

  1208. 	case happyOut32 happy_x_3 of { happy_var_3 -> 
    1209. 

  1209. 	case happyOut26 happy_x_5 of { happy_var_5 -> 
    1210. 

  1210. 	case happyOut30 happy_x_6 of { happy_var_6 -> 
    1211. 

  1211. 	happyIn18
    1212. 

  1212. 		 (do as <- sequence happy_var_5; doSwitch happy_var_2 happy_var_3 as happy_var_6
    1213. 

  1213. 	) `HappyStk` happyRest}}}}
    1214. 

  1214. 

  1215. happyReduce_48 = happySpecReduce_3  14# happyReduction_48
    1216. 

  1216. happyReduction_48 happy_x_3
    1217. 

  1217. 	happy_x_2
    1218. 

  1218. 	happy_x_1
    1219. 

  1219. 	 =  case happyOutTok happy_x_2 of { (L _ (CmmT_Name	happy_var_2)) -> 
    1220. 

  1220. 	happyIn18
    1221. 

  1221. 		 (do l <- lookupLabel happy_var_2; stmtEC (CmmBranch l)
    1222. 

  1222. 	)}
    1223. 

  1223. 

  1224. happyReduce_49 = happyReduce 4# 14# happyReduction_49
    1225. 

  1225. happyReduction_49 (happy_x_4 `HappyStk`
    1226. 

  1226. 	happy_x_3 `HappyStk`
    1227. 

  1227. 	happy_x_2 `HappyStk`
    1228. 

  1228. 	happy_x_1 `HappyStk`
    1229. 

  1229. 	happyRest)
    1230. 

  1230. 	 = case happyOut32 happy_x_2 of { happy_var_2 -> 
    1231. 

  1231. 	case happyOut35 happy_x_3 of { happy_var_3 -> 
    1232. 

  1232. 	happyIn18
    1233. 

  1233. 		 (do e1 <- happy_var_2; e2 <- sequence happy_var_3; stmtEC (CmmJump e1 e2)
    1234. 

  1234. 	) `HappyStk` happyRest}}
    1235. 

  1235. 

  1236. happyReduce_50 = happySpecReduce_3  14# happyReduction_50
    1237. 

  1237. happyReduction_50 happy_x_3
    1238. 

  1238. 	happy_x_2
    1239. 

  1239. 	happy_x_1
    1240. 

  1240. 	 =  case happyOut35 happy_x_2 of { happy_var_2 -> 
    1241. 

  1241. 	happyIn18
    1242. 

  1242. 		 (do e <- sequence happy_var_2; stmtEC (CmmReturn e)
    1243. 

  1243. 	)}
    1244. 

  1244. 

  1245. happyReduce_51 = happyReduce 4# 14# happyReduction_51
    1246. 

  1246. happyReduction_51 (happy_x_4 `HappyStk`
    1247. 

  1247. 	happy_x_3 `HappyStk`
    1248. 

  1248. 	happy_x_2 `HappyStk`
    1249. 

  1249. 	happy_x_1 `HappyStk`
    1250. 

  1250. 	happyRest)
    1251. 

  1251. 	 = case happyOut20 happy_x_2 of { happy_var_2 -> 
    1252. 

  1252. 	case happyOutTok happy_x_4 of { (L _ (CmmT_Name	happy_var_4)) -> 
    1253. 

  1253. 	happyIn18
    1254. 

  1254. 		 (do l <- lookupLabel happy_var_4; cmmRawIf happy_var_2 l
    1255. 

  1255. 	) `HappyStk` happyRest}}
    1256. 

  1256. 

  1257. happyReduce_52 = happyReduce 6# 14# happyReduction_52
    1258. 

  1258. happyReduction_52 (happy_x_6 `HappyStk`
    1259. 

  1259. 	happy_x_5 `HappyStk`
    1260. 

  1260. 	happy_x_4 `HappyStk`
    1261. 

  1261. 	happy_x_3 `HappyStk`
    1262. 

  1262. 	happy_x_2 `HappyStk`
    1263. 

  1263. 	happy_x_1 `HappyStk`
    1264. 

  1264. 	happyRest)
    1265. 

  1265. 	 = case happyOut20 happy_x_2 of { happy_var_2 -> 
    1266. 

  1266. 	case happyOut13 happy_x_4 of { happy_var_4 -> 
    1267. 

  1267. 	case happyOut31 happy_x_6 of { happy_var_6 -> 
    1268. 

  1268. 	happyIn18
    1269. 

  1269. 		 (cmmIfThenElse happy_var_2 happy_var_4 happy_var_6
    1270. 

  1270. 	) `HappyStk` happyRest}}}
    1271. 

  1271. 

  1272. happyReduce_53 = happySpecReduce_0  15# happyReduction_53
    1273. 

  1273. happyReduction_53  =  happyIn19
    1274. 

  1274. 		 (CmmMayReturn
    1275. 

  1275. 	)
    1276. 

  1276. 

  1277. happyReduce_54 = happySpecReduce_2  15# happyReduction_54
    1278. 

  1278. happyReduction_54 happy_x_2
    1279. 

  1279. 	happy_x_1
    1280. 

  1280. 	 =  happyIn19
    1281. 

  1281. 		 (CmmNeverReturns
    1282. 

  1282. 	)
    1283. 

  1283. 

  1284. happyReduce_55 = happySpecReduce_1  16# happyReduction_55
    1285. 

  1285. happyReduction_55 happy_x_1
    1286. 

  1286. 	 =  case happyOut21 happy_x_1 of { happy_var_1 -> 
    1287. 

  1287. 	happyIn20
    1288. 

  1288. 		 (happy_var_1
    1289. 

  1289. 	)}
    1290. 

  1290. 

  1291. happyReduce_56 = happySpecReduce_1  16# happyReduction_56
    1292. 

  1292. happyReduction_56 happy_x_1
    1293. 

  1293. 	 =  case happyOut32 happy_x_1 of { happy_var_1 -> 
    1294. 

  1294. 	happyIn20
    1295. 

  1295. 		 (do e <- happy_var_1; return (BoolTest e)
    1296. 

  1296. 	)}
    1297. 

  1297. 

  1298. happyReduce_57 = happySpecReduce_3  17# happyReduction_57
    1299. 

  1299. happyReduction_57 happy_x_3
    1300. 

  1300. 	happy_x_2
    1301. 

  1301. 	happy_x_1
    1302. 

  1302. 	 =  case happyOut20 happy_x_1 of { happy_var_1 -> 
    1303. 

  1303. 	case happyOut20 happy_x_3 of { happy_var_3 -> 
    1304. 

  1304. 	happyIn21
    1305. 

  1305. 		 (do e1 <- happy_var_1; e2 <- happy_var_3; 
    1306. 

  1306. 					  return (BoolAnd e1 e2)
    1307. 

  1307. 	)}}
    1308. 

  1308. 

  1309. happyReduce_58 = happySpecReduce_3  17# happyReduction_58
    1310. 

  1310. happyReduction_58 happy_x_3
    1311. 

  1311. 	happy_x_2
    1312. 

  1312. 	happy_x_1
    1313. 

  1313. 	 =  case happyOut20 happy_x_1 of { happy_var_1 -> 
    1314. 

  1314. 	case happyOut20 happy_x_3 of { happy_var_3 -> 
    1315. 

  1315. 	happyIn21
    1316. 

  1316. 		 (do e1 <- happy_var_1; e2 <- happy_var_3; 
    1317. 

  1317. 					  return (BoolOr e1 e2)
    1318. 

  1318. 	)}}
    1319. 

  1319. 

  1320. happyReduce_59 = happySpecReduce_2  17# happyReduction_59
    1321. 

  1321. happyReduction_59 happy_x_2
    1322. 

  1322. 	happy_x_1
    1323. 

  1323. 	 =  case happyOut20 happy_x_2 of { happy_var_2 -> 
    1324. 

  1324. 	happyIn21
    1325. 

  1325. 		 (do e <- happy_var_2; return (BoolNot e)
    1326. 

  1326. 	)}
    1327. 

  1327. 

  1328. happyReduce_60 = happySpecReduce_3  17# happyReduction_60
    1329. 

  1329. happyReduction_60 happy_x_3
    1330. 

  1330. 	happy_x_2
    1331. 

  1331. 	happy_x_1
    1332. 

  1332. 	 =  case happyOut21 happy_x_2 of { happy_var_2 -> 
    1333. 

  1333. 	happyIn21
    1334. 

  1334. 		 (happy_var_2
    1335. 

  1335. 	)}
    1336. 

  1336. 

  1337. happyReduce_61 = happySpecReduce_0  18# happyReduction_61
    1338. 

  1338. happyReduction_61  =  happyIn22
    1339. 

  1339. 		 (CmmUnsafe
    1340. 

  1340. 	)
    1341. 

  1341. 

  1342. happyReduce_62 = happyMonadReduce 1# 18# happyReduction_62
    1343. 

  1343. happyReduction_62 (happy_x_1 `HappyStk`
    1344. 

  1344. 	happyRest) tk
    1345. 

  1345. 	 = happyThen (case happyOutTok happy_x_1 of { (L _ (CmmT_String	happy_var_1)) -> 
    1346. 

  1346. 	( parseSafety happy_var_1)}
    1347. 

  1347. 	) (\r -> happyReturn (happyIn22 r))
    1348. 

  1348. 

  1349. happyReduce_63 = happySpecReduce_0  19# happyReduction_63
    1350. 

  1350. happyReduction_63  =  happyIn23
    1351. 

  1351. 		 (Nothing
    1352. 

  1352. 	)
    1353. 

  1353. 

  1354. happyReduce_64 = happySpecReduce_2  19# happyReduction_64
    1355. 

  1355. happyReduction_64 happy_x_2
    1356. 

  1356. 	happy_x_1
    1357. 

  1357. 	 =  happyIn23
    1358. 

  1358. 		 (Just []
    1359. 

  1359. 	)
    1360. 

  1360. 

  1361. happyReduce_65 = happySpecReduce_3  19# happyReduction_65
    1362. 

  1362. happyReduction_65 happy_x_3
    1363. 

  1363. 	happy_x_2
    1364. 

  1364. 	happy_x_1
    1365. 

  1365. 	 =  case happyOut24 happy_x_2 of { happy_var_2 -> 
    1366. 

  1366. 	happyIn23
    1367. 

  1367. 		 (Just happy_var_2
    1368. 

  1368. 	)}
    1369. 

  1369. 

  1370. happyReduce_66 = happySpecReduce_1  20# happyReduction_66
    1371. 

  1371. happyReduction_66 happy_x_1
    1372. 

  1372. 	 =  case happyOutTok happy_x_1 of { (L _ (CmmT_GlobalReg   happy_var_1)) -> 
    1373. 

  1373. 	happyIn24
    1374. 

  1374. 		 ([happy_var_1]
    1375. 

  1375. 	)}
    1376. 

  1376. 

  1377. happyReduce_67 = happySpecReduce_3  20# happyReduction_67
    1378. 

  1378. happyReduction_67 happy_x_3
    1379. 

  1379. 	happy_x_2
    1380. 

  1380. 	happy_x_1
    1381. 

  1381. 	 =  case happyOutTok happy_x_1 of { (L _ (CmmT_GlobalReg   happy_var_1)) -> 
    1382. 

  1382. 	case happyOut24 happy_x_3 of { happy_var_3 -> 
    1383. 

  1383. 	happyIn24
    1384. 

  1384. 		 (happy_var_1 : happy_var_3
    1385. 

  1385. 	)}}
    1386. 

  1386. 

  1387. happyReduce_68 = happyReduce 5# 21# happyReduction_68
    1388. 

  1388. happyReduction_68 (happy_x_5 `HappyStk`
    1389. 

  1389. 	happy_x_4 `HappyStk`
    1390. 

  1390. 	happy_x_3 `HappyStk`
    1391. 

  1391. 	happy_x_2 `HappyStk`
    1392. 

  1392. 	happy_x_1 `HappyStk`
    1393. 

  1393. 	happyRest)
    1394. 

  1394. 	 = case happyOutTok happy_x_2 of { (L _ (CmmT_Int		happy_var_2)) -> 
    1395. 

  1395. 	case happyOutTok happy_x_4 of { (L _ (CmmT_Int		happy_var_4)) -> 
    1396. 

  1396. 	happyIn25
    1397. 

  1397. 		 (Just (fromIntegral happy_var_2, fromIntegral happy_var_4)
    1398. 

  1398. 	) `HappyStk` happyRest}}
    1399. 

  1399. 

  1400. happyReduce_69 = happySpecReduce_0  21# happyReduction_69
    1401. 

  1401. happyReduction_69  =  happyIn25
    1402. 

  1402. 		 (Nothing
    1403. 

  1403. 	)
    1404. 

  1404. 

  1405. happyReduce_70 = happySpecReduce_0  22# happyReduction_70
    1406. 

  1406. happyReduction_70  =  happyIn26
    1407. 

  1407. 		 ([]
    1408. 

  1408. 	)
    1409. 

  1409. 

  1410. happyReduce_71 = happySpecReduce_2  22# happyReduction_71
    1411. 

  1411. happyReduction_71 happy_x_2
    1412. 

  1412. 	happy_x_1
    1413. 

  1413. 	 =  case happyOut27 happy_x_1 of { happy_var_1 -> 
    1414. 

  1414. 	case happyOut26 happy_x_2 of { happy_var_2 -> 
    1415. 

  1415. 	happyIn26
    1416. 

  1416. 		 (happy_var_1 : happy_var_2
    1417. 

  1417. 	)}}
    1418. 

  1418. 

  1419. happyReduce_72 = happyReduce 4# 23# happyReduction_72
    1420. 

  1420. happyReduction_72 (happy_x_4 `HappyStk`
    1421. 

  1421. 	happy_x_3 `HappyStk`
    1422. 

  1422. 	happy_x_2 `HappyStk`
    1423. 

  1423. 	happy_x_1 `HappyStk`
    1424. 

  1424. 	happyRest)
    1425. 

  1425. 	 = case happyOut29 happy_x_2 of { happy_var_2 -> 
    1426. 

  1426. 	case happyOut28 happy_x_4 of { happy_var_4 -> 
    1427. 

  1427. 	happyIn27
    1428. 

  1428. 		 (do b <- happy_var_4; return (happy_var_2, b)
    1429. 

  1429. 	) `HappyStk` happyRest}}
    1430. 

  1430. 

  1431. happyReduce_73 = happySpecReduce_3  24# happyReduction_73
    1432. 

  1432. happyReduction_73 happy_x_3
    1433. 

  1433. 	happy_x_2
    1434. 

  1434. 	happy_x_1
    1435. 

  1435. 	 =  case happyOut13 happy_x_2 of { happy_var_2 -> 
    1436. 

  1436. 	happyIn28
    1437. 

  1437. 		 (return (Right happy_var_2)
    1438. 

  1438. 	)}
    1439. 

  1439. 

  1440. happyReduce_74 = happySpecReduce_3  24# happyReduction_74
    1441. 

  1441. happyReduction_74 happy_x_3
    1442. 

  1442. 	happy_x_2
    1443. 

  1443. 	happy_x_1
    1444. 

  1444. 	 =  case happyOutTok happy_x_2 of { (L _ (CmmT_Name	happy_var_2)) -> 
    1445. 

  1445. 	happyIn28
    1446. 

  1446. 		 (do l <- lookupLabel happy_var_2; return (Left l)
    1447. 

  1447. 	)}
    1448. 

  1448. 

  1449. happyReduce_75 = happySpecReduce_1  25# happyReduction_75
    1450. 

  1450. happyReduction_75 happy_x_1
    1451. 

  1451. 	 =  case happyOutTok happy_x_1 of { (L _ (CmmT_Int		happy_var_1)) -> 
    1452. 

  1452. 	happyIn29
    1453. 

  1453. 		 ([ fromIntegral happy_var_1 ]
    1454. 

  1454. 	)}
    1455. 

  1455. 

  1456. happyReduce_76 = happySpecReduce_3  25# happyReduction_76
    1457. 

  1457. happyReduction_76 happy_x_3
    1458. 

  1458. 	happy_x_2
    1459. 

  1459. 	happy_x_1
    1460. 

  1460. 	 =  case happyOutTok happy_x_1 of { (L _ (CmmT_Int		happy_var_1)) -> 
    1461. 

  1461. 	case happyOut29 happy_x_3 of { happy_var_3 -> 
    1462. 

  1462. 	happyIn29
    1463. 

  1463. 		 (fromIntegral happy_var_1 : happy_var_3
    1464. 

  1464. 	)}}
    1465. 

  1465. 

  1466. happyReduce_77 = happyReduce 5# 26# happyReduction_77
    1467. 

  1467. happyReduction_77 (happy_x_5 `HappyStk`
    1468. 

  1468. 	happy_x_4 `HappyStk`
    1469. 

  1469. 	happy_x_3 `HappyStk`
    1470. 

  1470. 	happy_x_2 `HappyStk`
    1471. 

  1471. 	happy_x_1 `HappyStk`
    1472. 

  1472. 	happyRest)
    1473. 

  1473. 	 = case happyOut13 happy_x_4 of { happy_var_4 -> 
    1474. 

  1474. 	happyIn30
    1475. 

  1475. 		 (Just happy_var_4
    1476. 

  1476. 	) `HappyStk` happyRest}
    1477. 

  1477. 

  1478. happyReduce_78 = happySpecReduce_0  26# happyReduction_78
    1479. 

  1479. happyReduction_78  =  happyIn30
    1480. 

  1480. 		 (Nothing
    1481. 

  1481. 	)
    1482. 

  1482. 

  1483. happyReduce_79 = happySpecReduce_0  27# happyReduction_79
    1484. 

  1484. happyReduction_79  =  happyIn31
    1485. 

  1485. 		 (nopEC
    1486. 

  1486. 	)
    1487. 

  1487. 

  1488. happyReduce_80 = happyReduce 4# 27# happyReduction_80
    1489. 

  1489. happyReduction_80 (happy_x_4 `HappyStk`
    1490. 

  1490. 	happy_x_3 `HappyStk`
    1491. 

  1491. 	happy_x_2 `HappyStk`
    1492. 

  1492. 	happy_x_1 `HappyStk`
    1493. 

  1493. 	happyRest)
    1494. 

  1494. 	 = case happyOut13 happy_x_3 of { happy_var_3 -> 
    1495. 

  1495. 	happyIn31
    1496. 

  1496. 		 (happy_var_3
    1497. 

  1497. 	) `HappyStk` happyRest}
    1498. 

  1498. 

  1499. happyReduce_81 = happySpecReduce_3  28# happyReduction_81
    1500. 

  1500. happyReduction_81 happy_x_3
    1501. 

  1501. 	happy_x_2
    1502. 

  1502. 	happy_x_1
    1503. 

  1503. 	 =  case happyOut32 happy_x_1 of { happy_var_1 -> 
    1504. 

  1504. 	case happyOut32 happy_x_3 of { happy_var_3 -> 
    1505. 

  1505. 	happyIn32
    1506. 

  1506. 		 (mkMachOp MO_U_Quot [happy_var_1,happy_var_3]
    1507. 

  1507. 	)}}
    1508. 

  1508. 

  1509. happyReduce_82 = happySpecReduce_3  28# happyReduction_82
    1510. 

  1510. happyReduction_82 happy_x_3
    1511. 

  1511. 	happy_x_2
    1512. 

  1512. 	happy_x_1
    1513. 

  1513. 	 =  case happyOut32 happy_x_1 of { happy_var_1 -> 
    1514. 

  1514. 	case happyOut32 happy_x_3 of { happy_var_3 -> 
    1515. 

  1515. 	happyIn32
    1516. 

  1516. 		 (mkMachOp MO_Mul [happy_var_1,happy_var_3]
    1517. 

  1517. 	)}}
    1518. 

  1518. 

  1519. happyReduce_83 = happySpecReduce_3  28# happyReduction_83
    1520. 

  1520. happyReduction_83 happy_x_3
    1521. 

  1521. 	happy_x_2
    1522. 

  1522. 	happy_x_1
    1523. 

  1523. 	 =  case happyOut32 happy_x_1 of { happy_var_1 -> 
    1524. 

  1524. 	case happyOut32 happy_x_3 of { happy_var_3 -> 
    1525. 

  1525. 	happyIn32
    1526. 

  1526. 		 (mkMachOp MO_U_Rem [happy_var_1,happy_var_3]
    1527. 

  1527. 	)}}
    1528. 

  1528. 

  1529. happyReduce_84 = happySpecReduce_3  28# happyReduction_84
    1530. 

  1530. happyReduction_84 happy_x_3
    1531. 

  1531. 	happy_x_2
    1532. 

  1532. 	happy_x_1
    1533. 

  1533. 	 =  case happyOut32 happy_x_1 of { happy_var_1 -> 
    1534. 

  1534. 	case happyOut32 happy_x_3 of { happy_var_3 -> 
    1535. 

  1535. 	happyIn32
    1536. 

  1536. 		 (mkMachOp MO_Sub [happy_var_1,happy_var_3]
    1537. 

  1537. 	)}}
    1538. 

  1538. 

  1539. happyReduce_85 = happySpecReduce_3  28# happyReduction_85
    1540. 

  1540. happyReduction_85 happy_x_3
    1541. 

  1541. 	happy_x_2
    1542. 

  1542. 	happy_x_1
    1543. 

  1543. 	 =  case happyOut32 happy_x_1 of { happy_var_1 -> 
    1544. 

  1544. 	case happyOut32 happy_x_3 of { happy_var_3 -> 
    1545. 

  1545. 	happyIn32
    1546. 

  1546. 		 (mkMachOp MO_Add [happy_var_1,happy_var_3]
    1547. 

  1547. 	)}}
    1548. 

  1548. 

  1549. happyReduce_86 = happySpecReduce_3  28# happyReduction_86
    1550. 

  1550. happyReduction_86 happy_x_3
    1551. 

  1551. 	happy_x_2
    1552. 

  1552. 	happy_x_1
    1553. 

  1553. 	 =  case happyOut32 happy_x_1 of { happy_var_1 -> 
    1554. 

  1554. 	case happyOut32 happy_x_3 of { happy_var_3 -> 
    1555. 

  1555. 	happyIn32
    1556. 

  1556. 		 (mkMachOp MO_U_Shr [happy_var_1,happy_var_3]
    1557. 

  1557. 	)}}
    1558. 

  1558. 

  1559. happyReduce_87 = happySpecReduce_3  28# happyReduction_87
    1560. 

  1560. happyReduction_87 happy_x_3
    1561. 

  1561. 	happy_x_2
    1562. 

  1562. 	happy_x_1
    1563. 

  1563. 	 =  case happyOut32 happy_x_1 of { happy_var_1 -> 
    1564. 

  1564. 	case happyOut32 happy_x_3 of { happy_var_3 -> 
    1565. 

  1565. 	happyIn32
    1566. 

  1566. 		 (mkMachOp MO_Shl [happy_var_1,happy_var_3]
    1567. 

  1567. 	)}}
    1568. 

  1568. 

  1569. happyReduce_88 = happySpecReduce_3  28# happyReduction_88
    1570. 

  1570. happyReduction_88 happy_x_3
    1571. 

  1571. 	happy_x_2
    1572. 

  1572. 	happy_x_1
    1573. 

  1573. 	 =  case happyOut32 happy_x_1 of { happy_var_1 -> 
    1574. 

  1574. 	case happyOut32 happy_x_3 of { happy_var_3 -> 
    1575. 

  1575. 	happyIn32
    1576. 

  1576. 		 (mkMachOp MO_And [happy_var_1,happy_var_3]
    1577. 

  1577. 	)}}
    1578. 

  1578. 

  1579. happyReduce_89 = happySpecReduce_3  28# happyReduction_89
    1580. 

  1580. happyReduction_89 happy_x_3
    1581. 

  1581. 	happy_x_2
    1582. 

  1582. 	happy_x_1
    1583. 

  1583. 	 =  case happyOut32 happy_x_1 of { happy_var_1 -> 
    1584. 

  1584. 	case happyOut32 happy_x_3 of { happy_var_3 -> 
    1585. 

  1585. 	happyIn32
    1586. 

  1586. 		 (mkMachOp MO_Xor [happy_var_1,happy_var_3]
    1587. 

  1587. 	)}}
    1588. 

  1588. 

  1589. happyReduce_90 = happySpecReduce_3  28# happyReduction_90
    1590. 

  1590. happyReduction_90 happy_x_3
    1591. 

  1591. 	happy_x_2
    1592. 

  1592. 	happy_x_1
    1593. 

  1593. 	 =  case happyOut32 happy_x_1 of { happy_var_1 -> 
    1594. 

  1594. 	case happyOut32 happy_x_3 of { happy_var_3 -> 
    1595. 

  1595. 	happyIn32
    1596. 

  1596. 		 (mkMachOp MO_Or [happy_var_1,happy_var_3]
    1597. 

  1597. 	)}}
    1598. 

  1598. 

  1599. happyReduce_91 = happySpecReduce_3  28# happyReduction_91
    1600. 

  1600. happyReduction_91 happy_x_3
    1601. 

  1601. 	happy_x_2
    1602. 

  1602. 	happy_x_1
    1603. 

  1603. 	 =  case happyOut32 happy_x_1 of { happy_var_1 -> 
    1604. 

  1604. 	case happyOut32 happy_x_3 of { happy_var_3 -> 
    1605. 

  1605. 	happyIn32
    1606. 

  1606. 		 (mkMachOp MO_U_Ge [happy_var_1,happy_var_3]
    1607. 

  1607. 	)}}
    1608. 

  1608. 

  1609. happyReduce_92 = happySpecReduce_3  28# happyReduction_92
    1610. 

  1610. happyReduction_92 happy_x_3
    1611. 

  1611. 	happy_x_2
    1612. 

  1612. 	happy_x_1
    1613. 

  1613. 	 =  case happyOut32 happy_x_1 of { happy_var_1 -> 
    1614. 

  1614. 	case happyOut32 happy_x_3 of { happy_var_3 -> 
    1615. 

  1615. 	happyIn32
    1616. 

  1616. 		 (mkMachOp MO_U_Gt [happy_var_1,happy_var_3]
    1617. 

  1617. 	)}}
    1618. 

  1618. 

  1619. happyReduce_93 = happySpecReduce_3  28# happyReduction_93
    1620. 

  1620. happyReduction_93 happy_x_3
    1621. 

  1621. 	happy_x_2
    1622. 

  1622. 	happy_x_1
    1623. 

  1623. 	 =  case happyOut32 happy_x_1 of { happy_var_1 -> 
    1624. 

  1624. 	case happyOut32 happy_x_3 of { happy_var_3 -> 
    1625. 

  1625. 	happyIn32
    1626. 

  1626. 		 (mkMachOp MO_U_Le [happy_var_1,happy_var_3]
    1627. 

  1627. 	)}}
    1628. 

  1628. 

  1629. happyReduce_94 = happySpecReduce_3  28# happyReduction_94
    1630. 

  1630. happyReduction_94 happy_x_3
    1631. 

  1631. 	happy_x_2
    1632. 

  1632. 	happy_x_1
    1633. 

  1633. 	 =  case happyOut32 happy_x_1 of { happy_var_1 -> 
    1634. 

  1634. 	case happyOut32 happy_x_3 of { happy_var_3 -> 
    1635. 

  1635. 	happyIn32
    1636. 

  1636. 		 (mkMachOp MO_U_Lt [happy_var_1,happy_var_3]
    1637. 

  1637. 	)}}
    1638. 

  1638. 

  1639. happyReduce_95 = happySpecReduce_3  28# happyReduction_95
    1640. 

  1640. happyReduction_95 happy_x_3
    1641. 

  1641. 	happy_x_2
    1642. 

  1642. 	happy_x_1
    1643. 

  1643. 	 =  case happyOut32 happy_x_1 of { happy_var_1 -> 
    1644. 

  1644. 	case happyOut32 happy_x_3 of { happy_var_3 -> 
    1645. 

  1645. 	happyIn32
    1646. 

  1646. 		 (mkMachOp MO_Ne [happy_var_1,happy_var_3]
    1647. 

  1647. 	)}}
    1648. 

  1648. 

  1649. happyReduce_96 = happySpecReduce_3  28# happyReduction_96
    1650. 

  1650. happyReduction_96 happy_x_3
    1651. 

  1651. 	happy_x_2
    1652. 

  1652. 	happy_x_1
    1653. 

  1653. 	 =  case happyOut32 happy_x_1 of { happy_var_1 -> 
    1654. 

  1654. 	case happyOut32 happy_x_3 of { happy_var_3 -> 
    1655. 

  1655. 	happyIn32
    1656. 

  1656. 		 (mkMachOp MO_Eq [happy_var_1,happy_var_3]
    1657. 

  1657. 	)}}
    1658. 

  1658. 

  1659. happyReduce_97 = happySpecReduce_2  28# happyReduction_97
    1660. 

  1660. happyReduction_97 happy_x_2
    1661. 

  1661. 	happy_x_1
    1662. 

  1662. 	 =  case happyOut32 happy_x_2 of { happy_var_2 -> 
    1663. 

  1663. 	happyIn32
    1664. 

  1664. 		 (mkMachOp MO_Not [happy_var_2]
    1665. 

  1665. 	)}
    1666. 

  1666. 

  1667. happyReduce_98 = happySpecReduce_2  28# happyReduction_98
    1668. 

  1668. happyReduction_98 happy_x_2
    1669. 

  1669. 	happy_x_1
    1670. 

  1670. 	 =  case happyOut32 happy_x_2 of { happy_var_2 -> 
    1671. 

  1671. 	happyIn32
    1672. 

  1672. 		 (mkMachOp MO_S_Neg [happy_var_2]
    1673. 

  1673. 	)}
    1674. 

  1674. 

  1675. happyReduce_99 = happyMonadReduce 5# 28# happyReduction_99
    1676. 

  1676. happyReduction_99 (happy_x_5 `HappyStk`
    1677. 

  1677. 	happy_x_4 `HappyStk`
    1678. 

  1678. 	happy_x_3 `HappyStk`
    1679. 

  1679. 	happy_x_2 `HappyStk`
    1680. 

  1680. 	happy_x_1 `HappyStk`
    1681. 

  1681. 	happyRest) tk
    1682. 

  1682. 	 = happyThen (case happyOut33 happy_x_1 of { happy_var_1 -> 
    1683. 

  1683. 	case happyOutTok happy_x_3 of { (L _ (CmmT_Name	happy_var_3)) -> 
    1684. 

  1684. 	case happyOut33 happy_x_5 of { happy_var_5 -> 
    1685. 

  1685. 	( do { mo <- nameToMachOp happy_var_3 ;
    1686. 

  1686. 					        return (mkMachOp mo [happy_var_1,happy_var_5]) })}}}
    1687. 

  1687. 	) (\r -> happyReturn (happyIn32 r))
    1688. 

  1688. 

  1689. happyReduce_100 = happySpecReduce_1  28# happyReduction_100
    1690. 

  1690. happyReduction_100 happy_x_1
    1691. 

  1691. 	 =  case happyOut33 happy_x_1 of { happy_var_1 -> 
    1692. 

  1692. 	happyIn32
    1693. 

  1693. 		 (happy_var_1
    1694. 

  1694. 	)}
    1695. 

  1695. 

  1696. happyReduce_101 = happySpecReduce_2  29# happyReduction_101
    1697. 

  1697. happyReduction_101 happy_x_2
    1698. 

  1698. 	happy_x_1
    1699. 

  1699. 	 =  case happyOutTok happy_x_1 of { (L _ (CmmT_Int		happy_var_1)) -> 
    1700. 

  1700. 	case happyOut34 happy_x_2 of { happy_var_2 -> 
    1701. 

  1701. 	happyIn33
    1702. 

  1702. 		 (return (CmmLit (CmmInt happy_var_1 (typeWidth happy_var_2)))
    1703. 

  1703. 	)}}
    1704. 

  1704. 

  1705. happyReduce_102 = happySpecReduce_2  29# happyReduction_102
    1706. 

  1706. happyReduction_102 happy_x_2
    1707. 

  1707. 	happy_x_1
    1708. 

  1708. 	 =  case happyOutTok happy_x_1 of { (L _ (CmmT_Float	happy_var_1)) -> 
    1709. 

  1709. 	case happyOut34 happy_x_2 of { happy_var_2 -> 
    1710. 

  1710. 	happyIn33
    1711. 

  1711. 		 (return (CmmLit (CmmFloat happy_var_1 (typeWidth happy_var_2)))
    1712. 

  1712. 	)}}
    1713. 

  1713. 

  1714. happyReduce_103 = happySpecReduce_1  29# happyReduction_103
    1715. 

  1715. happyReduction_103 happy_x_1
    1716. 

  1716. 	 =  case happyOutTok happy_x_1 of { (L _ (CmmT_String	happy_var_1)) -> 
    1717. 

  1717. 	happyIn33
    1718. 

  1718. 		 (do s <- code (newStringCLit happy_var_1); 
    1719. 

  1719. 				      return (CmmLit s)
    1720. 

  1720. 	)}
    1721. 

  1721. 

  1722. happyReduce_104 = happySpecReduce_1  29# happyReduction_104
    1723. 

  1723. happyReduction_104 happy_x_1
    1724. 

  1724. 	 =  case happyOut41 happy_x_1 of { happy_var_1 -> 
    1725. 

  1725. 	happyIn33
    1726. 

  1726. 		 (happy_var_1
    1727. 

  1727. 	)}
    1728. 

  1728. 

  1729. happyReduce_105 = happyReduce 4# 29# happyReduction_105
    1730. 

  1730. happyReduction_105 (happy_x_4 `HappyStk`
    1731. 

  1731. 	happy_x_3 `HappyStk`
    1732. 

  1732. 	happy_x_2 `HappyStk`
    1733. 

  1733. 	happy_x_1 `HappyStk`
    1734. 

  1734. 	happyRest)
    1735. 

  1735. 	 = case happyOut53 happy_x_1 of { happy_var_1 -> 
    1736. 

  1736. 	case happyOut32 happy_x_3 of { happy_var_3 -> 
    1737. 

  1737. 	happyIn33
    1738. 

  1738. 		 (do e <- happy_var_3; return (CmmLoad e happy_var_1)
    1739. 

  1739. 	) `HappyStk` happyRest}}
    1740. 

  1740. 

  1741. happyReduce_106 = happyMonadReduce 5# 29# happyReduction_106
    1742. 

  1742. happyReduction_106 (happy_x_5 `HappyStk`
    1743. 

  1743. 	happy_x_4 `HappyStk`
    1744. 

  1744. 	happy_x_3 `HappyStk`
    1745. 

  1745. 	happy_x_2 `HappyStk`
    1746. 

  1746. 	happy_x_1 `HappyStk`
    1747. 

  1747. 	happyRest) tk
    1748. 

  1748. 	 = happyThen (case happyOutTok happy_x_2 of { (L _ (CmmT_Name	happy_var_2)) -> 
    1749. 

  1749. 	case happyOut39 happy_x_4 of { happy_var_4 -> 
    1750. 

  1750. 	( exprOp happy_var_2 happy_var_4)}}
    1751. 

  1751. 	) (\r -> happyReturn (happyIn33 r))
    1752. 

  1752. 

  1753. happyReduce_107 = happySpecReduce_3  29# happyReduction_107
    1754. 

  1754. happyReduction_107 happy_x_3
    1755. 

  1755. 	happy_x_2
    1756. 

  1756. 	happy_x_1
    1757. 

  1757. 	 =  case happyOut32 happy_x_2 of { happy_var_2 -> 
    1758. 

  1758. 	happyIn33
    1759. 

  1759. 		 (happy_var_2
    1760. 

  1760. 	)}
    1761. 

  1761. 

  1762. happyReduce_108 = happySpecReduce_0  30# happyReduction_108
    1763. 

  1763. happyReduction_108  =  happyIn34
    1764. 

  1764. 		 (bWord
    1765. 

  1765. 	)
    1766. 

  1766. 

  1767. happyReduce_109 = happySpecReduce_2  30# happyReduction_109
    1768. 

  1768. happyReduction_109 happy_x_2
    1769. 

  1769. 	happy_x_1
    1770. 

  1770. 	 =  case happyOut53 happy_x_2 of { happy_var_2 -> 
    1771. 

  1771. 	happyIn34
    1772. 

  1772. 		 (happy_var_2
    1773. 

  1773. 	)}
    1774. 

  1774. 

  1775. happyReduce_110 = happySpecReduce_0  31# happyReduction_110
    1776. 

  1776. happyReduction_110  =  happyIn35
    1777. 

  1777. 		 ([]
    1778. 

  1778. 	)
    1779. 

  1779. 

  1780. happyReduce_111 = happySpecReduce_3  31# happyReduction_111
    1781. 

  1781. happyReduction_111 happy_x_3
    1782. 

  1782. 	happy_x_2
    1783. 

  1783. 	happy_x_1
    1784. 

  1784. 	 =  case happyOut36 happy_x_2 of { happy_var_2 -> 
    1785. 

  1785. 	happyIn35
    1786. 

  1786. 		 (happy_var_2
    1787. 

  1787. 	)}
    1788. 

  1788. 

  1789. happyReduce_112 = happySpecReduce_0  32# happyReduction_112
    1790. 

  1790. happyReduction_112  =  happyIn36
    1791. 

  1791. 		 ([]
    1792. 

  1792. 	)
    1793. 

  1793. 

  1794. happyReduce_113 = happySpecReduce_1  32# happyReduction_113
    1795. 

  1795. happyReduction_113 happy_x_1
    1796. 

  1796. 	 =  case happyOut37 happy_x_1 of { happy_var_1 -> 
    1797. 

  1797. 	happyIn36
    1798. 

  1798. 		 (happy_var_1
    1799. 

  1799. 	)}
    1800. 

  1800. 

  1801. happyReduce_114 = happySpecReduce_1  33# happyReduction_114
    1802. 

  1802. happyReduction_114 happy_x_1
    1803. 

  1803. 	 =  case happyOut38 happy_x_1 of { happy_var_1 -> 
    1804. 

  1804. 	happyIn37
    1805. 

  1805. 		 ([happy_var_1]
    1806. 

  1806. 	)}
    1807. 

  1807. 

  1808. happyReduce_115 = happySpecReduce_3  33# happyReduction_115
    1809. 

  1809. happyReduction_115 happy_x_3
    1810. 

  1810. 	happy_x_2
    1811. 

  1811. 	happy_x_1
    1812. 

  1812. 	 =  case happyOut38 happy_x_1 of { happy_var_1 -> 
    1813. 

  1813. 	case happyOut37 happy_x_3 of { happy_var_3 -> 
    1814. 

  1814. 	happyIn37
    1815. 

  1815. 		 (happy_var_1 : happy_var_3
    1816. 

  1816. 	)}}
    1817. 

  1817. 

  1818. happyReduce_116 = happySpecReduce_1  34# happyReduction_116
    1819. 

  1819. happyReduction_116 happy_x_1
    1820. 

  1820. 	 =  case happyOut32 happy_x_1 of { happy_var_1 -> 
    1821. 

  1821. 	happyIn38
    1822. 

  1822. 		 (do e <- happy_var_1; return (CmmHinted e (inferCmmHint e))
    1823. 

  1823. 	)}
    1824. 

  1824. 

  1825. happyReduce_117 = happyMonadReduce 2# 34# happyReduction_117
    1826. 

  1826. happyReduction_117 (happy_x_2 `HappyStk`
    1827. 

  1827. 	happy_x_1 `HappyStk`
    1828. 

  1828. 	happyRest) tk
    1829. 

  1829. 	 = happyThen (case happyOut32 happy_x_1 of { happy_var_1 -> 
    1830. 

  1830. 	case happyOutTok happy_x_2 of { (L _ (CmmT_String	happy_var_2)) -> 
    1831. 

  1831. 	( do h <- parseCmmHint happy_var_2;
    1832. 

  1832. 					      return $ do
    1833. 

  1833. 						e <- happy_var_1; return (CmmHinted e h))}}
    1834. 

  1834. 	) (\r -> happyReturn (happyIn38 r))
    1835. 

  1835. 

  1836. happyReduce_118 = happySpecReduce_0  35# happyReduction_118
    1837. 

  1837. happyReduction_118  =  happyIn39
    1838. 

  1838. 		 ([]
    1839. 

  1839. 	)
    1840. 

  1840. 

  1841. happyReduce_119 = happySpecReduce_1  35# happyReduction_119
    1842. 

  1842. happyReduction_119 happy_x_1
    1843. 

  1843. 	 =  case happyOut40 happy_x_1 of { happy_var_1 -> 
    1844. 

  1844. 	happyIn39
    1845. 

  1845. 		 (happy_var_1
    1846. 

  1846. 	)}
    1847. 

  1847. 

  1848. happyReduce_120 = happySpecReduce_1  36# happyReduction_120
    1849. 

  1849. happyReduction_120 happy_x_1
    1850. 

  1850. 	 =  case happyOut32 happy_x_1 of { happy_var_1 -> 
    1851. 

  1851. 	happyIn40
    1852. 

  1852. 		 ([ happy_var_1 ]
    1853. 

  1853. 	)}
    1854. 

  1854. 

  1855. happyReduce_121 = happySpecReduce_3  36# happyReduction_121
    1856. 

  1856. happyReduction_121 happy_x_3
    1857. 

  1857. 	happy_x_2
    1858. 

  1858. 	happy_x_1
    1859. 

  1859. 	 =  case happyOut32 happy_x_1 of { happy_var_1 -> 
    1860. 

  1860. 	case happyOut40 happy_x_3 of { happy_var_3 -> 
    1861. 

  1861. 	happyIn40
    1862. 

  1862. 		 (happy_var_1 : happy_var_3
    1863. 

  1863. 	)}}
    1864. 

  1864. 

  1865. happyReduce_122 = happySpecReduce_1  37# happyReduction_122
    1866. 

  1866. happyReduction_122 happy_x_1
    1867. 

  1867. 	 =  case happyOutTok happy_x_1 of { (L _ (CmmT_Name	happy_var_1)) -> 
    1868. 

  1868. 	happyIn41
    1869. 

  1869. 		 (lookupName happy_var_1
    1870. 

  1870. 	)}
    1871. 

  1871. 

  1872. happyReduce_123 = happySpecReduce_1  37# happyReduction_123
    1873. 

  1873. happyReduction_123 happy_x_1
    1874. 

  1874. 	 =  case happyOutTok happy_x_1 of { (L _ (CmmT_GlobalReg   happy_var_1)) -> 
    1875. 

  1875. 	happyIn41
    1876. 

  1876. 		 (return (CmmReg (CmmGlobal happy_var_1))
    1877. 

  1877. 	)}
    1878. 

  1878. 

  1879. happyReduce_124 = happySpecReduce_0  38# happyReduction_124
    1880. 

  1880. happyReduction_124  =  happyIn42
    1881. 

  1881. 		 ([]
    1882. 

  1882. 	)
    1883. 

  1883. 

  1884. happyReduce_125 = happyReduce 4# 38# happyReduction_125
    1885. 

  1885. happyReduction_125 (happy_x_4 `HappyStk`
    1886. 

  1886. 	happy_x_3 `HappyStk`
    1887. 

  1887. 	happy_x_2 `HappyStk`
    1888. 

  1888. 	happy_x_1 `HappyStk`
    1889. 

  1889. 	happyRest)
    1890. 

  1890. 	 = case happyOut43 happy_x_2 of { happy_var_2 -> 
    1891. 

  1891. 	happyIn42
    1892. 

  1892. 		 (happy_var_2
    1893. 

  1893. 	) `HappyStk` happyRest}
    1894. 

  1894. 

  1895. happyReduce_126 = happySpecReduce_1  39# happyReduction_126
    1896. 

  1896. happyReduction_126 happy_x_1
    1897. 

  1897. 	 =  case happyOut44 happy_x_1 of { happy_var_1 -> 
    1898. 

  1898. 	happyIn43
    1899. 

  1899. 		 ([happy_var_1]
    1900. 

  1900. 	)}
    1901. 

  1901. 

  1902. happyReduce_127 = happySpecReduce_2  39# happyReduction_127
    1903. 

  1903. happyReduction_127 happy_x_2
    1904. 

  1904. 	happy_x_1
    1905. 

  1905. 	 =  case happyOut44 happy_x_1 of { happy_var_1 -> 
    1906. 

  1906. 	happyIn43
    1907. 

  1907. 		 ([happy_var_1]
    1908. 

  1908. 	)}
    1909. 

  1909. 

  1910. happyReduce_128 = happySpecReduce_3  39# happyReduction_128
    1911. 

  1911. happyReduction_128 happy_x_3
    1912. 

  1912. 	happy_x_2
    1913. 

  1913. 	happy_x_1
    1914. 

  1914. 	 =  case happyOut44 happy_x_1 of { happy_var_1 -> 
    1915. 

  1915. 	case happyOut43 happy_x_3 of { happy_var_3 -> 
    1916. 

  1916. 	happyIn43
    1917. 

  1917. 		 (happy_var_1 : happy_var_3
    1918. 

  1918. 	)}}
    1919. 

  1919. 

  1920. happyReduce_129 = happySpecReduce_1  40# happyReduction_129
    1921. 

  1921. happyReduction_129 happy_x_1
    1922. 

  1922. 	 =  case happyOut45 happy_x_1 of { happy_var_1 -> 
    1923. 

  1923. 	happyIn44
    1924. 

  1924. 		 (do e <- happy_var_1; return (CmmHinted e (inferCmmHint (CmmReg (CmmLocal e))))
    1925. 

  1925. 	)}
    1926. 

  1926. 

  1927. happyReduce_130 = happyMonadReduce 2# 40# happyReduction_130
    1928. 

  1928. happyReduction_130 (happy_x_2 `HappyStk`
    1929. 

  1929. 	happy_x_1 `HappyStk`
    1930. 

  1930. 	happyRest) tk
    1931. 

  1931. 	 = happyThen (case happyOutTok happy_x_1 of { (L _ (CmmT_String	happy_var_1)) -> 
    1932. 

  1932. 	case happyOut45 happy_x_2 of { happy_var_2 -> 
    1933. 

  1933. 	( do h <- parseCmmHint happy_var_1;
    1934. 

  1934. 					      return $ do
    1935. 

  1935. 						e <- happy_var_2; return (CmmHinted e h))}}
    1936. 

  1936. 	) (\r -> happyReturn (happyIn44 r))
    1937. 

  1937. 

  1938. happyReduce_131 = happySpecReduce_1  41# happyReduction_131
    1939. 

  1939. happyReduction_131 happy_x_1
    1940. 

  1940. 	 =  case happyOutTok happy_x_1 of { (L _ (CmmT_Name	happy_var_1)) -> 
    1941. 

  1941. 	happyIn45
    1942. 

  1942. 		 (do e <- lookupName happy_var_1;
    1943. 

  1943. 				     return $
    1944. 

  1944. 				       case e of 
    1945. 

  1945. 					CmmReg (CmmLocal r) -> r
    1946. 

  1946. 					other -> pprPanic "CmmParse:" (ftext happy_var_1 <> text " not a local register")
    1947. 

  1947. 	)}
    1948. 

  1948. 

  1949. happyReduce_132 = happySpecReduce_1  42# happyReduction_132
    1950. 

  1950. happyReduction_132 happy_x_1
    1951. 

  1951. 	 =  case happyOutTok happy_x_1 of { (L _ (CmmT_Name	happy_var_1)) -> 
    1952. 

  1952. 	happyIn46
    1953. 

  1953. 		 (do e <- lookupName happy_var_1;
    1954. 

  1954. 				     return $
    1955. 

  1955. 				       case e of 
    1956. 

  1956. 					CmmReg r -> r
    1957. 

  1957. 					other -> pprPanic "CmmParse:" (ftext happy_var_1 <> text " not a register")
    1958. 

  1958. 	)}
    1959. 

  1959. 

  1960. happyReduce_133 = happySpecReduce_1  42# happyReduction_133
    1961. 

  1961. happyReduction_133 happy_x_1
    1962. 

  1962. 	 =  case happyOutTok happy_x_1 of { (L _ (CmmT_GlobalReg   happy_var_1)) -> 
    1963. 

  1963. 	happyIn46
    1964. 

  1964. 		 (return (CmmGlobal happy_var_1)
    1965. 

  1965. 	)}
    1966. 

  1966. 

  1967. happyReduce_134 = happySpecReduce_0  43# happyReduction_134
    1968. 

  1968. happyReduction_134  =  happyIn47
    1969. 

  1969. 		 ([]
    1970. 

  1970. 	)
    1971. 

  1971. 

  1972. happyReduce_135 = happySpecReduce_3  43# happyReduction_135
    1973. 

  1973. happyReduction_135 happy_x_3
    1974. 

  1974. 	happy_x_2
    1975. 

  1975. 	happy_x_1
    1976. 

  1976. 	 =  case happyOut48 happy_x_2 of { happy_var_2 -> 
    1977. 

  1977. 	happyIn47
    1978. 

  1978. 		 (happy_var_2
    1979. 

  1979. 	)}
    1980. 

  1980. 

  1981. happyReduce_136 = happySpecReduce_0  44# happyReduction_136
    1982. 

  1982. happyReduction_136  =  happyIn48
    1983. 

  1983. 		 ([]
    1984. 

  1984. 	)
    1985. 

  1985. 

  1986. happyReduce_137 = happySpecReduce_1  44# happyReduction_137
    1987. 

  1987. happyReduction_137 happy_x_1
    1988. 

  1988. 	 =  case happyOut49 happy_x_1 of { happy_var_1 -> 
    1989. 

  1989. 	happyIn48
    1990. 

  1990. 		 (happy_var_1
    1991. 

  1991. 	)}
    1992. 

  1992. 

  1993. happyReduce_138 = happySpecReduce_2  45# happyReduction_138
    1994. 

  1994. happyReduction_138 happy_x_2
    1995. 

  1995. 	happy_x_1
    1996. 

  1996. 	 =  case happyOut50 happy_x_1 of { happy_var_1 -> 
    1997. 

  1997. 	happyIn49
    1998. 

  1998. 		 ([happy_var_1]
    1999. 

  1999. 	)}
    2000. 

  2000. 

  2001. happyReduce_139 = happySpecReduce_1  45# happyReduction_139
    2002. 

  2002. happyReduction_139 happy_x_1
    2003. 

  2003. 	 =  case happyOut50 happy_x_1 of { happy_var_1 -> 
    2004. 

  2004. 	happyIn49
    2005. 

  2005. 		 ([happy_var_1]
    2006. 

  2006. 	)}
    2007. 

  2007. 

  2008. happyReduce_140 = happySpecReduce_3  45# happyReduction_140
    2009. 

  2009. happyReduction_140 happy_x_3
    2010. 

  2010. 	happy_x_2
    2011. 

  2011. 	happy_x_1
    2012. 

  2012. 	 =  case happyOut50 happy_x_1 of { happy_var_1 -> 
    2013. 

  2013. 	case happyOut49 happy_x_3 of { happy_var_3 -> 
    2014. 

  2014. 	happyIn49
    2015. 

  2015. 		 (happy_var_1 : happy_var_3
    2016. 

  2016. 	)}}
    2017. 

  2017. 

  2018. happyReduce_141 = happySpecReduce_2  46# happyReduction_141
    2019. 

  2019. happyReduction_141 happy_x_2
    2020. 

  2020. 	happy_x_1
    2021. 

  2021. 	 =  case happyOut53 happy_x_1 of { happy_var_1 -> 
    2022. 

  2022. 	case happyOutTok happy_x_2 of { (L _ (CmmT_Name	happy_var_2)) -> 
    2023. 

  2023. 	happyIn50
    2024. 

  2024. 		 (newLocal happy_var_1 happy_var_2
    2025. 

  2025. 	)}}
    2026. 

  2026. 

  2027. happyReduce_142 = happySpecReduce_0  47# happyReduction_142
    2028. 

  2028. happyReduction_142  =  happyIn51
    2029. 

  2029. 		 (return Nothing
    2030. 

  2030. 	)
    2031. 

  2031. 

  2032. happyReduce_143 = happyReduce 5# 47# happyReduction_143
    2033. 

  2033. happyReduction_143 (happy_x_5 `HappyStk`
    2034. 

  2034. 	happy_x_4 `HappyStk`
    2035. 

  2035. 	happy_x_3 `HappyStk`
    2036. 

  2036. 	happy_x_2 `HappyStk`
    2037. 

  2037. 	happy_x_1 `HappyStk`
    2038. 

  2038. 	happyRest)
    2039. 

  2039. 	 = case happyOut32 happy_x_2 of { happy_var_2 -> 
    2040. 

  2040. 	case happyOut39 happy_x_4 of { happy_var_4 -> 
    2041. 

  2041. 	happyIn51
    2042. 

  2042. 		 (do { target <- happy_var_2;
    2043. 

  2043. 					       args <- sequence happy_var_4;
    2044. 

  2044. 					       return $ Just (UpdateFrame target args) }
    2045. 

  2045. 	) `HappyStk` happyRest}}
    2046. 

  2046. 

  2047. happyReduce_144 = happySpecReduce_0  48# happyReduction_144
    2048. 

  2048. happyReduction_144  =  happyIn52
    2049. 

  2049. 		 (return Nothing
    2050. 

  2050. 	)
    2051. 

  2051. 

  2052. happyReduce_145 = happySpecReduce_2  48# happyReduction_145
    2053. 

  2053. happyReduction_145 happy_x_2
    2054. 

  2054. 	happy_x_1
    2055. 

  2055. 	 =  case happyOutTok happy_x_2 of { (L _ (CmmT_Name	happy_var_2)) -> 
    2056. 

  2056. 	happyIn52
    2057. 

  2057. 		 (do l <- lookupLabel happy_var_2; return (Just l)
    2058. 

  2058. 	)}
    2059. 

  2059. 

  2060. happyReduce_146 = happySpecReduce_1  49# happyReduction_146
    2061. 

  2061. happyReduction_146 happy_x_1
    2062. 

  2062. 	 =  happyIn53
    2063. 

  2063. 		 (b8
    2064. 

  2064. 	)
    2065. 

  2065. 

  2066. happyReduce_147 = happySpecReduce_1  49# happyReduction_147
    2067. 

  2067. happyReduction_147 happy_x_1
    2068. 

  2068. 	 =  case happyOut54 happy_x_1 of { happy_var_1 -> 
    2069. 

  2069. 	happyIn53
    2070. 

  2070. 		 (happy_var_1
    2071. 

  2071. 	)}
    2072. 

  2072. 

  2073. happyReduce_148 = happySpecReduce_1  50# happyReduction_148
    2074. 

  2074. happyReduction_148 happy_x_1
    2075. 

  2075. 	 =  happyIn54
    2076. 

  2076. 		 (b16
    2077. 

  2077. 	)
    2078. 

  2078. 

  2079. happyReduce_149 = happySpecReduce_1  50# happyReduction_149
    2080. 

  2080. happyReduction_149 happy_x_1
    2081. 

  2081. 	 =  happyIn54
    2082. 

  2082. 		 (b32
    2083. 

  2083. 	)
    2084. 

  2084. 

  2085. happyReduce_150 = happySpecReduce_1  50# happyReduction_150
    2086. 

  2086. happyReduction_150 happy_x_1
    2087. 

  2087. 	 =  happyIn54
    2088. 

  2088. 		 (b64
    2089. 

  2089. 	)
    2090. 

  2090. 

  2091. happyReduce_151 = happySpecReduce_1  50# happyReduction_151
    2092. 

  2092. happyReduction_151 happy_x_1
    2093. 

  2093. 	 =  happyIn54
    2094. 

  2094. 		 (f32
    2095. 

  2095. 	)
    2096. 

  2096. 

  2097. happyReduce_152 = happySpecReduce_1  50# happyReduction_152
    2098. 

  2098. happyReduction_152 happy_x_1
    2099. 

  2099. 	 =  happyIn54
    2100. 

  2100. 		 (f64
    2101. 

  2101. 	)
    2102. 

  2102. 

  2103. happyReduce_153 = happySpecReduce_1  50# happyReduction_153
    2104. 

  2104. happyReduction_153 happy_x_1
    2105. 

  2105. 	 =  happyIn54
    2106. 

  2106. 		 (gcWord
    2107. 

  2107. 	)
    2108. 

  2108. 

  2109. happyNewToken action sts stk
    2110. 

  2110. 	= cmmlex(\tk -> 
    2111. 

  2111. 	let cont i = happyDoAction i tk action sts stk in
    2112. 

  2112. 	case tk of {
    2113. 

  2113. 	L _ CmmT_EOF -> happyDoAction 68# tk action sts stk;
    2114. 

  2114. 	L _ (CmmT_SpecChar ':') -> cont 1#;
    2115. 

  2115. 	L _ (CmmT_SpecChar ';') -> cont 2#;
    2116. 

  2116. 	L _ (CmmT_SpecChar '{') -> cont 3#;
    2117. 

  2117. 	L _ (CmmT_SpecChar '}') -> cont 4#;
    2118. 

  2118. 	L _ (CmmT_SpecChar '[') -> cont 5#;
    2119. 

  2119. 	L _ (CmmT_SpecChar ']') -> cont 6#;
    2120. 

  2120. 	L _ (CmmT_SpecChar '(') -> cont 7#;
    2121. 

  2121. 	L _ (CmmT_SpecChar ')') -> cont 8#;
    2122. 

  2122. 	L _ (CmmT_SpecChar '=') -> cont 9#;
    2123. 

  2123. 	L _ (CmmT_SpecChar '`') -> cont 10#;
    2124. 

  2124. 	L _ (CmmT_SpecChar '~') -> cont 11#;
    2125. 

  2125. 	L _ (CmmT_SpecChar '/') -> cont 12#;
    2126. 

  2126. 	L _ (CmmT_SpecChar '*') -> cont 13#;
    2127. 

  2127. 	L _ (CmmT_SpecChar '%') -> cont 14#;
    2128. 

  2128. 	L _ (CmmT_SpecChar '-') -> cont 15#;
    2129. 

  2129. 	L _ (CmmT_SpecChar '+') -> cont 16#;
    2130. 

  2130. 	L _ (CmmT_SpecChar '&') -> cont 17#;
    2131. 

  2131. 	L _ (CmmT_SpecChar '^') -> cont 18#;
    2132. 

  2132. 	L _ (CmmT_SpecChar '|') -> cont 19#;
    2133. 

  2133. 	L _ (CmmT_SpecChar '>') -> cont 20#;
    2134. 

  2134. 	L _ (CmmT_SpecChar '<') -> cont 21#;
    2135. 

  2135. 	L _ (CmmT_SpecChar ',') -> cont 22#;
    2136. 

  2136. 	L _ (CmmT_SpecChar '!') -> cont 23#;
    2137. 

  2137. 	L _ (CmmT_DotDot) -> cont 24#;
    2138. 

  2138. 	L _ (CmmT_DoubleColon) -> cont 25#;
    2139. 

  2139. 	L _ (CmmT_Shr) -> cont 26#;
    2140. 

  2140. 	L _ (CmmT_Shl) -> cont 27#;
    2141. 

  2141. 	L _ (CmmT_Ge) -> cont 28#;
    2142. 

  2142. 	L _ (CmmT_Le) -> cont 29#;
    2143. 

  2143. 	L _ (CmmT_Eq) -> cont 30#;
    2144. 

  2144. 	L _ (CmmT_Ne) -> cont 31#;
    2145. 

  2145. 	L _ (CmmT_BoolAnd) -> cont 32#;
    2146. 

  2146. 	L _ (CmmT_BoolOr) -> cont 33#;
    2147. 

  2147. 	L _ (CmmT_CLOSURE) -> cont 34#;
    2148. 

  2148. 	L _ (CmmT_INFO_TABLE) -> cont 35#;
    2149. 

  2149. 	L _ (CmmT_INFO_TABLE_RET) -> cont 36#;
    2150. 

  2150. 	L _ (CmmT_INFO_TABLE_FUN) -> cont 37#;
    2151. 

  2151. 	L _ (CmmT_INFO_TABLE_CONSTR) -> cont 38#;
    2152. 

  2152. 	L _ (CmmT_INFO_TABLE_SELECTOR) -> cont 39#;
    2153. 

  2153. 	L _ (CmmT_else) -> cont 40#;
    2154. 

  2154. 	L _ (CmmT_export) -> cont 41#;
    2155. 

  2155. 	L _ (CmmT_section) -> cont 42#;
    2156. 

  2156. 	L _ (CmmT_align) -> cont 43#;
    2157. 

  2157. 	L _ (CmmT_goto) -> cont 44#;
    2158. 

  2158. 	L _ (CmmT_if) -> cont 45#;
    2159. 

  2159. 	L _ (CmmT_jump) -> cont 46#;
    2160. 

  2160. 	L _ (CmmT_foreign) -> cont 47#;
    2161. 

  2161. 	L _ (CmmT_never) -> cont 48#;
    2162. 

  2162. 	L _ (CmmT_prim) -> cont 49#;
    2163. 

  2163. 	L _ (CmmT_return) -> cont 50#;
    2164. 

  2164. 	L _ (CmmT_returns) -> cont 51#;
    2165. 

  2165. 	L _ (CmmT_import) -> cont 52#;
    2166. 

  2166. 	L _ (CmmT_switch) -> cont 53#;
    2167. 

  2167. 	L _ (CmmT_case) -> cont 54#;
    2168. 

  2168. 	L _ (CmmT_default) -> cont 55#;
    2169. 

  2169. 	L _ (CmmT_bits8) -> cont 56#;
    2170. 

  2170. 	L _ (CmmT_bits16) -> cont 57#;
    2171. 

  2171. 	L _ (CmmT_bits32) -> cont 58#;
    2172. 

  2172. 	L _ (CmmT_bits64) -> cont 59#;
    2173. 

  2173. 	L _ (CmmT_float32) -> cont 60#;
    2174. 

  2174. 	L _ (CmmT_float64) -> cont 61#;
    2175. 

  2175. 	L _ (CmmT_gcptr) -> cont 62#;
    2176. 

  2176. 	L _ (CmmT_GlobalReg   happy_dollar_dollar) -> cont 63#;
    2177. 

  2177. 	L _ (CmmT_Name	happy_dollar_dollar) -> cont 64#;
    2178. 

  2178. 	L _ (CmmT_String	happy_dollar_dollar) -> cont 65#;
    2179. 

  2179. 	L _ (CmmT_Int		happy_dollar_dollar) -> cont 66#;
    2180. 

  2180. 	L _ (CmmT_Float	happy_dollar_dollar) -> cont 67#;
    2181. 

  2181. 	_ -> happyError' tk
    2182. 

  2182. 	})
    2183. 

  2183. 

  2184. happyError_ tk = happyError' tk
    2185. 

    2186. 

  2186. happyThen :: () => P a -> (a -> P b) -> P b
    2187. 

  2187. happyThen = (>>=)
    2188. 

  2188. happyReturn :: () => a -> P a
    2189. 

  2189. happyReturn = (return)
    2190. 

  2190. happyThen1 = happyThen
    2191. 

  2191. happyReturn1 :: () => a -> P a
    2192. 

  2192. happyReturn1 = happyReturn
    2193. 

  2193. happyError' :: () => (Located CmmToken) -> P a
    2194. 

  2194. happyError' tk = (\token -> happyError) tk
    2195. 

    2196. 

  2196. cmmParse = happySomeParser where
    2197. 

  2197.   happySomeParser = happyThen (happyParse 0#) (\x -> happyReturn (happyOut4 x))
    2198. 

  2198. 

  2199. happySeq = happyDoSeq
    2200. 

  2200. 

  2201. 

  2202. section :: String -> Section
    2203. 

  2203. section "text"	 = Text
    2204. 

  2204. section "data" 	 = Data
    2205. 

  2205. section "rodata" = ReadOnlyData
    2206. 

  2206. section "relrodata" = RelocatableReadOnlyData
    2207. 

  2207. section "bss"	 = UninitialisedData
    2208. 

  2208. section s	 = OtherSection s
    2209. 

  2209. 

  2210. mkString :: String -> CmmStatic
    2211. 

  2211. mkString s = CmmString (map (fromIntegral.ord) s)
    2212. 

  2212. 

  2213. -- mkMachOp infers the type of the MachOp from the type of its first
    2214. 

  2214. -- argument.  We assume that this is correct: for MachOps that don't have
    2215. 

  2215. -- symmetrical args (e.g. shift ops), the first arg determines the type of
    2216. 

  2216. -- the op.
    2217. 

  2217. mkMachOp :: (Width -> MachOp) -> [ExtFCode CmmExpr] -> ExtFCode CmmExpr
    2218. 

  2218. mkMachOp fn args = do
    2219. 

  2219.   arg_exprs <- sequence args
    2220. 

  2220.   return (CmmMachOp (fn (typeWidth (cmmExprType (head arg_exprs)))) arg_exprs)
    2221. 

  2221. 

  2222. getLit :: CmmExpr -> CmmLit
    2223. 

  2223. getLit (CmmLit l) = l
    2224. 

  2224. getLit (CmmMachOp (MO_S_Neg _) [CmmLit (CmmInt i r)])  = CmmInt (negate i) r
    2225. 

  2225. getLit _ = panic "invalid literal" -- TODO messy failure
    2226. 

  2226. 

  2227. nameToMachOp :: FastString -> P (Width -> MachOp)
    2228. 

  2228. nameToMachOp name = 
    2229. 

  2229.   case lookupUFM machOps name of
    2230. 

  2230. 	Nothing -> fail ("unknown primitive " ++ unpackFS name)
    2231. 

  2231. 	Just m  -> return m
    2232. 

  2232. 

  2233. exprOp :: FastString -> [ExtFCode CmmExpr] -> P (ExtFCode CmmExpr)
    2234. 

  2234. exprOp name args_code =
    2235. 

  2235.   case lookupUFM exprMacros name of
    2236. 

  2236.      Just f  -> return $ do
    2237. 

  2237.         args <- sequence args_code
    2238. 

  2238. 	return (f args)
    2239. 

  2239.      Nothing -> do
    2240. 

  2240. 	mo <- nameToMachOp name
    2241. 

  2241. 	return $ mkMachOp mo args_code
    2242. 

  2242. 

  2243. exprMacros :: UniqFM ([CmmExpr] -> CmmExpr)
    2244. 

  2244. exprMacros = listToUFM [
    2245. 

  2245.   ( fsLit "ENTRY_CODE",   \ [x] -> entryCode x ),
    2246. 

  2246.   ( fsLit "INFO_PTR",     \ [x] -> closureInfoPtr x ),
    2247. 

  2247.   ( fsLit "STD_INFO",     \ [x] -> infoTable x ),
    2248. 

  2248.   ( fsLit "FUN_INFO",     \ [x] -> funInfoTable x ),
    2249. 

  2249.   ( fsLit "GET_ENTRY",    \ [x] -> entryCode (closureInfoPtr x) ),
    2250. 

  2250.   ( fsLit "GET_STD_INFO", \ [x] -> infoTable (closureInfoPtr x) ),
    2251. 

  2251.   ( fsLit "GET_FUN_INFO", \ [x] -> funInfoTable (closureInfoPtr x) ),
    2252. 

  2252.   ( fsLit "INFO_TYPE",    \ [x] -> infoTableClosureType x ),
    2253. 

  2253.   ( fsLit "INFO_PTRS",    \ [x] -> infoTablePtrs x ),
    2254. 

  2254.   ( fsLit "INFO_NPTRS",   \ [x] -> infoTableNonPtrs x )
    2255. 

  2255.   ]
    2256. 

  2256. 

  2257. -- we understand a subset of C-- primitives:
    2258. 

  2258. machOps = listToUFM $
    2259. 

  2259. 	map (\(x, y) -> (mkFastString x, y)) [
    2260. 

  2260. 	( "add",	MO_Add ),
    2261. 

  2261. 	( "sub",	MO_Sub ),
    2262. 

  2262. 	( "eq",		MO_Eq ),
    2263. 

  2263. 	( "ne",		MO_Ne ),
    2264. 

  2264. 	( "mul",	MO_Mul ),
    2265. 

  2265. 	( "neg",	MO_S_Neg ),
    2266. 

  2266. 	( "quot",	MO_S_Quot ),
    2267. 

  2267. 	( "rem",	MO_S_Rem ),
    2268. 

  2268. 	( "divu",	MO_U_Quot ),
    2269. 

  2269. 	( "modu",	MO_U_Rem ),
    2270. 

  2270. 

  2271. 	( "ge",		MO_S_Ge ),
    2272. 

  2272. 	( "le",		MO_S_Le ),
    2273. 

  2273. 	( "gt",		MO_S_Gt ),
    2274. 

  2274. 	( "lt",		MO_S_Lt ),
    2275. 

  2275. 

  2276. 	( "geu",	MO_U_Ge ),
    2277. 

  2277. 	( "leu",	MO_U_Le ),
    2278. 

  2278. 	( "gtu",	MO_U_Gt ),
    2279. 

  2279. 	( "ltu",	MO_U_Lt ),
    2280. 

  2280. 

  2281.         ( "and",        MO_And ),
    2282. 

  2282. 	( "or",		MO_Or ),
    2283. 

  2283. 	( "xor",	MO_Xor ),
    2284. 

  2284. 	( "com",	MO_Not ),
    2285. 

  2285. 	( "shl",	MO_Shl ),
    2286. 

  2286. 	( "shrl",	MO_U_Shr ),
    2287. 

  2287. 	( "shra",	MO_S_Shr ),
    2288. 

  2288. 

  2289.         ( "fadd",       MO_F_Add ),
    2290. 

  2290.         ( "fsub",       MO_F_Sub ),
    2291. 

  2291.         ( "fneg",       MO_F_Neg ),
    2292. 

  2292.         ( "fmul",       MO_F_Mul ),
    2293. 

  2293.         ( "fquot",      MO_F_Quot ),
    2294. 

  2294. 

  2295.         ( "feq",        MO_F_Eq ),
    2296. 

  2296.         ( "fne",        MO_F_Ne ),
    2297. 

  2297.         ( "fge",        MO_F_Ge ),
    2298. 

  2298.         ( "fle",        MO_F_Le ),
    2299. 

  2299.         ( "fgt",        MO_F_Gt ),
    2300. 

  2300.         ( "flt",        MO_F_Lt ),
    2301. 

  2301. 

  2302.         ( "lobits8",  flip MO_UU_Conv W8  ),
    2303. 

  2303. 	( "lobits16", flip MO_UU_Conv W16 ),
    2304. 

  2304. 	( "lobits32", flip MO_UU_Conv W32 ),
    2305. 

  2305. 	( "lobits64", flip MO_UU_Conv W64 ),
    2306. 

  2306. 

  2307. 	( "zx16",     flip MO_UU_Conv W16 ),
    2308. 

  2308. 	( "zx32",     flip MO_UU_Conv W32 ),
    2309. 

  2309. 	( "zx64",     flip MO_UU_Conv W64 ),
    2310. 

  2310. 

  2311. 	( "sx16",     flip MO_SS_Conv W16 ),
    2312. 

  2312. 	( "sx32",     flip MO_SS_Conv W32 ),
    2313. 

  2313. 	( "sx64",     flip MO_SS_Conv W64 ),
    2314. 

  2314. 

  2315. 	( "f2f32",    flip MO_FF_Conv W32 ),  -- TODO; rounding mode
    2316. 

  2316. 	( "f2f64",    flip MO_FF_Conv W64 ),  -- TODO; rounding mode
    2317. 

  2317. 	( "f2i8",     flip MO_FS_Conv W8 ),
    2318. 

  2318. 	( "f2i16",    flip MO_FS_Conv W16 ),
    2319. 

  2319. 	( "f2i32",    flip MO_FS_Conv W32 ),
    2320. 

  2320. 	( "f2i64",    flip MO_FS_Conv W64 ),
    2321. 

  2321. 	( "i2f32",    flip MO_SF_Conv W32 ),
    2322. 

  2322. 	( "i2f64",    flip MO_SF_Conv W64 )
    2323. 

  2323. 	]
    2324. 

  2324. 

  2325. callishMachOps = listToUFM $
    2326. 

  2326. 	map (\(x, y) -> (mkFastString x, y)) [
    2327. 

  2327.         ( "write_barrier", MO_WriteBarrier ),
    2328. 

  2328.         ( "memcpy", MO_Memcpy ),
    2329. 

  2329.         ( "memset", MO_Memset ),
    2330. 

  2330.         ( "memmove", MO_Memmove )
    2331. 

  2331.         -- ToDo: the rest, maybe
    2332. 

  2332.     ]
    2333. 

  2333. 

  2334. parseSafety :: String -> P CmmSafety
    2335. 

  2335. parseSafety "safe"   = return (CmmSafe NoC_SRT)
    2336. 

  2336. parseSafety "unsafe" = return CmmUnsafe
    2337. 

  2337. parseSafety "interruptible" = return CmmInterruptible
    2338. 

  2338. parseSafety str      = fail ("unrecognised safety: " ++ str)
    2339. 

  2339. 

  2340. parseCmmHint :: String -> P ForeignHint
    2341. 

  2341. parseCmmHint "ptr"    = return AddrHint
    2342. 

  2342. parseCmmHint "signed" = return SignedHint
    2343. 

  2343. parseCmmHint str      = fail ("unrecognised hint: " ++ str)
    2344. 

  2344. 

  2345. -- labels are always pointers, so we might as well infer the hint
    2346. 

  2346. inferCmmHint :: CmmExpr -> ForeignHint
    2347. 

  2347. inferCmmHint (CmmLit (CmmLabel _)) = AddrHint
    2348. 

  2348. inferCmmHint (CmmReg (CmmGlobal g)) | isPtrGlobalReg g = AddrHint
    2349. 

  2349. inferCmmHint _ = NoHint
    2350. 

  2350. 

  2351. isPtrGlobalReg Sp		     = True
    2352. 

  2352. isPtrGlobalReg SpLim		     = True
    2353. 

  2353. isPtrGlobalReg Hp		     = True
    2354. 

  2354. isPtrGlobalReg HpLim		     = True
    2355. 

  2355. isPtrGlobalReg CCCS                  = True
    2356. 

  2356. isPtrGlobalReg CurrentTSO            = True
    2357. 

  2357. isPtrGlobalReg CurrentNursery        = True
    2358. 

  2358. isPtrGlobalReg (VanillaReg _ VGcPtr) = True
    2359. 

  2359. isPtrGlobalReg _		     = False
    2360. 

  2360. 

  2361. happyError :: P a
    2362. 

  2362. happyError = srcParseFail
    2363. 

  2363. 

  2364. -- -----------------------------------------------------------------------------
    2365. 

  2365. -- Statement-level macros
    2366. 

  2366. 

  2367. stmtMacro :: FastString -> [ExtFCode CmmExpr] -> P ExtCode
    2368. 

  2368. stmtMacro fun args_code = do
    2369. 

  2369.   case lookupUFM stmtMacros fun of
    2370. 

  2370.     Nothing -> fail ("unknown macro: " ++ unpackFS fun)
    2371. 

  2371.     Just fcode -> return $ do
    2372. 

  2372. 	args <- sequence args_code
    2373. 

  2373. 	code (fcode args)
    2374. 

  2374. 

  2375. stmtMacros :: UniqFM ([CmmExpr] -> Code)
    2376. 

  2376. stmtMacros = listToUFM [
    2377. 

  2377.   ( fsLit "CCS_ALLOC",		   \[words,ccs]  -> profAlloc words ccs ),
    2378. 

  2378.   ( fsLit "CLOSE_NURSERY",	   \[]  -> emitCloseNursery ),
    2379. 

  2379.   ( fsLit "ENTER_CCS_THUNK",      \[e] -> enterCostCentreThunk e ),
    2380. 

  2380.   ( fsLit "HP_CHK_GEN",           \[words,liveness,reentry] -> 
    2381. 

  2381.                                       hpChkGen words liveness reentry ),
    2382. 

  2382.   ( fsLit "HP_CHK_NP_ASSIGN_SP0", \[e,f] -> hpChkNodePointsAssignSp0 e f ),
    2383. 

  2383.   ( fsLit "LOAD_THREAD_STATE",    \[] -> emitLoadThreadState ),
    2384. 

  2384.   ( fsLit "LDV_ENTER",            \[e] -> ldvEnter e ),
    2385. 

  2385.   ( fsLit "LDV_RECORD_CREATE",    \[e] -> ldvRecordCreate e ),
    2386. 

  2386.   ( fsLit "OPEN_NURSERY",	   \[]  -> emitOpenNursery ),
    2387. 

  2387.   ( fsLit "PUSH_UPD_FRAME",	   \[sp,e] -> emitPushUpdateFrame sp e ),
    2388. 

  2388.   ( fsLit "SAVE_THREAD_STATE",    \[] -> emitSaveThreadState ),
    2389. 

  2389.   ( fsLit "SET_HDR",		   \[ptr,info,ccs] -> 
    2390. 

  2390. 					emitSetDynHdr ptr info ccs ),
    2391. 

  2391.   ( fsLit "STK_CHK_GEN",          \[words,liveness,reentry] -> 
    2392. 

  2392.                                       stkChkGen words liveness reentry ),
    2393. 

  2393.   ( fsLit "STK_CHK_NP",	   \[e] -> stkChkNodePoints e ),
    2394. 

  2394.   ( fsLit "TICK_ALLOC_PRIM", 	   \[hdr,goods,slop] -> 
    2395. 

  2395. 					tickyAllocPrim hdr goods slop ),
    2396. 

  2396.   ( fsLit "TICK_ALLOC_PAP",       \[goods,slop] -> 
    2397. 

  2397. 					tickyAllocPAP goods slop ),
    2398. 

  2398.   ( fsLit "TICK_ALLOC_UP_THK",    \[goods,slop] -> 
    2399. 

  2399. 					tickyAllocThunk goods slop ),
    2400. 

  2400.   ( fsLit "UPD_BH_UPDATABLE",       \[] -> emitBlackHoleCode False ),
    2401. 

  2401.   ( fsLit "UPD_BH_SINGLE_ENTRY",    \[] -> emitBlackHoleCode True ),
    2402. 

  2402. 

  2403.   ( fsLit "RET_P",	\[a] ->       emitRetUT [(PtrArg,a)]),
    2404. 

  2404.   ( fsLit "RET_N",	\[a] ->       emitRetUT [(NonPtrArg,a)]),
    2405. 

  2405.   ( fsLit "RET_PP",	\[a,b] ->     emitRetUT [(PtrArg,a),(PtrArg,b)]),
    2406. 

  2406.   ( fsLit "RET_NN",	\[a,b] ->     emitRetUT [(NonPtrArg,a),(NonPtrArg,b)]),
    2407. 

  2407.   ( fsLit "RET_NP",	\[a,b] ->     emitRetUT [(NonPtrArg,a),(PtrArg,b)]),
    2408. 

  2408.   ( fsLit "RET_PPP",	\[a,b,c] ->   emitRetUT [(PtrArg,a),(PtrArg,b),(PtrArg,c)]),
    2409. 

  2409.   ( fsLit "RET_NPP",	\[a,b,c] ->   emitRetUT [(NonPtrArg,a),(PtrArg,b),(PtrArg,c)]),
    2410. 

  2410.   ( fsLit "RET_NNP",	\[a,b,c] ->   emitRetUT [(NonPtrArg,a),(NonPtrArg,b),(PtrArg,c)]),
    2411. 

  2411.   ( fsLit "RET_NNN",  \[a,b,c] -> emitRetUT [(NonPtrArg,a),(NonPtrArg,b),(NonPtrArg,c)]),
    2412. 

  2412.   ( fsLit "RET_NNNN",  \[a,b,c,d] -> emitRetUT [(NonPtrArg,a),(NonPtrArg,b),(NonPtrArg,c),(NonPtrArg,d)]),
    2413. 

  2413.   ( fsLit "RET_NNNP",	\[a,b,c,d] -> emitRetUT [(NonPtrArg,a),(NonPtrArg,b),(NonPtrArg,c),(PtrArg,d)]),
    2414. 

  2414.   ( fsLit "RET_NPNP",	\[a,b,c,d] -> emitRetUT [(NonPtrArg,a),(PtrArg,b),(NonPtrArg,c),(PtrArg,d)])
    2415. 

  2415. 

  2416.  ]
    2417. 

  2417. 

  2418. 

  2419. profilingInfo desc_str ty_str 
    2420. 

  2420.   | not opt_SccProfilingOn = NoProfilingInfo
    2421. 

  2421.   | otherwise              = ProfilingInfo (stringToWord8s desc_str)
    2422. 

  2422.                                            (stringToWord8s ty_str)
    2423. 

  2423. 

  2424. staticClosure :: PackageId -> FastString -> FastString -> [CmmLit] -> ExtCode
    2425. 

  2425. staticClosure pkg cl_label info payload
    2426. 

  2426.   = code $ emitDataLits (mkCmmDataLabel pkg cl_label) lits
    2427. 

  2427.   where  lits = mkStaticClosure (mkCmmInfoLabel pkg info) dontCareCCS payload [] [] []
    2428. 

  2428. 

  2429. foreignCall
    2430. 

  2430. 	:: String
    2431. 

  2431. 	-> [ExtFCode HintedCmmFormal]
    2432. 

  2432. 	-> ExtFCode CmmExpr
    2433. 

  2433. 	-> [ExtFCode HintedCmmActual]
    2434. 

  2434. 	-> Maybe [GlobalReg]
    2435. 

  2435.         -> CmmSafety
    2436. 

  2436.         -> CmmReturnInfo
    2437. 

  2437.         -> P ExtCode
    2438. 

  2438. foreignCall conv_string results_code expr_code args_code vols safety ret
    2439. 

  2439.   = do  convention <- case conv_string of
    2440. 

  2440.           "C" -> return CCallConv
    2441. 

  2441.           "stdcall" -> return StdCallConv
    2442. 

  2442.           "C--" -> return CmmCallConv
    2443. 

  2443.           _ -> fail ("unknown calling convention: " ++ conv_string)
    2444. 

  2444. 	return $ do
    2445. 

  2445. 	  results <- sequence results_code
    2446. 

  2446. 	  expr <- expr_code
    2447. 

  2447. 	  args <- sequence args_code
    2448. 

  2448.           case convention of
    2449. 

  2449.             -- Temporary hack so at least some functions are CmmSafe
    2450. 

  2450.             CmmCallConv -> code (stmtC (CmmCall (CmmCallee expr convention) results args ret))
    2451. 

  2451.             _ ->
    2452. 

  2452.               let expr' = adjCallTarget convention expr args in
    2453. 

  2453.               case safety of
    2454. 

  2454. 	      CmmUnsafe ->
    2455. 

  2455.                 code (emitForeignCall' PlayRisky results 
    2456. 

  2456.                    (CmmCallee expr' convention) args vols NoC_SRT ret)
    2457. 

  2457.               CmmSafe srt ->
    2458. 

  2458.                 code (emitForeignCall' PlaySafe results 
    2459. 

  2459.                    (CmmCallee expr' convention) args vols NoC_SRT ret) where
    2460. 

  2460.               CmmInterruptible ->
    2461. 

  2461.                 code (emitForeignCall' PlayInterruptible results 
    2462. 

  2462.                    (CmmCallee expr' convention) args vols NoC_SRT ret)
    2463. 

    2464. 

  2464. adjCallTarget :: CCallConv -> CmmExpr -> [CmmHinted CmmExpr] -> CmmExpr
    2465. 

  2465. #ifdef mingw32_TARGET_OS
    2466. 

  2466. -- On Windows, we have to add the '@N' suffix to the label when making
    2467. 

  2467. -- a call with the stdcall calling convention.
    2468. 

  2468. adjCallTarget StdCallConv (CmmLit (CmmLabel lbl)) args
    2469. 

  2469.   = CmmLit (CmmLabel (addLabelSize lbl (sum (map size args))))
    2470. 

  2470.   where size (CmmHinted e _) = max wORD_SIZE (widthInBytes (typeWidth (cmmExprType e)))
    2471. 

  2471.                  -- c.f. CgForeignCall.emitForeignCall
    2472. 

  2472. #endif
    2473. 

  2473. adjCallTarget _ expr _
    2474. 

  2474.   = expr
    2475. 

  2475. 

  2476. primCall
    2477. 

  2477. 	:: [ExtFCode HintedCmmFormal]
    2478. 

  2478. 	-> FastString
    2479. 

  2479. 	-> [ExtFCode HintedCmmActual]
    2480. 

  2480. 	-> Maybe [GlobalReg]
    2481. 

  2481.         -> CmmSafety
    2482. 

  2482.         -> P ExtCode
    2483. 

  2483. primCall results_code name args_code vols safety
    2484. 

  2484.   = case lookupUFM callishMachOps name of
    2485. 

  2485. 	Nothing -> fail ("unknown primitive " ++ unpackFS name)
    2486. 

  2486. 	Just p  -> return $ do
    2487. 

  2487. 		results <- sequence results_code
    2488. 

  2488. 		args <- sequence args_code
    2489. 

  2489. 		case safety of
    2490. 

  2490. 		  CmmUnsafe ->
    2491. 

  2491. 		    code (emitForeignCall' PlayRisky results
    2492. 

  2492. 		      (CmmPrim p) args vols NoC_SRT CmmMayReturn)
    2493. 

  2493. 		  CmmSafe srt ->
    2494. 

  2494. 		    code (emitForeignCall' PlaySafe results 
    2495. 

  2495. 		      (CmmPrim p) args vols NoC_SRT CmmMayReturn) where
    2496. 

  2496. 		  CmmInterruptible ->
    2497. 

  2497. 		    code (emitForeignCall' PlayInterruptible results 
    2498. 

  2498. 		      (CmmPrim p) args vols NoC_SRT CmmMayReturn)
    2499. 

  2499. 

  2500. doStore :: CmmType -> ExtFCode CmmExpr  -> ExtFCode CmmExpr -> ExtCode
    2501. 

  2501. doStore rep addr_code val_code
    2502. 

  2502.   = do addr <- addr_code
    2503. 

  2503.        val <- val_code
    2504. 

  2504. 	-- if the specified store type does not match the type of the expr
    2505. 

  2505. 	-- on the rhs, then we insert a coercion that will cause the type
    2506. 

  2506. 	-- mismatch to be flagged by cmm-lint.  If we don't do this, then
    2507. 

  2507. 	-- the store will happen at the wrong type, and the error will not
    2508. 

  2508. 	-- be noticed.
    2509. 

  2509.        let val_width = typeWidth (cmmExprType val)
    2510. 

  2510.            rep_width = typeWidth rep
    2511. 

  2511.        let coerce_val 
    2512. 

  2512. 		| val_width /= rep_width = CmmMachOp (MO_UU_Conv val_width rep_width) [val]
    2513. 

  2513. 		| otherwise              = val
    2514. 

  2514.        stmtEC (CmmStore addr coerce_val)
    2515. 

  2515. 

  2516. -- Return an unboxed tuple.
    2517. 

  2517. emitRetUT :: [(CgRep,CmmExpr)] -> Code
    2518. 

  2518. emitRetUT args = do
    2519. 

  2519.   tickyUnboxedTupleReturn (length args)  -- TICK
    2520. 

  2520.   (sp, stmts) <- pushUnboxedTuple 0 args
    2521. 

  2521.   emitSimultaneously stmts -- NB. the args might overlap with the stack slots
    2522. 

  2522.                            -- or regs that we assign to, so better use
    2523. 

  2523.                            -- simultaneous assignments here (#3546)
    2524. 

  2524.   when (sp /= 0) $ stmtC (CmmAssign spReg (cmmRegOffW spReg (-sp)))
    2525. 

  2525.   stmtC (CmmJump (entryCode (CmmLoad (cmmRegOffW spReg sp) bWord)) [])
    2526. 

  2526.   -- TODO (when using CPS): emitStmt (CmmReturn (map snd args))
    2527. 

  2527. 

  2528. -- -----------------------------------------------------------------------------
    2529. 

  2529. -- If-then-else and boolean expressions
    2530. 

  2530. 

  2531. data BoolExpr
    2532. 

  2532.   = BoolExpr `BoolAnd` BoolExpr
    2533. 

  2533.   | BoolExpr `BoolOr`  BoolExpr
    2534. 

  2534.   | BoolNot BoolExpr
    2535. 

  2535.   | BoolTest CmmExpr
    2536. 

  2536. 

  2537. -- ToDo: smart constructors which simplify the boolean expression.
    2538. 

  2538. 

  2539. cmmIfThenElse cond then_part else_part = do
    2540. 

  2540.      then_id <- code newLabelC
    2541. 

  2541.      join_id <- code newLabelC
    2542. 

  2542.      c <- cond
    2543. 

  2543.      emitCond c then_id
    2544. 

  2544.      else_part
    2545. 

  2545.      stmtEC (CmmBranch join_id)
    2546. 

  2546.      code (labelC then_id)
    2547. 

  2547.      then_part
    2548. 

  2548.      -- fall through to join
    2549. 

  2549.      code (labelC join_id)
    2550. 

  2550. 

  2551. cmmRawIf cond then_id = do
    2552. 

  2552.     c <- cond
    2553. 

  2553.     emitCond c then_id
    2554. 

  2554. 

  2555. -- 'emitCond cond true_id'  emits code to test whether the cond is true,
    2556. 

  2556. -- branching to true_id if so, and falling through otherwise.
    2557. 

  2557. emitCond (BoolTest e) then_id = do
    2558. 

  2558.   stmtEC (CmmCondBranch e then_id)
    2559. 

  2559. emitCond (BoolNot (BoolTest (CmmMachOp op args))) then_id
    2560. 

  2560.   | Just op' <- maybeInvertComparison op
    2561. 

  2561.   = emitCond (BoolTest (CmmMachOp op' args)) then_id
    2562. 

  2562. emitCond (BoolNot e) then_id = do
    2563. 

  2563.   else_id <- code newLabelC
    2564. 

  2564.   emitCond e else_id
    2565. 

  2565.   stmtEC (CmmBranch then_id)
    2566. 

  2566.   code (labelC else_id)
    2567. 

  2567. emitCond (e1 `BoolOr` e2) then_id = do
    2568. 

  2568.   emitCond e1 then_id
    2569. 

  2569.   emitCond e2 then_id
    2570. 

  2570. emitCond (e1 `BoolAnd` e2) then_id = do
    2571. 

  2571. 	-- we'd like to invert one of the conditionals here to avoid an
    2572. 

  2572. 	-- extra branch instruction, but we can't use maybeInvertComparison
    2573. 

  2573. 	-- here because we can't look too closely at the expression since
    2574. 

  2574. 	-- we're in a loop.
    2575. 

  2575.   and_id <- code newLabelC
    2576. 

  2576.   else_id <- code newLabelC
    2577. 

  2577.   emitCond e1 and_id
    2578. 

  2578.   stmtEC (CmmBranch else_id)
    2579. 

  2579.   code (labelC and_id)
    2580. 

  2580.   emitCond e2 then_id
    2581. 

  2581.   code (labelC else_id)
    2582. 

  2582. 

  2583. 

  2584. -- -----------------------------------------------------------------------------
    2585. 

  2585. -- Table jumps
    2586. 

  2586. 

  2587. -- We use a simplified form of C-- switch statements for now.  A
    2588. 

  2588. -- switch statement always compiles to a table jump.  Each arm can
    2589. 

  2589. -- specify a list of values (not ranges), and there can be a single
    2590. 

  2590. -- default branch.  The range of the table is given either by the
    2591. 

  2591. -- optional range on the switch (eg. switch [0..7] {...}), or by
    2592. 

  2592. -- the minimum/maximum values from the branches.
    2593. 

  2593. 

  2594. doSwitch :: Maybe (Int,Int) -> ExtFCode CmmExpr -> [([Int],Either BlockId ExtCode)]
    2595. 

  2595.          -> Maybe ExtCode -> ExtCode
    2596. 

  2596. doSwitch mb_range scrut arms deflt
    2597. 

  2597.    = do 
    2598. 

  2598. 	-- Compile code for the default branch
    2599. 

  2599. 	dflt_entry <- 
    2600. 

  2600. 		case deflt of
    2601. 

  2601. 		  Nothing -> return Nothing
    2602. 

  2602. 		  Just e  -> do b <- forkLabelledCodeEC e; return (Just b)
    2603. 

  2603. 

  2604. 	-- Compile each case branch
    2605. 

  2605. 	table_entries <- mapM emitArm arms
    2606. 

  2606. 

  2607. 	-- Construct the table
    2608. 

  2608. 	let
    2609. 

  2609. 	    all_entries = concat table_entries
    2610. 

  2610. 	    ixs = map fst all_entries
    2611. 

  2611. 	    (min,max) 
    2612. 

  2612. 		| Just (l,u) <- mb_range = (l,u)
    2613. 

  2613. 		| otherwise              = (minimum ixs, maximum ixs)
    2614. 

  2614. 

  2615. 	    entries = elems (accumArray (\_ a -> Just a) dflt_entry (min,max)
    2616. 

  2616. 				all_entries)
    2617. 

  2617. 	expr <- scrut
    2618. 

  2618. 	-- ToDo: check for out of range and jump to default if necessary
    2619. 

  2619.         stmtEC (CmmSwitch expr entries)
    2620. 

  2620.    where
    2621. 

  2621. 	emitArm :: ([Int],Either BlockId ExtCode) -> ExtFCode [(Int,BlockId)]
    2622. 

  2622. 	emitArm (ints,Left blockid) = return [ (i,blockid) | i <- ints ]
    2623. 

  2623. 	emitArm (ints,Right code) = do
    2624. 

  2624. 	   blockid <- forkLabelledCodeEC code
    2625. 

  2625. 	   return [ (i,blockid) | i <- ints ]
    2626. 

  2626. 

  2627. -- -----------------------------------------------------------------------------
    2628. 

  2628. -- Putting it all together
    2629. 

  2629. 

  2630. -- The initial environment: we define some constants that the compiler
    2631. 

  2631. -- knows about here.
    2632. 

  2632. initEnv :: Env
    2633. 

  2633. initEnv = listToUFM [
    2634. 

  2634.   ( fsLit "SIZEOF_StgHeader", 
    2635. 

  2635.     VarN (CmmLit (CmmInt (fromIntegral (fixedHdrSize * wORD_SIZE)) wordWidth) )),
    2636. 

  2636.   ( fsLit "SIZEOF_StgInfoTable",
    2637. 

  2637.     VarN (CmmLit (CmmInt (fromIntegral stdInfoTableSizeB) wordWidth) ))
    2638. 

  2638.   ]
    2639. 

  2639. 

  2640. parseCmmFile :: DynFlags -> FilePath -> IO (Messages, Maybe CmmGroup)
    2641. 

  2641. parseCmmFile dflags filename = do
    2642. 

  2642.   showPass dflags "ParseCmm"
    2643. 

  2643.   buf <- hGetStringBuffer filename
    2644. 

  2644.   let
    2645. 

  2645. 	init_loc = mkRealSrcLoc (mkFastString filename) 1 1
    2646. 

  2646. 	init_state = (mkPState dflags buf init_loc) { lex_state = [0] }
    2647. 

  2647. 		-- reset the lex_state: the Lexer monad leaves some stuff
    2648. 

  2648. 		-- in there we don't want.
    2649. 

  2649.   case unP cmmParse init_state of
    2650. 

  2650.     PFailed span err -> do
    2651. 

  2651.         let msg = mkPlainErrMsg span err
    2652. 

  2652.         return ((emptyBag, unitBag msg), Nothing)
    2653. 

  2653.     POk pst code -> do
    2654. 

  2654.         cmm <- initC dflags no_module (getCmm (unEC code initEnv [] >> return ()))
    2655. 

  2655.         let ms = getMessages pst
    2656. 

  2656.         if (errorsFound dflags ms)
    2657. 

  2657.          then return (ms, Nothing)
    2658. 

  2658.          else do
    2659. 

  2659.            dumpIfSet_dyn dflags Opt_D_dump_cmm "Cmm" (pprPlatform (targetPlatform dflags) cmm)
    2660. 

  2660.            return (ms, Just cmm)
    2661. 

  2661.   where
    2662. 

  2662. 	no_module = panic "parseCmmFile: no module"
    2663. 

  2663. {-# LINE 1 "templates/GenericTemplate.hs" #-}
    2664. 

  2664. {-# LINE 1 "templates/GenericTemplate.hs" #-}
    2665. 

  2665. {-# LINE 1 "<built-in>" #-}
    2666. 

  2666. {-# LINE 1 "<command-line>" #-}
    2667. 

  2667. {-# LINE 1 "templates/GenericTemplate.hs" #-}
    2668. 

  2668. -- Id: GenericTemplate.hs,v 1.26 2005/01/14 14:47:22 simonmar Exp 
    2669. 

  2669. 

  2670. {-# LINE 30 "templates/GenericTemplate.hs" #-}
    2671. 

  2671. 

  2672. 

  2673. data Happy_IntList = HappyCons Happy_GHC_Exts.Int# Happy_IntList
    2674. 

  2674. 

  2675. 

  2676. 

  2677. 

  2678. 

  2679. {-# LINE 51 "templates/GenericTemplate.hs" #-}
    2680. 

  2680. 

  2681. {-# LINE 61 "templates/GenericTemplate.hs" #-}
    2682. 

  2682. 

  2683. {-# LINE 70 "templates/GenericTemplate.hs" #-}
    2684. 

  2684. 

  2685. infixr 9 `HappyStk`
    2686. 

  2686. data HappyStk a = HappyStk a (HappyStk a)
    2687. 

  2687. 

  2688. -----------------------------------------------------------------------------
    2689. 

  2689. -- starting the parse
    2690. 

  2690. 

  2691. happyParse start_state = happyNewToken start_state notHappyAtAll notHappyAtAll
    2692. 

  2692. 

  2693. -----------------------------------------------------------------------------
    2694. 

  2694. -- Accepting the parse
    2695. 

  2695. 

  2696. -- If the current token is 0#, it means we've just accepted a partial
    2697. 

  2697. -- parse (a %partial parser).  We must ignore the saved token on the top of
    2698. 

  2698. -- the stack in this case.
    2699. 

  2699. happyAccept 0# tk st sts (_ `HappyStk` ans `HappyStk` _) =
    2700. 

  2700. 	happyReturn1 ans
    2701. 

  2701. happyAccept j tk st sts (HappyStk ans _) = 
    2702. 

  2702. 	(happyTcHack j (happyTcHack st)) (happyReturn1 ans)
    2703. 

  2703. 

  2704. -----------------------------------------------------------------------------
    2705. 

  2705. -- Arrays only: do the next action
    2706. 

  2706. 

  2707. 

  2708. 

  2709. happyDoAction i tk st
    2710. 

  2710. 	= {- nothing -}
    2711. 

  2711. 

  2712. 

  2713. 	  case action of
    2714. 

  2714. 		0#		  -> {- nothing -}
    2715. 

  2715. 				     happyFail i tk st
    2716. 

  2716. 		-1# 	  -> {- nothing -}
    2717. 

  2717. 				     happyAccept i tk st
    2718. 

  2718. 		n | (n Happy_GHC_Exts.<# (0# :: Happy_GHC_Exts.Int#)) -> {- nothing -}
    2719. 

  2719. 

  2720. 				     (happyReduceArr Happy_Data_Array.! rule) i tk st
    2721. 

  2721. 				     where rule = (Happy_GHC_Exts.I# ((Happy_GHC_Exts.negateInt# ((n Happy_GHC_Exts.+# (1# :: Happy_GHC_Exts.Int#))))))
    2722. 

  2722. 		n		  -> {- nothing -}
    2723. 

  2723. 

  2724. 

  2725. 				     happyShift new_state i tk st
    2726. 

  2726. 				     where (new_state) = (n Happy_GHC_Exts.-# (1# :: Happy_GHC_Exts.Int#))
    2727. 

  2727.    where (off)    = indexShortOffAddr happyActOffsets st
    2728. 

  2728.          (off_i)  = (off Happy_GHC_Exts.+# i)
    2729. 

  2729. 	 check  = if (off_i Happy_GHC_Exts.>=# (0# :: Happy_GHC_Exts.Int#))
    2730. 

  2730. 			then (indexShortOffAddr happyCheck off_i Happy_GHC_Exts.==#  i)
    2731. 

  2731. 			else False
    2732. 

  2732.          (action)
    2733. 

  2733.           | check     = indexShortOffAddr happyTable off_i
    2734. 

  2734.           | otherwise = indexShortOffAddr happyDefActions st
    2735. 

  2735. 

  2736. {-# LINE 130 "templates/GenericTemplate.hs" #-}
    2737. 

  2737. 

  2738. 

  2739. indexShortOffAddr (HappyA# arr) off =
    2740. 

  2740. 	Happy_GHC_Exts.narrow16Int# i
    2741. 

  2741.   where
    2742. 

  2742.         i = Happy_GHC_Exts.word2Int# (Happy_GHC_Exts.or# (Happy_GHC_Exts.uncheckedShiftL# high 8#) low)
    2743. 

  2743.         high = Happy_GHC_Exts.int2Word# (Happy_GHC_Exts.ord# (Happy_GHC_Exts.indexCharOffAddr# arr (off' Happy_GHC_Exts.+# 1#)))
    2744. 

  2744.         low  = Happy_GHC_Exts.int2Word# (Happy_GHC_Exts.ord# (Happy_GHC_Exts.indexCharOffAddr# arr off'))
    2745. 

  2745.         off' = off Happy_GHC_Exts.*# 2#
    2746. 

    2747. 

  2747. 

  2748. 

  2749. 

  2750. 

  2751. data HappyAddr = HappyA# Happy_GHC_Exts.Addr#
    2752. 

  2752. 

  2753. 

  2754. 

  2755. 

  2756. -----------------------------------------------------------------------------
    2757. 

  2757. -- HappyState data type (not arrays)
    2758. 

  2758. 

  2759. {-# LINE 163 "templates/GenericTemplate.hs" #-}
    2760. 

  2760. 

  2761. -----------------------------------------------------------------------------
    2762. 

  2762. -- Shifting a token
    2763. 

  2763. 

  2764. happyShift new_state 0# tk st sts stk@(x `HappyStk` _) =
    2765. 

  2765.      let (i) = (case Happy_GHC_Exts.unsafeCoerce# x of { (Happy_GHC_Exts.I# (i)) -> i }) in
    2766. 

  2766. --     trace "shifting the error token" $
    2767. 

  2767.      happyDoAction i tk new_state (HappyCons (st) (sts)) (stk)
    2768. 

  2768. 

  2769. happyShift new_state i tk st sts stk =
    2770. 

  2770.      happyNewToken new_state (HappyCons (st) (sts)) ((happyInTok (tk))`HappyStk`stk)
    2771. 

  2771. 

  2772. -- happyReduce is specialised for the common cases.
    2773. 

  2773. 

  2774. happySpecReduce_0 i fn 0# tk st sts stk
    2775. 

  2775.      = happyFail 0# tk st sts stk
    2776. 

  2776. happySpecReduce_0 nt fn j tk st@((action)) sts stk
    2777. 

  2777.      = happyGoto nt j tk st (HappyCons (st) (sts)) (fn `HappyStk` stk)
    2778. 

  2778. 

  2779. happySpecReduce_1 i fn 0# tk st sts stk
    2780. 

  2780.      = happyFail 0# tk st sts stk
    2781. 

  2781. happySpecReduce_1 nt fn j tk _ sts@((HappyCons (st@(action)) (_))) (v1`HappyStk`stk')
    2782. 

  2782.      = let r = fn v1 in
    2783. 

  2783.        happySeq r (happyGoto nt j tk st sts (r `HappyStk` stk'))
    2784. 

    2785. 

  2785. happySpecReduce_2 i fn 0# tk st sts stk
    2786. 

  2786.      = happyFail 0# tk st sts stk
    2787. 

  2787. happySpecReduce_2 nt fn j tk _ (HappyCons (_) (sts@((HappyCons (st@(action)) (_))))) (v1`HappyStk`v2`HappyStk`stk')
    2788. 

  2788.      = let r = fn v1 v2 in
    2789. 

  2789.        happySeq r (happyGoto nt j tk st sts (r `HappyStk` stk'))
    2790. 

    2791. 

  2791. happySpecReduce_3 i fn 0# tk st sts stk
    2792. 

  2792.      = happyFail 0# tk st sts stk
    2793. 

  2793. happySpecReduce_3 nt fn j tk _ (HappyCons (_) ((HappyCons (_) (sts@((HappyCons (st@(action)) (_))))))) (v1`HappyStk`v2`HappyStk`v3`HappyStk`stk')
    2794. 

  2794.      = let r = fn v1 v2 v3 in
    2795. 

  2795.        happySeq r (happyGoto nt j tk st sts (r `HappyStk` stk'))
    2796. 

    2797. 

  2797. happyReduce k i fn 0# tk st sts stk
    2798. 

  2798.      = happyFail 0# tk st sts stk
    2799. 

  2799. happyReduce k nt fn j tk st sts stk
    2800. 

  2800.      = case happyDrop (k Happy_GHC_Exts.-# (1# :: Happy_GHC_Exts.Int#)) sts of
    2801. 

  2801. 	 sts1@((HappyCons (st1@(action)) (_))) ->
    2802. 

  2802.         	let r = fn stk in  -- it doesn't hurt to always seq here...
    2803. 

  2803.        		happyDoSeq r (happyGoto nt j tk st1 sts1 r)
    2804. 

  2804. 

  2805. happyMonadReduce k nt fn 0# tk st sts stk
    2806. 

  2806.      = happyFail 0# tk st sts stk
    2807. 

  2807. happyMonadReduce k nt fn j tk st sts stk =
    2808. 

  2808.         happyThen1 (fn stk tk) (\r -> happyGoto nt j tk st1 sts1 (r `HappyStk` drop_stk))
    2809. 

  2809.        where (sts1@((HappyCons (st1@(action)) (_)))) = happyDrop k (HappyCons (st) (sts))
    2810. 

  2810.              drop_stk = happyDropStk k stk
    2811. 

  2811. 

  2812. happyMonad2Reduce k nt fn 0# tk st sts stk
    2813. 

  2813.      = happyFail 0# tk st sts stk
    2814. 

  2814. happyMonad2Reduce k nt fn j tk st sts stk =
    2815. 

  2815.        happyThen1 (fn stk tk) (\r -> happyNewToken new_state sts1 (r `HappyStk` drop_stk))
    2816. 

  2816.        where (sts1@((HappyCons (st1@(action)) (_)))) = happyDrop k (HappyCons (st) (sts))
    2817. 

  2817.              drop_stk = happyDropStk k stk
    2818. 

  2818. 

  2819.              (off) = indexShortOffAddr happyGotoOffsets st1
    2820. 

  2820.              (off_i) = (off Happy_GHC_Exts.+# nt)
    2821. 

  2821.              (new_state) = indexShortOffAddr happyTable off_i
    2822. 

  2822. 

  2823. 

  2824. 

  2825. 

  2826. happyDrop 0# l = l
    2827. 

  2827. happyDrop n (HappyCons (_) (t)) = happyDrop (n Happy_GHC_Exts.-# (1# :: Happy_GHC_Exts.Int#)) t
    2828. 

  2828. 

  2829. happyDropStk 0# l = l
    2830. 

  2830. happyDropStk n (x `HappyStk` xs) = happyDropStk (n Happy_GHC_Exts.-# (1#::Happy_GHC_Exts.Int#)) xs
    2831. 

  2831. 

  2832. -----------------------------------------------------------------------------
    2833. 

  2833. -- Moving to a new state after a reduction
    2834. 

  2834. 

  2835. 

  2836. happyGoto nt j tk st = 
    2837. 

  2837.    {- nothing -}
    2838. 

  2838.    happyDoAction j tk new_state
    2839. 

  2839.    where (off) = indexShortOffAddr happyGotoOffsets st
    2840. 

  2840.          (off_i) = (off Happy_GHC_Exts.+# nt)
    2841. 

  2841.          (new_state) = indexShortOffAddr happyTable off_i
    2842. 

  2842. 

  2843. 

  2844. 

  2845. 

  2846. -----------------------------------------------------------------------------
    2847. 

  2847. -- Error recovery (0# is the error token)
    2848. 

  2848. 

  2849. -- parse error if we are in recovery and we fail again
    2850. 

  2850. happyFail  0# tk old_st _ stk =
    2851. 

  2851. --	trace "failing" $ 
    2852. 

  2852.     	happyError_ tk
    2853. 

  2853. 

  2854. {-  We don't need state discarding for our restricted implementation of
    2855. 

  2855.     "error".  In fact, it can cause some bogus parses, so I've disabled it
    2856. 

  2856.     for now --SDM
    2857. 

  2857. 

  2858. -- discard a state
    2859. 

  2859. happyFail  0# tk old_st (HappyCons ((action)) (sts)) 
    2860. 

  2860. 						(saved_tok `HappyStk` _ `HappyStk` stk) =
    2861. 

  2861. --	trace ("discarding state, depth " ++ show (length stk))  $
    2862. 

  2862. 	happyDoAction 0# tk action sts ((saved_tok`HappyStk`stk))
    2863. 

  2863. -}
    2864. 

  2864. 

  2865. -- Enter error recovery: generate an error token,
    2866. 

  2866. --                       save the old token and carry on.
    2867. 

  2867. happyFail  i tk (action) sts stk =
    2868. 

  2868. --      trace "entering error recovery" $
    2869. 

  2869. 	happyDoAction 0# tk action sts ( (Happy_GHC_Exts.unsafeCoerce# (Happy_GHC_Exts.I# (i))) `HappyStk` stk)
    2870. 

  2870. 

  2871. -- Internal happy errors:
    2872. 

  2872. 

  2873. notHappyAtAll :: a
    2874. 

  2874. notHappyAtAll = error "Internal Happy error\n"
    2875. 

  2875. 

  2876. -----------------------------------------------------------------------------
    2877. 

  2877. -- Hack to get the typechecker to accept our action functions
    2878. 

  2878. 

  2879. 

  2880. happyTcHack :: Happy_GHC_Exts.Int# -> a -> a
    2881. 

  2881. happyTcHack x y = y
    2882. 

  2882. {-# INLINE happyTcHack #-}
    2883. 

  2883. 

  2884. 

  2885. -----------------------------------------------------------------------------
    2886. 

  2886. -- Seq-ing.  If the --strict flag is given, then Happy emits 
    2887. 

  2887. --	happySeq = happyDoSeq
    2888. 

  2888. -- otherwise it emits
    2889. 

  2889. -- 	happySeq = happyDontSeq
    2890. 

  2890. 

  2891. happyDoSeq, happyDontSeq :: a -> b -> b
    2892. 

  2892. happyDoSeq   a b = a `seq` b
    2893. 

  2893. happyDontSeq a b = b
    2894. 

  2894. 

  2895. -----------------------------------------------------------------------------
    2896. 

  2896. -- Don't inline any functions from the template.  GHC has a nasty habit
    2897. 

  2897. -- of deciding to inline happyGoto everywhere, which increases the size of
    2898. 

  2898. -- the generated parser quite a bit.
    2899. 

  2899. 

  2900. 

  2901. {-# NOINLINE happyDoAction #-}
    2902. 

  2902. {-# NOINLINE happyTable #-}
    2903. 

  2903. {-# NOINLINE happyCheck #-}
    2904. 

  2904. {-# NOINLINE happyActOffsets #-}
    2905. 

  2905. {-# NOINLINE happyGotoOffsets #-}
    2906. 

  2906. {-# NOINLINE happyDefActions #-}
    2907. 

  2907. 

  2908. {-# NOINLINE happyShift #-}
    2909. 

  2909. {-# NOINLINE happySpecReduce_0 #-}
    2910. 

  2910. {-# NOINLINE happySpecReduce_1 #-}
    2911. 

  2911. {-# NOINLINE happySpecReduce_2 #-}
    2912. 

  2912. {-# NOINLINE happySpecReduce_3 #-}
    2913. 

  2913. {-# NOINLINE happyReduce #-}
    2914. 

  2914. {-# NOINLINE happyMonadReduce #-}
    2915. 

  2915. {-# NOINLINE happyGoto #-}
    2916. 

  2916. {-# NOINLINE happyFail #-}
    2917. 

  2917. 

  2918. -- end of Happy Template.
    2919. 

  2919.