hardcode js run code in browser benchmark (#151)

* hardcode js run code * remove global variable in ts benchmark source --------- Signed-off-by: Su Yihan <[email protected]>
web-devkits · Mar 12, 2024 · 3a6af05 · 3a6af05
1 parent 8688156
commit 3a6af05
Show file tree

Hide file tree

Showing 38 changed files with 930 additions and 206 deletions.
diff --git a/.gitignore b/.gitignore
@@ -14,4 +14,6 @@ logs
 *.log
 *.swo
 example/app-framework/cmake-build/
-example/app-framework/out/
+example/app-framework/out/
+.vscode/
+tests/benchmark/compile_output/
diff --git a/tests/benchmark/any_basic_type_access.js b/tests/benchmark/any_basic_type_access.js
@@ -1,16 +1,14 @@
+"use strict";
 /*
  * Copyright (C) 2023 Intel Corporation.  All rights reserved.
  * SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
  */
 
-"use strict";
-
-var size = 1e6;
-var val = 0;
-var res = 0;
-const expect = 499998500001;
-
 function main() {
+    var size = 1e6;
+    var val = 0;
+    var res = 0;
+    var expect = 499998500001;
     for (var i = 0; i < size; i++) {
         res += val;
         val = i;
@@ -21,4 +19,4 @@ function main() {
     return res;
 }
 
-console.log(main());
+main()
diff --git a/tests/benchmark/any_basic_type_access.ts b/tests/benchmark/any_basic_type_access.ts
@@ -3,12 +3,11 @@
  * SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
  */
 
-const size = 1e6;
-let val: any = 0;
-let res = 0;
-const expect = 499998500001;
-
 export function main() {
+    const size = 1e6;
+    let val: any = 0;
+    let res = 0;
+    const expect = 499998500001;
     for (let i = 0; i < size; i++) {
         res += val;
         val = i;

diff --git a/tests/benchmark/any_complex_type_access.js b/tests/benchmark/any_complex_type_access.js
@@ -1,23 +1,22 @@
+"use strict";
 /*
  * Copyright (C) 2023 Intel Corporation.  All rights reserved.
  * SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
  */
 
-"use strict";
-
 var Foo = /** @class */ (function () {
     function Foo() {
         this.x = 0;
         this.y = false;
     }
     return Foo;
 }());
-var val = new Foo();
-val.z = 0;
-var size = 4e5;
-var res = 0;
-var expect = 159998800002;
 function main() {
+    var val = new Foo();
+    val.z = 0;
+    var size = 4e5;
+    var res = 0;
+    var expect = 159998800002;
     for (var i = 0; i < size; i++) {
         res += val.x;
         val.x = i;
@@ -29,4 +28,5 @@ function main() {
     }
     return res;
 }
-console.log(main());
+
+main()
diff --git a/tests/benchmark/any_complex_type_access.ts b/tests/benchmark/any_complex_type_access.ts
@@ -7,13 +7,13 @@ class Foo {
     x = 0;
     y = false;
 }
-const val: any = new Foo();
-val.z = 0;
-const size = 4e5;
-let res = 0;
-const expect = 159998800002;
 
 export function main() {
+    const val: any = new Foo();
+    val.z = 0;
+    const size = 4e5;
+    let res = 0;
+    const expect = 159998800002;
     for (let i = 0; i < size; i++) {
         res += val.x;
         val.x = i;

diff --git a/tests/benchmark/array_access.js b/tests/benchmark/array_access.js
@@ -1,24 +1,24 @@
+"use strict";
 /*
  * Copyright (C) 2023 Intel Corporation.  All rights reserved.
  * SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
  */
 
-"use strict";
-
-const size = 1e4;
-const arr = new Array(size);
-const expect = 49999995000000;
-let res = 0;
-
 function main() {
-    for (let i = 0, j = 0; i < 1e7; i++, j++) {
+    var size = 1e4;
+    var arr = new Array(size);
+    var expect = 49999995000000;
+    var res = 0;
+    for (var i = 0, j = 0; i < 1e7; i++, j++) {
         arr[j] = i;
         res += arr[j];
-        if (j >= size - 1) j = 0;
+        if (j >= size - 1)
+            j = 0;
     }
     if (res !== expect) {
         console.log('Validate result error in array access');
     }
     return res;
 }
-console.log(main());
+
+main()
diff --git a/tests/benchmark/array_access.ts b/tests/benchmark/array_access.ts
@@ -3,12 +3,12 @@
  * SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
  */
 
-const size = 1e4;
-const arr = new Array<number>(size);
-const expect = 49999995000000;
-let res = 0;
-
 export function main() {
+    const size = 1e4;
+    const arr = new Array<number>(size);
+    const expect = 49999995000000;
+    let res = 0;
+
     for (let i = 0, j = 0; i < 1e7; i++, j++) {
         arr[j] = i;
         res += arr[j];

diff --git a/tests/benchmark/array_access_i32.js b/tests/benchmark/array_access_i32.js
@@ -1,24 +1,24 @@
+"use strict";
 /*
  * Copyright (C) 2023 Intel Corporation.  All rights reserved.
  * SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
  */
 
-"use strict";
-
-const size = 1e4;
-const arr = new Array(size);
-const expect = 49999995000000;
-let res = 0;
-
 function main() {
-    for (let i = 0, j = 0; i < 1e7; i++, j++) {
+    var size = 1e4;
+    var arr = new Array(1e4);
+    var expect = 49999995000000;
+    var res = 0;
+    for (var i = 0, j = 0; i < 1e7; i++, j++) {
         arr[j] = i;
         res += arr[j];
-        if (j >= size - 1) j = 0;
+        if (j >= size - 1)
+            j = 0;
     }
     if (res !== expect) {
         console.log('Validate result error in array access (i32 index)');
     }
     return res;
 }
-console.log(main());
+
+main()
diff --git a/tests/benchmark/array_access_i32.ts b/tests/benchmark/array_access_i32.ts
@@ -3,12 +3,13 @@
  * SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
  */
 
-const size: i32 = 1e4;
-const arr = new Array<number>(1e4);
-const expect = 49999995000000;
-let res = 0;
+type i32 = number;
 
 export function main() {
+    const size: i32 = 1e4;
+    const arr = new Array<number>(1e4);
+    const expect = 49999995000000;
+    let res = 0;
     for (let i = 0, j: i32 = 0; i < 1e7; i++, j++) {
         arr[j] = i;
         res += arr[j];

diff --git a/tests/benchmark/binarytrees_class.js b/tests/benchmark/binarytrees_class.js
@@ -1,4 +1,3 @@
-/* This file is generated by tsc */
 "use strict";
 /* This file is modified base on:
  *  https://github.com/hanabi1224/Programming-Language-Benchmarks/blob/main/bench/algorithm/binarytrees/1.ts
@@ -29,6 +28,7 @@ function main() {
         // console.log(`${iterations} trees of depth ${depth} check: ${sum}`)
     }
 }
+
 function checksum(node) {
     if (!node) {
         return 1;
@@ -47,4 +47,5 @@ function createTree(depth) {
         return new Tree(null, null);
     }
 }
-main();
+
+main()
diff --git a/tests/benchmark/binarytrees_interface.js b/tests/benchmark/binarytrees_interface.js
@@ -1,8 +1,8 @@
-/* This file is generated by tsc */
 "use strict";
 /* This file is modified base on:
  *  https://github.com/hanabi1224/Programming-Language-Benchmarks/blob/main/bench/algorithm/binarytrees/1.ts
  */
+
 function main() {
     var maxDepth = Math.max(10, 0);
     var stretchDepth = maxDepth + 1;
@@ -19,6 +19,7 @@ function main() {
         //console.log(`${iterations} trees of depth ${depth} check: ${sum}`)
     }
 }
+
 function checksum(node) {
     if (!node) {
         return 1;
@@ -37,4 +38,5 @@ function createTree(depth) {
         return { left: null, right: null };
     }
 }
-main();
+
+main()
diff --git a/tests/benchmark/class_access.js b/tests/benchmark/class_access.js
@@ -1,10 +1,9 @@
+"use strict";
 /*
  * Copyright (C) 2023 Intel Corporation.  All rights reserved.
  * SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
  */
 
-"use strict";
-
 var Foo = /** @class */ (function () {
     function Foo(x) {
         this.x = x;
@@ -14,11 +13,11 @@ var Foo = /** @class */ (function () {
     };
     return Foo;
 }());
-var size = 1e7;
-var expect = 99999970000002;
-var res = 0;
-var f = new Foo(0);
 function main() {
+    var size = 1e7;
+    var expect = 99999970000002;
+    var res = 0;
+    var f = new Foo(0);
     for (var i = 0; i < size; i++) {
         res += f.x;
         res += f.bar();
@@ -30,4 +29,4 @@ function main() {
     return res;
 }
 
-console.log(main());
+main()
diff --git a/tests/benchmark/class_access.ts b/tests/benchmark/class_access.ts
@@ -13,12 +13,12 @@ class Foo {
     }
 }
 
-const size = 1e7;
-const expect = 99999970000002;
-let res = 0;
-const f = new Foo(0);
-
 export function main() {
+    const size = 1e7;
+    const expect = 99999970000002;
+    let res = 0;
+    const f = new Foo(0);
+
     for (let i = 0; i < size; i++) {
         res += f.x;
         res += f.bar();

diff --git a/tests/benchmark/class_allocation.js b/tests/benchmark/class_allocation.js
@@ -1,10 +1,9 @@
+"use strict";
 /*
  * Copyright (C) 2023 Intel Corporation.  All rights reserved.
  * SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
  */
 
-"use strict";
-
 var Foo = /** @class */ (function () {
     function Foo(x) {
         this.x = x;
@@ -14,15 +13,16 @@ var Foo = /** @class */ (function () {
     };
     return Foo;
 }());
-var size = 1e7;
-var len = 10;
-var arr = new Array(len);
 function main() {
+    var size = 1e7;
+    var len = 10;
+    var arr = new Array(len);
     for (var i = 0, j = 0; i < size; i++, j++) {
-        if (j >= len) j = 0;
+        if (j >= len)
+            j = 0;
         arr[j] = new Foo(i);
     }
     return arr;
 }
 
-console.log(main());
+main()
diff --git a/tests/benchmark/class_allocation.ts b/tests/benchmark/class_allocation.ts
@@ -13,11 +13,11 @@ class Foo {
     }
 }
 
-const size = 1e7;
-const len = 10;
-
-const arr = new Array<Foo>(len);
 export function main() {
+    const size = 1e7;
+    const len = 10;
+    const arr = new Array<Foo>(len);
+
     for (let i = 0, j = 0; i < size; i++, j++) {
         if (j >= len) j = 0;
         arr[j] = new Foo(i);