mirror of
https://github.com/ton-blockchain/ton
synced 2025-03-09 15:40:10 +00:00
1389ff6789
In FunC (and in Tolk before), the assignment > lhs = rhs evaluation order (at IR level) was "rhs first, lhs second". In practice, this did not matter, because lhs could only be a primitive: > (v1, v2) = getValue() Left side of assignment actually has no "evaluation". Since Tolk implemented indexed access, there could be > getTensor().0 = getValue() or (in the future) > getObject().field = getValue() where evaluation order becomes significant. Now evaluation order will be to "lhs first, rhs second" (more expected from user's point of view), which will become significant when building control flow graph.
151 lines
4.5 KiB
Text
151 lines
4.5 KiB
Text
fun unsafe_tuple<X>(x: X): tuple
|
|
asm "NOP";
|
|
|
|
fun inc(x: int, y: int): (int, int) {
|
|
return (x + y, y * 10);
|
|
}
|
|
fun `~inc`(mutate self: int, y: int): int {
|
|
val (newX, newY) = inc(self, y);
|
|
self = newX;
|
|
return newY;
|
|
}
|
|
|
|
fun eq<X>(v: X): X { return v; }
|
|
fun eq2(v: (int, int)) { return v; }
|
|
fun mul2(mutate dest: int, v: int): int { dest = v*2; return dest; }
|
|
fun multens(mutate self: (int, int), v: (int, int)): (int, int) { var (f, s) = self; var (m1, m2) = v; self = (f*m1, s*m2); return self; }
|
|
|
|
@method_id(11)
|
|
fun test_return(x: int): (int, int, int, int, int, int, int) {
|
|
return (x, x.`~inc`(x / 20), x, x = x * 2, x, x += 1, x);
|
|
}
|
|
|
|
@method_id(12)
|
|
fun test_assign(x: int): (int, int, int, int, int, int, int) {
|
|
var (x1: int, x2: int, x3: int, x4: int, x5: int, x6: int, x7: int) = (x, x.`~inc`(x / 20), x, x=x*2, x, x+=1, x);
|
|
return (x1, x2, x3, x4, x5, x6, x7);
|
|
}
|
|
|
|
@method_id(13)
|
|
fun test_tuple(x: int): tuple {
|
|
var t: tuple = unsafe_tuple([x, x.`~inc`(x / 20), x, x = x * 2, x, x += 1, x]);
|
|
return t;
|
|
}
|
|
|
|
@method_id(14)
|
|
fun test_tuple_assign(x: int): (int, int, int, int, int, int, int) {
|
|
var [x1: int, x2: int, x3: int, x4: int, x5: int, x6: int, x7: int] = [x, x.`~inc`(x / 20), x, x = x * 2, x, x += 1, x];
|
|
return (x1, x2, x3, x4, x5, x6, x7);
|
|
}
|
|
|
|
fun foo1(x1: int, x2: int, x3: int, x4: int, x5: int, x6: int, x7: int): (int, int, int, int, int, int, int) {
|
|
return (x1, x2, x3, x4, x5, x6, x7);
|
|
}
|
|
|
|
@method_id(15)
|
|
fun test_call_1(x: int): (int, int, int, int, int, int, int) {
|
|
return foo1(x, x.`~inc`(x / 20), x, x = x * 2, x, x += 1, x);
|
|
}
|
|
|
|
fun foo2(x1: int, x2: int, x3456: (int, int, int, int), x7: int): (int, int, int, int, int, int, int) {
|
|
var (x3: int, x4: int, x5: int, x6: int) = x3456;
|
|
return (x1, x2, x3, x4, x5, x6, x7);
|
|
}
|
|
|
|
@method_id(16)
|
|
fun test_call_2(x: int): (int, int, int, int, int, int, int) {
|
|
return foo2(x, x.`~inc`(x / 20), (x, x = x * 2, x, x += 1), x);
|
|
}
|
|
|
|
fun asm_func(x1: int, x2: int, x3: int, x4: int, x5: int, x6: int, x7: int): (int, int, int, int, int, int, int)
|
|
asm (x4 x5 x6 x7 x1 x2 x3->0 1 2 3 4 5 6) "NOP";
|
|
|
|
@method_id(17)
|
|
fun test_call_asm_old(x: int): (int, int, int, int, int, int, int) {
|
|
return asm_func(x, x += 1, x, x, x.`~inc`(x / 20), x, x = x * 2);
|
|
}
|
|
|
|
@method_id(18)
|
|
fun test_call_asm_new(x: int): (int, int, int, int, int, int, int) {
|
|
return asm_func(x, x.`~inc`(x / 20), x, x = x * 2, x, x += 1, x);
|
|
}
|
|
|
|
global xx: int;
|
|
@method_id(19)
|
|
fun test_global(x: int) {
|
|
xx = x;
|
|
return (x, xx, xx.`~inc`(xx / 20), eq(xx += (x *= 0)), xx = xx * 2, xx, xx += 1, xx, x);
|
|
}
|
|
|
|
@method_id(20)
|
|
fun test_if_else(x: int): (int, int, int, int, int) {
|
|
if (x > 10) {
|
|
return (x.`~inc`(8), x + 1, x = 1, x <<= 3, x);
|
|
} else {
|
|
xx = 9;
|
|
return (x, x.`~inc`(-4), x.`~inc`(-1), (x >= 1) as int, x = x + xx);
|
|
}
|
|
}
|
|
|
|
@method_id(21)
|
|
fun test_assign_with_inner(x: int) {
|
|
var result = (x, x += 10, [x, x += 20, eq(x -= 50), x], eq2((x, x *= eq(x /= 2))));
|
|
return result;
|
|
}
|
|
|
|
@method_id(22)
|
|
fun test_assign_with_mutate(x: int) {
|
|
var (result, _) = ((x, mul2(mutate x, x += 5), x.`~inc`(mul2(mutate x, x)), x), 0);
|
|
return result;
|
|
}
|
|
|
|
@method_id(23)
|
|
fun test_assign_tensor(x: (int, int)) {
|
|
var fs = (0, 0);
|
|
return (x, x = (20, 30), fs = x.multens((1, 2)), fs.multens(multens(mutate x, (-1, -1))), x, fs);
|
|
}
|
|
|
|
global fs: (int, int);
|
|
@method_id(24)
|
|
fun test_assign_tensor_global(x: (int, int)) {
|
|
fs = (0, 0);
|
|
return (x, x = (20, 30), fs = x.multens((1, 2)), fs.multens(multens(mutate x, (-1, -1))), x, fs);
|
|
}
|
|
|
|
fun main() {
|
|
}
|
|
|
|
/**
|
|
method_id | in | out
|
|
@testcase | 11 | 100 | 100 50 105 210 210 211 211
|
|
@testcase | 12 | 100 | 100 50 105 210 210 211 211
|
|
@testcase | 13 | 100 | [ 100 50 105 210 210 211 211 ]
|
|
@testcase | 14 | 100 | 100 50 105 210 210 211 211
|
|
@testcase | 15 | 100 | 100 50 105 210 210 211 211
|
|
@testcase | 16 | 100 | 100 50 105 210 210 211 211
|
|
@testcase | 17 | 100 | 101 50 106 212 100 101 101
|
|
@testcase | 18 | 100 | 210 210 211 211 100 50 105
|
|
@testcase | 19 | 100 | 100 100 50 105 210 210 211 211 0
|
|
@testcase | 20 | 80 | 80 89 1 8 8
|
|
@testcase | 20 | 9 | 9 -40 -10 -1 13
|
|
@testcase | 21 | 100 | 100 110 [ 110 130 80 80 ] 80 3200
|
|
@testcase | 22 | 100 | 100 210 4200 630
|
|
@testcase | 23 | 1 1 | 1 1 20 30 20 60 -400 -3600 -20 -60 -400 -3600
|
|
@testcase | 24 | 1 1 | 1 1 20 30 20 60 -400 -3600 -20 -60 -400 -3600
|
|
|
|
@fif_codegen
|
|
"""
|
|
~inc PROC:<{
|
|
// self y
|
|
inc CALLDICT // self newY
|
|
}>
|
|
"""
|
|
|
|
@fif_codegen
|
|
"""
|
|
test_assign_tensor_global PROC:<{
|
|
// x.0 x.1
|
|
"""
|
|
|
|
@code_hash 61280273714870328160131559159866470128402169974050439159015534193532598351244
|
|
*/
|