671 lines
91 KiB
JavaScript
671 lines
91 KiB
JavaScript
|
var getSign = function (nonce, url) {
|
||
|
|
var window = global;
|
||
|
|
window.document = {referrer: url}
|
||
|
|
window.location = {
|
||
|
|
href: url,
|
||
|
|
protocol: "https",
|
||
|
|
}
|
||
|
|
window.navigator = {
|
||
|
|
userAgent: "Mozilla/5.0 (Macintosh; Intel Mac OS X 10_15_7) AppleWebKit/537.36 (KHTML, like Gecko) Chrome/91.0.4472.77 Safari/537.36"
|
||
|
|
}
|
||
|
|
window._$jsvmprt = function (b, e, f) {
|
||
|
|
function a() {
|
||
|
|
if ("undefined" == typeof Reflect || !Reflect.construct)
|
||
|
|
return !1;
|
||
|
|
if (Reflect.construct.sham)
|
||
|
|
return !1;
|
||
|
|
if ("function" == typeof Proxy)
|
||
|
|
return !0;
|
||
|
|
try {
|
||
|
|
return Date.prototype.toString.call(Reflect.construct(Date, [], (function () {
|
||
|
|
}
|
||
|
|
))),
|
||
|
|
!0
|
||
|
|
} catch (b) {
|
||
|
|
return !1
|
||
|
|
}
|
||
|
|
}
|
||
|
|
|
||
|
|
function d(b, e, f) {
|
||
|
|
return (d = a() ? Reflect.construct : function (b, e, f) {
|
||
|
|
var a = [null];
|
||
|
|
a.push.apply(a, e);
|
||
|
|
var d = new (Function.bind.apply(b, a));
|
||
|
|
return f && c(d, f.prototype),
|
||
|
|
d
|
||
|
|
}
|
||
|
|
).apply(null, arguments)
|
||
|
|
}
|
||
|
|
|
||
|
|
function c(b, e) {
|
||
|
|
return (c = Object.setPrototypeOf || function (b, e) {
|
||
|
|
return b.__proto__ = e,
|
||
|
|
b
|
||
|
|
}
|
||
|
|
)(b, e)
|
||
|
|
}
|
||
|
|
|
||
|
|
function n(b) {
|
||
|
|
return function (b) {
|
||
|
|
if (Array.isArray(b)) {
|
||
|
|
for (var e = 0, f = new Array(b.length); e < b.length; e++)
|
||
|
|
f[e] = b[e];
|
||
|
|
return f
|
||
|
|
}
|
||
|
|
}(b) || function (b) {
|
||
|
|
if (Symbol.iterator in Object(b) || "[object Arguments]" === Object.prototype.toString.call(b))
|
||
|
|
return Array.from(b)
|
||
|
|
}(b) || function () {
|
||
|
|
throw new TypeError("Invalid attempt to spread non-iterable instance")
|
||
|
|
}()
|
||
|
|
}
|
||
|
|
|
||
|
|
for (var i = [], r = 0, t = [], o = 0, l = function (b, e) {
|
||
|
|
var f = b[e++]
|
||
|
|
, a = b[e]
|
||
|
|
, d = parseInt("" + f + a, 16);
|
||
|
|
if (d >> 7 == 0)
|
||
|
|
return [1, d];
|
||
|
|
if (d >> 6 == 2) {
|
||
|
|
var c = parseInt("" + b[++e] + b[++e], 16);
|
||
|
|
return d &= 63,
|
||
|
|
[2, c = (d <<= 8) + c]
|
||
|
|
}
|
||
|
|
if (d >> 6 == 3) {
|
||
|
|
var n = parseInt("" + b[++e] + b[++e], 16)
|
||
|
|
, i = parseInt("" + b[++e] + b[++e], 16);
|
||
|
|
return d &= 63,
|
||
|
|
[3, i = (d <<= 16) + (n <<= 8) + i]
|
||
|
|
}
|
||
|
|
}, u = function (b, e) {
|
||
|
|
var f = parseInt("" + b[e] + b[e + 1], 16);
|
||
|
|
return f = f > 127 ? -256 + f : f
|
||
|
|
}, s = function (b, e) {
|
||
|
|
var f = parseInt("" + b[e] + b[e + 1] + b[e + 2] + b[e + 3], 16);
|
||
|
|
return f = f > 32767 ? -65536 + f : f
|
||
|
|
}, p = function (b, e) {
|
||
|
|
var f = parseInt("" + b[e] + b[e + 1] + b[e + 2] + b[e + 3] + b[e + 4] + b[e + 5] + b[e + 6] + b[e + 7], 16);
|
||
|
|
return f = f > 2147483647 ? 0 + f : f
|
||
|
|
}, y = function (b, e) {
|
||
|
|
return parseInt("" + b[e] + b[e + 1], 16)
|
||
|
|
}, v = function (b, e) {
|
||
|
|
return parseInt("" + b[e] + b[e + 1] + b[e + 2] + b[e + 3], 16)
|
||
|
|
}, g = g || this || window, h = Object.keys || function (b) {
|
||
|
|
var e = {}
|
||
|
|
, f = 0;
|
||
|
|
for (var a in b)
|
||
|
|
e[f++] = a;
|
||
|
|
return e.length = f,
|
||
|
|
e
|
||
|
|
}
|
||
|
|
, m = (b.length,
|
||
|
|
0), I = "", C = m; C < m + 16; C++) {
|
||
|
|
var q = "" + b[C++] + b[C];
|
||
|
|
q = parseInt(q, 16),
|
||
|
|
I += String.fromCharCode(q)
|
||
|
|
}
|
||
|
|
if ("HNOJ@?RC" != I)
|
||
|
|
throw new Error("error magic number " + I);
|
||
|
|
m += 16;
|
||
|
|
parseInt("" + b[m] + b[m + 1], 16);
|
||
|
|
m += 8,
|
||
|
|
r = 0;
|
||
|
|
for (var w = 0; w < 4; w++) {
|
||
|
|
var S = m + 2 * w
|
||
|
|
, R = "" + b[S++] + b[S]
|
||
|
|
, x = parseInt(R, 16);
|
||
|
|
r += (3 & x) << 2 * w
|
||
|
|
}
|
||
|
|
m += 16,
|
||
|
|
m += 8;
|
||
|
|
var z = parseInt("" + b[m] + b[m + 1] + b[m + 2] + b[m + 3] + b[m + 4] + b[m + 5] + b[m + 6] + b[m + 7], 16)
|
||
|
|
, O = z
|
||
|
|
, E = m += 8
|
||
|
|
, j = v(b, m += z);
|
||
|
|
j[1];
|
||
|
|
m += 4,
|
||
|
|
i = {
|
||
|
|
p: [],
|
||
|
|
q: []
|
||
|
|
};
|
||
|
|
for (var A = 0; A < j; A++) {
|
||
|
|
for (var D = l(b, m), T = m += 2 * D[0], $ = i.p.length, P = 0; P < D[1]; P++) {
|
||
|
|
var U = l(b, T);
|
||
|
|
i.p.push(U[1]),
|
||
|
|
T += 2 * U[0]
|
||
|
|
}
|
||
|
|
m = T,
|
||
|
|
i.q.push([$, i.p.length])
|
||
|
|
}
|
||
|
|
var _ = {
|
||
|
|
5: 1,
|
||
|
|
6: 1,
|
||
|
|
70: 1,
|
||
|
|
22: 1,
|
||
|
|
23: 1,
|
||
|
|
37: 1,
|
||
|
|
73: 1
|
||
|
|
}
|
||
|
|
, k = {
|
||
|
|
72: 1
|
||
|
|
}
|
||
|
|
, M = {
|
||
|
|
74: 1
|
||
|
|
}
|
||
|
|
, H = {
|
||
|
|
11: 1,
|
||
|
|
12: 1,
|
||
|
|
24: 1,
|
||
|
|
26: 1,
|
||
|
|
27: 1,
|
||
|
|
31: 1
|
||
|
|
}
|
||
|
|
, J = {
|
||
|
|
10: 1
|
||
|
|
}
|
||
|
|
, N = {
|
||
|
|
2: 1,
|
||
|
|
29: 1,
|
||
|
|
30: 1,
|
||
|
|
20: 1
|
||
|
|
}
|
||
|
|
, B = []
|
||
|
|
, W = [];
|
||
|
|
|
||
|
|
function F(b, e, f) {
|
||
|
|
for (var a = e; a < e + f;) {
|
||
|
|
var d = y(b, a);
|
||
|
|
B[a] = d,
|
||
|
|
a += 2;
|
||
|
|
k[d] ? (W[a] = u(b, a),
|
||
|
|
a += 2) : _[d] ? (W[a] = s(b, a),
|
||
|
|
a += 4) : M[d] ? (W[a] = p(b, a),
|
||
|
|
a += 8) : H[d] ? (W[a] = y(b, a),
|
||
|
|
a += 2) : J[d] ? (W[a] = v(b, a),
|
||
|
|
a += 4) : N[d] && (W[a] = v(b, a),
|
||
|
|
a += 4)
|
||
|
|
}
|
||
|
|
}
|
||
|
|
|
||
|
|
return K(b, E, O / 2, [], e, f);
|
||
|
|
|
||
|
|
function G(b, e, f, a, c, l, m, I) {
|
||
|
|
null == l && (l = this);
|
||
|
|
var C, q, w, S = [], R = 0;
|
||
|
|
m && (C = m);
|
||
|
|
var x, z, O = e, E = O + 2 * f;
|
||
|
|
if (!I)
|
||
|
|
for (; O < E;) {
|
||
|
|
var j = parseInt("" + b[O] + b[O + 1], 16);
|
||
|
|
O += 2;
|
||
|
|
var A = 3 & (x = 13 * j % 241);
|
||
|
|
if (x >>= 2,
|
||
|
|
A < 1) {
|
||
|
|
A = 3 & x;
|
||
|
|
if (x >>= 2,
|
||
|
|
A > 2)
|
||
|
|
(A = x) > 10 ? S[++R] = void 0 : A > 1 ? (C = S[R--],
|
||
|
|
S[R] = S[R] >= C) : A > -1 && (S[++R] = null);
|
||
|
|
else if (A > 1) {
|
||
|
|
if ((A = x) > 11)
|
||
|
|
throw S[R--];
|
||
|
|
if (A > 7) {
|
||
|
|
for (C = S[R--],
|
||
|
|
z = v(b, O),
|
||
|
|
A = "",
|
||
|
|
P = i.q[z][0]; P < i.q[z][1]; P++)
|
||
|
|
A += String.fromCharCode(r ^ i.p[P]);
|
||
|
|
O += 4,
|
||
|
|
S[R--][A] = C
|
||
|
|
} else
|
||
|
|
A > 5 && (S[R] = h(S[R]))
|
||
|
|
} else if (A > 0) {
|
||
|
|
(A = x) > 8 ? (C = S[R--],
|
||
|
|
S[R] = typeof C) : A > 6 ? S[R] = --S[R] : A > 4 ? S[R -= 1] = S[R][S[R + 1]] : A > 2 && (q = S[R--],
|
||
|
|
(A = S[R]).x === G ? A.y >= 1 ? S[R] = K(b, A.c, A.l, [q], A.z, w, null, 1) : (S[R] = K(b, A.c, A.l, [q], A.z, w, null, 0),
|
||
|
|
A.y++) : S[R] = A(q))
|
||
|
|
} else {
|
||
|
|
if ((A = x) > 14)
|
||
|
|
z = s(b, O),
|
||
|
|
(U = function e() {
|
||
|
|
var f = arguments;
|
||
|
|
return e.y > 0 ? K(b, e.c, e.l, f, e.z, this, null, 0) : (e.y++,
|
||
|
|
K(b, e.c, e.l, f, e.z, this, null, 0))
|
||
|
|
}
|
||
|
|
).c = O + 4,
|
||
|
|
U.l = z - 2,
|
||
|
|
U.x = G,
|
||
|
|
U.y = 0,
|
||
|
|
U.z = c,
|
||
|
|
S[R] = U,
|
||
|
|
O += 2 * z - 2;
|
||
|
|
else if (A > 12)
|
||
|
|
q = S[R--],
|
||
|
|
w = S[R--],
|
||
|
|
(A = S[R--]).x === G ? A.y >= 1 ? S[++R] = K(b, A.c, A.l, q, A.z, w, null, 1) : (S[++R] = K(b, A.c, A.l, q, A.z, w, null, 0),
|
||
|
|
A.y++) : S[++R] = A.apply(w, q);
|
||
|
|
else if (A > 5)
|
||
|
|
C = S[R--],
|
||
|
|
S[R] = S[R] != C;
|
||
|
|
else if (A > 3)
|
||
|
|
C = S[R--],
|
||
|
|
S[R] = S[R] * C;
|
||
|
|
else if (A > -1)
|
||
|
|
return [1, S[R--]]
|
||
|
|
}
|
||
|
|
} else if (A < 2) {
|
||
|
|
A = 3 & x;
|
||
|
|
if (x >>= 2,
|
||
|
|
A < 1) {
|
||
|
|
if ((A = x) > 9)
|
||
|
|
;
|
||
|
|
else if (A > 7)
|
||
|
|
C = S[R--],
|
||
|
|
S[R] = S[R] & C;
|
||
|
|
else if (A > 5)
|
||
|
|
z = y(b, O),
|
||
|
|
O += 2,
|
||
|
|
S[R -= z] = 0 === z ? new S[R] : d(S[R], n(S.slice(R + 1, R + z + 1)));
|
||
|
|
else if (A > 3) {
|
||
|
|
z = s(b, O);
|
||
|
|
try {
|
||
|
|
if (t[o][2] = 1,
|
||
|
|
1 == (C = G(b, O + 4, z - 3, [], c, l, null, 0))[0])
|
||
|
|
return C
|
||
|
|
} catch (m) {
|
||
|
|
if (t[o] && t[o][1] && 1 == (C = G(b, t[o][1][0], t[o][1][1], [], c, l, m, 0))[0])
|
||
|
|
return C
|
||
|
|
} finally {
|
||
|
|
if (t[o] && t[o][0] && 1 == (C = G(b, t[o][0][0], t[o][0][1], [], c, l, null, 0))[0])
|
||
|
|
return C;
|
||
|
|
t[o] = 0,
|
||
|
|
o--
|
||
|
|
}
|
||
|
|
O += 2 * z - 2
|
||
|
|
}
|
||
|
|
} else if (A < 2) {
|
||
|
|
if ((A = x) > 12)
|
||
|
|
S[++R] = u(b, O),
|
||
|
|
O += 2;
|
||
|
|
else if (A > 10)
|
||
|
|
C = S[R--],
|
||
|
|
S[R] = S[R] << C;
|
||
|
|
else if (A > 8) {
|
||
|
|
for (z = v(b, O),
|
||
|
|
A = "",
|
||
|
|
P = i.q[z][0]; P < i.q[z][1]; P++)
|
||
|
|
A += String.fromCharCode(r ^ i.p[P]);
|
||
|
|
O += 4,
|
||
|
|
S[R] = S[R][A]
|
||
|
|
} else
|
||
|
|
A > 6 && (q = S[R--],
|
||
|
|
C = delete S[R--][q])
|
||
|
|
} else if (A < 3) {
|
||
|
|
(A = x) < 2 ? S[++R] = C : A < 4 ? (C = S[R--],
|
||
|
|
S[R] = S[R] <= C) : A < 11 ? (C = S[R -= 2][S[R + 1]] = S[R + 2],
|
||
|
|
R--) : A < 13 && (C = S[R],
|
||
|
|
S[++R] = C)
|
||
|
|
} else {
|
||
|
|
if ((A = x) > 12)
|
||
|
|
S[++R] = l;
|
||
|
|
else if (A > 5)
|
||
|
|
C = S[R--],
|
||
|
|
S[R] = S[R] !== C;
|
||
|
|
else if (A > 3)
|
||
|
|
C = S[R--],
|
||
|
|
S[R] = S[R] / C;
|
||
|
|
else if (A > 1) {
|
||
|
|
if ((z = s(b, O)) < 0) {
|
||
|
|
I = 1,
|
||
|
|
F(b, e, 2 * f),
|
||
|
|
O += 2 * z - 2;
|
||
|
|
break
|
||
|
|
}
|
||
|
|
O += 2 * z - 2
|
||
|
|
} else
|
||
|
|
A > -1 && (S[R] = !S[R])
|
||
|
|
}
|
||
|
|
} else if (A < 3) {
|
||
|
|
A = 3 & x;
|
||
|
|
if (x >>= 2,
|
||
|
|
A > 2)
|
||
|
|
(A = x) > 7 ? (C = S[R--],
|
||
|
|
S[R] = S[R] | C) : A > 5 ? (z = y(b, O),
|
||
|
|
O += 2,
|
||
|
|
S[++R] = c["$" + z]) : A > 3 && (z = s(b, O),
|
||
|
|
t[o][0] && !t[o][2] ? t[o][1] = [O + 4, z - 3] : t[o++] = [0, [O + 4, z - 3], 0],
|
||
|
|
O += 2 * z - 2);
|
||
|
|
else if (A > 1) {
|
||
|
|
if ((A = x) < 2) {
|
||
|
|
for (z = v(b, O),
|
||
|
|
C = "",
|
||
|
|
P = i.q[z][0]; P < i.q[z][1]; P++)
|
||
|
|
C += String.fromCharCode(r ^ i.p[P]);
|
||
|
|
S[++R] = C,
|
||
|
|
O += 4
|
||
|
|
} else if (A < 4)
|
||
|
|
if (S[R--])
|
||
|
|
O += 4;
|
||
|
|
else {
|
||
|
|
if ((z = s(b, O)) < 0) {
|
||
|
|
I = 1,
|
||
|
|
F(b, e, 2 * f),
|
||
|
|
O += 2 * z - 2;
|
||
|
|
break
|
||
|
|
}
|
||
|
|
O += 2 * z - 2
|
||
|
|
}
|
||
|
|
else
|
||
|
|
A < 6 ? (C = S[R--],
|
||
|
|
S[R] = S[R] % C) : A < 8 ? (C = S[R--],
|
||
|
|
S[R] = S[R] instanceof C) : A < 15 && (S[++R] = !1)
|
||
|
|
} else if (A > 0) {
|
||
|
|
(A = x) < 1 ? S[++R] = g : A < 3 ? (C = S[R--],
|
||
|
|
S[R] = S[R] + C) : A < 5 ? (C = S[R--],
|
||
|
|
S[R] = S[R] == C) : A < 14 && (C = S[R - 1],
|
||
|
|
q = S[R],
|
||
|
|
S[++R] = C,
|
||
|
|
S[++R] = q)
|
||
|
|
} else {
|
||
|
|
(A = x) < 2 ? (C = S[R--],
|
||
|
|
S[R] = S[R] > C) : A < 9 ? (z = v(b, O),
|
||
|
|
O += 4,
|
||
|
|
q = R + 1,
|
||
|
|
S[R -= z - 1] = z ? S.slice(R, q) : []) : A < 11 ? (z = y(b, O),
|
||
|
|
O += 2,
|
||
|
|
C = S[R--],
|
||
|
|
c[z] = C) : A < 13 ? (C = S[R--],
|
||
|
|
S[R] = S[R] >> C) : A < 15 && (S[++R] = s(b, O),
|
||
|
|
O += 4)
|
||
|
|
}
|
||
|
|
} else {
|
||
|
|
A = 3 & x;
|
||
|
|
if (x >>= 2,
|
||
|
|
A > 2)
|
||
|
|
(A = x) > 13 ? (S[++R] = p(b, O),
|
||
|
|
O += 8) : A > 11 ? (C = S[R--],
|
||
|
|
S[R] = S[R] >>> C) : A > 9 ? S[++R] = !0 : A > 7 ? (z = y(b, O),
|
||
|
|
O += 2,
|
||
|
|
S[R] = S[R][z]) : A > 0 && (C = S[R--],
|
||
|
|
S[R] = S[R] < C);
|
||
|
|
else if (A > 1) {
|
||
|
|
(A = x) > 10 ? (z = s(b, O),
|
||
|
|
t[++o] = [[O + 4, z - 3], 0, 0],
|
||
|
|
O += 2 * z - 2) : A > 8 ? (C = S[R--],
|
||
|
|
S[R] = S[R] ^ C) : A > 6 && (C = S[R--])
|
||
|
|
} else if (A > 0) {
|
||
|
|
if ((A = x) < 3) {
|
||
|
|
var D = 0
|
||
|
|
, T = S[R].length
|
||
|
|
, $ = S[R];
|
||
|
|
S[++R] = function () {
|
||
|
|
var b = D < T;
|
||
|
|
if (b) {
|
||
|
|
var e = $[D++];
|
||
|
|
S[++R] = e
|
||
|
|
}
|
||
|
|
S[++R] = b
|
||
|
|
}
|
||
|
|
} else
|
||
|
|
A < 5 ? (z = y(b, O),
|
||
|
|
O += 2,
|
||
|
|
C = c[z],
|
||
|
|
S[++R] = C) : A < 7 ? S[R] = ++S[R] : A < 9 && (C = S[R--],
|
||
|
|
S[R] = S[R] in C)
|
||
|
|
} else {
|
||
|
|
if ((A = x) > 13)
|
||
|
|
C = S[R],
|
||
|
|
S[R] = S[R - 1],
|
||
|
|
S[R - 1] = C;
|
||
|
|
else if (A > 4)
|
||
|
|
C = S[R--],
|
||
|
|
S[R] = S[R] === C;
|
||
|
|
else if (A > 2)
|
||
|
|
C = S[R--],
|
||
|
|
S[R] = S[R] - C;
|
||
|
|
else if (A > 0) {
|
||
|
|
for (z = v(b, O),
|
||
|
|
A = "",
|
||
|
|
P = i.q[z][0]; P < i.q[z][1]; P++)
|
||
|
|
A += String.fromCharCode(r ^ i.p[P]);
|
||
|
|
A = +A,
|
||
|
|
O += 4,
|
||
|
|
S[++R] = A
|
||
|
|
}
|
||
|
|
}
|
||
|
|
}
|
||
|
|
}
|
||
|
|
if (I)
|
||
|
|
for (; O < E;) {
|
||
|
|
j = B[O];
|
||
|
|
O += 2;
|
||
|
|
A = 3 & (x = 13 * j % 241);
|
||
|
|
if (x >>= 2,
|
||
|
|
A < 1) {
|
||
|
|
var U;
|
||
|
|
A = 3 & x;
|
||
|
|
if (x >>= 2,
|
||
|
|
A < 1) {
|
||
|
|
if ((A = x) > 14)
|
||
|
|
z = W[O],
|
||
|
|
(U = function e() {
|
||
|
|
var f = arguments;
|
||
|
|
return e.y > 0 ? K(b, e.c, e.l, f, e.z, this, null, 0) : (e.y++,
|
||
|
|
K(b, e.c, e.l, f, e.z, this, null, 0))
|
||
|
|
}
|
||
|
|
).c = O + 4,
|
||
|
|
U.l = z - 2,
|
||
|
|
U.x = G,
|
||
|
|
U.y = 0,
|
||
|
|
U.z = c,
|
||
|
|
S[R] = U,
|
||
|
|
O += 2 * z - 2;
|
||
|
|
else if (A > 12)
|
||
|
|
q = S[R--],
|
||
|
|
w = S[R--],
|
||
|
|
(A = S[R--]).x === G ? A.y >= 1 ? S[++R] = K(b, A.c, A.l, q, A.z, w, null, 1) : (S[++R] = K(b, A.c, A.l, q, A.z, w, null, 0),
|
||
|
|
A.y++) : S[++R] = A.apply(w, q);
|
||
|
|
else if (A > 5)
|
||
|
|
C = S[R--],
|
||
|
|
S[R] = S[R] != C;
|
||
|
|
else if (A > 3)
|
||
|
|
C = S[R--],
|
||
|
|
S[R] = S[R] * C;
|
||
|
|
else if (A > -1)
|
||
|
|
return [1, S[R--]]
|
||
|
|
} else if (A < 2) {
|
||
|
|
(A = x) < 4 ? (q = S[R--],
|
||
|
|
(A = S[R]).x === G ? A.y >= 1 ? S[R] = K(b, A.c, A.l, [q], A.z, w, null, 1) : (S[R] = K(b, A.c, A.l, [q], A.z, w, null, 0),
|
||
|
|
A.y++) : S[R] = A(q)) : A < 6 ? S[R -= 1] = S[R][S[R + 1]] : A < 8 ? S[R] = --S[R] : A < 10 && (C = S[R--],
|
||
|
|
S[R] = typeof C)
|
||
|
|
} else if (A < 3) {
|
||
|
|
if ((A = x) > 11)
|
||
|
|
throw S[R--];
|
||
|
|
if (A > 7) {
|
||
|
|
for (C = S[R--],
|
||
|
|
z = W[O],
|
||
|
|
A = "",
|
||
|
|
P = i.q[z][0]; P < i.q[z][1]; P++)
|
||
|
|
A += String.fromCharCode(r ^ i.p[P]);
|
||
|
|
O += 4,
|
||
|
|
S[R--][A] = C
|
||
|
|
} else
|
||
|
|
A > 5 && (S[R] = h(S[R]))
|
||
|
|
} else {
|
||
|
|
(A = x) < 1 ? S[++R] = null : A < 3 ? (C = S[R--],
|
||
|
|
S[R] = S[R] >= C) : A < 12 && (S[++R] = void 0)
|
||
|
|
}
|
||
|
|
} else if (A < 2) {
|
||
|
|
A = 3 & x;
|
||
|
|
if (x >>= 2,
|
||
|
|
A > 2)
|
||
|
|
(A = x) > 12 ? S[++R] = l : A > 5 ? (C = S[R--],
|
||
|
|
S[R] = S[R] !== C) : A > 3 ? (C = S[R--],
|
||
|
|
S[R] = S[R] / C) : A > 1 ? O += 2 * (z = W[O]) - 2 : A > -1 && (S[R] = !S[R]);
|
||
|
|
else if (A > 1) {
|
||
|
|
(A = x) < 2 ? S[++R] = C : A < 4 ? (C = S[R--],
|
||
|
|
S[R] = S[R] <= C) : A < 11 ? (C = S[R -= 2][S[R + 1]] = S[R + 2],
|
||
|
|
R--) : A < 13 && (C = S[R],
|
||
|
|
S[++R] = C)
|
||
|
|
} else if (A > 0) {
|
||
|
|
if ((A = x) < 8)
|
||
|
|
q = S[R--],
|
||
|
|
C = delete S[R--][q];
|
||
|
|
else if (A < 10) {
|
||
|
|
for (z = W[O],
|
||
|
|
A = "",
|
||
|
|
P = i.q[z][0]; P < i.q[z][1]; P++)
|
||
|
|
A += String.fromCharCode(r ^ i.p[P]);
|
||
|
|
O += 4,
|
||
|
|
S[R] = S[R][A]
|
||
|
|
} else
|
||
|
|
A < 12 ? (C = S[R--],
|
||
|
|
S[R] = S[R] << C) : A < 14 && (S[++R] = W[O],
|
||
|
|
O += 2)
|
||
|
|
} else {
|
||
|
|
if ((A = x) < 5) {
|
||
|
|
z = W[O];
|
||
|
|
try {
|
||
|
|
if (t[o][2] = 1,
|
||
|
|
1 == (C = G(b, O + 4, z - 3, [], c, l, null, 0))[0])
|
||
|
|
return C
|
||
|
|
} catch (m) {
|
||
|
|
if (t[o] && t[o][1] && 1 == (C = G(b, t[o][1][0], t[o][1][1], [], c, l, m, 0))[0])
|
||
|
|
return C
|
||
|
|
} finally {
|
||
|
|
if (t[o] && t[o][0] && 1 == (C = G(b, t[o][0][0], t[o][0][1], [], c, l, null, 0))[0])
|
||
|
|
return C;
|
||
|
|
t[o] = 0,
|
||
|
|
o--
|
||
|
|
}
|
||
|
|
O += 2 * z - 2
|
||
|
|
} else
|
||
|
|
A < 7 ? (z = W[O],
|
||
|
|
O += 2,
|
||
|
|
S[R -= z] = 0 === z ? new S[R] : d(S[R], n(S.slice(R + 1, R + z + 1)))) : A < 9 && (C = S[R--],
|
||
|
|
S[R] = S[R] & C)
|
||
|
|
}
|
||
|
|
} else if (A < 3) {
|
||
|
|
A = 3 & x;
|
||
|
|
if (x >>= 2,
|
||
|
|
A < 1)
|
||
|
|
(A = x) < 2 ? (C = S[R--],
|
||
|
|
S[R] = S[R] > C) : A < 9 ? (z = W[O],
|
||
|
|
O += 4,
|
||
|
|
q = R + 1,
|
||
|
|
S[R -= z - 1] = z ? S.slice(R, q) : []) : A < 11 ? (z = W[O],
|
||
|
|
O += 2,
|
||
|
|
C = S[R--],
|
||
|
|
c[z] = C) : A < 13 ? (C = S[R--],
|
||
|
|
S[R] = S[R] >> C) : A < 15 && (S[++R] = W[O],
|
||
|
|
O += 4);
|
||
|
|
else if (A < 2) {
|
||
|
|
(A = x) < 1 ? S[++R] = g : A < 3 ? (C = S[R--],
|
||
|
|
S[R] = S[R] + C) : A < 5 ? (C = S[R--],
|
||
|
|
S[R] = S[R] == C) : A < 14 && (C = S[R - 1],
|
||
|
|
q = S[R],
|
||
|
|
S[++R] = C,
|
||
|
|
S[++R] = q)
|
||
|
|
} else if (A < 3) {
|
||
|
|
if ((A = x) < 2) {
|
||
|
|
for (z = W[O],
|
||
|
|
C = "",
|
||
|
|
P = i.q[z][0]; P < i.q[z][1]; P++)
|
||
|
|
C += String.fromCharCode(r ^ i.p[P]);
|
||
|
|
S[++R] = C,
|
||
|
|
O += 4
|
||
|
|
} else
|
||
|
|
A < 4 ? S[R--] ? O += 4 : O += 2 * (z = W[O]) - 2 : A < 6 ? (C = S[R--],
|
||
|
|
S[R] = S[R] % C) : A < 8 ? (C = S[R--],
|
||
|
|
S[R] = S[R] instanceof C) : A < 15 && (S[++R] = !1)
|
||
|
|
} else {
|
||
|
|
(A = x) > 7 ? (C = S[R--],
|
||
|
|
S[R] = S[R] | C) : A > 5 ? (z = W[O],
|
||
|
|
O += 2,
|
||
|
|
S[++R] = c["$" + z]) : A > 3 && (z = W[O],
|
||
|
|
t[o][0] && !t[o][2] ? t[o][1] = [O + 4, z - 3] : t[o++] = [0, [O + 4, z - 3], 0],
|
||
|
|
O += 2 * z - 2)
|
||
|
|
}
|
||
|
|
} else {
|
||
|
|
A = 3 & x;
|
||
|
|
if (x >>= 2,
|
||
|
|
A > 2)
|
||
|
|
(A = x) > 13 ? (S[++R] = W[O],
|
||
|
|
O += 8) : A > 11 ? (C = S[R--],
|
||
|
|
S[R] = S[R] >>> C) : A > 9 ? S[++R] = !0 : A > 7 ? (z = W[O],
|
||
|
|
O += 2,
|
||
|
|
S[R] = S[R][z]) : A > 0 && (C = S[R--],
|
||
|
|
S[R] = S[R] < C);
|
||
|
|
else if (A > 1) {
|
||
|
|
(A = x) > 10 ? (z = W[O],
|
||
|
|
t[++o] = [[O + 4, z - 3], 0, 0],
|
||
|
|
O += 2 * z - 2) : A > 8 ? (C = S[R--],
|
||
|
|
S[R] = S[R] ^ C) : A > 6 && (C = S[R--])
|
||
|
|
} else if (A > 0) {
|
||
|
|
if ((A = x) > 7)
|
||
|
|
C = S[R--],
|
||
|
|
S[R] = S[R] in C;
|
||
|
|
else if (A > 5)
|
||
|
|
S[R] = ++S[R];
|
||
|
|
else if (A > 3)
|
||
|
|
z = W[O],
|
||
|
|
O += 2,
|
||
|
|
C = c[z],
|
||
|
|
S[++R] = C;
|
||
|
|
else if (A > 1) {
|
||
|
|
D = 0,
|
||
|
|
T = S[R].length,
|
||
|
|
$ = S[R];
|
||
|
|
S[++R] = function () {
|
||
|
|
var b = D < T;
|
||
|
|
if (b) {
|
||
|
|
var e = $[D++];
|
||
|
|
S[++R] = e
|
||
|
|
}
|
||
|
|
S[++R] = b
|
||
|
|
}
|
||
|
|
}
|
||
|
|
} else {
|
||
|
|
if ((A = x) < 2) {
|
||
|
|
for (z = W[O],
|
||
|
|
A = "",
|
||
|
|
P = i.q[z][0]; P < i.q[z][1]; P++)
|
||
|
|
A += String.fromCharCode(r ^ i.p[P]);
|
||
|
|
A = +A,
|
||
|
|
O += 4,
|
||
|
|
S[++R] = A
|
||
|
|
} else
|
||
|
|
A < 4 ? (C = S[R--],
|
||
|
|
S[R] = S[R] - C) : A < 6 ? (C = S[R--],
|
||
|
|
S[R] = S[R] === C) : A < 15 && (C = S[R],
|
||
|
|
S[R] = S[R - 1],
|
||
|
|
S[R - 1] = C)
|
||
|
|
}
|
||
|
|
}
|
||
|
|
}
|
||
|
|
return [0, null]
|
||
|
|
}
|
||
|
|
|
||
|
|
function K(b, e, f, a, d, c, n, i) {
|
||
|
|
var r, t;
|
||
|
|
null == c && (c = this),
|
||
|
|
d && !d.d && (d.d = 0,
|
||
|
|
d.$0 = d,
|
||
|
|
d[1] = {});
|
||
|
|
var o = {}
|
||
|
|
, l = o.d = d ? d.d + 1 : 0;
|
||
|
|
for (o["$" + l] = o,
|
||
|
|
t = 0; t < l; t++)
|
||
|
|
o[r = "$" + t] = d[r];
|
||
|
|
for (t = 0,
|
||
|
|
l = o.length = a.length; t < l; t++)
|
||
|
|
o[t] = a[t];
|
||
|
|
return i && !B[e] && F(b, e, 2 * f),
|
||
|
|
B[e] ? G(b, e, f, 0, o, c, null, 1)[1] : G(b, e, f, 0, o, c, null, 0)[1]
|
||
|
|
}
|
||
|
|
}
|
||
|
|
,
|
||
|
|
window._$jsvmprt("484e4f4a403f5243000d2d1aea78184c36c3d671000000000000ab44020000250074211b000b02430200013e2217000e1c211b000b03430200024017000e18011b000b02041c16004c211b000b04430200033e2217000b1c1b000b041e00041700181b000b04260200050a000118010a0002101c16001e180022011700051c131f0018011800131e00061a001d000727041c00261102000025552002000825000d1b000b081e00090101001f0702000a25000e211b000b094302000240001f0802000b25005b131e000c02000d02000e1a02221e000f24131e00100a000110220117003c1c0200002500131800221e0011240a0000100200123e00131e001301220117001a1c211b000b0a43020002402217000b1c1b000b0a1e001404001f090200152500131b000b0b1a00221e0016240a000010001f0a020017250039211800430200023e22011700081c1800263e17000702000000211800430200183e170012180017000902001916000602001a001800001f0b02001b25005218010117000802001c1f010200001f0618001f0e180e480039170033180618011b000b0c221e001d241b000b0c221e001e240a00001018011e001f2a0a00011019281f06180e2e1f0e16ffcb1806001f0c0200202500df0200021f0621134318063e22011700121c13221e0011240a00001002002140220117001c1c1b000b051e00221e0011221e002324130a00011002002140220117000d1c211b000b084318063e22011700201c1b000b08221e0011240a000010221e0024240200250a00011048003a220117000d1c211b000b0d4318063e22011700151c1b000b0d221e0011240a00001002002640220117000d1c211b000b0e4318063e17000520001b020b07260a00001001170028211b000b0f4318063e22011700151c1b000b0f221e0011240a00001002002740170005200012001f0d0200282500a3211801430200294017000400180002002a281f061801221e002b24131e000c02002c0200001a020a0001101f0748001f12181218071e001f3a17006618071812191f081808221e002d2448000a00011002002e3e17001a1808221e002f24480118081e001f0a0002101f0816ffd81808221e00242418060a00011048003e1700191808221e002f2418061e001f18081e001f0a0002100018122d1f1216ff95001f0e02003025007146000306000a271f22020000000500600200001f06131e003117001c131e0031221e00322418000a0001101f061806170006180600131e003317001c131e0033221e00322418000a0001101f0618061700061806001b020b0e2618001b000b081e00340a0002101f0618060007001f0f02003525009c460003060006271f2205008f131e0031170015131e0031221e003624180018010a0002101c131e0033170015131e0033221e003624180018010a0002101c49016d48182a483c2a483c2a4903e82a1f061b000b081800020037281d00341b000b08180002002a28180128020038281b000b0b1b000b0b1a00221e0016240a0000101806281a01221e0039240a0000102802003a281d003407001f1002003b25004c460003060006271f1e05003f131e0031170013131e0031221e003c2418000a0001101c131e0033170013131e0033221e003c2418000a0001101c1b000b081800020037281d003407001f1102003d2500a31b000b101a001f061b000b05221e003e24180602003f131e00061a002202000025000c1b030b00201d0040001d00410a0003101c1b000b11221e00422402004318060a0002101c13221700081c131e00442217000b1c131e00441e00451700091800201d00401b020b08260a00001017003013221700221c131e0046131e00472948643922011700101c131e0048131e0049294864391700091800201d0040001f1302004a25002b211343020002402217001f1c1b000b051e00221e0011221e002324131e004b0a00011002004c3e001f1402004d2500611b020b07260a0000100117005202004e1b000b0d420122011700111c1b000b0d1e004e1b000b12410122011700091c02004f134222011700091c020050134222011700091c0200511342220117000f1c020052134202005313423a0012001f150200542501661b000b0d1e005517000520000200561b000b05421700431b000b05221e0056241b000b0d0a0001101f101810221e0024240200550a00011048003b22011700151c1810221e0024240200570a00011048003b170005200013221700081c131e00582217000b1c131e00581e00592217000e1c131e00581e00591e005a17002a460003060006271f9605001e131e00581e0059221e005a240a0000101b000b063e17000520000702005b02005c02005d02005e02005f0200600200610200620200630200640200650a000b1f060200660200670200680a00031f07180708031fc918c921041700181fc8180718c8191fca1318ca19170005200016ffe7180608031fc918c9210417001b1fc8180618c8191fca131e006918ca19170005200016ffe4131e006908031fc918c921041700341fc818c8221e006a24131e000c02006b0200001a020a0001102217000f1c131e006918c81902006c19170005200016ffcb12001f1602006d2500c71b020b08260a0000101700291b000b13221e006e2402000f0a0001101f06180602000025000c1b030b00201d006f001d00701b020b09260a00001017005b46000306002c271f1a181a1e00711b000b14020072193e2217000e1c131e00311e001f48003e1700091800201d006f050029131e0031221e0036240200730200000a00021
|
||
|
|
return exports.sign("", nonce)
|
||
|
|
}
|
||
|
|
// console.log(getSign())
|