Skip to content
GitLab
Projects
Groups
Snippets
/
Help
Help
Support
Community forum
Keyboard shortcuts
?
Submit feedback
Sign in / Register
Toggle navigation
Menu
Open sidebar
Tobias Decking
GHC
Commits
ed4cf039
Commit
ed4cf039
authored
Dec 16, 2016
by
Gabor Greif
💬
Browse files
Typos in comments
parent
6fecb2a4
Changes
9
Hide whitespace changes
Inline
Side-by-side
compiler/coreSyn/CoreUtils.hs
View file @
ed4cf039
...
...
@@ -357,7 +357,7 @@ stripTicksTop p = go []
go
ts
other
=
(
reverse
ts
,
other
)
-- | Strip ticks satisfying a predicate from top of an expression,
-- returning the remaining expresion
-- returning the remaining expres
s
ion
stripTicksTopE
::
(
Tickish
Id
->
Bool
)
->
Expr
b
->
Expr
b
stripTicksTopE
p
=
go
where
go
(
Tick
t
e
)
|
p
t
=
go
e
...
...
compiler/llvmGen/LlvmCodeGen/Regs.hs
View file @
ed4cf039
...
...
@@ -102,7 +102,7 @@ stgTBAA
,
(
heapN
,
fsLit
"heap"
,
Just
topN
)
,
(
rxN
,
fsLit
"rx"
,
Just
heapN
)
,
(
baseN
,
fsLit
"base"
,
Just
topN
)
-- FIX: Not 100% sure if this h
e
irarchy is complete. I think the big thing
-- FIX: Not 100% sure if this hi
e
rarchy is complete. I think the big thing
-- is Sp is never aliased, so might want to change the hierarchy to have Sp
-- on its own branch that is never aliased (e.g never use top as a TBAA
-- node).
...
...
compiler/main/GhcMake.hs
View file @
ed4cf039
...
...
@@ -479,7 +479,7 @@ guessOutputFile = modifySession $ \env ->
name_exe
=
do
#
if
defined
(
mingw32_HOST_OS
)
-- we must add the .exe exten
t
ion unconditionally here, otherwise
-- we must add the .exe exten
s
ion unconditionally here, otherwise
-- when name has an extension of its own, the .exe extension will
-- not be added by DriverPipeline.exeFileName. See #2248
name'
<-
fmap
(
<.>
"exe"
)
name
...
...
compiler/simplCore/CallArity.hs
View file @
ed4cf039
...
...
@@ -468,7 +468,7 @@ callArityAnal arity int (Lam v e)
where
(
ae
,
e'
)
=
callArityAnal
(
arity
-
1
)
(
int
`
delVarSet
`
v
)
e
-- Application. Increase arity for the called expresion, nothing to know about
-- Application. Increase arity for the called expres
s
ion, nothing to know about
-- the second
callArityAnal
arity
int
(
App
e
(
Type
t
))
=
second
(
\
e
->
App
e
(
Type
t
))
$
callArityAnal
arity
int
e
...
...
compiler/simplCore/SetLevels.hs
View file @
ed4cf039
...
...
@@ -1033,7 +1033,7 @@ lookupVar le v = case lookupVarEnv (le_env le) v of
_
->
Var
v
abstractVars
::
Level
->
LevelEnv
->
DVarSet
->
[
OutVar
]
-- Find the variables in fvs, free vars of the target expresion,
-- Find the variables in fvs, free vars of the target expres
s
ion,
-- whose level is greater than the destination level
-- These are the ones we are going to abstract out
--
...
...
compiler/specialise/Rules.hs
View file @
ed4cf039
...
...
@@ -703,7 +703,7 @@ match _ _ e@Tick{} _
-- Consider matching
-- \x->f against \f->f
-- When we meet the lambdas we must remember to rename f to f' in the
-- second expresion. The RnEnv2 does that.
-- second expres
s
ion. The RnEnv2 does that.
--
-- Consider matching
-- forall a. \b->b against \a->3
...
...
compiler/typecheck/TcGenFunctor.hs
View file @
ed4cf039
...
...
@@ -727,7 +727,7 @@ Deriving Functor, Foldable, and Traversable all require generating expressions
which perform an operation on each argument of a data constructor depending
on the argument's type. In particular, a generated operation can be different
depending on whether the type mentions the last type variable of the datatype
(e.g., if you have data T a = MkT a Int, then a generated foldr expresion would
(e.g., if you have data T a = MkT a Int, then a generated foldr expres
s
ion would
fold over the first argument of MkT, but not the second).
This pattern is abstracted with the FFoldType datatype, which provides hooks
...
...
compiler/utils/BooleanFormula.hs
View file @
ed4cf039
...
...
@@ -86,7 +86,7 @@ The smart constructors (`mkAnd` and `mkOr`) do some attempt to simplify expressi
Implemented by mkAnd' / mkOr'
3. Conjunction with false, disjunction with true is simplified, i.e.
`mkAnd [mkFalse,x]` becomes `mkFalse`.
4. Common subexpresion elimination:
4. Common subexpres
s
ion elimination:
`mkAnd [x,x,y]` is reduced to just `mkAnd [x,y]`.
This simplification is not exhaustive, in the sense that it will not produce
...
...
compiler/vectorise/Vectorise/Vect.hs
View file @
ed4cf039
...
...
@@ -84,7 +84,7 @@ vRec vs es = (Rec (zip vvs ves), Rec (zip lvs les))
(
vvs
,
lvs
)
=
unzip
vs
(
ves
,
les
)
=
unzip
es
-- |Make a vectorised let expresion.
-- |Make a vectorised let expres
s
ion.
--
vLet
::
VBind
->
VExpr
->
VExpr
vLet
=
zipWithVect
Let
...
...
Write
Preview
Supports
Markdown
0%
Try again
or
attach a new 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