Simon Marlow [Fri, 11 Aug 2006 11:34:53 +0000 (11:34 +0000)]
On FreeBSD, use -lthr instead of -pthread for now (see comments)
simonpj@microsoft.com [Fri, 11 Aug 2006 11:04:35 +0000 (11:04 +0000)]
Two more error message indendations
simonpj@microsoft.com [Fri, 11 Aug 2006 11:04:12 +0000 (11:04 +0000)]
Go back to calling type veriables t
simonpj@microsoft.com [Fri, 11 Aug 2006 11:03:47 +0000 (11:03 +0000)]
Indent an error message
simonpj@microsoft.com [Fri, 11 Aug 2006 11:03:01 +0000 (11:03 +0000)]
Improve error message (imported from Prelude at Implicit import declaration)
Simon Marlow [Fri, 11 Aug 2006 10:13:27 +0000 (10:13 +0000)]
don't qualify module name for importedSrcLoc
Simon Marlow [Fri, 11 Aug 2006 10:11:59 +0000 (10:11 +0000)]
use "Defined in" rather than "Imported from" when printing ImportedSrcLoc
sven.panne@aedion.de [Fri, 11 Aug 2006 09:26:09 +0000 (09:26 +0000)]
Now that we have an "html" package, put the Haddock docs somewhere else
sven.panne@aedion.de [Thu, 10 Aug 2006 15:42:25 +0000 (15:42 +0000)]
Nuked hschooks.h in favour of cutils.h, which has the prototypes we need
sven.panne@aedion.de [Thu, 10 Aug 2006 15:36:24 +0000 (15:36 +0000)]
Match format strings and arguments for printf-like functions
sven.panne@aedion.de [Thu, 10 Aug 2006 14:48:37 +0000 (14:48 +0000)]
Warning police: Make prototype for LDV_recordDead_FILL_SLOP_DYNAMIC visible
sven.panne@aedion.de [Thu, 10 Aug 2006 14:47:29 +0000 (14:47 +0000)]
Warning police: Make strlen and friends known
sven.panne@aedion.de [Thu, 10 Aug 2006 14:45:05 +0000 (14:45 +0000)]
Tweak GCC's inlining parameters to get thread_obj inlined
simonpj@microsoft.com [Thu, 10 Aug 2006 14:20:34 +0000 (14:20 +0000)]
Add an IAmDead case to postInlineUnconditionally, and comments
simonpj@microsoft.com [Thu, 10 Aug 2006 14:15:26 +0000 (14:15 +0000)]
Do not repeatedly simplify an argument more than once
A very important invariant of the simplifier is that we do not simplify
an arbitrarily large expression more than once in a single pass. If this
can happen, then we can get exponential behaviour, when the large expression
itself has a large sub-expression which is simplified twice, and so on.
GHC has a long-standing bug which allows this repeated simplification to
happen. It shows up when we have a function like this
f d BIG
where f's unfolding looks like
\x -> case x of (a,b) -> a
Of course this is v common for overloaded functions.
Before this patch we simplified all the args (d and BIG) before
deciding to unfold f. Then we push back the simplified BIG onto the
continuation stack, inline f, so now we have
(case d of (a,b) -> a) BIG
After we reduce the case a bit, we'll simplify BIG a second time. And
that's the problem.
The quick-and-dirty solution is to keep a flag in the ApplyTo continuation
to say whather the arg has already been simplified. An alternative would
be to simplify it when first encountered, but that's a bigger change.
simonpj@microsoft.com [Thu, 10 Aug 2006 14:13:40 +0000 (14:13 +0000)]
Do not call preInlineUnconditionally in simplNonRecX
This looks to me like a long-standing bug. simplNonRecX was calling
preInlineUnconditionally, even though it was given an already-simplified
expression. Exponential behaviour beckons.
simonpj@microsoft.com [Thu, 10 Aug 2006 14:11:45 +0000 (14:11 +0000)]
Make postInlineUnconditaionally more conservative
I'm being more paranoid about repeatedly simplifying things (to avoid
exponential behaviour.) postInlineUnconditionally looks as if it
could repeated simplify the same expression; this patch stops it doing
so.
The extra lines are all comments!
Simon Marlow [Thu, 10 Aug 2006 13:23:07 +0000 (13:23 +0000)]
Control.Exception.unblock wasn't unblocking exceptions
Simon Marlow [Thu, 10 Aug 2006 13:01:54 +0000 (13:01 +0000)]
remove out of date comment
Simon Marlow [Thu, 10 Aug 2006 12:19:30 +0000 (12:19 +0000)]
move html before network, for now
Simon Marlow [Thu, 10 Aug 2006 11:37:19 +0000 (11:37 +0000)]
add html package
simonpj@microsoft.com [Thu, 10 Aug 2006 12:08:28 +0000 (12:08 +0000)]
Egregious bug in tcLHsConResTy
This terrible bug in tcLHsConTy is pretty much guaranteed to show up
on an program involving a GADT with more than one type parameter.
This bug isn't present in the STABLE branch.
Manuel: it is *not* necesary to merge this patch into the FC branch;
just ignore it.
simonpj@microsoft.com [Thu, 10 Aug 2006 12:07:59 +0000 (12:07 +0000)]
Comments about improvements to SpecConstr
Esa Ilari Vuokko [Wed, 9 Aug 2006 16:30:12 +0000 (16:30 +0000)]
Remove HasBounds-instance and implement MArray.getBounds instead
Esa Ilari Vuokko [Wed, 9 Aug 2006 16:13:41 +0000 (16:13 +0000)]
Fix Array imports
Simon Marlow [Wed, 9 Aug 2006 14:48:45 +0000 (14:48 +0000)]
Where we use $(GhcHcOpts), also add $(GhcStage1HcOpts)
This fixes building the compiler with -prof in $(GhcStage1HcOpts)
Simon Marlow [Wed, 9 Aug 2006 14:31:53 +0000 (14:31 +0000)]
fixes to the stage2 build following removal of old FFI syntax
Simon Marlow [Wed, 9 Aug 2006 14:12:25 +0000 (14:12 +0000)]
fix bug in task freeing
Simon Marlow [Wed, 9 Aug 2006 14:10:58 +0000 (14:10 +0000)]
add some more options to stage 2
Simon Marlow [Wed, 9 Aug 2006 10:29:36 +0000 (10:29 +0000)]
remove debugging code accidentally left in
Simon Marlow [Wed, 9 Aug 2006 10:16:55 +0000 (10:16 +0000)]
remember that old FFI syntax has been dropped
Simon Marlow [Wed, 9 Aug 2006 10:16:34 +0000 (10:16 +0000)]
only define GHCI if $(GhcWithInterpreter)=YES, also add -threaded
Ross Paterson [Wed, 9 Aug 2006 12:42:15 +0000 (12:42 +0000)]
move altzone test to base package
Ross Paterson [Wed, 9 Aug 2006 12:40:36 +0000 (12:40 +0000)]
remove unused FPTOOLS_CHECK_HTYPE macro
Simon Marlow [Wed, 9 Aug 2006 09:59:08 +0000 (09:59 +0000)]
Remove the artifical cap on the number of workers
See #805. This was here to catch bugs that resulted in an infinite
number of worker threads being created. However, we can't put a
reasonable bound on the number of worker threads, because legitimate
programs may need to create large numbers of (probably blocked) worker
threads. Furthermore, the OS probably has a bound on the number of
threads that a process can create in any case.
Simon Marlow [Wed, 9 Aug 2006 09:52:01 +0000 (09:52 +0000)]
Remove old FFI syntax
See #815
Simon Marlow [Wed, 9 Aug 2006 09:24:39 +0000 (09:24 +0000)]
make exit() overridable, for use in DLLs
See #753
simonpj@microsoft.com [Tue, 8 Aug 2006 22:49:24 +0000 (22:49 +0000)]
More fixes to pre-matching and pre-subsumption
Actually this patch fixes two errors. one was a trivial typo in
tha last patch (b_ty should be b_tau), which led to an infinite loop
when compiling Data.Generic.Twins.
Fixing that revealed a more serious error in the same function.
I was sloppy about dealing robsutly with name-capture for nested
quantifiers in pre-subsumption and pre-matching; and sure enough
I got bitten. Sigh. I think it is right now.
simonpj@microsoft.com [Tue, 8 Aug 2006 22:48:08 +0000 (22:48 +0000)]
Group exports so that all length functions are together; no semantic change
simonpj@microsoft.com [Tue, 8 Aug 2006 13:59:10 +0000 (13:59 +0000)]
Check that lazy patterns are for lifted types
A lazy pattern match must be for a lifted type. This is illegal:
f x = case g x of
~(# x,y #) -> ...
This commit fixes the problem. Trac #845, test is tcfail159
simonpj@microsoft.com [Tue, 8 Aug 2006 12:35:14 +0000 (12:35 +0000)]
Spelling in a comment
simonpj@microsoft.com [Tue, 8 Aug 2006 12:32:11 +0000 (12:32 +0000)]
Remove srcSpanStartLine/srcSpanEndLine crash
srcSpanStartLine/srcSpanEndLine panic on UnhelpfulLoc. They should not
really be exported by SrcLoc at all, but unfortunately they are used in
Lexer.x, which knows enough to avoid the panic.
However the call in RnEnv didn't know, and the panic was triggered
by Template Haskell spliced code. This patch fixes it by exporting
the predicate RnEnv wanted, namely isOneLineSpan.
Duncan Coutts [Thu, 6 Jul 2006 11:49:02 +0000 (11:49 +0000)]
Replace deprecated AC_TRY_COMPILE macro with the reccomended replcament
See: http://www.gnu.org/software/autoconf/manual/html_node/Obsolete-Macros.html
Duncan Coutts [Thu, 6 Jul 2006 11:47:12 +0000 (11:47 +0000)]
Add ghc and version number in .ident directive in NCG
Just because we can and because every other compiler does,
lets stick in an identifier directive: .ident "GHC x.y.z"
into the assembly output of the NCG.
Duncan Coutts [Thu, 6 Jul 2006 11:43:31 +0000 (11:43 +0000)]
Support the GNU non-exec stack annotation system
On recent GNU ELF systems one can mark an object file as not
requiring an executable stack. If all objects- linked into a
program have this note then the program will not use an executable
stack, which is good for security (and some distros have it as a
QA policy). GHC generated code does not need an executable stack
so add the note to the assembly output of the native code
generator (conditional on a configure test).
Duncan Coutts [Mon, 3 Jul 2006 23:43:56 +0000 (23:43 +0000)]
Complain more loudly if any of the hsc2hs phases fail
previously hsc2hs just exits with a non-zero exit code, now if any of
the compilation, linking or runing phases fail then we get a message
saying so and the failing command is printed.
Simon Marlow [Tue, 8 Aug 2006 10:31:10 +0000 (10:31 +0000)]
Remember to free() memory on exit
Patch mostly from Lennart Augustsson in #803, with additions to
Task.c by me.
simonpj@microsoft.com [Tue, 8 Aug 2006 09:11:08 +0000 (09:11 +0000)]
Fix pre-subsumption and pre-matching
The pre-subsuption and pre-matching functions should NEVER make bogus
bindings of type variables, although they are free to bale out and make
too few bindings.
I hadn't been thiking carefully enough about this, and there were two
separate bugs.
- Firstly, in pre-subsumption we must ignore the 'theta'
part of any overloaded type.
- Second, in pre-matching, we must return the empty subustition
on a mis-match, rather than returning the substitution so far.
This bug showed up when compiling Data.Generics.Schemes.hs, and is
imortalised in test tc206
simonpj@microsoft.com [Tue, 8 Aug 2006 08:02:55 +0000 (08:02 +0000)]
Improve error message
Improve a little-used error message. Given
f :: a -> a
f x y = e
the error says
The equations for f have two arguments
but its type `a -> a' has only one
(Before, it said "its type `a' has only one" which is bogus.
Ian Lynagh [Mon, 10 Jul 2006 21:43:08 +0000 (21:43 +0000)]
Pull out common removal code, and detect does-not-exist correctly
Ian Lynagh [Mon, 10 Jul 2006 20:44:24 +0000 (20:44 +0000)]
Create our own directory in the temporary directory to avoid various races
Ian Lynagh [Sun, 9 Jul 2006 18:38:50 +0000 (18:38 +0000)]
Merge SysTools import declarations
Ian Lynagh [Sun, 9 Jul 2006 14:51:01 +0000 (14:51 +0000)]
Don't freeze the dynamic flags used for filename generation before the pipeline starts
Ian Lynagh [Sat, 8 Jul 2006 15:24:24 +0000 (15:24 +0000)]
#807: Removed double fclose of prof_file
prof_file was being fclose'd in both gen_XML_logfile and hs_exit, leading
to glibc complaining of a double free.
simonpj@microsoft.com [Mon, 7 Aug 2006 11:21:07 +0000 (11:21 +0000)]
Add -fextended-default-rules and -fmono-pat-binds
Add -fextended-deafult-rules (in response to Don Stewart's message below),
and document them.
Also doucument -fmono-pat-binds/-fno-mono-pat-binds, which has been in
GHC a few weeks now.
(The two are in one patch because the diffs were so close together
that Darcs combined them.)
Simon
From: Donald Bruce Stewart [mailto:dons@cse.unsw.edu.au]
Sent: 07 August 2006 10:52
While we're thinking about defaulting, I have a question..
ghci uses an extended defaulting system, to allow things like:
Prelude> reverse []
[]
to work, and to have the right instance of Show found. The manual says:
"..it is tiresome for the user to have to specify the type, so GHCi extends
Haskell's type-defaulting rules (Section 4.3.4 of the Haskell 98 Report
(Revised)) as follows. If the expression yields a set of type constraints
that are all from standard classes (Num, Eq etc.), and at least one is
either a numeric class or the Show, Eq, or Ord class, GHCi will try to use
one of the default types, just as described in the Report. The standard
defaulting rules require that one of the classes is numeric; the difference
here is that defaulting is also triggered at least one is Show, Eq, or Ord."
Currently, there is no way to get at this "extended" defaulting for compiled
modules. However, I have a use case for in fact doing this.
With runtime evaluated Haskell, embedding 'interpreters' (over hs-plugins) is
easy. lambdabot, for example, implements a sandboxed haskell eval system. But
it doesn't have access to the defaulting mechanism of ghci, so we have:
dons:: > reverse []
lambdabot:: Add a type signature
dons:: > reverse [] :: [()]
lambdabot:: []
Which is annoying -- newbies wonder why they have to add these extra
constraints to get a Show instance.
I'm wondering, since the extended defaulting mechanisms are already
implemented, could they be made available to compiled modules as well,
perhaps using a flag, -fextended-defaulting?
Simon Marlow [Mon, 7 Aug 2006 14:31:02 +0000 (14:31 +0000)]
add a comment
simonpj@microsoft.com [Fri, 4 Aug 2006 21:49:42 +0000 (21:49 +0000)]
Do pre-subsumption in the main subsumption check
This patch improves the subsumption check (in TcUnify.tc_sub) so that
it does pre-subsumption first. The key code is in the case with
guard (isSigmaTy actual_ty); note the new call to preSubType.
Shorn of details, the question is this. Should this hold?
forall a. a->a <= Int -> (forall b. Int)
Really, it should; just instantiate 'a' to Int. This is just what
the pre-subsumption phase (which used in function applications),
will do.
I did a bit of refactoring to achieve this.
Fixes Trac #821. Test tc205 tests.
simonpj@microsoft.com [Tue, 1 Aug 2006 21:43:02 +0000 (21:43 +0000)]
Make unification robust to a boxy type variable meeting itself
Previously, the implicit assumption in unification is that a boxy
type variable could never occur on both sides of the unification,
so that we'd never find
bx5 :=: bx5
But the pre-subsumption stuff really means that the same variable
can occur on both sides. Consider
forall a. a->Int <= bx5->Int
Then pre-subumption will find a->bx5; and the full subsumption step
will find bx5:=bx5.
However, I think there is still no possiblity of a full occurs-check
failure; that is,
bx5 :=: Tree bx5
Although I can't quite see how to prove it! So I've added a
DEBUG test in uMetaVar to check for this case.
sven.panne@aedion.de [Fri, 4 Aug 2006 14:21:49 +0000 (14:21 +0000)]
Added cabal-setup
Simon Marlow [Thu, 3 Aug 2006 09:33:37 +0000 (09:33 +0000)]
Don't include the package name in a cost centre's module name
This is mainly to restore the old behaviour, but also we shouldn't
normally need the package name in a cost centre because only the
"main" package normally has cost centres.
shae@ScannedInAvian.com [Thu, 20 Jul 2006 15:29:29 +0000 (15:29 +0000)]
Add a new section "Getting the Source" to both HACKING and README. But what about win32 users?
Simon Marlow [Tue, 1 Aug 2006 13:10:27 +0000 (13:10 +0000)]
savingOldConfig: add Exception.block for extra paranoia
Ian Lynagh [Sat, 29 Jul 2006 19:29:46 +0000 (19:29 +0000)]
Refactor ghc-pkg
This patch fixes a couple of issues with the
Be lazier in user config creation, and don't fail on missing configs.
patch. It puts the createDirectoryIfMissing back in and removes assumptions
that the package.conf file already exists.
Ian Lynagh [Sun, 30 Jul 2006 10:52:56 +0000 (10:52 +0000)]
No functionality changes
Consistently used spaces rather than tabs.
Removed trailing whitespace.
Wrapped comments to fit in a standard terminal.
simonpj@microsoft.com [Mon, 31 Jul 2006 08:09:22 +0000 (08:09 +0000)]
Add notes about unsafeCoerce
Simon Marlow [Fri, 28 Jul 2006 14:08:09 +0000 (14:08 +0000)]
.hi-boot-5 is obsolete; the earliest GHC we support uses .hi-boot-6
Simon Marlow [Fri, 28 Jul 2006 14:06:07 +0000 (14:06 +0000)]
update to match .lhs-boot
Simon Marlow [Fri, 28 Jul 2006 14:04:44 +0000 (14:04 +0000)]
get ReadP from the right place.
simonpj@microsoft.com [Thu, 27 Jul 2006 16:08:32 +0000 (16:08 +0000)]
Improve error message for deriving
simonpj@microsoft.com [Thu, 27 Jul 2006 15:50:09 +0000 (15:50 +0000)]
Lazy patterns are like wild-cards for overlap warnings
MERGE TO STABLE
Fixes Trac #827
Test is should_compiler/ds058
Simon Marlow [Thu, 27 Jul 2006 15:38:02 +0000 (15:38 +0000)]
fix some problems with wired-in packages
Simon Marlow [Thu, 27 Jul 2006 15:06:50 +0000 (15:06 +0000)]
oops, remove old packages when updating
Simon Marlow [Thu, 27 Jul 2006 13:47:55 +0000 (13:47 +0000)]
fix symbols for GHC.PrimopWrappers
Simon Marlow [Thu, 27 Jul 2006 10:21:29 +0000 (10:21 +0000)]
a couple more symbols need package names
simonpj@microsoft.com [Thu, 27 Jul 2006 08:56:05 +0000 (08:56 +0000)]
Add missing import
simonpj@microsoft.com [Thu, 27 Jul 2006 08:04:22 +0000 (08:04 +0000)]
Make -fcontext-stack into a dynamic flag
This allows you to put -fcontext-stack into an options pragma,
as requested by Trac #829
While I was at it, I added OptIntPrefix to the forms allowed
in CmdLineParser.
simonpj@microsoft.com [Wed, 26 Jul 2006 22:53:04 +0000 (22:53 +0000)]
Deal correctly with infix type constructors in GADT decls
simonpj@microsoft.com [Wed, 26 Jul 2006 22:52:23 +0000 (22:52 +0000)]
Improve pretty printing of ConDecl
Simon Marlow [Wed, 26 Jul 2006 10:35:26 +0000 (10:35 +0000)]
fix parse error (merge-o, I think)
Simon Marlow [Wed, 26 Jul 2006 10:34:33 +0000 (10:34 +0000)]
fix DEBUG build
Simon Marlow [Wed, 26 Jul 2006 08:58:44 +0000 (08:58 +0000)]
missed one symbol that needs a package name
Simon Marlow [Wed, 26 Jul 2006 08:46:59 +0000 (08:46 +0000)]
change wired-in Haskell symbols to include the package name
Simon Marlow [Tue, 25 Jul 2006 14:17:47 +0000 (14:17 +0000)]
Unbox the Unique stored in a Name
I measured that this makes the comiler allocate a bit more, but it
might also make it faster and reduce residency. The extra allocation
is probably just because we're not inlining enough somewhere, so I
think this change is a step in the right direction.
Simon Marlow [Tue, 25 Jul 2006 14:08:16 +0000 (14:08 +0000)]
optimisations to newUnique
It turned out that newUnique was wasting one node of the splittable
uniq supply per invocation: it took the current supply, split it, used
the unique from one half and stored the other half in the monad. In
other words, the unique in the supply stored in the monad was never
used.
This optimisation fixes that and adds a bit of strictness, which
together lead to small reduction in allocations by the compiler, and
possibly an improvement in residency (hard to tell for sure when GCs
move around).
Simon Marlow [Tue, 25 Jul 2006 13:12:01 +0000 (13:12 +0000)]
tiny bit of extra strictness
Simon Marlow [Tue, 25 Jul 2006 12:02:52 +0000 (12:02 +0000)]
Make a SplitUniqSupply contain an Int# rather than an Int
The I# constructor is always removed when we make a unique later
anyway, so this just saves a bit of time and allocation.
Simon Marlow [Tue, 25 Jul 2006 13:09:13 +0000 (13:09 +0000)]
Use -package-name rather than -ignore-package
Simon Marlow [Tue, 25 Jul 2006 13:08:50 +0000 (13:08 +0000)]
Remove most of the conflict checking and auto-hiding
Now that the module restriction has been lifted, the auto-hiding is
mostly not required. GHC itself automatically hides old versions of a
package.
Simon Marlow [Tue, 25 Jul 2006 13:01:54 +0000 (13:01 +0000)]
Generalise Package Support
This patch pushes through one fundamental change: a module is now
identified by the pair of its package and module name, whereas
previously it was identified by its module name alone. This means
that now a program can contain multiple modules with the same name, as
long as they belong to different packages.
This is a language change - the Haskell report says nothing about
packages, but it is now necessary to understand packages in order to
understand GHC's module system. For example, a type T from module M
in package P is different from a type T from module M in package Q.
Previously this wasn't an issue because there could only be a single
module M in the program.
The "module restriction" on combining packages has therefore been
lifted, and a program can contain multiple versions of the same
package.
Note that none of the proposed syntax changes have yet been
implemented, but the architecture is geared towards supporting import
declarations qualified by package name, and that is probably the next
step.
It is now necessary to specify the package name when compiling a
package, using the -package-name flag (which has been un-deprecated).
Fortunately Cabal still uses -package-name.
Certain packages are "wired in". Currently the wired-in packages are:
base, haskell98, template-haskell and rts, and are always referred to
by these versionless names. Other packages are referred to with full
package IDs (eg. "network-1.0"). This is because the compiler needs
to refer to entities in the wired-in packages, and we didn't want to
bake the version of these packages into the comiler. It's conceivable
that someone might want to upgrade the base package independently of
GHC.
Internal changes:
- There are two module-related types:
ModuleName just a FastString, the name of a module
Module a pair of a PackageId and ModuleName
A mapping from ModuleName can be a UniqFM, but a mapping from Module
must be a FiniteMap (we provide it as ModuleEnv).
- The "HomeModules" type that was passed around the compiler is now
gone, replaced in most cases by the current package name which is
contained in DynFlags. We can tell whether a Module comes from the
current package by comparing its package name against the current
package.
- While I was here, I changed PrintUnqual to be a little more useful:
it now returns the ModuleName that the identifier should be qualified
with according to the current scope, rather than its original
module. Also, PrintUnqual tells whether to qualify module names with
package names (currently unused).
Docs to follow.
Simon Marlow [Tue, 25 Jul 2006 11:05:19 +0000 (11:05 +0000)]
comment formatting
Simon Marlow [Thu, 6 Jul 2006 14:13:49 +0000 (14:13 +0000)]
unused import
Simon Marlow [Thu, 6 Jul 2006 14:12:05 +0000 (14:12 +0000)]
unused import
Simon Marlow [Tue, 4 Jul 2006 15:12:17 +0000 (15:12 +0000)]
remove more Addr bits
Simon Marlow [Tue, 4 Jul 2006 14:13:19 +0000 (14:13 +0000)]
unused import
Simon Marlow [Tue, 4 Jul 2006 13:54:44 +0000 (13:54 +0000)]
add default cases
Simon Marlow [Tue, 4 Jul 2006 13:54:35 +0000 (13:54 +0000)]
redundant import
Simon Marlow [Tue, 4 Jul 2006 13:51:17 +0000 (13:51 +0000)]
unused imports
Simon Marlow [Tue, 4 Jul 2006 13:45:57 +0000 (13:45 +0000)]
unused import
Simon Marlow [Tue, 4 Jul 2006 12:49:12 +0000 (12:49 +0000)]
remove unused bits, mostly to do with the Addr type
Simon Marlow [Mon, 24 Jul 2006 15:48:26 +0000 (15:48 +0000)]
In interface files, store FastStrings rather than OccNames where possible
In all cases the namespace is known from the context, so this saves 1
byte per variable binding/occurrence (a few percent per iface file).