git.iko.soy/rowtype-yoga/purescript-native
on golang help sign in
swap
355eb9b4109 ahead, 0 behind
.gitignore+15
since splitsnapshots
unifiedsplit
@@ -1,8 +1,23 @@
1dist
1dist
2cabal-dev
2cabal-dev
3+.cabal-sandbox
4+cabal.sandbox.config
3*.o
5*.o
4*.hi
6*.hi
5*.chi
7*.chi
6*.chs.h
8*.chs.h
7*.lksh*
9*.lksh*
8.virthualenv
10.virthualenv
11+.psci_modules/
12+.test_modules/
13+bower_components/
14+node_modules
15+tmp/
16+.stack-work/
17+stack.yaml.lock
18+output
19+examples/docs/docs/
20+core-tests/full-core-docs.md
21+.psc-ide-port
22+.vscode/
23+result
ChangeLog.mdnew file+3
@@ -0,0 +1,3 @@
1+# Changelog for pscpp
2+
3+## Unreleased changes
LICENSE+26−16
@@ -1,20 +1,30 @@
1−The MIT License (MIT)
1+Copyright Andy Arvanitis (c) 2018
2
2
3−Copyright (c) 2013 Phil Freeman
3+All rights reserved.
4
4
5−Permission is hereby granted, free of charge, to any person obtaining a copy of
5+Redistribution and use in source and binary forms, with or without
6−this software and associated documentation files (the "Software"), to deal in
7−the Software without restriction, including without limitation the rights to
8−use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of
9−the Software, and to permit persons to whom the Software is furnished to do so,
10−subject to the following conditions:
6+modification, are permitted provided that the following conditions are met:
11
7
12−The above copyright notice and this permission notice shall be included in all
8+ * Redistributions of source code must retain the above copyright
13−copies or substantial portions of the Software.
9+ notice, this list of conditions and the following disclaimer.
14
10
15−THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
11+ * Redistributions in binary form must reproduce the above
12+ copyright notice, this list of conditions and the following
13+ disclaimer in the documentation and/or other materials provided
14+ with the distribution.
15+
16+ * Neither the name of Author name here nor the names of other
17+ contributors may be used to endorse or promote products derived
18+ from this software without specific prior written permission.
19+
20+THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
21+"AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
16−IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS
22+LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
17−FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR
23+A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
18−COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER
24+OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
25+SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
26+LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
27+DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
28+THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
19−IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
29+(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
20−CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
30+OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
PureScript.cabaldeleted−41
@@ -1,41 +0,0 @@
1−name: Purescript
2−version: 0.0.1
3−cabal-version: >=1.2
4−build-type: Simple
5−license: MIT
6−license-file: LICENSE
7−copyright: (c) Phil Freeman 2013
8−maintainer: Phil Freeman <paf31@cantab.net>
9−stability: experimental
10−synopsis: PureScript Programming Language Compiler
11−description: A small compile-to-JS language with extensible records and type-safe blocks
12−author: Phil Freeman <paf31@cantab.net>
13−data-dir: ""
14−
15−library
16− build-depends: base -any, syb -any, cmdtheline -any, containers -any,
17− mtl -any, parsec -any, utf8-string -any
18− exposed-modules: PureScript
19− exposed: True
20− buildable: True
21− hs-source-dirs: src
22− other-modules: PureScript.TypeChecker.Synonyms
23− PureScript.CodeGen.Externs PureScript.CodeGen.JS
24− PureScript.CodeGen.Common.Gen PureScript.CodeGen.Common Main
25− PureScript.CodeGen PureScript.Kinds PureScript.Parser
26− PureScript.TypeChecker PureScript.Types PureScript.Values
27− PureScript.Parser.Common PureScript.Parser.Declarations
28− PureScript.Parser.Types PureScript.Parser.Values
29− PureScript.TypeChecker.Kinds PureScript.TypeChecker.Monad
30− PureScript.TypeChecker.Types
31−
32−executable psc
33− build-depends: base -any, cmdtheline -any, containers -any,
34− mtl -any, parsec -any, utf8-string -any
35− main-is: Main.hs
36− buildable: True
37− hs-source-dirs: src
38− other-modules: PureScript.TypeChecker.Synonyms
39− PureScript.CodeGen.Externs PureScript.CodeGen.JS
40− PureScript.CodeGen.Common.Gen PureScript.CodeGen.Common
41−
README-go.mdnew file+48
@@ -0,0 +1,48 @@
1+
2+### psgo
3+
4+#### Performance
5+
6+* No runtime system beyond some support types and functions
7+* Uses PureScript's normal tail call optimization techniques for generated Go code
8+
9+#### Differences from PureScript:
10+
11+* Foreign imports/exports are Go instead of JavaScript – see [standard library foreign implementations](https://github.com/andyarvanitis/purescript-native-go-ffi)
12+* No Go-specific REPL
13+
14+#### Other notes:
15+
16+* The provided `Any` type is just an alias for `interface{}`
17+* PureScript types are represented in Go with:
18+
19+ | PureScript | Go |
20+ |------------|----|
21+ |`Array` | `[]Any`|
22+ |`String` | `string`|
23+ |`Number` | `float64`|
24+ |`Int` | `int`|
25+ |`Char` | `string` (single UTF-8 entity)|
26+ |`Boolean` | `bool`|
27+ |Records | `map[string]Any`|
28+
29+#### Future ideas:
30+
31+* Nice facilities (modules) for concurrency/parallelism, using goroutines
32+
33+
34+#### Getting Started
35+This assumes you are running macOS (OS X) or a Unix-like system (Linux, *BSD, etc.).
36+
37+1. Choose a working directory wherever you like. Then create a `src` subdirectory under it, which will be where you will place your own PureScript source files.
38+
39+1. Initialize your project with `spago init`, and install any dependencies with `spago install` (please see their instructions if you haven't used it before).
40+
41+1. Add the `backend = "psgo"` option to your `spago.dhall` file. That way `spago` will use the psgo backend when compiling.
42+
43+1. You should now be ready to build a PureScript program:
44+ * As stated above, place your source file(s) in the working directory's `src` subdirectory and execute `spago build`.
45+
46+ * This will generate the Go source tree for your program and then build an executable binary. The resulting executable will be in your working directory and will be named `Main`. The generated source files will be under `output/`.
47+
48+---
README.md+38−12
@@ -1,15 +1,41 @@
1−purescript
1+[![PureScript](https://raw.githubusercontent.com/purescript/purescript/master/logo.png)](http://purescript.org)
2−==========
3
2
4−A small strongly, statically typed compile-to-JS language with basic extensible records and type-safe blocks
3+This is a platform-native compiler backend for [PureScript](https://github.com/purescript/purescript). It attempts to generate "sane", debuggable, and portable [C++11](https://isocpp.org/wiki/faq/cpp11) (or later) or [Go](https://golang.org/) code as an intermediate language, which is then compiled to a native executable binary. This also enables easy interoperability with existing C/C++ or Go frameworks and libraries on a number of platforms.
5
4
6−## Current Features
5+There are two utilities in the purescript-native "suite": `pscpp` and `psgo`. The source code in this branch is for `psgo`, the purescript-to-Go transpiler. For the source code of the `pscpp` purescript-to-C++ transpiler, please see the [cpp branch](https://github.com/andyarvanitis/purescript-native/tree/cpp).
7
6
8−- Full Type Inference
7+#### Platforms
9−- Higher Kinded Polymorphism
8+* Although purescript-native should work on any platform supporting PureScript and modern C++ or Go, the generated code and resulting binary executables have been tested on:
10−- Support for basic Javascript types
9+ * macOS Mojave 10.14.5 – full test suite
11−- Extensible records
10+ * For C++, Xcode 10.2.1's `clang` was used
12−- Type-safe blocks with for/while/assignment etc.
11+ * For Go, `go` version 1.12.7 was used
13−- Functions with multiple arguments
12+ * Windows 10 x64 – full test suite
14−- Pattern matching
13+ * C++: Visual Studio 2017 and `clang`
15−- Simple FFI
14+ * Go: `go` version 1.12.7
15+ * Linux Debian 9.5 amd64 – full test suite (C++)
16+ * Default versions of `clang` and `gcc`
17+ * Linux Debian 10 amd64 – full test suite (Go)
18+ * Default version of `go`
19+ * Raspberry Pi 3 B+ Raspbian official build (ARM), default versions of `clang` and `gcc`
20+
21+
22+#### Requirements for building `pscpp` and `psgo`
23+
24+* [Haskell Stack](https://docs.haskellstack.org/en/stable/README/) (if you're running macOS 10.14.5+, you can use pre-built binaries from [here](https://github.com/andyarvanitis/purescript-native/releases/))
25+
26+#### Requirements for using PureScript + purescript-native
27+
28+* A recent version (0.13+) of [purescript](https://github.com/purescript/purescript/releases).
29+
30+* For `pscpp`, a C++11-capable toolchain, e.g. recent versions of clang, gcc, Microsoft Visual Studio
31+ * GNU Make + `psc-package` is the default supported build tool, but you should be able to use your favorite package manager, C++ build system, tools, debuggers, etc.
32+* For `psgo`, the [Go toolchain](https://golang.org) for your system
33+ * You can use your favorite PureScript package manager and build tools – but for simplicity, [`spago`](https://github.com/spacchetti/spago) is recommended.
34+
35+
36+#### For more information and a Getting Started guide, please see
37+* [`pscpp`](https://github.com/andyarvanitis/purescript-native/blob/cpp/README-cpp.md)
38+* [`psgo`](https://github.com/andyarvanitis/purescript-native/blob/golang/README-go.md)
39+
40+
41+---
Setup.hsnew file+2
@@ -0,0 +1,2 @@
1+import Distribution.Simple
2+main = defaultMain
Setup.lhsdeleted−6
@@ -1,6 +0,0 @@
1−#!/usr/bin/runhaskell
2−> module Main where
3−> import Distribution.Simple
4−> main :: IO ()
5−> main = defaultMain
6−
app/Main.hsnew file+250
@@ -0,0 +1,250 @@
1+{-# LANGUAGE OverloadedStrings #-}
2+{-# LANGUAGE RankNTypes #-}
3+{-# LANGUAGE TemplateHaskell #-}
4+
5+module Main where
6+
7+import Control.Monad (when)
8+import qualified Control.Monad.Parallel as Par
9+import Data.Aeson
10+import Data.Aeson.Types
11+import Data.Char
12+import Data.FileEmbed (embedFile)
13+import Data.List (delete, intercalate, isPrefixOf, nub, partition, (\\))
14+import Data.Maybe
15+import Data.Monoid ((<>))
16+import Data.Version
17+import Control.Monad.Supply
18+import Control.Monad.Supply.Class
19+import Text.Printf
20+
21+import System.Environment
22+import System.Directory (createDirectoryIfMissing, doesDirectoryExist, doesFileExist, getCurrentDirectory, getModificationTime)
23+import System.FilePath ((</>), joinPath, splitDirectories, takeDirectory)
24+import System.FilePath.Find
25+import System.Process
26+
27+import Data.Text (Text)
28+import qualified Data.Text as T
29+import qualified Data.Text.Encoding as T
30+import qualified Data.Text.Lazy as L
31+import qualified Data.Text.Lazy.Encoding as L
32+import qualified Data.ByteString as B
33+
34+import Development.GitRev
35+
36+import Language.PureScript.AST.Literals
37+import Language.PureScript.CoreFn
38+import Language.PureScript.CoreFn.FromJSON
39+
40+import CodeGen.IL
41+import CodeGen.IL.Common
42+import CodeGen.IL.Printer
43+
44+import Tests
45+
46+data Command = Build | Run (Maybe String)
47+
48+parseJson :: Text -> Value
49+parseJson text
50+ | Just fileJson <- decode . L.encodeUtf8 $ L.fromStrict text = fileJson
51+ | otherwise = error "Bad json"
52+
53+jsonToModule :: Value -> Module Ann
54+jsonToModule value =
55+ case parse moduleFromJSON value of
56+ Success (_, r) -> r
57+ _ -> error "Failed parsing corefn. Psgo currently supports purescript <= 0.13.8"
58+
59+splitArgs :: [String] -> ([String], Maybe String, [String])
60+splitArgs args =
61+ let (opts, files) = partition (isPrefixOf "--") args
62+ opts' = (map . map) toLower opts
63+ (moduleName, files') =
64+ if null files
65+ then (Nothing, files)
66+ else
67+ if "--run" `elem` opts' && length (files) >= 1
68+ then do
69+ let file0 = head files
70+ files' = tail files
71+ case file0 of
72+ "Main.main" -> (Just "Main", files')
73+ "Test.Main.main" -> (Just "Test.Main", files')
74+ _ -> (Nothing, files)
75+ else (Nothing, files)
76+ in (opts, moduleName, files')
77+
78+main :: IO ()
79+main = do
80+ args <- getArgs
81+ -- let (opts, files) = partition (isPrefixOf "--") args
82+ let (opts, moduleName, files) = splitArgs args
83+ opts' = (map . map) toLower opts
84+ if "--tests" `elem` opts'
85+ then runTests
86+ else do
87+ if "--help" `elem` opts' || "--version" `elem` opts'
88+ then do
89+ when ("--help" `elem` opts') $ do
90+ putStrLn help
91+ when ("--version" `elem` opts') $ do
92+ let branch = $(gitBranch)
93+ details | branch == "golang" = "master, commit " ++ $(gitHash)
94+ | otherwise = branch
95+ putStrLn $ details ++ if $(gitDirty) then " (DIRTY)" else ""
96+ else do
97+ if null files
98+ then do
99+ currentDir <- getCurrentDirectory
100+ processFiles opts' [currentDir]
101+ else
102+ processFiles opts' files
103+ if "--run" `elem` opts
104+ then runBuildTool $ Run moduleName
105+ else when ("--no-build" `notElem` opts) $
106+ runBuildTool Build
107+ return ()
108+ where
109+ processFiles :: [String] -> [FilePath] -> IO ()
110+ processFiles opts [file] = do
111+ isDir <- doesDirectoryExist file
112+ if isDir then do
113+ files <- find always (fileName ==? corefn) file
114+ if null files
115+ then errorNoCorefnFiles
116+ else generateFiles opts files
117+ else generateFiles opts [file]
118+ processFiles opts files = do
119+ generateFiles opts files
120+ basePath :: [FilePath] -> FilePath
121+ basePath files =
122+ let filepath = takeDirectory (head files) in
123+ joinPath $ (init $ splitDirectories filepath)
124+ generateFiles :: [String] -> [FilePath] -> IO ()
125+ generateFiles opts files = do
126+ let baseOutpath = basePath files
127+ writeSupportFiles baseOutpath
128+ Par.mapM (generateCode opts baseOutpath) files
129+ return ()
130+ runBuildTool :: Command -> IO ()
131+ runBuildTool cmd = do
132+ project <- projectEnv
133+ case cmd of
134+ Build -> do
135+ callProcess "go" ["build", T.unpack project </> modPrefix' </> "Main"]
136+ Run moduleName -> do
137+ callProcess "go" ["run", T.unpack project </> modPrefix' </> fromMaybe "Main" moduleName]
138+ return ()
139+
140+generateCode :: [String] -> FilePath -> FilePath -> IO ()
141+generateCode opts baseOutpath jsonFile = do
142+ jsonModTime <- getModificationTime jsonFile
143+ let filepath = takeDirectory jsonFile
144+ dirparts = splitDirectories $ filepath
145+ mname = last dirparts
146+ basedir = joinPath $ init dirparts
147+ mname' = T.pack mname
148+ possibleFileName = basedir </> (T.unpack mname') </> implFileName mname'
149+ exists <- doesFileExist possibleFileName
150+ if exists
151+ then do
152+ modTime <- getModificationTime possibleFileName
153+ when (modTime < jsonModTime) $
154+ transpile opts baseOutpath jsonFile
155+ else transpile opts baseOutpath jsonFile
156+
157+transpile :: [String] -> FilePath -> FilePath -> IO ()
158+transpile opts baseOutpath jsonFile = do
159+ jsonText <- T.decodeUtf8 <$> B.readFile jsonFile
160+ project <- projectEnv
161+ let module' = jsonToModule $ parseJson jsonText
162+ ((_, foreigns, asts, implHeader, implFooter), _) <- runSupplyT 5 (moduleToIL module' project)
163+ let mn = moduleNameToIL' $ moduleName module'
164+ implementation = prettyPrintIL asts
165+ outpath = joinPath [baseOutpath, T.unpack mn]
166+ implPath = outpath </> implFileName mn
167+ createDirectoryIfMissing True outpath
168+ putStrLn implPath
169+ B.writeFile implPath $ T.encodeUtf8 (implHeader <> implementation <> implFooter)
170+
171+writeSupportFiles :: FilePath -> IO ()
172+writeSupportFiles baseOutpath = do
173+ currentDir <- getCurrentDirectory
174+ let outputdir = T.pack $ baseOutpath \\ currentDir
175+ ffiOutpath = currentDir </> subdir
176+ createDirectoryIfMissing True baseOutpath
177+ createDirectoryIfMissing True ffiOutpath
178+ writeModuleFile outputdir currentDir $(embedFile "support/go.mod.working")
179+ writeModuleFile outputdir baseOutpath $(embedFile "support/go.mod.output")
180+ writeModuleFile outputdir ffiOutpath $(embedFile "support/go.mod.ffi-loader")
181+ writeLoaderFile ffiOutpath $(embedFile "support/ffi-loader.go")
182+ where
183+ writeModuleFile :: Text -> FilePath -> B.ByteString -> IO ()
184+ writeModuleFile outputdir path modText = do
185+ let goModSource = path </> "go.mod"
186+ goModSourceExists <- doesFileExist goModSource
187+ when (not goModSourceExists) $ do
188+ project <- projectEnv
189+ let project' = T.unpack project
190+ outputdir' = tail $ T.unpack outputdir
191+ modText' = T.replace "$PROJECT" project $ T.decodeUtf8 modText
192+ replaceLoader = project' </> ffiLoader' <> "=." </> subdir
193+ replaceOutput = project' </> modPrefix' <> "=." </> outputdir'
194+ B.writeFile goModSource $ T.encodeUtf8 modText'
195+ callProcess "go" ["mod", "edit", "-replace", replaceLoader]
196+ callProcess "go" ["mod", "edit", "-replace", replaceOutput]
197+ callProcess "go" ["clean", "-modcache"]
198+ writeLoaderFile :: FilePath -> B.ByteString -> IO ()
199+ writeLoaderFile ffiOutpath loaderText = do
200+ let loaderSource = ffiOutpath </> "ffi_loader.go"
201+ loaderSourceExists <- doesFileExist loaderSource
202+ when (not loaderSourceExists) $ do
203+ B.writeFile loaderSource loaderText
204+
205+implFileName :: Text -> FilePath
206+implFileName mn = ((\c -> if c == '.' then '_' else c) <$> T.unpack mn) <> ".go"
207+
208+projectEnv :: IO Text
209+projectEnv = do
210+ T.pack . fromMaybe defaultProject <$> lookupEnv goproject
211+
212+help :: String
213+help = "Usage: psgo OPTIONS COREFN-FILES\n\
214+ \ PureScript to native (via go) compiler\n\n\
215+ \Available options:\n\
216+ \ --help Show this help text\n\n\
217+ \ --version Show the version number\n\n\
218+ \ --run Run the generated go code directly, without building an\n\
219+ \ executable\n\
220+ \ --no-build Generate go source files, but do not build an executable\n\
221+ \ --tests Run test cases (under construction)\n\n\
222+ \See also:\n\
223+ \ purs compile --help\n"
224+
225+corefn :: String
226+corefn = "corefn.json"
227+
228+goSrc :: String
229+goSrc = ".go"
230+
231+goproject :: String
232+goproject = "GOPROJECT"
233+
234+defaultProject :: String
235+defaultProject = "project.localhost"
236+
237+modPrefix' :: String
238+modPrefix' = T.unpack modPrefix
239+
240+ffiLoader' :: String
241+ffiLoader' = T.unpack ffiLoader
242+
243+subdir :: String
244+subdir = T.unpack modLabel
245+
246+errorNoCorefnFiles :: IO ()
247+errorNoCorefnFiles = do
248+ ioError . userError $ "no compiled purescript '" <> corefn <> "' files found –\n" <>
249+ " make sure to use the '--codegen corefn' option with your purs\n" <>
250+ " project build tool"
default.nixnew file+23
@@ -0,0 +1,23 @@
1+let
2+ haskellNix = import (builtins.fetchTarball https://github.com/input-output-hk/haskell.nix/archive/master.tar.gz) {};
3+ nixpkgsSrc = haskellNix.sources.nixpkgs-1903; # has hsc2hs-0.68.4
4+
5+ hsc2hsOverlay = self: super: {
6+ buildPackages = super.buildPackages // {
7+ hsc2hs = super.haskellPackages.hsc2hs;
8+ };
9+ };
10+
11+ nixpkgsArgs = haskellNix.nixpkgsArgs // {
12+ overlays = haskellNix.nixpkgsArgs.overlays ++ [ hsc2hsOverlay ];
13+ };
14+in
15+{ pkgs ? import nixpkgsSrc nixpkgsArgs
16+}:
17+
18+pkgs.haskell-nix.stackProject {
19+ src = pkgs.haskell-nix.haskellLib.cleanGit {
20+ name = "purescript-native";
21+ src = ./.;
22+ };
23+}
examples/Arrays.psdeleted−16
@@ -1,16 +0,0 @@
1−test1 = \arr -> arr[0] + arr[1]
2−
3−test2 = \arr -> case arr of
4− { [x, y] -> x + y
5− ; [x] -> x
6− ; [] -> 0
7− ; [x, y : _] -> x + y
8− }
9−
10−data Tree = One Number | Some [Tree]
11−
12−test3 = \tree, sum -> case tree of
13− { One n -> n
14− ; Some [n1, n2 : rest] -> test3(n1, sum) * 10 + test3(n2, sum) * 5 + sum(rest)
15− }
16−
examples/Assign.psdeleted−7
@@ -1,7 +0,0 @@
1−test = \ -> {
2− var x = [];
3− for (var i = 0; i < 10; i = i + 1) {
4− x[i] = i;
5− }
6− return x;
7− }
examples/FFI.psdeleted−5
@@ -1,5 +0,0 @@
1−extern foo :: (String) -> String
2−
3−bar :: (String) -> String
4−
5−bar = \x -> foo(x ++ "bar")
examples/List.psdeleted−24
@@ -1,24 +0,0 @@
1−data List a
2− = Nil
3− | Cons
4− { head :: a
5− ; tail :: List a
6− }
7−
8−null = \l -> case l of
9− { Nil -> true
10− ; _ -> false
11− }
12−
13−concat = \l1 -> \l2 -> case l1 of
14− { Nil -> l2
15− ; Cons x -> Cons(
16− { head: x.head
17− , tail: concat(x.tail)(l2)
18− })
19− }
20−
21−flatten = \xss -> case xss of
22− { Nil -> Nil
23− ; Cons cons -> concat(cons.head)(flatten(cons.tail))
24− }
examples/Match.psdeleted−3
@@ -1,3 +0,0 @@
1−data Foo a = Foo
2−
3−foo = \f -> case f of { Foo -> "foo" }
examples/Maybe.psdeleted−10
@@ -1,10 +0,0 @@
1−data Maybe a = Nothing | Just a
2−
3−maybe = \b -> \f -> \m -> case m of
4− { Nothing -> b
5− ; Just a -> f(a)
6− }
7−
8−fmap = \m -> \f -> maybe(Nothing)(\a -> Just(f(a)))(m)
9−
10−bind = \m -> \f -> maybe(Nothing)(f)(m)
examples/Objects.psdeleted−1
@@ -1 +0,0 @@
1−test = \x -> x.foo + x.bar
examples/Operators.psdeleted−5
@@ -1,5 +0,0 @@
1−test1 = \x, y, z -> x * y + z(x)(y)
2−
3−test2 = (\x -> (x.foo)(false))({ foo : \_ -> 1 })
4−
5−test3 = (\x, y -> x)(1 + 2 * (1 + 2), true && (false || false))
examples/Patterns.psdeleted−5
@@ -1,5 +0,0 @@
1−test = \x -> case x of
2− { { str = "Foo", bool = true } -> true
3− ; { str = "Bar", bool = b } -> b
4− ; _ -> false
5− }
examples/TypeDecl.psdeleted−14
@@ -1,14 +0,0 @@
1−id :: forall a. (a) -> a
2−id = \x -> x
3−
4−k :: (String) -> (Number) -> String
5−k = \x -> \y -> x
6−
7−iterate :: forall a. (Number) -> ((a) -> a) -> (a) -> a
8−iterate = \n -> \f -> \a -> {
9− var result = a;
10− for (var i = 0; i < n; i = i + 1) {
11− result = f(result);
12− }
13− return result;
14− }
examples/TypeSynonyms.psdeleted−14
@@ -1,14 +0,0 @@
1−type Lens a b =
2− { get :: (a) -> b
3− ; set :: (a) -> (b) -> b
4− }
5−
6−composeLenses :: forall a b c. (Lens a b) -> (Lens b c) -> Lens a c
7−composeLenses = \l1 -> \l2 ->
8− { get: \a -> (l2.get)((l1.get)(a))
9− , set: \a -> \c -> {
10− var b = (l1.get)(a);
11− var b1 = (l2.set)(b)(c);
12− return (l1.set)(a)(b1);
13− }
14− }
package.yamlnew file+86
@@ -0,0 +1,86 @@
1+name: psgo
2+version: 0.1.0.0
3+github: "andyarvanitis/purescript-native"
4+license: BSD3
5+author: "Andy Arvanitis"
6+maintainer: "example@example.com"
7+copyright: "2018 Andy Arvanitis"
8+
9+extra-source-files:
10+- README.md
11+- ChangeLog.md
12+- stack.yaml
13+- support/*
14+
15+# Metadata used when publishing your package
16+# synopsis: Short description of your package
17+# category: Web
18+
19+# To avoid duplicated efforts in documentation and dealing with the
20+# complications of embedding Haddock markup inside cabal files, it is
21+# common to point users to the README.md file.
22+description: Please see the README on Github at <https://github.com/andyarvanitis/purescript-native#readme>
23+
24+dependencies:
25+- base >= 4.7 && < 5
26+- bytestring >= 0.10.8.2 && < 0.11
27+- purescript
28+- base-compat >=0.6.0
29+- protolude >=0.1.6
30+- text
31+- containers
32+- filepath
33+- monad-parallel >= 0.7.2.2 && <0.8
34+- pattern-arrows >=0.0.2 && <0.1
35+- safe >=0.3.9 && <0.4
36+- transformers >=0.3.0 && <0.6
37+- mtl >=2.1.0 && <2.3.0
38+- aeson >=1.0 && <1.5
39+- directory
40+- process
41+- file-embed
42+- filemanip
43+- gitrev
44+
45+library:
46+ source-dirs: src
47+ default-extensions:
48+ - ConstraintKinds
49+ - DataKinds
50+ - DeriveFunctor
51+ - EmptyDataDecls
52+ - FlexibleContexts
53+ - KindSignatures
54+ - LambdaCase
55+ - MultiParamTypeClasses
56+ - NoImplicitPrelude
57+ - PatternGuards
58+ - PatternSynonyms
59+ - RankNTypes
60+ - RecordWildCards
61+ - OverloadedStrings
62+ - ScopedTypeVariables
63+ - TupleSections
64+ - ViewPatterns
65+
66+executables:
67+ psgo:
68+ main: Main.hs
69+ source-dirs: app
70+ ghc-options:
71+ - -threaded
72+ - -rtsopts
73+ - -with-rtsopts=-N
74+ dependencies:
75+ - psgo
76+
77+tests:
78+ psgo-test:
79+ main: Spec.hs
80+ source-dirs: test
81+ ghc-options:
82+ - -threaded
83+ - -rtsopts
84+ - -with-rtsopts=-N
85+ dependencies:
86+ - psgo
psgo.cabalnew file+145
@@ -0,0 +1,145 @@
1+cabal-version: 1.12
2+
3+-- This file has been generated from package.yaml by hpack version 0.35.0.
4+--
5+-- see: https://github.com/sol/hpack
6+
7+name: psgo
8+version: 0.1.0.0
9+description: Please see the README on Github at <https://github.com/andyarvanitis/purescript-native#readme>
10+homepage: https://github.com/andyarvanitis/purescript-native#readme
11+bug-reports: https://github.com/andyarvanitis/purescript-native/issues
12+author: Andy Arvanitis
13+maintainer: example@example.com
14+copyright: 2018 Andy Arvanitis
15+license: BSD3
16+license-file: LICENSE
17+build-type: Simple
18+extra-source-files:
19+ README.md
20+ ChangeLog.md
21+ stack.yaml
22+ support/ffi-loader.go
23+ support/go.mod.ffi-loader
24+ support/go.mod.output
25+ support/go.mod.working
26+
27+source-repository head
28+ type: git
29+ location: https://github.com/andyarvanitis/purescript-native
30+
31+library
32+ exposed-modules:
33+ CodeGen.IL
34+ CodeGen.IL.Common
35+ CodeGen.IL.Optimizer
36+ CodeGen.IL.Optimizer.Common
37+ CodeGen.IL.Optimizer.Inliner
38+ CodeGen.IL.Optimizer.MagicDo
39+ CodeGen.IL.Optimizer.TCO
40+ CodeGen.IL.Printer
41+ Tests
42+ other-modules:
43+ Paths_psgo
44+ hs-source-dirs:
45+ src
46+ default-extensions:
47+ ConstraintKinds
48+ DataKinds
49+ DeriveFunctor
50+ EmptyDataDecls
51+ FlexibleContexts
52+ KindSignatures
53+ LambdaCase
54+ MultiParamTypeClasses
55+ NoImplicitPrelude
56+ PatternGuards
57+ PatternSynonyms
58+ RankNTypes
59+ RecordWildCards
60+ OverloadedStrings
61+ ScopedTypeVariables
62+ TupleSections
63+ ViewPatterns
64+ build-depends:
65+ aeson >=1.0 && <1.5
66+ , base >=4.7 && <5
67+ , base-compat >=0.6.0
68+ , bytestring >=0.10.8.2 && <0.11
69+ , containers
70+ , directory
71+ , file-embed
72+ , filemanip
73+ , filepath
74+ , gitrev
75+ , monad-parallel >=0.7.2.2 && <0.8
76+ , mtl >=2.1.0 && <2.3.0
77+ , pattern-arrows >=0.0.2 && <0.1
78+ , process
79+ , protolude >=0.1.6
80+ , purescript
81+ , safe >=0.3.9 && <0.4
82+ , text
83+ , transformers >=0.3.0 && <0.6
84+ default-language: Haskell2010
85+
86+executable psgo
87+ main-is: Main.hs
88+ other-modules:
89+ Paths_psgo
90+ hs-source-dirs:
91+ app
92+ ghc-options: -threaded -rtsopts -with-rtsopts=-N
93+ build-depends:
94+ aeson >=1.0 && <1.5
95+ , base >=4.7 && <5
96+ , base-compat >=0.6.0
97+ , bytestring >=0.10.8.2 && <0.11
98+ , containers
99+ , directory
100+ , file-embed
101+ , filemanip
102+ , filepath
103+ , gitrev
104+ , monad-parallel >=0.7.2.2 && <0.8
105+ , mtl >=2.1.0 && <2.3.0
106+ , pattern-arrows >=0.0.2 && <0.1
107+ , process
108+ , protolude >=0.1.6
109+ , psgo
110+ , purescript
111+ , safe >=0.3.9 && <0.4
112+ , text
113+ , transformers >=0.3.0 && <0.6
114+ default-language: Haskell2010
115+
116+test-suite psgo-test
117+ type: exitcode-stdio-1.0
118+ main-is: Spec.hs
119+ other-modules:
120+ Paths_psgo
121+ hs-source-dirs:
122+ test
123+ ghc-options: -threaded -rtsopts -with-rtsopts=-N
124+ build-depends:
125+ aeson >=1.0 && <1.5
126+ , base >=4.7 && <5
127+ , base-compat >=0.6.0
128+ , bytestring >=0.10.8.2 && <0.11
129+ , containers
130+ , directory
131+ , file-embed
132+ , filemanip
133+ , filepath
134+ , gitrev
135+ , monad-parallel >=0.7.2.2 && <0.8
136+ , mtl >=2.1.0 && <2.3.0
137+ , pattern-arrows >=0.0.2 && <0.1
138+ , process
139+ , protolude >=0.1.6
140+ , psgo
141+ , purescript
142+ , safe >=0.3.9 && <0.4
143+ , text
144+ , transformers >=0.3.0 && <0.6
145+ default-language: Haskell2010
src/CodeGen/IL.hsnew file+321
@@ -0,0 +1,321 @@
1+-- | This module generates code in the core imperative representation from
2+-- elaborated PureScript code.
3+module CodeGen.IL
4+ ( module AST
5+ , module Common
6+ , moduleToIL
7+ ) where
8+
9+import Prelude.Compat
10+import Protolude (ordNub)
11+
12+import Control.Arrow ((&&&))
13+import Control.Monad (forM, liftM, replicateM, void)
14+import Control.Monad.Supply.Class
15+
16+import Data.List ((\\), delete, intersect, nub)
17+import qualified Data.Foldable as F
18+import qualified Data.Map as M
19+import Data.Maybe (fromMaybe, isNothing, mapMaybe)
20+import Data.Monoid ((<>))
21+import Data.String (fromString)
22+import Data.Text (Text)
23+import qualified Data.Text as T
24+
25+import Language.PureScript.AST.SourcePos
26+import Language.PureScript.CoreImp.AST (AST)
27+import qualified Language.PureScript.CoreImp.AST as AST
28+import Language.PureScript.CoreFn
29+import Language.PureScript.Crash
30+import Language.PureScript.Names
31+import Language.PureScript.Options
32+import Language.PureScript.PSString (PSString, mkString)
33+import Language.PureScript.Traversals (sndM)
34+import qualified Language.PureScript.Constants as C
35+
36+import System.FilePath.Posix ((</>))
37+
38+import CodeGen.IL.Common as Common
39+import CodeGen.IL.Optimizer
40+import CodeGen.IL.Printer
41+
42+data DeclType = ModuleDecl | LetDecl | RecLetDecl deriving (Eq)
43+
44+-- | Generate code in the simplified intermediate representation for all declarations in a
45+-- module.
46+moduleToIL
47+ :: forall m
48+ -- . (Monad m, MonadReader Options m, MonadSupply m, MonadError MultipleErrors m)
49+ . (Monad m, MonadSupply m)
50+ => Module Ann
51+ -> Text
52+ -> m (Text, [Text], [AST], Text, Text)
53+moduleToIL (Module _ coms mn _ imps _ foreigns decls) project =
54+ do
55+ ilDecls <- mapM (bindToIL ModuleDecl) decls
56+ optimized <- traverse (traverse (optimize modName')) ilDecls
57+ let optimized' = concat optimized
58+ values = annotValue <$> optimized'
59+ foreigns' = moduleIdentToIL <$> foreigns
60+ interface = interfaceSource modName values foreigns
61+ imports = nub . concat $ importToIL <$> optimized'
62+ implHeader = implHeaderSource modName imports project
63+ implFooter = implFooterSource (runModuleName mn) foreigns
64+ return $ (interface, foreigns', optimized', implHeader, implFooter)
65+ where
66+ modName = moduleNameToIL mn
67+ modName' = AST.Var Nothing modName
68+
69+ annotValue :: AST -> (Text, Bool)
70+ annotValue (AST.Function _ (Just name) [] (AST.Block _ [AST.Return _ ret]))
71+ | isLiteral ret = (name, True)
72+ annotValue (AST.Function _ (Just name) [] _) = (name, False)
73+ annotValue _ = error "Unexpected top-level value form"
74+
75+ -- | Extracts all declaration names from a binding group.
76+ getNames :: Bind Ann -> [Ident]
77+ getNames (NonRec _ ident _) = [ident]
78+ getNames (Rec vals) = map (snd . fst) vals
79+
80+ -- | Generates IL code for a module import
81+ --
82+ importToIL :: AST -> [Text]
83+ importToIL = AST.everything (++) modRef
84+ where
85+ modRef (AST.Indexer _ (AST.Var _ _) (AST.Var _ mname))
86+ | not $ T.null mname = [extract mname]
87+ modRef _ = []
88+ extract :: Text -> Text
89+ extract = T.replace "_" "." . T.dropWhileEnd (=='_')
90+
91+ -- |
92+ -- Generate code in the simplified intermediate representation for a declaration
93+ --
94+ bindToIL :: DeclType -> Bind Ann -> m [AST]
95+ bindToIL dt (NonRec ann ident val) = return <$> nonRecToIL dt ann ident val
96+ bindToIL dt (Rec vals) = forM vals (uncurry . uncurry $ nonRecToIL dt')
97+ where
98+ dt' = if dt == LetDecl then RecLetDecl else dt
99+
100+ -- | Generate code in the simplified intermediate representation for a single non-recursive
101+ -- declaration.
102+ --
103+ -- The main purpose of this function is to handle code generation for comments.
104+ nonRecToIL :: DeclType -> Ann -> Ident -> Expr Ann -> m AST
105+ nonRecToIL dt a i e@(extractAnn -> (_, com, _, _)) | not (null com) = do
106+ -- withoutComment <- asks optionsNoComments
107+ let withoutComment = False
108+ if withoutComment
109+ then nonRecToIL dt a i (modifyAnn removeComments e)
110+ else AST.Comment Nothing com <$> nonRecToIL dt a i (modifyAnn removeComments e)
111+ nonRecToIL ModuleDecl (ss, _, _, _) ident val = do
112+ il <- valueToIL val
113+ pure $ AST.Function Nothing (Just $ moduleIdentToIL ident) [] (AST.Block Nothing [AST.Return Nothing il])
114+ nonRecToIL RecLetDecl (ss, _, _, _) ident val = do
115+ ilExpr <- valueToIL val
116+ pure $ AST.Assignment Nothing (AST.Var Nothing $ identToIL ident) ilExpr
117+ nonRecToIL _ (ss, _, _, _) ident val = do
118+ il <- valueToIL val
119+ pure $ AST.VariableIntroduction Nothing (identToIL ident) (Just il)
120+
121+ -- | Generate code in the simplified intermediate representation for a variable based on a
122+ -- PureScript identifier.
123+ var :: Ident -> AST
124+ var = AST.Var Nothing . identToIL
125+
126+ accessorString :: PSString -> AST -> AST
127+ accessorString prop = AST.Indexer Nothing (AST.StringLiteral Nothing prop)
128+
129+ -- | Generate code in the simplified intermediate representation for a value or expression.
130+
131+ valueToIL :: Expr Ann -> m AST
132+ valueToIL (Literal (pos, _, _, _) l) = literalToValueIL pos l
133+ valueToIL (Accessor _ prop val) =
134+ accessorString prop <$> valueToIL val
135+ valueToIL (ObjectUpdate _ o ps) = do
136+ obj <- valueToIL o
137+ updates <- mapM (sndM valueToIL) ps
138+ obj' <- freshName'
139+ let objVar = AST.Var Nothing obj'
140+ copy = AST.VariableIntroduction Nothing obj' (Just $ copyDict obj)
141+ assign (k, v) = AST.Assignment Nothing (accessorString k objVar) v
142+ sts = copy : (assign <$> updates) ++ [AST.Return Nothing objVar]
143+ return $ AST.App Nothing (AST.Function Nothing Nothing [] (AST.Block Nothing sts)) []
144+ valueToIL (Abs _ arg val) = do
145+ ret <- valueToIL val
146+ let ilArg = case arg of
147+ UnusedIdent -> []
148+ _ -> [identToIL arg]
149+ return $ AST.Function Nothing Nothing ilArg (AST.Block Nothing [AST.Return Nothing ret])
150+ valueToIL e@App{} = do
151+ let (f, args) = unApp e []
152+ args' <- mapM valueToIL args
153+ fn <- valueToIL f
154+ case f of
155+ Var (_, _, _, Just IsNewtype) _ -> return (head args')
156+ _ -> flip (foldl (\fn a -> AST.App Nothing fn [a])) args' <$> valueToIL f
157+ where
158+ unApp :: Expr Ann -> [Expr Ann] -> (Expr Ann, [Expr Ann])
159+ unApp (App _ val arg) args = unApp val (arg : args)
160+ unApp other args = (other, args)
161+ valueToIL (Var _ ident) = return $ varToIL ident
162+ valueToIL (Case (ss, _, _, _) values binders) = do
163+ vals <- mapM valueToIL values
164+ bindersToIL ss binders vals
165+ valueToIL (Let _ ds val) = do
166+ let recurs = concatMap getNames $ filter isRec ds
167+ recurDs = (\v -> AST.VariableIntroduction Nothing (identToIL v) Nothing) <$> recurs
168+ ds' <- concat <$> mapM (bindToIL LetDecl) ds
169+ ret <- valueToIL val
170+ return $ AST.App Nothing (AST.Function Nothing Nothing [] (AST.Block Nothing (recurDs ++ ds' ++ [AST.Return Nothing ret]))) []
171+ where
172+ isRec :: Bind Ann -> Bool
173+ isRec (Rec _) = True
174+ isRec _ = False
175+ valueToIL (Constructor (_, _, _, Just IsNewtype) _ (ProperName ctor) _) = error "IsNewtype"
176+ valueToIL (Constructor _ _ (ProperName ctor) fields) =
177+ let body = AST.ObjectLiteral Nothing $ (mkString ctor, AST.BooleanLiteral Nothing True) :
178+ ((\field -> (mkString (identToIL field), var field)) `map` fields)
179+ fn = foldr (\f inner -> AST.Function Nothing Nothing [identToIL f] (AST.Block Nothing [AST.Return Nothing inner])) body fields
180+ in return fn
181+
182+
183+ iife :: Text -> [AST] -> AST
184+ iife v exprs = AST.App Nothing (AST.Function Nothing Nothing [] (AST.Block Nothing $ exprs ++ [AST.Return Nothing $ AST.Var Nothing v])) []
185+
186+ literalToValueIL :: SourceSpan -> Literal (Expr Ann) -> m AST
187+ literalToValueIL ss (NumericLiteral (Left i)) = return $ AST.NumericLiteral (Just ss) (Left i)
188+ literalToValueIL ss (NumericLiteral (Right n)) = return $ AST.NumericLiteral (Just ss) (Right n)
189+ literalToValueIL ss (StringLiteral s) = return $ AST.StringLiteral (Just ss) s
190+ literalToValueIL ss (CharLiteral c) = return $ AST.StringLiteral (Just ss) (fromString [c])
191+ literalToValueIL ss (BooleanLiteral b) = return $ AST.BooleanLiteral (Just ss) b
192+ literalToValueIL ss (ArrayLiteral xs) = AST.ArrayLiteral (Just ss) <$> mapM valueToIL xs
193+ literalToValueIL ss (ObjectLiteral ps) = AST.ObjectLiteral (Just ss) <$> mapM (sndM valueToIL) ps
194+
195+ -- | Generate code in the simplified intermediate representation for a reference to a
196+ -- variable.
197+ varToIL :: Qualified Ident -> AST
198+ varToIL (Qualified Nothing ident) = var ident
199+ varToIL qual = qualifiedToIL id qual
200+
201+ -- | Generate code in the simplified intermediate representation for a reference to a
202+ -- variable that may have a qualified name.
203+ qualifiedToIL :: (a -> Ident) -> Qualified a -> AST
204+ qualifiedToIL f (Qualified (Just (ModuleName mn')) a) | mn' == C.prim = AST.Var Nothing . moduleIdentToIL $ f a
205+ qualifiedToIL f (Qualified (Just mn') a) | mn /= mn' = AST.Indexer Nothing (AST.Var Nothing . moduleIdentToIL $ f a) (AST.Var Nothing (moduleNameToIL mn'))
206+ qualifiedToIL f (Qualified _ a) = AST.Indexer Nothing (AST.Var Nothing . moduleIdentToIL $ f a) (AST.Var Nothing "")
207+
208+ -- foreignIdent :: Ident -> AST
209+ -- foreignIdent ident = accessorString (mkString $ runIdent ident) (AST.Var Nothing "$foreign")
210+
211+ -- | Generate code in the simplified intermediate representation for pattern match binders
212+ -- and guards.
213+ bindersToIL :: SourceSpan -> [CaseAlternative Ann] -> [AST] -> m AST
214+ bindersToIL ss binders vals = do
215+ valNames <- replicateM (length vals) freshName'
216+ let assignments = zipWith (AST.VariableIntroduction Nothing) valNames (map Just vals)
217+ ils <- forM binders $ \(CaseAlternative bs result) -> do
218+ ret <- guardsToIL result
219+ go valNames ret bs
220+ return $ AST.App Nothing (AST.Function Nothing Nothing [] (AST.Block Nothing (assignments ++ concat ils ++ [AST.Throw Nothing (AST.StringLiteral Nothing $ mkString failedPatternMessage)])))
221+ []
222+ where
223+ go :: [Text] -> [AST] -> [Binder Ann] -> m [AST]
224+ go _ done [] = return done
225+ go (v:vs) done' (b:bs) = do
226+ done'' <- go vs done' bs
227+ binderToIL v done'' b
228+ go _ _ _ = internalError "Invalid arguments to bindersToIL"
229+
230+ failedPatternMessage :: Text
231+ failedPatternMessage = "Failed pattern match at " <> runModuleName mn <> " " <> displayStartEndPos ss
232+
233+ guardsToIL :: Either [(Guard Ann, Expr Ann)] (Expr Ann) -> m [AST]
234+ guardsToIL (Left gs) = traverse genGuard gs where
235+ genGuard (cond, val) = do
236+ cond' <- valueToIL cond
237+ val' <- valueToIL val
238+ return
239+ (AST.IfElse Nothing (AST.Binary Nothing AST.EqualTo cond' (AST.BooleanLiteral Nothing True))
240+ (AST.Block Nothing [AST.Return Nothing val']) Nothing)
241+
242+ guardsToIL (Right v) = return . AST.Return Nothing <$> valueToIL v
243+
244+ -- | Generate code in the simplified intermediate representation for a pattern match
245+ -- binder.
246+ binderToIL :: Text -> [AST] -> Binder Ann -> m [AST]
247+ binderToIL _ done NullBinder{} = return done
248+ binderToIL varName done (LiteralBinder _ l) =
249+ literalToBinderIL varName done l
250+ binderToIL varName done (VarBinder _ ident) =
251+ return (AST.VariableIntroduction Nothing (identToIL ident) (Just (AST.Var Nothing varName)) : done)
252+ binderToIL varName done (ConstructorBinder (_, _, _, Just IsNewtype) _ _ [b]) =
253+ binderToIL varName done b
254+ binderToIL varName done (ConstructorBinder (_, _, _, Just (IsConstructor ctorType fields)) _ (Qualified _ (ProperName ctor)) bs) = do
255+ il <- go (zip fields bs) done
256+ return $ case ctorType of
257+ ProductType -> il
258+ SumType ->
259+ [AST.IfElse Nothing (AST.InstanceOf Nothing (AST.Var Nothing varName) (AST.StringLiteral Nothing (mkString ctor)))
260+ (AST.Block Nothing il)
261+ Nothing]
262+ where
263+ go :: [(Ident, Binder Ann)] -> [AST] -> m [AST]
264+ go [] done' = return done'
265+ go ((field, binder) : remain) done' = do
266+ argVar <- freshName'
267+ done'' <- go remain done'
268+ il <- binderToIL argVar done'' binder
269+ return (AST.VariableIntroduction Nothing argVar (Just $ accessorString (mkString $ identToIL field) $ AST.Var Nothing varName) : il)
270+
271+ binderToIL _ _ ConstructorBinder{} =
272+ internalError "binderToIL: Invalid ConstructorBinder in binderToIL"
273+ binderToIL varName done (NamedBinder _ ident binder) = do
274+ il <- binderToIL varName done binder
275+ return (AST.VariableIntroduction Nothing (identToIL ident) (Just (AST.Var Nothing varName)) : il)
276+
277+ literalToBinderIL :: Text -> [AST] -> Literal (Binder Ann) -> m [AST]
278+ literalToBinderIL varName done (NumericLiteral num) =
279+ return [AST.IfElse Nothing (AST.Binary Nothing AST.EqualTo (AST.Var Nothing varName) (AST.NumericLiteral Nothing num)) (AST.Block Nothing done) Nothing]
280+ literalToBinderIL varName done (CharLiteral c) =
281+ return [AST.IfElse Nothing (AST.Binary Nothing AST.EqualTo (AST.Var Nothing varName) (AST.StringLiteral Nothing (fromString [c]))) (AST.Block Nothing done) Nothing]
282+ literalToBinderIL varName done (StringLiteral str) =
283+ return [AST.IfElse Nothing (AST.Binary Nothing AST.EqualTo (AST.Var Nothing varName) (AST.StringLiteral Nothing str)) (AST.Block Nothing done) Nothing]
284+ literalToBinderIL varName done (BooleanLiteral True) =
285+ return [AST.IfElse Nothing (AST.Binary Nothing AST.EqualTo (AST.Var Nothing varName) (AST.BooleanLiteral Nothing True)) (AST.Block Nothing done) Nothing]
286+ literalToBinderIL varName done (BooleanLiteral False) =
287+ return [AST.IfElse Nothing (AST.Binary Nothing AST.EqualTo (AST.Var Nothing varName) (AST.BooleanLiteral Nothing False)) (AST.Block Nothing done) Nothing]
288+ -- return [AST.IfElse Nothing (AST.Unary Nothing AST.Not (AST.Var Nothing varName)) (AST.Block Nothing done) Nothing]
289+ literalToBinderIL varName done (ObjectLiteral bs) = go done bs
290+ where
291+ go :: [AST] -> [(PSString, Binder Ann)] -> m [AST]
292+ go done' [] = return done'
293+ go done' ((prop, binder):bs') = do
294+ propVar <- freshName'
295+ done'' <- go done' bs'
296+ il <- binderToIL propVar done'' binder
297+ return (AST.VariableIntroduction Nothing propVar (Just (accessorString prop (AST.Var Nothing varName))) : il)
298+ literalToBinderIL varName done (ArrayLiteral bs) = do
299+ il <- go done 0 bs
300+ return [AST.IfElse Nothing (AST.Binary Nothing AST.EqualTo
301+ (arrayLength $ AST.Var Nothing varName)
302+ (AST.NumericLiteral Nothing (Left (fromIntegral $ length bs))))
303+ (AST.Block Nothing il) Nothing]
304+ where
305+ go :: [AST] -> Integer -> [Binder Ann] -> m [AST]
306+ go done' _ [] = return done'
307+ go done' index (binder:bs') = do
308+ elVar <- freshName'
309+ done'' <- go done' (index + 1) bs'
310+ il <- binderToIL elVar done'' binder
311+ return (AST.VariableIntroduction Nothing elVar (Just (AST.Indexer Nothing (AST.NumericLiteral Nothing (Left index)) (AST.Var Nothing varName))) : il)
312+
313+emptyAnn :: Ann
314+emptyAnn = (SourceSpan "" (SourcePos 0 0) (SourcePos 0 0), [], Nothing, Nothing)
315+
316+arrayLength :: AST -> AST
317+arrayLength a = AST.App Nothing (AST.Var Nothing arrayLengthFn) [a]
318+-- arrayLength a = AST.Var Nothing (arrayLengthFn <> "(" <> prettyPrintIL1 a <> ")")
319+
320+copyDict :: AST -> AST
321+copyDict a = AST.App Nothing (AST.Var Nothing copyDictFn) [a]
src/CodeGen/IL/Common.hsnew file+196
@@ -0,0 +1,196 @@
1+-- | Common code generation utility functions
2+module CodeGen.IL.Common where
3+
4+import Prelude.Compat
5+
6+import Control.Monad.Supply.Class (MonadSupply, freshName)
7+import Data.Char
8+import Data.Maybe (maybe)
9+import Data.Monoid ((<>))
10+import Data.Text (Text)
11+import qualified Data.Text as T
12+
13+import Language.PureScript.Crash
14+import Language.PureScript.Names
15+
16+import qualified Language.PureScript.Constants as C
17+
18+moduleNameToIL :: ModuleName -> Text
19+moduleNameToIL (ModuleName mn) =
20+ let name = T.replace "." "_" mn
21+ in if nameIsILBuiltIn name then (name <> moduleRenamerMarker) else name
22+
23+moduleNameToIL' :: ModuleName -> Text
24+moduleNameToIL' (ModuleName mn) = T.replace "_" "." mn
25+
26+-- | Convert an 'Ident' into a valid IL identifier:
27+--
28+-- * Alphanumeric characters are kept unmodified.
29+--
30+-- * Reserved IL identifiers are wrapped with '_'.
31+--
32+identToIL :: Ident -> Text
33+identToIL UnusedIdent = unusedName
34+identToIL (Ident "$__unused") = unusedName
35+identToIL (Ident name) | name == C.undefined = undefinedName -- Note: done in Printer.hs too
36+identToIL (Ident name) = properToIL name
37+identToIL (GenIdent _ _) = internalError "GenIdent in identToIL"
38+
39+moduleIdentToIL :: Ident -> Text
40+moduleIdentToIL UnusedIdent = unusedName
41+moduleIdentToIL (Ident name) | name == C.undefined = undefinedName
42+moduleIdentToIL (Ident name) = moduleProperToIL name
43+moduleIdentToIL (GenIdent _ _) = internalError "GenIdent in identToIL"
44+
45+undefinedName :: Text
46+undefinedName = "Undefined"
47+
48+unusedName :: Text
49+unusedName = "_"
50+
51+properToIL :: Text -> Text
52+properToIL name
53+ | nameIsILReserved name = "ˉ" <> name
54+ | otherwise = T.concatMap identCharToText name
55+
56+-- | Attempts to find a human-readable name for a symbol, if none has been specified returns the
57+-- ordinal value.
58+identCharToText :: Char -> Text
59+identCharToText 'ṩ' = "_ṩ"
60+identCharToText c | isAlphaNum c = T.singleton c
61+identCharToText '_' = "_"
62+identCharToText '\'' = "ꞌ" -- lowercase saltillo
63+identCharToText c = error (show (ord c)) -- TODO: should never occur now(?)
64+
65+moduleProperToIL :: Text -> Text
66+moduleProperToIL = T.concatMap identCharToText
67+
68+-- | Checks whether an identifier name is reserved in IL.
69+nameIsILReserved :: Text -> Bool
70+nameIsILReserved name =
71+ name `elem` ilAnyReserved
72+
73+-- | Checks whether a name matches a built-in value in IL.
74+nameIsILBuiltIn :: Text -> Bool
75+nameIsILBuiltIn name =
76+ name `elem`
77+ [ "Any"
78+ , "Apply"
79+ , "Contains"
80+ , "CopyDict"
81+ , "Dict"
82+ , "EffFn"
83+ , "Fn"
84+ , "Foreign"
85+ , "Get"
86+ , "Index"
87+ , "Is"
88+ , "Length"
89+ , "Once"
90+ , "Run"
91+ , "Undefined"
92+ ]
93+
94+ilAnyReserved :: [Text]
95+ilAnyReserved =
96+ concat
97+ [ ilKeywords
98+ , ilLiterals
99+ ]
100+
101+ilKeywords :: [Text]
102+ilKeywords =
103+ [ "break"
104+ , "case"
105+ , "chan"
106+ , "const"
107+ , "continue"
108+ , "default"
109+ , "defer"
110+ , "else"
111+ , "fallthrough"
112+ , "for"
113+ , "func"
114+ , "go"
115+ , "goto"
116+ , "if"
117+ , "import"
118+ , "interface"
119+ , "map"
120+ , "package"
121+ , "range"
122+ , "return"
123+ , "select"
124+ , "struct"
125+ , "switch"
126+ , "type"
127+ , "var"
128+ ]
129+
130+ilLiterals :: [Text]
131+ilLiterals =
132+ [ "init"
133+ , "nil"
134+ , "int"
135+ , "int8"
136+ , "int16"
137+ , "int32"
138+ , "int64"
139+ , "uint"
140+ , "uint8"
141+ , "uint16"
142+ , "uint32"
143+ , "uint64"
144+ , "uintptr"
145+ , "float32"
146+ , "float64"
147+ , "complex64"
148+ , "complex128"
149+ , "byte"
150+ , "rune"
151+ , "string"
152+ ]
153+
154+withPrefix :: Text -> Text
155+withPrefix s = "Ꞌ" <> s -- uppercase saltillo
156+
157+anyType :: Text
158+anyType = "Any"
159+
160+dictType :: Text
161+dictType = "Dict"
162+
163+arrayType :: Text
164+arrayType = "[]" <> anyType
165+
166+uncurriedFnType :: Int -> Text
167+uncurriedFnType i = "Fn" <> (T.pack . show $ i)
168+
169+int :: Text
170+int = "int"
171+
172+float :: Text
173+float = "float64"
174+
175+bool :: Text
176+bool = "bool"
177+
178+string :: Text
179+string = "string"
180+
181+arrayLengthFn :: Text
182+arrayLengthFn = "Length"
183+
184+indexFn :: Text
185+indexFn = "Index"
186+
187+copyDictFn :: Text
188+copyDictFn = "CopyDict"
189+
190+freshName' :: MonadSupply m => m Text
191+freshName' = do
192+ name <- freshName
193+ return $ T.replace "$" "ṩ" name
194+
195+moduleRenamerMarker :: Text
196+moduleRenamerMarker = "__"
src/CodeGen/IL/Optimizer.hsnew file+81
@@ -0,0 +1,81 @@
1+-- | This module optimizes code in the intermediate representation.
2+module CodeGen.IL.Optimizer (optimize) where
3+
4+import Prelude.Compat
5+
6+import Control.Monad.Supply.Class (MonadSupply)
7+import Data.Text (Text)
8+import Language.PureScript.CoreImp.AST
9+import Language.PureScript.CoreImp.Optimizer.Blocks
10+import Language.PureScript.CoreImp.Optimizer.Common hiding (isDict)
11+import Language.PureScript.CoreImp.Optimizer.Inliner (etaConvert, evaluateIifes, inlineVariables, unThunk)
12+import Language.PureScript.CoreImp.Optimizer.Unused
13+
14+import CodeGen.IL.Common (unusedName)
15+import CodeGen.IL.Optimizer.Inliner
16+import CodeGen.IL.Optimizer.MagicDo
17+import CodeGen.IL.Optimizer.TCO
18+
19+import qualified Language.PureScript.Constants as C
20+
21+-- | Apply a series of optimizer passes to simplified IL code
22+optimize :: MonadSupply m => AST -> AST -> m AST
23+optimize mn il = do
24+ il' <- untilFixedPoint (inlineFnComposition . inlineUnsafeCoerce . inlineUnsafePartial . tidyUp) il
25+ il'' <- untilFixedPoint (return . ignoreUnusedResults . inlineCommonValues . inlineCommonOperators . tidyUp) . tco mn . inlineST
26+ =<< untilFixedPoint (return . magicDoST)
27+ =<< untilFixedPoint (return . magicDoEff)
28+ =<< untilFixedPoint (return . magicDoEffect) il'
29+ untilFixedPoint (return . collapseVarDeclarations) il''
30+ where
31+ tidyUp :: AST -> AST
32+ tidyUp = applyAll
33+ [ collapseNestedBlocks
34+ , collapseNestedIfs
35+ , collapseIfChecks
36+ , removeCodeAfterReturnStatements
37+ , unThunk
38+ , etaConvert
39+ , evaluateIifes
40+ , inlineVariables
41+ ]
42+
43+untilFixedPoint :: (Monad m, Eq a) => (a -> m a) -> a -> m a
44+untilFixedPoint f = go
45+ where
46+ go a = do
47+ a' <- f a
48+ if a' == a then return a' else go a'
49+
50+collapseIfChecks :: AST -> AST
51+collapseIfChecks = everywhere collapse where
52+ collapse :: AST -> AST
53+ collapse (IfElse _ (Binary _ EqualTo (BooleanLiteral _ True) (BooleanLiteral _ True)) (Block _ [exprs]) _) = exprs
54+ collapse (IfElse _ (Binary _ EqualTo (Indexer _ (Var _ prop) (Var _ val)) (BooleanLiteral _ True)) (Block _ [exprs]) _)
55+ | prop == "otherwise" && val == "Data_Boolean" = exprs
56+ collapse exprs = exprs
57+
58+collapseVarDeclarations :: AST -> AST
59+collapseVarDeclarations = everywhere collapse where
60+ collapse :: AST -> AST
61+ collapse (Block ss sts) = Block ss (go Nothing sts)
62+ collapse s = s
63+
64+ go :: Maybe Text -> [AST] -> [AST]
65+ go _ [] = []
66+ go Nothing (decl@(VariableIntroduction _ var (Just _)) : sts) = decl : go (Just var) (go Nothing sts)
67+ go (Just var') ((VariableIntroduction ss var (Just val)) : sts)
68+ | var == var' = (Assignment ss (Var Nothing var) val) : go (Just var') sts
69+ go var' (s:sts) = s : go var' sts
70+
71+ignoreUnusedResults :: AST -> AST
72+ignoreUnusedResults = everywhere $ removeFromBlock go
73+ where
74+ go :: [AST] -> [AST]
75+ go [] = []
76+ go (VariableIntroduction ss var (Just s) : sts)
77+ | not $ any (everything (||) (isUsed var)) sts = sts'
78+ where
79+ sts' | App{} <- s = s : (go sts)
80+ | otherwise = go sts
81+ go (s:sts) = s : go sts
src/CodeGen/IL/Optimizer/Common.hsnew file+18
@@ -0,0 +1,18 @@
1+-- | Common functions used by the various optimizer phases
2+module CodeGen.IL.Optimizer.Common where
3+
4+import Prelude.Compat
5+
6+import Data.Text (Text)
7+
8+import Language.PureScript.CoreImp.AST
9+import Language.PureScript.PSString (PSString, decodeString)
10+
11+isDict :: (Text, PSString) -> AST -> Bool
12+isDict (moduleName, dictName) (Indexer _ (Var _ x) (Var _ y)) =
13+ Just x == decodeString dictName && y == moduleName
14+isDict _ _ = False
15+
16+isDict' :: [(Text, PSString)] -> AST -> Bool
17+isDict' xs il = any (`isDict` il) xs
18+
src/CodeGen/IL/Optimizer/Inliner.hsnew file+435
@@ -0,0 +1,435 @@
1+-- | This module performs basic inlining of known functions
2+module CodeGen.IL.Optimizer.Inliner
3+ ( inlineCommonValues
4+ , inlineCommonOperators
5+ , inlineFnComposition
6+ , inlineUnsafeCoerce
7+ , inlineUnsafePartial
8+ ) where
9+
10+import Prelude.Compat
11+
12+import Control.Monad.Supply.Class (MonadSupply)
13+
14+import Data.Either (rights)
15+import Data.Maybe (fromMaybe)
16+import Data.String (IsString, fromString)
17+import Data.Text (Text)
18+import qualified Data.Text as T
19+
20+import Language.PureScript.PSString (PSString, decodeString, mkString)
21+import Language.PureScript.CoreImp.AST
22+import Language.PureScript.CoreImp.Optimizer.Common hiding (isDict, isDict')
23+import Language.PureScript.AST (SourceSpan(..))
24+import qualified Language.PureScript.Constants as C
25+
26+import CodeGen.IL.Common
27+import CodeGen.IL.Optimizer.Common
28+
29+-- TODO: Potential bug:
30+-- Shouldn't just inline this case: { var x = 0; x.toFixed(10); }
31+-- Needs to be: { 0..toFixed(10); }
32+-- Probably needs to be fixed in pretty-printer instead.
33+shouldInline :: AST -> Bool
34+shouldInline (Var _ _) = True
35+shouldInline (NumericLiteral _ _) = True
36+shouldInline (StringLiteral _ _) = True
37+shouldInline (BooleanLiteral _ _) = True
38+shouldInline (Indexer _ index val) = shouldInline index && shouldInline val
39+shouldInline _ = False
40+
41+inlineCommonValues :: AST -> AST
42+inlineCommonValues = everywhere convert
43+ where
44+ convert :: AST -> AST
45+ convert (App ss fn [dict])
46+ | isDict' [semiringNumber, semiringInt] dict && isDict fnZero fn = NumericLiteral ss (Left 0)
47+ | isDict' [semiringNumber, semiringInt] dict && isDict fnOne fn = NumericLiteral ss (Left 1)
48+ | isDict boundedBoolean dict && isDict fnBottom fn = BooleanLiteral ss False
49+ | isDict boundedBoolean dict && isDict fnTop fn = BooleanLiteral ss True
50+ convert (App ss (App _ fn [dict]) [x])
51+ | isDict ringInt dict && isDict fnNegate fn = Unary ss Negate (unbox x $ snd ringInt)
52+ convert (App ss (App _ (App _ fn [dict]) [x]) [y])
53+ | isDict semiringInt dict && isDict fnAdd fn = intOp ss Add semiringInt x y
54+ | isDict semiringInt dict && isDict fnMultiply fn = intOp ss Multiply semiringInt x y
55+ | isDict ringInt dict && isDict fnSubtract fn = intOp ss Subtract ringInt x y
56+ convert other = other
57+ fnZero = (C.dataSemiring, C.zero)
58+ fnOne = (C.dataSemiring, C.one)
59+ fnBottom = (C.dataBounded, C.bottom)
60+ fnTop = (C.dataBounded, C.top)
61+ fnAdd = (C.dataSemiring, C.add)
62+ fnMultiply = (C.dataSemiring, C.mul)
63+ fnSubtract = (C.dataRing, C.sub)
64+ fnNegate = (C.dataRing, C.negate)
65+ intOp ss op (_, d) x y = Binary ss op (unbox x d) (unbox y d)
66+
67+inlineCommonOperators :: AST -> AST
68+inlineCommonOperators = everywhereTopDown $ applyAll $
69+ [ binary semiringNumber opAdd Add
70+ , binary semiringNumber opMul Multiply
71+
72+ , binary ringNumber opSub Subtract
73+ , unary ringNumber opNegate Negate
74+
75+ , binary euclideanRingNumber opDiv Divide
76+
77+ -- , binary eqNumber opEq EqualTo
78+ -- , binary eqNumber opNotEq NotEqualTo
79+ , binary eqInt opEq EqualTo
80+ , binary eqInt opNotEq NotEqualTo
81+ , binary eqString opEq EqualTo
82+ , binary eqString opNotEq NotEqualTo
83+ , binary eqChar opEq EqualTo
84+ , binary eqChar opNotEq NotEqualTo
85+ , binary eqBoolean opEq EqualTo
86+ , binary eqBoolean opNotEq NotEqualTo
87+
88+ , binary ordBoolean opLessThan LessThan
89+ , binary ordBoolean opLessThanOrEq LessThanOrEqualTo
90+ , binary ordBoolean opGreaterThan GreaterThan
91+ , binary ordBoolean opGreaterThanOrEq GreaterThanOrEqualTo
92+ , binary ordChar opLessThan LessThan
93+ , binary ordChar opLessThanOrEq LessThanOrEqualTo
94+ , binary ordChar opGreaterThan GreaterThan
95+ , binary ordChar opGreaterThanOrEq GreaterThanOrEqualTo
96+ , binary ordInt opLessThan LessThan
97+ , binary ordInt opLessThanOrEq LessThanOrEqualTo
98+ , binary ordInt opGreaterThan GreaterThan
99+ , binary ordInt opGreaterThanOrEq GreaterThanOrEqualTo
100+ , binary ordNumber opLessThan LessThan
101+ , binary ordNumber opLessThanOrEq LessThanOrEqualTo
102+ , binary ordNumber opGreaterThan GreaterThan
103+ , binary ordNumber opGreaterThanOrEq GreaterThanOrEqualTo
104+ , binary ordString opLessThan LessThan
105+ , binary ordString opLessThanOrEq LessThanOrEqualTo
106+ , binary ordString opGreaterThan GreaterThan
107+ , binary ordString opGreaterThanOrEq GreaterThanOrEqualTo
108+
109+ , binary semigroupString opAppend Add
110+
111+ , binary heytingAlgebraBoolean opConj And
112+ , binary heytingAlgebraBoolean opDisj Or
113+ , unary heytingAlgebraBoolean opNot Not
114+
115+ , binary' C.dataIntBits C.or BitwiseOr
116+ , binary' C.dataIntBits C.and BitwiseAnd
117+ , binary' C.dataIntBits C.xor BitwiseXor
118+ , binary' C.dataIntBits C.shl ShiftLeft
119+ , binary' C.dataIntBits C.shr ShiftRight
120+ , unary' C.dataIntBits C.complement BitwiseNot
121+
122+ , inlineNonClassFunction (isModFn (C.dataFunction, C.apply)) $ \f x -> App Nothing f [x]
123+ , inlineNonClassFunction (isModFn (C.dataFunction, C.applyFlipped)) $ \x f -> App Nothing f [x]
124+ , inlineUnsafeIndex (isModFnWithDict (C.dataArray, C.unsafeIndex)) $ flip (Indexer Nothing)
125+ ] ++
126+ [ fn | i <- [0..10], fn <- [ mkFn i, runFn i ] ] ++
127+ [ fn | i <- [0..10], fn <- [ mkEffFn C.controlMonadEffUncurried C.mkEffFn i, runEffFn C.controlMonadEffUncurried C.runEffFn i ] ] ++
128+ [ fn | i <- [0..10], fn <- [ mkEffFn C.effectUncurried C.mkEffectFn i, runEffFn C.effectUncurried C.runEffectFn i ] ]
129+ where
130+ binary :: (Text, PSString) -> (Text, PSString) -> BinaryOperator -> AST -> AST
131+ binary dict@(_, d) fns op = convert where
132+ convert :: AST -> AST
133+ convert (App ss (App _ (App _ fn [dict']) [x]) [y])
134+ | isDict dict dict' && isDict fns fn = Binary ss op (unbox x d) (unbox y d)
135+ convert other = other
136+ binary' :: Text -> PSString -> BinaryOperator -> AST -> AST
137+ binary' moduleName opString op = convert where
138+ convert :: AST -> AST
139+ convert (App ss (App _ fn [x]) [y]) | isDict (moduleName, opString) fn = Binary ss op (unbox x mn) (unbox y mn)
140+ convert other = other
141+ mn :: PSString
142+ mn = mkString moduleName
143+ unary :: (Text, PSString) -> (Text, PSString) -> UnaryOperator -> AST -> AST
144+ unary dicts@(_, d) fns op = convert where
145+ convert :: AST -> AST
146+ convert (App ss (App _ fn [dict']) [x]) | isDict dicts dict' && isDict fns fn = Unary ss op (unbox x d)
147+ convert other = other
148+ unary' :: Text -> PSString -> UnaryOperator -> AST -> AST
149+ unary' moduleName fnName op = convert where
150+ convert :: AST -> AST
151+ convert (App ss fn [x]) | isDict (moduleName, fnName) fn = Unary ss op (unbox x fnName)
152+ convert other = other
153+
154+ mkFn :: Int -> AST -> AST
155+ mkFn = mkFn' C.dataFunctionUncurried C.mkFn $ \ss1 ss2 ss3 args il ->
156+ Function ss1 Nothing args (Block ss2 [Return ss3 il])
157+
158+ mkEffFn :: Text -> Text -> Int -> AST -> AST
159+ mkEffFn modName fnName = mkFn' modName fnName $ \ss1 ss2 ss3 args il ->
160+ Function ss1 Nothing args (Block ss2 [Return ss3 (App ss3 il [])])
161+
162+ mkFn' :: Text -> Text -> (Maybe SourceSpan -> Maybe SourceSpan -> Maybe SourceSpan -> [Text] -> AST -> AST) -> Int -> AST -> AST
163+ mkFn' modName fnName res 0 = convert where
164+ convert :: AST -> AST
165+ convert (App _ mkFnN [Function s1 Nothing [_] (Block s2 [Return s3 il])]) | isNFn modName fnName 0 mkFnN =
166+ res s1 s2 s3 [] il
167+ convert other = other
168+ mkFn' modName fnName res n = convert where
169+ convert :: AST -> AST
170+ convert orig@(App ss mkFnN [fn]) | isNFn modName fnName n mkFnN =
171+ case collectArgs n [] fn of
172+ Just (args, [Return ss' ret]) -> res ss ss ss' args ret
173+ _ -> orig
174+ convert other = other
175+ collectArgs :: Int -> [Text] -> AST -> Maybe ([Text], [AST])
176+ collectArgs 1 acc (Function _ Nothing [oneArg] (Block _ il)) | length acc == n - 1 = Just (reverse (oneArg : acc), il)
177+ collectArgs m acc (Function _ Nothing [oneArg] (Block _ [Return _ ret])) = collectArgs (m - 1) (oneArg : acc) ret
178+ collectArgs _ _ _ = Nothing
179+
180+ isNFn :: Text -> Text -> Int -> AST -> Bool
181+ isNFn expectMod prefix n (Indexer _ (Var _ name) (Var _ modName)) | modName == expectMod =
182+ name == fromString (T.unpack prefix <> show n)
183+ isNFn _ _ _ _ = False
184+
185+ runFn :: Int -> AST -> AST
186+ runFn = runFn' C.dataFunctionUncurried C.runFn (\ss f args ->
187+ let len = length args
188+ typ = mkString $ uncurriedFnType len in
189+ if len > 0
190+ then App ss (App Nothing (StringLiteral Nothing typ) [f]) args
191+ else App ss f args)
192+ runEffFn :: Text -> Text -> Int -> AST -> AST
193+ runEffFn modName fnName = runFn' modName fnName $ \ss fn acc ->
194+ let typ = mkString . uncurriedFnType $ length acc in
195+ Function ss Nothing [] (Block ss [Return ss (App ss (App Nothing (StringLiteral Nothing typ) [fn]) acc)])
196+
197+ runFn' :: Text -> Text -> (Maybe SourceSpan -> AST -> [AST] -> AST) -> Int -> AST -> AST
198+ runFn' modName runFnName res n = convert where
199+ convert :: AST -> AST
200+ convert il = fromMaybe il $ go n [] il
201+
202+ go :: Int -> [AST] -> AST -> Maybe AST
203+ go 0 acc (App ss runFnN [fn]) | isNFn modName runFnName n runFnN && length acc == n =
204+ Just $ res ss fn acc
205+ go m acc (App _ lhs [arg]) = go (m - 1) (arg : acc) lhs
206+ go _ _ _ = Nothing
207+
208+ inlineNonClassFunction :: (AST -> Bool) -> (AST -> AST -> AST) -> AST -> AST
209+ inlineNonClassFunction p f = convert where
210+ convert :: AST -> AST
211+ convert (App _ (App _ op' [x]) [y]) | p op' = f x y
212+ convert other = other
213+
214+ inlineUnsafeIndex :: (AST -> Bool) -> (AST -> AST -> AST) -> AST -> AST
215+ inlineUnsafeIndex p _ = convert where
216+ convert :: AST -> AST
217+ convert (App _ (App ss op' [x]) [y@NumericLiteral{}])
218+ | p op' = Indexer ss y x
219+ convert (App _ (App ss op' [x]) [y])
220+ | p op' = App ss (Var Nothing indexFn) [x, y]
221+ convert other = other
222+
223+ isModFn :: (Text, PSString) -> AST -> Bool
224+ isModFn (m, op) (Indexer _ (Var _ op') (Var _ m')) =
225+ m == m' && decodeString op == Just op'
226+ isModFn _ _ = False
227+
228+ isModFnWithDict :: (Text, PSString) -> AST -> Bool
229+ isModFnWithDict (m, op) (App _ (Indexer _ (Var _ op') (Var _ m')) [Var _ _]) =
230+ m == m' && decodeString op == Just op'
231+ isModFnWithDict _ _ = False
232+
233+-- (f <<< g $ x) = f (g x)
234+-- (f <<< g) = \x -> f (g x)
235+inlineFnComposition :: forall m. MonadSupply m => AST -> m AST
236+inlineFnComposition = everywhereTopDownM convert where
237+ convert :: AST -> m AST
238+ convert (App s1 (App s2 (App _ (App _ fn [dict']) [x]) [y]) [z])
239+ | isFnCompose dict' fn = return $ App s1 x [App s2 y [z]]
240+ | isFnComposeFlipped dict' fn = return $ App s2 y [App s1 x [z]]
241+ convert app@(App ss (App _ (App _ fn [dict']) _) _)
242+ | isFnCompose dict' fn || isFnComposeFlipped dict' fn = mkApps ss <$> goApps app <*> freshName'
243+ convert other = return other
244+
245+ mkApps :: Maybe SourceSpan -> [Either AST (Text, AST)] -> Text -> AST
246+ mkApps ss fns a = App ss (Function ss Nothing [] (Block ss $ vars <> [Return Nothing comp])) []
247+ where
248+ vars = uncurry (VariableIntroduction ss) . fmap Just <$> rights fns
249+ comp = Function ss Nothing [a] (Block ss [Return Nothing apps])
250+ apps = foldr (\fn acc -> App ss (mkApp fn) [acc]) (Var ss a) fns
251+
252+ mkApp :: Either AST (Text, AST) -> AST
253+ mkApp = either id $ \(name, arg) -> Var (getSourceSpan arg) name
254+
255+ goApps :: AST -> m [Either AST (Text, AST)]
256+ goApps (App _ (App _ (App _ fn [dict']) [x]) [y])
257+ | isFnCompose dict' fn = mappend <$> goApps x <*> goApps y
258+ | isFnComposeFlipped dict' fn = mappend <$> goApps y <*> goApps x
259+ goApps app@(App {}) = pure . Right . (,app) <$> freshName'
260+ goApps other = pure [Left other]
261+
262+ isFnCompose :: AST -> AST -> Bool
263+ isFnCompose dict' fn = isDict semigroupoidFn dict' && isDict fnCompose fn
264+
265+ isFnComposeFlipped :: AST -> AST -> Bool
266+ isFnComposeFlipped dict' fn = isDict semigroupoidFn dict' && isDict fnComposeFlipped fn
267+
268+ fnCompose :: forall a b. (IsString a, IsString b) => (a, b)
269+ fnCompose = (C.controlSemigroupoid, C.compose)
270+
271+ fnComposeFlipped :: forall a b. (IsString a, IsString b) => (a, b)
272+ fnComposeFlipped = (C.controlSemigroupoid, C.composeFlipped)
273+
274+inlineUnsafeCoerce :: AST -> AST
275+inlineUnsafeCoerce = everywhereTopDown convert where
276+ convert (App _ (Indexer _ (Var _ unsafeCoerceFn) (Var _ unsafeCoerce)) [ comp ])
277+ | unsafeCoerceFn == C.unsafeCoerceFn && unsafeCoerce == C.unsafeCoerce
278+ = comp
279+ convert other = other
280+
281+inlineUnsafePartial :: AST -> AST
282+inlineUnsafePartial = everywhereTopDown convert where
283+ convert (App ss fn [ comp ])
284+ | isDict fnUnsafePartial fn
285+ = App ss comp []
286+ where
287+ fnUnsafePartial :: forall a b. (IsString a, IsString b) => (a, b)
288+ fnUnsafePartial = (C.partialUnsafe, C.unsafePartial)
289+ convert other = other
290+
291+semiringNumber :: forall a b. (IsString a, IsString b) => (a, b)
292+semiringNumber = (C.dataSemiring, C.semiringNumber)
293+
294+semiringInt :: forall a b. (IsString a, IsString b) => (a, b)
295+semiringInt = (C.dataSemiring, C.semiringInt)
296+
297+ringNumber :: forall a b. (IsString a, IsString b) => (a, b)
298+ringNumber = (C.dataRing, C.ringNumber)
299+
300+ringInt :: forall a b. (IsString a, IsString b) => (a, b)
301+ringInt = (C.dataRing, C.ringInt)
302+
303+euclideanRingNumber :: forall a b. (IsString a, IsString b) => (a, b)
304+euclideanRingNumber = (C.dataEuclideanRing, C.euclideanRingNumber)
305+
306+-- eqNumber :: forall a b. (IsString a, IsString b) => (a, b)
307+-- eqNumber = (C.dataEq, C.eqNumber)
308+
309+eqInt :: forall a b. (IsString a, IsString b) => (a, b)
310+eqInt = (C.dataEq, C.eqInt)
311+
312+eqString :: forall a b. (IsString a, IsString b) => (a, b)
313+eqString = (C.dataEq, C.eqString)
314+
315+eqChar :: forall a b. (IsString a, IsString b) => (a, b)
316+eqChar = (C.dataEq, C.eqChar)
317+
318+eqBoolean :: forall a b. (IsString a, IsString b) => (a, b)
319+eqBoolean = (C.dataEq, C.eqBoolean)
320+
321+ordBoolean :: forall a b. (IsString a, IsString b) => (a, b)
322+ordBoolean = (C.dataOrd, C.ordBoolean)
323+
324+ordNumber :: forall a b. (IsString a, IsString b) => (a, b)
325+ordNumber = (C.dataOrd, C.ordNumber)
326+
327+ordInt :: forall a b. (IsString a, IsString b) => (a, b)
328+ordInt = (C.dataOrd, C.ordInt)
329+
330+ordString :: forall a b. (IsString a, IsString b) => (a, b)
331+ordString = (C.dataOrd, C.ordString)
332+
333+ordChar :: forall a b. (IsString a, IsString b) => (a, b)
334+ordChar = (C.dataOrd, C.ordChar)
335+
336+semigroupString :: forall a b. (IsString a, IsString b) => (a, b)
337+semigroupString = (C.dataSemigroup, C.semigroupString)
338+
339+boundedBoolean :: forall a b. (IsString a, IsString b) => (a, b)
340+boundedBoolean = (C.dataBounded, C.boundedBoolean)
341+
342+heytingAlgebraBoolean :: forall a b. (IsString a, IsString b) => (a, b)
343+heytingAlgebraBoolean = (C.dataHeytingAlgebra, C.heytingAlgebraBoolean)
344+
345+semigroupoidFn :: forall a b. (IsString a, IsString b) => (a, b)
346+semigroupoidFn = (C.controlSemigroupoid, C.semigroupoidFn)
347+
348+opAdd :: forall a b. (IsString a, IsString b) => (a, b)
349+opAdd = (C.dataSemiring, C.add)
350+
351+opMul :: forall a b. (IsString a, IsString b) => (a, b)
352+opMul = (C.dataSemiring, C.mul)
353+
354+opEq :: forall a b. (IsString a, IsString b) => (a, b)
355+opEq = (C.dataEq, C.eq)
356+
357+opNotEq :: forall a b. (IsString a, IsString b) => (a, b)
358+opNotEq = (C.dataEq, C.notEq)
359+
360+opLessThan :: forall a b. (IsString a, IsString b) => (a, b)
361+opLessThan = (C.dataOrd, C.lessThan)
362+
363+opLessThanOrEq :: forall a b. (IsString a, IsString b) => (a, b)
364+opLessThanOrEq = (C.dataOrd, C.lessThanOrEq)
365+
366+opGreaterThan :: forall a b. (IsString a, IsString b) => (a, b)
367+opGreaterThan = (C.dataOrd, C.greaterThan)
368+
369+opGreaterThanOrEq :: forall a b. (IsString a, IsString b) => (a, b)
370+opGreaterThanOrEq = (C.dataOrd, C.greaterThanOrEq)
371+
372+opAppend :: forall a b. (IsString a, IsString b) => (a, b)
373+opAppend = (C.dataSemigroup, C.append)
374+
375+opSub :: forall a b. (IsString a, IsString b) => (a, b)
376+opSub = (C.dataRing, C.sub)
377+
378+opNegate :: forall a b. (IsString a, IsString b) => (a, b)
379+opNegate = (C.dataRing, C.negate)
380+
381+opDiv :: forall a b. (IsString a, IsString b) => (a, b)
382+opDiv = (C.dataEuclideanRing, C.div)
383+
384+opConj :: forall a b. (IsString a, IsString b) => (a, b)
385+opConj = (C.dataHeytingAlgebra, C.conj)
386+
387+opDisj :: forall a b. (IsString a, IsString b) => (a, b)
388+opDisj = (C.dataHeytingAlgebra, C.disj)
389+
390+opNot :: forall a b. (IsString a, IsString b) => (a, b)
391+opNot = (C.dataHeytingAlgebra, C.not)
392+
393+unbox :: AST -> PSString -> AST
394+unbox e d = select . inlineCommonValues $ inlineCommonOperators e
395+ where
396+ select :: AST -> AST
397+ select e' =
398+ case e' of
399+ Var{} -> unbox' e'
400+ App{} -> unbox' e'
401+ Indexer{} -> unbox' e'
402+ _ -> e'
403+ unbox' :: AST -> AST
404+ unbox' e' = maybe e' (\t -> App Nothing (StringLiteral Nothing t) [e']) $ unboxType d
405+
406+unboxType :: PSString -> Maybe PSString
407+unboxType s = do
408+ t <- decodeString s
409+ t' <- unboxType' t
410+ return $ mkString t'
411+ where
412+ unboxType' :: Text -> Maybe Text
413+ unboxType' t
414+ | t == C.eqInt ||
415+ t == C.semiringInt ||
416+ t == C.ringInt ||
417+ t == C.ordInt ||
418+ t == C.dataIntBits
419+ = Just int
420+ | t == C.semiringNumber ||
421+ t == C.ringNumber ||
422+ t == C.ordNumber ||
423+ t == C.euclideanRingNumber
424+ = Just float
425+ | t == C.eqBoolean ||
426+ t == C.ordBoolean ||
427+ t == C.heytingAlgebraBoolean
428+ = Just bool
429+ | t == C.eqChar ||
430+ t == C.eqString ||
431+ t == C.ordChar ||
432+ t == C.ordString ||
433+ t == C.semigroupString
434+ = Just string
435+ | otherwise = Nothing
src/CodeGen/IL/Optimizer/MagicDo.hsnew file+146
@@ -0,0 +1,146 @@
1+-- | This module implements the "Magic Do" optimization, which inlines calls to return
2+-- and bind for the Eff monad, as well as some of its actions.
3+module CodeGen.IL.Optimizer.MagicDo (magicDoEffect, magicDoEff, magicDoST, inlineST) where
4+
5+import Prelude.Compat
6+import Protolude (ordNub)
7+
8+import Data.Maybe (fromJust, isJust)
9+import Data.Text (Text)
10+
11+import Language.PureScript.CoreImp.AST
12+import Language.PureScript.CoreImp.Optimizer.Common hiding (isDict)
13+import Language.PureScript.PSString (PSString, decodeString, mkString)
14+import qualified Language.PureScript.Constants as C
15+
16+import CodeGen.IL.Common (undefinedName, unusedName)
17+import CodeGen.IL.Optimizer.Common
18+
19+-- | Inline type class dictionaries for >>= and return for the Eff monad
20+--
21+-- E.g.
22+--
23+-- Prelude[">>="](dict)(m1)(function(x) {
24+-- return ...;
25+-- })
26+--
27+-- becomes
28+--
29+-- function __do {
30+-- var x = m1();
31+-- ...
32+-- }
33+magicDoEff :: AST -> AST
34+magicDoEff = magicDo C.eff C.effDictionaries
35+
36+magicDoEffect :: AST -> AST
37+magicDoEffect = magicDo C.effect C.effectDictionaries
38+
39+magicDoST :: AST -> AST
40+magicDoST = magicDo C.st C.stDictionaries
41+
42+magicDo :: Text -> C.EffectDictionaries -> AST -> AST
43+magicDo effectModule C.EffectDictionaries{..} = everywhereTopDown convert
44+ where
45+ -- Desugar monomorphic calls to >>= and return for the Eff monad
46+ convert :: AST -> AST
47+ -- Desugar pure
48+ convert (App _ (App _ pure' [val]) []) | isPure pure' = val
49+ -- Desugar discard
50+ convert (App _ (App _ bind [m]) [Function s1 Nothing [unused] (Block s2 il)]) | isDiscard bind && unused == unusedName =
51+ Function s1 Nothing [] $ Block s2 (App s2 m [] : map applyReturns il )
52+ -- Desugar bind
53+ convert (App _ (App _ bind [m]) [Function s1 Nothing [arg] (Block s2 il)]) | isBind bind =
54+ Function s1 Nothing [] $ Block s2 (VariableIntroduction s2 arg (Just (App s2 m [])) : map applyReturns il)
55+ -- Desugar untilE
56+ convert (App s1 (App _ f [arg]) []) | isEffFunc edUntil f =
57+ App s1 (Function s1 Nothing [] (Block s1 [ While s1 (Unary s1 Not (App s1 arg [])) (Block s1 []), Return s1 $ ObjectLiteral s1 []])) []
58+ -- Desugar whileE
59+ convert (App _ (App _ (App s1 f [arg1]) [arg2]) []) | isEffFunc edWhile f =
60+ App s1 (Function s1 Nothing [] (Block s1 [ While s1 (App s1 arg1 []) (Block s1 [ App s1 arg2 [] ]), Return s1 $ ObjectLiteral s1 []])) []
61+ -- -- Inline __do returns
62+ -- convert (Return _ (App _ (Function _ (Just ident) [] body) [])) | ident == fnName = body
63+ -- Inline double applications
64+ convert (App _ (App s1 (Function s2 Nothing [] (Block ss body)) []) []) =
65+ App s1 (Function s2 Nothing [] (Block ss (applyReturns `fmap` body))) []
66+ convert other = other
67+ -- Check if an expression represents a monomorphic call to >>= for the Eff monad
68+ isBind (App _ fn [dict]) | isDict (effectModule, edBindDict) dict && isBindPoly fn = True
69+ isBind _ = False
70+ -- Check if an expression represents a call to @discard@
71+ isDiscard (App _ (App _ fn [dict1]) [dict2])
72+ | isDict (C.controlBind, C.discardUnitDictionary) dict1 &&
73+ isDict (effectModule, edBindDict) dict2 &&
74+ isDiscardPoly fn = True
75+ isDiscard _ = False
76+
77+ -- Check if an expression represents a monomorphic call to pure or return for the Eff applicative
78+ isPure (App _ fn [dict]) | isDict (effectModule, edApplicativeDict) dict && isPurePoly fn = True
79+ isPure _ = False
80+ -- Check if an expression represents the polymorphic >>= function
81+ isBindPoly = isDict (C.controlBind, C.bind)
82+ -- Check if an expression represents the polymorphic pure function
83+ isPurePoly = isDict (C.controlApplicative, C.pure')
84+ -- Check if an expression represents the polymorphic discard function
85+ isDiscardPoly = isDict (C.controlBind, C.discard)
86+ -- Check if an expression represents a function in the Effect module
87+ isEffFunc name (Indexer _ (StringLiteral _ name') (Var _ eff)) = eff == effectModule && name == name'
88+ isEffFunc _ _ = False
89+
90+ applyReturns :: AST -> AST
91+ applyReturns (Return ss ret) = Return ss (App ss ret [])
92+ applyReturns (Block ss ils) = Block ss (map applyReturns ils)
93+ applyReturns (While ss cond il) = While ss cond (applyReturns il)
94+ applyReturns (For ss v lo hi il) = For ss v lo hi (applyReturns il)
95+ applyReturns (ForIn ss v xs il) = ForIn ss v xs (applyReturns il)
96+ applyReturns (IfElse ss cond t f) = IfElse ss cond (applyReturns t) (applyReturns `fmap` f)
97+ applyReturns other = other
98+
99+-- | Inline functions in the ST module
100+inlineST :: AST -> AST
101+inlineST = everywhere convertBlock
102+ where
103+ -- Look for runST blocks and inline the STRefs there.
104+ -- If all STRefs are used in the scope of the same runST, only using { read, write, modify }STRef then
105+ -- we can be more aggressive about inlining, and actually turn STRefs into local variables.
106+ convertBlock (App s1 f [arg]) | isSTFunc C.runST f =
107+ let refs = ordNub . findSTRefsIn $ arg
108+ usages = findAllSTUsagesIn arg
109+ allUsagesAreLocalVars = all (\u -> let v = toVar u in isJust v && fromJust v `elem` refs) usages
110+ localVarsDoNotEscape = all (\r -> length (r `appearingIn` arg) == length (filter (\u -> let v = toVar u in v == Just r) usages)) refs
111+ in App s1 (everywhere (convert (allUsagesAreLocalVars && localVarsDoNotEscape)) arg) []
112+ convertBlock other = other
113+ -- Convert a block in a safe way, preserving object wrappers of references,
114+ -- or in a more aggressive way, turning wrappers into local variables depending on the
115+ -- agg(ressive) parameter.
116+ convert agg (App s1 f [arg]) | isSTFunc C.newSTRef f =
117+ Function s1 Nothing [] (Block s1 [Return s1 $ if agg then arg else ObjectLiteral s1 [(mkString C.stRefValue, arg)]])
118+ convert agg (App _ (App s1 f [ref]) []) | isSTFunc C.readSTRef f =
119+ if agg then ref else Indexer s1 (StringLiteral s1 C.stRefValue) ref
120+ convert agg (App _ (App _ (App s1 f [arg]) [ref]) []) | isSTFunc C.writeSTRef f =
121+ if agg then Assignment s1 ref arg else Assignment s1 (Indexer s1 (StringLiteral s1 C.stRefValue) ref) arg
122+ convert agg (App _ (App _ (App s1 f [func]) [ref]) []) | isSTFunc C.modifySTRef f =
123+ if agg then Assignment s1 ref (App s1 func [ref]) else Assignment s1 (Indexer s1 (StringLiteral s1 C.stRefValue) ref) (App s1 func [Indexer s1 (StringLiteral s1 C.stRefValue) ref])
124+ convert _ other = other
125+ -- Check if an expression represents a function in the ST module
126+ isSTFunc name (Indexer _ (StringLiteral _ name') (Var _ st)) = st == C.st && name == name'
127+ isSTFunc _ _ = False
128+ -- Find all ST Refs initialized in this block
129+ findSTRefsIn = everything (++) isSTRef
130+ where
131+ isSTRef (VariableIntroduction _ ident (Just (App _ (App _ f [_]) []))) | isSTFunc C.newSTRef f = [ident]
132+ isSTRef _ = []
133+ -- Find all STRefs used as arguments to readSTRef, writeSTRef, modifySTRef
134+ findAllSTUsagesIn = everything (++) isSTUsage
135+ where
136+ isSTUsage (App _ (App _ f [ref]) []) | isSTFunc C.readSTRef f = [ref]
137+ isSTUsage (App _ (App _ (App _ f [_]) [ref]) []) | isSTFunc C.writeSTRef f || isSTFunc C.modifySTRef f = [ref]
138+ isSTUsage _ = []
139+ -- Find all uses of a variable
140+ appearingIn ref = everything (++) isVar
141+ where
142+ isVar e@(Var _ v) | v == ref = [e]
143+ isVar _ = []
144+ -- Convert a AST value to a String if it is a Var
145+ toVar (Var _ v) = Just v
146+ toVar _ = Nothing
src/CodeGen/IL/Optimizer/TCO.hsnew file+141
@@ -0,0 +1,141 @@
1+module CodeGen.IL.Optimizer.TCO (tco, tcoLoop) where
2+
3+import Prelude.Compat
4+
5+import Data.Text (Text)
6+import Data.Monoid ((<>))
7+import Language.PureScript.CoreImp.AST
8+import Language.PureScript.AST.SourcePos (SourceSpan)
9+import Safe (headDef, tailSafe)
10+import CodeGen.IL.Common
11+
12+import qualified Language.PureScript.Constants as C
13+
14+tcoLoop :: Text
15+tcoLoop = "ṩtco_loop"
16+
17+tco :: AST -> AST -> AST
18+tco mn = everywhere convert where
19+ tcoVar :: Text -> Text
20+ tcoVar arg = "ṩtco_var_" <> arg
21+
22+ copyVar :: Text -> Text
23+ copyVar arg = "ṩcopy_" <> arg
24+
25+ tcoDone :: Text
26+ tcoDone = "ṩtco_done"
27+
28+ tcoResult :: Text
29+ tcoResult = "ṩtco_result"
30+
31+ convert :: AST -> AST
32+ convert fn@(Function ss (Just name) args _)
33+ | isTailRecursive name body'
34+ = replace (toLoop name outerArgs innerArgs body')
35+ where
36+ innerArgs = headDef [] argss
37+ outerArgs = concat . reverse $ tailSafe argss
38+ (argss, body', replace) = collectAllFunctionArgs [] id fn
39+ convert (Assignment ss (Var _ name) fn@(Function _ Nothing _ _))
40+ | isTailRecursive name body'
41+ = Assignment ss (Var ss name) (replace (toLoop name outerArgs innerArgs body'))
42+ where
43+ innerArgs = headDef [] argss
44+ outerArgs = concat . reverse $ tailSafe argss
45+ (argss, body', replace) = collectAllFunctionArgs [] id fn
46+ convert js = js
47+
48+ collectAllFunctionArgs :: [[Text]] -> (AST -> AST) -> AST -> ([[Text]], AST, AST -> AST)
49+ collectAllFunctionArgs allArgs f (Function s1 ident args (Block s2 (body@(Return _ _):_))) =
50+ collectAllFunctionArgs (args : allArgs) (\b -> f (Function s1 ident (map copyVar args) (Block s2 [b]))) body
51+ collectAllFunctionArgs allArgs f (Function ss ident args body@(Block _ _)) =
52+ (args : allArgs, body, f . Function ss ident (map copyVar args))
53+ collectAllFunctionArgs allArgs f (Return s1 (Function s2 ident args (Block s3 [body]))) =
54+ collectAllFunctionArgs (args : allArgs) (\b -> f (Return s1 (Function s2 ident (map copyVar args) (Block s3 [b])))) body
55+ collectAllFunctionArgs allArgs f (Return s1 (Function s2 ident args body@(Block _ _))) =
56+ (args : allArgs, body, f . Return s1 . Function s2 ident (map copyVar args))
57+ collectAllFunctionArgs allArgs f body = (allArgs, body, f)
58+
59+ isTailRecursive :: Text -> AST -> Bool
60+ isTailRecursive ident js = countSelfReferences js > 0 && allInTailPosition js where
61+ countSelfReferences = everything (+) match where
62+ match :: AST -> Int
63+ match (Var _ ident') | ident == ident' = 1
64+ match _ = 0
65+
66+ allInTailPosition (Return _ expr)
67+ | isSelfCall ident expr = countSelfReferences expr == 1
68+ | otherwise = countSelfReferences expr == 0
69+ allInTailPosition (While _ js1 body)
70+ = countSelfReferences js1 == 0 && allInTailPosition body
71+ allInTailPosition (For _ _ js1 js2 body)
72+ = countSelfReferences js1 == 0 && countSelfReferences js2 == 0 && allInTailPosition body
73+ allInTailPosition (ForIn _ _ js1 body)
74+ = countSelfReferences js1 == 0 && allInTailPosition body
75+ allInTailPosition (IfElse _ js1 body el)
76+ = countSelfReferences js1 == 0 && allInTailPosition body && all allInTailPosition el
77+ allInTailPosition (Block _ body)
78+ = all allInTailPosition body
79+ allInTailPosition (Throw _ js1)
80+ = countSelfReferences js1 == 0
81+ allInTailPosition (ReturnNoResult _)
82+ = True
83+ allInTailPosition (VariableIntroduction _ _ js1)
84+ = all ((== 0) . countSelfReferences) js1
85+ allInTailPosition (Assignment _ _ js1)
86+ = countSelfReferences js1 == 0
87+ allInTailPosition (Comment _ _ js1)
88+ = allInTailPosition js1
89+ allInTailPosition _
90+ = False
91+
92+ toLoop :: Text -> [Text] -> [Text] -> AST -> AST
93+ toLoop ident outerArgs innerArgs js =
94+ Block rootSS $
95+ concatMap (\arg -> [ VariableIntroduction rootSS (tcoVar arg) . Just $
96+ Var rootSS (copyVar arg) ]) (outerArgs ++ innerArgs) ++
97+ [ Assignment rootSS (Var rootSS $ "var " <> tcoDone) $ BooleanLiteral Nothing False
98+ , VariableIntroduction rootSS tcoResult Nothing
99+ , Assignment rootSS (Var rootSS $ "var " <> tcoLoop) (Function rootSS (Just tcoLoop) (outerArgs ++ innerArgs) (Block rootSS [loopify js]))
100+ , While rootSS (Unary Nothing Not (Var rootSS tcoDone))
101+ (Block rootSS
102+ [(Assignment rootSS (Var rootSS tcoResult) (App rootSS (Var rootSS tcoLoop) ((map (Var rootSS . tcoVar) outerArgs) ++ (map (Var rootSS . copyVar) innerArgs))))])
103+ , Return rootSS (Var rootSS tcoResult)
104+ ]
105+ where
106+ rootSS = Nothing
107+
108+ loopify :: AST -> AST
109+ loopify (Return ss ret)
110+ | isSelfCall ident ret =
111+ let
112+ allArgumentValues = concat $ collectArgs [] ret
113+ in
114+ Block ss $
115+ zipWith (\val arg ->
116+ Assignment ss (Var ss (tcoVar arg)) val) allArgumentValues outerArgs
117+ ++ zipWith (\val arg ->
118+ Assignment ss (Var ss (copyVar arg)) val) (drop (length outerArgs) allArgumentValues) innerArgs
119+ ++ [ ReturnNoResult ss ]
120+ | otherwise = Block ss [ markDone ss, Return ss ret ]
121+ loopify (ReturnNoResult ss) = Block ss [ markDone ss, ReturnNoResult ss ]
122+ loopify (While ss cond body) = While ss cond (loopify body)
123+ loopify (For ss i js1 js2 body) = For ss i js1 js2 (loopify body)
124+ loopify (ForIn ss i js1 body) = ForIn ss i js1 (loopify body)
125+ loopify (IfElse ss cond body el) = IfElse ss cond (loopify body) (fmap loopify el)
126+ loopify (Block ss body) = Block ss (map loopify body)
127+ loopify other = other
128+
129+ markDone :: Maybe SourceSpan -> AST
130+ markDone ss = Assignment ss (Var ss tcoDone) (BooleanLiteral ss True)
131+
132+ collectArgs :: [[AST]] -> AST -> [[AST]]
133+ collectArgs acc (App _ fn args') = collectArgs (args' : acc) fn
134+ collectArgs acc _ = acc
135+
136+ isSelfCall :: Text -> AST -> Bool
137+ isSelfCall ident (App _ (Var _ ident') _) = ident == ident'
138+ isSelfCall ident (App _ (Indexer _ (Var _ ident') (Var _ mn')) _) = mn' == "" && ident == ident'
139+ isSelfCall ident (App _ (Indexer _ (Var _ ident') mn') _) = mn' == mn && ident == ident'
140+ isSelfCall ident (App _ fn _) = isSelfCall ident fn
141+ isSelfCall _ _ = False
src/CodeGen/IL/Printer.hsnew file+527
@@ -0,0 +1,527 @@
1+-- | Pretty printer for the AST
2+module CodeGen.IL.Printer
3+ ( prettyPrintIL
4+ , prettyPrintIL1
5+ , prettyPrintILWithSourceMaps
6+ , interfaceSource
7+ , implHeaderSource
8+ , implFooterSource
9+ , isLiteral
10+ , modLabel
11+ , modPrefix
12+ , ffiLoader
13+ ) where
14+
15+import Prelude.Compat
16+
17+import Control.Arrow ((<+>))
18+import Control.Monad (forM, mzero)
19+import Control.Monad.State (StateT, evalStateT)
20+import Control.PatternArrows
21+import Data.List (filter, (\\))
22+import qualified Control.Arrow as A
23+
24+import Data.Maybe (fromMaybe)
25+import Data.Monoid ((<>))
26+import Data.Text (Text)
27+import qualified Data.Text as T
28+
29+import Language.PureScript.AST (SourceSpan(..))
30+import Language.PureScript.CoreImp.AST
31+import Language.PureScript.Comments
32+import Language.PureScript.Crash
33+import Language.PureScript.Names (Ident, runIdent)
34+import Language.PureScript.Pretty.Common
35+import Language.PureScript.PSString (PSString, decodeString, mkString)
36+
37+import CodeGen.IL.Common
38+import CodeGen.IL.Optimizer.TCO (tcoLoop)
39+
40+import qualified Language.PureScript.Constants as C
41+
42+-- TODO (Christoph): Get rid of T.unpack / pack
43+
44+literals :: (Emit gen) => Pattern PrinterState AST gen
45+literals = mkPattern' match'
46+ where
47+ match' :: (Emit gen) => AST -> StateT PrinterState Maybe gen
48+ match' il = (addMapping' (getSourceSpan il) <>) <$> match il
49+
50+ match :: (Emit gen) => AST -> StateT PrinterState Maybe gen
51+ match (NumericLiteral _ n) = return $ emit $ T.pack $ either show show n
52+ match (StringLiteral _ s) = return $ emit $ stringLiteral s
53+ match (BooleanLiteral _ True) = return $ emit "true"
54+ match (BooleanLiteral _ False) = return $ emit "false"
55+ match (ArrayLiteral _ xs) = mconcat <$> sequence
56+ [ return . emit $ arrayType <> "{"
57+ , intercalate (emit ", ") <$> forM xs prettyPrintIL'
58+ , return $ emit "}"
59+ ]
60+ -- match (ObjectLiteral _ []) = return $ emit "std::initializer_list<std::pair<const string, boxed>>{}"
61+ match (ObjectLiteral _ ps) = mconcat <$> sequence
62+ [ return . emit $ dictType <> "{"
63+ , withIndent $ do
64+ ils <- forM ps $ \(key, value) -> do
65+ value' <- prettyPrintIL' value
66+ return $ objectPropertyToString key <> value'
67+ return $ intercalate (emit " ") $ map (<> emit ",") ils
68+ , return $ emit "}"
69+ ]
70+ where
71+ objectPropertyToString :: (Emit gen) => PSString -> gen
72+ objectPropertyToString s = emit $ stringLiteral s <> ": "
73+ match (Block _ sts) = mconcat <$> sequence
74+ [ return $ emit "{\n"
75+ , withIndent $ prettyStatements sts
76+ , return $ emit "\n"
77+ , currentIndent
78+ , return $ emit "}"
79+ ]
80+ match (Var _ ident) | ident == C.undefined = return $ emit undefinedName
81+ match (Var _ ident) = return $ emit ident
82+ match (VariableIntroduction _ ident value) = mconcat <$> sequence
83+ [ return . emit $ varDecl <> " " <> ident <> " " <> anyType
84+ , maybe (return mempty) (fmap (emit " = " <>) . prettyPrintIL') value
85+ ]
86+ match (Assignment _ target value) = mconcat <$> sequence
87+ [ prettyPrintIL' target
88+ , return $ emit " = "
89+ , prettyPrintIL' value
90+ ]
91+ match (App _ val []) = mconcat <$> sequence
92+ [ return $ emit "Run("
93+ , prettyPrintIL' val
94+ , return $ emit ")"
95+ ]
96+ match (App _ (StringLiteral _ u) [arg])
97+ | Just ty <- decodeString u = mconcat <$> sequence
98+ [ prettyPrintIL' arg
99+ , return $ emit ".("
100+ , return $ emit ty
101+ , return $ emit ")"
102+ ]
103+ match (App _ (Var _ fn) [arg]) | fn == arrayLengthFn = mconcat <$> sequence
104+ [ return $ emit fn
105+ , return $ emit "("
106+ , prettyPrintIL' arg
107+ , return $ emit ")"
108+ ]
109+ match (App _ (Var _ fn) args) | fn == indexFn = mconcat <$> sequence
110+ [ return $ emit fn
111+ , return $ emit "("
112+ , intercalate (emit ", ") <$> forM args prettyPrintIL'
113+ , return $ emit ")"
114+ ]
115+ match (App _ (Var _ fn) args) | fn == tcoLoop = mconcat <$> sequence
116+ [ return $ emit fn
117+ , return $ emit "("
118+ , intercalate (emit ", ") <$> forM args prettyPrintIL'
119+ , return $ emit ")"
120+ ]
121+ match (App _ (App Nothing (StringLiteral Nothing fnx) [fn@Function{}]) args)
122+ | Just ftype <- decodeString fnx
123+ , "Fn" `T.isPrefixOf` ftype = mconcat <$> sequence
124+ [ prettyPrintIL' fn
125+ , return $ emit "("
126+ , intercalate (emit ", ") <$> forM args prettyPrintIL'
127+ , return $ emit ")"
128+ ]
129+ match (App _ (App Nothing (StringLiteral Nothing fnx) [fn]) args)
130+ | Just ftype <- decodeString fnx
131+ , "Fn" `T.isPrefixOf` ftype = mconcat <$> sequence
132+ [ prettyPrintIL' fn
133+ , return $ emit ".("
134+ , return $ emit ftype
135+ , return $ emit ")("
136+ , intercalate (emit ", ") <$> forM args prettyPrintIL'
137+ , return $ emit ")"
138+ ]
139+ match app@(App{})
140+ | (val, args) <- unApp app []
141+ , length args > 1
142+ = mconcat <$> sequence
143+ [ return $ emit "Apply("
144+ , prettyPrintIL' val
145+ , return $ emit ", "
146+ , intercalate (emit ", ") <$> forM args prettyPrintIL'
147+ , return $ emit ")"
148+ ]
149+ match (App _ val args) = mconcat <$> sequence
150+ [ return $ emit "Apply("
151+ , prettyPrintIL' val
152+ , return $ emit ", "
153+ , intercalate (emit ", ") <$> forM args prettyPrintIL'
154+ , return $ emit ")"
155+ ]
156+ match (Function _ (Just name) [] (Block _ [Return _ ret]))
157+ | isComplexLiteral ret = mconcat <$> sequence
158+ [ return $ emit "\n"
159+ , return . emit $ varDecl <> " " <> initName name <> " Once\n"
160+ , prettyPrintIL' $ VariableIntroduction Nothing (valueName name) Nothing
161+ , return $ emit "\n\n"
162+ , return $ emit "func "
163+ , return . emit $ withPrefix name
164+ , return . emit $ "() " <> anyType <> " "
165+ , return $ emit "{\n"
166+ , withIndent $ do
167+ indentString <- currentIndent
168+ return $ indentString <> (emit $ initName name <> ".Do(func() {\n") <>
169+ indentString <> indentString <> (emit $ valueName name <> " = ")
170+ , withIndent $ do
171+ case ret of
172+ Function _ Nothing args body -> mconcat <$> sequence
173+ [ return $ emit "func("
174+ , return . emit $ intercalate ", " (renderArg anyType <$> args)
175+ , return . emit $ ") " <> anyType <> " "
176+ , prettyPrintIL' body
177+ ]
178+ _ -> do
179+ prettyPrintIL' ret
180+ , return $ emit "\n"
181+ , withIndent $ do
182+ indentString <- currentIndent
183+ return $ indentString <> (emit $ "})\n" <> "return " <> valueName name <>"\n")
184+ , return $ emit "}\n\n"
185+ ]
186+ match (Function _ (Just name) [] ret) = mconcat <$> sequence
187+ [ return $ emit "func "
188+ , return . emit $ withPrefix name
189+ , return . emit $ "() " <> anyType <> " "
190+ , prettyPrintIL' ret
191+ ]
192+ match (Function _ _ args ret) = mconcat <$> sequence
193+ [ return $ emit "func("
194+ , return . emit $ intercalate ", " (renderArg anyType <$> args)
195+ , return . emit $ ") " <> anyType <> " "
196+ , prettyPrintIL' ret
197+ ]
198+ match (Indexer _ (Var _ name) (Var _ "")) = mconcat <$> sequence
199+ [ prettyPrintIL' (Var Nothing $ withPrefix name)
200+ , return $ emit "()"
201+ ]
202+ match (Indexer _ (Var _ name) val) = mconcat <$> sequence
203+ [ prettyPrintIL' val
204+ , return $ emit "."
205+ , prettyPrintIL' (Var Nothing $ withPrefix name)
206+ , return $ emit "()"
207+ ]
208+ match (Indexer _ prop@StringLiteral{} val@ObjectLiteral{}) = mconcat <$> sequence
209+ [ prettyPrintIL' val
210+ , return $ emit "["
211+ , prettyPrintIL' prop
212+ , return $ emit "]"
213+ ]
214+ match (Indexer _ prop@StringLiteral{} val) = mconcat <$> sequence
215+ [ prettyPrintIL' val
216+ , return $ emit ".("
217+ , return $ emit dictType
218+ , return $ emit ")["
219+ , prettyPrintIL' prop
220+ , return $ emit "]"
221+ ]
222+ match (Indexer _ index val@ArrayLiteral{}) = mconcat <$> sequence
223+ [ prettyPrintIL' val
224+ , return $ emit "["
225+ , prettyPrintIL' index
226+ , return $ emit "]"
227+ ]
228+ match (Indexer _ index val) = mconcat <$> sequence
229+ [ prettyPrintIL' val
230+ , return $ emit ".("
231+ , return $ emit arrayType
232+ , return $ emit ")["
233+ , prettyPrintIL' index
234+ , return $ emit "]"
235+ ]
236+ match (InstanceOf _ val ty) = mconcat <$> sequence
237+ [ return $ emit "Is("
238+ , prettyPrintIL' val
239+ , return $ emit ", "
240+ , prettyPrintIL' ty
241+ , return $ emit ")"
242+ ]
243+ match (While _ cond sts) = mconcat <$> sequence
244+ [ return $ emit "for "
245+ , prettyPrintIL' cond
246+ , return $ emit " "
247+ , prettyPrintIL' sts
248+ ]
249+ match (For _ ident start end sts) = mconcat <$> sequence
250+ [ return $ emit $ "for var " <> ident <> " = "
251+ , prettyPrintIL' start
252+ , return $ emit $ "; " <> ident <> " < "
253+ , prettyPrintIL' end
254+ , return $ emit $ "; " <> ident <> "++ "
255+ , prettyPrintIL' sts
256+ ]
257+ match (ForIn _ ident obj sts) = mconcat <$> sequence
258+ [ return $ emit $ "for var " <> ident <> " in "
259+ , prettyPrintIL' obj
260+ , return $ emit " "
261+ , prettyPrintIL' sts
262+ ]
263+ match (IfElse _ (Binary _ EqualTo cond@Binary{} (BooleanLiteral Nothing True)) thens elses) = mconcat <$> sequence
264+ [ return $ emit "if "
265+ , prettyPrintIL' cond
266+ , return $ emit " "
267+ , prettyPrintIL' thens
268+ , maybe (return mempty) (fmap (emit " else " <>) . prettyPrintIL') elses
269+ ]
270+ match (IfElse _ (Binary _ EqualTo cond@Binary{} (BooleanLiteral Nothing False)) thens elses) = mconcat <$> sequence
271+ [ return $ emit "if !("
272+ , prettyPrintIL' cond
273+ , return $ emit ") "
274+ , prettyPrintIL' thens
275+ , maybe (return mempty) (fmap (emit " else " <>) . prettyPrintIL') elses
276+ ]
277+ match (IfElse _ cond thens elses) = mconcat <$> sequence
278+ [ return $ emit "if "
279+ , prettyPrintIL' cond
280+ , return $ emit " "
281+ , prettyPrintIL' thens
282+ , maybe (return mempty) (fmap (emit " else " <>) . prettyPrintIL') elses
283+ ]
284+ match (Return _ value) = mconcat <$> sequence
285+ [ return $ emit "return "
286+ , prettyPrintIL' value
287+ ]
288+ match (ReturnNoResult _) = return . emit $ "return " <> undefinedName
289+ -- match (Throw _ _) = return mempty
290+ match (Throw _ value) = mconcat <$> sequence
291+ [ return $ emit "panic("
292+ , prettyPrintIL' value
293+ , return $ emit ")"
294+ ]
295+ match (Comment _ com il) = mconcat <$> sequence
296+ [ return $ emit "\n"
297+ , mconcat <$> forM com comment
298+ , prettyPrintIL' il
299+ ]
300+ match _ = mzero
301+
302+ comment :: (Emit gen) => Comment -> StateT PrinterState Maybe gen
303+ comment (LineComment com) = fmap mconcat $ sequence $
304+ [ currentIndent
305+ , return $ emit "//" <> emit com <> emit "\n"
306+ ]
307+ comment (BlockComment com) = fmap mconcat $ sequence $
308+ [ currentIndent
309+ , return $ emit "/**\n"
310+ ] ++
311+ map asLine (T.lines com) ++
312+ [ currentIndent
313+ , return $ emit " */\n"
314+ , currentIndent
315+ ]
316+ where
317+ asLine :: (Emit gen) => Text -> StateT PrinterState Maybe gen
318+ asLine s = do
319+ i <- currentIndent
320+ return $ i <> emit " * " <> (emit . removeComments) s <> emit "\n"
321+
322+ removeComments :: Text -> Text
323+ removeComments t =
324+ case T.stripPrefix "*/" t of
325+ Just rest -> removeComments rest
326+ Nothing -> case T.uncons t of
327+ Just (x, xs) -> x `T.cons` removeComments xs
328+ Nothing -> ""
329+
330+unary' :: (Emit gen) => UnaryOperator -> (AST -> Text) -> Operator PrinterState AST gen
331+unary' op mkStr = Wrap match (<>)
332+ where
333+ match :: (Emit gen) => Pattern PrinterState AST (gen, AST)
334+ match = mkPattern match'
335+ where
336+ match' (Unary _ op' val) | op' == op = Just (emit $ mkStr val, val)
337+ match' _ = Nothing
338+
339+unary :: (Emit gen) => UnaryOperator -> Text -> Operator PrinterState AST gen
340+unary op str = unary' op (const str)
341+
342+negateOperator :: (Emit gen) => Operator PrinterState AST gen
343+negateOperator = unary' Negate (\v -> if isNegate v then "- " else "-")
344+ where
345+ isNegate (Unary _ Negate _) = True
346+ isNegate _ = False
347+
348+binary :: (Emit gen) => BinaryOperator -> Text -> Operator PrinterState AST gen
349+binary op str = AssocL match (\v1 v2 -> v1 <> emit (" " <> str <> " ") <> v2)
350+ where
351+ match :: Pattern PrinterState AST (AST, AST)
352+ match = mkPattern match'
353+ where
354+ match' (Binary _ op' v1 v2) | op' == op = Just (v1, v2)
355+ match' _ = Nothing
356+
357+isLiteral :: AST -> Bool
358+isLiteral Function{} = True
359+isLiteral NumericLiteral{} = True
360+isLiteral StringLiteral{} = True
361+isLiteral BooleanLiteral{} = True
362+isLiteral ObjectLiteral{} = True
363+isLiteral ArrayLiteral{} = True
364+isLiteral _ = False
365+
366+isComplexLiteral :: AST -> Bool
367+-- isComplexLiteral Function{} = True
368+isComplexLiteral ObjectLiteral{} = True
369+isComplexLiteral ArrayLiteral{} = True
370+isComplexLiteral _ = False
371+
372+unApp :: AST -> [AST] -> (AST, [AST])
373+unApp (App _ val [arg]) args = unApp val (arg : args)
374+unApp other args = (other, args)
375+
376+prettyStatements :: (Emit gen) => [AST] -> StateT PrinterState Maybe gen
377+prettyStatements sts = do
378+ ils <- forM sts prettyPrintIL'
379+ indentString <- currentIndent
380+ return $ intercalate (emit "\n") $ map (indentString <>) ils
381+
382+-- | Generate a pretty-printed string representing a collection of C++ expressions at the same indentation level
383+prettyPrintILWithSourceMaps :: [AST] -> (Text, [SMap])
384+prettyPrintILWithSourceMaps il =
385+ let StrPos (_, s, mp) = (fromMaybe (internalError "Incomplete pattern") . flip evalStateT (PrinterState 0) . prettyStatements) il
386+ in (s, mp)
387+
388+prettyPrintIL :: [AST] -> Text
389+prettyPrintIL = maybe (internalError "Incomplete pattern") runPlainString . flip evalStateT (PrinterState 0) . prettyStatements
390+
391+-- | Generate an indented, pretty-printed string representing a C++ expression
392+prettyPrintIL' :: (Emit gen) => AST -> StateT PrinterState Maybe gen
393+prettyPrintIL' = A.runKleisli $ runPattern matchValue
394+ where
395+ matchValue :: (Emit gen) => Pattern PrinterState AST gen
396+ matchValue = buildPrettyPrinter operators (literals <+> fmap parensPos matchValue)
397+ operators :: (Emit gen) => OperatorTable PrinterState AST gen
398+ operators =
399+ OperatorTable [ [ unary New "?" ]
400+ , [ unary Not "!"
401+ , unary BitwiseNot "~"
402+ , unary Positive "+"
403+ , negateOperator ]
404+ , [ binary Multiply "*"
405+ , binary Divide "/"
406+ , binary Modulus "%" ]
407+ , [ binary Add "+"
408+ , binary Subtract "-" ]
409+ , [ binary ShiftLeft "<<"
410+ , binary ShiftRight ">>" ]
411+ , [ binary LessThan "<"
412+ , binary LessThanOrEqualTo "<="
413+ , binary GreaterThan ">"
414+ , binary GreaterThanOrEqualTo ">=" ]
415+ , [ binary EqualTo "=="
416+ , binary NotEqualTo "!=" ]
417+ , [ binary BitwiseAnd "&" ]
418+ , [ binary BitwiseXor "^" ]
419+ , [ binary BitwiseOr "|" ]
420+ , [ binary And "&&" ]
421+ , [ binary Or "||" ]
422+ ]
423+
424+prettyPrintIL1 :: AST -> Text
425+prettyPrintIL1 = maybe (internalError "Incomplete pattern") runPlainString . flip evalStateT (PrinterState 0) . prettyPrintIL'
426+
427+stringLiteral :: PSString -> Text
428+stringLiteral pss | Just s <- decodeString pss = stringLiteral' s
429+ where
430+ stringLiteral' :: Text -> Text
431+ stringLiteral' s = "\"" <> T.concatMap encodeChar s <> "\""
432+ encodeChar :: Char -> Text
433+ encodeChar '\0' = "\\x00"
434+ encodeChar '\b' = "\\b"
435+ encodeChar '\t' = "\\t"
436+ encodeChar '\n' = "\\n"
437+ encodeChar '\v' = "\\v"
438+ encodeChar '\f' = "\\f"
439+ encodeChar '\r' = "\\r"
440+ encodeChar '"' = "\\\""
441+ encodeChar '\\' = "\\\\"
442+ encodeChar c = T.singleton $ c
443+stringLiteral _ = "\"\\uFFFD\""
444+
445+interfaceSource :: Text -> [(Text,Bool)] -> [Ident] -> Text
446+interfaceSource _ _ _ = ""
447+
448+implHeaderSource :: Text -> [Text] -> Text -> Text
449+implHeaderSource mn imports otherPrefix =
450+ "// Code generated by psgo. DO NOT EDIT.\n\n" <>
451+ "package " <> (if mn == "Main" || mn == "Test_Main" then "main" else mn) <> "\n\n" <>
452+ "import . \"" <> runtime <> "\"\n" <>
453+ (if mn == "Main" || mn == "Test_Main"
454+ then "import _ \"" <> otherPrefix <> "/" <> ffiLoader <> "\"\n"
455+ else "\n") <>
456+ "import (\n" <>
457+ (T.concat $ formatImport <$> imports) <> ")\n\n" <>
458+ "type _ = Any\n\n"
459+ where
460+ formatImport :: Text -> Text
461+ formatImport s =
462+ "\t\"" <> otherPrefix <> "/" <> modPrefix <> "/" <> moduleRenamer s <> "\"\n"
463+ moduleRenamer :: Text -> Text
464+ moduleRenamer s
465+ | (s', sfx) <- T.breakOn moduleRenamerMarker s,
466+ not $ T.null sfx = s'
467+ moduleRenamer s = s
468+
469+implFooterSource :: Text -> [Ident] -> Text
470+implFooterSource mn foreigns =
471+ "\n\n\n" <>
472+ (if null foreigns
473+ then ""
474+ else ("// Foreign values\n\n" <>
475+ "var " <> foreignDict <> " = "<> foreignMod <> "(\"" <> mn <> "\")\n\n" <>
476+ (T.concat $ (\foreign' ->
477+ let name = moduleIdentToIL foreign' in
478+ varDecl <> " " <> initName name <> " Once\n" <>
479+ varDecl <> " " <> valueName name <> " " <> anyType <> "\n\n" <>
480+ "func " <>
481+ withPrefix name <>
482+ "() Any { \n" <>
483+ " " <> initName name <> ".Do(func() {\n" <>
484+ " " <> valueName name <> " = " <>
485+ "Get(" <> foreignDict <> ", " <>
486+ (stringLiteral . mkString $ runIdent foreign') <> ")\n" <>
487+ " })\n" <>
488+ " return " <> valueName name <> "\n" <>
489+ "}\n\n") <$> foreigns))) <>
490+ if mn == "Main" || mn == "Test.Main" then mainSource else "\n"
491+ where
492+ mainSource :: Text
493+ mainSource = "\
494+ \func main() {\n\
495+ \ Run(Ꞌmain())\n\
496+ \}\n\n\
497+ \"
498+
499+varDecl :: Text
500+varDecl = "var"
501+
502+renderArg :: Text -> Text -> Text
503+renderArg decl arg = arg <> " " <> decl
504+
505+foreignMod :: Text
506+foreignMod = "Foreign"
507+
508+foreignDict :: Text
509+foreignDict = "foreign"
510+
511+modLabel :: Text
512+modLabel = "purescript-native"
513+
514+modPrefix :: Text
515+modPrefix = modLabel <> "/output"
516+
517+runtime :: Text
518+runtime = "github.com/" <> modLabel <> "/go-runtime"
519+
520+ffiLoader :: Text
521+ffiLoader = modLabel <> "/ffi-loader"
522+
523+initName :: Text -> Text
524+initName s = "ᛌ" <> s <> "_once"
525+
526+valueName :: Text -> Text
527+valueName s = "ᛧ" <> s
src/Main.hsdeleted−71
@@ -1,71 +0,0 @@
1−-----------------------------------------------------------------------------
2−--
3−-- Module : Main
4−-- Copyright : (c) Phil Freeman 2013
5−-- License : MIT
6−--
7−-- Maintainer : Phil Freeman <paf31@cantab.net>
8−-- Stability : experimental
9−-- Portability :
10−--
11−-- |
12−--
13−-----------------------------------------------------------------------------
14−
15−module Main where
16−
17−import PureScript
18−import Data.Maybe (mapMaybe)
19−import Data.List (intercalate)
20−import System.Console.CmdTheLine
21−import Control.Applicative
22−import System.Exit (exitSuccess, exitFailure)
23−import qualified System.IO.UTF8 as U
24−import qualified Data.Map as M
25−
26−compile :: [FilePath] -> Maybe FilePath -> Maybe FilePath -> IO ()
27−compile inputFiles outputFile externsFile = do
28− input <- fmap concat $ mapM U.readFile inputFiles
29− let ast = parseDeclarations input
30− case ast of
31− Left err -> do
32− U.print err
33− exitFailure
34− Right decls -> do
35− case check (typeCheckAll decls) of
36− Left typeError -> do
37− U.putStrLn typeError
38− exitFailure
39− Right (_, env) -> do
40− let js = intercalate "\n" $ mapMaybe declToJs decls
41− case outputFile of
42− Just path -> U.writeFile path js
43− Nothing -> U.putStrLn js
44− case externsFile of
45− Nothing -> return ()
46− Just filePath -> U.writeFile filePath $ intercalate "\n" $ map (uncurry externToPs) $ M.toList $ names env
47− exitSuccess
48−
49−inputFiles :: Term [FilePath]
50−inputFiles = nonEmpty $ posAny [] $ posInfo
51− { posDoc = "The input .ps files" }
52−
53−outputFile :: Term (Maybe FilePath)
54−outputFile = value $ opt Nothing $ (optInfo [ "o", "output" ])
55− { optDoc = "The output .js file" }
56−
57−externsFile :: Term (Maybe FilePath)
58−externsFile = value $ opt Nothing $ (optInfo [ "e", "externs" ])
59− { optDoc = "The output .e.ps file" }
60−
61−term :: Term (IO ())
62−term = compile <$> inputFiles <*> outputFile <*> externsFile
63−
64−termInfo :: TermInfo
65−termInfo = defTI
66− { termName = "psc"
67− , version = "1.0"
68− , termDoc = "Compiles PureScript to Javascript"
69− }
70−
71−main = run (term, termInfo)
src/PureScript.hsdeleted−31
@@ -1,31 +0,0 @@
1−-----------------------------------------------------------------------------
2−--
3−-- Module : PureScript
4−-- Copyright : (c) Phil Freeman 2013
5−-- License : MIT
6−--
7−-- Maintainer : Phil Freeman <paf31@cantab.net>
8−-- Stability : experimental
9−-- Portability :
10−--
11−-- |
12−--
13−-----------------------------------------------------------------------------
14−
15−module PureScript (
16− module PureScript.Values,
17− module PureScript.Types,
18− module PureScript.Kinds,
19− module PureScript.Declarations,
20− module PureScript.Parser,
21− module PureScript.CodeGen,
22− module PureScript.TypeChecker
23−) where
24−
25−import PureScript.Values
26−import PureScript.Types
27−import PureScript.Kinds
28−import PureScript.Declarations
29−import PureScript.Parser
30−import PureScript.CodeGen
31−import PureScript.TypeChecker
src/PureScript/CodeGen.hsdeleted−21
@@ -1,21 +0,0 @@
1−-----------------------------------------------------------------------------
2−--
3−-- Module : PureScript.CodeGen
4−-- Copyright : (c) Phil Freeman 2013
5−-- License : MIT
6−--
7−-- Maintainer : Phil Freeman <paf31@cantab.net>
8−-- Stability : experimental
9−-- Portability :
10−--
11−-- |
12−--
13−-----------------------------------------------------------------------------
14−
15−module PureScript.CodeGen (
16− module PureScript.CodeGen.JS,
17− module PureScript.CodeGen.Externs
18−) where
19−
20−import PureScript.CodeGen.JS
21−import PureScript.CodeGen.Externs
src/PureScript/CodeGen/Common.hsdeleted−79
@@ -1,79 +0,0 @@
1−-----------------------------------------------------------------------------
2−--
3−-- Module : PureScript.CodeGen.Common
4−-- Copyright : (c) Phil Freeman 2013
5−-- License : MIT
6−--
7−-- Maintainer : Phil Freeman <paf31@cantab.net>
8−-- Stability : experimental
9−-- Portability :
10−--
11−-- |
12−--
13−-----------------------------------------------------------------------------
14−
15−{-# LANGUAGE GeneralizedNewtypeDeriving, GADTs #-}
16−
17−module PureScript.CodeGen.Common where
18−
19−import Data.Maybe (fromMaybe)
20−import Data.List (nub, intersperse, intercalate)
21−import Data.Function (fix)
22−import Control.Monad.State
23−import Control.Applicative (Applicative(..), Alternative(..))
24−import qualified Control.Category as C
25−import Control.Category ((>>>))
26−import qualified Control.Arrow as A
27−import Control.Arrow ((***))
28−
29−import PureScript.Values
30−import PureScript.Types
31−import PureScript.Declarations
32−
33−newtype Pattern a b = Pattern { runPattern :: A.Kleisli Maybe a b } deriving (C.Category, A.Arrow)
34−
35−pattern :: Pattern a b -> a -> Maybe b
36−pattern = A.runKleisli . runPattern
37−
38−instance Functor (Pattern a) where
39− fmap f p = Pattern $ A.Kleisli $ fmap f . pattern p
40−
41−instance Applicative (Pattern a) where
42− pure = Pattern . A.Kleisli . const . pure
43− f <*> x = Pattern . A.Kleisli $ \a -> pattern f a <*> pattern x a
44−
45−instance Alternative (Pattern a) where
46− empty = Pattern $ A.Kleisli $ \a -> empty
47− (Pattern (A.Kleisli p)) <|> (Pattern (A.Kleisli q)) = Pattern $ A.Kleisli $ \a -> p a <|> q a
48−
49−parens :: String -> String
50−parens s = ('(':s) ++ ")"
51−
52−chainl :: Pattern a (a, a) -> (r -> r -> r) -> Pattern a r -> Pattern a r
53−chainl split f p = fix $ \c -> (split >>> (c *** p) >>> A.arr (uncurry f)) <|> p
54−
55−chainr :: Pattern a (a, a) -> (r -> r -> r) -> Pattern a r -> Pattern a r
56−chainr split f p = fix $ \c -> (split >>> (p *** c) >>> A.arr (uncurry f)) <|> p
57−
58−wrap :: Pattern a (s, a) -> (s -> r -> r) -> Pattern a r -> Pattern a r
59−wrap split f p = fix $ \c -> (split >>> (C.id *** c) >>> A.arr (uncurry f)) <|> p
60−
61−split :: Pattern a (s, t) -> (s -> t -> r) -> Pattern a r -> Pattern a r
62−split s f p = (s >>> A.arr (uncurry f)) <|> p
63−
64−data OperatorTable a r = OperatorTable { runOperatorTable :: [Operator a r] }
65−
66−data Operator a r where
67− AssocL :: Pattern a (a, a) -> (r -> r -> r) -> Operator a r
68− AssocR :: Pattern a (a, a) -> (r -> r -> r) -> Operator a r
69− Wrap :: Pattern a (s, a) -> (s -> r -> r) -> Operator a r
70− Split :: Pattern a (s, t) -> (s -> t -> r) -> Operator a r
71−
72−buildPrettyPrinter :: OperatorTable a r -> Pattern a r -> Pattern a r
73−buildPrettyPrinter table p = foldl (\p' op ->
74− case op of
75− AssocL pat g -> chainl pat g p'
76− AssocR pat g -> chainr pat g p'
77− Wrap pat g -> wrap pat g p'
78− Split pat g -> split pat g p'
79− ) p $ runOperatorTable table
src/PureScript/CodeGen/Common/Gen.hsdeleted−31
@@ -1,31 +0,0 @@
1−-----------------------------------------------------------------------------
2−--
3−-- Module : PureScript.CodeGen.Common.Gen
4−-- Copyright : (c) Phil Freeman 2013
5−-- License : MIT
6−--
7−-- Maintainer : Phil Freeman <paf31@cantab.net>
8−-- Stability : experimental
9−-- Portability :
10−--
11−-- |
12−--
13−-----------------------------------------------------------------------------
14−
15−{-# LANGUAGE GeneralizedNewtypeDeriving #-}
16−
17−module PureScript.CodeGen.Common.Gen where
18−
19−import Control.Monad.State
20−import Control.Applicative
21−
22−newtype Gen a = Gen { unGen :: State Int a } deriving (Functor, Applicative, Monad, MonadState Int)
23−
24−runGen :: Gen a -> a
25−runGen = flip evalState 0 . unGen
26−
27−fresh :: Gen String
28−fresh = do
29− n <- get
30− modify (+ 1)
31− return $ "_" ++ show n
src/PureScript/CodeGen/Externs.hsdeleted−87
@@ -1,87 +0,0 @@
1−-----------------------------------------------------------------------------
2−--
3−-- Module : PureScript.CodeGen.Externs
4−-- Copyright : (c) Phil Freeman 2013
5−-- License : MIT
6−--
7−-- Maintainer : Phil Freeman <paf31@cantab.net>
8−-- Stability : experimental
9−-- Portability :
10−--
11−-- |
12−--
13−-----------------------------------------------------------------------------
14−
15−{-# LANGUAGE GADTs, GeneralizedNewtypeDeriving #-}
16−
17−module PureScript.CodeGen.Externs (
18− externToPs
19−) where
20−
21−import Data.Maybe (fromMaybe)
22−import Data.List (intersperse, intercalate)
23−import qualified Control.Arrow as A
24−import Control.Applicative
25−
26−import PureScript.Values
27−import PureScript.Types
28−import PureScript.Declarations
29−import PureScript.TypeChecker.Monad
30−import PureScript.CodeGen.Common
31−
32−externToPs :: String -> (PolyType, NameKind) -> String
33−externToPs name (ty, _) = "extern " ++ name ++ " :: " ++ polyTypeToPs ty
34−
35−typeLiterals :: Pattern Type String
36−typeLiterals = Pattern $ A.Kleisli match
37− where
38− match Number = Just "Number"
39− match String = Just "String"
40− match Boolean = Just "Boolean"
41− match (Array ty) = Just $ "[" ++ typeToPs ty ++ "]"
42− match (Object row) = Just $ "{ " ++ rowToPs row ++ " }"
43− match (TypeVar var) = Just var
44− match (TypeConstructor ctor) = Just ctor
45− match (TUnknown u) = Just $ show u
46− match _ = Nothing
47−
48−rowToPs :: Row -> String
49−rowToPs = (\(tys, tail) -> intercalate "; " (map (uncurry nameAndTypeToPs) tys) ++ tailToPs tail) . toList
50− where
51− nameAndTypeToPs :: String -> Type -> String
52− nameAndTypeToPs name ty = name ++ " :: " ++ typeToPs ty
53− tailToPs :: Row -> String
54− tailToPs REmpty = ""
55− tailToPs (RUnknown u) = show u
56− tailToPs (RowVar var) = " | " ++ var
57− toList :: Row -> ([(String, Type)], Row)
58− toList (RCons name ty row) = let (tys, rest) = toList row
59− in ((name, ty):tys, rest)
60− toList r = ([], r)
61−
62−typeApp :: Pattern Type (Type, Type)
63−typeApp = Pattern $ A.Kleisli match
64− where
65− match (TypeApp f x) = Just (f, x)
66− match _ = Nothing
67−
68−function :: Pattern Type ([Type], Type)
69−function = Pattern $ A.Kleisli match
70− where
71− match (Function args ret) = Just (args, ret)
72− match _ = Nothing
73−
74−typeToPs :: Type -> String
75−typeToPs = fromMaybe (error "Incomplete pattern") . pattern matchType
76− where
77− matchType :: Pattern Type String
78− matchType = buildPrettyPrinter operators (typeLiterals <|> fmap parens matchType)
79− operators :: OperatorTable Type String
80− operators =
81− OperatorTable $ [ AssocL typeApp $ \f x -> f ++ " " ++ x
82− , Split function $ \args ret -> "(" ++ intercalate ", " (map typeToPs args) ++ ") -> " ++ typeToPs ret
83− ]
84−
85−polyTypeToPs :: PolyType -> String
86−polyTypeToPs (PolyType [] ty) = typeToPs ty
87−polyTypeToPs (PolyType idents ty) = "forall " ++ intercalate " " idents ++ ". " ++ typeToPs ty
src/PureScript/CodeGen/JS.hsdeleted−232
@@ -1,232 +0,0 @@
1−-----------------------------------------------------------------------------
2−--
3−-- Module : PureScript.CodeGen.JS
4−-- Copyright : (c) Phil Freeman 2013
5−-- License : MIT
6−--
7−-- Maintainer : Phil Freeman <paf31@cantab.net>
8−-- Stability : experimental
9−-- Portability :
10−--
11−-- |
12−--
13−-----------------------------------------------------------------------------
14−
15−module PureScript.CodeGen.JS (
16− declToJs
17−) where
18−
19−import Data.Maybe (fromMaybe)
20−import Data.List (intercalate)
21−import qualified Control.Arrow as A
22−import Control.Applicative
23−
24−import PureScript.Types
25−import PureScript.Values
26−import PureScript.Declarations
27−import PureScript.CodeGen.Common
28−import PureScript.CodeGen.Common.Gen
29−
30−declToJs :: Declaration -> Maybe String
31−declToJs (ValueDeclaration name val) = Just $ "var " ++ name ++ " = " ++ valueToJs val ++ ";"
32−declToJs (DataDeclaration _ _ ctors) =
33− Just $ flip concatMap ctors $ \(ctor, maybeTy) ->
34− case maybeTy of
35− Nothing -> "var " ++ ctor ++ " = { ctor: '" ++ ctor ++ "' };"
36− Just _ -> "var " ++ ctor ++ " = function (value) { return { ctor: '" ++ ctor ++ "', value: value }; };"
37−declToJs _ = Nothing
38−
39−literals :: Pattern Value String
40−literals = Pattern $ A.Kleisli match
41− where
42− match (NumericLiteral n) = Just $ either show show n
43− match (StringLiteral s) = Just $ show s
44− match (BooleanLiteral True) = Just "true"
45− match (BooleanLiteral False) = Just "false"
46− match (ArrayLiteral xs) = Just $ "[" ++ intercalate "," (map valueToJs xs) ++ "]"
47− match (ObjectLiteral ps) = Just $ "{" ++ intercalate "," (map objectPropertyToJs ps) ++ "}"
48− match (Constructor name) = Just name
49− match (Block sts) = Just $ "(function () {" ++ intercalate ";" (map statementToJs sts) ++ "})()"
50− match (Case value binders) = Just $ "(" ++ runGen (bindersToJs binders) ++ ")(" ++ valueToJs value ++ ")"
51− where
52− bindersToJs :: [(Binder, Value)] -> Gen String
53− bindersToJs binders = do
54− valName <- fresh
55− jss <- flip mapM binders $ \(binder, result) -> do
56− let js = valueToJs result
57− binderToJs valName ("return " ++ js ++ ";") binder
58− return $ "function (" ++ valName ++ ") {" ++ concat jss ++ "throw \"Failed pattern match\"; }"
59− match (Var ident) = Just ident
60− match _ = Nothing
61−
62−accessor :: Pattern Value (String, Value)
63−accessor = Pattern $ A.Kleisli match
64− where
65− match (Accessor prop val) = Just (prop, val)
66− match _ = Nothing
67−
68−indexer :: Pattern Value (String, Value)
69−indexer = Pattern $ A.Kleisli match
70− where
71− match (Indexer index val) = Just (valueToJs index, val)
72− match _ = Nothing
73−
74−app :: Pattern Value (String, Value)
75−app = Pattern $ A.Kleisli match
76− where
77− match (App val args) = Just (intercalate "," (map valueToJs args), val)
78− match _ = Nothing
79−
80−lam :: Pattern Value ([String], Value)
81−lam = Pattern $ A.Kleisli match
82− where
83− match (Abs args val) = Just (args, val)
84− match _ = Nothing
85−
86−unary :: UnaryOperator -> String -> Operator Value String
87−unary op str = Wrap pattern (++)
88− where
89− pattern :: Pattern Value (String, Value)
90− pattern = Pattern $ A.Kleisli match
91− where
92− match (Unary op' val) | op' == op = Just (str, val)
93− match _ = Nothing
94−
95−binary :: BinaryOperator -> String -> Operator Value String
96−binary op str = AssocR pattern (\v1 v2 -> v1 ++ " " ++ str ++ " " ++ v2)
97− where
98− pattern :: Pattern Value (Value, Value)
99− pattern = Pattern $ A.Kleisli match
100− where
101− match (Binary op' v1 v2) | op' == op = Just (v1, v2)
102− match _ = Nothing
103−
104−valueToJs :: Value -> String
105−valueToJs = fromMaybe (error "Incomplete pattern") . pattern matchValue
106− where
107− matchValue :: Pattern Value String
108− matchValue = buildPrettyPrinter operators (literals <|> fmap parens matchValue)
109− operators :: OperatorTable Value String
110− operators =
111− OperatorTable $ [ Wrap accessor $ \prop val -> val ++ "." ++ prop
112− , Wrap indexer $ \index val -> val ++ "[" ++ index ++ "]"
113− , Wrap app $ \args val -> val ++ "(" ++ args ++ ")"
114− , Split lam $ \args val -> "function (" ++ intercalate "," args ++ ") { return " ++ valueToJs val ++ "; }"
115− , binary LessThan "<"
116− , binary LessThanOrEqualTo "<="
117− , binary GreaterThan ">"
118− , binary GreaterThanOrEqualTo ">="
119− , unary Not "!"
120− , unary BitwiseNot "~"
121− , unary Negate "-"
122− , binary Multiply "*"
123− , binary Divide "/"
124− , binary Modulus "%"
125− , binary Concat "++"
126− , binary Add "+"
127− , binary Subtract "-"
128− , binary ShiftLeft "<<"
129− , binary ShiftRight ">>"
130− , binary ZeroFillShiftRight ">>>"
131− , binary EqualTo "==="
132− , binary NotEqualTo "!=="
133− , binary BitwiseAnd "&"
134− , binary BitwiseXor "^"
135− , binary BitwiseOr "|"
136− , binary And "&&"
137− , binary Or "||"
138− ]
139−
140−unaryOperatorString :: UnaryOperator -> String
141−unaryOperatorString Negate = "-"
142−unaryOperatorString Not = "!"
143−unaryOperatorString BitwiseNot = "~"
144−
145−binaryOperatorString :: BinaryOperator -> String
146−binaryOperatorString Add = "+"
147−binaryOperatorString Subtract = "-"
148−binaryOperatorString Multiply = "*"
149−binaryOperatorString Divide = "/"
150−binaryOperatorString Modulus = "%"
151−binaryOperatorString LessThan = "<"
152−binaryOperatorString LessThanOrEqualTo = "<="
153−binaryOperatorString GreaterThan = ">"
154−binaryOperatorString GreaterThanOrEqualTo = ">="
155−binaryOperatorString BitwiseAnd = "&"
156−binaryOperatorString BitwiseOr = "|"
157−binaryOperatorString BitwiseXor = "^"
158−binaryOperatorString ShiftLeft = "<<"
159−binaryOperatorString ShiftRight = ">>"
160−binaryOperatorString ZeroFillShiftRight = ">>>"
161−binaryOperatorString EqualTo = "==="
162−binaryOperatorString NotEqualTo = "!=="
163−binaryOperatorString And = "&&"
164−binaryOperatorString Or = "||"
165−binaryOperatorString Concat = "+"
166−
167−binderToJs :: String -> String -> Binder -> Gen String
168−binderToJs varName done (StringBinder str) =
169− return $ "if (" ++ varName ++ " === \"" ++ str ++ "\") {" ++ done ++ " }"
170−binderToJs varName done (NumberBinder num) =
171− return $ "if (" ++ varName ++ " === \"" ++ either show show num ++ "\") {" ++ done ++ " }"
172−binderToJs varName done (BooleanBinder True) =
173− return $ "if (" ++ varName ++ ") {" ++ done ++ " }"
174−binderToJs varName done (BooleanBinder False) =
175− return $ "if (!" ++ varName ++ ") {" ++ done ++ " }"
176−binderToJs varName done (VarBinder s) =
177− return $ "var " ++ s ++ " = " ++ varName ++ "; " ++ done
178−binderToJs varName done (NullaryBinder ctor) =
179− return $ "if (" ++ varName ++ ".ctor === \"" ++ ctor ++ "\") { " ++ done ++ " }"
180−binderToJs varName done (UnaryBinder ctor b) = do
181− value <- fresh
182− js <- binderToJs value done b
183− return $ "if (" ++ varName ++ ".ctor === \"" ++ ctor ++ "\") { " ++ "var " ++ value ++ " = " ++ varName ++ ".value; " ++ js ++ " }"
184−binderToJs varName done (ObjectBinder bs) = go done bs
185− where
186− go done [] = return done
187− go done ((prop, binder):bs) = do
188− propVar <- fresh
189− done' <- go done bs
190− js <- binderToJs propVar done' binder
191− return $ "var " ++ propVar ++ " = " ++ varName ++ "." ++ prop ++ ";" ++ js
192−binderToJs done varName (ArrayBinder bs rest) = do
193− js <- go done rest 0 bs
194− return $ "if (" ++ varName ++ ".length " ++ cmp ++ " " ++ show (length bs) ++ ") { " ++ js ++ " }"
195− where
196− cmp = maybe "===" (const ">=") rest
197− go done Nothing _ [] = return done
198− go done (Just binder) index [] = do
199− restVar <- fresh
200− js <- binderToJs restVar done binder
201− return $ "var " ++ restVar ++ " = " ++ varName ++ ".slice(" ++ show index ++ "); " ++ js
202− go done rest index (binder:bs) = do
203− elVar <- fresh
204− done' <- go done rest (index + 1) bs
205− js <- binderToJs elVar done' binder
206− return $ "var " ++ elVar ++ " = " ++ varName ++ "[" ++ show index ++ "]; " ++ js
207−
208−objectPropertyToJs :: (String, Value) -> String
209−objectPropertyToJs (key, value) = key ++ ":" ++ valueToJs value
210−
211−statementToJs :: Statement -> String
212−statementToJs (VariableIntroduction name value) = "var " ++ name ++ " = " ++ valueToJs value
213−statementToJs (Assignment target value) = assignmentTargetToJs target ++ " = " ++ valueToJs value
214−statementToJs (While cond sts) = "while ("
215− ++ valueToJs cond ++ ") {"
216− ++ intercalate ";" (map statementToJs sts) ++ "}"
217−statementToJs (For (init, cond, done) sts) = "for (" ++
218− statementToJs init
219− ++ "; " ++ valueToJs cond
220− ++ "; " ++ statementToJs done
221− ++ ") {" ++ intercalate ";" (map statementToJs sts) ++ "}"
222−statementToJs (IfThenElse cond thens elses) = "if ("
223− ++ valueToJs cond ++ ") {"
224− ++ intercalate ";" (map statementToJs thens) ++ "}"
225− ++ flip (maybe "") elses (\sts ->
226− " else {" ++ intercalate ";" (map statementToJs sts) ++ "}")
227−statementToJs (Return value) = "return " ++ valueToJs value
228−
229−assignmentTargetToJs :: AssignmentTarget -> String
230−assignmentTargetToJs (AssignVariable var) = var
231−assignmentTargetToJs (AssignArrayIndex index tgt) = assignmentTargetToJs tgt ++ "[" ++ valueToJs index ++ "]"
232−assignmentTargetToJs (AssignObjectProperty prop tgt) = assignmentTargetToJs tgt ++ "." ++ prop
src/PureScript/Declarations.hsdeleted−29
@@ -1,29 +0,0 @@
1−-----------------------------------------------------------------------------
2−--
3−-- Module : PureScript.Declarations
4−-- Copyright : (c) Phil Freeman 2013
5−-- License : MIT
6−--
7−-- Maintainer : Phil Freeman <paf31@cantab.net>
8−-- Stability : experimental
9−-- Portability :
10−--
11−-- |
12−--
13−-----------------------------------------------------------------------------
14−
15−{-# LANGUAGE DeriveDataTypeable #-}
16−
17−module PureScript.Declarations where
18−
19−import PureScript.Values
20−import PureScript.Types
21−
22−import Data.Data
23−
24−data Declaration
25− = DataDeclaration String [String] [(String, Maybe Type)]
26− | TypeSynonymDeclaration String [String] Type
27− | TypeDeclaration String PolyType
28− | ValueDeclaration String Value
29− | ExternDeclaration String PolyType deriving (Show, Data, Typeable)
src/PureScript/Kinds.hsdeleted−25
@@ -1,25 +0,0 @@
1−-----------------------------------------------------------------------------
2−--
3−-- Module : PureScript.Kinds
4−-- Copyright : (c) Phil Freeman 2013
5−-- License : MIT
6−--
7−-- Maintainer : Phil Freeman <paf31@cantab.net>
8−-- Stability : experimental
9−-- Portability :
10−--
11−-- |
12−--
13−-----------------------------------------------------------------------------
14−
15−{-# LANGUAGE DeriveDataTypeable #-}
16−
17−module PureScript.Kinds where
18−
19−import Data.Data
20−
21−data Kind
22− = KUnknown Int
23− | Star
24− | Row
25− | FunKind Kind Kind deriving (Show, Eq, Data, Typeable)
src/PureScript/Parser.hsdeleted−24
@@ -1,24 +0,0 @@
1−-----------------------------------------------------------------------------
2−--
3−-- Module : PureScript.Parser
4−-- Copyright : (c) Phil Freeman 2013
5−-- License : MIT
6−--
7−-- Maintainer : Phil Freeman <paf31@cantab.net>
8−-- Stability : experimental
9−-- Portability :
10−--
11−-- |
12−--
13−-----------------------------------------------------------------------------
14−
15−module PureScript.Parser (
16− module PureScript.Parser.Types,
17− module PureScript.Parser.Values,
18− module PureScript.Parser.Declarations
19−) where
20−
21−import PureScript.Parser.Types
22−import PureScript.Parser.Values
23−import PureScript.Parser.Declarations
24−
src/PureScript/Parser/Common.hsdeleted−75
@@ -1,75 +0,0 @@
1−-----------------------------------------------------------------------------
2−--
3−-- Module : PureScript.Parser.Common
4−-- Copyright : (c) Phil Freeman 2013
5−-- License : MIT
6−--
7−-- Maintainer : Phil Freeman <paf31@cantab.net>
8−-- Stability : experimental
9−-- Portability :
10−--
11−-- |
12−--
13−-----------------------------------------------------------------------------
14−
15−module PureScript.Parser.Common where
16−
17−import Control.Applicative
18−import qualified Text.Parsec as P
19−import qualified Text.Parsec.Token as PT
20−import qualified Text.Parsec.Language as PL
21−
22−langDef = PL.haskellStyle
23− { PT.identStart = P.lower <|> P.char '_'
24− , PT.reservedNames = [ "case"
25− , "data"
26− , "type"
27− , "var"
28− , "while"
29− , "for"
30− , "if"
31− , "then"
32− , "else"
33− , "return"
34− , "true"
35− , "false"
36− , "extern"
37− , "forall" ]
38− }
39−
40−tokenParser = PT.makeTokenParser langDef
41−lexeme = PT.lexeme tokenParser
42−identifier = PT.identifier tokenParser
43−reserved = PT.reserved tokenParser
44−operator = PT.operator tokenParser
45−stringLiteral = PT.stringLiteral tokenParser
46−natural = PT.natural tokenParser
47−naturalOrFloat = PT.naturalOrFloat tokenParser
48−whiteSpace = PT.whiteSpace tokenParser
49−parens = PT.parens tokenParser
50−braces = PT.braces tokenParser
51−angles = PT.angles tokenParser
52−brackets = PT.brackets tokenParser
53−squares = PT.squares tokenParser
54−semi = PT.semi tokenParser
55−comma = PT.comma tokenParser
56−colon = PT.colon tokenParser
57−dot = PT.dot tokenParser
58−semiSep = PT.semiSep tokenParser
59−semiSep1 = PT.semiSep1 tokenParser
60−commaSep = PT.commaSep tokenParser
61−commaSep1 = PT.commaSep1 tokenParser
62−
63−properName :: P.Parsec String u String
64−properName = lexeme $ P.try properName'
65− where
66− properName' = (:) <$> P.upper <*> many (PT.identLetter langDef) P.<?> "name"
67−
68−augment :: P.Stream s m t => P.ParsecT s u m a -> P.ParsecT s u m b -> (a -> b -> a) -> P.ParsecT s u m a
69−augment p q f = (flip $ maybe id $ flip f) <$> p <*> P.optionMaybe q
70−
71−fold :: P.Stream s m t => P.ParsecT s u m a -> P.ParsecT s u m b -> (a -> b -> a) -> P.ParsecT s u m a
72−fold first more combine = do
73− a <- first
74− bs <- P.many more
75− return $ foldl combine a bs
src/PureScript/Parser/Declarations.hsdeleted−82
@@ -1,82 +0,0 @@
1−-----------------------------------------------------------------------------
2−--
3−-- Module : PureScript.Parser.Declarations
4−-- Copyright : (c) Phil Freeman 2013
5−-- License : MIT
6−--
7−-- Maintainer : Phil Freeman <paf31@cantab.net>
8−-- Stability : experimental
9−-- Portability :
10−--
11−-- |
12−--
13−-----------------------------------------------------------------------------
14−
15−module PureScript.Parser.Declarations (
16− parseDeclaration,
17− parseDeclarations
18−) where
19−
20−import Data.Char
21−import Data.List
22−import Data.Maybe
23−import Data.Function
24−import Control.Applicative
25−import qualified Text.Parsec as P
26−import Control.Arrow (Arrow(..))
27−
28−import PureScript.Values
29−import PureScript.Types
30−import PureScript.Parser.Common
31−import PureScript.Declarations
32−import PureScript.Parser.Values
33−import PureScript.Parser.Types
34−
35−parseDataDeclaration :: P.Parsec String () Declaration
36−parseDataDeclaration = do
37− reserved "data"
38− name <- properName
39− tyArgs <- many identifier
40− lexeme $ P.char '='
41− ctors <- P.sepBy1 ((,) <$> properName <*> P.optionMaybe parseType) (lexeme $ P.char '|')
42− return $ DataDeclaration name tyArgs ctors
43−
44−parseTypeDeclaration :: P.Parsec String () Declaration
45−parseTypeDeclaration = TypeDeclaration <$> identifier <*> (lexeme (P.string "::") *> parsePolyType)
46−
47−parseTypeSynonymDeclaration :: P.Parsec String () Declaration
48−parseTypeSynonymDeclaration = TypeSynonymDeclaration <$> (reserved "type" *> properName) <*> many identifier <*> (lexeme (P.char '=') *> parseType)
49−
50−parseValueDeclaration :: P.Parsec String () Declaration
51−parseValueDeclaration = ValueDeclaration <$> identifier <*> (lexeme (P.char '=') *> parseValue)
52−
53−parseExternDeclaration :: P.Parsec String () Declaration
54−parseExternDeclaration = ExternDeclaration <$> (reserved "extern" *> (identifier <|> properName)) <*> (lexeme (P.string "::") *> parsePolyType)
55−
56−parseDeclaration :: P.Parsec String () Declaration
57−parseDeclaration = P.choice $ map P.try
58− [ parseDataDeclaration
59− , parseTypeDeclaration
60− , parseTypeSynonymDeclaration
61− , parseValueDeclaration
62− , parseExternDeclaration ]
63−
64−parseDeclarations :: String -> Either P.ParseError [Declaration]
65−parseDeclarations = fmap catMaybes . mapM (P.parse (whiteSpace *> (P.optionMaybe parseDeclaration <* whiteSpace) <* P.eof) "Declaration") . splitFileIntoDeclarations
66−
67−isIndented :: String -> Bool
68−isIndented = any isSpace . take 1
69−
70−splitFileIntoDeclarations :: String -> [String]
71−splitFileIntoDeclarations = reverse . map (dropWhile isSpace . unlines . reverse) . go [] [] . lines
72− where
73− go [] sss [] = sss
74− go ss sss [] = ss:sss
75− go ss sss (s:rest)
76− | all isSpace s = go ss sss rest
77− | isIndented s = go (s:ss) sss rest
78− | null ss = go [s] sss rest
79− | otherwise = go [s] (ss:sss) rest
80−
81−
82−
src/PureScript/Parser/Types.hsdeleted−85
@@ -1,85 +0,0 @@
1−-----------------------------------------------------------------------------
2−--
3−-- Module : PureScript.Parser.Types
4−-- Copyright : (c) Phil Freeman 2013
5−-- License : MIT
6−--
7−-- Maintainer : Phil Freeman <paf31@cantab.net>
8−-- Stability : experimental
9−-- Portability :
10−--
11−-- |
12−--
13−-----------------------------------------------------------------------------
14−
15−module PureScript.Parser.Types (
16− parseType,
17− parsePolyType,
18− parseRow
19−) where
20−
21−import PureScript.Types
22−import PureScript.Parser.Common
23−import Control.Applicative
24−import qualified Text.Parsec as P
25−import Control.Arrow (Arrow(..))
26−
27−parseNumber :: P.Parsec String () Type
28−parseNumber = const Number <$> P.string "Number"
29−
30−parseString :: P.Parsec String () Type
31−parseString = const String <$> P.string "String"
32−
33−parseBoolean :: P.Parsec String () Type
34−parseBoolean = const Boolean <$> P.string "Boolean"
35−
36−parseArray :: P.Parsec String () Type
37−parseArray = squares $ Array <$> parseType
38−
39−parseObject :: P.Parsec String () Type
40−parseObject = braces $ Object <$> parseRow
41−
42−parseFunction :: P.Parsec String () Type
43−parseFunction = do
44− args <- lexeme $ parens $ commaSep parseType
45− lexeme $ P.string "->"
46− resultType <- parseType
47− return $ Function args resultType
48−
49−parseTypeVariable :: P.Parsec String () Type
50−parseTypeVariable = TypeVar <$> identifier
51−
52−parseTypeConstructor :: P.Parsec String () Type
53−parseTypeConstructor = TypeConstructor <$> properName
54−
55−parseTypeAtom :: P.Parsec String () Type
56−parseTypeAtom = P.choice $ map P.try
57− [ parseNumber
58− , parseString
59− , parseBoolean
60− , parseArray
61− , parseObject
62− , parseFunction
63− , parseTypeVariable
64− , parseTypeConstructor
65− , parens parseType ]
66−
67−parsePolyType :: P.Parsec String () PolyType
68−parsePolyType = PolyType <$> (P.option [] (reserved "forall" *> many identifier <* dot))
69− <*> parseType
70−
71−parseType :: P.Parsec String () Type
72−parseType = fold (lexeme parseTypeAtom) (lexeme parseTypeAtom) TypeApp
73−
74−parseNameAndType :: P.Parsec String () (String, Type)
75−parseNameAndType = (,) <$> (identifier <* lexeme (P.string "::")) <*> parseType
76−
77−parseRowEnding :: P.Parsec String () Row
78−parseRowEnding = P.option REmpty (RowVar <$> (lexeme (P.char '|') *> identifier))
79−
80−parseRow :: P.Parsec String () Row
81−parseRow = fromList <$> semiSep parseNameAndType <*> parseRowEnding
82− where
83− fromList :: [(String, Type)] -> Row -> Row
84− fromList [] r = r
85− fromList ((name, t):ts) r = RCons name t (fromList ts r)
src/PureScript/Parser/Values.hsdeleted−226
@@ -1,226 +0,0 @@
1−-----------------------------------------------------------------------------
2−--
3−-- Module : PureScript.Parser.Values
4−-- Copyright : (c) Phil Freeman 2013
5−-- License : MIT
6−--
7−-- Maintainer : Phil Freeman <paf31@cantab.net>
8−-- Stability : experimental
9−-- Portability :
10−--
11−-- |
12−--
13−-----------------------------------------------------------------------------
14−
15−module PureScript.Parser.Values (
16− parseValue,
17− parseBinder
18−) where
19−
20−import PureScript.Values
21−import qualified PureScript.Parser.Common as C
22−import Control.Applicative
23−import qualified Text.Parsec as P
24−import Text.Parsec.Expr
25−import Control.Monad
26−import Control.Arrow (Arrow(..))
27−import PureScript.Parser.Types
28−import PureScript.Types
29−
30−booleanLiteral :: P.Parsec String () Bool
31−booleanLiteral = (C.reserved "true" >> return True) P.<|> (C.reserved "false" >> return False)
32−
33−parseNumericLiteral :: P.Parsec String () Value
34−parseNumericLiteral = NumericLiteral <$> C.naturalOrFloat
35−
36−parseStringLiteral :: P.Parsec String () Value
37−parseStringLiteral = StringLiteral <$> C.stringLiteral
38−
39−parseBooleanLiteral :: P.Parsec String () Value
40−parseBooleanLiteral = BooleanLiteral <$> booleanLiteral
41−
42−parseArrayLiteral :: P.Parsec String () Value
43−parseArrayLiteral = ArrayLiteral <$> (C.squares $ C.commaSep parseValue)
44−
45−parseObjectLiteral :: P.Parsec String () Value
46−parseObjectLiteral = ObjectLiteral <$> (C.braces $ C.commaSep parseIdentifierAndValue)
47−
48−parseIdentifierAndValue :: P.Parsec String () (String, Value)
49−parseIdentifierAndValue = do
50− name <- C.lexeme C.identifier
51− C.colon
52− value <- parseValue
53− return (name, value)
54−
55−parseAbs :: P.Parsec String () Value
56−parseAbs = do
57− C.lexeme $ P.char '\\'
58− args <- C.commaSep C.identifier
59− C.lexeme $ P.string "->"
60− value <- parseValue
61− return $ Abs args value
62−
63−parseApp :: P.Parsec String () Value
64−parseApp = App <$> parseValue
65− <*> (C.parens $ C.commaSep parseValue)
66−
67−parseVar :: P.Parsec String () Value
68−parseVar = Var <$> C.identifier
69−
70−parseConstructor :: P.Parsec String () Value
71−parseConstructor = Constructor <$> C.properName
72−
73−parseCase :: P.Parsec String () Value
74−parseCase = Case <$> P.between (C.reserved "case") (C.reserved "of") parseValue
75− <*> C.braces (C.semiSep parseCaseAlternative)
76−
77−parseCaseAlternative :: P.Parsec String () (Binder, Value)
78−parseCaseAlternative = (,) <$> (parseBinder <* C.lexeme (P.string "->")) <*> parseValue
79−
80−parseBlock :: P.Parsec String () Value
81−parseBlock = Block <$> (C.braces $ P.many (parseStatement True))
82−
83−parseValueAtom :: P.Parsec String () Value
84−parseValueAtom = P.choice $ map P.try
85− [ parseNumericLiteral
86− , parseStringLiteral
87− , parseBooleanLiteral
88− , parseArrayLiteral
89− , parseObjectLiteral
90− , parseAbs
91− , parseVar
92− , parseConstructor
93− , parseBlock
94− , parseCase
95− , C.parens parseValue ]
96−
97−parseValue :: P.Parsec String () Value
98−parseValue = buildExpressionParser operators $ C.fold (C.lexeme typedValue) (C.lexeme funArgs) App
99− where
100− typedValue = C.augment parseValueAtom parseTypeAnnotation TypedValue
101− funArgs = C.parens $ C.commaSep parseValue
102− parseTypeAnnotation = C.lexeme (P.string "::") *> parsePolyType
103− operators = [ [ Postfix $ Accessor <$> (C.dot *> C.identifier)
104− , Postfix $ Indexer <$> C.squares parseValue ]
105− , [ Prefix $ C.lexeme (P.char '!') >> return (Unary Not)
106− , Prefix $ C.lexeme (P.char '~') >> return (Unary BitwiseNot)
107− , Prefix $ C.lexeme (P.char '-') >> return (Unary Negate) ]
108− , [ Infix (C.lexeme (P.try (P.string "<=")) >> return (Binary LessThanOrEqualTo)) AssocRight
109− , Infix (C.lexeme (P.try (P.string ">=")) >> return (Binary GreaterThanOrEqualTo)) AssocRight
110− , Infix (C.lexeme (P.try (P.char '<' <* P.notFollowedBy (P.char '<'))) >> return (Binary LessThan)) AssocRight ]
111− , [ Infix (C.lexeme (P.try (P.char '>' <* P.notFollowedBy (P.char '>'))) >> return (Binary GreaterThan)) AssocRight
112− , Infix (C.lexeme (P.char '/') >> return (Binary Divide)) AssocRight
113− , Infix (C.lexeme (P.char '%') >> return (Binary Modulus)) AssocRight ]
114− , [ Infix (C.lexeme (P.try (P.string "++")) >> return (Binary Concat)) AssocRight
115− , Infix (C.lexeme (P.char '+') >> return (Binary Add)) AssocRight
116− , Infix (C.lexeme (P.char '-') >> return (Binary Subtract)) AssocRight ]
117− , [ Infix (C.lexeme (P.string "<<") >> return (Binary ShiftLeft)) AssocRight
118− , Infix (C.lexeme (P.try (P.string ">>>")) >> return (Binary ZeroFillShiftRight)) AssocRight
119− , Infix (C.lexeme (P.string ">>") >> return (Binary ShiftRight)) AssocRight ]
120− , [ Infix (C.lexeme (P.string "==") >> return (Binary EqualTo)) AssocRight
121− , Infix (C.lexeme (P.try (P.string "!=")) >> return (Binary NotEqualTo)) AssocRight ]
122− , [ Infix (C.lexeme (P.try (P.char '&' <* P.notFollowedBy (P.char '&'))) >> return (Binary BitwiseAnd)) AssocRight ]
123− , [ Infix (C.lexeme (P.char '^') >> return (Binary BitwiseXor)) AssocRight ]
124− , [ Infix (C.lexeme (P.try (P.char '|' <* P.notFollowedBy (P.char '|'))) >> return (Binary BitwiseOr)) AssocRight ]
125− , [ Infix (C.lexeme (P.string "&&") >> return (Binary And)) AssocRight ]
126− , [ Infix (C.lexeme (P.string "||") >> return (Binary Or)) AssocRight ]
127− ]
128−
129−parseVariableIntroduction :: Bool -> P.Parsec String () Statement
130−parseVariableIntroduction requireSemi = do
131− C.reserved "var"
132− name <- C.identifier
133− C.lexeme $ P.char '='
134− value <- parseValue
135− when requireSemi (void C.semi)
136− return $ VariableIntroduction name value
137−
138−parseAssignment :: Bool -> P.Parsec String () (Statement)
139−parseAssignment requireSemi = do
140− tgt <- parseAssignmentTarget
141− C.lexeme $ P.char '='
142− value <- parseValue
143− when requireSemi (void C.semi)
144− return $ Assignment tgt value
145−
146−parseManyStatements :: P.Parsec String () [Statement]
147−parseManyStatements = C.braces $ P.many (parseStatement True)
148−
149−parseWhile :: P.Parsec String () Statement
150−parseWhile = While <$> (C.reserved "while" *> C.parens parseValue)
151− <*> parseManyStatements
152−
153−parseFor :: P.Parsec String () Statement
154−parseFor = For <$> (C.reserved "for" *> C.parens forIntro)
155− <*> parseManyStatements
156− where
157− forIntro = (,,) <$> parseStatement False
158− <*> (C.semi *> parseValue)
159− <*> (C.semi *> parseStatement False)
160−
161−parseIfThenElse :: P.Parsec String () Statement
162−parseIfThenElse = IfThenElse
163− <$> (C.reserved "if" *> C.parens parseValue)
164− <*> parseManyStatements
165− <*> P.optionMaybe (C.reserved "else" *> parseManyStatements)
166−
167−parseReturn :: Bool -> P.Parsec String () Statement
168−parseReturn requireSemi = Return <$> (C.reserved "return" *> parseValue <* when requireSemi (void C.semi))
169−
170−parseStatement :: Bool -> P.Parsec String () Statement
171−parseStatement requireSemi = P.choice $ map P.try
172− [ parseVariableIntroduction requireSemi
173− , parseAssignment requireSemi
174− , parseWhile
175− , parseFor
176− , parseIfThenElse
177− , parseReturn requireSemi ]
178−
179−parseStringBinder :: P.Parsec String () Binder
180−parseStringBinder = StringBinder <$> C.stringLiteral
181−
182−parseBooleanBinder :: P.Parsec String () Binder
183−parseBooleanBinder = BooleanBinder <$> booleanLiteral
184−
185−parseNumberBinder :: P.Parsec String () Binder
186−parseNumberBinder = NumberBinder <$> C.naturalOrFloat
187−
188−parseVarBinder :: P.Parsec String () Binder
189−parseVarBinder = VarBinder <$> C.lexeme C.identifier
190−
191−parseNullaryBinder :: P.Parsec String () Binder
192−parseNullaryBinder = NullaryBinder <$> C.lexeme C.properName
193−
194−parseUnaryBinder :: P.Parsec String () Binder
195−parseUnaryBinder = UnaryBinder <$> C.lexeme C.properName <*> parseBinder
196−
197−parseObjectBinder :: P.Parsec String () Binder
198−parseObjectBinder = ObjectBinder <$> C.braces (C.commaSep parseIdentifierAndBinder)
199−
200−parseArrayBinder :: P.Parsec String () Binder
201−parseArrayBinder = C.squares $ ArrayBinder <$> (C.commaSep parseBinder) <*> P.optionMaybe (C.colon *> parseBinder)
202−
203−parseIdentifierAndBinder :: P.Parsec String () (String, Binder)
204−parseIdentifierAndBinder = do
205− name <- C.lexeme C.identifier
206− C.lexeme $ P.char '='
207− binder <- parseBinder
208− return (name, binder)
209−
210−parseBinder :: P.Parsec String () Binder
211−parseBinder = P.choice $ map P.try
212− [ parseStringBinder
213− , parseBooleanBinder
214− , parseNumberBinder
215− , parseVarBinder
216− , parseUnaryBinder
217− , parseNullaryBinder
218− , parseObjectBinder
219− , parseArrayBinder
220− , C.parens parseBinder ]
221−
222−parseAssignmentTarget :: P.Parsec String () AssignmentTarget
223−parseAssignmentTarget = buildExpressionParser operators (AssignVariable <$> C.identifier)
224− where
225− operators = [ [ Postfix $ AssignArrayIndex <$> C.squares parseValue
226− , Postfix $ AssignObjectProperty <$> (C.dot *> C.identifier) ] ]
src/PureScript/TypeChecker.hsdeleted−88
@@ -1,88 +0,0 @@
1−-----------------------------------------------------------------------------
2−--
3−-- Module : PureScript.TypeChecker
4−-- Copyright : (c) Phil Freeman 2013
5−-- License : MIT
6−--
7−-- Maintainer : Phil Freeman <paf31@cantab.net>
8−-- Stability : experimental
9−-- Portability :
10−--
11−-- |
12−--
13−-----------------------------------------------------------------------------
14−
15−{-# LANGUAGE GeneralizedNewtypeDeriving, FlexibleInstances #-}
16−
17−module PureScript.TypeChecker (
18− module PureScript.TypeChecker.Monad,
19− module PureScript.TypeChecker.Kinds,
20− module PureScript.TypeChecker.Types,
21− typeCheckAll,
22−) where
23−
24−import PureScript.TypeChecker.Monad
25−import PureScript.TypeChecker.Kinds
26−import PureScript.TypeChecker.Types
27−import PureScript.TypeChecker.Synonyms
28−
29−import Data.List
30−import Data.Maybe
31−import Data.Function
32−
33−import PureScript.Values
34−import PureScript.Types
35−import PureScript.Kinds
36−import PureScript.Declarations
37−
38−import Control.Monad.State
39−import Control.Monad.Error
40−
41−import qualified Data.Map as M
42−
43−typeCheckAll :: [Declaration] -> Check ()
44−typeCheckAll [] = return ()
45−typeCheckAll (DataDeclaration name args dctors : rest) = do
46− rethrow (("Error in type constructor " ++ name ++ ": ") ++) $ do
47− env <- getEnv
48− guardWith (name ++ " is already defined") $ not $ M.member name (types env)
49− ctorKind <- kindsOf (Just name) args (catMaybes $ map snd dctors)
50− putEnv $ env { types = M.insert name (ctorKind, Data) (types env) }
51− flip mapM_ dctors $ \(dctor, maybeTy) ->
52− rethrow (("Error in data constructor " ++ name ++ ": ") ++) $ do
53− env' <- getEnv
54− guardWith (dctor ++ " is already defined") $ not $ flip M.member (names env') dctor
55− let retTy = foldl TypeApp (TypeConstructor name) (map TypeVar args)
56− let dctorTy = maybe retTy (\ty -> Function [ty] retTy) maybeTy
57− let polyType = PolyType args dctorTy
58− putEnv $ env' { dataConstructors = M.insert dctor polyType (dataConstructors env') }
59− typeCheckAll rest
60−typeCheckAll (TypeSynonymDeclaration name args ty : rest) = do
61− rethrow (("Error in type synonym " ++ name ++ ": ") ++) $ do
62− env <- getEnv
63− guardWith (name ++ " is already defined") $ not $ M.member name (types env)
64− kind <- kindsOf (Just name) args [ty]
65− putEnv $ env { types = M.insert name (kind, TypeSynonym) (types env)
66− , typeSynonyms = M.insert name (args, ty) (typeSynonyms env) }
67− typeCheckAll rest
68−typeCheckAll (TypeDeclaration name ty : ValueDeclaration name' val : rest) | name == name' =
69− typeCheckAll (ValueDeclaration name (TypedValue val ty) : rest)
70−typeCheckAll (TypeDeclaration name _ : _) = throwError $ "Orphan type declaration for " ++ name
71−typeCheckAll (ValueDeclaration name val : rest) = do
72− rethrow (("Error in declaration " ++ name ++ ": ") ++) $ do
73− env <- getEnv
74− case M.lookup name (names env) of
75− Just ty -> throwError $ name ++ " is already defined"
76− Nothing -> do
77− ty <- typeOf name val
78− putEnv (env { names = M.insert name (ty, Value) (names env) })
79− typeCheckAll rest
80−typeCheckAll (ExternDeclaration name ty : rest) = do
81− rethrow (("Error in extern declaration " ++ name ++ ": ") ++) $ do
82− env <- getEnv
83− kind <- kindOf ty
84− guardWith "Expected kind *" $ kind == Star
85− case M.lookup name (names env) of
86− Just _ -> throwError $ name ++ " is already defined"
87− Nothing -> putEnv (env { names = M.insert name (ty, Extern) (names env) })
88− typeCheckAll rest
src/PureScript/TypeChecker/Kinds.hsdeleted−168
@@ -1,168 +0,0 @@
1−-----------------------------------------------------------------------------
2−--
3−-- Module : PureScript.TypeChecker.Kinds
4−-- Copyright : (c) Phil Freeman 2013
5−-- License : MIT
6−--
7−-- Maintainer : Phil Freeman <paf31@cantab.net>
8−-- Stability : experimental
9−-- Portability :
10−--
11−-- |
12−--
13−-----------------------------------------------------------------------------
14−
15−module PureScript.TypeChecker.Kinds (
16− KindConstraint(..),
17− KindSolution(..),
18− kindsOf,
19− kindOf
20−) where
21−
22−import Data.List
23−import Data.Maybe (fromMaybe)
24−import Data.Function
25−
26−import PureScript.Types
27−import PureScript.Kinds
28−import PureScript.Declarations
29−import PureScript.TypeChecker.Monad
30−
31−import Control.Monad.State
32−import Control.Monad.Error
33−
34−import Control.Applicative
35−import Control.Arrow (Kleisli(..), (***))
36−import qualified Control.Category as C
37−
38−import qualified Data.Map as M
39−
40−data KindConstraint = KindConstraint Int Kind
41−
42−instance Show KindConstraint where
43− show (KindConstraint n k) = show n ++ " = " ++ show k
44−
45−newtype KindSolution = KindSolution { runKindSolution :: Int -> Kind }
46−
47−emptyKindSolution :: KindSolution
48−emptyKindSolution = KindSolution KUnknown
49−
50−kindOf :: PolyType -> Check Kind
51−kindOf (PolyType idents ty) = do
52− ns <- replicateM (length idents) fresh
53− (cs, n, m) <- kindConstraints (M.fromList (zip idents ns)) ty
54− solution <- solveKindConstraints cs emptyKindSolution
55− return $ starIfUnknown $ runKindSolution solution n
56−
57−kindsOf :: Maybe String -> [String] -> [Type] -> Check Kind
58−kindsOf name args ts = do
59− tyCon <- fresh
60− nargs <- replicateM (length args) fresh
61− (cs, ns, m) <- kindConstraintsAll (maybe id (flip M.insert tyCon) name $ M.fromList (zipWith (,) args nargs)) ts
62− let extraConstraints = KindConstraint tyCon (foldr FunKind Star (map KUnknown nargs)) : map (flip KindConstraint Star) ns
63− solution <- solveKindConstraints (extraConstraints ++ cs) emptyKindSolution
64− return $ starIfUnknown $ runKindSolution solution tyCon
65−
66−starIfUnknown :: Kind -> Kind
67−starIfUnknown (KUnknown _) = Star
68−starIfUnknown (FunKind k1 k2) = FunKind (starIfUnknown k1) (starIfUnknown k2)
69−starIfUnknown k = k
70−
71−kindConstraintsAll :: M.Map String Int -> [Type] -> Check ([KindConstraint], [Int], M.Map String Int)
72−kindConstraintsAll m [] = return ([], [], m)
73−kindConstraintsAll m (t:ts) = do
74− (cs, n1, m') <- kindConstraints m t
75− (cs', ns, m'') <- kindConstraintsAll m' ts
76− return ((KindConstraint n1 Star) : cs ++ cs', n1:ns, m'')
77−
78−kindConstraints :: M.Map String Int -> Type -> Check ([KindConstraint], Int, M.Map String Int)
79−kindConstraints m (Array t) = do
80− me <- fresh
81− (cs, n1, m') <- kindConstraints m t
82− return ((KindConstraint n1 Star) : (KindConstraint me Star) : cs, me, m')
83−kindConstraints m (Object row) = do
84− me <- fresh
85− (cs, row, m') <- kindConstraintsForRow m row
86− return ((KindConstraint me Star) : (KindConstraint row Row) : cs, me, m')
87−kindConstraints m (Function args ret) = do
88− me <- fresh
89− (cs, ns, m') <- kindConstraintsAll m args
90− (cs', retN, m'') <- kindConstraints m' ret
91− return ((KindConstraint retN Star) : (KindConstraint me Star) : (map (flip KindConstraint Star) ns) ++ cs, me, m'')
92−kindConstraints m (TypeVar v) = do
93− case M.lookup v m of
94− Just u -> return ([], u, m)
95− Nothing -> throwError $ "Unbound type variable " ++ v
96−kindConstraints m (TypeConstructor v) = do
97− env <- getEnv
98− me <- fresh
99− case M.lookup v m of
100− Nothing -> case M.lookup v (types env) of
101− Nothing -> throwError $ "Unknown type constructor '" ++ v ++ "'"
102− Just (kind, _) -> return ([KindConstraint me kind], me, m)
103− Just u -> do
104− return ([KindConstraint me (KUnknown u)], me, m)
105−kindConstraints m (TypeApp t1 t2) = do
106− me <- fresh
107− (cs1, n1, m1) <- kindConstraints m t1
108− (cs2, n2, m2) <- kindConstraints m1 t2
109− return ((KindConstraint n1 (FunKind (KUnknown n2) (KUnknown me))) : cs1 ++ cs2, me, m2)
110−kindConstraints m _ = do
111− me <- fresh
112− return ([KindConstraint me Star], me, m)
113−
114−kindConstraintsForRow :: M.Map String Int -> Row -> Check ([KindConstraint], Int, M.Map String Int)
115−kindConstraintsForRow m (RowVar v) = do
116− me <- case M.lookup v m of
117− Just u -> return u
118− Nothing -> fresh
119− return ([KindConstraint me Row], me, M.insert v me m)
120−kindConstraintsForRow m REmpty = do
121− me <- fresh
122− return ([KindConstraint me Row], me, m)
123−kindConstraintsForRow m (RCons _ ty row) = do
124− me <- fresh
125− (cs1, n1, m1) <- kindConstraints m ty
126− (cs2, n2, m2) <- kindConstraintsForRow m1 row
127− return ((KindConstraint me Row) : (KindConstraint n1 Star) : (KindConstraint n2 Row) : cs1 ++ cs2, me, m2)
128−
129−solveKindConstraints :: [KindConstraint] -> KindSolution -> Check KindSolution
130−solveKindConstraints [] s = return s
131−solveKindConstraints all@(KindConstraint n k:cs) s = do
132− guardWith "Occurs check failed" $ not $ kindOccursCheck False n k
133− let s' = KindSolution $ replaceUnknownKind n k . runKindSolution s
134− cs' <- fmap concat $ mapM (substituteKindConstraint n k) cs
135− solveKindConstraints cs' s'
136−
137−substituteKindConstraint :: Int -> Kind -> KindConstraint -> Check [KindConstraint]
138−substituteKindConstraint n k (KindConstraint m l)
139− | n == m = unifyKinds k l
140− | otherwise = return [KindConstraint m (replaceUnknownKind n k l)]
141−
142−replaceUnknownKind :: Int -> Kind -> Kind -> Kind
143−replaceUnknownKind n k = f
144− where
145− f (KUnknown m) | m == n = k
146− f (FunKind k1 k2) = FunKind (f k2) (f k2)
147− f other = other
148−
149−unifyKinds :: Kind -> Kind -> Check [KindConstraint]
150−unifyKinds (KUnknown u1) (KUnknown u2) | u1 == u2 = return []
151−unifyKinds (KUnknown u) k = do
152− guardWith "Occurs check failed" $ not $ kindOccursCheck False u k
153− return [KindConstraint u k]
154−unifyKinds k (KUnknown u) = do
155− guardWith "Occurs check failed" $ not $ kindOccursCheck False u k
156− return [KindConstraint u k]
157−unifyKinds Star Star = return []
158−unifyKinds Row Row = return []
159−unifyKinds (FunKind k1 k2) (FunKind k3 k4) = do
160− cs1 <- unifyKinds k1 k3
161− cs2 <- unifyKinds k2 k4
162− return $ cs1 ++ cs2
163−unifyKinds k1 k2 = throwError $ "Cannot unify " ++ show k1 ++ " with " ++ show k2 ++ "."
164−
165−kindOccursCheck :: Bool -> Int -> Kind -> Bool
166−kindOccursCheck b u (KUnknown u') | u == u' = b
167−kindOccursCheck _ u (FunKind k1 k2) = kindOccursCheck True u k1 || kindOccursCheck True u k2
168−kindOccursCheck _ _ _ = False
src/PureScript/TypeChecker/Monad.hsdeleted−66
@@ -1,66 +0,0 @@
1−-----------------------------------------------------------------------------
2−--
3−-- Module : PureScript.TypeChecker.Monad
4−-- Copyright : (c) Phil Freeman 2013
5−-- License : MIT
6−--
7−-- Maintainer : Phil Freeman <paf31@cantab.net>
8−-- Stability : experimental
9−-- Portability :
10−--
11−-- |
12−--
13−-----------------------------------------------------------------------------
14−
15−{-# LANGUAGE GeneralizedNewtypeDeriving, FlexibleInstances #-}
16−
17−module PureScript.TypeChecker.Monad where
18−
19−import PureScript.Types
20−import PureScript.Kinds
21−
22−import Control.Applicative
23−import Control.Monad.State
24−import Control.Monad.Error
25−
26−import Control.Arrow ((***))
27−
28−import qualified Data.Map as M
29−
30−data NameKind = Value | Extern deriving Show
31−
32−data TypeDeclarationKind = Data | TypeSynonym deriving Show
33−
34−data Environment = Environment
35− { names :: M.Map String (PolyType, NameKind)
36− , types :: M.Map String (Kind, TypeDeclarationKind)
37− , dataConstructors :: M.Map String PolyType
38− , typeSynonyms :: M.Map String ([String], Type)
39− }
40−
41−emptyEnvironment :: Environment
42−emptyEnvironment = Environment M.empty M.empty M.empty M.empty
43−
44−newtype Check a = Check { unCheck :: StateT (Environment, Int) (Either String) a } deriving (Functor, Monad, Applicative, MonadPlus, MonadState (Environment, Int), MonadError String)
45−
46−getEnv :: Check Environment
47−getEnv = fmap fst get
48−
49−putEnv :: Environment -> Check ()
50−putEnv env = fmap (const env *** id) get >>= put
51−
52−fresh :: Check Int
53−fresh = do
54− (env, n) <- get
55− put (env, n + 1)
56− return n
57−
58−check :: Check a -> Either String (a, Environment)
59−check = fmap (id *** fst) . flip runStateT (emptyEnvironment, 0) . unCheck
60−
61−guardWith :: (MonadError e m) => e -> Bool -> m ()
62−guardWith _ True = return ()
63−guardWith e False = throwError e
64−
65−rethrow :: (MonadError e m) => (e -> e) -> m a -> m a
66−rethrow f = flip catchError $ \e -> throwError (f e)
src/PureScript/TypeChecker/Synonyms.hsdeleted−58
@@ -1,58 +0,0 @@
1−-----------------------------------------------------------------------------
2−--
3−-- Module : PureScript.TypeChecker.Synonyms
4−-- Copyright : (c) Phil Freeman 2013
5−-- License : MIT
6−--
7−-- Maintainer : Phil Freeman <paf31@cantab.net>
8−-- Stability : experimental
9−-- Portability :
10−--
11−-- |
12−--
13−-----------------------------------------------------------------------------
14−
15−{-# LANGUAGE Rank2Types #-}
16−
17−module PureScript.TypeChecker.Synonyms (
18− substituteTypeSynonym
19−) where
20−
21−import PureScript.Types
22−import PureScript.Declarations
23−
24−import Data.Maybe (fromMaybe)
25−import Data.Data
26−import Data.Generics
27−import Control.Arrow
28−import Control.Monad.Writer
29−import Control.Monad.Error
30−import qualified Data.Map as M
31−
32−replaceTypeVars :: M.Map String Type -> Type -> Type
33−replaceTypeVars m = everywhere (mkT replace)
34− where
35− replace :: Type -> Type
36− replace t@(TypeVar var) = fromMaybe t (M.lookup var m)
37− replace t = t
38−
39−buildTypeSubstitution :: String -> Type -> [String] -> Type -> WriterT Any (Either String) (Maybe Type)
40−buildTypeSubstitution name ty args = go (reverse args) M.empty
41− where
42− go :: [String] -> M.Map String Type -> Type -> WriterT Any (Either String) (Maybe Type)
43− go [] m (TypeConstructor ctor) | name == ctor = tell (Any True) >> return (Just $ replaceTypeVars m ty)
44− go (_:_) _ (TypeConstructor ctor) | name == ctor = lift . throwError $ "Partially applied type synonym " ++ name
45− go (arg:args) m (TypeApp f x) = go args (M.insert arg x m) f
46− go _ _ _ = return Nothing
47−
48−everywhereButM' :: (Monad m, Data d) => (forall d. (Data d) => d -> WriterT Any m d) -> d -> m d
49−everywhereButM' f x = do
50− (y, halt) <- runWriterT $ f x
51− case getAny halt of
52− True -> return y
53− _ -> gmapM (everywhereButM' f) y
54−
55−substituteTypeSynonym :: String -> [String] -> Type -> Type -> Either String Type
56−substituteTypeSynonym name args ty = everywhereButM' (mkM replace)
57− where
58− replace t = fmap (fromMaybe t) $ buildTypeSubstitution name ty args t
src/PureScript/TypeChecker/Types.hsdeleted−486
@@ -1,486 +0,0 @@
1−-----------------------------------------------------------------------------
2−--
3−-- Module : PureScript.TypeChecker.Types
4−-- Copyright : (c) Phil Freeman 2013
5−-- License : MIT
6−--
7−-- Maintainer : Phil Freeman <paf31@cantab.net>
8−-- Stability : experimental
9−-- Portability :
10−--
11−-- |
12−--
13−-----------------------------------------------------------------------------
14−
15−module PureScript.TypeChecker.Types (
16− TypeConstraint(..),
17− TypeSolution(..),
18− typeOf
19−) where
20−
21−import Data.List
22−import Data.Function
23−import Data.Data (Data(..))
24−import Data.Generics (everywhere, everywhereM, everything, mkT, mkM, mkQ, extM, extQ)
25−
26−import PureScript.Values
27−import PureScript.Types
28−import PureScript.Kinds
29−import PureScript.TypeChecker.Monad
30−import PureScript.TypeChecker.Kinds
31−import PureScript.TypeChecker.Synonyms
32−
33−import Control.Monad.State
34−import Control.Monad.Error
35−
36−import Control.Applicative
37−import Control.Arrow (Kleisli(..), (***), (&&&))
38−import qualified Control.Category as C
39−
40−import qualified Data.Map as M
41−
42−data TypeConstraint
43− = TypeConstraint Int Type
44− | RowConstraint Int Row deriving Show
45−
46−newtype TypeSolution = TypeSolution { runTypeSolution :: (Int -> Type, Int -> Row) }
47−
48−emptyTypeSolution :: TypeSolution
49−emptyTypeSolution = TypeSolution (TUnknown, RUnknown)
50−
51−typeOf :: String -> Value -> Check PolyType
52−typeOf name val = do
53− me <- fresh
54− (cs, n) <- typeConstraints (M.singleton name me) val
55− solution <- solveTypeConstraints ((TypeConstraint me (TUnknown n)) : cs) emptyTypeSolution
56− return $ varIfUnknown $ fst (runTypeSolution solution) n
57−
58−varIfUnknown :: Type -> PolyType
59−varIfUnknown ty =
60− let
61− (ty', m) = flip runState M.empty $ everywhereM (flip extM g $ mkM f) ty
62− -- TODO : check no nested unknowns
63− in
64− PolyType (sort $ nub $ M.elems m) ty'
65− where
66− f :: Type -> State (M.Map Int String) Type
67− f (TUnknown n) = do
68− m <- get
69− case M.lookup n m of
70− Nothing -> do
71− let name = "t" ++ show (M.size m)
72− put $ M.insert n name m
73− return $ TypeVar name
74− Just name -> return $ TypeVar name
75− f t = return t
76− g :: Row -> State (M.Map Int String) Row
77− g (RUnknown n) = do
78− m <- get
79− case M.lookup n m of
80− Nothing -> do
81− let name = "r" ++ show (M.size m)
82− put $ M.insert n name m
83− return $ RowVar name
84− Just name -> return $ RowVar name
85− g r = return r
86−
87−replaceVarsWithUnknowns :: [String] -> Type -> Check Type
88−replaceVarsWithUnknowns idents = flip evalStateT M.empty . everywhereM (flip extM f $ mkM g)
89− where
90− f :: Type -> StateT (M.Map String Int) Check Type
91− f (TypeVar var) | var `elem` idents = do
92− m <- get
93− n <- lift fresh
94− case M.lookup var m of
95− Nothing -> do
96− put (M.insert var n m)
97− return $ TUnknown n
98− Just u -> return $ TUnknown u
99− f t = return t
100− g :: Row -> StateT (M.Map String Int) Check Row
101− g (RowVar var) | var `elem` idents = do
102− m <- get
103− n <- lift fresh
104− case M.lookup var m of
105− Nothing -> do
106− put (M.insert var n m)
107− return $ RUnknown n
108− Just u -> return $ RUnknown u
109− g r = return r
110−
111−replaceType :: (Data d) => Int -> Type -> d -> d
112−replaceType n t = everywhere (mkT go)
113− where
114− go (TUnknown m) | m == n = t
115− go t = t
116−
117−replaceRow :: (Data d) => Int -> Row -> d -> d
118−replaceRow n r = everywhere (mkT go)
119− where
120− go (RUnknown m) | m == n = r
121− go r = r
122−
123−typeOccursCheck :: Int -> Type -> Check ()
124−typeOccursCheck u (TUnknown _) = return ()
125−typeOccursCheck u t = when (occursCheck u t) $ throwError $ "Occurs check failed: " ++ show u ++ " = " ++ show t
126−
127−rowOccursCheck :: Int -> Row -> Check ()
128−rowOccursCheck u (RUnknown _) = return ()
129−rowOccursCheck u r = when (occursCheck u r) $ throwError $ "Occurs check failed: " ++ show u ++ " = " ++ show r
130−
131−occursCheck :: (Data d) => Int -> d -> Bool
132−occursCheck u = everything (||) $ flip extQ g $ mkQ False f
133− where
134− f (TUnknown u') | u' == u = True
135− f _ = False
136− g (RUnknown u') | u' == u = True
137− g _ = False
138−
139−typeConstraints :: M.Map String Int -> Value -> Check ([TypeConstraint], Int)
140−typeConstraints _ (NumericLiteral _) = do
141− me <- fresh
142− return ([TypeConstraint me Number], me)
143−typeConstraints _ (StringLiteral _) = do
144− me <- fresh
145− return ([TypeConstraint me String], me)
146−typeConstraints _ (BooleanLiteral _) = do
147− me <- fresh
148− return ([TypeConstraint me Boolean], me)
149−typeConstraints m (ArrayLiteral vals) = do
150− all <- mapM (typeConstraints m) vals
151− let (cs, ns) = (concat . map fst &&& map snd) all
152− me <- fresh
153− return (cs ++ map (TypeConstraint me . Array . TUnknown) ns, me)
154−typeConstraints m (Unary op val) = do
155− (cs, n1) <- typeConstraints m val
156− me <- fresh
157− return (cs ++ unaryOperatorConstraints op n1 me, me)
158−typeConstraints m (Binary op left right) = do
159− (cs1, n1) <- typeConstraints m left
160− (cs2, n2) <- typeConstraints m right
161− me <- fresh
162− return (cs1 ++ cs2 ++ binaryOperatorConstraints op n1 n2 me, me)
163−typeConstraints m (ObjectLiteral ps) = do
164− all <- mapM (typeConstraints m . snd) ps
165− let (cs, ns) = (concat . map fst &&& map snd) all
166− me <- fresh
167− let tys = zipWith (\(name, _) u -> (name, TUnknown u)) ps ns
168− return ((TypeConstraint me (Object (typesToRow tys))) : cs, me)
169− where
170− typesToRow [] = REmpty
171− typesToRow ((name, ty):tys) = RCons name ty (typesToRow tys)
172−typeConstraints m (Indexer index val) = do
173− (cs1, n1) <- typeConstraints m index
174− (cs2, n2) <- typeConstraints m val
175− me <- fresh
176− return ((TypeConstraint n1 Number) : (TypeConstraint n2 (Array (TUnknown me))) : cs1 ++ cs2, me)
177−typeConstraints m (Accessor prop val) = do
178− (cs, n1) <- typeConstraints m val
179− me <- fresh
180− rest <- fresh
181− return ((TypeConstraint n1 (Object (RCons prop (TUnknown me) (RUnknown rest)))) : cs, me)
182−typeConstraints m (Abs args ret) = do
183− ns <- replicateM (length args) fresh
184− let m' = m `M.union` M.fromList (zipWith (,) args ns)
185− (cs, n') <- typeConstraints m' ret
186− me <- fresh
187− return ((TypeConstraint me (Function (map TUnknown ns) (TUnknown n'))) : cs, me)
188−typeConstraints m (App f xs) = do
189− (cs1, n1) <- typeConstraints m f
190− all <- mapM (typeConstraints m) xs
191− let (cs2, ns) = (concat . map fst &&& map snd) all
192− me <- fresh
193− return ((TypeConstraint n1 (Function (map TUnknown ns) (TUnknown me))) : cs1 ++ cs2, me)
194−typeConstraints m (Var var) =
195− case M.lookup var m of
196− Nothing -> do
197− env <- getEnv
198− case M.lookup var (names env) of
199− Nothing -> throwError $ var ++ " is undefined"
200− Just (PolyType idents ty, _) -> do
201− me <- fresh
202− replaced <- replaceVarsWithUnknowns idents ty
203− return ([TypeConstraint me replaced], me)
204− Just u -> do
205− me <- fresh
206− return ([TypeConstraint u (TUnknown me)], me)
207−typeConstraints m (Block ss) = do
208− ret <- fresh
209− (cs, allCodePathsReturn, _) <- typeConstraintsForBlock m M.empty ret ss
210− guardWith "Block is missing a return statement" allCodePathsReturn
211− return (cs, ret)
212−typeConstraints m (Constructor c) = do
213− env <- getEnv
214− case M.lookup c (dataConstructors env) of
215− Nothing -> throwError $ "Constructor " ++ c ++ " is undefined"
216− Just (PolyType idents ty) -> do
217− me <- fresh
218− replaced <- replaceVarsWithUnknowns idents ty
219− return ([TypeConstraint me replaced], me)
220−typeConstraints m (Case val binders) = do
221− (cs1, n1) <- typeConstraints m val
222− ret <- fresh
223− cs2 <- typeConstraintsForBinders m n1 ret binders
224− return (cs1 ++ cs2, ret)
225−typeConstraints m (TypedValue val poly@(PolyType idents ty)) = do
226− kind <- kindOf poly
227− guardWith ("Expected type of kind *, was " ++ show kind) $ kind == Star
228− desugared <- replaceAllTypeSynonyms ty
229− (cs, n1) <- typeConstraints m val
230− return (TypeConstraint n1 desugared : cs, n1)
231−
232−replaceAllTypeSynonyms :: Type -> Check Type
233−replaceAllTypeSynonyms ty = do
234− env <- getEnv
235− go (M.toList $ typeSynonyms env) ty
236− where
237− go [] ty = return ty
238− go ((name, (args, repl)):rest) ty = do
239− ty' <- either throwError return (substituteTypeSynonym name args repl ty)
240− go rest ty'
241−
242−unaryOperatorConstraints :: UnaryOperator -> Int -> Int -> [TypeConstraint]
243−unaryOperatorConstraints Negate val result = [TypeConstraint val Number, TypeConstraint result Number]
244−unaryOperatorConstraints Not val result = [TypeConstraint val Boolean, TypeConstraint result Boolean]
245−unaryOperatorConstraints BitwiseNot val result = [TypeConstraint val Number, TypeConstraint result Number]
246−
247−binaryOperatorConstraints :: BinaryOperator -> Int -> Int -> Int -> [TypeConstraint]
248−binaryOperatorConstraints Add = symBinOpConstraints Number
249−binaryOperatorConstraints Subtract = symBinOpConstraints Number
250−binaryOperatorConstraints Multiply = symBinOpConstraints Number
251−binaryOperatorConstraints Divide = symBinOpConstraints Number
252−binaryOperatorConstraints Modulus = symBinOpConstraints Number
253−binaryOperatorConstraints LessThan = asymBinOpConstraints Number Boolean
254−binaryOperatorConstraints LessThanOrEqualTo = asymBinOpConstraints Number Boolean
255−binaryOperatorConstraints GreaterThan = asymBinOpConstraints Number Boolean
256−binaryOperatorConstraints GreaterThanOrEqualTo = asymBinOpConstraints Number Boolean
257−binaryOperatorConstraints BitwiseAnd = symBinOpConstraints Number
258−binaryOperatorConstraints BitwiseOr = symBinOpConstraints Number
259−binaryOperatorConstraints BitwiseXor = symBinOpConstraints Number
260−binaryOperatorConstraints ShiftLeft = symBinOpConstraints Number
261−binaryOperatorConstraints ShiftRight = symBinOpConstraints Number
262−binaryOperatorConstraints ZeroFillShiftRight = symBinOpConstraints Number
263−binaryOperatorConstraints EqualTo = equalityBinOpConstraints
264−binaryOperatorConstraints NotEqualTo = equalityBinOpConstraints
265−binaryOperatorConstraints And = symBinOpConstraints Boolean
266−binaryOperatorConstraints Or = symBinOpConstraints Boolean
267−binaryOperatorConstraints Concat = symBinOpConstraints String
268−
269−equalityBinOpConstraints :: Int -> Int -> Int -> [TypeConstraint]
270−equalityBinOpConstraints left right result = [TypeConstraint left (TUnknown right), TypeConstraint result Boolean]
271−
272−symBinOpConstraints :: Type -> Int -> Int -> Int -> [TypeConstraint]
273−symBinOpConstraints ty left right result = asymBinOpConstraints ty ty left right result
274−
275−asymBinOpConstraints :: Type -> Type -> Int -> Int -> Int -> [TypeConstraint]
276−asymBinOpConstraints ty res left right result = [TypeConstraint left ty, TypeConstraint right ty, TypeConstraint result res]
277−
278−typeConstraintsForBinder :: Int -> Binder -> Check ([TypeConstraint], M.Map String Int)
279−typeConstraintsForBinder val (StringBinder _) = constantBinder val String
280−typeConstraintsForBinder val (NumberBinder _) = constantBinder val Number
281−typeConstraintsForBinder val (BooleanBinder _) = constantBinder val Boolean
282−typeConstraintsForBinder val (VarBinder name) = do
283− me <- fresh
284− return ([TypeConstraint me (TUnknown val)], M.singleton name me)
285−typeConstraintsForBinder val (NullaryBinder ctor) = do
286− env <- getEnv
287− case M.lookup ctor (dataConstructors env) of
288− Just (PolyType args ret) -> do
289− ret' <- replaceVarsWithUnknowns args ret
290− return ([TypeConstraint val ret'], M.empty)
291− _ -> throwError $ "Constructor " ++ ctor ++ " is not defined"
292−typeConstraintsForBinder val (UnaryBinder ctor binder) = do
293− env <- getEnv
294− case M.lookup ctor (dataConstructors env) of
295− Just (PolyType idents f@(Function [_] _)) -> do
296− obj <- fresh
297− (Function [ty] ret) <- replaceVarsWithUnknowns idents f
298− (cs, m1) <- typeConstraintsForBinder obj binder
299− return ((TypeConstraint val ret) : (TypeConstraint obj ty) : cs, m1)
300− Just _ -> throwError $ ctor ++ " is not a unary constructor"
301− _ -> throwError $ "Constructor " ++ ctor ++ " is not defined"
302−typeConstraintsForBinder val (ObjectBinder props) = do
303− row <- fresh
304− rest <- fresh
305− (cs, m1) <- typeConstraintsForProperties row (RUnknown rest) props
306− return ((TypeConstraint val (Object (RUnknown row))) : cs, m1)
307− where
308− typeConstraintsForProperties :: Int -> Row -> [(String, Binder)] -> Check ([TypeConstraint], M.Map String Int)
309− typeConstraintsForProperties nrow row [] = return ([RowConstraint nrow row], M.empty)
310− typeConstraintsForProperties nrow row ((name, binder):binders) = do
311− propTy <- fresh
312− (cs1, m1) <- typeConstraintsForBinder propTy binder
313− (cs2, m2) <- typeConstraintsForProperties nrow (RCons name (TUnknown propTy) row) binders
314− return (cs1 ++ cs2, M.union m1 m2)
315−typeConstraintsForBinder val (ArrayBinder binders rest) = do
316− el <- fresh
317− all <- mapM (typeConstraintsForBinder el) binders
318− let (cs1, m1) = (concat . map fst &&& M.unions . map snd) all
319− let arrayConstraint = TypeConstraint val (Array (TUnknown el))
320− case rest of
321− Nothing -> return (arrayConstraint : cs1, m1)
322− Just binder -> do
323− (cs2, m2) <- typeConstraintsForBinder val binder
324− return (arrayConstraint : cs1 ++ cs2, M.union m1 m2)
325−
326−constantBinder :: Int -> Type -> Check ([TypeConstraint], M.Map String Int)
327−constantBinder val ty = return ([TypeConstraint val ty], M.empty)
328−
329−typeConstraintsForBinders :: M.Map String Int -> Int -> Int -> [(Binder, Value)] -> Check [TypeConstraint]
330−typeConstraintsForBinders _ _ _ [] = return []
331−typeConstraintsForBinders m nval ret ((binder, val):bs) = do
332− (cs1, m1) <- typeConstraintsForBinder nval binder
333− (cs2, n2) <- typeConstraints (M.union m m1) val
334− cs3 <- typeConstraintsForBinders m nval ret bs
335− return ((TypeConstraint n2 (TUnknown ret)) : cs1 ++ cs2 ++ cs3)
336−
337−typeConstraintsForStatement :: M.Map String Int -> M.Map String Int -> Int -> Statement -> Check ([TypeConstraint], Bool, M.Map String Int)
338−typeConstraintsForStatement m mass ret (VariableIntroduction name val) = do
339− case M.lookup name (m `M.union` mass) of
340− Nothing -> do
341− (cs1, n1) <- typeConstraints m val
342− return $ (cs1, False, M.insert name n1 mass)
343− Just ty -> throwError $ "Variable with name " ++ name ++ " already exists."
344−typeConstraintsForStatement m mass ret (Assignment tgt val) = do
345− (cs1, n1) <- typeConstraints m val
346− cs2 <- typeConstraintsForAssignmentTarget m mass n1 tgt
347− return (cs1 ++ cs2, False, mass)
348−typeConstraintsForStatement m mass ret (While val inner) = do
349− (cs1, n1) <- typeConstraints m val
350− (cs2, allCodePathsReturn, _) <- typeConstraintsForBlock m mass ret inner
351− return $ ((TypeConstraint n1 Boolean) : cs1 ++ cs2, allCodePathsReturn, mass)
352−typeConstraintsForStatement m mass ret (IfThenElse val thens Nothing) = do
353− (cs1, n1) <- typeConstraints m val
354− (cs2, allCodePathsReturn, _) <- typeConstraintsForBlock m mass ret thens
355− return $ ((TypeConstraint n1 Boolean) : cs1 ++ cs2, allCodePathsReturn, mass)
356−typeConstraintsForStatement m mass ret (IfThenElse val thens (Just elses)) = do
357− (cs1, n1) <- typeConstraints m val
358− (cs2, allCodePathsReturn1, _) <- typeConstraintsForBlock m mass ret thens
359− (cs3, allCodePathsReturn2, _) <- typeConstraintsForBlock m mass ret elses
360− return $ ((TypeConstraint n1 Boolean) : cs1 ++ cs2 ++ cs3, allCodePathsReturn1 && allCodePathsReturn2, mass)
361−typeConstraintsForStatement m mass ret (For (init, cond, cont) inner) = do
362− (cs1, b1, mass1) <- typeConstraintsForStatement m mass ret init
363− guardWith "Cannot return from inside for" $ not b1
364− (cs2, n1) <- typeConstraints (m `M.union` mass1) cond
365− (cs3, b2, mass2) <- typeConstraintsForStatement (m `M.union` mass1) mass1 ret cont
366− guardWith "Cannot return from inside for" $ not b2
367− (cs4, allCodePathsReturn, _) <- typeConstraintsForBlock (m `M.union` mass2) mass2 ret inner
368− return $ ((TypeConstraint n1 Boolean) : cs1 ++ cs2 ++ cs3 ++ cs4, allCodePathsReturn, mass)
369−typeConstraintsForStatement m mass ret (Return val) = do
370− (cs1, n1) <- typeConstraints (m `M.union` mass) val
371− return ((TypeConstraint n1 (TUnknown ret)) : cs1, True, mass)
372−
373−typeConstraintsForAssignmentTarget :: M.Map String Int -> M.Map String Int -> Int -> AssignmentTarget -> Check [TypeConstraint]
374−typeConstraintsForAssignmentTarget m mass nval (AssignVariable var) =
375− case M.lookup var mass of
376− Nothing -> throwError $ "No local variable with name " ++ var
377− Just ty -> do
378− return [TypeConstraint nval (TUnknown ty)]
379−typeConstraintsForAssignmentTarget m mass nval (AssignArrayIndex index tgt) = do
380− arr <- fresh
381− (cs1, n1) <- typeConstraints (m `M.union` mass) index
382− cs2 <- typeConstraintsForAssignmentTarget m mass arr tgt
383− return $ (TypeConstraint arr (Array (TUnknown nval))) : (TypeConstraint n1 Number) : cs1 ++ cs2
384−typeConstraintsForAssignmentTarget m mass nval (AssignObjectProperty prop tgt) = do
385− obj <- fresh
386− row <- fresh
387− cs <- typeConstraintsForAssignmentTarget m mass obj tgt
388− return $ (TypeConstraint obj (Object (RCons prop (TUnknown nval) $ RUnknown row))) : cs
389−
390−typeConstraintsForBlock :: M.Map String Int -> M.Map String Int -> Int -> [Statement] -> Check ([TypeConstraint], Bool, M.Map String Int)
391−typeConstraintsForBlock _ mass _ [] = return ([], False, mass)
392−typeConstraintsForBlock m mass ret (s:ss) = do
393− (cs1, b1, mass1) <- typeConstraintsForStatement (m `M.union` mass) mass ret s
394− case (b1, ss) of
395− (True, []) -> return (cs1, True, mass1)
396− (True, _) -> throwError "Unreachable code"
397− (False, ss) -> do
398− (cs2, b2, mass2) <- typeConstraintsForBlock m mass1 ret ss
399− return (cs1 ++ cs2, b2, mass2)
400−
401−solveTypeConstraints :: [TypeConstraint] -> TypeSolution -> Check TypeSolution
402−solveTypeConstraints [] s = return s
403−solveTypeConstraints all@(TypeConstraint n t:cs) s = do
404− typeOccursCheck n t
405− let s' = let (f, g) = runTypeSolution s
406− in TypeSolution (replaceType n t . f, replaceType n t . g)
407− cs' <- fmap concat $ mapM (substituteTypeInConstraint n t) cs
408− solveTypeConstraints cs' s'
409−solveTypeConstraints (RowConstraint n r:cs) s = do
410− rowOccursCheck n r
411− let s' = let (f, g) = runTypeSolution s
412− in TypeSolution $ (replaceRow n r . f, replaceRow n r . g)
413− cs' <- fmap concat $ mapM (substituteRowInConstraint n r) cs
414− solveTypeConstraints cs' s'
415−
416−substituteTypeInConstraint :: Int -> Type -> TypeConstraint -> Check [TypeConstraint]
417−substituteTypeInConstraint n s (TypeConstraint m t)
418− | n == m = unifyTypes s t
419− | otherwise = return [TypeConstraint m (replaceType n s t)]
420−substituteTypeInConstraint n s (RowConstraint m r)
421− = return [RowConstraint m (replaceType n s r)]
422−
423−substituteRowInConstraint :: Int -> Row -> TypeConstraint -> Check [TypeConstraint]
424−substituteRowInConstraint n r (TypeConstraint m t)
425− = return [TypeConstraint m (replaceRow n r t)]
426−substituteRowInConstraint n r (RowConstraint m r1)
427− | m == n = unifyRows r r1
428− | otherwise = return [RowConstraint m (replaceRow n r r1)]
429−
430−unifyTypes :: Type -> Type -> Check [TypeConstraint]
431−unifyTypes (TUnknown u1) (TUnknown u2) | u1 == u2 = return []
432−unifyTypes (TUnknown u) t = do
433− typeOccursCheck u t
434− return [TypeConstraint u t]
435−unifyTypes t (TUnknown u) = do
436− typeOccursCheck u t
437− return [TypeConstraint u t]
438−unifyTypes Number Number = return []
439−unifyTypes String String = return []
440−unifyTypes Boolean Boolean = return []
441−unifyTypes (Array s) (Array t) = unifyTypes s t
442−unifyTypes (Object row1) (Object row2) = unifyRows row1 row2
443−unifyTypes (Function args1 ret1) (Function args2 ret2) = do
444− guardWith "Function applied to incorrect number of args" $ length args1 == length args2
445− cs1 <- fmap concat $ zipWithM unifyTypes args1 args2
446− cs2 <- unifyTypes ret1 ret2
447− return $ cs1 ++ cs2
448−unifyTypes (TypeVar v1) (TypeVar v2) | v1 == v2 = return []
449−unifyTypes (TypeConstructor c1) (TypeConstructor c2) | c1 == c2 = return []
450−unifyTypes (TypeVar v1) (TypeVar v2) = return []
451−unifyTypes (TypeApp t1 t2) (TypeApp t3 t4) = do
452− cs1 <- unifyTypes t1 t3
453− cs2 <- unifyTypes t2 t4
454− return $ cs1 ++ cs2
455−unifyTypes t1 t2 = throwError $ "Cannot unify " ++ show t1 ++ " with " ++ show t2 ++ "."
456−
457−unifyRows :: Row -> Row -> Check [TypeConstraint]
458−unifyRows r1 r2 =
459− let
460− (s1, r1') = toList r1
461− (s2, r2') = toList r2
462− int = [ (t1, t2) | (name, t1) <- s1, (name', t2) <- s2, name == name' ]
463− sd1 = [ (name, t1) | (name, t1) <- s1, not (elem name (map fst s2)) ]
464− sd2 = [ (name, t2) | (name, t2) <- s2, not (elem name (map fst s1)) ]
465− in rethrow (\e -> "Cannot unify " ++ show r1 ++ " with " ++ show r2 ++ ": " ++ e) $ do
466− cs1 <- fmap concat $ mapM (uncurry unifyTypes) int
467− cs2 <- unifyRows' sd1 r1' sd2 r2'
468− return $ cs1 ++ cs2
469− where
470− unifyRows' :: [(String, Type)] -> Row -> [(String, Type)] -> Row -> Check [TypeConstraint]
471− unifyRows' [] (RUnknown u) sd r = do
472− rowOccursCheck u r
473− return [RowConstraint u (fromList (sd, r))]
474− unifyRows' ((name, ty):row) r others (RUnknown u) = do
475− u' <- fresh
476− cs <- unifyRows' row r others (RUnknown u')
477− return [ RowConstraint u (RCons name ty (RUnknown u')) ]
478− unifyRows' [] REmpty [] REmpty = return []
479− unifyRows' sd1 r1 sd2 r2 = throwError $ "Cannot unify " ++ show (fromList (sd1, r1)) ++ " with " ++ show (fromList (sd2, r2)) ++ "."
480− toList :: Row -> ([(String, Type)], Row)
481− toList (RCons name ty row) = let (tys, rest) = toList row
482− in ((name, ty):tys, rest)
483− toList r = ([], r)
484− fromList :: ([(String, Type)], Row) -> Row
485− fromList ([], r) = r
486− fromList ((name, t):ts, r) = RCons name t (fromList (ts, r))
src/PureScript/Types.hsdeleted−42
@@ -1,42 +0,0 @@
1−-----------------------------------------------------------------------------
2−--
3−-- Module : Purescript.Types
4−-- Copyright : (c) Phil Freeman 2013
5−-- License : MIT
6−--
7−-- Maintainer : Phil Freeman <paf31@cantab.net>
8−-- Stability : experimental
9−-- Portability :
10−--
11−-- |
12−--
13−-----------------------------------------------------------------------------
14−
15−{-# LANGUAGE DeriveDataTypeable #-}
16−
17−module PureScript.Types where
18−
19−import Data.Data
20−
21−data Type
22− = TUnknown Int
23− | Number
24− | String
25− | Boolean
26− | Array Type
27− | Object Row
28− | Function [Type] Type
29− | TypeVar String
30− | TypeConstructor String
31− | TypeApp Type Type deriving (Show, Data, Typeable)
32−
33−data PolyType = PolyType [String] Type deriving (Show, Data, Typeable)
34−
35−data Row
36− = RUnknown Int
37− | RowVar String
38− | REmpty
39− | RCons String Type Row deriving (Show, Data, Typeable)
40−
41−monoType :: Type -> PolyType
42−monoType = PolyType []
src/PureScript/Values.hsdeleted−89
@@ -1,89 +0,0 @@
1−-----------------------------------------------------------------------------
2−--
3−-- Module : PureScript.Values
4−-- Copyright : (c) Phil Freeman 2013
5−-- License : MIT
6−--
7−-- Maintainer : Phil Freeman <paf31@cantab.net>
8−-- Stability : experimental
9−-- Portability :
10−--
11−-- |
12−--
13−-----------------------------------------------------------------------------
14−
15−{-# LANGUAGE DeriveDataTypeable #-}
16−
17−module PureScript.Values where
18−
19−import PureScript.Types
20−
21−import Data.Data
22−
23−data UnaryOperator
24− = Negate
25− | Not
26− | BitwiseNot deriving (Show, Eq, Data, Typeable)
27−
28−data BinaryOperator
29− = Add
30− | Subtract
31− | Multiply
32− | Divide
33− | Modulus
34− | EqualTo
35− | NotEqualTo
36− | LessThan
37− | LessThanOrEqualTo
38− | GreaterThan
39− | GreaterThanOrEqualTo
40− | And
41− | Or
42− | BitwiseAnd
43− | BitwiseOr
44− | BitwiseXor
45− | ShiftLeft
46− | ShiftRight
47− | ZeroFillShiftRight
48− | Concat deriving (Show, Eq, Data, Typeable)
49−
50−data Value
51− = NumericLiteral (Either Integer Double)
52− | StringLiteral String
53− | BooleanLiteral Bool
54− | Unary UnaryOperator Value
55− | Binary BinaryOperator Value Value
56− | ArrayLiteral [Value]
57− | Indexer Value Value
58− | ObjectLiteral [(String, Value)]
59− | Accessor String Value
60− | Abs [String] Value
61− | App Value [Value]
62− | Var String
63− | Block [Statement]
64− | Constructor String
65− | Case Value [(Binder, Value)]
66− | TypedValue Value PolyType deriving (Show, Data, Typeable)
67−
68−data Statement
69− = VariableIntroduction String Value
70− | Assignment AssignmentTarget Value
71− | While Value [Statement]
72− | For (Statement, Value, Statement) [Statement]
73− | IfThenElse (Value) [Statement] (Maybe [Statement])
74− | Return Value deriving (Show, Data, Typeable)
75−
76−data Binder
77− = BooleanBinder Bool
78− | StringBinder String
79− | NumberBinder (Either Integer Double)
80− | VarBinder String
81− | NullaryBinder String
82− | UnaryBinder String Binder
83− | ObjectBinder [(String, Binder)]
84− | ArrayBinder [Binder] (Maybe Binder) deriving (Show, Data, Typeable)
85−
86−data AssignmentTarget
87− = AssignVariable String
88− | AssignObjectProperty String AssignmentTarget
89− | AssignArrayIndex Value AssignmentTarget deriving (Show, Data, Typeable)
src/Tests.hsnew file+141
@@ -0,0 +1,141 @@
1+module Tests (runTests) where
2+
3+import Prelude.Compat
4+import Data.List
5+import Control.Applicative
6+import Control.Monad
7+
8+import System.Process
9+import System.FilePath
10+import System.IO
11+import System.Directory
12+
13+-------------------------------------------------------------------------------
14+testsDir :: IO (FilePath, FilePath)
15+-------------------------------------------------------------------------------
16+testsDir = do
17+ baseDir <- getCurrentDirectory
18+ return (baseDir </> "purescript-tests", baseDir)
19+
20+-------------------------------------------------------------------------------
21+runTests :: IO ()
22+-------------------------------------------------------------------------------
23+runTests = do
24+
25+ (outputDir, baseDir) <- testsDir
26+
27+ outputDirExists <- doesDirectoryExist outputDir
28+ when outputDirExists $ removeDirectoryRecursive outputDir
29+ createDirectory outputDir
30+
31+ let srcDir = outputDir </> "src"
32+ createDirectory srcDir
33+
34+ callProcess "git" ["clone", "--branch", "v0.13.8", "--depth", "1", "https://github.com/purescript/purescript.git"]
35+ let passingDir = baseDir </> "purescript" </> "tests" </> "purs" </> "passing"
36+ passingTestCases <- sort . filter (".purs" `isSuffixOf`) <$> getDirectoryContents passingDir
37+
38+ setCurrentDirectory outputDir
39+
40+ fetchPackages
41+
42+ let tests = filter (`notElem` skipped) passingTestCases
43+
44+ tmp <- getTemporaryDirectory
45+ createDirectoryIfMissing False (tmp </> logpath)
46+ outputFile <- openFile (tmp </> logpath </> logfile) WriteMode
47+ hClose outputFile
48+
49+ -- Run the tests
50+ --
51+ forM_ tests $ \inputFile -> do
52+ --
53+ -- Compile/build
54+ --
55+ putStrLn $ "Compiling test " ++ inputFile ++ " ..."
56+ setCurrentDirectory outputDir
57+ copyFile (passingDir </> inputFile) (srcDir </> inputFile)
58+
59+ let testCaseDir = passingDir </> (takeWhile (/='.') inputFile)
60+ testCaseDirExists <- doesDirectoryExist testCaseDir
61+ when testCaseDirExists $ callProcess "cp" ["-R", testCaseDir, srcDir]
62+
63+ callProcess "rm" ["-rf", "output"]
64+ callProcess "rm" ["-rf", "Main"]
65+ callProcess "spago" ["build"]
66+ --
67+ -- Run executable file
68+ --
69+ outputFile <- openFile (tmp </> logpath </> logfile) AppendMode
70+ hPutStrLn outputFile ("\n" ++ inputFile ++ ":")
71+ proc <- runProcess ("./" </> "Main") [] Nothing Nothing Nothing (Just outputFile) Nothing
72+
73+ removeFile (srcDir </> inputFile)
74+ when testCaseDirExists $ callProcess "rm" ["-rf", srcDir </> (takeWhile (/='.') inputFile)]
75+
76+ -- TODO: support failing test cases
77+ --
78+ -- let failing = baseDir </> "examples" </> "failing"
79+ -- failingTestCases <- sort . filter (".purs" `isSuffixOf`) <$> getDirectoryContents failing
80+ --
81+
82+ setCurrentDirectory baseDir
83+ putStrLn "PureScript tests finished"
84+ putStrLn $ "Total tests available: " ++ show (length passingTestCases)
85+ putStrLn $ "Tests run: " ++ show (length tests)
86+ putStrLn $ "Tests skipped: " ++ show (length skipped)
87+
88+-------------------------------------------------------------------------------
89+packages :: [String]
90+-------------------------------------------------------------------------------
91+packages =
92+ [ "arrays"
93+ , "assert"
94+ , "console"
95+ , "control"
96+ , "effect"
97+ , "foldable-traversable"
98+ , "functions"
99+ , "generics-rep"
100+ , "invariant"
101+ , "newtype"
102+ , "partial"
103+ , "prelude"
104+ , "proxy"
105+ , "refs"
106+ , "st"
107+ , "type-equality"
108+ , "typelevel-prelude"
109+ ]
110+
111+-------------------------------------------------------------------------------
112+fetchPackages :: IO ()
113+-------------------------------------------------------------------------------
114+fetchPackages = do
115+ callProcess "spago" ["init"]
116+ callCommand "sed '$s/\\(}\\)/, backend = \"psgo\"\\1/' < spago.dhall | dhall format > spago.tmp"
117+ callCommand "mv spago.tmp spago.dhall"
118+
119+ mapM (callProcess "spago" . (\p -> ["install", p])) packages
120+ return ()
121+
122+-------------------------------------------------------------------------------
123+skipped :: [String]
124+-------------------------------------------------------------------------------
125+skipped =
126+ [ "2172.purs" -- foreign in Main needed (test manually)
127+ , "EffFn.purs" -- foreign in Main needed (test manually)
128+ , "FunWithFunDeps.purs" -- foreign in Main needed (test manually)
129+ , "NumberLiterals.purs" -- unreliable float string comparison (test manually)
130+ , "PolyLabels.purs" -- foreign in Main needed (test manually)
131+ , "RowUnion.purs" -- foreign in Main needed (test manually)
132+ , "ShadowedModuleName.purs" -- ?
133+ , "StringEdgeCases.purs" -- javascript char encoding specific
134+ , "StringEscapes.purs" -- Partially javascript-char-encoding-specific (test manually)
135+ ]
136+
137+logpath :: FilePath
138+logpath = "purescript-output"
139+
140+logfile :: FilePath
141+logfile = "purescript-tests.out"
stack.nixnew file+23
@@ -0,0 +1,23 @@
1+#
2+# You may need to manually run `unset STACK_IN_NIX_SHELL`
3+# (doesn't work from a `shellHook`; see: https://github.com/commercialhaskell/stack/issues/5000
4+#
5+#
6+# You may need to set LC_ALL when building, e.g.
7+# LC_ALL=en_US.iso88591 stack --nix build; see e.g. https://github.com/koalaman/shellcheck/issues/324
8+#
9+#
10+{ pkgs ?
11+ import (builtins.fetchTarball {
12+ name = "nixos-release-19.03";
13+ url = https://github.com/nixos/nixpkgs/archive/34c7eb7545d155cc5b6f499b23a7cb1c96ab4d59.tar.gz;
14+ sha256 = "11z6ajj108fy2q5g8y4higlcaqncrbjm3dnv17pvif6avagw4mcb";
15+ }) {}
16+}:
17+
18+pkgs.haskell.lib.buildStackProject {
19+ name = "default-stack-shell";
20+ ghc = pkgs.haskell.compiler.ghc865;
21+ buildInputs = with pkgs; [git git-lfs gmp ncurses zlib];
22+ LANG = "en_US.UTF-8";
23+}
stack.yamlnew file+24
@@ -0,0 +1,24 @@
1+resolver: lts-13.26
2+
3+packages:
4+- .
5+
6+extra-deps:
7+- git: https://github.com/purescript/purescript
8+ commit: 9cad73ed8ea7df3011032ddbd2f3de5a0c08629c
9+- happy-1.19.9
10+- language-javascript-0.7.0.0
11+- network-3.0.1.1
12+- these-1.0.1
13+- semialign-1
14+
15+nix:
16+ enable: false
17+ shell-file: stack.nix
18+
19+flags:
20+ aeson-pretty:
21+ lib-only: true
22+ these:
23+ assoc: false
24+ quickcheck: false
support/ffi-loader.gonew file+30
@@ -0,0 +1,30 @@
1+package ffi_loader
2+
3+// Load PureScript standard library FFI packages. Comment out the ones you don't need for
4+// faster/smaller builds.
5+
6+import (
7+ _ "github.com/purescript-native/go-ffi/purescript-arrays"
8+ _ "github.com/purescript-native/go-ffi/purescript-assert"
9+ _ "github.com/purescript-native/go-ffi/purescript-console"
10+ _ "github.com/purescript-native/go-ffi/purescript-effect"
11+ _ "github.com/purescript-native/go-ffi/purescript-enums"
12+ _ "github.com/purescript-native/go-ffi/purescript-exceptions"
13+ _ "github.com/purescript-native/go-ffi/purescript-foldable-traversable"
14+ _ "github.com/purescript-native/go-ffi/purescript-functions"
15+ _ "github.com/purescript-native/go-ffi/purescript-globals"
16+ _ "github.com/purescript-native/go-ffi/purescript-integers"
17+ _ "github.com/purescript-native/go-ffi/purescript-lazy"
18+ _ "github.com/purescript-native/go-ffi/purescript-math"
19+ _ "github.com/purescript-native/go-ffi/purescript-partial"
20+ _ "github.com/purescript-native/go-ffi/purescript-prelude"
21+ _ "github.com/purescript-native/go-ffi/purescript-random"
22+ _ "github.com/purescript-native/go-ffi/purescript-refs"
23+ _ "github.com/purescript-native/go-ffi/purescript-st"
24+ _ "github.com/purescript-native/go-ffi/purescript-strings"
25+ _ "github.com/purescript-native/go-ffi/purescript-unfoldable"
26+)
27+
28+// Add your own FFI packages here.
29+
30+import ()
support/go.mod.ffi-loadernew file+2
@@ -0,0 +1,2 @@
1+module $PROJECT/purescript-native/ffi-loader
2+
support/go.mod.outputnew file+2
@@ -0,0 +1,2 @@
1+module $PROJECT/purescript-native/output
2+
support/go.mod.workingnew file+1
@@ -0,0 +1 @@
1+module $PROJECT/example
test/Spec.hsnew file+2
@@ -0,0 +1,2 @@
1+main :: IO ()
2+main = putStrLn "Test suite not yet implemented"