2 ==================== Tidy Core ====================
3 Result size of Tidy Core
4 = {terms: 172, types: 62, coercions: 0, joins: 0/2}
6 -- RHS size: {terms: 1, types: 0, coercions: 0, joins: 0/0}
7 Roman.$trModule4 :: GHC.Prim.Addr#
10 Unf=Unf{Src=<vanilla>, TopLvl=True, Value=True, ConLike=True,
11 WorkFree=True, Expandable=True, Guidance=IF_ARGS [] 20 0}]
12 Roman.$trModule4 = "main"#
14 -- RHS size: {terms: 2, types: 0, coercions: 0, joins: 0/0}
15 Roman.$trModule3 :: GHC.Types.TrName
19 Unf=Unf{Src=<vanilla>, TopLvl=True, Value=True, ConLike=True,
20 WorkFree=True, Expandable=True, Guidance=IF_ARGS [] 10 20}]
21 Roman.$trModule3 = GHC.Types.TrNameS Roman.$trModule4
23 -- RHS size: {terms: 1, types: 0, coercions: 0, joins: 0/0}
24 Roman.$trModule2 :: GHC.Prim.Addr#
27 Unf=Unf{Src=<vanilla>, TopLvl=True, Value=True, ConLike=True,
28 WorkFree=True, Expandable=True, Guidance=IF_ARGS [] 30 0}]
29 Roman.$trModule2 = "Roman"#
31 -- RHS size: {terms: 2, types: 0, coercions: 0, joins: 0/0}
32 Roman.$trModule1 :: GHC.Types.TrName
36 Unf=Unf{Src=<vanilla>, TopLvl=True, Value=True, ConLike=True,
37 WorkFree=True, Expandable=True, Guidance=IF_ARGS [] 10 20}]
38 Roman.$trModule1 = GHC.Types.TrNameS Roman.$trModule2
40 -- RHS size: {terms: 3, types: 0, coercions: 0, joins: 0/0}
41 Roman.$trModule :: GHC.Types.Module
45 Unf=Unf{Src=<vanilla>, TopLvl=True, Value=True, ConLike=True,
46 WorkFree=True, Expandable=True, Guidance=IF_ARGS [] 10 30}]
48 = GHC.Types.Module Roman.$trModule3 Roman.$trModule1
50 -- RHS size: {terms: 1, types: 0, coercions: 0, joins: 0/0}
52 [GblId, Caf=NoCafRefs, Unf=OtherCon []]
53 lvl = "spec-inline.hs:(19,5)-(29,25)|function go"#
55 -- RHS size: {terms: 2, types: 2, coercions: 0, joins: 0/0}
59 = Control.Exception.Base.patError @ 'GHC.Types.LiftedRep @ Int lvl
62 -- RHS size: {terms: 52, types: 6, coercions: 0, joins: 0/1}
63 Roman.foo_$s$wgo [Occ=LoopBreaker]
64 :: GHC.Prim.Int# -> GHC.Prim.Int# -> GHC.Prim.Int#
65 [GblId, Arity=2, Caf=NoCafRefs, Str=<S,U><S,U>, Unf=OtherCon []]
67 = \ (sc :: GHC.Prim.Int#) (sc1 :: GHC.Prim.Int#) ->
74 (GHC.Prim.+# (GHC.Prim.+# (GHC.Prim.+# sc sc) sc) sc) sc)
77 case GHC.Prim.<=# sc1 0# of {
79 case GHC.Prim.<# sc1 100# of {
81 case GHC.Prim.<# sc1 500# of {
83 Roman.foo_$s$wgo (GHC.Prim.+# m m) (GHC.Prim.-# sc1 1#);
84 1# -> Roman.foo_$s$wgo m (GHC.Prim.-# sc1 3#)
86 1# -> Roman.foo_$s$wgo sc (GHC.Prim.-# sc1 2#)
92 -- RHS size: {terms: 71, types: 19, coercions: 0, joins: 0/1}
93 Roman.$wgo [InlPrag=NOUSERINLINE[2]]
94 :: Maybe Int -> Maybe Int -> GHC.Prim.Int#
98 Unf=Unf{Src=<vanilla>, TopLvl=True, Value=True, ConLike=True,
99 WorkFree=True, Expandable=True, Guidance=IF_ARGS [60 30] 253 0}]
101 = \ (w :: Maybe Int) (w1 :: Maybe Int) ->
103 Nothing -> case Roman.foo3 of wild1 { };
105 case x of { GHC.Types.I# ipv ->
112 (GHC.Prim.+# (GHC.Prim.+# (GHC.Prim.+# ipv ipv) ipv) ipv) ipv)
116 Nothing -> Roman.foo_$s$wgo m 10#;
118 case n of { GHC.Types.I# x2 ->
119 case GHC.Prim.<=# x2 0# of {
121 case GHC.Prim.<# x2 100# of {
123 case GHC.Prim.<# x2 500# of {
125 Roman.foo_$s$wgo (GHC.Prim.+# m m) (GHC.Prim.-# x2 1#);
126 1# -> Roman.foo_$s$wgo m (GHC.Prim.-# x2 3#)
128 1# -> Roman.foo_$s$wgo ipv (GHC.Prim.-# x2 2#)
137 -- RHS size: {terms: 9, types: 5, coercions: 0, joins: 0/0}
138 Roman.foo_go [InlPrag=NOUSERINLINE[2]]
139 :: Maybe Int -> Maybe Int -> Int
143 Unf=Unf{Src=InlineStable, TopLvl=True, Value=True, ConLike=True,
144 WorkFree=True, Expandable=True,
145 Guidance=ALWAYS_IF(arity=2,unsat_ok=True,boring_ok=False)
146 Tmpl= \ (w [Occ=Once] :: Maybe Int) (w1 [Occ=Once] :: Maybe Int) ->
147 case Roman.$wgo w w1 of ww [Occ=Once] { __DEFAULT ->
151 = \ (w :: Maybe Int) (w1 :: Maybe Int) ->
152 case Roman.$wgo w w1 of ww { __DEFAULT -> GHC.Types.I# ww }
154 -- RHS size: {terms: 2, types: 0, coercions: 0, joins: 0/0}
159 Unf=Unf{Src=<vanilla>, TopLvl=True, Value=True, ConLike=True,
160 WorkFree=True, Expandable=True, Guidance=IF_ARGS [] 10 20}]
161 Roman.foo2 = GHC.Types.I# 6#
163 -- RHS size: {terms: 2, types: 1, coercions: 0, joins: 0/0}
164 Roman.foo1 :: Maybe Int
168 Unf=Unf{Src=<vanilla>, TopLvl=True, Value=True, ConLike=True,
169 WorkFree=True, Expandable=True, Guidance=IF_ARGS [] 10 20}]
170 Roman.foo1 = GHC.Maybe.Just @ Int Roman.foo2
172 -- RHS size: {terms: 11, types: 4, coercions: 0, joins: 0/0}
178 Unf=Unf{Src=InlineStable, TopLvl=True, Value=True, ConLike=True,
179 WorkFree=True, Expandable=True,
180 Guidance=ALWAYS_IF(arity=1,unsat_ok=True,boring_ok=False)
181 Tmpl= \ (n [Occ=Once!] :: Int) ->
182 case n of n1 [Occ=Once] { GHC.Types.I# _ [Occ=Dead] ->
183 Roman.foo_go (GHC.Maybe.Just @ Int n1) Roman.foo1
187 case n of { GHC.Types.I# ipv ->
188 case Roman.foo_$s$wgo 6# ipv of ww { __DEFAULT -> GHC.Types.I# ww }
192 ------ Local rules for imported ids --------
194 forall (sc :: GHC.Prim.Int#) (sc1 :: GHC.Prim.Int#).
195 Roman.$wgo (GHC.Maybe.Just @ Int (GHC.Types.I# sc1))
196 (GHC.Maybe.Just @ Int (GHC.Types.I# sc))
197 = Roman.foo_$s$wgo sc sc1