integrating the existing state of TON Storage / TON Payments / CPS Fift development branches

crypto/func/test/a12.fc

@@ -0,0 +1,4 @@
+_ f(int a, int b, int c, int d, int e, int f, int g, int h, int i, int j, int k, int l, int m, int n, int o) {
+  return (a, i, o, j, e, f, g, h, k, l, m, d, b, c, n);
+  ;; optimal code is 6-byte: s11 s12 XCHG2  2 5 BLKSWAP  s13 s13 s11 XCHG3
+}

crypto/func/test/a12_1.fc

@@ -0,0 +1,3 @@
+_ f(int a, int b, int c, int d, int e, int f, int g, int h, int i, int j) {
+  return (f, j, a, b, i, g, d, e, h, c);
+}

crypto/func/test/a12_2.fc

@@ -0,0 +1,3 @@
+_ f(int a, int b, int c, int d, int e, int f, int g, int h, int i, int j) {
+  return (f, d, j, a, i, g, b, e, h, c);
+}

crypto/func/test/a12_3.fc

@@ -0,0 +1,3 @@
+_ f(int a, int b, int c, int d, int e, int f, int g, int h, int i, int j, int k) {
+  return (e, h, d, a, c, g, f, b, i, j, k);   ;; optimal code is 4 ops, 8 bytes
+}

crypto/func/test/a12_4.fc

@@ -0,0 +1,3 @@
+_ f(int a, int b, int c, int d, int e, int f, int g, int h, int i, int j, int k) {
+  return (b, a, c, e, g, d, f, k, i, j, h);   ;; optimal code is 4 ops, 8 bytes
+}

crypto/func/test/a12_5.fc

@@ -0,0 +1,3 @@
+_ f(int a, int b, int c, int d, int e, int f, int g, int h, int i, int j, int k) {
+  return (c, g, d, k, a, f, e, h, i, j, b);   ;; optimal code is 6 ops, 6 bytes
+}

crypto/func/test/a12_6.fc

@@ -0,0 +1,3 @@
+_ f(int a, int b, int c, int d, int e, int f, int g, int h, int i, int j, int k) {
+  return (h, e, d, j, k, f, i, a, b, c, g);   ;; optimal code is 3 ops, 6 bytes
+}

crypto/func/test/a12_7.fc

@@ -0,0 +1,4 @@
+_ f(int a, int b, int c, int d, int e, int f, int g, int h, int i, int j, int k, int l, int m, int n, int o, int p) {
+  return (m, f, l, j, b, e, a, d, p, k, c, n, g, i, h, o);   ;; optimal code is 6 ops, 11 bytes
+  ;; s12 s0 s14 XCHG3  s0 s5 XCHG  6 8 BLKSWAP  s3 s3 s9 XCHG3  s10 s14 s15 XCHG3  s13 s9 s9 XCHG3
+}