Skip to content
GitLab
Menu
Projects
Groups
Snippets
Loading...
Help
Help
Support
Community forum
Keyboard shortcuts
?
Submit feedback
Sign in / Register
Toggle navigation
Menu
Open sidebar
Glasgow Haskell Compiler
GHC
Commits
9b3d4cdd
Commit
9b3d4cdd
authored
Apr 05, 2013
by
Gabor Greif
💬
Browse files
Fix typos
parent
b84da617
Changes
7
Hide whitespace changes
Inline
Side-by-side
compiler/cmm/CmmPipeline.hs
View file @
9b3d4cdd
...
...
@@ -62,7 +62,7 @@ cpsTop hsc_env proc =
--
CmmProc
h
l
v
g
<-
{-# SCC "cmmCfgOpts(1)" #-}
return
$
cmmCfgOptsProc
splitting_proc_points
proc
dump
Opt_D_dump_cmm_cfg
"Post control-flow optimsations"
g
dump
Opt_D_dump_cmm_cfg
"Post control-flow optim
i
sations"
g
let
!
TopInfo
{
stack_info
=
StackInfo
{
arg_space
=
entry_off
,
do_layout
=
do_layout
}}
=
h
...
...
@@ -135,7 +135,7 @@ cpsTop hsc_env proc =
else
gs
gs
<-
return
(
map
removeUnreachableBlocksProc
gs
)
-- Note [unreachable blocks]
dumps
Opt_D_dump_cmm_cfg
"Post control-flow optimsations"
gs
dumps
Opt_D_dump_cmm_cfg
"Post control-flow optim
i
sations"
gs
return
(
cafEnv
,
gs
)
...
...
@@ -155,7 +155,7 @@ cpsTop hsc_env proc =
else
g
g
<-
return
(
removeUnreachableBlocksProc
g
)
-- Note [unreachable blocks]
dump'
Opt_D_dump_cmm_cfg
"Post control-flow optimsations"
g
dump'
Opt_D_dump_cmm_cfg
"Post control-flow optim
i
sations"
g
return
(
cafEnv
,
[
g
])
...
...
compiler/coreSyn/CoreUnfold.lhs
View file @
9b3d4cdd
...
...
@@ -665,7 +665,7 @@ Literal integers *can* be big (mkInteger [...coefficients...]), but
need not be (S# n). We just use an aribitrary big-ish constant here
so that, in particular, we don't inline top-level defns like
n = S# 5
There's no point in doing so -- any optimsations will see the S#
There's no point in doing so -- any optim
i
sations will see the S#
through n's unfolding. Nor will a big size inhibit unfoldings functions
that mention a literal Integer, because the float-out pass will float
all those constants to top level.
...
...
compiler/nativeGen/RegAlloc/Linear/Base.hs
View file @
9b3d4cdd
...
...
@@ -99,7 +99,7 @@ data RegAllocStats
{
ra_spillInstrs
::
UniqFM
[
Int
]
}
-- | The register alloctor state
-- | The register alloc
a
tor state
data
RA_State
freeRegs
=
RA_State
...
...
compiler/nativeGen/RegAlloc/Linear/PPC/FreeRegs.hs
View file @
9b3d4cdd
...
...
@@ -42,7 +42,7 @@ releaseReg _ _
initFreeRegs
::
Platform
->
FreeRegs
initFreeRegs
platform
=
foldr
releaseReg
noFreeRegs
(
allocatableRegs
platform
)
getFreeRegs
::
RegClass
->
FreeRegs
->
[
RealReg
]
-- lazil
l
y
getFreeRegs
::
RegClass
->
FreeRegs
->
[
RealReg
]
-- lazily
getFreeRegs
cls
(
FreeRegs
g
f
)
|
RcDouble
<-
cls
=
go
f
(
0x80000000
)
63
|
RcInteger
<-
cls
=
go
g
(
0x80000000
)
31
...
...
compiler/nativeGen/RegAlloc/Linear/SPARC/FreeRegs.hs
View file @
9b3d4cdd
...
...
@@ -50,7 +50,7 @@ initFreeRegs platform
-- | Get all the free registers of this class.
getFreeRegs
::
RegClass
->
FreeRegs
->
[
RealReg
]
-- lazil
l
y
getFreeRegs
::
RegClass
->
FreeRegs
->
[
RealReg
]
-- lazily
getFreeRegs
cls
(
FreeRegs
g
f
d
)
|
RcInteger
<-
cls
=
map
RealRegSingle
$
go
1
g
1
0
|
RcFloat
<-
cls
=
map
RealRegSingle
$
go
1
f
1
32
...
...
compiler/utils/Stream.hs
View file @
9b3d4cdd
...
...
@@ -66,7 +66,7 @@ collect str = go str []
fromList
::
Monad
m
=>
[
a
]
->
Stream
m
a
()
fromList
=
mapM_
yield
-- | Apply a function to each element of a 'Stream', lazil
l
y
-- | Apply a function to each element of a 'Stream', lazily
map
::
Monad
m
=>
(
a
->
b
)
->
Stream
m
a
x
->
Stream
m
b
x
map
f
str
=
Stream
$
do
r
<-
runStream
str
...
...
@@ -74,7 +74,7 @@ map f str = Stream $ do
Left
x
->
return
(
Left
x
)
Right
(
a
,
str'
)
->
return
(
Right
(
f
a
,
Stream
.
map
f
str'
))
-- | Apply a monadic operation to each element of a 'Stream', lazil
l
y
-- | Apply a monadic operation to each element of a 'Stream', lazily
mapM
::
Monad
m
=>
(
a
->
m
b
)
->
Stream
m
a
x
->
Stream
m
b
x
mapM
f
str
=
Stream
$
do
r
<-
runStream
str
...
...
docs/comm/rts-libs/prelude.html
View file @
9b3d4cdd
...
...
@@ -8,7 +8,7 @@
<body
BGCOLOR=
"FFFFFF"
>
<h1>
The GHC Commentary - Cunning Prelude Code
</h1>
<p>
GHC's uses a many optimsations and GHC specific techniques (unboxed
GHC's uses a many optim
i
sations and GHC specific techniques (unboxed
values, RULES pragmas, and so on) to make the heavily used Prelude code
as fast as possible.
...
...
@@ -106,7 +106,7 @@ mapList f (x:xs) = f x : mapList f xs
foldr/build rules, and if no foldr/build rule matches, the "mapList"
rule
<em>
closes
</em>
it again in a later phase of optimisation - after
build was inlined. As a consequence, the whole thing depends a bit on
the timing of the various optimsations (the map might be closed again
the timing of the various optim
i
sations (the map might be closed again
before any of the foldr/build rules fires). To make the timing
deterministic,
<code>
build
</code>
gets a
<code>
{-# INLINE 2 build
#-}
</code>
pragma, which delays
<code>
build
</code>
's inlining, and thus,
...
...
Write
Preview
Markdown
is supported
0%
Try again
or
attach a new file
.
Attach a file
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Cancel
Please
register
or
sign in
to comment