summaryrefslogtreecommitdiff
path: root/utils/genprimopcode
Commit message (Collapse)AuthorAgeFilesLines
...
* Revert multiple commitsAustin Seipp2015-05-141-1/+1
| | | | | | | | | | | | | | | | | | | | This reverts multiple commits from Simon: - 04a484eafc9eb9f8774b4bdd41a5dc6c9f640daf Test Trac #10359 - a9ccd37add8315e061c02e5bf26c08f05fad9ac9 Test Trac #10403 - c0aae6f699cbd222d826d0b8d78d6cb3f682079e Test Trac #10248 - eb6ca851f553262efe0824b8dcbe64952de4963d Make the "matchable-given" check happen first - ca173aa30467a0b1023682d573fcd94244d85c50 Add a case to checkValidTyCon - 51cbad15f86fca1d1b0e777199eb1079a1b64d74 Update haddock submodule - 6e1174da5b8e0b296f5bfc8b39904300d04eb5b7 Separate transCloVarSet from fixVarSet - a8493e03b89f3b3bfcdb6005795de050501f5c29 Fix imports in HscMain (stage2) - a154944bf07b2e13175519bafebd5a03926bf105 Two wibbles to fix the build - 5910a1bc8142b4e56a19abea104263d7bb5c5d3f Change in capitalisation of error msg - 130e93aab220bdf14d08028771f83df210da340b Refactor tuple constraints - 8da785d59f5989b9a9df06386d5bd13f65435bc0 Delete commented-out line These break the build by causing Haddock to fail mysteriously when trying to examine GHC.Prim it seems.
* Refactor tuple constraintsSimon Peyton Jones2015-05-131-1/+1
| | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | Make tuple constraints be handled by a perfectly ordinary type class, with the component constraints being the superclasses: class (c1, c2) => (c2, c2) This change was provoked by #10359 inability to re-use a given tuple constraint as a whole #9858 confusion between term tuples and constraint tuples but it's generally a very nice simplification. We get rid of - In Type, the TuplePred constructor of PredTree, and all the code that dealt with TuplePreds - In TcEvidence, the constructors EvTupleMk, EvTupleSel See Note [How tuples work] in TysWiredIn. Of course, nothing is ever entirely simple. This one proved quite fiddly. - I did quite a bit of renaming, which makes this patch touch a lot of modules. In partiuclar tupleCon -> tupleDataCon. - I made constraint tuples known-key rather than wired-in. This is different to boxed/unboxed tuples, but it proved awkward to have all the superclass selectors wired-in. Easier just to use the standard mechanims. - While I was fiddling with known-key names, I split the TH Name definitions out of DsMeta into a new module THNames. That meant that the known-key names can all be gathered in PrelInfo, without causing module loops. - I found that the parser was parsing an import item like T( .. ) as a *data constructor* T, and then using setRdrNameSpace to fix it. Stupid! So I changed the parser to parse a *type constructor* T, which means less use of setRdrNameSpace. I also improved setRdrNameSpace to behave better on Exact Names. Largely on priciple; I don't think it matters a lot. - When compiling a data type declaration for a wired-in thing like tuples (,), or lists, we don't really need to look at the declaration. We have the wired-in thing! And not doing so avoids having to line up the uniques for data constructor workers etc. See Note [Declarations for wired-in things] - I found that FunDeps.oclose wasn't taking superclasses into account; easily fixed. - Some error message refactoring for invalid constraints in TcValidity
* Typos in error messages and in commentsGabor Greif2015-04-102-2/+2
|
* Update list of primops that don't get wrappers (#10191)Reid Barton2015-03-271-6/+4
| | | | | | | | | | | | | | | | | | | Summary: The list was 14 years old, and there don't seem to be any problems with seq# or par#; the other par*# primops were not actually implemented at all and were removed in D758. Test Plan: validate; will also try to locally validate an unregisterised build in case there was some truth to the deleted comment Reviewers: austin Subscribers: thomie Differential Revision: https://phabricator.haskell.org/D759 GHC Trac Issues: #10191
* Delete vestigial external core code (#9402)Thomas Miedema2015-02-171-120/+0
| | | | | | | | | | | | | | Test Plan: harbormaster Reviewers: austin Reviewed By: austin Subscribers: thomie Differential Revision: https://phabricator.haskell.org/D659 GHC Trac Issues: #9402
* Another fix to genprimopcode, when generating Prim.hsSimon Peyton Jones2015-01-061-1/+17
| | | | | | | | | When haddock processes Prim.hs, it was calling TcEnv.tcGetDefaultTys, and that made it look for Integer and String, which are not in ghc-prim. Result was a crash. But we don't need defaulting in Prim.hs, so add default ()
* Update haddock submodule, and fix haddock input file from genprimopcodeSimon Peyton Jones2015-01-061-0/+6
| | | | | | | | | * A module in haddock an unused constraint, now fixed and pushed to ghc-head This patch records the new commit in GHC repo * genprimopcode generates a dummy Prim.hs for haddock. But then Haddock was complaining about redundant constraints. So this patch makes genprimopcode generate a warning-suppression OPTIONS_GHC pragma in Prim.hs
* Avoid redundant-import warning (w/o CPP)Herbert Valerio Riedel2014-12-271-0/+3
|
* genprimopcode: GHC.Prim is Unsafe (#9449)Austin Seipp2014-09-011-4/+8
| | | | | | | | | | | | | | | | | | | | | | | | Summary: Make sure the documentation for `GHC.Prim` adequately reflects the fact it is unsafe. Also clean up some 80-column violations. Signed-off-by: Austin Seipp <austin@well-typed.com> Test Plan: Build documentation, check `GHC.Prim`. It's properly marked as `Unsafe`. Reviewers: hvr, goldfire, ezyang Reviewed By: ezyang Subscribers: nomeata, simonmar, ezyang, carter Differential Revision: https://phabricator.haskell.org/D182 GHC Trac Issues: #9449
* genprimopcode: Don't output tabsAustin Seipp2014-08-201-2/+2
| | | | | | | Otherwise the build breaks, because its output is included in tab-free files. See ef9dd9f. Signed-off-by: Austin Seipp <austin@well-typed.com>
* Remove external coreAustin Seipp2014-05-031-5/+1
| | | | Signed-off-by: Austin Seipp <austin@well-typed.com>
* Add SmallArray# and SmallMutableArray# typesJohan Tibell2014-03-291-0/+3
| | | | | | | | | | | | | | | These array types are smaller than Array# and MutableArray# and are faster when the array size is small, as they don't have the overhead of a card table. Having no card table reduces the closure size with 2 words in the typical small array case and leads to less work when updating or GC:ing the array. Reduces both the runtime and memory allocation by 8.8% on my insert benchmark for the HashMap type in the unordered-containers package, which makes use of lots of small arrays. With tuned GC settings (i.e. `+RTS -A6M`) the runtime reduction is 15%. Fixes #8923.
* Remove support for "primclass"Joachim Breitner2014-03-165-23/+0
| | | | | | This partly reverts commit e239753c349f925b576b72dc3445934cba8bcd50. Since Coercible is exported via GHC.Types, so "primclass" is no longer needed. The support for => in primops.pp is still required for coerce.
* Coercible is now exported from GHC.Types (#8894)Joachim Breitner2014-03-161-0/+1
| | | | | so do not export it in GHC.Prim, and also have the pseudo-code for GHC.Prim import GHC.Types, so that haddock is happy.
* genprimopcode: Applicative instance for ParserMAustin Seipp2014-01-141-1/+9
| | | | Signed-off-by: Austin Seipp <austin@well-typed.com>
* Add more missing `{-# LANGUAGE #-}`s to `genprimopcode` outputHerbert Valerio Riedel2013-10-271-2/+2
| | | | | | | | | | | This is a follow-up to 0620241a0f09d1ff865fa575eadb61aa59d2fe4f which addressed only the `Prim.hs` output; this commit adds the missing `LANGUAGE` pragmas for the generated `PrimopWrappers.hs` output as well. While at it, the redundant `CPP` pragma is removed from the generated `Prim.hs` file. Signed-off-by: Herbert Valerio Riedel <hvr@gnu.org>
* Add `{-# LANGUAGE MagicHash #-}` in output of `genprimopcode`Herbert Valerio Riedel2013-10-271-1/+1
| | | | Signed-off-by: Herbert Valerio Riedel <hvr@gnu.org>
* Globally replace "hackage.haskell.org" with "ghc.haskell.org"Simon Marlow2013-10-014-6/+6
|
* SIMD primops are now generated using schemas that are polymorphic inGeoffrey Mainland2013-09-225-88/+372
| | | | | | | | | | | | | width and element type. SIMD primops are now polymorphic in vector size and element type, but only internally to the compiler. More specifically, utils/genprimopcode has been extended so that it "knows" about SIMD vectors. This allows us to, for example, write a single definition for the "add two vectors" primop in primops.txt.pp and have it instantiated at many vector types. This generates a primop in GHC.Prim for each vector type at which "add two vectors" is instantiated, but only one data constructor for the PrimOp data type, so the code generator is much, much simpler.
* Do not expose LLVM-only primops in GHC.PrimopWrappers.Geoffrey Mainland2013-09-221-20/+7
| | | | | GHC.PrimopWrappers is only used by GHCi, which cannot evaluate LLVM-only primops in any case.
* Allow primclass and class constraints in primopsJoachim Breitner2013-09-135-9/+48
| | | | In preparation for the primitive class Coercible
* Update email addressesGabor Greif2013-08-221-1/+1
|
* Comparison primops return Int# (Fixes #6135)Jan Stolarek2013-08-142-4/+1
| | | | | | | | | | | | This patch modifies all comparison primops for Char#, Int#, Word#, Double#, Float# and Addr# to return Int# instead of Bool. A value of 1# represents True and 0# represents False. For a more detailed description of motivation for this change, discussion of implementation details and benchmarking results please visit the wiki page: http://hackage.haskell.org/trac/ghc/wiki/PrimBool There's also some cleanup: whitespace fixes in files that were extensively edited in this patch and constant folding rules for Integer div and mod operators (which for some reason have been left out up till now).
* Automatically add the $(exeext) to program namesIan Lynagh2013-03-031-1/+1
| | | | | | | We now define _PROGNAME, and _PROG is automatically defined with $(exeext). This will shortly automatically use the right exeext depending on what stage it is being compiled with (exeext may be different for different stages when cross-compiling).
* Define $(prog)_INPLACE variables automatically, and start using themIan Lynagh2013-03-031-1/+1
|
* Add a primop attribute llvm_only.Geoffrey Mainland2013-02-011-6/+6
| | | | | The llvm_only attribute indicates that a primop is only available when using the LLVM back-end.
* Add the Int64X2# primitive type and associated primops.Geoffrey Mainland2013-02-011-0/+2
|
* Add the DoubleX2# primitive type and associated primops.Geoffrey Mainland2013-02-011-4/+6
|
* Add the Int32X4# primitive type and associated primops.Paul Monday2013-02-011-2/+5
|
* Add the Float32X4# primitive type and associated primops.Geoffrey Mainland2013-02-011-5/+23
| | | | | | | | | | | | | This patch lays the groundwork needed for primop support for SIMD vectors. In addition to the groundwork, we add support for the FloatX4# primitive type and associated primops. * Add the FloatX4# primitive type and associated primops. * Add CodeGen support for Float vectors. * Compile vector operations to LLVM vector operations in the LLVM code generator. * Make the x86 native backend fail gracefully when encountering vector primops. * Only generate primop wrappers for vector primops when using LLVM.
* Add fixity information to primops (ticket #6026)Michal Terepeta2012-11-235-3/+58
|
* Build the dynamic way by default on Linux/amd64Ian Lynagh2012-10-031-0/+1
| | | | | | | | | | | | | This required various build system changes to get the build to go through. In the inplace shell wrappers, we set LD_LIBRARY_PATH to allow programs to find their libraries. In the future, we might change the inplace tree to be the same shape as an installed tree instead. However, this would mean changing the way we do installation, as currently we use cabal's installation methods to install the libraries, but that only works if the libraries are under libraries/foo/dist-install/build/..., rather than in inplace/lib/...
* Tabs -> SpacesDavid Terei2012-03-234-236/+219
|
* Add new primtypes 'ArrayArray#' and 'MutableArrayArray#'Manuel M T Chakravarty2011-12-071-15/+16
| | | | | | | | The primitive array types, such as 'ByteArray#', have kind #, but are represented by pointers. They are boxed, but unpointed types (i.e., they cannot be 'undefined'). The two categories of array types —[Mutable]Array# and [Mutable]ByteArray#— are containers for unboxed (and unpointed) as well as for boxed and pointed types. So far, we lacked support for containers for boxed, unpointed types (i.e., containers for the primitive arrays themselves). This is what the new primtypes provide. Containers for boxed, unpointed types are crucial for the efficient implementation of scattered nested arrays, which are central to the new DPH backend library dph-lifted-vseg. Without such containers, we cannot eliminate all unboxing from the inner loops of traversals processing scattered nested arrays.
* Use -fwarn-tabs when validatingIan Lynagh2011-11-042-0/+14
| | | | | We only use it for "compiler" sources, i.e. not for libraries. Many modules have a -fno-warn-tabs kludge for now.
* Handle HValues slightly nicerIan Lynagh2011-10-031-0/+1
| | | | | | We now have addrToAny# rather than addrToHValue#, and both addrToAny# and mkApUpd0# return "Any" rather than "a". This makes it a little easier to see what's going on, and fixes a warning in ByteCodeLink.
* Implement -XConstraintKindMax Bolingbroke2011-09-061-1/+1
| | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | Basically as documented in http://hackage.haskell.org/trac/ghc/wiki/KindFact, this patch adds a new kind Constraint such that: Show :: * -> Constraint (?x::Int) :: Constraint (Int ~ a) :: Constraint And you can write *any* type with kind Constraint to the left of (=>): even if that type is a type synonym, type variable, indexed type or so on. The following (somewhat related) changes are also made: 1. We now box equality evidence. This is required because we want to give (Int ~ a) the *lifted* kind Constraint 2. For similar reasons, implicit parameters can now only be of a lifted kind. (?x::Int#) => ty is now ruled out 3. Implicit parameter constraints are now allowed in superclasses and instance contexts (this just falls out as OK with the new constraint solver) Internally the following major changes were made: 1. There is now no PredTy in the Type data type. Instead GHC checks the kind of a type to figure out if it is a predicate 2. There is now no AClass TyThing: we represent classes as TyThings just as a ATyCon (classes had TyCons anyway) 3. What used to be (~) is now pretty-printed as (~#). The box constructor EqBox :: (a ~# b) -> (a ~ b) 4. The type LCoercion is used internally in the constraint solver and type checker to represent coercions with free variables of type (a ~ b) rather than (a ~# b)
* Follow ghc-prim changesIan Lynagh2011-08-261-1/+1
|
* compatibility with Alex 3.0Simon Marlow2011-08-082-2/+12
|
* fix warningsSimon Marlow2011-05-241-1/+3
|
* Assign more accurate code sizes to primops, so that the inliningSimon Marlow2011-05-245-6/+13
| | | | | heuristics work better. Also removed the old unused "needs_wrapper" predicate for primops. This helps with #4978.
* Fix the type sanity test in genprimopcode's Syntax.hs2010-11-18Ian Lynagh2010-11-171-2/+2
| | | | | | We assume this is what it's supposed to be checking. Certainly the old test (t2 == t2) can't be right. Spotted by Andres Loeh.
* add some {-# LANGUAGE BangPatterns #-} to mollify GHCSimon Marlow2010-11-172-0/+2
|
* Fix building genprimopcode with GHC 7.0, and remove haskell98 importsIan Lynagh2010-11-022-4/+5
|
* Follow GHC.Bool/GHC.Types mergeIan Lynagh2010-10-231-2/+2
|
* Remove a redundant parameter for mkTupleTy (the arity)simonpj@microsoft.com2009-10-281-2/+1
|
* Include a pointer to GHC.Exts in the generated GHC.Prim docsIan Lynagh2009-08-111-0/+2
|
* Fix warnings when building with the HEADIan Lynagh2009-07-301-1/+0
|
* Put "%expect 0" directives in the .y filesIan Lynagh2009-06-081-0/+1
| | | | | With the exception of GHC's main Parser.y(.pp), which has 2 reduce/reduce conflicts
* Fix warnings in genprimopcodeIan Lynagh2009-05-231-9/+10
|
View Lorry Controller Status