1/*
2 * Copyright (c) 2022 Huawei Device Co., Ltd.
3 * Licensed under the Apache License, Version 2.0 (the "License");
4 * you may not use this file except in compliance with the License.
5 * You may obtain a copy of the License at
6 *
7 *     http://www.apache.org/licenses/LICENSE-2.0
8 *
9 * Unless required by applicable law or agreed to in writing, software
10 * distributed under the License is distributed on an "AS IS" BASIS,
11 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
12 * See the License for the specific language governing permissions and
13 * limitations under the License.
14 */
15
16/*
17 * @tc.name:stackoverflow
18 * @tc.desc:test stack overflow
19 * @tc.type: FUNC
20 * @tc.require: issueI5NO8G
21 */
22try {
23    var array = new Uint8Array(1000000);
24    var res = String.fromCharCode.apply(null, array);
25} catch (e) {
26    if ((e instanceof RangeError)) {
27        print("stack overflow!");
28    }
29}
30
31try {
32    var array = new Uint8Array(15000);
33    var res = String.fromCharCode.apply(null, array);
34    print(res.length);
35} catch (e) {
36    if ((e instanceof RangeError)) {
37        print("stack overflow!");
38    }
39}
40
41function runNearStackLimit(f) {
42    function t() {
43        try {
44            t();
45        } catch (e) {
46            f();
47        }
48    };
49    try {
50        t();
51    } catch (e) {
52    }
53}
54const v3 = new Proxy(Boolean, []);
55const v4 = v3.bind();
56function f5(a6, a7) {
57    4294967296n + v4;
58    return runNearStackLimit(f5);
59}
60f5();
61print("stack overflow success");