Compare commits
117 Commits
| Author | SHA1 | Date | |
|---|---|---|---|
| d96f1a80d5 | |||
| 6c0ea774c4 | |||
| 69ad8ce9bc | |||
| 3877174acb | |||
| 448adb8890 | |||
| 864a94c59e | |||
| 518ae8e659 | |||
| df12f6af91 | |||
| 6aed5dfacb | |||
| cecc977898 | |||
| 74933b0616 | |||
| 6a27c4a68b | |||
| d526e55c26 | |||
| 6f7f5fa13c | |||
| 2d6381dc6f | |||
| 3663b4e5d0 | |||
| 4478fee6e6 | |||
| 79ae92a068 | |||
| eb968d3cb9 | |||
| 054a5a4867 | |||
| e198dd8311 | |||
| 46a996ead8 | |||
| 2bf6ab7655 | |||
| 5ff7aa5821 | |||
| 045df292be | |||
| c97eb99921 | |||
| 4c78ab3aee | |||
| 5ff983b0b3 | |||
| 4bf382a997 | |||
| 4c72045a86 | |||
| 7daf218b2a | |||
| 973850e6a6 | |||
| 19948c6aad | |||
| c4660fe0cf | |||
| e326908623 | |||
| 9be528a579 | |||
| f67d7354a2 | |||
| 6f873e45b8 | |||
| 8c3b675b0d | |||
| 41011d15cc | |||
| 9e0f84ec67 | |||
| 8b4f471d42 | |||
| dc5fd74934 | |||
| 6a59e455ce | |||
| 85408a12a2 | |||
| 79137e058e | |||
| dd5fc17554 | |||
| a617a6469d | |||
| 502a4e6464 | |||
| c647a2cd34 | |||
| 292d1aa65b | |||
| 259bae1720 | |||
| a47fa59f5b | |||
| 2bf5e59e2b | |||
| 02ba4b265b | |||
| c26ace6c2c | |||
| cfb1605a76 | |||
| 20085301ef | |||
| 3c8d9561a0 | |||
| 523d6b03a9 | |||
| 961f557215 | |||
| 0cf6a52b26 | |||
| a3efaf71a7 | |||
| c7a8a4af22 | |||
| 0ef7c59771 | |||
| 894ae19435 | |||
| cee8a4ecf3 | |||
| bde5a3c071 | |||
| 6612c29758 | |||
| 2e0c44862c | |||
| 7fa98892a8 | |||
| d38367e023 | |||
| 592869bf75 | |||
| 4f9d4e5c07 | |||
| 20aeade545 | |||
| c745827c53 | |||
| 389e931674 | |||
| d571993405 | |||
| ff11943576 | |||
| 66528c8a6a | |||
| 46c746da1c | |||
| d3ce5010d0 | |||
| 1c346af85e | |||
| 69fa03ca9f | |||
| 03c6ae1c74 | |||
| 990df562e0 | |||
| fc82b1646c | |||
| 81f277127d | |||
| 11dc632927 | |||
| e81439779c | |||
| e5c64a5fad | |||
| a34558412d | |||
| 95c41b8eee | |||
| 3a6337d8ca | |||
| 5a7d352b11 | |||
| 9eab558642 | |||
| 17a1fd8095 | |||
| 5628cf90b8 | |||
| 46963a8326 | |||
| 5513c4de1b | |||
| ab6d7fbf56 | |||
| a14fa93920 | |||
| c411f11fd0 | |||
| 3e2281a834 | |||
| 7b5db76c13 | |||
| 95f1262b21 | |||
| 2bbb16654f | |||
| 093a5ff766 | |||
| 66c392e8af | |||
| a64b72d04b | |||
| 6236b33115 | |||
| 3b352d8093 | |||
| ed3ed6ded6 | |||
| a60d04d794 | |||
| 10d9c62d53 | |||
| e3950f6c1d | |||
| 344ec74eaa |
+3
-1
@@ -1,5 +1,5 @@
|
||||
.rebar3
|
||||
_*
|
||||
_[^_]*
|
||||
.eunit
|
||||
*.o
|
||||
*.beam
|
||||
@@ -19,3 +19,5 @@ rebar3.crashdump
|
||||
*.erl~
|
||||
*.aes~
|
||||
aesophia
|
||||
.qcci
|
||||
current_counterexample.eqc
|
||||
|
||||
+39
-1
@@ -7,6 +7,43 @@ and this project adheres to [Semantic Versioning](https://semver.org/spec/v2.0.0
|
||||
## [Unreleased]
|
||||
### Added
|
||||
### Changed
|
||||
- New syntax for tuple types. Now 0-tuple type is encoded as `unit` instead of `()` and
|
||||
regular tuples are encoded by interspersing inner types with `*`, for instance `int * string`.
|
||||
Parens are not necessary. Note it only affects the types, values remain as their were before,
|
||||
so `(1, "a") : int * string`
|
||||
|
||||
### Removed
|
||||
|
||||
## [3.2.0] - 2019-06-28
|
||||
### Added
|
||||
- New builtin function `require : (bool, string) => ()`. Defined as
|
||||
```
|
||||
function require(b, err) = if(!b) abort(err)
|
||||
```
|
||||
- New builtin functions
|
||||
```
|
||||
Bytes.to_str : bytes(_) => string
|
||||
Bytes.to_int : bytes(_) => int
|
||||
```
|
||||
for converting a byte array to a hex string and interpreting it as a
|
||||
big-endian encoded integer respectively.
|
||||
### Changed
|
||||
- Public contract functions must now be declared as *entrypoints*:
|
||||
```
|
||||
contract Example =
|
||||
// Exported
|
||||
entrypoint exported_fun(x) = local_fun(x)
|
||||
// Not exported
|
||||
function local_fun(x) = x
|
||||
```
|
||||
Functions in namespaces still use `function` (and `private function` for
|
||||
private functions).
|
||||
- The return type of `Chain.block_hash(height)` has changed, it used to
|
||||
be `int`, where `0` denoted an incorrect height. New return type is
|
||||
`option(hash)`, where `None` represents an incorrect height.
|
||||
- Event name hashes now use BLAKE2b instead of Keccak256.
|
||||
- Fixed bugs when defining record types in namespaces.
|
||||
- Fixed a bug in include path handling when passing options to the compiler.
|
||||
### Removed
|
||||
|
||||
## [3.1.0] - 2019-06-03
|
||||
@@ -71,7 +108,8 @@ and this project adheres to [Semantic Versioning](https://semver.org/spec/v2.0.0
|
||||
- Simplify calldata creation - instead of passing a compiled contract, simply
|
||||
pass a (stubbed) contract string.
|
||||
|
||||
[Unreleased]: https://github.com/aeternity/aesophia/compare/v3.1.0...HEAD
|
||||
[Unreleased]: https://github.com/aeternity/aesophia/compare/v3.2.0...HEAD
|
||||
[3.2.0]: https://github.com/aeternity/aesophia/compare/v3.1.0...v3.2.0
|
||||
[3.1.0]: https://github.com/aeternity/aesophia/compare/v3.0.0...v3.1.0
|
||||
[3.0.0]: https://github.com/aeternity/aesophia/compare/v2.1.0...v3.0.0
|
||||
[2.1.0]: https://github.com/aeternity/aesophia/compare/v2.0.0...v2.1.0
|
||||
|
||||
+3
-2
@@ -2,8 +2,9 @@
|
||||
|
||||
{erl_opts, [debug_info]}.
|
||||
|
||||
{deps, [ {aebytecode, {git, "https://github.com/aeternity/aebytecode.git", {ref, "f129887"}}}
|
||||
{deps, [ {aebytecode, {git, "https://github.com/aeternity/aebytecode.git", {ref,"adf3664"}}}
|
||||
, {getopt, "1.0.1"}
|
||||
, {eblake2, "1.0.0"}
|
||||
, {jsx, {git, "https://github.com/talentdeficit/jsx.git",
|
||||
{tag, "2.8.0"}}}
|
||||
]}.
|
||||
@@ -14,7 +15,7 @@
|
||||
{base_plt_apps, [erts, kernel, stdlib, crypto, mnesia]}
|
||||
]}.
|
||||
|
||||
{relx, [{release, {aesophia, "3.1.0"},
|
||||
{relx, [{release, {aesophia, "3.2.0"},
|
||||
[aesophia, aebytecode, getopt]},
|
||||
|
||||
{dev_mode, true},
|
||||
|
||||
+2
-2
@@ -1,7 +1,7 @@
|
||||
{"1.1.0",
|
||||
[{<<"aebytecode">>,
|
||||
{git,"https://github.com/aeternity/aebytecode.git",
|
||||
{ref,"f1298870e526f4e9330447d3a281af5ef4e06e17"}},
|
||||
{ref,"adf3664dd03626c115756f79fa0e602fda24318d"}},
|
||||
0},
|
||||
{<<"aeserialization">>,
|
||||
{git,"https://github.com/aeternity/aeserialization.git",
|
||||
@@ -11,7 +11,7 @@
|
||||
{git,"https://github.com/aeternity/erl-base58.git",
|
||||
{ref,"60a335668a60328a29f9731b67c4a0e9e3d50ab6"}},
|
||||
2},
|
||||
{<<"eblake2">>,{pkg,<<"eblake2">>,<<"1.0.0">>},1},
|
||||
{<<"eblake2">>,{pkg,<<"eblake2">>,<<"1.0.0">>},0},
|
||||
{<<"getopt">>,{pkg,<<"getopt">>,<<"1.0.1">>},0},
|
||||
{<<"jsx">>,
|
||||
{git,"https://github.com/talentdeficit/jsx.git",
|
||||
|
||||
+39
-18
@@ -9,7 +9,9 @@
|
||||
|
||||
-module(aeso_aci).
|
||||
|
||||
-export([ contract_interface/2
|
||||
-export([ file/2
|
||||
, file/3
|
||||
, contract_interface/2
|
||||
, contract_interface/3
|
||||
|
||||
, render_aci_json/1
|
||||
@@ -22,6 +24,18 @@
|
||||
-type json_text() :: binary().
|
||||
|
||||
%% External API
|
||||
-spec file(aci_type(), string()) -> {ok, json() | string()} | {error, term()}.
|
||||
file(Type, File) ->
|
||||
file(Type, File, []).
|
||||
|
||||
file(Type, File, Options0) ->
|
||||
Options = aeso_compiler:add_include_path(File, Options0),
|
||||
case file:read_file(File) of
|
||||
{ok, BinCode} ->
|
||||
do_contract_interface(Type, binary_to_list(BinCode), Options);
|
||||
{error, _} = Err -> Err
|
||||
end.
|
||||
|
||||
-spec contract_interface(aci_type(), string()) ->
|
||||
{ok, json() | string()} | {error, term()}.
|
||||
contract_interface(Type, ContractString) ->
|
||||
@@ -75,8 +89,8 @@ join_errors(Prefix, Errors, Pfun) ->
|
||||
Ess = [ Pfun(E) || E <- Errors ],
|
||||
list_to_binary(string:join([Prefix|Ess], "\n")).
|
||||
|
||||
encode_contract(Contract) ->
|
||||
C0 = #{name => encode_name(contract_name(Contract))},
|
||||
encode_contract(Contract = {contract, _, {con, _, Name}, _}) ->
|
||||
C0 = #{name => encode_name(Name)},
|
||||
|
||||
Tdefs0 = [ encode_typedef(T) || T <- sort_decls(contract_types(Contract)) ],
|
||||
FilterT = fun(N) -> fun(#{name := N1}) -> N == N1 end end,
|
||||
@@ -97,9 +111,13 @@ encode_contract(Contract) ->
|
||||
|
||||
Fdefs = [ encode_function(F)
|
||||
|| F <- sort_decls(contract_funcs(Contract)),
|
||||
not is_private(F) ],
|
||||
is_entrypoint(F) ],
|
||||
|
||||
#{contract => C3#{functions => Fdefs}}.
|
||||
#{contract => C3#{functions => Fdefs}};
|
||||
encode_contract(Namespace = {namespace, _, {con, _, Name}, _}) ->
|
||||
Tdefs = [ encode_typedef(T) || T <- sort_decls(contract_types(Namespace)) ],
|
||||
#{namespace => #{name => encode_name(Name),
|
||||
type_defs => Tdefs}}.
|
||||
|
||||
%% Encode a function definition. Currently we are only interested in
|
||||
%% the interface and type.
|
||||
@@ -212,23 +230,27 @@ do_render_aci_json(Json) ->
|
||||
_ -> error(bad_aci_json)
|
||||
end
|
||||
end,
|
||||
DecodedContracts = [ decode_contract(C) || #{contract := C} <- Contracts ],
|
||||
DecodedContracts = [ decode_contract(C) || C <- Contracts ],
|
||||
{ok, list_to_binary(string:join(DecodedContracts, "\n"))}.
|
||||
|
||||
decode_contract(#{name := Name,
|
||||
type_defs := Ts0,
|
||||
functions := Fs} = C) ->
|
||||
decode_contract(#{contract := #{name := Name,
|
||||
type_defs := Ts0,
|
||||
functions := Fs} = C}) ->
|
||||
MkTDef = fun(N, T) -> #{name => N, vars => [], typedef => T} end,
|
||||
Ts = [ MkTDef(<<"state">>, maps:get(state, C)) || maps:is_key(state, C) ] ++
|
||||
[ MkTDef(<<"event">>, maps:get(event, C)) || maps:is_key(event, C) ] ++ Ts0,
|
||||
["contract"," ",io_lib:format("~s", [Name])," =\n",
|
||||
decode_tdefs(Ts), decode_funcs(Fs)].
|
||||
["contract ", io_lib:format("~s", [Name])," =\n",
|
||||
decode_tdefs(Ts), decode_funcs(Fs)];
|
||||
decode_contract(#{namespace := #{name := Name, type_defs := Ts}}) when Ts /= [] ->
|
||||
["namespace ", io_lib:format("~s", [Name])," =\n",
|
||||
decode_tdefs(Ts)];
|
||||
decode_contract(_) -> [].
|
||||
|
||||
decode_funcs(Fs) -> [ decode_func(F) || F <- Fs ].
|
||||
|
||||
%% decode_func(#{name := init}) -> [];
|
||||
decode_func(#{name := Name, arguments := As, returns := T}) ->
|
||||
[" function", " ", io_lib:format("~s", [Name]), " : ",
|
||||
[" entrypoint", " ", io_lib:format("~s", [Name]), " : ",
|
||||
decode_args(As), " => ", decode_type(T), $\n].
|
||||
|
||||
decode_args(As) ->
|
||||
@@ -242,7 +264,10 @@ decode_types(Ets) ->
|
||||
|
||||
decode_type(#{tuple := Ets}) ->
|
||||
Ts = decode_types(Ets),
|
||||
[$(,lists:join(",", Ts),$)];
|
||||
case Ts of
|
||||
[] -> ["unit"];
|
||||
_ -> [$(,lists:join(" * ", Ts),$)]
|
||||
end;
|
||||
decode_type(#{record := Efs}) ->
|
||||
Fs = decode_fields(Efs),
|
||||
[${,lists:join(",", Fs),$}];
|
||||
@@ -305,9 +330,6 @@ decode_tvar(#{name := N}) -> io_lib:format("~s", [N]).
|
||||
|
||||
%% #contract{Ann, Con, [Declarations]}.
|
||||
|
||||
contract_name({contract, _, {con, _, Name}, _}) -> Name;
|
||||
contract_name({namespace, _, {con, _, Name}, _}) -> Name.
|
||||
|
||||
contract_funcs({C, _, _, Decls}) when C == contract; C == namespace ->
|
||||
[ D || D <- Decls, is_fun(D)].
|
||||
|
||||
@@ -328,8 +350,7 @@ sort_decls(Ds) ->
|
||||
end,
|
||||
lists:sort(Sort, Ds).
|
||||
|
||||
|
||||
is_private(Node) -> aeso_syntax:get_ann(private, Node, false).
|
||||
is_entrypoint(Node) -> aeso_syntax:get_ann(entrypoint, Node, false).
|
||||
is_stateful(Node) -> aeso_syntax:get_ann(stateful, Node, false).
|
||||
|
||||
typedef_name({type_def, _, {id, _, Name}, _, _}) -> Name.
|
||||
|
||||
+186
-36
@@ -135,6 +135,10 @@ on_current_scope(Env = #env{ namespace = NS, scopes = Scopes }, Fun) ->
|
||||
Scope = maps:get(NS, Scopes),
|
||||
Env#env{ scopes = Scopes#{ NS => Fun(Scope) } }.
|
||||
|
||||
-spec on_scopes(env(), fun((scope()) -> scope())) -> env().
|
||||
on_scopes(Env = #env{ scopes = Scopes }, Fun) ->
|
||||
Env#env{ scopes = maps:map(fun(_, Scope) -> Fun(Scope) end, Scopes) }.
|
||||
|
||||
-spec bind_var(aeso_syntax:id(), type(), env()) -> env().
|
||||
bind_var({id, Ann, X}, T, Env) ->
|
||||
Env#env{ vars = [{X, {Ann, T}} | Env#env.vars] }.
|
||||
@@ -152,7 +156,7 @@ bind_tvars(Xs, Env) ->
|
||||
check_tvar(#env{ typevars = TVars}, T = {tvar, _, X}) ->
|
||||
case TVars == unrestricted orelse lists:member(X, TVars) of
|
||||
true -> ok;
|
||||
false -> type_error({unbound_type_variable, T})
|
||||
false -> type_error({unbound_type, T})
|
||||
end,
|
||||
T.
|
||||
|
||||
@@ -380,9 +384,11 @@ global_env() ->
|
||||
{"RelativeTTL", Fun1(Int, TTL)},
|
||||
{"FixedTTL", Fun1(Int, TTL)},
|
||||
%% Abort
|
||||
{"abort", Fun1(String, A)}])
|
||||
{"abort", Fun1(String, A)},
|
||||
{"require", Fun([Bool, String], Unit)}])
|
||||
, types = MkDefs(
|
||||
[{"int", 0}, {"bool", 0}, {"char", 0}, {"string", 0}, {"address", 0},
|
||||
{"unit", {[], {alias_t, Unit}}},
|
||||
{"hash", {[], {alias_t, Bytes(32)}}},
|
||||
{"signature", {[], {alias_t, Bytes(64)}}},
|
||||
{"bits", 0},
|
||||
@@ -396,7 +402,7 @@ global_env() ->
|
||||
[{"spend", StateFun([Address, Int], Unit)},
|
||||
%% Chain environment
|
||||
{"balance", Fun1(Address, Int)},
|
||||
{"block_hash", Fun1(Int, Int)},
|
||||
{"block_hash", Fun1(Int, Option(Hash))},
|
||||
{"coinbase", Address},
|
||||
{"timestamp", Int},
|
||||
{"block_height", Int},
|
||||
@@ -435,9 +441,9 @@ global_env() ->
|
||||
{ funs = MkDefs(
|
||||
[{"resolve", Fun([String, String], option_t(Ann, A))},
|
||||
{"preclaim", SignFun([Address, Hash], Unit)},
|
||||
{"claim", SignFun([Address, String, Int], Unit)},
|
||||
{"transfer", SignFun([Address, Address, Hash], Unit)},
|
||||
{"revoke", SignFun([Address, Hash], Unit)}]) },
|
||||
{"claim", SignFun([Address, String, Int, Int], Unit)},
|
||||
{"transfer", SignFun([Address, Address, String], Unit)},
|
||||
{"revoke", SignFun([Address, String], Unit)}]) },
|
||||
|
||||
MapScope = #scope
|
||||
{ funs = MkDefs(
|
||||
@@ -485,6 +491,12 @@ global_env() ->
|
||||
{"none", Bits},
|
||||
{"all", Bits}]) },
|
||||
|
||||
%% Bytes
|
||||
BytesScope = #scope
|
||||
{ funs = MkDefs(
|
||||
[{"to_int", Fun1(Bytes(any), Int)},
|
||||
{"to_str", Fun1(Bytes(any), String)}]) },
|
||||
|
||||
%% Conversion
|
||||
IntScope = #scope{ funs = MkDefs([{"to_str", Fun1(Int, String)}]) },
|
||||
AddressScope = #scope{ funs = MkDefs([{"to_str", Fun1(Address, String)},
|
||||
@@ -503,6 +515,7 @@ global_env() ->
|
||||
, ["Crypto"] => CryptoScope
|
||||
, ["String"] => StringScope
|
||||
, ["Bits"] => BitsScope
|
||||
, ["Bytes"] => BytesScope
|
||||
, ["Int"] => IntScope
|
||||
, ["Address"] => AddressScope
|
||||
} }.
|
||||
@@ -526,10 +539,17 @@ infer(Contracts, Options) ->
|
||||
Env = init_env(Options),
|
||||
create_options(Options),
|
||||
ets_new(type_vars, [set]),
|
||||
check_modifiers(Env, Contracts),
|
||||
{Env1, Decls} = infer1(Env, Contracts, [], Options),
|
||||
{Env2, Decls2} =
|
||||
case proplists:get_value(dont_unfold, Options, false) of
|
||||
true -> {Env1, Decls};
|
||||
false -> E = on_scopes(Env1, fun(Scope) -> unfold_record_types(Env1, Scope) end),
|
||||
{E, unfold_record_types(E, Decls)}
|
||||
end,
|
||||
case proplists:get_value(return_env, Options, false) of
|
||||
false -> Decls;
|
||||
true -> {Env1, Decls}
|
||||
false -> Decls2;
|
||||
true -> {Env2, Decls2}
|
||||
end
|
||||
after
|
||||
clean_up_ets()
|
||||
@@ -563,14 +583,9 @@ check_scope_name_clash(Env, Kind, Name) ->
|
||||
|
||||
-spec infer_contract_top(env(), contract | namespace, [aeso_syntax:decl()], list(option())) ->
|
||||
{env(), [aeso_syntax:decl()]}.
|
||||
infer_contract_top(Env, Kind, Defs0, Options) ->
|
||||
infer_contract_top(Env, Kind, Defs0, _Options) ->
|
||||
Defs = desugar(Defs0),
|
||||
{Env1, Defs1} = infer_contract(Env, Kind, Defs),
|
||||
case proplists:get_value(dont_unfold, Options, false) of
|
||||
true -> {Env1, Defs1};
|
||||
false -> Env2 = on_current_scope(Env1, fun(Scope) -> unfold_record_types(Env1, Scope) end),
|
||||
{Env2, unfold_record_types(Env2, Defs1)}
|
||||
end.
|
||||
infer_contract(Env, Kind, Defs).
|
||||
|
||||
%% TODO: revisit
|
||||
infer_constant({letval, Attrs,_Pattern, Type, E}) ->
|
||||
@@ -672,6 +687,40 @@ check_typedef(Env, {variant_t, Cons}) ->
|
||||
check_unexpected(Xs) ->
|
||||
[ type_error(X) || X <- Xs ].
|
||||
|
||||
check_modifiers(Env, Contracts) ->
|
||||
create_type_errors(),
|
||||
[ case C of
|
||||
{contract, _, Con, Decls} ->
|
||||
check_modifiers1(contract, Decls),
|
||||
case {lists:keymember(letfun, 1, Decls),
|
||||
[ D || D <- Decls, aeso_syntax:get_ann(entrypoint, D, false) ]} of
|
||||
{true, []} -> type_error({contract_has_no_entrypoints, Con});
|
||||
_ -> ok
|
||||
end;
|
||||
{namespace, _, _, Decls} -> check_modifiers1(namespace, Decls)
|
||||
end || C <- Contracts ],
|
||||
destroy_and_report_type_errors(Env).
|
||||
|
||||
-spec check_modifiers1(contract | namespace, [aeso_syntax:decl()] | aeso_syntax:decl()) -> ok.
|
||||
check_modifiers1(What, Decls) when is_list(Decls) ->
|
||||
_ = [ check_modifiers1(What, Decl) || Decl <- Decls ],
|
||||
ok;
|
||||
check_modifiers1(What, Decl) when element(1, Decl) == letfun; element(1, Decl) == fun_decl ->
|
||||
Public = aeso_syntax:get_ann(public, Decl, false),
|
||||
Private = aeso_syntax:get_ann(private, Decl, false),
|
||||
Entrypoint = aeso_syntax:get_ann(entrypoint, Decl, false),
|
||||
FunDecl = element(1, Decl) == fun_decl,
|
||||
{id, _, Name} = element(3, Decl),
|
||||
_ = [ type_error({proto_must_be_entrypoint, Decl}) || FunDecl, Private orelse not Entrypoint, What == contract ],
|
||||
_ = [ type_error({proto_in_namespace, Decl}) || FunDecl, What == namespace ],
|
||||
_ = [ type_error({init_must_be_an_entrypoint, Decl}) || not Entrypoint, Name == "init", What == contract ],
|
||||
_ = [ type_error({public_modifier_in_contract, Decl}) || Public, not Private, not Entrypoint, What == contract ],
|
||||
_ = [ type_error({entrypoint_in_namespace, Decl}) || Entrypoint, What == namespace ],
|
||||
_ = [ type_error({private_entrypoint, Decl}) || Private, Entrypoint ],
|
||||
_ = [ type_error({private_and_public, Decl}) || Private, Public ],
|
||||
ok;
|
||||
check_modifiers1(_, _) -> ok.
|
||||
|
||||
-spec check_type(env(), aeso_syntax:type()) -> aeso_syntax:type().
|
||||
check_type(Env, T) ->
|
||||
check_type(Env, T, 0).
|
||||
@@ -764,11 +813,13 @@ is_word_type({id, _, Name}) ->
|
||||
lists:member(Name, ["int", "address", "hash", "bits", "bool"]);
|
||||
is_word_type({app_t, _, {id, _, Name}, [_, _]}) ->
|
||||
lists:member(Name, ["oracle", "oracle_query"]);
|
||||
is_word_type({bytes_t, _, N}) -> N =< 32;
|
||||
is_word_type({con, _, _}) -> true;
|
||||
is_word_type({qcon, _, _}) -> true;
|
||||
is_word_type(_) -> false.
|
||||
|
||||
is_string_type({id, _, "string"}) -> true;
|
||||
is_string_type({bytes_t, _, N}) -> N > 32;
|
||||
is_string_type(_) -> false.
|
||||
|
||||
-spec check_constructor_overlap(env(), aeso_syntax:con(), type()) -> ok | no_return().
|
||||
@@ -915,8 +966,8 @@ lookup_name(Env, As, Id, Options) ->
|
||||
Freshen = proplists:get_value(freshen, Options, false),
|
||||
check_stateful(Env, Id, Ty),
|
||||
Ty1 = case Ty of
|
||||
{type_sig, _, _, _, _} -> freshen_type(typesig_to_fun_t(Ty));
|
||||
_ when Freshen -> freshen_type(Ty);
|
||||
{type_sig, _, _, _, _} -> freshen_type(As, typesig_to_fun_t(Ty));
|
||||
_ when Freshen -> freshen_type(As, Ty);
|
||||
_ -> Ty
|
||||
end,
|
||||
{set_qname(QId, Id), Ty1}
|
||||
@@ -1133,7 +1184,13 @@ infer_expr(Env, {lam, Attrs, Args, Body}) ->
|
||||
{'case', _, {typed, _, {tuple, _, NewArgPatterns}, _}, NewBody} =
|
||||
infer_case(Env, Attrs, {tuple, Attrs, ArgPatterns}, {tuple_t, Attrs, ArgTypes}, Body, ResultType),
|
||||
NewArgs = [{arg, As, NewPat, NewT} || {typed, As, NewPat, NewT} <- NewArgPatterns],
|
||||
{typed, Attrs, {lam, Attrs, NewArgs, NewBody}, {fun_t, Attrs, [], ArgTypes, ResultType}}.
|
||||
{typed, Attrs, {lam, Attrs, NewArgs, NewBody}, {fun_t, Attrs, [], ArgTypes, ResultType}};
|
||||
infer_expr(Env, Let = {letval, Attrs, _, _, _}) ->
|
||||
type_error({missing_body_for_let, Attrs}),
|
||||
infer_expr(Env, {block, Attrs, [Let, abort_expr(Attrs, "missing body")]});
|
||||
infer_expr(Env, Let = {letfun, Attrs, _, _, _, _}) ->
|
||||
type_error({missing_body_for_let, Attrs}),
|
||||
infer_expr(Env, {block, Attrs, [Let, abort_expr(Attrs, "missing body")]}).
|
||||
|
||||
infer_named_arg(Env, NamedArgs, {named_arg, Ann, Id, E}) ->
|
||||
CheckedExpr = {typed, _, _, ArgType} = infer_expr(Env, E),
|
||||
@@ -1207,9 +1264,11 @@ infer_case(Env, Attrs, Pattern, ExprType, Branch, SwitchType) ->
|
||||
%% NewStmts = infer_block(Env, Attrs, Stmts, BlockType)
|
||||
infer_block(_Env, Attrs, [], BlockType) ->
|
||||
error({impossible, empty_block, Attrs, BlockType});
|
||||
infer_block(Env, _, [E], BlockType) ->
|
||||
[check_expr(Env, E, BlockType)];
|
||||
infer_block(Env, Attrs, [Def={letfun, Ann, _, _, _, _}|Rest], BlockType) ->
|
||||
{{Name, TypeSig}, LetFun} = infer_letfun(Env, Def),
|
||||
FunT = freshen_type(typesig_to_fun_t(TypeSig)),
|
||||
FunT = freshen_type(Ann, typesig_to_fun_t(TypeSig)),
|
||||
NewE = bind_var({id, Ann, Name}, FunT, Env),
|
||||
[LetFun|infer_block(NewE, Attrs, Rest, BlockType)];
|
||||
infer_block(Env, _, [{letval, Attrs, Pattern, Type, E}|Rest], BlockType) ->
|
||||
@@ -1217,8 +1276,6 @@ infer_block(Env, _, [{letval, Attrs, Pattern, Type, E}|Rest], BlockType) ->
|
||||
{'case', _, NewPattern, {typed, _, {block, _, NewRest}, _}} =
|
||||
infer_case(Env, Attrs, Pattern, PatType, {block, Attrs, Rest}, BlockType),
|
||||
[{letval, Attrs, NewPattern, Type, NewE}|NewRest];
|
||||
infer_block(Env, _, [E], BlockType) ->
|
||||
[check_expr(Env, E, BlockType)];
|
||||
infer_block(Env, Attrs, [E|Rest], BlockType) ->
|
||||
[infer_expr(Env, E)|infer_block(Env, Attrs, Rest, BlockType)].
|
||||
|
||||
@@ -1254,6 +1311,9 @@ infer_prefix({IntOp,As}) when IntOp =:= '-' ->
|
||||
Int = {id, As, "int"},
|
||||
{fun_t, As, [], [Int], Int}.
|
||||
|
||||
abort_expr(Ann, Str) ->
|
||||
{app, Ann, {id, Ann, "abort"}, [{string, Ann, Str}]}.
|
||||
|
||||
free_vars({int, _, _}) ->
|
||||
[];
|
||||
free_vars({char, _, _}) ->
|
||||
@@ -1348,14 +1408,17 @@ when_option(Opt, Do) ->
|
||||
|
||||
create_constraints() ->
|
||||
create_named_argument_constraints(),
|
||||
create_bytes_constraints(),
|
||||
create_field_constraints().
|
||||
|
||||
solve_constraints(Env) ->
|
||||
solve_named_argument_constraints(Env),
|
||||
solve_bytes_constraints(Env),
|
||||
solve_field_constraints(Env).
|
||||
|
||||
destroy_and_report_unsolved_constraints(Env) ->
|
||||
destroy_and_report_unsolved_field_constraints(Env),
|
||||
destroy_and_report_unsolved_bytes_constraints(Env),
|
||||
destroy_and_report_unsolved_named_argument_constraints(Env).
|
||||
|
||||
%% -- Named argument constraints --
|
||||
@@ -1404,6 +1467,37 @@ destroy_and_report_unsolved_named_argument_constraints(Env) ->
|
||||
destroy_named_argument_constraints(),
|
||||
ok.
|
||||
|
||||
%% -- Bytes constraints --
|
||||
|
||||
-type byte_constraint() :: {is_bytes, utype()}.
|
||||
|
||||
create_bytes_constraints() ->
|
||||
ets_new(bytes_constraints, [bag]).
|
||||
|
||||
get_bytes_constraints() ->
|
||||
ets_tab2list(bytes_constraints).
|
||||
|
||||
-spec add_bytes_constraint(byte_constraint()) -> true.
|
||||
add_bytes_constraint(Constraint) ->
|
||||
ets_insert(bytes_constraints, Constraint).
|
||||
|
||||
solve_bytes_constraints(_Env) ->
|
||||
ok.
|
||||
|
||||
destroy_bytes_constraints() ->
|
||||
ets_delete(bytes_constraints).
|
||||
|
||||
destroy_and_report_unsolved_bytes_constraints(Env) ->
|
||||
[ check_bytes_constraint(Env, C) || C <- get_bytes_constraints() ],
|
||||
destroy_bytes_constraints().
|
||||
|
||||
check_bytes_constraint(Env, {is_bytes, Type}) ->
|
||||
Type1 = unfold_types_in_type(Env, instantiate(Type)),
|
||||
case Type1 of
|
||||
{bytes_t, _, _} -> ok;
|
||||
_ -> type_error({cannot_unify, Type1, {bytes_t, [], any}, {at, Type}})
|
||||
end.
|
||||
|
||||
%% -- Field constraints --
|
||||
|
||||
create_field_constraints() ->
|
||||
@@ -1813,6 +1907,10 @@ occurs_check1(R, {tuple_t, _, Ts}) ->
|
||||
occurs_check(R, Ts);
|
||||
occurs_check1(R, {named_arg_t, _, _, T, _}) ->
|
||||
occurs_check(R, T);
|
||||
occurs_check1(R, {record_t, Fields}) ->
|
||||
occurs_check(R, Fields);
|
||||
occurs_check1(R, {field_t, _, _, T}) ->
|
||||
occurs_check(R, T);
|
||||
occurs_check1(R, [H | T]) ->
|
||||
occurs_check(R, H) orelse occurs_check(R, T);
|
||||
occurs_check1(_, []) -> false.
|
||||
@@ -1826,26 +1924,31 @@ create_freshen_tvars() ->
|
||||
destroy_freshen_tvars() ->
|
||||
ets_delete(freshen_tvars).
|
||||
|
||||
freshen_type(Type) ->
|
||||
freshen_type(Ann, Type) ->
|
||||
create_freshen_tvars(),
|
||||
Type1 = freshen(Type),
|
||||
Type1 = freshen(Ann, Type),
|
||||
destroy_freshen_tvars(),
|
||||
Type1.
|
||||
|
||||
freshen({tvar, As, Name}) ->
|
||||
freshen(Type) ->
|
||||
freshen(aeso_syntax:get_ann(Type), Type).
|
||||
|
||||
freshen(Ann, {tvar, _, Name}) ->
|
||||
NewT = case ets_lookup(freshen_tvars, Name) of
|
||||
[] ->
|
||||
fresh_uvar(As);
|
||||
[{Name, T}] ->
|
||||
T
|
||||
[] -> fresh_uvar(Ann);
|
||||
[{Name, T}] -> T
|
||||
end,
|
||||
ets_insert(freshen_tvars, {Name, NewT}),
|
||||
NewT;
|
||||
freshen(T) when is_tuple(T) ->
|
||||
list_to_tuple(freshen(tuple_to_list(T)));
|
||||
freshen([A|B]) ->
|
||||
[freshen(A)|freshen(B)];
|
||||
freshen(X) ->
|
||||
freshen(Ann, {bytes_t, _, any}) ->
|
||||
X = fresh_uvar(Ann),
|
||||
add_bytes_constraint({is_bytes, X}),
|
||||
X;
|
||||
freshen(Ann, T) when is_tuple(T) ->
|
||||
list_to_tuple(freshen(Ann, tuple_to_list(T)));
|
||||
freshen(Ann, [A | B]) ->
|
||||
[freshen(Ann, A) | freshen(Ann, B)];
|
||||
freshen(_, X) ->
|
||||
X.
|
||||
|
||||
%% Dereferences all uvars and replaces the uninstantiated ones with a
|
||||
@@ -2003,7 +2106,7 @@ pp_error({duplicate_definition, Name, Locs}) ->
|
||||
pp_error({duplicate_scope, Kind, Name, OtherKind, L}) ->
|
||||
io_lib:format("The ~p ~s (at ~s) has the same name as a ~p at ~s\n",
|
||||
[Kind, pp(Name), pp_loc(Name), OtherKind, pp_loc(L)]);
|
||||
pp_error({include, {string, Pos, Name}}) ->
|
||||
pp_error({include, _, {string, Pos, Name}}) ->
|
||||
io_lib:format("Include of '~s' at ~s\nnot allowed, include only allowed at top level.\n",
|
||||
[binary_to_list(Name), pp_loc(Pos)]);
|
||||
pp_error({namespace, _Pos, {con, Pos, Name}, _Def}) ->
|
||||
@@ -2024,10 +2127,52 @@ pp_error({init_depends_on_state, Which, [_Init | Chain]}) ->
|
||||
[if Which == put -> "write"; true -> "read" end,
|
||||
[ io_lib:format(" - ~s (at ~s)~s\n", [Fun, pp_loc(Ann), WhichCalls(Fun)])
|
||||
|| {[_, Fun], Ann} <- Chain]]);
|
||||
pp_error({missing_body_for_let, Ann}) ->
|
||||
io_lib:format("Let binding at ~s must be followed by an expression\n", [pp_loc(Ann)]);
|
||||
pp_error({public_modifier_in_contract, Decl}) ->
|
||||
Decl1 = mk_entrypoint(Decl),
|
||||
io_lib:format("Use 'entrypoint' instead of 'function' for public function ~s (at ~s):\n~s\n",
|
||||
[pp_expr("", element(3, Decl)), pp_loc(Decl),
|
||||
prettypr:format(prettypr:nest(2, aeso_pretty:decl(Decl1)))]);
|
||||
pp_error({init_must_be_an_entrypoint, Decl}) ->
|
||||
Decl1 = mk_entrypoint(Decl),
|
||||
io_lib:format("The init function (at ~s) must be an entrypoint:\n~s\n",
|
||||
[pp_loc(Decl),
|
||||
prettypr:format(prettypr:nest(2, aeso_pretty:decl(Decl1)))]);
|
||||
pp_error({proto_must_be_entrypoint, Decl}) ->
|
||||
Decl1 = mk_entrypoint(Decl),
|
||||
io_lib:format("Use 'entrypoint' for declaration of ~s (at ~s):\n~s\n",
|
||||
[pp_expr("", element(3, Decl)), pp_loc(Decl),
|
||||
prettypr:format(prettypr:nest(2, aeso_pretty:decl(Decl1)))]);
|
||||
pp_error({proto_in_namespace, Decl}) ->
|
||||
io_lib:format("Namespaces cannot contain function prototypes (at ~s).\n",
|
||||
[pp_loc(Decl)]);
|
||||
pp_error({entrypoint_in_namespace, Decl}) ->
|
||||
io_lib:format("Namespaces cannot contain entrypoints (at ~s). Use 'function' instead.\n",
|
||||
[pp_loc(Decl)]);
|
||||
pp_error({private_entrypoint, Decl}) ->
|
||||
io_lib:format("The entrypoint ~s (at ~s) cannot be private. Use 'function' instead.\n",
|
||||
[pp_expr("", element(3, Decl)), pp_loc(Decl)]);
|
||||
pp_error({private_and_public, Decl}) ->
|
||||
io_lib:format("The function ~s (at ~s) cannot be both public and private.\n",
|
||||
[pp_expr("", element(3, Decl)), pp_loc(Decl)]);
|
||||
pp_error({contract_has_no_entrypoints, Con}) ->
|
||||
io_lib:format("The contract ~s (at ~s) has no entrypoints. Since Sophia version 3.2, public\n"
|
||||
"contract functions must be declared with the 'entrypoint' keyword instead of\n"
|
||||
"'function'.\n", [pp_expr("", Con), pp_loc(Con)]);
|
||||
pp_error({unbound_type, Type}) ->
|
||||
io_lib:format("Unbound type ~s (at ~s).\n", [pp_type("", Type), pp_loc(Type)]);
|
||||
pp_error(Err) ->
|
||||
io_lib:format("Unknown error: ~p\n", [Err]).
|
||||
|
||||
mk_entrypoint(Decl) ->
|
||||
Ann = [entrypoint | lists:keydelete(public, 1,
|
||||
lists:keydelete(private, 1,
|
||||
aeso_syntax:get_ann(Decl))) -- [public, private]],
|
||||
aeso_syntax:set_ann(Ann, Decl).
|
||||
|
||||
pp_when({todo, What}) -> io_lib:format("[TODO] ~p\n", [What]);
|
||||
pp_when({at, Ann}) -> io_lib:format("at ~s\n", [pp_loc(Ann)]);
|
||||
pp_when({check_typesig, Name, Inferred, Given}) ->
|
||||
io_lib:format("when checking the definition of ~s\n"
|
||||
" inferred type: ~s\n"
|
||||
@@ -2178,8 +2323,11 @@ pp({uvar, _, Ref}) ->
|
||||
["?u" | integer_to_list(erlang:phash2(Ref, 16384)) ];
|
||||
pp({tvar, _, Name}) ->
|
||||
Name;
|
||||
pp({tuple_t, _, []}) ->
|
||||
"unit";
|
||||
pp({tuple_t, _, Cpts}) ->
|
||||
["(", pp(Cpts), ")"];
|
||||
["(", string:join(lists:map(fun pp/1, Cpts), " * "), ")"];
|
||||
pp({bytes_t, _, any}) -> "bytes(_)";
|
||||
pp({bytes_t, _, Len}) ->
|
||||
["bytes(", integer_to_list(Len), ")"];
|
||||
pp({app_t, _, T, []}) ->
|
||||
@@ -2191,7 +2339,9 @@ pp({named_arg_t, _, Name, Type, Default}) ->
|
||||
pp({fun_t, _, Named = {uvar, _, _}, As, B}) ->
|
||||
["(", pp(Named), " | ", pp(As), ") => ", pp(B)];
|
||||
pp({fun_t, _, Named, As, B}) when is_list(Named) ->
|
||||
["(", pp(Named ++ As), ") => ", pp(B)].
|
||||
["(", pp(Named ++ As), ") => ", pp(B)];
|
||||
pp(Other) ->
|
||||
io_lib:format("~p", [Other]).
|
||||
|
||||
%% -- Pre-type checking desugaring -------------------------------------------
|
||||
|
||||
|
||||
+181
-52
@@ -16,11 +16,11 @@
|
||||
|
||||
-type option() :: term().
|
||||
|
||||
-type attribute() :: stateful | pure.
|
||||
-type attribute() :: stateful | pure | private.
|
||||
|
||||
-type fun_name() :: {entrypoint, binary()}
|
||||
| {local_fun, [string()]}
|
||||
| init.
|
||||
| init | event.
|
||||
-type var_name() :: string().
|
||||
-type sophia_name() :: [string()].
|
||||
|
||||
@@ -31,15 +31,19 @@
|
||||
map_get | map_get_d | map_set | map_from_list | map_to_list |
|
||||
map_delete | map_member | map_size | string_length |
|
||||
string_concat | bits_set | bits_clear | bits_test | bits_sum |
|
||||
bits_intersection | bits_union | bits_difference.
|
||||
bits_intersection | bits_union | bits_difference |
|
||||
contract_to_address | crypto_ecverify | crypto_ecverify_secp256k1 |
|
||||
crypto_sha3 | crypto_sha256 | crypto_blake2b.
|
||||
|
||||
-type flit() :: {int, integer()}
|
||||
| {string, binary()}
|
||||
| {bytes, binary()}
|
||||
| {account_pubkey, binary()}
|
||||
| {contract_pubkey, binary()}
|
||||
| {oracle_pubkey, binary()}
|
||||
| {oracle_query_id, binary()}
|
||||
| {bool, false | true}.
|
||||
| {bool, false | true}
|
||||
| {typerep, ftype()}.
|
||||
|
||||
-type fexpr() :: {lit, flit()}
|
||||
| nil
|
||||
@@ -85,17 +89,16 @@
|
||||
| {map, ftype(), ftype()}
|
||||
| {tuple, [ftype()]}
|
||||
| address
|
||||
| hash
|
||||
| signature
|
||||
| {bytes, non_neg_integer()}
|
||||
| contract
|
||||
| oracle
|
||||
| {oracle, ftype(), ftype()} %% Query type, Response type
|
||||
| oracle_query
|
||||
| name
|
||||
| channel
|
||||
| bits
|
||||
| {variant, [[ftype()]]}
|
||||
| {function, [ftype()], ftype()}
|
||||
| any.
|
||||
| any | {tvar, var_name()}.
|
||||
|
||||
-type fun_def() :: #{ attrs := [attribute()],
|
||||
args := [{var_name(), ftype()}],
|
||||
@@ -124,15 +127,17 @@
|
||||
| {namespace, string()}
|
||||
| {abstract_contract, string()}.
|
||||
|
||||
-type env() :: #{ type_env := type_env(),
|
||||
fun_env := fun_env(),
|
||||
con_env := con_env(),
|
||||
builtins := builtins(),
|
||||
options := [option()],
|
||||
context => context(),
|
||||
vars => [var_name()],
|
||||
functions := #{ fun_name() => fun_def() } }.
|
||||
-type env() :: #{ type_env := type_env(),
|
||||
fun_env := fun_env(),
|
||||
con_env := con_env(),
|
||||
event_type => aeso_syntax:typedef(),
|
||||
builtins := builtins(),
|
||||
options := [option()],
|
||||
context => context(),
|
||||
vars => [var_name()],
|
||||
functions := #{ fun_name() => fun_def() } }.
|
||||
|
||||
-define(HASH_BYTES, 32).
|
||||
%% -- Entrypoint -------------------------------------------------------------
|
||||
|
||||
%% Main entrypoint. Takes typed syntax produced by aeso_ast_infer_types:infer/1,2
|
||||
@@ -168,16 +173,17 @@ builtins() ->
|
||||
MkName = fun(NS, Fun) ->
|
||||
list_to_atom(string:to_lower(string:join(NS ++ [Fun], "_")))
|
||||
end,
|
||||
Scopes = [{[], [{"abort", 1}]},
|
||||
Scopes = [{[], [{"abort", 1}, {"require", 2}]},
|
||||
{["Chain"], [{"spend", 2}, {"balance", 1}, {"block_hash", 1}, {"coinbase", none},
|
||||
{"timestamp", none}, {"block_height", none}, {"difficulty", none},
|
||||
{"gas_limit", none}]},
|
||||
{["Contract"], [{"address", none}, {"balance", none}]},
|
||||
{["Contract"], [{"address", none}, {"balance", none}, {"creator", none}]},
|
||||
{["Call"], [{"origin", none}, {"caller", none}, {"value", none}, {"gas_price", none},
|
||||
{"gas_left", 0}]},
|
||||
{["Oracle"], [{"register", 4}, {"query_fee", 1}, {"query", 5}, {"get_question", 2},
|
||||
{"respond", 4}, {"extend", 3}, {"get_answer", 2}]},
|
||||
{["AENS"], [{"resolve", 2}, {"preclaim", 3}, {"claim", 4}, {"transfer", 4},
|
||||
{"respond", 4}, {"extend", 3}, {"get_answer", 2},
|
||||
{"check", 1}, {"check_query", 2}]},
|
||||
{["AENS"], [{"resolve", 2}, {"preclaim", 3}, {"claim", 5}, {"transfer", 4},
|
||||
{"revoke", 3}]},
|
||||
{["Map"], [{"from_list", 1}, {"to_list", 1}, {"lookup", 2},
|
||||
{"lookup_default", 3}, {"delete", 2}, {"member", 2}, {"size", 1}]},
|
||||
@@ -187,8 +193,9 @@ builtins() ->
|
||||
{["String"], [{"length", 1}, {"concat", 2}, {"sha3", 1}, {"sha256", 1}, {"blake2b", 1}]},
|
||||
{["Bits"], [{"set", 2}, {"clear", 2}, {"test", 2}, {"sum", 1}, {"intersection", 2},
|
||||
{"union", 2}, {"difference", 2}, {"none", none}, {"all", none}]},
|
||||
{["Bytes"], [{"to_int", 1}, {"to_str", 1}]},
|
||||
{["Int"], [{"to_str", 1}]},
|
||||
{["Address"], [{"to_str", 1}]}
|
||||
{["Address"], [{"to_str", 1}, {"is_oracle", 1}, {"is_contract", 1}]}
|
||||
],
|
||||
maps:from_list([ {NS ++ [Fun], {MkName(NS, Fun), Arity}}
|
||||
|| {NS, Funs} <- Scopes,
|
||||
@@ -208,7 +215,7 @@ init_type_env() ->
|
||||
["address"] => ?type(address),
|
||||
["hash"] => ?type(hash),
|
||||
["signature"] => ?type(signature),
|
||||
["oracle"] => ?type(_, _, oracle),
|
||||
["oracle"] => ?type(Q, R, {oracle, Q, R}),
|
||||
["oracle_query"] => ?type(_, _, oracle_query), %% TODO: not in Fate
|
||||
["list"] => ?type(T, {list, T}),
|
||||
["map"] => ?type(K, V, {map, K, V}),
|
||||
@@ -224,7 +231,7 @@ to_fcode(Env, [{contract, _, {con, _, Main}, Decls}]) ->
|
||||
MainEnv = Env#{ context => {main_contract, Main},
|
||||
builtins => Builtins#{[Main, "state"] => {get_state, none},
|
||||
[Main, "put"] => {set_state, 1},
|
||||
[Main, "Chain", "event"] => {event, 1}} },
|
||||
[Main, "Chain", "event"] => {chain_event, 1}} },
|
||||
#{ functions := Funs } = Env1 =
|
||||
decls_to_fcode(MainEnv, Decls),
|
||||
StateType = lookup_type(Env1, [Main, "state"], [], {tuple, []}),
|
||||
@@ -232,7 +239,8 @@ to_fcode(Env, [{contract, _, {con, _, Main}, Decls}]) ->
|
||||
#{ contract_name => Main,
|
||||
state_type => StateType,
|
||||
event_type => EventType,
|
||||
functions => Funs };
|
||||
functions => add_init_function(Env1,
|
||||
add_event_function(Env1, EventType, Funs)) };
|
||||
to_fcode(Env, [{contract, _, {con, _, Con}, Decls} | Code]) ->
|
||||
Env1 = decls_to_fcode(Env#{ context => {abstract_contract, Con} }, Decls),
|
||||
to_fcode(Env1, Code);
|
||||
@@ -254,6 +262,11 @@ decls_to_fcode(Env, Decls) ->
|
||||
|
||||
-spec decl_to_fcode(env(), aeso_syntax:decl()) -> env().
|
||||
decl_to_fcode(Env, {type_decl, _, _, _}) -> Env;
|
||||
decl_to_fcode(Env = #{context := {main_contract, _}}, {fun_decl, Ann, {id, _, Name}, _}) ->
|
||||
case proplists:get_value(no_code, maps:get(options, Env, []), false) of
|
||||
false -> fcode_error({missing_definition, Name, lists:keydelete(entrypoint, 1, Ann)});
|
||||
true -> Env
|
||||
end;
|
||||
decl_to_fcode(Env, {fun_decl, _, _, _}) -> Env;
|
||||
decl_to_fcode(Env, {type_def, _Ann, Name, Args, Def}) ->
|
||||
typedef_to_fcode(Env, Name, Args, Def);
|
||||
@@ -298,7 +311,11 @@ typedef_to_fcode(Env, {id, _, Name}, Xs, Def) ->
|
||||
_ -> #{}
|
||||
end,
|
||||
Env1 = bind_constructors(Env, Constructors),
|
||||
bind_type(Env1, Q, FDef).
|
||||
Env2 = case Name of
|
||||
"event" -> Env1#{ event_type => Def };
|
||||
_ -> Env1
|
||||
end,
|
||||
bind_type(Env2, Q, FDef).
|
||||
|
||||
-spec type_to_fcode(env(), aeso_syntax:type()) -> ftype().
|
||||
type_to_fcode(Env, Type) ->
|
||||
@@ -315,10 +332,10 @@ type_to_fcode(Env, Sub, {tuple_t, _, Types}) ->
|
||||
type_to_fcode(Env, Sub, {record_t, Fields}) ->
|
||||
FieldType = fun({field_t, _, _, Ty}) -> Ty end,
|
||||
type_to_fcode(Env, Sub, {tuple_t, [], lists:map(FieldType, Fields)});
|
||||
type_to_fcode(_Env, _Sub, {bytes_t, _, _N}) ->
|
||||
string; %% TODO: add bytes type to FATE?
|
||||
type_to_fcode(_Env, _Sub, {bytes_t, _, N}) ->
|
||||
{bytes, N};
|
||||
type_to_fcode(_Env, Sub, {tvar, _, X}) ->
|
||||
maps:get(X, Sub, any);
|
||||
maps:get(X, Sub, {tvar, X});
|
||||
type_to_fcode(Env, Sub, {fun_t, _, Named, Args, Res}) ->
|
||||
FNamed = [type_to_fcode(Env, Sub, Arg) || {named_arg_t, _, _, Arg, _} <- Named],
|
||||
FArgs = [type_to_fcode(Env, Sub, Arg) || Arg <- Args],
|
||||
@@ -360,8 +377,7 @@ expr_to_fcode(_Env, _Type, {account_pubkey, _, K}) -> {lit, {account_pubkey, K}
|
||||
expr_to_fcode(_Env, _Type, {contract_pubkey, _, K}) -> {lit, {contract_pubkey, K}};
|
||||
expr_to_fcode(_Env, _Type, {oracle_pubkey, _, K}) -> {lit, {oracle_pubkey, K}};
|
||||
expr_to_fcode(_Env, _Type, {oracle_query_id, _, K}) -> {lit, {oracle_query_id, K}};
|
||||
|
||||
expr_to_fcode(_Env, _Type, {bytes, _, Bin}) -> {lit, {string, Bin}};
|
||||
expr_to_fcode(_Env, _Type, {bytes, _, B}) -> {lit, {bytes, B}};
|
||||
|
||||
%% Variables
|
||||
expr_to_fcode(Env, _Type, {id, _, X}) -> resolve_var(Env, [X]);
|
||||
@@ -385,6 +401,8 @@ expr_to_fcode(Env, _Type, {tuple, _, Es}) ->
|
||||
%% Records
|
||||
expr_to_fcode(Env, Type, {proj, _Ann, Rec = {typed, _, _, RecType}, {id, _, X}}) ->
|
||||
case RecType of
|
||||
{con, _, _} when X == "address" ->
|
||||
{op, contract_to_address, [expr_to_fcode(Env, Rec)]};
|
||||
{con, _, _} ->
|
||||
{fun_t, _, Named, Args, _} = Type,
|
||||
Arity = length(Named) + length(Args),
|
||||
@@ -462,10 +480,27 @@ expr_to_fcode(Env, _Type, {app, _Ann, {Op, _}, [A]}) when is_atom(Op) ->
|
||||
end;
|
||||
|
||||
%% Function calls
|
||||
expr_to_fcode(Env, _Type, {app, _Ann, Fun = {typed, _, _, {fun_t, _, NamedArgsT, _, _}}, Args}) ->
|
||||
expr_to_fcode(Env, Type, {app, _Ann, Fun = {typed, _, _, {fun_t, _, NamedArgsT, _, _}}, Args}) ->
|
||||
Args1 = get_named_args(NamedArgsT, Args),
|
||||
FArgs = [expr_to_fcode(Env, Arg) || Arg <- Args1],
|
||||
case expr_to_fcode(Env, Fun) of
|
||||
{builtin_u, B, _} when B =:= oracle_query;
|
||||
B =:= oracle_get_question;
|
||||
B =:= oracle_get_answer;
|
||||
B =:= oracle_respond;
|
||||
B =:= oracle_register;
|
||||
B =:= oracle_check;
|
||||
B =:= oracle_check_query ->
|
||||
%% Get the type of the oracle from the args or the expression itself
|
||||
OType = get_oracle_type(B, Type, Args1),
|
||||
{oracle, QType, RType} = type_to_fcode(Env, OType),
|
||||
TypeArgs = [{lit, {typerep, QType}}, {lit, {typerep, RType}}],
|
||||
builtin_to_fcode(B, FArgs ++ TypeArgs);
|
||||
{builtin_u, B, _} when B =:= aens_resolve ->
|
||||
%% Get the type we are assuming the name resolves to
|
||||
AensType = type_to_fcode(Env, Type),
|
||||
TypeArgs = [{lit, {typerep, AensType}}],
|
||||
builtin_to_fcode(B, FArgs ++ TypeArgs);
|
||||
{builtin_u, B, _Ar} -> builtin_to_fcode(B, FArgs);
|
||||
{def_u, F, _Ar} -> {def, F, FArgs};
|
||||
{remote_u, Ct, RFun, _Ar} -> {remote, Ct, RFun, FArgs};
|
||||
@@ -498,13 +533,15 @@ expr_to_fcode(Env, _Type, {map, _, Map, KVs}) ->
|
||||
[map_get, _, K | Default] = tuple_to_list(MapGet),
|
||||
?make_let(Key, expr_to_fcode(Env, K),
|
||||
begin
|
||||
%% Z might shadow Map1 or Key
|
||||
Z1 = fresh_name(),
|
||||
GetExpr =
|
||||
case Default of
|
||||
[] -> {op, map_get, [Map1, Key]};
|
||||
[D] -> {op, map_get_d, [Map1, Key, expr_to_fcode(Env, D)]}
|
||||
end,
|
||||
{'let', Z, GetExpr,
|
||||
{op, map_set, [M, Key, expr_to_fcode(bind_var(Env, Z), V)]}}
|
||||
{'let', Z1, GetExpr,
|
||||
{op, map_set, [M, Key, rename([{Z, Z1}], expr_to_fcode(bind_var(Env, Z), V))]}}
|
||||
end)
|
||||
end end, Map1, KVs));
|
||||
expr_to_fcode(Env, _Type, {map_get, _, Map, Key}) ->
|
||||
@@ -528,6 +565,15 @@ make_if(Cond, Then, Else) ->
|
||||
X = fresh_name(),
|
||||
{'let', X, Cond, make_if({var, X}, Then, Else)}.
|
||||
|
||||
|
||||
get_oracle_type(oracle_register, OType, _Args) -> OType;
|
||||
get_oracle_type(oracle_query, _Type, [{typed, _, _Expr, OType} | _]) -> OType;
|
||||
get_oracle_type(oracle_get_question, _Type, [{typed, _, _Expr, OType} | _]) -> OType;
|
||||
get_oracle_type(oracle_get_answer, _Type, [{typed, _, _Expr, OType} | _]) -> OType;
|
||||
get_oracle_type(oracle_check, _Type, [{typed, _, _Expr, OType}]) -> OType;
|
||||
get_oracle_type(oracle_check_query, _Type, [{typed, _, _Expr, OType} | _]) -> OType;
|
||||
get_oracle_type(oracle_respond, _Type, [_, {typed, _,_Expr, OType} | _]) -> OType.
|
||||
|
||||
%% -- Pattern matching --
|
||||
|
||||
-spec alts_to_fcode(env(), ftype(), var_name(), [aeso_syntax:alt()]) -> fsplit().
|
||||
@@ -754,8 +800,15 @@ op_builtins() ->
|
||||
[map_from_list, map_to_list, map_delete, map_member, map_size,
|
||||
string_length, string_concat, string_sha3, string_sha256, string_blake2b,
|
||||
bits_set, bits_clear, bits_test, bits_sum, bits_intersection, bits_union,
|
||||
bits_difference, int_to_str, address_to_str].
|
||||
bits_difference, int_to_str, address_to_str, crypto_ecverify,
|
||||
crypto_ecverify_secp256k1, crypto_sha3, crypto_sha256, crypto_blake2b].
|
||||
|
||||
builtin_to_fcode(require, [Cond, Msg]) ->
|
||||
make_if(Cond, {tuple, []}, {builtin, abort, [Msg]});
|
||||
builtin_to_fcode(chain_event, [Event]) ->
|
||||
{def, event, [Event]};
|
||||
builtin_to_fcode(map_delete, [Key, Map]) ->
|
||||
{op, map_delete, [Map, Key]};
|
||||
builtin_to_fcode(map_member, [Key, Map]) ->
|
||||
{op, map_member, [Map, Key]};
|
||||
builtin_to_fcode(map_lookup, [Key0, Map0]) ->
|
||||
@@ -772,6 +825,48 @@ builtin_to_fcode(Builtin, Args) ->
|
||||
false -> {builtin, Builtin, Args}
|
||||
end.
|
||||
|
||||
%% -- Init function --
|
||||
|
||||
add_init_function(_Env, Funs) ->
|
||||
InitName = {entrypoint, <<"init">>},
|
||||
InitFun = #{ args := InitArgs } =
|
||||
case maps:get(InitName, Funs, none) of
|
||||
none -> #{ attrs => [], args => [], return => {tuple, []}, body => {tuple, []} };
|
||||
Info -> Info
|
||||
end,
|
||||
Vars = [ {var, X} || {X, _} <- InitArgs ],
|
||||
Funs#{ init => InitFun#{ return => {tuple, []},
|
||||
body => {builtin, set_state, [{def, InitName, Vars}]} } }.
|
||||
|
||||
%% -- Event function --
|
||||
|
||||
add_event_function(_Env, none, Funs) -> Funs;
|
||||
add_event_function(Env, EventFType, Funs) ->
|
||||
Funs#{ event => event_function(Env, EventFType) }.
|
||||
|
||||
event_function(_Env = #{event_type := {variant_t, EventCons}}, EventType = {variant, FCons}) ->
|
||||
Cons = [ {Name, I - 1, proplists:get_value(indices, Ann)}
|
||||
|| {I, {constr_t, Ann, {con, _, Name}, _}} <- indexed(EventCons) ],
|
||||
Arities = [length(Ts) || Ts <- FCons],
|
||||
Case = fun({Name, Tag, Ixs}) ->
|
||||
{ok, HashValue} = eblake2:blake2b(?HASH_BYTES, list_to_binary(Name)),
|
||||
Hash = {lit, {bytes, HashValue}},
|
||||
Vars = [ "arg" ++ integer_to_list(I) || I <- lists:seq(1, length(Ixs)) ],
|
||||
IVars = lists:zip(Ixs, Vars),
|
||||
Payload =
|
||||
case [ V || {notindexed, V} <- IVars ] of
|
||||
[] -> {lit, {string, <<>>}};
|
||||
[V] -> {var, V}
|
||||
end,
|
||||
Indices = [ {var, V} || {indexed, V} <- IVars ],
|
||||
Body = {builtin, chain_event, [Payload, Hash | Indices]},
|
||||
{'case', {con, Arities, Tag, Vars}, {nosplit, Body}}
|
||||
end,
|
||||
#{ attrs => [private],
|
||||
args => [{"e", EventType}],
|
||||
return => {tuple, []},
|
||||
body => {switch, {split, EventType, "e", lists:map(Case, Cons)}} }.
|
||||
|
||||
%% -- Lambda lifting ---------------------------------------------------------
|
||||
%% The expr_to_fcode compiler lambda expressions to {lam, Xs, Body}, but in
|
||||
%% FATE we can only call top-level functions, so we need to lift the lambda to
|
||||
@@ -872,9 +967,21 @@ optimize_fcode(Code = #{ functions := Funs }) ->
|
||||
Code#{ functions := maps:map(fun(Name, Def) -> optimize_fun(Code, Name, Def) end, Funs) }.
|
||||
|
||||
-spec optimize_fun(fcode(), fun_name(), fun_def()) -> fun_def().
|
||||
optimize_fun(_Fcode, _Fun, Def = #{ body := _Body }) ->
|
||||
optimize_fun(Fcode, Fun, Def = #{ body := Body }) ->
|
||||
%% io:format("Optimizing ~p =\n~s\n", [_Fun, prettypr:format(pp_fexpr(_Body))]),
|
||||
Def.
|
||||
Def#{ body := inliner(Fcode, Fun, Body) }.
|
||||
|
||||
-spec inliner(fcode(), fun_name(), fexpr()) -> fexpr().
|
||||
inliner(Fcode, Fun, {def, Fun1, Args} = E) when Fun1 /= Fun ->
|
||||
case should_inline(Fcode, Fun1) of
|
||||
false -> E;
|
||||
true -> inline(Fcode, Fun1, Args)
|
||||
end;
|
||||
inliner(_Fcode, _Fun, E) -> E.
|
||||
|
||||
should_inline(_Fcode, _Fun1) -> false == list_to_atom("true"). %% Dialyzer
|
||||
|
||||
inline(_Fcode, Fun, Args) -> {def, Fun, Args}. %% TODO
|
||||
|
||||
%% -- Helper functions -------------------------------------------------------
|
||||
|
||||
@@ -913,18 +1020,18 @@ add_fun_env(Env = #{ context := {abstract_contract, _} }, _) -> Env; %% no func
|
||||
add_fun_env(Env = #{ fun_env := FunEnv }, Decls) ->
|
||||
Entry = fun({letfun, Ann, {id, _, Name}, Args, _, _}) ->
|
||||
[{qname(Env, Name), {make_fun_name(Env, Ann, Name), length(Args)}}];
|
||||
({fun_decl, Ann, {id, _, Name}, {fun_t, _, _, ArgTypes, _}}) ->
|
||||
[{qname(Env, Name), {make_fun_name(Env, Ann, Name), length(ArgTypes)}}];
|
||||
(_) -> [] end,
|
||||
FunEnv1 = maps:from_list(lists:flatmap(Entry, Decls)),
|
||||
Env#{ fun_env := maps:merge(FunEnv, FunEnv1) }.
|
||||
|
||||
make_fun_name(#{ context := Context }, Ann, Name) ->
|
||||
Private = proplists:get_value(private, Ann, false) orelse
|
||||
proplists:get_value(internal, Ann, false),
|
||||
Entrypoint = proplists:get_value(entrypoint, Ann, false),
|
||||
case Context of
|
||||
{main_contract, Main} ->
|
||||
if Private -> {local_fun, [Main, Name]};
|
||||
Name == "init" -> init;
|
||||
true -> {entrypoint, list_to_binary(Name)}
|
||||
if Entrypoint -> {entrypoint, list_to_binary(Name)};
|
||||
true -> {local_fun, [Main, Name]}
|
||||
end;
|
||||
{namespace, Lib} ->
|
||||
{local_fun, [Lib, Name]}
|
||||
@@ -1007,6 +1114,16 @@ pat_vars({tuple, Ps}) -> pat_vars(Ps);
|
||||
pat_vars({con, _, _, Ps}) -> pat_vars(Ps);
|
||||
pat_vars(Ps) when is_list(Ps) -> [X || P <- Ps, X <- pat_vars(P)].
|
||||
|
||||
-spec fsplit_pat_vars(fsplit_pat()) -> [var_name()].
|
||||
fsplit_pat_vars({var, X}) -> [X || X /= "_"];
|
||||
fsplit_pat_vars({bool, _}) -> [];
|
||||
fsplit_pat_vars({int, _}) -> [];
|
||||
fsplit_pat_vars({string, _}) -> [];
|
||||
fsplit_pat_vars(nil) -> [];
|
||||
fsplit_pat_vars({'::', P, Q}) -> [P, Q];
|
||||
fsplit_pat_vars({tuple, Ps}) -> Ps;
|
||||
fsplit_pat_vars({con, _, _, Ps}) -> Ps.
|
||||
|
||||
free_vars(Xs) when is_list(Xs) ->
|
||||
lists:umerge([ free_vars(X) || X <- Xs ]);
|
||||
free_vars(Expr) ->
|
||||
@@ -1032,7 +1149,7 @@ free_vars(Expr) ->
|
||||
{switch, A} -> free_vars(A);
|
||||
{split, _, X, As} -> free_vars([{var, X} | As]);
|
||||
{nosplit, A} -> free_vars(A);
|
||||
{'case', P, A} -> free_vars(A) -- lists:sort(pat_vars(P))
|
||||
{'case', P, A} -> free_vars(A) -- lists:sort(fsplit_pat_vars(P))
|
||||
end.
|
||||
|
||||
get_named_args(NamedArgsT, Args) ->
|
||||
@@ -1191,13 +1308,17 @@ pp_fun(Name, #{ args := Args, return := Return, body := Body }) ->
|
||||
pp_text(" : "), pp_ftype(Return), pp_text(" =")]),
|
||||
prettypr:nest(2, pp_fexpr(Body))).
|
||||
|
||||
pp_fun_name(init) -> pp_text("init");
|
||||
pp_fun_name(init) -> pp_text('INIT');
|
||||
pp_fun_name(event) -> pp_text(event);
|
||||
pp_fun_name({entrypoint, E}) -> pp_text(binary_to_list(E));
|
||||
pp_fun_name({local_fun, Q}) -> pp_text(string:join(Q, ".")).
|
||||
|
||||
pp_text(<<>>) -> prettypr:text("\"\"");
|
||||
pp_text(Bin) when is_binary(Bin) -> prettypr:text(lists:flatten(io_lib:format("~p", [binary_to_list(Bin)])));
|
||||
pp_text(S) -> prettypr:text(lists:concat([S])).
|
||||
pp_text(S) when is_list(S) -> prettypr:text(lists:concat([S]));
|
||||
pp_text(A) when is_atom(A) -> prettypr:text(atom_to_list(A)).
|
||||
|
||||
pp_int(I) -> prettypr:text(integer_to_list(I)).
|
||||
|
||||
pp_beside([]) -> prettypr:empty();
|
||||
pp_beside([X]) -> X;
|
||||
@@ -1220,6 +1341,8 @@ pp_punctuate(Sep, [X | Xs]) -> [pp_beside(X, Sep) | pp_punctuate(Sep, Xs)].
|
||||
|
||||
pp_par([]) -> prettypr:empty();
|
||||
pp_par(Xs) -> prettypr:par(Xs).
|
||||
pp_fexpr({lit, {typerep, T}}) ->
|
||||
pp_ftype(T);
|
||||
pp_fexpr({lit, {Tag, Lit}}) ->
|
||||
aeso_pretty:expr({Tag, [], Lit});
|
||||
pp_fexpr(nil) ->
|
||||
@@ -1227,18 +1350,18 @@ pp_fexpr(nil) ->
|
||||
pp_fexpr({var, X}) -> pp_text(X);
|
||||
pp_fexpr({def, Fun}) -> pp_fun_name(Fun);
|
||||
pp_fexpr({def_u, Fun, Ar}) ->
|
||||
pp_beside([pp_fun_name(Fun), pp_text("/"), pp_text(Ar)]);
|
||||
pp_beside([pp_fun_name(Fun), pp_text("/"), pp_int(Ar)]);
|
||||
pp_fexpr({def, Fun, Args}) ->
|
||||
pp_call(pp_fun_name(Fun), Args);
|
||||
pp_fexpr({con, _, I, []}) ->
|
||||
pp_beside(pp_text("C"), pp_text(I));
|
||||
pp_beside(pp_text("C"), pp_int(I));
|
||||
pp_fexpr({con, _, I, Es}) ->
|
||||
pp_beside(pp_fexpr({con, [], I, []}),
|
||||
pp_fexpr({tuple, Es}));
|
||||
pp_fexpr({tuple, Es}) ->
|
||||
pp_parens(pp_par(pp_punctuate(pp_text(","), [pp_fexpr(E) || E <- Es])));
|
||||
pp_fexpr({proj, E, I}) ->
|
||||
pp_beside([pp_fexpr(E), pp_text("."), pp_text(I)]);
|
||||
pp_beside([pp_fexpr(E), pp_text("."), pp_int(I)]);
|
||||
pp_fexpr({lam, Xs, A}) ->
|
||||
pp_par([pp_fexpr({tuple, [{var, X} || X <- Xs]}), pp_text("=>"),
|
||||
prettypr:nest(2, pp_fexpr(A))]);
|
||||
@@ -1249,7 +1372,7 @@ pp_fexpr({closure, Fun, ClEnv}) ->
|
||||
end,
|
||||
pp_call(pp_text("__CLOSURE__"), [{def, Fun} | FVs]);
|
||||
pp_fexpr({set_proj, E, I, A}) ->
|
||||
pp_beside(pp_fexpr(E), pp_braces(pp_beside([pp_text(I), pp_text(" = "), pp_fexpr(A)])));
|
||||
pp_beside(pp_fexpr(E), pp_braces(pp_beside([pp_int(I), pp_text(" = "), pp_fexpr(A)])));
|
||||
pp_fexpr({op, Op, [A, B] = Args}) ->
|
||||
case is_infix(Op) of
|
||||
false -> pp_call(pp_text(Op), Args);
|
||||
@@ -1270,7 +1393,7 @@ pp_fexpr({builtin_u, B, N}) ->
|
||||
pp_fexpr({builtin, B, As}) ->
|
||||
pp_call(pp_text(B), As);
|
||||
pp_fexpr({remote_u, Ct, Fun, Ar}) ->
|
||||
pp_beside([pp_fexpr(Ct), pp_text("."), pp_fun_name(Fun), pp_text("/"), pp_text(Ar)]);
|
||||
pp_beside([pp_fexpr(Ct), pp_text("."), pp_fun_name(Fun), pp_text("/"), pp_int(Ar)]);
|
||||
pp_fexpr({remote, Ct, Fun, As}) ->
|
||||
pp_call(pp_beside([pp_fexpr(Ct), pp_text("."), pp_fun_name(Fun)]), As);
|
||||
pp_fexpr({funcall, Fun, As}) ->
|
||||
@@ -1280,16 +1403,23 @@ pp_fexpr({switch, Split}) -> pp_split(Split).
|
||||
pp_call(Fun, Args) ->
|
||||
pp_beside(Fun, pp_fexpr({tuple, Args})).
|
||||
|
||||
pp_call_t(Fun, Args) ->
|
||||
pp_beside(pp_text(Fun), pp_ftype({tuple, Args})).
|
||||
|
||||
-spec pp_ftype(ftype()) -> any().
|
||||
pp_ftype(T) when is_atom(T) -> pp_text(T);
|
||||
pp_ftype(any) -> pp_text("_");
|
||||
pp_ftype({tvar, X}) -> pp_text(X);
|
||||
pp_ftype({bytes, N}) -> pp_call(pp_text("bytes"), [{lit, {int, N}}]);
|
||||
pp_ftype({oracle, Q, R}) -> pp_call_t("oracle", [Q, R]);
|
||||
pp_ftype({tuple, Ts}) ->
|
||||
pp_parens(pp_par(pp_punctuate(pp_text(","), [pp_ftype(T) || T <- Ts])));
|
||||
pp_ftype({list, T}) ->
|
||||
pp_beside([pp_text("list("), pp_ftype(T), pp_text(")")]);
|
||||
pp_call_t("list", [T]);
|
||||
pp_ftype({function, Args, Res}) ->
|
||||
pp_par([pp_ftype({tuple, Args}), pp_text("=>"), pp_ftype(Res)]);
|
||||
pp_ftype({map, Key, Val}) ->
|
||||
pp_beside([pp_text("map"), pp_ftype({tuple, [Key, Val]})]);
|
||||
pp_call_t("map", [Key, Val]);
|
||||
pp_ftype({variant, Cons}) ->
|
||||
pp_par(
|
||||
pp_punctuate(pp_text(" |"),
|
||||
@@ -1318,4 +1448,3 @@ pp_pat(Pat) -> pp_fexpr(Pat).
|
||||
is_infix(Op) ->
|
||||
C = hd(atom_to_list(Op)),
|
||||
C < $a orelse C > $z.
|
||||
|
||||
|
||||
+35
-25
@@ -21,18 +21,19 @@ convert_typed(TypedTree, Options) ->
|
||||
{contract, _, {con, _, Con}, _} -> Con;
|
||||
_ -> gen_error(last_declaration_must_be_contract)
|
||||
end,
|
||||
Icode = code(TypedTree, aeso_icode:set_name(Name, aeso_icode:new(Options))),
|
||||
NewIcode = aeso_icode:set_name(Name, aeso_icode:new(Options)),
|
||||
Icode = code(TypedTree, NewIcode, Options),
|
||||
deadcode_elimination(Icode).
|
||||
|
||||
code([{contract, _Attribs, Con, Code}|Rest], Icode) ->
|
||||
code([{contract, _Attribs, Con, Code}|Rest], Icode, Options) ->
|
||||
NewIcode = contract_to_icode(Code, aeso_icode:set_namespace(Con, Icode)),
|
||||
code(Rest, NewIcode);
|
||||
code([{namespace, _Ann, Name, Code}|Rest], Icode) ->
|
||||
%% TODO: nested namespaces
|
||||
code(Rest, NewIcode, Options);
|
||||
code([{namespace, _Ann, Name, Code}|Rest], Icode, Options) ->
|
||||
%% TODO: nested namespaces
|
||||
NewIcode = contract_to_icode(Code, aeso_icode:set_namespace(Name, Icode)),
|
||||
code(Rest, NewIcode);
|
||||
code([], Icode) ->
|
||||
add_default_init_function(add_builtins(Icode)).
|
||||
code(Rest, NewIcode, Options);
|
||||
code([], Icode, Options) ->
|
||||
add_default_init_function(add_builtins(Icode), Options).
|
||||
|
||||
%% Generate error on correct format.
|
||||
|
||||
@@ -40,10 +41,12 @@ gen_error(Error) ->
|
||||
error({code_errors, [Error]}).
|
||||
|
||||
%% Create default init function (only if state is unit).
|
||||
add_default_init_function(Icode = #{functions := Funs, state_type := State}) ->
|
||||
add_default_init_function(Icode = #{functions := Funs, state_type := State}, Options) ->
|
||||
NoCode = proplists:get_value(no_code, Options, false),
|
||||
{_, _, QInit} = aeso_icode:qualify({id, [], "init"}, Icode),
|
||||
case lists:keymember(QInit, 1, Funs) of
|
||||
true -> Icode;
|
||||
false when NoCode -> Icode;
|
||||
false when State /= {tuple, []} ->
|
||||
gen_error(missing_init_function);
|
||||
false ->
|
||||
@@ -141,7 +144,7 @@ ast_body(?qid_app([Con, "Chain", "event"], [Event], _, _), Icode = #{ contract_n
|
||||
ast_body(?qid_app(["Chain", "balance"], [Address], _, _), Icode) ->
|
||||
#prim_balance{ address = ast_body(Address, Icode) };
|
||||
ast_body(?qid_app(["Chain", "block_hash"], [Height], _, _), Icode) ->
|
||||
#prim_block_hash{ height = ast_body(Height, Icode) };
|
||||
builtin_call(block_hash, [ast_body(Height, Icode)]);
|
||||
ast_body(?qid_app(["Call", "gas_left"], [], _, _), _Icode) ->
|
||||
prim_gas_left;
|
||||
ast_body({qid, _, ["Contract", "address"]}, _Icode) -> prim_contract_address;
|
||||
@@ -174,6 +177,8 @@ ast_body({qid, _, [Con, "put"]}, #{ contract_name := Con }) ->
|
||||
%% Abort
|
||||
ast_body(?id_app("abort", [String], _, _), Icode) ->
|
||||
builtin_call(abort, [ast_body(String, Icode)]);
|
||||
ast_body(?id_app("require", [Bool, String], _, _), Icode) ->
|
||||
builtin_call(require, [ast_body(Bool, Icode), ast_body(String, Icode)]);
|
||||
|
||||
%% Authentication
|
||||
ast_body({qid, _, ["Auth", "tx_hash"]}, _Icode) ->
|
||||
@@ -258,21 +263,21 @@ ast_body(?qid_app(["AENS", "preclaim"], Args, _, _), Icode) ->
|
||||
[word, word, sign_t()], {tuple, []});
|
||||
|
||||
ast_body(?qid_app(["AENS", "claim"], Args, _, _), Icode) ->
|
||||
{Sign, [Addr, Name, Salt]} = get_signature_arg(Args),
|
||||
{Sign, [Addr, Name, Salt, NameFee]} = get_signature_arg(Args),
|
||||
prim_call(?PRIM_CALL_AENS_CLAIM, #integer{value = 0},
|
||||
[ast_body(Addr, Icode), ast_body(Name, Icode), ast_body(Salt, Icode), ast_body(Sign, Icode)],
|
||||
[word, string, word, sign_t()], {tuple, []});
|
||||
[ast_body(Addr, Icode), ast_body(Name, Icode), ast_body(Salt, Icode), ast_body(Sign, Icode), ast_body(NameFee, Icode)],
|
||||
[word, string, word, sign_t(), word], {tuple, []});
|
||||
|
||||
ast_body(?qid_app(["AENS", "transfer"], Args, _, _), Icode) ->
|
||||
{Sign, [FromAddr, ToAddr, NameHash]} = get_signature_arg(Args),
|
||||
{Sign, [FromAddr, ToAddr, Name]} = get_signature_arg(Args),
|
||||
prim_call(?PRIM_CALL_AENS_TRANSFER, #integer{value = 0},
|
||||
[ast_body(FromAddr, Icode), ast_body(ToAddr, Icode), ast_body(NameHash, Icode), ast_body(Sign, Icode)],
|
||||
[ast_body(FromAddr, Icode), ast_body(ToAddr, Icode), ast_body(Name, Icode), ast_body(Sign, Icode)],
|
||||
[word, word, word, sign_t()], {tuple, []});
|
||||
|
||||
ast_body(?qid_app(["AENS", "revoke"], Args, _, _), Icode) ->
|
||||
{Sign, [Addr, NameHash]} = get_signature_arg(Args),
|
||||
{Sign, [Addr, Name]} = get_signature_arg(Args),
|
||||
prim_call(?PRIM_CALL_AENS_REVOKE, #integer{value = 0},
|
||||
[ast_body(Addr, Icode), ast_body(NameHash, Icode), ast_body(Sign, Icode)],
|
||||
[ast_body(Addr, Icode), ast_body(Name, Icode), ast_body(Sign, Icode)],
|
||||
[word, word, sign_t()], {tuple, []});
|
||||
|
||||
ast_body({qid, _, ["AENS", "resolve"]}, _Icode) -> gen_error({underapplied_primitive, 'AENS.resolve'});
|
||||
@@ -419,6 +424,13 @@ ast_body(?qid_app(["Address", "is_contract"], [Addr], _, _), Icode) ->
|
||||
prim_call(?PRIM_CALL_ADDR_IS_CONTRACT, #integer{value = 0},
|
||||
[ast_body(Addr, Icode)], [word], word);
|
||||
|
||||
ast_body(?qid_app(["Bytes", "to_int"], [Bytes], _, _), Icode) ->
|
||||
{typed, _, _, {bytes_t, _, N}} = Bytes,
|
||||
builtin_call({bytes_to_int, N}, [ast_body(Bytes, Icode)]);
|
||||
ast_body(?qid_app(["Bytes", "to_str"], [Bytes], _, _), Icode) ->
|
||||
{typed, _, _, {bytes_t, _, N}} = Bytes,
|
||||
builtin_call({bytes_to_str, N}, [ast_body(Bytes, Icode)]);
|
||||
|
||||
%% Other terms
|
||||
ast_body({id, _, Name}, _Icode) ->
|
||||
#var_ref{name = Name};
|
||||
@@ -465,7 +477,7 @@ ast_body({app, _, {typed, _, {proj, _, {typed, _, Addr, {con, _, Contract}}, {id
|
||||
Gas = proplists:get_value("gas", ArgOpts ++ Defaults),
|
||||
Value = proplists:get_value("value", ArgOpts ++ Defaults),
|
||||
OutType = ast_typerep(OutT, Icode),
|
||||
<<TypeHash:256>> = aeb_abi:function_type_hash(list_to_binary(FunName), ArgType, OutType),
|
||||
<<TypeHash:256>> = aeb_aevm_abi:function_type_hash(list_to_binary(FunName), ArgType, OutType),
|
||||
%% The function is represented by its type hash (which includes the name)
|
||||
Fun = #integer{value = TypeHash},
|
||||
#prim_call_contract{
|
||||
@@ -679,7 +691,7 @@ prim_call(Prim, Amount, Args, ArgTypes, OutType) ->
|
||||
true ->
|
||||
PrimBin = binary:encode_unsigned(Prim),
|
||||
ArgType = {tuple, ArgTypes},
|
||||
<<TH:256>> = aeb_abi:function_type_hash(PrimBin, ArgType, OutType),
|
||||
<<TH:256>> = aeb_aevm_abi:function_type_hash(PrimBin, ArgType, OutType),
|
||||
TH;
|
||||
false ->
|
||||
0
|
||||
@@ -719,7 +731,7 @@ ast_typerep({con, _, _}, _) ->
|
||||
word; %% Contract type
|
||||
ast_typerep({bytes_t, _, Len}, _) ->
|
||||
bytes_t(Len);
|
||||
ast_typerep({app_t, _, {id, _, Name}, Args}, Icode) ->
|
||||
ast_typerep({app_t, _, {I, _, Name}, Args}, Icode) when I =:= id; I =:= qid ->
|
||||
ArgReps = [ ast_typerep(Arg, Icode) || Arg <- Args ],
|
||||
lookup_type_id(Name, ArgReps, Icode);
|
||||
ast_typerep({tvar,_,A}, #{ type_vars := TypeVars }) ->
|
||||
@@ -808,13 +820,11 @@ has_maps({list, T}) -> has_maps(T);
|
||||
has_maps({tuple, Ts}) -> lists:any(fun has_maps/1, Ts);
|
||||
has_maps({variant, Cs}) -> lists:any(fun has_maps/1, lists:append(Cs)).
|
||||
|
||||
%% A function is private if marked 'private' or 'internal', or if it's not
|
||||
%% defined in the main contract name space. (NOTE: changes when we introduce
|
||||
%% inheritance).
|
||||
%% A function is private if not an 'entrypoint', or if it's not defined in the
|
||||
%% main contract name space. (NOTE: changes when we introduce inheritance).
|
||||
is_private(Ann, #{ contract_name := MainContract } = Icode) ->
|
||||
{_, _, CurrentNamespace} = aeso_icode:get_namespace(Icode),
|
||||
proplists:get_value(private, Ann, false) orelse
|
||||
proplists:get_value(internal, Ann, false) orelse
|
||||
not proplists:get_value(entrypoint, Ann, false) orelse
|
||||
MainContract /= CurrentNamespace.
|
||||
|
||||
%% -------------------------------------------------------------------
|
||||
|
||||
+95
-18
@@ -44,7 +44,9 @@ builtin_deps1(addr_to_str) -> [{baseX_int, 58}];
|
||||
builtin_deps1({baseX_int, X}) -> [{baseX_int_pad, X}];
|
||||
builtin_deps1({baseX_int_pad, X}) -> [{baseX_int_encode, X}];
|
||||
builtin_deps1({baseX_int_encode, X}) -> [{baseX_int_encode_, X}, {baseX_tab, X}, {baseX_digits, X}];
|
||||
builtin_deps1({bytes_to_str, _}) -> [bytes_to_str_worker];
|
||||
builtin_deps1(string_reverse) -> [string_reverse_];
|
||||
builtin_deps1(require) -> [abort];
|
||||
builtin_deps1(_) -> [].
|
||||
|
||||
dep_closure(Deps) ->
|
||||
@@ -60,12 +62,14 @@ v(X) when is_list(X) -> #var_ref{name = X}.
|
||||
option_none() -> {tuple, [{integer, 0}]}.
|
||||
option_some(X) -> {tuple, [{integer, 1}, X]}.
|
||||
|
||||
-define(HASH_BYTES, 32).
|
||||
|
||||
-define(call(Fun, Args), #funcall{ function = #var_ref{ name = {builtin, Fun} }, args = Args }).
|
||||
-define(I(X), {integer, X}).
|
||||
-define(V(X), v(X)).
|
||||
-define(A(Op), aeb_opcodes:mnemonic(Op)).
|
||||
-define(LET(Var, Expr, Body), {switch, Expr, [{v(Var), Body}]}).
|
||||
-define(DEREF(Var, Ptr, Body), {switch, v(Ptr), [{{tuple, [v(Var)]}, Body}]}).
|
||||
-define(DEREF(Var, Ptr, Body), {switch, operand(Ptr), [{{tuple, [v(Var)]}, Body}]}).
|
||||
-define(NXT(Ptr), op('+', Ptr, 32)).
|
||||
-define(NEG(A), op('/', A, {unop, '-', {integer, 1}})).
|
||||
-define(BYTE(Ix, Word), op('byte', Ix, Word)).
|
||||
@@ -91,12 +95,6 @@ operand(A) when is_atom(A) -> v(A);
|
||||
operand(I) when is_integer(I) -> {integer, I};
|
||||
operand(T) -> T.
|
||||
|
||||
str_to_icode(String) when is_list(String) ->
|
||||
str_to_icode(list_to_binary(String));
|
||||
str_to_icode(BinStr) ->
|
||||
Cpts = [size(BinStr) | aeb_memory:binary_to_words(BinStr)],
|
||||
#tuple{ cpts = [ #integer{value = X} || X <- Cpts ] }.
|
||||
|
||||
check_event_type(Icode) ->
|
||||
case maps:get(event_type, Icode) of
|
||||
{variant_t, Cons} ->
|
||||
@@ -117,11 +115,12 @@ check_event_type(EvtName, Ix, Type, Icode) ->
|
||||
catch _:_ ->
|
||||
error({EvtName, could_not_resolve_type, Type})
|
||||
end,
|
||||
case {Ix, VMType} of
|
||||
{indexed, word} -> ok;
|
||||
{notindexed, string} -> ok;
|
||||
{indexed, _} -> error({EvtName, indexed_field_should_be_word, is, VMType});
|
||||
{notindexed, _} -> error({EvtName, payload_should_be_string, is, VMType})
|
||||
case {Ix, VMType, Type} of
|
||||
{indexed, word, _} -> ok;
|
||||
{notindexed, string, _} -> ok;
|
||||
{notindexed, _, {bytes_t, _, N}} when N > 32 -> ok;
|
||||
{indexed, _, _} -> error({EvtName, indexed_field_should_be_word, is, VMType});
|
||||
{notindexed, _, _} -> error({EvtName, payload_should_be_string, is, VMType})
|
||||
end.
|
||||
|
||||
bfun(B, {IArgs, IExpr, IRet}) ->
|
||||
@@ -131,6 +130,8 @@ builtin_function(BF) ->
|
||||
case BF of
|
||||
{event, EventT} -> bfun(BF, builtin_event(EventT));
|
||||
abort -> bfun(BF, builtin_abort());
|
||||
block_hash -> bfun(BF, builtin_block_hash());
|
||||
require -> bfun(BF, builtin_require());
|
||||
{map_lookup, Type} -> bfun(BF, builtin_map_lookup(Type));
|
||||
map_put -> bfun(BF, builtin_map_put());
|
||||
map_delete -> bfun(BF, builtin_map_delete());
|
||||
@@ -158,6 +159,9 @@ builtin_function(BF) ->
|
||||
{baseX_int_pad, X} -> bfun(BF, builtin_baseX_int_pad(X));
|
||||
{baseX_int_encode, X} -> bfun(BF, builtin_baseX_int_encode(X));
|
||||
{baseX_int_encode_, X} -> bfun(BF, builtin_baseX_int_encode_(X));
|
||||
{bytes_to_int, N} -> bfun(BF, builtin_bytes_to_int(N));
|
||||
{bytes_to_str, N} -> bfun(BF, builtin_bytes_to_str(N));
|
||||
bytes_to_str_worker -> bfun(BF, builtin_bytes_to_str_worker());
|
||||
string_reverse -> bfun(BF, builtin_string_reverse());
|
||||
string_reverse_ -> bfun(BF, builtin_string_reverse_())
|
||||
end.
|
||||
@@ -171,16 +175,23 @@ builtin_event(EventT) ->
|
||||
VIx = fun(Ix) -> v(lists:concat(["v", Ix])) end,
|
||||
ArgPats = fun(Ts) -> [ VIx(Ix) || Ix <- lists:seq(0, length(Ts) - 1) ] end,
|
||||
Payload = %% Should put data ptr, length on stack.
|
||||
fun([]) -> {inline_asm, [A(?PUSH1), 0, A(?PUSH1), 0]};
|
||||
([V]) -> {seq, [V, {inline_asm, [A(?DUP1), A(?MLOAD), %% length, ptr
|
||||
A(?SWAP1), A(?PUSH1), 32, A(?ADD)]}]} %% ptr+32, length
|
||||
fun([]) -> {inline_asm, [A(?PUSH1), 0, A(?PUSH1), 0]};
|
||||
([{{id, _, "string"}, V}]) ->
|
||||
{seq, [V, {inline_asm, [A(?DUP1), A(?MLOAD), %% length, ptr
|
||||
A(?SWAP1), A(?PUSH1), 32, A(?ADD)]}]}; %% ptr+32, length
|
||||
([{{bytes_t, _, N}, V}]) -> {seq, [V, {integer, N}, {inline_asm, A(?SWAP1)}]}
|
||||
end,
|
||||
Ix =
|
||||
fun({bytes_t, _, N}, V) when N < 32 -> ?BSR(V, 32 - N);
|
||||
(_, V) -> V end,
|
||||
Clause =
|
||||
fun(_Tag, {con, _, Con}, IxTypes) ->
|
||||
Types = [ T || {_Ix, T} <- IxTypes ],
|
||||
Indexed = [ Var || {Var, {indexed, _Type}} <- lists:zip(ArgPats(Types), IxTypes) ],
|
||||
EvtIndex = {unop, 'sha3', str_to_icode(Con)},
|
||||
{event, lists:reverse(Indexed) ++ [EvtIndex], Payload(ArgPats(Types) -- Indexed)}
|
||||
Indexed = [ Ix(Type, Var) || {Var, {indexed, Type}} <- lists:zip(ArgPats(Types), IxTypes) ],
|
||||
Data = [ {Type, Var} || {Var, {notindexed, Type}} <- lists:zip(ArgPats(Types), IxTypes) ],
|
||||
{ok, <<EvtIndexN:256>>} = eblake2:blake2b(?HASH_BYTES, list_to_binary(Con)),
|
||||
EvtIndex = {integer, EvtIndexN},
|
||||
{event, lists:reverse(Indexed) ++ [EvtIndex], Payload(Data)}
|
||||
end,
|
||||
Pat = fun(Tag, Types) -> {tuple, [{integer, Tag} | ArgPats(Types)]} end,
|
||||
|
||||
@@ -201,6 +212,17 @@ builtin_abort() ->
|
||||
A(?REVERT)]}, %% Stack: 0,Ptr
|
||||
{tuple,[]}}.
|
||||
|
||||
builtin_block_hash() ->
|
||||
{[{"height", word}],
|
||||
?LET(hash, #prim_block_hash{ height = ?V(height)},
|
||||
{ifte, ?EQ(hash, 0), option_none(), option_some(?V(hash))}),
|
||||
aeso_icode:option_typerep(word)}.
|
||||
|
||||
builtin_require() ->
|
||||
{[{"c", word}, {"msg", string}],
|
||||
{ifte, ?V(c), {tuple, []}, ?call(abort, [?V(msg)])},
|
||||
{tuple, []}}.
|
||||
|
||||
%% Map primitives
|
||||
builtin_map_lookup(Type) ->
|
||||
Ret = aeso_icode:option_typerep(Type),
|
||||
@@ -437,6 +459,10 @@ builtin_baseX_int_pad(X = 10) ->
|
||||
?call({baseX_int_encode, X}, [?NEG(src), ?I(1), ?BSL($-, 31)]),
|
||||
?call({baseX_int_encode, X}, [?V(src), ?V(ix), ?V(dst)])},
|
||||
word};
|
||||
builtin_baseX_int_pad(X = 16) ->
|
||||
{[{"src", word}, {"ix", word}, {"dst", word}],
|
||||
?call({baseX_int_encode, X}, [?V(src), ?V(ix), ?V(dst)]),
|
||||
word};
|
||||
builtin_baseX_int_pad(X = 58) ->
|
||||
{[{"src", word}, {"ix", word}, {"dst", word}],
|
||||
{ifte, ?GT(?ADD(?DIV(ix, 31), ?BYTE(ix, src)), 0),
|
||||
@@ -471,6 +497,57 @@ builtin_baseX_digits(X) ->
|
||||
{ifte, ?EQ(x1, 0), ?V(dgts), ?call({baseX_digits, X}, [?V(x1), ?ADD(dgts, 1)])}),
|
||||
word}.
|
||||
|
||||
builtin_bytes_to_int(32) ->
|
||||
{[{"w", word}], ?V(w), word};
|
||||
builtin_bytes_to_int(N) when N < 32 ->
|
||||
{[{"w", word}], ?BSR(w, 32 - N), word};
|
||||
builtin_bytes_to_int(N) when N > 32 ->
|
||||
LastFullWord = N div 32 - 1,
|
||||
Body = case N rem 32 of
|
||||
0 -> ?DEREF(n, ?ADD(b, LastFullWord * 32), ?V(n));
|
||||
R ->
|
||||
?DEREF(hi, ?ADD(b, LastFullWord * 32),
|
||||
?DEREF(lo, ?ADD(b, (LastFullWord + 1) * 32),
|
||||
?ADD(?BSR(lo, 32 - R), ?BSL(hi, R))))
|
||||
end,
|
||||
{[{"b", pointer}], Body, word}.
|
||||
|
||||
builtin_bytes_to_str_worker() ->
|
||||
<<Tab:256>> = <<"0123456789ABCDEF________________">>,
|
||||
{[{"w", word}, {"offs", word}, {"acc", word}],
|
||||
{seq, [{ifte, ?AND(?GT(offs, 0), ?EQ(0, ?MOD(offs, 16))),
|
||||
{seq, [?V(acc), {inline_asm, [?A(?MSIZE), ?A(?MSTORE)]}]},
|
||||
{inline_asm, []}},
|
||||
{ifte, ?EQ(offs, 32), {inline_asm, [?A(?MSIZE)]},
|
||||
?LET(b, ?BYTE(offs, w),
|
||||
?LET(lo, ?BYTE(?MOD(b, 16), Tab),
|
||||
?LET(hi, ?BYTE(op('bsr', 4 , b), Tab),
|
||||
?call(bytes_to_str_worker,
|
||||
[?V(w), ?ADD(offs, 1), ?ADD(?BSL(acc, 2), ?ADD(?BSL(hi, 1), lo))]))))
|
||||
}
|
||||
]},
|
||||
word}.
|
||||
|
||||
builtin_bytes_to_str(N) when N =< 32 ->
|
||||
{[{"w", word}],
|
||||
?LET(ret, {inline_asm, [?A(?MSIZE)]},
|
||||
{seq, [?I(N * 2), {inline_asm, [?A(?MSIZE), ?A(?MSTORE)]},
|
||||
?call(bytes_to_str_worker, [?V(w), ?I(0), ?I(0)]),
|
||||
{inline_asm, [?A(?POP)]},
|
||||
?V(ret)]}),
|
||||
string};
|
||||
builtin_bytes_to_str(N) when N > 32 ->
|
||||
Work = fun(I) ->
|
||||
[?DEREF(w, ?ADD(p, 32 * I), ?call(bytes_to_str_worker, [?V(w), ?I(0), ?I(0)])),
|
||||
{inline_asm, [?A(?POP)]}]
|
||||
end,
|
||||
{[{"p", pointer}],
|
||||
?LET(ret, {inline_asm, [?A(?MSIZE)]},
|
||||
{seq, [?I(N * 2), {inline_asm, [?A(?MSIZE), ?A(?MSTORE)]}] ++
|
||||
lists:append([ Work(I) || I <- lists:seq(0, (N + 31) div 32 - 1) ]) ++
|
||||
[?V(ret)]}),
|
||||
string}.
|
||||
|
||||
builtin_string_reverse() ->
|
||||
{[{"s", string}],
|
||||
?DEREF(n, s,
|
||||
|
||||
+230
-151
@@ -12,13 +12,16 @@
|
||||
, file/2
|
||||
, from_string/2
|
||||
, check_call/4
|
||||
, create_calldata/3
|
||||
, create_calldata/3 %% deprecated
|
||||
, create_calldata/4
|
||||
, version/0
|
||||
, sophia_type_to_typerep/1
|
||||
, to_sophia_value/4
|
||||
, to_sophia_value/4 %% deprecated, need a backend
|
||||
, to_sophia_value/5
|
||||
, decode_calldata/3
|
||||
, decode_calldata/3 %% deprecated
|
||||
, decode_calldata/4
|
||||
, parse/2
|
||||
, add_include_path/2
|
||||
]).
|
||||
|
||||
-include_lib("aebytecode/include/aeb_opcodes.hrl").
|
||||
@@ -32,6 +35,8 @@
|
||||
| pp_icode
|
||||
| pp_assembler
|
||||
| pp_bytecode
|
||||
| no_code
|
||||
| {backend, aevm | fate}
|
||||
| {include, {file_system, [string()]} |
|
||||
{explicit_files, #{string() => binary()}}}
|
||||
| {src_file, string()}.
|
||||
@@ -62,12 +67,11 @@ version() ->
|
||||
|
||||
-spec file(string()) -> {ok, map()} | {error, binary()}.
|
||||
file(Filename) ->
|
||||
Dir = filename:dirname(Filename),
|
||||
{ok, Cwd} = file:get_cwd(),
|
||||
file(Filename, [{include, {file_system, [Cwd, Dir]}}]).
|
||||
file(Filename, []).
|
||||
|
||||
-spec file(string(), options()) -> {ok, map()} | {error, binary()}.
|
||||
file(File, Options) ->
|
||||
file(File, Options0) ->
|
||||
Options = add_include_path(File, Options0),
|
||||
case read_contract(File) of
|
||||
{ok, Bin} -> from_string(Bin, [{src_file, File} | Options]);
|
||||
{error, Error} ->
|
||||
@@ -75,6 +79,15 @@ file(File, Options) ->
|
||||
{error, join_errors("File errors", [ErrorString], fun(E) -> E end)}
|
||||
end.
|
||||
|
||||
add_include_path(File, Options) ->
|
||||
case lists:keymember(include, 1, Options) of
|
||||
true -> Options;
|
||||
false ->
|
||||
Dir = filename:dirname(File),
|
||||
{ok, Cwd} = file:get_cwd(),
|
||||
[{include, {file_system, [Cwd, Dir]}} | Options]
|
||||
end.
|
||||
|
||||
-spec from_string(binary() | string(), options()) -> {ok, map()} | {error, binary()}.
|
||||
from_string(Contract, Options) ->
|
||||
from_string(proplists:get_value(backend, Options, aevm), Contract, Options).
|
||||
@@ -97,7 +110,7 @@ from_string(Backend, ContractString, Options) ->
|
||||
end.
|
||||
|
||||
from_string1(aevm, ContractString, Options) ->
|
||||
#{icode := Icode} = string_to_icode(ContractString, Options),
|
||||
#{icode := Icode} = string_to_code(ContractString, Options),
|
||||
TypeInfo = extract_type_info(Icode),
|
||||
Assembler = assemble(Icode, Options),
|
||||
pp_assembler(Assembler, Options),
|
||||
@@ -108,26 +121,42 @@ from_string1(aevm, ContractString, Options) ->
|
||||
{ok, #{byte_code => ByteCode,
|
||||
compiler_version => Version,
|
||||
contract_source => ContractString,
|
||||
type_info => TypeInfo
|
||||
type_info => TypeInfo,
|
||||
abi_version => aeb_aevm_abi:abi_version()
|
||||
}};
|
||||
from_string1(fate, ContractString, Options) ->
|
||||
Ast = parse(ContractString, Options),
|
||||
TypedAst = aeso_ast_infer_types:infer(Ast, Options),
|
||||
FCode = aeso_ast_to_fcode:ast_to_fcode(TypedAst, Options),
|
||||
{ok, aeso_fcode_to_fate:compile(FCode, Options)}.
|
||||
#{fcode := FCode} = string_to_code(ContractString, Options),
|
||||
FateCode = aeso_fcode_to_fate:compile(FCode, Options),
|
||||
ByteCode = aeb_fate_code:serialize(FateCode, []),
|
||||
{ok, Version} = version(),
|
||||
{ok, #{byte_code => ByteCode,
|
||||
compiler_version => Version,
|
||||
contract_source => ContractString,
|
||||
type_info => [],
|
||||
fate_code => FateCode,
|
||||
abi_version => aeb_fate_abi:abi_version()
|
||||
}}.
|
||||
|
||||
-spec string_to_icode(string(), [option()]) -> map().
|
||||
string_to_icode(ContractString, Options) ->
|
||||
-spec string_to_code(string(), options()) -> map().
|
||||
string_to_code(ContractString, Options) ->
|
||||
Ast = parse(ContractString, Options),
|
||||
pp_sophia_code(Ast, Options),
|
||||
pp_ast(Ast, Options),
|
||||
{TypeEnv, TypedAst} = aeso_ast_infer_types:infer(Ast, [return_env]),
|
||||
pp_typed_ast(TypedAst, Options),
|
||||
Icode = ast_to_icode(TypedAst, Options),
|
||||
pp_icode(Icode, Options),
|
||||
#{ typed_ast => TypedAst,
|
||||
type_env => TypeEnv,
|
||||
icode => Icode }.
|
||||
case proplists:get_value(backend, Options, aevm) of
|
||||
aevm ->
|
||||
Icode = ast_to_icode(TypedAst, Options),
|
||||
pp_icode(Icode, Options),
|
||||
#{ icode => Icode,
|
||||
typed_ast => TypedAst,
|
||||
type_env => TypeEnv};
|
||||
fate ->
|
||||
Fcode = aeso_ast_to_fcode:ast_to_fcode(TypedAst, Options),
|
||||
#{ fcode => Fcode,
|
||||
typed_ast => TypedAst,
|
||||
type_env => TypeEnv}
|
||||
end.
|
||||
|
||||
join_errors(Prefix, Errors, Pfun) ->
|
||||
Ess = [ Pfun(E) || E <- Errors ],
|
||||
@@ -142,14 +171,15 @@ join_errors(Prefix, Errors, Pfun) ->
|
||||
%% terms for the arguments.
|
||||
%% NOTE: Special treatment for "init" since it might be implicit and has
|
||||
%% a special return type (typerep, T)
|
||||
-spec check_call(string(), string(), [string()], options()) -> {ok, string(), {[Type], Type}, [term()]} | {error, term()}
|
||||
-spec check_call(string(), string(), [string()], options()) -> {ok, string(), {[Type], Type}, [term()]}
|
||||
| {ok, string(), [term()]}
|
||||
| {error, term()}
|
||||
when Type :: term().
|
||||
check_call(Source, "init" = FunName, Args, Options) ->
|
||||
PatchFun = fun(T) -> {tuple, [typerep, T]} end,
|
||||
case check_call(Source, FunName, Args, Options, PatchFun) of
|
||||
case check_call1(Source, FunName, Args, Options) of
|
||||
Err = {error, _} when Args == [] ->
|
||||
%% Try with default init-function
|
||||
case check_call(insert_init_function(Source, Options), FunName, Args, Options, PatchFun) of
|
||||
case check_call1(insert_init_function(Source, Options), FunName, Args, Options) of
|
||||
{error, _} -> Err; %% The first error is most likely better...
|
||||
Res -> Res
|
||||
end;
|
||||
@@ -157,27 +187,46 @@ check_call(Source, "init" = FunName, Args, Options) ->
|
||||
Res
|
||||
end;
|
||||
check_call(Source, FunName, Args, Options) ->
|
||||
PatchFun = fun(T) -> T end,
|
||||
check_call(Source, FunName, Args, Options, PatchFun).
|
||||
check_call1(Source, FunName, Args, Options).
|
||||
|
||||
check_call(ContractString0, FunName, Args, Options, PatchFun) ->
|
||||
check_call1(ContractString0, FunName, Args, Options) ->
|
||||
try
|
||||
%% First check the contract without the __call function
|
||||
#{} = string_to_icode(ContractString0, Options),
|
||||
ContractString = insert_call_function(ContractString0, FunName, Args, Options),
|
||||
#{typed_ast := TypedAst,
|
||||
icode := Icode} = string_to_icode(ContractString, Options),
|
||||
{ok, {FunName, {fun_t, _, _, ArgTypes, RetType}}} = get_call_type(TypedAst),
|
||||
ArgVMTypes = [ aeso_ast_to_icode:ast_typerep(T, Icode) || T <- ArgTypes ],
|
||||
RetVMType = case RetType of
|
||||
{id, _, "_"} -> any;
|
||||
_ -> aeso_ast_to_icode:ast_typerep(RetType, Icode)
|
||||
end,
|
||||
#{ functions := Funs } = Icode,
|
||||
ArgIcode = get_arg_icode(Funs),
|
||||
ArgTerms = [ icode_to_term(T, Arg) ||
|
||||
{T, Arg} <- lists:zip(ArgVMTypes, ArgIcode) ],
|
||||
{ok, FunName, {ArgVMTypes, PatchFun(RetVMType)}, ArgTerms}
|
||||
case proplists:get_value(backend, Options, aevm) of
|
||||
aevm ->
|
||||
%% First check the contract without the __call function
|
||||
#{} = string_to_code(ContractString0, Options),
|
||||
ContractString = insert_call_function(ContractString0, ?CALL_NAME, FunName, Args, Options),
|
||||
#{typed_ast := TypedAst,
|
||||
icode := Icode} = string_to_code(ContractString, Options),
|
||||
{ok, {FunName, {fun_t, _, _, ArgTypes, RetType}}} = get_call_type(TypedAst),
|
||||
ArgVMTypes = [ aeso_ast_to_icode:ast_typerep(T, Icode) || T <- ArgTypes ],
|
||||
RetVMType = case RetType of
|
||||
{id, _, "_"} -> any;
|
||||
_ -> aeso_ast_to_icode:ast_typerep(RetType, Icode)
|
||||
end,
|
||||
#{ functions := Funs } = Icode,
|
||||
ArgIcode = get_arg_icode(Funs),
|
||||
ArgTerms = [ icode_to_term(T, Arg) ||
|
||||
{T, Arg} <- lists:zip(ArgVMTypes, ArgIcode) ],
|
||||
RetVMType1 =
|
||||
case FunName of
|
||||
"init" -> {tuple, [typerep, RetVMType]};
|
||||
_ -> RetVMType
|
||||
end,
|
||||
{ok, FunName, {ArgVMTypes, RetVMType1}, ArgTerms};
|
||||
fate ->
|
||||
%% First check the contract without the __call function
|
||||
#{fcode := OrgFcode} = string_to_code(ContractString0, Options),
|
||||
FateCode = aeso_fcode_to_fate:compile(OrgFcode, []),
|
||||
%% collect all hashes and compute the first name without hash collision to
|
||||
SymbolHashes = maps:keys(aeb_fate_code:symbols(FateCode)),
|
||||
CallName = first_none_match(?CALL_NAME, SymbolHashes,
|
||||
lists:seq($1, $9) ++ lists:seq($A, $Z) ++ lists:seq($a, $z)),
|
||||
ContractString = insert_call_function(ContractString0, CallName, FunName, Args, Options),
|
||||
#{fcode := Fcode} = string_to_code(ContractString, Options),
|
||||
CallArgs = arguments_of_body(CallName, FunName, Fcode),
|
||||
{ok, FunName, CallArgs}
|
||||
end
|
||||
catch
|
||||
error:{parse_errors, Errors} ->
|
||||
{error, join_errors("Parse errors", Errors, fun (E) -> E end)};
|
||||
@@ -191,16 +240,32 @@ check_call(ContractString0, FunName, Args, Options, PatchFun) ->
|
||||
fun (E) -> io_lib:format("~p", [E]) end)}
|
||||
end.
|
||||
|
||||
arguments_of_body(CallName, _FunName, Fcode) ->
|
||||
#{body := Body} = maps:get({entrypoint, list_to_binary(CallName)}, maps:get(functions, Fcode)),
|
||||
{def, _FName, Args} = Body,
|
||||
%% FName is either {entrypoint, list_to_binary(FunName)} or 'init'
|
||||
[ aeso_fcode_to_fate:term_to_fate(A) || A <- Args ].
|
||||
|
||||
first_none_match(_CallName, _Hashes, []) ->
|
||||
error(unable_to_find_unique_call_name);
|
||||
first_none_match(CallName, Hashes, [Char|Chars]) ->
|
||||
case not lists:member(aeb_fate_code:symbol_identifier(list_to_binary(CallName)), Hashes) of
|
||||
true ->
|
||||
CallName;
|
||||
false ->
|
||||
first_none_match(?CALL_NAME++[Char], Hashes, Chars)
|
||||
end.
|
||||
|
||||
%% Add the __call function to a contract.
|
||||
-spec insert_call_function(string(), string(), [string()], options()) -> string().
|
||||
insert_call_function(Code, FunName, Args, Options) ->
|
||||
-spec insert_call_function(string(), string(), string(), [string()], options()) -> string().
|
||||
insert_call_function(Code, Call, FunName, Args, Options) ->
|
||||
Ast = parse(Code, Options),
|
||||
Ind = last_contract_indent(Ast),
|
||||
lists:flatten(
|
||||
[ Code,
|
||||
"\n\n",
|
||||
lists:duplicate(Ind, " "),
|
||||
"stateful function __call() = ", FunName, "(", string:join(Args, ","), ")\n"
|
||||
"stateful entrypoint ", Call, "() = ", FunName, "(", string:join(Args, ","), ")\n"
|
||||
]).
|
||||
|
||||
-spec insert_init_function(string(), options()) -> string().
|
||||
@@ -210,7 +275,7 @@ insert_init_function(Code, Options) ->
|
||||
lists:flatten(
|
||||
[ Code,
|
||||
"\n\n",
|
||||
lists:duplicate(Ind, " "), "function init() = ()\n"
|
||||
lists:duplicate(Ind, " "), "entrypoint init() = ()\n"
|
||||
]).
|
||||
|
||||
last_contract_indent(Decls) ->
|
||||
@@ -222,38 +287,60 @@ last_contract_indent(Decls) ->
|
||||
-spec to_sophia_value(string(), string(), ok | error | revert, aeb_aevm_data:data()) ->
|
||||
{ok, aeso_syntax:expr()} | {error, term()}.
|
||||
to_sophia_value(ContractString, Fun, ResType, Data) ->
|
||||
to_sophia_value(ContractString, Fun, ResType, Data, []).
|
||||
to_sophia_value(ContractString, Fun, ResType, Data, [{backend, aevm}]).
|
||||
|
||||
-spec to_sophia_value(string(), string(), ok | error | revert, binary(), options()) ->
|
||||
{ok, aeso_syntax:expr()} | {error, term()}.
|
||||
to_sophia_value(_, _, error, Err, _Options) ->
|
||||
{ok, {app, [], {id, [], "error"}, [{string, [], Err}]}};
|
||||
to_sophia_value(_, _, revert, Data, _Options) ->
|
||||
case aeb_heap:from_binary(string, Data) of
|
||||
{ok, Err} -> {ok, {app, [], {id, [], "abort"}, [{string, [], Err}]}};
|
||||
{error, _} = Err -> Err
|
||||
to_sophia_value(_, _, revert, Data, Options) ->
|
||||
case proplists:get_value(backend, Options, aevm) of
|
||||
aevm ->
|
||||
case aeb_heap:from_binary(string, Data) of
|
||||
{ok, Err} -> {ok, {app, [], {id, [], "abort"}, [{string, [], Err}]}};
|
||||
{error, _} = Err -> Err
|
||||
end;
|
||||
fate ->
|
||||
Err = aeb_fate_encoding:deserialize(Data),
|
||||
{ok, {app, [], {id, [], "abort"}, [{string, [], Err}]}}
|
||||
end;
|
||||
to_sophia_value(ContractString, FunName, ok, Data, Options) ->
|
||||
to_sophia_value(ContractString, FunName, ok, Data, Options0) ->
|
||||
Options = [no_code | Options0],
|
||||
try
|
||||
#{ typed_ast := TypedAst,
|
||||
type_env := TypeEnv,
|
||||
icode := Icode } = string_to_icode(ContractString, Options),
|
||||
Code = string_to_code(ContractString, Options),
|
||||
#{ typed_ast := TypedAst, type_env := TypeEnv} = Code,
|
||||
{ok, _, Type0} = get_decode_type(FunName, TypedAst),
|
||||
Type = aeso_ast_infer_types:unfold_types_in_type(TypeEnv, Type0, [unfold_record_types, unfold_variant_types]),
|
||||
VmType = aeso_ast_to_icode:ast_typerep(Type, Icode),
|
||||
case aeb_heap:from_binary(VmType, Data) of
|
||||
{ok, VmValue} ->
|
||||
try
|
||||
{ok, translate_vm_value(VmType, Type, VmValue)}
|
||||
catch throw:cannot_translate_to_sophia ->
|
||||
Type0Str = prettypr:format(aeso_pretty:type(Type0)),
|
||||
{error, join_errors("Translation error", [lists:flatten(io_lib:format("Cannot translate VM value ~p\n of type ~p\n to Sophia type ~s\n",
|
||||
[Data, VmType, Type0Str]))],
|
||||
fun (E) -> E end)}
|
||||
|
||||
case proplists:get_value(backend, Options, aevm) of
|
||||
aevm ->
|
||||
Icode = maps:get(icode, Code),
|
||||
VmType = aeso_ast_to_icode:ast_typerep(Type, Icode),
|
||||
case aeb_heap:from_binary(VmType, Data) of
|
||||
{ok, VmValue} ->
|
||||
try
|
||||
{ok, aeso_vm_decode:from_aevm(VmType, Type, VmValue)}
|
||||
catch throw:cannot_translate_to_sophia ->
|
||||
Type0Str = prettypr:format(aeso_pretty:type(Type0)),
|
||||
{error, join_errors("Translation error", [lists:flatten(io_lib:format("Cannot translate VM value ~p\n of type ~p\n to Sophia type ~s\n",
|
||||
[Data, VmType, Type0Str]))],
|
||||
fun (E) -> E end)}
|
||||
end;
|
||||
{error, _Err} ->
|
||||
{error, join_errors("Decode errors", [lists:flatten(io_lib:format("Failed to decode binary at type ~p", [VmType]))],
|
||||
fun(E) -> E end)}
|
||||
end;
|
||||
{error, _Err} ->
|
||||
{error, join_errors("Decode errors", [lists:flatten(io_lib:format("Failed to decode binary at type ~p", [VmType]))],
|
||||
fun(E) -> E end)}
|
||||
fate ->
|
||||
try
|
||||
{ok, aeso_vm_decode:from_fate(Type, aeb_fate_encoding:deserialize(Data))}
|
||||
catch throw:cannot_translate_to_sophia ->
|
||||
{error, join_errors("Translation error",
|
||||
[lists:flatten(io_lib:format("Cannot translate fate value ~p\n of Sophia type ~s\n",
|
||||
[aeb_fate_encoding:deserialize(Data), Type]))],
|
||||
fun (E) -> E end)};
|
||||
_:R ->
|
||||
{error, iolist_to_binary(io_lib:format("Decode error ~p: ~p\n", [R, erlang:get_stacktrace()]))}
|
||||
end
|
||||
end
|
||||
catch
|
||||
error:{parse_errors, Errors} ->
|
||||
@@ -268,101 +355,91 @@ to_sophia_value(ContractString, FunName, ok, Data, Options) ->
|
||||
fun (E) -> io_lib:format("~p", [E]) end)}
|
||||
end.
|
||||
|
||||
address_literal(Type, N) -> {Type, [], <<N:256>>}.
|
||||
|
||||
%% TODO: somewhere else
|
||||
-spec translate_vm_value(aeb_aevm_data:type(), aeso_syntax:type(), aeb_aevm_data:data()) -> aeso_syntax:expr().
|
||||
translate_vm_value(word, {id, _, "address"}, N) -> address_literal(account_pubkey, N);
|
||||
translate_vm_value(word, {app_t, _, {id, _, "oracle"}, _}, N) -> address_literal(oracle_pubkey, N);
|
||||
translate_vm_value(word, {app_t, _, {id, _, "oracle_query"}, _}, N) -> address_literal(oracle_query_id, N);
|
||||
translate_vm_value(word, {con, _, _Name}, N) -> address_literal(contract_pubkey, N);
|
||||
translate_vm_value(word, {id, _, "int"}, N) -> <<N1:256/signed>> = <<N:256>>, {int, [], N1};
|
||||
translate_vm_value(word, {id, _, "bits"}, N) -> error({todo, bits, N});
|
||||
translate_vm_value(word, {id, _, "bool"}, N) -> {bool, [], N /= 0};
|
||||
translate_vm_value(word, {bytes_t, _, Len}, Val) when Len =< 32 ->
|
||||
{bytes, [], <<Val:Len/unit:8>>};
|
||||
translate_vm_value({tuple, _}, {bytes_t, _, Len}, Val) ->
|
||||
{bytes, [], binary:part(<< <<W:32/unit:8>> || W <- tuple_to_list(Val) >>, 0, Len)};
|
||||
translate_vm_value(string, {id, _, "string"}, S) -> {string, [], S};
|
||||
translate_vm_value({list, VmType}, {app_t, _, {id, _, "list"}, [Type]}, List) ->
|
||||
{list, [], [translate_vm_value(VmType, Type, X) || X <- List]};
|
||||
translate_vm_value({option, VmType}, {app_t, _, {id, _, "option"}, [Type]}, Val) ->
|
||||
case Val of
|
||||
none -> {con, [], "None"};
|
||||
{some, X} -> {app, [], {con, [], "Some"}, [translate_vm_value(VmType, Type, X)]}
|
||||
end;
|
||||
translate_vm_value({variant, [[], [VmType]]}, {app_t, _, {id, _, "option"}, [Type]}, Val) ->
|
||||
case Val of
|
||||
{variant, 0, []} -> {con, [], "None"};
|
||||
{variant, 1, [X]} -> {app, [], {con, [], "Some"}, [translate_vm_value(VmType, Type, X)]}
|
||||
end;
|
||||
translate_vm_value({tuple, VmTypes}, {tuple_t, _, Types}, Val)
|
||||
when length(VmTypes) == length(Types),
|
||||
length(VmTypes) == tuple_size(Val) ->
|
||||
{tuple, [], [translate_vm_value(VmType, Type, X)
|
||||
|| {VmType, Type, X} <- lists:zip3(VmTypes, Types, tuple_to_list(Val))]};
|
||||
translate_vm_value({tuple, VmTypes}, {record_t, Fields}, Val)
|
||||
when length(VmTypes) == length(Fields),
|
||||
length(VmTypes) == tuple_size(Val) ->
|
||||
{record, [], [ {field, [], [{proj, [], FName}], translate_vm_value(VmType, FType, X)}
|
||||
|| {VmType, {field_t, _, FName, FType}, X} <- lists:zip3(VmTypes, Fields, tuple_to_list(Val)) ]};
|
||||
translate_vm_value({map, VmKeyType, VmValType}, {app_t, _, {id, _, "map"}, [KeyType, ValType]}, Map)
|
||||
when is_map(Map) ->
|
||||
{map, [], [ {translate_vm_value(VmKeyType, KeyType, Key),
|
||||
translate_vm_value(VmValType, ValType, Val)}
|
||||
|| {Key, Val} <- maps:to_list(Map) ]};
|
||||
translate_vm_value({variant, VmCons}, {variant_t, Cons}, {variant, Tag, Args})
|
||||
when length(VmCons) == length(Cons),
|
||||
length(VmCons) > Tag ->
|
||||
VmTypes = lists:nth(Tag + 1, VmCons),
|
||||
ConType = lists:nth(Tag + 1, Cons),
|
||||
translate_vm_value(VmTypes, ConType, Args);
|
||||
translate_vm_value(VmTypes, {constr_t, _, Con, Types}, Args)
|
||||
when length(VmTypes) == length(Types),
|
||||
length(VmTypes) == length(Args) ->
|
||||
{app, [], Con, [ translate_vm_value(VmType, Type, Arg)
|
||||
|| {VmType, Type, Arg} <- lists:zip3(VmTypes, Types, Args) ]};
|
||||
translate_vm_value(_VmType, _Type, _Data) ->
|
||||
throw(cannot_translate_to_sophia).
|
||||
|
||||
-spec create_calldata(string(), string(), [string()]) ->
|
||||
{ok, binary(), aeb_aevm_data:type(), aeb_aevm_data:type()}
|
||||
| {error, term()}.
|
||||
create_calldata(Code, Fun, Args) ->
|
||||
case check_call(Code, Fun, Args, []) of
|
||||
{ok, FunName, {ArgTypes, RetType}, VMArgs} ->
|
||||
aeb_abi:create_calldata(FunName, VMArgs, ArgTypes, RetType);
|
||||
{error, _} = Err -> Err
|
||||
create_calldata(Code, Fun, Args, [{backend, aevm}]).
|
||||
|
||||
-spec create_calldata(string(), string(), [string()], [{atom(), any()}]) ->
|
||||
{ok, binary()}
|
||||
| {error, term()}.
|
||||
create_calldata(Code, Fun, Args, Options0) ->
|
||||
Options = [no_code | Options0],
|
||||
case proplists:get_value(backend, Options, aevm) of
|
||||
aevm ->
|
||||
case check_call(Code, Fun, Args, Options) of
|
||||
{ok, FunName, {ArgTypes, RetType}, VMArgs} ->
|
||||
aeb_aevm_abi:create_calldata(FunName, VMArgs, ArgTypes, RetType);
|
||||
{error, _} = Err -> Err
|
||||
end;
|
||||
fate ->
|
||||
case check_call(Code, Fun, Args, Options) of
|
||||
{ok, FunName, FateArgs} ->
|
||||
aeb_fate_abi:create_calldata(FunName, FateArgs);
|
||||
{error, _} = Err -> Err
|
||||
end
|
||||
end.
|
||||
|
||||
-spec decode_calldata(string(), string(), binary()) ->
|
||||
{ok, [aeso_syntax:type()], [aeso_syntax:expr()]}
|
||||
| {error, term()}.
|
||||
decode_calldata(ContractString, FunName, Calldata) ->
|
||||
decode_calldata(ContractString, FunName, Calldata, [{backend, aevm}]).
|
||||
|
||||
decode_calldata(ContractString, FunName, Calldata, Options0) ->
|
||||
Options = [no_code | Options0],
|
||||
try
|
||||
#{ typed_ast := TypedAst,
|
||||
type_env := TypeEnv,
|
||||
icode := Icode } = string_to_icode(ContractString, []),
|
||||
Code = string_to_code(ContractString, Options),
|
||||
#{ typed_ast := TypedAst, type_env := TypeEnv} = Code,
|
||||
|
||||
{ok, Args, _} = get_decode_type(FunName, TypedAst),
|
||||
DropArg = fun({arg, _, _, T}) -> T; (T) -> T end,
|
||||
ArgTypes = lists:map(DropArg, Args),
|
||||
Type0 = {tuple_t, [], ArgTypes},
|
||||
Type = aeso_ast_infer_types:unfold_types_in_type(TypeEnv, Type0, [unfold_record_types, unfold_variant_types]),
|
||||
VmType = aeso_ast_to_icode:ast_typerep(Type, Icode),
|
||||
case aeb_heap:from_binary({tuple, [word, VmType]}, Calldata) of
|
||||
{ok, {_, VmValue}} ->
|
||||
try
|
||||
{tuple, [], Values} = translate_vm_value(VmType, Type, VmValue),
|
||||
{ok, ArgTypes, Values}
|
||||
catch throw:cannot_translate_to_sophia ->
|
||||
Type0Str = prettypr:format(aeso_pretty:type(Type0)),
|
||||
{error, join_errors("Translation error", [lists:flatten(io_lib:format("Cannot translate VM value ~p\n of type ~p\n to Sophia type ~s\n",
|
||||
[VmValue, VmType, Type0Str]))],
|
||||
fun (E) -> E end)}
|
||||
%% user defined data types such as variants needed to match against
|
||||
Type = aeso_ast_infer_types:unfold_types_in_type(TypeEnv, Type0, [unfold_record_types, unfold_variant_types]),
|
||||
case proplists:get_value(backend, Options, aevm) of
|
||||
aevm ->
|
||||
Icode = maps:get(icode, Code),
|
||||
VmType = aeso_ast_to_icode:ast_typerep(Type, Icode),
|
||||
case aeb_heap:from_binary({tuple, [word, VmType]}, Calldata) of
|
||||
{ok, {_, VmValue}} ->
|
||||
try
|
||||
{tuple, [], Values} = aeso_vm_decode:from_aevm(VmType, Type, VmValue),
|
||||
%% Values are Sophia expressions in AST format
|
||||
{ok, ArgTypes, Values}
|
||||
catch throw:cannot_translate_to_sophia ->
|
||||
Type0Str = prettypr:format(aeso_pretty:type(Type0)),
|
||||
{error, join_errors("Translation error",
|
||||
[lists:flatten(io_lib:format("Cannot translate VM value ~p\n of type ~p\n to Sophia type ~s\n",
|
||||
[VmValue, VmType, Type0Str]))],
|
||||
fun (E) -> E end)}
|
||||
end;
|
||||
{error, _Err} ->
|
||||
{error, join_errors("Decode errors", [lists:flatten(io_lib:format("Failed to decode binary at type ~p", [VmType]))],
|
||||
fun(E) -> E end)}
|
||||
end;
|
||||
{error, _Err} ->
|
||||
{error, join_errors("Decode errors", [lists:flatten(io_lib:format("Failed to decode binary at type ~p", [VmType]))],
|
||||
fun(E) -> E end)}
|
||||
fate ->
|
||||
case aeb_fate_abi:decode_calldata(FunName, Calldata) of
|
||||
{ok, FateArgs} ->
|
||||
try
|
||||
{tuple_t, [], ArgTypes1} = Type,
|
||||
AstArgs = [ aeso_vm_decode:from_fate(ArgType, FateArg)
|
||||
|| {ArgType, FateArg} <- lists:zip(ArgTypes1, FateArgs)],
|
||||
{ok, ArgTypes, AstArgs}
|
||||
catch throw:cannot_translate_to_sophia ->
|
||||
Type0Str = prettypr:format(aeso_pretty:type(Type0)),
|
||||
{error, join_errors("Translation error",
|
||||
[lists:flatten(io_lib:format("Cannot translate fate value ~p\n of Sophia type ~s\n",
|
||||
[FateArgs, Type0Str]))],
|
||||
fun (E) -> E end)}
|
||||
end;
|
||||
{error, _} ->
|
||||
{error, join_errors("Decode errors", ["Failed to decode binary"],
|
||||
fun(E) -> E end)}
|
||||
end
|
||||
end
|
||||
catch
|
||||
error:{parse_errors, Errors} ->
|
||||
@@ -377,7 +454,6 @@ decode_calldata(ContractString, FunName, Calldata) ->
|
||||
fun (E) -> io_lib:format("~p", [E]) end)}
|
||||
end.
|
||||
|
||||
|
||||
get_arg_icode(Funs) ->
|
||||
case [ Args || {[_, ?CALL_NAME], _, _, {funcall, _, Args}, _} <- Funs ] of
|
||||
[Args] -> Args;
|
||||
@@ -403,7 +479,11 @@ get_decode_type(FunName, [{contract, _, _, Defs}]) ->
|
||||
(_) -> [] end,
|
||||
case lists:flatmap(GetType, Defs) of
|
||||
[{Args, Ret}] -> {ok, Args, Ret};
|
||||
[] -> {error, missing_function}
|
||||
[] ->
|
||||
case FunName of
|
||||
"init" -> {ok, [], {tuple_t, [], []}};
|
||||
_ -> {error, missing_function}
|
||||
end
|
||||
end;
|
||||
get_decode_type(FunName, [_ | Contracts]) ->
|
||||
%% The __decode should be in the final contract
|
||||
@@ -459,7 +539,7 @@ to_bytecode([], _) -> [].
|
||||
|
||||
extract_type_info(#{functions := Functions} =_Icode) ->
|
||||
ArgTypesOnly = fun(As) -> [ T || {_, T} <- As ] end,
|
||||
TypeInfo = [aeb_abi:function_type_info(list_to_binary(lists:last(Name)),
|
||||
TypeInfo = [aeb_aevm_abi:function_type_info(list_to_binary(lists:last(Name)),
|
||||
ArgTypesOnly(Args), TypeRep)
|
||||
|| {Name, Attrs, Args,_Body, TypeRep} <- Functions,
|
||||
not is_tuple(Name),
|
||||
@@ -529,4 +609,3 @@ pos_error({no_file, Line, Pos}) ->
|
||||
pos_error({Line, Pos});
|
||||
pos_error({File, Line, Pos}) ->
|
||||
io_lib:format("file ~s, line ~p, column ~p", [File, Line, Pos]).
|
||||
|
||||
|
||||
+192
-97
@@ -9,7 +9,7 @@
|
||||
%%%-------------------------------------------------------------------
|
||||
-module(aeso_fcode_to_fate).
|
||||
|
||||
-export([compile/2]).
|
||||
-export([compile/2, term_to_fate/1]).
|
||||
|
||||
%% -- Preamble ---------------------------------------------------------------
|
||||
|
||||
@@ -95,6 +95,20 @@
|
||||
Op =:= 'BITS_OR' orelse
|
||||
Op =:= 'BITS_AND' orelse
|
||||
Op =:= 'BITS_DIFF' orelse
|
||||
Op =:= 'SHA3' orelse
|
||||
Op =:= 'SHA256' orelse
|
||||
Op =:= 'BLAKE2B' orelse
|
||||
Op =:= 'ECVERIFY' orelse
|
||||
Op =:= 'ECVERIFY_SECP256K1' orelse
|
||||
Op =:= 'CONTRACT_TO_ADDRESS' orelse
|
||||
Op =:= 'AUTH_TX_HASH' orelse
|
||||
Op =:= 'BYTES_TO_INT' orelse
|
||||
Op =:= 'BYTES_TO_STR' orelse
|
||||
Op =:= 'ORACLE_CHECK' orelse
|
||||
Op =:= 'ORACLE_CHECK_QUERY' orelse
|
||||
Op =:= 'IS_ORACLE' orelse
|
||||
Op =:= 'IS_CONTRACT' orelse
|
||||
Op =:= 'CREATOR' orelse
|
||||
false)).
|
||||
|
||||
-record(env, { contract, vars = [], locals = [], tailpos = true }).
|
||||
@@ -125,7 +139,8 @@ compile(FCode, Options) ->
|
||||
make_function_id(X) ->
|
||||
aeb_fate_code:symbol_identifier(make_function_name(X)).
|
||||
|
||||
make_function_name(init) -> <<"init">>;
|
||||
make_function_name(init) -> <<"INIT">>;
|
||||
make_function_name(event) -> <<"Chain.event">>;
|
||||
make_function_name({entrypoint, Name}) -> Name;
|
||||
make_function_name({local_fun, Xs}) -> list_to_binary("." ++ string:join(Xs, ".")).
|
||||
|
||||
@@ -138,23 +153,50 @@ functions_to_scode(ContractName, Functions, Options) ->
|
||||
return := Type}} <- maps:to_list(Functions)]).
|
||||
|
||||
function_to_scode(ContractName, Functions, _Name, Args, Body, ResType, _Options) ->
|
||||
ArgTypes = [ type_to_scode(T) || {_, T} <- Args ],
|
||||
{ArgTypes, ResType1} = typesig_to_scode(Args, ResType),
|
||||
SCode = to_scode(init_env(ContractName, Functions, Args), Body),
|
||||
{{ArgTypes, type_to_scode(ResType)}, SCode}.
|
||||
{{ArgTypes, ResType1}, SCode}.
|
||||
|
||||
-define(tvars, '$tvars').
|
||||
|
||||
typesig_to_scode(Args, Res) ->
|
||||
put(?tvars, {0, #{}}),
|
||||
R = {[type_to_scode(T) || {_, T} <- Args], type_to_scode(Res)},
|
||||
erase(?tvars),
|
||||
R.
|
||||
|
||||
type_to_scode(integer) -> integer;
|
||||
type_to_scode(boolean) -> boolean;
|
||||
type_to_scode(string) -> string;
|
||||
type_to_scode(address) -> address;
|
||||
type_to_scode({bytes, N}) -> {bytes, N};
|
||||
type_to_scode(contract) -> contract;
|
||||
type_to_scode({oracle, _, _}) -> oracle;
|
||||
type_to_scode(oracle_query) -> oracle_query;
|
||||
type_to_scode(name) -> name;
|
||||
type_to_scode(channel) -> channel;
|
||||
type_to_scode(bits) -> bits;
|
||||
type_to_scode(any) -> any;
|
||||
type_to_scode({variant, Cons}) -> {variant, lists:map(fun(T) -> type_to_scode({tuple, T}) end, Cons)};
|
||||
type_to_scode({list, Type}) -> {list, type_to_scode(Type)};
|
||||
type_to_scode({tuple, Types}) -> {tuple, lists:map(fun type_to_scode/1, Types)};
|
||||
type_to_scode({map, Key, Val}) -> {map, type_to_scode(Key), type_to_scode(Val)};
|
||||
type_to_scode({function, _Args, _Res}) -> {tuple, [string, any]};
|
||||
type_to_scode(T) -> T.
|
||||
type_to_scode({tvar, X}) ->
|
||||
{I, Vars} = get(?tvars),
|
||||
case maps:get(X, Vars, false) of
|
||||
false ->
|
||||
put(?tvars, {I + 1, Vars#{ X => I }}),
|
||||
{tvar, I};
|
||||
J -> {tvar, J}
|
||||
end.
|
||||
|
||||
add_default_init_function(SFuns, StateType) when StateType /= {tuple, []} ->
|
||||
%% Only add default if the type is unit.
|
||||
SFuns;
|
||||
add_default_init_function(SFuns, {tuple, []}) ->
|
||||
%% Only add default if the init function is not present
|
||||
InitName = make_function_name(init),
|
||||
InitName = make_function_name({entrypoint, <<"init">>}),
|
||||
case maps:find(InitName, SFuns) of
|
||||
{ok, _} ->
|
||||
SFuns;
|
||||
@@ -197,16 +239,46 @@ lookup_var(#env{vars = Vars}, X) ->
|
||||
|
||||
%% -- The compiler --
|
||||
|
||||
to_scode(_Env, {lit, L}) ->
|
||||
lit_to_fate(L) ->
|
||||
case L of
|
||||
{int, N} -> [push(?i(N))];
|
||||
{string, S} -> [push(?i(aeb_fate_data:make_string(S)))];
|
||||
{bool, B} -> [push(?i(B))];
|
||||
{account_pubkey, K} -> [push(?i(aeb_fate_data:make_address(K)))];
|
||||
{contract_pubkey, K} -> [push(?i(aeb_fate_data:make_contract(K)))];
|
||||
{oracle_pubkey, K} -> [push(?i(aeb_fate_data:make_oracle(K)))];
|
||||
{oracle_query_id, _} -> ?TODO(fate_oracle_query_id_value)
|
||||
end;
|
||||
{int, N} -> aeb_fate_data:make_integer(N);
|
||||
{string, S} -> aeb_fate_data:make_string(S);
|
||||
{bytes, B} -> aeb_fate_data:make_bytes(B);
|
||||
{bool, B} -> aeb_fate_data:make_boolean(B);
|
||||
{account_pubkey, K} -> aeb_fate_data:make_address(K);
|
||||
{contract_pubkey, K} -> aeb_fate_data:make_contract(K);
|
||||
{oracle_pubkey, K} -> aeb_fate_data:make_oracle(K);
|
||||
{oracle_query_id, H} -> aeb_fate_data:make_oracle_query(H);
|
||||
{typerep, T} -> aeb_fate_data:make_typerep(type_to_scode(T))
|
||||
end.
|
||||
|
||||
term_to_fate({lit, L}) ->
|
||||
lit_to_fate(L);
|
||||
%% negative literals are parsed as 0 - N
|
||||
term_to_fate({op, '-', [{lit, {int, 0}}, {lit, {int, N}}]}) ->
|
||||
aeb_fate_data:make_integer(-N);
|
||||
term_to_fate(nil) ->
|
||||
aeb_fate_data:make_list([]);
|
||||
term_to_fate({op, '::', [Hd, Tl]}) ->
|
||||
%% The Tl will translate into a list, because FATE lists are just lists
|
||||
[term_to_fate(Hd) | term_to_fate(Tl)];
|
||||
term_to_fate({tuple, As}) ->
|
||||
aeb_fate_data:make_tuple(list_to_tuple([ term_to_fate(A) || A<-As]));
|
||||
term_to_fate({con, Ar, I, As}) ->
|
||||
FateAs = [ term_to_fate(A) || A <- As ],
|
||||
aeb_fate_data:make_variant(Ar, I, list_to_tuple(FateAs));
|
||||
term_to_fate({builtin, map_empty, []}) ->
|
||||
aeb_fate_data:make_map(#{});
|
||||
term_to_fate({'let', _, {builtin, map_empty, []}, Set}) ->
|
||||
aeb_fate_data:make_map(map_to_fate(Set)).
|
||||
|
||||
map_to_fate({op, map_set, [{var, _}, K, V]}) ->
|
||||
#{term_to_fate(K) => term_to_fate(V)};
|
||||
map_to_fate({op, map_set, [Set, K, V]}) ->
|
||||
Map = map_to_fate(Set), Map#{term_to_fate(K) => term_to_fate(V)}.
|
||||
|
||||
to_scode(_Env, {lit, L}) ->
|
||||
[push(?i(lit_to_fate(L)))];
|
||||
|
||||
to_scode(_Env, nil) ->
|
||||
[aeb_fate_ops:nil(?a)];
|
||||
@@ -257,18 +329,14 @@ to_scode(Env, {builtin, B, Args}) ->
|
||||
|
||||
to_scode(Env, {remote, Ct, Fun, [{builtin, call_gas_left, _}, Value | Args]}) ->
|
||||
%% Gas is not limited.
|
||||
Lbl = make_function_id(Fun),
|
||||
Call = if Env#env.tailpos -> aeb_fate_ops:call_tr(?a, Lbl, ?a);
|
||||
true -> aeb_fate_ops:call_r(?a, Lbl, ?a)
|
||||
end,
|
||||
Lbl = make_function_id(Fun),
|
||||
Call = aeb_fate_ops:call_r(?a, Lbl, length(Args), ?a), %% No remote tail calls
|
||||
call_to_scode(Env, Call, [Ct, Value | Args]);
|
||||
|
||||
to_scode(Env, {remote, Ct, Fun, [Gas, Value | Args]}) ->
|
||||
%% Gas is limited.
|
||||
Lbl = make_function_id(Fun),
|
||||
Call = if Env#env.tailpos -> aeb_fate_ops:call_gtr(?a, Lbl, ?a, ?a);
|
||||
true -> aeb_fate_ops:call_gr(?a, Lbl, ?a, ?a)
|
||||
end,
|
||||
Call = aeb_fate_ops:call_gr(?a, Lbl, length(Args), ?a, ?a), %% No remote tail calls
|
||||
call_to_scode(Env, Call, [Ct, Value, Gas | Args]);
|
||||
|
||||
to_scode(Env, {closure, Fun, FVs}) ->
|
||||
@@ -398,14 +466,19 @@ builtin_to_scode(_Env, get_state, []) ->
|
||||
builtin_to_scode(Env, set_state, [_] = Args) ->
|
||||
call_to_scode(Env, [aeb_fate_ops:store(?s, ?a),
|
||||
tuple(0)], Args);
|
||||
builtin_to_scode(_Env, event, [_] = _Args) ->
|
||||
?TODO(fate_event_instruction);
|
||||
builtin_to_scode(Env, chain_event, Args) ->
|
||||
call_to_scode(Env, [erlang:apply(aeb_fate_ops, log, lists:duplicate(length(Args), ?a)),
|
||||
tuple(0)], Args);
|
||||
builtin_to_scode(_Env, map_empty, []) ->
|
||||
[aeb_fate_ops:map_empty(?a)];
|
||||
builtin_to_scode(_Env, bits_none, []) ->
|
||||
[aeb_fate_ops:bits_none(?a)];
|
||||
builtin_to_scode(_Env, bits_all, []) ->
|
||||
[aeb_fate_ops:bits_all(?a)];
|
||||
builtin_to_scode(Env, bytes_to_int, [_] = Args) ->
|
||||
call_to_scode(Env, aeb_fate_ops:bytes_to_int(?a, ?a), Args);
|
||||
builtin_to_scode(Env, bytes_to_str, [_] = Args) ->
|
||||
call_to_scode(Env, aeb_fate_ops:bytes_to_str(?a, ?a), Args);
|
||||
builtin_to_scode(Env, abort, [_] = Args) ->
|
||||
call_to_scode(Env, aeb_fate_ops:abort(?a), Args);
|
||||
builtin_to_scode(Env, chain_spend, [_, _] = Args) ->
|
||||
@@ -429,6 +502,8 @@ builtin_to_scode(_Env, contract_balance, []) ->
|
||||
[aeb_fate_ops:balance(?a)];
|
||||
builtin_to_scode(_Env, contract_address, []) ->
|
||||
[aeb_fate_ops:address(?a)];
|
||||
builtin_to_scode(_Env, contract_creator, []) ->
|
||||
[aeb_fate_ops:contract_creator(?a)];
|
||||
builtin_to_scode(_Env, call_origin, []) ->
|
||||
[aeb_fate_ops:origin(?a)];
|
||||
builtin_to_scode(_Env, call_caller, []) ->
|
||||
@@ -439,42 +514,46 @@ builtin_to_scode(_Env, call_gas_price, []) ->
|
||||
[aeb_fate_ops:gasprice(?a)];
|
||||
builtin_to_scode(_Env, call_gas_left, []) ->
|
||||
[aeb_fate_ops:gas(?a)];
|
||||
builtin_to_scode(_Env, oracle_register, [_, _, _, _] = _Args) ->
|
||||
?TODO(fate_oracle_register_instruction);
|
||||
builtin_to_scode(_Env, oracle_query_fee, [_] = _Args) ->
|
||||
?TODO(fate_oracle_query_fee_instruction);
|
||||
builtin_to_scode(_Env, oracle_query, [_, _, _, _, _] = _Args) ->
|
||||
?TODO(fate_oracle_query_instruction);
|
||||
builtin_to_scode(_Env, oracle_get_question, [_, _] = _Args) ->
|
||||
?TODO(fate_oracle_get_question_instruction);
|
||||
builtin_to_scode(_Env, oracle_respond, [_, _, _, _] = _Args) ->
|
||||
?TODO(fate_oracle_respond_instruction);
|
||||
builtin_to_scode(_Env, oracle_extend, [_, _, _] = _Args) ->
|
||||
?TODO(fate_oracle_extend_instruction);
|
||||
builtin_to_scode(_Env, oracle_get_answer, [_, _] = _Args) ->
|
||||
?TODO(fate_oracle_get_answer_instruction);
|
||||
builtin_to_scode(_Env, aens_resolve, [_, _] = _Args) ->
|
||||
?TODO(fate_aens_resolve_instruction);
|
||||
builtin_to_scode(_Env, aens_preclaim, [_, _, _] = _Args) ->
|
||||
?TODO(fate_aens_preclaim_instruction);
|
||||
builtin_to_scode(_Env, aens_claim, [_, _, _, _] = _Args) ->
|
||||
?TODO(fate_aens_claim_instruction);
|
||||
builtin_to_scode(_Env, aens_transfer, [_, _, _, _] = _Args) ->
|
||||
?TODO(fate_aens_transfer_instruction);
|
||||
builtin_to_scode(_Env, aens_revoke, [_, _, _] = _Args) ->
|
||||
?TODO(fate_aens_revoke_instruction);
|
||||
builtin_to_scode(_Env, crypto_ecverify, [_, _, _] = _Args) ->
|
||||
?TODO(fate_crypto_ecverify_instruction);
|
||||
builtin_to_scode(_Env, crypto_ecverify_secp256k1, [_, _, _] = _Args) ->
|
||||
?TODO(fate_crypto_ecverify_secp256k1_instruction);
|
||||
builtin_to_scode(_Env, crypto_sha3, [_] = _Args) ->
|
||||
?TODO(fate_crypto_sha3_instruction);
|
||||
builtin_to_scode(_Env, crypto_sha256, [_] = _Args) ->
|
||||
?TODO(fate_crypto_sha256_instruction);
|
||||
builtin_to_scode(_Env, crypto_blake2b, [_] = _Args) ->
|
||||
?TODO(fate_crypto_blake2b_instruction);
|
||||
builtin_to_scode(Env, oracle_register, [_Sign,_Account,_QFee,_TTL,_QType,_RType] = Args) ->
|
||||
call_to_scode(Env, aeb_fate_ops:oracle_register(?a, ?a, ?a, ?a, ?a, ?a, ?a), Args);
|
||||
builtin_to_scode(Env, oracle_query_fee, [_Oracle] = Args) ->
|
||||
call_to_scode(Env, aeb_fate_ops:oracle_query_fee(?a, ?a), Args);
|
||||
builtin_to_scode(Env, oracle_query, [_Oracle, _Question, _QFee, _QTTL, _RTTL, _QType, _RType] = Args) ->
|
||||
call_to_scode(Env, aeb_fate_ops:oracle_query(?a, ?a, ?a, ?a, ?a, ?a, ?a, ?a), Args);
|
||||
builtin_to_scode(Env, oracle_get_question, [_Oracle, _QueryId, _QType, _RType] = Args) ->
|
||||
call_to_scode(Env, aeb_fate_ops:oracle_get_question(?a, ?a, ?a, ?a, ?a), Args);
|
||||
builtin_to_scode(Env, oracle_respond, [_Sign, _Oracle, _QueryId, _Response, _QType, _RType] = Args) ->
|
||||
call_to_scode(Env, [aeb_fate_ops:oracle_respond(?a, ?a, ?a, ?a, ?a, ?a),
|
||||
tuple(0)], Args);
|
||||
builtin_to_scode(Env, oracle_extend, [_Sign, _Oracle, _TTL] = Args) ->
|
||||
call_to_scode(Env, [aeb_fate_ops:oracle_extend(?a, ?a, ?a),
|
||||
tuple(0)], Args);
|
||||
builtin_to_scode(Env, oracle_get_answer, [_Oracle, _QueryId, _QType, _RType] = Args) ->
|
||||
call_to_scode(Env, aeb_fate_ops:oracle_get_answer(?a, ?a, ?a, ?a, ?a), Args);
|
||||
builtin_to_scode(Env, oracle_check, [_Oracle, _QType, _RType] = Args) ->
|
||||
call_to_scode(Env, aeb_fate_ops:oracle_check(?a, ?a, ?a, ?a), Args);
|
||||
builtin_to_scode(Env, oracle_check_query, [_Oracle, _Query, _QType, _RType] = Args) ->
|
||||
call_to_scode(Env, aeb_fate_ops:oracle_check_query(?a, ?a, ?a, ?a, ?a), Args);
|
||||
builtin_to_scode(Env, address_is_oracle, [_] = Args) ->
|
||||
call_to_scode(Env, aeb_fate_ops:is_oracle(?a, ?a), Args);
|
||||
builtin_to_scode(Env, address_is_contract, [_] = Args) ->
|
||||
call_to_scode(Env, aeb_fate_ops:is_contract(?a, ?a), Args);
|
||||
builtin_to_scode(Env, aens_resolve, [_Name, _Key, _Type] = Args) ->
|
||||
call_to_scode(Env, aeb_fate_ops:aens_resolve(?a, ?a, ?a, ?a), Args);
|
||||
builtin_to_scode(Env, aens_preclaim, [_Sign, _Account, _Hash] = Args) ->
|
||||
call_to_scode(Env, [aeb_fate_ops:aens_preclaim(?a, ?a, ?a),
|
||||
tuple(0)], Args);
|
||||
builtin_to_scode(Env, aens_claim, [_Sign, _Account, _NameString, _Salt, _NameFee] = Args) ->
|
||||
call_to_scode(Env, [aeb_fate_ops:aens_claim(?a, ?a, ?a, ?a, ?a),
|
||||
tuple(0)], Args);
|
||||
builtin_to_scode(Env, aens_transfer, [_Sign, _From, _To, _Name] = Args) ->
|
||||
call_to_scode(Env, [aeb_fate_ops:aens_transfer(?a, ?a, ?a, ?a),
|
||||
tuple(0)], Args);
|
||||
builtin_to_scode(Env, aens_revoke, [_Sign, _Account, _Name] = Args) ->
|
||||
call_to_scode(Env, [aeb_fate_ops:aens_revoke(?a, ?a, ?a),
|
||||
tuple(0)], Args);
|
||||
builtin_to_scode(_Env, auth_tx_hash, []) ->
|
||||
?TODO(fate_auth_tx_hash_instruction).
|
||||
[aeb_fate_ops:auth_tx_hash(?a)].
|
||||
|
||||
%% -- Operators --
|
||||
|
||||
@@ -511,7 +590,16 @@ op_to_scode(bits_intersection) -> aeb_fate_ops:bits_and(?a, ?a, ?a);
|
||||
op_to_scode(bits_union) -> aeb_fate_ops:bits_or(?a, ?a, ?a);
|
||||
op_to_scode(bits_difference) -> aeb_fate_ops:bits_diff(?a, ?a, ?a);
|
||||
op_to_scode(address_to_str) -> aeb_fate_ops:addr_to_str(?a, ?a);
|
||||
op_to_scode(int_to_str) -> aeb_fate_ops:int_to_str(?a, ?a).
|
||||
op_to_scode(int_to_str) -> aeb_fate_ops:int_to_str(?a, ?a);
|
||||
op_to_scode(contract_to_address) -> aeb_fate_ops:contract_to_address(?a, ?a);
|
||||
op_to_scode(crypto_ecverify) -> aeb_fate_ops:ecverify(?a, ?a, ?a, ?a);
|
||||
op_to_scode(crypto_ecverify_secp256k1) -> aeb_fate_ops:ecverify_secp256k1(?a, ?a, ?a, ?a);
|
||||
op_to_scode(crypto_sha3) -> aeb_fate_ops:sha3(?a, ?a);
|
||||
op_to_scode(crypto_sha256) -> aeb_fate_ops:sha256(?a, ?a);
|
||||
op_to_scode(crypto_blake2b) -> aeb_fate_ops:blake2b(?a, ?a);
|
||||
op_to_scode(string_sha3) -> aeb_fate_ops:sha3(?a, ?a);
|
||||
op_to_scode(string_sha256) -> aeb_fate_ops:sha256(?a, ?a);
|
||||
op_to_scode(string_blake2b) -> aeb_fate_ops:blake2b(?a, ?a).
|
||||
|
||||
%% PUSH and STORE ?a are the same, so we use STORE to make optimizations
|
||||
%% easier, and specialize to PUSH (which is cheaper) at the end.
|
||||
@@ -655,11 +743,9 @@ attributes(I) ->
|
||||
'RETURN' -> Impure(pc, []);
|
||||
{'RETURNR', A} -> Impure(pc, A);
|
||||
{'CALL', _} -> Impure(?a, []);
|
||||
{'CALL_R', A, _, B} -> Impure(?a, [A, B]);
|
||||
{'CALL_GR', A, _, B, C} -> Impure(?a, [A, B, C]);
|
||||
{'CALL_R', A, _, _, B} -> Impure(?a, [A, B]);
|
||||
{'CALL_GR', A, _, _, B, C} -> Impure(?a, [A, B, C]);
|
||||
{'CALL_T', _} -> Impure(pc, []);
|
||||
{'CALL_TR', A, _, B} -> Impure(pc, [A, B]);
|
||||
{'CALL_GTR', A, _, B, C} -> Impure(pc, [A, B, C]);
|
||||
{'CALL_VALUE', A} -> Pure(A, []);
|
||||
{'JUMP', _} -> Impure(pc, []);
|
||||
{'JUMPIF', A, _} -> Impure(pc, A);
|
||||
@@ -730,6 +816,20 @@ attributes(I) ->
|
||||
{'BITS_OR', A, B, C} -> Pure(A, [B, C]);
|
||||
{'BITS_AND', A, B, C} -> Pure(A, [B, C]);
|
||||
{'BITS_DIFF', A, B, C} -> Pure(A, [B, C]);
|
||||
{'SHA3', A, B} -> Pure(A, [B]);
|
||||
{'SHA256', A, B} -> Pure(A, [B]);
|
||||
{'BLAKE2B', A, B} -> Pure(A, [B]);
|
||||
{'ECVERIFY', A, B, C, D} -> Pure(A, [B, C, D]);
|
||||
{'ECVERIFY_SECP256K1', A, B, C, D} -> Pure(A, [B, C, D]);
|
||||
{'CONTRACT_TO_ADDRESS', A, B} -> Pure(A, [B]);
|
||||
{'AUTH_TX_HASH', A} -> Pure(A, []);
|
||||
{'BYTES_TO_INT', A, B} -> Pure(A, [B]);
|
||||
{'BYTES_TO_STR', A, B} -> Pure(A, [B]);
|
||||
{'ORACLE_CHECK', A, B, C, D} -> Impure(A, [B, C, D]);
|
||||
{'ORACLE_CHECK_QUERY', A, B, C, D, E} -> Impure(A, [B, C, D, E]);
|
||||
{'IS_ORACLE', A, B} -> Impure(A, [B]);
|
||||
{'IS_CONTRACT', A, B} -> Impure(A, [B]);
|
||||
{'CREATOR', A} -> Pure(A, []);
|
||||
{'ADDRESS', A} -> Pure(A, []);
|
||||
{'BALANCE', A} -> Impure(A, []);
|
||||
{'BALANCE_OTHER', A, B} -> Impure(A, [B]);
|
||||
@@ -744,31 +844,26 @@ attributes(I) ->
|
||||
{'DIFFICULTY', A} -> Pure(A, []);
|
||||
{'GASLIMIT', A} -> Pure(A, []);
|
||||
{'GAS', A} -> Impure(?a, A);
|
||||
{'LOG0', A, B} -> Impure(none, [A, B]);
|
||||
{'LOG1', A, B, C} -> Impure(none, [A, B, C]);
|
||||
{'LOG2', A, B, C, D} -> Impure(none, [A, B, C, D]);
|
||||
{'LOG3', A, B, C, D, E} -> Impure(none, [A, B, C, D, E]);
|
||||
{'LOG4', A, B, C, D, E, F} -> Impure(none, [A, B, C, D, E, F]);
|
||||
{'LOG0', A} -> Impure(none, [A]);
|
||||
{'LOG1', A, B} -> Impure(none, [A, B]);
|
||||
{'LOG2', A, B, C} -> Impure(none, [A, B, C]);
|
||||
{'LOG3', A, B, C, D} -> Impure(none, [A, B, C, D]);
|
||||
{'LOG4', A, B, C, D, E} -> Impure(none, [A, B, C, D, E]);
|
||||
'DEACTIVATE' -> Impure(none, []);
|
||||
{'SPEND', A, B} -> Impure(none, [A, B]);
|
||||
|
||||
{'ORACLE_REGISTER', A, B, C, D, E, F} -> Impure(A, [B, C, D, E, F]);
|
||||
'ORACLE_QUERY' -> Impure(?a, []); %% TODO
|
||||
'ORACLE_RESPOND' -> Impure(?a, []); %% TODO
|
||||
'ORACLE_EXTEND' -> Impure(?a, []); %% TODO
|
||||
'ORACLE_GET_ANSWER' -> Impure(?a, []); %% TODO
|
||||
'ORACLE_GET_QUESTION' -> Impure(?a, []); %% TODO
|
||||
'ORACLE_QUERY_FEE' -> Impure(?a, []); %% TODO
|
||||
'AENS_RESOLVE' -> Impure(?a, []); %% TODO
|
||||
'AENS_PRECLAIM' -> Impure(?a, []); %% TODO
|
||||
'AENS_CLAIM' -> Impure(?a, []); %% TODO
|
||||
'AENS_UPDATE' -> Impure(?a, []); %% TODO
|
||||
'AENS_TRANSFER' -> Impure(?a, []); %% TODO
|
||||
'AENS_REVOKE' -> Impure(?a, []); %% TODO
|
||||
'ECVERIFY' -> Pure(?a, []); %% TODO
|
||||
'SHA3' -> Pure(?a, []); %% TODO
|
||||
'SHA256' -> Pure(?a, []); %% TODO
|
||||
'BLAKE2B' -> Pure(?a, []); %% TODO
|
||||
{'ORACLE_REGISTER', A, B, C, D, E, F, G} -> Impure(A, [B, C, D, E, F, G]);
|
||||
{'ORACLE_QUERY', A, B, C, D, E, F, G, H} -> Impure(A, [B, C, D, E, F, G, H]);
|
||||
{'ORACLE_RESPOND', A, B, C, D, E, F} -> Impure(none, [A, B, C, D, E, F]);
|
||||
{'ORACLE_EXTEND', A, B, C} -> Impure(none, [A, B, C]);
|
||||
{'ORACLE_GET_ANSWER', A, B, C, D, E} -> Impure(A, [B, C, D, E]);
|
||||
{'ORACLE_GET_QUESTION', A, B, C, D, E}-> Impure(A, [B, C, D, E]);
|
||||
{'ORACLE_QUERY_FEE', A, B} -> Impure(A, [B]);
|
||||
{'AENS_RESOLVE', A, B, C, D} -> Impure(A, [B, C, D]);
|
||||
{'AENS_PRECLAIM', A, B, C} -> Impure(none, [A, B, C]);
|
||||
{'AENS_CLAIM', A, B, C, D, E} -> Impure(none, [A, B, C, D, E]);
|
||||
'AENS_UPDATE' -> Impure(none, []);%% TODO
|
||||
{'AENS_TRANSFER', A, B, C, D} -> Impure(none, [A, B, C, D]);
|
||||
{'AENS_REVOKE', A, B, C} -> Impure(none, [A, B, C]);
|
||||
{'ABORT', A} -> Impure(pc, A);
|
||||
{'EXIT', A} -> Impure(pc, A);
|
||||
'NOP' -> Pure(none, [])
|
||||
@@ -1239,7 +1334,7 @@ block(Blk = #blk{code = [{switch, Arg, Type, Alts, Default} | Code],
|
||||
{DefRef, DefBlk} =
|
||||
case Default of
|
||||
missing when Catchall == none ->
|
||||
FreshBlk([aeb_fate_ops:abort(?i(<<"Incomplete patterns">>))], none);
|
||||
FreshBlk([aeb_fate_ops:exit(?i(<<"Incomplete patterns">>))], none);
|
||||
missing -> {Catchall, []};
|
||||
_ -> FreshBlk(Default ++ [{jump, RestRef}], Catchall)
|
||||
%% ^ fall-through to the outer catchall
|
||||
@@ -1312,8 +1407,7 @@ reorder_blocks(Ref, Code, Blocks, Acc) ->
|
||||
['RETURN'|_] -> reorder_blocks(Blocks, Acc1);
|
||||
[{'RETURNR', _}|_] -> reorder_blocks(Blocks, Acc1);
|
||||
[{'CALL_T', _}|_] -> reorder_blocks(Blocks, Acc1);
|
||||
[{'CALL_TR', _, _, _}|_] -> reorder_blocks(Blocks, Acc1);
|
||||
[{'CALL_GTR', _, _, _}|_] -> reorder_blocks(Blocks, Acc1);
|
||||
[{'EXIT', _}|_] -> reorder_blocks(Blocks, Acc1);
|
||||
[{'ABORT', _}|_] -> reorder_blocks(Blocks, Acc1);
|
||||
[{switch, _, _}|_] -> reorder_blocks(Blocks, Acc1);
|
||||
[{jump, L}|_] ->
|
||||
@@ -1352,12 +1446,10 @@ chase_labels([L | Ls], Map, Live) ->
|
||||
chase_labels(New ++ Ls, Map, Live#{ L => true }).
|
||||
|
||||
%% Replace PUSH, RETURN by RETURNR, drop returns after tail calls.
|
||||
tweak_returns(['RETURN', {'PUSH', A} | Code]) -> [{'RETURNR', A} | Code];
|
||||
tweak_returns(['RETURN' | Code = [{'CALL_T', _} | _]]) -> Code;
|
||||
tweak_returns(['RETURN' | Code = [{'CALL_TR', _, _} | _]]) -> Code;
|
||||
tweak_returns(['RETURN' | Code = [{'CALL_GT', _} | _]]) -> Code;
|
||||
tweak_returns(['RETURN' | Code = [{'CALL_GTR', _, _} | _]])-> Code;
|
||||
tweak_returns(['RETURN' | Code = [{'ABORT', _} | _]]) -> Code;
|
||||
tweak_returns(['RETURN', {'PUSH', A} | Code]) -> [{'RETURNR', A} | Code];
|
||||
tweak_returns(['RETURN' | Code = [{'CALL_T', _} | _]]) -> Code;
|
||||
tweak_returns(['RETURN' | Code = [{'ABORT', _} | _]]) -> Code;
|
||||
tweak_returns(['RETURN' | Code = [{'EXIT', _} | _]]) -> Code;
|
||||
tweak_returns(Code) -> Code.
|
||||
|
||||
%% -- Split basic blocks at CALL instructions --
|
||||
@@ -1373,6 +1465,10 @@ split_calls(Ref, [I | Code], Acc, Blocks) when element(1, I) == 'CALL';
|
||||
element(1, I) == 'CALL_GR';
|
||||
element(1, I) == 'jumpif' ->
|
||||
split_calls(make_ref(), Code, [], [{Ref, lists:reverse([I | Acc])} | Blocks]);
|
||||
split_calls(Ref, [{'ABORT', _} = I | _Code], Acc, Blocks) ->
|
||||
lists:reverse([{Ref, lists:reverse([I | Acc])} | Blocks]);
|
||||
split_calls(Ref, [{'EXIT', _} = I | _Code], Acc, Blocks) ->
|
||||
lists:reverse([{Ref, lists:reverse([I | Acc])} | Blocks]);
|
||||
split_calls(Ref, [I | Code], Acc, Blocks) ->
|
||||
split_calls(Ref, Code, [I | Acc], Blocks).
|
||||
|
||||
@@ -1394,4 +1490,3 @@ set_labels(_, I) -> I.
|
||||
|
||||
with_ixs(Xs) ->
|
||||
lists:zip(lists:seq(0, length(Xs) - 1), Xs).
|
||||
|
||||
|
||||
@@ -105,7 +105,7 @@ make_args(Args) ->
|
||||
|
||||
fun_hash({FName, _, Args, _, TypeRep}) ->
|
||||
ArgType = {tuple, [T || {_, T} <- Args]},
|
||||
<<Hash:256>> = aeb_abi:function_type_hash(list_to_binary(lists:last(FName)), ArgType, TypeRep),
|
||||
<<Hash:256>> = aeb_aevm_abi:function_type_hash(list_to_binary(lists:last(FName)), ArgType, TypeRep),
|
||||
{integer, Hash}.
|
||||
|
||||
%% Expects two return addresses below N elements on the stack. Picks the top
|
||||
|
||||
+27
-14
@@ -47,7 +47,7 @@ decl() ->
|
||||
%% Contract declaration
|
||||
[ ?RULE(keyword(contract), con(), tok('='), maybe_block(decl()), {contract, _1, _2, _4})
|
||||
, ?RULE(keyword(namespace), con(), tok('='), maybe_block(decl()), {namespace, _1, _2, _4})
|
||||
, ?RULE(keyword(include), str(), {include, _2})
|
||||
, ?RULE(keyword(include), str(), {include, get_ann(_1), _2})
|
||||
|
||||
%% Type declarations TODO: format annotation for "type bla" vs "type bla()"
|
||||
, ?RULE(keyword(type), id(), {type_decl, _1, _2, []})
|
||||
@@ -60,13 +60,22 @@ decl() ->
|
||||
, ?RULE(keyword(datatype), id(), type_vars(), tok('='), typedef(variant), {type_def, _1, _2, _3, _5})
|
||||
|
||||
%% Function declarations
|
||||
, ?RULE(modifiers(), keyword(function), id(), tok(':'), type(), add_modifiers(_1, {fun_decl, _2, _3, _5}))
|
||||
, ?RULE(modifiers(), keyword(function), fundef(), add_modifiers(_1, set_pos(get_pos(_2), _3)))
|
||||
, ?RULE(keyword('let'), valdef(), set_pos(get_pos(_1), _2))
|
||||
, ?RULE(modifiers(), fun_or_entry(), id(), tok(':'), type(), add_modifiers(_1, _2, {fun_decl, get_ann(_2), _3, _5}))
|
||||
, ?RULE(modifiers(), fun_or_entry(), fundef(), add_modifiers(_1, _2, set_pos(get_pos(get_ann(_2)), _3)))
|
||||
, ?RULE(keyword('let'), valdef(), set_pos(get_pos(_1), _2))
|
||||
])).
|
||||
|
||||
fun_or_entry() ->
|
||||
choice([?RULE(keyword(function), {function, _1}),
|
||||
?RULE(keyword(entrypoint), {entrypoint, _1})]).
|
||||
|
||||
modifiers() ->
|
||||
many(choice([token(stateful), token(public), token(private), token(internal)])).
|
||||
many(choice([token(stateful), token(private), token(public)])).
|
||||
|
||||
add_modifiers(Mods, Entry = {entrypoint, _}, Node) ->
|
||||
add_modifiers(Mods ++ [Entry], Node);
|
||||
add_modifiers(Mods, {function, _}, Node) ->
|
||||
add_modifiers(Mods, Node).
|
||||
|
||||
add_modifiers([], Node) -> Node;
|
||||
add_modifiers(Mods = [Tok | _], Node) ->
|
||||
@@ -131,7 +140,8 @@ type100() -> type200().
|
||||
type200() ->
|
||||
?RULE(many({fun_domain(), keyword('=>')}), type300(), fun_t(_1, _2)).
|
||||
|
||||
type300() -> type400().
|
||||
type300() ->
|
||||
?RULE(sep1(type400(), tok('*')), tuple_t(get_ann(lists:nth(1, _1)), _1)).
|
||||
|
||||
type400() ->
|
||||
choice(
|
||||
@@ -146,11 +156,18 @@ type400() ->
|
||||
|
||||
typeAtom() ->
|
||||
?LAZY_P(choice(
|
||||
[ id(), token(con), token(qcon), token(qid), tvar()
|
||||
, ?RULE(keyword('('), comma_sep(type()), tok(')'), tuple_t(_1, _2))
|
||||
[ parens(type())
|
||||
, id(), token(con), token(qcon), token(qid), tvar()
|
||||
])).
|
||||
|
||||
fun_domain() -> ?RULE(?LAZY_P(type300()), fun_domain(_1)).
|
||||
fun_domain() -> ?LAZY_P(choice(
|
||||
[ ?RULE(tok('('), tok(')'), [])
|
||||
%% Note avoidance of ambiguity: `(int)` can be treated as:
|
||||
%% - literally `int`
|
||||
%% - list of arguments with just one element – int. This approach is dropped.
|
||||
, ?RULE(tok('('), type(), tok(','), sep1(type(), tok(',')), tok(')'), [_2|_4])
|
||||
, ?RULE(type300(), [_1])
|
||||
])).
|
||||
|
||||
%% -- Statements -------------------------------------------------------------
|
||||
|
||||
@@ -464,10 +481,6 @@ fun_t(Domains, Type) ->
|
||||
tuple_e(_Ann, [Expr]) -> Expr; %% Not a tuple
|
||||
tuple_e(Ann, Exprs) -> {tuple, Ann, Exprs}.
|
||||
|
||||
%% TODO: not nice
|
||||
fun_domain({tuple_t, _, Args}) -> Args;
|
||||
fun_domain(T) -> [T].
|
||||
|
||||
-spec parse_pattern(aeso_syntax:expr()) -> aeso_parse_lib:parser(aeso_syntax:pat()).
|
||||
parse_pattern({app, Ann, Con = {'::', _}, Es}) ->
|
||||
{app, Ann, Con, lists:map(fun parse_pattern/1, Es)};
|
||||
@@ -513,7 +526,7 @@ expand_includes(AST, Opts) ->
|
||||
|
||||
expand_includes([], Acc, _Opts) ->
|
||||
{ok, lists:reverse(Acc)};
|
||||
expand_includes([{include, S = {string, _, File}} | AST], Acc, Opts) ->
|
||||
expand_includes([{include, _, S = {string, _, File}} | AST], Acc, Opts) ->
|
||||
case read_file(File, Opts) of
|
||||
{ok, Bin} ->
|
||||
Opts1 = lists:keystore(src_file, 1, Opts, {src_file, File}),
|
||||
|
||||
+29
-9
@@ -153,13 +153,21 @@ decl({type_decl, _, T, Vars}) -> typedecl(alias_t, T, Vars);
|
||||
decl({type_def, _, T, Vars, Def}) ->
|
||||
Kind = element(1, Def),
|
||||
equals(typedecl(Kind, T, Vars), typedef(Def));
|
||||
decl({fun_decl, _, F, T}) ->
|
||||
hsep(text("function"), typed(name(F), T));
|
||||
decl({fun_decl, Ann, F, T}) ->
|
||||
Fun = case aeso_syntax:get_ann(entrypoint, Ann, false) of
|
||||
true -> text("entrypoint");
|
||||
false -> text("function")
|
||||
end,
|
||||
hsep(Fun, typed(name(F), T));
|
||||
decl(D = {letfun, Attrs, _, _, _, _}) ->
|
||||
Mod = fun({Mod, true}) when Mod == private; Mod == internal; Mod == public; Mod == stateful ->
|
||||
Mod = fun({Mod, true}) when Mod == private; Mod == stateful ->
|
||||
text(atom_to_list(Mod));
|
||||
(_) -> empty() end,
|
||||
hsep(lists:map(Mod, Attrs) ++ [letdecl("function", D)]);
|
||||
Fun = case aeso_syntax:get_ann(entrypoint, Attrs, false) of
|
||||
true -> "entrypoint";
|
||||
false -> "function"
|
||||
end,
|
||||
hsep(lists:map(Mod, Attrs) ++ [letdecl(Fun, D)]);
|
||||
decl(D = {letval, _, _, _, _}) -> letdecl("let", D).
|
||||
|
||||
-spec expr(aeso_syntax:expr(), options()) -> doc().
|
||||
@@ -214,7 +222,7 @@ typedef({variant_t, Constructors}) ->
|
||||
|
||||
-spec constructor_t(aeso_syntax:constructor_t()) -> doc().
|
||||
constructor_t({constr_t, _, C, []}) -> name(C);
|
||||
constructor_t({constr_t, _, C, Args}) -> beside(name(C), tuple_type(Args)).
|
||||
constructor_t({constr_t, _, C, Args}) -> beside(name(C), args_type(Args)).
|
||||
|
||||
-spec field_t(aeso_syntax:field_t()) -> doc().
|
||||
field_t({field_t, _, Name, Type}) ->
|
||||
@@ -226,13 +234,14 @@ type(Type, Options) ->
|
||||
|
||||
-spec type(aeso_syntax:type()) -> doc().
|
||||
type({fun_t, _, Named, Args, Ret}) ->
|
||||
follow(hsep(tuple_type(Named ++ Args), text("=>")), type(Ret));
|
||||
follow(hsep(args_type(Named ++ Args), text("=>")), type(Ret));
|
||||
type({app_t, _, Type, []}) ->
|
||||
type(Type);
|
||||
type({app_t, _, Type, Args}) ->
|
||||
beside(type(Type), tuple_type(Args));
|
||||
beside(type(Type), args_type(Args));
|
||||
type({tuple_t, _, Args}) ->
|
||||
tuple_type(Args);
|
||||
type({bytes_t, _, any}) -> text("bytes(_)");
|
||||
type({bytes_t, _, Len}) ->
|
||||
text(lists:concat(["bytes(", Len, ")"]));
|
||||
type({named_arg_t, _, Name, Type, _Default}) ->
|
||||
@@ -247,10 +256,20 @@ type(T = {con, _, _}) -> name(T);
|
||||
type(T = {qcon, _, _}) -> name(T);
|
||||
type(T = {tvar, _, _}) -> name(T).
|
||||
|
||||
-spec tuple_type([aeso_syntax:type()]) -> doc().
|
||||
tuple_type(Args) ->
|
||||
-spec args_type([aeso_syntax:type()]) -> doc().
|
||||
args_type(Args) ->
|
||||
tuple(lists:map(fun type/1, Args)).
|
||||
|
||||
-spec tuple_type([aeso_syntax:type()]) -> doc().
|
||||
tuple_type([]) ->
|
||||
text("unit");
|
||||
tuple_type(Factors) ->
|
||||
beside(
|
||||
[ text("(")
|
||||
, par(punctuate(text(" *"), lists:map(fun type/1, Factors)), 0)
|
||||
, text(")")
|
||||
]).
|
||||
|
||||
-spec arg_expr(aeso_syntax:arg_expr()) -> doc().
|
||||
arg_expr({named_arg, _, Name, E}) ->
|
||||
follow(hsep(expr(Name), text("=")), expr(E));
|
||||
@@ -329,6 +348,7 @@ expr_p(_, {Type, _, Bin})
|
||||
Type == oracle_pubkey;
|
||||
Type == oracle_query_id ->
|
||||
text(binary_to_list(aeser_api_encoder:encode(Type, Bin)));
|
||||
expr_p(_, {string, _, <<>>}) -> text("\"\"");
|
||||
expr_p(_, {string, _, S}) -> term(binary_to_list(S));
|
||||
expr_p(_, {char, _, C}) ->
|
||||
case C of
|
||||
|
||||
+1
-1
@@ -37,7 +37,7 @@ lexer() ->
|
||||
, {"[^/*]+|[/*]", skip()} ],
|
||||
|
||||
Keywords = ["contract", "include", "let", "switch", "type", "record", "datatype", "if", "elif", "else", "function",
|
||||
"stateful", "true", "false", "mod", "public", "private", "indexed", "internal", "namespace"],
|
||||
"stateful", "true", "false", "mod", "public", "entrypoint", "private", "indexed", "namespace"],
|
||||
KW = string:join(Keywords, "|"),
|
||||
|
||||
Rules =
|
||||
|
||||
+6
-7
@@ -59,7 +59,7 @@
|
||||
-type type() :: {fun_t, ann(), [named_arg_t()], [type()], type()}
|
||||
| {app_t, ann(), type(), [type()]}
|
||||
| {tuple_t, ann(), [type()]}
|
||||
| {bytes_t, ann(), integer()}
|
||||
| {bytes_t, ann(), integer() | any}
|
||||
| id() | qid()
|
||||
| con() | qcon() %% contracts
|
||||
| tvar().
|
||||
@@ -69,11 +69,11 @@
|
||||
-type constant()
|
||||
:: {int, ann(), integer()}
|
||||
| {bool, ann(), true | false}
|
||||
| {hash, ann(), binary()}
|
||||
| {account_pubkey, binary()}
|
||||
| {contract_pubkey, binary()}
|
||||
| {oracle_pubkey, binary()}
|
||||
| {oracle_query_id, binary()}
|
||||
| {bytes, ann(), binary()}
|
||||
| {account_pubkey, ann(), binary()}
|
||||
| {contract_pubkey, ann(), binary()}
|
||||
| {oracle_pubkey, ann(), binary()}
|
||||
| {oracle_query_id, ann(), binary()}
|
||||
| {string, ann(), binary()}
|
||||
| {char, ann(), integer()}.
|
||||
|
||||
@@ -148,4 +148,3 @@ get_ann(Key, Node, Default) ->
|
||||
qualify({con, Ann, N}, X) -> qualify({qcon, Ann, [N]}, X);
|
||||
qualify({qcon, _, NS}, {con, Ann, C}) -> {qcon, Ann, NS ++ [C]};
|
||||
qualify({qcon, _, NS}, {id, Ann, X}) -> {qid, Ann, NS ++ [X]}.
|
||||
|
||||
|
||||
@@ -0,0 +1,113 @@
|
||||
%%%-------------------------------------------------------------------
|
||||
%%% @copyright (C) 2017, Aeternity Anstalt
|
||||
%%% @doc Decoding aevm and fate data to AST
|
||||
%%%
|
||||
%%% @end
|
||||
%%%-------------------------------------------------------------------
|
||||
|
||||
-module(aeso_vm_decode).
|
||||
|
||||
-export([ from_aevm/3, from_fate/2 ]).
|
||||
|
||||
-include_lib("aebytecode/include/aeb_fate_data.hrl").
|
||||
|
||||
address_literal(Type, N) -> {Type, [], <<N:256>>}.
|
||||
|
||||
-spec from_aevm(aeb_aevm_data:type(), aeso_syntax:type(), aeb_aevm_data:data()) -> aeso_syntax:expr().
|
||||
from_aevm(word, {id, _, "address"}, N) -> address_literal(account_pubkey, N);
|
||||
from_aevm(word, {app_t, _, {id, _, "oracle"}, _}, N) -> address_literal(oracle_pubkey, N);
|
||||
from_aevm(word, {app_t, _, {id, _, "oracle_query"}, _}, N) -> address_literal(oracle_query_id, N);
|
||||
from_aevm(word, {con, _, _Name}, N) -> address_literal(contract_pubkey, N);
|
||||
from_aevm(word, {id, _, "int"}, N) -> <<N1:256/signed>> = <<N:256>>, {int, [], N1};
|
||||
from_aevm(word, {id, _, "bits"}, N) -> error({todo, bits, N});
|
||||
from_aevm(word, {id, _, "bool"}, N) -> {bool, [], N /= 0};
|
||||
from_aevm(word, {bytes_t, _, Len}, Val) when Len =< 32 ->
|
||||
<<Bytes:Len/unit:8, _/binary>> = <<Val:32/unit:8>>,
|
||||
{bytes, [], <<Bytes:Len/unit:8>>};
|
||||
from_aevm({tuple, _}, {bytes_t, _, Len}, Val) ->
|
||||
{bytes, [], binary:part(<< <<W:32/unit:8>> || W <- tuple_to_list(Val) >>, 0, Len)};
|
||||
from_aevm(string, {id, _, "string"}, S) -> {string, [], S};
|
||||
from_aevm({list, VmType}, {app_t, _, {id, _, "list"}, [Type]}, List) ->
|
||||
{list, [], [from_aevm(VmType, Type, X) || X <- List]};
|
||||
from_aevm({variant, [[], [VmType]]}, {app_t, _, {id, _, "option"}, [Type]}, Val) ->
|
||||
case Val of
|
||||
{variant, 0, []} -> {con, [], "None"};
|
||||
{variant, 1, [X]} -> {app, [], {con, [], "Some"}, [from_aevm(VmType, Type, X)]}
|
||||
end;
|
||||
from_aevm({tuple, VmTypes}, {tuple_t, _, Types}, Val)
|
||||
when length(VmTypes) == length(Types),
|
||||
length(VmTypes) == tuple_size(Val) ->
|
||||
{tuple, [], [from_aevm(VmType, Type, X)
|
||||
|| {VmType, Type, X} <- lists:zip3(VmTypes, Types, tuple_to_list(Val))]};
|
||||
from_aevm({tuple, VmTypes}, {record_t, Fields}, Val)
|
||||
when length(VmTypes) == length(Fields),
|
||||
length(VmTypes) == tuple_size(Val) ->
|
||||
{record, [], [ {field, [], [{proj, [], FName}], from_aevm(VmType, FType, X)}
|
||||
|| {VmType, {field_t, _, FName, FType}, X} <- lists:zip3(VmTypes, Fields, tuple_to_list(Val)) ]};
|
||||
from_aevm({map, VmKeyType, VmValType}, {app_t, _, {id, _, "map"}, [KeyType, ValType]}, Map)
|
||||
when is_map(Map) ->
|
||||
{map, [], [ {from_aevm(VmKeyType, KeyType, Key),
|
||||
from_aevm(VmValType, ValType, Val)}
|
||||
|| {Key, Val} <- maps:to_list(Map) ]};
|
||||
from_aevm({variant, VmCons}, {variant_t, Cons}, {variant, Tag, Args})
|
||||
when length(VmCons) == length(Cons),
|
||||
length(VmCons) > Tag ->
|
||||
VmTypes = lists:nth(Tag + 1, VmCons),
|
||||
ConType = lists:nth(Tag + 1, Cons),
|
||||
from_aevm(VmTypes, ConType, Args);
|
||||
from_aevm(VmTypes, {constr_t, _, Con, Types}, Args)
|
||||
when length(VmTypes) == length(Types),
|
||||
length(VmTypes) == length(Args) ->
|
||||
{app, [], Con, [ from_aevm(VmType, Type, Arg)
|
||||
|| {VmType, Type, Arg} <- lists:zip3(VmTypes, Types, Args) ]};
|
||||
from_aevm(_VmType, _Type, _Data) ->
|
||||
throw(cannot_translate_to_sophia).
|
||||
|
||||
|
||||
-spec from_fate(aeso_syntax:type(), aeb_fate_data:fate_type()) -> aeso_syntax:expr().
|
||||
from_fate({id, _, "address"}, ?FATE_ADDRESS(Bin)) -> {account_pubkey, [], Bin};
|
||||
from_fate({app_t, _, {id, _, "oracle"}, _}, ?FATE_ORACLE(Bin)) -> {oracle_pubkey, [], Bin};
|
||||
from_fate({app_t, _, {id, _, "oracle_query"}, _}, ?FATE_ORACLE_Q(Bin)) -> {oracle_query_id, [], Bin};
|
||||
from_fate({con, _, _Name}, ?FATE_CONTRACT(Bin)) -> {contract_pubkey, [], Bin};
|
||||
from_fate({bytes_t, _, N}, ?FATE_BYTES(Bin)) when byte_size(Bin) == N -> {bytes, [], Bin};
|
||||
from_fate({id, _, "bits"}, ?FATE_BITS(Bin)) -> error({todo, bits, Bin});
|
||||
from_fate({id, _, "int"}, N) when is_integer(N) -> {int, [], N};
|
||||
from_fate({id, _, "bool"}, B) when is_boolean(B) -> {bool, [], B};
|
||||
from_fate({id, _, "string"}, S) when is_binary(S) -> {string, [], S};
|
||||
from_fate({app_t, _, {id, _, "list"}, [Type]}, List) when is_list(List) ->
|
||||
{list, [], [from_fate(Type, X) || X <- List]};
|
||||
from_fate({app_t, _, {id, _, "option"}, [Type]}, Val) ->
|
||||
case Val of
|
||||
{variant, [0, 1], 0, {}} -> {con, [], "None"};
|
||||
{variant, [0, 1], 1, {X}} -> {app, [], {con, [], "Some"}, [from_fate(Type, X)]}
|
||||
end;
|
||||
from_fate({tuple_t, _, []}, ?FATE_UNIT) ->
|
||||
{tuple, [], []};
|
||||
from_fate({tuple_t, _, Types}, ?FATE_TUPLE(Val))
|
||||
when length(Types) == tuple_size(Val) ->
|
||||
{tuple, [], [from_fate(Type, X)
|
||||
|| {Type, X} <- lists:zip(Types, tuple_to_list(Val))]};
|
||||
from_fate({record_t, Fields}, ?FATE_TUPLE(Val))
|
||||
when length(Fields) == tuple_size(Val) ->
|
||||
{record, [], [ {field, [], [{proj, [], FName}], from_fate(FType, X)}
|
||||
|| {{field_t, _, FName, FType}, X} <- lists:zip(Fields, tuple_to_list(Val)) ]};
|
||||
from_fate({app_t, _, {id, _, "map"}, [KeyType, ValType]}, Map)
|
||||
when is_map(Map) ->
|
||||
{map, [], [ {from_fate(KeyType, Key),
|
||||
from_fate(ValType, Val)}
|
||||
|| {Key, Val} <- maps:to_list(Map) ]};
|
||||
from_fate({variant_t, Cons}, {variant, Ar, Tag, Args})
|
||||
when length(Cons) > Tag ->
|
||||
ConType = lists:nth(Tag + 1, Cons),
|
||||
Arity = lists:nth(Tag + 1, Ar),
|
||||
case tuple_to_list(Args) of
|
||||
ArgList when length(ArgList) == Arity ->
|
||||
from_fate(ConType, ArgList);
|
||||
_ -> throw(cannot_translate_to_sophia)
|
||||
end;
|
||||
from_fate({constr_t, _, Con, Types}, Args)
|
||||
when length(Types) == length(Args) ->
|
||||
{app, [], Con, [ from_fate(Type, Arg)
|
||||
|| {Type, Arg} <- lists:zip(Types, Args) ]};
|
||||
from_fate(_Type, _Data) ->
|
||||
throw(cannot_translate_to_sophia).
|
||||
@@ -1,6 +1,6 @@
|
||||
{application, aesophia,
|
||||
[{description, "Contract Language for aeternity"},
|
||||
{vsn, "3.1.0"},
|
||||
{vsn, "3.2.0"},
|
||||
{registered, []},
|
||||
{applications,
|
||||
[kernel,
|
||||
@@ -8,7 +8,8 @@
|
||||
jsx,
|
||||
syntax_tools,
|
||||
getopt,
|
||||
aebytecode
|
||||
aebytecode,
|
||||
eblake2
|
||||
]},
|
||||
{env,[]},
|
||||
{modules, []},
|
||||
|
||||
+17
-17
@@ -66,7 +66,7 @@ encode_decode_sophia_test() ->
|
||||
ok = Check("bool", "true"),
|
||||
ok = Check("bool", "false"),
|
||||
ok = Check("string", "\"Hello\""),
|
||||
ok = Check("(string, list(int), option(bool))",
|
||||
ok = Check("string * list(int) * option(bool)",
|
||||
"(\"Hello\", [1, 2, 3], Some(true))"),
|
||||
ok = Check("variant", "Blue({[\"x\"] = 1})"),
|
||||
ok = Check("r", "{x = (\"foo\", 0), y = Red}"),
|
||||
@@ -76,10 +76,10 @@ encode_decode_sophia_string(SophiaType, String) ->
|
||||
io:format("String ~p~n", [String]),
|
||||
Code = [ "contract MakeCall =\n"
|
||||
, " type arg_type = ", SophiaType, "\n"
|
||||
, " type an_alias('a) = (string, 'a)\n"
|
||||
, " type an_alias('a) = string * 'a\n"
|
||||
, " record r = {x : an_alias(int), y : variant}\n"
|
||||
, " datatype variant = Red | Blue(map(string, int))\n"
|
||||
, " function foo : arg_type => arg_type\n" ],
|
||||
, " entrypoint foo : arg_type => arg_type\n" ],
|
||||
case aeso_compiler:check_call(lists:flatten(Code), "foo", [String], []) of
|
||||
{ok, _, {[Type], _}, [Arg]} ->
|
||||
io:format("Type ~p~n", [Type]),
|
||||
@@ -120,16 +120,14 @@ calldata_init_test() ->
|
||||
|
||||
calldata_indent_test() ->
|
||||
Test = fun(Extra) ->
|
||||
encode_decode_calldata_(
|
||||
parameterized_contract(Extra, "foo", ["int"]),
|
||||
"foo", ["42"], word)
|
||||
Code = parameterized_contract(Extra, "foo", ["int"]),
|
||||
encode_decode_calldata_(Code, "foo", ["42"], word)
|
||||
end,
|
||||
Test(" stateful function bla() = ()"),
|
||||
Test(" stateful entrypoint bla() = ()"),
|
||||
Test(" type x = int"),
|
||||
Test(" private function bla : int => int"),
|
||||
Test(" public stateful function bla(x : int) =\n"
|
||||
Test(" stateful entrypoint bla(x : int) =\n"
|
||||
" x + 1"),
|
||||
Test(" stateful private function bla(x : int) : int =\n"
|
||||
Test(" stateful entrypoint bla(x : int) : int =\n"
|
||||
" x + 1"),
|
||||
ok.
|
||||
|
||||
@@ -139,18 +137,18 @@ parameterized_contract(FunName, Types) ->
|
||||
parameterized_contract(ExtraCode, FunName, Types) ->
|
||||
lists:flatten(
|
||||
["contract Remote =\n"
|
||||
" function bla : () => ()\n\n"
|
||||
" entrypoint bla : () => unit\n\n"
|
||||
"contract Dummy =\n",
|
||||
ExtraCode, "\n",
|
||||
" type an_alias('a) = (string, 'a)\n"
|
||||
" type an_alias('a) = string * 'a\n"
|
||||
" record r = {x : an_alias(int), y : variant}\n"
|
||||
" datatype variant = Red | Blue(map(string, int))\n"
|
||||
" function ", FunName, " : (", string:join(Types, ", "), ") => int\n" ]).
|
||||
" entrypoint ", FunName, " : (", string:join(Types, ", "), ") => int\n" ]).
|
||||
|
||||
oracle_test() ->
|
||||
Contract =
|
||||
"contract OracleTest =\n"
|
||||
" function question(o, q : oracle_query(list(string), option(int))) =\n"
|
||||
" entrypoint question(o, q : oracle_query(list(string), option(int))) =\n"
|
||||
" Oracle.get_question(o, q)\n",
|
||||
{ok, _, {[word, word], {list, string}}, [16#123, 16#456]} =
|
||||
aeso_compiler:check_call(Contract, "question", ["ok_111111111111111111111111111111ZrdqRz9",
|
||||
@@ -161,7 +159,7 @@ oracle_test() ->
|
||||
permissive_literals_fail_test() ->
|
||||
Contract =
|
||||
"contract OracleTest =\n"
|
||||
" stateful function haxx(o : oracle(list(string), option(int))) =\n"
|
||||
" stateful entrypoint haxx(o : oracle(list(string), option(int))) =\n"
|
||||
" Chain.spend(o, 1000000)\n",
|
||||
{error, <<"Type errors\nCannot unify", _/binary>>} =
|
||||
aeso_compiler:check_call(Contract, "haxx", ["#123"], []),
|
||||
@@ -175,8 +173,10 @@ encode_decode_calldata(FunName, Types, Args, RetType) ->
|
||||
encode_decode_calldata_(Code, FunName, Args, RetType).
|
||||
|
||||
encode_decode_calldata_(Code, FunName, Args, RetVMType) ->
|
||||
{ok, Calldata, CalldataType, RetVMType1} = aeso_compiler:create_calldata(Code, FunName, Args),
|
||||
?assertEqual(RetVMType1, RetVMType),
|
||||
{ok, Calldata} = aeso_compiler:create_calldata(Code, FunName, Args),
|
||||
{ok, _, {ArgTypes, RetType}, _} = aeso_compiler:check_call(Code, FunName, Args, [{backend, aevm}]),
|
||||
?assertEqual(RetType, RetVMType),
|
||||
CalldataType = {tuple, [word, {tuple, ArgTypes}]},
|
||||
{ok, {_Hash, ArgTuple}} = aeb_heap:from_binary(CalldataType, Calldata),
|
||||
case FunName of
|
||||
"init" ->
|
||||
|
||||
@@ -15,7 +15,7 @@ test_contract(N) ->
|
||||
|
||||
test_cases(1) ->
|
||||
Contract = <<"contract C =\n"
|
||||
" function a(i : int) = i+1\n">>,
|
||||
" entrypoint a(i : int) = i+1\n">>,
|
||||
MapACI = #{contract =>
|
||||
#{name => <<"C">>,
|
||||
type_defs => [],
|
||||
@@ -27,13 +27,13 @@ test_cases(1) ->
|
||||
returns => <<"int">>,
|
||||
stateful => false}]}},
|
||||
DecACI = <<"contract C =\n"
|
||||
" function a : (int) => int\n">>,
|
||||
" entrypoint a : (int) => int\n">>,
|
||||
{Contract,MapACI,DecACI};
|
||||
|
||||
test_cases(2) ->
|
||||
Contract = <<"contract C =\n"
|
||||
" type allan = int\n"
|
||||
" function a(i : allan) = i+1\n">>,
|
||||
" entrypoint a(i : allan) = i+1\n">>,
|
||||
MapACI = #{contract =>
|
||||
#{name => <<"C">>,
|
||||
type_defs =>
|
||||
@@ -49,14 +49,14 @@ test_cases(2) ->
|
||||
stateful => false}]}},
|
||||
DecACI = <<"contract C =\n"
|
||||
" type allan = int\n"
|
||||
" function a : (C.allan) => int\n">>,
|
||||
" entrypoint a : (C.allan) => int\n">>,
|
||||
{Contract,MapACI,DecACI};
|
||||
test_cases(3) ->
|
||||
Contract = <<"contract C =\n"
|
||||
" type state = ()\n"
|
||||
" type state = unit\n"
|
||||
" datatype event = SingleEventDefined\n"
|
||||
" datatype bert('a) = Bin('a)\n"
|
||||
" function a(i : bert(string)) = 1\n">>,
|
||||
" entrypoint a(i : bert(string)) = 1\n">>,
|
||||
MapACI = #{contract =>
|
||||
#{functions =>
|
||||
[#{arguments =>
|
||||
@@ -67,7 +67,7 @@ test_cases(3) ->
|
||||
stateful => false}],
|
||||
name => <<"C">>,
|
||||
event => #{variant => [#{<<"SingleEventDefined">> => []}]},
|
||||
state => #{tuple => []},
|
||||
state => <<"unit">>,
|
||||
type_defs =>
|
||||
[#{name => <<"bert">>,
|
||||
typedef =>
|
||||
@@ -75,10 +75,10 @@ test_cases(3) ->
|
||||
[#{<<"Bin">> => [<<"'a">>]}]},
|
||||
vars => [#{name => <<"'a">>}]}]}},
|
||||
DecACI = <<"contract C =\n"
|
||||
" type state = ()\n"
|
||||
" type state = unit\n"
|
||||
" datatype event = SingleEventDefined\n"
|
||||
" datatype bert('a) = Bin('a)\n"
|
||||
" function a : (C.bert(string)) => int\n">>,
|
||||
" entrypoint a : (C.bert(string)) => int\n">>,
|
||||
{Contract,MapACI,DecACI}.
|
||||
|
||||
%% Rounttrip
|
||||
|
||||
@@ -0,0 +1,128 @@
|
||||
%%% -*- erlang-indent-level:4; indent-tabs-mode: nil -*-
|
||||
%%%-------------------------------------------------------------------
|
||||
%%% @copyright (C) 2019, Aeternity Anstalt
|
||||
%%% @doc Test Sophia language compiler.
|
||||
%%%
|
||||
%%% @end
|
||||
%%%-------------------------------------------------------------------
|
||||
|
||||
-module(aeso_calldata_tests).
|
||||
|
||||
-compile([export_all, nowarn_export_all]).
|
||||
|
||||
-include_lib("eunit/include/eunit.hrl").
|
||||
|
||||
%% Very simply test compile the given contracts. Only basic checks
|
||||
%% are made on the output, just that it is a binary which indicates
|
||||
%% that the compilation worked.
|
||||
calldata_test_() ->
|
||||
[ {"Testing " ++ ContractName ++ " contract calling " ++ Fun,
|
||||
fun() ->
|
||||
ContractString = aeso_test_utils:read_contract(ContractName),
|
||||
AevmExprs =
|
||||
case not lists:member(ContractName, not_yet_compilable(aevm)) of
|
||||
true -> ast_exprs(ContractString, Fun, Args, [{backend, aevm}]);
|
||||
false -> undefined
|
||||
end,
|
||||
FateExprs =
|
||||
case not lists:member(ContractName, not_yet_compilable(fate)) of
|
||||
true -> ast_exprs(ContractString, Fun, Args, [{backend, fate}]);
|
||||
false -> undefined
|
||||
end,
|
||||
case FateExprs == undefined orelse AevmExprs == undefined of
|
||||
true -> ok;
|
||||
false ->
|
||||
?assertEqual(FateExprs, AevmExprs)
|
||||
end
|
||||
end} || {ContractName, Fun, Args} <- compilable_contracts()].
|
||||
|
||||
calldata_aci_test_() ->
|
||||
[ {"Testing " ++ ContractName ++ " contract calling " ++ Fun,
|
||||
fun() ->
|
||||
ContractString = aeso_test_utils:read_contract(ContractName),
|
||||
{ok, ContractACIBin} = aeso_aci:contract_interface(string, ContractString),
|
||||
ContractACI = binary_to_list(ContractACIBin),
|
||||
io:format("ACI:\n~s\n", [ContractACIBin]),
|
||||
AevmExprs =
|
||||
case not lists:member(ContractName, not_yet_compilable(aevm)) of
|
||||
true -> ast_exprs(ContractACI, Fun, Args, [{backend, aevm}]);
|
||||
false -> undefined
|
||||
end,
|
||||
FateExprs =
|
||||
case not lists:member(ContractName, not_yet_compilable(fate)) of
|
||||
true -> ast_exprs(ContractACI, Fun, Args, [{backend, fate}]);
|
||||
false -> undefined
|
||||
end,
|
||||
case FateExprs == undefined orelse AevmExprs == undefined of
|
||||
true -> ok;
|
||||
false ->
|
||||
?assertEqual(FateExprs, AevmExprs)
|
||||
end
|
||||
end} || {ContractName, Fun, Args} <- compilable_contracts()].
|
||||
|
||||
|
||||
ast_exprs(ContractString, Fun, Args, Opts) ->
|
||||
{ok, Data} = (catch aeso_compiler:create_calldata(ContractString, Fun, Args, Opts)),
|
||||
{ok, _Types, Exprs} = (catch aeso_compiler:decode_calldata(ContractString, Fun, Data, Opts)),
|
||||
?assert(is_list(Exprs)),
|
||||
Exprs.
|
||||
|
||||
check_errors(Expect, ErrorString) ->
|
||||
%% This removes the final single \n as well.
|
||||
Actual = binary:split(<<ErrorString/binary,$\n>>, <<"\n\n">>, [global,trim]),
|
||||
case {Expect -- Actual, Actual -- Expect} of
|
||||
{[], Extra} -> ?assertMatch({unexpected, []}, {unexpected, Extra});
|
||||
{Missing, []} -> ?assertMatch({missing, []}, {missing, Missing});
|
||||
{Missing, Extra} -> ?assertEqual(Missing, Extra)
|
||||
end.
|
||||
|
||||
%% compilable_contracts() -> [ContractName].
|
||||
%% The currently compilable contracts.
|
||||
|
||||
compilable_contracts() ->
|
||||
[
|
||||
{"identity", "init", []},
|
||||
{"maps", "init", []},
|
||||
{"funargs", "menot", ["false"]},
|
||||
{"funargs", "append", ["[\"false\", \" is\", \" not\", \" true\"]"]},
|
||||
%% TODO {"funargs", "bitsum", ["Bits.all"]},
|
||||
{"funargs", "read", ["{label = \"question 1\", result = 4}"]},
|
||||
{"funargs", "sjutton", ["#0011012003100011012003100011012003"]},
|
||||
{"funargs", "sextiosju", ["#01020304050607080910111213141516171819202122232425262728293031323334353637383940"
|
||||
"414243444546474849505152535455565758596061626364656667"]},
|
||||
{"funargs", "trettiotva", ["#0102030405060708091011121314151617181920212223242526272829303132"]},
|
||||
{"funargs", "find_oracle", ["ok_2YNyxd6TRJPNrTcEDCe9ra59SVUdp9FR9qWC5msKZWYD9bP9z5"]},
|
||||
{"funargs", "find_query", ["oq_2oRvyowJuJnEkxy58Ckkw77XfWJrmRgmGaLzhdqb67SKEL1gPY"]},
|
||||
{"funargs", "traffic_light", ["Green"]},
|
||||
{"funargs", "traffic_light", ["Pantone(12)"]},
|
||||
{"funargs", "tuples", ["()"]},
|
||||
%% TODO {"funargs", "due", ["FixedTTL(1020)"]},
|
||||
{"variant_types", "init", []},
|
||||
{"basic_auth", "init", []},
|
||||
{"address_literals", "init", []},
|
||||
{"bytes_equality", "init", []},
|
||||
{"address_chain", "init", []},
|
||||
{"counter", "init",
|
||||
["-3334353637383940202122232425262728293031323334353637"]},
|
||||
{"dutch_auction", "init",
|
||||
["ak_2gx9MEFxKvY9vMG5YnqnXWv1hCsX7rgnfvBLJS4aQurustR1rt", "200000", "1000"]},
|
||||
{"maps", "fromlist_i",
|
||||
["[(1, {x = 1, y = 2}), (2, {x = 3, y = 4}), (3, {x = 4, y = 4})]"]},
|
||||
{"maps", "get_i", ["1", "{}"]},
|
||||
{"maps", "get_i", ["1", "{[1] = {x = 3, y = 4}}"]},
|
||||
{"maps", "get_i", ["1", "{[1] = {x = 3, y = 4}, [2] = {x = 4, y = 5}}"]},
|
||||
{"maps", "get_i", ["1", "{[1] = {x = 3, y = 4}, [2] = {x = 4, y = 5}, [3] = {x = 5, y = 6}}"]},
|
||||
{"strings", "str_concat", ["\"test\"","\"me\""]},
|
||||
{"complex_types", "filter_some", ["[Some(11), Some(12), None]"]},
|
||||
{"complex_types", "init", ["ct_Ez6MyeTMm17YnTnDdHTSrzMEBKmy7Uz2sXu347bTDPgVH2ifJ"]},
|
||||
{"__call" "init", []},
|
||||
{"bitcoin_auth", "authorize", ["1", "#0102030405060708090a0b0c0d0e0f101718192021222324252627282930313233343536373839401a1b1c1d1e1f202122232425262728293031323334353637"]},
|
||||
{"bitcoin_auth", "to_sign", ["#0102030405060708090a0b0c0d0e0f1017181920212223242526272829303132", "2"]},
|
||||
{"stub", "foo", ["42"]},
|
||||
{"stub", "foo", ["-42"]}
|
||||
].
|
||||
|
||||
not_yet_compilable(fate) ->
|
||||
[];
|
||||
not_yet_compilable(aevm) ->
|
||||
[].
|
||||
@@ -23,8 +23,9 @@ simple_compile_test_() ->
|
||||
contract_source := _,
|
||||
type_info := _} when Backend == aevm ->
|
||||
?assertMatch(Code when is_binary(Code), ByteCode);
|
||||
Code when Backend == fate, is_tuple(Code) ->
|
||||
?assertMatch(#{}, aeb_fate_code:functions(Code));
|
||||
#{fate_code := Code} when Backend == fate ->
|
||||
Code1 = aeb_fate_code:deserialize(aeb_fate_code:serialize(Code)),
|
||||
?assertMatch({X, X}, {Code1, Code});
|
||||
ErrBin ->
|
||||
io:format("\n~s", [ErrBin]),
|
||||
error(ErrBin)
|
||||
@@ -113,17 +114,14 @@ compilable_contracts() ->
|
||||
"bitcoin_auth",
|
||||
"address_literals",
|
||||
"bytes_equality",
|
||||
"address_chain"
|
||||
"address_chain",
|
||||
"namespace_bug",
|
||||
"bytes_to_x",
|
||||
"aens",
|
||||
"tuple_match"
|
||||
].
|
||||
|
||||
not_yet_compilable(fate) ->
|
||||
["oracles", %% Oracle.register
|
||||
"events", %% events
|
||||
"basic_auth", %% auth_tx_hash instruction
|
||||
"bitcoin_auth", %% auth_tx_hash instruction
|
||||
"address_literals", %% oracle_query_id literals
|
||||
"address_chain" %% Oracle.check_query
|
||||
];
|
||||
not_yet_compilable(fate) -> [];
|
||||
not_yet_compilable(aevm) -> [].
|
||||
|
||||
%% Contracts that should produce type errors
|
||||
@@ -133,6 +131,9 @@ failing_contracts() ->
|
||||
[<<"Duplicate definitions of abort at\n"
|
||||
" - (builtin location)\n"
|
||||
" - line 14, column 3">>,
|
||||
<<"Duplicate definitions of require at\n"
|
||||
" - (builtin location)\n"
|
||||
" - line 15, column 3">>,
|
||||
<<"Duplicate definitions of double_def at\n"
|
||||
" - line 10, column 3\n"
|
||||
" - line 11, column 3">>,
|
||||
@@ -144,12 +145,12 @@ failing_contracts() ->
|
||||
" - line 8, column 3">>,
|
||||
<<"Duplicate definitions of put at\n"
|
||||
" - (builtin location)\n"
|
||||
" - line 15, column 3">>,
|
||||
" - line 16, column 3">>,
|
||||
<<"Duplicate definitions of state at\n"
|
||||
" - (builtin location)\n"
|
||||
" - line 16, column 3">>]}
|
||||
" - line 17, column 3">>]}
|
||||
, {"type_errors",
|
||||
[<<"Unbound variable zz at line 17, column 21">>,
|
||||
[<<"Unbound variable zz at line 17, column 23">>,
|
||||
<<"Cannot unify int\n"
|
||||
" and list(int)\n"
|
||||
"when checking the application at line 26, column 9 of\n"
|
||||
@@ -160,18 +161,18 @@ failing_contracts() ->
|
||||
<<"Cannot unify string\n"
|
||||
" and int\n"
|
||||
"when checking the assignment of the field\n"
|
||||
" x : map(string, string) (at line 9, column 46)\n"
|
||||
" x : map(string, string) (at line 9, column 48)\n"
|
||||
"to the old value __x and the new value\n"
|
||||
" __x {[\"foo\"] @ x = x + 1} : map(string, int)">>,
|
||||
<<"Cannot unify int\n"
|
||||
" and string\n"
|
||||
"when checking the type of the expression at line 34, column 45\n"
|
||||
"when checking the type of the expression at line 34, column 47\n"
|
||||
" 1 : int\n"
|
||||
"against the expected type\n"
|
||||
" string">>,
|
||||
<<"Cannot unify string\n"
|
||||
" and int\n"
|
||||
"when checking the type of the expression at line 34, column 50\n"
|
||||
"when checking the type of the expression at line 34, column 52\n"
|
||||
" \"bla\" : string\n"
|
||||
"against the expected type\n"
|
||||
" int">>,
|
||||
@@ -183,7 +184,7 @@ failing_contracts() ->
|
||||
" int">>,
|
||||
<<"Cannot unify string\n"
|
||||
" and int\n"
|
||||
"when checking the type of the expression at line 11, column 56\n"
|
||||
"when checking the type of the expression at line 11, column 58\n"
|
||||
" \"foo\" : string\n"
|
||||
"against the expected type\n"
|
||||
" int">>,
|
||||
@@ -193,35 +194,39 @@ failing_contracts() ->
|
||||
" - w : int (at line 38, column 13)\n"
|
||||
" - z : string (at line 39, column 10)">>,
|
||||
<<"Not a record type: string\n"
|
||||
"arising from the projection of the field y (at line 22, column 38)">>,
|
||||
"arising from the projection of the field y (at line 22, column 40)">>,
|
||||
<<"Not a record type: string\n"
|
||||
"arising from an assignment of the field y (at line 21, column 42)">>,
|
||||
"arising from an assignment of the field y (at line 21, column 44)">>,
|
||||
<<"Not a record type: string\n"
|
||||
"arising from an assignment of the field y (at line 20, column 38)">>,
|
||||
"arising from an assignment of the field y (at line 20, column 40)">>,
|
||||
<<"Not a record type: string\n"
|
||||
"arising from an assignment of the field y (at line 19, column 35)">>,
|
||||
<<"Ambiguous record type with field y (at line 13, column 25) could be one of\n"
|
||||
"arising from an assignment of the field y (at line 19, column 37)">>,
|
||||
<<"Ambiguous record type with field y (at line 13, column 27) could be one of\n"
|
||||
" - r (at line 4, column 10)\n"
|
||||
" - r' (at line 5, column 10)">>,
|
||||
<<"Repeated name x in pattern\n"
|
||||
" x :: x (at line 26, column 7)">>,
|
||||
<<"Repeated argument x to function repeated_arg (at line 44, column 12).">>,
|
||||
<<"Repeated argument y to function repeated_arg (at line 44, column 12).">>,
|
||||
<<"No record type with fields y, z (at line 14, column 22)">>,
|
||||
<<"The field z is missing when constructing an element of type r2 (at line 15, column 24)">>,
|
||||
<<"Record type r2 does not have field y (at line 15, column 22)">>]}
|
||||
<<"Repeated argument x to function repeated_arg (at line 44, column 14).">>,
|
||||
<<"Repeated argument y to function repeated_arg (at line 44, column 14).">>,
|
||||
<<"No record type with fields y, z (at line 14, column 24)">>,
|
||||
<<"The field z is missing when constructing an element of type r2 (at line 15, column 26)">>,
|
||||
<<"Record type r2 does not have field y (at line 15, column 24)">>,
|
||||
<<"Let binding at line 47, column 5 must be followed by an expression">>,
|
||||
<<"Let binding at line 50, column 5 must be followed by an expression">>,
|
||||
<<"Let binding at line 54, column 5 must be followed by an expression">>,
|
||||
<<"Let binding at line 58, column 5 must be followed by an expression">>]}
|
||||
, {"init_type_error",
|
||||
[<<"Cannot unify string\n"
|
||||
" and map(int, int)\n"
|
||||
"when checking that 'init' returns a value of type 'state' at line 7, column 3">>]}
|
||||
, {"missing_state_type",
|
||||
[<<"Cannot unify string\n"
|
||||
" and ()\n"
|
||||
" and unit\n"
|
||||
"when checking that 'init' returns a value of type 'state' at line 5, column 3">>]}
|
||||
, {"missing_fields_in_record_expression",
|
||||
[<<"The field x is missing when constructing an element of type r('a) (at line 7, column 40)">>,
|
||||
<<"The field y is missing when constructing an element of type r(int) (at line 8, column 40)">>,
|
||||
<<"The fields y, z are missing when constructing an element of type r('a) (at line 6, column 40)">>]}
|
||||
[<<"The field x is missing when constructing an element of type r('a) (at line 7, column 42)">>,
|
||||
<<"The field y is missing when constructing an element of type r(int) (at line 8, column 42)">>,
|
||||
<<"The fields y, z are missing when constructing an element of type r('a) (at line 6, column 42)">>]}
|
||||
, {"namespace_clash",
|
||||
[<<"The contract Call (at line 4, column 10) has the same name as a namespace at (builtin location)">>]}
|
||||
, {"bad_events",
|
||||
@@ -233,7 +238,7 @@ failing_contracts() ->
|
||||
, {"type_clash",
|
||||
[<<"Cannot unify int\n"
|
||||
" and string\n"
|
||||
"when checking the record projection at line 12, column 40\n"
|
||||
"when checking the record projection at line 12, column 42\n"
|
||||
" r.foo : (gas : int, value : int) => Remote.themap\n"
|
||||
"against the expected type\n"
|
||||
" (gas : int, value : int) => map(string, int)">>]}
|
||||
@@ -317,28 +322,36 @@ failing_contracts() ->
|
||||
"against the expected type\n"
|
||||
" bytes(32)">>]}
|
||||
, {"stateful",
|
||||
[<<"Cannot reference stateful function Chain.spend (at line 13, column 33)\nin the definition of non-stateful function fail1.">>,
|
||||
<<"Cannot reference stateful function local_spend (at line 14, column 33)\nin the definition of non-stateful function fail2.">>,
|
||||
[<<"Cannot reference stateful function Chain.spend (at line 13, column 35)\nin the definition of non-stateful function fail1.">>,
|
||||
<<"Cannot reference stateful function local_spend (at line 14, column 35)\nin the definition of non-stateful function fail2.">>,
|
||||
<<"Cannot reference stateful function Chain.spend (at line 16, column 15)\nin the definition of non-stateful function fail3.">>,
|
||||
<<"Cannot reference stateful function Chain.spend (at line 20, column 31)\nin the definition of non-stateful function fail4.">>,
|
||||
<<"Cannot reference stateful function Chain.spend (at line 35, column 53)\nin the definition of non-stateful function fail5.">>,
|
||||
<<"Cannot pass non-zero value argument 1000 (at line 48, column 55)\nin the definition of non-stateful function fail6.">>,
|
||||
<<"Cannot pass non-zero value argument 1000 (at line 49, column 54)\nin the definition of non-stateful function fail7.">>,
|
||||
<<"Cannot reference stateful function Chain.spend (at line 35, column 47)\nin the definition of non-stateful function fail5.">>,
|
||||
<<"Cannot pass non-zero value argument 1000 (at line 48, column 57)\nin the definition of non-stateful function fail6.">>,
|
||||
<<"Cannot pass non-zero value argument 1000 (at line 49, column 56)\nin the definition of non-stateful function fail7.">>,
|
||||
<<"Cannot pass non-zero value argument 1000 (at line 52, column 17)\nin the definition of non-stateful function fail8.">>]}
|
||||
, {"bad_init_state_access",
|
||||
[<<"The init function should return the initial state as its result and cannot write the state,\n"
|
||||
"but it calls\n"
|
||||
" - set_state (at line 11, column 5), which calls\n"
|
||||
" - roundabout (at line 8, column 36), which calls\n"
|
||||
" - put (at line 7, column 37)">>,
|
||||
" - roundabout (at line 8, column 38), which calls\n"
|
||||
" - put (at line 7, column 39)">>,
|
||||
<<"The init function should return the initial state as its result and cannot read the state,\n"
|
||||
"but it calls\n"
|
||||
" - new_state (at line 12, column 5), which calls\n"
|
||||
" - state (at line 5, column 27)">>,
|
||||
" - state (at line 5, column 29)">>,
|
||||
<<"The init function should return the initial state as its result and cannot read the state,\n"
|
||||
"but it calls\n"
|
||||
" - state (at line 13, column 13)">>]}
|
||||
, {"field_parse_error",
|
||||
[<<"line 6, column 1: In field_parse_error at 5:26:\n"
|
||||
"Cannot use nested fields or keys in record construction: p.x\n">>]}
|
||||
, {"modifier_checks",
|
||||
[<<"The function all_the_things (at line 11, column 3) cannot be both public and private.">>,
|
||||
<<"Namespaces cannot contain entrypoints (at line 3, column 3). Use 'function' instead.">>,
|
||||
<<"The contract Remote (at line 5, column 10) has no entrypoints. Since Sophia version 3.2, public\ncontract functions must be declared with the 'entrypoint' keyword instead of\n'function'.">>,
|
||||
<<"The entrypoint wha (at line 12, column 3) cannot be private. Use 'function' instead.">>,
|
||||
<<"Use 'entrypoint' for declaration of foo (at line 6, column 3):\n entrypoint foo : () => unit">>,
|
||||
<<"Use 'entrypoint' instead of 'function' for public function foo (at line 10, column 3):\n entrypoint foo() = ()">>,
|
||||
<<"Use 'entrypoint' instead of 'function' for public function foo (at line 6, column 3):\n entrypoint foo : () => unit">>]}
|
||||
].
|
||||
|
||||
@@ -0,0 +1,5 @@
|
||||
|
||||
contract Identity =
|
||||
function main (x:int) = x
|
||||
|
||||
function __call() = 12
|
||||
@@ -8,7 +8,7 @@ contract AbortTest =
|
||||
{ value = v }
|
||||
|
||||
// Aborting
|
||||
public function do_abort(v : int, s : string) : () =
|
||||
public function do_abort(v : int, s : string) : unit =
|
||||
put_value(v)
|
||||
revert_abort(s)
|
||||
|
||||
|
||||
@@ -1,9 +1,9 @@
|
||||
contract Interface =
|
||||
function do_abort : (int, string) => ()
|
||||
function do_abort : (int, string) => unit
|
||||
function get_value : () => int
|
||||
function put_value : (int) => ()
|
||||
function put_value : (int) => unit
|
||||
function get_values : () => list(int)
|
||||
function put_values : (int) => ()
|
||||
function put_values : (int) => unit
|
||||
|
||||
contract AbortTestInt =
|
||||
|
||||
|
||||
@@ -1,33 +1,33 @@
|
||||
contract Remote =
|
||||
function main : (int) => ()
|
||||
entrypoint main : (int) => unit
|
||||
|
||||
contract AddrChain =
|
||||
type o_type = oracle(string, map(string, int))
|
||||
type oq_type = oracle_query(string, map(string, int))
|
||||
|
||||
function is_o(a : address) =
|
||||
entrypoint is_o(a : address) =
|
||||
Address.is_oracle(a)
|
||||
|
||||
function is_c(a : address) =
|
||||
entrypoint is_c(a : address) =
|
||||
Address.is_contract(a)
|
||||
|
||||
// function get_o(a : address) : option(o_type) =
|
||||
// entrypoint get_o(a : address) : option(o_type) =
|
||||
// Address.get_oracle(a)
|
||||
|
||||
// function get_c(a : address) : option(Remote) =
|
||||
// entrypoint get_c(a : address) : option(Remote) =
|
||||
// Address.get_contract(a)
|
||||
|
||||
function check_o(o : o_type) =
|
||||
entrypoint check_o(o : o_type) =
|
||||
Oracle.check(o)
|
||||
|
||||
function check_oq(o : o_type, oq : oq_type) =
|
||||
entrypoint check_oq(o : o_type, oq : oq_type) =
|
||||
Oracle.check_query(o, oq)
|
||||
|
||||
// function h_to_i(h : hash) : int =
|
||||
// entrypoint h_to_i(h : hash) : int =
|
||||
// Hash.to_int(h)
|
||||
|
||||
// function a_to_i(a : address) : int =
|
||||
// entrypoint a_to_i(a : address) : int =
|
||||
// Address.to_int(a) mod 10 ^ 16
|
||||
|
||||
function c_creator() : address =
|
||||
entrypoint c_creator() : address =
|
||||
Contract.creator
|
||||
|
||||
@@ -1,14 +1,14 @@
|
||||
|
||||
contract Remote =
|
||||
function foo : () => ()
|
||||
entrypoint foo : () => unit
|
||||
|
||||
contract AddressLiterals =
|
||||
function addr() : address =
|
||||
entrypoint addr() : address =
|
||||
ak_2gx9MEFxKvY9vMG5YnqnXWv1hCsX7rgnfvBLJS4aQurustR1rt
|
||||
function oracle() : oracle(int, bool) =
|
||||
entrypoint oracle() : oracle(int, bool) =
|
||||
ok_2YNyxd6TRJPNrTcEDCe9ra59SVUdp9FR9qWC5msKZWYD9bP9z5
|
||||
function query() : oracle_query(int, bool) =
|
||||
entrypoint query() : oracle_query(int, bool) =
|
||||
oq_2oRvyowJuJnEkxy58Ckkw77XfWJrmRgmGaLzhdqb67SKEL1gPY
|
||||
function contr() : Remote =
|
||||
entrypoint contr() : Remote =
|
||||
ct_Ez6MyeTMm17YnTnDdHTSrzMEBKmy7Uz2sXu347bTDPgVH2ifJ
|
||||
|
||||
|
||||
+34
-33
@@ -3,53 +3,54 @@ contract AENSTest =
|
||||
|
||||
// Name resolution
|
||||
|
||||
function resolve_word(name : string, key : string) : option(address) =
|
||||
stateful entrypoint resolve_word(name : string, key : string) : option(address) =
|
||||
AENS.resolve(name, key)
|
||||
|
||||
function resolve_string(name : string, key : string) : option(string) =
|
||||
stateful entrypoint resolve_string(name : string, key : string) : option(string) =
|
||||
AENS.resolve(name, key)
|
||||
|
||||
// Transactions
|
||||
|
||||
function preclaim(addr : address, // Claim on behalf of this account (can be Contract.address)
|
||||
chash : hash) : () = // Commitment hash
|
||||
stateful entrypoint preclaim(addr : address, // Claim on behalf of this account (can be Contract.address)
|
||||
chash : hash) : unit = // Commitment hash
|
||||
AENS.preclaim(addr, chash)
|
||||
|
||||
function signedPreclaim(addr : address, // Claim on behalf of this account (can be Contract.address)
|
||||
chash : hash, // Commitment hash
|
||||
sign : signature) : () = // Signed by addr (if not Contract.address)
|
||||
stateful entrypoint signedPreclaim(addr : address, // Claim on behalf of this account (can be Contract.address)
|
||||
chash : hash, // Commitment hash
|
||||
sign : signature) : unit = // Signed by addr (if not Contract.address)
|
||||
AENS.preclaim(addr, chash, signature = sign)
|
||||
|
||||
function claim(addr : address,
|
||||
name : string,
|
||||
salt : int) : () =
|
||||
AENS.claim(addr, name, salt)
|
||||
stateful entrypoint claim(addr : address,
|
||||
name : string,
|
||||
salt : int,
|
||||
name_fee : int) : unit =
|
||||
AENS.claim(addr, name, salt, name_fee)
|
||||
|
||||
function signedClaim(addr : address,
|
||||
name : string,
|
||||
salt : int,
|
||||
sign : signature) : () =
|
||||
AENS.claim(addr, name, salt, signature = sign)
|
||||
stateful entrypoint signedClaim(addr : address,
|
||||
name : string,
|
||||
salt : int,
|
||||
name_fee : int,
|
||||
sign : signature) : unit =
|
||||
AENS.claim(addr, name, salt, name_fee, signature = sign)
|
||||
|
||||
// TODO: update() -- how to handle pointers?
|
||||
|
||||
function transfer(owner : address,
|
||||
new_owner : address,
|
||||
name_hash : hash) : () =
|
||||
AENS.transfer(owner, new_owner, name_hash)
|
||||
stateful entrypoint transfer(owner : address,
|
||||
new_owner : address,
|
||||
name : string) : unit =
|
||||
AENS.transfer(owner, new_owner, name)
|
||||
|
||||
function signedTransfer(owner : address,
|
||||
new_owner : address,
|
||||
name_hash : hash,
|
||||
sign : signature) : () =
|
||||
AENS.transfer(owner, new_owner, name_hash, signature = sign)
|
||||
stateful entrypoint signedTransfer(owner : address,
|
||||
new_owner : address,
|
||||
name : string,
|
||||
sign : signature) : unit =
|
||||
AENS.transfer(owner, new_owner, name, signature = sign)
|
||||
|
||||
function revoke(owner : address,
|
||||
name_hash : hash) : () =
|
||||
AENS.revoke(owner, name_hash)
|
||||
|
||||
function signedRevoke(owner : address,
|
||||
name_hash : hash,
|
||||
sign : signature) : () =
|
||||
AENS.revoke(owner, name_hash, signature = sign)
|
||||
stateful entrypoint revoke(owner : address,
|
||||
name : string) : unit =
|
||||
AENS.revoke(owner, name)
|
||||
|
||||
stateful entrypoint signedRevoke(owner : address,
|
||||
name : string,
|
||||
sign : signature) : unit =
|
||||
AENS.revoke(owner, name, signature = sign)
|
||||
|
||||
@@ -104,10 +104,10 @@ contract AEProof =
|
||||
proofsByOwner : map(address, array(uint)) }
|
||||
|
||||
function notarize(document:string, comment:string, ipfsHash:hash) =
|
||||
let _ = require(aetoken.balanceOf(caller()) > 0)
|
||||
let _ = require(aetoken.balanceOf(caller()) > 0, "false")
|
||||
let proofHash: uint = calculateHash(document)
|
||||
let proof : proof = Map.get_(proofHash, state().proofs)
|
||||
let _ = require(proof.owner == #0)
|
||||
let _ = require(proof.owner == #0, "false")
|
||||
let proof' : proof = proof { owner = caller()
|
||||
, timestamp = block().timestamp
|
||||
, proofBlock = block().height
|
||||
@@ -124,12 +124,12 @@ contract AEProof =
|
||||
function getProof(document) : proof =
|
||||
let calcHash = calculateHash(document)
|
||||
let proof = Map.get_(calcHash, state().proofs)
|
||||
let _ = require(proof.owner != #0)
|
||||
let _ = require(proof.owner != #0, "false")
|
||||
proof
|
||||
|
||||
function getProofByHash(hash: uint) : proof =
|
||||
let proof = Map.get_(hash, state().proofs)
|
||||
let _ = require(proof.owner != #0)
|
||||
let _ = require(proof.owner != #0, "false")
|
||||
proof
|
||||
|
||||
|
||||
@@ -141,5 +141,3 @@ contract AEProof =
|
||||
function getProofsByOwner(owner: address): array(uint) =
|
||||
Map.get(owner, state())
|
||||
|
||||
function require(x : bool) : unit = if(x) () else abort("false")
|
||||
|
||||
|
||||
@@ -24,7 +24,7 @@ contract AllSyntax =
|
||||
if(valWithType(Map.empty) == None)
|
||||
print(42 mod 10 * 5 / 3)
|
||||
|
||||
function funWithType(x : int, y) : (int, list(int)) = (x, 0 :: [y] ++ [])
|
||||
function funWithType(x : int, y) : int * list(int) = (x, 0 :: [y] ++ [])
|
||||
function funNoType() =
|
||||
let foo = (x, y : bool) =>
|
||||
if (! (y && x =< 0x0b || true)) [x]
|
||||
|
||||
@@ -1,33 +1,33 @@
|
||||
|
||||
contract Remote =
|
||||
function foo : () => ()
|
||||
entrypoint foo : () => unit
|
||||
|
||||
contract AddressLiterals =
|
||||
function addr1() : bytes(32) =
|
||||
entrypoint addr1() : bytes(32) =
|
||||
ak_2gx9MEFxKvY9vMG5YnqnXWv1hCsX7rgnfvBLJS4aQurustR1rt
|
||||
function addr2() : Remote =
|
||||
entrypoint addr2() : Remote =
|
||||
ak_2gx9MEFxKvY9vMG5YnqnXWv1hCsX7rgnfvBLJS4aQurustR1rt
|
||||
function addr3() : oracle(int, bool) =
|
||||
entrypoint addr3() : oracle(int, bool) =
|
||||
ak_2gx9MEFxKvY9vMG5YnqnXWv1hCsX7rgnfvBLJS4aQurustR1rt
|
||||
|
||||
function oracle1() : oracle_query(int, bool) =
|
||||
entrypoint oracle1() : oracle_query(int, bool) =
|
||||
ok_2YNyxd6TRJPNrTcEDCe9ra59SVUdp9FR9qWC5msKZWYD9bP9z5
|
||||
function oracle2() : bytes(32) =
|
||||
entrypoint oracle2() : bytes(32) =
|
||||
ok_2YNyxd6TRJPNrTcEDCe9ra59SVUdp9FR9qWC5msKZWYD9bP9z5
|
||||
function oracle3() : Remote =
|
||||
entrypoint oracle3() : Remote =
|
||||
ok_2YNyxd6TRJPNrTcEDCe9ra59SVUdp9FR9qWC5msKZWYD9bP9z5
|
||||
|
||||
function query1() : oracle(int, bool) =
|
||||
entrypoint query1() : oracle(int, bool) =
|
||||
oq_2oRvyowJuJnEkxy58Ckkw77XfWJrmRgmGaLzhdqb67SKEL1gPY
|
||||
function query2() : bytes(32) =
|
||||
entrypoint query2() : bytes(32) =
|
||||
oq_2oRvyowJuJnEkxy58Ckkw77XfWJrmRgmGaLzhdqb67SKEL1gPY
|
||||
function query3() : Remote =
|
||||
entrypoint query3() : Remote =
|
||||
oq_2oRvyowJuJnEkxy58Ckkw77XfWJrmRgmGaLzhdqb67SKEL1gPY
|
||||
|
||||
function contr1() : address =
|
||||
entrypoint contr1() : address =
|
||||
ct_Ez6MyeTMm17YnTnDdHTSrzMEBKmy7Uz2sXu347bTDPgVH2ifJ
|
||||
function contr2() : oracle(int, bool) =
|
||||
entrypoint contr2() : oracle(int, bool) =
|
||||
ct_Ez6MyeTMm17YnTnDdHTSrzMEBKmy7Uz2sXu347bTDPgVH2ifJ
|
||||
function contr3() : bytes(32) =
|
||||
entrypoint contr3() : bytes(32) =
|
||||
ct_Ez6MyeTMm17YnTnDdHTSrzMEBKmy7Uz2sXu347bTDPgVH2ifJ
|
||||
|
||||
|
||||
@@ -9,15 +9,15 @@ contract Events =
|
||||
| BadEvent1(indexed string)
|
||||
| BadEvent2(indexed alias_string)
|
||||
|
||||
function f1(x : int, y : string) =
|
||||
entrypoint f1(x : int, y : string) =
|
||||
Chain.event(Event1(x, x+1, y))
|
||||
|
||||
function f2(s : string) =
|
||||
entrypoint f2(s : string) =
|
||||
Chain.event(Event2(s, Call.caller))
|
||||
|
||||
function f3(x : int) =
|
||||
entrypoint f3(x : int) =
|
||||
Chain.event(Event1(x, x + 2, Int.to_str(x + 7)))
|
||||
|
||||
function i2s(i : int) = Int.to_str(i)
|
||||
function a2s(a : address) = Address.to_str(a)
|
||||
entrypoint i2s(i : int) = Int.to_str(i)
|
||||
entrypoint a2s(a : address) = Address.to_str(a)
|
||||
|
||||
|
||||
@@ -9,15 +9,15 @@ contract Events =
|
||||
| BadEvent1(string, string)
|
||||
| BadEvent2(indexed int, indexed int, indexed int, indexed address)
|
||||
|
||||
function f1(x : int, y : string) =
|
||||
entrypoint f1(x : int, y : string) =
|
||||
Chain.event(Event1(x, x+1, y))
|
||||
|
||||
function f2(s : string) =
|
||||
entrypoint f2(s : string) =
|
||||
Chain.event(Event2(s, Call.caller))
|
||||
|
||||
function f3(x : int) =
|
||||
entrypoint f3(x : int) =
|
||||
Chain.event(Event1(x, x + 2, Int.to_str(x + 7)))
|
||||
|
||||
function i2s(i : int) = Int.to_str(i)
|
||||
function a2s(a : address) = Address.to_str(a)
|
||||
entrypoint i2s(i : int) = Int.to_str(i)
|
||||
entrypoint a2s(a : address) = Address.to_str(a)
|
||||
|
||||
|
||||
@@ -3,4 +3,4 @@ contract Bad =
|
||||
namespace Foo =
|
||||
function foo() = 42
|
||||
|
||||
function foo() = 43
|
||||
entrypoint foo() = 43
|
||||
|
||||
@@ -2,12 +2,12 @@ contract BadInit =
|
||||
|
||||
type state = int
|
||||
|
||||
function new_state(n) = state + n
|
||||
entrypoint new_state(n) = state + n
|
||||
|
||||
stateful function roundabout(n) = put(n)
|
||||
stateful function set_state(n) = roundabout(n)
|
||||
stateful entrypoint roundabout(n) = put(n)
|
||||
stateful entrypoint set_state(n) = roundabout(n)
|
||||
|
||||
stateful function init() =
|
||||
stateful entrypoint init() =
|
||||
set_state(4)
|
||||
new_state(0)
|
||||
state + state
|
||||
|
||||
@@ -2,9 +2,9 @@
|
||||
contract BasicAuth =
|
||||
record state = { nonce : int, owner : address }
|
||||
|
||||
function init() = { nonce = 1, owner = Call.caller }
|
||||
entrypoint init() = { nonce = 1, owner = Call.caller }
|
||||
|
||||
stateful function authorize(n : int, s : signature) : bool =
|
||||
stateful entrypoint authorize(n : int, s : signature) : bool =
|
||||
require(n >= state.nonce, "Nonce too low")
|
||||
require(n =< state.nonce, "Nonce too high")
|
||||
put(state{ nonce = n + 1 })
|
||||
@@ -12,8 +12,6 @@ contract BasicAuth =
|
||||
None => abort("Not in Auth context")
|
||||
Some(tx_hash) => Crypto.ecverify(to_sign(tx_hash, n), state.owner, s)
|
||||
|
||||
function to_sign(h : hash, n : int) =
|
||||
entrypoint to_sign(h : hash, n : int) =
|
||||
Crypto.blake2b((h, n))
|
||||
|
||||
private function require(b : bool, err : string) =
|
||||
if(!b) abort(err)
|
||||
|
||||
@@ -1,9 +1,9 @@
|
||||
contract BitcoinAuth =
|
||||
record state = { nonce : int, owner : bytes(64) }
|
||||
|
||||
function init(owner' : bytes(64)) = { nonce = 1, owner = owner' }
|
||||
entrypoint init(owner' : bytes(64)) = { nonce = 1, owner = owner' }
|
||||
|
||||
stateful function authorize(n : int, s : signature) : bool =
|
||||
stateful entrypoint authorize(n : int, s : signature) : bool =
|
||||
require(n >= state.nonce, "Nonce too low")
|
||||
require(n =< state.nonce, "Nonce too high")
|
||||
put(state{ nonce = n + 1 })
|
||||
@@ -11,8 +11,6 @@ contract BitcoinAuth =
|
||||
None => abort("Not in Auth context")
|
||||
Some(tx_hash) => Crypto.ecverify_secp256k1(to_sign(tx_hash, n), state.owner, s)
|
||||
|
||||
function to_sign(h : hash, n : int) : hash =
|
||||
entrypoint to_sign(h : hash, n : int) : hash =
|
||||
Crypto.blake2b((h, n))
|
||||
|
||||
private function require(b : bool, err : string) =
|
||||
if(!b) abort(err)
|
||||
|
||||
@@ -5,8 +5,8 @@ contract BuiltinBug =
|
||||
|
||||
record state = {proofs : map(address, list(string))}
|
||||
|
||||
public function init() = {proofs = {}}
|
||||
entrypoint init() = {proofs = {}}
|
||||
|
||||
public stateful function createProof(hash : string) =
|
||||
stateful entrypoint createProof(hash : string) =
|
||||
put( state{ proofs[Call.caller] = hash :: state.proofs[Call.caller] } )
|
||||
|
||||
|
||||
@@ -1,12 +1,8 @@
|
||||
contract TestContract =
|
||||
record state = {
|
||||
_allowed : map(address, map(address, int))}
|
||||
record state = {_allowed : map(address, map(address, int))}
|
||||
|
||||
public stateful function init() = {
|
||||
_allowed = {}}
|
||||
|
||||
public stateful function approve(spender: address, value: int) : bool =
|
||||
entrypoint init() = {_allowed = {}}
|
||||
|
||||
stateful entrypoint approve(spender: address, value: int) : bool =
|
||||
put(state{_allowed[Call.caller][spender] = value})
|
||||
|
||||
true
|
||||
|
||||
@@ -1,18 +1,18 @@
|
||||
|
||||
contract BytesEquality =
|
||||
|
||||
function eq16(a : bytes(16), b) = a == b
|
||||
function ne16(a : bytes(16), b) = a != b
|
||||
entrypoint eq16(a : bytes(16), b) = a == b
|
||||
entrypoint ne16(a : bytes(16), b) = a != b
|
||||
|
||||
function eq32(a : bytes(32), b) = a == b
|
||||
function ne32(a : bytes(32), b) = a != b
|
||||
entrypoint eq32(a : bytes(32), b) = a == b
|
||||
entrypoint ne32(a : bytes(32), b) = a != b
|
||||
|
||||
function eq47(a : bytes(47), b) = a == b
|
||||
function ne47(a : bytes(47), b) = a != b
|
||||
entrypoint eq47(a : bytes(47), b) = a == b
|
||||
entrypoint ne47(a : bytes(47), b) = a != b
|
||||
|
||||
function eq64(a : bytes(64), b) = a == b
|
||||
function ne64(a : bytes(64), b) = a != b
|
||||
entrypoint eq64(a : bytes(64), b) = a == b
|
||||
entrypoint ne64(a : bytes(64), b) = a != b
|
||||
|
||||
function eq65(a : bytes(65), b) = a == b
|
||||
function ne65(a : bytes(65), b) = a != b
|
||||
entrypoint eq65(a : bytes(65), b) = a == b
|
||||
entrypoint ne65(a : bytes(65), b) = a != b
|
||||
|
||||
|
||||
@@ -0,0 +1,8 @@
|
||||
|
||||
contract BytesToX =
|
||||
|
||||
entrypoint to_int(b : bytes(42)) : int = Bytes.to_int(b)
|
||||
entrypoint to_str(b : bytes(12)) : string =
|
||||
String.concat(Bytes.to_str(b), Bytes.to_str(#ffff))
|
||||
entrypoint to_str_big(b : bytes(65)) : string =
|
||||
Bytes.to_str(b)
|
||||
@@ -1,78 +1,78 @@
|
||||
|
||||
contract Remote =
|
||||
function up_to : (int) => list(int)
|
||||
function sum : (list(int)) => int
|
||||
function some_string : () => string
|
||||
function pair : (int, string) => (int, string)
|
||||
function squares : (int) => list((int, int))
|
||||
function filter_some : (list(option(int))) => list(int)
|
||||
function all_some : (list(option(int))) => option(list(int))
|
||||
entrypoint up_to : (int) => list(int)
|
||||
entrypoint sum : (list(int)) => int
|
||||
entrypoint some_string : () => string
|
||||
entrypoint pair : (int, string) => int * string
|
||||
entrypoint squares : (int) => list(int * int)
|
||||
entrypoint filter_some : (list(option(int))) => list(int)
|
||||
entrypoint all_some : (list(option(int))) => option(list(int))
|
||||
|
||||
contract ComplexTypes =
|
||||
|
||||
record state = { worker : Remote }
|
||||
|
||||
function init(worker) = {worker = worker}
|
||||
entrypoint init(worker) = {worker = worker}
|
||||
|
||||
function sum_acc(xs, n) =
|
||||
entrypoint sum_acc(xs, n) =
|
||||
switch(xs)
|
||||
[] => n
|
||||
x :: xs => sum_acc(xs, x + n)
|
||||
|
||||
// Sum a list of integers
|
||||
function sum(xs : list(int)) =
|
||||
entrypoint sum(xs : list(int)) =
|
||||
sum_acc(xs, 0)
|
||||
|
||||
function up_to_acc(n, xs) =
|
||||
entrypoint up_to_acc(n, xs) =
|
||||
switch(n)
|
||||
0 => xs
|
||||
_ => up_to_acc(n - 1, n :: xs)
|
||||
|
||||
function up_to(n) = up_to_acc(n, [])
|
||||
entrypoint up_to(n) = up_to_acc(n, [])
|
||||
|
||||
record answer('a) = {label : string, result : 'a}
|
||||
|
||||
function remote_triangle(worker, n) : answer(int) =
|
||||
entrypoint remote_triangle(worker, n) : answer(int) =
|
||||
let xs = worker.up_to(gas = 100000, n)
|
||||
let t = worker.sum(xs)
|
||||
{ label = "answer:", result = t }
|
||||
|
||||
function remote_list(n) : list(int) =
|
||||
entrypoint remote_list(n) : list(int) =
|
||||
state.worker.up_to(n)
|
||||
|
||||
function some_string() = "string"
|
||||
entrypoint some_string() = "string"
|
||||
|
||||
function remote_string() : string =
|
||||
entrypoint remote_string() : string =
|
||||
state.worker.some_string()
|
||||
|
||||
function pair(x : int, y : string) = (x, y)
|
||||
entrypoint pair(x : int, y : string) = (x, y)
|
||||
|
||||
function remote_pair(n : int, s : string) : (int, string) =
|
||||
entrypoint remote_pair(n : int, s : string) : int * string =
|
||||
state.worker.pair(gas = 10000, n, s)
|
||||
|
||||
function map(f, xs) =
|
||||
entrypoint map(f, xs) =
|
||||
switch(xs)
|
||||
[] => []
|
||||
x :: xs => f(x) :: map(f, xs)
|
||||
|
||||
function squares(n) =
|
||||
entrypoint squares(n) =
|
||||
map((i) => (i, i * i), up_to(n))
|
||||
|
||||
function remote_squares(n) : list((int, int)) =
|
||||
entrypoint remote_squares(n) : list(int * int) =
|
||||
state.worker.squares(n)
|
||||
|
||||
// option types
|
||||
|
||||
function filter_some(xs : list(option(int))) : list(int) =
|
||||
entrypoint filter_some(xs : list(option(int))) : list(int) =
|
||||
switch(xs)
|
||||
[] => []
|
||||
None :: ys => filter_some(ys)
|
||||
Some(x) :: ys => x :: filter_some(ys)
|
||||
|
||||
function remote_filter_some(xs : list(option(int))) : list(int) =
|
||||
entrypoint remote_filter_some(xs : list(option(int))) : list(int) =
|
||||
state.worker.filter_some(xs)
|
||||
|
||||
function all_some(xs : list(option(int))) : option(list(int)) =
|
||||
entrypoint all_some(xs : list(option(int))) : option(list(int)) =
|
||||
switch(xs)
|
||||
[] => Some([])
|
||||
None :: ys => None
|
||||
@@ -81,6 +81,6 @@ contract ComplexTypes =
|
||||
Some(xs) => Some(x :: xs)
|
||||
None => None
|
||||
|
||||
function remote_all_some(xs : list(option(int))) : option(list(int)) =
|
||||
entrypoint remote_all_some(xs : list(option(int))) : option(list(int)) =
|
||||
state.worker.all_some(gas = 10000, xs)
|
||||
|
||||
|
||||
@@ -3,7 +3,7 @@ contract Counter =
|
||||
|
||||
record state = { value : int }
|
||||
|
||||
function init(val) = { value = val }
|
||||
function get() = state.value
|
||||
stateful function tick() = put(state{ value = state.value + 1 })
|
||||
entrypoint init(val) = { value = val }
|
||||
entrypoint get() = state.value
|
||||
stateful entrypoint tick() = put(state{ value = state.value + 1 })
|
||||
|
||||
|
||||
@@ -13,9 +13,9 @@ namespace List =
|
||||
|
||||
contract Deadcode =
|
||||
|
||||
function inc1(xs : list(int)) : list(int) =
|
||||
entrypoint inc1(xs : list(int)) : list(int) =
|
||||
List.map1((x) => x + 1, xs)
|
||||
|
||||
function inc2(xs : list(int)) : list(int) =
|
||||
entrypoint inc2(xs : list(int)) : list(int) =
|
||||
List.map1((x) => x + 1, xs)
|
||||
|
||||
|
||||
@@ -10,16 +10,13 @@ contract DutchAuction =
|
||||
sold : bool }
|
||||
|
||||
// Add to work around current lack of predefined functions
|
||||
private stateful function spend(to, amount) =
|
||||
stateful function spend(to, amount) =
|
||||
let total = Contract.balance
|
||||
Chain.spend(to, amount)
|
||||
total - amount
|
||||
|
||||
private function require(b : bool, err : string) =
|
||||
if(!b) abort(err)
|
||||
|
||||
// TTL set by user on posting contract, typically (start - end ) div dec
|
||||
public function init(beneficiary, start, decrease) : state =
|
||||
entrypoint init(beneficiary, start, decrease) : state =
|
||||
require(start > 0 && decrease > 0, "bad args")
|
||||
{ start_amount = start,
|
||||
start_height = Chain.block_height,
|
||||
@@ -30,7 +27,7 @@ contract DutchAuction =
|
||||
// -- API
|
||||
|
||||
// We are the buyer... interesting case to buy for someone else and keep 10%
|
||||
public stateful function bid() =
|
||||
stateful entrypoint bid() =
|
||||
require( !(state.sold), "sold")
|
||||
let cost =
|
||||
state.start_amount - (Chain.block_height - state.start_height) * state.dec
|
||||
|
||||
@@ -1,69 +1,69 @@
|
||||
|
||||
// Testing primitives for accessing the block chain environment
|
||||
contract Interface =
|
||||
function contract_address : () => address
|
||||
function call_origin : () => address
|
||||
function call_caller : () => address
|
||||
function call_value : () => int
|
||||
entrypoint contract_address : () => address
|
||||
entrypoint call_origin : () => address
|
||||
entrypoint call_caller : () => address
|
||||
entrypoint call_value : () => int
|
||||
|
||||
contract Environment =
|
||||
|
||||
record state = {remote : Interface}
|
||||
|
||||
function init(remote) = {remote = remote}
|
||||
entrypoint init(remote) = {remote = remote}
|
||||
|
||||
stateful function set_remote(remote) = put({remote = remote})
|
||||
stateful entrypoint set_remote(remote) = put({remote = remote})
|
||||
|
||||
// -- Information about the this contract ---
|
||||
|
||||
// Address
|
||||
function contract_address() : address = Contract.address
|
||||
function nested_address(who) : address =
|
||||
entrypoint contract_address() : address = Contract.address
|
||||
entrypoint nested_address(who) : address =
|
||||
who.contract_address(gas = 1000)
|
||||
|
||||
// Balance
|
||||
function contract_balance() : int = Contract.balance
|
||||
entrypoint contract_balance() : int = Contract.balance
|
||||
|
||||
// -- Information about the current call ---
|
||||
|
||||
// Origin
|
||||
function call_origin() : address = Call.origin
|
||||
function nested_origin() : address =
|
||||
entrypoint call_origin() : address = Call.origin
|
||||
entrypoint nested_origin() : address =
|
||||
state.remote.call_origin()
|
||||
|
||||
// Caller
|
||||
function call_caller() : address = Call.caller
|
||||
function nested_caller() : address =
|
||||
entrypoint call_caller() : address = Call.caller
|
||||
entrypoint nested_caller() : address =
|
||||
state.remote.call_caller()
|
||||
|
||||
// Value
|
||||
function call_value() : int = Call.value
|
||||
stateful function nested_value(value : int) : int =
|
||||
entrypoint call_value() : int = Call.value
|
||||
stateful entrypoint nested_value(value : int) : int =
|
||||
state.remote.call_value(value = value / 2)
|
||||
|
||||
// Gas price
|
||||
function call_gas_price() : int = Call.gas_price
|
||||
entrypoint call_gas_price() : int = Call.gas_price
|
||||
|
||||
// -- Information about the chain ---
|
||||
|
||||
// Account balances
|
||||
function get_balance(acct : address) : int = Chain.balance(acct)
|
||||
entrypoint get_balance(acct : address) : int = Chain.balance(acct)
|
||||
|
||||
// Block hash
|
||||
function block_hash(height : int) : int = Chain.block_hash(height)
|
||||
entrypoint block_hash(height : int) : option(hash) = Chain.block_hash(height)
|
||||
|
||||
// Coinbase
|
||||
function coinbase() : address = Chain.coinbase
|
||||
entrypoint coinbase() : address = Chain.coinbase
|
||||
|
||||
// Block timestamp
|
||||
function timestamp() : int = Chain.timestamp
|
||||
entrypoint timestamp() : int = Chain.timestamp
|
||||
|
||||
// Block height
|
||||
function block_height() : int = Chain.block_height
|
||||
entrypoint block_height() : int = Chain.block_height
|
||||
|
||||
// Difficulty
|
||||
function difficulty() : int = Chain.difficulty
|
||||
entrypoint difficulty() : int = Chain.difficulty
|
||||
|
||||
// Gas limit
|
||||
function gas_limit() : int = Chain.gas_limit
|
||||
entrypoint gas_limit() : int = Chain.gas_limit
|
||||
|
||||
|
||||
@@ -77,9 +77,6 @@ contract ERC20Token =
|
||||
put( state{approval_log = e :: state.approval_log })
|
||||
e
|
||||
|
||||
private function require(b : bool, err : string) =
|
||||
if(!b) abort(err)
|
||||
|
||||
private function sub(_a : int, _b : int) : int =
|
||||
require(_b =< _a, "Error")
|
||||
_a - _b
|
||||
|
||||
+34
-16
@@ -1,22 +1,40 @@
|
||||
contract Remote =
|
||||
entrypoint dummy : () => unit
|
||||
|
||||
contract Events =
|
||||
type alias_int = int
|
||||
type alias_address = address
|
||||
type alias_string = string
|
||||
|
||||
datatype event =
|
||||
Event1(indexed alias_int, indexed int, string)
|
||||
| Event2(alias_string, indexed alias_address)
|
||||
// | BadEvent1(indexed string, string)
|
||||
// | BadEvent2(indexed int, int)
|
||||
// Valid index types
|
||||
type ix1 = int
|
||||
type ix2 = bool
|
||||
type ix3 = bits
|
||||
type ix4 = bytes(12)
|
||||
type ix5 = hash // bytes(32)
|
||||
type ix6 = address
|
||||
type ix7 = Remote
|
||||
type ix8 = oracle(int, int)
|
||||
type ix9 = oracle_query(int, int)
|
||||
|
||||
function f1(x : int, y : string) =
|
||||
Chain.event(Event1(x, x+1, y))
|
||||
// Valid payload types
|
||||
type data1 = string
|
||||
type data2 = signature // bytes(64)
|
||||
type data3 = bytes(65)
|
||||
|
||||
function f2(s : string) =
|
||||
Chain.event(Event2(s, Call.caller))
|
||||
datatype event
|
||||
= Nodata0
|
||||
| Nodata1(ix1)
|
||||
| Nodata2(ix2, ix3)
|
||||
| Nodata3(ix4, ix5, ix6)
|
||||
| Data0(data1)
|
||||
| Data1(data2, ix7)
|
||||
| Data2(ix8, data3, ix9)
|
||||
| Data3(ix1, ix2, ix5, data1)
|
||||
|
||||
function f3(x : int) =
|
||||
Chain.event(Event1(x, x + 2, Int.to_str(x + 7)))
|
||||
entrypoint nodata0() = Chain.event(Nodata0)
|
||||
entrypoint nodata1(ix1) = Chain.event(Nodata1(ix1))
|
||||
entrypoint nodata2(ix2, ix3) = Chain.event(Nodata2(ix2, ix3))
|
||||
entrypoint nodata3(ix4, ix5, ix6) = Chain.event(Nodata3(ix4, ix5, ix6))
|
||||
entrypoint data0(data1) = Chain.event(Data0(data1))
|
||||
entrypoint data1(data2, ix7) = Chain.event(Data1(data2, ix7))
|
||||
entrypoint data2(ix8, data3, ix9) = Chain.event(Data2(ix8, data3, ix9))
|
||||
entrypoint data3(ix1, ix2, ix5, data1) = Chain.event(Data3(ix1, ix2, ix5, data1))
|
||||
|
||||
function i2s(i : int) = Int.to_str(i)
|
||||
function a2s(a : address) = Address.to_str(a)
|
||||
|
||||
@@ -1,17 +1,17 @@
|
||||
// An implementation of the factorial function where each recursive
|
||||
// call is to another contract. Not the cheapest way to compute factorial.
|
||||
contract FactorialServer =
|
||||
function fac : (int) => int
|
||||
entrypoint fac : (int) => int
|
||||
|
||||
contract Factorial =
|
||||
|
||||
record state = {worker : FactorialServer}
|
||||
|
||||
function init(worker) = {worker = worker}
|
||||
entrypoint init(worker) = {worker = worker}
|
||||
|
||||
stateful function set_worker(worker) = put(state{worker = worker})
|
||||
stateful entrypoint set_worker(worker) = put(state{worker = worker})
|
||||
|
||||
function fac(x : int) : int =
|
||||
entrypoint fac(x : int) : int =
|
||||
if(x == 0) 1
|
||||
else x * state.worker.fac(x - 1)
|
||||
|
||||
|
||||
@@ -0,0 +1,47 @@
|
||||
|
||||
contract FunctionArguments =
|
||||
|
||||
entrypoint sum(n : int, m: int) =
|
||||
n + m
|
||||
|
||||
entrypoint append(xs : list(string)) =
|
||||
switch(xs)
|
||||
[] => ""
|
||||
y :: ys => String.concat(y, append(ys))
|
||||
|
||||
entrypoint menot(b) =
|
||||
!b
|
||||
|
||||
entrypoint bitsum(b : bits) =
|
||||
Bits.sum(b)
|
||||
|
||||
record answer('a) = {label : string, result : 'a}
|
||||
|
||||
entrypoint read(a : answer(int)) =
|
||||
a.result
|
||||
|
||||
entrypoint sjutton(b : bytes(17)) =
|
||||
b
|
||||
|
||||
entrypoint sextiosju(b : bytes(67)) =
|
||||
b
|
||||
|
||||
entrypoint trettiotva(b : bytes(32)) =
|
||||
b
|
||||
|
||||
entrypoint find_oracle(o : oracle(int, bool)) =
|
||||
true
|
||||
|
||||
entrypoint find_query(q : oracle_query(int, bool)) =
|
||||
true
|
||||
|
||||
datatype colour() = Green | Yellow | Red | Pantone(int)
|
||||
|
||||
entrypoint traffic_light(c : colour) =
|
||||
Red
|
||||
|
||||
entrypoint tuples(t : unit) =
|
||||
t
|
||||
|
||||
entrypoint due(t : Chain.ttl) =
|
||||
true
|
||||
@@ -1,15 +1,15 @@
|
||||
contract Functions =
|
||||
private function curry(f : ('a, 'b) => 'c) =
|
||||
function curry(f : ('a, 'b) => 'c) =
|
||||
(x) => (y) => f(x, y)
|
||||
private function map(f : 'a => 'b, xs : list('a)) =
|
||||
function map(f : 'a => 'b, xs : list('a)) =
|
||||
switch(xs)
|
||||
[] => []
|
||||
x :: xs => f(x) :: map(f, xs)
|
||||
private function map'() = map
|
||||
private function plus(x, y) = x + y
|
||||
function test1(xs : list(int)) = map(curry(plus)(5), xs)
|
||||
function test2(xs : list(int)) = map'()(((x) => (y) => ((x, y) => x + y)(x, y))(100), xs)
|
||||
function test3(xs : list(int)) =
|
||||
function map'() = map
|
||||
function plus(x, y) = x + y
|
||||
entrypoint test1(xs : list(int)) = map(curry(plus)(5), xs)
|
||||
entrypoint test2(xs : list(int)) = map'()(((x) => (y) => ((x, y) => x + y)(x, y))(100), xs)
|
||||
entrypoint test3(xs : list(int)) =
|
||||
let m(f, xs) = map(f, xs)
|
||||
m((x) => x + 1, xs)
|
||||
|
||||
|
||||
@@ -12,23 +12,20 @@ contract FundMe =
|
||||
deadline : int,
|
||||
goal : int }
|
||||
|
||||
private function require(b : bool, err : string) =
|
||||
if(!b) abort(err)
|
||||
|
||||
private stateful function spend(args : spend_args) =
|
||||
stateful function spend(args : spend_args) =
|
||||
Chain.spend(args.recipient, args.amount)
|
||||
|
||||
public function init(beneficiary, deadline, goal) : state =
|
||||
entrypoint init(beneficiary, deadline, goal) : state =
|
||||
{ contributions = {},
|
||||
beneficiary = beneficiary,
|
||||
deadline = deadline,
|
||||
total = 0,
|
||||
goal = goal }
|
||||
|
||||
private function is_contributor(addr) =
|
||||
function is_contributor(addr) =
|
||||
Map.member(addr, state.contributions)
|
||||
|
||||
public stateful function contribute() =
|
||||
stateful entrypoint contribute() =
|
||||
if(Chain.block_height >= state.deadline)
|
||||
spend({ recipient = Call.caller, amount = Call.value }) // Refund money
|
||||
false
|
||||
@@ -39,7 +36,7 @@ contract FundMe =
|
||||
total @ tot = tot + Call.value })
|
||||
true
|
||||
|
||||
public stateful function withdraw() =
|
||||
stateful entrypoint withdraw() =
|
||||
if(Chain.block_height < state.deadline)
|
||||
abort("Cannot withdraw before deadline")
|
||||
if(Call.caller == state.beneficiary)
|
||||
@@ -49,13 +46,13 @@ contract FundMe =
|
||||
else
|
||||
abort("Not a contributor or beneficiary")
|
||||
|
||||
private stateful function withdraw_beneficiary() =
|
||||
stateful function withdraw_beneficiary() =
|
||||
require(state.total >= state.goal, "Project was not funded")
|
||||
spend({recipient = state.beneficiary,
|
||||
amount = Contract.balance })
|
||||
put(state{ beneficiary = ak_11111111111111111111111111111111273Yts })
|
||||
|
||||
private stateful function withdraw_contributor() =
|
||||
stateful function withdraw_contributor() =
|
||||
if(state.total >= state.goal)
|
||||
abort("Project was funded")
|
||||
let to = Call.caller
|
||||
|
||||
@@ -1,3 +1,3 @@
|
||||
|
||||
contract Identity =
|
||||
function main (x:int) = x
|
||||
entrypoint main (x:int) = x
|
||||
|
||||
@@ -2,8 +2,8 @@ include "included.aes"
|
||||
include "../contracts/included2.aes"
|
||||
|
||||
contract Include =
|
||||
function foo() =
|
||||
entrypoint foo() =
|
||||
Included.foo() < Included2a.bar()
|
||||
|
||||
function bar() =
|
||||
entrypoint bar() =
|
||||
Included2b.foo() > Included.foo()
|
||||
|
||||
@@ -3,6 +3,6 @@ contract InitTypeError =
|
||||
|
||||
type state = map(int, int)
|
||||
|
||||
// Check that the compiler catches ill-typed init function
|
||||
function init() = "not the right type!"
|
||||
// Check that the compiler catches ill-typed init entrypoint
|
||||
entrypoint init() = "not the right type!"
|
||||
|
||||
|
||||
+56
-56
@@ -4,97 +4,97 @@ contract Maps =
|
||||
record state = { map_i : map(int, pt),
|
||||
map_s : map(string, pt) }
|
||||
|
||||
function init() = { map_i = {}, map_s = {} }
|
||||
entrypoint init() = { map_i = {}, map_s = {} }
|
||||
|
||||
function get_state() = state
|
||||
entrypoint get_state() = state
|
||||
|
||||
// {[k] = v}
|
||||
function map_i() =
|
||||
entrypoint map_i() =
|
||||
{ [1] = {x = 1, y = 2},
|
||||
[2] = {x = 3, y = 4},
|
||||
[3] = {x = 5, y = 6} }
|
||||
function map_s() =
|
||||
entrypoint map_s() =
|
||||
{ ["one"] = {x = 1, y = 2},
|
||||
["two"] = {x = 3, y = 4},
|
||||
["three"] = {x = 5, y = 6} }
|
||||
stateful function map_state_i() = put(state{ map_i = map_i() })
|
||||
stateful function map_state_s() = put(state{ map_s = map_s() })
|
||||
stateful entrypoint map_state_i() = put(state{ map_i = map_i() })
|
||||
stateful entrypoint map_state_s() = put(state{ map_s = map_s() })
|
||||
|
||||
// m[k]
|
||||
function get_i(k, m : map(int, pt)) = m[k]
|
||||
function get_s(k, m : map(string, pt)) = m[k]
|
||||
function get_state_i(k) = get_i(k, state.map_i)
|
||||
function get_state_s(k) = get_s(k, state.map_s)
|
||||
entrypoint get_i(k, m : map(int, pt)) = m[k]
|
||||
entrypoint get_s(k, m : map(string, pt)) = m[k]
|
||||
entrypoint get_state_i(k) = get_i(k, state.map_i)
|
||||
entrypoint get_state_s(k) = get_s(k, state.map_s)
|
||||
|
||||
// m[k = v]
|
||||
function get_def_i(k, v, m : map(int, pt)) = m[k = v]
|
||||
function get_def_s(k, v, m : map(string, pt)) = m[k = v]
|
||||
function get_def_state_i(k, v) = get_def_i(k, v, state.map_i)
|
||||
function get_def_state_s(k, v) = get_def_s(k, v, state.map_s)
|
||||
entrypoint get_def_i(k, v, m : map(int, pt)) = m[k = v]
|
||||
entrypoint get_def_s(k, v, m : map(string, pt)) = m[k = v]
|
||||
entrypoint get_def_state_i(k, v) = get_def_i(k, v, state.map_i)
|
||||
entrypoint get_def_state_s(k, v) = get_def_s(k, v, state.map_s)
|
||||
|
||||
// m{[k] = v}
|
||||
function set_i(k, p, m : map(int, pt)) = m{ [k] = p }
|
||||
function set_s(k, p, m : map(string, pt)) = m{ [k] = p }
|
||||
stateful function set_state_i(k, p) = put(state{ map_i = set_i(k, p, state.map_i) })
|
||||
stateful function set_state_s(k, p) = put(state{ map_s = set_s(k, p, state.map_s) })
|
||||
entrypoint set_i(k, p, m : map(int, pt)) = m{ [k] = p }
|
||||
entrypoint set_s(k, p, m : map(string, pt)) = m{ [k] = p }
|
||||
stateful entrypoint set_state_i(k, p) = put(state{ map_i = set_i(k, p, state.map_i) })
|
||||
stateful entrypoint set_state_s(k, p) = put(state{ map_s = set_s(k, p, state.map_s) })
|
||||
|
||||
// m{f[k].x = v}
|
||||
function setx_i(k, x, m : map(int, pt)) = m{ [k].x = x }
|
||||
function setx_s(k, x, m : map(string, pt)) = m{ [k].x = x }
|
||||
stateful function setx_state_i(k, x) = put(state{ map_i[k].x = x })
|
||||
stateful function setx_state_s(k, x) = put(state{ map_s[k].x = x })
|
||||
entrypoint setx_i(k, x, m : map(int, pt)) = m{ [k].x = x }
|
||||
entrypoint setx_s(k, x, m : map(string, pt)) = m{ [k].x = x }
|
||||
stateful entrypoint setx_state_i(k, x) = put(state{ map_i[k].x = x })
|
||||
stateful entrypoint setx_state_s(k, x) = put(state{ map_s[k].x = x })
|
||||
|
||||
// m{[k] @ x = v }
|
||||
function addx_i(k, d, m : map(int, pt)) = m{ [k].x @ x = x + d }
|
||||
function addx_s(k, d, m : map(string, pt)) = m{ [k].x @ x = x + d }
|
||||
stateful function addx_state_i(k, d) = put(state{ map_i[k].x @ x = x + d })
|
||||
stateful function addx_state_s(k, d) = put(state{ map_s[k].x @ x = x + d })
|
||||
entrypoint addx_i(k, d, m : map(int, pt)) = m{ [k].x @ x = x + d }
|
||||
entrypoint addx_s(k, d, m : map(string, pt)) = m{ [k].x @ x = x + d }
|
||||
stateful entrypoint addx_state_i(k, d) = put(state{ map_i[k].x @ x = x + d })
|
||||
stateful entrypoint addx_state_s(k, d) = put(state{ map_s[k].x @ x = x + d })
|
||||
|
||||
// m{[k = def] @ x = v }
|
||||
function addx_def_i(k, v, d, m : map(int, pt)) = m{ [k = v].x @ x = x + d }
|
||||
function addx_def_s(k, v, d, m : map(string, pt)) = m{ [k = v].x @ x = x + d }
|
||||
entrypoint addx_def_i(k, v, d, m : map(int, pt)) = m{ [k = v].x @ x = x + d }
|
||||
entrypoint addx_def_s(k, v, d, m : map(string, pt)) = m{ [k = v].x @ x = x + d }
|
||||
|
||||
// Map.member
|
||||
function member_i(k, m : map(int, pt)) = Map.member(k, m)
|
||||
function member_s(k, m : map(string, pt)) = Map.member(k, m)
|
||||
function member_state_i(k) = member_i(k, state.map_i)
|
||||
function member_state_s(k) = member_s(k, state.map_s)
|
||||
entrypoint member_i(k, m : map(int, pt)) = Map.member(k, m)
|
||||
entrypoint member_s(k, m : map(string, pt)) = Map.member(k, m)
|
||||
entrypoint member_state_i(k) = member_i(k, state.map_i)
|
||||
entrypoint member_state_s(k) = member_s(k, state.map_s)
|
||||
|
||||
// Map.lookup
|
||||
function lookup_i(k, m : map(int, pt)) = Map.lookup(k, m)
|
||||
function lookup_s(k, m : map(string, pt)) = Map.lookup(k, m)
|
||||
function lookup_state_i(k) = lookup_i(k, state.map_i)
|
||||
function lookup_state_s(k) = lookup_s(k, state.map_s)
|
||||
entrypoint lookup_i(k, m : map(int, pt)) = Map.lookup(k, m)
|
||||
entrypoint lookup_s(k, m : map(string, pt)) = Map.lookup(k, m)
|
||||
entrypoint lookup_state_i(k) = lookup_i(k, state.map_i)
|
||||
entrypoint lookup_state_s(k) = lookup_s(k, state.map_s)
|
||||
|
||||
// Map.lookup_default
|
||||
function lookup_def_i(k, m : map(int, pt), def : pt) =
|
||||
entrypoint lookup_def_i(k, m : map(int, pt), def : pt) =
|
||||
Map.lookup_default(k, m, def)
|
||||
function lookup_def_s(k, m : map(string, pt), def : pt) =
|
||||
entrypoint lookup_def_s(k, m : map(string, pt), def : pt) =
|
||||
Map.lookup_default(k, m, def)
|
||||
function lookup_def_state_i(k, def) = lookup_def_i(k, state.map_i, def)
|
||||
function lookup_def_state_s(k, def) = lookup_def_s(k, state.map_s, def)
|
||||
entrypoint lookup_def_state_i(k, def) = lookup_def_i(k, state.map_i, def)
|
||||
entrypoint lookup_def_state_s(k, def) = lookup_def_s(k, state.map_s, def)
|
||||
|
||||
// Map.delete
|
||||
function delete_i(k, m : map(int, pt)) = Map.delete(k, m)
|
||||
function delete_s(k, m : map(string, pt)) = Map.delete(k, m)
|
||||
stateful function delete_state_i(k) = put(state{ map_i = delete_i(k, state.map_i) })
|
||||
stateful function delete_state_s(k) = put(state{ map_s = delete_s(k, state.map_s) })
|
||||
entrypoint delete_i(k, m : map(int, pt)) = Map.delete(k, m)
|
||||
entrypoint delete_s(k, m : map(string, pt)) = Map.delete(k, m)
|
||||
stateful entrypoint delete_state_i(k) = put(state{ map_i = delete_i(k, state.map_i) })
|
||||
stateful entrypoint delete_state_s(k) = put(state{ map_s = delete_s(k, state.map_s) })
|
||||
|
||||
// Map.size
|
||||
function size_i(m : map(int, pt)) = Map.size(m)
|
||||
function size_s(m : map(string, pt)) = Map.size(m)
|
||||
function size_state_i() = size_i(state.map_i)
|
||||
function size_state_s() = size_s(state.map_s)
|
||||
entrypoint size_i(m : map(int, pt)) = Map.size(m)
|
||||
entrypoint size_s(m : map(string, pt)) = Map.size(m)
|
||||
entrypoint size_state_i() = size_i(state.map_i)
|
||||
entrypoint size_state_s() = size_s(state.map_s)
|
||||
|
||||
// Map.to_list
|
||||
function tolist_i(m : map(int, pt)) = Map.to_list(m)
|
||||
function tolist_s(m : map(string, pt)) = Map.to_list(m)
|
||||
function tolist_state_i() = tolist_i(state.map_i)
|
||||
function tolist_state_s() = tolist_s(state.map_s)
|
||||
entrypoint tolist_i(m : map(int, pt)) = Map.to_list(m)
|
||||
entrypoint tolist_s(m : map(string, pt)) = Map.to_list(m)
|
||||
entrypoint tolist_state_i() = tolist_i(state.map_i)
|
||||
entrypoint tolist_state_s() = tolist_s(state.map_s)
|
||||
|
||||
// Map.from_list
|
||||
function fromlist_i(xs : list((int, pt))) = Map.from_list(xs)
|
||||
function fromlist_s(xs : list((string, pt))) = Map.from_list(xs)
|
||||
stateful function fromlist_state_i(xs) = put(state{ map_i = fromlist_i(xs) })
|
||||
stateful function fromlist_state_s(xs) = put(state{ map_s = fromlist_s(xs) })
|
||||
entrypoint fromlist_i(xs : list(int * pt)) = Map.from_list(xs)
|
||||
entrypoint fromlist_s(xs : list(string * pt)) = Map.from_list(xs)
|
||||
stateful entrypoint fromlist_state_i(xs) = put(state{ map_i = fromlist_i(xs) })
|
||||
stateful entrypoint fromlist_state_s(xs) = put(state{ map_s = fromlist_s(xs) })
|
||||
|
||||
|
||||
@@ -3,6 +3,6 @@ contract MissingFieldsInRecordExpr =
|
||||
record r('a) = {x : int, y : string, z : 'a}
|
||||
type alias('a) = r('a)
|
||||
|
||||
function fail1() = { x = 0 }
|
||||
function fail2(z : 'a) : r('a) = { y = "string", z = z }
|
||||
function fail3() : alias(int) = { x = 0, z = 1 }
|
||||
entrypoint fail1() = { x = 0 }
|
||||
entrypoint fail2(z : 'a) : r('a) = { y = "string", z = z }
|
||||
entrypoint fail3() : alias(int) = { x = 0, z = 1 }
|
||||
|
||||
@@ -2,5 +2,5 @@
|
||||
contract MissingStateType =
|
||||
|
||||
// Check that we get a type error also for implicit state
|
||||
function init() = "should be ()"
|
||||
entrypoint init() = "should be ()"
|
||||
|
||||
|
||||
@@ -0,0 +1,12 @@
|
||||
|
||||
namespace Lib =
|
||||
entrypoint foo() = ()
|
||||
|
||||
contract Remote =
|
||||
public function foo : () => unit
|
||||
function bla() = ()
|
||||
|
||||
contract Contract =
|
||||
public function foo() = ()
|
||||
public private stateful function all_the_things() = ()
|
||||
private entrypoint wha() = ()
|
||||
@@ -1,16 +1,17 @@
|
||||
|
||||
contract NameClash =
|
||||
|
||||
function double_proto : () => int
|
||||
function double_proto : () => int
|
||||
entrypoint double_proto : () => int
|
||||
entrypoint double_proto : () => int
|
||||
|
||||
function proto_and_def : int => int
|
||||
function proto_and_def(n) = n + 1
|
||||
entrypoint proto_and_def : int => int
|
||||
entrypoint proto_and_def(n) = n + 1
|
||||
|
||||
function double_def(x) = x
|
||||
function double_def(y) = 0
|
||||
entrypoint double_def(x) = x
|
||||
entrypoint double_def(y) = 0
|
||||
|
||||
// abort, put and state are builtin
|
||||
function abort() : int = 0
|
||||
function put(x) = x
|
||||
function state(x, y) = x + y
|
||||
// abort, require, put and state are builtin
|
||||
entrypoint abort() : int = 0
|
||||
entrypoint require(b, err) = if(b) abort(err)
|
||||
entrypoint put(x) = x
|
||||
entrypoint state(x, y) = x + y
|
||||
|
||||
@@ -0,0 +1,18 @@
|
||||
|
||||
namespace Foo =
|
||||
|
||||
record bla = {x : int, y : bool}
|
||||
|
||||
function bar() : Foo.bla = {x = 17, y = true}
|
||||
|
||||
contract Bug =
|
||||
|
||||
// Crashed the type checker
|
||||
entrypoint foo() = Foo.bar()
|
||||
|
||||
// Also crashed the type checker
|
||||
type t = Foo.bla
|
||||
|
||||
entrypoint test() =
|
||||
let x : t = Foo.bar()
|
||||
x
|
||||
@@ -2,4 +2,4 @@
|
||||
// You can't shadow existing contracts or namespaces.
|
||||
|
||||
contract Call =
|
||||
function whatever() = ()
|
||||
entrypoint whatever() = ()
|
||||
|
||||
@@ -13,9 +13,9 @@ namespace List =
|
||||
|
||||
contract Deadcode =
|
||||
|
||||
function inc1(xs : list(int)) : list(int) =
|
||||
entrypoint inc1(xs : list(int)) : list(int) =
|
||||
List.map1((x) => x + 1, xs)
|
||||
|
||||
function inc2(xs : list(int)) : list(int) =
|
||||
entrypoint inc2(xs : list(int)) : list(int) =
|
||||
List.map2((x) => x + 1, xs)
|
||||
|
||||
|
||||
+21
-23
@@ -9,31 +9,31 @@ contract Oracles =
|
||||
type oracle_id = oracle(query_t, answer_t)
|
||||
type query_id = oracle_query(query_t, answer_t)
|
||||
|
||||
stateful function registerOracle(acct : address,
|
||||
stateful entrypoint registerOracle(acct : address,
|
||||
qfee : fee,
|
||||
ttl : ttl) : oracle_id =
|
||||
Oracle.register(acct, qfee, ttl)
|
||||
|
||||
stateful function registerIntIntOracle(acct : address,
|
||||
stateful entrypoint registerIntIntOracle(acct : address,
|
||||
qfee : fee,
|
||||
ttl : ttl) : oracle(int, int) =
|
||||
Oracle.register(acct, qfee, ttl)
|
||||
|
||||
stateful function registerStringStringOracle(acct : address,
|
||||
stateful entrypoint registerStringStringOracle(acct : address,
|
||||
qfee : fee,
|
||||
ttl : ttl) : oracle(string, string) =
|
||||
Oracle.register(acct, qfee, ttl)
|
||||
|
||||
stateful function signedRegisterOracle(acct : address,
|
||||
stateful entrypoint signedRegisterOracle(acct : address,
|
||||
sign : signature,
|
||||
qfee : fee,
|
||||
ttl : ttl) : oracle_id =
|
||||
Oracle.register(acct, qfee, ttl, signature = sign)
|
||||
|
||||
function queryFee(o : oracle_id) : fee =
|
||||
entrypoint queryFee(o : oracle_id) : fee =
|
||||
Oracle.query_fee(o)
|
||||
|
||||
stateful function createQuery(o : oracle_id,
|
||||
stateful entrypoint createQuery(o : oracle_id,
|
||||
q : query_t,
|
||||
qfee : fee,
|
||||
qttl : ttl,
|
||||
@@ -42,7 +42,7 @@ contract Oracles =
|
||||
Oracle.query(o, q, qfee, qttl, rttl)
|
||||
|
||||
// Do not use in production!
|
||||
stateful function unsafeCreateQuery(o : oracle_id,
|
||||
stateful entrypoint unsafeCreateQuery(o : oracle_id,
|
||||
q : query_t,
|
||||
qfee : fee,
|
||||
qttl : ttl,
|
||||
@@ -50,7 +50,7 @@ contract Oracles =
|
||||
Oracle.query(o, q, qfee, qttl, rttl)
|
||||
|
||||
// Do not use in production!
|
||||
stateful function unsafeCreateQueryThenErr(o : oracle_id,
|
||||
stateful entrypoint unsafeCreateQueryThenErr(o : oracle_id,
|
||||
q : query_t,
|
||||
qfee : fee,
|
||||
qttl : ttl,
|
||||
@@ -59,54 +59,52 @@ contract Oracles =
|
||||
require(qfee >= 100000000000000000, "causing a late error")
|
||||
res
|
||||
|
||||
stateful function extendOracle(o : oracle_id,
|
||||
ttl : ttl) : () =
|
||||
stateful entrypoint extendOracle(o : oracle_id,
|
||||
ttl : ttl) : unit =
|
||||
Oracle.extend(o, ttl)
|
||||
|
||||
stateful function signedExtendOracle(o : oracle_id,
|
||||
stateful entrypoint signedExtendOracle(o : oracle_id,
|
||||
sign : signature, // Signed oracle address
|
||||
ttl : ttl) : () =
|
||||
ttl : ttl) : unit =
|
||||
Oracle.extend(o, signature = sign, ttl)
|
||||
|
||||
stateful function respond(o : oracle_id,
|
||||
stateful entrypoint respond(o : oracle_id,
|
||||
q : query_id,
|
||||
r : answer_t) : () =
|
||||
r : answer_t) : unit =
|
||||
Oracle.respond(o, q, r)
|
||||
|
||||
stateful function signedRespond(o : oracle_id,
|
||||
stateful entrypoint signedRespond(o : oracle_id,
|
||||
q : query_id,
|
||||
sign : signature,
|
||||
r : answer_t) : () =
|
||||
r : answer_t) : unit =
|
||||
Oracle.respond(o, q, signature = sign, r)
|
||||
|
||||
function getQuestion(o : oracle_id,
|
||||
entrypoint getQuestion(o : oracle_id,
|
||||
q : query_id) : query_t =
|
||||
Oracle.get_question(o, q)
|
||||
|
||||
function hasAnswer(o : oracle_id,
|
||||
entrypoint hasAnswer(o : oracle_id,
|
||||
q : query_id) =
|
||||
switch(Oracle.get_answer(o, q))
|
||||
None => false
|
||||
Some(_) => true
|
||||
|
||||
function getAnswer(o : oracle_id,
|
||||
entrypoint getAnswer(o : oracle_id,
|
||||
q : query_id) : option(answer_t) =
|
||||
Oracle.get_answer(o, q)
|
||||
|
||||
datatype complexQuestion = Why(int) | How(string)
|
||||
datatype complexAnswer = NoAnswer | Answer(complexQuestion, string, int)
|
||||
|
||||
stateful function complexOracle(question) =
|
||||
stateful entrypoint complexOracle(question) =
|
||||
let o = Oracle.register(Contract.address, 0, FixedTTL(1000)) : oracle(complexQuestion, complexAnswer)
|
||||
let q = Oracle.query(o, question, 0, RelativeTTL(100), RelativeTTL(100))
|
||||
Oracle.respond(o, q, Answer(question, "magic", 1337))
|
||||
Oracle.get_answer(o, q)
|
||||
|
||||
stateful function signedComplexOracle(question, sig) =
|
||||
stateful entrypoint signedComplexOracle(question, sig) =
|
||||
let o = Oracle.register(signature = sig, Contract.address, 0, FixedTTL(1000)) : oracle(complexQuestion, complexAnswer)
|
||||
let q = Oracle.query(o, question, 0, RelativeTTL(100), RelativeTTL(100))
|
||||
Oracle.respond(o, q, Answer(question, "magic", 1337), signature = sig)
|
||||
Oracle.get_answer(o, q)
|
||||
|
||||
private function require(b : bool, err : string) =
|
||||
if(!b) abort(err)
|
||||
|
||||
@@ -20,5 +20,3 @@ contract OraclesGas =
|
||||
Oracle.respond(o, q, answer)
|
||||
()
|
||||
|
||||
private function require(b : bool, err : string) =
|
||||
if(!b) abort(err)
|
||||
|
||||
@@ -21,7 +21,7 @@ contract Oracles =
|
||||
function respond(o : oracle_id,
|
||||
q : query_id,
|
||||
sign : signature,
|
||||
r : answer_t) : () =
|
||||
r : answer_t) : unit =
|
||||
Oracle.respond(o, q, signature = sign, r)
|
||||
|
||||
|
||||
@@ -33,5 +33,3 @@ contract Oracles =
|
||||
q : query_id) : option(answer_t) =
|
||||
Oracle.get_answer(o, q)
|
||||
|
||||
private function require(b : bool, err : string) =
|
||||
if(!b) abort(err)
|
||||
|
||||
@@ -1,27 +1,27 @@
|
||||
|
||||
contract Remote1 =
|
||||
function main : (int) => int
|
||||
entrypoint main : (int) => int
|
||||
|
||||
contract Remote2 =
|
||||
function call : (Remote1, int) => int
|
||||
entrypoint call : (Remote1, int) => int
|
||||
|
||||
contract Remote3 =
|
||||
function get : () => int
|
||||
function tick : () => ()
|
||||
entrypoint get : () => int
|
||||
entrypoint tick : () => unit
|
||||
|
||||
contract RemoteCall =
|
||||
|
||||
stateful function call(r : Remote1, x : int) : int =
|
||||
stateful entrypoint call(r : Remote1, x : int) : int =
|
||||
r.main(gas = 10000, value = 10, x)
|
||||
|
||||
function staged_call(r1 : Remote1, r2 : Remote2, x : int) =
|
||||
entrypoint staged_call(r1 : Remote1, r2 : Remote2, x : int) =
|
||||
r2.call(r1, x)
|
||||
|
||||
function increment(r3 : Remote3) =
|
||||
entrypoint increment(r3 : Remote3) =
|
||||
r3.tick()
|
||||
|
||||
function get(r3 : Remote3) =
|
||||
entrypoint get(r3 : Remote3) =
|
||||
r3.get()
|
||||
|
||||
function plus(x, y) = x + y
|
||||
entrypoint plus(x, y) = x + y
|
||||
|
||||
|
||||
@@ -1,3 +1,4 @@
|
||||
|
||||
contract Simple =
|
||||
type t = int => int
|
||||
entrypoint dummy() = ()
|
||||
|
||||
@@ -6,11 +6,11 @@
|
||||
contract SimpleStorage {
|
||||
uint storedData
|
||||
|
||||
function set(uint x) {
|
||||
entrypoint set(uint x) {
|
||||
storedData = x
|
||||
}
|
||||
|
||||
function get() constant returns (uint) {
|
||||
entrypoint get() constant returns (uint) {
|
||||
return storedData
|
||||
}
|
||||
}
|
||||
@@ -20,9 +20,9 @@ contract SimpleStorage =
|
||||
|
||||
record state = { data : int }
|
||||
|
||||
function init(value : int) : state = { data = value }
|
||||
entrypoint init(value : int) : state = { data = value }
|
||||
|
||||
function get() : int = state.data
|
||||
entrypoint get() : int = state.data
|
||||
|
||||
stateful function set(value : int) =
|
||||
stateful entrypoint set(value : int) =
|
||||
put(state{data = value})
|
||||
|
||||
@@ -1,26 +1,26 @@
|
||||
|
||||
contract SpendContract =
|
||||
function withdraw : (int) => int
|
||||
entrypoint withdraw : (int) => int
|
||||
|
||||
contract SpendTest =
|
||||
|
||||
stateful function spend(to, amount) =
|
||||
stateful entrypoint spend(to, amount) =
|
||||
let total = Contract.balance
|
||||
Chain.spend(to, amount)
|
||||
total - amount
|
||||
|
||||
stateful function withdraw(amount) : int =
|
||||
stateful entrypoint withdraw(amount) : int =
|
||||
spend(Call.caller, amount)
|
||||
|
||||
stateful function withdraw_from(account, amount) =
|
||||
stateful entrypoint withdraw_from(account, amount) =
|
||||
account.withdraw(amount)
|
||||
withdraw(amount)
|
||||
|
||||
stateful function spend_from(from, to, amount) =
|
||||
stateful entrypoint spend_from(from, to, amount) =
|
||||
from.withdraw(amount)
|
||||
Chain.spend(to, amount)
|
||||
Chain.balance(to)
|
||||
|
||||
function get_balance() = Contract.balance
|
||||
function get_balance_of(a) = Chain.balance(a)
|
||||
entrypoint get_balance() = Contract.balance
|
||||
entrypoint get_balance_of(a) = Chain.balance(a)
|
||||
|
||||
|
||||
@@ -6,24 +6,24 @@ contract Stack =
|
||||
record state = { stack : stack(string),
|
||||
size : int }
|
||||
|
||||
function init(ss : list(string)) = { stack = ss, size = length(ss) }
|
||||
entrypoint init(ss : list(string)) = { stack = ss, size = length(ss) }
|
||||
|
||||
private function length(xs) =
|
||||
function length(xs) =
|
||||
switch(xs)
|
||||
[] => 0
|
||||
_ :: xs => length(xs) + 1
|
||||
|
||||
stateful function pop() : string =
|
||||
stateful entrypoint pop() : string =
|
||||
switch(state.stack)
|
||||
s :: ss =>
|
||||
put(state{ stack = ss, size = state.size - 1 })
|
||||
s
|
||||
|
||||
stateful function push(s) =
|
||||
stateful entrypoint push(s) =
|
||||
put(state{ stack = s :: state.stack, size = state.size + 1 })
|
||||
state.size
|
||||
|
||||
function all() = state.stack
|
||||
entrypoint all() = state.stack
|
||||
|
||||
function size() = state.size
|
||||
entrypoint size() = state.size
|
||||
|
||||
|
||||
@@ -1,70 +1,70 @@
|
||||
contract Remote =
|
||||
record rstate = { i : int, s : string, m : map(int, int) }
|
||||
|
||||
function look_at : (rstate) => ()
|
||||
function return_s : (bool) => string
|
||||
function return_m : (bool) => map(int, int)
|
||||
function get : (rstate) => rstate
|
||||
function get_i : (rstate) => int
|
||||
function get_s : (rstate) => string
|
||||
function get_m : (rstate) => map(int, int)
|
||||
entrypoint look_at : (rstate) => unit
|
||||
entrypoint return_s : (bool) => string
|
||||
entrypoint return_m : (bool) => map(int, int)
|
||||
entrypoint get : (rstate) => rstate
|
||||
entrypoint get_i : (rstate) => int
|
||||
entrypoint get_s : (rstate) => string
|
||||
entrypoint get_m : (rstate) => map(int, int)
|
||||
|
||||
function fun_update_i : (rstate, int) => rstate
|
||||
function fun_update_s : (rstate, string) => rstate
|
||||
function fun_update_m : (rstate, map(int, int)) => rstate
|
||||
function fun_update_mk : (rstate, int, int) => rstate
|
||||
entrypoint fun_update_i : (rstate, int) => rstate
|
||||
entrypoint fun_update_s : (rstate, string) => rstate
|
||||
entrypoint fun_update_m : (rstate, map(int, int)) => rstate
|
||||
entrypoint fun_update_mk : (rstate, int, int) => rstate
|
||||
|
||||
contract StateHandling =
|
||||
|
||||
type state = Remote.rstate
|
||||
|
||||
function init(r : Remote, i : int) =
|
||||
entrypoint init(r : Remote, i : int) =
|
||||
let state0 = { i = 0, s = "undefined", m = {} }
|
||||
r.fun_update_i(state0, i)
|
||||
|
||||
function read() = state
|
||||
function read_i() = state.i
|
||||
function read_s() = state.s
|
||||
function read_m() = state.m
|
||||
entrypoint read() = state
|
||||
entrypoint read_i() = state.i
|
||||
entrypoint read_s() = state.s
|
||||
entrypoint read_m() = state.m
|
||||
|
||||
stateful function update(new_state : state) = put(new_state)
|
||||
stateful function update_i(new_i) = put(state{ i = new_i })
|
||||
stateful function update_s(new_s) = put(state{ s = new_s })
|
||||
stateful function update_m(new_m) = put(state{ m = new_m })
|
||||
stateful entrypoint update(new_state : state) = put(new_state)
|
||||
stateful entrypoint update_i(new_i) = put(state{ i = new_i })
|
||||
stateful entrypoint update_s(new_s) = put(state{ s = new_s })
|
||||
stateful entrypoint update_m(new_m) = put(state{ m = new_m })
|
||||
|
||||
function pass_it(r : Remote) = r.look_at(state)
|
||||
stateful function nop(r : Remote) = put(state{ i = state.i })
|
||||
function return_it_s(r : Remote, big : bool) =
|
||||
entrypoint pass_it(r : Remote) = r.look_at(state)
|
||||
stateful entrypoint nop(r : Remote) = put(state{ i = state.i })
|
||||
entrypoint return_it_s(r : Remote, big : bool) =
|
||||
let x = r.return_s(big)
|
||||
String.length(x)
|
||||
function return_it_m(r : Remote, big : bool) =
|
||||
entrypoint return_it_m(r : Remote, big : bool) =
|
||||
let x = r.return_m(big)
|
||||
Map.size(x)
|
||||
|
||||
function pass(r : Remote) = r.get(state)
|
||||
function pass_i(r : Remote) = r.get_i(state)
|
||||
function pass_s(r : Remote) = r.get_s(state)
|
||||
function pass_m(r : Remote) = r.get_m(state)
|
||||
entrypoint pass(r : Remote) = r.get(state)
|
||||
entrypoint pass_i(r : Remote) = r.get_i(state)
|
||||
entrypoint pass_s(r : Remote) = r.get_s(state)
|
||||
entrypoint pass_m(r : Remote) = r.get_m(state)
|
||||
|
||||
function pass_update_i(r : Remote, i) = r.fun_update_i(state, i)
|
||||
function pass_update_s(r : Remote, s) = r.fun_update_s(state, s)
|
||||
function pass_update_m(r : Remote, m) = r.fun_update_m(state, m)
|
||||
entrypoint pass_update_i(r : Remote, i) = r.fun_update_i(state, i)
|
||||
entrypoint pass_update_s(r : Remote, s) = r.fun_update_s(state, s)
|
||||
entrypoint pass_update_m(r : Remote, m) = r.fun_update_m(state, m)
|
||||
|
||||
stateful function remote_update_i (r : Remote, i) = put(r.fun_update_i(state, i))
|
||||
stateful function remote_update_s (r : Remote, s) = put(r.fun_update_s(state, s))
|
||||
stateful function remote_update_m (r : Remote, m) = put(r.fun_update_m(state, m))
|
||||
stateful function remote_update_mk(r : Remote, k, v) = put(r.fun_update_mk(state, k, v))
|
||||
stateful entrypoint remote_update_i (r : Remote, i) = put(r.fun_update_i(state, i))
|
||||
stateful entrypoint remote_update_s (r : Remote, s) = put(r.fun_update_s(state, s))
|
||||
stateful entrypoint remote_update_m (r : Remote, m) = put(r.fun_update_m(state, m))
|
||||
stateful entrypoint remote_update_mk(r : Remote, k, v) = put(r.fun_update_mk(state, k, v))
|
||||
|
||||
// remote called
|
||||
function look_at(s : state) = ()
|
||||
entrypoint look_at(s : state) = ()
|
||||
|
||||
function get(s : state) = s
|
||||
function get_i(s : state) = s.i
|
||||
function get_s(s : state) = s.s
|
||||
function get_m(s : state) = s.m
|
||||
entrypoint get(s : state) = s
|
||||
entrypoint get_i(s : state) = s.i
|
||||
entrypoint get_s(s : state) = s.s
|
||||
entrypoint get_m(s : state) = s.m
|
||||
|
||||
function fun_update_i(st, ni) = st{ i = ni }
|
||||
function fun_update_s(st, ns) = st{ s = ns }
|
||||
function fun_update_m(st, nm) = st{ m = nm }
|
||||
function fun_update_mk(st, k, v) = st{ m = st.m{[k] = v} }
|
||||
entrypoint fun_update_i(st, ni) = st{ i = ni }
|
||||
entrypoint fun_update_s(st, ns) = st{ s = ns }
|
||||
entrypoint fun_update_m(st, nm) = st{ m = nm }
|
||||
entrypoint fun_update_mk(st, k, v) = st{ m = st.m{[k] = v} }
|
||||
|
||||
|
||||
+20
-20
@@ -1,18 +1,18 @@
|
||||
|
||||
contract Remote =
|
||||
stateful function remote_spend : (address, int) => ()
|
||||
function remote_pure : int => int
|
||||
stateful entrypoint remote_spend : (address, int) => unit
|
||||
entrypoint remote_pure : int => int
|
||||
|
||||
contract Stateful =
|
||||
|
||||
private function pure(x) = x + 1
|
||||
private stateful function local_spend(a) =
|
||||
function pure(x) = x + 1
|
||||
stateful function local_spend(a) =
|
||||
Chain.spend(a, 1000)
|
||||
|
||||
// Non-stateful functions cannot mention stateful functions
|
||||
function fail1(a : address) = Chain.spend(a, 1000)
|
||||
function fail2(a : address) = local_spend(a)
|
||||
function fail3(a : address) =
|
||||
entrypoint fail1(a : address) = Chain.spend(a, 1000)
|
||||
entrypoint fail2(a : address) = local_spend(a)
|
||||
entrypoint fail3(a : address) =
|
||||
let foo = Chain.spend
|
||||
foo(a, 1000)
|
||||
|
||||
@@ -20,35 +20,35 @@ contract Stateful =
|
||||
private function fail4(a) = Chain.spend(a, 1000)
|
||||
|
||||
// If annotated, stateful functions are allowed
|
||||
stateful function ok1(a : address) = Chain.spend(a, 1000)
|
||||
stateful entrypoint ok1(a : address) = Chain.spend(a, 1000)
|
||||
|
||||
// And pure functions are always allowed
|
||||
stateful function ok2(a : address) = pure(5)
|
||||
stateful function ok3(a : address) =
|
||||
stateful entrypoint ok2(a : address) = pure(5)
|
||||
stateful entrypoint ok3(a : address) =
|
||||
let foo = pure
|
||||
foo(5)
|
||||
|
||||
// No error here (fail4 is annotated as not stateful)
|
||||
function ok4(a : address) = fail4(a)
|
||||
entrypoint ok4(a : address) = fail4(a)
|
||||
|
||||
// Lamdbas are checked at the construction site
|
||||
private function fail5() : address => () = (a) => Chain.spend(a, 1000)
|
||||
function fail5() : address => unit = (a) => Chain.spend(a, 1000)
|
||||
|
||||
// .. so you can pass a stateful lambda to a non-stateful higher-order
|
||||
// function:
|
||||
private function apply(f : 'a => 'b, x) = f(x)
|
||||
stateful function ok5(a : address) =
|
||||
function apply(f : 'a => 'b, x) = f(x)
|
||||
stateful entrypoint ok5(a : address) =
|
||||
apply((val) => Chain.spend(a, val), 1000)
|
||||
|
||||
// It doesn't matter if remote calls are stateful or not
|
||||
function ok6(r : Remote) = r.remote_spend(Contract.address, 1000)
|
||||
function ok7(r : Remote) = r.remote_pure(5)
|
||||
entrypoint ok6(r : Remote) = r.remote_spend(Contract.address, 1000)
|
||||
entrypoint ok7(r : Remote) = r.remote_pure(5)
|
||||
|
||||
// But you can't send any tokens if not stateful
|
||||
function fail6(r : Remote) = r.remote_spend(value = 1000, Contract.address, 1000)
|
||||
function fail7(r : Remote) = r.remote_pure(value = 1000, 5)
|
||||
function fail8(r : Remote) =
|
||||
entrypoint fail6(r : Remote) = r.remote_spend(value = 1000, Contract.address, 1000)
|
||||
entrypoint fail7(r : Remote) = r.remote_pure(value = 1000, 5)
|
||||
entrypoint fail8(r : Remote) =
|
||||
let foo = r.remote_pure
|
||||
foo(value = 1000, 5)
|
||||
function ok8(r : Remote) = r.remote_spend(Contract.address, 1000, value = 0)
|
||||
entrypoint ok8(r : Remote) = r.remote_spend(Contract.address, 1000, value = 0)
|
||||
|
||||
|
||||
@@ -1,4 +1,4 @@
|
||||
contract Strings =
|
||||
function str_len(s) = String.length(s)
|
||||
function str_concat(s1, s2) = String.concat(s1, s2)
|
||||
entrypoint str_len(s) = String.length(s)
|
||||
entrypoint str_concat(s1, s2) = String.concat(s1, s2)
|
||||
|
||||
|
||||
@@ -0,0 +1,2 @@
|
||||
contract Stub =
|
||||
entrypoint foo : (int) => int
|
||||
@@ -91,10 +91,10 @@ contract Identity =
|
||||
// }
|
||||
// let id(x) = x
|
||||
// let main(xs) = map(double,xs)
|
||||
function z(f,x) = x
|
||||
private function s(n) = (f,x)=>f(n(f,x))
|
||||
private function add(m,n) = (f,x)=>m(f,n(f,x))
|
||||
function main(_) =
|
||||
entrypoint z(f,x) = x
|
||||
function s(n) = (f,x)=>f(n(f,x))
|
||||
function add(m,n) = (f,x)=>m(f,n(f,x))
|
||||
entrypoint main(_) =
|
||||
let three=s(s(s(z)))
|
||||
add(three,three)
|
||||
(((i)=>i+1),0)
|
||||
|
||||
@@ -0,0 +1,36 @@
|
||||
contract TuplesMatch =
|
||||
|
||||
entrypoint tuplify3() = (t) => switch(t)
|
||||
(x, y, z) => 3
|
||||
|
||||
entrypoint fst(p : int * string) =
|
||||
switch(p)
|
||||
(x, y) => x
|
||||
entrypoint fst'(p : int * string) =
|
||||
switch(p)
|
||||
(x, _) => x
|
||||
entrypoint snd(p : int * string) =
|
||||
switch(p)
|
||||
(x, y) => y
|
||||
entrypoint snd'(p : int * string) =
|
||||
switch(p)
|
||||
(_, y) => y
|
||||
entrypoint sum(p) =
|
||||
switch(p)
|
||||
(x, y) => x + y
|
||||
entrypoint swap(p : int * string) =
|
||||
switch(p)
|
||||
(x, y) => (y, x)
|
||||
entrypoint id(p : int * int * string) =
|
||||
switch(p)
|
||||
(x, y, z) => (x, y, z)
|
||||
entrypoint nest(p : (int * int) * string) =
|
||||
switch(p)
|
||||
(xy, z) => switch(xy) (x, y) => (x, y, z)
|
||||
entrypoint deep(p : (int * int) * (int * int)) =
|
||||
switch(p)
|
||||
((x, y), (z, w)) => (x, y, z, w)
|
||||
entrypoint deep_sum(p : (int * int) * (int * int)) =
|
||||
switch(p)
|
||||
((x, y), (z, w)) => x + y + z + w
|
||||
|
||||
@@ -2,12 +2,12 @@
|
||||
contract Remote =
|
||||
|
||||
type themap = map(int, string)
|
||||
function foo : () => themap
|
||||
entrypoint foo : () => themap
|
||||
|
||||
contract Main =
|
||||
|
||||
type themap = map(string, int)
|
||||
|
||||
// Should fail
|
||||
function foo(r : Remote) : themap = r.foo()
|
||||
entrypoint foo(r : Remote) : themap = r.foo()
|
||||
|
||||
|
||||
@@ -6,39 +6,54 @@ contract Test =
|
||||
record r2 = { z : int, w : int }
|
||||
record r3 = { x : int, z : int }
|
||||
|
||||
function set_x(r : r, z) = r{ x["foo"] @ x = x + 1 }
|
||||
entrypoint set_x(r : r, z) = r{ x["foo"] @ x = x + 1 }
|
||||
|
||||
function bla(m : map(string, int)) = { [0] = "bla", ["foo"] = "" }
|
||||
entrypoint bla(m : map(string, int)) = { [0] = "bla", ["foo"] = "" }
|
||||
|
||||
function foo(r) = r { y = 0 }
|
||||
function bar() = { y = "foo", z = 0 }
|
||||
function baz() = { y = "foo", w = 0 }
|
||||
entrypoint foo(r) = r { y = 0 }
|
||||
entrypoint bar() = { y = "foo", z = 0 }
|
||||
entrypoint baz() = { y = "foo", w = 0 }
|
||||
|
||||
function foo1() = zz
|
||||
entrypoint foo1() = zz
|
||||
|
||||
function test1() : string = { y = 0 }
|
||||
function test2(x : string) = x { y = 0 }
|
||||
function test3(x : string) = x { y @ y = y + 1 }
|
||||
function test4(x : string) : int = x.y
|
||||
entrypoint test1() : string = { y = 0 }
|
||||
entrypoint test2(x : string) = x { y = 0 }
|
||||
entrypoint test3(x : string) = x { y @ y = y + 1 }
|
||||
entrypoint test4(x : string) : int = x.y
|
||||
|
||||
function test5(xs) =
|
||||
entrypoint test5(xs) =
|
||||
switch(xs)
|
||||
x :: x => x
|
||||
[] => 0
|
||||
|
||||
function case_pat(xs) =
|
||||
entrypoint case_pat(xs) =
|
||||
switch(xs)
|
||||
[] => 0
|
||||
x :: xs => "x"
|
||||
|
||||
function foo2(m : map(string, int)) = m{ [1] = "bla" }
|
||||
entrypoint foo2(m : map(string, int)) = m{ [1] = "bla" }
|
||||
|
||||
function bad_if(x, y : int, w : int, z : string) =
|
||||
entrypoint bad_if(x, y : int, w : int, z : string) =
|
||||
if(x) y
|
||||
elif(x) w
|
||||
else z
|
||||
|
||||
function type_error(r, x) =
|
||||
entrypoint type_error(r, x) =
|
||||
set_x(set_x(x, r), x)
|
||||
|
||||
function repeated_arg(x : int, y, x : string, y : bool) : string = x
|
||||
entrypoint repeated_arg(x : int, y, x : string, y : bool) : string = x
|
||||
|
||||
entrypoint missing1() =
|
||||
let x = 0
|
||||
|
||||
entrypoint missing_fun1() =
|
||||
let f(x) = x
|
||||
|
||||
entrypoint missing2() =
|
||||
let x = 0
|
||||
let y = 0
|
||||
|
||||
entrypoint missing_fun2() =
|
||||
let f() = 0
|
||||
let g() = f()
|
||||
|
||||
|
||||
@@ -7,23 +7,21 @@ contract VariantTypes =
|
||||
|
||||
datatype color = Red | Green | Blue | Grey(int)
|
||||
|
||||
function init() = Stopped
|
||||
entrypoint init() = Stopped
|
||||
|
||||
function require(b) = if(!b) abort("required")
|
||||
|
||||
stateful function start(bal : int) =
|
||||
stateful entrypoint start(bal : int) =
|
||||
switch(state)
|
||||
Stopped => put(Started({owner = Call.caller, balance = bal, color = Grey(0)}))
|
||||
|
||||
stateful function stop() =
|
||||
stateful entrypoint stop() =
|
||||
switch(state)
|
||||
Started(st) =>
|
||||
require(Call.caller == st.owner)
|
||||
require(Call.caller == st.owner, "required")
|
||||
put(Stopped)
|
||||
st.balance
|
||||
|
||||
function get_color() = switch(state) Started(st) => st.color
|
||||
stateful function set_color(c) = switch(state) Started(st) => put(Started(st{color = c}))
|
||||
entrypoint get_color() = switch(state) Started(st) => st.color
|
||||
stateful entrypoint set_color(c) = switch(state) Started(st) => put(Started(st{color = c}))
|
||||
|
||||
function get_state() = state
|
||||
entrypoint get_state() = state
|
||||
|
||||
|
||||
@@ -8,7 +8,7 @@ contract VotingType =
|
||||
function delegate : address => unit
|
||||
function vote : int => unit
|
||||
function winnerName : unit => string
|
||||
function currentTally : unit => list((string, int))
|
||||
function currentTally : unit => list(string * int)
|
||||
|
||||
/* Contract implementation */
|
||||
contract Voting =
|
||||
|
||||
Reference in New Issue
Block a user