+
+uint32_t __inline __builtin_ctz(uint32_t value) {
+ unsigned long trailing_zero = 0;
+ if (_BitScanForward(&trailing_zero, value))
+ return trailing_zero;
+ return 32;
+}
+
+uint32_t __inline __builtin_clz(uint32_t value) {
+ unsigned long leading_zero = 0;
+ if (_BitScanReverse(&leading_zero, value))
+ return 31 - leading_zero;
+ return 32;
+}
+
+#if defined(_M_ARM) || defined(_M_X64)
+uint32_t __inline __builtin_clzll(uint64_t value) {
+ unsigned long leading_zero = 0;
+ if (_BitScanReverse64(&leading_zero, value))
+ return 63 - leading_zero;
+ return 64;
+}
+#else
+uint32_t __inline __builtin_clzll(uint64_t value) {
+ if (value == 0)
+ return 64;
+ uint32_t msh = (uint32_t)(value >> 32);
+ uint32_t lsh = (uint32_t)(value & 0xFFFFFFFF);
+ if (msh != 0)
+ return __builtin_clz(msh);
+ return 32 + __builtin_clz(lsh);
+}
+#endif
+
+#define __builtin_clzl __builtin_clzll
+#endif /* defined(_MSC_VER) && !defined(__clang__) */
+
+#endif /* CUTILS_H */
diff --git a/thirdparty/quickjs/quickjs-2019-07-09-dust3d/doc/jsbignum.html b/thirdparty/quickjs/quickjs-2019-07-09-dust3d/doc/jsbignum.html
new file mode 100755
index 00000000..51f2d6af
--- /dev/null
+++ b/thirdparty/quickjs/quickjs-2019-07-09-dust3d/doc/jsbignum.html
@@ -0,0 +1,1054 @@
+
+
+
+
+Javascript Bignum Extensions
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+Javascript Bignum Extensions
+
+
+Table of Contents
+
+
+
+
+
+1 Introduction
+
+The Bignum extensions add the following features to the Javascript
+language while being 100% backward compatible:
+
+
+- Overloading of the standard operators
+to support new types such as complex numbers, fractions or matrixes.
+
+
- Bigint mode where arbitrarily large integers are available by default (no
n suffix is necessary as in the TC39 BigInt proposal1).
+
+ - Arbitrarily large floating point numbers (
BigFloat) in base 2 using the IEEE 754 semantics.
+
+ - Optional
math mode which modifies the semantics of the division, modulo and power operator. The division and power operator return a fraction with integer operands and the modulo operator is defined as the Euclidian remainder.
+
+
+
+The extensions are independent from each other except the math
+mode which relies on the bigint mode and the operator overloading.
+
+
+2 Operator overloading
+
+
+2.1 Introduction
+
+If the operands of an operator have at least one object type, a custom
+operator method is searched before doing the legacy Javascript
+ToNumber conversion.
+
+For unary operators, the custom function is looked up in the object
+and has the following name:
+
+
+unary +Symbol.operatorPlus
+
+unary -Symbol.operatorNeg
+
+++Symbol.operatorInc
+
+--Symbol.operatorDec
+
+~Symbol.operatorNot
+
+
+
+For binary operators:
+
+
+- If both operands have the same constructor function, then the operator
+is looked up in the constructor.
+
+
- Otherwise, the property
Symbol.operatorOrder is looked up in both
+constructors and converted to Int32. The operator is then
+looked in the constructor with the larger Symbol.operatorOrder
+value. A TypeError is raised if both constructors have the same
+Symbol.operatorOrder value.
+
+
+
+The operator is looked up with the following name:
+
+
++Symbol.operatorAdd
+
+-Symbol.operatorSub
+
+*Symbol.operatorMul
+
+/Symbol.operatorDiv
+
+/ (math mode)Symbol.operatorMathDiv
+
+%Symbol.operatorMod
+
+% (math mode)Symbol.operatorMathMod
+
+^ (math mode)Symbol.operatorMathPow
+
+**Symbol.operatorPow
+
+|Symbol.operatorOr
+
+^Symbol.operatorXor
+
+&Symbol.operatorAnd
+
+<<Symbol.operatorShl
+
+>>Symbol.operatorShr
+
+<Symbol.operatorCmpLT
+
+>Symbol.operatorCmpLT, operands swapped
+
+<=Symbol.operatorCmpLE
+
+>=Symbol.operatorCmpLE, operands swapped
+
+==, !=Symbol.operatorCmpEQ
+
+
+
+The return value of Symbol.operatorCmpLT, Symbol.operatorCmpLE and
+Symbol.operatorCmpEQ is converted to Boolean.
+
+
+2.2 Builtin Object changes
+
+
+2.2.1 Symbol constructor
+
+The following global symbols are added for the operator overloading:
+
+operatorOrderoperatorAddoperatorSuboperatorMuloperatorDivoperatorModoperatorPowoperatorShloperatorShroperatorAndoperatorOroperatorXoroperatorCmpLToperatorCmpLEoperatorCmpEQoperatorPlusoperatorNegoperatorNotoperatorIncoperatorDec
+
+
+
+3 The BigInt Mode
+
+
+3.1 Introduction
+
+The bigint mode is enabled with the "use bigint" directive. It
+propagates the same way as the strict mode. In bigint mode, all
+integers are considered as bigint (arbitrarily large integer,
+similar to the TC39 BigInt
+proposal2)
+instead of number (floating point number). In order to be able
+to exchange data between standard and bigint modes, numbers are
+internally represented as 3 different types:
+
+
+- Small integer (SmallInt): 32 bit integer3.
+
+
- Big integer (BigInt): arbitrarily large integer.
+
+
- Floating point number (Float).
+
+
+
+In standard mode, the semantics of each operation is modified so that
+when it returns a number, it is either of SmallInt or
+Float. But the difference between SmallInt and Float is not observable
+in standard mode.
+
+In bigint mode, each operation behaves differently whether its
+operands are integer or float. The difference between SmallInt and
+BigInt is not observable (i.e. they are both integers).
+
+The following table summarizes the observable types:
+
+
+| Internal type | Observable type
(standard mode) | Observable type
(bigint mode) |
|---|
+| SmallInt | number | bigint |
+| BigInt | bigint | bigint |
+| Float | number | number |
+
+
+
+3.2 Changes that introduce incompatibilities with Javascript
+
+
+3.2.1 Standard mode
+
+There is no incompatibility with Javascript.
+
+
+3.2.2 Bigint mode
+
+The following changes are visible:
+
+
+- Integer and Float are different types. Constants are typed. For example:
typeof 1.0 === "number" and typeof 1 === "bigint". Another consequence is that 1.0 === 1 is false.
+
+ - The range of integers is unlimited. In standard mode:
2**53 + 1 === 2**53. This is no longer true with the bignum extensions.
+
+ - Binary bitwise operators do not truncate to 32 bits i.e.
0x800000000 | 1 === 0x800000001 while it gives 1 in standard mode.
+
+ - Bitwise shift operators do not truncate to 32 bits and do not mask the shift count with
0x1f i.e. 1 << 32 === 4294967296 while it gives 1 in standard mode. However, the >>> operator (unsigned right shift) which is useless with bignums keeps its standard mode behavior4.
+
+ - Operators with integer operands never return the minus zero floating point value as result. Hence
Object.is(0, -0) === true. Use -0.0 to create a minus zero floating point value.
+
+ - Division or modulo with a zero integer dividend raises an exception i.e.
1/0 throws a RangeError exception. However, division by the floating point zero returns Infinity or NaN as in standard mode: 1/0.0 === Infinity. The same holds for zero elevated to a negative integer power i.e. 0**-1 throws a RangeError exception.
+
+ - The
ToPrimitive abstract operation is called with the "integer" preferred type when an integer is required (e.g. for bitwise binary or shift operations).
+
+ - The prototype of integers is no longer
Number.prototype. Instead
Object.getPrototypeOf(1) === BigInt.prototype. The prototype of floats remains Number.prototype.
+
+ - If the TC39 BigInt proposal is supported, there is no observable difference between integers and
bigints.
+
+
+
+
+3.3 Operators
+
+
+3.3.1 Arithmetic operators
+
+The operands are converted to number values as in normal
+Javascript. Then the general case is that an Integer is returned if
+both operands are Integer. Otherwise, a float is returned.
+
+The + operator also accepts strings as input and behaves like
+standard Javascript in this case.
+
+The binary operator % returns the truncated remainder of the
+division.
+
+The binary operator % in math mode returns the Euclidian
+remainder of the division i.e. it is always positive.
+
+The binary operator / returns a float.
+
+The binary operator / in math mode returns a float if one of
+the operands is float. Otherwise, BigInt[Symbol.operatorMathDiv] is
+invoked (and returns a fraction for example).
+
+When the result is an Integer type, a dividend of zero yields a
+RangeError exception.
+
+The returned type of a ** b or a ^ b (math mode) is
+Float if a or b are Float. If a and b are
+integers:
+
+- a = 0 and b < 0 generates a RangeError exception
+
+
- |a| \geq 2 and b < 0 returns a Float in bigint mode. In math mode,
BigInt[Symbol.operatorMathPow] is invoked (and returns a fraction for example)
+
+ - otherwise an integer is returned.
+
+
+The unary - and unary + return the same type as their
+operand. They performs no floating point rounding when the result is a
+float.
+
+The unary operators ++ and -- return the same type as
+their operand.
+
+In standard mode:
+
+If the operator returns an Integer and that the result fits a
+SmallInt, it is converted to SmallInt. Otherwise, the Integer is
+converted to a Float.
+
+In bigint mode:
+
+If the operator returns an Integer and that the result fits a
+SmallInt, it is converted to SmallInt. Otherwise it is a BigInt.
+
+
+3.3.2 Logical operators
+
+In standard mode:
+
+The operands have their standard behavior. If the result fits a
+SmallInt it is converted to a SmallInt. Otherwise it is a Float.
+
+In bigint mode:
+
+The operands are converted to integer values. The floating point
+values are converted to integer by rounding them to zero.
+
+The logical operators are defined assuming the integers are
+represented in two complement notation.
+
+For << and <<, the shift can be positive or negative. So
+a << b is defined as \lfloor a/2^{-b} \rfloor and
+a >> b is defined as \lfloor a/2^{b} \rfloor.
+
+The operator >>> is supported for backward compatibility and
+behaves the same way as Javascript i.e. implicit conversion to Uint32.
+
+If the result fits a SmallInt it is converted to a SmallInt. Otherwise
+it is a BigInt.
+
+
+3.3.3 Relational operators
+
+The relational operators <, <=, >, >=, ==, != work as expected with
+integers and floating point numbers (e.g. 1.0 == 1 is true).
+
+The strict equality operators === and !== have the usual Javascript
+semantics. In particular, different types never equal, so 1.0
+=== 1 is false.
+
+
+3.4 Number literals
+
+Number literals in bigint mode have a slightly different behavior than
+in standard Javascript:
+
+
+- A number literal without a decimal point or an exponent is considered
+as an Integer. Otherwise it is a Float.
+
+
- Hexadecimal, octal or binary floating point literals are accepted with
+a decimal point or an exponent. The exponent is specified with the
+
p letter assuming a base 2. The same convention is used by
+C99. Example: 0x1p3 is the same as 8.0.
+
+
+
+
+3.5 Builtin Object changes
+
+
+3.5.1 BigInt function
+
+The BigInt function cannot be invoked as a constructor. When
+invoked as a function, it converts its first parameter to an
+integer. When a floating point number is given as parameter, it is
+truncated to an integer with infinite precision.
+
+BigInt properties:
+
+
+asIntN(bits, a)Set b=a \pmod{2^{bits}}. Return b if b < 2^{bits-1}
+otherwise b-2^{bits}.
+
+asUintN(bits, a)Return a \pmod{2^{bits}}.
+
+tdiv(a, b)Return trunc(a/b). b = 0 raises a RangeError
+exception.
+
+fdiv(a, b)Return \lfloor a/b \rfloor. b = 0 raises a RangeError
+exception.
+
+cdiv(a, b)Return \lceil a/b \rceil. b = 0 raises a RangeError
+exception.
+
+ediv(a, b)Return sgn(b) \lfloor a/{|b|} \rfloor (Euclidian
+division). b = 0 raises a RangeError exception.
+
+tdivrem(a, b)fdivrem(a, b)cdivrem(a, b)edivrem(a, b)Return an array of two elements. The first element is the quotient,
+the second is the remainder. The same rounding is done as the
+corresponding division operation.
+
+sqrt(a)Return \lfloor \sqrt(a) \rfloor. A RangeError exception is
+raised if a < 0.
+
+sqrtrem(a)Return an array of two elements. The first element is \lfloor
+\sqrt{a} \rfloor. The second element is a-\lfloor \sqrt{a}
+\rfloor^2. A RangeError exception is raised if a < 0.
+
+floorLog2(a)Return -1 if a \leq 0 otherwise return \lfloor \log2(a) \rfloor.
+
+ctz(a)Return the number of trailing zeros in the two’s complement binary representation of a. Return -1 if a=0.
+
+
+
+
+3.5.2 BigInt.prototype
+
+It is a normal object.
+
+
+3.5.3 Number constructor
+
+The number constructor returns its argument rounded to a Float using
+the global floating point environement. In bigint mode, the Number
+constructor returns a Float. In standard mode, it returns a SmallInt
+if the value fits it, otherwise a Float.
+
+
+3.5.4 Number.prototype
+
+The following properties are modified:
+
+
+toString(radix)-
+
In bigint mode, integers are converted to the specified radix with
+infinite precision.
+
+
+toPrecision(p)toFixed(p)toExponential(p)-
+
In bigint mode, integers are accepted and converted to string with
+infinite precision.
+
+
+parseInt(string, radix)-
+
In bigint mode, an integer is returned and the conversion is done with
+infinite precision.
+
+
+
+
+
+3.5.5 Math object
+
+The following properties are modified:
+
+
+abs(x)Absolute value. Return an integer if x is an Integer. Otherwise
+return a Float. No rounding is performed.
+
+min(a, b)max(a, b)No rounding is performed. The returned type is the same one as the
+minimum (resp. maximum) value.
+
+
+
+
+4 Arbitrarily large floating point numbers
+
+
+4.1 Introduction
+
+This extension adds the BigFloat primitive type. The
+BigFloat type represents floating point numbers are in base 2
+with the IEEE 754 semantics. A floating
+point number is represented as a sign, mantissa and exponent. The
+special values NaN, +/-Infinity, +0 and -0
+are supported. The mantissa and exponent can have any bit length with
+an implementation specific minimum and maximum.
+
+
+4.2 Floating point rounding
+
+Each floating point operation operates with infinite precision and
+then rounds the result according to the specified floating point
+environment (BigFloatEnv object). The status flags of the
+environment are also set according to the result of the operation.
+
+If no floating point environment is provided, the global floating
+point environment is used.
+
+The rounding mode of the global floating point environment is always
+RNDN (“round to nearest with ties to even”)5. The status flags of the global environment cannot be
+read6. The precision of the global environment is
+BigFloatEnv.prec. The number of exponent bits of the global
+environment is BigFloatEnv.expBits. If BigFloatEnv.expBits is
+strictly smaller than the maximum allowed number of exponent bits
+(BigFloatEnv.expBitsMax), then the global environment subnormal
+flag is set to true. Otherwise it is set to false;
+
+For example, prec = 53 and expBits = 11 give exactly
+the same precision as the IEEE 754 64 bit floating point type. It is
+the default floating point precision.
+
+The global floating point environment can only be modified temporarily
+when calling a function (see BigFloatEnv.setPrec). Hence a
+function can change the global floating point environment for its
+callees but not for its caller.
+
+
+4.3 Operators
+
+The builtin operators are extended so that a BigFloat is returned if
+at least one operand is a BigFloat. The computations are always done
+with infinite precision and rounded according to the global floating
+point environment.
+
+typeof applied on a BigFloat returns bigfloat.
+
+BigFloat can be compared with all the other numeric types and the
+result follows the expected mathematical relations.
+
+However, since BigFloat and Number are different types they are never
+equal when using the strict comparison operators (e.g. 0.0 ===
+0.0l is false).
+
+
+4.4 BigFloat literals
+
+BigFloat literals are floating point numbers with a trailing l
+suffix. BigFloat literals have an infinite precision. They are rounded
+according to the global floating point environment when they are
+evaluated.7
+
+
+4.5 Builtin Object changes
+
+
+4.5.1 BigFloat function
+
+The BigFloat function cannot be invoked as a constructor. When
+invoked as a function: the parameter is converted to a primitive
+type. If the result is a numeric type, it is converted to BigFloat
+without rounding. If the result is a string, it is converted to
+BigFloat using the precision of the global floating point environment.
+
+BigFloat properties:
+
+
+LN2PIGetter. Return the value of the corresponding mathematical constant
+rounded to nearest, ties to even with the current global
+precision. The constant values are cached for small precisions.
+
+MIN_VALUEMAX_VALUEEPSILONGetter. Return the minimum, maximum and epsilon BigFloat values
+(same definition as the corresponding Number constants).
+
+fpRound(a[, e])Round the floating point number a according to the floating
+point environment e or the global environment if e is
+undefined.
+
+parseFloat(a[, radix[, e]])Parse the string a as a floating point number in radix
+radix. The radix is 0 (default) or from 2 to 36. The radix 0
+means radix 10 unless there is a hexadecimal or binary prefix. The
+result is rounded according to the floating point environment e
+or the global environment if e is undefined.
+
+add(a, b[, e])sub(a, b[, e])mul(a, b[, e])div(a, b[, e])Perform the specified floating point operation and round the floating
+point number a according to the floating point environment
+e or the global environment if e is undefined. If
+e is specified, the floating point status flags are updated.
+
+floor(x[, e])ceil(x[, e])round(x[, e])trunc(x[, e])Round to integer. A rounded BigFloat is returned. e is an
+optional floating point environment.
+
+fmod(x, y[, e])remainder(x, y[, e])Floating point remainder. The quotient is truncated to zero (fmod) or
+to the nearest integer with ties to even (remainder). e is an
+optional floating point environment.
+
+sqrt(x[, e])Square root. Return a rounded floating point number. e is an
+optional floating point environment.
+
+sin(x[, e])cos(x[, e])tan(x[, e])asin(x[, e])acos(x[, e])atan(x[, e])atan2(x, y[, e])exp(x[, e])log(x[, e])pow(x, y[, e])Transcendental operations. Return a rounded floating point
+number. e is an optional floating point environment.
+
+
+
+
+4.5.2 BigFloat.prototype
+
+The following properties are modified:
+
+
+toString(radix)-
+
For floating point numbers:
+
+
+- If the radix is a power of two, the conversion is done with infinite
+precision.
+
- Otherwise, the number is rounded to nearest with ties to even using
+the global precision. It is then converted to string using the minimum
+number of digits so that its conversion back to a floating point using
+the global precision and round to nearest gives the same number.
+
+
+
+
+toPrecision(p[, rnd_mode])toFixed(p[, rnd_mode])toExponential(p[, rnd_mode])Same semantics as the corresponding Number functions with
+BigFloats. There is no limit on the accepted precision p. The
+rounding mode can be optionally specified. It is set by default to
+BigFloatEnv.RNDNA.
+
+
+
+
+4.5.3 BigFloatEnv constructor
+
+The BigFloatEnv([p, [,rndMode]] constructor cannot be invoked as a
+function. The floating point environment contains:
+
+
+- the mantissa precision in bits
+
+
- the exponent size in bits assuming an IEEE 754 representation;
+
+
- the subnormal flag (if true, subnormal floating point numbers can
+be generated by the floating point operations).
+
+
- the rounding mode
+
+
- the floating point status. The status flags can only be set by the floating point operations. They can be reset with
BigFloatEnv.prototype.clearStatus() or with the various status flag setters.
+
+
+
+new BigFloatEnv([p, [,rndMode]] creates a new floating point
+environment. The status flags are reset. If no parameter is given the
+precision, exponent bits and subnormal flags are copied from the
+global floating point environment. Otherwise, the precision is set to
+p, the number of exponent bits is set to expBitsMax and the
+subnormal flags is set to false. If rndMode is
+undefined, the rounding mode is set to RNDN.
+
+BigFloatEnv properties:
+
+
+precGetter. Return the precision in bits of the global floating point
+environment. The initial value is 53.
+
+expBitsGetter. Return the exponent size in bits of the global floating point
+environment assuming an IEEE 754 representation. If expBits <
+expBitsMax, then subnormal numbers are supported. The initial value
+is 11.
+
+setPrec(f, p[, e])Set the precision of the global floating point environment to p
+and the exponent size to e then call the function
+f. Then the Float precision and exponent size are reset to
+their precious value and the return value of f is returned (or
+an exception is raised if f raised an exception). If e
+is undefined it is set to BigFloatEnv.expBitsMax. p
+must be >= 53 and e must be >= 11 so that the global precision
+is at least equivalent to the IEEE 754 64 bit doubles.
+
+precMinRead-only integer. Return the minimum allowed precision. Must be at least 2.
+
+precMaxRead-only integer. Return the maximum allowed precision. Must be at least 53.
+
+expBitsMinRead-only integer. Return the minimum allowed exponent size in
+bits. Must be at least 3.
+
+expBitsMaxRead-only integer. Return the maximum allowed exponent size in
+bits. Must be at least 11.
+
+RNDNRead-only integer. Round to nearest, with ties to even rounding mode.
+
+RNDZRead-only integer. Round to zero rounding mode.
+
+RNDDRead-only integer. Round to -Infinity rounding mode.
+
+RNDURead-only integer. Round to +Infinity rounding mode.
+
+RNDNARead-only integer. Round to nearest, with ties away from zero rounding mode.
+
+RNDNURead-only integer. Round to nearest, with ties to +Infinity rounding mode.
+
+RNDF8Read-only integer. Faithful rounding mode. The result is
+non-deterministicly rounded to -Infinity or +Infinity. This rounding
+mode usually gives a faster and deterministic running time for the
+floating point operations.
+
+
+
+BigFloatEnv.prototype properties:
+
+
+precGetter and setter (Integer). Return or set the precision in bits.
+
+expBitsGetter and setter (Integer). Return or set the exponent size in bits
+assuming an IEEE 754 representation.
+
+rndModeGetter and setter (Integer). Return or set the rounding mode.
+
+subnormalGetter and setter (Boolean). subnormal flag. It is false when
+expBits = expBitsMax.
+
+clearStatus()Clear the status flags.
+
+invalidOperationdivideByZerooverflowunderflowinexactGetter and setter (Boolean). Status flags.
+
+
+
+
+4.5.4 Math object
+
+The following properties are modified:
+
+
+abs(x)Absolute value. If x is a BigFloat, its absolute value is
+returned as a BigFloat. No rounding is performed.
+
+min(a, b)max(a, b)The returned type is the same one as the minimum (resp. maximum)
+value, so BigFloat values are accepted. When a BigFloat
+is returned, no rounding is performed.
+
+
+
+
+5 Math mode
+
+
+5.1 Introduction
+
+A new math mode is enabled with the "use math"
+directive. "use bigint" is implied in math mode. With this
+mode, writing mathematical expressions is more intuitive, exact
+results (fractions) can be computed for all operators and floating
+point literals have the BigFloat type by default.
+
+It propagates the same way as the strict mode. In
+this mode:
+
+
+- The
^ operator is a similar to the power operator (**), except that a ^ b invokes BigInt[Symbol.operatorMathPow] if a and b are integers and |a| \geq 2 and b < 0.
+
+ - The power operator (both
^ and **) grammar is modified so that -2^2 is allowed and yields -4.
+
+ - The logical xor operator is still available with the
^^ operator.
+
+ - The division operator invokes
BigInt[Symbol.operatorMathDiv] in case both operands are integers.
+
+ - The modulo operator returns the Euclidian remainder (always positive) instead of the truncated remainder.
+
+
- Floating point literals are
BigFloat by default (i.e. a l suffix is implied).
+
+
+
+
+5.2 Builtin Object changes
+
+
+5.2.1 Symbol constructor
+
+The following global symbols are added for the operator overloading:
+
+operatorMathDivoperatorMathModoperatorMathPow
+
+
+5.3 Remaining issues
+
+
+- New functions (e.g.
Math.div and Math.mod) could be added to be able to call the normal division and modulo operators when in math mode.
+
+ - A new floating point literal suffix could be added for
Number literals.
+
+
+
+
+
+
+
+
+
+
diff --git a/thirdparty/quickjs/quickjs-2019-07-09-dust3d/doc/jsbignum.pdf b/thirdparty/quickjs/quickjs-2019-07-09-dust3d/doc/jsbignum.pdf
new file mode 100755
index 00000000..036238b5
Binary files /dev/null and b/thirdparty/quickjs/quickjs-2019-07-09-dust3d/doc/jsbignum.pdf differ
diff --git a/thirdparty/quickjs/quickjs-2019-07-09-dust3d/doc/jsbignum.texi b/thirdparty/quickjs/quickjs-2019-07-09-dust3d/doc/jsbignum.texi
new file mode 100755
index 00000000..410ec5f0
--- /dev/null
+++ b/thirdparty/quickjs/quickjs-2019-07-09-dust3d/doc/jsbignum.texi
@@ -0,0 +1,844 @@
+\input texinfo
+
+@iftex
+@afourpaper
+@headings double
+@end iftex
+
+@titlepage
+@afourpaper
+@sp 7
+@center @titlefont{Javascript Bignum Extensions}
+@sp 3
+@center Version 2018-06-16
+@sp 3
+@center Author: Fabrice Bellard
+@end titlepage
+
+@setfilename spec.info
+@settitle Javascript Bignum Extensions
+
+@contents
+
+@chapter Introduction
+
+The Bignum extensions add the following features to the Javascript
+language while being 100% backward compatible:
+
+@itemize
+
+@item Overloading of the standard operators
+to support new types such as complex numbers, fractions or matrixes.
+
+@item Bigint mode where arbitrarily large integers are available by default (no @code{n} suffix is necessary as in the TC39 BigInt proposal@footnote{@url{https://tc39.github.io/proposal-bigint/}}).
+
+@item Arbitrarily large floating point numbers (@code{BigFloat}) in base 2 using the IEEE 754 semantics.
+
+@item Optional @code{math} mode which modifies the semantics of the division, modulo and power operator. The division and power operator return a fraction with integer operands and the modulo operator is defined as the Euclidian remainder.
+
+@end itemize
+
+The extensions are independent from each other except the @code{math}
+mode which relies on the bigint mode and the operator overloading.
+
+@chapter Operator overloading
+
+@section Introduction
+
+If the operands of an operator have at least one object type, a custom
+operator method is searched before doing the legacy Javascript
+@code{ToNumber} conversion.
+
+For unary operators, the custom function is looked up in the object
+and has the following name:
+
+@table @code
+@item unary +
+@code{Symbol.operatorPlus}
+
+@item unary -
+@code{Symbol.operatorNeg}
+
+@item ++
+@code{Symbol.operatorInc}
+
+@item --
+@code{Symbol.operatorDec}
+
+@item ~
+@code{Symbol.operatorNot}
+
+@end table
+
+For binary operators:
+
+@itemize
+
+@item
+If both operands have the same constructor function, then the operator
+is looked up in the constructor.
+
+@item
+Otherwise, the property @code{Symbol.operatorOrder} is looked up in both
+constructors and converted to @code{Int32}. The operator is then
+looked in the constructor with the larger @code{Symbol.operatorOrder}
+value. A @code{TypeError} is raised if both constructors have the same
+@code{Symbol.operatorOrder} value.
+
+@end itemize
+
+The operator is looked up with the following name:
+
+@table @code
+@item +
+@code{Symbol.operatorAdd}
+
+@item -
+@code{Symbol.operatorSub}
+
+@item *
+@code{Symbol.operatorMul}
+
+@item /
+@code{Symbol.operatorDiv}
+
+@item / (math mode)
+@code{Symbol.operatorMathDiv}
+
+@item %
+@code{Symbol.operatorMod}
+
+@item % (math mode)
+@code{Symbol.operatorMathMod}
+
+@item ^ (math mode)
+@code{Symbol.operatorMathPow}
+
+@item **
+@code{Symbol.operatorPow}
+
+@item |
+@code{Symbol.operatorOr}
+
+@item ^
+@code{Symbol.operatorXor}
+
+@item &
+@code{Symbol.operatorAnd}
+
+@item <<
+@code{Symbol.operatorShl}
+
+@item >>
+@code{Symbol.operatorShr}
+
+@item <
+@code{Symbol.operatorCmpLT}
+
+@item >
+@code{Symbol.operatorCmpLT}, operands swapped
+
+@item <=
+@code{Symbol.operatorCmpLE}
+
+@item >=
+@code{Symbol.operatorCmpLE}, operands swapped
+
+@item ==, !=
+@code{Symbol.operatorCmpEQ}
+
+@end table
+
+The return value of @code{Symbol.operatorCmpLT}, @code{Symbol.operatorCmpLE} and
+@code{Symbol.operatorCmpEQ} is converted to @code{Boolean}.
+
+@section Builtin Object changes
+
+@subsection @code{Symbol} constructor
+
+The following global symbols are added for the operator overloading:
+@table @code
+@item operatorOrder
+@item operatorAdd
+@item operatorSub
+@item operatorMul
+@item operatorDiv
+@item operatorMod
+@item operatorPow
+@item operatorShl
+@item operatorShr
+@item operatorAnd
+@item operatorOr
+@item operatorXor
+@item operatorCmpLT
+@item operatorCmpLE
+@item operatorCmpEQ
+@item operatorPlus
+@item operatorNeg
+@item operatorNot
+@item operatorInc
+@item operatorDec
+@end table
+
+
+@chapter The BigInt Mode
+
+@section Introduction
+
+The bigint mode is enabled with the @code{"use bigint"} directive. It
+propagates the same way as the strict mode. In bigint mode, all
+integers are considered as @code{bigint} (arbitrarily large integer,
+similar to the TC39 BigInt
+proposal@footnote{@url{https://tc39.github.io/proposal-bigint/}})
+instead of @code{number} (floating point number). In order to be able
+to exchange data between standard and bigint modes, numbers are
+internally represented as 3 different types:
+
+@itemize
+
+@item Small integer (SmallInt): 32 bit integer@footnote{Could be extended to 53 bits without changing the principle.}.
+
+@item Big integer (BigInt): arbitrarily large integer.
+
+@item Floating point number (Float).
+
+@end itemize
+
+In standard mode, the semantics of each operation is modified so that
+when it returns a @code{number}, it is either of SmallInt or
+Float. But the difference between SmallInt and Float is not observable
+in standard mode.
+
+In bigint mode, each operation behaves differently whether its
+operands are integer or float. The difference between SmallInt and
+BigInt is not observable (i.e. they are both integers).
+
+The following table summarizes the observable types:
+
+@multitable @columnfractions .3 .3 .3
+@headitem Internal type @tab Observable type@* (standard mode) @tab Observable type@* (bigint mode)
+@item SmallInt @tab number @tab bigint
+@item BigInt @tab bigint @tab bigint
+@item Float @tab number @tab number
+@end multitable
+
+@section Changes that introduce incompatibilities with Javascript
+
+@subsection Standard mode
+
+There is no incompatibility with Javascript.
+
+@subsection Bigint mode
+
+The following changes are visible:
+
+@itemize
+
+@item Integer and Float are different types. Constants are typed. For example: @code{typeof 1.0 === "number"} and @code{typeof 1 === "bigint"}. Another consequence is that @code{1.0 === 1} is false.
+
+@item The range of integers is unlimited. In standard mode: @code{2**53 + 1 === 2**53}. This is no longer true with the bignum extensions.
+
+@item Binary bitwise operators do not truncate to 32 bits i.e. @code{0x800000000 | 1 === 0x800000001} while it gives @code{1} in standard mode.
+
+@item Bitwise shift operators do not truncate to 32 bits and do not mask the shift count with @code{0x1f} i.e. @code{1 << 32 === 4294967296} while it gives @code{1} in standard mode. However, the @code{>>>} operator (unsigned right shift) which is useless with bignums keeps its standard mode behavior@footnote{The unsigned right right operator could be removed in bigint mode.}.
+
+@item Operators with integer operands never return the minus zero floating point value as result. Hence @code{Object.is(0, -0) === true}. Use @code{-0.0} to create a minus zero floating point value.
+
+@item Division or modulo with a zero integer dividend raises an exception i.e. @code{1/0} throws a @code{RangeError} exception. However, division by the floating point zero returns Infinity or NaN as in standard mode: @code{1/0.0 === Infinity}. The same holds for zero elevated to a negative integer power i.e. @code{0**-1} throws a @code{RangeError} exception.
+
+@item The @code{ToPrimitive} abstract operation is called with the @code{"integer"} preferred type when an integer is required (e.g. for bitwise binary or shift operations).
+
+@item The prototype of integers is no longer @code{Number.prototype}. Instead@* @code{Object.getPrototypeOf(1) === BigInt.prototype}. The prototype of floats remains Number.prototype.
+
+@item If the TC39 BigInt proposal is supported, there is no observable difference between integers and @code{bigint}s.
+
+@end itemize
+
+@section Operators
+
+@subsection Arithmetic operators
+
+The operands are converted to number values as in normal
+Javascript. Then the general case is that an Integer is returned if
+both operands are Integer. Otherwise, a float is returned.
+
+The @code{+} operator also accepts strings as input and behaves like
+standard Javascript in this case.
+
+The binary operator @code{%} returns the truncated remainder of the
+division.
+
+The binary operator @code{%} in math mode returns the Euclidian
+remainder of the division i.e. it is always positive.
+
+The binary operator @code{/} returns a float.
+
+The binary operator @code{/} in math mode returns a float if one of
+the operands is float. Otherwise, @code{BigInt[Symbol.operatorMathDiv]} is
+invoked (and returns a fraction for example).
+
+When the result is an Integer type, a dividend of zero yields a
+RangeError exception.
+
+The returned type of @code{a ** b} or @code{a ^ b} (math mode) is
+Float if @math{a} or @math{b} are Float. If @math{a} and @math{b} are
+integers:
+@itemize
+@item @math{a = 0} and @math{b < 0} generates a RangeError exception
+
+@item @math{|a| \geq 2} and @math{b < 0} returns a Float in bigint mode. In math mode, @code{BigInt[Symbol.operatorMathPow]} is invoked (and returns a fraction for example)
+
+@item otherwise an integer is returned.
+@end itemize
+
+The unary @code{-} and unary @code{+} return the same type as their
+operand. They performs no floating point rounding when the result is a
+float.
+
+The unary operators @code{++} and @code{--} return the same type as
+their operand.
+
+In standard mode:
+
+If the operator returns an Integer and that the result fits a
+SmallInt, it is converted to SmallInt. Otherwise, the Integer is
+converted to a Float.
+
+In bigint mode:
+
+If the operator returns an Integer and that the result fits a
+SmallInt, it is converted to SmallInt. Otherwise it is a BigInt.
+
+@subsection Logical operators
+
+In standard mode:
+
+The operands have their standard behavior. If the result fits a
+SmallInt it is converted to a SmallInt. Otherwise it is a Float.
+
+In bigint mode:
+
+The operands are converted to integer values. The floating point
+values are converted to integer by rounding them to zero.
+
+The logical operators are defined assuming the integers are
+represented in two complement notation.
+
+For @code{<<} and @code{<<}, the shift can be positive or negative. So
+@code{a << b} is defined as @math{\lfloor a/2^{-b} \rfloor} and
+@code{a >> b} is defined as @math{\lfloor a/2^{b} \rfloor}.
+
+The operator @code{>>>} is supported for backward compatibility and
+behaves the same way as Javascript i.e. implicit conversion to @code{Uint32}.
+
+If the result fits a SmallInt it is converted to a SmallInt. Otherwise
+it is a BigInt.
+
+@subsection Relational operators
+
+The relational operators <, <=, >, >=, ==, != work as expected with
+integers and floating point numbers (e.g. @code{1.0 == 1} is true).
+
+The strict equality operators === and !== have the usual Javascript
+semantics. In particular, different types never equal, so @code{1.0
+=== 1} is false.
+
+@section Number literals
+
+Number literals in bigint mode have a slightly different behavior than
+in standard Javascript:
+
+@enumerate
+
+@item
+A number literal without a decimal point or an exponent is considered
+as an Integer. Otherwise it is a Float.
+
+@item
+Hexadecimal, octal or binary floating point literals are accepted with
+a decimal point or an exponent. The exponent is specified with the
+@code{p} letter assuming a base 2. The same convention is used by
+C99. Example: @code{0x1p3} is the same as @code{8.0}.
+
+@end enumerate
+
+@section Builtin Object changes
+
+@subsection @code{BigInt} function
+
+The @code{BigInt} function cannot be invoked as a constructor. When
+invoked as a function, it converts its first parameter to an
+integer. When a floating point number is given as parameter, it is
+truncated to an integer with infinite precision.
+
+@code{BigInt} properties:
+
+@table @code
+
+@item asIntN(bits, a)
+Set @math{b=a \pmod{2^{bits}}}. Return @math{b} if @math{b < 2^{bits-1}}
+otherwise @math{b-2^{bits}}.
+
+@item asUintN(bits, a)
+Return @math{a \pmod{2^{bits}}}.
+
+@item tdiv(a, b)
+Return @math{trunc(a/b)}. @code{b = 0} raises a RangeError
+exception.
+
+@item fdiv(a, b)
+Return @math{\lfloor a/b \rfloor}. @code{b = 0} raises a RangeError
+exception.
+
+@item cdiv(a, b)
+Return @math{\lceil a/b \rceil}. @code{b = 0} raises a RangeError
+exception.
+
+@item ediv(a, b)
+Return @math{sgn(b) \lfloor a/{|b|} \rfloor} (Euclidian
+division). @code{b = 0} raises a RangeError exception.
+
+@item tdivrem(a, b)
+@item fdivrem(a, b)
+@item cdivrem(a, b)
+@item edivrem(a, b)
+Return an array of two elements. The first element is the quotient,
+the second is the remainder. The same rounding is done as the
+corresponding division operation.
+
+@item sqrt(a)
+Return @math{\lfloor \sqrt(a) \rfloor}. A RangeError exception is
+raised if @math{a < 0}.
+
+@item sqrtrem(a)
+Return an array of two elements. The first element is @math{\lfloor
+\sqrt{a} \rfloor}. The second element is @math{a-\lfloor \sqrt{a}
+\rfloor^2}. A RangeError exception is raised if @math{a < 0}.
+
+@item floorLog2(a)
+Return -1 if @math{a \leq 0} otherwise return @math{\lfloor \log2(a) \rfloor}.
+
+@item ctz(a)
+Return the number of trailing zeros in the two's complement binary representation of a. Return -1 if @math{a=0}.
+
+@end table
+
+@subsection @code{BigInt.prototype}
+
+It is a normal object.
+
+@subsection @code{Number} constructor
+
+The number constructor returns its argument rounded to a Float using
+the global floating point environement. In bigint mode, the Number
+constructor returns a Float. In standard mode, it returns a SmallInt
+if the value fits it, otherwise a Float.
+
+@subsection @code{Number.prototype}
+
+The following properties are modified:
+
+@table @code
+@item toString(radix)
+
+In bigint mode, integers are converted to the specified radix with
+infinite precision.
+
+@item toPrecision(p)
+@item toFixed(p)
+@item toExponential(p)
+
+In bigint mode, integers are accepted and converted to string with
+infinite precision.
+
+@item parseInt(string, radix)
+
+In bigint mode, an integer is returned and the conversion is done with
+infinite precision.
+
+@end table
+
+@subsection @code{Math} object
+
+The following properties are modified:
+
+@table @code
+@item abs(x)
+Absolute value. Return an integer if @code{x} is an Integer. Otherwise
+return a Float. No rounding is performed.
+
+@item min(a, b)
+@item max(a, b)
+No rounding is performed. The returned type is the same one as the
+minimum (resp. maximum) value.
+
+@end table
+
+@chapter Arbitrarily large floating point numbers
+
+@section Introduction
+
+This extension adds the @code{BigFloat} primitive type. The
+@code{BigFloat} type represents floating point numbers are in base 2
+with the IEEE 754 semantics. A floating
+point number is represented as a sign, mantissa and exponent. The
+special values @code{NaN}, @code{+/-Infinity}, @code{+0} and @code{-0}
+are supported. The mantissa and exponent can have any bit length with
+an implementation specific minimum and maximum.
+
+@section Floating point rounding
+
+Each floating point operation operates with infinite precision and
+then rounds the result according to the specified floating point
+environment (@code{BigFloatEnv} object). The status flags of the
+environment are also set according to the result of the operation.
+
+If no floating point environment is provided, the global floating
+point environment is used.
+
+The rounding mode of the global floating point environment is always
+@code{RNDN} (``round to nearest with ties to even'')@footnote{The
+rationale is that the rounding mode changes must always be
+explicit.}. The status flags of the global environment cannot be
+read@footnote{The rationale is to avoid side effects for the built-in
+operators.}. The precision of the global environment is
+@code{BigFloatEnv.prec}. The number of exponent bits of the global
+environment is @code{BigFloatEnv.expBits}. If @code{BigFloatEnv.expBits} is
+strictly smaller than the maximum allowed number of exponent bits
+(@code{BigFloatEnv.expBitsMax}), then the global environment subnormal
+flag is set to @code{true}. Otherwise it is set to @code{false};
+
+For example, @code{prec = 53} and @code{ expBits = 11} give exactly
+the same precision as the IEEE 754 64 bit floating point type. It is
+the default floating point precision.
+
+The global floating point environment can only be modified temporarily
+when calling a function (see @code{BigFloatEnv.setPrec}). Hence a
+function can change the global floating point environment for its
+callees but not for its caller.
+
+@section Operators
+
+The builtin operators are extended so that a BigFloat is returned if
+at least one operand is a BigFloat. The computations are always done
+with infinite precision and rounded according to the global floating
+point environment.
+
+@code{typeof} applied on a @code{BigFloat} returns @code{bigfloat}.
+
+BigFloat can be compared with all the other numeric types and the
+result follows the expected mathematical relations.
+
+However, since BigFloat and Number are different types they are never
+equal when using the strict comparison operators (e.g. @code{0.0 ===
+0.0l} is false).
+
+@section BigFloat literals
+
+BigFloat literals are floating point numbers with a trailing @code{l}
+suffix. BigFloat literals have an infinite precision. They are rounded
+according to the global floating point environment when they are
+evaluated.@footnote{Base 10 floating point literals cannot usually be
+exactly represented as base 2 floating point number. In order to
+ensure that the literal is represented accurately with the current
+precision, it must be evaluated at runtime.}
+
+@section Builtin Object changes
+
+@subsection @code{BigFloat} function
+
+The @code{BigFloat} function cannot be invoked as a constructor. When
+invoked as a function: the parameter is converted to a primitive
+type. If the result is a numeric type, it is converted to BigFloat
+without rounding. If the result is a string, it is converted to
+BigFloat using the precision of the global floating point environment.
+
+@code{BigFloat} properties:
+
+@table @code
+
+@item LN2
+@item PI
+Getter. Return the value of the corresponding mathematical constant
+rounded to nearest, ties to even with the current global
+precision. The constant values are cached for small precisions.
+
+@item MIN_VALUE
+@item MAX_VALUE
+@item EPSILON
+Getter. Return the minimum, maximum and epsilon @code{BigFloat} values
+(same definition as the corresponding @code{Number} constants).
+
+@item fpRound(a[, e])
+Round the floating point number @code{a} according to the floating
+point environment @code{e} or the global environment if @code{e} is
+undefined.
+
+@item parseFloat(a[, radix[, e]])
+Parse the string @code{a} as a floating point number in radix
+@code{radix}. The radix is 0 (default) or from 2 to 36. The radix 0
+means radix 10 unless there is a hexadecimal or binary prefix. The
+result is rounded according to the floating point environment @code{e}
+or the global environment if @code{e} is undefined.
+
+@item add(a, b[, e])
+@item sub(a, b[, e])
+@item mul(a, b[, e])
+@item div(a, b[, e])
+Perform the specified floating point operation and round the floating
+point number @code{a} according to the floating point environment
+@code{e} or the global environment if @code{e} is undefined. If
+@code{e} is specified, the floating point status flags are updated.
+
+@item floor(x[, e])
+@item ceil(x[, e])
+@item round(x[, e])
+@item trunc(x[, e])
+Round to integer. A rounded @code{BigFloat} is returned. @code{e} is an
+optional floating point environment.
+
+@item fmod(x, y[, e])
+@item remainder(x, y[, e])
+Floating point remainder. The quotient is truncated to zero (fmod) or
+to the nearest integer with ties to even (remainder). @code{e} is an
+optional floating point environment.
+
+@item sqrt(x[, e])
+Square root. Return a rounded floating point number. @code{e} is an
+optional floating point environment.
+
+@item sin(x[, e])
+@item cos(x[, e])
+@item tan(x[, e])
+@item asin(x[, e])
+@item acos(x[, e])
+@item atan(x[, e])
+@item atan2(x, y[, e])
+@item exp(x[, e])
+@item log(x[, e])
+@item pow(x, y[, e])
+Transcendental operations. Return a rounded floating point
+number. @code{e} is an optional floating point environment.
+
+@end table
+
+@subsection @code{BigFloat.prototype}
+
+The following properties are modified:
+
+@table @code
+@item toString(radix)
+
+For floating point numbers:
+
+@itemize
+@item
+If the radix is a power of two, the conversion is done with infinite
+precision.
+@item
+Otherwise, the number is rounded to nearest with ties to even using
+the global precision. It is then converted to string using the minimum
+number of digits so that its conversion back to a floating point using
+the global precision and round to nearest gives the same number.
+
+@end itemize
+
+@item toPrecision(p[, rnd_mode])
+@item toFixed(p[, rnd_mode])
+@item toExponential(p[, rnd_mode])
+Same semantics as the corresponding @code{Number} functions with
+BigFloats. There is no limit on the accepted precision @code{p}. The
+rounding mode can be optionally specified. It is set by default to
+@code{BigFloatEnv.RNDNA}.
+
+@end table
+
+@subsection @code{BigFloatEnv} constructor
+
+The @code{BigFloatEnv([p, [,rndMode]]} constructor cannot be invoked as a
+function. The floating point environment contains:
+
+@itemize
+@item the mantissa precision in bits
+
+@item the exponent size in bits assuming an IEEE 754 representation;
+
+@item the subnormal flag (if true, subnormal floating point numbers can
+be generated by the floating point operations).
+
+@item the rounding mode
+
+@item the floating point status. The status flags can only be set by the floating point operations. They can be reset with @code{BigFloatEnv.prototype.clearStatus()} or with the various status flag setters.
+
+@end itemize
+
+@code{new BigFloatEnv([p, [,rndMode]]} creates a new floating point
+environment. The status flags are reset. If no parameter is given the
+precision, exponent bits and subnormal flags are copied from the
+global floating point environment. Otherwise, the precision is set to
+@code{p}, the number of exponent bits is set to @code{expBitsMax} and the
+subnormal flags is set to @code{false}. If @code{rndMode} is
+@code{undefined}, the rounding mode is set to @code{RNDN}.
+
+@code{BigFloatEnv} properties:
+
+@table @code
+
+@item prec
+Getter. Return the precision in bits of the global floating point
+environment. The initial value is @code{53}.
+
+@item expBits
+Getter. Return the exponent size in bits of the global floating point
+environment assuming an IEEE 754 representation. If @code{expBits <
+expBitsMax}, then subnormal numbers are supported. The initial value
+is @code{11}.
+
+@item setPrec(f, p[, e])
+Set the precision of the global floating point environment to @code{p}
+and the exponent size to @code{e} then call the function
+@code{f}. Then the Float precision and exponent size are reset to
+their precious value and the return value of @code{f} is returned (or
+an exception is raised if @code{f} raised an exception). If @code{e}
+is @code{undefined} it is set to @code{BigFloatEnv.expBitsMax}. @code{p}
+must be >= 53 and @code{e} must be >= 11 so that the global precision
+is at least equivalent to the IEEE 754 64 bit doubles.
+
+@item precMin
+Read-only integer. Return the minimum allowed precision. Must be at least 2.
+
+@item precMax
+Read-only integer. Return the maximum allowed precision. Must be at least 53.
+
+@item expBitsMin
+Read-only integer. Return the minimum allowed exponent size in
+bits. Must be at least 3.
+
+@item expBitsMax
+Read-only integer. Return the maximum allowed exponent size in
+bits. Must be at least 11.
+
+@item RNDN
+Read-only integer. Round to nearest, with ties to even rounding mode.
+
+@item RNDZ
+Read-only integer. Round to zero rounding mode.
+
+@item RNDD
+Read-only integer. Round to -Infinity rounding mode.
+
+@item RNDU
+Read-only integer. Round to +Infinity rounding mode.
+
+@item RNDNA
+Read-only integer. Round to nearest, with ties away from zero rounding mode.
+
+@item RNDNU
+Read-only integer. Round to nearest, with ties to +Infinity rounding mode.
+
+@item RNDF@footnote{Could be removed in case a deterministic behvior for floating point operations is required.}
+Read-only integer. Faithful rounding mode. The result is
+non-deterministicly rounded to -Infinity or +Infinity. This rounding
+mode usually gives a faster and deterministic running time for the
+floating point operations.
+
+@end table
+
+@code{BigFloatEnv.prototype} properties:
+
+@table @code
+
+@item prec
+Getter and setter (Integer). Return or set the precision in bits.
+
+@item expBits
+Getter and setter (Integer). Return or set the exponent size in bits
+assuming an IEEE 754 representation.
+
+@item rndMode
+Getter and setter (Integer). Return or set the rounding mode.
+
+@item subnormal
+Getter and setter (Boolean). subnormal flag. It is false when
+@code{expBits = expBitsMax}.
+
+@item clearStatus()
+Clear the status flags.
+
+@item invalidOperation
+@item divideByZero
+@item overflow
+@item underflow
+@item inexact
+Getter and setter (Boolean). Status flags.
+
+@end table
+
+@subsection @code{Math} object
+
+The following properties are modified:
+
+@table @code
+@item abs(x)
+Absolute value. If @code{x} is a BigFloat, its absolute value is
+returned as a BigFloat. No rounding is performed.
+
+@item min(a, b)
+@item max(a, b)
+The returned type is the same one as the minimum (resp. maximum)
+value, so @code{BigFloat} values are accepted. When a @code{BigFloat}
+is returned, no rounding is performed.
+
+@end table
+
+@chapter Math mode
+
+@section Introduction
+
+A new @emph{math mode} is enabled with the @code{"use math"}
+directive. @code{"use bigint"} is implied in math mode. With this
+mode, writing mathematical expressions is more intuitive, exact
+results (fractions) can be computed for all operators and floating
+point literals have the @code{BigFloat} type by default.
+
+It propagates the same way as the @emph{strict mode}. In
+this mode:
+
+@itemize
+
+@item The @code{^} operator is a similar to the power operator (@code{**}), except that @code{a ^ b} invokes @code{BigInt[Symbol.operatorMathPow]} if @math{a} and @math{b} are integers and @math{|a| \geq 2} and @math{b < 0}.
+
+@item The power operator (both @code{^} and @code{**}) grammar is modified so that @code{-2^2} is allowed and yields @code{-4}.
+
+@item The logical xor operator is still available with the @code{^^} operator.
+
+@item The division operator invokes @code{BigInt[Symbol.operatorMathDiv]} in case both operands are integers.
+
+@item The modulo operator returns the Euclidian remainder (always positive) instead of the truncated remainder.
+
+@item Floating point literals are @code{BigFloat} by default (i.e. a @code{l} suffix is implied).
+
+@end itemize
+
+@section Builtin Object changes
+
+@subsection @code{Symbol} constructor
+
+The following global symbols are added for the operator overloading:
+@table @code
+@item operatorMathDiv
+@item operatorMathMod
+@item operatorMathPow
+@end table
+
+@section Remaining issues
+
+@enumerate
+
+@item New functions (e.g. @code{Math.div} and @code{Math.mod}) could be added to be able to call the normal division and modulo operators when in math mode.
+
+@item A new floating point literal suffix could be added for @code{Number} literals.
+
+@end enumerate
+
+@bye
diff --git a/thirdparty/quickjs/quickjs-2019-07-09-dust3d/doc/quickjs.html b/thirdparty/quickjs/quickjs-2019-07-09-dust3d/doc/quickjs.html
new file mode 100755
index 00000000..eaa99563
--- /dev/null
+++ b/thirdparty/quickjs/quickjs-2019-07-09-dust3d/doc/quickjs.html
@@ -0,0 +1,1050 @@
+
+
+
+
+QuickJS Javascript Engine
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+QuickJS Javascript Engine
+
+
+Table of Contents
+
+
+
+
+
+1 Introduction
+
+QuickJS is a small and embeddable Javascript engine. It supports the
+ES2019 specification including modules, asynchronous
+generators and proxies.
+
+It optionally supports mathematical extensions such as big integers
+(BigInt), big floating point numbers (BigFloat) and operator
+overloading.
+
+
+1.1 Main Features
+
+
+- Small and easily embeddable: just a few C files, no external dependency, 180 KiB of x86 code for a simple “hello world” program.
+
+
- Fast interpreter with very low startup time: runs the 56000 tests of the ECMAScript Test Suite1 in about 100 seconds on a single core of a desktop PC. The complete life cycle of a runtime instance completes in less than 300 microseconds.
+
+
- Almost complete ES2019 support including modules, asynchronous
+generators and full Annex B support (legacy web compatibility).
+
+
- Passes 100% of the ECMAScript Test Suite tests.
+
+
- Can compile Javascript sources to executables with no external dependency.
+
+
- Garbage collection using reference counting (to reduce memory usage and have deterministic behavior) with cycle removal.
+
+
- Mathematical extensions: BigInt, BigFloat, operator overloading, bigint mode, math mode.
+
+
- Command line interpreter with contextual colorization and completion implemented in Javascript.
+
+
- Small built-in standard library with C library wrappers.
+
+
+
+
+2 Usage
+
+
+2.1 Installation
+
+A Makefile is provided to compile the engine on Linux or MacOS/X. A
+preliminary Windows support is available thru cross compilation on a
+Linux host with the MingGW tools.
+
+Edit the top of the Makefile if you wish to select specific
+options then run make.
+
+You can type make install as root if you wish to install the binaries and support files to
+/usr/local (this is not necessary to use QuickJS).
+
+
+2.2 Quick start
+
+qjs is the command line interpreter (Read-Eval-Print Loop). You can pass
+Javascript files and/or expressions as arguments to execute them:
+
+
+
./qjs examples/hello.js
+
qjsc is the command line compiler:
+
+
+
./qjsc -o hello examples/hello.js
+./hello
+
generates a hello executable with no external dependency.
+
+qjsbn and qjscbn are the corresponding interpreter and
+compiler with the mathematical extensions:
+
+
+
./qjsbn examples/pi.js 1000
+
displays 1000 digits of PI.
+
+
+
./qjsbnc -o pi examples/pi.js
+./pi 1000
+
compiles and executes the PI program.
+
+
+2.3 Command line options
+
+
+2.3.1 qjs interpreter
+
+usage: qjs [options] [files]
+
+Options are:
+
+-h--helpList options.
+
+-e EXPR--eval EXPREvaluate EXPR.
+
+-i--interactiveGo to interactive mode (it is not the default when files are provided on the command line).
+
+-m--moduleLoad as ES6 module (default if .mjs file extension).
+
+
+
+Advanced options are:
+
+
+-d--dumpDump the memory usage stats.
+
+-q--quitjust instantiate the interpreter and quit.
+
+
+
+
+2.3.2 qjsc compiler
+
+usage: qjsc [options] [files]
+
+Options are:
+
+-cOnly output bytecode in a C file. The default is to output an executable file.
+
-eOutput main() and bytecode in a C file. The default is to output an
+executable file.
+
-o outputSet the output filename (default = out.c or a.out).
+
+-N cnameSet the C name of the generated data.
+
+-mCompile as Javascript module (default if .mjs extension).
+
+-M module_name[,cname]Add initialization code for an external C module. See the
+c_module example.
+
+-xByte swapped output (only used for cross compilation).
+
+-fltoUse link time optimization. The compilation is slower but the
+executable is smaller and faster. This option is automatically set
+when the -fno-x options are used.
+
+-fno-[eval|string-normalize|regexp|json|proxy|map|typedarray|promise]Disable selected language features to produce a smaller executable file.
+
+
+
+
+2.4 qjscalc application
+
+The qjscalc application is a superset of the qjsbn
+command line interpreter implementing a Javascript calculator with
+arbitrarily large integer and floating point numbers, fractions,
+complex numbers, polynomials and matrices. The source code is in
+qjscalc.js. More documentation and a web version are available at
+http://numcalc.com.
+
+
+2.5 Built-in tests
+
+Run make test to run the few built-in tests included in the
+QuickJS archive.
+
+
+2.6 Test262 (ECMAScript Test Suite)
+
+A test262 runner is included in the QuickJS archive.
+
+For reference, the full test262 tests are provided in the archive
+qjs-tests-yyyy-mm-dd.tar.xz. You just need to untar it into the
+QuickJS source code directory.
+
+Alternatively, the test262 tests can be installed with:
+
+
+
git clone https://github.com/tc39/test262.git test262
+cd test262
+git checkout 94b1e80ab3440413df916cd56d29c5a2fa2ac451
+patch -p1 < ../tests/test262.patch
+cd ..
+
The patch adds the implementation specific harness functions
+and optimizes the inefficient RegExp character classes and Unicode
+property escapes tests (the tests themselves are not modified, only a
+slow string initialization function is optimized).
+
+The tests can be run with
+
+
+For more information, run ./run-test262 to see the options of
+the test262 runner. The configuration files test262.conf and
+test262bn.conf contain the options to run the various tests.
+
+
+3 Specifications
+
+
+3.1 Language support
+
+
+3.1.1 ES2019 support
+
+The ES2019 specification
+2 is almost fully
+supported including the Annex B (legacy web compatibility) and the
+Unicode related features. The following features are not supported
+yet:
+
+
+- Realms (althougth the C API supports different runtimes and contexts)
+
+
- Tail calls3
+
+
+
+
+3.1.2 JSON
+
+The JSON parser is currently more tolerant than the specification.
+
+
+3.1.3 ECMA402
+
+ECMA402 (Internationalization API) is not supported.
+
+
+3.1.4 Extensions
+
+
+- The directive
"use strip" indicates that the debug information (including the source code of the functions) should not be retained to save memory. As "use strict", the directive can be global to a script or local to a function.
+
+ - The first line of a script beginning with
#! is ignored.
+
+
+
+
+3.1.5 Mathematical extensions
+
+The mathematical extensions are available in the qjsbn version and are fully
+backward compatible with standard Javascript. See jsbignum.pdf
+for more information.
+
+
+- The
BigInt (big integers) TC39 proposal is supported.
+
+ -
BigFloat support: arbitrary large floating point numbers in base 2.
+
+ - Operator overloading.
+
+
- The directive
"use bigint" enables the bigint mode where integers are BigInt by default.
+
+ - The directive
"use math" enables the math mode where the division and power operators on integers produce fractions. Floating point literals are BigFloat by default and integers are BigInt by default.
+
+
+
+
+3.2 Modules
+
+ES6 modules are fully supported. The default name resolution is the
+following:
+
+
+- Module names with a leading
. or .. are relative
+to the current module path.
+
+ - Module names without a leading
. or .. are system
+modules, such as std or os.
+
+ - Module names ending with
.so are native modules using the
+QuickJS C API.
+
+
+
+
+3.3 Standard library
+
+The standard library is included by default in the command line
+interpreter. It contains the two modules std and os and
+a few global objects.
+
+
+3.3.1 Global objects
+
+
+scriptArgsProvides the command line arguments. The first argument is the script name.
+
print(...args)Print the arguments separated by spaces and a trailing newline.
+
console.log(...args)Same as print().
+
+
+
+
+3.3.2 std module
+
+The std module provides wrappers to the libc stdlib.h
+and stdio.h and a few other utilities.
+
+Available exports:
+
+
+exit(n)Exit the process.
+
+evalScript(str)Evaluate the string str as a script (global eval).
+
+loadScript(filename)Evaluate the file filename as a script (global eval).
+
+Error(errno)-
+
std.Error constructor. Error instances contain the field
+errno (error code) and message (result of
+std.Error.strerror(errno)).
+
+The constructor contains the following fields:
+
+
+EINVALEIOEACCESEEXISTENOSPCENOSYSEBUSYENOENTEPERMEPIPEInteger value of common errors (additional error codes may be defined).
+
strerror(errno)Return a string that describes the error errno.
+
+
+
+open(filename, flags)Open a file (wrapper to the libc fopen()). Throws
+std.Error in case of I/O error.
+
+tmpfile()Open a temporary file. Throws std.Error in case of I/O error.
+
+puts(str)Equivalent to std.out.puts(str).
+
+printf(fmt, ...args)Equivalent to std.out.printf(fmt, ...args)
+
+sprintf(fmt, ...args)Equivalent to the libc sprintf().
+
+inouterrWrappers to the libc file stdin, stdout, stderr.
+
+SEEK_SETSEEK_CURSEEK_ENDConstants for seek().
+
+globalReference to the global object.
+
+gc()Manually invoke the cycle removal algorithm. The cycle removal
+algorithm is automatically started when needed, so this function is
+useful in case of specific memory constraints or for testing.
+
+getenv(name)Return the value of the environment variable name or
+undefined if it is not defined.
+
+
+
+FILE prototype:
+
+
+close()Close the file.
+
puts(str)Outputs the string with the UTF-8 encoding.
+
printf(fmt, ...args)Formatted printf, same formats as the libc printf.
+
flush()Flush the buffered file.
+
seek(offset, whence)Seek to a give file position (whence is std.SEEK_*). Throws a
+std.Error in case of I/O error.
+
tell()Return the current file position.
+
eof()Return true if end of file.
+
fileno()Return the associated OS handle.
+
+read(buffer, position, length)Read length bytes from the file to the ArrayBuffer buffer at byte
+position position (wrapper to the libc fread).
+
+write(buffer, position, length)Write length bytes to the file from the ArrayBuffer buffer at byte
+position position (wrapper to the libc fread).
+
+getline()Return the next line from the file, assuming UTF-8 encoding, excluding
+the trailing line feed.
+
+getByte()Return the next byte from the file.
+
+putByte(c)Write one byte to the file.
+
+
+
+3.3.3 os module
+
+The os module provides Operating System specific functions:
+
+
+- low level file access
+
- signals
+
- timers
+
- asynchronous I/O
+
+
+The OS functions usually return 0 if OK or an OS specific negative
+error code.
+
+Available exports:
+
+
+open(filename, flags, mode = 0o666)Open a file. Return a handle or < 0 if error.
+
+O_RDONLYO_WRONLYO_RDWRO_APPENDO_CREATO_EXCLO_TRUNCPOSIX open flags.
+
+O_TEXT(Windows specific). Open the file in text mode. The default is binary mode.
+
+close(fd)Close the file handle fd.
+
+seek(fd, offset, whence)Seek in the file. Use std.SEEK_* for whence.
+
+read(fd, buffer, offset, length)Read length bytes from the file handle fd to the
+ArrayBuffer buffer at byte position offset.
+Return the number of read bytes or < 0 if error.
+
+write(fd, buffer, offset, length)Write length bytes to the file handle fd from the
+ArrayBuffer buffer at byte position offset.
+Return the number of written bytes or < 0 if error.
+
+isatty(fd)Return true is fd is a TTY (terminal) handle.
+
+ttyGetWinSize(fd)Return the TTY size as [width, height] or null if not available.
+
+ttySetRaw(fd)Set the TTY in raw mode.
+
+remove(filename)Remove a file. Return 0 if OK or < 0 if error.
+
+rename(oldname, newname)Rename a file. Return 0 if OK or < 0 if error.
+
+setReadHandler(fd, func)Add a read handler to the file handle fd. func is called
+each time there is data pending for fd. A single read handler
+per file handle is supported. Use func = null to remove the
+hander.
+
+setWriteHandler(fd, func)Add a write handler to the file handle fd. func is
+called each time data can be written to fd. A single write
+handler per file handle is supported. Use func = null to remove
+the hander.
+
+signal(signal, func)Call the function func when the signal signal
+happens. Only a single handler per signal number is supported. Use
+null to set the default handler or undefined to ignore
+the signal.
+
+SIGINTSIGABRTSIGFPESIGILLSIGSEGVSIGTERMPOSIX signal numbers.
+
+setTimeout(delay, func)Call the function func after delay ms. Return a handle
+to the timer.
+
+clearTimer(handle)Cancel a timer.
+
+platformReturn a string representing the platform: "linux", "darwin",
+"win32" or "js".
+
+
+
+
+3.4 QuickJS C API
+
+The C API was designed to be simple and efficient. The C API is
+defined in the header quickjs.h.
+
+
+3.4.1 Runtime and contexts
+
+JSRuntime represents a Javascript runtime corresponding to an
+object heap. Several runtimes can exist at the same time but they
+cannot exchange objects. Inside a given runtime, no multi-threading is
+supported.
+
+JSContext represents a Javascript context (or Realm). Each
+JSContext has its own global objects and system objects. There can be
+several JSContexts per JSRuntime and they can share objects, similary
+to frames of the same origin sharing Javascript objects in a
+web browser.
+
+
+3.4.2 JSValue
+
+JSValue represents a Javascript value which can be a primitive
+type or an object. Reference counting is used, so it is important to
+explicitely duplicate (JS_DupValue(), increment the reference
+count) or free (JS_FreeValue(), decrement the reference count)
+JSValues.
+
+
+3.4.3 C functions
+
+C functions can be created with
+JS_NewCFunction(). JS_SetPropertyFunctionList() is a
+shortcut to easily add functions, setters and getters properties to a
+given object.
+
+Unlike other embedded Javascript engines, there is no implicit stack,
+so C functions get their parameters as normal C parameters. As a
+general rule, C functions take constant JSValues as parameters
+(so they don’t need to free them) and return a newly allocated (=live)
+JSValue.
+
+
+3.4.4 Exceptions
+
+Exceptions: most C functions can return a Javascript exception. It
+must be explicitely tested and handled by the C code. The specific
+JSValue JS_EXCEPTION indicates that an exception
+occured. The actual exception object is stored in the
+JSContext and can be retrieved with JS_GetException().
+
+
+3.4.5 Script evaluation
+
+Use JS_Eval() to evaluate a script or module source.
+
+If the script or module was compiled to bytecode with qjsc,
+JS_EvalBinary() achieves the same result. The advantage is that
+no compilation is needed so it is faster and smaller because the compiler
+can be removed from the executable if no eval is required.
+
+Note: the bytecode format is linked to a given QuickJS
+version. Moreover, no security check is done before its
+execution. Hence the bytecode should not be loaded from untrusted
+sources. That’s why there is no option to output the bytecode to a
+binary file in qjsc.
+
+
+3.4.6 JS Classes
+
+C opaque data can be attached to a Javascript object. The type of the
+C opaque data is determined with the class ID (JSClassID) of
+the object. Hence the first step is to register a new class ID and JS
+class (JS_NewClassID(), JS_NewClass()). Then you can
+create objects of this class with JS_NewObjectClass() and get or
+set the C opaque point with
+JS_GetOpaque()/JS_SetOpaque().
+
+When defining a new JS class, it is possible to declare a finalizer
+which is called when the object is destroyed. A gc_mark method
+can be provided so that the cycle removal algorithm can find the other
+objects referenced by this object. Other methods are available to
+define exotic object behaviors.
+
+The Class ID are globally allocated (i.e. for all runtimes). The
+JSClass are allocated per JSRuntime. JS_SetClassProto()
+is used to define a prototype for a given class in a given
+JSContext. JS_NewObjectClass() sets this prototype in the
+created object.
+
+Examples are available in js_libc.c.
+
+
+3.4.7 C Modules
+
+Native ES6 modules are supported and can be dynamically or statically
+linked. Look at the test_bjson and bjson.so
+examples. The standard library js_libc.c is also a good example
+of a native module.
+
+
+3.4.8 Memory handling
+
+Use JS_SetMemoryLimit() to set a global memory allocation limit
+to a given JSRuntime.
+
+Custom memory allocation functions can be provided with
+JS_NewRuntime2().
+
+The maximum system stack size can be set with JS_SetMaxStackSize().
+
+
+3.4.9 Execution timeout and interrupts
+
+Use JS_SetInterruptHandler() to set a callback which is
+regularly called by the engine when it is executing code. This
+callback can be used to implement an execution timeout.
+
+It is used by the command line interpreter to implement a
+Ctrl-C handler.
+
+
+4 Internals
+
+
+4.1 Bytecode
+
+The compiler generates bytecode directly with no intermediate
+representation such as a parse tree, hence it is very fast. Several
+optimizations passes are done over the generated bytecode.
+
+A stack-based bytecode was chosen because it is simple and generates
+compact code.
+
+For each function, the maximum stack size is computed at compile time so that
+no runtime stack overflow tests are needed.
+
+A separate compressed line number table is maintained for the debug
+information.
+
+Access to closure variables is optimized and is almost as fast as local
+variables.
+
+Direct eval in strict mode is optimized.
+
+
+4.2 Executable generation
+
+
+4.2.1 qjsc compiler
+
+The qjsc compiler generates C sources from Javascript files. By
+default the C sources are compiled with the system compiler
+(gcc or clang).
+
+The generated C source contains the bytecode of the compiled functions
+or modules. If a full complete executable is needed, it also
+contains a main() function with the necessary C code to initialize the
+Javascript engine and to load and execute the compiled functions and
+modules.
+
+Javascript code can be mixed with C modules.
+
+In order to have smaller executables, specific Javascript features can
+be disabled, in particular eval or the regular expressions. The
+code removal relies on the Link Time Optimization of the system
+compiler.
+
+
+4.2.2 Binary JSON
+
+qjsc works by compiling scripts or modules and then serializing
+them to a binary format. A subset of this format (without functions or
+modules) can be used as binary JSON. The example test_bjson.js
+shows how to use it.
+
+Warning: the binary JSON format may change without notice, so it
+should not be used to store persistent data. The test_bjson.js
+example is only used to test the binary object format functions.
+
+
+4.3 Runtime
+
+
+4.3.1 Strings
+
+Strings are stored either as an 8 bit or a 16 bit array of
+characters. Hence random access to characters is always fast.
+
+The C API provides functions to convert Javascript Strings to C UTF-8 encoded
+strings. The most common case where the Javascript string contains
+only ASCII characters involves no copying.
+
+
+4.3.2 Objects
+
+The object shapes (object prototype, property names and flags) are shared
+between objects to save memory.
+
+Arrays with no holes (except at the end of the array) are optimized.
+
+TypedArray accesses are optimized.
+
+
+4.3.3 Atoms
+
+Object property names and some strings are stored as Atoms (unique
+strings) to save memory and allow fast comparison. Atoms are
+represented as a 32 bit integer. Half of the atom range is reserved for
+immediate integer literals from 0 to 2^{31}-1.
+
+
+4.3.4 Numbers
+
+Numbers are represented either as 32-bit signed integers or 64-bit IEEE-754
+floating point values. Most operations have fast paths for the 32-bit
+integer case.
+
+
+4.3.5 Garbage collection
+
+Reference counting is used to free objects automatically and
+deterministically. A separate cycle removal pass is done when the allocated
+memory becomes too large. The cycle removal algorithm only uses the
+reference counts and the object content, so no explicit garbage
+collection roots need to be manipulated in the C code.
+
+
+4.3.6 JSValue
+
+It is a Javascript value which can be a primitive type (such as
+Number, String, ...) or an Object. NaN boxing is used in the 32-bit version
+to store 64-bit floating point numbers. The representation is
+optimized so that 32-bit integers and reference counted values can be
+efficiently tested.
+
+In 64-bit code, JSValue are 128-bit large and no NaN boxing is used. The
+rationale is that in 64-bit code memory usage is less critical.
+
+In both cases (32 or 64 bits), JSValue exactly fits two CPU registers,
+so it can be efficiently returned by C functions.
+
+
+4.3.7 Function call
+
+The engine is optimized so that function calls are fast. The system
+stack holds the Javascript parameters and local variables.
+
+
+4.4 RegExp
+
+A specific regular expression engine was developped. It is both small
+and efficient and supports all the ES2019 features including the
+Unicode properties. As the Javascript compiler, it directly generates
+bytecode without a parse tree.
+
+Backtracking with an explicit stack is used so that there is no
+recursion on the system stack. Simple quantizers are specifically
+optimized to avoid recursions.
+
+Infinite recursions coming from quantizers with empty terms are
+avoided.
+
+The full regexp library weights about 15 KiB (x86 code), excluding the
+Unicode library.
+
+
+4.5 Unicode
+
+A specific Unicode library was developped so that there is no
+dependency on an external large Unicode library such as ICU. All the
+Unicode tables are compressed while keeping a reasonnable access
+speed.
+
+The library supports case conversion, Unicode normalization, Unicode
+script queries, Unicode general category queries and all Unicode
+binary properties.
+
+The full Unicode library weights about 45 KiB (x86 code).
+
+
+4.6 BigInt and BigFloat
+
+BigInt and BigFloat are implemented with the libbf
+library4. It weights about 60
+KiB (x86 code) and provides arbitrary precision IEEE 754 floating
+point operations and transcendental functions with exact rounding.
+
+
+5 License
+
+QuickJS is released under the MIT license.
+
+Unless otherwise specified, the QuickJS sources are copyright Fabrice
+Bellard and Charlie Gordon.
+
+
+
+
+
+
+
+
diff --git a/thirdparty/quickjs/quickjs-2019-07-09-dust3d/doc/quickjs.pdf b/thirdparty/quickjs/quickjs-2019-07-09-dust3d/doc/quickjs.pdf
new file mode 100755
index 00000000..8643ab6a
Binary files /dev/null and b/thirdparty/quickjs/quickjs-2019-07-09-dust3d/doc/quickjs.pdf differ
diff --git a/thirdparty/quickjs/quickjs-2019-07-09-dust3d/doc/quickjs.texi b/thirdparty/quickjs/quickjs-2019-07-09-dust3d/doc/quickjs.texi
new file mode 100755
index 00000000..2bf8de01
--- /dev/null
+++ b/thirdparty/quickjs/quickjs-2019-07-09-dust3d/doc/quickjs.texi
@@ -0,0 +1,817 @@
+\input texinfo
+
+@iftex
+@afourpaper
+@headings double
+@end iftex
+
+@titlepage
+@afourpaper
+@sp 7
+@center @titlefont{QuickJS Javascript Engine}
+@sp 3
+@end titlepage
+
+@setfilename spec.info
+@settitle QuickJS Javascript Engine
+
+@contents
+
+@chapter Introduction
+
+QuickJS is a small and embeddable Javascript engine. It supports the
+ES2019 specification including modules, asynchronous
+generators and proxies.
+
+It optionally supports mathematical extensions such as big integers
+(BigInt), big floating point numbers (BigFloat) and operator
+overloading.
+
+@section Main Features
+
+@itemize
+
+@item Small and easily embeddable: just a few C files, no external dependency, 180 KiB of x86 code for a simple ``hello world'' program.
+
+@item Fast interpreter with very low startup time: runs the 56000 tests of the ECMAScript Test Suite@footnote{@url{https://github.com/tc39/test262}} in about 100 seconds on a single core of a desktop PC. The complete life cycle of a runtime instance completes in less than 300 microseconds.
+
+@item Almost complete ES2019 support including modules, asynchronous
+generators and full Annex B support (legacy web compatibility).
+
+@item Passes 100% of the ECMAScript Test Suite tests.
+
+@item Can compile Javascript sources to executables with no external dependency.
+
+@item Garbage collection using reference counting (to reduce memory usage and have deterministic behavior) with cycle removal.
+
+@item Mathematical extensions: BigInt, BigFloat, operator overloading, bigint mode, math mode.
+
+@item Command line interpreter with contextual colorization and completion implemented in Javascript.
+
+@item Small built-in standard library with C library wrappers.
+
+@end itemize
+
+@chapter Usage
+
+@section Installation
+
+A Makefile is provided to compile the engine on Linux or MacOS/X. A
+preliminary Windows support is available thru cross compilation on a
+Linux host with the MingGW tools.
+
+Edit the top of the @code{Makefile} if you wish to select specific
+options then run @code{make}.
+
+You can type @code{make install} as root if you wish to install the binaries and support files to
+@code{/usr/local} (this is not necessary to use QuickJS).
+
+@section Quick start
+
+@code{qjs} is the command line interpreter (Read-Eval-Print Loop). You can pass
+Javascript files and/or expressions as arguments to execute them:
+
+@example
+./qjs examples/hello.js
+@end example
+
+@code{qjsc} is the command line compiler:
+
+@example
+./qjsc -o hello examples/hello.js
+./hello
+@end example
+
+generates a @code{hello} executable with no external dependency.
+
+@code{qjsbn} and @code{qjscbn} are the corresponding interpreter and
+compiler with the mathematical extensions:
+
+@example
+./qjsbn examples/pi.js 1000
+@end example
+
+displays 1000 digits of PI.
+
+@example
+./qjsbnc -o pi examples/pi.js
+./pi 1000
+@end example
+
+compiles and executes the PI program.
+
+@section Command line options
+
+@subsection @code{qjs} interpreter
+
+@verbatim
+usage: qjs [options] [files]
+@end verbatim
+
+Options are:
+@table @code
+@item -h
+@item --help
+List options.
+
+@item -e @code{EXPR}
+@item --eval @code{EXPR}
+Evaluate EXPR.
+
+@item -i
+@item --interactive
+Go to interactive mode (it is not the default when files are provided on the command line).
+
+@item -m
+@item --module
+Load as ES6 module (default if .mjs file extension).
+
+@end table
+
+Advanced options are:
+
+@table @code
+@item -d
+@item --dump
+Dump the memory usage stats.
+
+@item -q
+@item --quit
+just instantiate the interpreter and quit.
+
+@end table
+
+@subsection @code{qjsc} compiler
+
+@verbatim
+usage: qjsc [options] [files]
+@end verbatim
+
+Options are:
+@table @code
+@item -c
+Only output bytecode in a C file. The default is to output an executable file.
+@item -e
+Output @code{main()} and bytecode in a C file. The default is to output an
+executable file.
+@item -o output
+Set the output filename (default = @file{out.c} or @file{a.out}).
+
+@item -N cname
+Set the C name of the generated data.
+
+@item -m
+Compile as Javascript module (default if @file{.mjs} extension).
+
+@item -M module_name[,cname]
+Add initialization code for an external C module. See the
+@code{c_module} example.
+
+@item -x
+Byte swapped output (only used for cross compilation).
+
+@item -flto
+Use link time optimization. The compilation is slower but the
+executable is smaller and faster. This option is automatically set
+when the @code{-fno-x} options are used.
+
+@item -fno-[eval|string-normalize|regexp|json|proxy|map|typedarray|promise]
+Disable selected language features to produce a smaller executable file.
+
+@end table
+
+@section @code{qjscalc} application
+
+The @code{qjscalc} application is a superset of the @code{qjsbn}
+command line interpreter implementing a Javascript calculator with
+arbitrarily large integer and floating point numbers, fractions,
+complex numbers, polynomials and matrices. The source code is in
+@file{qjscalc.js}. More documentation and a web version are available at
+@url{http://numcalc.com}.
+
+@section Built-in tests
+
+Run @code{make test} to run the few built-in tests included in the
+QuickJS archive.
+
+@section Test262 (ECMAScript Test Suite)
+
+A test262 runner is included in the QuickJS archive.
+
+For reference, the full test262 tests are provided in the archive
+@file{qjs-tests-yyyy-mm-dd.tar.xz}. You just need to untar it into the
+QuickJS source code directory.
+
+Alternatively, the test262 tests can be installed with:
+
+@example
+git clone https://github.com/tc39/test262.git test262
+cd test262
+git checkout 94b1e80ab3440413df916cd56d29c5a2fa2ac451
+patch -p1 < ../tests/test262.patch
+cd ..
+@end example
+
+The patch adds the implementation specific @code{harness} functions
+and optimizes the inefficient RegExp character classes and Unicode
+property escapes tests (the tests themselves are not modified, only a
+slow string initialization function is optimized).
+
+The tests can be run with
+@example
+make test2
+@end example
+
+For more information, run @code{./run-test262} to see the options of
+the test262 runner. The configuration files @code{test262.conf} and
+@code{test262bn.conf} contain the options to run the various tests.
+
+@chapter Specifications
+
+@section Language support
+
+@subsection ES2019 support
+
+The ES2019 specification
+@footnote{@url{https://tc39.github.io/ecma262/}} is almost fully
+supported including the Annex B (legacy web compatibility) and the
+Unicode related features. The following features are not supported
+yet:
+
+@itemize
+
+@item Realms (althougth the C API supports different runtimes and contexts)
+
+@item Tail calls@footnote{We believe the current specification of tails calls is too complicated and presents limited practical interests.}
+
+@end itemize
+
+@subsection JSON
+
+The JSON parser is currently more tolerant than the specification.
+
+@subsection ECMA402
+
+ECMA402 (Internationalization API) is not supported.
+
+@subsection Extensions
+
+@itemize
+
+@item The directive @code{"use strip"} indicates that the debug information (including the source code of the functions) should not be retained to save memory. As @code{"use strict"}, the directive can be global to a script or local to a function.
+
+@item The first line of a script beginning with @code{#!} is ignored.
+
+@end itemize
+
+@subsection Mathematical extensions
+
+The mathematical extensions are available in the @code{qjsbn} version and are fully
+backward compatible with standard Javascript. See @code{jsbignum.pdf}
+for more information.
+
+@itemize
+
+@item The @code{BigInt} (big integers) TC39 proposal is supported.
+
+@item @code{BigFloat} support: arbitrary large floating point numbers in base 2.
+
+@item Operator overloading.
+
+@item The directive @code{"use bigint"} enables the bigint mode where integers are @code{BigInt} by default.
+
+@item The directive @code{"use math"} enables the math mode where the division and power operators on integers produce fractions. Floating point literals are @code{BigFloat} by default and integers are @code{BigInt} by default.
+
+@end itemize
+
+@section Modules
+
+ES6 modules are fully supported. The default name resolution is the
+following:
+
+@itemize
+
+@item Module names with a leading @code{.} or @code{..} are relative
+to the current module path.
+
+@item Module names without a leading @code{.} or @code{..} are system
+modules, such as @code{std} or @code{os}.
+
+@item Module names ending with @code{.so} are native modules using the
+QuickJS C API.
+
+@end itemize
+
+@section Standard library
+
+The standard library is included by default in the command line
+interpreter. It contains the two modules @code{std} and @code{os} and
+a few global objects.
+
+@subsection Global objects
+
+@table @code
+@item scriptArgs
+Provides the command line arguments. The first argument is the script name.
+@item print(...args)
+Print the arguments separated by spaces and a trailing newline.
+@item console.log(...args)
+Same as print().
+
+@end table
+
+@subsection @code{std} module
+
+The @code{std} module provides wrappers to the libc @file{stdlib.h}
+and @file{stdio.h} and a few other utilities.
+
+Available exports:
+
+@table @code
+
+@item exit(n)
+Exit the process.
+
+@item evalScript(str)
+Evaluate the string @code{str} as a script (global eval).
+
+@item loadScript(filename)
+Evaluate the file @code{filename} as a script (global eval).
+
+@item Error(errno)
+
+@code{std.Error} constructor. Error instances contain the field
+@code{errno} (error code) and @code{message} (result of
+@code{std.Error.strerror(errno)}).
+
+The constructor contains the following fields:
+
+ @table @code
+ @item EINVAL
+ @item EIO
+ @item EACCES
+ @item EEXIST
+ @item ENOSPC
+ @item ENOSYS
+ @item EBUSY
+ @item ENOENT
+ @item EPERM
+ @item EPIPE
+ Integer value of common errors (additional error codes may be defined).
+ @item strerror(errno)
+ Return a string that describes the error @code{errno}.
+ @end table
+
+@item open(filename, flags)
+Open a file (wrapper to the libc @code{fopen()}). Throws
+@code{std.Error} in case of I/O error.
+
+@item tmpfile()
+Open a temporary file. Throws @code{std.Error} in case of I/O error.
+
+@item puts(str)
+Equivalent to @code{std.out.puts(str)}.
+
+@item printf(fmt, ...args)
+Equivalent to @code{std.out.printf(fmt, ...args)}
+
+@item sprintf(fmt, ...args)
+Equivalent to the libc sprintf().
+
+@item in
+@item out
+@item err
+Wrappers to the libc file @code{stdin}, @code{stdout}, @code{stderr}.
+
+@item SEEK_SET
+@item SEEK_CUR
+@item SEEK_END
+Constants for seek().
+
+@item global
+Reference to the global object.
+
+@item gc()
+Manually invoke the cycle removal algorithm. The cycle removal
+algorithm is automatically started when needed, so this function is
+useful in case of specific memory constraints or for testing.
+
+@item getenv(name)
+Return the value of the environment variable @code{name} or
+@code{undefined} if it is not defined.
+
+@end table
+
+FILE prototype:
+
+@table @code
+@item close()
+Close the file.
+@item puts(str)
+Outputs the string with the UTF-8 encoding.
+@item printf(fmt, ...args)
+Formatted printf, same formats as the libc printf.
+@item flush()
+Flush the buffered file.
+@item seek(offset, whence)
+Seek to a give file position (whence is @code{std.SEEK_*}). Throws a
+@code{std.Error} in case of I/O error.
+@item tell()
+Return the current file position.
+@item eof()
+Return true if end of file.
+@item fileno()
+Return the associated OS handle.
+
+@item read(buffer, position, length)
+Read @code{length} bytes from the file to the ArrayBuffer @code{buffer} at byte
+position @code{position} (wrapper to the libc @code{fread}).
+
+@item write(buffer, position, length)
+Write @code{length} bytes to the file from the ArrayBuffer @code{buffer} at byte
+position @code{position} (wrapper to the libc @code{fread}).
+
+@item getline()
+Return the next line from the file, assuming UTF-8 encoding, excluding
+the trailing line feed.
+
+@item getByte()
+Return the next byte from the file.
+
+@item putByte(c)
+Write one byte to the file.
+@end table
+
+@subsection @code{os} module
+
+The @code{os} module provides Operating System specific functions:
+
+@itemize
+@item low level file access
+@item signals
+@item timers
+@item asynchronous I/O
+@end itemize
+
+The OS functions usually return 0 if OK or an OS specific negative
+error code.
+
+Available exports:
+
+@table @code
+@item open(filename, flags, mode = 0o666)
+Open a file. Return a handle or < 0 if error.
+
+@item O_RDONLY
+@item O_WRONLY
+@item O_RDWR
+@item O_APPEND
+@item O_CREAT
+@item O_EXCL
+@item O_TRUNC
+POSIX open flags.
+
+@item O_TEXT
+(Windows specific). Open the file in text mode. The default is binary mode.
+
+@item close(fd)
+Close the file handle @code{fd}.
+
+@item seek(fd, offset, whence)
+Seek in the file. Use @code{std.SEEK_*} for @code{whence}.
+
+@item read(fd, buffer, offset, length)
+Read @code{length} bytes from the file handle @code{fd} to the
+ArrayBuffer @code{buffer} at byte position @code{offset}.
+Return the number of read bytes or < 0 if error.
+
+@item write(fd, buffer, offset, length)
+Write @code{length} bytes to the file handle @code{fd} from the
+ArrayBuffer @code{buffer} at byte position @code{offset}.
+Return the number of written bytes or < 0 if error.
+
+@item isatty(fd)
+Return @code{true} is @code{fd} is a TTY (terminal) handle.
+
+@item ttyGetWinSize(fd)
+Return the TTY size as @code{[width, height]} or @code{null} if not available.
+
+@item ttySetRaw(fd)
+Set the TTY in raw mode.
+
+@item remove(filename)
+Remove a file. Return 0 if OK or < 0 if error.
+
+@item rename(oldname, newname)
+Rename a file. Return 0 if OK or < 0 if error.
+
+@item setReadHandler(fd, func)
+Add a read handler to the file handle @code{fd}. @code{func} is called
+each time there is data pending for @code{fd}. A single read handler
+per file handle is supported. Use @code{func = null} to remove the
+hander.
+
+@item setWriteHandler(fd, func)
+Add a write handler to the file handle @code{fd}. @code{func} is
+called each time data can be written to @code{fd}. A single write
+handler per file handle is supported. Use @code{func = null} to remove
+the hander.
+
+@item signal(signal, func)
+Call the function @code{func} when the signal @code{signal}
+happens. Only a single handler per signal number is supported. Use
+@code{null} to set the default handler or @code{undefined} to ignore
+the signal.
+
+@item SIGINT
+@item SIGABRT
+@item SIGFPE
+@item SIGILL
+@item SIGSEGV
+@item SIGTERM
+POSIX signal numbers.
+
+@item setTimeout(delay, func)
+Call the function @code{func} after @code{delay} ms. Return a handle
+to the timer.
+
+@item clearTimer(handle)
+Cancel a timer.
+
+@item platform
+Return a string representing the platform: @code{"linux"}, @code{"darwin"},
+@code{"win32"} or @code{"js"}.
+
+@end table
+
+@section QuickJS C API
+
+The C API was designed to be simple and efficient. The C API is
+defined in the header @code{quickjs.h}.
+
+@subsection Runtime and contexts
+
+@code{JSRuntime} represents a Javascript runtime corresponding to an
+object heap. Several runtimes can exist at the same time but they
+cannot exchange objects. Inside a given runtime, no multi-threading is
+supported.
+
+@code{JSContext} represents a Javascript context (or Realm). Each
+JSContext has its own global objects and system objects. There can be
+several JSContexts per JSRuntime and they can share objects, similary
+to frames of the same origin sharing Javascript objects in a
+web browser.
+
+@subsection JSValue
+
+@code{JSValue} represents a Javascript value which can be a primitive
+type or an object. Reference counting is used, so it is important to
+explicitely duplicate (@code{JS_DupValue()}, increment the reference
+count) or free (@code{JS_FreeValue()}, decrement the reference count)
+JSValues.
+
+@subsection C functions
+
+C functions can be created with
+@code{JS_NewCFunction()}. @code{JS_SetPropertyFunctionList()} is a
+shortcut to easily add functions, setters and getters properties to a
+given object.
+
+Unlike other embedded Javascript engines, there is no implicit stack,
+so C functions get their parameters as normal C parameters. As a
+general rule, C functions take constant @code{JSValue}s as parameters
+(so they don't need to free them) and return a newly allocated (=live)
+@code{JSValue}.
+
+@subsection Exceptions
+
+Exceptions: most C functions can return a Javascript exception. It
+must be explicitely tested and handled by the C code. The specific
+@code{JSValue} @code{JS_EXCEPTION} indicates that an exception
+occured. The actual exception object is stored in the
+@code{JSContext} and can be retrieved with @code{JS_GetException()}.
+
+@subsection Script evaluation
+
+Use @code{JS_Eval()} to evaluate a script or module source.
+
+If the script or module was compiled to bytecode with @code{qjsc},
+@code{JS_EvalBinary()} achieves the same result. The advantage is that
+no compilation is needed so it is faster and smaller because the compiler
+can be removed from the executable if no @code{eval} is required.
+
+Note: the bytecode format is linked to a given QuickJS
+version. Moreover, no security check is done before its
+execution. Hence the bytecode should not be loaded from untrusted
+sources. That's why there is no option to output the bytecode to a
+binary file in @code{qjsc}.
+
+@subsection JS Classes
+
+C opaque data can be attached to a Javascript object. The type of the
+C opaque data is determined with the class ID (@code{JSClassID}) of
+the object. Hence the first step is to register a new class ID and JS
+class (@code{JS_NewClassID()}, @code{JS_NewClass()}). Then you can
+create objects of this class with @code{JS_NewObjectClass()} and get or
+set the C opaque point with
+@code{JS_GetOpaque()}/@code{JS_SetOpaque()}.
+
+When defining a new JS class, it is possible to declare a finalizer
+which is called when the object is destroyed. A @code{gc_mark} method
+can be provided so that the cycle removal algorithm can find the other
+objects referenced by this object. Other methods are available to
+define exotic object behaviors.
+
+The Class ID are globally allocated (i.e. for all runtimes). The
+JSClass are allocated per @code{JSRuntime}. @code{JS_SetClassProto()}
+is used to define a prototype for a given class in a given
+JSContext. @code{JS_NewObjectClass()} sets this prototype in the
+created object.
+
+Examples are available in @file{js_libc.c}.
+
+@subsection C Modules
+
+Native ES6 modules are supported and can be dynamically or statically
+linked. Look at the @file{test_bjson} and @file{bjson.so}
+examples. The standard library @file{js_libc.c} is also a good example
+of a native module.
+
+@subsection Memory handling
+
+Use @code{JS_SetMemoryLimit()} to set a global memory allocation limit
+to a given JSRuntime.
+
+Custom memory allocation functions can be provided with
+@code{JS_NewRuntime2()}.
+
+The maximum system stack size can be set with @code{JS_SetMaxStackSize()}.
+
+@subsection Execution timeout and interrupts
+
+Use @code{JS_SetInterruptHandler()} to set a callback which is
+regularly called by the engine when it is executing code. This
+callback can be used to implement an execution timeout.
+
+It is used by the command line interpreter to implement a
+@code{Ctrl-C} handler.
+
+@chapter Internals
+
+@section Bytecode
+
+The compiler generates bytecode directly with no intermediate
+representation such as a parse tree, hence it is very fast. Several
+optimizations passes are done over the generated bytecode.
+
+A stack-based bytecode was chosen because it is simple and generates
+compact code.
+
+For each function, the maximum stack size is computed at compile time so that
+no runtime stack overflow tests are needed.
+
+A separate compressed line number table is maintained for the debug
+information.
+
+Access to closure variables is optimized and is almost as fast as local
+variables.
+
+Direct @code{eval} in strict mode is optimized.
+
+@section Executable generation
+
+@subsection @code{qjsc} compiler
+
+The @code{qjsc} compiler generates C sources from Javascript files. By
+default the C sources are compiled with the system compiler
+(@code{gcc} or @code{clang}).
+
+The generated C source contains the bytecode of the compiled functions
+or modules. If a full complete executable is needed, it also
+contains a @code{main()} function with the necessary C code to initialize the
+Javascript engine and to load and execute the compiled functions and
+modules.
+
+Javascript code can be mixed with C modules.
+
+In order to have smaller executables, specific Javascript features can
+be disabled, in particular @code{eval} or the regular expressions. The
+code removal relies on the Link Time Optimization of the system
+compiler.
+
+@subsection Binary JSON
+
+@code{qjsc} works by compiling scripts or modules and then serializing
+them to a binary format. A subset of this format (without functions or
+modules) can be used as binary JSON. The example @file{test_bjson.js}
+shows how to use it.
+
+Warning: the binary JSON format may change without notice, so it
+should not be used to store persistent data. The @file{test_bjson.js}
+example is only used to test the binary object format functions.
+
+@section Runtime
+
+@subsection Strings
+
+Strings are stored either as an 8 bit or a 16 bit array of
+characters. Hence random access to characters is always fast.
+
+The C API provides functions to convert Javascript Strings to C UTF-8 encoded
+strings. The most common case where the Javascript string contains
+only ASCII characters involves no copying.
+
+@subsection Objects
+
+The object shapes (object prototype, property names and flags) are shared
+between objects to save memory.
+
+Arrays with no holes (except at the end of the array) are optimized.
+
+TypedArray accesses are optimized.
+
+@subsection Atoms
+
+Object property names and some strings are stored as Atoms (unique
+strings) to save memory and allow fast comparison. Atoms are
+represented as a 32 bit integer. Half of the atom range is reserved for
+immediate integer literals from @math{0} to @math{2^{31}-1}.
+
+@subsection Numbers
+
+Numbers are represented either as 32-bit signed integers or 64-bit IEEE-754
+floating point values. Most operations have fast paths for the 32-bit
+integer case.
+
+@subsection Garbage collection
+
+Reference counting is used to free objects automatically and
+deterministically. A separate cycle removal pass is done when the allocated
+memory becomes too large. The cycle removal algorithm only uses the
+reference counts and the object content, so no explicit garbage
+collection roots need to be manipulated in the C code.
+
+@subsection JSValue
+
+It is a Javascript value which can be a primitive type (such as
+Number, String, ...) or an Object. NaN boxing is used in the 32-bit version
+to store 64-bit floating point numbers. The representation is
+optimized so that 32-bit integers and reference counted values can be
+efficiently tested.
+
+In 64-bit code, JSValue are 128-bit large and no NaN boxing is used. The
+rationale is that in 64-bit code memory usage is less critical.
+
+In both cases (32 or 64 bits), JSValue exactly fits two CPU registers,
+so it can be efficiently returned by C functions.
+
+@subsection Function call
+
+The engine is optimized so that function calls are fast. The system
+stack holds the Javascript parameters and local variables.
+
+@section RegExp
+
+A specific regular expression engine was developped. It is both small
+and efficient and supports all the ES2019 features including the
+Unicode properties. As the Javascript compiler, it directly generates
+bytecode without a parse tree.
+
+Backtracking with an explicit stack is used so that there is no
+recursion on the system stack. Simple quantizers are specifically
+optimized to avoid recursions.
+
+Infinite recursions coming from quantizers with empty terms are
+avoided.
+
+The full regexp library weights about 15 KiB (x86 code), excluding the
+Unicode library.
+
+@section Unicode
+
+A specific Unicode library was developped so that there is no
+dependency on an external large Unicode library such as ICU. All the
+Unicode tables are compressed while keeping a reasonnable access
+speed.
+
+The library supports case conversion, Unicode normalization, Unicode
+script queries, Unicode general category queries and all Unicode
+binary properties.
+
+The full Unicode library weights about 45 KiB (x86 code).
+
+@section BigInt and BigFloat
+
+BigInt and BigFloat are implemented with the @code{libbf}
+library@footnote{@url{https://bellard.org/libbf}}. It weights about 60
+KiB (x86 code) and provides arbitrary precision IEEE 754 floating
+point operations and transcendental functions with exact rounding.
+
+@chapter License
+
+QuickJS is released under the MIT license.
+
+Unless otherwise specified, the QuickJS sources are copyright Fabrice
+Bellard and Charlie Gordon.
+
+@bye
diff --git a/thirdparty/quickjs/quickjs-2019-07-09-dust3d/examples/c_module.js b/thirdparty/quickjs/quickjs-2019-07-09-dust3d/examples/c_module.js
new file mode 100755
index 00000000..70d26bd8
--- /dev/null
+++ b/thirdparty/quickjs/quickjs-2019-07-09-dust3d/examples/c_module.js
@@ -0,0 +1,6 @@
+/* example of JS module importing a C module */
+
+import { fib } from "./fib.so";
+
+console.log("Hello World");
+console.log("fib(10)=", fib(10));
diff --git a/thirdparty/quickjs/quickjs-2019-07-09-dust3d/examples/fib.c b/thirdparty/quickjs/quickjs-2019-07-09-dust3d/examples/fib.c
new file mode 100755
index 00000000..c77b7056
--- /dev/null
+++ b/thirdparty/quickjs/quickjs-2019-07-09-dust3d/examples/fib.c
@@ -0,0 +1,72 @@
+/*
+ * QuickJS: Example of C module
+ *
+ * Copyright (c) 2017-2018 Fabrice Bellard
+ *
+ * Permission is hereby granted, free of charge, to any person obtaining a copy
+ * of this software and associated documentation files (the "Software"), to deal
+ * in the Software without restriction, including without limitation the rights
+ * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+ * copies of the Software, and to permit persons to whom the Software is
+ * furnished to do so, subject to the following conditions:
+ *
+ * The above copyright notice and this permission notice shall be included in
+ * all copies or substantial portions of the Software.
+ *
+ * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+ * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+ * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
+ * THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+ * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+ * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
+ * THE SOFTWARE.
+ */
+#include "../quickjs.h"
+
+#define countof(x) (sizeof(x) / sizeof((x)[0]))
+
+static int fib(int n)
+{
+ if (n <= 0)
+ return 0;
+ else if (n == 1)
+ return 1;
+ else
+ return fib(n - 1) + fib(n - 2);
+}
+
+static JSValue js_fib(JSContext *ctx, JSValueConst this_val,
+ int argc, JSValueConst *argv)
+{
+ int n, res;
+ if (JS_ToInt32(ctx, &n, argv[0]))
+ return JS_EXCEPTION;
+ res = fib(n);
+ return JS_NewInt32(ctx, res);
+}
+
+static const JSCFunctionListEntry js_fib_funcs[] = {
+ JS_CFUNC_DEF("fib", 1, js_fib ),
+};
+
+static int js_fib_init(JSContext *ctx, JSModuleDef *m)
+{
+ return JS_SetModuleExportList(ctx, m, js_fib_funcs,
+ countof(js_fib_funcs));
+}
+
+#ifdef JS_SHARED_LIBRARY
+#define JS_INIT_MODULE js_init_module
+#else
+#define JS_INIT_MODULE js_init_module_fib
+#endif
+
+JSModuleDef *JS_INIT_MODULE(JSContext *ctx, const char *module_name)
+{
+ JSModuleDef *m;
+ m = JS_NewCModule(ctx, module_name, js_fib_init);
+ if (!m)
+ return NULL;
+ JS_AddModuleExportList(ctx, m, js_fib_funcs, countof(js_fib_funcs));
+ return m;
+}
diff --git a/thirdparty/quickjs/quickjs-2019-07-09-dust3d/examples/fib_module.js b/thirdparty/quickjs/quickjs-2019-07-09-dust3d/examples/fib_module.js
new file mode 100755
index 00000000..6a810716
--- /dev/null
+++ b/thirdparty/quickjs/quickjs-2019-07-09-dust3d/examples/fib_module.js
@@ -0,0 +1,10 @@
+/* fib module */
+export function fib(n)
+{
+ if (n <= 0)
+ return 0;
+ else if (n == 1)
+ return 1;
+ else
+ return fib(n - 1) + fib(n - 2);
+}
diff --git a/thirdparty/quickjs/quickjs-2019-07-09-dust3d/examples/hello.js b/thirdparty/quickjs/quickjs-2019-07-09-dust3d/examples/hello.js
new file mode 100755
index 00000000..accefceb
--- /dev/null
+++ b/thirdparty/quickjs/quickjs-2019-07-09-dust3d/examples/hello.js
@@ -0,0 +1 @@
+console.log("Hello World");
diff --git a/thirdparty/quickjs/quickjs-2019-07-09-dust3d/examples/hello_module.js b/thirdparty/quickjs/quickjs-2019-07-09-dust3d/examples/hello_module.js
new file mode 100755
index 00000000..463660f6
--- /dev/null
+++ b/thirdparty/quickjs/quickjs-2019-07-09-dust3d/examples/hello_module.js
@@ -0,0 +1,6 @@
+/* example of JS module */
+
+import { fib } from "./fib_module.js";
+
+console.log("Hello World");
+console.log("fib(10)=", fib(10));
diff --git a/thirdparty/quickjs/quickjs-2019-07-09-dust3d/examples/pi.js b/thirdparty/quickjs/quickjs-2019-07-09-dust3d/examples/pi.js
new file mode 100755
index 00000000..f2ba4cde
--- /dev/null
+++ b/thirdparty/quickjs/quickjs-2019-07-09-dust3d/examples/pi.js
@@ -0,0 +1,66 @@
+/*
+ * PI computation in Javascript using the QuickJS bignum extensions
+ */
+"use strict";
+"use bigint";
+
+/* compute PI with a precision of 'prec' bits */
+function calc_pi(prec) {
+ const CHUD_A = 13591409;
+ const CHUD_B = 545140134;
+ const CHUD_C = 640320;
+ const CHUD_C3 = 10939058860032000; /* C^3/24 */
+ const CHUD_BITS_PER_TERM = 47.11041313821584202247; /* log2(C/12)*3 */
+
+ /* return [P, Q, G] */
+ function chud_bs(a, b, need_G) {
+ var c, P, Q, G, P1, Q1, G1, P2, Q2, G2;
+ if (a == (b - 1)) {
+ G = (2 * b - 1) * (6 * b - 1) * (6 * b - 5);
+ P = BigFloat(G * (CHUD_B * b + CHUD_A));
+ if (b & 1)
+ P = -P;
+ G = BigFloat(G);
+ Q = BigFloat(b * b * b * CHUD_C3);
+ } else {
+ c = (a + b) >> 1;
+ [P1, Q1, G1] = chud_bs(a, c, true);
+ [P2, Q2, G2] = chud_bs(c, b, need_G);
+ P = P1 * Q2 + P2 * G1;
+ Q = Q1 * Q2;
+ if (need_G)
+ G = G1 * G2;
+ else
+ G = 0;
+ }
+ return [P, Q, G];
+ }
+
+ var n, P, Q, G;
+ /* number of serie terms */
+ n = Math.ceil(BigFloatEnv.prec / CHUD_BITS_PER_TERM) + 10;
+ [P, Q, G] = chud_bs(0, n, false);
+ Q = Q / (P + Q * CHUD_A);
+ G = (CHUD_C / 12) * BigFloat.sqrt(CHUD_C);
+ return Q * G;
+}
+
+(function() {
+ var r, n_digits, n_bits;
+ if (typeof scriptArgs != "undefined") {
+ if (scriptArgs.length < 2) {
+ print("usage: pi n_digits");
+ return;
+ }
+ n_digits = scriptArgs[1];
+ } else {
+ n_digits = 1000;
+ }
+ n_bits = Math.ceil(n_digits * Math.log2(10));
+ /* we add more bits to reduce the probability of bad rounding for
+ the last digits */
+ BigFloatEnv.setPrec( () => {
+ r = calc_pi();
+ print(r.toFixed(n_digits, BigFloatEnv.RNDZ));
+ }, n_bits + 32);
+})();
diff --git a/thirdparty/quickjs/quickjs-2019-07-09-dust3d/jscompress.c b/thirdparty/quickjs/quickjs-2019-07-09-dust3d/jscompress.c
new file mode 100755
index 00000000..a68c0e88
--- /dev/null
+++ b/thirdparty/quickjs/quickjs-2019-07-09-dust3d/jscompress.c
@@ -0,0 +1,918 @@
+/*
+ * Javascript Compressor
+ *
+ * Copyright (c) 2008-2018 Fabrice Bellard
+ * Copyright (c) 2017-2018 Charlie Gordon
+ *
+ * Permission is hereby granted, free of charge, to any person obtaining a copy
+ * of this software and associated documentation files (the "Software"), to deal
+ * in the Software without restriction, including without limitation the rights
+ * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+ * copies of the Software, and to permit persons to whom the Software is
+ * furnished to do so, subject to the following conditions:
+ *
+ * The above copyright notice and this permission notice shall be included in
+ * all copies or substantial portions of the Software.
+ *
+ * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+ * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+ * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
+ * THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+ * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+ * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
+ * THE SOFTWARE.
+ */
+#include
+#include
+#include
+#include
+#include
+#include
+#include
+
+#include "cutils.h"
+
+typedef struct JSToken {
+ int tok;
+ char buf[20];
+ char *str;
+ int len;
+ int size;
+ int line_num; /* line number for start of token */
+ int lines; /* number of embedded linefeeds in token */
+} JSToken;
+
+enum {
+ TOK_EOF = 256,
+ TOK_IDENT,
+ TOK_STR1,
+ TOK_STR2,
+ TOK_STR3,
+ TOK_NUM,
+ TOK_COM,
+ TOK_LCOM,
+};
+
+void tok_reset(JSToken *tt)
+{
+ if (tt->str != tt->buf) {
+ free(tt->str);
+ tt->str = tt->buf;
+ tt->size = sizeof(tt->buf);
+ }
+ tt->len = 0;
+}
+
+void tok_add_ch(JSToken *tt, int c)
+{
+ if (tt->len + 1 > tt->size) {
+ tt->size *= 2;
+ if (tt->str == tt->buf) {
+ tt->str = malloc(tt->size);
+ memcpy(tt->str, tt->buf, tt->len);
+ } else {
+ tt->str = realloc(tt->str, tt->size);
+ }
+ }
+ tt->str[tt->len++] = c;
+}
+
+FILE *infile;
+const char *filename;
+int output_line_num;
+int line_num;
+int ch;
+JSToken tokc;
+
+int skip_mask;
+#define DEFINE_MAX 20
+char *define_tab[DEFINE_MAX];
+int define_len;
+
+void error(const char *fmt, ...)
+{
+ va_list ap;
+ va_start(ap, fmt);
+ if (filename) {
+ fprintf(stderr, "%s:%d: ", filename, line_num);
+ } else {
+ fprintf(stderr, "jscompress: ");
+ }
+ vfprintf(stderr, fmt, ap);
+ fprintf(stderr, "\n");
+ va_end(ap);
+ exit(1);
+}
+
+void define_symbol(const char *def)
+{
+ int i;
+ for (i = 0; i < define_len; i++) {
+ if (!strcmp(tokc.str, define_tab[i]))
+ return;
+ }
+ if (define_len >= DEFINE_MAX)
+ error("too many defines");
+ define_tab[define_len++] = strdup(def);
+}
+
+void undefine_symbol(const char *def)
+{
+ int i, j;
+ for (i = j = 0; i < define_len; i++) {
+ if (!strcmp(tokc.str, define_tab[i])) {
+ free(define_tab[i]);
+ } else {
+ define_tab[j++] = define_tab[i];
+ }
+ }
+ define_len = j;
+}
+
+const char *find_symbol(const char *def)
+{
+ int i;
+ for (i = 0; i < define_len; i++) {
+ if (!strcmp(tokc.str, define_tab[i]))
+ return "1";
+ }
+ return NULL;
+}
+
+void next(void);
+
+void nextch(void)
+{
+ ch = fgetc(infile);
+ if (ch == '\n')
+ line_num++;
+}
+
+int skip_blanks(void)
+{
+ for (;;) {
+ next();
+ if (tokc.tok != ' ' && tokc.tok != '\t' &&
+ tokc.tok != TOK_COM && tokc.tok != TOK_LCOM)
+ return tokc.tok;
+ }
+}
+
+void parse_directive(void)
+{
+ int ifdef, mask = skip_mask;
+ /* simplistic preprocessor:
+ #define / #undef / #ifdef / #ifndef / #else / #endif
+ no symbol substitution.
+ */
+ skip_mask = 0; /* disable skipping to parse preprocessor line */
+ nextch();
+ if (skip_blanks() != TOK_IDENT)
+ error("expected preprocessing directive after #");
+
+ if (!strcmp(tokc.str, "define")) {
+ if (skip_blanks() != TOK_IDENT)
+ error("expected identifier after #define");
+ define_symbol(tokc.str);
+ } else if (!strcmp(tokc.str, "undef")) {
+ if (skip_blanks() != TOK_IDENT)
+ error("expected identifier after #undef");
+ undefine_symbol(tokc.str);
+ } else if ((ifdef = 1, !strcmp(tokc.str, "ifdef")) ||
+ (ifdef = 0, !strcmp(tokc.str, "ifndef"))) {
+ if (skip_blanks() != TOK_IDENT)
+ error("expected identifier after #ifdef/#ifndef");
+ mask = (mask << 2) | 2 | ifdef;
+ if (find_symbol(tokc.str))
+ mask ^= 1;
+ } else if (!strcmp(tokc.str, "else")) {
+ if (!(mask & 2))
+ error("#else without a #if");
+ mask ^= 1;
+ } else if (!strcmp(tokc.str, "endif")) {
+ if (!(mask & 2))
+ error("#endif without a #if");
+ mask >>= 2;
+ } else {
+ error("unsupported preprocessing directive");
+ }
+ if (skip_blanks() != '\n')
+ error("extra characters on preprocessing line");
+ skip_mask = mask;
+}
+
+/* return -1 if invalid char */
+static int hex_to_num(int ch)
+{
+ if (ch >= 'a' && ch <= 'f')
+ return ch - 'a' + 10;
+ else if (ch >= 'A' && ch <= 'F')
+ return ch - 'A' + 10;
+ else if (ch >= '0' && ch <= '9')
+ return ch - '0';
+ else
+ return -1;
+}
+
+void next(void)
+{
+again:
+ tok_reset(&tokc);
+ tokc.line_num = line_num;
+ tokc.lines = 0;
+ switch(ch) {
+ case EOF:
+ tokc.tok = TOK_EOF;
+ if (skip_mask)
+ error("missing #endif");
+ break;
+ case 'a' ... 'z':
+ case 'A' ... 'Z':
+ case '_':
+ case '$':
+ tok_add_ch(&tokc, ch);
+ nextch();
+ while ((ch >= 'a' && ch <= 'z') ||
+ (ch >= 'A' && ch <= 'Z') ||
+ (ch >= '0' && ch <= '9') ||
+ (ch == '_' || ch == '$')) {
+ tok_add_ch(&tokc, ch);
+ nextch();
+ }
+ tok_add_ch(&tokc, '\0');
+ tokc.tok = TOK_IDENT;
+ break;
+ case '.':
+ nextch();
+ if (ch >= '0' && ch <= '9') {
+ tok_add_ch(&tokc, '.');
+ goto has_dot;
+ }
+ tokc.tok = '.';
+ break;
+ case '0':
+ tok_add_ch(&tokc, ch);
+ nextch();
+ if (ch == 'x' || ch == 'X') {
+ /* hexa */
+ tok_add_ch(&tokc, ch);
+ nextch();
+ while ((ch >= 'a' && ch <= 'f') ||
+ (ch >= 'A' && ch <= 'F') ||
+ (ch >= '0' && ch <= '9')) {
+ tok_add_ch(&tokc, ch);
+ nextch();
+ }
+ tok_add_ch(&tokc, '\0');
+ tokc.tok = TOK_NUM;
+ break;
+ }
+ goto has_digit;
+
+ case '1' ... '9':
+ tok_add_ch(&tokc, ch);
+ nextch();
+ has_digit:
+ /* decimal */
+ while (ch >= '0' && ch <= '9') {
+ tok_add_ch(&tokc, ch);
+ nextch();
+ }
+ if (ch == '.') {
+ tok_add_ch(&tokc, ch);
+ nextch();
+ has_dot:
+ while (ch >= '0' && ch <= '9') {
+ tok_add_ch(&tokc, ch);
+ nextch();
+ }
+ }
+ if (ch == 'e' || ch == 'E') {
+ tok_add_ch(&tokc, ch);
+ nextch();
+ if (ch == '+' || ch == '-') {
+ tok_add_ch(&tokc, ch);
+ nextch();
+ }
+ while (ch >= '0' && ch <= '9') {
+ tok_add_ch(&tokc, ch);
+ nextch();
+ }
+ }
+ tok_add_ch(&tokc, '\0');
+ tokc.tok = TOK_NUM;
+ break;
+ case '`':
+ {
+ nextch();
+ while (ch != '`' && ch != EOF) {
+ if (ch == '\\') {
+ tok_add_ch(&tokc, ch);
+ nextch();
+ if (ch == EOF) {
+ error("unexpected char after '\\'");
+ }
+ tok_add_ch(&tokc, ch);
+ } else {
+ tok_add_ch(&tokc, ch);
+ nextch();
+ }
+ }
+ nextch();
+ tok_add_ch(&tokc, 0);
+ tokc.tok = TOK_STR3;
+ }
+ break;
+ case '\"':
+ case '\'':
+ {
+ int n, i, c, hex_digit_count;
+ int quote_ch;
+ quote_ch = ch;
+ nextch();
+ while (ch != quote_ch && ch != EOF) {
+ if (ch == '\\') {
+ nextch();
+ switch(ch) {
+ case 'n':
+ tok_add_ch(&tokc, '\n');
+ nextch();
+ break;
+ case 'r':
+ tok_add_ch(&tokc, '\r');
+ nextch();
+ break;
+ case 't':
+ tok_add_ch(&tokc, '\t');
+ nextch();
+ break;
+ case 'v':
+ tok_add_ch(&tokc, '\v');
+ nextch();
+ break;
+ case '\"':
+ case '\'':
+ case '\\':
+ tok_add_ch(&tokc, ch);
+ nextch();
+ break;
+ case '0' ... '7':
+ n = 0;
+ while (ch >= '0' && ch <= '7') {
+ n = n * 8 + (ch - '0');
+ nextch();
+ }
+ tok_add_ch(&tokc, n);
+ break;
+ case 'x':
+ case 'u':
+ if (ch == 'x')
+ hex_digit_count = 2;
+ else
+ hex_digit_count = 4;
+ nextch();
+ n = 0;
+ for(i = 0; i < hex_digit_count; i++) {
+ c = hex_to_num(ch);
+ if (c < 0)
+ error("unexpected char after '\\x'");
+ n = n * 16 + c;
+ nextch();
+ }
+ if (n >= 256)
+ error("unicode is currently unsupported");
+ tok_add_ch(&tokc, n);
+ break;
+
+ default:
+ error("unexpected char after '\\'");
+ }
+ } else {
+ /* XXX: should refuse embedded newlines */
+ tok_add_ch(&tokc, ch);
+ nextch();
+ }
+ }
+ nextch();
+ tok_add_ch(&tokc, 0);
+ if (quote_ch == '\'')
+ tokc.tok = TOK_STR1;
+ else
+ tokc.tok = TOK_STR2;
+ }
+ break;
+ case '/':
+ nextch();
+ if (ch == '/') {
+ tok_add_ch(&tokc, '/');
+ tok_add_ch(&tokc, ch);
+ nextch();
+ while (ch != '\n' && ch != EOF) {
+ tok_add_ch(&tokc, ch);
+ nextch();
+ }
+ tok_add_ch(&tokc, '\0');
+ tokc.tok = TOK_LCOM;
+ } else if (ch == '*') {
+ int last;
+ tok_add_ch(&tokc, '/');
+ tok_add_ch(&tokc, ch);
+ last = 0;
+ for(;;) {
+ nextch();
+ if (ch == EOF)
+ error("unterminated comment");
+ if (ch == '\n')
+ tokc.lines++;
+ tok_add_ch(&tokc, ch);
+ if (last == '*' && ch == '/')
+ break;
+ last = ch;
+ }
+ nextch();
+ tok_add_ch(&tokc, '\0');
+ tokc.tok = TOK_COM;
+ } else {
+ tokc.tok = '/';
+ }
+ break;
+ case '#':
+ parse_directive();
+ goto again;
+ case '\n':
+ /* adjust line number */
+ tokc.line_num--;
+ tokc.lines++;
+ /* fall thru */
+ default:
+ tokc.tok = ch;
+ nextch();
+ break;
+ }
+ if (skip_mask & 1)
+ goto again;
+}
+
+void print_tok(FILE *f, JSToken *tt)
+{
+ /* keep output lines in sync with input lines */
+ while (output_line_num < tt->line_num) {
+ putc('\n', f);
+ output_line_num++;
+ }
+
+ switch(tt->tok) {
+ case TOK_IDENT:
+ case TOK_COM:
+ case TOK_LCOM:
+ fprintf(f, "%s", tt->str);
+ break;
+ case TOK_NUM:
+ {
+ unsigned long a;
+ char *p;
+ a = strtoul(tt->str, &p, 0);
+ if (*p == '\0' && a <= 0x7fffffff) {
+ /* must be an integer */
+ fprintf(f, "%d", (int)a);
+ } else {
+ fprintf(f, "%s", tt->str);
+ }
+ }
+ break;
+ case TOK_STR3:
+ fprintf(f, "`%s`", tt->str);
+ break;
+ case TOK_STR1:
+ case TOK_STR2:
+ {
+ int i, c, quote_ch;
+ if (tt->tok == TOK_STR1)
+ quote_ch = '\'';
+ else
+ quote_ch = '\"';
+ fprintf(f, "%c", quote_ch);
+ for(i = 0; i < tt->len - 1; i++) {
+ c = (uint8_t)tt->str[i];
+ switch(c) {
+ case '\r':
+ fprintf(f, "\\r");
+ break;
+ case '\n':
+ fprintf(f, "\\n");
+ break;
+ case '\t':
+ fprintf(f, "\\t");
+ break;
+ case '\v':
+ fprintf(f, "\\v");
+ break;
+ case '\"':
+ case '\'':
+ if (c == quote_ch)
+ fprintf(f, "\\%c", c);
+ else
+ fprintf(f, "%c", c);
+ break;
+ case '\\':
+ fprintf(f, "\\\\");
+ break;
+ default:
+ /* XXX: no utf-8 support! */
+ if (c >= 32 && c <= 255) {
+ fprintf(f, "%c", c);
+ } else if (c <= 255)
+ fprintf(f, "\\x%02x", c);
+ else
+ fprintf(f, "\\u%04x", c);
+ break;
+ }
+ }
+ fprintf(f, "%c", quote_ch);
+ }
+ break;
+ default:
+ if (tokc.tok >= 256)
+ error("unsupported token in print_tok: %d", tt->tok);
+ fprintf(f, "%c", tt->tok);
+ break;
+ }
+ output_line_num += tt->lines;
+}
+
+/* check if token pasting could occur */
+static BOOL compat_token(int c1, int c2)
+{
+ if ((c1 == TOK_IDENT || c1 == TOK_NUM) &&
+ (c2 == TOK_IDENT || c2 == TOK_NUM))
+ return FALSE;
+
+ if ((c1 == c2 && strchr("+-<>&|=*/.", c1))
+ || (c2 == '=' && strchr("+-<>&|!*/^%", c1))
+ || (c1 == '=' && c2 == '>')
+ || (c1 == '/' && c2 == '*')
+ || (c1 == '.' && c2 == TOK_NUM)
+ || (c1 == TOK_NUM && c2 == '.'))
+ return FALSE;
+
+ return TRUE;
+}
+
+void js_compress(const char *filename, const char *outfilename,
+ BOOL do_strip, BOOL keep_header)
+{
+ FILE *outfile;
+ int ltok, seen_space;
+
+ line_num = 1;
+ infile = fopen(filename, "rb");
+ if (!infile) {
+ perror(filename);
+ exit(1);
+ }
+
+ output_line_num = 1;
+ outfile = fopen(outfilename, "wb");
+ if (!outfile) {
+ perror(outfilename);
+ exit(1);
+ }
+
+ nextch();
+ next();
+ ltok = 0;
+ seen_space = 0;
+ if (do_strip) {
+ if (keep_header) {
+ while (tokc.tok == ' ' ||
+ tokc.tok == '\n' ||
+ tokc.tok == '\t' ||
+ tokc.tok == '\v' ||
+ tokc.tok == '\b' ||
+ tokc.tok == '\f') {
+ seen_space = 1;
+ next();
+ }
+ if (tokc.tok == TOK_COM) {
+ print_tok(outfile, &tokc);
+ //fprintf(outfile, "\n");
+ ltok = tokc.tok;
+ seen_space = 0;
+ next();
+ }
+ }
+
+ for(;;) {
+ if (tokc.tok == TOK_EOF)
+ break;
+ if (tokc.tok == ' ' ||
+ tokc.tok == '\r' ||
+ tokc.tok == '\t' ||
+ tokc.tok == '\v' ||
+ tokc.tok == '\b' ||
+ tokc.tok == '\f' ||
+ tokc.tok == TOK_LCOM ||
+ tokc.tok == TOK_COM) {
+ /* don't print spaces or comments */
+ seen_space = 1;
+ } else if (tokc.tok == TOK_STR3) {
+ print_tok(outfile, &tokc);
+ ltok = tokc.tok;
+ seen_space = 0;
+ } else if (tokc.tok == TOK_STR1 || tokc.tok == TOK_STR2) {
+ int count, i;
+ /* find the optimal quote char */
+ count = 0;
+ for(i = 0; i < tokc.len; i++) {
+ if (tokc.str[i] == '\'')
+ count++;
+ else if (tokc.str[i] == '\"')
+ count--;
+ }
+ if (count > 0)
+ tokc.tok = TOK_STR2;
+ else if (count < 0)
+ tokc.tok = TOK_STR1;
+ print_tok(outfile, &tokc);
+ ltok = tokc.tok;
+ seen_space = 0;
+ } else {
+ if (seen_space && !compat_token(ltok, tokc.tok)) {
+ fprintf(outfile, " ");
+ }
+ print_tok(outfile, &tokc);
+ ltok = tokc.tok;
+ seen_space = 0;
+ }
+ next();
+ }
+ } else {
+ /* just handle preprocessing */
+ while (tokc.tok != TOK_EOF) {
+ print_tok(outfile, &tokc);
+ next();
+ }
+ }
+
+ fclose(outfile);
+ fclose(infile);
+}
+
+#define HASH_SIZE 30011
+#define MATCH_LEN_MIN 3
+#define MATCH_LEN_MAX (4 + 63)
+#define DIST_MAX 65535
+
+static int find_longest_match(int *pdist, const uint8_t *src, int src_len,
+ const int *hash_next, int cur_pos)
+{
+ int pos, i, match_len, match_pos, pos_min, len_max;
+
+ len_max = min_int(src_len - cur_pos, MATCH_LEN_MAX);
+ match_len = 0;
+ match_pos = 0;
+ pos_min = max_int(cur_pos - DIST_MAX - 1, 0);
+ pos = hash_next[cur_pos];
+ while (pos >= pos_min) {
+ for(i = 0; i < len_max; i++) {
+ if (src[cur_pos + i] != src[pos + i])
+ break;
+ }
+ if (i > match_len) {
+ match_len = i;
+ match_pos = pos;
+ }
+ pos = hash_next[pos];
+ }
+ *pdist = cur_pos - match_pos - 1;
+ return match_len;
+}
+
+int lz_compress(uint8_t **pdst, const uint8_t *src, int src_len)
+{
+ int *hash_table, *hash_next;
+ uint32_t h, v;
+ int i, dist, len, len1, dist1;
+ uint8_t *dst, *q;
+
+ /* build the hash table */
+
+ hash_table = malloc(sizeof(hash_table[0]) * HASH_SIZE);
+ for(i = 0; i < HASH_SIZE; i++)
+ hash_table[i] = -1;
+ hash_next = malloc(sizeof(hash_next[0]) * src_len);
+ for(i = 0; i < src_len; i++)
+ hash_next[i] = -1;
+
+ for(i = 0; i < src_len - MATCH_LEN_MIN + 1; i++) {
+ h = ((src[i] << 16) | (src[i + 1] << 8) | src[i + 2]) % HASH_SIZE;
+ hash_next[i] = hash_table[h];
+ hash_table[h] = i;
+ }
+ for(;i < src_len; i++) {
+ hash_next[i] = -1;
+ }
+ free(hash_table);
+
+ dst = malloc(src_len + 4); /* never larger than the source */
+ q = dst;
+ *q++ = src_len >> 24;
+ *q++ = src_len >> 16;
+ *q++ = src_len >> 8;
+ *q++ = src_len >> 0;
+ /* compress */
+ i = 0;
+ while (i < src_len) {
+ if (src[i] >= 128)
+ return -1;
+ len = find_longest_match(&dist, src, src_len, hash_next, i);
+ if (len >= MATCH_LEN_MIN) {
+ /* heuristic: see if better length just after */
+ len1 = find_longest_match(&dist1, src, src_len, hash_next, i + 1);
+ if (len1 > len)
+ goto no_match;
+ }
+ if (len < MATCH_LEN_MIN) {
+ no_match:
+ *q++ = src[i];
+ i++;
+ } else if (len <= (3 + 15) && dist < (1 << 10)) {
+ v = 0x8000 | ((len - 3) << 10) | dist;
+ *q++ = v >> 8;
+ *q++ = v;
+ i += len;
+ } else if (len >= 4 && len <= (4 + 63) && dist < (1 << 16)) {
+ v = 0xc00000 | ((len - 4) << 16) | dist;
+ *q++ = v >> 16;
+ *q++ = v >> 8;
+ *q++ = v;
+ i += len;
+ } else {
+ goto no_match;
+ }
+ }
+ free(hash_next);
+ *pdst = dst;
+ return q - dst;
+}
+
+static int load_file(uint8_t **pbuf, const char *filename)
+{
+ FILE *f;
+ uint8_t *buf;
+ int buf_len;
+
+ f = fopen(filename, "rb");
+ if (!f) {
+ perror(filename);
+ exit(1);
+ }
+ fseek(f, 0, SEEK_END);
+ buf_len = ftell(f);
+ fseek(f, 0, SEEK_SET);
+ buf = malloc(buf_len + 1);
+ fread(buf, 1, buf_len, f);
+ buf[buf_len] = '\0';
+ fclose(f);
+ *pbuf = buf;
+ return buf_len;
+}
+
+static void save_file(const char *filename, const uint8_t *buf, int buf_len)
+{
+ FILE *f;
+
+ f = fopen(filename, "wb");
+ if (!f) {
+ perror(filename);
+ exit(1);
+ }
+ fwrite(buf, 1, buf_len, f);
+ fclose(f);
+}
+
+static void save_c_source(const char *filename, const uint8_t *buf, int buf_len,
+ const char *var_name)
+{
+ FILE *f;
+ int i;
+
+ f = fopen(filename, "wb");
+ if (!f) {
+ perror(filename);
+ exit(1);
+ }
+ fprintf(f, "/* This file is automatically generated - do not edit */\n\n");
+ fprintf(f, "const uint8_t %s[] = {\n", var_name);
+ for(i = 0; i < buf_len; i++) {
+ fprintf(f, " 0x%02x,", buf[i]);
+ if ((i % 8) == 7 || (i == buf_len - 1))
+ fprintf(f, "\n");
+ }
+ fprintf(f, "};\n");
+ fclose(f);
+}
+
+#define DEFAULT_OUTPUT_FILENAME "out.js"
+
+void help(void)
+{
+ printf("jscompress version 1.0 Copyright (c) 2008-2018 Fabrice Bellard\n"
+ "usage: jscompress [options] filename\n"
+ "Javascript compressor\n"
+ "\n"
+ "-h print this help\n"
+ "-n do not compress spaces\n"
+ "-H keep the first comment\n"
+ "-c compress to file\n"
+ "-C name compress to C source ('name' is the variable name)\n"
+ "-D symbol define preprocessor symbol\n"
+ "-U symbol undefine preprocessor symbol\n"
+ "-o outfile set the output filename (default=%s)\n",
+ DEFAULT_OUTPUT_FILENAME);
+ exit(1);
+}
+
+int main(int argc, char **argv)
+{
+ int c, do_strip, keep_header, compress;
+ const char *out_filename, *c_var, *fname;
+ char tmpfilename[1024];
+
+ do_strip = 1;
+ keep_header = 0;
+ out_filename = DEFAULT_OUTPUT_FILENAME;
+ compress = 0;
+ c_var = NULL;
+ for(;;) {
+ c = getopt(argc, argv, "hno:HcC:D:U:");
+ if (c == -1)
+ break;
+ switch(c) {
+ case 'h':
+ help();
+ break;
+ case 'n':
+ do_strip = 0;
+ break;
+ case 'o':
+ out_filename = optarg;
+ break;
+ case 'H':
+ keep_header = 1;
+ break;
+ case 'c':
+ compress = 1;
+ break;
+ case 'C':
+ c_var = optarg;
+ compress = 1;
+ break;
+ case 'D':
+ define_symbol(optarg);
+ break;
+ case 'U':
+ undefine_symbol(optarg);
+ break;
+ }
+ }
+ if (optind >= argc)
+ help();
+
+ filename = argv[optind++];
+
+ if (compress) {
+#if defined(__ANDROID__)
+ /* XXX: use another directory ? */
+ snprintf(tmpfilename, sizeof(tmpfilename), "out.%d", getpid());
+#else
+ snprintf(tmpfilename, sizeof(tmpfilename), "/tmp/out.%d", getpid());
+#endif
+ fname = tmpfilename;
+ } else {
+ fname = out_filename;
+ }
+ js_compress(filename, fname, do_strip, keep_header);
+
+ if (compress) {
+ uint8_t *buf1, *buf2;
+ int buf1_len, buf2_len;
+
+ buf1_len = load_file(&buf1, fname);
+ unlink(fname);
+ buf2_len = lz_compress(&buf2, buf1, buf1_len);
+ if (buf2_len < 0) {
+ fprintf(stderr, "Could not compress file (UTF8 chars are forbidden)\n");
+ exit(1);
+ }
+
+ if (c_var) {
+ save_c_source(out_filename, buf2, buf2_len, c_var);
+ } else {
+ save_file(out_filename, buf2, buf2_len);
+ }
+ free(buf1);
+ free(buf2);
+ }
+ return 0;
+}
diff --git a/thirdparty/quickjs/quickjs-2019-07-09-dust3d/libbf.c b/thirdparty/quickjs/quickjs-2019-07-09-dust3d/libbf.c
new file mode 100755
index 00000000..e848c38d
--- /dev/null
+++ b/thirdparty/quickjs/quickjs-2019-07-09-dust3d/libbf.c
@@ -0,0 +1,5805 @@
+/*
+ * Tiny arbitrary precision floating point library
+ *
+ * Copyright (c) 2017-2018 Fabrice Bellard
+ *
+ * Permission is hereby granted, free of charge, to any person obtaining a copy
+ * of this software and associated documentation files (the "Software"), to deal
+ * in the Software without restriction, including without limitation the rights
+ * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+ * copies of the Software, and to permit persons to whom the Software is
+ * furnished to do so, subject to the following conditions:
+ *
+ * The above copyright notice and this permission notice shall be included in
+ * all copies or substantial portions of the Software.
+ *
+ * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+ * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+ * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
+ * THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+ * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+ * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
+ * THE SOFTWARE.
+ */
+#include
+#include
+#include
+#include
+#include
+#include
+
+#ifdef __AVX2__
+#include
+#endif
+
+#include "cutils.h"
+#include "libbf.h"
+
+/* enable it to check the multiplication result */
+//#define USE_MUL_CHECK
+/* enable it to use FFT/NTT multiplication */
+#define USE_FFT_MUL
+
+//#define inline __attribute__((always_inline))
+#define unused __attribute__((unused))
+
+#ifdef __AVX2__
+#define FFT_MUL_THRESHOLD 100 /* in limbs of the smallest factor */
+#else
+#define FFT_MUL_THRESHOLD 100 /* in limbs of the smallest factor */
+#endif
+
+/* XXX: adjust */
+#define BASECASE_DIV_THRESHOLD_B 300
+#define BASECASE_DIV_THRESHOLD_Q 300
+
+#if LIMB_BITS == 64
+#define FMT_LIMB1 "%" PRIx64
+#define FMT_LIMB "%016" PRIx64
+#define PRId_LIMB PRId64
+#define PRIu_LIMB PRIu64
+
+#else
+
+#define FMT_LIMB1 "%x"
+#define FMT_LIMB "%08x"
+#define PRId_LIMB "d"
+#define PRIu_LIMB "u"
+
+#endif
+
+typedef int bf_op2_func_t(bf_t *r, const bf_t *a, const bf_t *b, limb_t prec,
+ bf_flags_t flags);
+
+#ifdef USE_FFT_MUL
+
+#define FFT_MUL_R_OVERLAP_A (1 << 0)
+#define FFT_MUL_R_OVERLAP_B (1 << 1)
+
+static no_inline void fft_mul(bf_t *res, limb_t *a_tab, limb_t a_len,
+ limb_t *b_tab, limb_t b_len, int mul_flags);
+static void fft_clear_cache(bf_context_t *s);
+#endif
+
+/* could leading zeros */
+static inline int clz(limb_t a)
+{
+ if (a == 0) {
+ return LIMB_BITS;
+ } else {
+#if LIMB_BITS == 64
+ return clz64(a);
+#else
+ return clz32(a);
+#endif
+ }
+}
+
+static inline int ctz(limb_t a)
+{
+ if (a == 0) {
+ return LIMB_BITS;
+ } else {
+#if LIMB_BITS == 64
+ return ctz64(a);
+#else
+ return ctz32(a);
+#endif
+ }
+}
+
+static inline int ceil_log2(limb_t a)
+{
+ if (a <= 1)
+ return 0;
+ else
+ return LIMB_BITS - clz(a - 1);
+}
+
+#if 0
+static inline slimb_t ceil_div(slimb_t a, limb_t b)
+{
+ if (a >= 0)
+ return (a + b - 1) / b;
+ else
+ return a / (slimb_t)b;
+}
+
+static inline slimb_t floor_div(slimb_t a, limb_t b)
+{
+ if (a >= 0) {
+ return a / b;
+ } else {
+ return (a - b + 1) / (slimb_t)b;
+ }
+}
+#endif
+
+#define malloc(s) malloc_is_forbidden(s)
+#define free(p) free_is_forbidden(p)
+#define realloc(p, s) realloc_is_forbidden(p, s)
+
+void bf_context_init(bf_context_t *s, bf_realloc_func_t *realloc_func,
+ void *realloc_opaque)
+{
+ memset(s, 0, sizeof(*s));
+ s->realloc_func = realloc_func;
+ s->realloc_opaque = realloc_opaque;
+}
+
+void bf_context_end(bf_context_t *s)
+{
+ bf_clear_cache(s);
+}
+
+/* 'size' must be > 0 */
+static void *bf_malloc(bf_context_t *s, size_t size)
+{
+ return bf_realloc(s, NULL, size);
+}
+
+static void bf_free(bf_context_t *s, void *ptr)
+{
+ bf_realloc(s, ptr, 0);
+}
+
+void bf_init(bf_context_t *s, bf_t *r)
+{
+ r->ctx = s;
+ r->sign = 0;
+ r->expn = BF_EXP_ZERO;
+ r->len = 0;
+ r->tab = NULL;
+}
+
+void bf_resize(bf_t *r, limb_t len)
+{
+ if (len != r->len) {
+ r->tab = bf_realloc(r->ctx, r->tab, len * sizeof(limb_t));
+ r->len = len;
+ }
+}
+
+void bf_set_ui(bf_t *r, uint64_t a)
+{
+ r->sign = 0;
+ if (a == 0) {
+ r->expn = BF_EXP_ZERO;
+ bf_resize(r, 0);
+ }
+#if LIMB_BITS == 32
+ else if (a <= 0xffffffff)
+#else
+ else
+#endif
+ {
+ int shift;
+ bf_resize(r, 1);
+ shift = clz(a);
+ r->tab[0] = a << shift;
+ r->expn = LIMB_BITS - shift;
+ }
+#if LIMB_BITS == 32
+ else {
+ uint32_t a1, a0;
+ int shift;
+ bf_resize(r, 2);
+ a0 = a;
+ a1 = a >> 32;
+ shift = clz(a1);
+ r->tab[0] = a0 << shift;
+ r->tab[1] = (a1 << shift) | (a0 >> (LIMB_BITS - shift));
+ r->expn = 2 * LIMB_BITS - shift;
+ }
+#endif
+}
+
+void bf_set_si(bf_t *r, int64_t a)
+{
+ if (a < 0) {
+ bf_set_ui(r, -a);
+ r->sign = 1;
+ } else {
+ bf_set_ui(r, a);
+ }
+}
+
+void bf_set_nan(bf_t *r)
+{
+ bf_resize(r, 0);
+ r->expn = BF_EXP_NAN;
+ r->sign = 0;
+}
+
+void bf_set_zero(bf_t *r, int is_neg)
+{
+ bf_resize(r, 0);
+ r->expn = BF_EXP_ZERO;
+ r->sign = is_neg;
+}
+
+void bf_set_inf(bf_t *r, int is_neg)
+{
+ bf_resize(r, 0);
+ r->expn = BF_EXP_INF;
+ r->sign = is_neg;
+}
+
+void bf_set(bf_t *r, const bf_t *a)
+{
+ if (r == a)
+ return;
+ r->sign = a->sign;
+ r->expn = a->expn;
+ bf_resize(r, a->len);
+ memcpy(r->tab, a->tab, a->len * sizeof(limb_t));
+}
+
+/* equivalent to bf_set(r, a); bf_delete(a) */
+void bf_move(bf_t *r, bf_t *a)
+{
+ bf_context_t *s = r->ctx;
+ if (r == a)
+ return;
+ bf_free(s, r->tab);
+ *r = *a;
+}
+
+static limb_t get_limbz(const bf_t *a, limb_t idx)
+{
+ if (idx >= a->len)
+ return 0;
+ else
+ return a->tab[idx];
+}
+
+/* get LIMB_BITS at bit position 'pos' in tab */
+static inline limb_t get_bits(const limb_t *tab, limb_t len, slimb_t pos)
+{
+ limb_t i, a0, a1;
+ int p;
+
+ i = pos >> LIMB_LOG2_BITS;
+ p = pos & (LIMB_BITS - 1);
+ if (i < len)
+ a0 = tab[i];
+ else
+ a0 = 0;
+ if (p == 0) {
+ return a0;
+ } else {
+ i++;
+ if (i < len)
+ a1 = tab[i];
+ else
+ a1 = 0;
+ return (a0 >> p) | (a1 << (LIMB_BITS - p));
+ }
+}
+
+static inline limb_t get_bit(const limb_t *tab, limb_t len, slimb_t pos)
+{
+ slimb_t i;
+ i = pos >> LIMB_LOG2_BITS;
+ if (i < 0 || i >= len)
+ return 0;
+ return (tab[i] >> (pos & (LIMB_BITS - 1))) & 1;
+}
+
+static inline limb_t limb_mask(int start, int last)
+{
+ limb_t v;
+ int n;
+ n = last - start + 1;
+ if (n == LIMB_BITS)
+ v = -1;
+ else
+ v = (((limb_t)1 << n) - 1) << start;
+ return v;
+}
+
+/* return != 0 if one bit between 0 and bit_pos inclusive is not zero. */
+static inline limb_t scan_bit_nz(const bf_t *r, slimb_t bit_pos)
+{
+ slimb_t pos;
+ limb_t v;
+
+ pos = bit_pos >> LIMB_LOG2_BITS;
+ if (pos < 0)
+ return 0;
+ v = r->tab[pos] & limb_mask(0, bit_pos & (LIMB_BITS - 1));
+ if (v != 0)
+ return 1;
+ pos--;
+ while (pos >= 0) {
+ if (r->tab[pos] != 0)
+ return 1;
+ pos--;
+ }
+ return 0;
+}
+
+/* return the addend for rounding. Note that prec can be <= 0 for bf_rint() */
+static int bf_get_rnd_add(int *pret, const bf_t *r, limb_t l,
+ slimb_t prec, int rnd_mode)
+{
+ int add_one, inexact;
+ limb_t bit1, bit0;
+
+ if (rnd_mode == BF_RNDF) {
+ bit0 = 1; /* faithful rounding does not honor the INEXACT flag */
+ } else {
+ /* starting limb for bit 'prec + 1' */
+ bit0 = scan_bit_nz(r, l * LIMB_BITS - 1 - bf_max(0, prec + 1));
+ }
+
+ /* get the bit at 'prec' */
+ bit1 = get_bit(r->tab, l, l * LIMB_BITS - 1 - prec);
+ inexact = (bit1 | bit0) != 0;
+
+ add_one = 0;
+ switch(rnd_mode) {
+ case BF_RNDZ:
+ break;
+ case BF_RNDN:
+ if (bit1) {
+ if (bit0) {
+ add_one = 1;
+ } else {
+ /* round to even */
+ add_one =
+ get_bit(r->tab, l, l * LIMB_BITS - 1 - (prec - 1));
+ }
+ }
+ break;
+ case BF_RNDD:
+ case BF_RNDU:
+ if (r->sign == (rnd_mode == BF_RNDD))
+ add_one = inexact;
+ break;
+ case BF_RNDNA:
+ case BF_RNDF:
+ add_one = bit1;
+ break;
+ case BF_RNDNU:
+ if (bit1) {
+ if (r->sign)
+ add_one = bit0;
+ else
+ add_one = 1;
+ }
+ break;
+ default:
+ abort();
+ }
+
+ if (inexact)
+ *pret |= BF_ST_INEXACT;
+ return add_one;
+}
+
+static int bf_set_overflow(bf_t *r, int sign, limb_t prec, bf_flags_t flags)
+{
+ slimb_t i, l, e_max;
+ int rnd_mode;
+
+ rnd_mode = flags & BF_RND_MASK;
+ if (prec == BF_PREC_INF ||
+ rnd_mode == BF_RNDN ||
+ rnd_mode == BF_RNDNA ||
+ rnd_mode == BF_RNDNU ||
+ (rnd_mode == BF_RNDD && sign == 1) ||
+ (rnd_mode == BF_RNDU && sign == 0)) {
+ bf_set_inf(r, sign);
+ } else {
+ /* set to maximum finite number */
+ l = (prec + LIMB_BITS - 1) / LIMB_BITS;
+ bf_resize(r, l);
+ r->tab[0] = limb_mask((-prec) & (LIMB_BITS - 1),
+ LIMB_BITS - 1);
+ for(i = 1; i < l; i++)
+ r->tab[i] = (limb_t)-1;
+ e_max = (limb_t)1 << (bf_get_exp_bits(flags) - 1);
+ r->expn = e_max;
+ r->sign = sign;
+ }
+ return BF_ST_OVERFLOW | BF_ST_INEXACT;
+}
+
+/* round to prec1 bits assuming 'r' is non zero and finite. 'r' is
+ assumed to have length 'l'. Note: 'prec1' can be negative or
+ infinite (BF_PREC_INF). */
+static int __bf_round(bf_t *r, limb_t prec1, bf_flags_t flags, limb_t l)
+{
+ limb_t v, a;
+ int shift, add_one, ret, rnd_mode;
+ slimb_t i, bit_pos, pos, e_min, e_max, e_range, prec;
+
+ /* e_min and e_max are computed to match the IEEE 754 conventions */
+ e_range = (limb_t)1 << (bf_get_exp_bits(flags) - 1);
+ e_min = -e_range + 3;
+ e_max = e_range;
+
+ if (unlikely(r->expn < e_min) && (flags & BF_FLAG_SUBNORMAL)) {
+ /* restrict the precision in case of potentially subnormal
+ result */
+ prec = prec1 - (e_min - r->expn);
+ } else {
+ prec = prec1;
+ }
+
+ /* round to prec bits */
+ rnd_mode = flags & BF_RND_MASK;
+ ret = 0;
+ add_one = bf_get_rnd_add(&ret, r, l, prec, rnd_mode);
+
+ if (prec <= 0) {
+ if (add_one) {
+ bf_resize(r, 1);
+ r->tab[0] = (limb_t)1 << (LIMB_BITS - 1);
+ r->expn += 1 - prec;
+ ret |= BF_ST_UNDERFLOW | BF_ST_INEXACT;
+ return ret;
+ } else {
+ goto underflow;
+ }
+ } else if (add_one) {
+ limb_t carry;
+
+ /* add one starting at digit 'prec - 1' */
+ bit_pos = l * LIMB_BITS - 1 - (prec - 1);
+ pos = bit_pos >> LIMB_LOG2_BITS;
+ carry = (limb_t)1 << (bit_pos & (LIMB_BITS - 1));
+
+ for(i = pos; i < l; i++) {
+ v = r->tab[i] + carry;
+ carry = (v < carry);
+ r->tab[i] = v;
+ if (carry == 0)
+ break;
+ }
+ if (carry) {
+ /* shift right by one digit */
+ v = 1;
+ for(i = l - 1; i >= pos; i--) {
+ a = r->tab[i];
+ r->tab[i] = (a >> 1) | (v << (LIMB_BITS - 1));
+ v = a;
+ }
+ r->expn++;
+ }
+ }
+
+ /* check underflow */
+ if (unlikely(r->expn < e_min)) {
+ if (flags & BF_FLAG_SUBNORMAL) {
+ /* if inexact, also set the underflow flag */
+ if (ret & BF_ST_INEXACT)
+ ret |= BF_ST_UNDERFLOW;
+ } else {
+ underflow:
+ ret |= BF_ST_UNDERFLOW | BF_ST_INEXACT;
+ bf_set_zero(r, r->sign);
+ return ret;
+ }
+ }
+
+ /* check overflow */
+ if (unlikely(r->expn > e_max))
+ return bf_set_overflow(r, r->sign, prec1, flags);
+
+ /* keep the bits starting at 'prec - 1' */
+ bit_pos = l * LIMB_BITS - 1 - (prec - 1);
+ i = bit_pos >> LIMB_LOG2_BITS;
+ if (i >= 0) {
+ shift = bit_pos & (LIMB_BITS - 1);
+ if (shift != 0)
+ r->tab[i] &= limb_mask(shift, LIMB_BITS - 1);
+ } else {
+ i = 0;
+ }
+ /* remove trailing zeros */
+ while (r->tab[i] == 0)
+ i++;
+ if (i > 0) {
+ l -= i;
+ memmove(r->tab, r->tab + i, l * sizeof(limb_t));
+ }
+ bf_resize(r, l);
+ return ret;
+}
+
+/* 'r' must be a finite number */
+int bf_normalize_and_round(bf_t *r, limb_t prec1, bf_flags_t flags)
+{
+ limb_t l, v, a;
+ int shift, ret;
+ slimb_t i;
+
+ // bf_print_str("bf_renorm", r);
+ l = r->len;
+ while (l > 0 && r->tab[l - 1] == 0)
+ l--;
+ if (l == 0) {
+ /* zero */
+ r->expn = BF_EXP_ZERO;
+ bf_resize(r, 0);
+ ret = 0;
+ } else {
+ r->expn -= (r->len - l) * LIMB_BITS;
+ /* shift to have the MSB set to '1' */
+ v = r->tab[l - 1];
+ shift = clz(v);
+ if (shift != 0) {
+ v = 0;
+ for(i = 0; i < l; i++) {
+ a = r->tab[i];
+ r->tab[i] = (a << shift) | (v >> (LIMB_BITS - shift));
+ v = a;
+ }
+ r->expn -= shift;
+ }
+ ret = __bf_round(r, prec1, flags, l);
+ }
+ // bf_print_str("r_final", r);
+ return ret;
+}
+
+/* return true if rounding can be done at precision 'prec' assuming
+ the exact result r is such that |r-a| <= 2^(EXP(a)-k). */
+/* XXX: check the case where the exponent would be incremented by the
+ rounding */
+int bf_can_round(const bf_t *a, slimb_t prec, bf_rnd_t rnd_mode, slimb_t k)
+{
+ BOOL is_rndn;
+ slimb_t bit_pos, n;
+ limb_t bit;
+
+ if (a->expn == BF_EXP_INF || a->expn == BF_EXP_NAN)
+ return FALSE;
+ if (rnd_mode == BF_RNDF) {
+ return (k >= (prec + 1));
+ }
+ if (a->expn == BF_EXP_ZERO)
+ return FALSE;
+ is_rndn = (rnd_mode == BF_RNDN || rnd_mode == BF_RNDNA ||
+ rnd_mode == BF_RNDNU);
+ if (k < (prec + 2))
+ return FALSE;
+ bit_pos = a->len * LIMB_BITS - 1 - prec;
+ n = k - prec;
+ /* bit pattern for RNDN or RNDNA: 0111.. or 1000...
+ for other rounding modes: 000... or 111...
+ */
+ bit = get_bit(a->tab, a->len, bit_pos);
+ bit_pos--;
+ n--;
+ bit ^= is_rndn;
+ /* XXX: slow, but a few iterations on average */
+ while (n != 0) {
+ if (get_bit(a->tab, a->len, bit_pos) != bit)
+ return TRUE;
+ bit_pos--;
+ n--;
+ }
+ return FALSE;
+}
+
+int bf_round(bf_t *r, limb_t prec, bf_flags_t flags)
+{
+ if (r->len == 0)
+ return 0;
+ return __bf_round(r, prec, flags, r->len);
+}
+
+/* for debugging */
+static unused void dump_limbs(const char *str, const limb_t *tab, limb_t n)
+{
+ limb_t i;
+ printf("%s: len=%" PRId_LIMB "\n", str, n);
+ for(i = 0; i < n; i++) {
+ printf("%" PRId_LIMB ": " FMT_LIMB "\n",
+ i, tab[i]);
+ }
+}
+
+/* for debugging */
+void bf_print_str(const char *str, const bf_t *a)
+{
+ slimb_t i;
+ printf("%s=", str);
+
+ if (a->expn == BF_EXP_NAN) {
+ printf("NaN");
+ } else {
+ if (a->sign)
+ putchar('-');
+ if (a->expn == BF_EXP_ZERO) {
+ putchar('0');
+ } else if (a->expn == BF_EXP_INF) {
+ printf("Inf");
+ } else {
+ printf("0x0.");
+ for(i = a->len - 1; i >= 0; i--)
+ printf(FMT_LIMB, a->tab[i]);
+ printf("p%" PRId_LIMB, a->expn);
+ }
+ }
+ printf("\n");
+}
+
+/* compare the absolute value of 'a' and 'b'. Return < 0 if a < b, 0
+ if a = b and > 0 otherwise. */
+int bf_cmpu(const bf_t *a, const bf_t *b)
+{
+ slimb_t i;
+ limb_t len, v1, v2;
+
+ if (a->expn != b->expn) {
+ if (a->expn < b->expn)
+ return -1;
+ else
+ return 1;
+ }
+ len = bf_max(a->len, b->len);
+ for(i = len - 1; i >= 0; i--) {
+ v1 = get_limbz(a, a->len - len + i);
+ v2 = get_limbz(b, b->len - len + i);
+ if (v1 != v2) {
+ if (v1 < v2)
+ return -1;
+ else
+ return 1;
+ }
+ }
+ return 0;
+}
+
+/* Full order: -0 < 0, NaN == NaN and NaN is larger than all other numbers */
+int bf_cmp_full(const bf_t *a, const bf_t *b)
+{
+ int res;
+
+ if (a->expn == BF_EXP_NAN || b->expn == BF_EXP_NAN) {
+ if (a->expn == b->expn)
+ res = 0;
+ else if (a->expn == BF_EXP_NAN)
+ res = 1;
+ else
+ res = -1;
+ } else if (a->sign != b->sign) {
+ res = 1 - 2 * a->sign;
+ } else {
+ res = bf_cmpu(a, b);
+ if (a->sign)
+ res = -res;
+ }
+ return res;
+}
+
+#define BF_CMP_EQ 1
+#define BF_CMP_LT 2
+#define BF_CMP_LE 3
+
+static int bf_cmp(const bf_t *a, const bf_t *b, int op)
+{
+ BOOL is_both_zero;
+ int res;
+
+ if (a->expn == BF_EXP_NAN || b->expn == BF_EXP_NAN)
+ return 0;
+ if (a->sign != b->sign) {
+ is_both_zero = (a->expn == BF_EXP_ZERO && b->expn == BF_EXP_ZERO);
+ if (is_both_zero) {
+ return op & BF_CMP_EQ;
+ } else if (op & BF_CMP_LT) {
+ return a->sign;
+ } else {
+ return FALSE;
+ }
+ } else {
+ res = bf_cmpu(a, b);
+ if (res == 0) {
+ return op & BF_CMP_EQ;
+ } else if (op & BF_CMP_LT) {
+ return (res < 0) ^ a->sign;
+ } else {
+ return FALSE;
+ }
+ }
+}
+
+int bf_cmp_eq(const bf_t *a, const bf_t *b)
+{
+ return bf_cmp(a, b, BF_CMP_EQ);
+}
+
+int bf_cmp_le(const bf_t *a, const bf_t *b)
+{
+ return bf_cmp(a, b, BF_CMP_LE);
+}
+
+int bf_cmp_lt(const bf_t *a, const bf_t *b)
+{
+ return bf_cmp(a, b, BF_CMP_LT);
+}
+
+/* Compute the number of bits 'n' matching the pattern:
+ a= X1000..0
+ b= X0111..1
+
+ When computing a-b, the result will have at least n leading zero
+ bits.
+
+ Precondition: a > b and a.expn - b.expn = 0 or 1
+*/
+static limb_t count_cancelled_bits(const bf_t *a, const bf_t *b)
+{
+ slimb_t bit_offset, b_offset, n;
+ int p, p1;
+ limb_t v1, v2, mask;
+
+ bit_offset = a->len * LIMB_BITS - 1;
+ b_offset = (b->len - a->len) * LIMB_BITS - (LIMB_BITS - 1) +
+ a->expn - b->expn;
+ n = 0;
+
+ /* first search the equals bits */
+ for(;;) {
+ v1 = get_limbz(a, bit_offset >> LIMB_LOG2_BITS);
+ v2 = get_bits(b->tab, b->len, bit_offset + b_offset);
+ // printf("v1=" FMT_LIMB " v2=" FMT_LIMB "\n", v1, v2);
+ if (v1 != v2)
+ break;
+ n += LIMB_BITS;
+ bit_offset -= LIMB_BITS;
+ }
+ /* find the position of the first different bit */
+ p = clz(v1 ^ v2) + 1;
+ n += p;
+ /* then search for '0' in a and '1' in b */
+ p = LIMB_BITS - p;
+ if (p > 0) {
+ /* search in the trailing p bits of v1 and v2 */
+ mask = limb_mask(0, p - 1);
+ p1 = bf_min(clz(v1 & mask), clz((~v2) & mask)) - (LIMB_BITS - p);
+ n += p1;
+ if (p1 != p)
+ goto done;
+ }
+ bit_offset -= LIMB_BITS;
+ for(;;) {
+ v1 = get_limbz(a, bit_offset >> LIMB_LOG2_BITS);
+ v2 = get_bits(b->tab, b->len, bit_offset + b_offset);
+ // printf("v1=" FMT_LIMB " v2=" FMT_LIMB "\n", v1, v2);
+ if (v1 != 0 || v2 != -1) {
+ /* different: count the matching bits */
+ p1 = bf_min(clz(v1), clz(~v2));
+ n += p1;
+ break;
+ }
+ n += LIMB_BITS;
+ bit_offset -= LIMB_BITS;
+ }
+ done:
+ return n;
+}
+
+static int bf_add_internal(bf_t *r, const bf_t *a, const bf_t *b, limb_t prec,
+ bf_flags_t flags, int b_neg)
+{
+ const bf_t *tmp;
+ int is_sub, ret, cmp_res, a_sign, b_sign;
+
+ a_sign = a->sign;
+ b_sign = b->sign ^ b_neg;
+ is_sub = a_sign ^ b_sign;
+ cmp_res = bf_cmpu(a, b);
+ if (cmp_res < 0) {
+ tmp = a;
+ a = b;
+ b = tmp;
+ a_sign = b_sign; /* b_sign is never used later */
+ }
+ /* abs(a) >= abs(b) */
+ if (cmp_res == 0 && is_sub && a->expn < BF_EXP_INF) {
+ /* zero result */
+ bf_set_zero(r, (flags & BF_RND_MASK) == BF_RNDD);
+ ret = 0;
+ } else if (a->len == 0 || b->len == 0) {
+ ret = 0;
+ if (a->expn >= BF_EXP_INF) {
+ if (a->expn == BF_EXP_NAN) {
+ /* at least one operand is NaN */
+ bf_set_nan(r);
+ } else if (b->expn == BF_EXP_INF && is_sub) {
+ /* infinities with different signs */
+ bf_set_nan(r);
+ ret = BF_ST_INVALID_OP;
+ } else {
+ bf_set_inf(r, a_sign);
+ }
+ } else {
+ /* at least one zero and not subtract */
+ bf_set(r, a);
+ r->sign = a_sign;
+ goto renorm;
+ }
+ } else {
+ slimb_t d, a_offset, b_bit_offset, i, cancelled_bits;
+ limb_t carry, v1, v2, u, r_len, carry1, precl, tot_len, z, sub_mask;
+
+ r->sign = a_sign;
+ r->expn = a->expn;
+ d = a->expn - b->expn;
+ /* must add more precision for the leading cancelled bits in
+ subtraction */
+ if (is_sub) {
+ if (d <= 1)
+ cancelled_bits = count_cancelled_bits(a, b);
+ else
+ cancelled_bits = 1;
+ } else {
+ cancelled_bits = 0;
+ }
+
+ /* add two extra bits for rounding */
+ precl = (cancelled_bits + prec + 2 + LIMB_BITS - 1) / LIMB_BITS;
+ tot_len = bf_max(a->len, b->len + (d + LIMB_BITS - 1) / LIMB_BITS);
+ r_len = bf_min(precl, tot_len);
+ bf_resize(r, r_len);
+ a_offset = a->len - r_len;
+ b_bit_offset = (b->len - r_len) * LIMB_BITS + d;
+
+ /* compute the bits before for the rounding */
+ carry = is_sub;
+ z = 0;
+ sub_mask = -is_sub;
+ i = r_len - tot_len;
+ while (i < 0) {
+ slimb_t ap, bp;
+ BOOL inflag;
+
+ ap = a_offset + i;
+ bp = b_bit_offset + i * LIMB_BITS;
+ inflag = FALSE;
+ if (ap >= 0 && ap < a->len) {
+ v1 = a->tab[ap];
+ inflag = TRUE;
+ } else {
+ v1 = 0;
+ }
+ if (bp + LIMB_BITS > 0 && bp < (slimb_t)(b->len * LIMB_BITS)) {
+ v2 = get_bits(b->tab, b->len, bp);
+ inflag = TRUE;
+ } else {
+ v2 = 0;
+ }
+ if (!inflag) {
+ /* outside 'a' and 'b': go directly to the next value
+ inside a or b so that the running time does not
+ depend on the exponent difference */
+ i = 0;
+ if (ap < 0)
+ i = bf_min(i, -a_offset);
+ /* b_bit_offset + i * LIMB_BITS + LIMB_BITS >= 1
+ equivalent to
+ i >= ceil(-b_bit_offset + 1 - LIMB_BITS) / LIMB_BITS)
+ */
+ if (bp + LIMB_BITS <= 0)
+ i = bf_min(i, (-b_bit_offset) >> LIMB_LOG2_BITS);
+ } else {
+ i++;
+ }
+ v2 ^= sub_mask;
+ u = v1 + v2;
+ carry1 = u < v1;
+ u += carry;
+ carry = (u < carry) | carry1;
+ z |= u;
+ }
+ /* and the result */
+ for(i = 0; i < r_len; i++) {
+ v1 = get_limbz(a, a_offset + i);
+ v2 = get_bits(b->tab, b->len, b_bit_offset + i * LIMB_BITS);
+ v2 ^= sub_mask;
+ u = v1 + v2;
+ carry1 = u < v1;
+ u += carry;
+ carry = (u < carry) | carry1;
+ r->tab[i] = u;
+ }
+ /* set the extra bits for the rounding */
+ r->tab[0] |= (z != 0);
+
+ /* carry is only possible in add case */
+ if (!is_sub && carry) {
+ bf_resize(r, r_len + 1);
+ r->tab[r_len] = 1;
+ r->expn += LIMB_BITS;
+ }
+ renorm:
+ ret = bf_normalize_and_round(r, prec, flags);
+ }
+ return ret;
+}
+
+static int __bf_add(bf_t *r, const bf_t *a, const bf_t *b, limb_t prec,
+ bf_flags_t flags)
+{
+ return bf_add_internal(r, a, b, prec, flags, 0);
+}
+
+static int __bf_sub(bf_t *r, const bf_t *a, const bf_t *b, limb_t prec,
+ bf_flags_t flags)
+{
+ return bf_add_internal(r, a, b, prec, flags, 1);
+}
+
+static limb_t mp_add(limb_t *res, const limb_t *op1, const limb_t *op2,
+ limb_t n, limb_t carry)
+{
+ slimb_t i;
+ limb_t k, a, v, k1;
+
+ k = carry;
+ for(i=0;i> LIMB_BITS;
+ }
+ return l;
+}
+
+/* tabr[] -= taba[] * b. Return the value to substract to the high
+ word. */
+static limb_t mp_sub_mul1(limb_t *tabr, const limb_t *taba, limb_t n,
+ limb_t b)
+{
+ limb_t i, l;
+ dlimb_t t;
+
+ l = 0;
+ for(i = 0; i < n; i++) {
+ t = tabr[i] - (dlimb_t)taba[i] * (dlimb_t)b - l;
+ tabr[i] = t;
+ l = -(t >> LIMB_BITS);
+ }
+ return l;
+}
+
+/* WARNING: d must be >= 2^(LIMB_BITS-1) */
+static inline limb_t udiv1norm_init(limb_t d)
+{
+ limb_t a0, a1;
+ a1 = -d - 1;
+ a0 = -1;
+ return (((dlimb_t)a1 << LIMB_BITS) | a0) / d;
+}
+
+/* return the quotient and the remainder in '*pr'of 'a1*2^LIMB_BITS+a0
+ / d' with 0 <= a1 < d. */
+static inline limb_t udiv1norm(limb_t *pr, limb_t a1, limb_t a0,
+ limb_t d, limb_t d_inv)
+{
+ limb_t n1m, n_adj, q, r, ah;
+ dlimb_t a;
+ n1m = ((slimb_t)a0 >> (LIMB_BITS - 1));
+ n_adj = a0 + (n1m & d);
+ a = (dlimb_t)d_inv * (a1 - n1m) + n_adj;
+ q = (a >> LIMB_BITS) + a1;
+ /* compute a - q * r and update q so that the remainder is\
+ between 0 and d - 1 */
+ a = ((dlimb_t)a1 << LIMB_BITS) | a0;
+ a = a - (dlimb_t)q * d - d;
+ ah = a >> LIMB_BITS;
+ q += 1 + ah;
+ r = (limb_t)a + (ah & d);
+ *pr = r;
+ return q;
+}
+
+/* b must be >= 1 << (LIMB_BITS - 1) */
+static limb_t mp_div1norm(limb_t *tabr, const limb_t *taba, limb_t n,
+ limb_t b, limb_t r)
+{
+ slimb_t i;
+
+ if (n >= 3) {
+ limb_t b_inv;
+ b_inv = udiv1norm_init(b);
+ for(i = n - 1; i >= 0; i--) {
+ tabr[i] = udiv1norm(&r, r, taba[i], b, b_inv);
+ }
+ } else {
+ dlimb_t a1;
+ for(i = n - 1; i >= 0; i--) {
+ a1 = ((dlimb_t)r << LIMB_BITS) | taba[i];
+ tabr[i] = a1 / b;
+ r = a1 % b;
+ }
+ }
+ return r;
+}
+
+/* base case division: divides taba[0..na-1] by tabb[0..nb-1]. tabb[nb
+ - 1] must be >= 1 << (LIMB_BITS - 1). na - nb must be >= 0. 'taba'
+ is modified and contains the remainder (nb limbs). tabq[0..na-nb]
+ contains the quotient. taba[na] is modified. */
+static void mp_divnorm(limb_t *tabq,
+ limb_t *taba, limb_t na,
+ const limb_t *tabb, limb_t nb)
+{
+ limb_t r, a, c, q, v, b1, b1_inv, n, dummy_r;
+ slimb_t i;
+
+ b1 = tabb[nb - 1];
+ if (nb == 1) {
+ taba[0] = mp_div1norm(tabq, taba, na, b1, 0);
+ return;
+ }
+ taba[na] = 0;
+ n = na - nb;
+ if (n >= 3)
+ b1_inv = udiv1norm_init(b1);
+ else
+ b1_inv = 0;
+
+ /* XXX: could simplify the first iteration */
+ for(i = n; i >= 0; i--) {
+ if (unlikely(taba[i + nb] >= b1)) {
+ q = -1;
+ } else if (b1_inv) {
+ q = udiv1norm(&dummy_r, taba[i + nb], taba[i + nb - 1], b1, b1_inv);
+ } else {
+ dlimb_t al;
+ al = ((dlimb_t)taba[i + nb] << LIMB_BITS) | taba[i + nb - 1];
+ q = al / b1;
+ r = al % b1;
+ }
+ r = mp_sub_mul1(taba + i, tabb, nb, q);
+
+ v = taba[i + nb];
+ a = v - r;
+ c = (a > v);
+ taba[i + nb] = a;
+
+ if (c != 0) {
+ /* negative result */
+ for(;;) {
+ q--;
+ c = mp_add(taba + i, taba + i, tabb, nb, 0);
+ /* propagate carry and test if positive result */
+ if (c != 0) {
+ if (++taba[i + nb] == 0) {
+ break;
+ }
+ }
+ }
+ }
+ tabq[i] = q;
+ }
+}
+
+int bf_mul(bf_t *r, const bf_t *a, const bf_t *b, limb_t prec,
+ bf_flags_t flags)
+{
+ limb_t i;
+ int ret, r_sign;
+
+ if (a->len < b->len) {
+ const bf_t *tmp = a;
+ a = b;
+ b = tmp;
+ }
+ r_sign = a->sign ^ b->sign;
+ /* here b->len <= a->len */
+ if (b->len == 0) {
+ if (a->expn == BF_EXP_NAN || b->expn == BF_EXP_NAN) {
+ bf_set_nan(r);
+ ret = 0;
+ } else if (a->expn == BF_EXP_INF || b->expn == BF_EXP_INF) {
+ if ((a->expn == BF_EXP_INF && b->expn == BF_EXP_ZERO) ||
+ (a->expn == BF_EXP_ZERO && b->expn == BF_EXP_INF)) {
+ bf_set_nan(r);
+ ret = BF_ST_INVALID_OP;
+ } else {
+ bf_set_inf(r, r_sign);
+ ret = 0;
+ }
+ } else {
+ bf_set_zero(r, r_sign);
+ ret = 0;
+ }
+ } else {
+ bf_t tmp, *r1 = NULL;
+ limb_t a_len, b_len, precl;
+ limb_t *a_tab, *b_tab;
+
+ a_len = a->len;
+ b_len = b->len;
+
+ if ((flags & BF_RND_MASK) == BF_RNDF) {
+ /* faithful rounding does not require using the full inputs */
+ precl = (prec + 2 + LIMB_BITS - 1) / LIMB_BITS;
+ a_len = bf_min(a_len, precl);
+ b_len = bf_min(b_len, precl);
+ }
+ a_tab = a->tab + a->len - a_len;
+ b_tab = b->tab + b->len - b_len;
+
+#ifdef USE_FFT_MUL
+ if (b_len >= FFT_MUL_THRESHOLD) {
+ int mul_flags = 0;
+ if (r == a)
+ mul_flags |= FFT_MUL_R_OVERLAP_A;
+ if (r == b)
+ mul_flags |= FFT_MUL_R_OVERLAP_B;
+ fft_mul(r, a_tab, a_len, b_tab, b_len, mul_flags);
+ } else
+#endif
+ {
+ if (r == a || r == b) {
+ bf_init(r->ctx, &tmp);
+ r1 = r;
+ r = &tmp;
+ }
+ bf_resize(r, a_len + b_len);
+ memset(r->tab, 0, sizeof(limb_t) * a_len);
+ for(i = 0; i < b_len; i++) {
+ r->tab[i + a_len] = mp_add_mul1(r->tab + i, a_tab, a_len,
+ b_tab[i]);
+ }
+ }
+ r->sign = r_sign;
+ r->expn = a->expn + b->expn;
+ ret = bf_normalize_and_round(r, prec, flags);
+ if (r == &tmp)
+ bf_move(r1, &tmp);
+ }
+ return ret;
+}
+
+/* multiply 'r' by 2^e */
+int bf_mul_2exp(bf_t *r, slimb_t e, limb_t prec, bf_flags_t flags)
+{
+ slimb_t e_max;
+ if (r->len == 0)
+ return 0;
+ e_max = ((limb_t)1 << BF_EXP_BITS_MAX) - 1;
+ e = bf_max(e, -e_max);
+ e = bf_min(e, e_max);
+ r->expn += e;
+ return __bf_round(r, prec, flags, r->len);
+}
+
+static void bf_recip_rec(bf_t *a, const bf_t *x, limb_t prec1)
+{
+ bf_t t0;
+ limb_t prec;
+
+ bf_init(a->ctx, &t0);
+
+ if (prec1 <= LIMB_BITS - 3) {
+ limb_t v;
+ /* initial approximation */
+ v = x->tab[x->len - 1];
+ /* 2^(L-1) <= v <= 2^L-1 (L=LIMB_BITS) */
+ v = ((dlimb_t)1 << (2 * LIMB_BITS - 2)) / v;
+ /* 2^(L-2) <= v <= 2^(L-1) */
+ bf_resize(a, 1);
+ a->sign = x->sign;
+ a->expn = 2 - x->expn;
+ if (v == ((limb_t)1 << (LIMB_BITS - 1))) {
+ a->tab[0] = v;
+ } else {
+ a->tab[0] = v << 1;
+ a->expn--;
+ }
+ a->tab[0] &= limb_mask(LIMB_BITS - prec1, LIMB_BITS - 1);
+ } else {
+ /* XXX: prove the added precision */
+ bf_recip_rec(a, x, (prec1 / 2) + 8);
+ prec = prec1 + 8;
+
+ /* a = a + a * (1 - x * a) */
+ bf_mul(&t0, x, a, prec, BF_RNDF);
+ t0.sign ^= 1;
+ bf_add_si(&t0, &t0, 1, prec, BF_RNDF);
+ bf_mul(&t0, &t0, a, prec, BF_RNDF);
+ bf_add(a, a, &t0, prec1, BF_RNDF);
+ }
+ // bf_print_str("r", a);
+ bf_delete(&t0);
+}
+
+/* Note: only faithful rounding is supported */
+void bf_recip(bf_t *r, const bf_t *a, limb_t prec)
+{
+ assert(r != a);
+ if (a->len == 0) {
+ if (a->expn == BF_EXP_NAN) {
+ bf_set_nan(r);
+ } else if (a->expn == BF_EXP_INF) {
+ bf_set_zero(r, a->sign);
+ } else {
+ bf_set_inf(r, a->sign);
+ }
+ } else {
+ // bf_print_str("a", a);
+ bf_recip_rec(r, a, prec);
+ }
+}
+
+/* add zero limbs if necessary to have at least precl limbs */
+static void bf_add_zero_limbs(bf_t *r, limb_t precl)
+{
+ limb_t l = r->len;
+ if (l < precl) {
+ bf_resize(r, precl);
+ memmove(r->tab + precl - l, r->tab,
+ l * sizeof(limb_t));
+ memset(r->tab, 0, (precl - l) * sizeof(limb_t));
+ }
+}
+
+/* set a bit to 1 at bit position >= (precl * LIMB_BITS - 1) */
+static void bf_or_one(bf_t *r, limb_t precl)
+{
+ bf_add_zero_limbs(r, precl);
+ r->tab[0] |= 1;
+}
+
+/* Return e such as a=m*2^e with m odd integer. return 0 if a is zero,
+ Infinite or Nan. */
+slimb_t bf_get_exp_min(const bf_t *a)
+{
+ slimb_t i;
+ limb_t v;
+ int k;
+
+ for(i = 0; i < a->len; i++) {
+ v = a->tab[i];
+ if (v != 0) {
+ k = ctz(v);
+ return a->expn - (a->len - i) * LIMB_BITS + k;
+ }
+ }
+ return 0;
+}
+
+/* a and b must be finite numbers with a >= 0 and b > 0. 'q' is the
+ integer defined as floor(a/b) and r = a - q * b. */
+static void bf_tdivremu(bf_t *q, bf_t *r,
+ const bf_t *a, const bf_t *b)
+{
+ if (a->expn < b->expn) {
+ bf_set_ui(q, 0);
+ bf_set(r, a);
+ } else {
+ /* for large numbers, use the floating point division in
+ faithful mode */
+ bf_div(q, a, b, bf_max(a->expn - b->expn + 1, 2), BF_RNDF);
+ bf_rint(q, BF_PREC_INF, BF_RNDZ);
+ bf_mul(r, q, b, BF_PREC_INF, BF_RNDN);
+ bf_sub(r, a, r, BF_PREC_INF, BF_RNDN);
+ if (r->len != 0 && r->sign) {
+ bf_add_si(q, q, -1, BF_PREC_INF, BF_RNDZ);
+ bf_add(r, r, b, BF_PREC_INF, BF_RNDZ);
+ }
+ }
+}
+
+static int __bf_div(bf_t *r, const bf_t *a, const bf_t *b, limb_t prec,
+ bf_flags_t flags)
+{
+ int ret, r_sign;
+ limb_t n, nb, precl;
+
+ r_sign = a->sign ^ b->sign;
+ if (a->expn >= BF_EXP_INF || b->expn >= BF_EXP_INF) {
+ if (a->expn == BF_EXP_NAN || b->expn == BF_EXP_NAN) {
+ bf_set_nan(r);
+ return 0;
+ } else if (a->expn == BF_EXP_INF && b->expn == BF_EXP_INF) {
+ bf_set_nan(r);
+ return BF_ST_INVALID_OP;
+ } else if (a->expn == BF_EXP_INF) {
+ bf_set_inf(r, r_sign);
+ return 0;
+ } else {
+ bf_set_zero(r, r_sign);
+ return 0;
+ }
+ } else if (a->expn == BF_EXP_ZERO) {
+ if (b->expn == BF_EXP_ZERO) {
+ bf_set_nan(r);
+ return BF_ST_INVALID_OP;
+ } else {
+ bf_set_zero(r, r_sign);
+ return 0;
+ }
+ } else if (b->expn == BF_EXP_ZERO) {
+ bf_set_inf(r, r_sign);
+ return BF_ST_DIVIDE_ZERO;
+ }
+
+ /* number of limbs of the quotient (2 extra bits for rounding) */
+ precl = (prec + 2 + LIMB_BITS - 1) / LIMB_BITS;
+ nb = b->len;
+ n = bf_max(a->len, precl);
+
+ if (nb <= BASECASE_DIV_THRESHOLD_B ||
+ (slimb_t)n <= (BASECASE_DIV_THRESHOLD_Q - 1)) {
+ limb_t *taba, na, i;
+ slimb_t d;
+
+ na = n + nb;
+ taba = bf_malloc(r->ctx, (na + 1) * sizeof(limb_t));
+ d = na - a->len;
+ memset(taba, 0, d * sizeof(limb_t));
+ memcpy(taba + d, a->tab, a->len * sizeof(limb_t));
+ bf_resize(r, n + 1);
+ mp_divnorm(r->tab, taba, na, b->tab, nb);
+
+ /* see if non zero remainder */
+ for(i = 0; i < nb; i++) {
+ if (taba[i] != 0) {
+ r->tab[0] |= 1;
+ break;
+ }
+ }
+ bf_free(r->ctx, taba);
+ r->expn = a->expn - b->expn + LIMB_BITS;
+ r->sign = r_sign;
+ ret = bf_normalize_and_round(r, prec, flags);
+ } else if ((flags & BF_RND_MASK) == BF_RNDF) {
+ bf_t b_inv;
+ bf_init(r->ctx, &b_inv);
+ bf_recip(&b_inv, b, prec + 3);
+ ret = bf_mul(r, a, &b_inv, prec, flags);
+ bf_delete(&b_inv);
+ } else {
+ bf_t a1_s, *a1 = &a1_s;
+ bf_t b1_s, *b1 = &b1_s;
+ bf_t rem_s, *rem = &rem_s;
+
+ /* convert the mantissa of 'a' and 'b' to integers and generate
+ a quotient with at least prec + 2 bits */
+ a1->expn = (n + nb) * LIMB_BITS;
+ a1->tab = a->tab;
+ a1->len = a->len;
+ a1->sign = 0;
+
+ b1->expn = nb * LIMB_BITS;
+ b1->tab = b->tab;
+ b1->len = nb;
+ b1->sign = 0;
+
+ bf_init(r->ctx, rem);
+ bf_tdivremu(r, rem, a1, b1);
+ /* the remainder is not zero: put it in the rounding bits */
+ if (rem->len != 0) {
+ bf_or_one(r, precl);
+ }
+ bf_delete(rem);
+ r->expn += a->expn - b->expn - n * LIMB_BITS;
+ r->sign = r_sign;
+ ret = bf_round(r, prec, flags);
+ }
+ return ret;
+}
+
+/* division and remainder.
+
+ rnd_mode is the rounding mode for the quotient. The additional
+ rounding mode BF_RND_EUCLIDIAN is supported.
+
+ 'q' is an integer. 'r' is rounded with prec and flags (prec can be
+ BF_PREC_INF).
+*/
+int bf_divrem(bf_t *q, bf_t *r, const bf_t *a, const bf_t *b,
+ limb_t prec, bf_flags_t flags, int rnd_mode)
+{
+ bf_t a1_s, *a1 = &a1_s;
+ bf_t b1_s, *b1 = &b1_s;
+ int q_sign;
+ BOOL is_ceil, is_rndn;
+
+ assert(q != a && q != b);
+ assert(r != a && r != b);
+ assert(q != r);
+
+ if (a->len == 0 || b->len == 0) {
+ bf_set_zero(q, 0);
+ if (a->expn == BF_EXP_NAN || b->expn == BF_EXP_NAN) {
+ bf_set_nan(r);
+ return 0;
+ } else if (a->expn == BF_EXP_INF || b->expn == BF_EXP_ZERO) {
+ bf_set_nan(r);
+ return BF_ST_INVALID_OP;
+ } else {
+ bf_set(r, a);
+ return bf_round(r, prec, flags);
+ }
+ }
+
+ q_sign = a->sign ^ b->sign;
+ is_rndn = (rnd_mode == BF_RNDN || rnd_mode == BF_RNDNA ||
+ rnd_mode == BF_RNDNU);
+ switch(rnd_mode) {
+ default:
+ case BF_RNDZ:
+ case BF_RNDN:
+ case BF_RNDNA:
+ is_ceil = FALSE;
+ break;
+ case BF_RNDD:
+ is_ceil = q_sign;
+ break;
+ case BF_RNDU:
+ is_ceil = q_sign ^ 1;
+ break;
+ case BF_DIVREM_EUCLIDIAN:
+ is_ceil = a->sign;
+ break;
+ case BF_RNDNU:
+ /* XXX: unsupported yet */
+ abort();
+ }
+
+ a1->expn = a->expn;
+ a1->tab = a->tab;
+ a1->len = a->len;
+ a1->sign = 0;
+
+ b1->expn = b->expn;
+ b1->tab = b->tab;
+ b1->len = b->len;
+ b1->sign = 0;
+
+ /* XXX: could improve to avoid having a large 'q' */
+ bf_tdivremu(q, r, a1, b1);
+
+ if (r->len != 0) {
+ if (is_rndn) {
+ int res;
+ b1->expn--;
+ res = bf_cmpu(r, b1);
+ b1->expn++;
+ if (res > 0 ||
+ (res == 0 &&
+ (rnd_mode == BF_RNDNA ||
+ get_bit(q->tab, q->len, q->len * LIMB_BITS - q->expn)))) {
+ goto do_sub_r;
+ }
+ } else if (is_ceil) {
+ do_sub_r:
+ bf_add_si(q, q, 1, BF_PREC_INF, BF_RNDZ);
+ bf_sub(r, r, b1, BF_PREC_INF, BF_RNDZ);
+ }
+ }
+
+ r->sign ^= a->sign;
+ q->sign = q_sign;
+ return bf_round(r, prec, flags);
+}
+
+int bf_fmod(bf_t *r, const bf_t *a, const bf_t *b, limb_t prec,
+ bf_flags_t flags)
+{
+ bf_t q_s, *q = &q_s;
+ int ret;
+
+ bf_init(r->ctx, q);
+ ret = bf_divrem(q, r, a, b, prec, flags, BF_RNDZ);
+ bf_delete(q);
+ return ret;
+}
+
+int bf_remainder(bf_t *r, const bf_t *a, const bf_t *b, limb_t prec,
+ bf_flags_t flags)
+{
+ bf_t q_s, *q = &q_s;
+ int ret;
+
+ bf_init(r->ctx, q);
+ ret = bf_divrem(q, r, a, b, prec, flags, BF_RNDN);
+ bf_delete(q);
+ return ret;
+}
+
+static inline int bf_get_limb(slimb_t *pres, const bf_t *a, int flags)
+{
+#if LIMB_BITS == 32
+ return bf_get_int32(pres, a, flags);
+#else
+ return bf_get_int64(pres, a, flags);
+#endif
+}
+
+int bf_remquo(slimb_t *pq, bf_t *r, const bf_t *a, const bf_t *b, limb_t prec,
+ bf_flags_t flags)
+{
+ bf_t q_s, *q = &q_s;
+ int ret;
+
+ bf_init(r->ctx, q);
+ ret = bf_divrem(q, r, a, b, prec, flags, BF_RNDN);
+ bf_get_limb(pq, q, BF_GET_INT_MOD);
+ bf_delete(q);
+ return ret;
+}
+
+static unused inline limb_t mul_mod(limb_t a, limb_t b, limb_t m)
+{
+ dlimb_t t;
+ t = (dlimb_t)a * (dlimb_t)b;
+ return t % m;
+}
+
+#if defined(USE_MUL_CHECK)
+static limb_t mp_mod1(const limb_t *tab, limb_t n, limb_t m, limb_t r)
+{
+ slimb_t i;
+ dlimb_t t;
+
+ for(i = n - 1; i >= 0; i--) {
+ t = ((dlimb_t)r << LIMB_BITS) | tab[i];
+ r = t % m;
+ }
+ return r;
+}
+#endif
+
+/* (128.0 / sqrt((i + 64) / 256)) & 0xff */
+static const uint8_t rsqrt_table[192] = {
+ 0,254,252,250,248,247,245,243,241,240,238,236,235,233,232,230,
+229,228,226,225,223,222,221,220,218,217,216,215,214,212,211,210,
+209,208,207,206,205,204,203,202,201,200,199,198,197,196,195,194,
+194,193,192,191,190,189,189,188,187,186,185,185,184,183,182,182,
+181,180,180,179,178,178,177,176,176,175,174,174,173,172,172,171,
+171,170,169,169,168,168,167,167,166,166,165,164,164,163,163,162,
+162,161,161,160,160,159,159,158,158,158,157,157,156,156,155,155,
+154,154,154,153,153,152,152,151,151,151,150,150,149,149,149,148,
+148,147,147,147,146,146,146,145,145,144,144,144,143,143,143,142,
+142,142,141,141,141,140,140,140,139,139,139,138,138,138,137,137,
+137,137,136,136,136,135,135,135,134,134,134,134,133,133,133,132,
+132,132,132,131,131,131,131,130,130,130,130,129,129,129,129,128,
+};
+
+static void __bf_rsqrt(bf_t *a, const bf_t *x, limb_t prec1)
+{
+ bf_t t0;
+ limb_t prec;
+
+ if (prec1 <= 7) {
+ slimb_t e;
+ limb_t v;
+ /* initial approximation using 8 mantissa bits */
+ v = x->tab[x->len - 1];
+ e = x->expn;
+ if (e & 1) {
+ v >>= 1;
+ e++;
+ }
+ v = rsqrt_table[(v >> (LIMB_BITS - 8)) - 64];
+ e = 1 - (e / 2);
+ if (v == 0) {
+ v = 128; /* real table value is 256 */
+ e++;
+ }
+ bf_resize(a, 1);
+ a->tab[0] = (v << (LIMB_BITS - 8)) &
+ limb_mask(LIMB_BITS - prec1, LIMB_BITS - 1);
+ a->expn = e;
+ a->sign = 0;
+ } else {
+ /* XXX: prove rounding */
+ __bf_rsqrt(a, x, (prec1 / 2) + 2);
+
+ prec = prec1 + 3;
+
+ /* x' = x + (x/2) * (1 - a * x^2) */
+ bf_init(a->ctx, &t0);
+
+ bf_mul(&t0, a, a, prec, BF_RNDF);
+ bf_mul(&t0, &t0, x, prec, BF_RNDF);
+ t0.sign ^= 1;
+ bf_add_si(&t0, &t0, 1, prec, BF_RNDF);
+ bf_mul(&t0, &t0, a, prec, BF_RNDF);
+ if (t0.len != 0)
+ t0.expn--;
+ bf_add(a, a, &t0, prec1, BF_RNDF);
+
+ bf_delete(&t0);
+ }
+}
+
+static int __bf_sqrt(bf_t *x, const bf_t *a, limb_t prec1, bf_flags_t flags)
+{
+ bf_t t0, t1;
+ limb_t prec;
+ int ret;
+
+ /* XXX: prove rounding */
+ __bf_rsqrt(x, a, (prec1 / 2) + 2);
+ prec = prec1 + 3;
+
+ /* x' = a * x + (x/2) * (a - (a * x)^2) */
+
+ bf_init(x->ctx, &t0);
+ bf_init(x->ctx, &t1);
+ bf_mul(&t1, x, a, prec, BF_RNDF);
+ bf_mul(&t0, &t1, &t1, prec, BF_RNDF);
+ t0.sign ^= 1;
+ bf_add(&t0, &t0, a, prec, BF_RNDF);
+ bf_mul(&t0, &t0, x, prec, BF_RNDF);
+ if (t0.len != 0)
+ t0.expn--;
+ ret = bf_add(x, &t1, &t0, prec1, flags);
+
+ bf_delete(&t0);
+ bf_delete(&t1);
+ return ret;
+}
+
+/* Note: only faithful rounding is supported */
+void bf_rsqrt(bf_t *r, const bf_t *a, limb_t prec)
+{
+ if (a->len == 0) {
+ if (a->expn == BF_EXP_NAN ||
+ (a->sign && a->expn != BF_EXP_ZERO)) {
+ bf_set_nan(r);
+ } else if (a->expn == BF_EXP_INF) {
+ bf_set_zero(r, a->sign);
+ } else {
+ bf_set_inf(r, 0);
+ }
+ } else if (a->sign) {
+ bf_set_nan(r);
+ } else {
+ // bf_print_str("a", a);
+ __bf_rsqrt(r, a, prec);
+ }
+}
+
+/* return floor(sqrt(a)) */
+static limb_t bf_isqrt(limb_t a)
+{
+ unsigned int l;
+ limb_t u, s;
+
+ if (a == 0)
+ return 0;
+ l = ceil_log2(a);
+ u = (limb_t)1 << ((l + 1) / 2);
+ /* u >= floor(sqrt(a)) */
+ for(;;) {
+ s = u;
+ u = ((a / s) + s) / 2;
+ if (u >= s)
+ break;
+ }
+ return s;
+}
+
+/* Integer square root with remainder. 'a' must be an integer. r =
+ floor(sqrt(a)) and rem = a - r^2. BF_ST_INEXACT is set if the result
+ is inexact. 'rem' can be NULL if the remainder is not needed. */
+int bf_sqrtrem(bf_t *r, bf_t *rem1, const bf_t *a)
+{
+ int ret;
+
+ if (a->len == 0) {
+ if (a->expn == BF_EXP_NAN) {
+ bf_set_nan(r);
+ } else if (a->expn == BF_EXP_INF && a->sign) {
+ goto invalid_op;
+ } else {
+ bf_set(r, a);
+ }
+ if (rem1)
+ bf_set_ui(rem1, 0);
+ ret = 0;
+ } else if (a->sign) {
+ invalid_op:
+ bf_set_nan(r);
+ if (rem1)
+ bf_set_ui(rem1, 0);
+ ret = BF_ST_INVALID_OP;
+ } else {
+ bf_t rem_s, *rem;
+ int res;
+
+ bf_sqrt(r, a, (a->expn + 1) / 2, BF_RNDF);
+ bf_rint(r, BF_PREC_INF, BF_RNDZ);
+ /* see if the result is exact by computing the remainder */
+ if (rem1) {
+ rem = rem1;
+ } else {
+ rem = &rem_s;
+ bf_init(r->ctx, rem);
+ }
+ bf_mul(rem, r, r, BF_PREC_INF, BF_RNDZ);
+ ret = 0;
+ if (rem1) {
+ bf_neg(rem);
+ bf_add(rem, rem, a, BF_PREC_INF, BF_RNDZ);
+ if (rem->len != 0) {
+ ret = BF_ST_INEXACT;
+ if (rem->sign) {
+ bf_t a1_s, *a1 = &a1_s;
+ bf_add_si(r, r, -1, BF_PREC_INF, BF_RNDZ);
+ a1->tab = a->tab;
+ a1->len = a->len;
+ a1->sign = a->sign;
+ a1->expn = a->expn + 1;
+ bf_add(rem, rem, r, BF_PREC_INF, BF_RNDZ);
+ bf_add_si(rem, rem, 1, BF_PREC_INF, BF_RNDZ);
+ }
+ } else {
+ ret = 0;
+ }
+ } else {
+ res = bf_cmpu(rem, a);
+ bf_delete(rem);
+ // printf("res2=%d\n", res2);
+ if (res > 0) {
+ /* need to correct the result */
+ bf_add_si(r, r, -1, BF_PREC_INF, BF_RNDZ);
+ }
+ ret = (res != 0 ? BF_ST_INEXACT : 0);
+ }
+ }
+ return ret;
+}
+
+int bf_sqrt(bf_t *r, const bf_t *a, limb_t prec, bf_flags_t flags)
+{
+ int rnd_mode, ret;
+
+ assert(r != a);
+
+ if (a->len == 0) {
+ if (a->expn == BF_EXP_NAN) {
+ bf_set_nan(r);
+ } else if (a->expn == BF_EXP_INF && a->sign) {
+ goto invalid_op;
+ } else {
+ bf_set(r, a);
+ }
+ ret = 0;
+ } else if (a->sign) {
+ invalid_op:
+ bf_set_nan(r);
+ ret = BF_ST_INVALID_OP;
+ } else {
+ rnd_mode = flags & BF_RND_MASK;
+ if (rnd_mode == BF_RNDF) {
+ ret = __bf_sqrt(r, a, prec, flags);
+ } else {
+ bf_t a1_s, *a1 = &a1_s;
+ slimb_t d, prec2;
+ int res1, res2;
+
+ bf_init(r->ctx, a1);
+ bf_set(a1, a);
+ /* convert the mantissa to an integer with at most 2 *
+ prec + 4 bits */
+ prec2 = prec + 2;
+ /* make '-a->expn + d' divisible by two */
+ d = prec2 * 2 - (a->expn & 1);
+ a1->expn = d;
+ res1 = bf_rint(a1, BF_PREC_INF, BF_RNDZ);
+ res2 = bf_sqrtrem(r, NULL, a1);
+ bf_delete(a1);
+ if ((res2 | res1) != 0) {
+ bf_or_one(r, (prec2 + LIMB_BITS - 1) / LIMB_BITS);
+ }
+ /* update the exponent */
+ r->expn -= (-a->expn + d) >> 1;
+ ret = bf_round(r, prec, flags);
+ }
+ }
+ return ret;
+}
+
+static no_inline int bf_op2(bf_t *r, const bf_t *a, const bf_t *b, limb_t prec,
+ bf_flags_t flags, bf_op2_func_t *func)
+{
+ bf_t tmp;
+ int ret;
+
+ if (r == a || r == b) {
+ bf_init(r->ctx, &tmp);
+ ret = func(&tmp, a, b, prec, flags);
+ bf_move(r, &tmp);
+ } else {
+ ret = func(r, a, b, prec, flags);
+ }
+ return ret;
+}
+
+int bf_add(bf_t *r, const bf_t *a, const bf_t *b, limb_t prec,
+ bf_flags_t flags)
+{
+ return bf_op2(r, a, b, prec, flags, __bf_add);
+}
+
+int bf_sub(bf_t *r, const bf_t *a, const bf_t *b, limb_t prec,
+ bf_flags_t flags)
+{
+ return bf_op2(r, a, b, prec, flags, __bf_sub);
+}
+
+int bf_div(bf_t *r, const bf_t *a, const bf_t *b, limb_t prec,
+ bf_flags_t flags)
+{
+ return bf_op2(r, a, b, prec, flags, __bf_div);
+}
+
+int bf_mul_ui(bf_t *r, const bf_t *a, uint64_t b1, limb_t prec,
+ bf_flags_t flags)
+{
+ bf_t b;
+ int ret;
+ bf_init(r->ctx, &b);
+ bf_set_ui(&b, b1);
+ ret = bf_mul(r, a, &b, prec, flags);
+ bf_delete(&b);
+ return ret;
+}
+
+int bf_mul_si(bf_t *r, const bf_t *a, int64_t b1, limb_t prec,
+ bf_flags_t flags)
+{
+ bf_t b;
+ int ret;
+ bf_init(r->ctx, &b);
+ bf_set_si(&b, b1);
+ ret = bf_mul(r, a, &b, prec, flags);
+ bf_delete(&b);
+ return ret;
+}
+
+int bf_add_si(bf_t *r, const bf_t *a, int64_t b1, limb_t prec,
+ bf_flags_t flags)
+{
+ bf_t b;
+ int ret;
+
+ bf_init(r->ctx, &b);
+ bf_set_si(&b, b1);
+ ret = bf_add(r, a, &b, prec, flags);
+ bf_delete(&b);
+ return ret;
+}
+
+int bf_pow_ui(bf_t *r, const bf_t *a, limb_t b, limb_t prec,
+ bf_flags_t flags)
+{
+ int ret, n_bits, i;
+
+ assert(r != a);
+ if (b == 0) {
+ bf_set_ui(r, 1);
+ return 0;
+ }
+ bf_set(r, a);
+ ret = 0;
+ n_bits = LIMB_BITS - clz(b);
+ for(i = n_bits - 2; i >= 0; i--) {
+ ret |= bf_mul(r, r, r, prec, flags);
+ if ((b >> i) & 1)
+ ret |= bf_mul(r, r, a, prec, flags);
+ }
+ return ret;
+}
+
+int bf_pow_ui_ui(bf_t *r, limb_t a1, limb_t b, limb_t prec, bf_flags_t flags)
+{
+ bf_t a;
+ int ret;
+
+ bf_init(r->ctx, &a);
+ bf_set_ui(&a, a1);
+ ret = bf_pow_ui(r, &a, b, prec, flags);
+ bf_delete(&a);
+ return ret;
+}
+
+/* convert to integer (single rounding) */
+int bf_rint(bf_t *r, limb_t prec, bf_flags_t flags)
+{
+ int ret;
+ if (r->len == 0)
+ return 0;
+ if (r->expn <= 0) {
+ ret = __bf_round(r, r->expn, flags & ~BF_FLAG_SUBNORMAL, r->len) &
+ ~BF_ST_UNDERFLOW;
+ } else {
+ ret = __bf_round(r, bf_min(r->expn, prec), flags, r->len);
+ }
+ return ret;
+}
+
+/* logical operations */
+#define BF_LOGIC_OR 0
+#define BF_LOGIC_XOR 1
+#define BF_LOGIC_AND 2
+
+static inline limb_t bf_logic_op1(limb_t a, limb_t b, int op)
+{
+ switch(op) {
+ case BF_LOGIC_OR:
+ return a | b;
+ case BF_LOGIC_XOR:
+ return a ^ b;
+ default:
+ case BF_LOGIC_AND:
+ return a & b;
+ }
+}
+
+static void bf_logic_op(bf_t *r, const bf_t *a1, const bf_t *b1, int op)
+{
+ bf_t b1_s, a1_s, *a, *b;
+ limb_t a_sign, b_sign, r_sign;
+ slimb_t l, i, a_bit_offset, b_bit_offset;
+ limb_t v1, v2, v1_mask, v2_mask, r_mask;
+
+ assert(r != a1 && r != b1);
+
+ if (a1->expn <= 0)
+ a_sign = 0; /* minus zero is considered as positive */
+ else
+ a_sign = a1->sign;
+
+ if (b1->expn <= 0)
+ b_sign = 0; /* minus zero is considered as positive */
+ else
+ b_sign = b1->sign;
+
+ if (a_sign) {
+ a = &a1_s;
+ bf_init(r->ctx, a);
+ bf_add_si(a, a1, 1, BF_PREC_INF, BF_RNDZ);
+ } else {
+ a = (bf_t *)a1;
+ }
+
+ if (b_sign) {
+ b = &b1_s;
+ bf_init(r->ctx, b);
+ bf_add_si(b, b1, 1, BF_PREC_INF, BF_RNDZ);
+ } else {
+ b = (bf_t *)b1;
+ }
+
+ r_sign = bf_logic_op1(a_sign, b_sign, op);
+ if (op == BF_LOGIC_AND && r_sign == 0) {
+ /* no need to compute extra zeros for and */
+ if (a_sign == 0 && b_sign == 0)
+ l = bf_min(a->expn, b->expn);
+ else if (a_sign == 0)
+ l = a->expn;
+ else
+ l = b->expn;
+ } else {
+ l = bf_max(a->expn, b->expn);
+ }
+ /* Note: a or b can be zero */
+ l = (bf_max(l, 1) + LIMB_BITS - 1) / LIMB_BITS;
+ bf_resize(r, l);
+ a_bit_offset = a->len * LIMB_BITS - a->expn;
+ b_bit_offset = b->len * LIMB_BITS - b->expn;
+ v1_mask = -a_sign;
+ v2_mask = -b_sign;
+ r_mask = -r_sign;
+ for(i = 0; i < l; i++) {
+ v1 = get_bits(a->tab, a->len, a_bit_offset + i * LIMB_BITS) ^ v1_mask;
+ v2 = get_bits(b->tab, b->len, b_bit_offset + i * LIMB_BITS) ^ v2_mask;
+ r->tab[i] = bf_logic_op1(v1, v2, op) ^ r_mask;
+ }
+ r->expn = l * LIMB_BITS;
+ r->sign = r_sign;
+ bf_normalize_and_round(r, BF_PREC_INF, BF_RNDZ);
+ if (r_sign)
+ bf_add_si(r, r, -1, BF_PREC_INF, BF_RNDZ);
+ if (a == &a1_s)
+ bf_delete(a);
+ if (b == &b1_s)
+ bf_delete(b);
+}
+
+/* 'a' and 'b' must be integers */
+void bf_logic_or(bf_t *r, const bf_t *a, const bf_t *b)
+{
+ bf_logic_op(r, a, b, BF_LOGIC_OR);
+}
+
+/* 'a' and 'b' must be integers */
+void bf_logic_xor(bf_t *r, const bf_t *a, const bf_t *b)
+{
+ bf_logic_op(r, a, b, BF_LOGIC_XOR);
+}
+
+/* 'a' and 'b' must be integers */
+void bf_logic_and(bf_t *r, const bf_t *a, const bf_t *b)
+{
+ bf_logic_op(r, a, b, BF_LOGIC_AND);
+}
+
+/* conversion between fixed size types */
+
+typedef union {
+ double d;
+ uint64_t u;
+} Float64Union;
+
+int bf_get_float64(const bf_t *a, double *pres, bf_rnd_t rnd_mode)
+{
+ Float64Union u;
+ int e, ret;
+ uint64_t m;
+
+ ret = 0;
+ if (a->expn == BF_EXP_NAN) {
+ u.u = 0x7ff8000000000000; /* quiet nan */
+ } else {
+ bf_t b_s, *b = &b_s;
+
+ bf_init(a->ctx, b);
+ bf_set(b, a);
+ if (bf_is_finite(b)) {
+ ret = bf_round(b, 53, rnd_mode | BF_FLAG_SUBNORMAL | bf_set_exp_bits(11));
+ }
+ if (b->expn == BF_EXP_INF) {
+ e = (1 << 11) - 1;
+ m = 0;
+ } else if (b->expn == BF_EXP_ZERO) {
+ e = 0;
+ m = 0;
+ } else {
+ e = b->expn + 1023 - 1;
+#if LIMB_BITS == 32
+ if (b->len == 2) {
+ m = ((uint64_t)b->tab[1] << 32) | b->tab[0];
+ } else {
+ m = ((uint64_t)b->tab[0] << 32);
+ }
+#else
+ m = b->tab[0];
+#endif
+ if (e <= 0) {
+ /* subnormal */
+ m = m >> (12 - e);
+ e = 0;
+ } else {
+ m = (m << 1) >> 12;
+ }
+ }
+ u.u = m | ((uint64_t)e << 52) | ((uint64_t)b->sign << 63);
+ bf_delete(b);
+ }
+ *pres = u.d;
+ return ret;
+}
+
+void bf_set_float64(bf_t *a, double d)
+{
+ Float64Union u;
+ uint64_t m;
+ int shift, e, sgn;
+
+ u.d = d;
+ sgn = u.u >> 63;
+ e = (u.u >> 52) & ((1 << 11) - 1);
+ m = u.u & (((uint64_t)1 << 52) - 1);
+ if (e == ((1 << 11) - 1)) {
+ if (m != 0) {
+ bf_set_nan(a);
+ } else {
+ bf_set_inf(a, sgn);
+ }
+ } else if (e == 0) {
+ if (m == 0) {
+ bf_set_zero(a, sgn);
+ } else {
+ /* subnormal number */
+ m <<= 12;
+ shift = clz64(m);
+ m <<= shift;
+ e = -shift;
+ goto norm;
+ }
+ } else {
+ m = (m << 11) | ((uint64_t)1 << 63);
+ norm:
+ a->expn = e - 1023 + 1;
+#if LIMB_BITS == 32
+ bf_resize(a, 2);
+ a->tab[0] = m;
+ a->tab[1] = m >> 32;
+#else
+ bf_resize(a, 1);
+ a->tab[0] = m;
+#endif
+ a->sign = sgn;
+ }
+}
+
+/* The rounding mode is always BF_RNDZ. Return BF_ST_OVERFLOW if there
+ is an overflow and 0 otherwise. */
+int bf_get_int32(int *pres, const bf_t *a, int flags)
+{
+ uint32_t v;
+ int ret;
+ if (a->expn >= BF_EXP_INF) {
+ ret = 0;
+ if (flags & BF_GET_INT_MOD) {
+ v = 0;
+ } else if (a->expn == BF_EXP_INF) {
+ v = (uint32_t)INT32_MAX + a->sign;
+ } else {
+ v = INT32_MAX;
+ }
+ } else if (a->expn <= 0) {
+ v = 0;
+ ret = 0;
+ } else if (a->expn <= 31) {
+ v = a->tab[a->len - 1] >> (LIMB_BITS - a->expn);
+ if (a->sign)
+ v = -v;
+ ret = 0;
+ } else if (!(flags & BF_GET_INT_MOD)) {
+ ret = BF_ST_OVERFLOW;
+ if (a->sign) {
+ v = (uint32_t)INT32_MAX + 1;
+ if (a->expn == 32 &&
+ (a->tab[a->len - 1] >> (LIMB_BITS - 32)) == v) {
+ ret = 0;
+ }
+ } else {
+ v = INT32_MAX;
+ }
+ } else {
+ v = get_bits(a->tab, a->len, a->len * LIMB_BITS - a->expn);
+ if (a->sign)
+ v = -v;
+ ret = 0;
+ }
+ *pres = v;
+ return ret;
+}
+
+/* The rounding mode is always BF_RNDZ. Return BF_ST_OVERFLOW if there
+ is an overflow and 0 otherwise. */
+int bf_get_int64(int64_t *pres, const bf_t *a, int flags)
+{
+ uint64_t v;
+ int ret;
+ if (a->expn >= BF_EXP_INF) {
+ ret = 0;
+ if (flags & BF_GET_INT_MOD) {
+ v = 0;
+ } else if (a->expn == BF_EXP_INF) {
+ v = (uint64_t)INT64_MAX + a->sign;
+ } else {
+ v = INT64_MAX;
+ }
+ } else if (a->expn <= 0) {
+ v = 0;
+ ret = 0;
+ } else if (a->expn <= 63) {
+#if LIMB_BITS == 32
+ if (a->expn <= 32)
+ v = a->tab[a->len - 1] >> (LIMB_BITS - a->expn);
+ else
+ v = (((uint64_t)a->tab[a->len - 1] << 32) |
+ get_limbz(a, a->len - 2)) >> (64 - a->expn);
+#else
+ v = a->tab[a->len - 1] >> (LIMB_BITS - a->expn);
+#endif
+ if (a->sign)
+ v = -v;
+ ret = 0;
+ } else if (!(flags & BF_GET_INT_MOD)) {
+ ret = BF_ST_OVERFLOW;
+ if (a->sign) {
+ uint64_t v1;
+ v = (uint64_t)INT64_MAX + 1;
+ if (a->expn == 64) {
+ v1 = a->tab[a->len - 1];
+#if LIMB_BITS == 32
+ v1 |= (v1 << 32) | get_limbz(a, a->len - 2);
+#endif
+ if (v1 == v)
+ ret = 0;
+ }
+ } else {
+ v = INT64_MAX;
+ }
+ } else {
+ slimb_t bit_pos = a->len * LIMB_BITS - a->expn;
+ v = get_bits(a->tab, a->len, bit_pos);
+#if LIMB_BITS == 32
+ v |= (uint64_t)get_bits(a->tab, a->len, bit_pos + 32) << 32;
+#endif
+ if (a->sign)
+ v = -v;
+ ret = 0;
+ }
+ *pres = v;
+ return ret;
+}
+
+/* base conversion from radix */
+
+static const uint8_t digits_per_limb_table[BF_RADIX_MAX - 1] = {
+#if LIMB_BITS == 32
+32,20,16,13,12,11,10,10, 9, 9, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6,
+#else
+64,40,32,27,24,22,21,20,19,18,17,17,16,16,16,15,15,15,14,14,14,14,13,13,13,13,13,13,13,12,12,12,12,12,12,
+#endif
+};
+
+static limb_t get_limb_radix(int radix)
+{
+ int i, k;
+ limb_t radixl;
+
+ k = digits_per_limb_table[radix - 2];
+ radixl = radix;
+ for(i = 1; i < k; i++)
+ radixl *= radix;
+ return radixl;
+}
+
+static void bf_integer_from_radix_rec(bf_t *r, const limb_t *tab,
+ limb_t n, int level, limb_t n0,
+ limb_t radix, bf_t *pow_tab)
+{
+ if (n == 1) {
+ bf_set_ui(r, tab[0]);
+ } else {
+ bf_t T_s, *T = &T_s, *B;
+ limb_t n1, n2;
+
+ n2 = (((n0 * 2) >> (level + 1)) + 1) / 2;
+ n1 = n - n2;
+ // printf("level=%d n0=%ld n1=%ld n2=%ld\n", level, n0, n1, n2);
+ B = &pow_tab[level];
+ if (B->len == 0) {
+ bf_pow_ui_ui(B, radix, n2, BF_PREC_INF, BF_RNDZ);
+ }
+ bf_integer_from_radix_rec(r, tab + n2, n1, level + 1, n0,
+ radix, pow_tab);
+ bf_mul(r, r, B, BF_PREC_INF, BF_RNDZ);
+ bf_init(r->ctx, T);
+ bf_integer_from_radix_rec(T, tab, n2, level + 1, n0,
+ radix, pow_tab);
+ bf_add(r, r, T, BF_PREC_INF, BF_RNDZ);
+ bf_delete(T);
+ }
+ // bf_print_str(" r=", r);
+}
+
+static void bf_integer_from_radix(bf_t *r, const limb_t *tab,
+ limb_t n, limb_t radix)
+{
+ bf_context_t *s = r->ctx;
+ int pow_tab_len, i;
+ limb_t radixl;
+ bf_t *pow_tab;
+
+ radixl = get_limb_radix(radix);
+ pow_tab_len = ceil_log2(n) + 2; /* XXX: check */
+ pow_tab = bf_malloc(s, sizeof(pow_tab[0]) * pow_tab_len);
+ for(i = 0; i < pow_tab_len; i++)
+ bf_init(r->ctx, &pow_tab[i]);
+ bf_integer_from_radix_rec(r, tab, n, 0, n, radixl, pow_tab);
+ for(i = 0; i < pow_tab_len; i++) {
+ bf_delete(&pow_tab[i]);
+ }
+ bf_free(s, pow_tab);
+}
+
+/* compute and round T * radix^expn. */
+int bf_mul_pow_radix(bf_t *r, const bf_t *T, limb_t radix,
+ slimb_t expn, limb_t prec, bf_flags_t flags)
+{
+ int ret, expn_sign, overflow;
+ slimb_t e, extra_bits, prec1, ziv_extra_bits;
+ bf_t B_s, *B = &B_s;
+
+ if (T->len == 0) {
+ bf_set(r, T);
+ return 0;
+ } else if (expn == 0) {
+ bf_set(r, T);
+ return bf_round(r, prec, flags);
+ }
+
+ e = expn;
+ expn_sign = 0;
+ if (e < 0) {
+ e = -e;
+ expn_sign = 1;
+ }
+ bf_init(r->ctx, B);
+ if (prec == BF_PREC_INF) {
+ /* infinite precision: only used if the result is known to be exact */
+ bf_pow_ui_ui(B, radix, e, BF_PREC_INF, BF_RNDN);
+ if (expn_sign) {
+ ret = bf_div(r, T, B, T->len * LIMB_BITS, BF_RNDN);
+ } else {
+ ret = bf_mul(r, T, B, BF_PREC_INF, BF_RNDN);
+ }
+ } else {
+ ziv_extra_bits = 16;
+ for(;;) {
+ prec1 = prec + ziv_extra_bits;
+ /* XXX: correct overflow/underflow handling */
+ /* XXX: rigorous error analysis needed */
+ extra_bits = ceil_log2(e) * 2 + 1;
+ ret = bf_pow_ui_ui(B, radix, e, prec1 + extra_bits, BF_RNDN);
+ overflow = !bf_is_finite(B);
+ /* XXX: if bf_pow_ui_ui returns an exact result, can stop
+ after the next operation */
+ if (expn_sign)
+ ret |= bf_div(r, T, B, prec1 + extra_bits, BF_RNDN);
+ else
+ ret |= bf_mul(r, T, B, prec1 + extra_bits, BF_RNDN);
+ if ((ret & BF_ST_INEXACT) &&
+ !bf_can_round(r, prec, flags & BF_RND_MASK, prec1) &&
+ !overflow) {
+ /* and more precision and retry */
+ ziv_extra_bits = ziv_extra_bits + (ziv_extra_bits / 2);
+ } else {
+ ret = bf_round(r, prec, flags) | (ret & BF_ST_INEXACT);
+ break;
+ }
+ }
+ }
+ bf_delete(B);
+ return ret;
+}
+
+static inline int to_digit(int c)
+{
+ if (c >= '0' && c <= '9')
+ return c - '0';
+ else if (c >= 'A' && c <= 'Z')
+ return c - 'A' + 10;
+ else if (c >= 'a' && c <= 'z')
+ return c - 'a' + 10;
+ else
+ return 36;
+}
+
+/* add a limb at 'pos' and decrement pos. new space is created if needed */
+static void bf_add_limb(bf_t *a, slimb_t *ppos, limb_t v)
+{
+ slimb_t pos;
+ pos = *ppos;
+ if (unlikely(pos < 0)) {
+ limb_t new_size, d;
+ new_size = bf_max(a->len + 1, a->len * 3 / 2);
+ a->tab = bf_realloc(a->ctx, a->tab, sizeof(limb_t) * new_size);
+ d = new_size - a->len;
+ memmove(a->tab + d, a->tab, a->len * sizeof(limb_t));
+ a->len = new_size;
+ pos += d;
+ }
+ a->tab[pos--] = v;
+ *ppos = pos;
+}
+
+static int bf_tolower(int c)
+{
+ if (c >= 'A' && c <= 'Z')
+ c = c - 'A' + 'a';
+ return c;
+}
+
+static int strcasestart(const char *str, const char *val, const char **ptr)
+{
+ const char *p, *q;
+ p = str;
+ q = val;
+ while (*q != '\0') {
+ if (bf_tolower(*p) != *q)
+ return 0;
+ p++;
+ q++;
+ }
+ if (ptr)
+ *ptr = p;
+ return 1;
+}
+
+/*
+ Return (status, n, exp). 'status' is the floating point status. 'n'
+ is the parsed number.
+ If prec = BF_PREC_INF:
+ If the number is an integer or if the radix is a power of two,
+ *pexponent = 0.
+ Otherwise, '*pexponent' is the exponent in radix 'radix'.
+ Otherwise
+ *pexponent = 0
+*/
+int bf_atof2(bf_t *r, slimb_t *pexponent,
+ const char *str, const char **pnext, int radix,
+ limb_t prec, bf_flags_t flags)
+{
+ const char *p, *p_start;
+ int is_neg, radix_bits, exp_is_neg, ret, digits_per_limb, shift, sep;
+ limb_t cur_limb;
+ slimb_t pos, expn, int_len, digit_count;
+ BOOL has_decpt, is_bin_exp, is_float;
+ bf_t a_s, *a;
+
+ /* optional separator between digits */
+ sep = (flags & BF_ATOF_UNDERSCORE_SEP) ? '_' : 256;
+
+ *pexponent = 0;
+ p = str;
+ if (!(flags & (BF_ATOF_INT_ONLY | BF_ATOF_JS_QUIRKS)) &&
+ radix <= 16 &&
+ strcasestart(p, "nan", &p)) {
+ bf_set_nan(r);
+ ret = 0;
+ goto done;
+ }
+ is_neg = 0;
+
+ if (p[0] == '+') {
+ p++;
+ p_start = p;
+ if (flags & BF_ATOF_NO_PREFIX_AFTER_SIGN)
+ goto no_radix_prefix;
+ } else if (p[0] == '-') {
+ is_neg = 1;
+ p++;
+ p_start = p;
+ if (flags & BF_ATOF_NO_PREFIX_AFTER_SIGN)
+ goto no_radix_prefix;
+ } else {
+ p_start = p;
+ }
+ if (p[0] == '0') {
+ if ((p[1] == 'x' || p[1] == 'X') &&
+ (radix == 0 || radix == 16) &&
+ !(flags & BF_ATOF_NO_HEX)) {
+ radix = 16;
+ p += 2;
+ } else if ((p[1] == 'o' || p[1] == 'O') &&
+ radix == 0 && (flags & BF_ATOF_BIN_OCT)) {
+ p += 2;
+ radix = 8;
+ } else if ((p[1] == 'b' || p[1] == 'B') &&
+ radix == 0 && (flags & BF_ATOF_BIN_OCT)) {
+ p += 2;
+ radix = 2;
+ } else if ((p[1] >= '0' && p[1] <= '7') &&
+ radix == 0 && (flags & BF_ATOF_LEGACY_OCTAL)) {
+ int i;
+ /* the separator is not allowed in legacy octal literals */
+ for (i = 2; (p[i] >= '0' && p[i] <= '7'); i++)
+ continue;
+ if (p[i] == '8' || p[i] == '9')
+ goto no_prefix;
+ p += 1;
+ radix = 8;
+ } else {
+ /* 0 cannot be followed by a separator */
+ if (p[1] == sep) {
+ p++;
+ bf_set_zero(r, 0);
+ ret = 0;
+ if (flags & BF_ATOF_INT_PREC_INF)
+ ret |= BF_ATOF_ST_INTEGER;
+ goto done;
+ }
+ goto no_prefix;
+ }
+ /* there must be a digit after the prefix */
+ if (to_digit((uint8_t)*p) >= radix) {
+ bf_set_nan(r);
+ ret = 0;
+ goto done;
+ }
+ no_prefix: ;
+ } else {
+ no_radix_prefix:
+ if (!(flags & BF_ATOF_INT_ONLY) && radix <= 16 &&
+ ((!(flags & BF_ATOF_JS_QUIRKS) && strcasestart(p, "inf", &p)) ||
+ ((flags & BF_ATOF_JS_QUIRKS) && strstart(p, "Infinity", &p)))) {
+ bf_set_inf(r, is_neg);
+ ret = 0;
+ goto done;
+ }
+ }
+
+ if (radix == 0)
+ radix = 10;
+ if ((radix & (radix - 1)) != 0) {
+ radix_bits = 0; /* base is not a power of two */
+ a = &a_s;
+ bf_init(r->ctx, a);
+ } else {
+ radix_bits = ceil_log2(radix);
+ a = r;
+ }
+
+ /* skip leading zeros */
+ /* XXX: could also skip zeros after the decimal point */
+ while (*p == '0' || (*p == sep && to_digit(p[1]) < radix))
+ p++;
+
+ if (radix_bits) {
+ shift = digits_per_limb = LIMB_BITS;
+ } else {
+ radix_bits = 0;
+ shift = digits_per_limb = digits_per_limb_table[radix - 2];
+ }
+ cur_limb = 0;
+ bf_resize(a, 1);
+ pos = 0;
+ has_decpt = FALSE;
+ int_len = digit_count = 0;
+ is_float = FALSE;
+ for(;;) {
+ limb_t c;
+ if (*p == '.' && (p > p_start || to_digit(p[1]) < radix)) {
+ if ((flags & BF_ATOF_INT_ONLY) ||
+ (radix != 10 && (flags & BF_ATOF_ONLY_DEC_FLOAT)))
+ break;
+ if (has_decpt)
+ break;
+ is_float = TRUE;
+ has_decpt = TRUE;
+ int_len = digit_count;
+ p++;
+ }
+ if (*p == sep && to_digit(p[1]) < radix)
+ p++;
+ c = to_digit(*p);
+ if (c >= radix)
+ break;
+ digit_count++;
+ p++;
+ if (radix_bits) {
+ shift -= radix_bits;
+ if (shift <= 0) {
+ cur_limb |= c >> (-shift);
+ bf_add_limb(a, &pos, cur_limb);
+ if (shift < 0)
+ cur_limb = c << (LIMB_BITS + shift);
+ else
+ cur_limb = 0;
+ shift += LIMB_BITS;
+ } else {
+ cur_limb |= c << shift;
+ }
+ } else {
+ cur_limb = cur_limb * radix + c;
+ shift--;
+ if (shift == 0) {
+ bf_add_limb(a, &pos, cur_limb);
+ shift = digits_per_limb;
+ cur_limb = 0;
+ }
+ }
+ }
+ if (!has_decpt)
+ int_len = digit_count;
+
+ /* add the last limb and pad with zeros */
+ if (shift != digits_per_limb) {
+ if (radix_bits == 0) {
+ while (shift != 0) {
+ cur_limb *= radix;
+ shift--;
+ }
+ }
+ bf_add_limb(a, &pos, cur_limb);
+ }
+
+ /* reset the next limbs to zero (we prefer to reallocate in the
+ renormalization) */
+ memset(a->tab, 0, (pos + 1) * sizeof(limb_t));
+
+ if (p == p_start)
+ goto error;
+
+ /* parse the exponent, if any */
+ expn = 0;
+ is_bin_exp = FALSE;
+ if (!(flags & BF_ATOF_INT_ONLY) &&
+ !(radix != 10 && (flags & BF_ATOF_ONLY_DEC_FLOAT)) &&
+ ((radix == 10 && (*p == 'e' || *p == 'E')) ||
+ (radix != 10 && (*p == '@' ||
+ (radix_bits && (*p == 'p' || *p == 'P'))))) &&
+ p > p_start) {
+ is_bin_exp = (*p == 'p' || *p == 'P');
+ p++;
+ is_float = TRUE;
+ exp_is_neg = 0;
+ if (*p == '+') {
+ p++;
+ } else if (*p == '-') {
+ exp_is_neg = 1;
+ p++;
+ }
+ for(;;) {
+ int c;
+ if (*p == sep && to_digit(p[1]) < 10)
+ p++;
+ c = to_digit(*p);
+ if (c >= 10)
+ break;
+ if (unlikely(expn > ((EXP_MAX - 2 - 9) / 10))) {
+ /* exponent overflow */
+ if (exp_is_neg) {
+ bf_set_zero(r, is_neg);
+ ret = BF_ST_UNDERFLOW | BF_ST_INEXACT;
+ } else {
+ bf_set_inf(r, is_neg);
+ ret = BF_ST_OVERFLOW | BF_ST_INEXACT;
+ }
+ goto done;
+ }
+ p++;
+ expn = expn * 10 + c;
+ }
+ if (exp_is_neg)
+ expn = -expn;
+ } else if (!is_float) {
+ if (*p == 'n' && (flags & BF_ATOF_INT_N_SUFFIX)) {
+ p++;
+ prec = BF_PREC_INF;
+ } else if (flags & BF_ATOF_INT_PREC_INF) {
+ prec = BF_PREC_INF;
+ } else {
+ is_float = TRUE;
+ }
+ }
+ if (radix_bits) {
+ /* XXX: may overflow */
+ if (!is_bin_exp)
+ expn *= radix_bits;
+ a->expn = expn + (int_len * radix_bits);
+ a->sign = is_neg;
+ ret = bf_normalize_and_round(a, prec, flags);
+ } else {
+ limb_t l;
+ pos++;
+ l = a->len - pos; /* number of limbs */
+ if (l == 0) {
+ bf_set_zero(r, is_neg);
+ ret = 0;
+ } else {
+ bf_t T_s, *T = &T_s;
+
+ expn -= l * digits_per_limb - int_len;
+ bf_init(r->ctx, T);
+ bf_integer_from_radix(T, a->tab + pos, l, radix);
+ T->sign = is_neg;
+ if (prec == BF_PREC_INF && is_float) {
+ /* return the exponent */
+ *pexponent = expn;
+ bf_set(r, T);
+ ret = 0;
+ } else {
+ ret = bf_mul_pow_radix(r, T, radix, expn, prec, flags);
+ }
+ bf_delete(T);
+ }
+ bf_delete(a);
+ }
+ if (!is_float)
+ ret |= BF_ATOF_ST_INTEGER;
+ done:
+ if (pnext)
+ *pnext = p;
+ return ret;
+ error:
+ if (!radix_bits)
+ bf_delete(a);
+ ret = 0;
+ if (flags & BF_ATOF_NAN_IF_EMPTY) {
+ bf_set_nan(r);
+ } else {
+ bf_set_zero(r, 0);
+ if (flags & BF_ATOF_INT_PREC_INF)
+ ret |= BF_ATOF_ST_INTEGER;
+ }
+ goto done;
+}
+
+int bf_atof(bf_t *r, const char *str, const char **pnext, int radix,
+ limb_t prec, bf_flags_t flags)
+{
+ slimb_t dummy_exp;
+ return bf_atof2(r, &dummy_exp, str, pnext, radix, prec, flags);
+}
+
+/* base conversion to radix */
+
+#if LIMB_BITS == 64
+#define RADIXL_10 UINT64_C(10000000000000000000)
+#else
+#define RADIXL_10 UINT64_C(1000000000)
+#endif
+
+static const uint32_t inv_log2_radix[BF_RADIX_MAX - 1][LIMB_BITS / 2 + 1] = {
+#if LIMB_BITS == 32
+{ 0x80000000, 0x00000000,},
+{ 0x50c24e60, 0xd4d4f4a7,},
+{ 0x40000000, 0x00000000,},
+{ 0x372068d2, 0x0a1ee5ca,},
+{ 0x3184648d, 0xb8153e7a,},
+{ 0x2d983275, 0x9d5369c4,},
+{ 0x2aaaaaaa, 0xaaaaaaab,},
+{ 0x28612730, 0x6a6a7a54,},
+{ 0x268826a1, 0x3ef3fde6,},
+{ 0x25001383, 0xbac8a744,},
+{ 0x23b46706, 0x82c0c709,},
+{ 0x229729f1, 0xb2c83ded,},
+{ 0x219e7ffd, 0xa5ad572b,},
+{ 0x20c33b88, 0xda7c29ab,},
+{ 0x20000000, 0x00000000,},
+{ 0x1f50b57e, 0xac5884b3,},
+{ 0x1eb22cc6, 0x8aa6e26f,},
+{ 0x1e21e118, 0x0c5daab2,},
+{ 0x1d9dcd21, 0x439834e4,},
+{ 0x1d244c78, 0x367a0d65,},
+{ 0x1cb40589, 0xac173e0c,},
+{ 0x1c4bd95b, 0xa8d72b0d,},
+{ 0x1bead768, 0x98f8ce4c,},
+{ 0x1b903469, 0x050f72e5,},
+{ 0x1b3b433f, 0x2eb06f15,},
+{ 0x1aeb6f75, 0x9c46fc38,},
+{ 0x1aa038eb, 0x0e3bfd17,},
+{ 0x1a593062, 0xb38d8c56,},
+{ 0x1a15f4c3, 0x2b95a2e6,},
+{ 0x19d630dc, 0xcc7ddef9,},
+{ 0x19999999, 0x9999999a,},
+{ 0x195fec80, 0x8a609431,},
+{ 0x1928ee7b, 0x0b4f22f9,},
+{ 0x18f46acf, 0x8c06e318,},
+{ 0x18c23246, 0xdc0a9f3d,},
+#else
+{ 0x80000000, 0x00000000, 0x00000000,},
+{ 0x50c24e60, 0xd4d4f4a7, 0x021f57bc,},
+{ 0x40000000, 0x00000000, 0x00000000,},
+{ 0x372068d2, 0x0a1ee5ca, 0x19ea911b,},
+{ 0x3184648d, 0xb8153e7a, 0x7fc2d2e1,},
+{ 0x2d983275, 0x9d5369c4, 0x4dec1661,},
+{ 0x2aaaaaaa, 0xaaaaaaaa, 0xaaaaaaab,},
+{ 0x28612730, 0x6a6a7a53, 0x810fabde,},
+{ 0x268826a1, 0x3ef3fde6, 0x23e2566b,},
+{ 0x25001383, 0xbac8a744, 0x385a3349,},
+{ 0x23b46706, 0x82c0c709, 0x3f891718,},
+{ 0x229729f1, 0xb2c83ded, 0x15fba800,},
+{ 0x219e7ffd, 0xa5ad572a, 0xe169744b,},
+{ 0x20c33b88, 0xda7c29aa, 0x9bddee52,},
+{ 0x20000000, 0x00000000, 0x00000000,},
+{ 0x1f50b57e, 0xac5884b3, 0x70e28eee,},
+{ 0x1eb22cc6, 0x8aa6e26f, 0x06d1a2a2,},
+{ 0x1e21e118, 0x0c5daab1, 0x81b4f4bf,},
+{ 0x1d9dcd21, 0x439834e3, 0x81667575,},
+{ 0x1d244c78, 0x367a0d64, 0xc8204d6d,},
+{ 0x1cb40589, 0xac173e0c, 0x3b7b16ba,},
+{ 0x1c4bd95b, 0xa8d72b0d, 0x5879f25a,},
+{ 0x1bead768, 0x98f8ce4c, 0x66cc2858,},
+{ 0x1b903469, 0x050f72e5, 0x0cf5488e,},
+{ 0x1b3b433f, 0x2eb06f14, 0x8c89719c,},
+{ 0x1aeb6f75, 0x9c46fc37, 0xab5fc7e9,},
+{ 0x1aa038eb, 0x0e3bfd17, 0x1bd62080,},
+{ 0x1a593062, 0xb38d8c56, 0x7998ab45,},
+{ 0x1a15f4c3, 0x2b95a2e6, 0x46aed6a0,},
+{ 0x19d630dc, 0xcc7ddef9, 0x5aadd61b,},
+{ 0x19999999, 0x99999999, 0x9999999a,},
+{ 0x195fec80, 0x8a609430, 0xe1106014,},
+{ 0x1928ee7b, 0x0b4f22f9, 0x5f69791d,},
+{ 0x18f46acf, 0x8c06e318, 0x4d2aeb2c,},
+{ 0x18c23246, 0xdc0a9f3d, 0x3fe16970,},
+#endif
+};
+
+static const limb_t log2_radix[BF_RADIX_MAX - 1] = {
+#if LIMB_BITS == 32
+0x20000000,
+0x32b80347,
+0x40000000,
+0x4a4d3c26,
+0x52b80347,
+0x59d5d9fd,
+0x60000000,
+0x6570068e,
+0x6a4d3c26,
+0x6eb3a9f0,
+0x72b80347,
+0x766a008e,
+0x79d5d9fd,
+0x7d053f6d,
+0x80000000,
+0x82cc7edf,
+0x8570068e,
+0x87ef05ae,
+0x8a4d3c26,
+0x8c8ddd45,
+0x8eb3a9f0,
+0x90c10501,
+0x92b80347,
+0x949a784c,
+0x966a008e,
+0x982809d6,
+0x99d5d9fd,
+0x9b74948f,
+0x9d053f6d,
+0x9e88c6b3,
+0xa0000000,
+0xa16bad37,
+0xa2cc7edf,
+0xa4231623,
+0xa570068e,
+#else
+0x2000000000000000,
+0x32b803473f7ad0f4,
+0x4000000000000000,
+0x4a4d3c25e68dc57f,
+0x52b803473f7ad0f4,
+0x59d5d9fd5010b366,
+0x6000000000000000,
+0x6570068e7ef5a1e8,
+0x6a4d3c25e68dc57f,
+0x6eb3a9f01975077f,
+0x72b803473f7ad0f4,
+0x766a008e4788cbcd,
+0x79d5d9fd5010b366,
+0x7d053f6d26089673,
+0x8000000000000000,
+0x82cc7edf592262d0,
+0x8570068e7ef5a1e8,
+0x87ef05ae409a0289,
+0x8a4d3c25e68dc57f,
+0x8c8ddd448f8b845a,
+0x8eb3a9f01975077f,
+0x90c10500d63aa659,
+0x92b803473f7ad0f4,
+0x949a784bcd1b8afe,
+0x966a008e4788cbcd,
+0x982809d5be7072dc,
+0x99d5d9fd5010b366,
+0x9b74948f5532da4b,
+0x9d053f6d26089673,
+0x9e88c6b3626a72aa,
+0xa000000000000000,
+0xa16bad3758efd873,
+0xa2cc7edf592262d0,
+0xa4231623369e78e6,
+0xa570068e7ef5a1e8,
+#endif
+};
+
+/* compute floor(a*b) or ceil(a*b) with b = log2(radix) or
+ b=1/log2(radix). For is_inv = 0, strict accuracy is not guaranteed
+ when radix is not a power of two. */
+slimb_t bf_mul_log2_radix(slimb_t a1, unsigned int radix, int is_inv,
+ int is_ceil1)
+{
+ int is_neg;
+ limb_t a;
+ BOOL is_ceil;
+
+ is_ceil = is_ceil1;
+ a = a1;
+ if (a1 < 0) {
+ a = -a;
+ is_neg = 1;
+ } else {
+ is_neg = 0;
+ }
+ is_ceil ^= is_neg;
+ if ((radix & (radix - 1)) == 0) {
+ int radix_bits;
+ /* radix is a power of two */
+ radix_bits = ceil_log2(radix);
+ if (is_inv) {
+ if (is_ceil)
+ a += radix_bits - 1;
+ a = a / radix_bits;
+ } else {
+ a = a * radix_bits;
+ }
+ } else {
+ const uint32_t *tab;
+ limb_t b0, b1;
+ dlimb_t t;
+
+ if (is_inv) {
+ tab = inv_log2_radix[radix - 2];
+#if LIMB_BITS == 32
+ b1 = tab[0];
+ b0 = tab[1];
+#else
+ b1 = ((limb_t)tab[0] << 32) | tab[1];
+ b0 = (limb_t)tab[2] << 32;
+#endif
+ t = (dlimb_t)b0 * (dlimb_t)a;
+ t = (dlimb_t)b1 * (dlimb_t)a + (t >> LIMB_BITS);
+ a = t >> (LIMB_BITS - 1);
+ } else {
+ b0 = log2_radix[radix - 2];
+ t = (dlimb_t)b0 * (dlimb_t)a;
+ a = t >> (LIMB_BITS - 3);
+ }
+ /* a = floor(result) and 'result' cannot be an integer */
+ a += is_ceil;
+ }
+ if (is_neg)
+ a = -a;
+ return a;
+}
+
+/* 'n' is the number of output limbs */
+static void bf_integer_to_radix_rec(bf_t *pow_tab,
+ limb_t *out, const bf_t *a, limb_t n,
+ int level, limb_t n0, limb_t radixl,
+ unsigned int radixl_bits)
+{
+ limb_t n1, n2, q_prec;
+ assert(n >= 1);
+ if (n == 1) {
+ out[0] = get_bits(a->tab, a->len, a->len * LIMB_BITS - a->expn);
+ } else if (n == 2) {
+ dlimb_t t;
+ slimb_t pos;
+ pos = a->len * LIMB_BITS - a->expn;
+ t = ((dlimb_t)get_bits(a->tab, a->len, pos + LIMB_BITS) << LIMB_BITS) |
+ get_bits(a->tab, a->len, pos);
+ if (likely(radixl == RADIXL_10)) {
+ /* use division by a constant when possible */
+ out[0] = t % RADIXL_10;
+ out[1] = t / RADIXL_10;
+ } else {
+ out[0] = t % radixl;
+ out[1] = t / radixl;
+ }
+ } else {
+ bf_t Q, R, *B, *B_inv;
+ int q_add;
+ bf_init(a->ctx, &Q);
+ bf_init(a->ctx, &R);
+ n2 = (((n0 * 2) >> (level + 1)) + 1) / 2;
+ n1 = n - n2;
+ B = &pow_tab[2 * level];
+ B_inv = &pow_tab[2 * level + 1];
+ if (B->len == 0) {
+ /* compute BASE^n2 */
+ bf_pow_ui_ui(B, radixl, n2, BF_PREC_INF, BF_RNDZ);
+ /* we use enough bits for the maximum possible 'n1' value,
+ i.e. n2 + 1 */
+ bf_recip(B_inv, B, (n2 + 1) * radixl_bits + 2);
+ }
+ // printf("%d: n1=% " PRId64 " n2=%" PRId64 "\n", level, n1, n2);
+ q_prec = n1 * radixl_bits;
+ bf_mul(&Q, a, B_inv, q_prec, BF_RNDN);
+ bf_rint(&Q, BF_PREC_INF, BF_RNDZ);
+
+ bf_mul(&R, &Q, B, BF_PREC_INF, BF_RNDZ);
+ bf_sub(&R, a, &R, BF_PREC_INF, BF_RNDZ);
+ /* adjust if necessary */
+ q_add = 0;
+ while (R.sign && R.len != 0) {
+ bf_add(&R, &R, B, BF_PREC_INF, BF_RNDZ);
+ q_add--;
+ }
+ while (bf_cmpu(&R, B) >= 0) {
+ bf_sub(&R, &R, B, BF_PREC_INF, BF_RNDZ);
+ q_add++;
+ }
+ if (q_add != 0) {
+ bf_add_si(&Q, &Q, q_add, BF_PREC_INF, BF_RNDZ);
+ }
+ bf_integer_to_radix_rec(pow_tab, out + n2, &Q, n1, level + 1, n0,
+ radixl, radixl_bits);
+ bf_integer_to_radix_rec(pow_tab, out, &R, n2, level + 1, n0,
+ radixl, radixl_bits);
+ bf_delete(&Q);
+ bf_delete(&R);
+ }
+}
+
+static void bf_integer_to_radix(bf_t *r, const bf_t *a, limb_t radixl)
+{
+ bf_context_t *s = r->ctx;
+ limb_t r_len;
+ bf_t *pow_tab;
+ int i, pow_tab_len;
+
+ r_len = r->len;
+ pow_tab_len = (ceil_log2(r_len) + 2) * 2; /* XXX: check */
+ pow_tab = bf_malloc(s, sizeof(pow_tab[0]) * pow_tab_len);
+ for(i = 0; i < pow_tab_len; i++)
+ bf_init(r->ctx, &pow_tab[i]);
+
+ bf_integer_to_radix_rec(pow_tab, r->tab, a, r_len, 0, r_len, radixl,
+ ceil_log2(radixl));
+
+ for(i = 0; i < pow_tab_len; i++) {
+ bf_delete(&pow_tab[i]);
+ }
+ bf_free(s, pow_tab);
+}
+
+/* a must be >= 0. 'P' is the wanted number of digits in radix
+ 'radix'. 'r' is the mantissa represented as an integer. *pE
+ contains the exponent. */
+static void bf_convert_to_radix(bf_t *r, slimb_t *pE,
+ const bf_t *a, int radix,
+ limb_t P, bf_rnd_t rnd_mode,
+ BOOL is_fixed_exponent)
+{
+ slimb_t E, e, prec, extra_bits, ziv_extra_bits, prec0;
+ bf_t B_s, *B = &B_s;
+ int e_sign, ret, res;
+
+ if (a->len == 0) {
+ /* zero case */
+ *pE = 0;
+ bf_set(r, a);
+ return;
+ }
+
+ if (is_fixed_exponent) {
+ E = *pE;
+ } else {
+ /* compute the new exponent */
+ E = 1 + bf_mul_log2_radix(a->expn - 1, radix, TRUE, FALSE);
+ }
+ // bf_print_str("a", a);
+ // printf("E=%ld P=%ld radix=%d\n", E, P, radix);
+
+ for(;;) {
+ e = P - E;
+ e_sign = 0;
+ if (e < 0) {
+ e = -e;
+ e_sign = 1;
+ }
+ /* Note: precision for log2(radix) is not critical here */
+ prec0 = bf_mul_log2_radix(P, radix, FALSE, TRUE);
+ ziv_extra_bits = 16;
+ for(;;) {
+ prec = prec0 + ziv_extra_bits;
+ /* XXX: rigorous error analysis needed */
+ extra_bits = ceil_log2(e) * 2 + 1;
+ ret = bf_pow_ui_ui(r, radix, e, prec + extra_bits, BF_RNDN);
+ if (!e_sign)
+ ret |= bf_mul(r, r, a, prec + extra_bits, BF_RNDN);
+ else
+ ret |= bf_div(r, a, r, prec + extra_bits, BF_RNDN);
+ /* if the result is not exact, check that it can be safely
+ rounded to an integer */
+ if ((ret & BF_ST_INEXACT) &&
+ !bf_can_round(r, r->expn, rnd_mode, prec)) {
+ /* and more precision and retry */
+ ziv_extra_bits = ziv_extra_bits + (ziv_extra_bits / 2);
+ continue;
+ } else {
+ bf_rint(r, BF_PREC_INF, rnd_mode);
+ break;
+ }
+ }
+ if (is_fixed_exponent)
+ break;
+ /* check that the result is < B^P */
+ /* XXX: do an fast approximate test first ? */
+ bf_init(r->ctx, B);
+ bf_pow_ui_ui(B, radix, P, BF_PREC_INF, BF_RNDZ);
+ res = bf_cmpu(r, B);
+ bf_delete(B);
+ if (res < 0)
+ break;
+ /* try a larger exponent */
+ E++;
+ }
+ *pE = E;
+}
+
+static void limb_to_a(char *buf, limb_t n, unsigned int radix, int len)
+{
+ int digit, i;
+
+ if (radix == 10) {
+ /* specific case with constant divisor */
+ for(i = len - 1; i >= 0; i--) {
+ digit = (limb_t)n % 10;
+ n = (limb_t)n / 10;
+ buf[i] = digit + '0';
+ }
+ } else {
+ for(i = len - 1; i >= 0; i--) {
+ digit = (limb_t)n % radix;
+ n = (limb_t)n / radix;
+ if (digit < 10)
+ digit += '0';
+ else
+ digit += 'a' - 10;
+ buf[i] = digit;
+ }
+ }
+}
+
+/* for power of 2 radixes */
+static void limb_to_a2(char *buf, limb_t n, unsigned int radix_bits, int len)
+{
+ int digit, i;
+ unsigned int mask;
+
+ mask = (1 << radix_bits) - 1;
+ for(i = len - 1; i >= 0; i--) {
+ digit = n & mask;
+ n >>= radix_bits;
+ if (digit < 10)
+ digit += '0';
+ else
+ digit += 'a' - 10;
+ buf[i] = digit;
+ }
+}
+
+/* 'a' must be an integer. A dot is added before the 'dot_pos'
+ digit. dot_pos = n_digits does not display the dot. 0 <= dot_pos <=
+ n_digits. n_digits >= 1. */
+static void output_digits(DynBuf *s, const bf_t *a1, int radix, limb_t n_digits,
+ limb_t dot_pos)
+{
+ limb_t i, v, l;
+ slimb_t pos, pos_incr;
+ int digits_per_limb, buf_pos, radix_bits, first_buf_pos;
+ char buf[65];
+ bf_t a_s, *a;
+
+ if ((radix & (radix - 1)) != 0) {
+ limb_t n, radixl;
+
+ digits_per_limb = digits_per_limb_table[radix - 2];
+ radixl = get_limb_radix(radix);
+ a = &a_s;
+ bf_init(a1->ctx, a);
+ n = (n_digits + digits_per_limb - 1) / digits_per_limb;
+ bf_resize(a, n);
+ bf_integer_to_radix(a, a1, radixl);
+ radix_bits = 0;
+ pos = n;
+ pos_incr = 1;
+ first_buf_pos = pos * digits_per_limb - n_digits;
+ } else {
+ a = (bf_t *)a1;
+ radix_bits = ceil_log2(radix);
+ digits_per_limb = LIMB_BITS / radix_bits;
+ pos_incr = digits_per_limb * radix_bits;
+ pos = a->len * LIMB_BITS - a->expn + n_digits * radix_bits;
+ first_buf_pos = 0;
+ }
+ buf_pos = digits_per_limb;
+ i = 0;
+ while (i < n_digits) {
+ if (buf_pos == digits_per_limb) {
+ pos -= pos_incr;
+ if (radix_bits == 0) {
+ v = get_limbz(a, pos);
+ limb_to_a(buf, v, radix, digits_per_limb);
+ } else {
+ v = get_bits(a->tab, a->len, pos);
+ limb_to_a2(buf, v, radix_bits, digits_per_limb);
+ }
+ buf_pos = first_buf_pos;
+ first_buf_pos = 0;
+ }
+ if (i < dot_pos) {
+ l = dot_pos;
+ } else {
+ if (i == dot_pos)
+ dbuf_putc(s, '.');
+ l = n_digits;
+ }
+ l = bf_min(digits_per_limb - buf_pos, l - i);
+ dbuf_put(s, (uint8_t *)(buf + buf_pos), l);
+ buf_pos += l;
+ i += l;
+ }
+ if (a != a1)
+ bf_delete(a);
+}
+
+static void *bf_dbuf_realloc(void *opaque, void *ptr, size_t size)
+{
+ bf_context_t *s = opaque;
+ return bf_realloc(s, ptr, size);
+}
+
+/* return the length in bytes. A trailing '\0' is added */
+size_t bf_ftoa(char **pbuf, const bf_t *a2, int radix, limb_t prec,
+ bf_flags_t flags)
+{
+ DynBuf s_s, *s = &s_s;
+ int radix_bits;
+
+ // bf_print_str("ftoa", a2);
+ // printf("radix=%d\n", radix);
+ dbuf_init2(s, a2->ctx, bf_dbuf_realloc);
+ if (a2->expn == BF_EXP_NAN) {
+ dbuf_putstr(s, "NaN");
+ } else {
+ if (a2->sign)
+ dbuf_putc(s, '-');
+ if (a2->expn == BF_EXP_INF) {
+ if (flags & BF_FTOA_JS_QUIRKS)
+ dbuf_putstr(s, "Infinity");
+ else
+ dbuf_putstr(s, "Inf");
+ } else {
+ int fmt;
+ slimb_t n_digits, n, i, n_max, n1;
+ bf_t a1_s, *a1;
+ bf_t a_s, *a = &a_s;
+
+ /* make a positive number */
+ a->tab = a2->tab;
+ a->len = a2->len;
+ a->expn = a2->expn;
+ a->sign = 0;
+
+ if ((radix & (radix - 1)) != 0)
+ radix_bits = 0;
+ else
+ radix_bits = ceil_log2(radix);
+
+ fmt = flags & BF_FTOA_FORMAT_MASK;
+ a1 = &a1_s;
+ bf_init(a2->ctx, a1);
+ if (fmt == BF_FTOA_FORMAT_FRAC) {
+ size_t pos, start;
+ /* one more digit for the rounding */
+ n = 1 + bf_mul_log2_radix(bf_max(a->expn, 0), radix, TRUE, TRUE);
+ n_digits = n + prec;
+ n1 = n;
+ bf_convert_to_radix(a1, &n1, a, radix, n_digits,
+ flags & BF_RND_MASK, TRUE);
+ start = s->size;
+ output_digits(s, a1, radix, n_digits, n);
+ /* remove leading zeros because we allocated one more digit */
+ pos = start;
+ while ((pos + 1) < s->size && s->buf[pos] == '0' &&
+ s->buf[pos + 1] != '.')
+ pos++;
+ if (pos > start) {
+ memmove(s->buf + start, s->buf + pos, s->size - pos);
+ s->size -= (pos - start);
+ }
+ } else {
+ if (fmt == BF_FTOA_FORMAT_FIXED) {
+ n_digits = prec;
+ n_max = n_digits;
+ } else {
+ slimb_t n_digits_max, n_digits_min;
+
+ if (prec == BF_PREC_INF) {
+ assert(radix_bits != 0);
+ /* XXX: could use the exact number of bits */
+ prec = a->len * LIMB_BITS;
+ }
+ n_digits = 1 + bf_mul_log2_radix(prec, radix, TRUE, TRUE);
+ /* max number of digits for non exponential
+ notation. The rational is to have the same rule
+ as JS i.e. n_max = 21 for 64 bit float in base 10. */
+ n_max = n_digits + 4;
+ if (fmt == BF_FTOA_FORMAT_FREE_MIN) {
+ bf_t b_s, *b = &b_s;
+
+ /* find the minimum number of digits by
+ dichotomy. */
+ n_digits_max = n_digits;
+ n_digits_min = 1;
+ bf_init(a2->ctx, b);
+ while (n_digits_min < n_digits_max) {
+ n_digits = (n_digits_min + n_digits_max) / 2;
+ bf_convert_to_radix(a1, &n, a, radix, n_digits,
+ flags & BF_RND_MASK, FALSE);
+ /* convert back to a number and compare */
+ bf_mul_pow_radix(b, a1, radix, n - n_digits,
+ prec,
+ (flags & ~BF_RND_MASK) |
+ BF_RNDN);
+ if (bf_cmpu(b, a) == 0) {
+ n_digits_max = n_digits;
+ } else {
+ n_digits_min = n_digits + 1;
+ }
+ }
+ bf_delete(b);
+ n_digits = n_digits_max;
+ }
+ }
+ bf_convert_to_radix(a1, &n, a, radix, n_digits,
+ flags & BF_RND_MASK, FALSE);
+ if (a1->expn == BF_EXP_ZERO &&
+ fmt != BF_FTOA_FORMAT_FIXED &&
+ !(flags & BF_FTOA_FORCE_EXP)) {
+ /* just output zero */
+ dbuf_putstr(s, "0");
+ } else {
+ if (flags & BF_FTOA_ADD_PREFIX) {
+ if (radix == 16)
+ dbuf_putstr(s, "0x");
+ else if (radix == 8)
+ dbuf_putstr(s, "0o");
+ else if (radix == 2)
+ dbuf_putstr(s, "0b");
+ }
+ if (a1->expn == BF_EXP_ZERO)
+ n = 1;
+ if ((flags & BF_FTOA_FORCE_EXP) ||
+ n <= -6 || n > n_max) {
+ const char *fmt;
+ /* exponential notation */
+ output_digits(s, a1, radix, n_digits, 1);
+ if (radix_bits != 0 && radix <= 16) {
+ if (flags & BF_FTOA_JS_QUIRKS)
+ fmt = "p%+" PRId_LIMB;
+ else
+ fmt = "p%" PRId_LIMB;
+ dbuf_printf(s, fmt, (n - 1) * radix_bits);
+ } else {
+ if (flags & BF_FTOA_JS_QUIRKS)
+ fmt = "%c%+" PRId_LIMB;
+ else
+ fmt = "%c%" PRId_LIMB;
+ dbuf_printf(s, fmt,
+ radix <= 10 ? 'e' : '@', n - 1);
+ }
+ } else if (n <= 0) {
+ /* 0.x */
+ dbuf_putstr(s, "0.");
+ for(i = 0; i < -n; i++) {
+ dbuf_putc(s, '0');
+ }
+ output_digits(s, a1, radix, n_digits, n_digits);
+ } else {
+ if (n_digits <= n) {
+ /* no dot */
+ output_digits(s, a1, radix, n_digits, n_digits);
+ for(i = 0; i < (n - n_digits); i++)
+ dbuf_putc(s, '0');
+ } else {
+ output_digits(s, a1, radix, n_digits, n);
+ }
+ }
+ }
+ }
+ bf_delete(a1);
+ }
+ }
+ dbuf_putc(s, '\0');
+ *pbuf = (char *)s->buf;
+ return s->size - 1;
+}
+
+/***************************************************************/
+/* transcendental functions */
+
+/* Note: the algorithm is from MPFR */
+static void bf_const_log2_rec(bf_t *T, bf_t *P, bf_t *Q, limb_t n1,
+ limb_t n2, BOOL need_P)
+{
+ bf_context_t *s = T->ctx;
+ if ((n2 - n1) == 1) {
+ if (n1 == 0) {
+ bf_set_ui(P, 3);
+ } else {
+ bf_set_ui(P, n1);
+ P->sign = 1;
+ }
+ bf_set_ui(Q, 2 * n1 + 1);
+ Q->expn += 2;
+ bf_set(T, P);
+ } else {
+ limb_t m;
+ bf_t T1_s, *T1 = &T1_s;
+ bf_t P1_s, *P1 = &P1_s;
+ bf_t Q1_s, *Q1 = &Q1_s;
+
+ m = n1 + ((n2 - n1) >> 1);
+ bf_const_log2_rec(T, P, Q, n1, m, TRUE);
+ bf_init(s, T1);
+ bf_init(s, P1);
+ bf_init(s, Q1);
+ bf_const_log2_rec(T1, P1, Q1, m, n2, need_P);
+ bf_mul(T, T, Q1, BF_PREC_INF, BF_RNDZ);
+ bf_mul(T1, T1, P, BF_PREC_INF, BF_RNDZ);
+ bf_add(T, T, T1, BF_PREC_INF, BF_RNDZ);
+ if (need_P)
+ bf_mul(P, P, P1, BF_PREC_INF, BF_RNDZ);
+ bf_mul(Q, Q, Q1, BF_PREC_INF, BF_RNDZ);
+ bf_delete(T1);
+ bf_delete(P1);
+ bf_delete(Q1);
+ }
+}
+
+/* compute log(2) with faithful rounding at precision 'prec' */
+static void bf_const_log2_internal(bf_t *T, limb_t prec)
+{
+ limb_t w, N;
+ bf_t P_s, *P = &P_s;
+ bf_t Q_s, *Q = &Q_s;
+
+ w = prec + 15;
+ N = w / 3 + 1;
+ bf_init(T->ctx, P);
+ bf_init(T->ctx, Q);
+ bf_const_log2_rec(T, P, Q, 0, N, FALSE);
+ bf_div(T, T, Q, prec, BF_RNDN);
+ bf_delete(P);
+ bf_delete(Q);
+}
+
+/* PI constant */
+
+#define CHUD_A 13591409
+#define CHUD_B 545140134
+#define CHUD_C 640320
+#define CHUD_BITS_PER_TERM 47
+
+static void chud_bs(bf_t *P, bf_t *Q, bf_t *G, int64_t a, int64_t b, int need_g,
+ limb_t prec)
+{
+ bf_context_t *s = P->ctx;
+ int64_t c;
+
+ if (a == (b - 1)) {
+ bf_t T0, T1;
+
+ bf_init(s, &T0);
+ bf_init(s, &T1);
+ bf_set_ui(G, 2 * b - 1);
+ bf_mul_ui(G, G, 6 * b - 1, prec, BF_RNDN);
+ bf_mul_ui(G, G, 6 * b - 5, prec, BF_RNDN);
+ bf_set_ui(&T0, CHUD_B);
+ bf_mul_ui(&T0, &T0, b, prec, BF_RNDN);
+ bf_set_ui(&T1, CHUD_A);
+ bf_add(&T0, &T0, &T1, prec, BF_RNDN);
+ bf_mul(P, G, &T0, prec, BF_RNDN);
+ P->sign = b & 1;
+
+ bf_set_ui(Q, b);
+ bf_mul_ui(Q, Q, b, prec, BF_RNDN);
+ bf_mul_ui(Q, Q, b, prec, BF_RNDN);
+ bf_mul_ui(Q, Q, (uint64_t)CHUD_C * CHUD_C * CHUD_C / 24, prec, BF_RNDN);
+ bf_delete(&T0);
+ bf_delete(&T1);
+ } else {
+ bf_t P2, Q2, G2;
+
+ bf_init(s, &P2);
+ bf_init(s, &Q2);
+ bf_init(s, &G2);
+
+ c = (a + b) / 2;
+ chud_bs(P, Q, G, a, c, 1, prec);
+ chud_bs(&P2, &Q2, &G2, c, b, need_g, prec);
+
+ /* Q = Q1 * Q2 */
+ /* G = G1 * G2 */
+ /* P = P1 * Q2 + P2 * G1 */
+ bf_mul(&P2, &P2, G, prec, BF_RNDN);
+ if (!need_g)
+ bf_set_ui(G, 0);
+ bf_mul(P, P, &Q2, prec, BF_RNDN);
+ bf_add(P, P, &P2, prec, BF_RNDN);
+ bf_delete(&P2);
+
+ bf_mul(Q, Q, &Q2, prec, BF_RNDN);
+ bf_delete(&Q2);
+ if (need_g)
+ bf_mul(G, G, &G2, prec, BF_RNDN);
+ bf_delete(&G2);
+ }
+}
+
+/* compute Pi with faithful rounding at precision 'prec' using the
+ Chudnovsky formula */
+static void bf_const_pi_internal(bf_t *Q, limb_t prec)
+{
+ bf_context_t *s = Q->ctx;
+ int64_t n, prec1;
+ bf_t P, G;
+
+ /* number of serie terms */
+ n = prec / CHUD_BITS_PER_TERM + 1;
+ /* XXX: precision analysis */
+ prec1 = prec + 32;
+
+ bf_init(s, &P);
+ bf_init(s, &G);
+
+ chud_bs(&P, Q, &G, 0, n, 0, BF_PREC_INF);
+
+ bf_mul_ui(&G, Q, CHUD_A, prec1, BF_RNDN);
+ bf_add(&P, &G, &P, prec1, BF_RNDN);
+ bf_div(Q, Q, &P, prec1, BF_RNDF);
+
+ bf_set_ui(&P, CHUD_C / 64);
+ bf_rsqrt(&G, &P, prec1);
+ bf_mul_ui(&G, &G, (uint64_t)CHUD_C * CHUD_C / (8 * 12), prec1, BF_RNDF);
+ bf_mul(Q, Q, &G, prec, BF_RNDN);
+ bf_delete(&P);
+ bf_delete(&G);
+}
+
+static int bf_const_get(bf_t *T, limb_t prec, bf_flags_t flags,
+ BFConstCache *c,
+ void (*func)(bf_t *res, limb_t prec))
+{
+ limb_t ziv_extra_bits, prec1;
+
+ ziv_extra_bits = 32;
+ for(;;) {
+ prec1 = prec + ziv_extra_bits;
+ if (c->prec < prec1) {
+ if (c->val.len == 0)
+ bf_init(T->ctx, &c->val);
+ func(&c->val, prec1);
+ c->prec = prec1;
+ } else {
+ prec1 = c->prec;
+ }
+ bf_set(T, &c->val);
+ if (!bf_can_round(T, prec, flags & BF_RND_MASK, prec1)) {
+ /* and more precision and retry */
+ ziv_extra_bits = ziv_extra_bits + (ziv_extra_bits / 2);
+ } else {
+ break;
+ }
+ }
+ return bf_round(T, prec, flags);
+}
+
+static void bf_const_free(BFConstCache *c)
+{
+ bf_delete(&c->val);
+ memset(c, 0, sizeof(*c));
+}
+
+int bf_const_log2(bf_t *T, limb_t prec, bf_flags_t flags)
+{
+ bf_context_t *s = T->ctx;
+ return bf_const_get(T, prec, flags, &s->log2_cache, bf_const_log2_internal);
+}
+
+int bf_const_pi(bf_t *T, limb_t prec, bf_flags_t flags)
+{
+ bf_context_t *s = T->ctx;
+ return bf_const_get(T, prec, flags, &s->pi_cache, bf_const_pi_internal);
+}
+
+void bf_clear_cache(bf_context_t *s)
+{
+#ifdef USE_FFT_MUL
+ fft_clear_cache(s);
+#endif
+ bf_const_free(&s->log2_cache);
+ bf_const_free(&s->pi_cache);
+}
+
+/* ZivFunc should compute the result 'r' with faithful rounding at
+ precision 'prec'. For efficiency purposes, the final bf_round()
+ does not need to be done in the function. */
+typedef int ZivFunc(bf_t *r, const bf_t *a, limb_t prec, void *opaque);
+
+static int bf_ziv_rounding(bf_t *r, const bf_t *a,
+ limb_t prec, bf_flags_t flags,
+ ZivFunc *f, void *opaque)
+{
+ int rnd_mode, ret;
+ slimb_t prec1, ziv_extra_bits;
+
+ rnd_mode = flags & BF_RND_MASK;
+ if (rnd_mode == BF_RNDF) {
+ /* no need to iterate */
+ f(r, a, prec, opaque);
+ ret = 0;
+ } else {
+ ziv_extra_bits = 32;
+ for(;;) {
+ prec1 = prec + ziv_extra_bits;
+ ret = f(r, a, prec1, opaque);
+ if (ret & (BF_ST_OVERFLOW | BF_ST_UNDERFLOW)) {
+ /* should never happen because it indicates the
+ rounding cannot be done correctly, but we do not
+ catch all the cases */
+ return ret;
+ }
+ /* if the result is exact, we can stop */
+ if (!(ret & BF_ST_INEXACT)) {
+ ret = 0;
+ break;
+ }
+ if (bf_can_round(r, prec, rnd_mode, prec1)) {
+ ret = BF_ST_INEXACT;
+ break;
+ }
+ ziv_extra_bits = ziv_extra_bits * 2;
+ }
+ }
+ return bf_round(r, prec, flags) | ret;
+}
+
+/* Compute the exponential using faithful rounding at precision 'prec'.
+ Note: the algorithm is from MPFR */
+static int bf_exp_internal(bf_t *r, const bf_t *a, limb_t prec, void *opaque)
+{
+ bf_context_t *s = r->ctx;
+ bf_t T_s, *T = &T_s;
+ slimb_t n, K, l, i, prec1;
+
+ assert(r != a);
+
+ /* argument reduction:
+ T = a - n*log(2) with 0 <= T < log(2) and n integer.
+ */
+ bf_init(s, T);
+ if (a->expn <= -1) {
+ /* 0 <= abs(a) <= 0.5 */
+ if (a->sign)
+ n = -1;
+ else
+ n = 0;
+ } else {
+ bf_const_log2(T, LIMB_BITS, BF_RNDZ);
+ bf_div(T, a, T, LIMB_BITS, BF_RNDD);
+ bf_get_limb(&n, T, 0);
+ }
+
+ K = bf_isqrt((prec + 1) / 2);
+ l = (prec - 1) / K + 1;
+ /* XXX: precision analysis ? */
+ prec1 = prec + (K + 2 * l + 18) + K + 8;
+ if (a->expn > 0)
+ prec1 += a->expn;
+ // printf("n=%ld K=%ld prec1=%ld\n", n, K, prec1);
+
+ bf_const_log2(T, prec1, BF_RNDF);
+ bf_mul_si(T, T, n, prec1, BF_RNDN);
+ bf_sub(T, a, T, prec1, BF_RNDN);
+
+ /* reduce the range of T */
+ bf_mul_2exp(T, -K, BF_PREC_INF, BF_RNDZ);
+
+ /* Taylor expansion around zero :
+ 1 + x + x^2/2 + ... + x^n/n!
+ = (1 + x * (1 + x/2 * (1 + ... (x/n))))
+ */
+ {
+ bf_t U_s, *U = &U_s;
+
+ bf_init(s, U);
+ bf_set_ui(r, 1);
+ for(i = l ; i >= 1; i--) {
+ bf_set_ui(U, i);
+ bf_div(U, T, U, prec1, BF_RNDN);
+ bf_mul(r, r, U, prec1, BF_RNDN);
+ bf_add_si(r, r, 1, prec1, BF_RNDN);
+ }
+ bf_delete(U);
+ }
+ bf_delete(T);
+
+ /* undo the range reduction */
+ for(i = 0; i < K; i++) {
+ bf_mul(r, r, r, prec1, BF_RNDN);
+ }
+
+ /* undo the argument reduction */
+ bf_mul_2exp(r, n, BF_PREC_INF, BF_RNDZ);
+
+ return BF_ST_INEXACT;
+}
+
+int bf_exp(bf_t *r, const bf_t *a, limb_t prec, bf_flags_t flags)
+{
+ bf_context_t *s = r->ctx;
+ assert(r != a);
+ if (a->len == 0) {
+ if (a->expn == BF_EXP_NAN) {
+ bf_set_nan(r);
+ } else if (a->expn == BF_EXP_INF) {
+ if (a->sign)
+ bf_set_zero(r, 0);
+ else
+ bf_set_inf(r, 0);
+ } else {
+ bf_set_ui(r, 1);
+ }
+ return 0;
+ }
+
+ /* crude overflow and underflow tests */
+ if (a->expn > 0) {
+ bf_t T_s, *T = &T_s;
+ bf_t log2_s, *log2 = &log2_s;
+ slimb_t e_min, e_max;
+ e_max = (limb_t)1 << (bf_get_exp_bits(flags) - 1);
+ e_min = -e_max + 3;
+ if (flags & BF_FLAG_SUBNORMAL)
+ e_min -= (prec - 1);
+
+ bf_init(s, T);
+ bf_init(s, log2);
+ bf_const_log2(log2, LIMB_BITS, BF_RNDU);
+ bf_mul_ui(T, log2, e_max, LIMB_BITS, BF_RNDU);
+ /* a > e_max * log(2) implies exp(a) > e_max */
+ if (bf_cmp_lt(T, a) > 0) {
+ /* overflow */
+ bf_delete(T);
+ bf_delete(log2);
+ return bf_set_overflow(r, 0, prec, flags);
+ }
+ /* a < e_min * log(2) implies exp(a) < e_min */
+ bf_mul_si(T, log2, e_min, LIMB_BITS, BF_RNDD);
+ if (bf_cmp_lt(a, T)) {
+ int rnd_mode = flags & BF_RND_MASK;
+
+ /* underflow */
+ bf_delete(T);
+ bf_delete(log2);
+ if (rnd_mode == BF_RNDU) {
+ /* set the smallest value */
+ bf_set_ui(r, 1);
+ r->expn = e_min;
+ } else {
+ bf_set_zero(r, 0);
+ }
+ return BF_ST_UNDERFLOW | BF_ST_INEXACT;
+ }
+ bf_delete(log2);
+ bf_delete(T);
+ }
+
+ return bf_ziv_rounding(r, a, prec, flags, bf_exp_internal, NULL);
+}
+
+static int bf_log_internal(bf_t *r, const bf_t *a, limb_t prec, void *opaque)
+{
+ bf_context_t *s = r->ctx;
+ bf_t T_s, *T = &T_s;
+ bf_t U_s, *U = &U_s;
+ bf_t V_s, *V = &V_s;
+ slimb_t n, prec1, l, i, K;
+
+ assert(r != a);
+
+ bf_init(s, T);
+ /* argument reduction 1 */
+ /* T=a*2^n with 2/3 <= T <= 4/3 */
+ {
+ bf_t U_s, *U = &U_s;
+ bf_set(T, a);
+ n = T->expn;
+ T->expn = 0;
+ /* U= ~ 2/3 */
+ bf_init(s, U);
+ bf_set_ui(U, 0xaaaaaaaa);
+ U->expn = 0;
+ if (bf_cmp_lt(T, U)) {
+ T->expn++;
+ n--;
+ }
+ bf_delete(U);
+ }
+ // printf("n=%ld\n", n);
+ // bf_print_str("T", T);
+
+ /* XXX: precision analysis */
+ /* number of iterations for argument reduction 2 */
+ K = bf_isqrt((prec + 1) / 2);
+ /* order of Taylor expansion */
+ l = prec / (2 * K) + 1;
+ /* precision of the intermediate computations */
+ prec1 = prec + K + 2 * l + 32;
+
+ bf_init(s, U);
+ bf_init(s, V);
+
+ /* Note: cancellation occurs here, so we use more precision (XXX:
+ reduce the precision by computing the exact cancellation) */
+ bf_add_si(T, T, -1, BF_PREC_INF, BF_RNDN);
+
+ /* argument reduction 2 */
+ for(i = 0; i < K; i++) {
+ /* T = T / (1 + sqrt(1 + T)) */
+ bf_add_si(U, T, 1, prec1, BF_RNDN);
+ bf_sqrt(V, U, prec1, BF_RNDF);
+ bf_add_si(U, V, 1, prec1, BF_RNDN);
+ bf_div(T, T, U, prec1, BF_RNDN);
+ }
+
+ {
+ bf_t Y_s, *Y = &Y_s;
+ bf_t Y2_s, *Y2 = &Y2_s;
+ bf_init(s, Y);
+ bf_init(s, Y2);
+
+ /* compute ln(1+x) = ln((1+y)/(1-y)) with y=x/(2+x)
+ = y + y^3/3 + ... + y^(2*l + 1) / (2*l+1)
+ with Y=Y^2
+ = y*(1+Y/3+Y^2/5+...) = y*(1+Y*(1/3+Y*(1/5 + ...)))
+ */
+ bf_add_si(Y, T, 2, prec1, BF_RNDN);
+ bf_div(Y, T, Y, prec1, BF_RNDN);
+
+ bf_mul(Y2, Y, Y, prec1, BF_RNDN);
+ bf_set_ui(r, 0);
+ for(i = l; i >= 1; i--) {
+ bf_set_ui(U, 1);
+ bf_set_ui(V, 2 * i + 1);
+ bf_div(U, U, V, prec1, BF_RNDN);
+ bf_add(r, r, U, prec1, BF_RNDN);
+ bf_mul(r, r, Y2, prec1, BF_RNDN);
+ }
+ bf_add_si(r, r, 1, prec1, BF_RNDN);
+ bf_mul(r, r, Y, prec1, BF_RNDN);
+ bf_delete(Y);
+ bf_delete(Y2);
+ }
+ bf_delete(V);
+ bf_delete(U);
+
+ /* multiplication by 2 for the Taylor expansion and undo the
+ argument reduction 2*/
+ bf_mul_2exp(r, K + 1, BF_PREC_INF, BF_RNDZ);
+
+ /* undo the argument reduction 1 */
+ bf_const_log2(T, prec1, BF_RNDF);
+ bf_mul_si(T, T, n, prec1, BF_RNDN);
+ bf_add(r, r, T, prec1, BF_RNDN);
+
+ bf_delete(T);
+ return BF_ST_INEXACT;
+}
+
+int bf_log(bf_t *r, const bf_t *a, limb_t prec, bf_flags_t flags)
+{
+ bf_context_t *s = r->ctx;
+ bf_t T_s, *T = &T_s;
+
+ assert(r != a);
+ if (a->len == 0) {
+ if (a->expn == BF_EXP_NAN) {
+ bf_set_nan(r);
+ return 0;
+ } else if (a->expn == BF_EXP_INF) {
+ if (a->sign) {
+ bf_set_nan(r);
+ return BF_ST_INVALID_OP;
+ } else {
+ bf_set_inf(r, 0);
+ return 0;
+ }
+ } else {
+ bf_set_inf(r, 1);
+ return 0;
+ }
+ }
+ if (a->sign) {
+ bf_set_nan(r);
+ return BF_ST_INVALID_OP;
+ }
+ bf_init(s, T);
+ bf_set_ui(T, 1);
+ if (bf_cmp_eq(a, T)) {
+ bf_set_zero(r, 0);
+ bf_delete(T);
+ return 0;
+ }
+ bf_delete(T);
+
+ return bf_ziv_rounding(r, a, prec, flags, bf_log_internal, NULL);
+}
+
+/* x and y finite and x > 0 */
+/* XXX: overflow/underflow handling */
+static int bf_pow_generic(bf_t *r, const bf_t *x, limb_t prec, void *opaque)
+{
+ bf_context_t *s = r->ctx;
+ const bf_t *y = opaque;
+ bf_t T_s, *T = &T_s;
+ limb_t prec1;
+
+ bf_init(s, T);
+ /* XXX: proof for the added precision */
+ prec1 = prec + 32;
+ bf_log(T, x, prec1, BF_RNDF);
+ bf_mul(T, T, y, prec1, BF_RNDF);
+ bf_exp(r, T, prec1, BF_RNDF);
+ bf_delete(T);
+ return BF_ST_INEXACT;
+}
+
+/* x and y finite, x > 0, y integer and y fits on one limb */
+/* XXX: overflow/underflow handling */
+static int bf_pow_int(bf_t *r, const bf_t *x, limb_t prec, void *opaque)
+{
+ bf_context_t *s = r->ctx;
+ const bf_t *y = opaque;
+ bf_t T_s, *T = &T_s;
+ limb_t prec1;
+ int ret;
+ slimb_t y1;
+
+ bf_get_limb(&y1, y, 0);
+ if (y1 < 0)
+ y1 = -y1;
+ /* XXX: proof for the added precision */
+ prec1 = prec + ceil_log2(y1) * 2 + 8;
+ ret = bf_pow_ui(r, x, y1 < 0 ? -y1 : y1, prec1, BF_RNDN);
+ if (y->sign) {
+ bf_init(s, T);
+ bf_set_ui(T, 1);
+ ret |= bf_div(r, T, r, prec1, BF_RNDN);
+ bf_delete(T);
+ }
+ return ret;
+}
+
+/* x must be a finite non zero float. Return TRUE if there is a
+ floating point number r such as x=r^(2^n) and return this floating
+ point number 'r'. Otherwise return FALSE and r is undefined. */
+static BOOL check_exact_power2n(bf_t *r, const bf_t *x, slimb_t n)
+{
+ bf_context_t *s = r->ctx;
+ bf_t T_s, *T = &T_s;
+ slimb_t e, i, er;
+ limb_t v;
+
+ /* x = m*2^e with m odd integer */
+ e = bf_get_exp_min(x);
+ /* fast check on the exponent */
+ if (n > (LIMB_BITS - 1)) {
+ if (e != 0)
+ return FALSE;
+ er = 0;
+ } else {
+ if ((e & (((limb_t)1 << n) - 1)) != 0)
+ return FALSE;
+ er = e >> n;
+ }
+ /* every perfect odd square = 1 modulo 8 */
+ v = get_bits(x->tab, x->len, x->len * LIMB_BITS - x->expn + e);
+ if ((v & 7) != 1)
+ return FALSE;
+
+ bf_init(s, T);
+ bf_set(T, x);
+ T->expn -= e;
+ for(i = 0; i < n; i++) {
+ if (i != 0)
+ bf_set(T, r);
+ if (bf_sqrtrem(r, NULL, T) != 0)
+ return FALSE;
+ }
+ r->expn += er;
+ return TRUE;
+}
+
+/* prec = BF_PREC_INF is accepted for x and y integers and y >= 0 */
+int bf_pow(bf_t *r, const bf_t *x, const bf_t *y, limb_t prec, bf_flags_t flags)
+{
+ bf_context_t *s = r->ctx;
+ bf_t T_s, *T = &T_s;
+ bf_t ytmp_s;
+ BOOL y_is_int, y_is_odd;
+ int r_sign, ret, rnd_mode;
+ slimb_t y_emin;
+
+ if (x->len == 0 || y->len == 0) {
+ if (y->expn == BF_EXP_ZERO) {
+ /* pow(x, 0) = 1 */
+ bf_set_ui(r, 1);
+ } else if (x->expn == BF_EXP_NAN) {
+ bf_set_nan(r);
+ } else {
+ int cmp_x_abs_1;
+ bf_set_ui(r, 1);
+ cmp_x_abs_1 = bf_cmpu(x, r);
+ if (cmp_x_abs_1 == 0 && (flags & BF_POW_JS_QUICKS) &&
+ (y->expn >= BF_EXP_INF)) {
+ bf_set_nan(r);
+ } else if (cmp_x_abs_1 == 0 &&
+ (!x->sign || y->expn != BF_EXP_NAN)) {
+ /* pow(1, y) = 1 even if y = NaN */
+ /* pow(-1, +/-inf) = 1 */
+ } else if (y->expn == BF_EXP_NAN) {
+ bf_set_nan(r);
+ } else if (y->expn == BF_EXP_INF) {
+ if (y->sign == (cmp_x_abs_1 > 0)) {
+ bf_set_zero(r, 0);
+ } else {
+ bf_set_inf(r, 0);
+ }
+ } else {
+ y_emin = bf_get_exp_min(y);
+ y_is_odd = (y_emin == 0);
+ if (y->sign == (x->expn == BF_EXP_ZERO)) {
+ bf_set_inf(r, y_is_odd & x->sign);
+ if (y->sign) {
+ /* pow(0, y) with y < 0 */
+ return BF_ST_DIVIDE_ZERO;
+ }
+ } else {
+ bf_set_zero(r, y_is_odd & x->sign);
+ }
+ }
+ }
+ return 0;
+ }
+ bf_init(s, T);
+ bf_set(T, x);
+ y_emin = bf_get_exp_min(y);
+ y_is_int = (y_emin >= 0);
+ rnd_mode = flags & BF_RND_MASK;
+ if (x->sign) {
+ if (!y_is_int) {
+ bf_set_nan(r);
+ bf_delete(T);
+ return BF_ST_INVALID_OP;
+ }
+ y_is_odd = (y_emin == 0);
+ r_sign = y_is_odd;
+ /* change the directed rounding mode if the sign of the result
+ is changed */
+ if (r_sign && (rnd_mode == BF_RNDD || rnd_mode == BF_RNDU))
+ flags ^= 1;
+ bf_neg(T);
+ } else {
+ r_sign = 0;
+ }
+
+ bf_set_ui(r, 1);
+ if (bf_cmp_eq(T, r)) {
+ /* abs(x) = 1: nothing more to do */
+ ret = 0;
+ } else if (y_is_int) {
+ slimb_t T_bits, e;
+ int_pow:
+ T_bits = T->expn - bf_get_exp_min(T);
+ if (T_bits == 1) {
+ /* pow(2^b, y) = 2^(b*y) */
+ bf_mul_si(T, y, T->expn - 1, LIMB_BITS, BF_RNDZ);
+ bf_get_limb(&e, T, 0);
+ bf_set_ui(r, 1);
+ ret = bf_mul_2exp(r, e, prec, flags);
+ } else if (prec == BF_PREC_INF) {
+ slimb_t y1;
+ /* specific case for infinite precision (integer case) */
+ bf_get_limb(&y1, y, 0);
+ assert(!y->sign);
+ /* x must be an integer, so abs(x) >= 2 */
+ if (y1 >= ((slimb_t)1 << BF_EXP_BITS_MAX)) {
+ bf_delete(T);
+ return bf_set_overflow(r, 0, BF_PREC_INF, flags);
+ }
+ ret = bf_pow_ui(r, T, y1, BF_PREC_INF, BF_RNDZ);
+ } else {
+ if (y->expn <= 31) {
+ /* small enough power: use exponentiation in all cases */
+ } else if (y->sign) {
+ /* cannot be exact */
+ goto general_case;
+ } else {
+ if (rnd_mode == BF_RNDF)
+ goto general_case; /* no need to track exact results */
+ /* see if the result has a chance to be exact:
+ if x=a*2^b (a odd), x^y=a^y*2^(b*y)
+ x^y needs a precision of at least floor_log2(a)*y bits
+ */
+ bf_mul_si(r, y, T_bits - 1, LIMB_BITS, BF_RNDZ);
+ bf_get_limb(&e, r, 0);
+ if (prec < e)
+ goto general_case;
+ }
+ ret = bf_ziv_rounding(r, T, prec, flags, bf_pow_int, (void *)y);
+ }
+ } else {
+ if (rnd_mode != BF_RNDF) {
+ bf_t *y1;
+ if (y_emin < 0 && check_exact_power2n(r, T, -y_emin)) {
+ /* the problem is reduced to a power to an integer */
+#if 0
+ printf("\nn=%ld\n", -y_emin);
+ bf_print_str("T", T);
+ bf_print_str("r", r);
+#endif
+ bf_set(T, r);
+ y1 = &ytmp_s;
+ y1->tab = y->tab;
+ y1->len = y->len;
+ y1->sign = y->sign;
+ y1->expn = y->expn - y_emin;
+ y = y1;
+ goto int_pow;
+ }
+ }
+ general_case:
+ ret = bf_ziv_rounding(r, T, prec, flags, bf_pow_generic, (void *)y);
+ }
+ bf_delete(T);
+ r->sign = r_sign;
+ return ret;
+}
+
+/* compute sqrt(-2*x-x^2) to get |sin(x)| from cos(x) - 1. */
+static void bf_sqrt_sin(bf_t *r, const bf_t *x, limb_t prec1)
+{
+ bf_context_t *s = r->ctx;
+ bf_t T_s, *T = &T_s;
+ bf_init(s, T);
+ bf_set(T, x);
+ bf_mul(r, T, T, prec1, BF_RNDN);
+ bf_mul_2exp(T, 1, BF_PREC_INF, BF_RNDZ);
+ bf_add(T, T, r, prec1, BF_RNDN);
+ bf_neg(T);
+ bf_sqrt(r, T, prec1, BF_RNDF);
+ bf_delete(T);
+}
+
+int bf_sincos(bf_t *s, bf_t *c, const bf_t *a, limb_t prec)
+{
+ bf_context_t *s1 = a->ctx;
+ bf_t T_s, *T = &T_s;
+ bf_t U_s, *U = &U_s;
+ bf_t r_s, *r = &r_s;
+ slimb_t K, prec1, i, l, mod, prec2;
+ int is_neg;
+
+ assert(c != a && s != a);
+ if (a->len == 0) {
+ if (a->expn == BF_EXP_NAN) {
+ if (c)
+ bf_set_nan(c);
+ if (s)
+ bf_set_nan(s);
+ return 0;
+ } else if (a->expn == BF_EXP_INF) {
+ if (c)
+ bf_set_nan(c);
+ if (s)
+ bf_set_nan(s);
+ return BF_ST_INVALID_OP;
+ } else {
+ if (c)
+ bf_set_ui(c, 1);
+ if (s)
+ bf_set_zero(s, a->sign);
+ return 0;
+ }
+ }
+
+ bf_init(s1, T);
+ bf_init(s1, U);
+ bf_init(s1, r);
+
+ /* XXX: precision analysis */
+ K = bf_isqrt(prec / 2);
+ l = prec / (2 * K) + 1;
+ prec1 = prec + 2 * K + l + 8;
+
+ /* after the modulo reduction, -pi/4 <= T <= pi/4 */
+ if (a->expn <= -1) {
+ /* abs(a) <= 0.25: no modulo reduction needed */
+ bf_set(T, a);
+ mod = 0;
+ } else {
+ slimb_t cancel;
+ cancel = 0;
+ for(;;) {
+ prec2 = prec1 + cancel;
+ bf_const_pi(U, prec2, BF_RNDF);
+ bf_mul_2exp(U, -1, BF_PREC_INF, BF_RNDZ);
+ bf_remquo(&mod, T, a, U, prec2, BF_RNDN);
+ // printf("T.expn=%ld prec2=%ld\n", T->expn, prec2);
+ if (mod == 0 || (T->expn != BF_EXP_ZERO &&
+ (T->expn + prec2) >= (prec1 - 1)))
+ break;
+ /* increase the number of bits until the precision is good enough */
+ cancel = bf_max(-T->expn, (cancel + 1) * 3 / 2);
+ }
+ mod &= 3;
+ }
+
+ is_neg = T->sign;
+
+ /* compute cosm1(x) = cos(x) - 1 */
+ bf_mul(T, T, T, prec1, BF_RNDN);
+ bf_mul_2exp(T, -2 * K, BF_PREC_INF, BF_RNDZ);
+
+ /* Taylor expansion:
+ -x^2/2 + x^4/4! - x^6/6! + ...
+ */
+ bf_set_ui(r, 1);
+ for(i = l ; i >= 1; i--) {
+ bf_set_ui(U, 2 * i - 1);
+ bf_mul_ui(U, U, 2 * i, BF_PREC_INF, BF_RNDZ);
+ bf_div(U, T, U, prec1, BF_RNDN);
+ bf_mul(r, r, U, prec1, BF_RNDN);
+ bf_neg(r);
+ if (i != 1)
+ bf_add_si(r, r, 1, prec1, BF_RNDN);
+ }
+ bf_delete(U);
+
+ /* undo argument reduction:
+ cosm1(2*x)= 2*(2*cosm1(x)+cosm1(x)^2)
+ */
+ for(i = 0; i < K; i++) {
+ bf_mul(T, r, r, prec1, BF_RNDN);
+ bf_mul_2exp(r, 1, BF_PREC_INF, BF_RNDZ);
+ bf_add(r, r, T, prec1, BF_RNDN);
+ bf_mul_2exp(r, 1, BF_PREC_INF, BF_RNDZ);
+ }
+ bf_delete(T);
+
+ if (c) {
+ if ((mod & 1) == 0) {
+ bf_add_si(c, r, 1, prec1, BF_RNDN);
+ } else {
+ bf_sqrt_sin(c, r, prec1);
+ c->sign = is_neg ^ 1;
+ }
+ c->sign ^= mod >> 1;
+ }
+ if (s) {
+ if ((mod & 1) == 0) {
+ bf_sqrt_sin(s, r, prec1);
+ s->sign = is_neg;
+ } else {
+ bf_add_si(s, r, 1, prec1, BF_RNDN);
+ }
+ s->sign ^= mod >> 1;
+ }
+ bf_delete(r);
+ return BF_ST_INEXACT;
+}
+
+static int bf_cos_internal(bf_t *r, const bf_t *a, limb_t prec, void *opaque)
+{
+ return bf_sincos(NULL, r, a, prec);
+}
+
+int bf_cos(bf_t *r, const bf_t *a, limb_t prec, bf_flags_t flags)
+{
+ return bf_ziv_rounding(r, a, prec, flags, bf_cos_internal, NULL);
+}
+
+static int bf_sin_internal(bf_t *r, const bf_t *a, limb_t prec, void *opaque)
+{
+ return bf_sincos(r, NULL, a, prec);
+}
+
+int bf_sin(bf_t *r, const bf_t *a, limb_t prec, bf_flags_t flags)
+{
+ return bf_ziv_rounding(r, a, prec, flags, bf_sin_internal, NULL);
+}
+
+static int bf_tan_internal(bf_t *r, const bf_t *a, limb_t prec, void *opaque)
+{
+ bf_context_t *s = r->ctx;
+ bf_t T_s, *T = &T_s;
+ limb_t prec1;
+
+ if (a->len == 0) {
+ if (a->expn == BF_EXP_NAN) {
+ bf_set_nan(r);
+ return 0;
+ } else if (a->expn == BF_EXP_INF) {
+ bf_set_nan(r);
+ return BF_ST_INVALID_OP;
+ } else {
+ bf_set_zero(r, a->sign);
+ return 0;
+ }
+ }
+
+ /* XXX: precision analysis */
+ prec1 = prec + 8;
+ bf_init(s, T);
+ bf_sincos(r, T, a, prec1);
+ bf_div(r, r, T, prec1, BF_RNDF);
+ bf_delete(T);
+ return BF_ST_INEXACT;
+}
+
+int bf_tan(bf_t *r, const bf_t *a, limb_t prec, bf_flags_t flags)
+{
+ return bf_ziv_rounding(r, a, prec, flags, bf_tan_internal, NULL);
+}
+
+/* if add_pi2 is true, add pi/2 to the result (used for acos(x) to
+ avoid cancellation) */
+static int bf_atan_internal(bf_t *r, const bf_t *a, limb_t prec,
+ void *opaque)
+{
+ bf_context_t *s = r->ctx;
+ BOOL add_pi2 = (BOOL)(intptr_t)opaque;
+ bf_t T_s, *T = &T_s;
+ bf_t U_s, *U = &U_s;
+ bf_t V_s, *V = &V_s;
+ bf_t X2_s, *X2 = &X2_s;
+ int cmp_1;
+ slimb_t prec1, i, K, l;
+
+ if (a->len == 0) {
+ if (a->expn == BF_EXP_NAN) {
+ bf_set_nan(r);
+ return 0;
+ } else {
+ if (a->expn == BF_EXP_INF)
+ i = 1 - 2 * a->sign;
+ else
+ i = 0;
+ i += add_pi2;
+ /* return i*(pi/2) with -1 <= i <= 2 */
+ if (i == 0) {
+ bf_set_zero(r, add_pi2 ? 0 : a->sign);
+ return 0;
+ } else {
+ /* PI or PI/2 */
+ bf_const_pi(r, prec, BF_RNDF);
+ if (i != 2)
+ bf_mul_2exp(r, -1, BF_PREC_INF, BF_RNDZ);
+ r->sign = (i < 0);
+ return BF_ST_INEXACT;
+ }
+ }
+ }
+
+ bf_init(s, T);
+ bf_set_ui(T, 1);
+ cmp_1 = bf_cmpu(a, T);
+ if (cmp_1 == 0 && !add_pi2) {
+ /* short cut: abs(a) == 1 -> +/-pi/4 */
+ bf_const_pi(r, prec, BF_RNDF);
+ bf_mul_2exp(r, -2, BF_PREC_INF, BF_RNDZ);
+ r->sign = a->sign;
+ bf_delete(T);
+ return BF_ST_INEXACT;
+ }
+
+ /* XXX: precision analysis */
+ K = bf_isqrt((prec + 1) / 2);
+ l = prec / (2 * K) + 1;
+ prec1 = prec + K + 2 * l + 32;
+ // printf("prec=%ld K=%ld l=%ld prec1=%ld\n", prec, K, l, prec1);
+
+ if (cmp_1 > 0) {
+ bf_set_ui(T, 1);
+ bf_div(T, T, a, prec1, BF_RNDN);
+ } else {
+ bf_set(T, a);
+ }
+
+ /* abs(T) <= 1 */
+
+ /* argument reduction */
+
+ bf_init(s, U);
+ bf_init(s, V);
+ bf_init(s, X2);
+ for(i = 0; i < K; i++) {
+ /* T = T / (1 + sqrt(1 + T^2)) */
+ bf_mul(U, T, T, prec1, BF_RNDN);
+ bf_add_si(U, U, 1, prec1, BF_RNDN);
+ bf_sqrt(V, U, prec1, BF_RNDN);
+ bf_add_si(V, V, 1, prec1, BF_RNDN);
+ bf_div(T, T, V, prec1, BF_RNDN);
+ }
+
+ /* Taylor series:
+ x - x^3/3 + ... + (-1)^ l * y^(2*l + 1) / (2*l+1)
+ */
+ bf_mul(X2, T, T, prec1, BF_RNDN);
+ bf_set_ui(r, 0);
+ for(i = l; i >= 1; i--) {
+ bf_set_si(U, 1);
+ bf_set_ui(V, 2 * i + 1);
+ bf_div(U, U, V, prec1, BF_RNDN);
+ bf_neg(r);
+ bf_add(r, r, U, prec1, BF_RNDN);
+ bf_mul(r, r, X2, prec1, BF_RNDN);
+ }
+ bf_neg(r);
+ bf_add_si(r, r, 1, prec1, BF_RNDN);
+ bf_mul(r, r, T, prec1, BF_RNDN);
+
+ /* undo the argument reduction */
+ bf_mul_2exp(r, K, BF_PREC_INF, BF_RNDZ);
+
+ bf_delete(U);
+ bf_delete(V);
+ bf_delete(X2);
+
+ i = add_pi2;
+ if (cmp_1 > 0) {
+ /* undo the inversion : r = sign(a)*PI/2 - r */
+ bf_neg(r);
+ i += 1 - 2 * a->sign;
+ }
+ /* add i*(pi/2) with -1 <= i <= 2 */
+ if (i != 0) {
+ bf_const_pi(T, prec1, BF_RNDF);
+ if (i != 2)
+ bf_mul_2exp(T, -1, BF_PREC_INF, BF_RNDZ);
+ T->sign = (i < 0);
+ bf_add(r, T, r, prec1, BF_RNDN);
+ }
+
+ bf_delete(T);
+ return BF_ST_INEXACT;
+}
+
+int bf_atan(bf_t *r, const bf_t *a, limb_t prec, bf_flags_t flags)
+{
+ return bf_ziv_rounding(r, a, prec, flags, bf_atan_internal, (void *)FALSE);
+}
+
+static int bf_atan2_internal(bf_t *r, const bf_t *y, limb_t prec, void *opaque)
+{
+ bf_context_t *s = r->ctx;
+ const bf_t *x = opaque;
+ bf_t T_s, *T = &T_s;
+ limb_t prec1;
+ int ret;
+
+ if (y->expn == BF_EXP_NAN || x->expn == BF_EXP_NAN) {
+ bf_set_nan(r);
+ return 0;
+ }
+
+ /* compute atan(y/x) assumming inf/inf = 1 and 0/0 = 0 */
+ bf_init(s, T);
+ prec1 = prec + 32;
+ if (y->expn == BF_EXP_INF && x->expn == BF_EXP_INF) {
+ bf_set_ui(T, 1);
+ T->sign = y->sign ^ x->sign;
+ } else if (y->expn == BF_EXP_ZERO && x->expn == BF_EXP_ZERO) {
+ bf_set_zero(T, y->sign ^ x->sign);
+ } else {
+ bf_div(T, y, x, prec1, BF_RNDF);
+ }
+ ret = bf_atan(r, T, prec1, BF_RNDF);
+
+ if (x->sign) {
+ /* if x < 0 (it includes -0), return sign(y)*pi + atan(y/x) */
+ bf_const_pi(T, prec1, BF_RNDF);
+ T->sign = y->sign;
+ bf_add(r, r, T, prec1, BF_RNDN);
+ ret |= BF_ST_INEXACT;
+ }
+
+ bf_delete(T);
+ return ret;
+}
+
+int bf_atan2(bf_t *r, const bf_t *y, const bf_t *x,
+ limb_t prec, bf_flags_t flags)
+{
+ return bf_ziv_rounding(r, y, prec, flags, bf_atan2_internal, (void *)x);
+}
+
+static int bf_asin_internal(bf_t *r, const bf_t *a, limb_t prec, void *opaque)
+{
+ bf_context_t *s = r->ctx;
+ BOOL is_acos = (BOOL)(intptr_t)opaque;
+ bf_t T_s, *T = &T_s;
+ limb_t prec1, prec2;
+ int res;
+
+ if (a->len == 0) {
+ if (a->expn == BF_EXP_NAN) {
+ bf_set_nan(r);
+ return 0;
+ } else if (a->expn == BF_EXP_INF) {
+ bf_set_nan(r);
+ return BF_ST_INVALID_OP;
+ } else {
+ if (is_acos) {
+ bf_const_pi(r, prec, BF_RNDF);
+ bf_mul_2exp(r, -1, BF_PREC_INF, BF_RNDZ);
+ return BF_ST_INEXACT;
+ } else {
+ bf_set_zero(r, a->sign);
+ return 0;
+ }
+ }
+ }
+ bf_init(s, T);
+ bf_set_ui(T, 1);
+ res = bf_cmpu(a, T);
+ if (res > 0) {
+ bf_delete(T);
+ bf_set_nan(r);
+ return BF_ST_INVALID_OP;
+ } else if (res == 0 && a->sign == 0 && is_acos) {
+ bf_set_zero(r, 0);
+ bf_delete(T);
+ return 0;
+ }
+
+ /* asin(x) = atan(x/sqrt(1-x^2))
+ acos(x) = pi/2 - asin(x) */
+ prec1 = prec + 8;
+ /* increase the precision in x^2 to compensate the cancellation in
+ (1-x^2) if x is close to 1 */
+ /* XXX: use less precision when possible */
+ if (a->expn >= 0)
+ prec2 = BF_PREC_INF;
+ else
+ prec2 = prec1;
+ bf_mul(T, a, a, prec2, BF_RNDN);
+ bf_neg(T);
+ bf_add_si(T, T, 1, prec2, BF_RNDN);
+
+ bf_sqrt(r, T, prec1, BF_RNDN);
+ bf_div(T, a, r, prec1, BF_RNDN);
+ if (is_acos)
+ bf_neg(T);
+ bf_atan_internal(r, T, prec1, (void *)(intptr_t)is_acos);
+ bf_delete(T);
+ return BF_ST_INEXACT;
+}
+
+int bf_asin(bf_t *r, const bf_t *a, limb_t prec, bf_flags_t flags)
+{
+ return bf_ziv_rounding(r, a, prec, flags, bf_asin_internal, (void *)FALSE);
+}
+
+int bf_acos(bf_t *r, const bf_t *a, limb_t prec, bf_flags_t flags)
+{
+ return bf_ziv_rounding(r, a, prec, flags, bf_asin_internal, (void *)TRUE);
+}
+
+#ifdef USE_FFT_MUL
+/***************************************************************/
+/* Integer multiplication with FFT */
+
+/* or LIMB_BITS at bit position 'pos' in tab */
+static inline void put_bits(limb_t *tab, limb_t len, slimb_t pos, limb_t val)
+{
+ limb_t i;
+ int p;
+
+ i = pos >> LIMB_LOG2_BITS;
+ p = pos & (LIMB_BITS - 1);
+ if (i < len)
+ tab[i] |= val << p;
+ if (p != 0) {
+ i++;
+ if (i < len) {
+ tab[i] |= val >> (LIMB_BITS - p);
+ }
+ }
+}
+
+#if defined(__AVX2__)
+
+typedef double NTTLimb;
+
+/* we must have: modulo >= 1 << NTT_MOD_LOG2_MIN */
+#define NTT_MOD_LOG2_MIN 50
+#define NTT_MOD_LOG2_MAX 51
+#define NB_MODS 5
+#define NTT_PROOT_2EXP 39
+static const int ntt_int_bits[NB_MODS] = { 254, 203, 152, 101, 50, };
+
+static const limb_t ntt_mods[NB_MODS] = { 0x00073a8000000001, 0x0007858000000001, 0x0007a38000000001, 0x0007a68000000001, 0x0007fd8000000001,
+};
+
+static const limb_t ntt_proot[2][NB_MODS] = {
+ { 0x00056198d44332c8, 0x0002eb5d640aad39, 0x00047e31eaa35fd0, 0x0005271ac118a150, 0x00075e0ce8442bd5, },
+ { 0x000461169761bcc5, 0x0002dac3cb2da688, 0x0004abc97751e3bf, 0x000656778fc8c485, 0x0000dc6469c269fa, },
+};
+
+static const limb_t ntt_mods_cr[NB_MODS * (NB_MODS - 1) / 2] = {
+ 0x00020e4da740da8e, 0x0004c3dc09c09c1d, 0x000063bd097b4271, 0x000799d8f18f18fd,
+ 0x0005384222222264, 0x000572b07c1f07fe, 0x00035cd08888889a,
+ 0x00066015555557e3, 0x000725960b60b623,
+ 0x0002fc1fa1d6ce12,
+};
+
+#else
+
+typedef limb_t NTTLimb;
+
+#if LIMB_BITS == 64
+
+#define NTT_MOD_LOG2_MIN 61
+#define NTT_MOD_LOG2_MAX 62
+#define NB_MODS 5
+#define NTT_PROOT_2EXP 51
+static const int ntt_int_bits[NB_MODS] = { 307, 246, 185, 123, 61, };
+
+static const limb_t ntt_mods[NB_MODS] = { 0x28d8000000000001, 0x2a88000000000001, 0x2ed8000000000001, 0x3508000000000001, 0x3aa8000000000001,
+};
+
+static const limb_t ntt_proot[2][NB_MODS] = {
+ { 0x1b8ea61034a2bea7, 0x21a9762de58206fb, 0x02ca782f0756a8ea, 0x278384537a3e50a1, 0x106e13fee74ce0ab, },
+ { 0x233513af133e13b8, 0x1d13140d1c6f75f1, 0x12cde57f97e3eeda, 0x0d6149e23cbe654f, 0x36cd204f522a1379, },
+};
+
+static const limb_t ntt_mods_cr[NB_MODS * (NB_MODS - 1) / 2] = {
+ 0x08a9ed097b425eea, 0x18a44aaaaaaaaab3, 0x2493f57f57f57f5d, 0x126b8d0649a7f8d4,
+ 0x09d80ed7303b5ccc, 0x25b8bcf3cf3cf3d5, 0x2ce6ce63398ce638,
+ 0x0e31fad40a57eb59, 0x02a3529fd4a7f52f,
+ 0x3a5493e93e93e94a,
+};
+
+#elif LIMB_BITS == 32
+
+/* we must have: modulo >= 1 << NTT_MOD_LOG2_MIN */
+#define NTT_MOD_LOG2_MIN 29
+#define NTT_MOD_LOG2_MAX 30
+#define NB_MODS 5
+#define NTT_PROOT_2EXP 20
+static const int ntt_int_bits[NB_MODS] = { 148, 119, 89, 59, 29, };
+
+static const limb_t ntt_mods[NB_MODS] = { 0x0000000032b00001, 0x0000000033700001, 0x0000000036d00001, 0x0000000037300001, 0x000000003e500001,
+};
+
+static const limb_t ntt_proot[2][NB_MODS] = {
+ { 0x0000000032525f31, 0x0000000005eb3b37, 0x00000000246eda9f, 0x0000000035f25901, 0x00000000022f5768, },
+ { 0x00000000051eba1a, 0x00000000107be10e, 0x000000001cd574e0, 0x00000000053806e6, 0x000000002cd6bf98, },
+};
+
+static const limb_t ntt_mods_cr[NB_MODS * (NB_MODS - 1) / 2] = {
+ 0x000000000449559a, 0x000000001eba6ca9, 0x000000002ec18e46, 0x000000000860160b,
+ 0x000000000d321307, 0x000000000bf51120, 0x000000000f662938,
+ 0x000000000932ab3e, 0x000000002f40eef8,
+ 0x000000002e760905,
+};
+
+#endif /* LIMB_BITS */
+
+#endif /* !AVX2 */
+
+#if defined(__AVX2__)
+#define NTT_TRIG_K_MAX 18
+#else
+#define NTT_TRIG_K_MAX 19
+#endif
+
+typedef struct BFNTTState {
+ bf_context_t *ctx;
+
+ /* used for mul_mod_fast() */
+ limb_t ntt_mods_div[NB_MODS];
+
+ limb_t ntt_proot_pow[NB_MODS][2][NTT_PROOT_2EXP + 1];
+ limb_t ntt_proot_pow_inv[NB_MODS][2][NTT_PROOT_2EXP + 1];
+ NTTLimb *ntt_trig[NB_MODS][2][NTT_TRIG_K_MAX + 1];
+ /* 1/2^n mod m */
+ limb_t ntt_len_inv[NB_MODS][NTT_PROOT_2EXP + 1][2];
+#if defined(__AVX2__)
+ __m256d ntt_mods_cr_vec[NB_MODS * (NB_MODS - 1) / 2];
+ __m256d ntt_mods_vec[NB_MODS];
+ __m256d ntt_mods_inv_vec[NB_MODS];
+#else
+ limb_t ntt_mods_cr_inv[NB_MODS * (NB_MODS - 1) / 2];
+#endif
+} BFNTTState;
+
+static NTTLimb *get_trig(BFNTTState *s, int k, int inverse, int m_idx);
+
+/* add modulo with up to (LIMB_BITS-1) bit modulo */
+static inline limb_t add_mod(limb_t a, limb_t b, limb_t m)
+{
+ limb_t r;
+ r = a + b;
+ if (r >= m)
+ r -= m;
+ return r;
+}
+
+/* sub modulo with up to LIMB_BITS bit modulo */
+static inline limb_t sub_mod(limb_t a, limb_t b, limb_t m)
+{
+ limb_t r;
+ r = a - b;
+ if (r > a)
+ r += m;
+ return r;
+}
+
+/* return (r0+r1*B) mod m
+ precondition: 0 <= r0+r1*B < 2^(64+NTT_MOD_LOG2_MIN)
+*/
+static inline limb_t mod_fast(dlimb_t r,
+ limb_t m, limb_t m_inv)
+{
+ limb_t a1, q, t0, r1, r0;
+
+ a1 = r >> NTT_MOD_LOG2_MIN;
+
+ q = ((dlimb_t)a1 * m_inv) >> LIMB_BITS;
+ r = r - (dlimb_t)q * m - m * 2;
+ r1 = r >> LIMB_BITS;
+ t0 = (slimb_t)r1 >> 1;
+ r += m & t0;
+ r0 = r;
+ r1 = r >> LIMB_BITS;
+ r0 += m & r1;
+ return r0;
+}
+
+/* faster version using precomputed modulo inverse.
+ precondition: 0 <= a * b < 2^(64+NTT_MOD_LOG2_MIN) */
+static inline limb_t mul_mod_fast(limb_t a, limb_t b,
+ limb_t m, limb_t m_inv)
+{
+ dlimb_t r;
+ r = (dlimb_t)a * (dlimb_t)b;
+ return mod_fast(r, m, m_inv);
+}
+
+static inline limb_t init_mul_mod_fast(limb_t m)
+{
+ dlimb_t t;
+ assert(m < (limb_t)1 << NTT_MOD_LOG2_MAX);
+ assert(m >= (limb_t)1 << NTT_MOD_LOG2_MIN);
+ t = (dlimb_t)1 << (LIMB_BITS + NTT_MOD_LOG2_MIN);
+ return t / m;
+}
+
+/* Faster version used when the multiplier is constant. 0 <= a < 2^64,
+ 0 <= b < m. */
+static inline limb_t mul_mod_fast2(limb_t a, limb_t b,
+ limb_t m, limb_t b_inv)
+{
+ limb_t r, q;
+
+ q = ((dlimb_t)a * (dlimb_t)b_inv) >> LIMB_BITS;
+ r = a * b - q * m;
+ if (r >= m)
+ r -= m;
+ return r;
+}
+
+/* Faster version used when the multiplier is constant. 0 <= a < 2^64,
+ 0 <= b < m. Let r = a * b mod m. The return value is 'r' or 'r +
+ m'. */
+static inline limb_t mul_mod_fast3(limb_t a, limb_t b,
+ limb_t m, limb_t b_inv)
+{
+ limb_t r, q;
+
+ q = ((dlimb_t)a * (dlimb_t)b_inv) >> LIMB_BITS;
+ r = a * b - q * m;
+ return r;
+}
+
+static inline limb_t init_mul_mod_fast2(limb_t b, limb_t m)
+{
+ return ((dlimb_t)b << LIMB_BITS) / m;
+}
+
+#ifdef __AVX2__
+
+static inline limb_t ntt_limb_to_int(NTTLimb a, limb_t m)
+{
+ slimb_t v;
+ v = a;
+ if (v < 0)
+ v += m;
+ if (v >= m)
+ v -= m;
+ return v;
+}
+
+static inline NTTLimb int_to_ntt_limb(limb_t a, limb_t m)
+{
+ return (slimb_t)a;
+}
+
+static inline NTTLimb int_to_ntt_limb2(limb_t a, limb_t m)
+{
+ if (a >= (m / 2))
+ a -= m;
+ return (slimb_t)a;
+}
+
+/* return r + m if r < 0 otherwise r. */
+static inline __m256d ntt_mod1(__m256d r, __m256d m)
+{
+ return _mm256_blendv_pd(r, r + m, r);
+}
+
+/* input: abs(r) < 2 * m. Output: abs(r) < m */
+static inline __m256d ntt_mod(__m256d r, __m256d mf, __m256d m2f)
+{
+ return _mm256_blendv_pd(r, r + m2f, r) - mf;
+}
+
+/* input: abs(a*b) < 2 * m^2, output: abs(r) < m */
+static inline __m256d ntt_mul_mod(__m256d a, __m256d b, __m256d mf,
+ __m256d m_inv)
+{
+ __m256d r, q, ab1, ab0, qm0, qm1;
+ ab1 = a * b;
+ q = _mm256_round_pd(ab1 * m_inv, 0); /* round to nearest */
+ qm1 = q * mf;
+ qm0 = _mm256_fmsub_pd(q, mf, qm1); /* low part */
+ ab0 = _mm256_fmsub_pd(a, b, ab1); /* low part */
+ r = (ab1 - qm1) + (ab0 - qm0);
+ return r;
+}
+
+static void *bf_aligned_malloc(bf_context_t *s, size_t size, size_t align)
+{
+ void *ptr;
+ void **ptr1;
+ ptr = bf_malloc(s, size + sizeof(void *) + align - 1);
+ if (!ptr)
+ return NULL;
+ ptr1 = (void **)(((uintptr_t)ptr + sizeof(void *) + align - 1) &
+ ~(align - 1));
+ ptr1[-1] = ptr;
+ return ptr1;
+}
+
+static void bf_aligned_free(bf_context_t *s, void *ptr)
+{
+ if (!ptr)
+ return;
+ bf_free(s, ((void **)ptr)[-1]);
+}
+
+static void *ntt_malloc(BFNTTState *s, size_t size)
+{
+ return bf_aligned_malloc(s->ctx, size, 64);
+}
+
+static void ntt_free(BFNTTState *s, void *ptr)
+{
+ bf_aligned_free(s->ctx, ptr);
+}
+
+static no_inline void ntt_fft(BFNTTState *s,
+ NTTLimb *out_buf, NTTLimb *in_buf,
+ NTTLimb *tmp_buf, int fft_len_log2,
+ int inverse, int m_idx)
+{
+ limb_t nb_blocks, fft_per_block, p, k, n, stride_in, i, j;
+ NTTLimb *tab_in, *tab_out, *tmp, *trig;
+ __m256d m_inv, mf, m2f, c, a0, a1, b0, b1;
+ limb_t m;
+ int l;
+
+ m = ntt_mods[m_idx];
+
+ m_inv = _mm256_set1_pd(1.0 / (double)m);
+ mf = _mm256_set1_pd(m);
+ m2f = _mm256_set1_pd(m * 2);
+
+ n = (limb_t)1 << fft_len_log2;
+ assert(n >= 8);
+ stride_in = n / 2;
+
+ tab_in = in_buf;
+ tab_out = tmp_buf;
+ trig = get_trig(s, fft_len_log2, inverse, m_idx);
+ p = 0;
+ for(k = 0; k < stride_in; k += 4) {
+ a0 = _mm256_load_pd(&tab_in[k]);
+ a1 = _mm256_load_pd(&tab_in[k + stride_in]);
+ c = _mm256_load_pd(trig);
+ trig += 4;
+ b0 = ntt_mod(a0 + a1, mf, m2f);
+ b1 = ntt_mul_mod(a0 - a1, c, mf, m_inv);
+ a0 = _mm256_permute2f128_pd(b0, b1, 0x20);
+ a1 = _mm256_permute2f128_pd(b0, b1, 0x31);
+ a0 = _mm256_permute4x64_pd(a0, 0xd8);
+ a1 = _mm256_permute4x64_pd(a1, 0xd8);
+ _mm256_store_pd(&tab_out[p], a0);
+ _mm256_store_pd(&tab_out[p + 4], a1);
+ p += 2 * 4;
+ }
+ tmp = tab_in;
+ tab_in = tab_out;
+ tab_out = tmp;
+
+ trig = get_trig(s, fft_len_log2 - 1, inverse, m_idx);
+ p = 0;
+ for(k = 0; k < stride_in; k += 4) {
+ a0 = _mm256_load_pd(&tab_in[k]);
+ a1 = _mm256_load_pd(&tab_in[k + stride_in]);
+ c = _mm256_setr_pd(trig[0], trig[0], trig[1], trig[1]);
+ trig += 2;
+ b0 = ntt_mod(a0 + a1, mf, m2f);
+ b1 = ntt_mul_mod(a0 - a1, c, mf, m_inv);
+ a0 = _mm256_permute2f128_pd(b0, b1, 0x20);
+ a1 = _mm256_permute2f128_pd(b0, b1, 0x31);
+ _mm256_store_pd(&tab_out[p], a0);
+ _mm256_store_pd(&tab_out[p + 4], a1);
+ p += 2 * 4;
+ }
+ tmp = tab_in;
+ tab_in = tab_out;
+ tab_out = tmp;
+
+ nb_blocks = n / 4;
+ fft_per_block = 4;
+
+ l = fft_len_log2 - 2;
+ while (nb_blocks != 2) {
+ nb_blocks >>= 1;
+ p = 0;
+ k = 0;
+ trig = get_trig(s, l, inverse, m_idx);
+ for(i = 0; i < nb_blocks; i++) {
+ c = _mm256_set1_pd(trig[0]);
+ trig++;
+ for(j = 0; j < fft_per_block; j += 4) {
+ a0 = _mm256_load_pd(&tab_in[k + j]);
+ a1 = _mm256_load_pd(&tab_in[k + j + stride_in]);
+ b0 = ntt_mod(a0 + a1, mf, m2f);
+ b1 = ntt_mul_mod(a0 - a1, c, mf, m_inv);
+ _mm256_store_pd(&tab_out[p + j], b0);
+ _mm256_store_pd(&tab_out[p + j + fft_per_block], b1);
+ }
+ k += fft_per_block;
+ p += 2 * fft_per_block;
+ }
+ fft_per_block <<= 1;
+ l--;
+ tmp = tab_in;
+ tab_in = tab_out;
+ tab_out = tmp;
+ }
+
+ tab_out = out_buf;
+ for(k = 0; k < stride_in; k += 4) {
+ a0 = _mm256_load_pd(&tab_in[k]);
+ a1 = _mm256_load_pd(&tab_in[k + stride_in]);
+ b0 = ntt_mod(a0 + a1, mf, m2f);
+ b1 = ntt_mod(a0 - a1, mf, m2f);
+ _mm256_store_pd(&tab_out[k], b0);
+ _mm256_store_pd(&tab_out[k + stride_in], b1);
+ }
+}
+
+static void ntt_vec_mul(BFNTTState *s,
+ NTTLimb *tab1, NTTLimb *tab2, limb_t fft_len_log2,
+ int k_tot, int m_idx)
+{
+ limb_t i, c_inv, n, m;
+ __m256d m_inv, mf, a, b, c;
+
+ m = ntt_mods[m_idx];
+ c_inv = s->ntt_len_inv[m_idx][k_tot][0];
+ m_inv = _mm256_set1_pd(1.0 / (double)m);
+ mf = _mm256_set1_pd(m);
+ c = _mm256_set1_pd(int_to_ntt_limb(c_inv, m));
+ n = (limb_t)1 << fft_len_log2;
+ for(i = 0; i < n; i += 4) {
+ a = _mm256_load_pd(&tab1[i]);
+ b = _mm256_load_pd(&tab2[i]);
+ a = ntt_mul_mod(a, b, mf, m_inv);
+ a = ntt_mul_mod(a, c, mf, m_inv);
+ _mm256_store_pd(&tab1[i], a);
+ }
+}
+
+static no_inline void mul_trig(NTTLimb *buf,
+ limb_t n, limb_t c1, limb_t m, limb_t m_inv1)
+{
+ limb_t i, c2, c3, c4;
+ __m256d c, c_mul, a0, mf, m_inv;
+ assert(n >= 2);
+
+ mf = _mm256_set1_pd(m);
+ m_inv = _mm256_set1_pd(1.0 / (double)m);
+
+ c2 = mul_mod_fast(c1, c1, m, m_inv1);
+ c3 = mul_mod_fast(c2, c1, m, m_inv1);
+ c4 = mul_mod_fast(c2, c2, m, m_inv1);
+ c = _mm256_setr_pd(1, int_to_ntt_limb(c1, m),
+ int_to_ntt_limb(c2, m), int_to_ntt_limb(c3, m));
+ c_mul = _mm256_set1_pd(int_to_ntt_limb(c4, m));
+ for(i = 0; i < n; i += 4) {
+ a0 = _mm256_load_pd(&buf[i]);
+ a0 = ntt_mul_mod(a0, c, mf, m_inv);
+ _mm256_store_pd(&buf[i], a0);
+ c = ntt_mul_mod(c, c_mul, mf, m_inv);
+ }
+}
+
+#else
+
+static void *ntt_malloc(BFNTTState *s, size_t size)
+{
+ return bf_malloc(s->ctx, size);
+}
+
+static void ntt_free(BFNTTState *s, void *ptr)
+{
+ bf_free(s->ctx, ptr);
+}
+
+static inline limb_t ntt_limb_to_int(NTTLimb a, limb_t m)
+{
+ if (a >= m)
+ a -= m;
+ return a;
+}
+
+static inline NTTLimb int_to_ntt_limb(slimb_t a, limb_t m)
+{
+ return a;
+}
+
+static no_inline void ntt_fft(BFNTTState *s, NTTLimb *out_buf, NTTLimb *in_buf,
+ NTTLimb *tmp_buf, int fft_len_log2,
+ int inverse, int m_idx)
+{
+ limb_t nb_blocks, fft_per_block, p, k, n, stride_in, i, j, m, m2;
+ NTTLimb *tab_in, *tab_out, *tmp, a0, a1, b0, b1, c, *trig, c_inv;
+ int l;
+
+ m = ntt_mods[m_idx];
+ m2 = 2 * m;
+ n = (limb_t)1 << fft_len_log2;
+ nb_blocks = n;
+ fft_per_block = 1;
+ stride_in = n / 2;
+ tab_in = in_buf;
+ tab_out = tmp_buf;
+ l = fft_len_log2;
+ while (nb_blocks != 2) {
+ nb_blocks >>= 1;
+ p = 0;
+ k = 0;
+ trig = get_trig(s, l, inverse, m_idx);
+ for(i = 0; i < nb_blocks; i++) {
+ c = trig[0];
+ c_inv = trig[1];
+ trig += 2;
+ for(j = 0; j < fft_per_block; j++) {
+ a0 = tab_in[k + j];
+ a1 = tab_in[k + j + stride_in];
+ b0 = add_mod(a0, a1, m2);
+ b1 = a0 - a1 + m2;
+ b1 = mul_mod_fast3(b1, c, m, c_inv);
+ tab_out[p + j] = b0;
+ tab_out[p + j + fft_per_block] = b1;
+ }
+ k += fft_per_block;
+ p += 2 * fft_per_block;
+ }
+ fft_per_block <<= 1;
+ l--;
+ tmp = tab_in;
+ tab_in = tab_out;
+ tab_out = tmp;
+ }
+ /* no twiddle in last step */
+ tab_out = out_buf;
+ for(k = 0; k < stride_in; k++) {
+ a0 = tab_in[k];
+ a1 = tab_in[k + stride_in];
+ b0 = add_mod(a0, a1, m2);
+ b1 = sub_mod(a0, a1, m2);
+ tab_out[k] = b0;
+ tab_out[k + stride_in] = b1;
+ }
+}
+
+static void ntt_vec_mul(BFNTTState *s,
+ NTTLimb *tab1, NTTLimb *tab2, int fft_len_log2,
+ int k_tot, int m_idx)
+{
+ limb_t i, norm, norm_inv, a, n, m, m_inv;
+
+ m = ntt_mods[m_idx];
+ m_inv = s->ntt_mods_div[m_idx];
+ norm = s->ntt_len_inv[m_idx][k_tot][0];
+ norm_inv = s->ntt_len_inv[m_idx][k_tot][1];
+ n = (limb_t)1 << fft_len_log2;
+ for(i = 0; i < n; i++) {
+ a = tab1[i];
+ /* need to reduce the range so that the product is <
+ 2^(LIMB_BITS+NTT_MOD_LOG2_MIN) */
+ if (a >= m)
+ a -= m;
+ a = mul_mod_fast(a, tab2[i], m, m_inv);
+ a = mul_mod_fast3(a, norm, m, norm_inv);
+ tab1[i] = a;
+ }
+}
+
+static no_inline void mul_trig(NTTLimb *buf,
+ limb_t n, limb_t c_mul, limb_t m, limb_t m_inv)
+{
+ limb_t i, c0, c_mul_inv;
+
+ c0 = 1;
+ c_mul_inv = init_mul_mod_fast2(c_mul, m);
+ for(i = 0; i < n; i++) {
+ buf[i] = mul_mod_fast(buf[i], c0, m, m_inv);
+ c0 = mul_mod_fast2(c0, c_mul, m, c_mul_inv);
+ }
+}
+
+#endif /* !AVX2 */
+
+static no_inline NTTLimb *get_trig(BFNTTState *s,
+ int k, int inverse1, int m_idx1)
+{
+ NTTLimb *tab;
+ limb_t i, n2, c, c_mul, m, c_mul_inv;
+ int m_idx, inverse;
+
+ if (k > NTT_TRIG_K_MAX)
+ return NULL;
+
+ for(;;) {
+ tab = s->ntt_trig[m_idx1][inverse1][k];
+ if (tab)
+ return tab;
+ n2 = (limb_t)1 << (k - 1);
+ for(m_idx = 0; m_idx < NB_MODS; m_idx++) {
+ m = ntt_mods[m_idx];
+ for(inverse = 0; inverse < 2; inverse++) {
+#ifdef __AVX2__
+ tab = ntt_malloc(s, sizeof(NTTLimb) * n2);
+#else
+ tab = ntt_malloc(s, sizeof(NTTLimb) * n2 * 2);
+#endif
+ c = 1;
+ c_mul = s->ntt_proot_pow[m_idx][inverse][k];
+ c_mul_inv = s->ntt_proot_pow_inv[m_idx][inverse][k];
+ for(i = 0; i < n2; i++) {
+#ifdef __AVX2__
+ tab[i] = int_to_ntt_limb2(c, m);
+#else
+ tab[2 * i] = int_to_ntt_limb(c, m);
+ tab[2 * i + 1] = init_mul_mod_fast2(c, m);
+#endif
+ c = mul_mod_fast2(c, c_mul, m, c_mul_inv);
+ }
+ s->ntt_trig[m_idx][inverse][k] = tab;
+ }
+ }
+ }
+}
+
+void fft_clear_cache(bf_context_t *s1)
+{
+ int m_idx, inverse, k;
+ BFNTTState *s = s1->ntt_state;
+ if (s) {
+ for(m_idx = 0; m_idx < NB_MODS; m_idx++) {
+ for(inverse = 0; inverse < 2; inverse++) {
+ for(k = 0; k < NTT_TRIG_K_MAX + 1; k++) {
+ if (s->ntt_trig[m_idx][inverse][k]) {
+ ntt_free(s, s->ntt_trig[m_idx][inverse][k]);
+ s->ntt_trig[m_idx][inverse][k] = NULL;
+ }
+ }
+ }
+ }
+#if defined(__AVX2__)
+ bf_aligned_free(s1, s);
+#else
+ bf_free(s1, s);
+#endif
+ s1->ntt_state = NULL;
+ }
+}
+
+#define STRIP_LEN 16
+
+/* dst = buf1, src = buf2 */
+static void ntt_fft_partial(BFNTTState *s, NTTLimb *buf1,
+ int k1, int k2, limb_t n1, limb_t n2, int inverse,
+ limb_t m_idx)
+{
+ limb_t i, j, c_mul, c0, m, m_inv, strip_len, l;
+ NTTLimb *buf2, *buf3;
+
+ buf3 = ntt_malloc(s, sizeof(NTTLimb) * n1);
+ if (k2 == 0) {
+ ntt_fft(s, buf1, buf1, buf3, k1, inverse, m_idx);
+ } else {
+ strip_len = STRIP_LEN;
+ buf2 = ntt_malloc(s, sizeof(NTTLimb) * n1 * strip_len);
+
+ m = ntt_mods[m_idx];
+ m_inv = s->ntt_mods_div[m_idx];
+ c0 = s->ntt_proot_pow[m_idx][inverse][k1 + k2];
+ c_mul = 1;
+ assert((n2 % strip_len) == 0);
+ for(j = 0; j < n2; j += strip_len) {
+ for(i = 0; i < n1; i++) {
+ for(l = 0; l < strip_len; l++) {
+ buf2[i + l * n1] = buf1[i * n2 + (j + l)];
+ }
+ }
+ for(l = 0; l < strip_len; l++) {
+ if (inverse)
+ mul_trig(buf2 + l * n1, n1, c_mul, m, m_inv);
+ ntt_fft(s, buf2 + l * n1, buf2 + l * n1, buf3, k1, inverse, m_idx);
+ if (!inverse)
+ mul_trig(buf2 + l * n1, n1, c_mul, m, m_inv);
+ c_mul = mul_mod_fast(c_mul, c0, m, m_inv);
+ }
+
+ for(i = 0; i < n1; i++) {
+ for(l = 0; l < strip_len; l++) {
+ buf1[i * n2 + (j + l)] = buf2[i + l *n1];
+ }
+ }
+ }
+ ntt_free(s, buf2);
+ }
+ ntt_free(s, buf3);
+}
+
+
+/* dst = buf1, src = buf2, tmp = buf3 */
+static void ntt_conv(BFNTTState *s, NTTLimb *buf1, NTTLimb *buf2,
+ int k, int k_tot, limb_t m_idx)
+{
+ limb_t n1, n2, i;
+ int k1, k2;
+
+ if (k <= NTT_TRIG_K_MAX) {
+ k1 = k;
+ } else {
+ /* recursive split of the FFT */
+ k1 = bf_min(k / 2, NTT_TRIG_K_MAX);
+ }
+ k2 = k - k1;
+ n1 = (limb_t)1 << k1;
+ n2 = (limb_t)1 << k2;
+
+ ntt_fft_partial(s, buf1, k1, k2, n1, n2, 0, m_idx);
+ ntt_fft_partial(s, buf2, k1, k2, n1, n2, 0, m_idx);
+ if (k2 == 0) {
+ ntt_vec_mul(s, buf1, buf2, k, k_tot, m_idx);
+ } else {
+ for(i = 0; i < n1; i++) {
+ ntt_conv(s, buf1 + i * n2, buf2 + i * n2, k2, k_tot, m_idx);
+ }
+ }
+ ntt_fft_partial(s, buf1, k1, k2, n1, n2, 1, m_idx);
+}
+
+
+static no_inline void limb_to_ntt(BFNTTState *s,
+ NTTLimb *tabr, limb_t fft_len,
+ const limb_t *taba, limb_t a_len, int dpl,
+ int first_m_idx, int nb_mods)
+{
+ slimb_t i, n;
+ dlimb_t a, b;
+ int j, shift;
+ limb_t base_mask1, a0, a1, a2, r, m, m_inv;
+
+#if 0
+ for(i = 0; i < a_len; i++) {
+ printf("%" PRId64 ": " FMT_LIMB "\n",
+ (int64_t)i, taba[i]);
+ }
+#endif
+ memset(tabr, 0, sizeof(NTTLimb) * fft_len * nb_mods);
+ shift = dpl & (LIMB_BITS - 1);
+ if (shift == 0)
+ base_mask1 = -1;
+ else
+ base_mask1 = ((limb_t)1 << shift) - 1;
+ n = bf_min(fft_len, (a_len * LIMB_BITS + dpl - 1) / dpl);
+ for(i = 0; i < n; i++) {
+ a0 = get_bits(taba, a_len, i * dpl);
+ if (dpl <= LIMB_BITS) {
+ a0 &= base_mask1;
+ a = a0;
+ } else {
+ a1 = get_bits(taba, a_len, i * dpl + LIMB_BITS);
+ if (dpl <= (LIMB_BITS + NTT_MOD_LOG2_MIN)) {
+ a = a0 | ((dlimb_t)(a1 & base_mask1) << LIMB_BITS);
+ } else {
+ if (dpl > 2 * LIMB_BITS) {
+ a2 = get_bits(taba, a_len, i * dpl + LIMB_BITS * 2) &
+ base_mask1;
+ } else {
+ a1 &= base_mask1;
+ a2 = 0;
+ }
+ // printf("a=0x%016lx%016lx%016lx\n", a2, a1, a0);
+ a = (a0 >> (LIMB_BITS - NTT_MOD_LOG2_MAX + NTT_MOD_LOG2_MIN)) |
+ ((dlimb_t)a1 << (NTT_MOD_LOG2_MAX - NTT_MOD_LOG2_MIN)) |
+ ((dlimb_t)a2 << (LIMB_BITS + NTT_MOD_LOG2_MAX - NTT_MOD_LOG2_MIN));
+ a0 &= ((limb_t)1 << (LIMB_BITS - NTT_MOD_LOG2_MAX + NTT_MOD_LOG2_MIN)) - 1;
+ }
+ }
+ for(j = 0; j < nb_mods; j++) {
+ m = ntt_mods[first_m_idx + j];
+ m_inv = s->ntt_mods_div[first_m_idx + j];
+ r = mod_fast(a, m, m_inv);
+ if (dpl > (LIMB_BITS + NTT_MOD_LOG2_MIN)) {
+ b = ((dlimb_t)r << (LIMB_BITS - NTT_MOD_LOG2_MAX + NTT_MOD_LOG2_MIN)) | a0;
+ r = mod_fast(b, m, m_inv);
+ }
+ tabr[i + j * fft_len] = int_to_ntt_limb(r, m);
+ }
+ }
+}
+
+#if defined(__AVX2__)
+
+#define VEC_LEN 4
+
+typedef union {
+ __m256d v;
+ double d[4];
+} VecUnion;
+
+static no_inline void ntt_to_limb(BFNTTState *s, limb_t *tabr, limb_t r_len,
+ const NTTLimb *buf, int fft_len_log2, int dpl,
+ int nb_mods)
+{
+ const limb_t *mods = ntt_mods + NB_MODS - nb_mods;
+ const __m256d *mods_cr_vec, *mf, *m_inv;
+ VecUnion y[NB_MODS];
+ limb_t u[NB_MODS], carry[NB_MODS], fft_len, base_mask1, r;
+ slimb_t i, len, pos;
+ int j, k, l, shift, n_limb1, p;
+ dlimb_t t;
+
+ j = NB_MODS * (NB_MODS - 1) / 2 - nb_mods * (nb_mods - 1) / 2;
+ mods_cr_vec = s->ntt_mods_cr_vec + j;
+ mf = s->ntt_mods_vec + NB_MODS - nb_mods;
+ m_inv = s->ntt_mods_inv_vec + NB_MODS - nb_mods;
+
+ shift = dpl & (LIMB_BITS - 1);
+ if (shift == 0)
+ base_mask1 = -1;
+ else
+ base_mask1 = ((limb_t)1 << shift) - 1;
+ n_limb1 = ((unsigned)dpl - 1) / LIMB_BITS;
+ for(j = 0; j < NB_MODS; j++)
+ carry[j] = 0;
+ for(j = 0; j < NB_MODS; j++)
+ u[j] = 0; /* avoid warnings */
+ memset(tabr, 0, sizeof(limb_t) * r_len);
+ fft_len = (limb_t)1 << fft_len_log2;
+ len = bf_min(fft_len, (r_len * LIMB_BITS + dpl - 1) / dpl);
+ len = (len + VEC_LEN - 1) & ~(VEC_LEN - 1);
+ i = 0;
+ while (i < len) {
+ for(j = 0; j < nb_mods; j++)
+ y[j].v = *(__m256d *)&buf[i + fft_len * j];
+
+ /* Chinese remainder to get mixed radix representation */
+ l = 0;
+ for(j = 0; j < nb_mods - 1; j++) {
+ y[j].v = ntt_mod1(y[j].v, mf[j]);
+ for(k = j + 1; k < nb_mods; k++) {
+ y[k].v = ntt_mul_mod(y[k].v - y[j].v,
+ mods_cr_vec[l], mf[k], m_inv[k]);
+ l++;
+ }
+ }
+ y[j].v = ntt_mod1(y[j].v, mf[j]);
+
+ for(p = 0; p < VEC_LEN; p++) {
+ /* back to normal representation */
+ u[0] = (int64_t)y[nb_mods - 1].d[p];
+ l = 1;
+ for(j = nb_mods - 2; j >= 1; j--) {
+ r = (int64_t)y[j].d[p];
+ for(k = 0; k < l; k++) {
+ t = (dlimb_t)u[k] * mods[j] + r;
+ r = t >> LIMB_BITS;
+ u[k] = t;
+ }
+ u[l] = r;
+ l++;
+ }
+ /* XXX: for nb_mods = 5, l should be 4 */
+
+ /* last step adds the carry */
+ r = (int64_t)y[0].d[p];
+ for(k = 0; k < l; k++) {
+ t = (dlimb_t)u[k] * mods[j] + r + carry[k];
+ r = t >> LIMB_BITS;
+ u[k] = t;
+ }
+ u[l] = r + carry[l];
+
+#if 0
+ printf("%" PRId64 ": ", i);
+ for(j = nb_mods - 1; j >= 0; j--) {
+ printf(" %019" PRIu64, u[j]);
+ }
+ printf("\n");
+#endif
+
+ /* write the digits */
+ pos = i * dpl;
+ for(j = 0; j < n_limb1; j++) {
+ put_bits(tabr, r_len, pos, u[j]);
+ pos += LIMB_BITS;
+ }
+ put_bits(tabr, r_len, pos, u[n_limb1] & base_mask1);
+ /* shift by dpl digits and set the carry */
+ if (shift == 0) {
+ for(j = n_limb1 + 1; j < nb_mods; j++)
+ carry[j - (n_limb1 + 1)] = u[j];
+ } else {
+ for(j = n_limb1; j < nb_mods - 1; j++) {
+ carry[j - n_limb1] = (u[j] >> shift) |
+ (u[j + 1] << (LIMB_BITS - shift));
+ }
+ carry[nb_mods - 1 - n_limb1] = u[nb_mods - 1] >> shift;
+ }
+ i++;
+ }
+ }
+}
+#else
+static no_inline void ntt_to_limb(BFNTTState *s, limb_t *tabr, limb_t r_len,
+ const NTTLimb *buf, int fft_len_log2, int dpl,
+ int nb_mods)
+{
+ const limb_t *mods = ntt_mods + NB_MODS - nb_mods;
+ const limb_t *mods_cr, *mods_cr_inv;
+ limb_t y[NB_MODS], u[NB_MODS], carry[NB_MODS], fft_len, base_mask1, r;
+ slimb_t i, len, pos;
+ int j, k, l, shift, n_limb1;
+ dlimb_t t;
+
+ j = NB_MODS * (NB_MODS - 1) / 2 - nb_mods * (nb_mods - 1) / 2;
+ mods_cr = ntt_mods_cr + j;
+ mods_cr_inv = s->ntt_mods_cr_inv + j;
+
+ shift = dpl & (LIMB_BITS - 1);
+ if (shift == 0)
+ base_mask1 = -1;
+ else
+ base_mask1 = ((limb_t)1 << shift) - 1;
+ n_limb1 = ((unsigned)dpl - 1) / LIMB_BITS;
+ for(j = 0; j < NB_MODS; j++)
+ carry[j] = 0;
+ for(j = 0; j < NB_MODS; j++)
+ u[j] = 0; /* avoid warnings */
+ memset(tabr, 0, sizeof(limb_t) * r_len);
+ fft_len = (limb_t)1 << fft_len_log2;
+ len = bf_min(fft_len, (r_len * LIMB_BITS + dpl - 1) / dpl);
+ for(i = 0; i < len; i++) {
+ for(j = 0; j < nb_mods; j++) {
+ y[j] = ntt_limb_to_int(buf[i + fft_len * j], mods[j]);
+ }
+
+ /* Chinese remainder to get mixed radix representation */
+ l = 0;
+ for(j = 0; j < nb_mods - 1; j++) {
+ for(k = j + 1; k < nb_mods; k++) {
+ limb_t m;
+ m = mods[k];
+ /* Note: there is no overflow in the sub_mod() because
+ the modulos are sorted by increasing order */
+ y[k] = mul_mod_fast2(y[k] - y[j] + m,
+ mods_cr[l], m, mods_cr_inv[l]);
+ l++;
+ }
+ }
+
+ /* back to normal representation */
+ u[0] = y[nb_mods - 1];
+ l = 1;
+ for(j = nb_mods - 2; j >= 1; j--) {
+ r = y[j];
+ for(k = 0; k < l; k++) {
+ t = (dlimb_t)u[k] * mods[j] + r;
+ r = t >> LIMB_BITS;
+ u[k] = t;
+ }
+ u[l] = r;
+ l++;
+ }
+
+ /* last step adds the carry */
+ r = y[0];
+ for(k = 0; k < l; k++) {
+ t = (dlimb_t)u[k] * mods[j] + r + carry[k];
+ r = t >> LIMB_BITS;
+ u[k] = t;
+ }
+ u[l] = r + carry[l];
+
+#if 0
+ printf("%" PRId64 ": ", (int64_t)i);
+ for(j = nb_mods - 1; j >= 0; j--) {
+ printf(" " FMT_LIMB, u[j]);
+ }
+ printf("\n");
+#endif
+
+ /* write the digits */
+ pos = i * dpl;
+ for(j = 0; j < n_limb1; j++) {
+ put_bits(tabr, r_len, pos, u[j]);
+ pos += LIMB_BITS;
+ }
+ put_bits(tabr, r_len, pos, u[n_limb1] & base_mask1);
+ /* shift by dpl digits and set the carry */
+ if (shift == 0) {
+ for(j = n_limb1 + 1; j < nb_mods; j++)
+ carry[j - (n_limb1 + 1)] = u[j];
+ } else {
+ for(j = n_limb1; j < nb_mods - 1; j++) {
+ carry[j - n_limb1] = (u[j] >> shift) |
+ (u[j + 1] << (LIMB_BITS - shift));
+ }
+ carry[nb_mods - 1 - n_limb1] = u[nb_mods - 1] >> shift;
+ }
+ }
+}
+#endif
+
+static int ntt_static_init(bf_context_t *s1)
+{
+ BFNTTState *s;
+ int inverse, i, j, k, l;
+ limb_t c, c_inv, c_inv2, m, m_inv;
+
+ if (s1->ntt_state)
+ return 0;
+#if defined(__AVX2__)
+ s = bf_aligned_malloc(s1, sizeof(*s), 64);
+#else
+ s = bf_malloc(s1, sizeof(*s));
+#endif
+ if (!s)
+ return -1;
+ memset(s, 0, sizeof(*s));
+ s1->ntt_state = s;
+ s->ctx = s1;
+
+ for(j = 0; j < NB_MODS; j++) {
+ m = ntt_mods[j];
+ m_inv = init_mul_mod_fast(m);
+ s->ntt_mods_div[j] = m_inv;
+#if defined(__AVX2__)
+ s->ntt_mods_vec[j] = _mm256_set1_pd(m);
+ s->ntt_mods_inv_vec[j] = _mm256_set1_pd(1.0 / (double)m);
+#endif
+ c_inv2 = (m + 1) / 2; /* 1/2 */
+ c_inv = 1;
+ for(i = 0; i <= NTT_PROOT_2EXP; i++) {
+ s->ntt_len_inv[j][i][0] = c_inv;
+ s->ntt_len_inv[j][i][1] = init_mul_mod_fast2(c_inv, m);
+ c_inv = mul_mod_fast(c_inv, c_inv2, m, m_inv);
+ }
+
+ for(inverse = 0; inverse < 2; inverse++) {
+ c = ntt_proot[inverse][j];
+ for(i = 0; i < NTT_PROOT_2EXP; i++) {
+ s->ntt_proot_pow[j][inverse][NTT_PROOT_2EXP - i] = c;
+ s->ntt_proot_pow_inv[j][inverse][NTT_PROOT_2EXP - i] =
+ init_mul_mod_fast2(c, m);
+ c = mul_mod_fast(c, c, m, m_inv);
+ }
+ }
+ }
+
+ l = 0;
+ for(j = 0; j < NB_MODS - 1; j++) {
+ for(k = j + 1; k < NB_MODS; k++) {
+#if defined(__AVX2__)
+ s->ntt_mods_cr_vec[l] = _mm256_set1_pd(int_to_ntt_limb2(ntt_mods_cr[l],
+ ntt_mods[k]));
+#else
+ s->ntt_mods_cr_inv[l] = init_mul_mod_fast2(ntt_mods_cr[l],
+ ntt_mods[k]);
+#endif
+ l++;
+ }
+ }
+ return 0;
+}
+
+int bf_get_fft_size(int *pdpl, int *pnb_mods, limb_t len)
+{
+ int dpl, fft_len_log2, n_bits, nb_mods, dpl_found, fft_len_log2_found;
+ int int_bits, nb_mods_found;
+ limb_t cost, min_cost;
+
+ min_cost = -1;
+ dpl_found = 0;
+ nb_mods_found = 4;
+ fft_len_log2_found = 0;
+ for(nb_mods = 3; nb_mods <= NB_MODS; nb_mods++) {
+ int_bits = ntt_int_bits[NB_MODS - nb_mods];
+ dpl = bf_min((int_bits - 4) / 2,
+ 2 * LIMB_BITS + 2 * NTT_MOD_LOG2_MIN - NTT_MOD_LOG2_MAX);
+ for(;;) {
+ fft_len_log2 = ceil_log2((len * LIMB_BITS + dpl - 1) / dpl);
+ if (fft_len_log2 > NTT_PROOT_2EXP)
+ goto next;
+ n_bits = fft_len_log2 + 2 * dpl;
+ if (n_bits <= int_bits) {
+ cost = ((limb_t)(fft_len_log2 + 1) << fft_len_log2) * nb_mods;
+ // printf("n=%d dpl=%d: cost=%" PRId64 "\n", nb_mods, dpl, (int64_t)cost);
+ if (cost < min_cost) {
+ min_cost = cost;
+ dpl_found = dpl;
+ nb_mods_found = nb_mods;
+ fft_len_log2_found = fft_len_log2;
+ }
+ break;
+ }
+ dpl--;
+ if (dpl == 0)
+ break;
+ }
+ next: ;
+ }
+ if (!dpl_found)
+ abort();
+ /* limit dpl if possible to reduce fixed cost of limb/NTT conversion */
+ if (dpl_found > (LIMB_BITS + NTT_MOD_LOG2_MIN) &&
+ ((limb_t)(LIMB_BITS + NTT_MOD_LOG2_MIN) << fft_len_log2_found) >=
+ len * LIMB_BITS) {
+ dpl_found = LIMB_BITS + NTT_MOD_LOG2_MIN;
+ }
+ *pnb_mods = nb_mods_found;
+ *pdpl = dpl_found;
+ return fft_len_log2_found;
+}
+
+static no_inline void fft_mul(bf_t *res, limb_t *a_tab, limb_t a_len,
+ limb_t *b_tab, limb_t b_len, int mul_flags)
+{
+ bf_context_t *s1 = res->ctx;
+ BFNTTState *s;
+ int dpl, fft_len_log2, j, nb_mods, reduced_mem;
+ slimb_t len, fft_len;
+ NTTLimb *buf1, *buf2, *ptr;
+#if defined(USE_MUL_CHECK)
+ limb_t ha, hb, hr, h_ref;
+#endif
+
+ ntt_static_init(s1);
+ s = s1->ntt_state;
+
+ /* find the optimal number of digits per limb (dpl) */
+ len = a_len + b_len;
+ fft_len_log2 = bf_get_fft_size(&dpl, &nb_mods, len);
+ fft_len = (uint64_t)1 << fft_len_log2;
+ // printf("len=%" PRId64 " fft_len_log2=%d dpl=%d\n", len, fft_len_log2, dpl);
+#if defined(USE_MUL_CHECK)
+ ha = mp_mod1(a_tab, a_len, BF_CHKSUM_MOD, 0);
+ hb = mp_mod1(b_tab, b_len, BF_CHKSUM_MOD, 0);
+#endif
+ if ((mul_flags & (FFT_MUL_R_OVERLAP_A | FFT_MUL_R_OVERLAP_B)) == 0) {
+ bf_resize(res, 0);
+ } else if (mul_flags & FFT_MUL_R_OVERLAP_B) {
+ limb_t *tmp_tab, tmp_len;
+ /* it is better to free 'b' first */
+ tmp_tab = a_tab;
+ a_tab = b_tab;
+ b_tab = tmp_tab;
+ tmp_len = a_len;
+ a_len = b_len;
+ b_len = tmp_len;
+ }
+ buf1 = ntt_malloc(s, sizeof(NTTLimb) * fft_len * nb_mods);
+ limb_to_ntt(s, buf1, fft_len, a_tab, a_len, dpl,
+ NB_MODS - nb_mods, nb_mods);
+ if ((mul_flags & (FFT_MUL_R_OVERLAP_A | FFT_MUL_R_OVERLAP_B)) ==
+ FFT_MUL_R_OVERLAP_A) {
+ bf_resize(res, 0);
+ }
+ reduced_mem = (fft_len_log2 >= 14);
+ if (!reduced_mem) {
+ buf2 = ntt_malloc(s, sizeof(NTTLimb) * fft_len * nb_mods);
+ limb_to_ntt(s, buf2, fft_len, b_tab, b_len, dpl,
+ NB_MODS - nb_mods, nb_mods);
+ bf_resize(res, 0); /* in case res == b */
+ } else {
+ buf2 = ntt_malloc(s, sizeof(NTTLimb) * fft_len);
+ }
+ for(j = 0; j < nb_mods; j++) {
+ if (reduced_mem) {
+ limb_to_ntt(s, buf2, fft_len, b_tab, b_len, dpl,
+ NB_MODS - nb_mods + j, 1);
+ ptr = buf2;
+ } else {
+ ptr = buf2 + fft_len * j;
+ }
+ ntt_conv(s, buf1 + fft_len * j, ptr,
+ fft_len_log2, fft_len_log2, j + NB_MODS - nb_mods);
+ }
+ bf_resize(res, 0); /* in case res == b and reduced mem */
+ ntt_free(s, buf2);
+ bf_resize(res, len);
+ ntt_to_limb(s, res->tab, len, buf1, fft_len_log2, dpl, nb_mods);
+ ntt_free(s, buf1);
+#if defined(USE_MUL_CHECK)
+ hr = mp_mod1(res->tab, len, BF_CHKSUM_MOD, 0);
+ h_ref = mul_mod(ha, hb, BF_CHKSUM_MOD);
+ if (hr != h_ref) {
+ printf("ntt_mul_error: len=%" PRId_LIMB " fft_len_log2=%d dpl=%d nb_mods=%d\n",
+ len, fft_len_log2, dpl, nb_mods);
+ // printf("ha=0x" FMT_LIMB" hb=0x" FMT_LIMB " hr=0x" FMT_LIMB " expected=0x" FMT_LIMB "\n", ha, hb, hr, h_ref);
+ exit(1);
+ }
+#endif
+}
+
+#else /* USE_FFT_MUL */
+
+int bf_get_fft_size(int *pdpl, int *pnb_mods, limb_t len)
+{
+ return 0;
+}
+
+#endif /* !USE_FFT_MUL */
diff --git a/thirdparty/quickjs/quickjs-2019-07-09-dust3d/libbf.h b/thirdparty/quickjs/quickjs-2019-07-09-dust3d/libbf.h
new file mode 100755
index 00000000..e73b51d9
--- /dev/null
+++ b/thirdparty/quickjs/quickjs-2019-07-09-dust3d/libbf.h
@@ -0,0 +1,350 @@
+/*
+ * Tiny arbitrary precision floating point library
+ *
+ * Copyright (c) 2017-2018 Fabrice Bellard
+ *
+ * Permission is hereby granted, free of charge, to any person obtaining a copy
+ * of this software and associated documentation files (the "Software"), to deal
+ * in the Software without restriction, including without limitation the rights
+ * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+ * copies of the Software, and to permit persons to whom the Software is
+ * furnished to do so, subject to the following conditions:
+ *
+ * The above copyright notice and this permission notice shall be included in
+ * all copies or substantial portions of the Software.
+ *
+ * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+ * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+ * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
+ * THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+ * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+ * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
+ * THE SOFTWARE.
+ */
+#ifndef LIBBF_H
+#define LIBBF_H
+
+#include
+#include
+
+#if defined(__x86_64__)
+#define LIMB_LOG2_BITS 6
+#else
+#define LIMB_LOG2_BITS 5
+#endif
+
+#define LIMB_BITS (1 << LIMB_LOG2_BITS)
+
+#if LIMB_BITS == 64
+typedef __int128 int128_t;
+typedef unsigned __int128 uint128_t;
+typedef int64_t slimb_t;
+typedef uint64_t limb_t;
+typedef uint128_t dlimb_t;
+#define EXP_MIN INT64_MIN
+#define EXP_MAX INT64_MAX
+
+#else
+
+typedef int32_t slimb_t;
+typedef uint32_t limb_t;
+typedef uint64_t dlimb_t;
+#define EXP_MIN INT32_MIN
+#define EXP_MAX INT32_MAX
+
+#endif
+
+/* in bits */
+#define BF_EXP_BITS_MIN 3
+#define BF_EXP_BITS_MAX (LIMB_BITS - 2)
+#define BF_PREC_MIN 2
+#define BF_PREC_MAX (((limb_t)1 << BF_EXP_BITS_MAX) - 2)
+#define BF_PREC_INF (BF_PREC_MAX + 1) /* infinite precision */
+
+#if LIMB_BITS == 64
+#define BF_CHKSUM_MOD (UINT64_C(975620677) * UINT64_C(9795002197))
+#else
+#define BF_CHKSUM_MOD 975620677U
+#endif
+
+#define BF_EXP_ZERO EXP_MIN
+#define BF_EXP_INF (EXP_MAX - 1)
+#define BF_EXP_NAN EXP_MAX
+
+/* +/-zero is represented with expn = BF_EXP_ZERO and len = 0,
+ +/-infinity is represented with expn = BF_EXP_INF and len = 0,
+ NaN is represented with expn = BF_EXP_NAN and len = 0 (sign is ignored)
+ */
+typedef struct {
+ struct bf_context_t *ctx;
+ int sign;
+ slimb_t expn;
+ limb_t len;
+ limb_t *tab;
+} bf_t;
+
+typedef enum {
+ BF_RNDN, /* round to nearest, ties to even */
+ BF_RNDZ, /* round to zero */
+ BF_RNDD, /* round to -inf */
+ BF_RNDU, /* round to +inf */
+ BF_RNDNA, /* round to nearest, ties away from zero */
+ BF_RNDNU, /* round to nearest, ties to +inf */
+ BF_RNDF, /* faithful rounding (nondeterministic, either RNDD or RNDU,
+ inexact flag is always set) */
+} bf_rnd_t;
+
+/* allow subnormal numbers (only available if the number of exponent
+ bits is < BF_EXP_BITS_MAX and prec != BF_PREC_INF) */
+#define BF_FLAG_SUBNORMAL (1 << 3)
+
+#define BF_RND_MASK 0x7
+#define BF_EXP_BITS_SHIFT 4
+#define BF_EXP_BITS_MASK 0x3f
+
+/* contains the rounding mode and number of exponents bits */
+typedef uint32_t bf_flags_t;
+
+typedef void *bf_realloc_func_t(void *opaque, void *ptr, size_t size);
+
+typedef struct {
+ bf_t val;
+ limb_t prec;
+} BFConstCache;
+
+typedef struct bf_context_t {
+ void *realloc_opaque;
+ bf_realloc_func_t *realloc_func;
+ BFConstCache log2_cache;
+ BFConstCache pi_cache;
+ struct BFNTTState *ntt_state;
+} bf_context_t;
+
+static inline int bf_get_exp_bits(bf_flags_t flags)
+{
+ return BF_EXP_BITS_MAX - ((flags >> BF_EXP_BITS_SHIFT) & BF_EXP_BITS_MASK);
+}
+
+static inline bf_flags_t bf_set_exp_bits(int n)
+{
+ return (BF_EXP_BITS_MAX - n) << BF_EXP_BITS_SHIFT;
+}
+
+/* returned status */
+#define BF_ST_INVALID_OP (1 << 0)
+#define BF_ST_DIVIDE_ZERO (1 << 1)
+#define BF_ST_OVERFLOW (1 << 2)
+#define BF_ST_UNDERFLOW (1 << 3)
+#define BF_ST_INEXACT (1 << 4)
+/* not used yet, indicate that a memory allocation error occured. NaN
+ is returned */
+#define BF_ST_MEM_ERROR (1 << 5)
+
+#define BF_RADIX_MAX 36 /* maximum radix for bf_atof() and bf_ftoa() */
+
+static inline slimb_t bf_max(slimb_t a, slimb_t b)
+{
+ if (a > b)
+ return a;
+ else
+ return b;
+}
+
+static inline slimb_t bf_min(slimb_t a, slimb_t b)
+{
+ if (a < b)
+ return a;
+ else
+ return b;
+}
+
+void bf_context_init(bf_context_t *s, bf_realloc_func_t *realloc_func,
+ void *realloc_opaque);
+void bf_context_end(bf_context_t *s);
+/* free memory allocated for the bf cache data */
+void bf_clear_cache(bf_context_t *s);
+
+static inline void *bf_realloc(bf_context_t *s, void *ptr, size_t size)
+{
+ return s->realloc_func(s->realloc_opaque, ptr, size);
+}
+
+void bf_init(bf_context_t *s, bf_t *r);
+
+static inline void bf_delete(bf_t *r)
+{
+ bf_context_t *s = r->ctx;
+ /* we accept to delete a zeroed bf_t structure */
+ if (s) {
+ bf_realloc(s, r->tab, 0);
+ }
+}
+
+static inline void bf_neg(bf_t *r)
+{
+ r->sign ^= 1;
+}
+
+static inline int bf_is_finite(const bf_t *a)
+{
+ return (a->expn < BF_EXP_INF);
+}
+
+static inline int bf_is_nan(const bf_t *a)
+{
+ return (a->expn == BF_EXP_NAN);
+}
+
+static inline int bf_is_zero(const bf_t *a)
+{
+ return (a->expn == BF_EXP_ZERO);
+}
+
+void bf_set_ui(bf_t *r, uint64_t a);
+void bf_set_si(bf_t *r, int64_t a);
+void bf_set_nan(bf_t *r);
+void bf_set_zero(bf_t *r, int is_neg);
+void bf_set_inf(bf_t *r, int is_neg);
+void bf_set(bf_t *r, const bf_t *a);
+void bf_move(bf_t *r, bf_t *a);
+int bf_get_float64(const bf_t *a, double *pres, bf_rnd_t rnd_mode);
+void bf_set_float64(bf_t *a, double d);
+
+int bf_cmpu(const bf_t *a, const bf_t *b);
+int bf_cmp_full(const bf_t *a, const bf_t *b);
+int bf_cmp_eq(const bf_t *a, const bf_t *b);
+int bf_cmp_le(const bf_t *a, const bf_t *b);
+int bf_cmp_lt(const bf_t *a, const bf_t *b);
+int bf_add(bf_t *r, const bf_t *a, const bf_t *b, limb_t prec, bf_flags_t flags);
+int bf_sub(bf_t *r, const bf_t *a, const bf_t *b, limb_t prec, bf_flags_t flags);
+int bf_add_si(bf_t *r, const bf_t *a, int64_t b1, limb_t prec, bf_flags_t flags);
+int bf_mul(bf_t *r, const bf_t *a, const bf_t *b, limb_t prec, bf_flags_t flags);
+int bf_mul_ui(bf_t *r, const bf_t *a, uint64_t b1, limb_t prec, bf_flags_t flags);
+int bf_mul_si(bf_t *r, const bf_t *a, int64_t b1, limb_t prec,
+ bf_flags_t flags);
+int bf_mul_2exp(bf_t *r, slimb_t e, limb_t prec, bf_flags_t flags);
+int bf_div(bf_t *r, const bf_t *a, const bf_t *b, limb_t prec, bf_flags_t flags);
+#define BF_DIVREM_EUCLIDIAN BF_RNDF
+int bf_divrem(bf_t *q, bf_t *r, const bf_t *a, const bf_t *b,
+ limb_t prec, bf_flags_t flags, int rnd_mode);
+int bf_fmod(bf_t *r, const bf_t *a, const bf_t *b, limb_t prec,
+ bf_flags_t flags);
+int bf_remainder(bf_t *r, const bf_t *a, const bf_t *b, limb_t prec,
+ bf_flags_t flags);
+int bf_remquo(slimb_t *pq, bf_t *r, const bf_t *a, const bf_t *b, limb_t prec,
+ bf_flags_t flags);
+int bf_pow_ui(bf_t *r, const bf_t *a, limb_t b, limb_t prec,
+ bf_flags_t flags);
+int bf_pow_ui_ui(bf_t *r, limb_t a1, limb_t b, limb_t prec, bf_flags_t flags);
+int bf_rint(bf_t *r, limb_t prec, bf_flags_t flags);
+int bf_round(bf_t *r, limb_t prec, bf_flags_t flags);
+int bf_sqrtrem(bf_t *r, bf_t *rem1, const bf_t *a);
+int bf_sqrt(bf_t *r, const bf_t *a, limb_t prec, bf_flags_t flags);
+slimb_t bf_get_exp_min(const bf_t *a);
+void bf_logic_or(bf_t *r, const bf_t *a, const bf_t *b);
+void bf_logic_xor(bf_t *r, const bf_t *a, const bf_t *b);
+void bf_logic_and(bf_t *r, const bf_t *a, const bf_t *b);
+
+/* additional flags for bf_atof */
+/* do not accept hex radix prefix (0x or 0X) if radix = 0 or radix = 16 */
+#define BF_ATOF_NO_HEX (1 << 16)
+/* accept binary (0b or 0B) or octal (0o or 0O) radix prefix if radix = 0 */
+#define BF_ATOF_BIN_OCT (1 << 17)
+/* Only accept integers (no decimal point, no exponent, no infinity nor NaN */
+#define BF_ATOF_INT_ONLY (1 << 18)
+/* Do not accept radix prefix after sign */
+#define BF_ATOF_NO_PREFIX_AFTER_SIGN (1 << 19)
+/* Do not parse NaN and parse case sensitive 'Infinity' */
+#define BF_ATOF_JS_QUIRKS (1 << 20)
+/* Do not round integers to the indicated precision */
+#define BF_ATOF_INT_PREC_INF (1 << 21)
+/* Support legacy octal syntax for well formed numbers */
+#define BF_ATOF_LEGACY_OCTAL (1 << 22)
+/* accept _ between digits as a digit separator */
+#define BF_ATOF_UNDERSCORE_SEP (1 << 23)
+/* if a 'n' suffix is present, force integer parsing (XXX: remove) */
+#define BF_ATOF_INT_N_SUFFIX (1 << 24)
+/* if set return NaN if empty number string (instead of 0) */
+#define BF_ATOF_NAN_IF_EMPTY (1 << 25)
+/* only accept decimal floating point if radix = 0 */
+#define BF_ATOF_ONLY_DEC_FLOAT (1 << 26)
+
+/* one more return flag: indicate that the parsed number is an integer
+ (only set when the flags BF_ATOF_INT_PREC_INF or
+ BF_ATOF_INT_N_SUFFIX are used) */
+#define BF_ATOF_ST_INTEGER (1 << 5)
+
+int bf_atof(bf_t *a, const char *str, const char **pnext, int radix,
+ limb_t prec, bf_flags_t flags);
+/* this version accepts prec = BF_PREC_INF and returns the radix
+ exponent */
+int bf_atof2(bf_t *r, slimb_t *pexponent,
+ const char *str, const char **pnext, int radix,
+ limb_t prec, bf_flags_t flags);
+int bf_mul_pow_radix(bf_t *r, const bf_t *T, limb_t radix,
+ slimb_t expn, limb_t prec, bf_flags_t flags);
+
+#define BF_FTOA_FORMAT_MASK (3 << 16)
+/* fixed format: prec significant digits rounded with (flags &
+ BF_RND_MASK). Exponential notation is used if too many zeros are
+ needed. */
+#define BF_FTOA_FORMAT_FIXED (0 << 16)
+/* fractional format: prec digits after the decimal point rounded with
+ (flags & BF_RND_MASK) */
+#define BF_FTOA_FORMAT_FRAC (1 << 16)
+/* free format: use as many digits as necessary so that bf_atof()
+ return the same number when using precision 'prec', rounding to
+ nearest and the subnormal+exponent configuration of 'flags'. The
+ result is meaningful only if 'a' is already rounded to the wanted
+ precision.
+
+ Infinite precision (BF_PREC_INF) is supported when the radix is a
+ power of two. */
+#define BF_FTOA_FORMAT_FREE (2 << 16)
+/* same as BF_FTOA_FORMAT_FREE but uses the minimum number of digits
+ (takes more computation time). */
+#define BF_FTOA_FORMAT_FREE_MIN (3 << 16)
+
+/* force exponential notation for fixed or free format */
+#define BF_FTOA_FORCE_EXP (1 << 20)
+/* add 0x prefix for base 16, 0o prefix for base 8 or 0b prefix for
+ base 2 if non zero value */
+#define BF_FTOA_ADD_PREFIX (1 << 21)
+#define BF_FTOA_JS_QUIRKS (1 << 22)
+
+size_t bf_ftoa(char **pbuf, const bf_t *a, int radix, limb_t prec,
+ bf_flags_t flags);
+
+/* modulo 2^n instead of saturation. NaN and infinity return 0 */
+#define BF_GET_INT_MOD (1 << 0)
+int bf_get_int32(int *pres, const bf_t *a, int flags);
+int bf_get_int64(int64_t *pres, const bf_t *a, int flags);
+
+/* the following functions are exported for testing only. */
+void bf_print_str(const char *str, const bf_t *a);
+void bf_resize(bf_t *r, limb_t len);
+int bf_get_fft_size(int *pdpl, int *pnb_mods, limb_t len);
+void bf_recip(bf_t *r, const bf_t *a, limb_t prec);
+void bf_rsqrt(bf_t *a, const bf_t *x, limb_t prec);
+int bf_normalize_and_round(bf_t *r, limb_t prec1, bf_flags_t flags);
+int bf_can_round(const bf_t *a, slimb_t prec, bf_rnd_t rnd_mode, slimb_t k);
+slimb_t bf_mul_log2_radix(slimb_t a1, unsigned int radix, int is_inv,
+ int is_ceil1);
+
+/* transcendental functions */
+int bf_const_log2(bf_t *T, limb_t prec, bf_flags_t flags);
+int bf_const_pi(bf_t *T, limb_t prec, bf_flags_t flags);
+int bf_exp(bf_t *r, const bf_t *a, limb_t prec, bf_flags_t flags);
+int bf_log(bf_t *r, const bf_t *a, limb_t prec, bf_flags_t flags);
+#define BF_POW_JS_QUICKS (1 << 16)
+int bf_pow(bf_t *r, const bf_t *x, const bf_t *y, limb_t prec, bf_flags_t flags);
+int bf_cos(bf_t *r, const bf_t *a, limb_t prec, bf_flags_t flags);
+int bf_sin(bf_t *r, const bf_t *a, limb_t prec, bf_flags_t flags);
+int bf_tan(bf_t *r, const bf_t *a, limb_t prec, bf_flags_t flags);
+int bf_atan(bf_t *r, const bf_t *a, limb_t prec, bf_flags_t flags);
+int bf_atan2(bf_t *r, const bf_t *y, const bf_t *x,
+ limb_t prec, bf_flags_t flags);
+int bf_asin(bf_t *r, const bf_t *a, limb_t prec, bf_flags_t flags);
+int bf_acos(bf_t *r, const bf_t *a, limb_t prec, bf_flags_t flags);
+
+#endif /* LIBBF_H */
diff --git a/thirdparty/quickjs/quickjs-2019-07-09-dust3d/libregexp-opcode.h b/thirdparty/quickjs/quickjs-2019-07-09-dust3d/libregexp-opcode.h
new file mode 100755
index 00000000..f90c23b3
--- /dev/null
+++ b/thirdparty/quickjs/quickjs-2019-07-09-dust3d/libregexp-opcode.h
@@ -0,0 +1,58 @@
+/*
+ * Regular Expression Engine
+ *
+ * Copyright (c) 2017-2018 Fabrice Bellard
+ *
+ * Permission is hereby granted, free of charge, to any person obtaining a copy
+ * of this software and associated documentation files (the "Software"), to deal
+ * in the Software without restriction, including without limitation the rights
+ * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+ * copies of the Software, and to permit persons to whom the Software is
+ * furnished to do so, subject to the following conditions:
+ *
+ * The above copyright notice and this permission notice shall be included in
+ * all copies or substantial portions of the Software.
+ *
+ * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+ * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+ * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
+ * THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+ * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+ * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
+ * THE SOFTWARE.
+ */
+
+#ifdef DEF
+
+DEF(invalid, 1) /* never used */
+DEF(char, 3)
+DEF(char32, 5)
+DEF(dot, 1)
+DEF(any, 1) /* same as dot but match any character including line terminator */
+DEF(line_start, 1)
+DEF(line_end, 1)
+DEF(goto, 5)
+DEF(split_goto_first, 5)
+DEF(split_next_first, 5)
+DEF(match, 1)
+DEF(save_start, 2) /* save start position */
+DEF(save_end, 2) /* save end position, must come after saved_start */
+DEF(save_reset, 3) /* reset save positions */
+DEF(loop, 5) /* decrement the top the stack and goto if != 0 */
+DEF(push_i32, 5) /* push integer on the stack */
+DEF(drop, 1)
+DEF(word_boundary, 1)
+DEF(not_word_boundary, 1)
+DEF(back_reference, 2)
+DEF(backward_back_reference, 2) /* must come after back_reference */
+DEF(range, 3) /* variable length */
+DEF(range32, 3) /* variable length */
+DEF(lookahead, 5)
+DEF(negative_lookahead, 5)
+DEF(push_char_pos, 1) /* push the character position on the stack */
+DEF(bne_char_pos, 5) /* pop one stack element and jump if equal to the character
+ position */
+DEF(prev, 1) /* go to the previous char */
+DEF(simple_greedy_quant, 17)
+
+#endif /* DEF */
diff --git a/thirdparty/quickjs/quickjs-2019-07-09-dust3d/libregexp.c b/thirdparty/quickjs/quickjs-2019-07-09-dust3d/libregexp.c
new file mode 100755
index 00000000..757212a9
--- /dev/null
+++ b/thirdparty/quickjs/quickjs-2019-07-09-dust3d/libregexp.c
@@ -0,0 +1,2567 @@
+/*
+ * Regular Expression Engine
+ *
+ * Copyright (c) 2017-2018 Fabrice Bellard
+ *
+ * Permission is hereby granted, free of charge, to any person obtaining a copy
+ * of this software and associated documentation files (the "Software"), to deal
+ * in the Software without restriction, including without limitation the rights
+ * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+ * copies of the Software, and to permit persons to whom the Software is
+ * furnished to do so, subject to the following conditions:
+ *
+ * The above copyright notice and this permission notice shall be included in
+ * all copies or substantial portions of the Software.
+ *
+ * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+ * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+ * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
+ * THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+ * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+ * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
+ * THE SOFTWARE.
+ */
+#include
+#include
+#include
+#include
+#include
+#include
+
+#include "cutils.h"
+#include "libregexp.h"
+
+/*
+ TODO:
+
+ - Add full unicode canonicalize rules for character ranges (not
+ really useful but needed for exact "ignorecase" compatibility).
+
+ - Add a lock step execution mode (=linear time execution guaranteed)
+ when the regular expression is "simple" i.e. no backreference nor
+ complicated lookahead. The opcodes are designed for this execution
+ model.
+*/
+
+#if defined(TEST)
+#define DUMP_REOP
+#endif
+
+typedef enum {
+#define DEF(id, size) REOP_ ## id,
+#include "libregexp-opcode.h"
+#undef DEF
+ REOP_COUNT,
+} REOPCodeEnum;
+
+#define CAPTURE_COUNT_MAX 255
+#define STACK_SIZE_MAX 255
+
+/* unicode code points */
+#define CP_LS 0x2028
+#define CP_PS 0x2029
+
+#define TMP_BUF_SIZE 128
+
+typedef struct {
+ DynBuf byte_code;
+ const uint8_t *buf_ptr;
+ const uint8_t *buf_end;
+ const uint8_t *buf_start;
+ int re_flags;
+ BOOL is_utf16;
+ BOOL ignore_case;
+ BOOL dotall;
+ int capture_count;
+ int total_capture_count; /* -1 = not computed yet */
+ int has_named_captures; /* -1 = don't know, 0 = no, 1 = yes */
+ void *mem_opaque;
+ DynBuf group_names;
+ union {
+ char error_msg[TMP_BUF_SIZE];
+ char tmp_buf[TMP_BUF_SIZE];
+ } u;
+} REParseState;
+
+typedef struct {
+#ifdef DUMP_REOP
+ const char *name;
+#endif
+ uint8_t size;
+} REOpCode;
+
+static const REOpCode reopcode_info[REOP_COUNT] = {
+#ifdef DUMP_REOP
+#define DEF(id, size) { #id, size },
+#else
+#define DEF(id, size) { size },
+#endif
+#include "libregexp-opcode.h"
+#undef DEF
+};
+
+#define RE_HEADER_FLAGS 0
+#define RE_HEADER_CAPTURE_COUNT 1
+#define RE_HEADER_STACK_SIZE 2
+
+#define RE_HEADER_LEN 7
+
+static inline int is_digit(int c) {
+ return c >= '0' && c <= '9';
+}
+
+/* insert 'len' bytes at position 'pos' */
+static void dbuf_insert(DynBuf *s, int pos, int len)
+{
+ dbuf_realloc(s, s->size + len);
+ memmove(s->buf + pos + len, s->buf + pos, s->size - pos);
+ s->size += len;
+}
+
+/* canonicalize with the specific JS regexp rules */
+static uint32_t lre_canonicalize(uint32_t c, BOOL is_utf16)
+{
+ uint32_t res[LRE_CC_RES_LEN_MAX];
+ int len;
+ if (is_utf16) {
+ if (likely(c < 128)) {
+ if (c >= 'A' && c <= 'Z')
+ c = c - 'A' + 'a';
+ } else {
+ lre_case_conv(res, c, 2);
+ c = res[0];
+ }
+ } else {
+ if (likely(c < 128)) {
+ if (c >= 'a' && c <= 'z')
+ c = c - 'a' + 'A';
+ } else {
+ /* legacy regexp: to upper case if single char >= 128 */
+ len = lre_case_conv(res, c, FALSE);
+ if (len == 1 && res[0] >= 128)
+ c = res[0];
+ }
+ }
+ return c;
+}
+
+static const uint16_t char_range_d[] = {
+ 1,
+ 0x0030, 0x0039 + 1,
+};
+
+/* code point ranges for Zs,Zl or Zp property */
+static const uint16_t char_range_s[] = {
+ 10,
+ 0x0009, 0x000D + 1,
+ 0x0020, 0x0020 + 1,
+ 0x00A0, 0x00A0 + 1,
+ 0x1680, 0x1680 + 1,
+ 0x2000, 0x200A + 1,
+ /* 2028;LINE SEPARATOR;Zl;0;WS;;;;;N;;;;; */
+ /* 2029;PARAGRAPH SEPARATOR;Zp;0;B;;;;;N;;;;; */
+ 0x2028, 0x2029 + 1,
+ 0x202F, 0x202F + 1,
+ 0x205F, 0x205F + 1,
+ 0x3000, 0x3000 + 1,
+ /* FEFF;ZERO WIDTH NO-BREAK SPACE;Cf;0;BN;;;;;N;BYTE ORDER MARK;;;; */
+ 0xFEFF, 0xFEFF + 1,
+};
+
+BOOL lre_is_space(int c)
+{
+ int i, n, low, high;
+ n = (countof(char_range_s) - 1) / 2;
+ for(i = 0; i < n; i++) {
+ low = char_range_s[2 * i + 1];
+ if (c < low)
+ return FALSE;
+ high = char_range_s[2 * i + 2];
+ if (c < high)
+ return TRUE;
+ }
+ return FALSE;
+}
+
+uint32_t const lre_id_start_table_ascii[4] = {
+ /* $ A-Z _ a-z */
+ 0x00000000, 0x00000010, 0x87FFFFFE, 0x07FFFFFE
+};
+
+uint32_t const lre_id_continue_table_ascii[4] = {
+ /* $ 0-9 A-Z _ a-z */
+ 0x00000000, 0x03FF0010, 0x87FFFFFE, 0x07FFFFFE
+};
+
+
+static const uint16_t char_range_w[] = {
+ 4,
+ 0x0030, 0x0039 + 1,
+ 0x0041, 0x005A + 1,
+ 0x005F, 0x005F + 1,
+ 0x0061, 0x007A + 1,
+};
+
+#define CLASS_RANGE_BASE 0x40000000
+
+typedef enum {
+ CHAR_RANGE_d,
+ CHAR_RANGE_D,
+ CHAR_RANGE_s,
+ CHAR_RANGE_S,
+ CHAR_RANGE_w,
+ CHAR_RANGE_W,
+} CharRangeEnum;
+
+static const uint16_t *char_range_table[] = {
+ char_range_d,
+ char_range_s,
+ char_range_w,
+};
+
+static int cr_init_char_range(REParseState *s, CharRange *cr, uint32_t c)
+{
+ BOOL invert;
+ const uint16_t *c_pt;
+ int len, i;
+
+ invert = c & 1;
+ c_pt = char_range_table[c >> 1];
+ len = *c_pt++;
+ cr_init(cr, s->mem_opaque, lre_realloc);
+ for(i = 0; i < len * 2; i++) {
+ if (cr_add_point(cr, c_pt[i]))
+ goto fail;
+ }
+ if (invert) {
+ if (cr_invert(cr))
+ goto fail;
+ }
+ return 0;
+ fail:
+ cr_free(cr);
+ return -1;
+}
+
+static int cr_canonicalize(CharRange *cr)
+{
+ CharRange a;
+ uint32_t pt[2];
+ int i, ret;
+
+ cr_init(&a, cr->mem_opaque, lre_realloc);
+ pt[0] = 'a';
+ pt[1] = 'z' + 1;
+ ret = cr_op(&a, cr->points, cr->len, pt, 2, CR_OP_INTER);
+ if (ret)
+ goto fail;
+ /* convert to upper case */
+ /* XXX: the generic unicode case would be much more complicated
+ and not really useful */
+ for(i = 0; i < a.len; i++) {
+ a.points[i] += 'A' - 'a';
+ }
+ /* Note: for simplicity we keep the lower case ranges */
+ ret = cr_union1(cr, a.points, a.len);
+ fail:
+ cr_free(&a);
+ return ret;
+}
+
+#ifdef DUMP_REOP
+static __attribute__((unused)) void lre_dump_bytecode(const uint8_t *buf,
+ int buf_len)
+{
+ int pos, len, opcode, bc_len, re_flags, i;
+ uint32_t val;
+
+ assert(buf_len >= RE_HEADER_LEN);
+
+ re_flags= buf[0];
+ bc_len = get_u32(buf + 3);
+ assert(bc_len + RE_HEADER_LEN <= buf_len);
+ printf("flags: 0x%x capture_count=%d stack_size=%d\n",
+ re_flags, buf[1], buf[2]);
+ if (re_flags & LRE_FLAG_NAMED_GROUPS) {
+ const char *p;
+ p = (char *)buf + RE_HEADER_LEN + bc_len;
+ printf("named groups: ");
+ for(i = 1; i < buf[1]; i++) {
+ if (i != 1)
+ printf(",");
+ printf("<%s>", p);
+ p += strlen(p) + 1;
+ }
+ printf("\n");
+ assert(p == (char *)(buf + buf_len));
+ }
+ printf("bytecode_len=%d\n", bc_len);
+
+ buf += RE_HEADER_LEN;
+ pos = 0;
+ while (pos < bc_len) {
+ printf("%5u: ", pos);
+ opcode = buf[pos];
+ len = reopcode_info[opcode].size;
+ if (opcode >= REOP_COUNT) {
+ printf(" invalid opcode=0x%02x\n", opcode);
+ break;
+ }
+ if ((pos + len) > bc_len) {
+ printf(" buffer overflow (opcode=0x%02x)\n", opcode);
+ break;
+ }
+ printf("%s", reopcode_info[opcode].name);
+ switch(opcode) {
+ case REOP_char:
+ val = get_u16(buf + pos + 1);
+ if (val >= ' ' && val <= 126)
+ printf(" '%c'", val);
+ else
+ printf(" 0x%04x", val);
+ break;
+ case REOP_char32:
+ val = get_u32(buf + pos + 1);
+ if (val >= ' ' && val <= 126)
+ printf(" '%c'", val);
+ else
+ printf(" 0x%08x", val);
+ break;
+ case REOP_goto:
+ case REOP_split_goto_first:
+ case REOP_split_next_first:
+ case REOP_loop:
+ case REOP_lookahead:
+ case REOP_negative_lookahead:
+ case REOP_bne_char_pos:
+ val = get_u32(buf + pos + 1);
+ val += (pos + 5);
+ printf(" %u", val);
+ break;
+ case REOP_simple_greedy_quant:
+ printf(" %u %u %u %u",
+ get_u32(buf + pos + 1) + (pos + 17),
+ get_u32(buf + pos + 1 + 4),
+ get_u32(buf + pos + 1 + 8),
+ get_u32(buf + pos + 1 + 12));
+ break;
+ case REOP_save_start:
+ case REOP_save_end:
+ case REOP_back_reference:
+ case REOP_backward_back_reference:
+ printf(" %u", buf[pos + 1]);
+ break;
+ case REOP_save_reset:
+ printf(" %u %u", buf[pos + 1], buf[pos + 2]);
+ break;
+ case REOP_push_i32:
+ val = get_u32(buf + pos + 1);
+ printf(" %d", val);
+ break;
+ case REOP_range:
+ {
+ int n, i;
+ n = get_u16(buf + pos + 1);
+ len += n * 4;
+ for(i = 0; i < n * 2; i++) {
+ val = get_u16(buf + pos + 3 + i * 2);
+ printf(" 0x%04x", val);
+ }
+ }
+ break;
+ case REOP_range32:
+ {
+ int n, i;
+ n = get_u16(buf + pos + 1);
+ len += n * 8;
+ for(i = 0; i < n * 2; i++) {
+ val = get_u32(buf + pos + 3 + i * 4);
+ printf(" 0x%08x", val);
+ }
+ }
+ break;
+ default:
+ break;
+ }
+ printf("\n");
+ pos += len;
+ }
+}
+#endif
+
+static void re_emit_op(REParseState *s, int op)
+{
+ dbuf_putc(&s->byte_code, op);
+}
+
+/* return the offset of the u32 value */
+static int re_emit_op_u32(REParseState *s, int op, uint32_t val)
+{
+ int pos;
+ dbuf_putc(&s->byte_code, op);
+ pos = s->byte_code.size;
+ dbuf_put_u32(&s->byte_code, val);
+ return pos;
+}
+
+static int re_emit_goto(REParseState *s, int op, uint32_t val)
+{
+ int pos;
+ dbuf_putc(&s->byte_code, op);
+ pos = s->byte_code.size;
+ dbuf_put_u32(&s->byte_code, val - (pos + 4));
+ return pos;
+}
+
+static void re_emit_op_u8(REParseState *s, int op, uint32_t val)
+{
+ dbuf_putc(&s->byte_code, op);
+ dbuf_putc(&s->byte_code, val);
+}
+
+static void re_emit_op_u16(REParseState *s, int op, uint32_t val)
+{
+ dbuf_putc(&s->byte_code, op);
+ dbuf_put_u16(&s->byte_code, val);
+}
+
+#if defined(_MSC_VER)
+static int re_parse_error(REParseState *s, const char *fmt, ...)
+#else
+static int __attribute__((format(printf, 2, 3))) re_parse_error(REParseState *s, const char *fmt, ...)
+#endif
+{
+ va_list ap;
+ va_start(ap, fmt);
+ vsnprintf(s->u.error_msg, sizeof(s->u.error_msg), fmt, ap);
+ va_end(ap);
+ return -1;
+}
+
+/* Return -1 in case of overflow */
+static int parse_digits(const uint8_t **pp)
+{
+ const uint8_t *p;
+ uint64_t v;
+ int c;
+
+ p = *pp;
+ v = 0;
+ for(;;) {
+ c = *p;
+ if (c < '0' || c > '9')
+ break;
+ v = v * 10 + c - '0';
+ if (v >= INT32_MAX)
+ return -1;
+ p++;
+ }
+ *pp = p;
+ return v;
+}
+
+static int re_parse_expect(REParseState *s, const uint8_t **pp, int c)
+{
+ const uint8_t *p;
+ p = *pp;
+ if (*p != c)
+ return re_parse_error(s, "expecting '%c'", c);
+ p++;
+ *pp = p;
+ return 0;
+}
+
+/* Parse an escape sequence, *pp points after the '\':
+ allow_utf16 value:
+ 0 : no UTF-16 escapes allowed
+ 1 : UTF-16 escapes allowed
+ 2 : UTF-16 escapes allowed and escapes of surrogate pairs are
+ converted to a unicode character (unicode regexp case).
+
+ Return the unicode char and update *pp if recognized,
+ return -1 if malformed escape,
+ return -2 otherwise. */
+int lre_parse_escape(const uint8_t **pp, int allow_utf16)
+{
+ const uint8_t *p;
+ uint32_t c;
+
+ p = *pp;
+ c = *p++;
+ switch(c) {
+ case 'b':
+ c = '\b';
+ break;
+ case 'f':
+ c = '\f';
+ break;
+ case 'n':
+ c = '\n';
+ break;
+ case 'r':
+ c = '\r';
+ break;
+ case 't':
+ c = '\t';
+ break;
+ case 'v':
+ c = '\v';
+ break;
+ case 'x':
+ case 'u':
+ {
+ int h, n, i;
+ uint32_t c1;
+
+ if (*p == '{' && allow_utf16) {
+ p++;
+ c = 0;
+ for(;;) {
+ h = from_hex(*p++);
+ if (h < 0)
+ return -1;
+ c = (c << 4) | h;
+ if (c > 0x10FFFF)
+ return -1;
+ if (*p == '}')
+ break;
+ }
+ p++;
+ } else {
+ if (c == 'x') {
+ n = 2;
+ } else {
+ n = 4;
+ }
+
+ c = 0;
+ for(i = 0; i < n; i++) {
+ h = from_hex(*p++);
+ if (h < 0) {
+ return -1;
+ }
+ c = (c << 4) | h;
+ }
+ if (c >= 0xd800 && c < 0xdc00 &&
+ allow_utf16 == 2 && p[0] == '\\' && p[1] == 'u') {
+ /* convert an escaped surrogate pair into a
+ unicode char */
+ c1 = 0;
+ for(i = 0; i < 4; i++) {
+ h = from_hex(p[2 + i]);
+ if (h < 0)
+ break;
+ c1 = (c1 << 4) | h;
+ }
+ if (i == 4 && c1 >= 0xdc00 && c1 < 0xe000) {
+ p += 6;
+ c = (((c & 0x3ff) << 10) | (c1 & 0x3ff)) + 0x10000;
+ }
+ }
+ }
+ }
+ break;
+#if defined(_MSC_VER)
+ case '0':
+ case '1':
+ case '2':
+ case '3':
+ case '4':
+ case '5':
+ case '6':
+ case '7':
+#else
+ case '0' ... '7':
+#endif
+ c -= '0';
+ if (allow_utf16 == 2) {
+ /* only accept \0 not followed by digit */
+ if (c != 0 || is_digit(*p))
+ return -1;
+ } else {
+ /* parse a legacy octal sequence */
+ uint32_t v;
+ v = *p - '0';
+ if (v > 7)
+ break;
+ c = (c << 3) | v;
+ p++;
+ if (c >= 32)
+ break;
+ v = *p - '0';
+ if (v > 7)
+ break;
+ c = (c << 3) | v;
+ p++;
+ }
+ break;
+ default:
+ return -2;
+ }
+ *pp = p;
+ return c;
+}
+
+#ifdef CONFIG_ALL_UNICODE
+/* XXX: we use the same chars for name and value */
+static BOOL is_unicode_char(int c)
+{
+ return ((c >= '0' && c <= '9') ||
+ (c >= 'A' && c <= 'Z') ||
+ (c >= 'a' && c <= 'z') ||
+ (c == '_'));
+}
+
+static int parse_unicode_property(REParseState *s, CharRange *cr,
+ const uint8_t **pp, BOOL is_inv)
+{
+ const uint8_t *p;
+ char name[64], value[64];
+ char *q;
+ BOOL script_ext;
+ int ret;
+
+ p = *pp;
+ if (*p != '{')
+ return re_parse_error(s, "expecting '{' after \\p");
+ p++;
+ q = name;
+ while (is_unicode_char(*p)) {
+ if ((q - name) > sizeof(name) - 1)
+ goto unknown_property_name;
+ *q++ = *p++;
+ }
+ *q = '\0';
+ q = value;
+ if (*p == '=') {
+ p++;
+ while (is_unicode_char(*p)) {
+ if ((q - value) > sizeof(value) - 1)
+ return re_parse_error(s, "unknown unicode property value");
+ *q++ = *p++;
+ }
+ }
+ *q = '\0';
+ if (*p != '}')
+ return re_parse_error(s, "expecting '}'");
+ p++;
+ // printf("name=%s value=%s\n", name, value);
+
+ if (!strcmp(name, "Script") || !strcmp(name, "sc")) {
+ script_ext = FALSE;
+ goto do_script;
+ } else if (!strcmp(name, "Script_Extensions") || !strcmp(name, "scx")) {
+ script_ext = TRUE;
+ do_script:
+ cr_init(cr, s->mem_opaque, lre_realloc);
+ ret = unicode_script(cr, value, script_ext);
+ if (ret) {
+ cr_free(cr);
+ if (ret == -2)
+ return re_parse_error(s, "unknown unicode script");
+ else
+ goto out_of_memory;
+ }
+ } else if (!strcmp(name, "General_Category") || !strcmp(name, "gc")) {
+ cr_init(cr, s->mem_opaque, lre_realloc);
+ ret = unicode_general_category(cr, value);
+ if (ret) {
+ cr_free(cr);
+ if (ret == -2)
+ return re_parse_error(s, "unknown unicode general category");
+ else
+ goto out_of_memory;
+ }
+ } else if (value[0] == '\0') {
+ cr_init(cr, s->mem_opaque, lre_realloc);
+ ret = unicode_general_category(cr, name);
+ if (ret == -1) {
+ cr_free(cr);
+ goto out_of_memory;
+ }
+ if (ret < 0) {
+ ret = unicode_prop(cr, name);
+ if (ret) {
+ cr_free(cr);
+ if (ret == -2)
+ goto unknown_property_name;
+ else
+ goto out_of_memory;
+ }
+ }
+ } else {
+ unknown_property_name:
+ return re_parse_error(s, "unknown unicode property name");
+ }
+
+ if (is_inv) {
+ if (cr_invert(cr)) {
+ cr_free(cr);
+ return -1;
+ }
+ }
+ *pp = p;
+ return 0;
+ out_of_memory:
+ return re_parse_error(s, "out of memory");
+}
+#endif /* CONFIG_ALL_UNICODE */
+
+/* return -1 if error otherwise the character or a class range
+ (CLASS_RANGE_BASE). In case of class range, 'cr' is
+ initialized. Otherwise, it is ignored. */
+static int get_class_atom(REParseState *s, CharRange *cr,
+ const uint8_t **pp, BOOL inclass)
+{
+ const uint8_t *p;
+ uint32_t c;
+ int ret;
+
+ p = *pp;
+
+ c = *p;
+ switch(c) {
+ case '\\':
+ p++;
+ if (p >= s->buf_end)
+ goto unexpected_end;
+ c = *p++;
+ switch(c) {
+ case 'd':
+ c = CHAR_RANGE_d;
+ goto class_range;
+ case 'D':
+ c = CHAR_RANGE_D;
+ goto class_range;
+ case 's':
+ c = CHAR_RANGE_s;
+ goto class_range;
+ case 'S':
+ c = CHAR_RANGE_S;
+ goto class_range;
+ case 'w':
+ c = CHAR_RANGE_w;
+ goto class_range;
+ case 'W':
+ c = CHAR_RANGE_W;
+ class_range:
+ if (cr_init_char_range(s, cr, c))
+ return -1;
+ c = CLASS_RANGE_BASE;
+ break;
+ case 'c':
+ c = *p;
+ if ((c >= 'a' && c <= 'z') ||
+ (c >= 'A' && c <= 'Z') ||
+ (((c >= '0' && c <= '9') || c == '_') &&
+ inclass && !s->is_utf16)) { /* Annex B.1.4 */
+ c &= 0x1f;
+ p++;
+ } else if (s->is_utf16) {
+ goto invalid_escape;
+ } else {
+ /* otherwise return '\' and 'c' */
+ p--;
+ c = '\\';
+ }
+ break;
+#ifdef CONFIG_ALL_UNICODE
+ case 'p':
+ case 'P':
+ if (s->is_utf16) {
+ if (parse_unicode_property(s, cr, &p, (c == 'P')))
+ return -1;
+ c = CLASS_RANGE_BASE;
+ break;
+ }
+ /* fall thru */
+#endif
+ default:
+ p--;
+ ret = lre_parse_escape(&p, s->is_utf16 * 2);
+ if (ret >= 0) {
+ c = ret;
+ } else {
+ if (ret == -2 && *p != '\0' && strchr("^$\\.*+?()[]{}|/", *p)) {
+ /* always valid to escape these characters */
+ goto normal_char;
+ } else if (s->is_utf16) {
+ invalid_escape:
+ return re_parse_error(s, "invalid escape sequence in regular expression");
+ } else {
+ /* just ignore the '\' */
+ goto normal_char;
+ }
+ }
+ break;
+ }
+ break;
+ case '\0':
+ if (p >= s->buf_end) {
+ unexpected_end:
+ return re_parse_error(s, "unexpected end");
+ }
+ /* fall thru */
+ default:
+ normal_char:
+ /* normal char */
+ if (c >= 128) {
+ c = unicode_from_utf8(p, UTF8_CHAR_LEN_MAX, &p);
+ if ((unsigned)c > 0xffff && !s->is_utf16) {
+ /* XXX: should handle non BMP-1 code points */
+ return re_parse_error(s, "malformed unicode char");
+ }
+ } else {
+ p++;
+ }
+ break;
+ }
+ *pp = p;
+ return c;
+}
+
+static int re_emit_range(REParseState *s, const CharRange *cr)
+{
+ int len, i;
+ uint32_t high;
+
+ len = (unsigned)cr->len / 2;
+ if (len >= 65535)
+ return re_parse_error(s, "too many ranges");
+ if (len == 0) {
+ /* not sure it can really happen. Emit a match that is always
+ false */
+ re_emit_op_u32(s, REOP_char32, -1);
+ } else {
+ high = cr->points[cr->len - 1];
+ if (high == UINT32_MAX)
+ high = cr->points[cr->len - 2];
+ if (high <= 0xffff) {
+ /* can use 16 bit ranges with the conversion that 0xffff =
+ infinity */
+ re_emit_op_u16(s, REOP_range, len);
+ for(i = 0; i < cr->len; i += 2) {
+ dbuf_put_u16(&s->byte_code, cr->points[i]);
+ high = cr->points[i + 1] - 1;
+ if (high == UINT32_MAX - 1)
+ high = 0xffff;
+ dbuf_put_u16(&s->byte_code, high);
+ }
+ } else {
+ re_emit_op_u16(s, REOP_range32, len);
+ for(i = 0; i < cr->len; i += 2) {
+ dbuf_put_u32(&s->byte_code, cr->points[i]);
+ dbuf_put_u32(&s->byte_code, cr->points[i + 1] - 1);
+ }
+ }
+ }
+ return 0;
+}
+
+static int re_parse_char_class(REParseState *s, const uint8_t **pp)
+{
+ const uint8_t *p;
+ uint32_t c1, c2;
+ CharRange cr_s, *cr = &cr_s;
+ CharRange cr1_s, *cr1 = &cr1_s;
+ BOOL invert;
+
+ cr_init(cr, s->mem_opaque, lre_realloc);
+ p = *pp;
+ p++; /* skip '[' */
+ invert = FALSE;
+ if (*p == '^') {
+ p++;
+ invert = TRUE;
+ }
+ for(;;) {
+ if (*p == ']')
+ break;
+ c1 = get_class_atom(s, cr1, &p, TRUE);
+ if ((int)c1 < 0)
+ goto fail;
+ if (*p == '-' && p[1] != ']') {
+ const uint8_t *p0 = p + 1;
+ if (c1 >= CLASS_RANGE_BASE) {
+ if (s->is_utf16) {
+ cr_free(cr1);
+ goto invalid_class_range;
+ }
+ /* Annex B: match '-' character */
+ goto class_atom;
+ }
+ c2 = get_class_atom(s, cr1, &p0, TRUE);
+ if ((int)c2 < 0)
+ goto fail;
+ if (c2 >= CLASS_RANGE_BASE) {
+ cr_free(cr1);
+ if (s->is_utf16) {
+ goto invalid_class_range;
+ }
+ /* Annex B: match '-' character */
+ goto class_atom;
+ }
+ p = p0;
+ if (c2 < c1) {
+ invalid_class_range:
+ re_parse_error(s, "invalid class range");
+ goto fail;
+ }
+ if (cr_union_interval(cr, c1, c2))
+ goto memory_error;
+ } else {
+ class_atom:
+ if (c1 >= CLASS_RANGE_BASE) {
+ int ret;
+ ret = cr_union1(cr, cr1->points, cr1->len);
+ cr_free(cr1);
+ if (ret)
+ goto memory_error;
+ } else {
+ if (cr_union_interval(cr, c1, c1))
+ goto memory_error;
+ }
+ }
+ }
+ if (s->ignore_case) {
+ if (cr_canonicalize(cr))
+ goto memory_error;
+ }
+ if (invert) {
+ if (cr_invert(cr))
+ goto memory_error;
+ }
+ if (re_emit_range(s, cr))
+ goto fail;
+ cr_free(cr);
+ p++; /* skip ']' */
+ *pp = p;
+ return 0;
+ memory_error:
+ re_parse_error(s, "out of memory");
+ fail:
+ cr_free(cr);
+ return -1;
+}
+
+/* Return:
+ 1 if the opcodes in bc_buf[] always advance the character pointer.
+ 0 if the character pointer may not be advanced.
+ -1 if the code may depend on side effects of its previous execution (backreference)
+*/
+static int re_check_advance(const uint8_t *bc_buf, int bc_buf_len)
+{
+ int pos, opcode, ret, len, i;
+ uint32_t val, last;
+ BOOL has_back_reference;
+ uint8_t capture_bitmap[CAPTURE_COUNT_MAX];
+
+ ret = -2; /* not known yet */
+ pos = 0;
+ has_back_reference = FALSE;
+ memset(capture_bitmap, 0, sizeof(capture_bitmap));
+
+ while (pos < bc_buf_len) {
+ opcode = bc_buf[pos];
+ len = reopcode_info[opcode].size;
+ switch(opcode) {
+ case REOP_range:
+ val = get_u16(bc_buf + pos + 1);
+ len += val * 4;
+ goto simple_char;
+ case REOP_range32:
+ val = get_u16(bc_buf + pos + 1);
+ len += val * 8;
+ goto simple_char;
+ case REOP_char:
+ case REOP_char32:
+ case REOP_dot:
+ case REOP_any:
+ simple_char:
+ if (ret == -2)
+ ret = 1;
+ break;
+ case REOP_line_start:
+ case REOP_line_end:
+ case REOP_push_i32:
+ case REOP_push_char_pos:
+ case REOP_drop:
+ case REOP_word_boundary:
+ case REOP_not_word_boundary:
+ case REOP_prev:
+ /* no effect */
+ break;
+ case REOP_save_start:
+ case REOP_save_end:
+ val = bc_buf[pos + 1];
+ capture_bitmap[val] |= 1;
+ break;
+ case REOP_save_reset:
+ {
+ val = bc_buf[pos + 1];
+ last = bc_buf[pos + 2];
+ while (val < last)
+ capture_bitmap[val++] |= 1;
+ }
+ break;
+ case REOP_back_reference:
+ case REOP_backward_back_reference:
+ val = bc_buf[pos + 1];
+ capture_bitmap[val] |= 2;
+ has_back_reference = TRUE;
+ break;
+ default:
+ /* safe behvior: we cannot predict the outcome */
+ if (ret == -2)
+ ret = 0;
+ break;
+ }
+ pos += len;
+ }
+ if (has_back_reference) {
+ /* check if there is back reference which references a capture
+ made in the some code */
+ for(i = 0; i < CAPTURE_COUNT_MAX; i++) {
+ if (capture_bitmap[i] == 3)
+ return -1;
+ }
+ }
+ if (ret == -2)
+ ret = 0;
+ return ret;
+}
+
+/* return -1 if a simple quantifier cannot be used. Otherwise return
+ the number of characters in the atom. */
+static int re_is_simple_quantifier(const uint8_t *bc_buf, int bc_buf_len)
+{
+ int pos, opcode, len, count;
+ uint32_t val;
+
+ count = 0;
+ pos = 0;
+ while (pos < bc_buf_len) {
+ opcode = bc_buf[pos];
+ len = reopcode_info[opcode].size;
+ switch(opcode) {
+ case REOP_range:
+ val = get_u16(bc_buf + pos + 1);
+ len += val * 4;
+ goto simple_char;
+ case REOP_range32:
+ val = get_u16(bc_buf + pos + 1);
+ len += val * 8;
+ goto simple_char;
+ case REOP_char:
+ case REOP_char32:
+ case REOP_dot:
+ case REOP_any:
+ simple_char:
+ count++;
+ break;
+ case REOP_line_start:
+ case REOP_line_end:
+ case REOP_word_boundary:
+ case REOP_not_word_boundary:
+ break;
+ default:
+ return -1;
+ }
+ pos += len;
+ }
+ return count;
+}
+
+/* '*pp' is the first char after '<' */
+static int re_parse_group_name(char *buf, int buf_size,
+ const uint8_t **pp, BOOL is_utf16)
+{
+ const uint8_t *p;
+ uint32_t c;
+ char *q;
+
+ p = *pp;
+ q = buf;
+ for(;;) {
+ c = *p;
+ if (c == '\\') {
+ p++;
+ if (*p != 'u')
+ return -1;
+ c = lre_parse_escape(&p, is_utf16 * 2);
+ } else if (c == '>') {
+ break;
+ } else if (c >= 128) {
+ c = unicode_from_utf8(p, UTF8_CHAR_LEN_MAX, &p);
+ } else {
+ p++;
+ }
+ if (c > 0x10FFFF)
+ return -1;
+ if (q == buf) {
+ if (!lre_js_is_ident_first(c))
+ return -1;
+ } else {
+ if (!lre_js_is_ident_next(c))
+ return -1;
+ }
+ if ((q - buf + UTF8_CHAR_LEN_MAX + 1) > buf_size)
+ return -1;
+ if (c < 128) {
+ *q++ = c;
+ } else {
+ q += unicode_to_utf8((uint8_t*)q, c);
+ }
+ }
+ if (q == buf)
+ return -1;
+ *q = '\0';
+ p++;
+ *pp = p;
+ return 0;
+}
+
+/* if capture_name = NULL: return the number of captures + 1.
+ Otherwise, return the capture index corresponding to capture_name
+ or -1 if none */
+static int re_parse_captures(REParseState *s, int *phas_named_captures,
+ const char *capture_name)
+{
+ const uint8_t *p;
+ int capture_index;
+ char name[TMP_BUF_SIZE];
+
+ capture_index = 1;
+ *phas_named_captures = 0;
+ for (p = s->buf_start; p < s->buf_end; p++) {
+ switch (*p) {
+ case '(':
+ if (p[1] == '?') {
+ if (p[2] == '<' && p[3] != '=' && p[3] != '!') {
+ *phas_named_captures = 1;
+ /* potential named capture */
+ if (capture_name) {
+ p += 3;
+ if (re_parse_group_name(name, sizeof(name), &p,
+ s->is_utf16) == 0) {
+ if (!strcmp(name, capture_name))
+ return capture_index;
+ }
+ }
+ capture_index++;
+ }
+ } else {
+ capture_index++;
+ }
+ break;
+ case '\\':
+ p++;
+ break;
+ case '[':
+ for (p += 1 + (*p == ']'); p < s->buf_end && *p != ']'; p++) {
+ if (*p == '\\')
+ p++;
+ }
+ break;
+ }
+ }
+ if (capture_name)
+ return -1;
+ else
+ return capture_index;
+}
+
+static int re_count_captures(REParseState *s)
+{
+ if (s->total_capture_count < 0) {
+ s->total_capture_count = re_parse_captures(s, &s->has_named_captures,
+ NULL);
+ }
+ return s->total_capture_count;
+}
+
+static BOOL re_has_named_captures(REParseState *s)
+{
+ if (s->has_named_captures < 0)
+ re_count_captures(s);
+ return s->has_named_captures;
+}
+
+static int find_group_name(REParseState *s, const char *name)
+{
+ const char *p, *buf_end;
+ size_t len, name_len;
+ int capture_index;
+
+ name_len = strlen(name);
+ p = (char *)s->group_names.buf;
+ buf_end = (char *)s->group_names.buf + s->group_names.size;
+ capture_index = 1;
+ while (p < buf_end) {
+ len = strlen(p);
+ if (len == name_len && memcmp(name, p, name_len) == 0)
+ return capture_index;
+ p += len + 1;
+ capture_index++;
+ }
+ return -1;
+}
+
+static int re_parse_disjunction(REParseState *s, BOOL is_backward_dir);
+
+static int re_parse_term(REParseState *s, BOOL is_backward_dir)
+{
+ const uint8_t *p;
+ int c, last_atom_start, quant_min, quant_max, last_capture_count;
+ BOOL greedy, add_zero_advance_check, is_neg, is_backward_lookahead;
+ CharRange cr_s, *cr = &cr_s;
+
+ last_atom_start = -1;
+ last_capture_count = 0;
+ p = s->buf_ptr;
+ c = *p;
+ switch(c) {
+ case '^':
+ p++;
+ re_emit_op(s, REOP_line_start);
+ break;
+ case '$':
+ p++;
+ re_emit_op(s, REOP_line_end);
+ break;
+ case '.':
+ p++;
+ last_atom_start = s->byte_code.size;
+ last_capture_count = s->capture_count;
+ if (is_backward_dir)
+ re_emit_op(s, REOP_prev);
+ re_emit_op(s, s->dotall ? REOP_any : REOP_dot);
+ if (is_backward_dir)
+ re_emit_op(s, REOP_prev);
+ break;
+ case '{':
+ /* As an extension (see ES6 annex B), we accept '{' not
+ followed by digits as a normal atom */
+ if (!is_digit(p[1])) {
+ if (s->is_utf16)
+ goto invalid_quant_count;
+ goto parse_class_atom;
+ }
+ /* fall tru */
+ case '*':
+ case '+':
+ case '?':
+ return re_parse_error(s, "nothing to repeat");
+ case '(':
+ if (p[1] == '?') {
+ if (p[2] == ':') {
+ p += 3;
+ last_atom_start = s->byte_code.size;
+ last_capture_count = s->capture_count;
+ s->buf_ptr = p;
+ if (re_parse_disjunction(s, is_backward_dir))
+ return -1;
+ p = s->buf_ptr;
+ if (re_parse_expect(s, &p, ')'))
+ return -1;
+ } else if ((p[2] == '=' || p[2] == '!')) {
+ is_neg = (p[2] == '!');
+ is_backward_lookahead = FALSE;
+ p += 3;
+ goto lookahead;
+ } else if (p[2] == '<' &&
+ (p[3] == '=' || p[3] == '!')) {
+ int pos;
+ is_neg = (p[3] == '!');
+ is_backward_lookahead = TRUE;
+ p += 4;
+ /* lookahead */
+ lookahead:
+ /* Annex B allows lookahead to be used as an atom for
+ the quantifiers */
+ if (!s->is_utf16 && !is_backward_lookahead) {
+ last_atom_start = s->byte_code.size;
+ last_capture_count = s->capture_count;
+ }
+ pos = re_emit_op_u32(s, REOP_lookahead + is_neg, 0);
+ s->buf_ptr = p;
+ if (re_parse_disjunction(s, is_backward_lookahead))
+ return -1;
+ p = s->buf_ptr;
+ if (re_parse_expect(s, &p, ')'))
+ return -1;
+ re_emit_op(s, REOP_match);
+ /* jump after the 'match' after the lookahead is successful */
+ put_u32(s->byte_code.buf + pos, s->byte_code.size - (pos + 4));
+ } else if (p[2] == '<') {
+ p += 3;
+ if (re_parse_group_name(s->u.tmp_buf, sizeof(s->u.tmp_buf),
+ &p, s->is_utf16)) {
+ return re_parse_error(s, "invalid group name");
+ }
+ if (find_group_name(s, s->u.tmp_buf) > 0) {
+ return re_parse_error(s, "duplicate group name");
+ }
+ /* group name with a trailing zero */
+ dbuf_put(&s->group_names, (uint8_t *)s->u.tmp_buf,
+ strlen(s->u.tmp_buf) + 1);
+ s->has_named_captures = 1;
+ goto parse_capture;
+ } else {
+ return re_parse_error(s, "invalid group");
+ }
+ } else {
+ int capture_index;
+ p++;
+ /* capture without group name */
+ dbuf_putc(&s->group_names, 0);
+ parse_capture:
+ if (s->capture_count >= CAPTURE_COUNT_MAX)
+ return re_parse_error(s, "too many captures");
+ last_atom_start = s->byte_code.size;
+ last_capture_count = s->capture_count;
+ capture_index = s->capture_count++;
+ re_emit_op_u8(s, REOP_save_start + is_backward_dir,
+ capture_index);
+
+ s->buf_ptr = p;
+ if (re_parse_disjunction(s, is_backward_dir))
+ return -1;
+ p = s->buf_ptr;
+
+ re_emit_op_u8(s, REOP_save_start + 1 - is_backward_dir,
+ capture_index);
+
+ if (re_parse_expect(s, &p, ')'))
+ return -1;
+ }
+ break;
+ case '\\':
+ switch(p[1]) {
+ case 'b':
+ case 'B':
+ re_emit_op(s, REOP_word_boundary + (p[1] != 'b'));
+ p += 2;
+ break;
+ case 'k':
+ {
+ const uint8_t *p1;
+ int dummy_res;
+
+ p1 = p;
+ if (p1[2] != '<') {
+ /* annex B: we tolerate invalid group names in non
+ unicode mode if there is no named capture
+ definition */
+ if (s->is_utf16 || re_has_named_captures(s))
+ return re_parse_error(s, "expecting group name");
+ else
+ goto parse_class_atom;
+ }
+ p1 += 3;
+ if (re_parse_group_name(s->u.tmp_buf, sizeof(s->u.tmp_buf),
+ &p1, s->is_utf16)) {
+ if (s->is_utf16 || re_has_named_captures(s))
+ return re_parse_error(s, "invalid group name");
+ else
+ goto parse_class_atom;
+ }
+ c = find_group_name(s, s->u.tmp_buf);
+ if (c < 0) {
+ /* no capture name parsed before, try to look
+ after (inefficient, but hopefully not common */
+ c = re_parse_captures(s, &dummy_res, s->u.tmp_buf);
+ if (c < 0) {
+ if (s->is_utf16 || re_has_named_captures(s))
+ return re_parse_error(s, "group name not defined");
+ else
+ goto parse_class_atom;
+ }
+ }
+ p = p1;
+ }
+ goto emit_back_reference;
+ case '0':
+ p += 2;
+ c = 0;
+ if (s->is_utf16) {
+ if (is_digit(*p)) {
+ return re_parse_error(s, "invalid decimal escape in regular expression");
+ }
+ } else {
+ /* Annex B.1.4: accept legacy octal */
+ if (*p >= '0' && *p <= '7') {
+ c = *p++ - '0';
+ if (*p >= '0' && *p <= '7') {
+ c = (c << 3) + *p++ - '0';
+ }
+ }
+ }
+ goto normal_char;
+#if defined(_MSC_VER)
+ case '1':
+ case '2':
+ case '3':
+ case '4':
+ case '5':
+ case '6':
+ case '7':
+ case '8':
+ case '9':
+#else
+ case '1' ... '9':
+#endif
+ {
+ const uint8_t *q = ++p;
+
+ c = parse_digits(&p);
+ if (c < 0 || (c >= s->capture_count && c >= re_count_captures(s))) {
+ if (!s->is_utf16) {
+ /* Annex B.1.4: accept legacy octal */
+ p = q;
+ if (*p <= '7') {
+ c = 0;
+ if (*p <= '3')
+ c = *p++ - '0';
+ if (*p >= '0' && *p <= '7') {
+ c = (c << 3) + *p++ - '0';
+ if (*p >= '0' && *p <= '7') {
+ c = (c << 3) + *p++ - '0';
+ }
+ }
+ } else {
+ c = *p++;
+ }
+ goto normal_char;
+ }
+ return re_parse_error(s, "back reference out of range in reguar expression");
+ }
+ emit_back_reference:
+ last_atom_start = s->byte_code.size;
+ last_capture_count = s->capture_count;
+ re_emit_op_u8(s, REOP_back_reference + is_backward_dir, c);
+ }
+ break;
+ default:
+ goto parse_class_atom;
+ }
+ break;
+ case '[':
+ last_atom_start = s->byte_code.size;
+ last_capture_count = s->capture_count;
+ if (is_backward_dir)
+ re_emit_op(s, REOP_prev);
+ if (re_parse_char_class(s, &p))
+ return -1;
+ if (is_backward_dir)
+ re_emit_op(s, REOP_prev);
+ break;
+ case ']':
+ case '}':
+ if (s->is_utf16)
+ return re_parse_error(s, "syntax error");
+ goto parse_class_atom;
+ default:
+ parse_class_atom:
+ c = get_class_atom(s, cr, &p, FALSE);
+ if ((int)c < 0)
+ return -1;
+ normal_char:
+ last_atom_start = s->byte_code.size;
+ last_capture_count = s->capture_count;
+ if (is_backward_dir)
+ re_emit_op(s, REOP_prev);
+ if (c >= CLASS_RANGE_BASE) {
+ int ret;
+ /* Note: canonicalization is not needed */
+ ret = re_emit_range(s, cr);
+ cr_free(cr);
+ if (ret)
+ return -1;
+ } else {
+ if (s->ignore_case)
+ c = lre_canonicalize(c, s->is_utf16);
+ if (c <= 0xffff)
+ re_emit_op_u16(s, REOP_char, c);
+ else
+ re_emit_op_u32(s, REOP_char32, c);
+ }
+ if (is_backward_dir)
+ re_emit_op(s, REOP_prev);
+ break;
+ }
+
+ /* quantifier */
+ if (last_atom_start >= 0) {
+ c = *p;
+ switch(c) {
+ case '*':
+ p++;
+ quant_min = 0;
+ quant_max = INT32_MAX;
+ goto quantifier;
+ case '+':
+ p++;
+ quant_min = 1;
+ quant_max = INT32_MAX;
+ goto quantifier;
+ case '?':
+ p++;
+ quant_min = 0;
+ quant_max = 1;
+ goto quantifier;
+ case '{':
+ /* As an extension (see ES6 annex B), we accept '{' not
+ followed by digits as a normal atom */
+ if (!is_digit(p[1])) {
+ if (s->is_utf16)
+ goto invalid_quant_count;
+ break;
+ }
+ p++;
+ quant_min = parse_digits(&p);
+ if (quant_min < 0) {
+ invalid_quant_count:
+ return re_parse_error(s, "invalid repetition count");
+ }
+ quant_max = quant_min;
+ if (*p == ',') {
+ p++;
+ if (is_digit(*p)) {
+ quant_max = parse_digits(&p);
+ if (quant_max < 0 || quant_max < quant_min)
+ goto invalid_quant_count;
+ } else {
+ quant_max = INT32_MAX; /* infinity */
+ }
+ }
+ if (re_parse_expect(s, &p, '}'))
+ return -1;
+ quantifier:
+ greedy = TRUE;
+ if (*p == '?') {
+ p++;
+ greedy = FALSE;
+ }
+ if (last_atom_start < 0) {
+ return re_parse_error(s, "nothing to repeat");
+ }
+ if (greedy) {
+ int len, pos;
+
+ if (quant_max > 0) {
+ /* specific optimization for simple quantifiers */
+ len = re_is_simple_quantifier(s->byte_code.buf + last_atom_start,
+ s->byte_code.size - last_atom_start);
+ if (len > 0) {
+ re_emit_op(s, REOP_match);
+
+ dbuf_insert(&s->byte_code, last_atom_start, 17);
+ pos = last_atom_start;
+ s->byte_code.buf[pos++] = REOP_simple_greedy_quant;
+ put_u32(&s->byte_code.buf[pos],
+ s->byte_code.size - last_atom_start - 17);
+ pos += 4;
+ put_u32(&s->byte_code.buf[pos], quant_min);
+ pos += 4;
+ put_u32(&s->byte_code.buf[pos], quant_max);
+ pos += 4;
+ put_u32(&s->byte_code.buf[pos], len);
+ pos += 4;
+ goto done;
+ }
+ }
+
+ add_zero_advance_check = (re_check_advance(s->byte_code.buf + last_atom_start,
+ s->byte_code.size - last_atom_start) == 0);
+ } else {
+ add_zero_advance_check = FALSE;
+ }
+
+ {
+ int len, pos;
+ len = s->byte_code.size - last_atom_start;
+ if (quant_min == 0) {
+ /* need to reset the capture in case the atom is
+ not executed */
+ if (last_capture_count != s->capture_count) {
+ dbuf_insert(&s->byte_code, last_atom_start, 3);
+ s->byte_code.buf[last_atom_start++] = REOP_save_reset;
+ s->byte_code.buf[last_atom_start++] = last_capture_count;
+ s->byte_code.buf[last_atom_start++] = s->capture_count - 1;
+ }
+ if (quant_max == 0) {
+ s->byte_code.size = last_atom_start;
+ } else if (quant_max == 1) {
+ dbuf_insert(&s->byte_code, last_atom_start, 5);
+ s->byte_code.buf[last_atom_start] = REOP_split_goto_first +
+ greedy;
+ put_u32(s->byte_code.buf + last_atom_start + 1, len);
+ } else if (quant_max == INT32_MAX) {
+ dbuf_insert(&s->byte_code, last_atom_start, 5 + add_zero_advance_check);
+ s->byte_code.buf[last_atom_start] = REOP_split_goto_first +
+ greedy;
+ put_u32(s->byte_code.buf + last_atom_start + 1,
+ len + 5 + add_zero_advance_check);
+ if (add_zero_advance_check) {
+ /* avoid infinite loop by stoping the
+ recursion if no advance was made in the
+ atom (only works if the atom has no
+ side effect) */
+ s->byte_code.buf[last_atom_start + 1 + 4] = REOP_push_char_pos;
+ re_emit_goto(s, REOP_bne_char_pos, last_atom_start);
+ } else {
+ re_emit_goto(s, REOP_goto, last_atom_start);
+ }
+ } else {
+ dbuf_insert(&s->byte_code, last_atom_start, 10);
+ pos = last_atom_start;
+ s->byte_code.buf[pos++] = REOP_push_i32;
+ put_u32(s->byte_code.buf + pos, quant_max);
+ pos += 4;
+ s->byte_code.buf[pos++] = REOP_split_goto_first + greedy;
+ put_u32(s->byte_code.buf + pos, len + 5);
+ re_emit_goto(s, REOP_loop, last_atom_start + 5);
+ re_emit_op(s, REOP_drop);
+ }
+ } else if (quant_min == 1 && quant_max == INT32_MAX &&
+ !add_zero_advance_check) {
+ re_emit_goto(s, REOP_split_next_first - greedy,
+ last_atom_start);
+ } else {
+ if (quant_min == 1) {
+ /* nothing to add */
+ } else {
+ dbuf_insert(&s->byte_code, last_atom_start, 5);
+ s->byte_code.buf[last_atom_start] = REOP_push_i32;
+ put_u32(s->byte_code.buf + last_atom_start + 1,
+ quant_min);
+ last_atom_start += 5;
+ re_emit_goto(s, REOP_loop, last_atom_start);
+ re_emit_op(s, REOP_drop);
+ }
+ if (quant_max == INT32_MAX) {
+ pos = s->byte_code.size;
+ re_emit_op_u32(s, REOP_split_goto_first + greedy,
+ len + 5 + add_zero_advance_check);
+ if (add_zero_advance_check)
+ re_emit_op(s, REOP_push_char_pos);
+ /* copy the atom */
+ dbuf_put_self(&s->byte_code, last_atom_start, len);
+ if (add_zero_advance_check)
+ re_emit_goto(s, REOP_bne_char_pos, pos);
+ else
+ re_emit_goto(s, REOP_goto, pos);
+ } else if (quant_max > quant_min) {
+ re_emit_op_u32(s, REOP_push_i32, quant_max - quant_min);
+ pos = s->byte_code.size;
+ re_emit_op_u32(s, REOP_split_goto_first + greedy, len + 5);
+ /* copy the atom */
+ dbuf_put_self(&s->byte_code, last_atom_start, len);
+
+ re_emit_goto(s, REOP_loop, pos);
+ re_emit_op(s, REOP_drop);
+ }
+ }
+ last_atom_start = -1;
+ }
+ break;
+ default:
+ break;
+ }
+ }
+ done:
+ s->buf_ptr = p;
+ return 0;
+}
+
+static int re_parse_alternative(REParseState *s, BOOL is_backward_dir)
+{
+ const uint8_t *p;
+ int ret;
+ size_t start, term_start, end, term_size;
+
+ start = s->byte_code.size;
+ for(;;) {
+ p = s->buf_ptr;
+ if (p >= s->buf_end)
+ break;
+ if (*p == '|' || *p == ')')
+ break;
+ term_start = s->byte_code.size;
+ ret = re_parse_term(s, is_backward_dir);
+ if (ret)
+ return ret;
+ if (is_backward_dir) {
+ /* reverse the order of the terms (XXX: inefficient, but
+ speed is not really critical here) */
+ end = s->byte_code.size;
+ term_size = end - term_start;
+ if (dbuf_realloc(&s->byte_code, end + term_size))
+ return -1;
+ memmove(s->byte_code.buf + start + term_size,
+ s->byte_code.buf + start,
+ end - start);
+ memcpy(s->byte_code.buf + start, s->byte_code.buf + end,
+ term_size);
+ }
+ }
+ return 0;
+}
+
+static int re_parse_disjunction(REParseState *s, BOOL is_backward_dir)
+{
+ int start, len, pos;
+
+ start = s->byte_code.size;
+ if (re_parse_alternative(s, is_backward_dir))
+ return -1;
+ while (*s->buf_ptr == '|') {
+ s->buf_ptr++;
+
+ len = s->byte_code.size - start;
+
+ /* insert a split before the first alternative */
+ dbuf_insert(&s->byte_code, start, 5);
+ s->byte_code.buf[start] = REOP_split_next_first;
+ put_u32(s->byte_code.buf + start + 1, len + 5);
+
+ pos = re_emit_op_u32(s, REOP_goto, 0);
+
+ if (re_parse_alternative(s, is_backward_dir))
+ return -1;
+
+ /* patch the goto */
+ len = s->byte_code.size - (pos + 4);
+ put_u32(s->byte_code.buf + pos, len);
+ }
+ return 0;
+}
+
+/* the control flow is recursive so the analysis can be linear */
+static int compute_stack_size(const uint8_t *bc_buf, int bc_buf_len)
+{
+ int stack_size, stack_size_max, pos, opcode, len;
+ uint32_t val;
+
+ stack_size = 0;
+ stack_size_max = 0;
+ bc_buf += RE_HEADER_LEN;
+ bc_buf_len -= RE_HEADER_LEN;
+ pos = 0;
+ while (pos < bc_buf_len) {
+ opcode = bc_buf[pos];
+ len = reopcode_info[opcode].size;
+ assert(opcode < REOP_COUNT);
+ assert((pos + len) <= bc_buf_len);
+ switch(opcode) {
+ case REOP_push_i32:
+ case REOP_push_char_pos:
+ stack_size++;
+ if (stack_size > stack_size_max) {
+ if (stack_size > STACK_SIZE_MAX)
+ return -1;
+ stack_size_max = stack_size;
+ }
+ break;
+ case REOP_drop:
+ case REOP_bne_char_pos:
+ assert(stack_size > 0);
+ stack_size--;
+ break;
+ case REOP_range:
+ val = get_u16(bc_buf + pos + 1);
+ len += val * 4;
+ break;
+ case REOP_range32:
+ val = get_u16(bc_buf + pos + 1);
+ len += val * 8;
+ break;
+ }
+ pos += len;
+ }
+ return stack_size_max;
+}
+
+/* 'buf' must be a zero terminated UTF-8 string of length buf_len.
+ Return NULL if error and allocate an error message in *perror_msg,
+ otherwise the compiled bytecode and its length in plen.
+*/
+uint8_t *lre_compile(int *plen, char *error_msg, int error_msg_size,
+ const char *buf, size_t buf_len, int re_flags,
+ void *opaque)
+{
+ REParseState s_s, *s = &s_s;
+ int stack_size;
+ BOOL is_sticky;
+
+ memset(s, 0, sizeof(*s));
+ s->mem_opaque = opaque;
+ s->buf_ptr = (const uint8_t *)buf;
+ s->buf_end = s->buf_ptr + buf_len;
+ s->buf_start = s->buf_ptr;
+ s->re_flags = re_flags;
+ s->is_utf16 = ((re_flags & LRE_FLAG_UTF16) != 0);
+ is_sticky = ((re_flags & LRE_FLAG_STICKY) != 0);
+ s->ignore_case = ((re_flags & LRE_FLAG_IGNORECASE) != 0);
+ s->dotall = ((re_flags & LRE_FLAG_DOTALL) != 0);
+ s->capture_count = 1;
+ s->total_capture_count = -1;
+ s->has_named_captures = -1;
+
+ dbuf_init2(&s->byte_code, opaque, lre_realloc);
+ dbuf_init2(&s->group_names, opaque, lre_realloc);
+
+ dbuf_putc(&s->byte_code, re_flags); /* first element is the flags */
+ dbuf_putc(&s->byte_code, 0); /* second element is the number of captures */
+ dbuf_putc(&s->byte_code, 0); /* stack size */
+ dbuf_put_u32(&s->byte_code, 0); /* bytecode length */
+
+ if (!is_sticky) {
+ /* iterate thru all positions (about the same as .*?( ... ) )
+ . We do it without an explicit loop so that lock step
+ thread execution will be possible in an optimized
+ implementation */
+ re_emit_op_u32(s, REOP_split_goto_first, 1 + 5);
+ re_emit_op(s, REOP_any);
+ re_emit_op_u32(s, REOP_goto, -(5 + 1 + 5));
+ }
+ re_emit_op_u8(s, REOP_save_start, 0);
+
+ if (re_parse_disjunction(s, FALSE)) {
+ error:
+ dbuf_free(&s->byte_code);
+ dbuf_free(&s->group_names);
+ pstrcpy(error_msg, error_msg_size, s->u.error_msg);
+ *plen = 0;
+ return NULL;
+ }
+
+ re_emit_op_u8(s, REOP_save_end, 0);
+
+ re_emit_op(s, REOP_match);
+
+ if (*s->buf_ptr != '\0') {
+ re_parse_error(s, "extraneous characters at the end");
+ goto error;
+ }
+
+ if (dbuf_error(&s->byte_code)) {
+ re_parse_error(s, "out of memory");
+ goto error;
+ }
+
+ stack_size = compute_stack_size(s->byte_code.buf, s->byte_code.size);
+ if (stack_size < 0) {
+ re_parse_error(s, "too many imbricated quantifiers");
+ goto error;
+ }
+
+ s->byte_code.buf[RE_HEADER_CAPTURE_COUNT] = s->capture_count;
+ s->byte_code.buf[RE_HEADER_STACK_SIZE] = stack_size;
+ put_u32(s->byte_code.buf + 3, s->byte_code.size - RE_HEADER_LEN);
+
+ /* add the named groups if needed */
+ if (s->group_names.size > (s->capture_count - 1)) {
+ dbuf_put(&s->byte_code, s->group_names.buf, s->group_names.size);
+ s->byte_code.buf[RE_HEADER_FLAGS] |= LRE_FLAG_NAMED_GROUPS;
+ }
+ dbuf_free(&s->group_names);
+
+#ifdef DUMP_REOP
+ lre_dump_bytecode(s->byte_code.buf, s->byte_code.size);
+#endif
+
+ error_msg[0] = '\0';
+ *plen = s->byte_code.size;
+ return s->byte_code.buf;
+}
+
+static BOOL is_line_terminator(uint32_t c)
+{
+ return (c == '\n' || c == '\r' || c == CP_LS || c == CP_PS);
+}
+
+static BOOL is_word_char(uint32_t c)
+{
+ return ((c >= '0' && c <= '9') ||
+ (c >= 'a' && c <= 'z') ||
+ (c >= 'A' && c <= 'Z') ||
+ (c == '_'));
+}
+
+#define GET_CHAR(c, cptr, cbuf_end) \
+ do { \
+ if (cbuf_type == 0) { \
+ c = *cptr++; \
+ } else { \
+ uint32_t __c1; \
+ c = *(uint16_t *)cptr; \
+ cptr += 2; \
+ if (c >= 0xd800 && c < 0xdc00 && \
+ cbuf_type == 2 && cptr < cbuf_end) { \
+ __c1 = *(uint16_t *)cptr; \
+ if (__c1 >= 0xdc00 && __c1 < 0xe000) { \
+ c = (((c & 0x3ff) << 10) | (__c1 & 0x3ff)) + 0x10000; \
+ cptr += 2; \
+ } \
+ } \
+ } \
+ } while (0)
+
+#define PEEK_CHAR(c, cptr, cbuf_end) \
+ do { \
+ if (cbuf_type == 0) { \
+ c = cptr[0]; \
+ } else { \
+ uint32_t __c1; \
+ c = ((uint16_t *)cptr)[0]; \
+ if (c >= 0xd800 && c < 0xdc00 && \
+ cbuf_type == 2 && (cptr + 2) < cbuf_end) { \
+ __c1 = ((uint16_t *)cptr)[1]; \
+ if (__c1 >= 0xdc00 && __c1 < 0xe000) { \
+ c = (((c & 0x3ff) << 10) | (__c1 & 0x3ff)) + 0x10000; \
+ } \
+ } \
+ } \
+ } while (0)
+
+#define PEEK_PREV_CHAR(c, cptr, cbuf_start) \
+ do { \
+ if (cbuf_type == 0) { \
+ c = cptr[-1]; \
+ } else { \
+ uint32_t __c1; \
+ c = ((uint16_t *)cptr)[-1]; \
+ if (c >= 0xdc00 && c < 0xe000 && \
+ cbuf_type == 2 && (cptr - 4) >= cbuf_start) { \
+ __c1 = ((uint16_t *)cptr)[-2]; \
+ if (__c1 >= 0xd800 && __c1 < 0xdc00 ) { \
+ c = (((__c1 & 0x3ff) << 10) | (c & 0x3ff)) + 0x10000; \
+ } \
+ } \
+ } \
+ } while (0)
+
+#define GET_PREV_CHAR(c, cptr, cbuf_start) \
+ do { \
+ if (cbuf_type == 0) { \
+ cptr--; \
+ c = cptr[0]; \
+ } else { \
+ uint32_t __c1; \
+ cptr -= 2; \
+ c = ((uint16_t *)cptr)[0]; \
+ if (c >= 0xdc00 && c < 0xe000 && \
+ cbuf_type == 2 && cptr > cbuf_start) { \
+ __c1 = ((uint16_t *)cptr)[-1]; \
+ if (__c1 >= 0xd800 && __c1 < 0xdc00 ) { \
+ cptr -= 2; \
+ c = (((__c1 & 0x3ff) << 10) | (c & 0x3ff)) + 0x10000; \
+ } \
+ } \
+ } \
+ } while (0)
+
+#define PREV_CHAR(cptr, cbuf_start) \
+ do { \
+ if (cbuf_type == 0) { \
+ cptr--; \
+ } else { \
+ cptr -= 2; \
+ if (cbuf_type == 2) { \
+ c = ((uint16_t *)cptr)[0]; \
+ if (c >= 0xdc00 && c < 0xe000 && cptr > cbuf_start) { \
+ c = ((uint16_t *)cptr)[-1]; \
+ if (c >= 0xd800 && c < 0xdc00) \
+ cptr -= 2; \
+ } \
+ } \
+ } \
+ } while (0)
+
+typedef uintptr_t StackInt;
+
+typedef enum {
+ RE_EXEC_STATE_SPLIT,
+ RE_EXEC_STATE_LOOKAHEAD,
+ RE_EXEC_STATE_NEGATIVE_LOOKAHEAD,
+ RE_EXEC_STATE_GREEDY_QUANT,
+} REExecStateEnum;
+
+typedef struct REExecState {
+ REExecStateEnum type : 8;
+ uint8_t stack_len;
+ size_t count; /* only used for RE_EXEC_STATE_GREEDY_QUANT */
+ const uint8_t *cptr;
+ const uint8_t *pc;
+ void *buf[0];
+} REExecState;
+
+typedef struct {
+ const uint8_t *cbuf;
+ const uint8_t *cbuf_end;
+ /* 0 = 8 bit chars, 1 = 16 bit chars, 2 = 16 bit chars, UTF-16 */
+ int cbuf_type;
+ int capture_count;
+ int stack_size_max;
+ BOOL multi_line;
+ BOOL ignore_case;
+ BOOL is_utf16;
+ void *opaque; /* used for stack overflow check */
+
+ size_t state_size;
+ uint8_t *state_stack;
+ size_t state_stack_size;
+ size_t state_stack_len;
+} REExecContext;
+
+static int push_state(REExecContext *s,
+ uint8_t **capture,
+ StackInt *stack, size_t stack_len,
+ const uint8_t *pc, const uint8_t *cptr,
+ REExecStateEnum type, size_t count)
+{
+ REExecState *rs;
+ uint8_t *new_stack;
+ size_t new_size, i, n;
+ StackInt *stack_buf;
+
+ if (unlikely((s->state_stack_len + 1) > s->state_stack_size)) {
+ /* reallocate the stack */
+ new_size = s->state_stack_size * 3 / 2;
+ if (new_size < 8)
+ new_size = 8;
+ new_stack = lre_realloc(s->opaque, s->state_stack, new_size * s->state_size);
+ if (!new_stack)
+ return -1;
+ s->state_stack_size = new_size;
+ s->state_stack = new_stack;
+ }
+ rs = (REExecState *)(s->state_stack + s->state_stack_len * s->state_size);
+ s->state_stack_len++;
+ rs->type = type;
+ rs->count = count;
+ rs->stack_len = stack_len;
+ rs->cptr = cptr;
+ rs->pc = pc;
+ n = 2 * s->capture_count;
+ for(i = 0; i < n; i++)
+ rs->buf[i] = capture[i];
+ stack_buf = (StackInt *)(rs->buf + n);
+ for(i = 0; i < stack_len; i++)
+ stack_buf[i] = stack[i];
+ return 0;
+}
+
+/* return 1 if match, 0 if not match or -1 if error. */
+static intptr_t lre_exec_backtrack(REExecContext *s, uint8_t **capture,
+ StackInt *stack, int stack_len,
+ const uint8_t *pc, const uint8_t *cptr,
+ BOOL no_recurse)
+{
+ int opcode, ret;
+ int cbuf_type;
+ uint32_t val, c;
+ const uint8_t *cbuf_end;
+
+ cbuf_type = s->cbuf_type;
+ cbuf_end = s->cbuf_end;
+
+ for(;;) {
+ // printf("top=%p: pc=%d\n", th_list.top, (int)(pc - (bc_buf + RE_HEADER_LEN)));
+ opcode = *pc++;
+ switch(opcode) {
+ case REOP_match:
+ {
+ REExecState *rs;
+ if (no_recurse)
+ return (intptr_t)cptr;
+ ret = 1;
+ goto recurse;
+ no_match:
+ if (no_recurse)
+ return 0;
+ ret = 0;
+ recurse:
+ for(;;) {
+ if (s->state_stack_len == 0)
+ return ret;
+ rs = (REExecState *)(s->state_stack +
+ (s->state_stack_len - 1) * s->state_size);
+ if (rs->type == RE_EXEC_STATE_SPLIT) {
+ if (!ret) {
+ pop_state:
+ memcpy(capture, rs->buf,
+ sizeof(capture[0]) * 2 * s->capture_count);
+ pop_state1:
+ pc = rs->pc;
+ cptr = rs->cptr;
+ stack_len = rs->stack_len;
+ memcpy(stack, rs->buf + 2 * s->capture_count,
+ stack_len * sizeof(stack[0]));
+ s->state_stack_len--;
+ break;
+ }
+ } else if (rs->type == RE_EXEC_STATE_GREEDY_QUANT) {
+ if (!ret) {
+ uint32_t char_count, i;
+ memcpy(capture, rs->buf,
+ sizeof(capture[0]) * 2 * s->capture_count);
+ stack_len = rs->stack_len;
+ memcpy(stack, rs->buf + 2 * s->capture_count,
+ stack_len * sizeof(stack[0]));
+ pc = rs->pc;
+ cptr = rs->cptr;
+ /* go backward */
+ char_count = get_u32(pc + 12);
+ for(i = 0; i < char_count; i++) {
+ PREV_CHAR(cptr, s->cbuf);
+ }
+ pc = (pc + 16) + (int)get_u32(pc);
+ rs->cptr = cptr;
+ rs->count--;
+ if (rs->count == 0) {
+ s->state_stack_len--;
+ }
+ break;
+ }
+ } else {
+ ret = ((rs->type == RE_EXEC_STATE_LOOKAHEAD && ret) ||
+ (rs->type == RE_EXEC_STATE_NEGATIVE_LOOKAHEAD && !ret));
+ if (ret) {
+ /* keep the capture in case of positive lookahead */
+ if (rs->type == RE_EXEC_STATE_LOOKAHEAD)
+ goto pop_state1;
+ else
+ goto pop_state;
+ }
+ }
+ s->state_stack_len--;
+ }
+ }
+ break;
+ case REOP_char32:
+ val = get_u32(pc);
+ pc += 4;
+ goto test_char;
+ case REOP_char:
+ val = get_u16(pc);
+ pc += 2;
+ test_char:
+ if (cptr >= cbuf_end)
+ goto no_match;
+ GET_CHAR(c, cptr, cbuf_end);
+ if (s->ignore_case) {
+ c = lre_canonicalize(c, s->is_utf16);
+ }
+ if (val != c)
+ goto no_match;
+ break;
+ case REOP_split_goto_first:
+ case REOP_split_next_first:
+ {
+ const uint8_t *pc1;
+
+ val = get_u32(pc);
+ pc += 4;
+ if (opcode == REOP_split_next_first) {
+ pc1 = pc + (int)val;
+ } else {
+ pc1 = pc;
+ pc = pc + (int)val;
+ }
+ ret = push_state(s, capture, stack, stack_len,
+ pc1, cptr, RE_EXEC_STATE_SPLIT, 0);
+ if (ret < 0)
+ return -1;
+ break;
+ }
+ case REOP_lookahead:
+ case REOP_negative_lookahead:
+ val = get_u32(pc);
+ pc += 4;
+ ret = push_state(s, capture, stack, stack_len,
+ pc + (int)val, cptr,
+ RE_EXEC_STATE_LOOKAHEAD + opcode - REOP_lookahead,
+ 0);
+ if (ret < 0)
+ return -1;
+ break;
+
+ case REOP_goto:
+ val = get_u32(pc);
+ pc += 4 + (int)val;
+ break;
+ case REOP_line_start:
+ if (cptr == s->cbuf)
+ break;
+ if (!s->multi_line)
+ goto no_match;
+ PEEK_PREV_CHAR(c, cptr, s->cbuf);
+ if (!is_line_terminator(c))
+ goto no_match;
+ break;
+ case REOP_line_end:
+ if (cptr == cbuf_end)
+ break;
+ if (!s->multi_line)
+ goto no_match;
+ PEEK_CHAR(c, cptr, cbuf_end);
+ if (!is_line_terminator(c))
+ goto no_match;
+ break;
+ case REOP_dot:
+ if (cptr == cbuf_end)
+ goto no_match;
+ GET_CHAR(c, cptr, cbuf_end);
+ if (is_line_terminator(c))
+ goto no_match;
+ break;
+ case REOP_any:
+ if (cptr == cbuf_end)
+ goto no_match;
+ GET_CHAR(c, cptr, cbuf_end);
+ break;
+ case REOP_save_start:
+ case REOP_save_end:
+ val = *pc++;
+ assert(val < s->capture_count);
+ capture[2 * val + opcode - REOP_save_start] = (uint8_t *)cptr;
+ break;
+ case REOP_save_reset:
+ {
+ uint32_t val2;
+ val = pc[0];
+ val2 = pc[1];
+ pc += 2;
+ assert(val2 < s->capture_count);
+ while (val <= val2) {
+ capture[2 * val] = NULL;
+ capture[2 * val + 1] = NULL;
+ val++;
+ }
+ }
+ break;
+ case REOP_push_i32:
+ val = get_u32(pc);
+ pc += 4;
+ stack[stack_len++] = val;
+ break;
+ case REOP_drop:
+ stack_len--;
+ break;
+ case REOP_loop:
+ val = get_u32(pc);
+ pc += 4;
+ if (--stack[stack_len - 1] != 0) {
+ pc += (int)val;
+ }
+ break;
+ case REOP_push_char_pos:
+ stack[stack_len++] = (uintptr_t)cptr;
+ break;
+ case REOP_bne_char_pos:
+ val = get_u32(pc);
+ pc += 4;
+ if (stack[--stack_len] != (uintptr_t)cptr)
+ pc += (int)val;
+ break;
+ case REOP_word_boundary:
+ case REOP_not_word_boundary:
+ {
+ BOOL v1, v2;
+ /* char before */
+ if (cptr == s->cbuf) {
+ v1 = FALSE;
+ } else {
+ PEEK_PREV_CHAR(c, cptr, s->cbuf);
+ v1 = is_word_char(c);
+ }
+ /* current char */
+ if (cptr >= cbuf_end) {
+ v2 = FALSE;
+ } else {
+ PEEK_CHAR(c, cptr, cbuf_end);
+ v2 = is_word_char(c);
+ }
+ if (v1 ^ v2 ^ (REOP_not_word_boundary - opcode))
+ goto no_match;
+ }
+ break;
+ case REOP_back_reference:
+ case REOP_backward_back_reference:
+ {
+ const uint8_t *cptr1, *cptr1_end, *cptr1_start;
+ uint32_t c1, c2;
+
+ val = *pc++;
+ if (val >= s->capture_count)
+ goto no_match;
+ cptr1_start = capture[2 * val];
+ cptr1_end = capture[2 * val + 1];
+ if (!cptr1_start || !cptr1_end)
+ break;
+ if (opcode == REOP_back_reference) {
+ cptr1 = cptr1_start;
+ while (cptr1 < cptr1_end) {
+ if (cptr >= cbuf_end)
+ goto no_match;
+ GET_CHAR(c1, cptr1, cptr1_end);
+ GET_CHAR(c2, cptr, cbuf_end);
+ if (s->ignore_case) {
+ c1 = lre_canonicalize(c1, s->is_utf16);
+ c2 = lre_canonicalize(c2, s->is_utf16);
+ }
+ if (c1 != c2)
+ goto no_match;
+ }
+ } else {
+ cptr1 = cptr1_end;
+ while (cptr1 > cptr1_start) {
+ if (cptr == s->cbuf)
+ goto no_match;
+ GET_PREV_CHAR(c1, cptr1, cptr1_start);
+ GET_PREV_CHAR(c2, cptr, s->cbuf);
+ if (s->ignore_case) {
+ c1 = lre_canonicalize(c1, s->is_utf16);
+ c2 = lre_canonicalize(c2, s->is_utf16);
+ }
+ if (c1 != c2)
+ goto no_match;
+ }
+ }
+ }
+ break;
+ case REOP_range:
+ {
+ int n;
+ uint32_t low, high, idx_min, idx_max, idx;
+
+ n = get_u16(pc); /* n must be >= 1 */
+ pc += 2;
+ if (cptr >= cbuf_end)
+ goto no_match;
+ GET_CHAR(c, cptr, cbuf_end);
+ if (s->ignore_case) {
+ c = lre_canonicalize(c, s->is_utf16);
+ }
+ idx_min = 0;
+ low = get_u16(pc + 0 * 4);
+ if (c < low)
+ goto no_match;
+ idx_max = n - 1;
+ high = get_u16(pc + idx_max * 4 + 2);
+ /* 0xffff in for last value means +infinity */
+ if (unlikely(c >= 0xffff) && high == 0xffff)
+ goto range_match;
+ if (c > high)
+ goto no_match;
+ while (idx_min <= idx_max) {
+ idx = (idx_min + idx_max) / 2;
+ low = get_u16(pc + idx * 4);
+ high = get_u16(pc + idx * 4 + 2);
+ if (c < low)
+ idx_max = idx - 1;
+ else if (c > high)
+ idx_min = idx + 1;
+ else
+ goto range_match;
+ }
+ goto no_match;
+ range_match:
+ pc += 4 * n;
+ }
+ break;
+ case REOP_range32:
+ {
+ int n;
+ uint32_t low, high, idx_min, idx_max, idx;
+
+ n = get_u16(pc); /* n must be >= 1 */
+ pc += 2;
+ if (cptr >= cbuf_end)
+ goto no_match;
+ GET_CHAR(c, cptr, cbuf_end);
+ if (s->ignore_case) {
+ c = lre_canonicalize(c, s->is_utf16);
+ }
+ idx_min = 0;
+ low = get_u32(pc + 0 * 8);
+ if (c < low)
+ goto no_match;
+ idx_max = n - 1;
+ high = get_u32(pc + idx_max * 8 + 4);
+ if (c > high)
+ goto no_match;
+ while (idx_min <= idx_max) {
+ idx = (idx_min + idx_max) / 2;
+ low = get_u32(pc + idx * 8);
+ high = get_u32(pc + idx * 8 + 4);
+ if (c < low)
+ idx_max = idx - 1;
+ else if (c > high)
+ idx_min = idx + 1;
+ else
+ goto range32_match;
+ }
+ goto no_match;
+ range32_match:
+ pc += 8 * n;
+ }
+ break;
+ case REOP_prev:
+ /* go to the previous char */
+ if (cptr == s->cbuf)
+ goto no_match;
+ PREV_CHAR(cptr, s->cbuf);
+ break;
+ case REOP_simple_greedy_quant:
+ {
+ uint32_t next_pos, quant_min, quant_max;
+ size_t q;
+ intptr_t res;
+ const uint8_t *pc1;
+
+ next_pos = get_u32(pc);
+ quant_min = get_u32(pc + 4);
+ quant_max = get_u32(pc + 8);
+ pc += 16;
+ pc1 = pc;
+ pc += (int)next_pos;
+
+ q = 0;
+ for(;;) {
+ res = lre_exec_backtrack(s, capture, stack, stack_len,
+ pc1, cptr, TRUE);
+ if (res < 0)
+ return res;
+ if (!res)
+ break;
+ cptr = (uint8_t *)res;
+ q++;
+ if (q >= quant_max && quant_max != INT32_MAX)
+ break;
+ }
+ if (q < quant_min)
+ goto no_match;
+ if (q > quant_min) {
+ /* will examine all matches down to quant_min */
+ ret = push_state(s, capture, stack, stack_len,
+ pc1 - 16, cptr,
+ RE_EXEC_STATE_GREEDY_QUANT,
+ q - quant_min);
+ if (ret < 0)
+ return -1;
+ }
+ }
+ break;
+ default:
+ abort();
+ }
+ }
+}
+
+/* Return 1 if match, 0 if not match or -1 if error. cindex is the
+ starting position of the match and must be such as 0 <= cindex <=
+ clen. */
+int lre_exec(uint8_t **capture,
+ const uint8_t *bc_buf, const uint8_t *cbuf, int cindex, int clen,
+ int cbuf_type, void *opaque)
+{
+ REExecContext s_s, *s = &s_s;
+ int re_flags, i, alloca_size, ret;
+ StackInt *stack_buf;
+
+ re_flags = bc_buf[RE_HEADER_FLAGS];
+ s->multi_line = (re_flags & LRE_FLAG_MULTILINE) != 0;
+ s->ignore_case = (re_flags & LRE_FLAG_IGNORECASE) != 0;
+ s->is_utf16 = (re_flags & LRE_FLAG_UTF16) != 0;
+ s->capture_count = bc_buf[RE_HEADER_CAPTURE_COUNT];
+ s->stack_size_max = bc_buf[RE_HEADER_STACK_SIZE];
+ s->cbuf = cbuf;
+ s->cbuf_end = cbuf + (clen << cbuf_type);
+ s->cbuf_type = cbuf_type;
+ if (s->cbuf_type == 1 && s->is_utf16)
+ s->cbuf_type = 2;
+ s->opaque = opaque;
+
+ s->state_size = sizeof(REExecState) +
+ s->capture_count * sizeof(capture[0]) * 2 +
+ s->stack_size_max * sizeof(stack_buf[0]);
+ s->state_stack = NULL;
+ s->state_stack_len = 0;
+ s->state_stack_size = 0;
+
+ for(i = 0; i < s->capture_count * 2; i++)
+ capture[i] = NULL;
+ alloca_size = s->stack_size_max * sizeof(stack_buf[0]);
+ stack_buf = alloca(alloca_size);
+ ret = lre_exec_backtrack(s, capture, stack_buf, 0, bc_buf + RE_HEADER_LEN,
+ cbuf + (cindex << cbuf_type), FALSE);
+ lre_realloc(s->opaque, s->state_stack, 0);
+ return ret;
+}
+
+int lre_get_capture_count(const uint8_t *bc_buf)
+{
+ return bc_buf[RE_HEADER_CAPTURE_COUNT];
+}
+
+int lre_get_flags(const uint8_t *bc_buf)
+{
+ return bc_buf[RE_HEADER_FLAGS];
+}
+
+#ifdef TEST
+
+BOOL lre_check_stack_overflow(void *opaque, size_t alloca_size)
+{
+ return FALSE;
+}
+
+void *lre_realloc(void *opaque, void *ptr, size_t size)
+{
+ return realloc(ptr, size);
+}
+
+int main(int argc, char **argv)
+{
+ int len, ret, i;
+ uint8_t *bc;
+ char error_msg[64];
+ uint8_t *capture[CAPTURE_COUNT_MAX * 2];
+ const char *input;
+ int input_len, capture_count;
+
+ if (argc < 3) {
+ printf("usage: %s regexp input\n", argv[0]);
+ exit(1);
+ }
+ bc = lre_compile(&len, error_msg, sizeof(error_msg), argv[1], 0, 0, NULL);
+ if (!bc) {
+ fprintf(stderr, "error: %s\n", error_msg);
+ exit(1);
+ }
+
+ input = argv[2];
+ input_len = strlen(input);
+
+ ret = lre_exec(capture, bc, (uint8_t *)input, 0, input_len, 0, NULL);
+ printf("ret=%d\n", ret);
+ if (ret == 1) {
+ capture_count = lre_get_capture_count(bc);
+ for(i = 0; i < 2 * capture_count; i++) {
+ uint8_t *ptr;
+ ptr = capture[i];
+ printf("%d: ", i);
+ if (!ptr)
+ printf("");
+ else
+ printf("%u", (int)(ptr - (uint8_t *)input));
+ printf("\n");
+ }
+ }
+ return 0;
+}
+#endif
diff --git a/thirdparty/quickjs/quickjs-2019-07-09-dust3d/libregexp.h b/thirdparty/quickjs/quickjs-2019-07-09-dust3d/libregexp.h
new file mode 100755
index 00000000..cd0b24f2
--- /dev/null
+++ b/thirdparty/quickjs/quickjs-2019-07-09-dust3d/libregexp.h
@@ -0,0 +1,91 @@
+/*
+ * Regular Expression Engine
+ *
+ * Copyright (c) 2017-2018 Fabrice Bellard
+ *
+ * Permission is hereby granted, free of charge, to any person obtaining a copy
+ * of this software and associated documentation files (the "Software"), to deal
+ * in the Software without restriction, including without limitation the rights
+ * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+ * copies of the Software, and to permit persons to whom the Software is
+ * furnished to do so, subject to the following conditions:
+ *
+ * The above copyright notice and this permission notice shall be included in
+ * all copies or substantial portions of the Software.
+ *
+ * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+ * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+ * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
+ * THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+ * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+ * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
+ * THE SOFTWARE.
+ */
+#ifndef LIBREGEXP_H
+#define LIBREGEXP_H
+
+#include
+
+#include "libunicode.h"
+
+#define LRE_BOOL int /* for documentation purposes */
+
+#define LRE_FLAG_GLOBAL (1 << 0)
+#define LRE_FLAG_IGNORECASE (1 << 1)
+#define LRE_FLAG_MULTILINE (1 << 2)
+#define LRE_FLAG_DOTALL (1 << 3)
+#define LRE_FLAG_UTF16 (1 << 4)
+#define LRE_FLAG_STICKY (1 << 5)
+
+#define LRE_FLAG_NAMED_GROUPS (1 << 7) /* named groups are present in the regexp */
+
+uint8_t *lre_compile(int *plen, char *error_msg, int error_msg_size,
+ const char *buf, size_t buf_len, int re_flags,
+ void *opaque);
+int lre_get_capture_count(const uint8_t *bc_buf);
+int lre_get_flags(const uint8_t *bc_buf);
+int lre_exec(uint8_t **capture,
+ const uint8_t *bc_buf, const uint8_t *cbuf, int cindex, int clen,
+ int cbuf_type, void *opaque);
+
+int lre_parse_escape(const uint8_t **pp, int allow_utf16);
+LRE_BOOL lre_is_space(int c);
+
+/* must be provided by the user */
+LRE_BOOL lre_check_stack_overflow(void *opaque, size_t alloca_size);
+void *lre_realloc(void *opaque, void *ptr, size_t size);
+
+/* JS identifier test */
+extern uint32_t const lre_id_start_table_ascii[4];
+extern uint32_t const lre_id_continue_table_ascii[4];
+
+static inline int lre_js_is_ident_first(int c)
+{
+ if ((uint32_t)c < 128) {
+ return (lre_id_start_table_ascii[c >> 5] >> (c & 31)) & 1;
+ } else {
+#ifdef CONFIG_ALL_UNICODE
+ return lre_is_id_start(c);
+#else
+ return !lre_is_space(c);
+#endif
+ }
+}
+
+static inline int lre_js_is_ident_next(int c)
+{
+ if ((uint32_t)c < 128) {
+ return (lre_id_continue_table_ascii[c >> 5] >> (c & 31)) & 1;
+ } else {
+ /* ZWNJ and ZWJ are accepted in identifiers */
+#ifdef CONFIG_ALL_UNICODE
+ return lre_is_id_continue(c) || c == 0x200C || c == 0x200D;
+#else
+ return !lre_is_space(c) || c == 0x200C || c == 0x200D;
+#endif
+ }
+}
+
+#undef LRE_BOOL
+
+#endif /* LIBREGEXP_H */
diff --git a/thirdparty/quickjs/quickjs-2019-07-09-dust3d/libunicode-table.h b/thirdparty/quickjs/quickjs-2019-07-09-dust3d/libunicode-table.h
new file mode 100755
index 00000000..76ec87c4
--- /dev/null
+++ b/thirdparty/quickjs/quickjs-2019-07-09-dust3d/libunicode-table.h
@@ -0,0 +1,4269 @@
+/* Compressed unicode tables */
+/* Automatically generated file - do not edit */
+
+#include
+
+static const uint32_t case_conv_table1[352] = {
+ 0x00209a30, 0x00309a00, 0x005a8173, 0x00601730,
+ 0x006c0730, 0x006f81b3, 0x00701700, 0x007c0700,
+ 0x007f8100, 0x00803040, 0x009801c3, 0x00988190,
+ 0x00990640, 0x009c9040, 0x00a481b4, 0x00a52e40,
+ 0x00bc0130, 0x00bc8640, 0x00bf8170, 0x00c00100,
+ 0x00c08130, 0x00c10440, 0x00c30130, 0x00c38240,
+ 0x00c48230, 0x00c58240, 0x00c70130, 0x00c78130,
+ 0x00c80130, 0x00c88240, 0x00c98130, 0x00ca0130,
+ 0x00ca8100, 0x00cb0130, 0x00cb8130, 0x00cc0240,
+ 0x00cd0100, 0x00ce0130, 0x00ce8130, 0x00cf0100,
+ 0x00cf8130, 0x00d00640, 0x00d30130, 0x00d38240,
+ 0x00d48130, 0x00d60240, 0x00d70130, 0x00d78240,
+ 0x00d88230, 0x00d98440, 0x00db8130, 0x00dc0240,
+ 0x00de0240, 0x00df8100, 0x00e20350, 0x00e38350,
+ 0x00e50350, 0x00e69040, 0x00ee8100, 0x00ef1240,
+ 0x00f801b4, 0x00f88350, 0x00fa0240, 0x00fb0130,
+ 0x00fb8130, 0x00fc2840, 0x01100130, 0x01111240,
+ 0x011d0131, 0x011d8240, 0x011e8130, 0x011f0131,
+ 0x011f8201, 0x01208240, 0x01218130, 0x01220130,
+ 0x01228130, 0x01230a40, 0x01280101, 0x01288101,
+ 0x01290101, 0x01298100, 0x012a0100, 0x012b0200,
+ 0x012c8100, 0x012d8100, 0x012e0101, 0x01300100,
+ 0x01308101, 0x01318100, 0x01328101, 0x01330101,
+ 0x01340100, 0x01348100, 0x01350101, 0x01358101,
+ 0x01360101, 0x01378100, 0x01388101, 0x01390100,
+ 0x013a8100, 0x013e8101, 0x01400100, 0x01418100,
+ 0x01438101, 0x01440100, 0x01448100, 0x01450200,
+ 0x01460100, 0x01490100, 0x014e8101, 0x014f0101,
+ 0x01a28173, 0x01b80440, 0x01bb0240, 0x01bd8300,
+ 0x01bf8130, 0x01c30130, 0x01c40330, 0x01c60130,
+ 0x01c70230, 0x01c801d0, 0x01c89130, 0x01d18930,
+ 0x01d60100, 0x01d68300, 0x01d801d3, 0x01d89100,
+ 0x01e10173, 0x01e18900, 0x01e60100, 0x01e68200,
+ 0x01e78130, 0x01e80173, 0x01e88173, 0x01ea8173,
+ 0x01eb0173, 0x01eb8100, 0x01ec1840, 0x01f80173,
+ 0x01f88173, 0x01f90100, 0x01f98100, 0x01fa01a0,
+ 0x01fa8173, 0x01fb8240, 0x01fc8130, 0x01fd0240,
+ 0x01fe8330, 0x02001030, 0x02082030, 0x02182000,
+ 0x02281000, 0x02302240, 0x02453640, 0x02600130,
+ 0x02608e40, 0x02678100, 0x02686040, 0x0298a630,
+ 0x02b0a600, 0x02c381b5, 0x08502631, 0x08638131,
+ 0x08668131, 0x08682b00, 0x087e8300, 0x09d05011,
+ 0x09f80610, 0x09fc0620, 0x0e400174, 0x0e408174,
+ 0x0e410174, 0x0e418174, 0x0e420174, 0x0e428174,
+ 0x0e430174, 0x0e438180, 0x0e440180, 0x0e482b30,
+ 0x0e5e8330, 0x0ebc8101, 0x0ebe8101, 0x0f007e40,
+ 0x0f3f1840, 0x0f4b01b5, 0x0f4b81b6, 0x0f4c01b6,
+ 0x0f4c81b6, 0x0f4d01b7, 0x0f4d8180, 0x0f4f0130,
+ 0x0f506040, 0x0f800800, 0x0f840830, 0x0f880600,
+ 0x0f8c0630, 0x0f900800, 0x0f940830, 0x0f980800,
+ 0x0f9c0830, 0x0fa00600, 0x0fa40630, 0x0fa801b0,
+ 0x0fa88100, 0x0fa901d3, 0x0fa98100, 0x0faa01d3,
+ 0x0faa8100, 0x0fab01d3, 0x0fab8100, 0x0fac8130,
+ 0x0fad8130, 0x0fae8130, 0x0faf8130, 0x0fb00800,
+ 0x0fb40830, 0x0fb80200, 0x0fb90400, 0x0fbb0200,
+ 0x0fbc0201, 0x0fbd0201, 0x0fbe0201, 0x0fc008b7,
+ 0x0fc40867, 0x0fc808b8, 0x0fcc0868, 0x0fd008b8,
+ 0x0fd40868, 0x0fd80200, 0x0fd901b9, 0x0fd981b1,
+ 0x0fda01b9, 0x0fdb01b1, 0x0fdb81d7, 0x0fdc0230,
+ 0x0fdd0230, 0x0fde0161, 0x0fdf0173, 0x0fe101b9,
+ 0x0fe181b2, 0x0fe201ba, 0x0fe301b2, 0x0fe381d8,
+ 0x0fe40430, 0x0fe60162, 0x0fe80200, 0x0fe901d0,
+ 0x0fe981d0, 0x0feb01b0, 0x0feb81d0, 0x0fec0230,
+ 0x0fed0230, 0x0ff00201, 0x0ff101d3, 0x0ff181d3,
+ 0x0ff201ba, 0x0ff28101, 0x0ff301b0, 0x0ff381d3,
+ 0x0ff40230, 0x0ff50230, 0x0ff60131, 0x0ff901ba,
+ 0x0ff981b2, 0x0ffa01bb, 0x0ffb01b2, 0x0ffb81d9,
+ 0x0ffc0230, 0x0ffd0230, 0x0ffe0162, 0x109301a0,
+ 0x109501a0, 0x109581a0, 0x10990131, 0x10a70101,
+ 0x10b01031, 0x10b81001, 0x10c18240, 0x125b1a31,
+ 0x12681a01, 0x16002f31, 0x16182f01, 0x16300240,
+ 0x16310130, 0x16318130, 0x16320130, 0x16328100,
+ 0x16330100, 0x16338640, 0x16368130, 0x16370130,
+ 0x16378130, 0x16380130, 0x16390240, 0x163a8240,
+ 0x163f0230, 0x16406440, 0x16758440, 0x16790240,
+ 0x16802600, 0x16938100, 0x16968100, 0x53202e40,
+ 0x53401c40, 0x53910e40, 0x53993e40, 0x53bc8440,
+ 0x53be8130, 0x53bf0a40, 0x53c58240, 0x53c68130,
+ 0x53c80440, 0x53cb1440, 0x53d50130, 0x53d58130,
+ 0x53d60130, 0x53d68130, 0x53d70130, 0x53d80130,
+ 0x53d88130, 0x53d90130, 0x53d98131, 0x53da0640,
+ 0x55a98101, 0x55b85020, 0x7d8001b2, 0x7d8081b2,
+ 0x7d8101b2, 0x7d8181da, 0x7d8201da, 0x7d8281b3,
+ 0x7d8301b3, 0x7d8981bb, 0x7d8a01bb, 0x7d8a81bb,
+ 0x7d8b01bc, 0x7d8b81bb, 0x7f909a31, 0x7fa09a01,
+ 0x82002831, 0x82142801, 0x82582431, 0x826c2401,
+ 0x86403331, 0x86603301, 0x8c502031, 0x8c602001,
+ 0xb7202031, 0xb7302001, 0xf4802231, 0xf4912201,
+};
+
+static const uint8_t case_conv_table2[352] = {
+ 0x01, 0x00, 0x9c, 0x06, 0x07, 0x4d, 0x03, 0x04,
+ 0x10, 0x00, 0x8f, 0x0b, 0x00, 0x00, 0x11, 0x00,
+ 0x08, 0x00, 0x53, 0x4a, 0x51, 0x00, 0x52, 0x00,
+ 0x53, 0x00, 0x3a, 0x54, 0x55, 0x00, 0x57, 0x59,
+ 0x3f, 0x5d, 0x5c, 0x00, 0x46, 0x61, 0x63, 0x42,
+ 0x64, 0x00, 0x66, 0x00, 0x67, 0x00, 0x69, 0x00,
+ 0x6b, 0x00, 0x6d, 0x00, 0x00, 0x40, 0x00, 0x00,
+ 0x00, 0x00, 0x1a, 0x00, 0x93, 0x00, 0x00, 0x20,
+ 0x35, 0x00, 0x27, 0x00, 0x1f, 0x00, 0x24, 0x20,
+ 0x28, 0x00, 0x13, 0x6a, 0x6c, 0x00, 0x24, 0x22,
+ 0x25, 0x14, 0x16, 0x18, 0x1b, 0x1c, 0x3b, 0x1e,
+ 0x3c, 0x1f, 0x37, 0x3a, 0x22, 0x21, 0x3e, 0x1c,
+ 0x3d, 0x25, 0x23, 0x26, 0x28, 0x1e, 0x2a, 0x2c,
+ 0x40, 0x2e, 0x4b, 0x30, 0x4c, 0x32, 0x41, 0x3f,
+ 0x99, 0x00, 0x00, 0x94, 0x8e, 0x7c, 0x7d, 0x82,
+ 0x83, 0x12, 0x7f, 0x81, 0x75, 0x76, 0x12, 0x7a,
+ 0xa3, 0x7b, 0x77, 0x78, 0x89, 0x92, 0x98, 0xa6,
+ 0xa0, 0x84, 0x00, 0x9a, 0xa1, 0x92, 0x74, 0x33,
+ 0x95, 0x00, 0x8d, 0x00, 0x73, 0x98, 0x97, 0x96,
+ 0x95, 0x00, 0x00, 0x9d, 0x00, 0x9b, 0x00, 0xa0,
+ 0x9f, 0x15, 0x2c, 0x2d, 0x2e, 0xb3, 0xb4, 0x45,
+ 0xa9, 0xa8, 0x12, 0x14, 0x1e, 0x21, 0x22, 0x22,
+ 0x2a, 0x34, 0x35, 0xa5, 0xa6, 0x34, 0x1d, 0x00,
+ 0x00, 0x97, 0x01, 0x5a, 0xda, 0x1d, 0x36, 0x05,
+ 0x00, 0xc2, 0xc1, 0xc4, 0xc3, 0xc6, 0xc5, 0xc8,
+ 0xc7, 0xca, 0xc9, 0xc4, 0xd3, 0x45, 0xd4, 0x42,
+ 0xd5, 0x46, 0xd6, 0xcc, 0xce, 0xd0, 0xd2, 0xd8,
+ 0xd7, 0xec, 0xf4, 0xfc, 0x0c, 0x05, 0x0d, 0x80,
+ 0x9f, 0x00, 0x21, 0x80, 0xa3, 0xeb, 0x00, 0xc0,
+ 0x40, 0xc6, 0x60, 0xe5, 0xd9, 0xe6, 0x99, 0xc0,
+ 0x00, 0x00, 0x06, 0x60, 0xda, 0x29, 0xfb, 0x15,
+ 0x12, 0x06, 0x16, 0xf6, 0xdb, 0x04, 0x15, 0x12,
+ 0x84, 0x06, 0xc6, 0x16, 0xfd, 0xdd, 0x01, 0xc0,
+ 0x40, 0x00, 0x46, 0x60, 0xdc, 0xde, 0x6d, 0x37,
+ 0x38, 0x39, 0x13, 0x12, 0x15, 0x14, 0x00, 0x18,
+ 0x17, 0x1a, 0x19, 0x00, 0x5f, 0xb6, 0x65, 0x44,
+ 0x47, 0x00, 0x4f, 0x62, 0x4e, 0x50, 0x00, 0x00,
+ 0x48, 0x00, 0x00, 0x00, 0xa2, 0xa3, 0xa4, 0x00,
+ 0x00, 0x00, 0x00, 0x00, 0xb5, 0x00, 0x00, 0x5a,
+ 0x00, 0x00, 0x5b, 0x56, 0x58, 0x60, 0x5e, 0x6f,
+ 0x68, 0x6e, 0x44, 0x00, 0x42, 0xa7, 0x8a, 0x8b,
+ 0x8c, 0xab, 0xac, 0x58, 0x58, 0xaf, 0x94, 0xb0,
+ 0x6f, 0xb2, 0x53, 0x52, 0x55, 0x54, 0x57, 0x56,
+ 0x59, 0x58, 0x5b, 0x5a, 0x5d, 0x5c, 0x5f, 0x5e,
+};
+
+static const uint16_t case_conv_ext[58] = {
+ 0x0399, 0x0308, 0x0301, 0x03a5, 0x0313, 0x0300, 0x0342, 0x0391,
+ 0x0397, 0x03a9, 0x0046, 0x0049, 0x004c, 0x0053, 0x0069, 0x0307,
+ 0x02bc, 0x004e, 0x004a, 0x030c, 0x0535, 0x0552, 0x0048, 0x0331,
+ 0x0054, 0x0057, 0x030a, 0x0059, 0x0041, 0x02be, 0x1f08, 0x1f80,
+ 0x1f28, 0x1f90, 0x1f68, 0x1fa0, 0x1fba, 0x0386, 0x1fb3, 0x1fca,
+ 0x0389, 0x1fc3, 0x03a1, 0x1ffa, 0x038f, 0x1ff3, 0x0544, 0x0546,
+ 0x053b, 0x054e, 0x053d, 0x03b8, 0x0462, 0xa64a, 0x1e60, 0x03c9,
+ 0x006b, 0x00e5,
+};
+
+static const uint8_t unicode_prop_Cased1_table[170] = {
+ 0x40, 0xa9, 0x80, 0x8e, 0x80, 0xfc, 0x80, 0xd3,
+ 0x80, 0x8c, 0x80, 0x8d, 0x81, 0x8d, 0x02, 0x80,
+ 0xe1, 0x80, 0x91, 0x85, 0x9a, 0x01, 0x00, 0x01,
+ 0x11, 0x00, 0x01, 0x04, 0x08, 0x01, 0x08, 0x30,
+ 0x08, 0x08, 0x15, 0x20, 0x00, 0x39, 0x99, 0x31,
+ 0x9d, 0x84, 0x40, 0x94, 0x80, 0xd6, 0x82, 0xa6,
+ 0x80, 0x41, 0x62, 0x80, 0xa6, 0x80, 0x57, 0x76,
+ 0xf8, 0x02, 0x80, 0xc1, 0x40, 0xdb, 0x08, 0x80,
+ 0x41, 0xd0, 0x80, 0x8c, 0x80, 0x8f, 0x8c, 0xe4,
+ 0x03, 0x01, 0x89, 0x00, 0x14, 0x28, 0x10, 0x11,
+ 0x02, 0x01, 0x18, 0x0b, 0x24, 0x4b, 0x26, 0x01,
+ 0x01, 0x86, 0xe5, 0x80, 0x60, 0x79, 0xb6, 0x81,
+ 0x40, 0x91, 0x81, 0xbd, 0x88, 0x94, 0x04, 0x81,
+ 0x98, 0x80, 0xc7, 0x82, 0x43, 0x34, 0xa2, 0x06,
+ 0x80, 0x89, 0x61, 0x28, 0x99, 0xd4, 0x80, 0xc6,
+ 0x01, 0x08, 0x09, 0x0b, 0x80, 0x8b, 0x00, 0x06,
+ 0x80, 0xc0, 0x03, 0x0f, 0x06, 0x80, 0x9b, 0x03,
+ 0x04, 0x00, 0x16, 0x80, 0x41, 0x53, 0x81, 0x98,
+ 0x80, 0x98, 0x80, 0x9e, 0x80, 0x98, 0x80, 0x9e,
+ 0x80, 0x98, 0x80, 0x9e, 0x80, 0x98, 0x80, 0x9e,
+ 0x80, 0x98, 0x07, 0x59, 0x63, 0x99, 0x85, 0x99,
+ 0x85, 0x99,
+};
+
+static const uint8_t unicode_prop_Cased1_index[18] = {
+ 0xb9, 0x02, 0xe0, 0xa0, 0x1e, 0x00, 0x9e, 0xa6,
+ 0x00, 0xc4, 0xd4, 0x01, 0xa9, 0xd7, 0x01, 0x8a,
+ 0xf1, 0x01,
+};
+
+static const uint8_t unicode_prop_Case_Ignorable_table[663] = {
+ 0xa6, 0x05, 0x80, 0x8a, 0x80, 0xa2, 0x00, 0x80,
+ 0xc6, 0x03, 0x00, 0x03, 0x01, 0x81, 0x41, 0xf6,
+ 0x40, 0xbf, 0x19, 0x18, 0x88, 0x08, 0x80, 0x40,
+ 0xfa, 0x86, 0x40, 0xce, 0x80, 0xb6, 0xac, 0x00,
+ 0x01, 0x01, 0x00, 0xab, 0x80, 0x8a, 0x85, 0x89,
+ 0x8a, 0x00, 0xa2, 0x80, 0x89, 0x94, 0x8f, 0x80,
+ 0xe4, 0x38, 0x89, 0x03, 0xa0, 0x00, 0x80, 0x9d,
+ 0x9a, 0xda, 0x8a, 0xb9, 0x8a, 0x18, 0x08, 0x97,
+ 0x97, 0xaa, 0x82, 0xf6, 0xaf, 0xb6, 0x00, 0x03,
+ 0x3b, 0x02, 0x86, 0x89, 0x81, 0x8c, 0x80, 0x8e,
+ 0x80, 0xb9, 0x03, 0x1f, 0x80, 0x93, 0x81, 0x99,
+ 0x01, 0x81, 0xb8, 0x03, 0x0b, 0x09, 0x12, 0x80,
+ 0x9d, 0x0a, 0x80, 0x8a, 0x81, 0xb8, 0x03, 0x20,
+ 0x0b, 0x80, 0x93, 0x81, 0x95, 0x28, 0x80, 0xb9,
+ 0x01, 0x00, 0x1f, 0x07, 0x80, 0x8a, 0x81, 0x9d,
+ 0x80, 0xbc, 0x80, 0x8b, 0x80, 0xb1, 0x02, 0x80,
+ 0xb8, 0x14, 0x10, 0x1e, 0x81, 0x8a, 0x81, 0x9c,
+ 0x80, 0xb9, 0x01, 0x05, 0x04, 0x81, 0x93, 0x81,
+ 0x9b, 0x81, 0xb8, 0x0b, 0x1f, 0x80, 0x93, 0x81,
+ 0xe5, 0x06, 0x10, 0x80, 0xd9, 0x01, 0x86, 0x8a,
+ 0x88, 0xe1, 0x01, 0x28, 0x81, 0x88, 0x00, 0x85,
+ 0xc9, 0x81, 0x9a, 0x00, 0x00, 0x80, 0xb6, 0x8d,
+ 0x04, 0x01, 0x84, 0x8a, 0x80, 0xa3, 0x88, 0x80,
+ 0xe5, 0x18, 0x28, 0x09, 0x81, 0x98, 0x0b, 0x82,
+ 0x8f, 0x83, 0x8c, 0x01, 0x0d, 0x80, 0x8e, 0x80,
+ 0xdd, 0x80, 0x42, 0x5f, 0x82, 0x43, 0xb1, 0x82,
+ 0x9c, 0x82, 0x9c, 0x81, 0x9d, 0x81, 0xbf, 0x08,
+ 0x37, 0x01, 0x8a, 0x10, 0x20, 0xac, 0x83, 0xb3,
+ 0x80, 0xc0, 0x81, 0xa1, 0x80, 0xf5, 0x13, 0x81,
+ 0x88, 0x05, 0x82, 0x40, 0xda, 0x09, 0x80, 0xb9,
+ 0x00, 0x30, 0x00, 0x01, 0x3d, 0x89, 0x08, 0xa6,
+ 0x07, 0x8e, 0xc0, 0x83, 0xaf, 0x00, 0x20, 0x04,
+ 0x80, 0xa7, 0x88, 0x8b, 0x81, 0x9f, 0x19, 0x08,
+ 0x82, 0xb7, 0x00, 0x0a, 0x00, 0x82, 0xb9, 0x39,
+ 0x81, 0xbf, 0x85, 0xd1, 0x10, 0x8c, 0x06, 0x18,
+ 0x28, 0x11, 0xb1, 0xbe, 0x8c, 0x80, 0xa1, 0xde,
+ 0x04, 0x41, 0xbc, 0x00, 0x82, 0x8a, 0x82, 0x8c,
+ 0x82, 0x8c, 0x82, 0x8c, 0x81, 0x8b, 0x27, 0x81,
+ 0x89, 0x01, 0x01, 0x84, 0xb0, 0x20, 0x89, 0x00,
+ 0x8c, 0x80, 0x8f, 0x8c, 0xb2, 0xa0, 0x4b, 0x8a,
+ 0x81, 0xf0, 0x82, 0xfc, 0x80, 0x8e, 0x80, 0xdf,
+ 0x9f, 0xae, 0x80, 0x41, 0xd4, 0x80, 0xa3, 0x1a,
+ 0x24, 0x80, 0xdc, 0x85, 0xdc, 0x82, 0x60, 0x6f,
+ 0x15, 0x80, 0x44, 0xe1, 0x85, 0x41, 0x0d, 0x80,
+ 0xe1, 0x18, 0x89, 0x00, 0x9b, 0x83, 0xcf, 0x81,
+ 0x8d, 0xa1, 0xcd, 0x80, 0x96, 0x82, 0xec, 0x0f,
+ 0x02, 0x03, 0x80, 0x98, 0x81, 0x40, 0x9c, 0x81,
+ 0x99, 0x91, 0x8c, 0x80, 0xa5, 0x87, 0x98, 0x8a,
+ 0xad, 0x82, 0xaf, 0x01, 0x19, 0x80, 0x91, 0x80,
+ 0x94, 0x81, 0xc1, 0x29, 0x09, 0x81, 0x8b, 0x07,
+ 0x80, 0xa2, 0x80, 0x8a, 0x80, 0xb2, 0x00, 0x11,
+ 0x0c, 0x08, 0x80, 0x9a, 0x80, 0x8d, 0x0c, 0x08,
+ 0x80, 0xe3, 0x84, 0x40, 0x84, 0x01, 0x03, 0x80,
+ 0x60, 0x4f, 0x2f, 0x80, 0x40, 0x92, 0x8f, 0x42,
+ 0x3d, 0x8f, 0x10, 0x8b, 0x8f, 0xa1, 0x01, 0x80,
+ 0x40, 0xa8, 0x06, 0x05, 0x80, 0x8a, 0x80, 0xa2,
+ 0x00, 0x80, 0xae, 0x80, 0xac, 0x81, 0xc2, 0x80,
+ 0x94, 0x82, 0x42, 0x00, 0x80, 0x40, 0xe1, 0x80,
+ 0x40, 0x94, 0x84, 0x46, 0x85, 0x10, 0x0c, 0x83,
+ 0xa7, 0x13, 0x80, 0x40, 0xa4, 0x81, 0x42, 0x3c,
+ 0x83, 0x42, 0x1d, 0x8a, 0x40, 0xaf, 0x80, 0xb5,
+ 0x8e, 0xb7, 0x82, 0xb0, 0x19, 0x09, 0x80, 0x8e,
+ 0x80, 0xb1, 0x82, 0xa3, 0x20, 0x87, 0xbd, 0x80,
+ 0x8b, 0x81, 0xb3, 0x88, 0x89, 0x83, 0xe1, 0x11,
+ 0x00, 0x0d, 0x80, 0x40, 0x9f, 0x02, 0x87, 0x94,
+ 0x81, 0xb8, 0x0a, 0x80, 0xa4, 0x32, 0x84, 0x40,
+ 0xc2, 0x39, 0x10, 0x80, 0x96, 0x80, 0xd3, 0x28,
+ 0x03, 0x08, 0x81, 0x40, 0xed, 0x1d, 0x08, 0x81,
+ 0x9a, 0x81, 0xd4, 0x39, 0x00, 0x81, 0xe9, 0x00,
+ 0x01, 0x28, 0x80, 0xe4, 0x11, 0x18, 0x84, 0x41,
+ 0x02, 0x88, 0x01, 0x41, 0xc5, 0x89, 0xa7, 0x29,
+ 0x1f, 0x80, 0x88, 0x29, 0x82, 0xad, 0x8c, 0x01,
+ 0x41, 0x95, 0x30, 0x28, 0x80, 0xd1, 0x95, 0x0e,
+ 0x01, 0x01, 0xf9, 0x2a, 0x00, 0x08, 0x30, 0x80,
+ 0xc7, 0x0a, 0x00, 0x80, 0x41, 0x5a, 0x81, 0x60,
+ 0x4b, 0xfa, 0x84, 0xba, 0x86, 0x88, 0x83, 0x44,
+ 0x4a, 0x90, 0xbf, 0x81, 0x60, 0x4c, 0xba, 0x08,
+ 0x83, 0x54, 0xc2, 0x82, 0x88, 0x8f, 0x0e, 0x9d,
+ 0x83, 0x40, 0x93, 0x82, 0x47, 0xba, 0xb6, 0x83,
+ 0xb1, 0x38, 0x8d, 0x80, 0x95, 0x20, 0x8e, 0x45,
+ 0x4f, 0x30, 0x90, 0x0e, 0x01, 0x04, 0x48, 0xa4,
+ 0x86, 0xec, 0x86, 0x4a, 0xaf, 0x84, 0x6c, 0x0c,
+ 0x00, 0x80, 0x9d, 0xdf, 0xff, 0x40, 0xef,
+};
+
+static const uint8_t unicode_prop_Case_Ignorable_index[63] = {
+ 0xc0, 0x05, 0x00, 0x2e, 0x08, 0x20, 0x52, 0x0a,
+ 0x00, 0x05, 0x0c, 0x00, 0x4f, 0x0e, 0x20, 0x61,
+ 0x10, 0x00, 0x44, 0x18, 0x20, 0x43, 0x1b, 0x20,
+ 0xfa, 0x1d, 0x00, 0x7e, 0x2c, 0x20, 0x0d, 0xa6,
+ 0x00, 0x52, 0xa9, 0x00, 0xf7, 0xaa, 0x20, 0x41,
+ 0xff, 0x40, 0x28, 0x0d, 0x21, 0x3f, 0x12, 0x61,
+ 0xc1, 0x15, 0x01, 0x9a, 0x1a, 0x01, 0xa0, 0x6f,
+ 0x41, 0x19, 0xe0, 0x61, 0xf0, 0x01, 0x0e,
+};
+
+static const uint8_t unicode_prop_ID_Start_table[1003] = {
+ 0xc0, 0x99, 0x85, 0x99, 0xae, 0x80, 0x89, 0x03,
+ 0x04, 0x96, 0x80, 0x9e, 0x80, 0x41, 0xc9, 0x83,
+ 0x8b, 0x8d, 0x26, 0x00, 0x80, 0x40, 0x80, 0x20,
+ 0x09, 0x18, 0x05, 0x00, 0x10, 0x00, 0x93, 0x80,
+ 0xd2, 0x80, 0x40, 0x8a, 0x87, 0x40, 0xa5, 0x80,
+ 0xa5, 0x08, 0x85, 0xa8, 0xc6, 0x9a, 0x1b, 0xac,
+ 0xaa, 0xa2, 0x08, 0xe2, 0x00, 0x8e, 0x0e, 0x81,
+ 0x89, 0x11, 0x80, 0x8f, 0x00, 0x9d, 0x9c, 0xd8,
+ 0x8a, 0x80, 0x97, 0xa0, 0x88, 0x0b, 0x04, 0x95,
+ 0x18, 0x88, 0x02, 0x80, 0x96, 0x98, 0x86, 0x8a,
+ 0xb4, 0x94, 0x07, 0xc5, 0xb5, 0x10, 0x91, 0x06,
+ 0x89, 0x8e, 0x8f, 0x1f, 0x09, 0x81, 0x95, 0x06,
+ 0x00, 0x13, 0x10, 0x8f, 0x80, 0x8c, 0x08, 0x82,
+ 0x8d, 0x81, 0x89, 0x07, 0x2b, 0x09, 0x95, 0x06,
+ 0x01, 0x01, 0x01, 0x9e, 0x18, 0x80, 0x92, 0x82,
+ 0x8f, 0x88, 0x02, 0x80, 0x95, 0x06, 0x01, 0x04,
+ 0x10, 0x91, 0x80, 0x8e, 0x81, 0x96, 0x80, 0x8a,
+ 0x39, 0x09, 0x95, 0x06, 0x01, 0x04, 0x10, 0x9d,
+ 0x08, 0x82, 0x8e, 0x80, 0x90, 0x00, 0x2a, 0x10,
+ 0x1a, 0x08, 0x00, 0x0a, 0x0a, 0x12, 0x8b, 0x95,
+ 0x80, 0xb3, 0x38, 0x10, 0x96, 0x80, 0x8f, 0x10,
+ 0x99, 0x14, 0x81, 0x9d, 0x03, 0x38, 0x10, 0x96,
+ 0x80, 0x89, 0x04, 0x10, 0x9f, 0x00, 0x81, 0x8e,
+ 0x81, 0x91, 0x38, 0x10, 0xa8, 0x08, 0x8f, 0x04,
+ 0x17, 0x82, 0x97, 0x2c, 0x91, 0x82, 0x97, 0x80,
+ 0x88, 0x00, 0x0e, 0xb9, 0xaf, 0x01, 0x8b, 0x86,
+ 0xb9, 0x08, 0x01, 0x08, 0x01, 0x05, 0x18, 0x30,
+ 0x10, 0x00, 0x01, 0x08, 0x18, 0x81, 0x88, 0x01,
+ 0x20, 0x80, 0x94, 0x83, 0x9f, 0x80, 0xbe, 0x38,
+ 0xa3, 0x9a, 0x84, 0xf2, 0xaa, 0x93, 0x80, 0x8f,
+ 0x2b, 0x1a, 0x02, 0x0e, 0x13, 0x8c, 0x8b, 0x80,
+ 0x90, 0xa5, 0x00, 0x20, 0x81, 0xaa, 0x80, 0x41,
+ 0x4c, 0x03, 0x0e, 0x00, 0x03, 0x81, 0xa8, 0x03,
+ 0x81, 0xa0, 0x03, 0x0e, 0x00, 0x03, 0x81, 0x8e,
+ 0x80, 0xb8, 0x03, 0x81, 0xc2, 0xa4, 0x8f, 0x8f,
+ 0xd5, 0x0d, 0x82, 0x42, 0x6b, 0x81, 0x90, 0x80,
+ 0x99, 0x84, 0xca, 0x82, 0x8a, 0x86, 0x8c, 0x03,
+ 0x8d, 0x91, 0x8d, 0x91, 0x8d, 0x8c, 0x02, 0x8e,
+ 0xb3, 0xa2, 0x03, 0x80, 0xc2, 0xd8, 0x86, 0xa8,
+ 0x00, 0x84, 0xc5, 0x89, 0x9e, 0xb0, 0x9d, 0x0c,
+ 0x8a, 0xab, 0x83, 0x99, 0xb5, 0x96, 0x88, 0xb4,
+ 0xd1, 0x80, 0xdc, 0xae, 0x90, 0x86, 0xb6, 0x9d,
+ 0x8c, 0x81, 0x89, 0xab, 0x99, 0xa3, 0xa8, 0x82,
+ 0x89, 0xa3, 0x81, 0x88, 0x86, 0xaa, 0x0a, 0xa8,
+ 0x18, 0x1a, 0x81, 0x88, 0x40, 0xbf, 0xbf, 0x41,
+ 0x15, 0x0d, 0x81, 0xa5, 0x0d, 0x0f, 0x00, 0x00,
+ 0x00, 0x80, 0x9e, 0x81, 0xb4, 0x06, 0x00, 0x12,
+ 0x06, 0x13, 0x0d, 0x83, 0x8c, 0x22, 0x06, 0xf3,
+ 0x80, 0x8c, 0x80, 0x8f, 0x8c, 0xe4, 0x03, 0x01,
+ 0x89, 0x00, 0x0d, 0x28, 0x00, 0x00, 0x80, 0x8f,
+ 0x0b, 0x24, 0x18, 0x90, 0xa8, 0x4a, 0x76, 0xae,
+ 0x80, 0xae, 0x80, 0x40, 0x84, 0x2b, 0x11, 0x8b,
+ 0xa5, 0x00, 0x20, 0x81, 0xb7, 0x30, 0x8f, 0x96,
+ 0x88, 0x30, 0x30, 0x30, 0x30, 0x30, 0x30, 0x30,
+ 0x86, 0x42, 0x25, 0x82, 0x98, 0x88, 0x34, 0x0c,
+ 0x83, 0xd5, 0x1c, 0x80, 0xd9, 0x03, 0x84, 0xaa,
+ 0x80, 0xdd, 0x90, 0x9a, 0xb4, 0x8f, 0x41, 0xff,
+ 0x59, 0xb5, 0xc9, 0x60, 0x51, 0xef, 0x8f, 0x44,
+ 0x8c, 0xc2, 0xad, 0x81, 0x41, 0x0c, 0x82, 0x8f,
+ 0x89, 0x81, 0x93, 0xae, 0x8f, 0x9e, 0x81, 0xcf,
+ 0xa6, 0x88, 0x81, 0xe6, 0x81, 0xae, 0xbc, 0x8a,
+ 0x02, 0x03, 0x80, 0x96, 0x9c, 0xb3, 0x8d, 0xb1,
+ 0xbd, 0x2a, 0x00, 0x81, 0x8a, 0x9b, 0x89, 0x96,
+ 0x98, 0x9c, 0x86, 0xae, 0x9b, 0x80, 0x8f, 0x20,
+ 0x89, 0x89, 0x20, 0xa8, 0x96, 0x10, 0x87, 0x93,
+ 0x96, 0x10, 0x82, 0xb1, 0x00, 0x11, 0x0c, 0x08,
+ 0x00, 0x97, 0x11, 0x8a, 0x32, 0x8b, 0x29, 0x29,
+ 0x85, 0x88, 0x30, 0x30, 0xaa, 0x80, 0x89, 0x89,
+ 0xf2, 0x9c, 0x60, 0x2b, 0xa3, 0x8b, 0x96, 0x83,
+ 0xb0, 0x60, 0x21, 0x03, 0x41, 0x6d, 0x81, 0xe9,
+ 0xa5, 0x86, 0x8b, 0x24, 0x00, 0x89, 0x80, 0x8c,
+ 0x04, 0x00, 0x01, 0x01, 0x80, 0xeb, 0xa0, 0x41,
+ 0x6a, 0x91, 0xbf, 0x81, 0xb5, 0xa7, 0x8b, 0xf3,
+ 0x20, 0x40, 0x86, 0xa3, 0x99, 0x85, 0x99, 0x8a,
+ 0xd8, 0x15, 0x0d, 0x0d, 0x0a, 0xa2, 0x8b, 0x80,
+ 0x99, 0x80, 0x92, 0x01, 0x80, 0x8e, 0x81, 0x8d,
+ 0xa1, 0xfa, 0xc4, 0xb4, 0x41, 0x0a, 0x9c, 0x82,
+ 0xb0, 0xae, 0x9f, 0x8c, 0x9d, 0x84, 0xa5, 0x89,
+ 0x9d, 0x81, 0xa3, 0x1f, 0x04, 0xa9, 0x40, 0x9d,
+ 0x91, 0xa3, 0x83, 0xa3, 0x83, 0xa7, 0x87, 0xb3,
+ 0x40, 0x9b, 0x41, 0x36, 0x88, 0x95, 0x89, 0x87,
+ 0x40, 0x97, 0x29, 0x00, 0xab, 0x01, 0x10, 0x81,
+ 0x96, 0x89, 0x96, 0x88, 0x9e, 0xc0, 0x92, 0x01,
+ 0x89, 0x95, 0x89, 0x99, 0xc5, 0xb7, 0x29, 0xbf,
+ 0x80, 0x8e, 0x18, 0x10, 0x9c, 0xa9, 0x9c, 0x82,
+ 0x9c, 0xa2, 0x38, 0x9b, 0x9a, 0xb5, 0x89, 0x95,
+ 0x89, 0x92, 0x8c, 0x91, 0xed, 0xc8, 0xb6, 0xb2,
+ 0x8c, 0xb2, 0x8c, 0xa3, 0x41, 0xdb, 0x9c, 0x89,
+ 0x07, 0x95, 0x40, 0xbc, 0xb4, 0xca, 0xac, 0x9f,
+ 0x98, 0x99, 0xa3, 0x9c, 0x80, 0x8a, 0xa2, 0x10,
+ 0x8b, 0xaf, 0x8d, 0x83, 0x94, 0x00, 0x80, 0xa2,
+ 0x91, 0x80, 0x98, 0xd3, 0x30, 0x00, 0x18, 0x8e,
+ 0x80, 0x89, 0x86, 0xae, 0xa5, 0x39, 0x09, 0x95,
+ 0x06, 0x01, 0x04, 0x10, 0x91, 0x80, 0x8b, 0x84,
+ 0x40, 0x9d, 0xb4, 0x91, 0x83, 0xb4, 0xaf, 0x93,
+ 0x08, 0x80, 0x40, 0xb7, 0xae, 0xa8, 0x83, 0xa3,
+ 0xaf, 0x93, 0x80, 0xba, 0xaa, 0xd4, 0x9a, 0x40,
+ 0xe4, 0xab, 0xf3, 0xbf, 0x9e, 0x80, 0x40, 0xff,
+ 0x80, 0x89, 0xa7, 0x30, 0x94, 0x80, 0x8a, 0xa7,
+ 0x0b, 0x92, 0x80, 0xa1, 0xb8, 0x41, 0x06, 0x88,
+ 0x80, 0xa4, 0x90, 0x80, 0xb0, 0x9d, 0xef, 0x30,
+ 0x08, 0xa5, 0x94, 0x80, 0x98, 0x28, 0x08, 0x9f,
+ 0x8d, 0x80, 0x41, 0x46, 0x92, 0x41, 0x0c, 0x43,
+ 0x99, 0xe5, 0xee, 0x90, 0x40, 0xc3, 0x4a, 0xbb,
+ 0x44, 0x2e, 0x4f, 0xd0, 0x42, 0x46, 0x60, 0x21,
+ 0xb8, 0x42, 0x38, 0x86, 0x9e, 0xf0, 0x9d, 0x91,
+ 0xaf, 0x8f, 0x83, 0x9e, 0x94, 0x84, 0x92, 0x42,
+ 0xaf, 0xbf, 0xff, 0xc4, 0x8a, 0x80, 0xc1, 0x8c,
+ 0xbf, 0x81, 0x9d, 0x57, 0xf1, 0x8d, 0x42, 0xf2,
+ 0x60, 0x25, 0x0c, 0x41, 0x1e, 0xd0, 0x41, 0x8b,
+ 0x49, 0x03, 0xea, 0x84, 0x8c, 0x82, 0x88, 0x86,
+ 0x89, 0x57, 0x65, 0xd4, 0x80, 0xc6, 0x01, 0x08,
+ 0x09, 0x0b, 0x80, 0x8b, 0x00, 0x06, 0x80, 0xc0,
+ 0x03, 0x0f, 0x06, 0x80, 0x9b, 0x03, 0x04, 0x00,
+ 0x16, 0x80, 0x41, 0x53, 0x81, 0x98, 0x80, 0x98,
+ 0x80, 0x9e, 0x80, 0x98, 0x80, 0x9e, 0x80, 0x98,
+ 0x80, 0x9e, 0x80, 0x98, 0x80, 0x9e, 0x80, 0x98,
+ 0x07, 0x50, 0x33, 0x40, 0xc4, 0xba, 0xc3, 0x44,
+ 0xbb, 0x18, 0x9a, 0x01, 0x00, 0x08, 0x80, 0x89,
+ 0x03, 0x00, 0x00, 0x28, 0x18, 0x00, 0x00, 0x02,
+ 0x01, 0x00, 0x08, 0x00, 0x00, 0x00, 0x00, 0x01,
+ 0x00, 0x0b, 0x06, 0x03, 0x03, 0x00, 0x80, 0x89,
+ 0x80, 0x90, 0x22, 0x04, 0x80, 0x90, 0x51, 0x43,
+ 0x60, 0xa6, 0xd6, 0xa8, 0x50, 0x34, 0x8a, 0x40,
+ 0xdd, 0x81, 0x56, 0x81, 0x8d, 0x5d, 0x30, 0x4c,
+ 0x1e, 0x42, 0x1d,
+};
+
+static const uint8_t unicode_prop_ID_Start_index[96] = {
+ 0xf6, 0x03, 0x20, 0xa6, 0x07, 0x00, 0xb1, 0x09,
+ 0x00, 0xba, 0x0a, 0x00, 0xd1, 0x0b, 0x20, 0x62,
+ 0x0d, 0x40, 0xc7, 0x0e, 0x40, 0x49, 0x12, 0x20,
+ 0x9b, 0x16, 0x20, 0x75, 0x19, 0x00, 0xf7, 0x1c,
+ 0x60, 0x72, 0x20, 0x20, 0x26, 0x2d, 0x20, 0x30,
+ 0x31, 0x00, 0xf0, 0xa6, 0x00, 0xf0, 0xa9, 0x20,
+ 0xe3, 0xab, 0x20, 0x3e, 0xfd, 0x20, 0x5e, 0x00,
+ 0x01, 0x64, 0x05, 0x01, 0x01, 0x0a, 0x21, 0x46,
+ 0x0f, 0x41, 0x9e, 0x12, 0x01, 0x30, 0x16, 0x21,
+ 0x09, 0x1c, 0x01, 0x2f, 0x34, 0x41, 0xa0, 0x6f,
+ 0x01, 0xa3, 0xd4, 0x01, 0x4f, 0xd7, 0x01, 0x50,
+ 0xee, 0x01, 0x1e, 0xb8, 0x22, 0x1e, 0xfa, 0x02,
+};
+
+static const uint8_t unicode_prop_ID_Continue1_table[596] = {
+ 0xaf, 0x89, 0xa4, 0x80, 0xd6, 0x80, 0x42, 0x47,
+ 0xef, 0x96, 0x80, 0x40, 0xfa, 0x84, 0x41, 0x08,
+ 0xac, 0x00, 0x01, 0x01, 0x00, 0xc7, 0x8a, 0xaf,
+ 0x9e, 0x28, 0xe4, 0x31, 0x29, 0x08, 0x19, 0x89,
+ 0x96, 0x80, 0x9d, 0x9a, 0xda, 0x8a, 0x8e, 0x89,
+ 0xa0, 0x88, 0x88, 0x80, 0x97, 0x18, 0x88, 0x02,
+ 0x04, 0xaa, 0x82, 0xf6, 0x8e, 0x80, 0xa0, 0xb5,
+ 0x10, 0x91, 0x06, 0x89, 0x09, 0x89, 0x90, 0x82,
+ 0xb7, 0x00, 0x31, 0x09, 0x82, 0x88, 0x80, 0x89,
+ 0x09, 0x89, 0x8d, 0x01, 0x82, 0xb7, 0x00, 0x23,
+ 0x09, 0x12, 0x80, 0x93, 0x8b, 0x10, 0x8a, 0x82,
+ 0xb7, 0x00, 0x38, 0x10, 0x82, 0x93, 0x09, 0x89,
+ 0x89, 0x28, 0x82, 0xb7, 0x00, 0x31, 0x09, 0x17,
+ 0x81, 0x89, 0x09, 0x89, 0x91, 0x80, 0xba, 0x22,
+ 0x10, 0x83, 0x88, 0x80, 0x8d, 0x89, 0x8f, 0x84,
+ 0xb8, 0x30, 0x10, 0x1e, 0x81, 0x8a, 0x09, 0x89,
+ 0x90, 0x82, 0xb7, 0x00, 0x30, 0x10, 0x1e, 0x81,
+ 0x8a, 0x09, 0x89, 0x8f, 0x83, 0xb6, 0x08, 0x30,
+ 0x10, 0x83, 0x88, 0x80, 0x89, 0x09, 0x89, 0x91,
+ 0x81, 0xc5, 0x03, 0x28, 0x00, 0x3d, 0x89, 0x09,
+ 0xbc, 0x01, 0x86, 0x8b, 0x38, 0x89, 0xd6, 0x01,
+ 0x28, 0x81, 0x8a, 0x29, 0x89, 0xbd, 0x0d, 0x89,
+ 0x8a, 0x00, 0x00, 0x03, 0x81, 0xb0, 0x93, 0x01,
+ 0x84, 0x8a, 0x80, 0xa3, 0x88, 0x80, 0xe3, 0x93,
+ 0x80, 0x89, 0x8b, 0x1b, 0x10, 0x11, 0x32, 0x83,
+ 0x8c, 0x8b, 0x80, 0x8e, 0x42, 0xbe, 0x82, 0x88,
+ 0x88, 0x43, 0x9f, 0x82, 0x9c, 0x82, 0x9c, 0x81,
+ 0x9d, 0x81, 0xbf, 0x9f, 0x88, 0x01, 0x89, 0xa0,
+ 0x11, 0x89, 0x40, 0x8e, 0x80, 0xf5, 0x8b, 0x83,
+ 0x8b, 0x89, 0x89, 0xff, 0x8a, 0xbb, 0x84, 0xb8,
+ 0x89, 0x80, 0x9c, 0x81, 0x8a, 0x85, 0x89, 0x95,
+ 0x8d, 0xc1, 0x84, 0xae, 0x90, 0x8a, 0x89, 0x90,
+ 0x88, 0x8b, 0x82, 0x9d, 0x8c, 0x81, 0x89, 0xab,
+ 0x8d, 0xaf, 0x93, 0x87, 0x89, 0x85, 0x89, 0xf5,
+ 0x10, 0x94, 0x18, 0x1a, 0x0a, 0x40, 0xc5, 0xb9,
+ 0x04, 0x42, 0x3e, 0x81, 0x92, 0x80, 0xfa, 0x8c,
+ 0x18, 0x82, 0x8b, 0x4b, 0xfd, 0x82, 0x40, 0x8c,
+ 0x80, 0xdf, 0x9f, 0x42, 0x29, 0x85, 0xe8, 0x81,
+ 0x60, 0x75, 0x84, 0x89, 0xc4, 0x03, 0x89, 0x9f,
+ 0x81, 0xcf, 0x81, 0x41, 0x0f, 0x02, 0x03, 0x80,
+ 0x96, 0x84, 0xd7, 0x81, 0xb1, 0x91, 0x89, 0x89,
+ 0x85, 0x91, 0x8c, 0x8a, 0x9b, 0x87, 0x98, 0x8c,
+ 0xab, 0x83, 0xae, 0x8d, 0x8e, 0x89, 0x8a, 0x80,
+ 0x89, 0x89, 0xae, 0x8d, 0x8b, 0x07, 0x09, 0x89,
+ 0xa0, 0x82, 0xb1, 0x00, 0x11, 0x0c, 0x08, 0x80,
+ 0xa8, 0x24, 0x81, 0x40, 0xeb, 0x38, 0x09, 0x89,
+ 0x60, 0x4f, 0x23, 0x80, 0x42, 0xe0, 0x8f, 0x8f,
+ 0x8f, 0x11, 0x97, 0x82, 0x40, 0xbf, 0x89, 0xa4,
+ 0x80, 0x42, 0xbc, 0x80, 0x40, 0xe1, 0x80, 0x40,
+ 0x94, 0x84, 0x41, 0x24, 0x89, 0x45, 0x56, 0x10,
+ 0x0c, 0x83, 0xa7, 0x13, 0x80, 0x40, 0xa4, 0x81,
+ 0x42, 0x3c, 0x1f, 0x89, 0x42, 0x0b, 0x8a, 0x40,
+ 0xae, 0x82, 0xb4, 0x8e, 0x9e, 0x89, 0x8e, 0x83,
+ 0xac, 0x8a, 0xb4, 0x89, 0x2a, 0xa3, 0x8d, 0x80,
+ 0x89, 0x21, 0xab, 0x80, 0x8b, 0x82, 0xaf, 0x8d,
+ 0x3b, 0x82, 0x89, 0xd1, 0x8b, 0x28, 0x40, 0x9f,
+ 0x8b, 0x84, 0x89, 0x2b, 0xb6, 0x08, 0x31, 0x09,
+ 0x82, 0x88, 0x80, 0x89, 0x09, 0x32, 0x84, 0x40,
+ 0xbf, 0x91, 0x88, 0x89, 0x18, 0xd0, 0x93, 0x8b,
+ 0x89, 0x40, 0xd4, 0x31, 0x88, 0x9a, 0x81, 0xd1,
+ 0x90, 0x8e, 0x89, 0xd0, 0x8c, 0x87, 0x89, 0xd2,
+ 0x8e, 0x83, 0x89, 0x40, 0xf1, 0x8e, 0x40, 0xa4,
+ 0x89, 0x41, 0x16, 0x89, 0xa7, 0x30, 0x1f, 0x80,
+ 0x88, 0x8a, 0xad, 0x8f, 0x41, 0x94, 0x38, 0x87,
+ 0x8f, 0x89, 0xb7, 0x95, 0x80, 0x8d, 0xf9, 0x2a,
+ 0x00, 0x08, 0x30, 0x07, 0x89, 0xaf, 0x20, 0x08,
+ 0x27, 0x89, 0x41, 0x48, 0x83, 0x60, 0x4b, 0x68,
+ 0x89, 0x40, 0x85, 0x84, 0xba, 0x86, 0x98, 0x89,
+ 0x43, 0xf6, 0xad, 0x8f, 0x83, 0x60, 0x4d, 0x09,
+ 0x81, 0x54, 0xc5, 0x22, 0x2f, 0x39, 0x86, 0x9d,
+ 0x83, 0x40, 0x93, 0x82, 0x45, 0x88, 0xb1, 0x41,
+ 0xff, 0xb6, 0x83, 0xb1, 0x38, 0x8d, 0x80, 0x95,
+ 0x20, 0x8e, 0x45, 0x4f, 0x30, 0x90, 0x0e, 0x01,
+ 0x04, 0x48, 0xa4, 0x86, 0xec, 0x34, 0x89, 0x6c,
+ 0x17, 0xa5, 0x40, 0xef,
+};
+
+static const uint8_t unicode_prop_ID_Continue1_index[57] = {
+ 0xfa, 0x06, 0x00, 0x84, 0x09, 0x00, 0xf0, 0x0a,
+ 0x00, 0x70, 0x0c, 0x00, 0xf4, 0x0d, 0x00, 0x3f,
+ 0x10, 0x00, 0x1a, 0x18, 0x40, 0x74, 0x1b, 0x20,
+ 0xdd, 0x20, 0x00, 0x0c, 0xa8, 0x00, 0x5a, 0xaa,
+ 0x00, 0x40, 0xff, 0x20, 0x03, 0x10, 0x41, 0xeb,
+ 0x12, 0x21, 0x41, 0x16, 0x21, 0x40, 0x1c, 0x01,
+ 0x5a, 0x6b, 0x01, 0xb0, 0xda, 0x41, 0xf0, 0x01,
+ 0x0e,
+};
+
+#ifdef CONFIG_ALL_UNICODE
+
+static const uint8_t unicode_cc_table[820] = {
+ 0xb2, 0xcf, 0xd4, 0x00, 0xe8, 0x03, 0xdc, 0x00,
+ 0xe8, 0x00, 0xd8, 0x04, 0xdc, 0x01, 0xca, 0x03,
+ 0xdc, 0x01, 0xca, 0x0a, 0xdc, 0x04, 0x01, 0x03,
+ 0xdc, 0xc7, 0x00, 0xf0, 0xc0, 0x02, 0xdc, 0xc2,
+ 0x01, 0xdc, 0x80, 0xc2, 0x03, 0xdc, 0xc0, 0x00,
+ 0xe8, 0x01, 0xdc, 0xc0, 0x41, 0xe9, 0x00, 0xea,
+ 0x41, 0xe9, 0x00, 0xea, 0x00, 0xe9, 0xcc, 0xb0,
+ 0xe2, 0xc4, 0xb0, 0xd8, 0x00, 0xdc, 0xc3, 0x00,
+ 0xdc, 0xc2, 0x00, 0xde, 0x00, 0xdc, 0xc5, 0x05,
+ 0xdc, 0xc1, 0x00, 0xdc, 0xc1, 0x00, 0xde, 0x00,
+ 0xe4, 0xc0, 0x49, 0x0a, 0x43, 0x13, 0x80, 0x00,
+ 0x17, 0x80, 0x41, 0x18, 0x80, 0xc0, 0x00, 0xdc,
+ 0x80, 0x00, 0x12, 0xb0, 0x17, 0xc7, 0x42, 0x1e,
+ 0xaf, 0x47, 0x1b, 0xc1, 0x01, 0xdc, 0xc4, 0x00,
+ 0xdc, 0xc1, 0x00, 0xdc, 0x8f, 0x00, 0x23, 0xb0,
+ 0x34, 0xc6, 0x81, 0xc3, 0x00, 0xdc, 0xc0, 0x81,
+ 0xc1, 0x80, 0x00, 0xdc, 0xc1, 0x00, 0xdc, 0xa2,
+ 0x00, 0x24, 0x9d, 0xc0, 0x00, 0xdc, 0xc1, 0x00,
+ 0xdc, 0xc1, 0x02, 0xdc, 0xc0, 0x01, 0xdc, 0xc0,
+ 0x00, 0xdc, 0xc2, 0x00, 0xdc, 0xc0, 0x00, 0xdc,
+ 0xc0, 0x00, 0xdc, 0xc0, 0x00, 0xdc, 0xc1, 0xb0,
+ 0x6f, 0xc6, 0x00, 0xdc, 0xc0, 0x88, 0x00, 0xdc,
+ 0x97, 0xc3, 0x80, 0xc8, 0x80, 0xc2, 0x80, 0xc4,
+ 0xaa, 0x02, 0xdc, 0xb0, 0x46, 0x00, 0xdc, 0xcd,
+ 0x80, 0x00, 0xdc, 0xc1, 0x00, 0xdc, 0xc1, 0x00,
+ 0xdc, 0xc2, 0x02, 0xdc, 0x42, 0x1b, 0xc2, 0x00,
+ 0xdc, 0xc1, 0x01, 0xdc, 0xc4, 0xb0, 0x0b, 0x00,
+ 0x07, 0x8f, 0x00, 0x09, 0x82, 0xc0, 0x00, 0xdc,
+ 0xc1, 0xb0, 0x36, 0x00, 0x07, 0x8f, 0x00, 0x09,
+ 0xaf, 0xc0, 0xb0, 0x0c, 0x00, 0x07, 0x8f, 0x00,
+ 0x09, 0xb0, 0x3d, 0x00, 0x07, 0x8f, 0x00, 0x09,
+ 0xb0, 0x3d, 0x00, 0x07, 0x8f, 0x00, 0x09, 0xb0,
+ 0x4e, 0x00, 0x09, 0xb0, 0x4e, 0x00, 0x09, 0x86,
+ 0x00, 0x54, 0x00, 0x5b, 0xb0, 0x34, 0x00, 0x07,
+ 0x8f, 0x00, 0x09, 0xb0, 0x3c, 0x01, 0x09, 0x8f,
+ 0x00, 0x09, 0xb0, 0x4b, 0x00, 0x09, 0xb0, 0x3c,
+ 0x01, 0x67, 0x00, 0x09, 0x8c, 0x03, 0x6b, 0xb0,
+ 0x3b, 0x01, 0x76, 0x8d, 0x03, 0x7a, 0xb0, 0x1b,
+ 0x01, 0xdc, 0x9a, 0x00, 0xdc, 0x80, 0x00, 0xdc,
+ 0x80, 0x00, 0xd8, 0xb0, 0x06, 0x41, 0x81, 0x80,
+ 0x00, 0x84, 0x84, 0x03, 0x82, 0x81, 0x00, 0x82,
+ 0x80, 0xc1, 0x00, 0x09, 0x80, 0xc1, 0xb0, 0x0d,
+ 0x00, 0xdc, 0xb0, 0x3f, 0x00, 0x07, 0x80, 0x01,
+ 0x09, 0xb0, 0x21, 0x00, 0xdc, 0xb2, 0x9e, 0xc2,
+ 0xb3, 0x83, 0x00, 0x09, 0x9e, 0x00, 0x09, 0xb0,
+ 0x6c, 0x00, 0x09, 0x89, 0xc0, 0xb0, 0x9a, 0x00,
+ 0xe4, 0xb0, 0x5e, 0x00, 0xde, 0xc0, 0x00, 0xdc,
+ 0xb0, 0xaa, 0xc0, 0x00, 0xdc, 0xb0, 0x16, 0x00,
+ 0x09, 0x93, 0xc7, 0x81, 0x00, 0xdc, 0xaf, 0xc4,
+ 0x05, 0xdc, 0xc1, 0x00, 0xdc, 0xb0, 0x45, 0x00,
+ 0x07, 0x8e, 0x00, 0x09, 0xa5, 0xc0, 0x00, 0xdc,
+ 0xc6, 0xb0, 0x05, 0x01, 0x09, 0xb0, 0x09, 0x00,
+ 0x07, 0x8a, 0x01, 0x09, 0xb0, 0x12, 0x00, 0x07,
+ 0xb0, 0x67, 0xc2, 0x41, 0x00, 0x04, 0xdc, 0xc1,
+ 0x03, 0xdc, 0xc0, 0x41, 0x00, 0x05, 0x01, 0x83,
+ 0x00, 0xdc, 0x85, 0xc0, 0x82, 0xc1, 0xb0, 0x95,
+ 0xc1, 0x00, 0xdc, 0xc6, 0x00, 0xdc, 0xc1, 0x00,
+ 0xea, 0x00, 0xd6, 0x00, 0xdc, 0x00, 0xca, 0xe4,
+ 0x00, 0xe8, 0x01, 0xe4, 0x00, 0xdc, 0x80, 0xc0,
+ 0x00, 0xe9, 0x00, 0xdc, 0xc0, 0x00, 0xdc, 0xb2,
+ 0x9f, 0xc1, 0x01, 0x01, 0xc3, 0x02, 0x01, 0xc1,
+ 0x83, 0xc0, 0x82, 0x01, 0x01, 0xc0, 0x00, 0xdc,
+ 0xc0, 0x01, 0x01, 0x03, 0xdc, 0xc0, 0xb8, 0x03,
+ 0xcd, 0xc2, 0xb0, 0x5c, 0x00, 0x09, 0xb0, 0x2f,
+ 0xdf, 0xb1, 0xf9, 0x00, 0xda, 0x00, 0xe4, 0x00,
+ 0xe8, 0x00, 0xde, 0x01, 0xe0, 0xb0, 0x38, 0x01,
+ 0x08, 0xb8, 0x6d, 0xa3, 0xc0, 0x83, 0xc9, 0x9f,
+ 0xc1, 0xb0, 0x1f, 0xc1, 0xb0, 0xe3, 0x00, 0x09,
+ 0xb0, 0x8c, 0x00, 0x09, 0x9a, 0xd1, 0xb0, 0x08,
+ 0x02, 0xdc, 0xa4, 0x00, 0x09, 0xb0, 0x2e, 0x00,
+ 0x07, 0x8b, 0x00, 0x09, 0xb0, 0xbe, 0xc0, 0x80,
+ 0xc1, 0x00, 0xdc, 0x81, 0xc1, 0x84, 0xc1, 0x80,
+ 0xc0, 0xb0, 0x03, 0x00, 0x09, 0xb0, 0xc5, 0x00,
+ 0x09, 0xb8, 0x46, 0xff, 0x00, 0x1a, 0xb2, 0xd0,
+ 0xc6, 0x06, 0xdc, 0xc1, 0xb3, 0x9c, 0x00, 0xdc,
+ 0xb0, 0xb1, 0x00, 0xdc, 0xb0, 0x64, 0xc4, 0xb6,
+ 0x61, 0x00, 0xdc, 0x80, 0xc0, 0xa7, 0xc0, 0x00,
+ 0x01, 0x00, 0xdc, 0x83, 0x00, 0x09, 0xb0, 0x74,
+ 0xc0, 0x00, 0xdc, 0xb2, 0x0c, 0xc3, 0xb1, 0xed,
+ 0x01, 0xdc, 0xc2, 0x00, 0xdc, 0xc0, 0x03, 0xdc,
+ 0xb0, 0xc4, 0x00, 0x09, 0xb0, 0x07, 0x00, 0x09,
+ 0xb0, 0x08, 0x00, 0x09, 0x00, 0x07, 0xb0, 0x14,
+ 0xc2, 0xaf, 0x01, 0x09, 0xb0, 0x0d, 0x00, 0x07,
+ 0xb0, 0x1b, 0x00, 0x09, 0x88, 0x00, 0x07, 0xb0,
+ 0x39, 0x00, 0x09, 0x00, 0x07, 0xb0, 0x81, 0x00,
+ 0x07, 0x00, 0x09, 0xb0, 0x1f, 0x01, 0x07, 0x8f,
+ 0x00, 0x09, 0x97, 0xc6, 0x82, 0xc4, 0xb0, 0x9c,
+ 0x00, 0x09, 0x82, 0x00, 0x07, 0x96, 0xc0, 0xb0,
+ 0x32, 0x00, 0x09, 0x00, 0x07, 0xb0, 0xca, 0x00,
+ 0x09, 0x00, 0x07, 0xb0, 0x4d, 0x00, 0x09, 0xb0,
+ 0x45, 0x00, 0x09, 0x00, 0x07, 0xb0, 0x42, 0x00,
+ 0x09, 0xb0, 0xdc, 0x00, 0x09, 0x00, 0x07, 0xb1,
+ 0xc8, 0x00, 0x09, 0x91, 0x00, 0x09, 0xb0, 0x20,
+ 0x00, 0x09, 0xb1, 0x74, 0x00, 0x09, 0xb0, 0xd1,
+ 0x00, 0x07, 0x80, 0x01, 0x09, 0xb0, 0x20, 0x00,
+ 0x09, 0xb8, 0x45, 0x27, 0x04, 0x01, 0xb0, 0x0a,
+ 0xc6, 0xb8, 0x49, 0x36, 0x00, 0x01, 0xb8, 0x0c,
+ 0x95, 0x01, 0xd8, 0x02, 0x01, 0x82, 0x00, 0xe2,
+ 0x04, 0xd8, 0x87, 0x07, 0xdc, 0x81, 0xc4, 0x01,
+ 0xdc, 0x9d, 0xc3, 0xb0, 0x63, 0xc2, 0xb8, 0x05,
+ 0x8a, 0xc6, 0x80, 0xd0, 0x81, 0xc6, 0x80, 0xc1,
+ 0x80, 0xc4, 0xb8, 0x00, 0x74, 0x06, 0xdc, 0xb0,
+ 0x3c, 0xc5, 0x00, 0x07,
+};
+
+static const uint8_t unicode_cc_index[78] = {
+ 0x4d, 0x03, 0x00, 0x97, 0x05, 0x20, 0xc6, 0x05,
+ 0x00, 0xe7, 0x06, 0x00, 0x45, 0x07, 0x00, 0xe2,
+ 0x08, 0x00, 0x53, 0x09, 0x00, 0xcd, 0x0b, 0x20,
+ 0x38, 0x0e, 0x00, 0x74, 0x0f, 0x00, 0x60, 0x13,
+ 0x00, 0x61, 0x1a, 0x20, 0xe7, 0x1b, 0x20, 0xc0,
+ 0x1d, 0x00, 0xd0, 0x20, 0x20, 0xe0, 0x2d, 0x00,
+ 0x07, 0xa8, 0x00, 0xc1, 0xaa, 0x00, 0x0d, 0x0a,
+ 0x21, 0x51, 0x0f, 0x01, 0x35, 0x12, 0x21, 0xc2,
+ 0x14, 0x21, 0x34, 0x1a, 0x21, 0x30, 0x6b, 0x01,
+ 0x00, 0xe0, 0x21, 0x4b, 0xe9, 0x01,
+};
+
+static const uint32_t unicode_decomp_table1[686] = {
+ 0x00280081, 0x002a0097, 0x002a8081, 0x002bc097,
+ 0x002c8115, 0x002d0097, 0x002d4081, 0x002e0097,
+ 0x002e4115, 0x002f0199, 0x00302016, 0x00400842,
+ 0x00448a42, 0x004a0442, 0x004c0096, 0x004c8117,
+ 0x004d0242, 0x004e4342, 0x004fc12f, 0x0050c342,
+ 0x005240bf, 0x00530342, 0x00550942, 0x005a0842,
+ 0x005e0096, 0x005e4342, 0x005fc081, 0x00680142,
+ 0x006bc142, 0x00710185, 0x0071c317, 0x00734844,
+ 0x00778344, 0x00798342, 0x007b02be, 0x007c4197,
+ 0x007d0142, 0x007e0444, 0x00800e42, 0x00878142,
+ 0x00898744, 0x00ac0483, 0x00b60317, 0x00b80283,
+ 0x00d00214, 0x00d10096, 0x00dd0080, 0x00de8097,
+ 0x00df8080, 0x00e10097, 0x00e1413e, 0x00e1c080,
+ 0x00e204be, 0x00ea83ae, 0x00f282ae, 0x00f401ad,
+ 0x00f4c12e, 0x00f54103, 0x00fc0303, 0x00fe4081,
+ 0x0100023e, 0x0101c0be, 0x010301be, 0x010640be,
+ 0x010e40be, 0x0114023e, 0x0115c0be, 0x011701be,
+ 0x011d8144, 0x01304144, 0x01340244, 0x01358144,
+ 0x01368344, 0x01388344, 0x013a8644, 0x013e0144,
+ 0x0161c085, 0x018882ae, 0x019d422f, 0x01b00184,
+ 0x01b4c084, 0x024a4084, 0x024c4084, 0x024d0084,
+ 0x0256042e, 0x0272c12e, 0x02770120, 0x0277c084,
+ 0x028cc084, 0x028d8084, 0x029641ae, 0x02978084,
+ 0x02d20084, 0x02d2c12e, 0x02d70120, 0x02e50084,
+ 0x02f281ae, 0x03120084, 0x03300084, 0x0331c122,
+ 0x0332812e, 0x035281ae, 0x03768084, 0x037701ae,
+ 0x038cc085, 0x03acc085, 0x03b7012f, 0x03c30081,
+ 0x03d0c084, 0x03d34084, 0x03d48084, 0x03d5c084,
+ 0x03d70084, 0x03da4084, 0x03dcc084, 0x03dd412e,
+ 0x03ddc085, 0x03de0084, 0x03de4085, 0x03e04084,
+ 0x03e4c084, 0x03e74084, 0x03e88084, 0x03e9c084,
+ 0x03eb0084, 0x03ee4084, 0x04098084, 0x043f0081,
+ 0x06c18484, 0x06c48084, 0x06cec184, 0x06d00120,
+ 0x06d0c084, 0x074b0383, 0x074cc41f, 0x074f1783,
+ 0x075e0081, 0x0766d283, 0x07801d44, 0x078e8942,
+ 0x07931844, 0x079f0d42, 0x07a58216, 0x07a68085,
+ 0x07a6c0be, 0x07a80d44, 0x07aea044, 0x07c00122,
+ 0x07c08344, 0x07c20122, 0x07c28344, 0x07c40122,
+ 0x07c48244, 0x07c60122, 0x07c68244, 0x07c8113e,
+ 0x07d08244, 0x07d20122, 0x07d28244, 0x07d40122,
+ 0x07d48344, 0x07d64c3e, 0x07dc4080, 0x07dc80be,
+ 0x07dcc080, 0x07dd00be, 0x07dd4080, 0x07dd80be,
+ 0x07ddc080, 0x07de00be, 0x07de4080, 0x07de80be,
+ 0x07dec080, 0x07df00be, 0x07df4080, 0x07e00820,
+ 0x07e40820, 0x07e80820, 0x07ec05be, 0x07eec080,
+ 0x07ef00be, 0x07ef4097, 0x07ef8080, 0x07efc117,
+ 0x07f0443e, 0x07f24080, 0x07f280be, 0x07f2c080,
+ 0x07f303be, 0x07f4c080, 0x07f582ae, 0x07f6c080,
+ 0x07f7433e, 0x07f8c080, 0x07f903ae, 0x07fac080,
+ 0x07fb013e, 0x07fb8102, 0x07fc83be, 0x07fe4080,
+ 0x07fe80be, 0x07fec080, 0x07ff00be, 0x07ff4080,
+ 0x07ff8097, 0x0800011e, 0x08008495, 0x08044081,
+ 0x0805c097, 0x08090081, 0x08094097, 0x08098099,
+ 0x080bc081, 0x080cc085, 0x080d00b1, 0x080d8085,
+ 0x080dc0b1, 0x080f0197, 0x0811c197, 0x0815c0b3,
+ 0x0817c081, 0x081c0595, 0x081ec081, 0x081f0215,
+ 0x0820051f, 0x08228583, 0x08254415, 0x082a0097,
+ 0x08400119, 0x08408081, 0x0840c0bf, 0x08414119,
+ 0x0841c081, 0x084240bf, 0x0842852d, 0x08454081,
+ 0x08458097, 0x08464295, 0x08480097, 0x08484099,
+ 0x08488097, 0x08490081, 0x08498080, 0x084a0081,
+ 0x084a8102, 0x084b0495, 0x084d421f, 0x084e4081,
+ 0x084ec099, 0x084f0283, 0x08514295, 0x08540119,
+ 0x0854809b, 0x0854c619, 0x0857c097, 0x08580081,
+ 0x08584097, 0x08588099, 0x0858c097, 0x08590081,
+ 0x08594097, 0x08598099, 0x0859c09b, 0x085a0097,
+ 0x085a4081, 0x085a8097, 0x085ac099, 0x085b0295,
+ 0x085c4097, 0x085c8099, 0x085cc097, 0x085d0081,
+ 0x085d4097, 0x085d8099, 0x085dc09b, 0x085e0097,
+ 0x085e4081, 0x085e8097, 0x085ec099, 0x085f0215,
+ 0x08624099, 0x0866813e, 0x086b80be, 0x087341be,
+ 0x088100be, 0x088240be, 0x088300be, 0x088901be,
+ 0x088b0085, 0x088b40b1, 0x088bc085, 0x088c00b1,
+ 0x089040be, 0x089100be, 0x0891c1be, 0x089801be,
+ 0x089b42be, 0x089d0144, 0x089e0144, 0x08a00144,
+ 0x08a10144, 0x08a20144, 0x08ab023e, 0x08b80244,
+ 0x08ba8220, 0x08ca411e, 0x0918049f, 0x091a4523,
+ 0x091cc097, 0x091d04a5, 0x091f452b, 0x0921c09b,
+ 0x092204a1, 0x09244525, 0x0926c099, 0x09270d25,
+ 0x092d8d1f, 0x09340d1f, 0x093a8081, 0x0a8300b3,
+ 0x0a9d0099, 0x0a9d4097, 0x0a9d8099, 0x0ab700be,
+ 0x0b1f0115, 0x0b5bc081, 0x0ba7c081, 0x0bbcc081,
+ 0x0bc004ad, 0x0bc244ad, 0x0bc484ad, 0x0bc6f383,
+ 0x0be0852d, 0x0be31d03, 0x0bf1882d, 0x0c000081,
+ 0x0c0d8283, 0x0c130b84, 0x0c194284, 0x0c1c0122,
+ 0x0c1cc122, 0x0c1d8122, 0x0c1e4122, 0x0c1f0122,
+ 0x0c250084, 0x0c26c123, 0x0c278084, 0x0c27c085,
+ 0x0c2b0b84, 0x0c314284, 0x0c340122, 0x0c34c122,
+ 0x0c358122, 0x0c364122, 0x0c370122, 0x0c3d0084,
+ 0x0c3dc220, 0x0c3f8084, 0x0c3fc085, 0x0c4c4a2d,
+ 0x0c51451f, 0x0c53ca9f, 0x0c5915ad, 0x0c648703,
+ 0x0c800741, 0x0c838089, 0x0c83c129, 0x0c8441a9,
+ 0x0c850089, 0x0c854129, 0x0c85c2a9, 0x0c870089,
+ 0x0c87408f, 0x0c87808d, 0x0c881241, 0x0c910203,
+ 0x0c940099, 0x0c9444a3, 0x0c968323, 0x0c98072d,
+ 0x0c9b84af, 0x0c9dc2a1, 0x0c9f00b5, 0x0c9f40b3,
+ 0x0c9f8085, 0x0ca01883, 0x0cac4223, 0x0cad4523,
+ 0x0cafc097, 0x0cb004a1, 0x0cb241a5, 0x0cb30097,
+ 0x0cb34099, 0x0cb38097, 0x0cb3c099, 0x0cb417ad,
+ 0x0cc001b3, 0x0cc0c0b1, 0x0cc100b3, 0x0cc14131,
+ 0x0cc1c0b5, 0x0cc200b3, 0x0cc241b1, 0x0cc30133,
+ 0x0cc38131, 0x0cc40085, 0x0cc440b1, 0x0cc48133,
+ 0x0cc50085, 0x0cc540b5, 0x0cc580b7, 0x0cc5c0b5,
+ 0x0cc600b1, 0x0cc64135, 0x0cc6c0b3, 0x0cc701b1,
+ 0x0cc7c0b3, 0x0cc800b5, 0x0cc840b3, 0x0cc881b1,
+ 0x0cc9422f, 0x0cca4131, 0x0ccac0b5, 0x0ccb00b1,
+ 0x0ccb40b3, 0x0ccb80b5, 0x0ccbc0b1, 0x0ccc012f,
+ 0x0ccc80b5, 0x0cccc0b3, 0x0ccd00b5, 0x0ccd40b1,
+ 0x0ccd80b5, 0x0ccdc085, 0x0cce02b1, 0x0ccf40b3,
+ 0x0ccf80b1, 0x0ccfc085, 0x0cd001b1, 0x0cd0c0b3,
+ 0x0cd101b1, 0x0cd1c0b5, 0x0cd200b3, 0x0cd24085,
+ 0x0cd280b5, 0x0cd2c085, 0x0cd30133, 0x0cd381b1,
+ 0x0cd440b3, 0x0cd48085, 0x0cd4c0b1, 0x0cd500b3,
+ 0x0cd54085, 0x0cd580b5, 0x0cd5c0b1, 0x0cd60521,
+ 0x0cd88525, 0x0cdb02a5, 0x0cdc4099, 0x0cdc8117,
+ 0x0cdd0099, 0x0cdd4197, 0x0cde0127, 0x0cde8285,
+ 0x0cdfc089, 0x0ce0043f, 0x0ce20099, 0x0ce2409b,
+ 0x0ce283bf, 0x0ce44219, 0x0ce54205, 0x0ce6433f,
+ 0x0ce7c131, 0x0ce84085, 0x0ce881b1, 0x0ce94085,
+ 0x0ce98107, 0x0cea0089, 0x0cea4097, 0x0cea8219,
+ 0x0ceb809d, 0x0cebc08d, 0x0cec083f, 0x0cf00105,
+ 0x0cf0809b, 0x0cf0c197, 0x0cf1809b, 0x0cf1c099,
+ 0x0cf20517, 0x0cf48099, 0x0cf4c117, 0x0cf54119,
+ 0x0cf5c097, 0x0cf6009b, 0x0cf64099, 0x0cf68217,
+ 0x0cf78119, 0x0cf804a1, 0x0cfa4525, 0x0cfcc525,
+ 0x0cff4125, 0x0cffc099, 0x29a70103, 0x29dc0081,
+ 0x29fe0103, 0x2ad70203, 0x3e401482, 0x3e4a7f82,
+ 0x3e6a3f82, 0x3e8aa102, 0x3e9b0110, 0x3e9c2f82,
+ 0x3eb3c590, 0x3ec00197, 0x3ec0c119, 0x3ec1413f,
+ 0x3ec4c2af, 0x3ec74184, 0x3ec804ad, 0x3eca4081,
+ 0x3eca8304, 0x3ecc03a0, 0x3ece02a0, 0x3ecf8084,
+ 0x3ed00120, 0x3ed0c120, 0x3ed184ae, 0x3ed3c085,
+ 0x3ed4312d, 0x3ef4cbad, 0x3efa892f, 0x3eff022d,
+ 0x3f002f2f, 0x3f1782a5, 0x3f18c0b1, 0x3f1907af,
+ 0x3f1cffaf, 0x3f3c81a5, 0x3f3d64af, 0x3f542031,
+ 0x3f649b31, 0x3f7c0131, 0x3f7c83b3, 0x3f7e40b1,
+ 0x3f7e80bd, 0x3f7ec0bb, 0x3f7f00b3, 0x3f840503,
+ 0x3f8c01ad, 0x3f8cc315, 0x3f8e462d, 0x3f91cc03,
+ 0x3f97c695, 0x3f9c01af, 0x3f9d0085, 0x3f9d852f,
+ 0x3fa03aad, 0x3fbd442f, 0x3fc06f1f, 0x3fd7c11f,
+ 0x3fd85fad, 0x3fe80081, 0x3fe84f1f, 0x3ff0831f,
+ 0x3ff2831f, 0x3ff4831f, 0x3ff6819f, 0x3ff80783,
+ 0x44268192, 0x442ac092, 0x444b8112, 0x44d2c112,
+ 0x452ec212, 0x456e8112, 0x74578392, 0x746ec312,
+ 0x75000d1f, 0x75068d1f, 0x750d0d1f, 0x7513839f,
+ 0x7515891f, 0x751a0d1f, 0x75208d1f, 0x75271015,
+ 0x752f439f, 0x7531459f, 0x75340d1f, 0x753a8d1f,
+ 0x75410395, 0x7543441f, 0x7545839f, 0x75478d1f,
+ 0x754e0795, 0x7552839f, 0x75548d1f, 0x755b0d1f,
+ 0x75618d1f, 0x75680d1f, 0x756e8d1f, 0x75750d1f,
+ 0x757b8d1f, 0x75820d1f, 0x75888d1f, 0x758f0d1f,
+ 0x75958d1f, 0x759c0d1f, 0x75a28d1f, 0x75a90103,
+ 0x75aa089f, 0x75ae4081, 0x75ae839f, 0x75b04081,
+ 0x75b08c9f, 0x75b6c081, 0x75b7032d, 0x75b8889f,
+ 0x75bcc081, 0x75bd039f, 0x75bec081, 0x75bf0c9f,
+ 0x75c54081, 0x75c5832d, 0x75c7089f, 0x75cb4081,
+ 0x75cb839f, 0x75cd4081, 0x75cd8c9f, 0x75d3c081,
+ 0x75d4032d, 0x75d5889f, 0x75d9c081, 0x75da039f,
+ 0x75dbc081, 0x75dc0c9f, 0x75e24081, 0x75e2832d,
+ 0x75e4089f, 0x75e84081, 0x75e8839f, 0x75ea4081,
+ 0x75ea8c9f, 0x75f0c081, 0x75f1042d, 0x75f3851f,
+ 0x75f6051f, 0x75f8851f, 0x75fb051f, 0x75fd851f,
+ 0x7b80022d, 0x7b814dad, 0x7b884203, 0x7b89c081,
+ 0x7b8a452d, 0x7b8d0403, 0x7b908081, 0x7b91dc03,
+ 0x7ba0052d, 0x7ba2c8ad, 0x7ba84483, 0x7baac8ad,
+ 0x7c400097, 0x7c404521, 0x7c440d25, 0x7c4a8087,
+ 0x7c4ac115, 0x7c4b4117, 0x7c4c0d1f, 0x7c528217,
+ 0x7c538099, 0x7c53c097, 0x7c5a8117, 0x7c640097,
+ 0x7c80012f, 0x7c808081, 0x7c841603, 0x7c9004c1,
+ 0x7c940103, 0xbe0001ac, 0xbe00d110, 0xbe0947ac,
+ 0xbe0d3910, 0xbe29872c, 0xbe2d022c, 0xbe2e3790,
+ 0xbe49ff90, 0xbe69bc10,
+};
+
+static const uint16_t unicode_decomp_table2[686] = {
+ 0x0020, 0x0000, 0x0061, 0x0002, 0x0004, 0x0006, 0x03bc, 0x0008,
+ 0x000a, 0x000c, 0x0015, 0x0095, 0x00a5, 0x00b9, 0x00c1, 0x00c3,
+ 0x00c7, 0x00cb, 0x00d1, 0x00d7, 0x00dd, 0x00e0, 0x00e6, 0x00f8,
+ 0x0108, 0x010a, 0x0073, 0x0110, 0x0112, 0x0114, 0x0120, 0x012c,
+ 0x0144, 0x014d, 0x0153, 0x0162, 0x0168, 0x016a, 0x0176, 0x0192,
+ 0x0194, 0x01a9, 0x01bb, 0x01c7, 0x01d1, 0x01d5, 0x02b9, 0x01d7,
+ 0x003b, 0x01d9, 0x01db, 0x00b7, 0x01e1, 0x01fc, 0x020c, 0x0218,
+ 0x021d, 0x0223, 0x0227, 0x03a3, 0x0233, 0x023f, 0x0242, 0x024b,
+ 0x024e, 0x0251, 0x025d, 0x0260, 0x0269, 0x026c, 0x026f, 0x0275,
+ 0x0278, 0x0281, 0x028a, 0x029c, 0x029f, 0x02a3, 0x02af, 0x02b9,
+ 0x02c5, 0x02c9, 0x02cd, 0x02d1, 0x02d5, 0x02e7, 0x02ed, 0x02f1,
+ 0x02f5, 0x02f9, 0x02fd, 0x0305, 0x0309, 0x030d, 0x0313, 0x0317,
+ 0x031b, 0x0323, 0x0327, 0x032b, 0x032f, 0x0335, 0x033d, 0x0341,
+ 0x0349, 0x034d, 0x0351, 0x0f0b, 0x0357, 0x035b, 0x035f, 0x0363,
+ 0x0367, 0x036b, 0x036f, 0x0373, 0x0379, 0x037d, 0x0381, 0x0385,
+ 0x0389, 0x038d, 0x0391, 0x0395, 0x0399, 0x039d, 0x03a1, 0x10dc,
+ 0x03a5, 0x03c9, 0x03cd, 0x03d9, 0x03dd, 0x03e1, 0x03ef, 0x03f1,
+ 0x043d, 0x044f, 0x0499, 0x04f0, 0x0502, 0x054a, 0x0564, 0x056c,
+ 0x0570, 0x0573, 0x059a, 0x05fa, 0x05fe, 0x0607, 0x060b, 0x0614,
+ 0x0618, 0x061e, 0x0622, 0x0628, 0x068e, 0x0694, 0x0698, 0x069e,
+ 0x06a2, 0x06ab, 0x03ac, 0x06f3, 0x03ad, 0x06f6, 0x03ae, 0x06f9,
+ 0x03af, 0x06fc, 0x03cc, 0x06ff, 0x03cd, 0x0702, 0x03ce, 0x0705,
+ 0x0709, 0x070d, 0x0711, 0x0386, 0x0732, 0x0735, 0x03b9, 0x0737,
+ 0x073b, 0x0388, 0x0753, 0x0389, 0x0756, 0x0390, 0x076b, 0x038a,
+ 0x0777, 0x03b0, 0x0789, 0x038e, 0x0799, 0x079f, 0x07a3, 0x038c,
+ 0x07b8, 0x038f, 0x07bb, 0x00b4, 0x07be, 0x07c0, 0x07c2, 0x2010,
+ 0x07cb, 0x002e, 0x07cd, 0x07cf, 0x0020, 0x07d2, 0x07d6, 0x07db,
+ 0x07df, 0x07e4, 0x07ea, 0x07f0, 0x0020, 0x07f6, 0x2212, 0x0801,
+ 0x0805, 0x0807, 0x081d, 0x0825, 0x0827, 0x0043, 0x082d, 0x0830,
+ 0x0190, 0x0836, 0x0839, 0x004e, 0x0845, 0x0847, 0x084c, 0x084e,
+ 0x0851, 0x005a, 0x03a9, 0x005a, 0x0853, 0x0857, 0x0860, 0x0069,
+ 0x0862, 0x0865, 0x086f, 0x0874, 0x087a, 0x087e, 0x08a2, 0x0049,
+ 0x08a4, 0x08a6, 0x08a9, 0x0056, 0x08ab, 0x08ad, 0x08b0, 0x08b4,
+ 0x0058, 0x08b6, 0x08b8, 0x08bb, 0x08c0, 0x08c2, 0x08c5, 0x0076,
+ 0x08c7, 0x08c9, 0x08cc, 0x08d0, 0x0078, 0x08d2, 0x08d4, 0x08d7,
+ 0x08db, 0x08de, 0x08e4, 0x08e7, 0x08f0, 0x08f3, 0x08f6, 0x08f9,
+ 0x0902, 0x0906, 0x090b, 0x090f, 0x0914, 0x0917, 0x091a, 0x0923,
+ 0x092c, 0x093b, 0x093e, 0x0941, 0x0944, 0x0947, 0x094a, 0x0956,
+ 0x095c, 0x0960, 0x0962, 0x0964, 0x0968, 0x096a, 0x0970, 0x0978,
+ 0x097c, 0x0980, 0x0986, 0x0989, 0x098f, 0x0991, 0x0030, 0x0993,
+ 0x0999, 0x099c, 0x099e, 0x09a1, 0x09a4, 0x2d61, 0x6bcd, 0x9f9f,
+ 0x09a6, 0x09b1, 0x09bc, 0x09c7, 0x0a95, 0x0aa1, 0x0b15, 0x0020,
+ 0x0b27, 0x0b31, 0x0b8d, 0x0ba1, 0x0ba5, 0x0ba9, 0x0bad, 0x0bb1,
+ 0x0bb5, 0x0bb9, 0x0bbd, 0x0bc1, 0x0bc5, 0x0c21, 0x0c35, 0x0c39,
+ 0x0c3d, 0x0c41, 0x0c45, 0x0c49, 0x0c4d, 0x0c51, 0x0c55, 0x0c59,
+ 0x0c6f, 0x0c71, 0x0c73, 0x0ca0, 0x0cbc, 0x0cdc, 0x0ce4, 0x0cec,
+ 0x0cf4, 0x0cfc, 0x0d04, 0x0d0c, 0x0d14, 0x0d22, 0x0d2e, 0x0d7a,
+ 0x0d82, 0x0d85, 0x0d89, 0x0d8d, 0x0d9d, 0x0db1, 0x0db5, 0x0dbc,
+ 0x0dc2, 0x0dc6, 0x0e28, 0x0e2c, 0x0e30, 0x0e32, 0x0e36, 0x0e3c,
+ 0x0e3e, 0x0e41, 0x0e43, 0x0e46, 0x0e77, 0x0e85, 0x0e8a, 0x0e90,
+ 0x0e98, 0x0e9f, 0x0ea5, 0x0eb0, 0x0eba, 0x0ec2, 0x0ec6, 0x0ecb,
+ 0x0ed5, 0x0ed9, 0x0ee0, 0x0ee8, 0x0eef, 0x0ef4, 0x0f00, 0x0f06,
+ 0x0f11, 0x0f17, 0x0f1e, 0x0f24, 0x0f2f, 0x0f39, 0x0f41, 0x0f48,
+ 0x0f4d, 0x0f53, 0x0f5a, 0x0f5f, 0x0f65, 0x0f6c, 0x0f72, 0x0f79,
+ 0x0f7e, 0x0f85, 0x0f89, 0x0f9a, 0x0fa0, 0x0fa5, 0x0fa9, 0x0fb4,
+ 0x0fba, 0x0fc5, 0x0fcc, 0x0fd2, 0x0fd6, 0x0fdd, 0x0fe1, 0x0feb,
+ 0x0ff6, 0x0ffc, 0x1000, 0x1005, 0x100b, 0x100f, 0x1016, 0x101b,
+ 0x101f, 0x1025, 0x102b, 0x102e, 0x1032, 0x1035, 0x103b, 0x1041,
+ 0x1055, 0x105d, 0x1075, 0x1078, 0x107c, 0x1091, 0x109d, 0x10ad,
+ 0x10bf, 0x10c7, 0x10cb, 0x10d6, 0x10da, 0x10e6, 0x10ee, 0x10f0,
+ 0x10fc, 0x1101, 0x110d, 0x113d, 0x1145, 0x1149, 0x114f, 0x1153,
+ 0x1156, 0x116a, 0x116d, 0x1171, 0x1177, 0x1179, 0x117d, 0x1180,
+ 0x1188, 0x118e, 0x1192, 0x1198, 0x119e, 0x11a4, 0x11a7, 0xa76f,
+ 0x11ab, 0x11af, 0x11b7, 0x1209, 0x1307, 0x1405, 0x1489, 0x148e,
+ 0x154c, 0x1565, 0x156b, 0x1571, 0x1577, 0x1583, 0x158f, 0x002b,
+ 0x159a, 0x15b2, 0x15b6, 0x15ba, 0x15be, 0x15c2, 0x15c6, 0x15da,
+ 0x15de, 0x1642, 0x165b, 0x1681, 0x1687, 0x1745, 0x174b, 0x1750,
+ 0x1770, 0x1870, 0x1876, 0x190a, 0x19cc, 0x1a70, 0x1a78, 0x1a96,
+ 0x1a9b, 0x1aaf, 0x1ab9, 0x1abf, 0x1ad3, 0x1ad8, 0x1ade, 0x1aec,
+ 0x1b1c, 0x1b29, 0x1b31, 0x1b35, 0x1b4b, 0x1bc2, 0x1bd4, 0x1bd6,
+ 0x1bd8, 0x3164, 0x1c19, 0x1c1b, 0x1c1d, 0x1c1f, 0x1c21, 0x1c23,
+ 0x1c41, 0x1c4f, 0x1c54, 0x1c5d, 0x1c66, 0x1c78, 0x1c81, 0x1ca1,
+ 0x1cbc, 0x1cbe, 0x1cc0, 0x1cc2, 0x1cc4, 0x1cc6, 0x1cc8, 0x1cca,
+ 0x1cea, 0x1cec, 0x1cee, 0x1cf0, 0x1cf2, 0x1cf9, 0x1cfb, 0x1cfd,
+ 0x1cff, 0x1d0e, 0x1d10, 0x1d12, 0x1d14, 0x1d16, 0x1d18, 0x1d1a,
+ 0x1d1c, 0x1d1e, 0x1d20, 0x1d22, 0x1d24, 0x1d26, 0x1d28, 0x1d2a,
+ 0x1d2e, 0x03f4, 0x1d30, 0x2207, 0x1d32, 0x2202, 0x1d34, 0x1d3c,
+ 0x03f4, 0x1d3e, 0x2207, 0x1d40, 0x2202, 0x1d42, 0x1d4a, 0x03f4,
+ 0x1d4c, 0x2207, 0x1d4e, 0x2202, 0x1d50, 0x1d58, 0x03f4, 0x1d5a,
+ 0x2207, 0x1d5c, 0x2202, 0x1d5e, 0x1d66, 0x03f4, 0x1d68, 0x2207,
+ 0x1d6a, 0x2202, 0x1d6c, 0x1d76, 0x1d78, 0x1d7a, 0x1d7c, 0x1d7e,
+ 0x1d80, 0x1d86, 0x1da3, 0x062d, 0x1dab, 0x1db7, 0x062c, 0x1dc7,
+ 0x1e37, 0x1e43, 0x1e56, 0x1e68, 0x1e7b, 0x1e7d, 0x1e81, 0x1e87,
+ 0x1e8d, 0x1e8f, 0x1e93, 0x1e95, 0x1e9d, 0x1ea0, 0x1ea2, 0x1ea6,
+ 0x1ea8, 0x30b5, 0x1eae, 0x1f06, 0x1f1c, 0x1f20, 0x1f25, 0x1f72,
+ 0x1f83, 0x2084, 0x2094, 0x209a, 0x2194, 0x22b2,
+};
+
+static const uint8_t unicode_decomp_data[9152] = {
+ 0x20, 0x88, 0x20, 0x84, 0x32, 0x33, 0x20, 0x81,
+ 0x20, 0xa7, 0x31, 0x6f, 0x31, 0xd0, 0x34, 0x31,
+ 0xd0, 0x32, 0x33, 0xd0, 0x34, 0x41, 0x80, 0x41,
+ 0x81, 0x41, 0x82, 0x41, 0x83, 0x41, 0x88, 0x41,
+ 0x8a, 0x00, 0x00, 0x43, 0xa7, 0x45, 0x80, 0x45,
+ 0x81, 0x45, 0x82, 0x45, 0x88, 0x49, 0x80, 0x49,
+ 0x81, 0x49, 0x82, 0x49, 0x88, 0x00, 0x00, 0x4e,
+ 0x83, 0x4f, 0x80, 0x4f, 0x81, 0x4f, 0x82, 0x4f,
+ 0x83, 0x4f, 0x88, 0x00, 0x00, 0x00, 0x00, 0x55,
+ 0x80, 0x55, 0x81, 0x55, 0x82, 0x55, 0x88, 0x59,
+ 0x81, 0x00, 0x00, 0x00, 0x00, 0x61, 0x80, 0x61,
+ 0x81, 0x61, 0x82, 0x61, 0x83, 0x61, 0x88, 0x61,
+ 0x8a, 0x00, 0x00, 0x63, 0xa7, 0x65, 0x80, 0x65,
+ 0x81, 0x65, 0x82, 0x65, 0x88, 0x69, 0x80, 0x69,
+ 0x81, 0x69, 0x82, 0x69, 0x88, 0x00, 0x00, 0x6e,
+ 0x83, 0x6f, 0x80, 0x6f, 0x81, 0x6f, 0x82, 0x6f,
+ 0x83, 0x6f, 0x88, 0x00, 0x00, 0x00, 0x00, 0x75,
+ 0x80, 0x75, 0x81, 0x75, 0x82, 0x75, 0x88, 0x79,
+ 0x81, 0x00, 0x00, 0x79, 0x88, 0x41, 0x84, 0x41,
+ 0x86, 0x41, 0xa8, 0x43, 0x81, 0x43, 0x82, 0x43,
+ 0x87, 0x43, 0x8c, 0x44, 0x8c, 0x45, 0x84, 0x45,
+ 0x86, 0x45, 0x87, 0x45, 0xa8, 0x45, 0x8c, 0x47,
+ 0x82, 0x47, 0x86, 0x47, 0x87, 0x47, 0xa7, 0x48,
+ 0x82, 0x49, 0x83, 0x49, 0x84, 0x49, 0x86, 0x49,
+ 0xa8, 0x49, 0x87, 0x49, 0x4a, 0x69, 0x6a, 0x4a,
+ 0x82, 0x4b, 0xa7, 0x4c, 0x81, 0x4c, 0xa7, 0x4c,
+ 0x8c, 0x4c, 0x00, 0x00, 0x6b, 0x20, 0x6b, 0x4e,
+ 0x81, 0x4e, 0xa7, 0x4e, 0x8c, 0xbc, 0x02, 0x6e,
+ 0x4f, 0x84, 0x4f, 0x86, 0x4f, 0x8b, 0x52, 0x81,
+ 0x52, 0xa7, 0x52, 0x8c, 0x53, 0x81, 0x53, 0x82,
+ 0x53, 0xa7, 0x53, 0x8c, 0x54, 0xa7, 0x54, 0x8c,
+ 0x55, 0x83, 0x55, 0x84, 0x55, 0x86, 0x55, 0x8a,
+ 0x55, 0x8b, 0x55, 0xa8, 0x57, 0x82, 0x59, 0x82,
+ 0x59, 0x88, 0x5a, 0x81, 0x5a, 0x87, 0x5a, 0x8c,
+ 0x4f, 0x9b, 0x55, 0x9b, 0x44, 0x00, 0x7d, 0x01,
+ 0x44, 0x00, 0x7e, 0x01, 0x64, 0x00, 0x7e, 0x01,
+ 0x4c, 0x4a, 0x4c, 0x6a, 0x6c, 0x6a, 0x4e, 0x4a,
+ 0x4e, 0x6a, 0x6e, 0x6a, 0x41, 0x00, 0x8c, 0x49,
+ 0x00, 0x8c, 0x4f, 0x00, 0x8c, 0x55, 0x00, 0x8c,
+ 0xdc, 0x00, 0x84, 0xdc, 0x00, 0x81, 0xdc, 0x00,
+ 0x8c, 0xdc, 0x00, 0x80, 0xc4, 0x00, 0x84, 0x26,
+ 0x02, 0x84, 0xc6, 0x00, 0x84, 0x47, 0x8c, 0x4b,
+ 0x8c, 0x4f, 0xa8, 0xea, 0x01, 0x84, 0xeb, 0x01,
+ 0x84, 0xb7, 0x01, 0x8c, 0x92, 0x02, 0x8c, 0x6a,
+ 0x00, 0x8c, 0x44, 0x5a, 0x44, 0x7a, 0x64, 0x7a,
+ 0x47, 0x81, 0x4e, 0x00, 0x80, 0xc5, 0x00, 0x81,
+ 0xc6, 0x00, 0x81, 0xd8, 0x00, 0x81, 0x41, 0x8f,
+ 0x41, 0x91, 0x45, 0x8f, 0x45, 0x91, 0x49, 0x8f,
+ 0x49, 0x91, 0x4f, 0x8f, 0x4f, 0x91, 0x52, 0x8f,
+ 0x52, 0x91, 0x55, 0x8f, 0x55, 0x91, 0x53, 0xa6,
+ 0x54, 0xa6, 0x48, 0x8c, 0x41, 0x00, 0x87, 0x45,
+ 0x00, 0xa7, 0xd6, 0x00, 0x84, 0xd5, 0x00, 0x84,
+ 0x4f, 0x00, 0x87, 0x2e, 0x02, 0x84, 0x59, 0x00,
+ 0x84, 0x68, 0x00, 0x66, 0x02, 0x6a, 0x00, 0x72,
+ 0x00, 0x79, 0x02, 0x7b, 0x02, 0x81, 0x02, 0x77,
+ 0x00, 0x79, 0x00, 0x20, 0x86, 0x20, 0x87, 0x20,
+ 0x8a, 0x20, 0xa8, 0x20, 0x83, 0x20, 0x8b, 0x63,
+ 0x02, 0x6c, 0x00, 0x73, 0x00, 0x78, 0x00, 0x95,
+ 0x02, 0x80, 0x81, 0x00, 0x93, 0x88, 0x81, 0x20,
+ 0xc5, 0x20, 0x81, 0xa8, 0x00, 0x81, 0x91, 0x03,
+ 0x81, 0x95, 0x03, 0x81, 0x97, 0x03, 0x81, 0x99,
+ 0x03, 0x81, 0x00, 0x00, 0x00, 0x9f, 0x03, 0x81,
+ 0x00, 0x00, 0x00, 0xa5, 0x03, 0x81, 0xa9, 0x03,
+ 0x81, 0xca, 0x03, 0x81, 0x01, 0x03, 0x98, 0x07,
+ 0xa4, 0x07, 0xb0, 0x00, 0xb4, 0x00, 0xb6, 0x00,
+ 0xb8, 0x00, 0xca, 0x00, 0x01, 0x03, 0xb8, 0x07,
+ 0xc4, 0x07, 0xbe, 0x00, 0xc4, 0x00, 0xc8, 0x00,
+ 0xa5, 0x03, 0x0d, 0x13, 0x00, 0x01, 0x03, 0xd1,
+ 0x00, 0xd1, 0x07, 0xc6, 0x03, 0xc0, 0x03, 0xba,
+ 0x03, 0xc1, 0x03, 0xc2, 0x03, 0x00, 0x00, 0x98,
+ 0x03, 0xb5, 0x03, 0x15, 0x04, 0x80, 0x15, 0x04,
+ 0x88, 0x00, 0x00, 0x00, 0x13, 0x04, 0x81, 0x06,
+ 0x04, 0x88, 0x1a, 0x04, 0x81, 0x18, 0x04, 0x80,
+ 0x23, 0x04, 0x86, 0x18, 0x04, 0x86, 0x38, 0x04,
+ 0x86, 0x35, 0x04, 0x80, 0x35, 0x04, 0x88, 0x00,
+ 0x00, 0x00, 0x33, 0x04, 0x81, 0x56, 0x04, 0x88,
+ 0x3a, 0x04, 0x81, 0x38, 0x04, 0x80, 0x43, 0x04,
+ 0x86, 0x74, 0x04, 0x8f, 0x16, 0x04, 0x86, 0x10,
+ 0x04, 0x86, 0x10, 0x04, 0x88, 0x15, 0x04, 0x86,
+ 0xd8, 0x04, 0x88, 0x16, 0x04, 0x88, 0x17, 0x04,
+ 0x88, 0x18, 0x04, 0x84, 0x18, 0x04, 0x88, 0x1e,
+ 0x04, 0x88, 0xe8, 0x04, 0x88, 0x2d, 0x04, 0x88,
+ 0x23, 0x04, 0x84, 0x23, 0x04, 0x88, 0x23, 0x04,
+ 0x8b, 0x27, 0x04, 0x88, 0x2b, 0x04, 0x88, 0x65,
+ 0x05, 0x82, 0x05, 0x27, 0x06, 0x00, 0x2c, 0x00,
+ 0x2d, 0x21, 0x2d, 0x00, 0x2e, 0x23, 0x2d, 0x27,
+ 0x06, 0x00, 0x4d, 0x21, 0x4d, 0xa0, 0x4d, 0x23,
+ 0x4d, 0xd5, 0x06, 0x54, 0x06, 0x00, 0x00, 0x00,
+ 0x00, 0xc1, 0x06, 0x54, 0x06, 0xd2, 0x06, 0x54,
+ 0x06, 0x28, 0x09, 0x3c, 0x09, 0x30, 0x09, 0x3c,
+ 0x09, 0x33, 0x09, 0x3c, 0x09, 0x15, 0x09, 0x00,
+ 0x27, 0x01, 0x27, 0x02, 0x27, 0x07, 0x27, 0x0c,
+ 0x27, 0x0d, 0x27, 0x16, 0x27, 0x1a, 0x27, 0xbe,
+ 0x09, 0x09, 0x00, 0x09, 0x19, 0xa1, 0x09, 0xbc,
+ 0x09, 0xaf, 0x09, 0xbc, 0x09, 0x32, 0x0a, 0x3c,
+ 0x0a, 0x38, 0x0a, 0x3c, 0x0a, 0x16, 0x0a, 0x00,
+ 0x26, 0x01, 0x26, 0x06, 0x26, 0x2b, 0x0a, 0x3c,
+ 0x0a, 0x47, 0x0b, 0x56, 0x0b, 0x3e, 0x0b, 0x09,
+ 0x00, 0x09, 0x19, 0x21, 0x0b, 0x3c, 0x0b, 0x92,
+ 0x0b, 0xd7, 0x0b, 0xbe, 0x0b, 0x08, 0x00, 0x09,
+ 0x00, 0x08, 0x19, 0x46, 0x0c, 0x56, 0x0c, 0xbf,
+ 0x0c, 0xd5, 0x0c, 0xc6, 0x0c, 0xd5, 0x0c, 0xc2,
+ 0x0c, 0x04, 0x00, 0x08, 0x13, 0x3e, 0x0d, 0x08,
+ 0x00, 0x09, 0x00, 0x08, 0x19, 0xd9, 0x0d, 0xca,
+ 0x0d, 0xca, 0x0d, 0x0f, 0x05, 0x12, 0x00, 0x0f,
+ 0x15, 0x4d, 0x0e, 0x32, 0x0e, 0xcd, 0x0e, 0xb2,
+ 0x0e, 0x99, 0x0e, 0x12, 0x00, 0x12, 0x08, 0x42,
+ 0x0f, 0xb7, 0x0f, 0x4c, 0x0f, 0xb7, 0x0f, 0x51,
+ 0x0f, 0xb7, 0x0f, 0x56, 0x0f, 0xb7, 0x0f, 0x5b,
+ 0x0f, 0xb7, 0x0f, 0x40, 0x0f, 0xb5, 0x0f, 0x71,
+ 0x0f, 0x72, 0x0f, 0x71, 0x0f, 0x00, 0x03, 0x41,
+ 0x0f, 0xb2, 0x0f, 0x81, 0x0f, 0xb3, 0x0f, 0x80,
+ 0x0f, 0xb3, 0x0f, 0x81, 0x0f, 0x71, 0x0f, 0x80,
+ 0x0f, 0x92, 0x0f, 0xb7, 0x0f, 0x9c, 0x0f, 0xb7,
+ 0x0f, 0xa1, 0x0f, 0xb7, 0x0f, 0xa6, 0x0f, 0xb7,
+ 0x0f, 0xab, 0x0f, 0xb7, 0x0f, 0x90, 0x0f, 0xb5,
+ 0x0f, 0x25, 0x10, 0x2e, 0x10, 0x05, 0x1b, 0x35,
+ 0x1b, 0x00, 0x00, 0x00, 0x00, 0x07, 0x1b, 0x35,
+ 0x1b, 0x00, 0x00, 0x00, 0x00, 0x09, 0x1b, 0x35,
+ 0x1b, 0x00, 0x00, 0x00, 0x00, 0x0b, 0x1b, 0x35,
+ 0x1b, 0x00, 0x00, 0x00, 0x00, 0x0d, 0x1b, 0x35,
+ 0x1b, 0x11, 0x1b, 0x35, 0x1b, 0x3a, 0x1b, 0x35,
+ 0x1b, 0x00, 0x00, 0x00, 0x00, 0x3c, 0x1b, 0x35,
+ 0x1b, 0x3e, 0x1b, 0x35, 0x1b, 0x42, 0x1b, 0x35,
+ 0x1b, 0x41, 0x00, 0xc6, 0x00, 0x42, 0x00, 0x00,
+ 0x00, 0x44, 0x00, 0x45, 0x00, 0x8e, 0x01, 0x47,
+ 0x00, 0x4f, 0x00, 0x22, 0x02, 0x50, 0x00, 0x52,
+ 0x00, 0x54, 0x00, 0x55, 0x00, 0x57, 0x00, 0x61,
+ 0x00, 0x50, 0x02, 0x51, 0x02, 0x02, 0x1d, 0x62,
+ 0x00, 0x64, 0x00, 0x65, 0x00, 0x59, 0x02, 0x5b,
+ 0x02, 0x5c, 0x02, 0x67, 0x00, 0x00, 0x00, 0x6b,
+ 0x00, 0x6d, 0x00, 0x4b, 0x01, 0x6f, 0x00, 0x54,
+ 0x02, 0x16, 0x1d, 0x17, 0x1d, 0x70, 0x00, 0x74,
+ 0x00, 0x75, 0x00, 0x1d, 0x1d, 0x6f, 0x02, 0x76,
+ 0x00, 0x25, 0x1d, 0xb2, 0x03, 0xb3, 0x03, 0xb4,
+ 0x03, 0xc6, 0x03, 0xc7, 0x03, 0x69, 0x00, 0x72,
+ 0x00, 0x75, 0x00, 0x76, 0x00, 0xb2, 0x03, 0xb3,
+ 0x03, 0xc1, 0x03, 0xc6, 0x03, 0xc7, 0x03, 0x52,
+ 0x02, 0x63, 0x00, 0x55, 0x02, 0xf0, 0x00, 0x5c,
+ 0x02, 0x66, 0x00, 0x5f, 0x02, 0x61, 0x02, 0x65,
+ 0x02, 0x68, 0x02, 0x69, 0x02, 0x6a, 0x02, 0x7b,
+ 0x1d, 0x9d, 0x02, 0x6d, 0x02, 0x85, 0x1d, 0x9f,
+ 0x02, 0x71, 0x02, 0x70, 0x02, 0x72, 0x02, 0x73,
+ 0x02, 0x74, 0x02, 0x75, 0x02, 0x78, 0x02, 0x82,
+ 0x02, 0x83, 0x02, 0xab, 0x01, 0x89, 0x02, 0x8a,
+ 0x02, 0x1c, 0x1d, 0x8b, 0x02, 0x8c, 0x02, 0x7a,
+ 0x00, 0x90, 0x02, 0x91, 0x02, 0x92, 0x02, 0xb8,
+ 0x03, 0x41, 0x00, 0xa5, 0x42, 0x00, 0x87, 0x42,
+ 0x00, 0xa3, 0x42, 0x00, 0xb1, 0xc7, 0x00, 0x81,
+ 0x44, 0x00, 0x87, 0x44, 0x00, 0xa3, 0x44, 0x00,
+ 0xb1, 0x44, 0x00, 0xa7, 0x44, 0x00, 0xad, 0x12,
+ 0x01, 0x80, 0x12, 0x01, 0x81, 0x45, 0x00, 0xad,
+ 0x45, 0x00, 0xb0, 0x28, 0x02, 0x86, 0x46, 0x00,
+ 0x87, 0x47, 0x00, 0x84, 0x48, 0x00, 0x87, 0x48,
+ 0x00, 0xa3, 0x48, 0x00, 0x88, 0x48, 0x00, 0xa7,
+ 0x48, 0x00, 0xae, 0x49, 0x00, 0xb0, 0xcf, 0x00,
+ 0x81, 0x4b, 0x00, 0x81, 0x4b, 0x00, 0xa3, 0x4b,
+ 0x00, 0xb1, 0x4c, 0x00, 0xa3, 0x36, 0x1e, 0x84,
+ 0x4c, 0xb1, 0x4c, 0xad, 0x4d, 0x81, 0x4d, 0x87,
+ 0x4d, 0xa3, 0x4e, 0x87, 0x4e, 0xa3, 0x4e, 0xb1,
+ 0x4e, 0xad, 0xd5, 0x00, 0x81, 0xd5, 0x00, 0x88,
+ 0x4c, 0x01, 0x80, 0x4c, 0x01, 0x81, 0x50, 0x00,
+ 0x81, 0x50, 0x00, 0x87, 0x52, 0x00, 0x87, 0x52,
+ 0x00, 0xa3, 0x5a, 0x1e, 0x84, 0x52, 0x00, 0xb1,
+ 0x53, 0x00, 0x87, 0x53, 0x00, 0xa3, 0x5a, 0x01,
+ 0x87, 0x60, 0x01, 0x87, 0x62, 0x1e, 0x87, 0x54,
+ 0x00, 0x87, 0x54, 0x00, 0xa3, 0x54, 0x00, 0xb1,
+ 0x54, 0x00, 0xad, 0x55, 0x00, 0xa4, 0x55, 0x00,
+ 0xb0, 0x55, 0x00, 0xad, 0x68, 0x01, 0x81, 0x6a,
+ 0x01, 0x88, 0x56, 0x83, 0x56, 0xa3, 0x57, 0x80,
+ 0x57, 0x81, 0x57, 0x88, 0x57, 0x87, 0x57, 0xa3,
+ 0x58, 0x87, 0x58, 0x88, 0x59, 0x87, 0x5a, 0x82,
+ 0x5a, 0xa3, 0x5a, 0xb1, 0x68, 0xb1, 0x74, 0x88,
+ 0x77, 0x8a, 0x79, 0x8a, 0x61, 0x00, 0xbe, 0x02,
+ 0x7f, 0x01, 0x87, 0x41, 0x00, 0xa3, 0x41, 0x00,
+ 0x89, 0xc2, 0x00, 0x81, 0xc2, 0x00, 0x80, 0xc2,
+ 0x00, 0x89, 0xc2, 0x00, 0x83, 0xa0, 0x1e, 0x82,
+ 0x02, 0x01, 0x81, 0x02, 0x01, 0x80, 0x02, 0x01,
+ 0x89, 0x02, 0x01, 0x83, 0xa0, 0x1e, 0x86, 0x45,
+ 0x00, 0xa3, 0x45, 0x00, 0x89, 0x45, 0x00, 0x83,
+ 0xca, 0x00, 0x81, 0xca, 0x00, 0x80, 0xca, 0x00,
+ 0x89, 0xca, 0x00, 0x83, 0xb8, 0x1e, 0x82, 0x49,
+ 0x00, 0x89, 0x49, 0x00, 0xa3, 0x4f, 0x00, 0xa3,
+ 0x4f, 0x00, 0x89, 0xd4, 0x00, 0x81, 0xd4, 0x00,
+ 0x80, 0xd4, 0x00, 0x89, 0xd4, 0x00, 0x83, 0xcc,
+ 0x1e, 0x82, 0xa0, 0x01, 0x81, 0xa0, 0x01, 0x80,
+ 0xa0, 0x01, 0x89, 0xa0, 0x01, 0x83, 0xa0, 0x01,
+ 0xa3, 0x55, 0x00, 0xa3, 0x55, 0x00, 0x89, 0xaf,
+ 0x01, 0x81, 0xaf, 0x01, 0x80, 0xaf, 0x01, 0x89,
+ 0xaf, 0x01, 0x83, 0xaf, 0x01, 0xa3, 0x59, 0x00,
+ 0x80, 0x59, 0x00, 0xa3, 0x59, 0x00, 0x89, 0x59,
+ 0x00, 0x83, 0xb1, 0x03, 0x13, 0x03, 0x00, 0x1f,
+ 0x80, 0x00, 0x1f, 0x81, 0x00, 0x1f, 0xc2, 0x91,
+ 0x03, 0x13, 0x03, 0x08, 0x1f, 0x80, 0x08, 0x1f,
+ 0x81, 0x08, 0x1f, 0xc2, 0xb5, 0x03, 0x13, 0x03,
+ 0x10, 0x1f, 0x80, 0x10, 0x1f, 0x81, 0x95, 0x03,
+ 0x13, 0x03, 0x18, 0x1f, 0x80, 0x18, 0x1f, 0x81,
+ 0xb7, 0x03, 0x93, 0xb7, 0x03, 0x94, 0x20, 0x1f,
+ 0x80, 0x21, 0x1f, 0x80, 0x20, 0x1f, 0x81, 0x21,
+ 0x1f, 0x81, 0x20, 0x1f, 0xc2, 0x21, 0x1f, 0xc2,
+ 0x97, 0x03, 0x93, 0x97, 0x03, 0x94, 0x28, 0x1f,
+ 0x80, 0x29, 0x1f, 0x80, 0x28, 0x1f, 0x81, 0x29,
+ 0x1f, 0x81, 0x28, 0x1f, 0xc2, 0x29, 0x1f, 0xc2,
+ 0xb9, 0x03, 0x93, 0xb9, 0x03, 0x94, 0x30, 0x1f,
+ 0x80, 0x31, 0x1f, 0x80, 0x30, 0x1f, 0x81, 0x31,
+ 0x1f, 0x81, 0x30, 0x1f, 0xc2, 0x31, 0x1f, 0xc2,
+ 0x99, 0x03, 0x93, 0x99, 0x03, 0x94, 0x38, 0x1f,
+ 0x80, 0x39, 0x1f, 0x80, 0x38, 0x1f, 0x81, 0x39,
+ 0x1f, 0x81, 0x38, 0x1f, 0xc2, 0x39, 0x1f, 0xc2,
+ 0xbf, 0x03, 0x93, 0xbf, 0x03, 0x94, 0x40, 0x1f,
+ 0x80, 0x40, 0x1f, 0x81, 0x9f, 0x03, 0x13, 0x03,
+ 0x48, 0x1f, 0x80, 0x48, 0x1f, 0x81, 0xc5, 0x03,
+ 0x13, 0x03, 0x50, 0x1f, 0x80, 0x50, 0x1f, 0x81,
+ 0x50, 0x1f, 0xc2, 0xa5, 0x03, 0x94, 0x00, 0x00,
+ 0x00, 0x59, 0x1f, 0x80, 0x00, 0x00, 0x00, 0x59,
+ 0x1f, 0x81, 0x00, 0x00, 0x00, 0x59, 0x1f, 0xc2,
+ 0xc9, 0x03, 0x93, 0xc9, 0x03, 0x94, 0x60, 0x1f,
+ 0x80, 0x61, 0x1f, 0x80, 0x60, 0x1f, 0x81, 0x61,
+ 0x1f, 0x81, 0x60, 0x1f, 0xc2, 0x61, 0x1f, 0xc2,
+ 0xa9, 0x03, 0x93, 0xa9, 0x03, 0x94, 0x68, 0x1f,
+ 0x80, 0x69, 0x1f, 0x80, 0x68, 0x1f, 0x81, 0x69,
+ 0x1f, 0x81, 0x68, 0x1f, 0xc2, 0x69, 0x1f, 0xc2,
+ 0xb1, 0x03, 0x80, 0xb5, 0x03, 0x80, 0xb7, 0x03,
+ 0x80, 0xb9, 0x03, 0x80, 0xbf, 0x03, 0x80, 0xc5,
+ 0x03, 0x80, 0xc9, 0x03, 0x80, 0x00, 0x1f, 0x45,
+ 0x03, 0x20, 0x1f, 0x45, 0x03, 0x60, 0x1f, 0x45,
+ 0x03, 0xb1, 0x03, 0x86, 0xb1, 0x03, 0x84, 0x70,
+ 0x1f, 0xc5, 0xb1, 0x03, 0xc5, 0xac, 0x03, 0xc5,
+ 0x00, 0x00, 0x00, 0xb1, 0x03, 0xc2, 0xb6, 0x1f,
+ 0xc5, 0x91, 0x03, 0x86, 0x91, 0x03, 0x84, 0x91,
+ 0x03, 0x80, 0x91, 0x03, 0xc5, 0x20, 0x93, 0x20,
+ 0x93, 0x20, 0xc2, 0xa8, 0x00, 0xc2, 0x74, 0x1f,
+ 0xc5, 0xb7, 0x03, 0xc5, 0xae, 0x03, 0xc5, 0x00,
+ 0x00, 0x00, 0xb7, 0x03, 0xc2, 0xc6, 0x1f, 0xc5,
+ 0x95, 0x03, 0x80, 0x97, 0x03, 0x80, 0x97, 0x03,
+ 0xc5, 0xbf, 0x1f, 0x80, 0xbf, 0x1f, 0x81, 0xbf,
+ 0x1f, 0xc2, 0xb9, 0x03, 0x86, 0xb9, 0x03, 0x84,
+ 0xca, 0x03, 0x80, 0x00, 0x03, 0xb9, 0x42, 0xca,
+ 0x42, 0x99, 0x06, 0x99, 0x04, 0x99, 0x00, 0xfe,
+ 0x1f, 0x80, 0xfe, 0x1f, 0x81, 0xfe, 0x1f, 0xc2,
+ 0xc5, 0x03, 0x86, 0xc5, 0x03, 0x84, 0xcb, 0x03,
+ 0x80, 0x00, 0x03, 0xc1, 0x13, 0xc1, 0x14, 0xc5,
+ 0x42, 0xcb, 0x42, 0xa5, 0x06, 0xa5, 0x04, 0xa5,
+ 0x00, 0xa1, 0x03, 0x94, 0xa8, 0x00, 0x80, 0x85,
+ 0x03, 0x60, 0x00, 0x7c, 0x1f, 0xc5, 0xc9, 0x03,
+ 0xc5, 0xce, 0x03, 0xc5, 0x00, 0x00, 0x00, 0xc9,
+ 0x03, 0xc2, 0xf6, 0x1f, 0xc5, 0x9f, 0x03, 0x80,
+ 0xa9, 0x03, 0x80, 0xa9, 0x03, 0xc5, 0x20, 0x94,
+ 0x02, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20,
+ 0x20, 0x20, 0x20, 0x20, 0xb3, 0x2e, 0x2e, 0x2e,
+ 0x2e, 0x2e, 0x32, 0x20, 0x32, 0x20, 0x32, 0x20,
+ 0x00, 0x00, 0x00, 0x35, 0x20, 0x35, 0x20, 0x35,
+ 0x20, 0x00, 0x00, 0x00, 0x21, 0x21, 0x00, 0x00,
+ 0x20, 0x85, 0x3f, 0x3f, 0x3f, 0x21, 0x21, 0x3f,
+ 0x32, 0x20, 0x00, 0x00, 0x00, 0x00, 0x30, 0x69,
+ 0x00, 0x00, 0x34, 0x35, 0x36, 0x37, 0x38, 0x39,
+ 0x2b, 0x3d, 0x28, 0x29, 0x6e, 0x30, 0x00, 0x2b,
+ 0x00, 0x12, 0x22, 0x3d, 0x00, 0x28, 0x00, 0x29,
+ 0x00, 0x00, 0x00, 0x61, 0x00, 0x65, 0x00, 0x6f,
+ 0x00, 0x78, 0x00, 0x59, 0x02, 0x68, 0x6b, 0x6c,
+ 0x6d, 0x6e, 0x70, 0x73, 0x74, 0x52, 0x73, 0x61,
+ 0x2f, 0x63, 0x61, 0x2f, 0x73, 0xb0, 0x00, 0x43,
+ 0x63, 0x2f, 0x6f, 0x63, 0x2f, 0x75, 0xb0, 0x00,
+ 0x46, 0x48, 0x00, 0x1f, 0x00, 0x00, 0x00, 0x20,
+ 0xdf, 0x01, 0x01, 0x04, 0x24, 0x4e, 0x6f, 0x50,
+ 0x51, 0x52, 0x52, 0x52, 0x53, 0x4d, 0x54, 0x45,
+ 0x4c, 0x54, 0x4d, 0x4b, 0x00, 0xc5, 0x00, 0x42,
+ 0x43, 0x00, 0x65, 0x45, 0x46, 0x00, 0x4d, 0x6f,
+ 0xd0, 0x05, 0x46, 0x41, 0x58, 0xc0, 0x03, 0xb3,
+ 0x03, 0x93, 0x03, 0xa0, 0x03, 0x11, 0x22, 0x44,
+ 0x64, 0x65, 0x69, 0x6a, 0x31, 0xd0, 0x37, 0x31,
+ 0xd0, 0x39, 0x31, 0xd0, 0x31, 0x30, 0x31, 0xd0,
+ 0x33, 0x32, 0xd0, 0x33, 0x31, 0xd0, 0x35, 0x32,
+ 0xd0, 0x35, 0x33, 0xd0, 0x35, 0x34, 0xd0, 0x35,
+ 0x31, 0xd0, 0x36, 0x35, 0xd0, 0x36, 0x31, 0xd0,
+ 0x38, 0x33, 0xd0, 0x38, 0x35, 0xd0, 0x38, 0x37,
+ 0xd0, 0x38, 0x31, 0xd0, 0x49, 0x49, 0x49, 0x49,
+ 0x49, 0x49, 0x56, 0x56, 0x49, 0x56, 0x49, 0x49,
+ 0x56, 0x49, 0x49, 0x49, 0x49, 0x58, 0x58, 0x49,
+ 0x58, 0x49, 0x49, 0x4c, 0x43, 0x44, 0x4d, 0x69,
+ 0x69, 0x69, 0x69, 0x69, 0x69, 0x69, 0x76, 0x76,
+ 0x69, 0x76, 0x69, 0x69, 0x76, 0x69, 0x69, 0x69,
+ 0x69, 0x78, 0x78, 0x69, 0x78, 0x69, 0x69, 0x6c,
+ 0x63, 0x64, 0x6d, 0x30, 0xd0, 0x33, 0x90, 0x21,
+ 0xb8, 0x92, 0x21, 0xb8, 0x94, 0x21, 0xb8, 0xd0,
+ 0x21, 0xb8, 0xd4, 0x21, 0xb8, 0xd2, 0x21, 0xb8,
+ 0x03, 0x22, 0xb8, 0x08, 0x22, 0xb8, 0x0b, 0x22,
+ 0xb8, 0x23, 0x22, 0xb8, 0x00, 0x00, 0x00, 0x25,
+ 0x22, 0xb8, 0x2b, 0x22, 0x2b, 0x22, 0x2b, 0x22,
+ 0x00, 0x00, 0x00, 0x2e, 0x22, 0x2e, 0x22, 0x2e,
+ 0x22, 0x00, 0x00, 0x00, 0x3c, 0x22, 0xb8, 0x43,
+ 0x22, 0xb8, 0x45, 0x22, 0xb8, 0x00, 0x00, 0x00,
+ 0x48, 0x22, 0xb8, 0x3d, 0x00, 0xb8, 0x00, 0x00,
+ 0x00, 0x61, 0x22, 0xb8, 0x4d, 0x22, 0xb8, 0x3c,
+ 0x00, 0xb8, 0x3e, 0x00, 0xb8, 0x64, 0x22, 0xb8,
+ 0x65, 0x22, 0xb8, 0x72, 0x22, 0xb8, 0x76, 0x22,
+ 0xb8, 0x7a, 0x22, 0xb8, 0x82, 0x22, 0xb8, 0x86,
+ 0x22, 0xb8, 0xa2, 0x22, 0xb8, 0xa8, 0x22, 0xb8,
+ 0xa9, 0x22, 0xb8, 0xab, 0x22, 0xb8, 0x7c, 0x22,
+ 0xb8, 0x91, 0x22, 0xb8, 0xb2, 0x22, 0x38, 0x03,
+ 0x08, 0x30, 0x31, 0x00, 0x31, 0x00, 0x30, 0x00,
+ 0x32, 0x30, 0x28, 0x00, 0x31, 0x00, 0x29, 0x00,
+ 0x28, 0x00, 0x31, 0x00, 0x30, 0x00, 0x29, 0x00,
+ 0x28, 0x32, 0x30, 0x29, 0x31, 0x00, 0x2e, 0x00,
+ 0x31, 0x00, 0x30, 0x00, 0x2e, 0x00, 0x32, 0x30,
+ 0x2e, 0x28, 0x00, 0x61, 0x00, 0x29, 0x00, 0x41,
+ 0x00, 0x61, 0x00, 0x2b, 0x22, 0x00, 0x00, 0x00,
+ 0x00, 0x3a, 0x3a, 0x3d, 0x3d, 0x3d, 0x3d, 0x3d,
+ 0x3d, 0xdd, 0x2a, 0xb8, 0x6a, 0x56, 0x00, 0x4e,
+ 0x00, 0x28, 0x36, 0x3f, 0x59, 0x85, 0x8c, 0xa0,
+ 0xba, 0x3f, 0x51, 0x00, 0x26, 0x2c, 0x43, 0x57,
+ 0x6c, 0xa1, 0xb6, 0xc1, 0x9b, 0x52, 0x00, 0x5e,
+ 0x7a, 0x7f, 0x9d, 0xa6, 0xc1, 0xce, 0xe7, 0xb6,
+ 0x53, 0xc8, 0x53, 0xe3, 0x53, 0xd7, 0x56, 0x1f,
+ 0x57, 0xeb, 0x58, 0x02, 0x59, 0x0a, 0x59, 0x15,
+ 0x59, 0x27, 0x59, 0x73, 0x59, 0x50, 0x5b, 0x80,
+ 0x5b, 0xf8, 0x5b, 0x0f, 0x5c, 0x22, 0x5c, 0x38,
+ 0x5c, 0x6e, 0x5c, 0x71, 0x5c, 0xdb, 0x5d, 0xe5,
+ 0x5d, 0xf1, 0x5d, 0xfe, 0x5d, 0x72, 0x5e, 0x7a,
+ 0x5e, 0x7f, 0x5e, 0xf4, 0x5e, 0xfe, 0x5e, 0x0b,
+ 0x5f, 0x13, 0x5f, 0x50, 0x5f, 0x61, 0x5f, 0x73,
+ 0x5f, 0xc3, 0x5f, 0x08, 0x62, 0x36, 0x62, 0x4b,
+ 0x62, 0x2f, 0x65, 0x34, 0x65, 0x87, 0x65, 0x97,
+ 0x65, 0xa4, 0x65, 0xb9, 0x65, 0xe0, 0x65, 0xe5,
+ 0x65, 0xf0, 0x66, 0x08, 0x67, 0x28, 0x67, 0x20,
+ 0x6b, 0x62, 0x6b, 0x79, 0x6b, 0xb3, 0x6b, 0xcb,
+ 0x6b, 0xd4, 0x6b, 0xdb, 0x6b, 0x0f, 0x6c, 0x14,
+ 0x6c, 0x34, 0x6c, 0x6b, 0x70, 0x2a, 0x72, 0x36,
+ 0x72, 0x3b, 0x72, 0x3f, 0x72, 0x47, 0x72, 0x59,
+ 0x72, 0x5b, 0x72, 0xac, 0x72, 0x84, 0x73, 0x89,
+ 0x73, 0xdc, 0x74, 0xe6, 0x74, 0x18, 0x75, 0x1f,
+ 0x75, 0x28, 0x75, 0x30, 0x75, 0x8b, 0x75, 0x92,
+ 0x75, 0x76, 0x76, 0x7d, 0x76, 0xae, 0x76, 0xbf,
+ 0x76, 0xee, 0x76, 0xdb, 0x77, 0xe2, 0x77, 0xf3,
+ 0x77, 0x3a, 0x79, 0xb8, 0x79, 0xbe, 0x79, 0x74,
+ 0x7a, 0xcb, 0x7a, 0xf9, 0x7a, 0x73, 0x7c, 0xf8,
+ 0x7c, 0x36, 0x7f, 0x51, 0x7f, 0x8a, 0x7f, 0xbd,
+ 0x7f, 0x01, 0x80, 0x0c, 0x80, 0x12, 0x80, 0x33,
+ 0x80, 0x7f, 0x80, 0x89, 0x80, 0xe3, 0x81, 0x00,
+ 0x07, 0x10, 0x19, 0x29, 0x38, 0x3c, 0x8b, 0x8f,
+ 0x95, 0x4d, 0x86, 0x6b, 0x86, 0x40, 0x88, 0x4c,
+ 0x88, 0x63, 0x88, 0x7e, 0x89, 0x8b, 0x89, 0xd2,
+ 0x89, 0x00, 0x8a, 0x37, 0x8c, 0x46, 0x8c, 0x55,
+ 0x8c, 0x78, 0x8c, 0x9d, 0x8c, 0x64, 0x8d, 0x70,
+ 0x8d, 0xb3, 0x8d, 0xab, 0x8e, 0xca, 0x8e, 0x9b,
+ 0x8f, 0xb0, 0x8f, 0xb5, 0x8f, 0x91, 0x90, 0x49,
+ 0x91, 0xc6, 0x91, 0xcc, 0x91, 0xd1, 0x91, 0x77,
+ 0x95, 0x80, 0x95, 0x1c, 0x96, 0xb6, 0x96, 0xb9,
+ 0x96, 0xe8, 0x96, 0x51, 0x97, 0x5e, 0x97, 0x62,
+ 0x97, 0x69, 0x97, 0xcb, 0x97, 0xed, 0x97, 0xf3,
+ 0x97, 0x01, 0x98, 0xa8, 0x98, 0xdb, 0x98, 0xdf,
+ 0x98, 0x96, 0x99, 0x99, 0x99, 0xac, 0x99, 0xa8,
+ 0x9a, 0xd8, 0x9a, 0xdf, 0x9a, 0x25, 0x9b, 0x2f,
+ 0x9b, 0x32, 0x9b, 0x3c, 0x9b, 0x5a, 0x9b, 0xe5,
+ 0x9c, 0x75, 0x9e, 0x7f, 0x9e, 0xa5, 0x9e, 0x00,
+ 0x16, 0x1e, 0x28, 0x2c, 0x54, 0x58, 0x69, 0x6e,
+ 0x7b, 0x96, 0xa5, 0xad, 0xe8, 0xf7, 0xfb, 0x12,
+ 0x30, 0x00, 0x00, 0x41, 0x53, 0x44, 0x53, 0x45,
+ 0x53, 0x4b, 0x30, 0x99, 0x30, 0x00, 0x00, 0x00,
+ 0x00, 0x4d, 0x30, 0x99, 0x30, 0x00, 0x00, 0x00,
+ 0x00, 0x4f, 0x30, 0x99, 0x30, 0x00, 0x00, 0x00,
+ 0x00, 0x51, 0x30, 0x99, 0x30, 0x00, 0x00, 0x00,
+ 0x00, 0x53, 0x30, 0x99, 0x30, 0x00, 0x00, 0x00,
+ 0x00, 0x55, 0x30, 0x99, 0x30, 0x00, 0x00, 0x00,
+ 0x00, 0x57, 0x30, 0x99, 0x30, 0x00, 0x00, 0x00,
+ 0x00, 0x59, 0x30, 0x99, 0x30, 0x00, 0x00, 0x00,
+ 0x00, 0x5b, 0x30, 0x99, 0x30, 0x00, 0x00, 0x00,
+ 0x00, 0x5d, 0x30, 0x99, 0x30, 0x00, 0x00, 0x00,
+ 0x00, 0x5f, 0x30, 0x99, 0x30, 0x00, 0x00, 0x00,
+ 0x00, 0x61, 0x30, 0x99, 0x30, 0x64, 0x30, 0x99,
+ 0x30, 0x00, 0x00, 0x00, 0x00, 0x66, 0x30, 0x99,
+ 0x30, 0x00, 0x00, 0x00, 0x00, 0x68, 0x30, 0x99,
+ 0x30, 0x6f, 0x30, 0x99, 0x30, 0x72, 0x30, 0x99,
+ 0x30, 0x75, 0x30, 0x99, 0x30, 0x78, 0x30, 0x99,
+ 0x30, 0x7b, 0x30, 0x99, 0x30, 0x46, 0x30, 0x99,
+ 0x30, 0x20, 0x00, 0x99, 0x30, 0x9d, 0x30, 0x99,
+ 0x30, 0x88, 0x30, 0x8a, 0x30, 0xab, 0x30, 0x99,
+ 0x30, 0x00, 0x00, 0x00, 0x00, 0xad, 0x30, 0x99,
+ 0x30, 0x00, 0x00, 0x00, 0x00, 0xaf, 0x30, 0x99,
+ 0x30, 0x00, 0x00, 0x00, 0x00, 0xb1, 0x30, 0x99,
+ 0x30, 0x00, 0x00, 0x00, 0x00, 0xb3, 0x30, 0x99,
+ 0x30, 0x00, 0x00, 0x00, 0x00, 0xb5, 0x30, 0x99,
+ 0x30, 0x00, 0x00, 0x00, 0x00, 0xb7, 0x30, 0x99,
+ 0x30, 0x00, 0x00, 0x00, 0x00, 0xb9, 0x30, 0x99,
+ 0x30, 0x00, 0x00, 0x00, 0x00, 0xbb, 0x30, 0x99,
+ 0x30, 0x00, 0x00, 0x00, 0x00, 0xbd, 0x30, 0x99,
+ 0x30, 0x00, 0x00, 0x00, 0x00, 0xbf, 0x30, 0x99,
+ 0x30, 0x00, 0x00, 0x00, 0x00, 0xc1, 0x30, 0x99,
+ 0x30, 0xc4, 0x30, 0x99, 0x30, 0x00, 0x00, 0x00,
+ 0x00, 0xc6, 0x30, 0x99, 0x30, 0x00, 0x00, 0x00,
+ 0x00, 0xc8, 0x30, 0x99, 0x30, 0xcf, 0x30, 0x99,
+ 0x30, 0xd2, 0x30, 0x99, 0x30, 0xd5, 0x30, 0x99,
+ 0x30, 0xd8, 0x30, 0x99, 0x30, 0xdb, 0x30, 0x99,
+ 0x30, 0xa6, 0x30, 0x99, 0x30, 0xef, 0x30, 0x99,
+ 0x30, 0xfd, 0x30, 0x99, 0x30, 0xb3, 0x30, 0xc8,
+ 0x30, 0x00, 0x11, 0x00, 0x01, 0xaa, 0x02, 0xac,
+ 0xad, 0x03, 0x04, 0x05, 0xb0, 0xb1, 0xb2, 0xb3,
+ 0xb4, 0xb5, 0x1a, 0x06, 0x07, 0x08, 0x21, 0x09,
+ 0x11, 0x61, 0x11, 0x14, 0x11, 0x4c, 0x00, 0x01,
+ 0xb3, 0xb4, 0xb8, 0xba, 0xbf, 0xc3, 0xc5, 0x08,
+ 0xc9, 0xcb, 0x09, 0x0a, 0x0c, 0x0e, 0x0f, 0x13,
+ 0x15, 0x17, 0x18, 0x19, 0x1a, 0x1b, 0x1e, 0x22,
+ 0x2c, 0x33, 0x38, 0xdd, 0xde, 0x43, 0x44, 0x45,
+ 0x70, 0x71, 0x74, 0x7d, 0x7e, 0x80, 0x8a, 0x8d,
+ 0x00, 0x4e, 0x8c, 0x4e, 0x09, 0x4e, 0xdb, 0x56,
+ 0x0a, 0x4e, 0x2d, 0x4e, 0x0b, 0x4e, 0x32, 0x75,
+ 0x59, 0x4e, 0x19, 0x4e, 0x01, 0x4e, 0x29, 0x59,
+ 0x30, 0x57, 0xba, 0x4e, 0x28, 0x00, 0x29, 0x00,
+ 0x00, 0x11, 0x02, 0x11, 0x03, 0x11, 0x05, 0x11,
+ 0x06, 0x11, 0x07, 0x11, 0x09, 0x11, 0x0b, 0x11,
+ 0x0c, 0x11, 0x0e, 0x11, 0x0f, 0x11, 0x10, 0x11,
+ 0x11, 0x11, 0x12, 0x11, 0x28, 0x00, 0x00, 0x11,
+ 0x61, 0x11, 0x29, 0x00, 0x28, 0x00, 0x02, 0x11,
+ 0x61, 0x11, 0x29, 0x00, 0x28, 0x00, 0x05, 0x11,
+ 0x61, 0x11, 0x29, 0x00, 0x28, 0x00, 0x09, 0x11,
+ 0x61, 0x11, 0x29, 0x00, 0x28, 0x00, 0x0b, 0x11,
+ 0x61, 0x11, 0x29, 0x00, 0x28, 0x00, 0x0e, 0x11,
+ 0x61, 0x11, 0x29, 0x00, 0x28, 0x00, 0x0c, 0x11,
+ 0x6e, 0x11, 0x29, 0x00, 0x28, 0x00, 0x0b, 0x11,
+ 0x69, 0x11, 0x0c, 0x11, 0x65, 0x11, 0xab, 0x11,
+ 0x29, 0x00, 0x28, 0x00, 0x0b, 0x11, 0x69, 0x11,
+ 0x12, 0x11, 0x6e, 0x11, 0x29, 0x00, 0x28, 0x00,
+ 0x29, 0x00, 0x00, 0x4e, 0x8c, 0x4e, 0x09, 0x4e,
+ 0xdb, 0x56, 0x94, 0x4e, 0x6d, 0x51, 0x03, 0x4e,
+ 0x6b, 0x51, 0x5d, 0x4e, 0x41, 0x53, 0x08, 0x67,
+ 0x6b, 0x70, 0x34, 0x6c, 0x28, 0x67, 0xd1, 0x91,
+ 0x1f, 0x57, 0xe5, 0x65, 0x2a, 0x68, 0x09, 0x67,
+ 0x3e, 0x79, 0x0d, 0x54, 0x79, 0x72, 0xa1, 0x8c,
+ 0x5d, 0x79, 0xb4, 0x52, 0xe3, 0x4e, 0x7c, 0x54,
+ 0x66, 0x5b, 0xe3, 0x76, 0x01, 0x4f, 0xc7, 0x8c,
+ 0x54, 0x53, 0x6d, 0x79, 0x11, 0x4f, 0xea, 0x81,
+ 0xf3, 0x81, 0x4f, 0x55, 0x7c, 0x5e, 0x87, 0x65,
+ 0x8f, 0x7b, 0x50, 0x54, 0x45, 0x32, 0x00, 0x31,
+ 0x00, 0x33, 0x00, 0x30, 0x00, 0x00, 0x11, 0x00,
+ 0x02, 0x03, 0x05, 0x06, 0x07, 0x09, 0x0b, 0x0c,
+ 0x0e, 0x0f, 0x10, 0x11, 0x12, 0x00, 0x11, 0x00,
+ 0x61, 0x02, 0x61, 0x03, 0x61, 0x05, 0x61, 0x06,
+ 0x61, 0x07, 0x61, 0x09, 0x61, 0x0b, 0x61, 0x0c,
+ 0x61, 0x0e, 0x11, 0x61, 0x11, 0x00, 0x11, 0x0e,
+ 0x61, 0xb7, 0x00, 0x69, 0x0b, 0x11, 0x01, 0x63,
+ 0x00, 0x69, 0x0b, 0x11, 0x6e, 0x11, 0x00, 0x4e,
+ 0x8c, 0x4e, 0x09, 0x4e, 0xdb, 0x56, 0x94, 0x4e,
+ 0x6d, 0x51, 0x03, 0x4e, 0x6b, 0x51, 0x5d, 0x4e,
+ 0x41, 0x53, 0x08, 0x67, 0x6b, 0x70, 0x34, 0x6c,
+ 0x28, 0x67, 0xd1, 0x91, 0x1f, 0x57, 0xe5, 0x65,
+ 0x2a, 0x68, 0x09, 0x67, 0x3e, 0x79, 0x0d, 0x54,
+ 0x79, 0x72, 0xa1, 0x8c, 0x5d, 0x79, 0xb4, 0x52,
+ 0xd8, 0x79, 0x37, 0x75, 0x73, 0x59, 0x69, 0x90,
+ 0x2a, 0x51, 0x70, 0x53, 0xe8, 0x6c, 0x05, 0x98,
+ 0x11, 0x4f, 0x99, 0x51, 0x63, 0x6b, 0x0a, 0x4e,
+ 0x2d, 0x4e, 0x0b, 0x4e, 0xe6, 0x5d, 0xf3, 0x53,
+ 0x3b, 0x53, 0x97, 0x5b, 0x66, 0x5b, 0xe3, 0x76,
+ 0x01, 0x4f, 0xc7, 0x8c, 0x54, 0x53, 0x1c, 0x59,
+ 0x33, 0x00, 0x36, 0x00, 0x34, 0x00, 0x30, 0x00,
+ 0x35, 0x30, 0x31, 0x00, 0x08, 0x67, 0x31, 0x00,
+ 0x30, 0x00, 0x08, 0x67, 0x48, 0x67, 0x65, 0x72,
+ 0x67, 0x65, 0x56, 0x4c, 0x54, 0x44, 0xa2, 0x30,
+ 0x00, 0x02, 0x04, 0x06, 0x08, 0x09, 0x0b, 0x0d,
+ 0x0f, 0x11, 0x13, 0x15, 0x17, 0x19, 0x1b, 0x1d,
+ 0x1f, 0x22, 0x24, 0x26, 0x28, 0x29, 0x2a, 0x2b,
+ 0x2c, 0x2d, 0x30, 0x33, 0x36, 0x39, 0x3c, 0x3d,
+ 0x3e, 0x3f, 0x40, 0x42, 0x44, 0x46, 0x47, 0x48,
+ 0x49, 0x4a, 0x4b, 0x4d, 0x4e, 0x4f, 0x50, 0xa1,
+ 0x30, 0x01, 0x30, 0x5b, 0x27, 0x01, 0x4a, 0x34,
+ 0x00, 0x01, 0x52, 0x39, 0x01, 0xa2, 0x30, 0x00,
+ 0x5a, 0x49, 0xa4, 0x30, 0x00, 0x27, 0x4f, 0x0c,
+ 0xa4, 0x30, 0x00, 0x4f, 0x1d, 0x02, 0x05, 0x4f,
+ 0xa8, 0x30, 0x00, 0x11, 0x07, 0x54, 0x21, 0xa8,
+ 0x30, 0x00, 0x54, 0x03, 0x54, 0xa4, 0x30, 0x06,
+ 0x4f, 0x15, 0x06, 0x58, 0x3c, 0x07, 0x00, 0x46,
+ 0xab, 0x30, 0x00, 0x3e, 0x18, 0x1d, 0x00, 0x42,
+ 0x3f, 0x51, 0xac, 0x30, 0x00, 0x41, 0x47, 0x00,
+ 0x47, 0x32, 0xae, 0x30, 0xac, 0x30, 0xae, 0x30,
+ 0x00, 0x1d, 0x4e, 0xad, 0x30, 0x00, 0x38, 0x3d,
+ 0x4f, 0x01, 0x3e, 0x13, 0x4f, 0xad, 0x30, 0xed,
+ 0x30, 0xad, 0x30, 0x00, 0x40, 0x03, 0x3c, 0x33,
+ 0xad, 0x30, 0x00, 0x40, 0x34, 0x4f, 0x1b, 0x3e,
+ 0xad, 0x30, 0x00, 0x40, 0x42, 0x16, 0x1b, 0xb0,
+ 0x30, 0x00, 0x39, 0x30, 0xa4, 0x30, 0x0c, 0x45,
+ 0x3c, 0x24, 0x4f, 0x0b, 0x47, 0x18, 0x00, 0x49,
+ 0xaf, 0x30, 0x00, 0x3e, 0x4d, 0x1e, 0xb1, 0x30,
+ 0x00, 0x4b, 0x08, 0x02, 0x3a, 0x19, 0x02, 0x4b,
+ 0x2c, 0xa4, 0x30, 0x11, 0x00, 0x0b, 0x47, 0xb5,
+ 0x30, 0x00, 0x3e, 0x0c, 0x47, 0x2b, 0xb0, 0x30,
+ 0x07, 0x3a, 0x43, 0x00, 0xb9, 0x30, 0x02, 0x3a,
+ 0x08, 0x02, 0x3a, 0x0f, 0x07, 0x43, 0x00, 0xb7,
+ 0x30, 0x10, 0x00, 0x12, 0x34, 0x11, 0x3c, 0x13,
+ 0x17, 0xa4, 0x30, 0x2a, 0x1f, 0x24, 0x2b, 0x00,
+ 0x20, 0xbb, 0x30, 0x16, 0x41, 0x00, 0x38, 0x0d,
+ 0xc4, 0x30, 0x0d, 0x38, 0x00, 0xd0, 0x30, 0x00,
+ 0x2c, 0x1c, 0x1b, 0xa2, 0x30, 0x32, 0x00, 0x17,
+ 0x26, 0x49, 0xaf, 0x30, 0x25, 0x00, 0x3c, 0xb3,
+ 0x30, 0x21, 0x00, 0x20, 0x38, 0xa1, 0x30, 0x34,
+ 0x00, 0x48, 0x22, 0x28, 0xa3, 0x30, 0x32, 0x00,
+ 0x59, 0x25, 0xa7, 0x30, 0x2f, 0x1c, 0x10, 0x00,
+ 0x44, 0xd5, 0x30, 0x00, 0x14, 0x1e, 0xaf, 0x30,
+ 0x29, 0x00, 0x10, 0x4d, 0x3c, 0xda, 0x30, 0xbd,
+ 0x30, 0xb8, 0x30, 0x22, 0x13, 0x1a, 0x20, 0x33,
+ 0x0c, 0x22, 0x3b, 0x01, 0x22, 0x44, 0x00, 0x21,
+ 0x44, 0x07, 0xa4, 0x30, 0x39, 0x00, 0x4f, 0x24,
+ 0xc8, 0x30, 0x14, 0x23, 0x00, 0xdb, 0x30, 0xf3,
+ 0x30, 0xc9, 0x30, 0x14, 0x2a, 0x00, 0x12, 0x33,
+ 0x22, 0x12, 0x33, 0x2a, 0xa4, 0x30, 0x3a, 0x00,
+ 0x0b, 0x49, 0xa4, 0x30, 0x3a, 0x00, 0x47, 0x3a,
+ 0x1f, 0x2b, 0x3a, 0x47, 0x0b, 0xb7, 0x30, 0x27,
+ 0x3c, 0x00, 0x30, 0x3c, 0xaf, 0x30, 0x30, 0x00,
+ 0x3e, 0x44, 0xdf, 0x30, 0xea, 0x30, 0xd0, 0x30,
+ 0x0f, 0x1a, 0x00, 0x2c, 0x1b, 0xe1, 0x30, 0xac,
+ 0x30, 0xac, 0x30, 0x35, 0x00, 0x1c, 0x47, 0x35,
+ 0x50, 0x1c, 0x3f, 0xa2, 0x30, 0x42, 0x5a, 0x27,
+ 0x42, 0x5a, 0x49, 0x44, 0x00, 0x51, 0xc3, 0x30,
+ 0x27, 0x00, 0x05, 0x28, 0xea, 0x30, 0xe9, 0x30,
+ 0xd4, 0x30, 0x17, 0x00, 0x28, 0xd6, 0x30, 0x15,
+ 0x26, 0x00, 0x15, 0xec, 0x30, 0xe0, 0x30, 0xb2,
+ 0x30, 0x3a, 0x41, 0x16, 0x00, 0x41, 0xc3, 0x30,
+ 0x2c, 0x00, 0x05, 0x30, 0x00, 0xb9, 0x70, 0x31,
+ 0x00, 0x30, 0x00, 0xb9, 0x70, 0x32, 0x00, 0x30,
+ 0x00, 0xb9, 0x70, 0x68, 0x50, 0x61, 0x64, 0x61,
+ 0x41, 0x55, 0x62, 0x61, 0x72, 0x6f, 0x56, 0x70,
+ 0x63, 0x64, 0x6d, 0x64, 0x00, 0x6d, 0x00, 0xb2,
+ 0x00, 0x49, 0x00, 0x55, 0x00, 0x73, 0x5e, 0x10,
+ 0x62, 0x2d, 0x66, 0x8c, 0x54, 0x27, 0x59, 0x63,
+ 0x6b, 0x0e, 0x66, 0xbb, 0x6c, 0x2a, 0x68, 0x0f,
+ 0x5f, 0x1a, 0x4f, 0x3e, 0x79, 0x70, 0x00, 0x41,
+ 0x6e, 0x00, 0x41, 0xbc, 0x03, 0x41, 0x6d, 0x00,
+ 0x41, 0x6b, 0x00, 0x41, 0x4b, 0x00, 0x42, 0x4d,
+ 0x00, 0x42, 0x47, 0x00, 0x42, 0x63, 0x61, 0x6c,
+ 0x6b, 0x63, 0x61, 0x6c, 0x70, 0x00, 0x46, 0x6e,
+ 0x00, 0x46, 0xbc, 0x03, 0x46, 0xbc, 0x03, 0x67,
+ 0x6d, 0x00, 0x67, 0x6b, 0x00, 0x67, 0x48, 0x00,
+ 0x7a, 0x6b, 0x48, 0x7a, 0x4d, 0x48, 0x7a, 0x47,
+ 0x48, 0x7a, 0x54, 0x48, 0x7a, 0xbc, 0x03, 0x13,
+ 0x21, 0x6d, 0x00, 0x13, 0x21, 0x64, 0x00, 0x13,
+ 0x21, 0x6b, 0x00, 0x13, 0x21, 0x66, 0x00, 0x6d,
+ 0x6e, 0x00, 0x6d, 0xbc, 0x03, 0x6d, 0x6d, 0x00,
+ 0x6d, 0x63, 0x00, 0x6d, 0x6b, 0x00, 0x6d, 0x63,
+ 0x00, 0x0a, 0x0a, 0x4f, 0x00, 0x0a, 0x4f, 0x6d,
+ 0x00, 0xb2, 0x00, 0x63, 0x00, 0x08, 0x0a, 0x4f,
+ 0x0a, 0x0a, 0x50, 0x00, 0x0a, 0x50, 0x6d, 0x00,
+ 0xb3, 0x00, 0x6b, 0x00, 0x6d, 0x00, 0xb3, 0x00,
+ 0x6d, 0x00, 0x15, 0x22, 0x73, 0x00, 0x6d, 0x00,
+ 0x15, 0x22, 0x73, 0x00, 0xb2, 0x00, 0x50, 0x61,
+ 0x6b, 0x50, 0x61, 0x4d, 0x50, 0x61, 0x47, 0x50,
+ 0x61, 0x72, 0x61, 0x64, 0x72, 0x61, 0x64, 0xd1,
+ 0x73, 0x72, 0x00, 0x61, 0x00, 0x64, 0x00, 0x15,
+ 0x22, 0x73, 0x00, 0xb2, 0x00, 0x70, 0x00, 0x73,
+ 0x6e, 0x00, 0x73, 0xbc, 0x03, 0x73, 0x6d, 0x00,
+ 0x73, 0x70, 0x00, 0x56, 0x6e, 0x00, 0x56, 0xbc,
+ 0x03, 0x56, 0x6d, 0x00, 0x56, 0x6b, 0x00, 0x56,
+ 0x4d, 0x00, 0x56, 0x70, 0x00, 0x57, 0x6e, 0x00,
+ 0x57, 0xbc, 0x03, 0x57, 0x6d, 0x00, 0x57, 0x6b,
+ 0x00, 0x57, 0x4d, 0x00, 0x57, 0x6b, 0x00, 0xa9,
+ 0x03, 0x4d, 0x00, 0xa9, 0x03, 0x61, 0x2e, 0x6d,
+ 0x2e, 0x42, 0x71, 0x63, 0x63, 0x63, 0x64, 0x43,
+ 0xd1, 0x6b, 0x67, 0x43, 0x6f, 0x2e, 0x64, 0x42,
+ 0x47, 0x79, 0x68, 0x61, 0x48, 0x50, 0x69, 0x6e,
+ 0x4b, 0x4b, 0x4b, 0x4d, 0x6b, 0x74, 0x6c, 0x6d,
+ 0x6c, 0x6e, 0x6c, 0x6f, 0x67, 0x6c, 0x78, 0x6d,
+ 0x62, 0x6d, 0x69, 0x6c, 0x6d, 0x6f, 0x6c, 0x50,
+ 0x48, 0x70, 0x2e, 0x6d, 0x2e, 0x50, 0x50, 0x4d,
+ 0x50, 0x52, 0x73, 0x72, 0x53, 0x76, 0x57, 0x62,
+ 0x56, 0xd1, 0x6d, 0x41, 0xd1, 0x6d, 0x31, 0x00,
+ 0xe5, 0x65, 0x31, 0x00, 0x30, 0x00, 0xe5, 0x65,
+ 0x32, 0x00, 0x30, 0x00, 0xe5, 0x65, 0x33, 0x00,
+ 0x30, 0x00, 0xe5, 0x65, 0x67, 0x61, 0x6c, 0x4a,
+ 0x04, 0x4c, 0x04, 0x26, 0x01, 0x53, 0x01, 0x27,
+ 0xa7, 0x37, 0xab, 0x6b, 0x02, 0x52, 0xab, 0x48,
+ 0x8c, 0xf4, 0x66, 0xca, 0x8e, 0xc8, 0x8c, 0xd1,
+ 0x6e, 0x32, 0x4e, 0xe5, 0x53, 0x9c, 0x9f, 0x9c,
+ 0x9f, 0x51, 0x59, 0xd1, 0x91, 0x87, 0x55, 0x48,
+ 0x59, 0xf6, 0x61, 0x69, 0x76, 0x85, 0x7f, 0x3f,
+ 0x86, 0xba, 0x87, 0xf8, 0x88, 0x8f, 0x90, 0x02,
+ 0x6a, 0x1b, 0x6d, 0xd9, 0x70, 0xde, 0x73, 0x3d,
+ 0x84, 0x6a, 0x91, 0xf1, 0x99, 0x82, 0x4e, 0x75,
+ 0x53, 0x04, 0x6b, 0x1b, 0x72, 0x2d, 0x86, 0x1e,
+ 0x9e, 0x50, 0x5d, 0xeb, 0x6f, 0xcd, 0x85, 0x64,
+ 0x89, 0xc9, 0x62, 0xd8, 0x81, 0x1f, 0x88, 0xca,
+ 0x5e, 0x17, 0x67, 0x6a, 0x6d, 0xfc, 0x72, 0xce,
+ 0x90, 0x86, 0x4f, 0xb7, 0x51, 0xde, 0x52, 0xc4,
+ 0x64, 0xd3, 0x6a, 0x10, 0x72, 0xe7, 0x76, 0x01,
+ 0x80, 0x06, 0x86, 0x5c, 0x86, 0xef, 0x8d, 0x32,
+ 0x97, 0x6f, 0x9b, 0xfa, 0x9d, 0x8c, 0x78, 0x7f,
+ 0x79, 0xa0, 0x7d, 0xc9, 0x83, 0x04, 0x93, 0x7f,
+ 0x9e, 0xd6, 0x8a, 0xdf, 0x58, 0x04, 0x5f, 0x60,
+ 0x7c, 0x7e, 0x80, 0x62, 0x72, 0xca, 0x78, 0xc2,
+ 0x8c, 0xf7, 0x96, 0xd8, 0x58, 0x62, 0x5c, 0x13,
+ 0x6a, 0xda, 0x6d, 0x0f, 0x6f, 0x2f, 0x7d, 0x37,
+ 0x7e, 0x4b, 0x96, 0xd2, 0x52, 0x8b, 0x80, 0xdc,
+ 0x51, 0xcc, 0x51, 0x1c, 0x7a, 0xbe, 0x7d, 0xf1,
+ 0x83, 0x75, 0x96, 0x80, 0x8b, 0xcf, 0x62, 0x02,
+ 0x6a, 0xfe, 0x8a, 0x39, 0x4e, 0xe7, 0x5b, 0x12,
+ 0x60, 0x87, 0x73, 0x70, 0x75, 0x17, 0x53, 0xfb,
+ 0x78, 0xbf, 0x4f, 0xa9, 0x5f, 0x0d, 0x4e, 0xcc,
+ 0x6c, 0x78, 0x65, 0x22, 0x7d, 0xc3, 0x53, 0x5e,
+ 0x58, 0x01, 0x77, 0x49, 0x84, 0xaa, 0x8a, 0xba,
+ 0x6b, 0xb0, 0x8f, 0x88, 0x6c, 0xfe, 0x62, 0xe5,
+ 0x82, 0xa0, 0x63, 0x65, 0x75, 0xae, 0x4e, 0x69,
+ 0x51, 0xc9, 0x51, 0x81, 0x68, 0xe7, 0x7c, 0x6f,
+ 0x82, 0xd2, 0x8a, 0xcf, 0x91, 0xf5, 0x52, 0x42,
+ 0x54, 0x73, 0x59, 0xec, 0x5e, 0xc5, 0x65, 0xfe,
+ 0x6f, 0x2a, 0x79, 0xad, 0x95, 0x6a, 0x9a, 0x97,
+ 0x9e, 0xce, 0x9e, 0x9b, 0x52, 0xc6, 0x66, 0x77,
+ 0x6b, 0x62, 0x8f, 0x74, 0x5e, 0x90, 0x61, 0x00,
+ 0x62, 0x9a, 0x64, 0x23, 0x6f, 0x49, 0x71, 0x89,
+ 0x74, 0xca, 0x79, 0xf4, 0x7d, 0x6f, 0x80, 0x26,
+ 0x8f, 0xee, 0x84, 0x23, 0x90, 0x4a, 0x93, 0x17,
+ 0x52, 0xa3, 0x52, 0xbd, 0x54, 0xc8, 0x70, 0xc2,
+ 0x88, 0xaa, 0x8a, 0xc9, 0x5e, 0xf5, 0x5f, 0x7b,
+ 0x63, 0xae, 0x6b, 0x3e, 0x7c, 0x75, 0x73, 0xe4,
+ 0x4e, 0xf9, 0x56, 0xe7, 0x5b, 0xba, 0x5d, 0x1c,
+ 0x60, 0xb2, 0x73, 0x69, 0x74, 0x9a, 0x7f, 0x46,
+ 0x80, 0x34, 0x92, 0xf6, 0x96, 0x48, 0x97, 0x18,
+ 0x98, 0x8b, 0x4f, 0xae, 0x79, 0xb4, 0x91, 0xb8,
+ 0x96, 0xe1, 0x60, 0x86, 0x4e, 0xda, 0x50, 0xee,
+ 0x5b, 0x3f, 0x5c, 0x99, 0x65, 0x02, 0x6a, 0xce,
+ 0x71, 0x42, 0x76, 0xfc, 0x84, 0x7c, 0x90, 0x8d,
+ 0x9f, 0x88, 0x66, 0x2e, 0x96, 0x89, 0x52, 0x7b,
+ 0x67, 0xf3, 0x67, 0x41, 0x6d, 0x9c, 0x6e, 0x09,
+ 0x74, 0x59, 0x75, 0x6b, 0x78, 0x10, 0x7d, 0x5e,
+ 0x98, 0x6d, 0x51, 0x2e, 0x62, 0x78, 0x96, 0x2b,
+ 0x50, 0x19, 0x5d, 0xea, 0x6d, 0x2a, 0x8f, 0x8b,
+ 0x5f, 0x44, 0x61, 0x17, 0x68, 0x87, 0x73, 0x86,
+ 0x96, 0x29, 0x52, 0x0f, 0x54, 0x65, 0x5c, 0x13,
+ 0x66, 0x4e, 0x67, 0xa8, 0x68, 0xe5, 0x6c, 0x06,
+ 0x74, 0xe2, 0x75, 0x79, 0x7f, 0xcf, 0x88, 0xe1,
+ 0x88, 0xcc, 0x91, 0xe2, 0x96, 0x3f, 0x53, 0xba,
+ 0x6e, 0x1d, 0x54, 0xd0, 0x71, 0x98, 0x74, 0xfa,
+ 0x85, 0xa3, 0x96, 0x57, 0x9c, 0x9f, 0x9e, 0x97,
+ 0x67, 0xcb, 0x6d, 0xe8, 0x81, 0xcb, 0x7a, 0x20,
+ 0x7b, 0x92, 0x7c, 0xc0, 0x72, 0x99, 0x70, 0x58,
+ 0x8b, 0xc0, 0x4e, 0x36, 0x83, 0x3a, 0x52, 0x07,
+ 0x52, 0xa6, 0x5e, 0xd3, 0x62, 0xd6, 0x7c, 0x85,
+ 0x5b, 0x1e, 0x6d, 0xb4, 0x66, 0x3b, 0x8f, 0x4c,
+ 0x88, 0x4d, 0x96, 0x8b, 0x89, 0xd3, 0x5e, 0x40,
+ 0x51, 0xc0, 0x55, 0x00, 0x00, 0x00, 0x00, 0x5a,
+ 0x58, 0x00, 0x00, 0x74, 0x66, 0x00, 0x00, 0x00,
+ 0x00, 0xde, 0x51, 0x2a, 0x73, 0xca, 0x76, 0x3c,
+ 0x79, 0x5e, 0x79, 0x65, 0x79, 0x8f, 0x79, 0x56,
+ 0x97, 0xbe, 0x7c, 0xbd, 0x7f, 0x00, 0x00, 0x12,
+ 0x86, 0x00, 0x00, 0xf8, 0x8a, 0x00, 0x00, 0x00,
+ 0x00, 0x38, 0x90, 0xfd, 0x90, 0xef, 0x98, 0xfc,
+ 0x98, 0x28, 0x99, 0xb4, 0x9d, 0xde, 0x90, 0xb7,
+ 0x96, 0xae, 0x4f, 0xe7, 0x50, 0x4d, 0x51, 0xc9,
+ 0x52, 0xe4, 0x52, 0x51, 0x53, 0x9d, 0x55, 0x06,
+ 0x56, 0x68, 0x56, 0x40, 0x58, 0xa8, 0x58, 0x64,
+ 0x5c, 0x6e, 0x5c, 0x94, 0x60, 0x68, 0x61, 0x8e,
+ 0x61, 0xf2, 0x61, 0x4f, 0x65, 0xe2, 0x65, 0x91,
+ 0x66, 0x85, 0x68, 0x77, 0x6d, 0x1a, 0x6e, 0x22,
+ 0x6f, 0x6e, 0x71, 0x2b, 0x72, 0x22, 0x74, 0x91,
+ 0x78, 0x3e, 0x79, 0x49, 0x79, 0x48, 0x79, 0x50,
+ 0x79, 0x56, 0x79, 0x5d, 0x79, 0x8d, 0x79, 0x8e,
+ 0x79, 0x40, 0x7a, 0x81, 0x7a, 0xc0, 0x7b, 0xf4,
+ 0x7d, 0x09, 0x7e, 0x41, 0x7e, 0x72, 0x7f, 0x05,
+ 0x80, 0xed, 0x81, 0x79, 0x82, 0x79, 0x82, 0x57,
+ 0x84, 0x10, 0x89, 0x96, 0x89, 0x01, 0x8b, 0x39,
+ 0x8b, 0xd3, 0x8c, 0x08, 0x8d, 0xb6, 0x8f, 0x38,
+ 0x90, 0xe3, 0x96, 0xff, 0x97, 0x3b, 0x98, 0x75,
+ 0x60, 0xee, 0x42, 0x18, 0x82, 0x02, 0x26, 0x4e,
+ 0xb5, 0x51, 0x68, 0x51, 0x80, 0x4f, 0x45, 0x51,
+ 0x80, 0x51, 0xc7, 0x52, 0xfa, 0x52, 0x9d, 0x55,
+ 0x55, 0x55, 0x99, 0x55, 0xe2, 0x55, 0x5a, 0x58,
+ 0xb3, 0x58, 0x44, 0x59, 0x54, 0x59, 0x62, 0x5a,
+ 0x28, 0x5b, 0xd2, 0x5e, 0xd9, 0x5e, 0x69, 0x5f,
+ 0xad, 0x5f, 0xd8, 0x60, 0x4e, 0x61, 0x08, 0x61,
+ 0x8e, 0x61, 0x60, 0x61, 0xf2, 0x61, 0x34, 0x62,
+ 0xc4, 0x63, 0x1c, 0x64, 0x52, 0x64, 0x56, 0x65,
+ 0x74, 0x66, 0x17, 0x67, 0x1b, 0x67, 0x56, 0x67,
+ 0x79, 0x6b, 0xba, 0x6b, 0x41, 0x6d, 0xdb, 0x6e,
+ 0xcb, 0x6e, 0x22, 0x6f, 0x1e, 0x70, 0x6e, 0x71,
+ 0xa7, 0x77, 0x35, 0x72, 0xaf, 0x72, 0x2a, 0x73,
+ 0x71, 0x74, 0x06, 0x75, 0x3b, 0x75, 0x1d, 0x76,
+ 0x1f, 0x76, 0xca, 0x76, 0xdb, 0x76, 0xf4, 0x76,
+ 0x4a, 0x77, 0x40, 0x77, 0xcc, 0x78, 0xb1, 0x7a,
+ 0xc0, 0x7b, 0x7b, 0x7c, 0x5b, 0x7d, 0xf4, 0x7d,
+ 0x3e, 0x7f, 0x05, 0x80, 0x52, 0x83, 0xef, 0x83,
+ 0x79, 0x87, 0x41, 0x89, 0x86, 0x89, 0x96, 0x89,
+ 0xbf, 0x8a, 0xf8, 0x8a, 0xcb, 0x8a, 0x01, 0x8b,
+ 0xfe, 0x8a, 0xed, 0x8a, 0x39, 0x8b, 0x8a, 0x8b,
+ 0x08, 0x8d, 0x38, 0x8f, 0x72, 0x90, 0x99, 0x91,
+ 0x76, 0x92, 0x7c, 0x96, 0xe3, 0x96, 0x56, 0x97,
+ 0xdb, 0x97, 0xff, 0x97, 0x0b, 0x98, 0x3b, 0x98,
+ 0x12, 0x9b, 0x9c, 0x9f, 0x4a, 0x28, 0x44, 0x28,
+ 0xd5, 0x33, 0x9d, 0x3b, 0x18, 0x40, 0x39, 0x40,
+ 0x49, 0x52, 0xd0, 0x5c, 0xd3, 0x7e, 0x43, 0x9f,
+ 0x8e, 0x9f, 0x2a, 0xa0, 0x02, 0x66, 0x66, 0x66,
+ 0x69, 0x66, 0x6c, 0x66, 0x66, 0x69, 0x66, 0x66,
+ 0x6c, 0x7f, 0x01, 0x74, 0x73, 0x00, 0x74, 0x65,
+ 0x05, 0x0f, 0x11, 0x0f, 0x00, 0x0f, 0x06, 0x19,
+ 0x11, 0x0f, 0x08, 0xd9, 0x05, 0xb4, 0x05, 0x00,
+ 0x00, 0x00, 0x00, 0xf2, 0x05, 0xb7, 0x05, 0xd0,
+ 0x05, 0x12, 0x00, 0x03, 0x04, 0x0b, 0x0c, 0x0d,
+ 0x18, 0x1a, 0xe9, 0x05, 0xc1, 0x05, 0xe9, 0x05,
+ 0xc2, 0x05, 0x49, 0xfb, 0xc1, 0x05, 0x49, 0xfb,
+ 0xc2, 0x05, 0xd0, 0x05, 0xb7, 0x05, 0xd0, 0x05,
+ 0xb8, 0x05, 0xd0, 0x05, 0xbc, 0x05, 0xd8, 0x05,
+ 0xbc, 0x05, 0xde, 0x05, 0xbc, 0x05, 0xe0, 0x05,
+ 0xbc, 0x05, 0xe3, 0x05, 0xbc, 0x05, 0xb9, 0x05,
+ 0x2d, 0x03, 0x2e, 0x03, 0x2f, 0x03, 0x30, 0x03,
+ 0x31, 0x03, 0x1c, 0x00, 0x18, 0x06, 0x22, 0x06,
+ 0x2b, 0x06, 0xd0, 0x05, 0xdc, 0x05, 0x71, 0x06,
+ 0x00, 0x00, 0x0a, 0x0a, 0x0a, 0x0a, 0x0d, 0x0d,
+ 0x0d, 0x0d, 0x0f, 0x0f, 0x0f, 0x0f, 0x09, 0x09,
+ 0x09, 0x09, 0x0e, 0x0e, 0x0e, 0x0e, 0x08, 0x08,
+ 0x08, 0x08, 0x33, 0x33, 0x33, 0x33, 0x35, 0x35,
+ 0x35, 0x35, 0x13, 0x13, 0x13, 0x13, 0x12, 0x12,
+ 0x12, 0x12, 0x15, 0x15, 0x15, 0x15, 0x16, 0x16,
+ 0x16, 0x16, 0x1c, 0x1c, 0x1b, 0x1b, 0x1d, 0x1d,
+ 0x17, 0x17, 0x27, 0x27, 0x20, 0x20, 0x38, 0x38,
+ 0x38, 0x38, 0x3e, 0x3e, 0x3e, 0x3e, 0x42, 0x42,
+ 0x42, 0x42, 0x40, 0x40, 0x40, 0x40, 0x49, 0x49,
+ 0x4a, 0x4a, 0x4a, 0x4a, 0x4f, 0x4f, 0x50, 0x50,
+ 0x50, 0x50, 0x4d, 0x4d, 0x4d, 0x4d, 0x61, 0x61,
+ 0x62, 0x62, 0x49, 0x06, 0x64, 0x64, 0x64, 0x64,
+ 0x7e, 0x7e, 0x7d, 0x7d, 0x7f, 0x7f, 0x2e, 0x82,
+ 0x82, 0x7c, 0x7c, 0x80, 0x80, 0x87, 0x87, 0x87,
+ 0x87, 0x00, 0x00, 0x26, 0x06, 0x00, 0x01, 0x00,
+ 0x01, 0x00, 0xaf, 0x00, 0xaf, 0x00, 0x22, 0x00,
+ 0x22, 0x00, 0xa1, 0x00, 0xa1, 0x00, 0xa0, 0x00,
+ 0xa0, 0x00, 0xa2, 0x00, 0xa2, 0x00, 0xaa, 0x00,
+ 0xaa, 0x00, 0xaa, 0x00, 0x23, 0x00, 0x23, 0x00,
+ 0x23, 0xcc, 0x06, 0x00, 0x00, 0x00, 0x00, 0x26,
+ 0x06, 0x00, 0x06, 0x00, 0x07, 0x00, 0x1f, 0x00,
+ 0x23, 0x00, 0x24, 0x02, 0x06, 0x02, 0x07, 0x02,
+ 0x08, 0x02, 0x1f, 0x02, 0x23, 0x02, 0x24, 0x04,
+ 0x06, 0x04, 0x07, 0x04, 0x08, 0x04, 0x1f, 0x04,
+ 0x23, 0x04, 0x24, 0x05, 0x06, 0x05, 0x1f, 0x05,
+ 0x23, 0x05, 0x24, 0x06, 0x07, 0x06, 0x1f, 0x07,
+ 0x06, 0x07, 0x1f, 0x08, 0x06, 0x08, 0x07, 0x08,
+ 0x1f, 0x0d, 0x06, 0x0d, 0x07, 0x0d, 0x08, 0x0d,
+ 0x1f, 0x0f, 0x07, 0x0f, 0x1f, 0x10, 0x06, 0x10,
+ 0x07, 0x10, 0x08, 0x10, 0x1f, 0x11, 0x07, 0x11,
+ 0x1f, 0x12, 0x1f, 0x13, 0x06, 0x13, 0x1f, 0x14,
+ 0x06, 0x14, 0x1f, 0x1b, 0x06, 0x1b, 0x07, 0x1b,
+ 0x08, 0x1b, 0x1f, 0x1b, 0x23, 0x1b, 0x24, 0x1c,
+ 0x07, 0x1c, 0x1f, 0x1c, 0x23, 0x1c, 0x24, 0x1d,
+ 0x01, 0x1d, 0x06, 0x1d, 0x07, 0x1d, 0x08, 0x1d,
+ 0x1e, 0x1d, 0x1f, 0x1d, 0x23, 0x1d, 0x24, 0x1e,
+ 0x06, 0x1e, 0x07, 0x1e, 0x08, 0x1e, 0x1f, 0x1e,
+ 0x23, 0x1e, 0x24, 0x1f, 0x06, 0x1f, 0x07, 0x1f,
+ 0x08, 0x1f, 0x1f, 0x1f, 0x23, 0x1f, 0x24, 0x20,
+ 0x06, 0x20, 0x07, 0x20, 0x08, 0x20, 0x1f, 0x20,
+ 0x23, 0x20, 0x24, 0x21, 0x06, 0x21, 0x1f, 0x21,
+ 0x23, 0x21, 0x24, 0x24, 0x06, 0x24, 0x07, 0x24,
+ 0x08, 0x24, 0x1f, 0x24, 0x23, 0x24, 0x24, 0x0a,
+ 0x4a, 0x0b, 0x4a, 0x23, 0x4a, 0x20, 0x00, 0x4c,
+ 0x06, 0x51, 0x06, 0x51, 0x06, 0xff, 0x00, 0x1f,
+ 0x26, 0x06, 0x00, 0x0b, 0x00, 0x0c, 0x00, 0x1f,
+ 0x00, 0x20, 0x00, 0x23, 0x00, 0x24, 0x02, 0x0b,
+ 0x02, 0x0c, 0x02, 0x1f, 0x02, 0x20, 0x02, 0x23,
+ 0x02, 0x24, 0x04, 0x0b, 0x04, 0x0c, 0x04, 0x1f,
+ 0x26, 0x06, 0x04, 0x20, 0x04, 0x23, 0x04, 0x24,
+ 0x05, 0x0b, 0x05, 0x0c, 0x05, 0x1f, 0x05, 0x20,
+ 0x05, 0x23, 0x05, 0x24, 0x1b, 0x23, 0x1b, 0x24,
+ 0x1c, 0x23, 0x1c, 0x24, 0x1d, 0x01, 0x1d, 0x1e,
+ 0x1d, 0x1f, 0x1d, 0x23, 0x1d, 0x24, 0x1e, 0x1f,
+ 0x1e, 0x23, 0x1e, 0x24, 0x1f, 0x01, 0x1f, 0x1f,
+ 0x20, 0x0b, 0x20, 0x0c, 0x20, 0x1f, 0x20, 0x20,
+ 0x20, 0x23, 0x20, 0x24, 0x23, 0x4a, 0x24, 0x0b,
+ 0x24, 0x0c, 0x24, 0x1f, 0x24, 0x20, 0x24, 0x23,
+ 0x24, 0x24, 0x00, 0x06, 0x00, 0x07, 0x00, 0x08,
+ 0x00, 0x1f, 0x00, 0x21, 0x02, 0x06, 0x02, 0x07,
+ 0x02, 0x08, 0x02, 0x1f, 0x02, 0x21, 0x04, 0x06,
+ 0x04, 0x07, 0x04, 0x08, 0x04, 0x1f, 0x04, 0x21,
+ 0x05, 0x1f, 0x06, 0x07, 0x06, 0x1f, 0x07, 0x06,
+ 0x07, 0x1f, 0x08, 0x06, 0x08, 0x1f, 0x0d, 0x06,
+ 0x0d, 0x07, 0x0d, 0x08, 0x0d, 0x1f, 0x0f, 0x07,
+ 0x0f, 0x08, 0x0f, 0x1f, 0x10, 0x06, 0x10, 0x07,
+ 0x10, 0x08, 0x10, 0x1f, 0x11, 0x07, 0x12, 0x1f,
+ 0x13, 0x06, 0x13, 0x1f, 0x14, 0x06, 0x14, 0x1f,
+ 0x1b, 0x06, 0x1b, 0x07, 0x1b, 0x08, 0x1b, 0x1f,
+ 0x1c, 0x07, 0x1c, 0x1f, 0x1d, 0x06, 0x1d, 0x07,
+ 0x1d, 0x08, 0x1d, 0x1e, 0x1d, 0x1f, 0x1e, 0x06,
+ 0x1e, 0x07, 0x1e, 0x08, 0x1e, 0x1f, 0x1e, 0x21,
+ 0x1f, 0x06, 0x1f, 0x07, 0x1f, 0x08, 0x1f, 0x1f,
+ 0x20, 0x06, 0x20, 0x07, 0x20, 0x08, 0x20, 0x1f,
+ 0x20, 0x21, 0x21, 0x06, 0x21, 0x1f, 0x21, 0x4a,
+ 0x24, 0x06, 0x24, 0x07, 0x24, 0x08, 0x24, 0x1f,
+ 0x24, 0x21, 0x00, 0x1f, 0x00, 0x21, 0x02, 0x1f,
+ 0x02, 0x21, 0x04, 0x1f, 0x04, 0x21, 0x05, 0x1f,
+ 0x05, 0x21, 0x0d, 0x1f, 0x0d, 0x21, 0x0e, 0x1f,
+ 0x0e, 0x21, 0x1d, 0x1e, 0x1d, 0x1f, 0x1e, 0x1f,
+ 0x20, 0x1f, 0x20, 0x21, 0x24, 0x1f, 0x24, 0x21,
+ 0x40, 0x06, 0x4e, 0x06, 0x51, 0x06, 0x27, 0x06,
+ 0x10, 0x22, 0x10, 0x23, 0x12, 0x22, 0x12, 0x23,
+ 0x13, 0x22, 0x13, 0x23, 0x0c, 0x22, 0x0c, 0x23,
+ 0x0d, 0x22, 0x0d, 0x23, 0x06, 0x22, 0x06, 0x23,
+ 0x05, 0x22, 0x05, 0x23, 0x07, 0x22, 0x07, 0x23,
+ 0x0e, 0x22, 0x0e, 0x23, 0x0f, 0x22, 0x0f, 0x23,
+ 0x0d, 0x05, 0x0d, 0x06, 0x0d, 0x07, 0x0d, 0x1e,
+ 0x0d, 0x0a, 0x0c, 0x0a, 0x0e, 0x0a, 0x0f, 0x0a,
+ 0x10, 0x22, 0x10, 0x23, 0x12, 0x22, 0x12, 0x23,
+ 0x13, 0x22, 0x13, 0x23, 0x0c, 0x22, 0x0c, 0x23,
+ 0x0d, 0x22, 0x0d, 0x23, 0x06, 0x22, 0x06, 0x23,
+ 0x05, 0x22, 0x05, 0x23, 0x07, 0x22, 0x07, 0x23,
+ 0x0e, 0x22, 0x0e, 0x23, 0x0f, 0x22, 0x0f, 0x23,
+ 0x0d, 0x05, 0x0d, 0x06, 0x0d, 0x07, 0x0d, 0x1e,
+ 0x0d, 0x0a, 0x0c, 0x0a, 0x0e, 0x0a, 0x0f, 0x0a,
+ 0x0d, 0x05, 0x0d, 0x06, 0x0d, 0x07, 0x0d, 0x1e,
+ 0x0c, 0x20, 0x0d, 0x20, 0x10, 0x1e, 0x0c, 0x05,
+ 0x0c, 0x06, 0x0c, 0x07, 0x0d, 0x05, 0x0d, 0x06,
+ 0x0d, 0x07, 0x10, 0x1e, 0x11, 0x1e, 0x00, 0x24,
+ 0x00, 0x24, 0x2a, 0x06, 0x00, 0x02, 0x1b, 0x00,
+ 0x03, 0x02, 0x00, 0x03, 0x02, 0x00, 0x03, 0x1b,
+ 0x00, 0x04, 0x1b, 0x00, 0x1b, 0x02, 0x00, 0x1b,
+ 0x03, 0x00, 0x1b, 0x04, 0x02, 0x1b, 0x03, 0x02,
+ 0x1b, 0x03, 0x03, 0x1b, 0x20, 0x03, 0x1b, 0x1f,
+ 0x09, 0x03, 0x02, 0x09, 0x02, 0x03, 0x09, 0x02,
+ 0x1f, 0x09, 0x1b, 0x03, 0x09, 0x1b, 0x03, 0x09,
+ 0x1b, 0x02, 0x09, 0x1b, 0x1b, 0x09, 0x1b, 0x1b,
+ 0x0b, 0x03, 0x03, 0x0b, 0x03, 0x03, 0x0b, 0x1b,
+ 0x1b, 0x0a, 0x03, 0x1b, 0x0a, 0x03, 0x1b, 0x0a,
+ 0x02, 0x20, 0x0a, 0x1b, 0x04, 0x0a, 0x1b, 0x04,
+ 0x0a, 0x1b, 0x1b, 0x0a, 0x1b, 0x1b, 0x0c, 0x03,
+ 0x1f, 0x0c, 0x04, 0x1b, 0x0c, 0x04, 0x1b, 0x0d,
+ 0x1b, 0x03, 0x0d, 0x1b, 0x03, 0x0d, 0x1b, 0x1b,
+ 0x0d, 0x1b, 0x20, 0x0f, 0x02, 0x1b, 0x0f, 0x1b,
+ 0x1b, 0x0f, 0x1b, 0x1b, 0x0f, 0x1b, 0x1f, 0x10,
+ 0x1b, 0x1b, 0x10, 0x1b, 0x20, 0x10, 0x1b, 0x1f,
+ 0x17, 0x04, 0x1b, 0x17, 0x04, 0x1b, 0x18, 0x1b,
+ 0x03, 0x18, 0x1b, 0x1b, 0x1a, 0x03, 0x1b, 0x1a,
+ 0x03, 0x20, 0x1a, 0x03, 0x1f, 0x1a, 0x02, 0x02,
+ 0x1a, 0x02, 0x02, 0x1a, 0x04, 0x1b, 0x1a, 0x04,
+ 0x1b, 0x1a, 0x1b, 0x03, 0x1a, 0x1b, 0x03, 0x1b,
+ 0x03, 0x02, 0x1b, 0x03, 0x1b, 0x1b, 0x03, 0x20,
+ 0x1b, 0x02, 0x03, 0x1b, 0x02, 0x1b, 0x1b, 0x04,
+ 0x02, 0x1b, 0x04, 0x1b, 0x28, 0x06, 0x1d, 0x04,
+ 0x06, 0x1f, 0x1d, 0x04, 0x1f, 0x1d, 0x1d, 0x1e,
+ 0x05, 0x1d, 0x1e, 0x05, 0x21, 0x1e, 0x04, 0x1d,
+ 0x1e, 0x04, 0x1d, 0x1e, 0x04, 0x21, 0x1e, 0x1d,
+ 0x22, 0x1e, 0x1d, 0x21, 0x22, 0x1d, 0x1d, 0x22,
+ 0x1d, 0x1d, 0x00, 0x06, 0x22, 0x02, 0x04, 0x22,
+ 0x02, 0x04, 0x21, 0x02, 0x06, 0x22, 0x02, 0x06,
+ 0x21, 0x02, 0x1d, 0x22, 0x02, 0x1d, 0x21, 0x04,
+ 0x1d, 0x22, 0x04, 0x05, 0x21, 0x04, 0x1d, 0x21,
+ 0x0b, 0x06, 0x21, 0x0d, 0x05, 0x22, 0x0c, 0x05,
+ 0x22, 0x0e, 0x05, 0x22, 0x1c, 0x04, 0x22, 0x1c,
+ 0x1d, 0x22, 0x22, 0x05, 0x22, 0x22, 0x04, 0x22,
+ 0x22, 0x1d, 0x22, 0x1d, 0x1d, 0x22, 0x1a, 0x1d,
+ 0x22, 0x1e, 0x05, 0x22, 0x1a, 0x1d, 0x05, 0x1c,
+ 0x05, 0x1d, 0x11, 0x1d, 0x22, 0x1b, 0x1d, 0x22,
+ 0x1e, 0x04, 0x05, 0x1d, 0x06, 0x22, 0x1c, 0x04,
+ 0x1d, 0x1b, 0x1d, 0x1d, 0x1c, 0x04, 0x1d, 0x1e,
+ 0x04, 0x05, 0x04, 0x05, 0x22, 0x05, 0x04, 0x22,
+ 0x1d, 0x04, 0x22, 0x19, 0x1d, 0x22, 0x00, 0x05,
+ 0x22, 0x1b, 0x1d, 0x1d, 0x11, 0x04, 0x1d, 0x0d,
+ 0x1d, 0x1d, 0x0b, 0x06, 0x22, 0x1e, 0x04, 0x22,
+ 0x35, 0x06, 0x00, 0x0f, 0x9d, 0x0d, 0x0f, 0x9d,
+ 0x27, 0x06, 0x00, 0x1d, 0x1d, 0x20, 0x00, 0x1c,
+ 0x01, 0x0a, 0x1e, 0x06, 0x1e, 0x08, 0x0e, 0x1d,
+ 0x12, 0x1e, 0x0a, 0x0c, 0x21, 0x1d, 0x12, 0x1d,
+ 0x23, 0x20, 0x21, 0x0c, 0x1d, 0x1e, 0x35, 0x06,
+ 0x00, 0x0f, 0x14, 0x27, 0x06, 0x0e, 0x1d, 0x22,
+ 0xff, 0x00, 0x1d, 0x1d, 0x20, 0xff, 0x12, 0x1d,
+ 0x23, 0x20, 0xff, 0x21, 0x0c, 0x1d, 0x1e, 0x27,
+ 0x06, 0x05, 0x1d, 0xff, 0x05, 0x1d, 0x00, 0x1d,
+ 0x20, 0x27, 0x06, 0x0a, 0xa5, 0x00, 0x1d, 0x2c,
+ 0x00, 0x01, 0x30, 0x02, 0x30, 0x3a, 0x00, 0x3b,
+ 0x00, 0x21, 0x00, 0x3f, 0x00, 0x16, 0x30, 0x17,
+ 0x30, 0x26, 0x20, 0x13, 0x20, 0x12, 0x01, 0x00,
+ 0x5f, 0x5f, 0x28, 0x29, 0x7b, 0x7d, 0x08, 0x30,
+ 0x0c, 0x0d, 0x08, 0x09, 0x02, 0x03, 0x00, 0x01,
+ 0x04, 0x05, 0x06, 0x07, 0x5b, 0x00, 0x5d, 0x00,
+ 0x3e, 0x20, 0x3e, 0x20, 0x3e, 0x20, 0x3e, 0x20,
+ 0x5f, 0x00, 0x5f, 0x00, 0x5f, 0x00, 0x2c, 0x00,
+ 0x01, 0x30, 0x2e, 0x00, 0x00, 0x00, 0x3b, 0x00,
+ 0x3a, 0x00, 0x3f, 0x00, 0x21, 0x00, 0x14, 0x20,
+ 0x28, 0x00, 0x29, 0x00, 0x7b, 0x00, 0x7d, 0x00,
+ 0x14, 0x30, 0x15, 0x30, 0x23, 0x26, 0x2a, 0x2b,
+ 0x2d, 0x3c, 0x3e, 0x3d, 0x00, 0x5c, 0x24, 0x25,
+ 0x40, 0x40, 0x06, 0xff, 0x0b, 0x00, 0x0b, 0xff,
+ 0x0c, 0x20, 0x00, 0x4d, 0x06, 0x40, 0x06, 0xff,
+ 0x0e, 0x00, 0x0e, 0xff, 0x0f, 0x00, 0x0f, 0xff,
+ 0x10, 0x00, 0x10, 0xff, 0x11, 0x00, 0x11, 0xff,
+ 0x12, 0x00, 0x12, 0x21, 0x06, 0x00, 0x01, 0x01,
+ 0x02, 0x02, 0x03, 0x03, 0x04, 0x04, 0x05, 0x05,
+ 0x05, 0x05, 0x06, 0x06, 0x07, 0x07, 0x07, 0x07,
+ 0x08, 0x08, 0x09, 0x09, 0x09, 0x09, 0x0a, 0x0a,
+ 0x0a, 0x0a, 0x0b, 0x0b, 0x0b, 0x0b, 0x0c, 0x0c,
+ 0x0c, 0x0c, 0x0d, 0x0d, 0x0d, 0x0d, 0x0e, 0x0e,
+ 0x0f, 0x0f, 0x10, 0x10, 0x11, 0x11, 0x12, 0x12,
+ 0x12, 0x12, 0x13, 0x13, 0x13, 0x13, 0x14, 0x14,
+ 0x14, 0x14, 0x15, 0x15, 0x15, 0x15, 0x16, 0x16,
+ 0x16, 0x16, 0x17, 0x17, 0x17, 0x17, 0x18, 0x18,
+ 0x18, 0x18, 0x19, 0x19, 0x19, 0x19, 0x20, 0x20,
+ 0x20, 0x20, 0x21, 0x21, 0x21, 0x21, 0x22, 0x22,
+ 0x22, 0x22, 0x23, 0x23, 0x23, 0x23, 0x24, 0x24,
+ 0x24, 0x24, 0x25, 0x25, 0x25, 0x25, 0x26, 0x26,
+ 0x26, 0x26, 0x27, 0x27, 0x28, 0x28, 0x29, 0x29,
+ 0x29, 0x29, 0x22, 0x06, 0x22, 0x00, 0x22, 0x00,
+ 0x22, 0x01, 0x22, 0x01, 0x22, 0x03, 0x22, 0x03,
+ 0x22, 0x05, 0x22, 0x05, 0x21, 0x00, 0x85, 0x29,
+ 0x01, 0x30, 0x01, 0x0b, 0x0c, 0x00, 0xfa, 0xf1,
+ 0xa0, 0xa2, 0xa4, 0xa6, 0xa8, 0xe2, 0xe4, 0xe6,
+ 0xc2, 0xfb, 0xa1, 0xa3, 0xa5, 0xa7, 0xa9, 0xaa,
+ 0xac, 0xae, 0xb0, 0xb2, 0xb4, 0xb6, 0xb8, 0xba,
+ 0xbc, 0xbe, 0xc0, 0xc3, 0xc5, 0xc7, 0xc9, 0xca,
+ 0xcb, 0xcc, 0xcd, 0xce, 0xd1, 0xd4, 0xd7, 0xda,
+ 0xdd, 0xde, 0xdf, 0xe0, 0xe1, 0xe3, 0xe5, 0xe7,
+ 0xe8, 0xe9, 0xea, 0xeb, 0xec, 0xee, 0xf2, 0x98,
+ 0x99, 0x31, 0x31, 0x4f, 0x31, 0x55, 0x31, 0x5b,
+ 0x31, 0x61, 0x31, 0xa2, 0x00, 0xa3, 0x00, 0xac,
+ 0x00, 0xaf, 0x00, 0xa6, 0x00, 0xa5, 0x00, 0xa9,
+ 0x20, 0x00, 0x00, 0x02, 0x25, 0x90, 0x21, 0x91,
+ 0x21, 0x92, 0x21, 0x93, 0x21, 0xa0, 0x25, 0xcb,
+ 0x25, 0x99, 0x10, 0xba, 0x10, 0x00, 0x00, 0x00,
+ 0x00, 0x9b, 0x10, 0xba, 0x10, 0x05, 0x05, 0xa5,
+ 0x10, 0xba, 0x10, 0x05, 0x31, 0x11, 0x27, 0x11,
+ 0x32, 0x11, 0x27, 0x11, 0x55, 0x47, 0x13, 0x3e,
+ 0x13, 0x47, 0x13, 0x57, 0x13, 0x55, 0xb9, 0x14,
+ 0xba, 0x14, 0xb9, 0x14, 0xb0, 0x14, 0x00, 0x00,
+ 0x00, 0x00, 0xb9, 0x14, 0xbd, 0x14, 0x55, 0x50,
+ 0xb8, 0x15, 0xaf, 0x15, 0xb9, 0x15, 0xaf, 0x15,
+ 0x55, 0x57, 0xd1, 0x65, 0xd1, 0x58, 0xd1, 0x65,
+ 0xd1, 0x5f, 0xd1, 0x6e, 0xd1, 0x5f, 0xd1, 0x6f,
+ 0xd1, 0x5f, 0xd1, 0x70, 0xd1, 0x5f, 0xd1, 0x71,
+ 0xd1, 0x5f, 0xd1, 0x72, 0xd1, 0x55, 0x55, 0x55,
+ 0x05, 0xb9, 0xd1, 0x65, 0xd1, 0xba, 0xd1, 0x65,
+ 0xd1, 0xbb, 0xd1, 0x6e, 0xd1, 0xbc, 0xd1, 0x6e,
+ 0xd1, 0xbb, 0xd1, 0x6f, 0xd1, 0xbc, 0xd1, 0x6f,
+ 0xd1, 0x55, 0x55, 0x55, 0x41, 0x00, 0x61, 0x00,
+ 0x41, 0x00, 0x61, 0x00, 0x69, 0x00, 0x41, 0x00,
+ 0x61, 0x00, 0x41, 0x00, 0x43, 0x44, 0x00, 0x00,
+ 0x47, 0x00, 0x00, 0x4a, 0x4b, 0x00, 0x00, 0x4e,
+ 0x4f, 0x50, 0x51, 0x00, 0x53, 0x54, 0x55, 0x56,
+ 0x57, 0x58, 0x59, 0x5a, 0x61, 0x62, 0x63, 0x64,
+ 0x00, 0x66, 0x68, 0x00, 0x70, 0x00, 0x41, 0x00,
+ 0x61, 0x00, 0x41, 0x42, 0x00, 0x44, 0x45, 0x46,
+ 0x47, 0x4a, 0x00, 0x53, 0x00, 0x61, 0x00, 0x41,
+ 0x42, 0x00, 0x44, 0x45, 0x46, 0x47, 0x00, 0x49,
+ 0x4a, 0x4b, 0x4c, 0x4d, 0x00, 0x4f, 0x53, 0x00,
+ 0x61, 0x00, 0x41, 0x00, 0x61, 0x00, 0x41, 0x00,
+ 0x61, 0x00, 0x41, 0x00, 0x61, 0x00, 0x41, 0x00,
+ 0x61, 0x00, 0x41, 0x00, 0x61, 0x00, 0x41, 0x00,
+ 0x61, 0x00, 0x31, 0x01, 0x37, 0x02, 0x91, 0x03,
+ 0xa3, 0x03, 0xb1, 0x03, 0xd1, 0x03, 0x24, 0x00,
+ 0x1f, 0x04, 0x20, 0x05, 0x91, 0x03, 0xa3, 0x03,
+ 0xb1, 0x03, 0xd1, 0x03, 0x24, 0x00, 0x1f, 0x04,
+ 0x20, 0x05, 0x91, 0x03, 0xa3, 0x03, 0xb1, 0x03,
+ 0xd1, 0x03, 0x24, 0x00, 0x1f, 0x04, 0x20, 0x05,
+ 0x91, 0x03, 0xa3, 0x03, 0xb1, 0x03, 0xd1, 0x03,
+ 0x24, 0x00, 0x1f, 0x04, 0x20, 0x05, 0x91, 0x03,
+ 0xa3, 0x03, 0xb1, 0x03, 0xd1, 0x03, 0x24, 0x00,
+ 0x1f, 0x04, 0x20, 0x05, 0x0b, 0x0c, 0x30, 0x00,
+ 0x30, 0x00, 0x30, 0x00, 0x30, 0x00, 0x30, 0x00,
+ 0x27, 0x06, 0x00, 0x01, 0x05, 0x08, 0x2a, 0x06,
+ 0x1e, 0x08, 0x03, 0x0d, 0x20, 0x19, 0x1a, 0x1b,
+ 0x1c, 0x09, 0x0f, 0x17, 0x0b, 0x18, 0x07, 0x0a,
+ 0x00, 0x01, 0x04, 0x06, 0x0c, 0x0e, 0x10, 0x44,
+ 0x90, 0x77, 0x45, 0x28, 0x06, 0x2c, 0x06, 0x00,
+ 0x00, 0x47, 0x06, 0x33, 0x06, 0x17, 0x10, 0x11,
+ 0x12, 0x13, 0x00, 0x06, 0x0e, 0x02, 0x0f, 0x34,
+ 0x06, 0x2a, 0x06, 0x2b, 0x06, 0x2e, 0x06, 0x00,
+ 0x00, 0x36, 0x06, 0x00, 0x00, 0x3a, 0x06, 0x2d,
+ 0x06, 0x00, 0x00, 0x4a, 0x06, 0x00, 0x00, 0x44,
+ 0x06, 0x00, 0x00, 0x46, 0x06, 0x33, 0x06, 0x39,
+ 0x06, 0x00, 0x00, 0x35, 0x06, 0x42, 0x06, 0x00,
+ 0x00, 0x34, 0x06, 0x00, 0x00, 0x00, 0x00, 0x2e,
+ 0x06, 0x00, 0x00, 0x36, 0x06, 0x00, 0x00, 0x3a,
+ 0x06, 0x00, 0x00, 0xba, 0x06, 0x00, 0x00, 0x6f,
+ 0x06, 0x00, 0x00, 0x28, 0x06, 0x2c, 0x06, 0x00,
+ 0x00, 0x47, 0x06, 0x00, 0x00, 0x00, 0x00, 0x2d,
+ 0x06, 0x37, 0x06, 0x4a, 0x06, 0x43, 0x06, 0x00,
+ 0x00, 0x45, 0x06, 0x46, 0x06, 0x33, 0x06, 0x39,
+ 0x06, 0x41, 0x06, 0x35, 0x06, 0x42, 0x06, 0x00,
+ 0x00, 0x34, 0x06, 0x2a, 0x06, 0x2b, 0x06, 0x2e,
+ 0x06, 0x00, 0x00, 0x36, 0x06, 0x38, 0x06, 0x3a,
+ 0x06, 0x6e, 0x06, 0x00, 0x00, 0xa1, 0x06, 0x27,
+ 0x06, 0x00, 0x01, 0x05, 0x08, 0x20, 0x21, 0x0b,
+ 0x06, 0x10, 0x23, 0x2a, 0x06, 0x1a, 0x1b, 0x1c,
+ 0x09, 0x0f, 0x17, 0x0b, 0x18, 0x07, 0x0a, 0x00,
+ 0x01, 0x04, 0x06, 0x0c, 0x0e, 0x10, 0x28, 0x06,
+ 0x2c, 0x06, 0x2f, 0x06, 0x00, 0x00, 0x48, 0x06,
+ 0x32, 0x06, 0x2d, 0x06, 0x37, 0x06, 0x4a, 0x06,
+ 0x2a, 0x06, 0x1a, 0x1b, 0x1c, 0x09, 0x0f, 0x17,
+ 0x0b, 0x18, 0x07, 0x0a, 0x00, 0x01, 0x04, 0x06,
+ 0x0c, 0x0e, 0x10, 0x30, 0x2e, 0x30, 0x00, 0x2c,
+ 0x00, 0x28, 0x00, 0x41, 0x00, 0x29, 0x00, 0x14,
+ 0x30, 0x53, 0x00, 0x15, 0x30, 0x43, 0x52, 0x43,
+ 0x44, 0x57, 0x5a, 0x41, 0x00, 0x48, 0x56, 0x4d,
+ 0x56, 0x53, 0x44, 0x53, 0x53, 0x50, 0x50, 0x56,
+ 0x57, 0x43, 0x4d, 0x43, 0x4d, 0x44, 0x44, 0x4a,
+ 0x4b, 0x30, 0x30, 0x00, 0x68, 0x68, 0x4b, 0x62,
+ 0x57, 0x5b, 0xcc, 0x53, 0xc7, 0x30, 0x8c, 0x4e,
+ 0x1a, 0x59, 0xe3, 0x89, 0x29, 0x59, 0xa4, 0x4e,
+ 0x20, 0x66, 0x21, 0x71, 0x99, 0x65, 0x4d, 0x52,
+ 0x8c, 0x5f, 0x8d, 0x51, 0xb0, 0x65, 0x1d, 0x52,
+ 0x42, 0x7d, 0x1f, 0x75, 0xa9, 0x8c, 0xf0, 0x58,
+ 0x39, 0x54, 0x14, 0x6f, 0x95, 0x62, 0x55, 0x63,
+ 0x00, 0x4e, 0x09, 0x4e, 0x4a, 0x90, 0xe6, 0x5d,
+ 0x2d, 0x4e, 0xf3, 0x53, 0x07, 0x63, 0x70, 0x8d,
+ 0x53, 0x62, 0x81, 0x79, 0x7a, 0x7a, 0x08, 0x54,
+ 0x80, 0x6e, 0x09, 0x67, 0x08, 0x67, 0x33, 0x75,
+ 0x72, 0x52, 0xb6, 0x55, 0x4d, 0x91, 0x14, 0x30,
+ 0x15, 0x30, 0x2c, 0x67, 0x09, 0x4e, 0x8c, 0x4e,
+ 0x89, 0x5b, 0xb9, 0x70, 0x53, 0x62, 0xd7, 0x76,
+ 0xdd, 0x52, 0x57, 0x65, 0x97, 0x5f, 0xef, 0x53,
+ 0x38, 0x4e, 0x05, 0x00, 0x09, 0x22, 0x01, 0x60,
+ 0x4f, 0xae, 0x4f, 0xbb, 0x4f, 0x02, 0x50, 0x7a,
+ 0x50, 0x99, 0x50, 0xe7, 0x50, 0xcf, 0x50, 0x9e,
+ 0x34, 0x3a, 0x06, 0x4d, 0x51, 0x54, 0x51, 0x64,
+ 0x51, 0x77, 0x51, 0x1c, 0x05, 0xb9, 0x34, 0x67,
+ 0x51, 0x8d, 0x51, 0x4b, 0x05, 0x97, 0x51, 0xa4,
+ 0x51, 0xcc, 0x4e, 0xac, 0x51, 0xb5, 0x51, 0xdf,
+ 0x91, 0xf5, 0x51, 0x03, 0x52, 0xdf, 0x34, 0x3b,
+ 0x52, 0x46, 0x52, 0x72, 0x52, 0x77, 0x52, 0x15,
+ 0x35, 0x02, 0x00, 0x20, 0x80, 0x80, 0x00, 0x08,
+ 0x00, 0x00, 0xc7, 0x52, 0x00, 0x02, 0x1d, 0x33,
+ 0x3e, 0x3f, 0x50, 0x82, 0x8a, 0x93, 0xac, 0xb6,
+ 0xb8, 0xb8, 0xb8, 0x2c, 0x0a, 0x70, 0x70, 0xca,
+ 0x53, 0xdf, 0x53, 0x63, 0x0b, 0xeb, 0x53, 0xf1,
+ 0x53, 0x06, 0x54, 0x9e, 0x54, 0x38, 0x54, 0x48,
+ 0x54, 0x68, 0x54, 0xa2, 0x54, 0xf6, 0x54, 0x10,
+ 0x55, 0x53, 0x55, 0x63, 0x55, 0x84, 0x55, 0x84,
+ 0x55, 0x99, 0x55, 0xab, 0x55, 0xb3, 0x55, 0xc2,
+ 0x55, 0x16, 0x57, 0x06, 0x56, 0x17, 0x57, 0x51,
+ 0x56, 0x74, 0x56, 0x07, 0x52, 0xee, 0x58, 0xce,
+ 0x57, 0xf4, 0x57, 0x0d, 0x58, 0x8b, 0x57, 0x32,
+ 0x58, 0x31, 0x58, 0xac, 0x58, 0xe4, 0x14, 0xf2,
+ 0x58, 0xf7, 0x58, 0x06, 0x59, 0x1a, 0x59, 0x22,
+ 0x59, 0x62, 0x59, 0xa8, 0x16, 0xea, 0x16, 0xec,
+ 0x59, 0x1b, 0x5a, 0x27, 0x5a, 0xd8, 0x59, 0x66,
+ 0x5a, 0xee, 0x36, 0xfc, 0x36, 0x08, 0x5b, 0x3e,
+ 0x5b, 0x3e, 0x5b, 0xc8, 0x19, 0xc3, 0x5b, 0xd8,
+ 0x5b, 0xe7, 0x5b, 0xf3, 0x5b, 0x18, 0x1b, 0xff,
+ 0x5b, 0x06, 0x5c, 0x53, 0x5f, 0x22, 0x5c, 0x81,
+ 0x37, 0x60, 0x5c, 0x6e, 0x5c, 0xc0, 0x5c, 0x8d,
+ 0x5c, 0xe4, 0x1d, 0x43, 0x5d, 0xe6, 0x1d, 0x6e,
+ 0x5d, 0x6b, 0x5d, 0x7c, 0x5d, 0xe1, 0x5d, 0xe2,
+ 0x5d, 0x2f, 0x38, 0xfd, 0x5d, 0x28, 0x5e, 0x3d,
+ 0x5e, 0x69, 0x5e, 0x62, 0x38, 0x83, 0x21, 0x7c,
+ 0x38, 0xb0, 0x5e, 0xb3, 0x5e, 0xb6, 0x5e, 0xca,
+ 0x5e, 0x92, 0xa3, 0xfe, 0x5e, 0x31, 0x23, 0x31,
+ 0x23, 0x01, 0x82, 0x22, 0x5f, 0x22, 0x5f, 0xc7,
+ 0x38, 0xb8, 0x32, 0xda, 0x61, 0x62, 0x5f, 0x6b,
+ 0x5f, 0xe3, 0x38, 0x9a, 0x5f, 0xcd, 0x5f, 0xd7,
+ 0x5f, 0xf9, 0x5f, 0x81, 0x60, 0x3a, 0x39, 0x1c,
+ 0x39, 0x94, 0x60, 0xd4, 0x26, 0xc7, 0x60, 0x02,
+ 0x02, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+ 0x08, 0x00, 0x0a, 0x00, 0x00, 0x02, 0x08, 0x00,
+ 0x80, 0x08, 0x00, 0x00, 0x08, 0x80, 0x28, 0x80,
+ 0x02, 0x00, 0x00, 0x02, 0x48, 0x61, 0x00, 0x04,
+ 0x06, 0x04, 0x32, 0x46, 0x6a, 0x5c, 0x67, 0x96,
+ 0xaa, 0xae, 0xc8, 0xd3, 0x5d, 0x62, 0x00, 0x54,
+ 0x77, 0xf3, 0x0c, 0x2b, 0x3d, 0x63, 0xfc, 0x62,
+ 0x68, 0x63, 0x83, 0x63, 0xe4, 0x63, 0xf1, 0x2b,
+ 0x22, 0x64, 0xc5, 0x63, 0xa9, 0x63, 0x2e, 0x3a,
+ 0x69, 0x64, 0x7e, 0x64, 0x9d, 0x64, 0x77, 0x64,
+ 0x6c, 0x3a, 0x4f, 0x65, 0x6c, 0x65, 0x0a, 0x30,
+ 0xe3, 0x65, 0xf8, 0x66, 0x49, 0x66, 0x19, 0x3b,
+ 0x91, 0x66, 0x08, 0x3b, 0xe4, 0x3a, 0x92, 0x51,
+ 0x95, 0x51, 0x00, 0x67, 0x9c, 0x66, 0xad, 0x80,
+ 0xd9, 0x43, 0x17, 0x67, 0x1b, 0x67, 0x21, 0x67,
+ 0x5e, 0x67, 0x53, 0x67, 0xc3, 0x33, 0x49, 0x3b,
+ 0xfa, 0x67, 0x85, 0x67, 0x52, 0x68, 0x85, 0x68,
+ 0x6d, 0x34, 0x8e, 0x68, 0x1f, 0x68, 0x14, 0x69,
+ 0x9d, 0x3b, 0x42, 0x69, 0xa3, 0x69, 0xea, 0x69,
+ 0xa8, 0x6a, 0xa3, 0x36, 0xdb, 0x6a, 0x18, 0x3c,
+ 0x21, 0x6b, 0xa7, 0x38, 0x54, 0x6b, 0x4e, 0x3c,
+ 0x72, 0x6b, 0x9f, 0x6b, 0xba, 0x6b, 0xbb, 0x6b,
+ 0x8d, 0x3a, 0x0b, 0x1d, 0xfa, 0x3a, 0x4e, 0x6c,
+ 0xbc, 0x3c, 0xbf, 0x6c, 0xcd, 0x6c, 0x67, 0x6c,
+ 0x16, 0x6d, 0x3e, 0x6d, 0x77, 0x6d, 0x41, 0x6d,
+ 0x69, 0x6d, 0x78, 0x6d, 0x85, 0x6d, 0x1e, 0x3d,
+ 0x34, 0x6d, 0x2f, 0x6e, 0x6e, 0x6e, 0x33, 0x3d,
+ 0xcb, 0x6e, 0xc7, 0x6e, 0xd1, 0x3e, 0xf9, 0x6d,
+ 0x6e, 0x6f, 0x5e, 0x3f, 0x8e, 0x3f, 0xc6, 0x6f,
+ 0x39, 0x70, 0x1e, 0x70, 0x1b, 0x70, 0x96, 0x3d,
+ 0x4a, 0x70, 0x7d, 0x70, 0x77, 0x70, 0xad, 0x70,
+ 0x25, 0x05, 0x45, 0x71, 0x63, 0x42, 0x9c, 0x71,
+ 0xab, 0x43, 0x28, 0x72, 0x35, 0x72, 0x50, 0x72,
+ 0x08, 0x46, 0x80, 0x72, 0x95, 0x72, 0x35, 0x47,
+ 0x02, 0x20, 0x00, 0x00, 0x20, 0x00, 0x00, 0x00,
+ 0x00, 0x08, 0x80, 0x00, 0x00, 0x02, 0x02, 0x80,
+ 0x8a, 0x00, 0x00, 0x20, 0x00, 0x08, 0x0a, 0x00,
+ 0x80, 0x88, 0x80, 0x20, 0x14, 0x48, 0x7a, 0x73,
+ 0x8b, 0x73, 0xac, 0x3e, 0xa5, 0x73, 0xb8, 0x3e,
+ 0xb8, 0x3e, 0x47, 0x74, 0x5c, 0x74, 0x71, 0x74,
+ 0x85, 0x74, 0xca, 0x74, 0x1b, 0x3f, 0x24, 0x75,
+ 0x36, 0x4c, 0x3e, 0x75, 0x92, 0x4c, 0x70, 0x75,
+ 0x9f, 0x21, 0x10, 0x76, 0xa1, 0x4f, 0xb8, 0x4f,
+ 0x44, 0x50, 0xfc, 0x3f, 0x08, 0x40, 0xf4, 0x76,
+ 0xf3, 0x50, 0xf2, 0x50, 0x19, 0x51, 0x33, 0x51,
+ 0x1e, 0x77, 0x1f, 0x77, 0x1f, 0x77, 0x4a, 0x77,
+ 0x39, 0x40, 0x8b, 0x77, 0x46, 0x40, 0x96, 0x40,
+ 0x1d, 0x54, 0x4e, 0x78, 0x8c, 0x78, 0xcc, 0x78,
+ 0xe3, 0x40, 0x26, 0x56, 0x56, 0x79, 0x9a, 0x56,
+ 0xc5, 0x56, 0x8f, 0x79, 0xeb, 0x79, 0x2f, 0x41,
+ 0x40, 0x7a, 0x4a, 0x7a, 0x4f, 0x7a, 0x7c, 0x59,
+ 0xa7, 0x5a, 0xa7, 0x5a, 0xee, 0x7a, 0x02, 0x42,
+ 0xab, 0x5b, 0xc6, 0x7b, 0xc9, 0x7b, 0x27, 0x42,
+ 0x80, 0x5c, 0xd2, 0x7c, 0xa0, 0x42, 0xe8, 0x7c,
+ 0xe3, 0x7c, 0x00, 0x7d, 0x86, 0x5f, 0x63, 0x7d,
+ 0x01, 0x43, 0xc7, 0x7d, 0x02, 0x7e, 0x45, 0x7e,
+ 0x34, 0x43, 0x28, 0x62, 0x47, 0x62, 0x59, 0x43,
+ 0xd9, 0x62, 0x7a, 0x7f, 0x3e, 0x63, 0x95, 0x7f,
+ 0xfa, 0x7f, 0x05, 0x80, 0xda, 0x64, 0x23, 0x65,
+ 0x60, 0x80, 0xa8, 0x65, 0x70, 0x80, 0x5f, 0x33,
+ 0xd5, 0x43, 0xb2, 0x80, 0x03, 0x81, 0x0b, 0x44,
+ 0x3e, 0x81, 0xb5, 0x5a, 0xa7, 0x67, 0xb5, 0x67,
+ 0x93, 0x33, 0x9c, 0x33, 0x01, 0x82, 0x04, 0x82,
+ 0x9e, 0x8f, 0x6b, 0x44, 0x91, 0x82, 0x8b, 0x82,
+ 0x9d, 0x82, 0xb3, 0x52, 0xb1, 0x82, 0xb3, 0x82,
+ 0xbd, 0x82, 0xe6, 0x82, 0x3c, 0x6b, 0xe5, 0x82,
+ 0x1d, 0x83, 0x63, 0x83, 0xad, 0x83, 0x23, 0x83,
+ 0xbd, 0x83, 0xe7, 0x83, 0x57, 0x84, 0x53, 0x83,
+ 0xca, 0x83, 0xcc, 0x83, 0xdc, 0x83, 0x36, 0x6c,
+ 0x6b, 0x6d, 0x02, 0x00, 0x00, 0x20, 0x22, 0x2a,
+ 0xa0, 0x0a, 0x00, 0x20, 0x80, 0x28, 0x00, 0xa8,
+ 0x20, 0x20, 0x00, 0x02, 0x80, 0x22, 0x02, 0x8a,
+ 0x08, 0x00, 0xaa, 0x00, 0x00, 0x00, 0x02, 0x00,
+ 0x00, 0x28, 0xd5, 0x6c, 0x2b, 0x45, 0xf1, 0x84,
+ 0xf3, 0x84, 0x16, 0x85, 0xca, 0x73, 0x64, 0x85,
+ 0x2c, 0x6f, 0x5d, 0x45, 0x61, 0x45, 0xb1, 0x6f,
+ 0xd2, 0x70, 0x6b, 0x45, 0x50, 0x86, 0x5c, 0x86,
+ 0x67, 0x86, 0x69, 0x86, 0xa9, 0x86, 0x88, 0x86,
+ 0x0e, 0x87, 0xe2, 0x86, 0x79, 0x87, 0x28, 0x87,
+ 0x6b, 0x87, 0x86, 0x87, 0xd7, 0x45, 0xe1, 0x87,
+ 0x01, 0x88, 0xf9, 0x45, 0x60, 0x88, 0x63, 0x88,
+ 0x67, 0x76, 0xd7, 0x88, 0xde, 0x88, 0x35, 0x46,
+ 0xfa, 0x88, 0xbb, 0x34, 0xae, 0x78, 0x66, 0x79,
+ 0xbe, 0x46, 0xc7, 0x46, 0xa0, 0x8a, 0xed, 0x8a,
+ 0x8a, 0x8b, 0x55, 0x8c, 0xa8, 0x7c, 0xab, 0x8c,
+ 0xc1, 0x8c, 0x1b, 0x8d, 0x77, 0x8d, 0x2f, 0x7f,
+ 0x04, 0x08, 0xcb, 0x8d, 0xbc, 0x8d, 0xf0, 0x8d,
+ 0xde, 0x08, 0xd4, 0x8e, 0x38, 0x8f, 0xd2, 0x85,
+ 0xed, 0x85, 0x94, 0x90, 0xf1, 0x90, 0x11, 0x91,
+ 0x2e, 0x87, 0x1b, 0x91, 0x38, 0x92, 0xd7, 0x92,
+ 0xd8, 0x92, 0x7c, 0x92, 0xf9, 0x93, 0x15, 0x94,
+ 0xfa, 0x8b, 0x8b, 0x95, 0x95, 0x49, 0xb7, 0x95,
+ 0x77, 0x8d, 0xe6, 0x49, 0xc3, 0x96, 0xb2, 0x5d,
+ 0x23, 0x97, 0x45, 0x91, 0x1a, 0x92, 0x6e, 0x4a,
+ 0x76, 0x4a, 0xe0, 0x97, 0x0a, 0x94, 0xb2, 0x4a,
+ 0x96, 0x94, 0x0b, 0x98, 0x0b, 0x98, 0x29, 0x98,
+ 0xb6, 0x95, 0xe2, 0x98, 0x33, 0x4b, 0x29, 0x99,
+ 0xa7, 0x99, 0xc2, 0x99, 0xfe, 0x99, 0xce, 0x4b,
+ 0x30, 0x9b, 0x12, 0x9b, 0x40, 0x9c, 0xfd, 0x9c,
+ 0xce, 0x4c, 0xed, 0x4c, 0x67, 0x9d, 0xce, 0xa0,
+ 0xf8, 0x4c, 0x05, 0xa1, 0x0e, 0xa2, 0x91, 0xa2,
+ 0xbb, 0x9e, 0x56, 0x4d, 0xf9, 0x9e, 0xfe, 0x9e,
+ 0x05, 0x9f, 0x0f, 0x9f, 0x16, 0x9f, 0x3b, 0x9f,
+ 0x00, 0xa6, 0x02, 0x88, 0xa0, 0x00, 0x00, 0x00,
+ 0x00, 0x80, 0x00, 0x28, 0x00, 0x08, 0xa0, 0x80,
+ 0xa0, 0x80, 0x00, 0x80, 0x80, 0x00, 0x0a, 0x88,
+ 0x80, 0x00, 0x80, 0x00, 0x20, 0x2a, 0x00, 0x80,
+};
+
+static const uint16_t unicode_comp_table[944] = {
+ 0x4a01, 0x49c0, 0x4a02, 0x0280, 0x0281, 0x0282, 0x0283, 0x02c0,
+ 0x02c2, 0x0a00, 0x0284, 0x2442, 0x0285, 0x07c0, 0x0980, 0x0982,
+ 0x2440, 0x2280, 0x02c4, 0x2282, 0x2284, 0x2286, 0x02c6, 0x02c8,
+ 0x02ca, 0x02cc, 0x0287, 0x228a, 0x02ce, 0x228c, 0x2290, 0x2292,
+ 0x228e, 0x0288, 0x0289, 0x028a, 0x2482, 0x0300, 0x0302, 0x0304,
+ 0x028b, 0x2480, 0x0308, 0x0984, 0x0986, 0x2458, 0x0a02, 0x0306,
+ 0x2298, 0x229a, 0x229e, 0x0900, 0x030a, 0x22a0, 0x030c, 0x030e,
+ 0x0840, 0x0310, 0x0312, 0x22a2, 0x22a6, 0x09c0, 0x22a4, 0x22a8,
+ 0x22aa, 0x028c, 0x028d, 0x028e, 0x0340, 0x0342, 0x0344, 0x0380,
+ 0x028f, 0x248e, 0x07c2, 0x0988, 0x098a, 0x2490, 0x0346, 0x22ac,
+ 0x0400, 0x22b0, 0x0842, 0x22b2, 0x0402, 0x22b4, 0x0440, 0x0444,
+ 0x22b6, 0x0442, 0x22c2, 0x22c0, 0x22c4, 0x22c6, 0x22c8, 0x0940,
+ 0x04c0, 0x0291, 0x22ca, 0x04c4, 0x22cc, 0x04c2, 0x22d0, 0x22ce,
+ 0x0292, 0x0293, 0x0294, 0x0295, 0x0540, 0x0542, 0x0a08, 0x0296,
+ 0x2494, 0x0544, 0x07c4, 0x098c, 0x098e, 0x06c0, 0x2492, 0x0844,
+ 0x2308, 0x230a, 0x0580, 0x230c, 0x0584, 0x0990, 0x0992, 0x230e,
+ 0x0582, 0x2312, 0x0586, 0x0588, 0x2314, 0x058c, 0x2316, 0x0998,
+ 0x058a, 0x231e, 0x0590, 0x2320, 0x099a, 0x058e, 0x2324, 0x2322,
+ 0x0299, 0x029a, 0x029b, 0x05c0, 0x05c2, 0x05c4, 0x029c, 0x24ac,
+ 0x05c6, 0x05c8, 0x07c6, 0x0994, 0x0996, 0x0700, 0x24aa, 0x2326,
+ 0x05ca, 0x232a, 0x2328, 0x2340, 0x2342, 0x2344, 0x2346, 0x05cc,
+ 0x234a, 0x2348, 0x234c, 0x234e, 0x2350, 0x24b8, 0x029d, 0x05ce,
+ 0x24be, 0x0a0c, 0x2352, 0x0600, 0x24bc, 0x24ba, 0x0640, 0x2354,
+ 0x0642, 0x0644, 0x2356, 0x2358, 0x02a0, 0x02a1, 0x02a2, 0x02a3,
+ 0x02c1, 0x02c3, 0x0a01, 0x02a4, 0x2443, 0x02a5, 0x07c1, 0x0981,
+ 0x0983, 0x2441, 0x2281, 0x02c5, 0x2283, 0x2285, 0x2287, 0x02c7,
+ 0x02c9, 0x02cb, 0x02cd, 0x02a7, 0x228b, 0x02cf, 0x228d, 0x2291,
+ 0x2293, 0x228f, 0x02a8, 0x02a9, 0x02aa, 0x2483, 0x0301, 0x0303,
+ 0x0305, 0x02ab, 0x2481, 0x0309, 0x0985, 0x0987, 0x2459, 0x0a03,
+ 0x0307, 0x2299, 0x229b, 0x229f, 0x0901, 0x030b, 0x22a1, 0x030d,
+ 0x030f, 0x0841, 0x0311, 0x0313, 0x22a3, 0x22a7, 0x09c1, 0x22a5,
+ 0x22a9, 0x22ab, 0x2380, 0x02ac, 0x02ad, 0x02ae, 0x0341, 0x0343,
+ 0x0345, 0x02af, 0x248f, 0x07c3, 0x0989, 0x098b, 0x2491, 0x0347,
+ 0x22ad, 0x0401, 0x0884, 0x22b1, 0x0843, 0x22b3, 0x0403, 0x22b5,
+ 0x0441, 0x0445, 0x22b7, 0x0443, 0x22c3, 0x22c1, 0x22c5, 0x22c7,
+ 0x22c9, 0x0941, 0x04c1, 0x02b1, 0x22cb, 0x04c5, 0x22cd, 0x04c3,
+ 0x22d1, 0x22cf, 0x02b2, 0x02b3, 0x02b4, 0x02b5, 0x0541, 0x0543,
+ 0x0a09, 0x02b6, 0x2495, 0x0545, 0x07c5, 0x098d, 0x098f, 0x06c1,
+ 0x2493, 0x0845, 0x2309, 0x230b, 0x0581, 0x230d, 0x0585, 0x0991,
+ 0x0993, 0x230f, 0x0583, 0x2313, 0x0587, 0x0589, 0x2315, 0x058d,
+ 0x2317, 0x0999, 0x058b, 0x231f, 0x2381, 0x0591, 0x2321, 0x099b,
+ 0x058f, 0x2325, 0x2323, 0x02b9, 0x02ba, 0x02bb, 0x05c1, 0x05c3,
+ 0x05c5, 0x02bc, 0x24ad, 0x05c7, 0x05c9, 0x07c7, 0x0995, 0x0997,
+ 0x0701, 0x24ab, 0x2327, 0x05cb, 0x232b, 0x2329, 0x2341, 0x2343,
+ 0x2345, 0x2347, 0x05cd, 0x234b, 0x2349, 0x2382, 0x234d, 0x234f,
+ 0x2351, 0x24b9, 0x02bd, 0x05cf, 0x24bf, 0x0a0d, 0x2353, 0x02bf,
+ 0x24bd, 0x2383, 0x24bb, 0x0641, 0x2355, 0x0643, 0x0645, 0x2357,
+ 0x2359, 0x3101, 0x0c80, 0x2e00, 0x2446, 0x2444, 0x244a, 0x2448,
+ 0x0800, 0x0942, 0x0944, 0x0804, 0x2288, 0x2486, 0x2484, 0x248a,
+ 0x2488, 0x22ae, 0x2498, 0x2496, 0x249c, 0x249a, 0x2300, 0x0a06,
+ 0x2302, 0x0a04, 0x0946, 0x07ce, 0x07ca, 0x07c8, 0x07cc, 0x2447,
+ 0x2445, 0x244b, 0x2449, 0x0801, 0x0943, 0x0945, 0x0805, 0x2289,
+ 0x2487, 0x2485, 0x248b, 0x2489, 0x22af, 0x2499, 0x2497, 0x249d,
+ 0x249b, 0x2301, 0x0a07, 0x2303, 0x0a05, 0x0947, 0x07cf, 0x07cb,
+ 0x07c9, 0x07cd, 0x2450, 0x244e, 0x2454, 0x2452, 0x2451, 0x244f,
+ 0x2455, 0x2453, 0x2294, 0x2296, 0x2295, 0x2297, 0x2304, 0x2306,
+ 0x2305, 0x2307, 0x2318, 0x2319, 0x231a, 0x231b, 0x232c, 0x232d,
+ 0x232e, 0x232f, 0x2400, 0x24a2, 0x24a0, 0x24a6, 0x24a4, 0x24a8,
+ 0x24a3, 0x24a1, 0x24a7, 0x24a5, 0x24a9, 0x24b0, 0x24ae, 0x24b4,
+ 0x24b2, 0x24b6, 0x24b1, 0x24af, 0x24b5, 0x24b3, 0x24b7, 0x0882,
+ 0x0880, 0x0881, 0x0802, 0x0803, 0x229c, 0x229d, 0x0a0a, 0x0a0b,
+ 0x0883, 0x0b40, 0x2c8a, 0x0c81, 0x2c89, 0x2c88, 0x2540, 0x2541,
+ 0x2d00, 0x2e07, 0x0d00, 0x2640, 0x2641, 0x2e80, 0x0d01, 0x26c8,
+ 0x26c9, 0x2f00, 0x2f84, 0x0d02, 0x2f83, 0x2f82, 0x0d40, 0x26d8,
+ 0x26d9, 0x3186, 0x0d04, 0x2740, 0x2741, 0x3100, 0x3086, 0x0d06,
+ 0x3085, 0x3084, 0x0d41, 0x2840, 0x3200, 0x0d07, 0x284f, 0x2850,
+ 0x3280, 0x2c84, 0x2e03, 0x2857, 0x0d42, 0x2c81, 0x2c80, 0x24c0,
+ 0x24c1, 0x2c86, 0x2c83, 0x28c0, 0x0d43, 0x25c0, 0x25c1, 0x2940,
+ 0x0d44, 0x26c0, 0x26c1, 0x2e05, 0x2e02, 0x29c0, 0x0d45, 0x2f05,
+ 0x2f04, 0x0d80, 0x26d0, 0x26d1, 0x2f80, 0x2a40, 0x0d82, 0x26e0,
+ 0x26e1, 0x3080, 0x3081, 0x2ac0, 0x0d83, 0x3004, 0x3003, 0x0d81,
+ 0x27c0, 0x27c1, 0x3082, 0x2b40, 0x0d84, 0x2847, 0x2848, 0x3184,
+ 0x3181, 0x2f06, 0x0d08, 0x2f81, 0x3005, 0x0d46, 0x3083, 0x3182,
+ 0x0e00, 0x0e01, 0x0f40, 0x1180, 0x1182, 0x0f03, 0x0f00, 0x11c0,
+ 0x0f01, 0x1140, 0x1202, 0x1204, 0x0f81, 0x1240, 0x0fc0, 0x1242,
+ 0x0f80, 0x1244, 0x1284, 0x0f82, 0x1286, 0x1288, 0x128a, 0x12c0,
+ 0x1282, 0x1181, 0x1183, 0x1043, 0x1040, 0x11c1, 0x1041, 0x1141,
+ 0x1203, 0x1205, 0x10c1, 0x1241, 0x1000, 0x1243, 0x10c0, 0x1245,
+ 0x1285, 0x10c2, 0x1287, 0x1289, 0x128b, 0x12c1, 0x1283, 0x1080,
+ 0x1100, 0x1101, 0x1200, 0x1201, 0x1280, 0x1281, 0x1340, 0x1341,
+ 0x1343, 0x1342, 0x1344, 0x13c2, 0x1400, 0x13c0, 0x1440, 0x1480,
+ 0x14c0, 0x1540, 0x1541, 0x1740, 0x1700, 0x1741, 0x17c0, 0x1800,
+ 0x1802, 0x1801, 0x1840, 0x1880, 0x1900, 0x18c0, 0x18c1, 0x1901,
+ 0x1940, 0x1942, 0x1941, 0x1980, 0x19c0, 0x19c2, 0x19c1, 0x1c80,
+ 0x1cc0, 0x1dc0, 0x1f80, 0x2000, 0x2002, 0x2004, 0x2006, 0x2008,
+ 0x2040, 0x2080, 0x2082, 0x20c0, 0x20c1, 0x2100, 0x22b8, 0x22b9,
+ 0x2310, 0x2311, 0x231c, 0x231d, 0x244c, 0x2456, 0x244d, 0x2457,
+ 0x248c, 0x248d, 0x249e, 0x249f, 0x2500, 0x2502, 0x2504, 0x2bc0,
+ 0x2501, 0x2503, 0x2505, 0x2bc1, 0x2bc2, 0x2bc3, 0x2bc4, 0x2bc5,
+ 0x2bc6, 0x2bc7, 0x2580, 0x2582, 0x2584, 0x2bc8, 0x2581, 0x2583,
+ 0x2585, 0x2bc9, 0x2bca, 0x2bcb, 0x2bcc, 0x2bcd, 0x2bce, 0x2bcf,
+ 0x2600, 0x2602, 0x2601, 0x2603, 0x2680, 0x2682, 0x2681, 0x2683,
+ 0x26c2, 0x26c4, 0x26c6, 0x2c00, 0x26c3, 0x26c5, 0x26c7, 0x2c01,
+ 0x2c02, 0x2c03, 0x2c04, 0x2c05, 0x2c06, 0x2c07, 0x26ca, 0x26cc,
+ 0x26ce, 0x2c08, 0x26cb, 0x26cd, 0x26cf, 0x2c09, 0x2c0a, 0x2c0b,
+ 0x2c0c, 0x2c0d, 0x2c0e, 0x2c0f, 0x26d2, 0x26d4, 0x26d6, 0x26d3,
+ 0x26d5, 0x26d7, 0x26da, 0x26dc, 0x26de, 0x26db, 0x26dd, 0x26df,
+ 0x2700, 0x2702, 0x2701, 0x2703, 0x2780, 0x2782, 0x2781, 0x2783,
+ 0x2800, 0x2802, 0x2804, 0x2801, 0x2803, 0x2805, 0x2842, 0x2844,
+ 0x2846, 0x2849, 0x284b, 0x284d, 0x2c40, 0x284a, 0x284c, 0x284e,
+ 0x2c41, 0x2c42, 0x2c43, 0x2c44, 0x2c45, 0x2c46, 0x2c47, 0x2851,
+ 0x2853, 0x2855, 0x2c48, 0x2852, 0x2854, 0x2856, 0x2c49, 0x2c4a,
+ 0x2c4b, 0x2c4c, 0x2c4d, 0x2c4e, 0x2c4f, 0x2c82, 0x2e01, 0x3180,
+ 0x2c87, 0x2f01, 0x2f02, 0x2f03, 0x2e06, 0x3185, 0x3000, 0x3001,
+ 0x3002, 0x4640, 0x4641, 0x4680, 0x46c0, 0x46c2, 0x46c1, 0x4700,
+ 0x4740, 0x4780, 0x47c0, 0x47c2, 0x4900, 0x4940, 0x4980, 0x4982,
+ 0x4a00, 0x49c2, 0x4a03, 0x4a04, 0x4a40, 0x4a41, 0x4a80, 0x4a81,
+ 0x4ac0, 0x4ac1, 0x4bc0, 0x4bc1, 0x4b00, 0x4b01, 0x4b40, 0x4b41,
+ 0x4bc2, 0x4bc3, 0x4b80, 0x4b81, 0x4b82, 0x4b83, 0x4c00, 0x4c01,
+ 0x4c02, 0x4c03, 0x5600, 0x5440, 0x5442, 0x5444, 0x5446, 0x5448,
+ 0x544a, 0x544c, 0x544e, 0x5450, 0x5452, 0x5454, 0x5456, 0x5480,
+ 0x5482, 0x5484, 0x54c0, 0x54c1, 0x5500, 0x5501, 0x5540, 0x5541,
+ 0x5580, 0x5581, 0x55c0, 0x55c1, 0x5680, 0x58c0, 0x5700, 0x5702,
+ 0x5704, 0x5706, 0x5708, 0x570a, 0x570c, 0x570e, 0x5710, 0x5712,
+ 0x5714, 0x5716, 0x5740, 0x5742, 0x5744, 0x5780, 0x5781, 0x57c0,
+ 0x57c1, 0x5800, 0x5801, 0x5840, 0x5841, 0x5880, 0x5881, 0x5900,
+ 0x5901, 0x5902, 0x5903, 0x5940, 0x8e00, 0x8e02, 0x8e40, 0x8e80,
+ 0x8e81, 0x8ec0, 0x8ec1, 0x8f01, 0x8f00, 0x8f03, 0x8f40, 0x8f41,
+};
+
+typedef enum {
+ UNICODE_GC_Cn,
+ UNICODE_GC_Lu,
+ UNICODE_GC_Ll,
+ UNICODE_GC_Lt,
+ UNICODE_GC_Lm,
+ UNICODE_GC_Lo,
+ UNICODE_GC_Mn,
+ UNICODE_GC_Mc,
+ UNICODE_GC_Me,
+ UNICODE_GC_Nd,
+ UNICODE_GC_Nl,
+ UNICODE_GC_No,
+ UNICODE_GC_Sm,
+ UNICODE_GC_Sc,
+ UNICODE_GC_Sk,
+ UNICODE_GC_So,
+ UNICODE_GC_Pc,
+ UNICODE_GC_Pd,
+ UNICODE_GC_Ps,
+ UNICODE_GC_Pe,
+ UNICODE_GC_Pi,
+ UNICODE_GC_Pf,
+ UNICODE_GC_Po,
+ UNICODE_GC_Zs,
+ UNICODE_GC_Zl,
+ UNICODE_GC_Zp,
+ UNICODE_GC_Cc,
+ UNICODE_GC_Cf,
+ UNICODE_GC_Cs,
+ UNICODE_GC_Co,
+ UNICODE_GC_LC,
+ UNICODE_GC_L,
+ UNICODE_GC_M,
+ UNICODE_GC_N,
+ UNICODE_GC_S,
+ UNICODE_GC_P,
+ UNICODE_GC_Z,
+ UNICODE_GC_C,
+ UNICODE_GC_COUNT,
+} UnicodeGCEnum;
+
+static const char unicode_gc_name_table[] =
+ "Cn,Unassigned" "\0"
+ "Lu,Uppercase_Letter" "\0"
+ "Ll,Lowercase_Letter" "\0"
+ "Lt,Titlecase_Letter" "\0"
+ "Lm,Modifier_Letter" "\0"
+ "Lo,Other_Letter" "\0"
+ "Mn,Nonspacing_Mark" "\0"
+ "Mc,Spacing_Mark" "\0"
+ "Me,Enclosing_Mark" "\0"
+ "Nd,Decimal_Number,digit" "\0"
+ "Nl,Letter_Number" "\0"
+ "No,Other_Number" "\0"
+ "Sm,Math_Symbol" "\0"
+ "Sc,Currency_Symbol" "\0"
+ "Sk,Modifier_Symbol" "\0"
+ "So,Other_Symbol" "\0"
+ "Pc,Connector_Punctuation" "\0"
+ "Pd,Dash_Punctuation" "\0"
+ "Ps,Open_Punctuation" "\0"
+ "Pe,Close_Punctuation" "\0"
+ "Pi,Initial_Punctuation" "\0"
+ "Pf,Final_Punctuation" "\0"
+ "Po,Other_Punctuation" "\0"
+ "Zs,Space_Separator" "\0"
+ "Zl,Line_Separator" "\0"
+ "Zp,Paragraph_Separator" "\0"
+ "Cc,Control,cntrl" "\0"
+ "Cf,Format" "\0"
+ "Cs,Surrogate" "\0"
+ "Co,Private_Use" "\0"
+ "LC,Cased_Letter" "\0"
+ "L,Letter" "\0"
+ "M,Mark,Combining_Mark" "\0"
+ "N,Number" "\0"
+ "S,Symbol" "\0"
+ "P,Punctuation,punct" "\0"
+ "Z,Separator" "\0"
+ "C,Other" "\0"
+;
+
+static const uint8_t unicode_gc_table[3655] = {
+ 0xfa, 0x18, 0x17, 0x56, 0x0d, 0x56, 0x12, 0x13,
+ 0x16, 0x0c, 0x16, 0x11, 0x36, 0xe9, 0x02, 0x36,
+ 0x4c, 0x36, 0xe1, 0x12, 0x12, 0x16, 0x13, 0x0e,
+ 0x10, 0x0e, 0xe2, 0x12, 0x12, 0x0c, 0x13, 0x0c,
+ 0xfa, 0x19, 0x17, 0x16, 0x6d, 0x0f, 0x16, 0x0e,
+ 0x0f, 0x05, 0x14, 0x0c, 0x1b, 0x0f, 0x0e, 0x0f,
+ 0x0c, 0x2b, 0x0e, 0x02, 0x36, 0x0e, 0x0b, 0x05,
+ 0x15, 0x4b, 0x16, 0xe1, 0x0f, 0x0c, 0xc1, 0xe2,
+ 0x10, 0x0c, 0xe2, 0x00, 0xff, 0x30, 0x02, 0xff,
+ 0x08, 0x02, 0xff, 0x27, 0xbf, 0x22, 0x21, 0x02,
+ 0x5f, 0x5f, 0x21, 0x22, 0x61, 0x02, 0x21, 0x02,
+ 0x41, 0x42, 0x21, 0x02, 0x21, 0x02, 0x9f, 0x7f,
+ 0x02, 0x5f, 0x5f, 0x21, 0x02, 0x5f, 0x3f, 0x02,
+ 0x05, 0x3f, 0x22, 0x65, 0x01, 0x03, 0x02, 0x01,
+ 0x03, 0x02, 0x01, 0x03, 0x02, 0xff, 0x08, 0x02,
+ 0xff, 0x0a, 0x02, 0x01, 0x03, 0x02, 0x5f, 0x21,
+ 0x02, 0xff, 0x32, 0xa2, 0x21, 0x02, 0x21, 0x22,
+ 0x5f, 0x41, 0x02, 0xff, 0x00, 0xe2, 0x3c, 0x05,
+ 0xe2, 0x13, 0xe4, 0x0a, 0x6e, 0xe4, 0x04, 0xee,
+ 0x06, 0x84, 0xce, 0x04, 0x0e, 0x04, 0xee, 0x09,
+ 0xe6, 0x68, 0x7f, 0x04, 0x0e, 0x3f, 0x20, 0x04,
+ 0x42, 0x16, 0x01, 0x60, 0x2e, 0x01, 0x16, 0x41,
+ 0x00, 0x01, 0x00, 0x21, 0x02, 0xe1, 0x09, 0x00,
+ 0xe1, 0x01, 0xe2, 0x1b, 0x3f, 0x02, 0x41, 0x42,
+ 0xff, 0x10, 0x62, 0x3f, 0x0c, 0x5f, 0x3f, 0x02,
+ 0xe1, 0x2b, 0xe2, 0x28, 0xff, 0x1a, 0x0f, 0x86,
+ 0x28, 0xff, 0x2f, 0xff, 0x06, 0x02, 0xff, 0x58,
+ 0x00, 0xe1, 0x1e, 0x20, 0x04, 0xb6, 0xe2, 0x21,
+ 0x16, 0x11, 0x20, 0x2f, 0x0d, 0x00, 0xe6, 0x25,
+ 0x11, 0x06, 0x16, 0x26, 0x16, 0x26, 0x16, 0x06,
+ 0xe0, 0x00, 0xe5, 0x13, 0x60, 0x65, 0x36, 0xe0,
+ 0x03, 0xbb, 0x4c, 0x36, 0x0d, 0x36, 0x2f, 0xe6,
+ 0x03, 0x16, 0x1b, 0x00, 0x36, 0xe5, 0x18, 0x04,
+ 0xe5, 0x02, 0xe6, 0x0d, 0xe9, 0x02, 0x76, 0x25,
+ 0x06, 0xe5, 0x5b, 0x16, 0x05, 0xc6, 0x1b, 0x0f,
+ 0xa6, 0x24, 0x26, 0x0f, 0x66, 0x25, 0xe9, 0x02,
+ 0x45, 0x2f, 0x05, 0xf6, 0x06, 0x00, 0x1b, 0x05,
+ 0x06, 0xe5, 0x16, 0xe6, 0x13, 0x20, 0xe5, 0x51,
+ 0xe6, 0x03, 0x05, 0xe0, 0x06, 0xe9, 0x02, 0xe5,
+ 0x19, 0xe6, 0x01, 0x24, 0x0f, 0x56, 0x04, 0x20,
+ 0x06, 0x2d, 0xe5, 0x0e, 0x66, 0x04, 0xe6, 0x01,
+ 0x04, 0x46, 0x04, 0x86, 0x20, 0xf6, 0x07, 0x00,
+ 0xe5, 0x11, 0x46, 0x20, 0x16, 0x00, 0xe5, 0x03,
+ 0xe0, 0x2d, 0xe5, 0x0d, 0x00, 0xe5, 0x00, 0xe0,
+ 0x0d, 0xe6, 0x07, 0x1b, 0xe6, 0x18, 0x07, 0xe5,
+ 0x2e, 0x06, 0x07, 0x06, 0x05, 0x47, 0xe6, 0x00,
+ 0x67, 0x06, 0x27, 0x05, 0xc6, 0xe5, 0x02, 0x26,
+ 0x36, 0xe9, 0x02, 0x16, 0x04, 0xe5, 0x07, 0x06,
+ 0x27, 0x00, 0xe5, 0x00, 0x20, 0x25, 0x20, 0xe5,
+ 0x0e, 0x00, 0xc5, 0x00, 0x05, 0x40, 0x65, 0x20,
+ 0x06, 0x05, 0x47, 0x66, 0x20, 0x27, 0x20, 0x27,
+ 0x06, 0x05, 0xe0, 0x00, 0x07, 0x60, 0x25, 0x00,
+ 0x45, 0x26, 0x20, 0xe9, 0x02, 0x25, 0x2d, 0xab,
+ 0x0f, 0x0d, 0x05, 0x16, 0x06, 0x20, 0x26, 0x07,
+ 0x00, 0xa5, 0x60, 0x25, 0x20, 0xe5, 0x0e, 0x00,
+ 0xc5, 0x00, 0x25, 0x00, 0x25, 0x00, 0x25, 0x20,
+ 0x06, 0x00, 0x47, 0x26, 0x60, 0x26, 0x20, 0x46,
+ 0x40, 0x06, 0xc0, 0x65, 0x00, 0x05, 0xc0, 0xe9,
+ 0x02, 0x26, 0x45, 0x06, 0x16, 0xe0, 0x02, 0x26,
+ 0x07, 0x00, 0xe5, 0x01, 0x00, 0x45, 0x00, 0xe5,
+ 0x0e, 0x00, 0xc5, 0x00, 0x25, 0x00, 0x85, 0x20,
+ 0x06, 0x05, 0x47, 0x86, 0x00, 0x26, 0x07, 0x00,
+ 0x27, 0x06, 0x20, 0x05, 0xe0, 0x07, 0x25, 0x26,
+ 0x20, 0xe9, 0x02, 0x16, 0x0d, 0xc0, 0x05, 0xa6,
+ 0x00, 0x06, 0x27, 0x00, 0xe5, 0x00, 0x20, 0x25,
+ 0x20, 0xe5, 0x0e, 0x00, 0xc5, 0x00, 0x25, 0x00,
+ 0x85, 0x20, 0x06, 0x05, 0x07, 0x06, 0x07, 0x66,
+ 0x20, 0x27, 0x20, 0x27, 0x06, 0xe0, 0x00, 0x06,
+ 0x07, 0x60, 0x25, 0x00, 0x45, 0x26, 0x20, 0xe9,
+ 0x02, 0x0f, 0x05, 0xab, 0xe0, 0x02, 0x06, 0x05,
+ 0x00, 0xa5, 0x40, 0x45, 0x00, 0x65, 0x40, 0x25,
+ 0x00, 0x05, 0x00, 0x25, 0x40, 0x25, 0x40, 0x45,
+ 0x40, 0xe5, 0x04, 0x60, 0x27, 0x06, 0x27, 0x40,
+ 0x47, 0x00, 0x47, 0x06, 0x20, 0x05, 0xa0, 0x07,
+ 0xe0, 0x06, 0xe9, 0x02, 0x4b, 0xaf, 0x0d, 0x0f,
+ 0x80, 0x06, 0x47, 0x06, 0xe5, 0x00, 0x00, 0x45,
+ 0x00, 0xe5, 0x0f, 0x00, 0xe5, 0x08, 0x40, 0x05,
+ 0x46, 0x67, 0x00, 0x46, 0x00, 0x66, 0xc0, 0x26,
+ 0x00, 0x45, 0x80, 0x25, 0x26, 0x20, 0xe9, 0x02,
+ 0xe0, 0x00, 0xcb, 0x0f, 0x05, 0x06, 0x27, 0x16,
+ 0xe5, 0x00, 0x00, 0x45, 0x00, 0xe5, 0x0f, 0x00,
+ 0xe5, 0x02, 0x00, 0x85, 0x20, 0x06, 0x05, 0x07,
+ 0x06, 0x87, 0x00, 0x06, 0x27, 0x00, 0x27, 0x26,
+ 0xc0, 0x27, 0xc0, 0x05, 0x00, 0x25, 0x26, 0x20,
+ 0xe9, 0x02, 0x00, 0x25, 0xe0, 0x05, 0x26, 0x27,
+ 0x00, 0xe5, 0x00, 0x00, 0x45, 0x00, 0xe5, 0x21,
+ 0x26, 0x05, 0x47, 0x66, 0x00, 0x47, 0x00, 0x47,
+ 0x06, 0x05, 0x0f, 0x60, 0x45, 0x07, 0xcb, 0x45,
+ 0x26, 0x20, 0xe9, 0x02, 0xeb, 0x01, 0x0f, 0xa5,
+ 0x20, 0x27, 0x00, 0xe5, 0x0a, 0x40, 0xe5, 0x10,
+ 0x00, 0xe5, 0x01, 0x00, 0x05, 0x20, 0xc5, 0x40,
+ 0x06, 0x60, 0x47, 0x46, 0x00, 0x06, 0x00, 0xe7,
+ 0x00, 0xa0, 0xe9, 0x02, 0x20, 0x27, 0x16, 0xe0,
+ 0x04, 0xe5, 0x28, 0x06, 0x25, 0xc6, 0x60, 0x0d,
+ 0xa5, 0x04, 0xe6, 0x00, 0x16, 0xe9, 0x02, 0x36,
+ 0xe0, 0x1d, 0x25, 0x00, 0x05, 0x20, 0x25, 0x00,
+ 0x05, 0x20, 0x05, 0xa0, 0x65, 0x00, 0xc5, 0x00,
+ 0x45, 0x00, 0x05, 0x00, 0x05, 0x20, 0x25, 0x00,
+ 0x65, 0x06, 0x25, 0xa6, 0x00, 0x26, 0x05, 0x20,
+ 0x85, 0x00, 0x04, 0x00, 0xa6, 0x20, 0xe9, 0x02,
+ 0x20, 0x65, 0xe0, 0x18, 0x05, 0x4f, 0xf6, 0x07,
+ 0x0f, 0x16, 0x4f, 0x26, 0xaf, 0xe9, 0x02, 0xeb,
+ 0x02, 0x0f, 0x06, 0x0f, 0x06, 0x0f, 0x06, 0x12,
+ 0x13, 0x12, 0x13, 0x27, 0xe5, 0x00, 0x00, 0xe5,
+ 0x1c, 0x60, 0xe6, 0x06, 0x07, 0x86, 0x16, 0x26,
+ 0x85, 0xe6, 0x03, 0x00, 0xe6, 0x1c, 0x00, 0xef,
+ 0x00, 0x06, 0xaf, 0x00, 0x2f, 0x96, 0x6f, 0x36,
+ 0xe0, 0x1d, 0xe5, 0x23, 0x27, 0x66, 0x07, 0xa6,
+ 0x07, 0x26, 0x27, 0x26, 0x05, 0xe9, 0x02, 0xb6,
+ 0xa5, 0x27, 0x26, 0x65, 0x46, 0x05, 0x47, 0x25,
+ 0xc7, 0x45, 0x66, 0xe5, 0x05, 0x06, 0x27, 0x26,
+ 0xa7, 0x06, 0x05, 0x07, 0xe9, 0x02, 0x47, 0x06,
+ 0x2f, 0xe1, 0x1e, 0x00, 0x01, 0x80, 0x01, 0x20,
+ 0xe2, 0x23, 0x16, 0x04, 0x42, 0xe5, 0x80, 0xc1,
+ 0x00, 0x65, 0x20, 0xc5, 0x00, 0x05, 0x00, 0x65,
+ 0x20, 0xe5, 0x21, 0x00, 0x65, 0x20, 0xe5, 0x19,
+ 0x00, 0x65, 0x20, 0xc5, 0x00, 0x05, 0x00, 0x65,
+ 0x20, 0xe5, 0x07, 0x00, 0xe5, 0x31, 0x00, 0x65,
+ 0x20, 0xe5, 0x3b, 0x20, 0x46, 0xf6, 0x01, 0xeb,
+ 0x0c, 0x40, 0xe5, 0x08, 0xef, 0x02, 0xa0, 0xe1,
+ 0x4e, 0x20, 0xa2, 0x20, 0x11, 0xe5, 0x81, 0xe4,
+ 0x36, 0xe5, 0x09, 0x17, 0xe5, 0x12, 0x12, 0x13,
+ 0x40, 0xe5, 0x43, 0x56, 0x4a, 0xe5, 0x00, 0xc0,
+ 0xe5, 0x05, 0x00, 0x65, 0x46, 0xe0, 0x03, 0xe5,
+ 0x0a, 0x46, 0x36, 0xe0, 0x01, 0xe5, 0x0a, 0x26,
+ 0xe0, 0x04, 0xe5, 0x05, 0x00, 0x45, 0x00, 0x26,
+ 0xe0, 0x04, 0xe5, 0x2c, 0x26, 0x07, 0xc6, 0xe7,
+ 0x00, 0x06, 0x27, 0xe6, 0x03, 0x56, 0x04, 0x56,
+ 0x0d, 0x05, 0x06, 0x20, 0xe9, 0x02, 0xa0, 0xeb,
+ 0x02, 0xa0, 0xb6, 0x11, 0x76, 0x46, 0x1b, 0x00,
+ 0xe9, 0x02, 0xa0, 0xe5, 0x1b, 0x04, 0xe5, 0x2d,
+ 0xc0, 0x85, 0x26, 0xe5, 0x1a, 0x06, 0x05, 0x80,
+ 0xe5, 0x3e, 0xe0, 0x02, 0xe5, 0x17, 0x00, 0x46,
+ 0x67, 0x26, 0x47, 0x60, 0x27, 0x06, 0xa7, 0x46,
+ 0x60, 0x0f, 0x40, 0x36, 0xe9, 0x02, 0xe5, 0x16,
+ 0x20, 0x85, 0xe0, 0x03, 0xe5, 0x24, 0x60, 0xe5,
+ 0x12, 0xa0, 0xe9, 0x02, 0x0b, 0x40, 0xef, 0x1a,
+ 0xe5, 0x0f, 0x26, 0x27, 0x06, 0x20, 0x36, 0xe5,
+ 0x2d, 0x07, 0x06, 0x07, 0xc6, 0x00, 0x06, 0x07,
+ 0x06, 0x27, 0xe6, 0x00, 0xa7, 0xe6, 0x02, 0x20,
+ 0x06, 0xe9, 0x02, 0xa0, 0xe9, 0x02, 0xa0, 0xd6,
+ 0x04, 0xb6, 0x20, 0xe6, 0x06, 0x08, 0xe0, 0x39,
+ 0x66, 0x07, 0xe5, 0x27, 0x06, 0x07, 0x86, 0x07,
+ 0x06, 0x87, 0x06, 0x27, 0xc5, 0x60, 0xe9, 0x02,
+ 0xd6, 0xef, 0x02, 0xe6, 0x01, 0xef, 0x01, 0x40,
+ 0x26, 0x07, 0xe5, 0x16, 0x07, 0x66, 0x27, 0x26,
+ 0x07, 0x46, 0x25, 0xe9, 0x02, 0xe5, 0x24, 0x06,
+ 0x07, 0x26, 0x47, 0x06, 0x07, 0x46, 0x27, 0xe0,
+ 0x00, 0x76, 0xe5, 0x1c, 0xe7, 0x00, 0xe6, 0x00,
+ 0x27, 0x26, 0x40, 0x96, 0xe9, 0x02, 0x40, 0x45,
+ 0xe9, 0x02, 0xe5, 0x16, 0xa4, 0x36, 0xe2, 0x01,
+ 0xc0, 0xe1, 0x23, 0x20, 0x41, 0xf6, 0x00, 0xe0,
+ 0x00, 0x46, 0x16, 0xe6, 0x05, 0x07, 0xc6, 0x65,
+ 0x06, 0x65, 0x27, 0x06, 0x25, 0x07, 0x26, 0xa0,
+ 0xe2, 0x24, 0xe4, 0x37, 0xe2, 0x05, 0x04, 0xe2,
+ 0x1a, 0xe4, 0x1d, 0xe6, 0x32, 0x00, 0x86, 0xff,
+ 0x80, 0x0e, 0xe2, 0x00, 0xff, 0x5a, 0xe2, 0x00,
+ 0xe1, 0x00, 0xa2, 0x20, 0xa1, 0x20, 0xe2, 0x00,
+ 0xe1, 0x00, 0xe2, 0x00, 0xe1, 0x00, 0xa2, 0x20,
+ 0xa1, 0x20, 0xe2, 0x00, 0x00, 0x01, 0x00, 0x01,
+ 0x00, 0x01, 0x00, 0x3f, 0xc2, 0xe1, 0x00, 0xe2,
+ 0x06, 0x20, 0xe2, 0x00, 0xe3, 0x00, 0xe2, 0x00,
+ 0xe3, 0x00, 0xe2, 0x00, 0xe3, 0x00, 0x82, 0x00,
+ 0x22, 0x61, 0x03, 0x0e, 0x02, 0x4e, 0x42, 0x00,
+ 0x22, 0x61, 0x03, 0x4e, 0x62, 0x20, 0x22, 0x61,
+ 0x00, 0x4e, 0xe2, 0x00, 0x81, 0x4e, 0x20, 0x42,
+ 0x00, 0x22, 0x61, 0x03, 0x2e, 0x00, 0xf7, 0x03,
+ 0x9b, 0xb1, 0x36, 0x14, 0x15, 0x12, 0x34, 0x15,
+ 0x12, 0x14, 0xf6, 0x00, 0x18, 0x19, 0x9b, 0x17,
+ 0xf6, 0x01, 0x14, 0x15, 0x76, 0x30, 0x56, 0x0c,
+ 0x12, 0x13, 0xf6, 0x03, 0x0c, 0x16, 0x10, 0xf6,
+ 0x02, 0x17, 0x9b, 0x00, 0xfb, 0x02, 0x0b, 0x04,
+ 0x20, 0xab, 0x4c, 0x12, 0x13, 0x04, 0xeb, 0x02,
+ 0x4c, 0x12, 0x13, 0x00, 0xe4, 0x05, 0x40, 0xed,
+ 0x18, 0xe0, 0x08, 0xe6, 0x05, 0x68, 0x06, 0x48,
+ 0xe6, 0x04, 0xe0, 0x07, 0x2f, 0x01, 0x6f, 0x01,
+ 0x2f, 0x02, 0x41, 0x22, 0x41, 0x02, 0x0f, 0x01,
+ 0x2f, 0x0c, 0x81, 0xaf, 0x01, 0x0f, 0x01, 0x0f,
+ 0x01, 0x0f, 0x61, 0x0f, 0x02, 0x61, 0x02, 0x65,
+ 0x02, 0x2f, 0x22, 0x21, 0x8c, 0x3f, 0x42, 0x0f,
+ 0x0c, 0x2f, 0x02, 0x0f, 0xeb, 0x08, 0xea, 0x1b,
+ 0x3f, 0x6a, 0x0b, 0x2f, 0x60, 0x8c, 0x8f, 0x2c,
+ 0x6f, 0x0c, 0x2f, 0x0c, 0x2f, 0x0c, 0xcf, 0x0c,
+ 0xef, 0x17, 0x2c, 0x2f, 0x0c, 0x0f, 0x0c, 0xef,
+ 0x17, 0xec, 0x80, 0x84, 0xef, 0x00, 0x12, 0x13,
+ 0x12, 0x13, 0xef, 0x0c, 0x2c, 0xcf, 0x12, 0x13,
+ 0xef, 0x49, 0x0c, 0xef, 0x16, 0xec, 0x11, 0xef,
+ 0x20, 0xac, 0xef, 0x3d, 0xe0, 0x11, 0xef, 0x03,
+ 0xe0, 0x0d, 0xeb, 0x34, 0xef, 0x46, 0xeb, 0x0e,
+ 0xef, 0x80, 0x2f, 0x0c, 0xef, 0x01, 0x0c, 0xef,
+ 0x2e, 0xec, 0x00, 0xef, 0x67, 0x0c, 0xef, 0x80,
+ 0x70, 0x12, 0x13, 0x12, 0x13, 0x12, 0x13, 0x12,
+ 0x13, 0x12, 0x13, 0x12, 0x13, 0x12, 0x13, 0xeb,
+ 0x16, 0xef, 0x24, 0x8c, 0x12, 0x13, 0xec, 0x17,
+ 0x12, 0x13, 0x12, 0x13, 0x12, 0x13, 0x12, 0x13,
+ 0x12, 0x13, 0xec, 0x08, 0xef, 0x80, 0x78, 0xec,
+ 0x7b, 0x12, 0x13, 0x12, 0x13, 0x12, 0x13, 0x12,
+ 0x13, 0x12, 0x13, 0x12, 0x13, 0x12, 0x13, 0x12,
+ 0x13, 0x12, 0x13, 0x12, 0x13, 0x12, 0x13, 0xec,
+ 0x37, 0x12, 0x13, 0x12, 0x13, 0xec, 0x18, 0x12,
+ 0x13, 0xec, 0x80, 0x7a, 0xef, 0x28, 0xec, 0x0d,
+ 0x2f, 0xac, 0xef, 0x1f, 0x20, 0xef, 0x18, 0x20,
+ 0xef, 0x29, 0x00, 0xef, 0x2d, 0x00, 0xe1, 0x27,
+ 0x00, 0xe2, 0x27, 0x00, 0x5f, 0x21, 0x22, 0xdf,
+ 0x41, 0x02, 0x3f, 0x02, 0x3f, 0x82, 0x24, 0x41,
+ 0x02, 0xff, 0x5a, 0x02, 0xaf, 0x7f, 0x46, 0x3f,
+ 0x80, 0x76, 0x0b, 0x36, 0xe2, 0x1e, 0x00, 0x02,
+ 0x80, 0x02, 0x20, 0xe5, 0x30, 0xc0, 0x04, 0x16,
+ 0xe0, 0x06, 0x06, 0xe5, 0x0f, 0xe0, 0x01, 0xc5,
+ 0x00, 0xc5, 0x00, 0xc5, 0x00, 0xc5, 0x00, 0xc5,
+ 0x00, 0xc5, 0x00, 0xc5, 0x00, 0xc5, 0x00, 0xe6,
+ 0x18, 0x36, 0x14, 0x15, 0x14, 0x15, 0x56, 0x14,
+ 0x15, 0x16, 0x14, 0x15, 0xf6, 0x01, 0x11, 0x36,
+ 0x11, 0x16, 0x14, 0x15, 0x36, 0x14, 0x15, 0x12,
+ 0x13, 0x12, 0x13, 0x12, 0x13, 0x12, 0x13, 0x96,
+ 0x04, 0xf6, 0x02, 0x31, 0x76, 0x11, 0x16, 0x12,
+ 0xf6, 0x04, 0xe0, 0x29, 0xef, 0x12, 0x00, 0xef,
+ 0x51, 0xe0, 0x04, 0xef, 0x80, 0x4e, 0xe0, 0x12,
+ 0xef, 0x04, 0x60, 0x17, 0x56, 0x0f, 0x04, 0x05,
+ 0x0a, 0x12, 0x13, 0x12, 0x13, 0x12, 0x13, 0x12,
+ 0x13, 0x12, 0x13, 0x2f, 0x12, 0x13, 0x12, 0x13,
+ 0x12, 0x13, 0x12, 0x13, 0x11, 0x12, 0x33, 0x0f,
+ 0xea, 0x01, 0x66, 0x27, 0x11, 0x84, 0x2f, 0x4a,
+ 0x04, 0x05, 0x16, 0x2f, 0x00, 0xe5, 0x4e, 0x20,
+ 0x26, 0x2e, 0x24, 0x05, 0x11, 0xe5, 0x52, 0x16,
+ 0x44, 0x05, 0x80, 0xe5, 0x23, 0x00, 0xe5, 0x56,
+ 0x00, 0x2f, 0x6b, 0xef, 0x02, 0xe5, 0x13, 0x80,
+ 0xef, 0x1c, 0xe0, 0x04, 0xe5, 0x08, 0xef, 0x17,
+ 0x00, 0xeb, 0x02, 0xef, 0x16, 0xeb, 0x00, 0x0f,
+ 0xeb, 0x07, 0xef, 0x18, 0xeb, 0x02, 0xef, 0x1f,
+ 0xeb, 0x07, 0xef, 0x37, 0x00, 0xef, 0x80, 0x78,
+ 0xe5, 0x99, 0x2e, 0xe0, 0x02, 0xef, 0x38, 0xe5,
+ 0xc0, 0x11, 0x68, 0xe0, 0x08, 0xe5, 0x0d, 0x04,
+ 0xe5, 0x83, 0xef, 0x40, 0xef, 0x2f, 0xe0, 0x01,
+ 0xe5, 0x20, 0xa4, 0x36, 0xe5, 0x80, 0x84, 0x04,
+ 0x56, 0xe5, 0x08, 0xe9, 0x02, 0x25, 0xe0, 0x0c,
+ 0xff, 0x26, 0x05, 0x06, 0x48, 0x16, 0xe6, 0x02,
+ 0x16, 0x04, 0xff, 0x14, 0x24, 0x26, 0xe5, 0x3e,
+ 0xea, 0x02, 0x26, 0xb6, 0xe0, 0x00, 0xee, 0x0f,
+ 0xe4, 0x01, 0x2e, 0xff, 0x06, 0x22, 0xff, 0x36,
+ 0x04, 0xe2, 0x00, 0x9f, 0xff, 0x02, 0x04, 0x2e,
+ 0x7f, 0x05, 0x7f, 0x22, 0xff, 0x0d, 0x61, 0x02,
+ 0x81, 0x02, 0x7f, 0xe0, 0x35, 0x05, 0x24, 0x02,
+ 0xc5, 0x06, 0x45, 0x06, 0x65, 0x06, 0xe5, 0x0f,
+ 0x27, 0x26, 0x07, 0x6f, 0x60, 0xab, 0x2f, 0x0d,
+ 0x0f, 0xa0, 0xe5, 0x2c, 0x76, 0xe0, 0x00, 0x27,
+ 0xe5, 0x2a, 0xe7, 0x08, 0x26, 0xe0, 0x00, 0x36,
+ 0xe9, 0x02, 0xa0, 0xe6, 0x0a, 0xa5, 0x56, 0x05,
+ 0x16, 0x25, 0x06, 0xe9, 0x02, 0xe5, 0x14, 0xe6,
+ 0x00, 0x36, 0xe5, 0x0f, 0xe6, 0x03, 0x27, 0xe0,
+ 0x03, 0x16, 0xe5, 0x15, 0x40, 0x46, 0x07, 0xe5,
+ 0x27, 0x06, 0x27, 0x66, 0x27, 0x06, 0x67, 0xf6,
+ 0x05, 0x00, 0x04, 0xe9, 0x02, 0x60, 0x36, 0x85,
+ 0x06, 0x04, 0xe5, 0x01, 0xe9, 0x02, 0x85, 0x00,
+ 0xe5, 0x21, 0xa6, 0x27, 0x26, 0x27, 0x26, 0xe0,
+ 0x01, 0x45, 0x06, 0xe5, 0x00, 0x06, 0x07, 0x20,
+ 0xe9, 0x02, 0x20, 0x76, 0xe5, 0x08, 0x04, 0xa5,
+ 0x4f, 0x05, 0x07, 0x06, 0x07, 0xe5, 0x2a, 0x06,
+ 0x05, 0x46, 0x25, 0x26, 0x85, 0x26, 0x05, 0x06,
+ 0x05, 0xe0, 0x10, 0x25, 0x04, 0x36, 0xe5, 0x03,
+ 0x07, 0x26, 0x27, 0x36, 0x05, 0x24, 0x07, 0x06,
+ 0xe0, 0x02, 0xa5, 0x20, 0xa5, 0x20, 0xa5, 0xe0,
+ 0x01, 0xc5, 0x00, 0xc5, 0x00, 0xe2, 0x23, 0x0e,
+ 0x64, 0xa2, 0xe0, 0x02, 0xe2, 0x48, 0xe5, 0x1b,
+ 0x27, 0x06, 0x27, 0x06, 0x27, 0x16, 0x07, 0x06,
+ 0x20, 0xe9, 0x02, 0xa0, 0xe5, 0xab, 0x1c, 0xe0,
+ 0x04, 0xe5, 0x0f, 0x60, 0xe5, 0x29, 0x60, 0xfc,
+ 0x87, 0x78, 0xfd, 0x98, 0x78, 0xe5, 0x80, 0xe6,
+ 0x20, 0xe5, 0x62, 0xe0, 0x1e, 0xc2, 0xe0, 0x04,
+ 0x82, 0x80, 0x05, 0x06, 0xe5, 0x02, 0x0c, 0xe5,
+ 0x05, 0x00, 0x85, 0x00, 0x05, 0x00, 0x25, 0x00,
+ 0x25, 0x00, 0xe5, 0x64, 0xee, 0x08, 0xe0, 0x09,
+ 0xe5, 0x80, 0xe3, 0x13, 0x12, 0xe0, 0x08, 0xe5,
+ 0x38, 0x20, 0xe5, 0x2e, 0xe0, 0x20, 0xe5, 0x04,
+ 0x0d, 0x0f, 0x20, 0xe6, 0x08, 0xd6, 0x12, 0x13,
+ 0x16, 0xa0, 0xe6, 0x08, 0x16, 0x31, 0x30, 0x12,
+ 0x13, 0x12, 0x13, 0x12, 0x13, 0x12, 0x13, 0x12,
+ 0x13, 0x12, 0x13, 0x12, 0x13, 0x12, 0x13, 0x36,
+ 0x12, 0x13, 0x76, 0x50, 0x56, 0x00, 0x76, 0x11,
+ 0x12, 0x13, 0x12, 0x13, 0x12, 0x13, 0x56, 0x0c,
+ 0x11, 0x4c, 0x00, 0x16, 0x0d, 0x36, 0x60, 0x85,
+ 0x00, 0xe5, 0x7f, 0x20, 0x1b, 0x00, 0x56, 0x0d,
+ 0x56, 0x12, 0x13, 0x16, 0x0c, 0x16, 0x11, 0x36,
+ 0xe9, 0x02, 0x36, 0x4c, 0x36, 0xe1, 0x12, 0x12,
+ 0x16, 0x13, 0x0e, 0x10, 0x0e, 0xe2, 0x12, 0x12,
+ 0x0c, 0x13, 0x0c, 0x12, 0x13, 0x16, 0x12, 0x13,
+ 0x36, 0xe5, 0x02, 0x04, 0xe5, 0x25, 0x24, 0xe5,
+ 0x17, 0x40, 0xa5, 0x20, 0xa5, 0x20, 0xa5, 0x20,
+ 0x45, 0x40, 0x2d, 0x0c, 0x0e, 0x0f, 0x2d, 0x00,
+ 0x0f, 0x6c, 0x2f, 0xe0, 0x02, 0x5b, 0x2f, 0x20,
+ 0xe5, 0x04, 0x00, 0xe5, 0x12, 0x00, 0xe5, 0x0b,
+ 0x00, 0x25, 0x00, 0xe5, 0x07, 0x20, 0xe5, 0x06,
+ 0xe0, 0x1a, 0xe5, 0x73, 0x80, 0x56, 0x60, 0xeb,
+ 0x25, 0x40, 0xef, 0x01, 0xea, 0x2d, 0x6b, 0xef,
+ 0x09, 0x2b, 0x4f, 0x00, 0xef, 0x04, 0x60, 0x0f,
+ 0xe0, 0x27, 0xef, 0x25, 0x06, 0xe0, 0x7a, 0xe5,
+ 0x15, 0x40, 0xe5, 0x29, 0xe0, 0x07, 0x06, 0xeb,
+ 0x13, 0x60, 0xe5, 0x18, 0x6b, 0xe0, 0x01, 0xe5,
+ 0x0c, 0x0a, 0xe5, 0x00, 0x0a, 0x80, 0xe5, 0x1e,
+ 0x86, 0x80, 0xe5, 0x16, 0x00, 0x16, 0xe5, 0x1c,
+ 0x60, 0xe5, 0x00, 0x16, 0x8a, 0xe0, 0x22, 0xe1,
+ 0x20, 0xe2, 0x20, 0xe5, 0x46, 0x20, 0xe9, 0x02,
+ 0xa0, 0xe1, 0x1c, 0x60, 0xe2, 0x1c, 0x60, 0xe5,
+ 0x20, 0xe0, 0x00, 0xe5, 0x2c, 0xe0, 0x03, 0x16,
+ 0xe0, 0x80, 0x08, 0xe5, 0x80, 0xaf, 0xe0, 0x01,
+ 0xe5, 0x0e, 0xe0, 0x02, 0xe5, 0x00, 0xe0, 0x80,
+ 0x10, 0xa5, 0x20, 0x05, 0x00, 0xe5, 0x24, 0x00,
+ 0x25, 0x40, 0x05, 0x20, 0xe5, 0x0f, 0x00, 0x16,
+ 0xeb, 0x00, 0xe5, 0x0f, 0x2f, 0xcb, 0xe5, 0x17,
+ 0xe0, 0x00, 0xeb, 0x01, 0xe0, 0x28, 0xe5, 0x0b,
+ 0x00, 0x25, 0x80, 0x8b, 0xe5, 0x0e, 0xab, 0x40,
+ 0x16, 0xe5, 0x12, 0x80, 0x16, 0xe0, 0x38, 0xe5,
+ 0x30, 0x60, 0x2b, 0x25, 0xeb, 0x08, 0x20, 0xeb,
+ 0x26, 0x05, 0x46, 0x00, 0x26, 0x80, 0x66, 0x65,
+ 0x00, 0x45, 0x00, 0xe5, 0x15, 0x20, 0x46, 0x60,
+ 0x06, 0xeb, 0x01, 0xc0, 0xf6, 0x01, 0xc0, 0xe5,
+ 0x15, 0x2b, 0x16, 0xe5, 0x15, 0x4b, 0xe0, 0x18,
+ 0xe5, 0x00, 0x0f, 0xe5, 0x14, 0x26, 0x60, 0x8b,
+ 0xd6, 0xe0, 0x01, 0xe5, 0x2e, 0x40, 0xd6, 0xe5,
+ 0x0e, 0x20, 0xeb, 0x00, 0xe5, 0x0b, 0x80, 0xeb,
+ 0x00, 0xe5, 0x0a, 0xc0, 0x76, 0xe0, 0x04, 0xcb,
+ 0xe0, 0x48, 0xe5, 0x41, 0xe0, 0x2f, 0xe1, 0x2b,
+ 0xe0, 0x05, 0xe2, 0x2b, 0xc0, 0xab, 0xe5, 0x1c,
+ 0x66, 0xe0, 0x00, 0xe9, 0x02, 0xe0, 0x80, 0x9e,
+ 0xeb, 0x17, 0xe0, 0x79, 0xe5, 0x15, 0xeb, 0x02,
+ 0x05, 0xe0, 0x00, 0xe5, 0x0e, 0xe6, 0x03, 0x6b,
+ 0x96, 0xe0, 0x80, 0x1e, 0x07, 0x06, 0x07, 0xe5,
+ 0x2d, 0xe6, 0x07, 0xd6, 0x60, 0xeb, 0x0c, 0xe9,
+ 0x02, 0xe0, 0x07, 0x46, 0x07, 0xe5, 0x25, 0x47,
+ 0x66, 0x27, 0x26, 0x36, 0x1b, 0x76, 0xe0, 0x03,
+ 0x1b, 0x20, 0xe5, 0x11, 0xc0, 0xe9, 0x02, 0xa0,
+ 0x46, 0xe5, 0x1c, 0x86, 0x07, 0xe6, 0x00, 0x00,
+ 0xe9, 0x02, 0x76, 0x05, 0x27, 0xe0, 0x01, 0xe5,
+ 0x1b, 0x06, 0x36, 0x05, 0xe0, 0x01, 0x26, 0x07,
+ 0xe5, 0x28, 0x47, 0xe6, 0x01, 0x27, 0x65, 0x76,
+ 0x66, 0x16, 0x20, 0xe9, 0x02, 0x05, 0x16, 0x05,
+ 0x56, 0x00, 0xeb, 0x0c, 0xe0, 0x03, 0xe5, 0x0a,
+ 0x00, 0xe5, 0x11, 0x47, 0x46, 0x27, 0x06, 0x07,
+ 0x26, 0xb6, 0x06, 0xe0, 0x39, 0xc5, 0x00, 0x05,
+ 0x00, 0x65, 0x00, 0xe5, 0x07, 0x00, 0xe5, 0x02,
+ 0x16, 0xa0, 0xe5, 0x27, 0x06, 0x47, 0xe6, 0x00,
+ 0x80, 0xe9, 0x02, 0xa0, 0x26, 0x27, 0x00, 0xe5,
+ 0x00, 0x20, 0x25, 0x20, 0xe5, 0x0e, 0x00, 0xc5,
+ 0x00, 0x25, 0x00, 0x85, 0x00, 0x26, 0x05, 0x27,
+ 0x06, 0x67, 0x20, 0x27, 0x20, 0x47, 0x20, 0x05,
+ 0xa0, 0x07, 0x80, 0x85, 0x27, 0x20, 0xc6, 0x40,
+ 0x86, 0xe0, 0x80, 0x03, 0xe5, 0x2d, 0x47, 0xe6,
+ 0x00, 0x27, 0x46, 0x07, 0x06, 0x65, 0x96, 0xe9,
+ 0x02, 0x00, 0x16, 0x00, 0x16, 0x06, 0xe0, 0x19,
+ 0xe5, 0x28, 0x47, 0xa6, 0x07, 0x06, 0x67, 0x26,
+ 0x07, 0x26, 0x25, 0x16, 0x05, 0xe0, 0x00, 0xe9,
+ 0x02, 0xe0, 0x80, 0x1e, 0xe5, 0x27, 0x47, 0x66,
+ 0x20, 0x67, 0x26, 0x07, 0x26, 0xf6, 0x0f, 0x65,
+ 0x26, 0xe0, 0x1a, 0xe5, 0x28, 0x47, 0xe6, 0x00,
+ 0x27, 0x06, 0x07, 0x26, 0x56, 0x05, 0xe0, 0x03,
+ 0xe9, 0x02, 0xa0, 0xf6, 0x05, 0xe0, 0x0b, 0xe5,
+ 0x23, 0x06, 0x07, 0x06, 0x27, 0xa6, 0x07, 0x06,
+ 0xe0, 0x00, 0xe9, 0x02, 0xe0, 0x2e, 0xe5, 0x13,
+ 0x20, 0x46, 0x27, 0x66, 0x07, 0x86, 0x60, 0xe9,
+ 0x02, 0x2b, 0x56, 0x0f, 0xe0, 0x80, 0x38, 0xe5,
+ 0x24, 0x47, 0xe6, 0x01, 0x07, 0x26, 0x16, 0xe0,
+ 0x5c, 0xe1, 0x18, 0xe2, 0x18, 0xe9, 0x02, 0xeb,
+ 0x01, 0xe0, 0x04, 0x05, 0xe0, 0x80, 0x78, 0x05,
+ 0xe6, 0x02, 0xe5, 0x20, 0xa6, 0x07, 0x05, 0x66,
+ 0xf6, 0x00, 0x06, 0xe0, 0x00, 0x05, 0xa6, 0x27,
+ 0x46, 0xe5, 0x20, 0x20, 0x65, 0xe6, 0x05, 0x07,
+ 0x26, 0x56, 0x05, 0x96, 0xe0, 0x15, 0xe5, 0x31,
+ 0xe0, 0x80, 0x7f, 0xe5, 0x01, 0x00, 0xe5, 0x1d,
+ 0x07, 0xc6, 0x00, 0xa6, 0x07, 0x06, 0x05, 0x96,
+ 0xe0, 0x02, 0xe9, 0x02, 0xeb, 0x0b, 0x40, 0x36,
+ 0xe5, 0x16, 0x20, 0xe6, 0x0e, 0x00, 0x07, 0xc6,
+ 0x07, 0x26, 0x07, 0x26, 0xe0, 0x41, 0xc5, 0x00,
+ 0x25, 0x00, 0xe5, 0x1e, 0xa6, 0x40, 0x06, 0x00,
+ 0x26, 0x00, 0xc6, 0x05, 0x06, 0xe0, 0x00, 0xe9,
+ 0x02, 0xa0, 0xa5, 0x00, 0x25, 0x00, 0xe5, 0x18,
+ 0x87, 0x00, 0x26, 0x00, 0x27, 0x06, 0x07, 0x06,
+ 0x05, 0xc0, 0xe9, 0x02, 0xe0, 0x80, 0xae, 0xe5,
+ 0x0b, 0x26, 0x27, 0x36, 0xe0, 0x80, 0x7f, 0xe5,
+ 0x83, 0x12, 0xe0, 0x5e, 0xea, 0x67, 0x00, 0x96,
+ 0xe0, 0x03, 0xe5, 0x80, 0x3c, 0xe0, 0x8a, 0x34,
+ 0xe5, 0x83, 0xa7, 0xe0, 0x8f, 0x49, 0xe5, 0x81,
+ 0xbf, 0xe0, 0xa1, 0x31, 0xe5, 0x81, 0xb1, 0xc0,
+ 0xe5, 0x17, 0x00, 0xe9, 0x02, 0x60, 0x36, 0xe0,
+ 0x58, 0xe5, 0x16, 0x20, 0x86, 0x16, 0xe0, 0x02,
+ 0xe5, 0x28, 0xc6, 0x96, 0x6f, 0x64, 0x16, 0x0f,
+ 0xe0, 0x02, 0xe9, 0x02, 0x00, 0xcb, 0x00, 0xe5,
+ 0x0d, 0x80, 0xe5, 0x0b, 0xe0, 0x82, 0x28, 0xe1,
+ 0x18, 0xe2, 0x18, 0xeb, 0x0f, 0x76, 0xe0, 0x5d,
+ 0xe5, 0x3d, 0xe0, 0x03, 0x05, 0xe7, 0x26, 0xe0,
+ 0x08, 0x66, 0xe4, 0x05, 0xe0, 0x38, 0x24, 0xe0,
+ 0x16, 0xe5, 0x97, 0x6a, 0xe0, 0x06, 0xe5, 0x82,
+ 0x6b, 0xe0, 0xa4, 0x85, 0xe5, 0x80, 0x97, 0xe0,
+ 0x49, 0xe5, 0x81, 0x04, 0xe0, 0x88, 0x7c, 0xe5,
+ 0x63, 0x80, 0xe5, 0x05, 0x40, 0xe5, 0x01, 0xc0,
+ 0xe5, 0x02, 0x20, 0x0f, 0x26, 0x16, 0x7b, 0xe0,
+ 0x92, 0xd4, 0xef, 0x80, 0x6e, 0xe0, 0x02, 0xef,
+ 0x1f, 0x20, 0xef, 0x34, 0x27, 0x46, 0x4f, 0xa7,
+ 0xfb, 0x00, 0xe6, 0x00, 0x2f, 0xc6, 0xef, 0x16,
+ 0x66, 0xef, 0x33, 0xe0, 0x0f, 0xef, 0x3a, 0x46,
+ 0x0f, 0xe0, 0x80, 0x12, 0xeb, 0x0c, 0xe0, 0x04,
+ 0xef, 0x4f, 0xe0, 0x01, 0xeb, 0x11, 0xe0, 0x7f,
+ 0xe1, 0x12, 0xe2, 0x12, 0xe1, 0x12, 0xc2, 0x00,
+ 0xe2, 0x0a, 0xe1, 0x12, 0xe2, 0x12, 0x01, 0x00,
+ 0x21, 0x20, 0x01, 0x20, 0x21, 0x20, 0x61, 0x00,
+ 0xe1, 0x00, 0x62, 0x00, 0x02, 0x00, 0xc2, 0x00,
+ 0xe2, 0x03, 0xe1, 0x12, 0xe2, 0x12, 0x21, 0x00,
+ 0x61, 0x20, 0xe1, 0x00, 0x00, 0xc1, 0x00, 0xe2,
+ 0x12, 0x21, 0x00, 0x61, 0x00, 0x81, 0x00, 0x01,
+ 0x40, 0xc1, 0x00, 0xe2, 0x12, 0xe1, 0x12, 0xe2,
+ 0x12, 0xe1, 0x12, 0xe2, 0x12, 0xe1, 0x12, 0xe2,
+ 0x12, 0xe1, 0x12, 0xe2, 0x12, 0xe1, 0x12, 0xe2,
+ 0x12, 0xe1, 0x12, 0xe2, 0x14, 0x20, 0xe1, 0x11,
+ 0x0c, 0xe2, 0x11, 0x0c, 0xa2, 0xe1, 0x11, 0x0c,
+ 0xe2, 0x11, 0x0c, 0xa2, 0xe1, 0x11, 0x0c, 0xe2,
+ 0x11, 0x0c, 0xa2, 0xe1, 0x11, 0x0c, 0xe2, 0x11,
+ 0x0c, 0xa2, 0xe1, 0x11, 0x0c, 0xe2, 0x11, 0x0c,
+ 0xa2, 0x3f, 0x20, 0xe9, 0x2a, 0xef, 0x81, 0x78,
+ 0xe6, 0x2f, 0x6f, 0xe6, 0x2a, 0xef, 0x00, 0x06,
+ 0xef, 0x06, 0x06, 0x2f, 0x96, 0xe0, 0x07, 0x86,
+ 0x00, 0xe6, 0x07, 0xe0, 0x84, 0xc8, 0xc6, 0x00,
+ 0xe6, 0x09, 0x20, 0xc6, 0x00, 0x26, 0x00, 0x86,
+ 0xe0, 0x87, 0x4d, 0xe5, 0x80, 0x3d, 0x20, 0xeb,
+ 0x01, 0xc6, 0xe0, 0x21, 0xe1, 0x1a, 0xe2, 0x1a,
+ 0xc6, 0x80, 0xe9, 0x02, 0x60, 0x36, 0xe0, 0x82,
+ 0x89, 0xeb, 0x33, 0x0f, 0x4b, 0x0d, 0x6b, 0xe0,
+ 0x80, 0xc3, 0x65, 0x00, 0xe5, 0x13, 0x00, 0x25,
+ 0x00, 0x05, 0x20, 0x05, 0x00, 0xe5, 0x02, 0x00,
+ 0x65, 0x00, 0x05, 0x00, 0x05, 0xa0, 0x05, 0x60,
+ 0x05, 0x00, 0x05, 0x00, 0x05, 0x00, 0x45, 0x00,
+ 0x25, 0x00, 0x05, 0x20, 0x05, 0x00, 0x05, 0x00,
+ 0x05, 0x00, 0x05, 0x00, 0x05, 0x00, 0x25, 0x00,
+ 0x05, 0x20, 0x65, 0x00, 0xc5, 0x00, 0x65, 0x00,
+ 0x65, 0x00, 0x05, 0x00, 0xe5, 0x02, 0x00, 0xe5,
+ 0x09, 0x80, 0x45, 0x00, 0x85, 0x00, 0xe5, 0x09,
+ 0xe0, 0x2c, 0x2c, 0xe0, 0x80, 0x86, 0xef, 0x24,
+ 0x60, 0xef, 0x5c, 0xe0, 0x04, 0xef, 0x07, 0x20,
+ 0xef, 0x07, 0x00, 0xef, 0x07, 0x00, 0xef, 0x1d,
+ 0xe0, 0x02, 0xeb, 0x05, 0x40, 0xef, 0x54, 0x60,
+ 0xef, 0x35, 0xe0, 0x31, 0xef, 0x15, 0xe0, 0x05,
+ 0xef, 0x24, 0x60, 0xef, 0x01, 0xc0, 0x2f, 0xe0,
+ 0x06, 0xaf, 0xe0, 0x80, 0x12, 0xef, 0x80, 0x73,
+ 0x8e, 0xef, 0x82, 0x4d, 0xe0, 0x03, 0xef, 0x05,
+ 0x40, 0xef, 0x02, 0xa0, 0xef, 0x6c, 0xe0, 0x04,
+ 0xef, 0x51, 0xe0, 0x1f, 0xef, 0x04, 0x60, 0xef,
+ 0x30, 0xe0, 0x00, 0xef, 0x02, 0xa0, 0xef, 0x20,
+ 0xe0, 0x00, 0xef, 0x16, 0xe0, 0x4a, 0xef, 0x04,
+ 0x60, 0xef, 0x27, 0x00, 0xef, 0x29, 0x20, 0x6f,
+ 0x40, 0x0f, 0x00, 0xef, 0x1f, 0xe0, 0x05, 0xef,
+ 0x02, 0xa0, 0x4f, 0xe0, 0x05, 0xef, 0x28, 0xe0,
+ 0x58, 0xef, 0x06, 0xe0, 0x85, 0x0a, 0xe5, 0xc0,
+ 0x66, 0x4f, 0xe0, 0x21, 0xe5, 0x8f, 0xad, 0xe0,
+ 0x03, 0xe5, 0x80, 0x56, 0x20, 0xe5, 0x95, 0xfa,
+ 0xe0, 0x06, 0xe5, 0x9c, 0xa9, 0xe0, 0x8b, 0x97,
+ 0xe5, 0x81, 0x96, 0xe0, 0xca, 0xc5, 0x5b, 0x1b,
+ 0xe0, 0x16, 0xfb, 0x58, 0xe0, 0x78, 0xe6, 0x80,
+ 0x68, 0xe0, 0xc0, 0xbd, 0x88, 0xfd, 0xc0, 0xbf,
+ 0x76, 0x20, 0xfd, 0xc0, 0xbf, 0x76, 0x20,
+};
+
+typedef enum {
+ UNICODE_SCRIPT_Unknown,
+ UNICODE_SCRIPT_Adlam,
+ UNICODE_SCRIPT_Ahom,
+ UNICODE_SCRIPT_Anatolian_Hieroglyphs,
+ UNICODE_SCRIPT_Arabic,
+ UNICODE_SCRIPT_Armenian,
+ UNICODE_SCRIPT_Avestan,
+ UNICODE_SCRIPT_Balinese,
+ UNICODE_SCRIPT_Bamum,
+ UNICODE_SCRIPT_Bassa_Vah,
+ UNICODE_SCRIPT_Batak,
+ UNICODE_SCRIPT_Bengali,
+ UNICODE_SCRIPT_Bhaiksuki,
+ UNICODE_SCRIPT_Bopomofo,
+ UNICODE_SCRIPT_Brahmi,
+ UNICODE_SCRIPT_Braille,
+ UNICODE_SCRIPT_Buginese,
+ UNICODE_SCRIPT_Buhid,
+ UNICODE_SCRIPT_Canadian_Aboriginal,
+ UNICODE_SCRIPT_Carian,
+ UNICODE_SCRIPT_Caucasian_Albanian,
+ UNICODE_SCRIPT_Chakma,
+ UNICODE_SCRIPT_Cham,
+ UNICODE_SCRIPT_Cherokee,
+ UNICODE_SCRIPT_Common,
+ UNICODE_SCRIPT_Coptic,
+ UNICODE_SCRIPT_Cuneiform,
+ UNICODE_SCRIPT_Cypriot,
+ UNICODE_SCRIPT_Cyrillic,
+ UNICODE_SCRIPT_Deseret,
+ UNICODE_SCRIPT_Devanagari,
+ UNICODE_SCRIPT_Dogra,
+ UNICODE_SCRIPT_Duployan,
+ UNICODE_SCRIPT_Egyptian_Hieroglyphs,
+ UNICODE_SCRIPT_Elbasan,
+ UNICODE_SCRIPT_Ethiopic,
+ UNICODE_SCRIPT_Georgian,
+ UNICODE_SCRIPT_Glagolitic,
+ UNICODE_SCRIPT_Gothic,
+ UNICODE_SCRIPT_Grantha,
+ UNICODE_SCRIPT_Greek,
+ UNICODE_SCRIPT_Gujarati,
+ UNICODE_SCRIPT_Gunjala_Gondi,
+ UNICODE_SCRIPT_Gurmukhi,
+ UNICODE_SCRIPT_Han,
+ UNICODE_SCRIPT_Hangul,
+ UNICODE_SCRIPT_Hanifi_Rohingya,
+ UNICODE_SCRIPT_Hanunoo,
+ UNICODE_SCRIPT_Hatran,
+ UNICODE_SCRIPT_Hebrew,
+ UNICODE_SCRIPT_Hiragana,
+ UNICODE_SCRIPT_Imperial_Aramaic,
+ UNICODE_SCRIPT_Inherited,
+ UNICODE_SCRIPT_Inscriptional_Pahlavi,
+ UNICODE_SCRIPT_Inscriptional_Parthian,
+ UNICODE_SCRIPT_Javanese,
+ UNICODE_SCRIPT_Kaithi,
+ UNICODE_SCRIPT_Kannada,
+ UNICODE_SCRIPT_Katakana,
+ UNICODE_SCRIPT_Kayah_Li,
+ UNICODE_SCRIPT_Kharoshthi,
+ UNICODE_SCRIPT_Khmer,
+ UNICODE_SCRIPT_Khojki,
+ UNICODE_SCRIPT_Khudawadi,
+ UNICODE_SCRIPT_Lao,
+ UNICODE_SCRIPT_Latin,
+ UNICODE_SCRIPT_Lepcha,
+ UNICODE_SCRIPT_Limbu,
+ UNICODE_SCRIPT_Linear_A,
+ UNICODE_SCRIPT_Linear_B,
+ UNICODE_SCRIPT_Lisu,
+ UNICODE_SCRIPT_Lycian,
+ UNICODE_SCRIPT_Lydian,
+ UNICODE_SCRIPT_Makasar,
+ UNICODE_SCRIPT_Mahajani,
+ UNICODE_SCRIPT_Malayalam,
+ UNICODE_SCRIPT_Mandaic,
+ UNICODE_SCRIPT_Manichaean,
+ UNICODE_SCRIPT_Marchen,
+ UNICODE_SCRIPT_Masaram_Gondi,
+ UNICODE_SCRIPT_Medefaidrin,
+ UNICODE_SCRIPT_Meetei_Mayek,
+ UNICODE_SCRIPT_Mende_Kikakui,
+ UNICODE_SCRIPT_Meroitic_Cursive,
+ UNICODE_SCRIPT_Meroitic_Hieroglyphs,
+ UNICODE_SCRIPT_Miao,
+ UNICODE_SCRIPT_Modi,
+ UNICODE_SCRIPT_Mongolian,
+ UNICODE_SCRIPT_Mro,
+ UNICODE_SCRIPT_Multani,
+ UNICODE_SCRIPT_Myanmar,
+ UNICODE_SCRIPT_Nabataean,
+ UNICODE_SCRIPT_New_Tai_Lue,
+ UNICODE_SCRIPT_Newa,
+ UNICODE_SCRIPT_Nko,
+ UNICODE_SCRIPT_Nushu,
+ UNICODE_SCRIPT_Ogham,
+ UNICODE_SCRIPT_Ol_Chiki,
+ UNICODE_SCRIPT_Old_Hungarian,
+ UNICODE_SCRIPT_Old_Italic,
+ UNICODE_SCRIPT_Old_North_Arabian,
+ UNICODE_SCRIPT_Old_Permic,
+ UNICODE_SCRIPT_Old_Persian,
+ UNICODE_SCRIPT_Old_Sogdian,
+ UNICODE_SCRIPT_Old_South_Arabian,
+ UNICODE_SCRIPT_Old_Turkic,
+ UNICODE_SCRIPT_Oriya,
+ UNICODE_SCRIPT_Osage,
+ UNICODE_SCRIPT_Osmanya,
+ UNICODE_SCRIPT_Pahawh_Hmong,
+ UNICODE_SCRIPT_Palmyrene,
+ UNICODE_SCRIPT_Pau_Cin_Hau,
+ UNICODE_SCRIPT_Phags_Pa,
+ UNICODE_SCRIPT_Phoenician,
+ UNICODE_SCRIPT_Psalter_Pahlavi,
+ UNICODE_SCRIPT_Rejang,
+ UNICODE_SCRIPT_Runic,
+ UNICODE_SCRIPT_Samaritan,
+ UNICODE_SCRIPT_Saurashtra,
+ UNICODE_SCRIPT_Sharada,
+ UNICODE_SCRIPT_Shavian,
+ UNICODE_SCRIPT_Siddham,
+ UNICODE_SCRIPT_SignWriting,
+ UNICODE_SCRIPT_Sinhala,
+ UNICODE_SCRIPT_Sogdian,
+ UNICODE_SCRIPT_Sora_Sompeng,
+ UNICODE_SCRIPT_Soyombo,
+ UNICODE_SCRIPT_Sundanese,
+ UNICODE_SCRIPT_Syloti_Nagri,
+ UNICODE_SCRIPT_Syriac,
+ UNICODE_SCRIPT_Tagalog,
+ UNICODE_SCRIPT_Tagbanwa,
+ UNICODE_SCRIPT_Tai_Le,
+ UNICODE_SCRIPT_Tai_Tham,
+ UNICODE_SCRIPT_Tai_Viet,
+ UNICODE_SCRIPT_Takri,
+ UNICODE_SCRIPT_Tamil,
+ UNICODE_SCRIPT_Tangut,
+ UNICODE_SCRIPT_Telugu,
+ UNICODE_SCRIPT_Thaana,
+ UNICODE_SCRIPT_Thai,
+ UNICODE_SCRIPT_Tibetan,
+ UNICODE_SCRIPT_Tifinagh,
+ UNICODE_SCRIPT_Tirhuta,
+ UNICODE_SCRIPT_Ugaritic,
+ UNICODE_SCRIPT_Vai,
+ UNICODE_SCRIPT_Warang_Citi,
+ UNICODE_SCRIPT_Yi,
+ UNICODE_SCRIPT_Zanabazar_Square,
+ UNICODE_SCRIPT_COUNT,
+} UnicodeScriptEnum;
+
+static const char unicode_script_name_table[] =
+ "Adlam,Adlm" "\0"
+ "Ahom,Ahom" "\0"
+ "Anatolian_Hieroglyphs,Hluw" "\0"
+ "Arabic,Arab" "\0"
+ "Armenian,Armn" "\0"
+ "Avestan,Avst" "\0"
+ "Balinese,Bali" "\0"
+ "Bamum,Bamu" "\0"
+ "Bassa_Vah,Bass" "\0"
+ "Batak,Batk" "\0"
+ "Bengali,Beng" "\0"
+ "Bhaiksuki,Bhks" "\0"
+ "Bopomofo,Bopo" "\0"
+ "Brahmi,Brah" "\0"
+ "Braille,Brai" "\0"
+ "Buginese,Bugi" "\0"
+ "Buhid,Buhd" "\0"
+ "Canadian_Aboriginal,Cans" "\0"
+ "Carian,Cari" "\0"
+ "Caucasian_Albanian,Aghb" "\0"
+ "Chakma,Cakm" "\0"
+ "Cham,Cham" "\0"
+ "Cherokee,Cher" "\0"
+ "Common,Zyyy" "\0"
+ "Coptic,Copt,Qaac" "\0"
+ "Cuneiform,Xsux" "\0"
+ "Cypriot,Cprt" "\0"
+ "Cyrillic,Cyrl" "\0"
+ "Deseret,Dsrt" "\0"
+ "Devanagari,Deva" "\0"
+ "Dogra,Dogr" "\0"
+ "Duployan,Dupl" "\0"
+ "Egyptian_Hieroglyphs,Egyp" "\0"
+ "Elbasan,Elba" "\0"
+ "Ethiopic,Ethi" "\0"
+ "Georgian,Geor" "\0"
+ "Glagolitic,Glag" "\0"
+ "Gothic,Goth" "\0"
+ "Grantha,Gran" "\0"
+ "Greek,Grek" "\0"
+ "Gujarati,Gujr" "\0"
+ "Gunjala_Gondi,Gong" "\0"
+ "Gurmukhi,Guru" "\0"
+ "Han,Hani" "\0"
+ "Hangul,Hang" "\0"
+ "Hanifi_Rohingya,Rohg" "\0"
+ "Hanunoo,Hano" "\0"
+ "Hatran,Hatr" "\0"
+ "Hebrew,Hebr" "\0"
+ "Hiragana,Hira" "\0"
+ "Imperial_Aramaic,Armi" "\0"
+ "Inherited,Zinh,Qaai" "\0"
+ "Inscriptional_Pahlavi,Phli" "\0"
+ "Inscriptional_Parthian,Prti" "\0"
+ "Javanese,Java" "\0"
+ "Kaithi,Kthi" "\0"
+ "Kannada,Knda" "\0"
+ "Katakana,Kana" "\0"
+ "Kayah_Li,Kali" "\0"
+ "Kharoshthi,Khar" "\0"
+ "Khmer,Khmr" "\0"
+ "Khojki,Khoj" "\0"
+ "Khudawadi,Sind" "\0"
+ "Lao,Laoo" "\0"
+ "Latin,Latn" "\0"
+ "Lepcha,Lepc" "\0"
+ "Limbu,Limb" "\0"
+ "Linear_A,Lina" "\0"
+ "Linear_B,Linb" "\0"
+ "Lisu,Lisu" "\0"
+ "Lycian,Lyci" "\0"
+ "Lydian,Lydi" "\0"
+ "Makasar,Maka" "\0"
+ "Mahajani,Mahj" "\0"
+ "Malayalam,Mlym" "\0"
+ "Mandaic,Mand" "\0"
+ "Manichaean,Mani" "\0"
+ "Marchen,Marc" "\0"
+ "Masaram_Gondi,Gonm" "\0"
+ "Medefaidrin,Medf" "\0"
+ "Meetei_Mayek,Mtei" "\0"
+ "Mende_Kikakui,Mend" "\0"
+ "Meroitic_Cursive,Merc" "\0"
+ "Meroitic_Hieroglyphs,Mero" "\0"
+ "Miao,Plrd" "\0"
+ "Modi,Modi" "\0"
+ "Mongolian,Mong" "\0"
+ "Mro,Mroo" "\0"
+ "Multani,Mult" "\0"
+ "Myanmar,Mymr" "\0"
+ "Nabataean,Nbat" "\0"
+ "New_Tai_Lue,Talu" "\0"
+ "Newa,Newa" "\0"
+ "Nko,Nkoo" "\0"
+ "Nushu,Nshu" "\0"
+ "Ogham,Ogam" "\0"
+ "Ol_Chiki,Olck" "\0"
+ "Old_Hungarian,Hung" "\0"
+ "Old_Italic,Ital" "\0"
+ "Old_North_Arabian,Narb" "\0"
+ "Old_Permic,Perm" "\0"
+ "Old_Persian,Xpeo" "\0"
+ "Old_Sogdian,Sogo" "\0"
+ "Old_South_Arabian,Sarb" "\0"
+ "Old_Turkic,Orkh" "\0"
+ "Oriya,Orya" "\0"
+ "Osage,Osge" "\0"
+ "Osmanya,Osma" "\0"
+ "Pahawh_Hmong,Hmng" "\0"
+ "Palmyrene,Palm" "\0"
+ "Pau_Cin_Hau,Pauc" "\0"
+ "Phags_Pa,Phag" "\0"
+ "Phoenician,Phnx" "\0"
+ "Psalter_Pahlavi,Phlp" "\0"
+ "Rejang,Rjng" "\0"
+ "Runic,Runr" "\0"
+ "Samaritan,Samr" "\0"
+ "Saurashtra,Saur" "\0"
+ "Sharada,Shrd" "\0"
+ "Shavian,Shaw" "\0"
+ "Siddham,Sidd" "\0"
+ "SignWriting,Sgnw" "\0"
+ "Sinhala,Sinh" "\0"
+ "Sogdian,Sogd" "\0"
+ "Sora_Sompeng,Sora" "\0"
+ "Soyombo,Soyo" "\0"
+ "Sundanese,Sund" "\0"
+ "Syloti_Nagri,Sylo" "\0"
+ "Syriac,Syrc" "\0"
+ "Tagalog,Tglg" "\0"
+ "Tagbanwa,Tagb" "\0"
+ "Tai_Le,Tale" "\0"
+ "Tai_Tham,Lana" "\0"
+ "Tai_Viet,Tavt" "\0"
+ "Takri,Takr" "\0"
+ "Tamil,Taml" "\0"
+ "Tangut,Tang" "\0"
+ "Telugu,Telu" "\0"
+ "Thaana,Thaa" "\0"
+ "Thai,Thai" "\0"
+ "Tibetan,Tibt" "\0"
+ "Tifinagh,Tfng" "\0"
+ "Tirhuta,Tirh" "\0"
+ "Ugaritic,Ugar" "\0"
+ "Vai,Vaii" "\0"
+ "Warang_Citi,Wara" "\0"
+ "Yi,Yiii" "\0"
+ "Zanabazar_Square,Zanb" "\0"
+;
+
+static const uint8_t unicode_script_table[2522] = {
+ 0xc0, 0x18, 0x99, 0x41, 0x85, 0x18, 0x99, 0x41,
+ 0xae, 0x18, 0x80, 0x41, 0x8e, 0x18, 0x80, 0x41,
+ 0x84, 0x18, 0x96, 0x41, 0x80, 0x18, 0x9e, 0x41,
+ 0x80, 0x18, 0xe1, 0x60, 0x41, 0xa6, 0x18, 0x84,
+ 0x41, 0x84, 0x18, 0x81, 0x0d, 0x93, 0x18, 0xe0,
+ 0x0f, 0x34, 0x83, 0x28, 0x80, 0x18, 0x82, 0x28,
+ 0x01, 0x83, 0x28, 0x80, 0x18, 0x80, 0x28, 0x03,
+ 0x80, 0x28, 0x80, 0x18, 0x80, 0x28, 0x80, 0x18,
+ 0x82, 0x28, 0x00, 0x80, 0x28, 0x00, 0x93, 0x28,
+ 0x00, 0xbe, 0x28, 0x8d, 0x19, 0x8f, 0x28, 0xe0,
+ 0x24, 0x1c, 0x81, 0x34, 0xe0, 0x48, 0x1c, 0x00,
+ 0xa5, 0x05, 0x01, 0xaf, 0x05, 0x80, 0x18, 0x80,
+ 0x05, 0x01, 0x82, 0x05, 0x00, 0xb6, 0x31, 0x07,
+ 0x9a, 0x31, 0x03, 0x85, 0x31, 0x0a, 0x84, 0x04,
+ 0x80, 0x18, 0x85, 0x04, 0x80, 0x18, 0x8d, 0x04,
+ 0x80, 0x18, 0x80, 0x04, 0x00, 0x80, 0x04, 0x80,
+ 0x18, 0x9f, 0x04, 0x80, 0x18, 0x89, 0x04, 0x8a,
+ 0x34, 0x99, 0x04, 0x80, 0x34, 0xe0, 0x0b, 0x04,
+ 0x80, 0x18, 0xa1, 0x04, 0x8d, 0x81, 0x00, 0xbb,
+ 0x81, 0x01, 0x82, 0x81, 0xaf, 0x04, 0xb1, 0x8b,
+ 0x0d, 0xba, 0x5e, 0x01, 0x82, 0x5e, 0xad, 0x75,
+ 0x01, 0x8e, 0x75, 0x00, 0x9b, 0x4c, 0x01, 0x80,
+ 0x4c, 0x00, 0x8a, 0x81, 0x34, 0x94, 0x04, 0x00,
+ 0x87, 0x04, 0x14, 0x8e, 0x04, 0x80, 0x18, 0x9c,
+ 0x04, 0xd0, 0x1e, 0x81, 0x34, 0x90, 0x1e, 0x81,
+ 0x18, 0x99, 0x1e, 0x83, 0x0b, 0x00, 0x87, 0x0b,
+ 0x01, 0x81, 0x0b, 0x01, 0x95, 0x0b, 0x00, 0x86,
+ 0x0b, 0x00, 0x80, 0x0b, 0x02, 0x83, 0x0b, 0x01,
+ 0x88, 0x0b, 0x01, 0x81, 0x0b, 0x01, 0x83, 0x0b,
+ 0x07, 0x80, 0x0b, 0x03, 0x81, 0x0b, 0x00, 0x84,
+ 0x0b, 0x01, 0x98, 0x0b, 0x01, 0x82, 0x2b, 0x00,
+ 0x85, 0x2b, 0x03, 0x81, 0x2b, 0x01, 0x95, 0x2b,
+ 0x00, 0x86, 0x2b, 0x00, 0x81, 0x2b, 0x00, 0x81,
+ 0x2b, 0x00, 0x81, 0x2b, 0x01, 0x80, 0x2b, 0x00,
+ 0x84, 0x2b, 0x03, 0x81, 0x2b, 0x01, 0x82, 0x2b,
+ 0x02, 0x80, 0x2b, 0x06, 0x83, 0x2b, 0x00, 0x80,
+ 0x2b, 0x06, 0x90, 0x2b, 0x09, 0x82, 0x29, 0x00,
+ 0x88, 0x29, 0x00, 0x82, 0x29, 0x00, 0x95, 0x29,
+ 0x00, 0x86, 0x29, 0x00, 0x81, 0x29, 0x00, 0x84,
+ 0x29, 0x01, 0x89, 0x29, 0x00, 0x82, 0x29, 0x00,
+ 0x82, 0x29, 0x01, 0x80, 0x29, 0x0e, 0x83, 0x29,
+ 0x01, 0x8b, 0x29, 0x06, 0x86, 0x29, 0x00, 0x82,
+ 0x6a, 0x00, 0x87, 0x6a, 0x01, 0x81, 0x6a, 0x01,
+ 0x95, 0x6a, 0x00, 0x86, 0x6a, 0x00, 0x81, 0x6a,
+ 0x00, 0x84, 0x6a, 0x01, 0x88, 0x6a, 0x01, 0x81,
+ 0x6a, 0x01, 0x82, 0x6a, 0x07, 0x81, 0x6a, 0x03,
+ 0x81, 0x6a, 0x00, 0x84, 0x6a, 0x01, 0x91, 0x6a,
+ 0x09, 0x81, 0x88, 0x00, 0x85, 0x88, 0x02, 0x82,
+ 0x88, 0x00, 0x83, 0x88, 0x02, 0x81, 0x88, 0x00,
+ 0x80, 0x88, 0x00, 0x81, 0x88, 0x02, 0x81, 0x88,
+ 0x02, 0x82, 0x88, 0x02, 0x8b, 0x88, 0x03, 0x84,
+ 0x88, 0x02, 0x82, 0x88, 0x00, 0x83, 0x88, 0x01,
+ 0x80, 0x88, 0x05, 0x80, 0x88, 0x0d, 0x94, 0x88,
+ 0x04, 0x8c, 0x8a, 0x00, 0x82, 0x8a, 0x00, 0x96,
+ 0x8a, 0x00, 0x8f, 0x8a, 0x02, 0x87, 0x8a, 0x00,
+ 0x82, 0x8a, 0x00, 0x83, 0x8a, 0x06, 0x81, 0x8a,
+ 0x00, 0x82, 0x8a, 0x04, 0x83, 0x8a, 0x01, 0x89,
+ 0x8a, 0x07, 0x87, 0x8a, 0x8c, 0x39, 0x00, 0x82,
+ 0x39, 0x00, 0x96, 0x39, 0x00, 0x89, 0x39, 0x00,
+ 0x84, 0x39, 0x01, 0x88, 0x39, 0x00, 0x82, 0x39,
+ 0x00, 0x83, 0x39, 0x06, 0x81, 0x39, 0x06, 0x80,
+ 0x39, 0x00, 0x83, 0x39, 0x01, 0x89, 0x39, 0x00,
+ 0x81, 0x39, 0x0c, 0x83, 0x4b, 0x00, 0x87, 0x4b,
+ 0x00, 0x82, 0x4b, 0x00, 0xb2, 0x4b, 0x00, 0x82,
+ 0x4b, 0x00, 0x85, 0x4b, 0x03, 0x8f, 0x4b, 0x01,
+ 0x99, 0x4b, 0x01, 0x81, 0x7b, 0x00, 0x91, 0x7b,
+ 0x02, 0x97, 0x7b, 0x00, 0x88, 0x7b, 0x00, 0x80,
+ 0x7b, 0x01, 0x86, 0x7b, 0x02, 0x80, 0x7b, 0x03,
+ 0x85, 0x7b, 0x00, 0x80, 0x7b, 0x00, 0x87, 0x7b,
+ 0x05, 0x89, 0x7b, 0x01, 0x82, 0x7b, 0x0b, 0xb9,
+ 0x8c, 0x03, 0x80, 0x18, 0x9b, 0x8c, 0x24, 0x81,
+ 0x40, 0x00, 0x80, 0x40, 0x01, 0x81, 0x40, 0x00,
+ 0x80, 0x40, 0x01, 0x80, 0x40, 0x05, 0x83, 0x40,
+ 0x00, 0x86, 0x40, 0x00, 0x82, 0x40, 0x00, 0x80,
+ 0x40, 0x00, 0x80, 0x40, 0x01, 0x81, 0x40, 0x00,
+ 0x8c, 0x40, 0x00, 0x82, 0x40, 0x01, 0x84, 0x40,
+ 0x00, 0x80, 0x40, 0x00, 0x85, 0x40, 0x01, 0x89,
+ 0x40, 0x01, 0x83, 0x40, 0x1f, 0xc7, 0x8d, 0x00,
+ 0xa3, 0x8d, 0x03, 0xa6, 0x8d, 0x00, 0xa3, 0x8d,
+ 0x00, 0x8e, 0x8d, 0x00, 0x86, 0x8d, 0x83, 0x18,
+ 0x81, 0x8d, 0x24, 0xe0, 0x3f, 0x5a, 0xa5, 0x24,
+ 0x00, 0x80, 0x24, 0x04, 0x80, 0x24, 0x01, 0xaa,
+ 0x24, 0x80, 0x18, 0x83, 0x24, 0xe0, 0x9f, 0x2d,
+ 0xc8, 0x23, 0x00, 0x83, 0x23, 0x01, 0x86, 0x23,
+ 0x00, 0x80, 0x23, 0x00, 0x83, 0x23, 0x01, 0xa8,
+ 0x23, 0x00, 0x83, 0x23, 0x01, 0xa0, 0x23, 0x00,
+ 0x83, 0x23, 0x01, 0x86, 0x23, 0x00, 0x80, 0x23,
+ 0x00, 0x83, 0x23, 0x01, 0x8e, 0x23, 0x00, 0xb8,
+ 0x23, 0x00, 0x83, 0x23, 0x01, 0xc2, 0x23, 0x01,
+ 0x9f, 0x23, 0x02, 0x99, 0x23, 0x05, 0xd5, 0x17,
+ 0x01, 0x85, 0x17, 0x01, 0xe2, 0x1f, 0x12, 0x9c,
+ 0x60, 0x02, 0xca, 0x74, 0x82, 0x18, 0x8a, 0x74,
+ 0x06, 0x8c, 0x82, 0x00, 0x86, 0x82, 0x0a, 0x94,
+ 0x2f, 0x81, 0x18, 0x08, 0x93, 0x11, 0x0b, 0x8c,
+ 0x83, 0x00, 0x82, 0x83, 0x00, 0x81, 0x83, 0x0b,
+ 0xdd, 0x3d, 0x01, 0x89, 0x3d, 0x05, 0x89, 0x3d,
+ 0x05, 0x81, 0x57, 0x81, 0x18, 0x80, 0x57, 0x80,
+ 0x18, 0x88, 0x57, 0x00, 0x89, 0x57, 0x05, 0xd8,
+ 0x57, 0x06, 0xaa, 0x57, 0x04, 0xc5, 0x12, 0x09,
+ 0x9e, 0x43, 0x00, 0x8b, 0x43, 0x03, 0x8b, 0x43,
+ 0x03, 0x80, 0x43, 0x02, 0x8b, 0x43, 0x9d, 0x84,
+ 0x01, 0x84, 0x84, 0x0a, 0xab, 0x5c, 0x03, 0x99,
+ 0x5c, 0x05, 0x8a, 0x5c, 0x02, 0x81, 0x5c, 0x9f,
+ 0x3d, 0x9b, 0x10, 0x01, 0x81, 0x10, 0xbe, 0x85,
+ 0x00, 0x9c, 0x85, 0x01, 0x8a, 0x85, 0x05, 0x89,
+ 0x85, 0x05, 0x8d, 0x85, 0x01, 0x8e, 0x34, 0x40,
+ 0xcb, 0x07, 0x03, 0xac, 0x07, 0x02, 0xbf, 0x7f,
+ 0xb3, 0x0a, 0x07, 0x83, 0x0a, 0xb7, 0x42, 0x02,
+ 0x8e, 0x42, 0x02, 0x82, 0x42, 0xaf, 0x61, 0x88,
+ 0x1c, 0x06, 0xaa, 0x24, 0x01, 0x82, 0x24, 0x87,
+ 0x7f, 0x07, 0x82, 0x34, 0x80, 0x18, 0x8c, 0x34,
+ 0x80, 0x18, 0x86, 0x34, 0x83, 0x18, 0x80, 0x34,
+ 0x85, 0x18, 0x80, 0x34, 0x82, 0x18, 0x81, 0x34,
+ 0x05, 0xa5, 0x41, 0x84, 0x28, 0x80, 0x1c, 0xb0,
+ 0x41, 0x84, 0x28, 0x83, 0x41, 0x84, 0x28, 0x8c,
+ 0x41, 0x80, 0x1c, 0xc5, 0x41, 0x80, 0x28, 0xb9,
+ 0x34, 0x00, 0x84, 0x34, 0xe0, 0x9f, 0x41, 0x95,
+ 0x28, 0x01, 0x85, 0x28, 0x01, 0xa5, 0x28, 0x01,
+ 0x85, 0x28, 0x01, 0x87, 0x28, 0x00, 0x80, 0x28,
+ 0x00, 0x80, 0x28, 0x00, 0x80, 0x28, 0x00, 0x9e,
+ 0x28, 0x01, 0xb4, 0x28, 0x00, 0x8e, 0x28, 0x00,
+ 0x8d, 0x28, 0x01, 0x85, 0x28, 0x00, 0x92, 0x28,
+ 0x01, 0x82, 0x28, 0x00, 0x88, 0x28, 0x00, 0x8b,
+ 0x18, 0x81, 0x34, 0xd6, 0x18, 0x00, 0x8a, 0x18,
+ 0x80, 0x41, 0x01, 0x8a, 0x18, 0x80, 0x41, 0x8e,
+ 0x18, 0x00, 0x8c, 0x41, 0x02, 0x9f, 0x18, 0x0f,
+ 0xa0, 0x34, 0x0e, 0xa5, 0x18, 0x80, 0x28, 0x82,
+ 0x18, 0x81, 0x41, 0x85, 0x18, 0x80, 0x41, 0x9a,
+ 0x18, 0x80, 0x41, 0x90, 0x18, 0xa8, 0x41, 0x82,
+ 0x18, 0x03, 0xe2, 0x36, 0x18, 0x18, 0x8a, 0x18,
+ 0x14, 0xe3, 0x3f, 0x18, 0xe0, 0x9f, 0x0f, 0xe2,
+ 0x13, 0x18, 0x01, 0x9f, 0x18, 0x01, 0xb0, 0x18,
+ 0x00, 0xb4, 0x18, 0x00, 0xae, 0x25, 0x00, 0xae,
+ 0x25, 0x00, 0x9f, 0x41, 0xe0, 0x13, 0x19, 0x04,
+ 0x86, 0x19, 0xa5, 0x24, 0x00, 0x80, 0x24, 0x04,
+ 0x80, 0x24, 0x01, 0xb7, 0x8e, 0x06, 0x81, 0x8e,
+ 0x0d, 0x80, 0x8e, 0x96, 0x23, 0x08, 0x86, 0x23,
+ 0x00, 0x86, 0x23, 0x00, 0x86, 0x23, 0x00, 0x86,
+ 0x23, 0x00, 0x86, 0x23, 0x00, 0x86, 0x23, 0x00,
+ 0x86, 0x23, 0x00, 0x86, 0x23, 0x00, 0x9f, 0x1c,
+ 0xce, 0x18, 0x30, 0x99, 0x2c, 0x00, 0xd8, 0x2c,
+ 0x0b, 0xe0, 0x75, 0x2c, 0x19, 0x8b, 0x18, 0x03,
+ 0x84, 0x18, 0x80, 0x2c, 0x80, 0x18, 0x80, 0x2c,
+ 0x98, 0x18, 0x88, 0x2c, 0x83, 0x34, 0x81, 0x2d,
+ 0x87, 0x18, 0x83, 0x2c, 0x83, 0x18, 0x00, 0xd5,
+ 0x32, 0x01, 0x81, 0x34, 0x81, 0x18, 0x82, 0x32,
+ 0x80, 0x18, 0xd9, 0x3a, 0x81, 0x18, 0x82, 0x3a,
+ 0x04, 0xaa, 0x0d, 0x00, 0xdd, 0x2d, 0x00, 0x8f,
+ 0x18, 0x9a, 0x0d, 0x04, 0xa3, 0x18, 0x0b, 0x8f,
+ 0x3a, 0x9e, 0x2d, 0x00, 0xbf, 0x18, 0x9e, 0x2d,
+ 0xd0, 0x18, 0xae, 0x3a, 0x00, 0xd7, 0x3a, 0xe0,
+ 0x47, 0x18, 0xf0, 0x09, 0x55, 0x2c, 0x09, 0xbf,
+ 0x18, 0xf0, 0x41, 0x8f, 0x2c, 0x0f, 0xe4, 0x2c,
+ 0x93, 0x02, 0xb6, 0x93, 0x08, 0xaf, 0x46, 0xe0,
+ 0xcb, 0x91, 0x13, 0xdf, 0x1c, 0xd7, 0x08, 0x07,
+ 0xa1, 0x18, 0xe0, 0x05, 0x41, 0x82, 0x18, 0xae,
+ 0x41, 0x3c, 0x88, 0x41, 0xab, 0x80, 0x03, 0x89,
+ 0x18, 0x05, 0xb7, 0x70, 0x07, 0xc5, 0x76, 0x07,
+ 0x8b, 0x76, 0x05, 0x9f, 0x1e, 0xad, 0x3b, 0x80,
+ 0x18, 0x80, 0x3b, 0xa3, 0x73, 0x0a, 0x80, 0x73,
+ 0x9c, 0x2d, 0x02, 0xcd, 0x37, 0x00, 0x80, 0x18,
+ 0x89, 0x37, 0x03, 0x81, 0x37, 0x9e, 0x5a, 0x00,
+ 0xb6, 0x16, 0x08, 0x8d, 0x16, 0x01, 0x89, 0x16,
+ 0x01, 0x83, 0x16, 0x9f, 0x5a, 0xc2, 0x86, 0x17,
+ 0x84, 0x86, 0x96, 0x51, 0x09, 0x85, 0x23, 0x01,
+ 0x85, 0x23, 0x01, 0x85, 0x23, 0x08, 0x86, 0x23,
+ 0x00, 0x86, 0x23, 0x00, 0xaa, 0x41, 0x80, 0x18,
+ 0x88, 0x41, 0x80, 0x28, 0x09, 0xcf, 0x17, 0xad,
+ 0x51, 0x01, 0x89, 0x51, 0x05, 0xf0, 0x1b, 0x43,
+ 0x2d, 0x0b, 0x96, 0x2d, 0x03, 0xb0, 0x2d, 0x70,
+ 0x10, 0xa3, 0xe1, 0x0d, 0x2c, 0x01, 0xe0, 0x09,
+ 0x2c, 0x25, 0x86, 0x41, 0x0b, 0x84, 0x05, 0x04,
+ 0x99, 0x31, 0x00, 0x84, 0x31, 0x00, 0x80, 0x31,
+ 0x00, 0x81, 0x31, 0x00, 0x81, 0x31, 0x00, 0x89,
+ 0x31, 0xe0, 0x11, 0x04, 0x10, 0xe1, 0x0a, 0x04,
+ 0x81, 0x18, 0x0f, 0xbf, 0x04, 0x01, 0xb5, 0x04,
+ 0x27, 0x8d, 0x04, 0x01, 0x8f, 0x34, 0x89, 0x18,
+ 0x05, 0x8d, 0x34, 0x81, 0x1c, 0xa2, 0x18, 0x00,
+ 0x92, 0x18, 0x00, 0x83, 0x18, 0x03, 0x84, 0x04,
+ 0x00, 0xe0, 0x26, 0x04, 0x01, 0x80, 0x18, 0x00,
+ 0x9f, 0x18, 0x99, 0x41, 0x85, 0x18, 0x99, 0x41,
+ 0x8a, 0x18, 0x89, 0x3a, 0x80, 0x18, 0xac, 0x3a,
+ 0x81, 0x18, 0x9e, 0x2d, 0x02, 0x85, 0x2d, 0x01,
+ 0x85, 0x2d, 0x01, 0x85, 0x2d, 0x01, 0x82, 0x2d,
+ 0x02, 0x86, 0x18, 0x00, 0x86, 0x18, 0x09, 0x84,
+ 0x18, 0x01, 0x8b, 0x45, 0x00, 0x99, 0x45, 0x00,
+ 0x92, 0x45, 0x00, 0x81, 0x45, 0x00, 0x8e, 0x45,
+ 0x01, 0x8d, 0x45, 0x21, 0xe0, 0x1a, 0x45, 0x04,
+ 0x82, 0x18, 0x03, 0xac, 0x18, 0x02, 0x88, 0x18,
+ 0xce, 0x28, 0x00, 0x8b, 0x18, 0x03, 0x80, 0x28,
+ 0x2e, 0xac, 0x18, 0x80, 0x34, 0x60, 0x21, 0x9c,
+ 0x47, 0x02, 0xb0, 0x13, 0x0e, 0x80, 0x34, 0x9a,
+ 0x18, 0x03, 0xa3, 0x63, 0x08, 0x82, 0x63, 0x9a,
+ 0x26, 0x04, 0xaa, 0x65, 0x04, 0x9d, 0x90, 0x00,
+ 0x80, 0x90, 0xa3, 0x66, 0x03, 0x8d, 0x66, 0x29,
+ 0xcf, 0x1d, 0xaf, 0x78, 0x9d, 0x6c, 0x01, 0x89,
+ 0x6c, 0x05, 0xa3, 0x6b, 0x03, 0xa3, 0x6b, 0x03,
+ 0xa7, 0x22, 0x07, 0xb3, 0x14, 0x0a, 0x80, 0x14,
+ 0x60, 0x2f, 0xe0, 0xd6, 0x44, 0x08, 0x95, 0x44,
+ 0x09, 0x87, 0x44, 0x60, 0x37, 0x85, 0x1b, 0x01,
+ 0x80, 0x1b, 0x00, 0xab, 0x1b, 0x00, 0x81, 0x1b,
+ 0x02, 0x80, 0x1b, 0x01, 0x80, 0x1b, 0x95, 0x33,
+ 0x00, 0x88, 0x33, 0x9f, 0x6e, 0x9e, 0x5b, 0x07,
+ 0x88, 0x5b, 0x2f, 0x92, 0x30, 0x00, 0x81, 0x30,
+ 0x04, 0x84, 0x30, 0x9b, 0x71, 0x02, 0x80, 0x71,
+ 0x99, 0x48, 0x04, 0x80, 0x48, 0x3f, 0x9f, 0x54,
+ 0x97, 0x53, 0x03, 0x93, 0x53, 0x01, 0xad, 0x53,
+ 0x83, 0x3c, 0x00, 0x81, 0x3c, 0x04, 0x87, 0x3c,
+ 0x00, 0x82, 0x3c, 0x00, 0x9c, 0x3c, 0x01, 0x82,
+ 0x3c, 0x03, 0x89, 0x3c, 0x06, 0x88, 0x3c, 0x06,
+ 0x9f, 0x68, 0x9f, 0x64, 0x1f, 0xa6, 0x4d, 0x03,
+ 0x8b, 0x4d, 0x08, 0xb5, 0x06, 0x02, 0x86, 0x06,
+ 0x95, 0x36, 0x01, 0x87, 0x36, 0x92, 0x35, 0x04,
+ 0x87, 0x35, 0x91, 0x72, 0x06, 0x83, 0x72, 0x0b,
+ 0x86, 0x72, 0x4f, 0xc8, 0x69, 0x36, 0xb2, 0x62,
+ 0x0c, 0xb2, 0x62, 0x06, 0x85, 0x62, 0xa7, 0x2e,
+ 0x07, 0x89, 0x2e, 0x60, 0xc5, 0x9e, 0x04, 0x60,
+ 0x20, 0xa7, 0x67, 0x07, 0xa9, 0x7c, 0x60, 0x45,
+ 0xcd, 0x0e, 0x03, 0x9d, 0x0e, 0x0e, 0x80, 0x0e,
+ 0xc1, 0x38, 0x0a, 0x80, 0x38, 0x01, 0x98, 0x7d,
+ 0x06, 0x89, 0x7d, 0x05, 0xb4, 0x15, 0x00, 0x90,
+ 0x15, 0x08, 0xa6, 0x4a, 0x08, 0xcd, 0x77, 0x01,
+ 0x8f, 0x77, 0x00, 0x93, 0x7b, 0x0a, 0x91, 0x3e,
+ 0x00, 0xab, 0x3e, 0x40, 0x86, 0x59, 0x00, 0x80,
+ 0x59, 0x00, 0x83, 0x59, 0x00, 0x8e, 0x59, 0x00,
+ 0x8a, 0x59, 0x05, 0xba, 0x3f, 0x04, 0x89, 0x3f,
+ 0x05, 0x83, 0x27, 0x00, 0x87, 0x27, 0x01, 0x81,
+ 0x27, 0x01, 0x95, 0x27, 0x00, 0x86, 0x27, 0x00,
+ 0x81, 0x27, 0x00, 0x84, 0x27, 0x00, 0x80, 0x34,
+ 0x88, 0x27, 0x01, 0x81, 0x27, 0x01, 0x82, 0x27,
+ 0x01, 0x80, 0x27, 0x05, 0x80, 0x27, 0x04, 0x86,
+ 0x27, 0x01, 0x86, 0x27, 0x02, 0x84, 0x27, 0x60,
+ 0x2a, 0xd9, 0x5d, 0x00, 0x80, 0x5d, 0x00, 0x81,
+ 0x5d, 0x20, 0xc7, 0x8f, 0x07, 0x89, 0x8f, 0x60,
+ 0x45, 0xb5, 0x79, 0x01, 0xa5, 0x79, 0x21, 0xc4,
+ 0x56, 0x0a, 0x89, 0x56, 0x05, 0x8c, 0x57, 0x12,
+ 0xb7, 0x87, 0x07, 0x89, 0x87, 0x35, 0x9a, 0x02,
+ 0x01, 0x8e, 0x02, 0x03, 0x8f, 0x02, 0x60, 0x5f,
+ 0xbb, 0x1f, 0x60, 0x03, 0xd2, 0x92, 0x0b, 0x80,
+ 0x92, 0x60, 0x9f, 0xc7, 0x94, 0x07, 0xb3, 0x7e,
+ 0x01, 0x9c, 0x7e, 0x1c, 0xb8, 0x6f, 0x60, 0xa6,
+ 0x88, 0x0c, 0x00, 0xac, 0x0c, 0x00, 0x8d, 0x0c,
+ 0x09, 0x9c, 0x0c, 0x02, 0x9f, 0x4e, 0x01, 0x95,
+ 0x4e, 0x00, 0x8d, 0x4e, 0x48, 0x86, 0x4f, 0x00,
+ 0x81, 0x4f, 0x00, 0xab, 0x4f, 0x02, 0x80, 0x4f,
+ 0x00, 0x81, 0x4f, 0x00, 0x88, 0x4f, 0x07, 0x89,
+ 0x4f, 0x05, 0x85, 0x2a, 0x00, 0x81, 0x2a, 0x00,
+ 0xa4, 0x2a, 0x00, 0x81, 0x2a, 0x00, 0x85, 0x2a,
+ 0x06, 0x89, 0x2a, 0x60, 0xd5, 0x98, 0x49, 0x60,
+ 0xa6, 0xe3, 0x39, 0x1a, 0x60, 0x05, 0xe0, 0x0e,
+ 0x1a, 0x00, 0x84, 0x1a, 0x0a, 0xe0, 0x63, 0x1a,
+ 0x6a, 0x5b, 0xe3, 0xce, 0x21, 0x6f, 0x70, 0xe1,
+ 0xe6, 0x03, 0x70, 0x11, 0x58, 0xe1, 0xd8, 0x08,
+ 0x06, 0x9e, 0x58, 0x00, 0x89, 0x58, 0x03, 0x81,
+ 0x58, 0x5f, 0x9d, 0x09, 0x01, 0x85, 0x09, 0x09,
+ 0xc5, 0x6d, 0x09, 0x89, 0x6d, 0x00, 0x86, 0x6d,
+ 0x00, 0x94, 0x6d, 0x04, 0x92, 0x6d, 0x62, 0x4f,
+ 0xda, 0x50, 0x60, 0x04, 0xc4, 0x55, 0x0a, 0xae,
+ 0x55, 0x0f, 0x90, 0x55, 0x3f, 0x80, 0x89, 0x80,
+ 0x5f, 0x1d, 0xf0, 0x07, 0x91, 0x89, 0x0d, 0xe2,
+ 0x92, 0x89, 0x70, 0x14, 0xac, 0x80, 0x3a, 0xe0,
+ 0xbd, 0x32, 0x50, 0xe1, 0x2b, 0x5f, 0x68, 0xa3,
+ 0xe0, 0x0a, 0x20, 0x04, 0x8c, 0x20, 0x02, 0x88,
+ 0x20, 0x06, 0x89, 0x20, 0x01, 0x83, 0x20, 0x83,
+ 0x18, 0x70, 0x02, 0xfb, 0xe0, 0x95, 0x18, 0x09,
+ 0xa6, 0x18, 0x01, 0xbd, 0x18, 0x82, 0x34, 0x90,
+ 0x18, 0x87, 0x34, 0x81, 0x18, 0x86, 0x34, 0x9d,
+ 0x18, 0x83, 0x34, 0xba, 0x18, 0x16, 0xc5, 0x28,
+ 0x60, 0x39, 0x93, 0x18, 0x0b, 0xd6, 0x18, 0x08,
+ 0x98, 0x18, 0x60, 0x26, 0xd4, 0x18, 0x00, 0xc6,
+ 0x18, 0x00, 0x81, 0x18, 0x01, 0x80, 0x18, 0x01,
+ 0x81, 0x18, 0x01, 0x83, 0x18, 0x00, 0x8b, 0x18,
+ 0x00, 0x80, 0x18, 0x00, 0x86, 0x18, 0x00, 0xc0,
+ 0x18, 0x00, 0x83, 0x18, 0x01, 0x87, 0x18, 0x00,
+ 0x86, 0x18, 0x00, 0x9b, 0x18, 0x00, 0x83, 0x18,
+ 0x00, 0x84, 0x18, 0x00, 0x80, 0x18, 0x02, 0x86,
+ 0x18, 0x00, 0xe0, 0xf3, 0x18, 0x01, 0xe0, 0xc3,
+ 0x18, 0x01, 0xb1, 0x18, 0xe2, 0x2b, 0x7a, 0x0e,
+ 0x84, 0x7a, 0x00, 0x8e, 0x7a, 0x64, 0xef, 0x86,
+ 0x25, 0x00, 0x90, 0x25, 0x01, 0x86, 0x25, 0x00,
+ 0x81, 0x25, 0x00, 0x84, 0x25, 0x67, 0x74, 0xe0,
+ 0x64, 0x52, 0x01, 0x8f, 0x52, 0x28, 0xca, 0x01,
+ 0x04, 0x89, 0x01, 0x03, 0x81, 0x01, 0x62, 0xb0,
+ 0xc3, 0x18, 0x60, 0xea, 0x83, 0x04, 0x00, 0x9a,
+ 0x04, 0x00, 0x81, 0x04, 0x00, 0x80, 0x04, 0x01,
+ 0x80, 0x04, 0x00, 0x89, 0x04, 0x00, 0x83, 0x04,
+ 0x00, 0x80, 0x04, 0x00, 0x80, 0x04, 0x05, 0x80,
+ 0x04, 0x03, 0x80, 0x04, 0x00, 0x80, 0x04, 0x00,
+ 0x80, 0x04, 0x00, 0x82, 0x04, 0x00, 0x81, 0x04,
+ 0x00, 0x80, 0x04, 0x01, 0x80, 0x04, 0x00, 0x80,
+ 0x04, 0x00, 0x80, 0x04, 0x00, 0x80, 0x04, 0x00,
+ 0x80, 0x04, 0x00, 0x81, 0x04, 0x00, 0x80, 0x04,
+ 0x01, 0x83, 0x04, 0x00, 0x86, 0x04, 0x00, 0x83,
+ 0x04, 0x00, 0x83, 0x04, 0x00, 0x80, 0x04, 0x00,
+ 0x89, 0x04, 0x00, 0x90, 0x04, 0x04, 0x82, 0x04,
+ 0x00, 0x84, 0x04, 0x00, 0x90, 0x04, 0x33, 0x81,
+ 0x04, 0x60, 0xad, 0xab, 0x18, 0x03, 0xe0, 0x03,
+ 0x18, 0x0b, 0x8e, 0x18, 0x01, 0x8e, 0x18, 0x00,
+ 0x8e, 0x18, 0x00, 0xa4, 0x18, 0x09, 0x8c, 0x18,
+ 0x02, 0xdb, 0x18, 0x03, 0xbc, 0x18, 0x38, 0x99,
+ 0x18, 0x80, 0x32, 0x81, 0x18, 0x0c, 0xab, 0x18,
+ 0x03, 0x88, 0x18, 0x06, 0x81, 0x18, 0x0d, 0x85,
+ 0x18, 0x60, 0x39, 0xe3, 0x74, 0x18, 0x0a, 0x8c,
+ 0x18, 0x02, 0x89, 0x18, 0x05, 0xe0, 0x13, 0x18,
+ 0x0b, 0xd8, 0x18, 0x26, 0x8b, 0x18, 0x03, 0xb7,
+ 0x18, 0x07, 0x89, 0x18, 0x05, 0xa7, 0x18, 0x07,
+ 0x9d, 0x18, 0x51, 0x8b, 0x18, 0x03, 0xae, 0x18,
+ 0x00, 0xb0, 0x18, 0x01, 0x83, 0x18, 0x02, 0x80,
+ 0x18, 0x00, 0xa6, 0x18, 0x0c, 0x89, 0x18, 0x05,
+ 0x82, 0x18, 0x0c, 0xaf, 0x18, 0x5f, 0x8d, 0x18,
+ 0x65, 0x31, 0xf0, 0x96, 0x76, 0x2c, 0x28, 0xef,
+ 0xd4, 0x2c, 0x0a, 0xe0, 0x7d, 0x2c, 0x01, 0xf0,
+ 0x06, 0x21, 0x2c, 0x0d, 0xf0, 0x0c, 0xd0, 0x2c,
+ 0x6b, 0xbe, 0xe1, 0xbd, 0x2c, 0x7a, 0xf5, 0x82,
+ 0x80, 0x18, 0x1d, 0xdf, 0x18, 0x60, 0x1f, 0xe0,
+ 0x8f, 0x34,
+};
+
+static const uint8_t unicode_script_ext_table[735] = {
+ 0x82, 0xc1, 0x00, 0x00, 0x01, 0x28, 0x01, 0x00,
+ 0x00, 0x01, 0x28, 0x1c, 0x00, 0x0c, 0x01, 0x41,
+ 0x80, 0x92, 0x00, 0x00, 0x02, 0x1c, 0x65, 0x00,
+ 0x02, 0x1c, 0x25, 0x01, 0x02, 0x1c, 0x41, 0x00,
+ 0x02, 0x1c, 0x25, 0x80, 0x80, 0x00, 0x00, 0x02,
+ 0x05, 0x24, 0x80, 0x01, 0x00, 0x00, 0x04, 0x04,
+ 0x2e, 0x81, 0x8b, 0x0d, 0x00, 0x00, 0x04, 0x04,
+ 0x2e, 0x81, 0x8b, 0x00, 0x03, 0x04, 0x81, 0x8b,
+ 0x01, 0x00, 0x00, 0x04, 0x04, 0x2e, 0x81, 0x8b,
+ 0x1f, 0x00, 0x00, 0x08, 0x01, 0x04, 0x4c, 0x4d,
+ 0x72, 0x2e, 0x7c, 0x81, 0x09, 0x00, 0x0a, 0x02,
+ 0x04, 0x81, 0x09, 0x00, 0x09, 0x02, 0x04, 0x8b,
+ 0x05, 0x00, 0x00, 0x02, 0x04, 0x81, 0x62, 0x00,
+ 0x00, 0x02, 0x04, 0x2e, 0x81, 0xfb, 0x00, 0x00,
+ 0x0d, 0x0b, 0x1e, 0x27, 0x29, 0x2b, 0x39, 0x41,
+ 0x4b, 0x6a, 0x77, 0x88, 0x8a, 0x8f, 0x00, 0x0c,
+ 0x0b, 0x1e, 0x27, 0x29, 0x2b, 0x39, 0x41, 0x4b,
+ 0x6a, 0x88, 0x8a, 0x8f, 0x10, 0x00, 0x00, 0x12,
+ 0x0b, 0x1e, 0x1f, 0x2a, 0x27, 0x29, 0x2b, 0x39,
+ 0x4a, 0x4b, 0x6a, 0x3f, 0x7b, 0x80, 0x87, 0x88,
+ 0x8a, 0x8f, 0x00, 0x13, 0x0b, 0x1e, 0x1f, 0x2a,
+ 0x27, 0x29, 0x2b, 0x39, 0x43, 0x4a, 0x4b, 0x6a,
+ 0x3f, 0x7b, 0x80, 0x87, 0x88, 0x8a, 0x8f, 0x09,
+ 0x04, 0x1e, 0x1f, 0x38, 0x4a, 0x75, 0x00, 0x09,
+ 0x03, 0x0b, 0x15, 0x80, 0x75, 0x00, 0x09, 0x02,
+ 0x2b, 0x59, 0x75, 0x00, 0x09, 0x02, 0x29, 0x3e,
+ 0x80, 0x75, 0x00, 0x0d, 0x02, 0x27, 0x88, 0x83,
+ 0xcb, 0x00, 0x09, 0x03, 0x15, 0x5a, 0x84, 0x80,
+ 0x30, 0x00, 0x00, 0x02, 0x24, 0x41, 0x85, 0xb8,
+ 0x00, 0x01, 0x04, 0x11, 0x2f, 0x83, 0x82, 0x80,
+ 0x4a, 0x00, 0x01, 0x02, 0x57, 0x70, 0x00, 0x00,
+ 0x00, 0x02, 0x57, 0x70, 0x84, 0x49, 0x00, 0x00,
+ 0x04, 0x0b, 0x1e, 0x27, 0x39, 0x00, 0x01, 0x1e,
+ 0x00, 0x04, 0x0b, 0x1e, 0x27, 0x39, 0x00, 0x02,
+ 0x1e, 0x27, 0x00, 0x01, 0x1e, 0x01, 0x02, 0x0b,
+ 0x1e, 0x00, 0x02, 0x1e, 0x77, 0x00, 0x02, 0x0b,
+ 0x1e, 0x00, 0x02, 0x1e, 0x77, 0x00, 0x06, 0x1e,
+ 0x39, 0x4b, 0x6a, 0x88, 0x8a, 0x00, 0x01, 0x1e,
+ 0x01, 0x02, 0x1e, 0x77, 0x01, 0x01, 0x1e, 0x00,
+ 0x02, 0x1e, 0x77, 0x00, 0x02, 0x0b, 0x1e, 0x07,
+ 0x01, 0x1e, 0x00, 0x02, 0x0b, 0x1e, 0x01, 0x01,
+ 0x1e, 0x00, 0x02, 0x0b, 0x1e, 0x03, 0x01, 0x1e,
+ 0x01, 0x02, 0x1e, 0x27, 0x00, 0x03, 0x1e, 0x27,
+ 0x39, 0x01, 0x02, 0x0b, 0x1e, 0x00, 0x01, 0x0b,
+ 0x01, 0x02, 0x1e, 0x27, 0x80, 0x45, 0x00, 0x01,
+ 0x01, 0x28, 0x82, 0xad, 0x00, 0x00, 0x03, 0x1e,
+ 0x27, 0x41, 0x8c, 0xd1, 0x00, 0x00, 0x02, 0x1c,
+ 0x25, 0x81, 0x3c, 0x00, 0x01, 0x06, 0x0d, 0x2d,
+ 0x2c, 0x32, 0x3a, 0x93, 0x00, 0x05, 0x0d, 0x2d,
+ 0x2c, 0x32, 0x3a, 0x01, 0x00, 0x00, 0x01, 0x2c,
+ 0x00, 0x00, 0x09, 0x06, 0x0d, 0x2d, 0x2c, 0x32,
+ 0x3a, 0x93, 0x00, 0x00, 0x00, 0x05, 0x0d, 0x2d,
+ 0x2c, 0x32, 0x3a, 0x07, 0x06, 0x0d, 0x2d, 0x2c,
+ 0x32, 0x3a, 0x93, 0x03, 0x05, 0x0d, 0x2d, 0x2c,
+ 0x32, 0x3a, 0x09, 0x00, 0x03, 0x02, 0x0d, 0x2c,
+ 0x01, 0x00, 0x00, 0x05, 0x0d, 0x2d, 0x2c, 0x32,
+ 0x3a, 0x04, 0x02, 0x32, 0x3a, 0x00, 0x00, 0x00,
+ 0x05, 0x0d, 0x2d, 0x2c, 0x32, 0x3a, 0x03, 0x00,
+ 0x01, 0x03, 0x2c, 0x32, 0x3a, 0x01, 0x01, 0x2c,
+ 0x58, 0x00, 0x03, 0x02, 0x32, 0x3a, 0x02, 0x00,
+ 0x00, 0x02, 0x32, 0x3a, 0x59, 0x00, 0x00, 0x06,
+ 0x0d, 0x2d, 0x2c, 0x32, 0x3a, 0x93, 0x00, 0x02,
+ 0x32, 0x3a, 0x80, 0x12, 0x00, 0x0f, 0x01, 0x2c,
+ 0x1f, 0x00, 0x23, 0x01, 0x2c, 0x3b, 0x00, 0x27,
+ 0x01, 0x2c, 0x37, 0x00, 0x30, 0x01, 0x2c, 0x0e,
+ 0x00, 0x0b, 0x01, 0x2c, 0x80, 0x0b, 0x00, 0x18,
+ 0x01, 0x2c, 0x09, 0x00, 0x04, 0x01, 0x2c, 0x5f,
+ 0x00, 0x1e, 0x01, 0x2c, 0xc0, 0x31, 0xef, 0x00,
+ 0x00, 0x02, 0x1c, 0x25, 0x81, 0x3f, 0x00, 0x02,
+ 0x0d, 0x1e, 0x1f, 0x29, 0x2b, 0x3e, 0x39, 0x38,
+ 0x4a, 0x4b, 0x56, 0x3f, 0x87, 0x8f, 0x02, 0x0c,
+ 0x1e, 0x1f, 0x29, 0x2b, 0x3e, 0x39, 0x38, 0x4a,
+ 0x56, 0x3f, 0x87, 0x8f, 0x03, 0x0b, 0x1e, 0x1f,
+ 0x29, 0x2b, 0x3e, 0x38, 0x4a, 0x56, 0x3f, 0x87,
+ 0x8f, 0x80, 0x36, 0x00, 0x00, 0x02, 0x0b, 0x1e,
+ 0x00, 0x00, 0x00, 0x02, 0x1e, 0x88, 0x39, 0x00,
+ 0x00, 0x03, 0x3b, 0x41, 0x5a, 0x80, 0x1f, 0x00,
+ 0x00, 0x02, 0x10, 0x37, 0xc0, 0x13, 0xa1, 0x00,
+ 0x00, 0x02, 0x04, 0x8b, 0x09, 0x00, 0x00, 0x02,
+ 0x04, 0x8b, 0x46, 0x00, 0x01, 0x05, 0x0d, 0x2d,
+ 0x2c, 0x32, 0x3a, 0x80, 0x99, 0x00, 0x04, 0x06,
+ 0x0d, 0x2d, 0x2c, 0x32, 0x3a, 0x93, 0x09, 0x00,
+ 0x00, 0x02, 0x32, 0x3a, 0x2c, 0x00, 0x01, 0x02,
+ 0x32, 0x3a, 0x80, 0xdf, 0x00, 0x02, 0x02, 0x1b,
+ 0x45, 0x03, 0x00, 0x2c, 0x03, 0x1b, 0x44, 0x45,
+ 0x02, 0x00, 0x08, 0x02, 0x1b, 0x45, 0x81, 0x1f,
+ 0x00, 0x1b, 0x02, 0x04, 0x19, 0x8f, 0x84, 0x00,
+ 0x00, 0x02, 0x27, 0x88, 0x00, 0x00, 0x00, 0x02,
+ 0x27, 0x88, 0x36, 0x00, 0x01, 0x02, 0x27, 0x88,
+ 0xc0, 0x68, 0xe2, 0x00, 0x03, 0x01, 0x20, 0x96,
+ 0x3b, 0x00, 0x11, 0x01, 0x2c, 0x9e, 0x5d, 0x00,
+ 0x01, 0x01, 0x2c, 0xce, 0xcd, 0x2d, 0x00,
+};
+
+static const uint8_t unicode_prop_Hyphen_table[28] = {
+ 0xac, 0x80, 0xfe, 0x80, 0x44, 0xdb, 0x80, 0x52,
+ 0x7a, 0x80, 0x48, 0x08, 0x81, 0x4e, 0x04, 0x80,
+ 0x42, 0xe2, 0x80, 0x60, 0xcd, 0x66, 0x80, 0x40,
+ 0xa8, 0x80, 0xd6, 0x80,
+};
+
+static const uint8_t unicode_prop_Other_Math_table[200] = {
+ 0xdd, 0x80, 0x43, 0x70, 0x11, 0x80, 0x99, 0x09,
+ 0x81, 0x5c, 0x1f, 0x80, 0x9a, 0x82, 0x8a, 0x80,
+ 0x9f, 0x83, 0x97, 0x81, 0x8d, 0x81, 0xc0, 0x8c,
+ 0x18, 0x11, 0x1c, 0x91, 0x03, 0x01, 0x89, 0x00,
+ 0x14, 0x28, 0x11, 0x09, 0x02, 0x05, 0x13, 0x24,
+ 0xca, 0x21, 0x18, 0x08, 0x08, 0x00, 0x21, 0x0b,
+ 0x0b, 0x91, 0x09, 0x00, 0x06, 0x00, 0x29, 0x41,
+ 0x21, 0x83, 0x40, 0xa7, 0x08, 0x80, 0x97, 0x80,
+ 0x90, 0x80, 0x41, 0xbc, 0x81, 0x8b, 0x88, 0x24,
+ 0x21, 0x09, 0x14, 0x8d, 0x00, 0x01, 0x85, 0x97,
+ 0x81, 0xb8, 0x00, 0x80, 0x9c, 0x83, 0x88, 0x81,
+ 0x41, 0x55, 0x81, 0x9e, 0x89, 0x41, 0x92, 0x95,
+ 0xbe, 0x83, 0x9f, 0x81, 0x60, 0xd4, 0x62, 0x00,
+ 0x03, 0x80, 0x40, 0xd2, 0x00, 0x80, 0x60, 0xd4,
+ 0xc0, 0xd4, 0x80, 0xc6, 0x01, 0x08, 0x09, 0x0b,
+ 0x80, 0x8b, 0x00, 0x06, 0x80, 0xc0, 0x03, 0x0f,
+ 0x06, 0x80, 0x9b, 0x03, 0x04, 0x00, 0x16, 0x80,
+ 0x41, 0x53, 0x81, 0x98, 0x80, 0x98, 0x80, 0x9e,
+ 0x80, 0x98, 0x80, 0x9e, 0x80, 0x98, 0x80, 0x9e,
+ 0x80, 0x98, 0x80, 0x9e, 0x80, 0x98, 0x07, 0x81,
+ 0xb1, 0x55, 0xff, 0x18, 0x9a, 0x01, 0x00, 0x08,
+ 0x80, 0x89, 0x03, 0x00, 0x00, 0x28, 0x18, 0x00,
+ 0x00, 0x02, 0x01, 0x00, 0x08, 0x00, 0x00, 0x00,
+ 0x00, 0x01, 0x00, 0x0b, 0x06, 0x03, 0x03, 0x00,
+ 0x80, 0x89, 0x80, 0x90, 0x22, 0x04, 0x80, 0x90,
+};
+
+static const uint8_t unicode_prop_Other_Alphabetic_table[389] = {
+ 0x43, 0x44, 0x80, 0x42, 0x69, 0x8d, 0x00, 0x01,
+ 0x01, 0x00, 0xc7, 0x8a, 0xaf, 0x8c, 0x06, 0x8f,
+ 0x80, 0xe4, 0x33, 0x19, 0x0b, 0x80, 0xa2, 0x80,
+ 0x9d, 0x8f, 0xe5, 0x8a, 0xe4, 0x0a, 0x88, 0x02,
+ 0x03, 0x40, 0xa6, 0x8b, 0x16, 0x85, 0x93, 0xb5,
+ 0x09, 0x8e, 0x01, 0x22, 0x89, 0x81, 0x9c, 0x82,
+ 0xb9, 0x31, 0x09, 0x81, 0x89, 0x80, 0x89, 0x81,
+ 0x9c, 0x82, 0xb9, 0x23, 0x09, 0x0b, 0x80, 0x9d,
+ 0x0a, 0x80, 0x8a, 0x82, 0xb9, 0x38, 0x10, 0x81,
+ 0x94, 0x81, 0x95, 0x13, 0x82, 0xb9, 0x31, 0x09,
+ 0x81, 0x88, 0x81, 0x89, 0x81, 0x9d, 0x80, 0xba,
+ 0x22, 0x10, 0x82, 0x89, 0x80, 0xa7, 0x83, 0xb9,
+ 0x30, 0x10, 0x17, 0x81, 0x8a, 0x81, 0x9c, 0x82,
+ 0xb9, 0x30, 0x10, 0x17, 0x81, 0x8a, 0x81, 0x9b,
+ 0x83, 0xb9, 0x30, 0x10, 0x82, 0x89, 0x80, 0x89,
+ 0x81, 0x9d, 0x81, 0xca, 0x28, 0x00, 0x87, 0x91,
+ 0x81, 0xbc, 0x01, 0x86, 0x91, 0x80, 0xe2, 0x01,
+ 0x28, 0x81, 0x8f, 0x80, 0x40, 0xa2, 0x90, 0x8a,
+ 0x8a, 0x80, 0xa3, 0xed, 0x8b, 0x00, 0x0b, 0x96,
+ 0x1b, 0x10, 0x03, 0x0f, 0x83, 0x8c, 0x84, 0x94,
+ 0x81, 0x42, 0xc0, 0x80, 0x43, 0xb1, 0x81, 0x9d,
+ 0x81, 0x9d, 0x81, 0x9d, 0x81, 0xc1, 0x92, 0x40,
+ 0xbb, 0x81, 0xa1, 0x80, 0xf5, 0x8b, 0x83, 0x88,
+ 0x40, 0xdd, 0x84, 0xb8, 0x89, 0x81, 0x93, 0x40,
+ 0x8a, 0x84, 0xaf, 0x8e, 0xbb, 0x82, 0x9d, 0x88,
+ 0x09, 0xb8, 0x8a, 0xb1, 0x91, 0x40, 0xbb, 0x81,
+ 0x40, 0xf2, 0x8d, 0x46, 0xc0, 0xb3, 0x48, 0xf5,
+ 0x9f, 0x60, 0x78, 0x73, 0x87, 0xa1, 0x81, 0x41,
+ 0x82, 0x84, 0xd7, 0x81, 0xb1, 0x8f, 0x00, 0xdf,
+ 0x84, 0x9b, 0x8b, 0xac, 0x83, 0xaf, 0x8b, 0xe8,
+ 0x8d, 0x8b, 0x07, 0x81, 0xe1, 0x00, 0x11, 0x0c,
+ 0x80, 0xab, 0x24, 0x80, 0x40, 0xec, 0x87, 0x60,
+ 0x4f, 0x32, 0x80, 0x48, 0x56, 0x84, 0x46, 0x85,
+ 0x10, 0x0c, 0x83, 0x43, 0x13, 0x83, 0x42, 0xd7,
+ 0x82, 0xb4, 0x8d, 0xbb, 0x80, 0xac, 0x88, 0xc6,
+ 0x82, 0xa3, 0x8b, 0x91, 0x81, 0xb8, 0x82, 0xaf,
+ 0x8c, 0xeb, 0x88, 0x08, 0x28, 0x40, 0x9f, 0x89,
+ 0x96, 0x83, 0xb9, 0x31, 0x09, 0x81, 0x89, 0x80,
+ 0x89, 0x81, 0x40, 0xd0, 0x8c, 0x02, 0xe9, 0x91,
+ 0x40, 0xec, 0x31, 0x86, 0x9c, 0x81, 0xd1, 0x8e,
+ 0x00, 0xe9, 0x8a, 0xe6, 0x8d, 0x41, 0x00, 0x8c,
+ 0x41, 0xc7, 0x89, 0xa9, 0x20, 0x83, 0x91, 0x8a,
+ 0xad, 0x8d, 0x41, 0x96, 0x38, 0x86, 0xd2, 0x95,
+ 0x80, 0x8d, 0xf9, 0x2a, 0x00, 0x08, 0x10, 0x02,
+ 0x80, 0xc1, 0x20, 0x08, 0x83, 0x41, 0x5b, 0x83,
+ 0x60, 0x4c, 0x38, 0x86, 0x44, 0x19, 0xad, 0x60,
+ 0x4d, 0x1e, 0x80, 0x60, 0x23, 0x60, 0x30, 0x90,
+ 0x0e, 0x01, 0x04, 0x49, 0x1b, 0x80, 0x47, 0xe7,
+ 0x99, 0x85, 0x99, 0x85, 0x99,
+};
+
+static const uint8_t unicode_prop_Other_Lowercase_table[51] = {
+ 0x40, 0xa9, 0x80, 0x8e, 0x80, 0x41, 0xf4, 0x88,
+ 0x31, 0x9d, 0x84, 0xdf, 0x80, 0xb3, 0x80, 0x59,
+ 0xb0, 0xbe, 0x8c, 0x80, 0xa1, 0xa4, 0x42, 0xb0,
+ 0x80, 0x8c, 0x80, 0x8f, 0x8c, 0x40, 0xd2, 0x8f,
+ 0x43, 0x4f, 0x99, 0x47, 0x91, 0x81, 0x60, 0x7a,
+ 0x1d, 0x81, 0x40, 0xd1, 0x80, 0x40, 0x86, 0x81,
+ 0x43, 0x61, 0x83,
+};
+
+static const uint8_t unicode_prop_Other_Uppercase_table[15] = {
+ 0x60, 0x21, 0x5f, 0x8f, 0x43, 0x45, 0x99, 0x61,
+ 0xcc, 0x5f, 0x99, 0x85, 0x99, 0x85, 0x99,
+};
+
+static const uint8_t unicode_prop_Other_Grapheme_Extend_table[59] = {
+ 0x49, 0xbd, 0x80, 0x97, 0x80, 0x41, 0x65, 0x80,
+ 0x97, 0x80, 0xe5, 0x80, 0x97, 0x80, 0x40, 0xe9,
+ 0x80, 0x91, 0x81, 0xe6, 0x80, 0x97, 0x80, 0xf6,
+ 0x80, 0x8e, 0x80, 0x52, 0x2b, 0x80, 0x50, 0x20,
+ 0x81, 0x60, 0xcf, 0x6d, 0x81, 0x53, 0x9d, 0x80,
+ 0x97, 0x80, 0x41, 0x57, 0x80, 0x8b, 0x80, 0x40,
+ 0xf0, 0x80, 0x60, 0xbb, 0xb4, 0x07, 0x84, 0x6c,
+ 0x2e, 0xac, 0xdf,
+};
+
+static const uint8_t unicode_prop_Other_Default_Ignorable_Code_Point_table[32] = {
+ 0x43, 0x4e, 0x80, 0x4e, 0x0e, 0x81, 0x46, 0x52,
+ 0x81, 0x48, 0xae, 0x80, 0x50, 0xfd, 0x80, 0x60,
+ 0xce, 0x3a, 0x80, 0xce, 0x88, 0x6d, 0x00, 0x06,
+ 0x00, 0x9d, 0xdf, 0xff, 0x40, 0xef, 0x4e, 0x0f,
+};
+
+static const uint8_t unicode_prop_Other_ID_Start_table[11] = {
+ 0x58, 0x84, 0x81, 0x48, 0x90, 0x80, 0x94, 0x80,
+ 0x4f, 0x6b, 0x81,
+};
+
+static const uint8_t unicode_prop_Other_ID_Continue_table[12] = {
+ 0x40, 0xb6, 0x80, 0x42, 0xce, 0x80, 0x4f, 0xe0,
+ 0x88, 0x46, 0x67, 0x80,
+};
+
+static const uint8_t unicode_prop_Prepended_Concatenation_Mark_table[17] = {
+ 0x45, 0xff, 0x85, 0x40, 0xd6, 0x80, 0xb0, 0x80,
+ 0x41, 0xd1, 0x80, 0x61, 0x07, 0xd9, 0x80, 0x8e,
+ 0x80,
+};
+
+static const uint8_t unicode_prop_XID_Start1_table[31] = {
+ 0x43, 0x79, 0x80, 0x4a, 0xb7, 0x80, 0xfe, 0x80,
+ 0x60, 0x21, 0xe6, 0x81, 0x60, 0xcb, 0xc0, 0x85,
+ 0x41, 0x95, 0x81, 0xf3, 0x00, 0x00, 0x00, 0x00,
+ 0x00, 0x00, 0x00, 0x80, 0x41, 0x1e, 0x81,
+};
+
+static const uint8_t unicode_prop_XID_Continue1_table[23] = {
+ 0x43, 0x79, 0x80, 0x60, 0x2d, 0x1f, 0x81, 0x60,
+ 0xcb, 0xc0, 0x85, 0x41, 0x95, 0x81, 0xf3, 0x00,
+ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x80,
+};
+
+static const uint8_t unicode_prop_Changes_When_Titlecased1_table[22] = {
+ 0x41, 0xc3, 0x08, 0x08, 0x81, 0xa4, 0x81, 0x4e,
+ 0xdc, 0xaa, 0x0a, 0x4e, 0x87, 0x3f, 0x3f, 0x87,
+ 0x8b, 0x80, 0x8e, 0x80, 0xae, 0x80,
+};
+
+static const uint8_t unicode_prop_Changes_When_Casefolded1_table[33] = {
+ 0x40, 0xde, 0x80, 0xcf, 0x80, 0x97, 0x80, 0x44,
+ 0x3c, 0x80, 0x59, 0x11, 0x80, 0x40, 0xe4, 0x3f,
+ 0x3f, 0x87, 0x89, 0x11, 0x05, 0x02, 0x11, 0x80,
+ 0xa9, 0x11, 0x80, 0x60, 0xdb, 0x07, 0x86, 0x8b,
+ 0x84,
+};
+
+static const uint8_t unicode_prop_Changes_When_NFKC_Casefolded1_table[438] = {
+ 0x40, 0x9f, 0x06, 0x00, 0x01, 0x00, 0x01, 0x12,
+ 0x10, 0x82, 0x9f, 0x80, 0xcf, 0x01, 0x80, 0x8b,
+ 0x07, 0x80, 0xfb, 0x01, 0x01, 0x80, 0xa5, 0x80,
+ 0x40, 0xbb, 0x88, 0x9e, 0x29, 0x84, 0xda, 0x08,
+ 0x81, 0x89, 0x80, 0xa3, 0x04, 0x02, 0x04, 0x08,
+ 0x80, 0xc9, 0x82, 0x9c, 0x80, 0x41, 0x93, 0x80,
+ 0x40, 0x93, 0x80, 0xd7, 0x83, 0x42, 0xde, 0x87,
+ 0xfb, 0x08, 0x80, 0xd2, 0x01, 0x80, 0xa1, 0x11,
+ 0x80, 0x40, 0xfc, 0x81, 0x42, 0xd4, 0x80, 0xfe,
+ 0x80, 0xa7, 0x81, 0xad, 0x80, 0xb5, 0x80, 0x88,
+ 0x03, 0x03, 0x03, 0x80, 0x8b, 0x80, 0x88, 0x00,
+ 0x26, 0x80, 0x90, 0x80, 0x88, 0x03, 0x03, 0x03,
+ 0x80, 0x8b, 0x80, 0x41, 0x41, 0x80, 0xe1, 0x81,
+ 0x46, 0x52, 0x81, 0xd4, 0x83, 0x45, 0x1c, 0x10,
+ 0x8a, 0x80, 0x91, 0x80, 0x9b, 0x8c, 0x80, 0xa1,
+ 0xa4, 0x40, 0xd9, 0x80, 0x40, 0xd5, 0x00, 0x00,
+ 0x00, 0x00, 0x00, 0x00, 0x01, 0x3f, 0x3f, 0x87,
+ 0x89, 0x11, 0x04, 0x00, 0x29, 0x04, 0x12, 0x80,
+ 0x88, 0x12, 0x80, 0x88, 0x11, 0x11, 0x04, 0x08,
+ 0x8f, 0x00, 0x20, 0x8b, 0x12, 0x2a, 0x08, 0x0b,
+ 0x00, 0x07, 0x82, 0x8c, 0x06, 0x92, 0x81, 0x9a,
+ 0x80, 0x8c, 0x8a, 0x80, 0xd6, 0x18, 0x10, 0x8a,
+ 0x01, 0x0c, 0x0a, 0x00, 0x10, 0x11, 0x02, 0x06,
+ 0x05, 0x1c, 0x85, 0x8f, 0x8f, 0x8f, 0x88, 0x80,
+ 0x40, 0xa1, 0x08, 0x81, 0x40, 0xf7, 0x81, 0x41,
+ 0x34, 0xd5, 0x99, 0x9a, 0x45, 0x20, 0x80, 0xe6,
+ 0x82, 0xe4, 0x80, 0x41, 0x9e, 0x81, 0x40, 0xf0,
+ 0x80, 0x41, 0x2e, 0x80, 0xd2, 0x80, 0x8b, 0x40,
+ 0xd5, 0xa9, 0x80, 0xb4, 0x00, 0x82, 0xdf, 0x09,
+ 0x80, 0xde, 0x80, 0xb0, 0xdd, 0x82, 0x8d, 0xdf,
+ 0x9e, 0x80, 0xa7, 0x87, 0xae, 0x80, 0xfe, 0x80,
+ 0x40, 0xff, 0x60, 0x72, 0x9b, 0x81, 0x40, 0xd1,
+ 0x80, 0x40, 0x86, 0x81, 0x43, 0x61, 0x83, 0x60,
+ 0x4d, 0x9f, 0x41, 0x0d, 0x08, 0x00, 0x81, 0x89,
+ 0x00, 0x00, 0x09, 0x82, 0xc3, 0x81, 0xe9, 0xa5,
+ 0x86, 0x8b, 0x24, 0x00, 0x97, 0x04, 0x00, 0x01,
+ 0x01, 0x80, 0xeb, 0xa0, 0x41, 0x6a, 0x91, 0xbf,
+ 0x81, 0xb5, 0xa7, 0x8c, 0x82, 0x99, 0x95, 0x94,
+ 0x81, 0x8b, 0x80, 0x92, 0x03, 0x1a, 0x00, 0x80,
+ 0x40, 0x86, 0x08, 0x80, 0x9f, 0x99, 0x40, 0x83,
+ 0x15, 0x0d, 0x0d, 0x0a, 0x16, 0x06, 0x80, 0x88,
+ 0x60, 0xbc, 0xa6, 0x83, 0x54, 0xb9, 0x86, 0x8d,
+ 0x87, 0xbf, 0x85, 0x42, 0x3e, 0xd4, 0x80, 0xc6,
+ 0x01, 0x08, 0x09, 0x0b, 0x80, 0x8b, 0x00, 0x06,
+ 0x80, 0xc0, 0x03, 0x0f, 0x06, 0x80, 0x9b, 0x03,
+ 0x04, 0x00, 0x16, 0x80, 0x41, 0x53, 0x81, 0x41,
+ 0x23, 0x81, 0xb1, 0x55, 0xff, 0x18, 0x9a, 0x01,
+ 0x00, 0x08, 0x80, 0x89, 0x03, 0x00, 0x00, 0x28,
+ 0x18, 0x00, 0x00, 0x02, 0x01, 0x00, 0x08, 0x00,
+ 0x00, 0x00, 0x00, 0x01, 0x00, 0x0b, 0x06, 0x03,
+ 0x03, 0x00, 0x80, 0x89, 0x80, 0x90, 0x22, 0x04,
+ 0x80, 0x90, 0x42, 0x43, 0x8a, 0x84, 0x9e, 0x80,
+ 0x9f, 0x99, 0x81, 0xa3, 0x80, 0xee, 0x82, 0x8c,
+ 0xab, 0x83, 0x88, 0x31, 0x61, 0x05, 0xad, 0x42,
+ 0x1d, 0x6b, 0x05, 0xe1, 0x4f, 0xff,
+};
+
+static const uint8_t unicode_prop_ASCII_Hex_Digit_table[5] = {
+ 0xaf, 0x89, 0x35, 0x99, 0x85,
+};
+
+static const uint8_t unicode_prop_Bidi_Control_table[10] = {
+ 0x46, 0x1b, 0x80, 0x59, 0xf0, 0x81, 0x99, 0x84,
+ 0xb6, 0x83,
+};
+
+static const uint8_t unicode_prop_Dash_table[50] = {
+ 0xac, 0x80, 0x45, 0x5b, 0x80, 0xb2, 0x80, 0x4e,
+ 0x40, 0x80, 0x44, 0x04, 0x80, 0x48, 0x08, 0x85,
+ 0xbc, 0x80, 0xa6, 0x80, 0x8e, 0x80, 0x41, 0x85,
+ 0x80, 0x4c, 0x03, 0x01, 0x80, 0x9e, 0x0b, 0x80,
+ 0x41, 0xda, 0x80, 0x92, 0x80, 0xee, 0x80, 0x60,
+ 0xcd, 0x8f, 0x81, 0xa4, 0x80, 0x89, 0x80, 0x40,
+ 0xa8, 0x80,
+};
+
+static const uint8_t unicode_prop_Deprecated_table[23] = {
+ 0x41, 0x48, 0x80, 0x45, 0x28, 0x80, 0x49, 0x02,
+ 0x00, 0x80, 0x48, 0x28, 0x81, 0x48, 0xc4, 0x85,
+ 0x42, 0xb8, 0x81, 0x6d, 0xdc, 0xd5, 0x80,
+};
+
+static const uint8_t unicode_prop_Diacritic_table[332] = {
+ 0xdd, 0x00, 0x80, 0xc6, 0x05, 0x03, 0x01, 0x81,
+ 0x41, 0xf6, 0x40, 0x9e, 0x07, 0x25, 0x90, 0x0b,
+ 0x80, 0x88, 0x81, 0x40, 0xfc, 0x84, 0x40, 0xd0,
+ 0x80, 0xb6, 0x90, 0x80, 0x9a, 0x00, 0x01, 0x00,
+ 0x40, 0x85, 0x3b, 0x81, 0x40, 0x85, 0x0b, 0x0a,
+ 0x82, 0xc2, 0x9a, 0xda, 0x8a, 0xb9, 0x8a, 0xa1,
+ 0x81, 0x40, 0xc8, 0x9b, 0xbc, 0x80, 0x8f, 0x02,
+ 0x83, 0x9b, 0x80, 0xc9, 0x80, 0x8f, 0x80, 0xed,
+ 0x80, 0x8f, 0x80, 0xed, 0x80, 0x8f, 0x80, 0xae,
+ 0x82, 0xbb, 0x80, 0x8f, 0x80, 0xfe, 0x80, 0xfe,
+ 0x80, 0xed, 0x80, 0x8f, 0x80, 0xec, 0x81, 0x8f,
+ 0x80, 0xfb, 0x80, 0xfb, 0x28, 0x80, 0xf8, 0x84,
+ 0xca, 0x81, 0x9a, 0x00, 0x00, 0x03, 0x81, 0xc1,
+ 0x10, 0x81, 0xbd, 0x80, 0xef, 0x00, 0x81, 0xcb,
+ 0x30, 0x80, 0x89, 0x81, 0x47, 0x2c, 0x8a, 0x88,
+ 0x80, 0x41, 0x5a, 0x82, 0x41, 0x38, 0x39, 0x80,
+ 0xaf, 0x8d, 0xf5, 0x80, 0x8e, 0x80, 0xa5, 0x88,
+ 0xb5, 0x81, 0x40, 0x89, 0x81, 0xbf, 0x85, 0xd1,
+ 0x98, 0x18, 0x28, 0x0a, 0xb1, 0xbe, 0xd8, 0x8b,
+ 0xa4, 0x22, 0x82, 0x41, 0xbc, 0x00, 0x82, 0x8a,
+ 0x82, 0x8c, 0x82, 0x8c, 0x82, 0x8c, 0x81, 0x4c,
+ 0xef, 0x82, 0x41, 0x3c, 0x80, 0x41, 0xf9, 0x85,
+ 0xe8, 0x83, 0xde, 0x80, 0x60, 0x75, 0x71, 0x80,
+ 0x8b, 0x08, 0x80, 0x9b, 0x81, 0xd1, 0x81, 0xa4,
+ 0x8a, 0xe5, 0x80, 0xee, 0x81, 0x40, 0xc9, 0x80,
+ 0x9a, 0x91, 0xb8, 0x83, 0xa3, 0x80, 0xde, 0x80,
+ 0x8b, 0x80, 0xa3, 0x80, 0x40, 0x94, 0x82, 0xc0,
+ 0x83, 0xb2, 0x80, 0xe3, 0x84, 0x40, 0x8b, 0x81,
+ 0x60, 0x4f, 0x2f, 0x80, 0x43, 0x00, 0x8f, 0x41,
+ 0x0d, 0x00, 0x80, 0xae, 0x80, 0xac, 0x81, 0xc2,
+ 0x80, 0x42, 0xfb, 0x80, 0x48, 0x03, 0x81, 0x42,
+ 0x3a, 0x85, 0x42, 0x1d, 0x8a, 0x41, 0x67, 0x81,
+ 0xf7, 0x81, 0xbd, 0x80, 0xcb, 0x80, 0x88, 0x82,
+ 0xe7, 0x81, 0x40, 0xb1, 0x81, 0xd0, 0x80, 0x8f,
+ 0x80, 0x97, 0x32, 0x84, 0x40, 0xcc, 0x02, 0x80,
+ 0xfa, 0x81, 0x40, 0xfa, 0x81, 0xfd, 0x80, 0xf5,
+ 0x81, 0xf2, 0x80, 0x41, 0x0c, 0x81, 0x41, 0xf8,
+ 0x80, 0x91, 0x80, 0xd0, 0x80, 0x41, 0xa4, 0x80,
+ 0x41, 0x01, 0x00, 0x81, 0xd0, 0x80, 0x60, 0x4d,
+ 0x57, 0x84, 0x44, 0x99, 0x90, 0x60, 0x61, 0xc6,
+ 0x12, 0x2f, 0x39, 0x86, 0x9d, 0x83, 0x57, 0x21,
+ 0x86, 0xec, 0x10, 0x82,
+};
+
+static const uint8_t unicode_prop_Extender_table[82] = {
+ 0x40, 0xb6, 0x80, 0x42, 0x17, 0x81, 0x43, 0x6d,
+ 0x80, 0x41, 0xb8, 0x80, 0x46, 0x4a, 0x80, 0xfe,
+ 0x80, 0x49, 0x42, 0x80, 0xb7, 0x80, 0x42, 0x62,
+ 0x80, 0x41, 0x8d, 0x80, 0xc3, 0x80, 0x53, 0x88,
+ 0x80, 0xaa, 0x84, 0xe6, 0x81, 0xdc, 0x82, 0x60,
+ 0x6f, 0x15, 0x80, 0x45, 0xf5, 0x80, 0x43, 0xc1,
+ 0x80, 0x95, 0x80, 0x40, 0x88, 0x80, 0xeb, 0x80,
+ 0x94, 0x81, 0x60, 0x54, 0x7a, 0x80, 0x53, 0xeb,
+ 0x80, 0x42, 0x67, 0x82, 0x44, 0xce, 0x80, 0x60,
+ 0x50, 0xa8, 0x81, 0x44, 0x9b, 0x81, 0x60, 0x79,
+ 0x61, 0x82,
+};
+
+static const uint8_t unicode_prop_Hex_Digit_table[12] = {
+ 0xaf, 0x89, 0x35, 0x99, 0x85, 0x60, 0xfe, 0xa8,
+ 0x89, 0x35, 0x99, 0x85,
+};
+
+static const uint8_t unicode_prop_IDS_Binary_Operator_table[5] = {
+ 0x60, 0x2f, 0xef, 0x09, 0x87,
+};
+
+static const uint8_t unicode_prop_IDS_Trinary_Operator_table[4] = {
+ 0x60, 0x2f, 0xf1, 0x81,
+};
+
+static const uint8_t unicode_prop_Ideographic_table[58] = {
+ 0x60, 0x30, 0x05, 0x81, 0x98, 0x88, 0x8d, 0x82,
+ 0x43, 0xc4, 0x59, 0xb5, 0xc9, 0x60, 0x51, 0xef,
+ 0x60, 0x59, 0x0f, 0x41, 0x6d, 0x81, 0xe9, 0x60,
+ 0x75, 0x25, 0x57, 0xf1, 0x8d, 0x42, 0xf2, 0x60,
+ 0x26, 0x7c, 0x41, 0x8b, 0x60, 0x4d, 0x03, 0x60,
+ 0xa6, 0xd6, 0xa8, 0x50, 0x34, 0x8a, 0x40, 0xdd,
+ 0x81, 0x56, 0x81, 0x8d, 0x5d, 0x30, 0x4c, 0x1e,
+ 0x42, 0x1d,
+};
+
+static const uint8_t unicode_prop_Join_Control_table[4] = {
+ 0x60, 0x20, 0x0b, 0x81,
+};
+
+static const uint8_t unicode_prop_Logical_Order_Exception_table[15] = {
+ 0x4e, 0x3f, 0x84, 0xfa, 0x84, 0x4a, 0xef, 0x11,
+ 0x80, 0x60, 0x90, 0xf9, 0x09, 0x00, 0x81,
+};
+
+static const uint8_t unicode_prop_Noncharacter_Code_Point_table[71] = {
+ 0x60, 0xfd, 0xcf, 0x9f, 0x42, 0x0d, 0x81, 0x60,
+ 0xff, 0xfd, 0x81, 0x60, 0xff, 0xfd, 0x81, 0x60,
+ 0xff, 0xfd, 0x81, 0x60, 0xff, 0xfd, 0x81, 0x60,
+ 0xff, 0xfd, 0x81, 0x60, 0xff, 0xfd, 0x81, 0x60,
+ 0xff, 0xfd, 0x81, 0x60, 0xff, 0xfd, 0x81, 0x60,
+ 0xff, 0xfd, 0x81, 0x60, 0xff, 0xfd, 0x81, 0x60,
+ 0xff, 0xfd, 0x81, 0x60, 0xff, 0xfd, 0x81, 0x60,
+ 0xff, 0xfd, 0x81, 0x60, 0xff, 0xfd, 0x81, 0x60,
+ 0xff, 0xfd, 0x81, 0x60, 0xff, 0xfd, 0x81,
+};
+
+static const uint8_t unicode_prop_Pattern_Syntax_table[58] = {
+ 0xa0, 0x8e, 0x89, 0x86, 0x99, 0x18, 0x80, 0x99,
+ 0x83, 0xa1, 0x30, 0x00, 0x08, 0x00, 0x0b, 0x03,
+ 0x02, 0x80, 0x96, 0x80, 0x9e, 0x80, 0x5f, 0x17,
+ 0x97, 0x87, 0x8e, 0x81, 0x92, 0x80, 0x89, 0x41,
+ 0x30, 0x42, 0xcf, 0x40, 0x9f, 0x42, 0x75, 0x9d,
+ 0x44, 0x6b, 0x41, 0xff, 0xff, 0x41, 0x80, 0x13,
+ 0x98, 0x8e, 0x80, 0x60, 0xcd, 0x0c, 0x81, 0x41,
+ 0x04, 0x81,
+};
+
+static const uint8_t unicode_prop_Pattern_White_Space_table[11] = {
+ 0x88, 0x84, 0x91, 0x80, 0xe3, 0x80, 0x5f, 0x87,
+ 0x81, 0x97, 0x81,
+};
+
+static const uint8_t unicode_prop_Quotation_Mark_table[31] = {
+ 0xa1, 0x03, 0x80, 0x40, 0x82, 0x80, 0x8e, 0x80,
+ 0x5f, 0x5b, 0x87, 0x98, 0x81, 0x4e, 0x06, 0x80,
+ 0x41, 0xc8, 0x83, 0x8c, 0x82, 0x60, 0xce, 0x20,
+ 0x83, 0x40, 0xbc, 0x03, 0x80, 0xd9, 0x81,
+};
+
+static const uint8_t unicode_prop_Radical_table[9] = {
+ 0x60, 0x2e, 0x7f, 0x99, 0x80, 0xd8, 0x8b, 0x40,
+ 0xd5,
+};
+
+static const uint8_t unicode_prop_Regional_Indicator_table[4] = {
+ 0x61, 0xf1, 0xe5, 0x99,
+};
+
+static const uint8_t unicode_prop_Sentence_Terminal_table[184] = {
+ 0xa0, 0x80, 0x8b, 0x80, 0x8f, 0x80, 0x45, 0x48,
+ 0x80, 0x40, 0x93, 0x81, 0x40, 0xb3, 0x80, 0xaa,
+ 0x82, 0x40, 0xf5, 0x80, 0xbc, 0x00, 0x02, 0x81,
+ 0x41, 0x24, 0x81, 0x46, 0xe3, 0x81, 0x43, 0x15,
+ 0x03, 0x81, 0x43, 0x04, 0x80, 0x40, 0xc5, 0x81,
+ 0x40, 0xcb, 0x04, 0x80, 0x41, 0x39, 0x81, 0x41,
+ 0x61, 0x83, 0x40, 0xad, 0x09, 0x81, 0x40, 0xda,
+ 0x81, 0xc0, 0x81, 0x43, 0xbb, 0x81, 0x88, 0x82,
+ 0x4d, 0xe3, 0x80, 0x8c, 0x80, 0x41, 0xc4, 0x80,
+ 0x60, 0x74, 0xfb, 0x80, 0x41, 0x0d, 0x81, 0x40,
+ 0xe2, 0x02, 0x80, 0x41, 0x7d, 0x81, 0xd5, 0x81,
+ 0xde, 0x80, 0x40, 0x97, 0x81, 0x40, 0x92, 0x82,
+ 0x40, 0x8f, 0x81, 0x40, 0xf8, 0x80, 0x60, 0x52,
+ 0x65, 0x02, 0x81, 0x40, 0xa8, 0x80, 0x8b, 0x80,
+ 0x8f, 0x80, 0xc0, 0x80, 0x4a, 0xf3, 0x81, 0x44,
+ 0xfc, 0x84, 0x40, 0xec, 0x81, 0xf4, 0x83, 0xfe,
+ 0x82, 0x40, 0x80, 0x0d, 0x80, 0x8f, 0x81, 0xd7,
+ 0x08, 0x81, 0xeb, 0x80, 0x41, 0xa0, 0x81, 0x41,
+ 0x74, 0x0c, 0x8e, 0xe8, 0x81, 0x40, 0xf8, 0x82,
+ 0x43, 0x02, 0x81, 0xd6, 0x81, 0x41, 0xa3, 0x81,
+ 0x42, 0xb3, 0x81, 0x60, 0x4b, 0x74, 0x81, 0x40,
+ 0x84, 0x80, 0xc0, 0x81, 0x8a, 0x80, 0x43, 0x52,
+ 0x80, 0x60, 0x4e, 0x05, 0x80, 0x5d, 0xe7, 0x80,
+};
+
+static const uint8_t unicode_prop_Soft_Dotted_table[71] = {
+ 0xe8, 0x81, 0x40, 0xc3, 0x80, 0x41, 0x18, 0x80,
+ 0x9d, 0x80, 0xb3, 0x80, 0x93, 0x80, 0x41, 0x3f,
+ 0x80, 0xe1, 0x00, 0x80, 0x59, 0x08, 0x80, 0xb2,
+ 0x80, 0x8c, 0x02, 0x80, 0x40, 0x83, 0x80, 0x40,
+ 0x9c, 0x80, 0x41, 0xa4, 0x80, 0x40, 0xd5, 0x81,
+ 0x4b, 0x31, 0x80, 0x61, 0xa7, 0xa4, 0x81, 0xb1,
+ 0x81, 0xb1, 0x81, 0xb1, 0x81, 0xb1, 0x81, 0xb1,
+ 0x81, 0xb1, 0x81, 0xb1, 0x81, 0xb1, 0x81, 0xb1,
+ 0x81, 0xb1, 0x81, 0xb1, 0x81, 0xb1, 0x81,
+};
+
+static const uint8_t unicode_prop_Terminal_Punctuation_table[237] = {
+ 0xa0, 0x80, 0x89, 0x00, 0x80, 0x8a, 0x0a, 0x80,
+ 0x43, 0x3d, 0x07, 0x80, 0x42, 0x00, 0x80, 0xb8,
+ 0x80, 0xc7, 0x80, 0x8d, 0x01, 0x81, 0x40, 0xb3,
+ 0x80, 0xaa, 0x8a, 0x00, 0x40, 0xea, 0x81, 0xb5,
+ 0x8e, 0x9e, 0x80, 0x41, 0x04, 0x81, 0x44, 0xf3,
+ 0x81, 0x40, 0xab, 0x03, 0x85, 0x41, 0x36, 0x81,
+ 0x43, 0x14, 0x87, 0x43, 0x03, 0x81, 0xfb, 0x82,
+ 0xc6, 0x81, 0x40, 0x9c, 0x12, 0x80, 0xa6, 0x19,
+ 0x81, 0x41, 0x39, 0x81, 0x41, 0x61, 0x83, 0x40,
+ 0xad, 0x08, 0x82, 0x40, 0xda, 0x84, 0xbd, 0x81,
+ 0x43, 0xbb, 0x81, 0x88, 0x82, 0x4d, 0xe3, 0x80,
+ 0x8c, 0x03, 0x80, 0x89, 0x00, 0x80, 0x41, 0xb1,
+ 0x81, 0x60, 0x74, 0xfa, 0x81, 0x41, 0x0c, 0x82,
+ 0x40, 0xe2, 0x84, 0x41, 0x7d, 0x81, 0xd5, 0x81,
+ 0xde, 0x80, 0x40, 0x96, 0x82, 0x40, 0x92, 0x82,
+ 0xfe, 0x80, 0x8f, 0x81, 0x40, 0xf8, 0x80, 0x60,
+ 0x52, 0x63, 0x10, 0x83, 0x40, 0xa8, 0x80, 0x89,
+ 0x00, 0x80, 0x8a, 0x0a, 0x80, 0xc0, 0x01, 0x80,
+ 0x44, 0x39, 0x80, 0xaf, 0x80, 0x44, 0x85, 0x80,
+ 0x40, 0xc6, 0x80, 0x41, 0x35, 0x81, 0x40, 0x97,
+ 0x85, 0xc3, 0x85, 0xd8, 0x83, 0x43, 0xb7, 0x84,
+ 0x40, 0xec, 0x86, 0xef, 0x83, 0xfe, 0x82, 0x40,
+ 0x80, 0x0d, 0x80, 0x8f, 0x81, 0xd7, 0x84, 0xeb,
+ 0x80, 0x41, 0xa0, 0x82, 0x8c, 0x80, 0x41, 0x65,
+ 0x1a, 0x8e, 0xe8, 0x81, 0x40, 0xf8, 0x82, 0x43,
+ 0x02, 0x81, 0xd6, 0x0b, 0x81, 0x41, 0x9d, 0x82,
+ 0xac, 0x80, 0x42, 0x84, 0x81, 0x45, 0x76, 0x84,
+ 0x60, 0x45, 0xf8, 0x81, 0x40, 0x84, 0x80, 0xc0,
+ 0x82, 0x89, 0x80, 0x43, 0x51, 0x81, 0x60, 0x4e,
+ 0x05, 0x80, 0x5d, 0xe6, 0x83,
+};
+
+static const uint8_t unicode_prop_Unified_Ideograph_table[38] = {
+ 0x60, 0x33, 0xff, 0x59, 0xb5, 0xc9, 0x60, 0x51,
+ 0xef, 0x60, 0x5a, 0x1d, 0x08, 0x00, 0x81, 0x89,
+ 0x00, 0x00, 0x09, 0x82, 0x61, 0x05, 0xd5, 0x60,
+ 0xa6, 0xd6, 0xa8, 0x50, 0x34, 0x8a, 0x40, 0xdd,
+ 0x81, 0x56, 0x81, 0x8d, 0x5d, 0x30,
+};
+
+static const uint8_t unicode_prop_Variation_Selector_table[12] = {
+ 0x58, 0x0a, 0x82, 0x60, 0xe5, 0xf1, 0x8f, 0x6d,
+ 0x02, 0xef, 0x40, 0xef,
+};
+
+static const uint8_t unicode_prop_White_Space_table[22] = {
+ 0x88, 0x84, 0x91, 0x80, 0xe3, 0x80, 0x99, 0x80,
+ 0x55, 0xde, 0x80, 0x49, 0x7e, 0x8a, 0x9c, 0x0c,
+ 0x80, 0xae, 0x80, 0x4f, 0x9f, 0x80,
+};
+
+static const uint8_t unicode_prop_Bidi_Mirrored_table[171] = {
+ 0xa7, 0x81, 0x91, 0x00, 0x80, 0x9b, 0x00, 0x80,
+ 0x9c, 0x00, 0x80, 0xac, 0x80, 0x8e, 0x80, 0x4e,
+ 0x7d, 0x83, 0x47, 0x5c, 0x81, 0x49, 0x9b, 0x81,
+ 0x89, 0x81, 0xb5, 0x81, 0x8d, 0x81, 0x40, 0xb0,
+ 0x80, 0x40, 0xbf, 0x1a, 0x2a, 0x02, 0x0a, 0x18,
+ 0x18, 0x00, 0x03, 0x88, 0x20, 0x80, 0x91, 0x23,
+ 0x88, 0x08, 0x00, 0x39, 0x9e, 0x0b, 0x20, 0x88,
+ 0x09, 0x92, 0x21, 0x88, 0x21, 0x0b, 0x97, 0x81,
+ 0x8f, 0x3b, 0x93, 0x0e, 0x81, 0x44, 0x3c, 0x8d,
+ 0xc9, 0x01, 0x18, 0x08, 0x14, 0x1c, 0x12, 0x8d,
+ 0x41, 0x92, 0x95, 0x0d, 0x80, 0x8d, 0x38, 0x35,
+ 0x10, 0x1c, 0x01, 0x0c, 0x18, 0x02, 0x09, 0x89,
+ 0x29, 0x81, 0x8b, 0x92, 0x03, 0x08, 0x00, 0x08,
+ 0x03, 0x21, 0x2a, 0x97, 0x81, 0x8a, 0x0b, 0x18,
+ 0x09, 0x0b, 0xaa, 0x0f, 0x80, 0xa7, 0x20, 0x00,
+ 0x14, 0x22, 0x18, 0x14, 0x00, 0x40, 0xff, 0x80,
+ 0x42, 0x02, 0x1a, 0x08, 0x81, 0x8d, 0x09, 0x89,
+ 0x41, 0xdd, 0x89, 0x0f, 0x60, 0xce, 0x3c, 0x2c,
+ 0x81, 0x40, 0xa1, 0x81, 0x91, 0x00, 0x80, 0x9b,
+ 0x00, 0x80, 0x9c, 0x00, 0x00, 0x08, 0x81, 0x60,
+ 0xd7, 0x76, 0x80, 0xb8, 0x80, 0xb8, 0x80, 0xb8,
+ 0x80, 0xb8, 0x80,
+};
+
+static const uint8_t unicode_prop_Emoji_table[227] = {
+ 0xa2, 0x05, 0x04, 0x89, 0xee, 0x03, 0x80, 0x5f,
+ 0x8c, 0x80, 0x8b, 0x80, 0x40, 0xd7, 0x80, 0x95,
+ 0x80, 0xd9, 0x85, 0x8e, 0x81, 0x41, 0x6e, 0x81,
+ 0x8b, 0x80, 0x40, 0xa5, 0x80, 0x98, 0x8a, 0x1a,
+ 0x40, 0xc6, 0x80, 0x40, 0xe6, 0x81, 0x89, 0x80,
+ 0x88, 0x80, 0xb9, 0x18, 0x84, 0x88, 0x01, 0x01,
+ 0x09, 0x03, 0x01, 0x00, 0x09, 0x02, 0x02, 0x0f,
+ 0x14, 0x00, 0x04, 0x8b, 0x8a, 0x09, 0x00, 0x08,
+ 0x80, 0x91, 0x01, 0x81, 0x91, 0x28, 0x00, 0x0a,
+ 0x0f, 0x0b, 0x81, 0x8a, 0x0c, 0x09, 0x04, 0x08,
+ 0x00, 0x81, 0x93, 0x0c, 0x28, 0x19, 0x03, 0x01,
+ 0x01, 0x28, 0x01, 0x00, 0x00, 0x05, 0x02, 0x05,
+ 0x80, 0x89, 0x81, 0x8e, 0x01, 0x03, 0x00, 0x03,
+ 0x10, 0x80, 0x8a, 0x81, 0xaf, 0x82, 0x88, 0x80,
+ 0x8d, 0x80, 0x8d, 0x80, 0x41, 0x73, 0x81, 0x41,
+ 0xce, 0x82, 0x92, 0x81, 0xb2, 0x03, 0x80, 0x44,
+ 0xd9, 0x80, 0x8b, 0x80, 0x42, 0x58, 0x00, 0x80,
+ 0x61, 0xbd, 0x69, 0x80, 0x40, 0xc9, 0x80, 0x40,
+ 0x9f, 0x81, 0x8b, 0x81, 0x8d, 0x01, 0x89, 0xca,
+ 0x99, 0x01, 0x96, 0x80, 0x93, 0x01, 0x88, 0x94,
+ 0x81, 0x40, 0xad, 0xa1, 0x81, 0xef, 0x09, 0x02,
+ 0x81, 0xd2, 0x0a, 0x80, 0x41, 0x06, 0x80, 0xbe,
+ 0x8a, 0x28, 0x97, 0x31, 0x0f, 0x8b, 0x01, 0x19,
+ 0x03, 0x81, 0x8c, 0x09, 0x07, 0x81, 0x88, 0x04,
+ 0x82, 0x8b, 0x17, 0x11, 0x00, 0x03, 0x05, 0x02,
+ 0x05, 0xd5, 0xaf, 0xc5, 0x27, 0x8c, 0x2a, 0x00,
+ 0x0a, 0x01, 0x86, 0x42, 0x15, 0xaa, 0x02, 0x05,
+ 0x80, 0xa9, 0x0b, 0x10, 0x80, 0xa6, 0x8c, 0x89,
+ 0x2a, 0x8c, 0xaf,
+};
+
+static const uint8_t unicode_prop_Emoji_Component_table[28] = {
+ 0xa2, 0x05, 0x04, 0x89, 0x5f, 0xd2, 0x80, 0x40,
+ 0xd4, 0x80, 0x60, 0xdd, 0x2a, 0x80, 0x60, 0xf3,
+ 0xd5, 0x99, 0x41, 0xfa, 0x84, 0x45, 0xaf, 0x83,
+ 0x6c, 0x06, 0x6b, 0xdf,
+};
+
+static const uint8_t unicode_prop_Emoji_Modifier_table[4] = {
+ 0x61, 0xf3, 0xfa, 0x84,
+};
+
+static const uint8_t unicode_prop_Emoji_Modifier_Base_table[61] = {
+ 0x60, 0x26, 0x1c, 0x80, 0x40, 0xda, 0x80, 0x8f,
+ 0x83, 0x61, 0xcc, 0x76, 0x80, 0xbb, 0x11, 0x01,
+ 0x82, 0xf4, 0x09, 0x8a, 0x94, 0x1b, 0x00, 0x88,
+ 0x10, 0x1a, 0x02, 0xa1, 0x80, 0x40, 0xc8, 0x0b,
+ 0x80, 0x94, 0x03, 0x81, 0x40, 0xad, 0x12, 0x84,
+ 0xd2, 0x80, 0x8f, 0x82, 0x88, 0x80, 0x8a, 0x80,
+ 0x42, 0x4a, 0x20, 0x0d, 0x80, 0x88, 0x89, 0x11,
+ 0xf5, 0x08, 0x81, 0x96, 0x8c,
+};
+
+static const uint8_t unicode_prop_Emoji_Presentation_table[134] = {
+ 0x60, 0x23, 0x19, 0x81, 0x40, 0xcc, 0x1a, 0x01,
+ 0x80, 0x42, 0x08, 0x81, 0x94, 0x81, 0xb1, 0x8b,
+ 0xaa, 0x80, 0x92, 0x80, 0x8c, 0x07, 0x81, 0x90,
+ 0x0c, 0x0f, 0x04, 0x80, 0x94, 0x06, 0x08, 0x03,
+ 0x01, 0x06, 0x03, 0x81, 0x9b, 0x80, 0xa2, 0x00,
+ 0x03, 0x10, 0x80, 0xbc, 0x82, 0x97, 0x80, 0x8d,
+ 0x80, 0x43, 0x5a, 0x81, 0xb2, 0x03, 0x80, 0x61,
+ 0xc4, 0xad, 0x80, 0x40, 0xc9, 0x80, 0x40, 0xbd,
+ 0x01, 0x89, 0xca, 0x99, 0x00, 0x97, 0x80, 0x93,
+ 0x01, 0x20, 0x82, 0x94, 0x81, 0x40, 0xad, 0xa0,
+ 0x8b, 0x88, 0x80, 0xc5, 0x80, 0x95, 0x8b, 0xaa,
+ 0x1c, 0x8b, 0x90, 0x10, 0x82, 0xc6, 0x00, 0x80,
+ 0x40, 0xba, 0x81, 0xbe, 0x8c, 0x18, 0x97, 0x91,
+ 0x80, 0x99, 0x81, 0x8c, 0x80, 0xd5, 0xd4, 0xaf,
+ 0xc5, 0x28, 0x12, 0x97, 0x0e, 0x85, 0x42, 0x15,
+ 0xaa, 0x02, 0x05, 0x80, 0xa9, 0x0b, 0x10, 0x80,
+ 0xa6, 0x8c, 0x89, 0x2a, 0x8c, 0xaf,
+};
+
+static const uint8_t unicode_prop_Extended_Pictographic_table[152] = {
+ 0x40, 0xa8, 0x03, 0x80, 0x5f, 0x8c, 0x80, 0x8b,
+ 0x80, 0x40, 0xd7, 0x80, 0x95, 0x80, 0xd9, 0x85,
+ 0x8e, 0x81, 0x41, 0x6e, 0x81, 0x8b, 0x80, 0xde,
+ 0x80, 0xc5, 0x80, 0x98, 0x8a, 0x1a, 0x40, 0xc6,
+ 0x80, 0x40, 0xe6, 0x81, 0x89, 0x80, 0x88, 0x80,
+ 0xb9, 0x18, 0x28, 0x8b, 0x80, 0xf1, 0x89, 0xf5,
+ 0x81, 0x8a, 0x00, 0x00, 0x28, 0x10, 0x28, 0x89,
+ 0x81, 0x8e, 0x01, 0x03, 0x00, 0x03, 0x10, 0x80,
+ 0x8a, 0x84, 0xac, 0x82, 0x88, 0x80, 0x8d, 0x80,
+ 0x8d, 0x80, 0x41, 0x73, 0x81, 0x41, 0xce, 0x82,
+ 0x92, 0x81, 0xb2, 0x03, 0x80, 0x44, 0xd9, 0x80,
+ 0x8b, 0x80, 0x42, 0x58, 0x00, 0x80, 0x61, 0xbd,
+ 0x65, 0x40, 0xff, 0x8c, 0x82, 0x9e, 0x80, 0xbb,
+ 0x85, 0x8b, 0x81, 0x8d, 0x01, 0x89, 0x91, 0xb8,
+ 0x9a, 0x8e, 0x89, 0x80, 0x93, 0x01, 0x88, 0x03,
+ 0x88, 0x41, 0xb1, 0x84, 0x41, 0x3d, 0x87, 0x41,
+ 0x09, 0xaf, 0xff, 0xf3, 0x8b, 0xd4, 0xaa, 0x8b,
+ 0x83, 0xb7, 0x87, 0x89, 0x85, 0xa7, 0x87, 0x9d,
+ 0xd1, 0x8b, 0xae, 0x80, 0x89, 0x80, 0x46, 0xb6,
+};
+
+static const uint8_t unicode_prop_Default_Ignorable_Code_Point_table[51] = {
+ 0x40, 0xac, 0x80, 0x42, 0xa0, 0x80, 0x42, 0xcb,
+ 0x80, 0x4b, 0x41, 0x81, 0x46, 0x52, 0x81, 0xd4,
+ 0x83, 0x47, 0xfb, 0x84, 0x99, 0x84, 0xb0, 0x8f,
+ 0x50, 0xf3, 0x80, 0x60, 0xcc, 0x9a, 0x8f, 0x40,
+ 0xee, 0x80, 0x40, 0x9f, 0x80, 0xce, 0x88, 0x60,
+ 0xbc, 0xa6, 0x83, 0x54, 0xce, 0x87, 0x6c, 0x2e,
+ 0x84, 0x4f, 0xff,
+};
+
+typedef enum {
+ UNICODE_PROP_Hyphen,
+ UNICODE_PROP_Other_Math,
+ UNICODE_PROP_Other_Alphabetic,
+ UNICODE_PROP_Other_Lowercase,
+ UNICODE_PROP_Other_Uppercase,
+ UNICODE_PROP_Other_Grapheme_Extend,
+ UNICODE_PROP_Other_Default_Ignorable_Code_Point,
+ UNICODE_PROP_Other_ID_Start,
+ UNICODE_PROP_Other_ID_Continue,
+ UNICODE_PROP_Prepended_Concatenation_Mark,
+ UNICODE_PROP_ID_Continue1,
+ UNICODE_PROP_XID_Start1,
+ UNICODE_PROP_XID_Continue1,
+ UNICODE_PROP_Changes_When_Titlecased1,
+ UNICODE_PROP_Changes_When_Casefolded1,
+ UNICODE_PROP_Changes_When_NFKC_Casefolded1,
+ UNICODE_PROP_ASCII_Hex_Digit,
+ UNICODE_PROP_Bidi_Control,
+ UNICODE_PROP_Dash,
+ UNICODE_PROP_Deprecated,
+ UNICODE_PROP_Diacritic,
+ UNICODE_PROP_Extender,
+ UNICODE_PROP_Hex_Digit,
+ UNICODE_PROP_IDS_Binary_Operator,
+ UNICODE_PROP_IDS_Trinary_Operator,
+ UNICODE_PROP_Ideographic,
+ UNICODE_PROP_Join_Control,
+ UNICODE_PROP_Logical_Order_Exception,
+ UNICODE_PROP_Noncharacter_Code_Point,
+ UNICODE_PROP_Pattern_Syntax,
+ UNICODE_PROP_Pattern_White_Space,
+ UNICODE_PROP_Quotation_Mark,
+ UNICODE_PROP_Radical,
+ UNICODE_PROP_Regional_Indicator,
+ UNICODE_PROP_Sentence_Terminal,
+ UNICODE_PROP_Soft_Dotted,
+ UNICODE_PROP_Terminal_Punctuation,
+ UNICODE_PROP_Unified_Ideograph,
+ UNICODE_PROP_Variation_Selector,
+ UNICODE_PROP_White_Space,
+ UNICODE_PROP_Bidi_Mirrored,
+ UNICODE_PROP_Emoji,
+ UNICODE_PROP_Emoji_Component,
+ UNICODE_PROP_Emoji_Modifier,
+ UNICODE_PROP_Emoji_Modifier_Base,
+ UNICODE_PROP_Emoji_Presentation,
+ UNICODE_PROP_Extended_Pictographic,
+ UNICODE_PROP_Default_Ignorable_Code_Point,
+ UNICODE_PROP_ID_Start,
+ UNICODE_PROP_Case_Ignorable,
+ UNICODE_PROP_ASCII,
+ UNICODE_PROP_Alphabetic,
+ UNICODE_PROP_Any,
+ UNICODE_PROP_Assigned,
+ UNICODE_PROP_Cased,
+ UNICODE_PROP_Changes_When_Casefolded,
+ UNICODE_PROP_Changes_When_Casemapped,
+ UNICODE_PROP_Changes_When_Lowercased,
+ UNICODE_PROP_Changes_When_NFKC_Casefolded,
+ UNICODE_PROP_Changes_When_Titlecased,
+ UNICODE_PROP_Changes_When_Uppercased,
+ UNICODE_PROP_Grapheme_Base,
+ UNICODE_PROP_Grapheme_Extend,
+ UNICODE_PROP_ID_Continue,
+ UNICODE_PROP_Lowercase,
+ UNICODE_PROP_Math,
+ UNICODE_PROP_Uppercase,
+ UNICODE_PROP_XID_Continue,
+ UNICODE_PROP_XID_Start,
+ UNICODE_PROP_Cased1,
+ UNICODE_PROP_COUNT,
+} UnicodePropertyEnum;
+
+static const char unicode_prop_name_table[] =
+ "ASCII_Hex_Digit,AHex" "\0"
+ "Bidi_Control,Bidi_C" "\0"
+ "Dash" "\0"
+ "Deprecated,Dep" "\0"
+ "Diacritic,Dia" "\0"
+ "Extender,Ext" "\0"
+ "Hex_Digit,Hex" "\0"
+ "IDS_Binary_Operator,IDSB" "\0"
+ "IDS_Trinary_Operator,IDST" "\0"
+ "Ideographic,Ideo" "\0"
+ "Join_Control,Join_C" "\0"
+ "Logical_Order_Exception,LOE" "\0"
+ "Noncharacter_Code_Point,NChar" "\0"
+ "Pattern_Syntax,Pat_Syn" "\0"
+ "Pattern_White_Space,Pat_WS" "\0"
+ "Quotation_Mark,QMark" "\0"
+ "Radical" "\0"
+ "Regional_Indicator,RI" "\0"
+ "Sentence_Terminal,STerm" "\0"
+ "Soft_Dotted,SD" "\0"
+ "Terminal_Punctuation,Term" "\0"
+ "Unified_Ideograph,UIdeo" "\0"
+ "Variation_Selector,VS" "\0"
+ "White_Space,space" "\0"
+ "Bidi_Mirrored,Bidi_M" "\0"
+ "Emoji" "\0"
+ "Emoji_Component" "\0"
+ "Emoji_Modifier" "\0"
+ "Emoji_Modifier_Base" "\0"
+ "Emoji_Presentation" "\0"
+ "Extended_Pictographic" "\0"
+ "Default_Ignorable_Code_Point,DI" "\0"
+ "ID_Start,IDS" "\0"
+ "Case_Ignorable,CI" "\0"
+ "ASCII" "\0"
+ "Alphabetic,Alpha" "\0"
+ "Any" "\0"
+ "Assigned" "\0"
+ "Cased" "\0"
+ "Changes_When_Casefolded,CWCF" "\0"
+ "Changes_When_Casemapped,CWCM" "\0"
+ "Changes_When_Lowercased,CWL" "\0"
+ "Changes_When_NFKC_Casefolded,CWKCF" "\0"
+ "Changes_When_Titlecased,CWT" "\0"
+ "Changes_When_Uppercased,CWU" "\0"
+ "Grapheme_Base,Gr_Base" "\0"
+ "Grapheme_Extend,Gr_Ext" "\0"
+ "ID_Continue,IDC" "\0"
+ "Lowercase,Lower" "\0"
+ "Math" "\0"
+ "Uppercase,Upper" "\0"
+ "XID_Continue,XIDC" "\0"
+ "XID_Start,XIDS" "\0"
+;
+
+static const uint8_t * const unicode_prop_table[] = {
+ unicode_prop_Hyphen_table,
+ unicode_prop_Other_Math_table,
+ unicode_prop_Other_Alphabetic_table,
+ unicode_prop_Other_Lowercase_table,
+ unicode_prop_Other_Uppercase_table,
+ unicode_prop_Other_Grapheme_Extend_table,
+ unicode_prop_Other_Default_Ignorable_Code_Point_table,
+ unicode_prop_Other_ID_Start_table,
+ unicode_prop_Other_ID_Continue_table,
+ unicode_prop_Prepended_Concatenation_Mark_table,
+ unicode_prop_ID_Continue1_table,
+ unicode_prop_XID_Start1_table,
+ unicode_prop_XID_Continue1_table,
+ unicode_prop_Changes_When_Titlecased1_table,
+ unicode_prop_Changes_When_Casefolded1_table,
+ unicode_prop_Changes_When_NFKC_Casefolded1_table,
+ unicode_prop_ASCII_Hex_Digit_table,
+ unicode_prop_Bidi_Control_table,
+ unicode_prop_Dash_table,
+ unicode_prop_Deprecated_table,
+ unicode_prop_Diacritic_table,
+ unicode_prop_Extender_table,
+ unicode_prop_Hex_Digit_table,
+ unicode_prop_IDS_Binary_Operator_table,
+ unicode_prop_IDS_Trinary_Operator_table,
+ unicode_prop_Ideographic_table,
+ unicode_prop_Join_Control_table,
+ unicode_prop_Logical_Order_Exception_table,
+ unicode_prop_Noncharacter_Code_Point_table,
+ unicode_prop_Pattern_Syntax_table,
+ unicode_prop_Pattern_White_Space_table,
+ unicode_prop_Quotation_Mark_table,
+ unicode_prop_Radical_table,
+ unicode_prop_Regional_Indicator_table,
+ unicode_prop_Sentence_Terminal_table,
+ unicode_prop_Soft_Dotted_table,
+ unicode_prop_Terminal_Punctuation_table,
+ unicode_prop_Unified_Ideograph_table,
+ unicode_prop_Variation_Selector_table,
+ unicode_prop_White_Space_table,
+ unicode_prop_Bidi_Mirrored_table,
+ unicode_prop_Emoji_table,
+ unicode_prop_Emoji_Component_table,
+ unicode_prop_Emoji_Modifier_table,
+ unicode_prop_Emoji_Modifier_Base_table,
+ unicode_prop_Emoji_Presentation_table,
+ unicode_prop_Extended_Pictographic_table,
+ unicode_prop_Default_Ignorable_Code_Point_table,
+ unicode_prop_ID_Start_table,
+ unicode_prop_Case_Ignorable_table,
+};
+
+static const uint16_t unicode_prop_len_table[] = {
+ countof(unicode_prop_Hyphen_table),
+ countof(unicode_prop_Other_Math_table),
+ countof(unicode_prop_Other_Alphabetic_table),
+ countof(unicode_prop_Other_Lowercase_table),
+ countof(unicode_prop_Other_Uppercase_table),
+ countof(unicode_prop_Other_Grapheme_Extend_table),
+ countof(unicode_prop_Other_Default_Ignorable_Code_Point_table),
+ countof(unicode_prop_Other_ID_Start_table),
+ countof(unicode_prop_Other_ID_Continue_table),
+ countof(unicode_prop_Prepended_Concatenation_Mark_table),
+ countof(unicode_prop_ID_Continue1_table),
+ countof(unicode_prop_XID_Start1_table),
+ countof(unicode_prop_XID_Continue1_table),
+ countof(unicode_prop_Changes_When_Titlecased1_table),
+ countof(unicode_prop_Changes_When_Casefolded1_table),
+ countof(unicode_prop_Changes_When_NFKC_Casefolded1_table),
+ countof(unicode_prop_ASCII_Hex_Digit_table),
+ countof(unicode_prop_Bidi_Control_table),
+ countof(unicode_prop_Dash_table),
+ countof(unicode_prop_Deprecated_table),
+ countof(unicode_prop_Diacritic_table),
+ countof(unicode_prop_Extender_table),
+ countof(unicode_prop_Hex_Digit_table),
+ countof(unicode_prop_IDS_Binary_Operator_table),
+ countof(unicode_prop_IDS_Trinary_Operator_table),
+ countof(unicode_prop_Ideographic_table),
+ countof(unicode_prop_Join_Control_table),
+ countof(unicode_prop_Logical_Order_Exception_table),
+ countof(unicode_prop_Noncharacter_Code_Point_table),
+ countof(unicode_prop_Pattern_Syntax_table),
+ countof(unicode_prop_Pattern_White_Space_table),
+ countof(unicode_prop_Quotation_Mark_table),
+ countof(unicode_prop_Radical_table),
+ countof(unicode_prop_Regional_Indicator_table),
+ countof(unicode_prop_Sentence_Terminal_table),
+ countof(unicode_prop_Soft_Dotted_table),
+ countof(unicode_prop_Terminal_Punctuation_table),
+ countof(unicode_prop_Unified_Ideograph_table),
+ countof(unicode_prop_Variation_Selector_table),
+ countof(unicode_prop_White_Space_table),
+ countof(unicode_prop_Bidi_Mirrored_table),
+ countof(unicode_prop_Emoji_table),
+ countof(unicode_prop_Emoji_Component_table),
+ countof(unicode_prop_Emoji_Modifier_table),
+ countof(unicode_prop_Emoji_Modifier_Base_table),
+ countof(unicode_prop_Emoji_Presentation_table),
+ countof(unicode_prop_Extended_Pictographic_table),
+ countof(unicode_prop_Default_Ignorable_Code_Point_table),
+ countof(unicode_prop_ID_Start_table),
+ countof(unicode_prop_Case_Ignorable_table),
+};
+
+#endif /* CONFIG_ALL_UNICODE */
diff --git a/thirdparty/quickjs/quickjs-2019-07-09-dust3d/libunicode.c b/thirdparty/quickjs/quickjs-2019-07-09-dust3d/libunicode.c
new file mode 100755
index 00000000..f4ef5560
--- /dev/null
+++ b/thirdparty/quickjs/quickjs-2019-07-09-dust3d/libunicode.c
@@ -0,0 +1,1540 @@
+/*
+ * Unicode utilities
+ *
+ * Copyright (c) 2017-2018 Fabrice Bellard
+ *
+ * Permission is hereby granted, free of charge, to any person obtaining a copy
+ * of this software and associated documentation files (the "Software"), to deal
+ * in the Software without restriction, including without limitation the rights
+ * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+ * copies of the Software, and to permit persons to whom the Software is
+ * furnished to do so, subject to the following conditions:
+ *
+ * The above copyright notice and this permission notice shall be included in
+ * all copies or substantial portions of the Software.
+ *
+ * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+ * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+ * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
+ * THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+ * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+ * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
+ * THE SOFTWARE.
+ */
+#include
+#include
+#include
+#include
+#include
+
+#include "cutils.h"
+#include "libunicode.h"
+#include "libunicode-table.h"
+
+enum {
+ RUN_TYPE_U,
+ RUN_TYPE_L,
+ RUN_TYPE_UF,
+ RUN_TYPE_LF,
+ RUN_TYPE_UL,
+ RUN_TYPE_LSU,
+ RUN_TYPE_U2L_399_EXT2,
+ RUN_TYPE_UF_D20,
+ RUN_TYPE_UF_D1_EXT,
+ RUN_TYPE_U_EXT,
+ RUN_TYPE_LF_EXT,
+ RUN_TYPE_U_EXT2,
+ RUN_TYPE_L_EXT2,
+ RUN_TYPE_U_EXT3,
+};
+
+/* conv_type:
+ 0 = to upper
+ 1 = to lower
+ 2 = case folding (= to lower with modifications)
+*/
+int lre_case_conv(uint32_t *res, uint32_t c, int conv_type)
+{
+ if (c < 128) {
+ if (conv_type) {
+ if (c >= 'A' && c <= 'Z') {
+ c = c - 'A' + 'a';
+ }
+ } else {
+ if (c >= 'a' && c <= 'z') {
+ c = c - 'a' + 'A';
+ }
+ }
+ } else {
+ uint32_t v, code, data, type, len, a, is_lower;
+ int idx, idx_min, idx_max;
+
+ is_lower = (conv_type != 0);
+ idx_min = 0;
+ idx_max = countof(case_conv_table1) - 1;
+ while (idx_min <= idx_max) {
+ idx = (unsigned)(idx_max + idx_min) / 2;
+ v = case_conv_table1[idx];
+ code = v >> (32 - 17);
+ len = (v >> (32 - 17 - 7)) & 0x7f;
+ if (c < code) {
+ idx_max = idx - 1;
+ } else if (c >= code + len) {
+ idx_min = idx + 1;
+ } else {
+ type = (v >> (32 - 17 - 7 - 4)) & 0xf;
+ data = ((v & 0xf) << 8) | case_conv_table2[idx];
+ switch(type) {
+ case RUN_TYPE_U:
+ case RUN_TYPE_L:
+ case RUN_TYPE_UF:
+ case RUN_TYPE_LF:
+ if (conv_type == (type & 1) ||
+ (type >= RUN_TYPE_UF && conv_type == 2)) {
+ c = c - code + (case_conv_table1[data] >> (32 - 17));
+ }
+ break;
+ case RUN_TYPE_UL:
+ a = c - code;
+ if ((a & 1) != (1 - is_lower))
+ break;
+ c = (a ^ 1) + code;
+ break;
+ case RUN_TYPE_LSU:
+ a = c - code;
+ if (a == 1) {
+ c += 2 * is_lower - 1;
+ } else if (a == (1 - is_lower) * 2) {
+ c += (2 * is_lower - 1) * 2;
+ }
+ break;
+ case RUN_TYPE_U2L_399_EXT2:
+ if (!is_lower) {
+ res[0] = c - code + case_conv_ext[data >> 6];
+ res[1] = 0x399;
+ return 2;
+ } else {
+ c = c - code + case_conv_ext[data & 0x3f];
+ }
+ break;
+ case RUN_TYPE_UF_D20:
+ if (conv_type == 1)
+ break;
+ c = data + (conv_type == 2) * 0x20;
+ break;
+ case RUN_TYPE_UF_D1_EXT:
+ if (conv_type == 1)
+ break;
+ c = case_conv_ext[data] + (conv_type == 2);
+ break;
+ case RUN_TYPE_U_EXT:
+ case RUN_TYPE_LF_EXT:
+ if (is_lower != (type - RUN_TYPE_U_EXT))
+ break;
+ c = case_conv_ext[data];
+ break;
+ case RUN_TYPE_U_EXT2:
+ case RUN_TYPE_L_EXT2:
+ if (conv_type != (type - RUN_TYPE_U_EXT2))
+ break;
+ res[0] = c - code + case_conv_ext[data >> 6];
+ res[1] = case_conv_ext[data & 0x3f];
+ return 2;
+ default:
+ case RUN_TYPE_U_EXT3:
+ if (conv_type != 0)
+ break;
+ res[0] = case_conv_ext[data >> 8];
+ res[1] = case_conv_ext[(data >> 4) & 0xf];
+ res[2] = case_conv_ext[data & 0xf];
+ return 3;
+ }
+ break;
+ }
+ }
+ }
+ res[0] = c;
+ return 1;
+}
+
+static uint32_t get_le24(const uint8_t *ptr)
+{
+#if defined(__x86__) || defined(__x86_64__)
+ return *(uint16_t *)ptr | (ptr[2] << 16);
+#else
+ return ptr[0] | (ptr[1] << 8) | (ptr[2] << 16);
+#endif
+}
+
+#define UNICODE_INDEX_BLOCK_LEN 32
+
+/* return -1 if not in table, otherwise the offset in the block */
+static int get_index_pos(uint32_t *pcode, uint32_t c,
+ const uint8_t *index_table, int index_table_len)
+{
+ uint32_t code, v;
+ int idx_min, idx_max, idx;
+
+ idx_min = 0;
+ v = get_le24(index_table);
+ code = v & ((1 << 21) - 1);
+ if (c < code) {
+ *pcode = 0;
+ return 0;
+ }
+ idx_max = index_table_len - 1;
+ code = get_le24(index_table + idx_max * 3);
+ if (c >= code)
+ return -1;
+ /* invariant: tab[idx_min] <= c < tab2[idx_max] */
+ while ((idx_max - idx_min) > 1) {
+ idx = (idx_max + idx_min) / 2;
+ v = get_le24(index_table + idx * 3);
+ code = v & ((1 << 21) - 1);
+ if (c < code) {
+ idx_max = idx;
+ } else {
+ idx_min = idx;
+ }
+ }
+ v = get_le24(index_table + idx_min * 3);
+ *pcode = v & ((1 << 21) - 1);
+ return (idx_min + 1) * UNICODE_INDEX_BLOCK_LEN + (v >> 21);
+}
+
+static BOOL lre_is_in_table(uint32_t c, const uint8_t *table,
+ const uint8_t *index_table, int index_table_len)
+{
+ uint32_t code, b, bit;
+ int pos;
+ const uint8_t *p;
+
+ pos = get_index_pos(&code, c, index_table, index_table_len);
+ if (pos < 0)
+ return FALSE; /* outside the table */
+ p = table + pos;
+ bit = 0;
+ for(;;) {
+ b = *p++;
+ if (b < 64) {
+ code += (b >> 3) + 1;
+ if (c < code)
+ return bit;
+ bit ^= 1;
+ code += (b & 7) + 1;
+ } else if (b >= 0x80) {
+ code += b - 0x80 + 1;
+ } else if (b < 0x60) {
+ code += (((b - 0x40) << 8) | p[0]) + 1;
+ p++;
+ } else {
+ code += (((b - 0x60) << 16) | (p[0] << 8) | p[1]) + 1;
+ p += 2;
+ }
+ if (c < code)
+ return bit;
+ bit ^= 1;
+ }
+}
+
+BOOL lre_is_cased(uint32_t c)
+{
+ uint32_t v, code, len;
+ int idx, idx_min, idx_max;
+
+ idx_min = 0;
+ idx_max = countof(case_conv_table1) - 1;
+ while (idx_min <= idx_max) {
+ idx = (unsigned)(idx_max + idx_min) / 2;
+ v = case_conv_table1[idx];
+ code = v >> (32 - 17);
+ len = (v >> (32 - 17 - 7)) & 0x7f;
+ if (c < code) {
+ idx_max = idx - 1;
+ } else if (c >= code + len) {
+ idx_min = idx + 1;
+ } else {
+ return TRUE;
+ }
+ }
+ return lre_is_in_table(c, unicode_prop_Cased1_table,
+ unicode_prop_Cased1_index,
+ sizeof(unicode_prop_Cased1_index) / 3);
+}
+
+BOOL lre_is_case_ignorable(uint32_t c)
+{
+ return lre_is_in_table(c, unicode_prop_Case_Ignorable_table,
+ unicode_prop_Case_Ignorable_index,
+ sizeof(unicode_prop_Case_Ignorable_index) / 3);
+}
+
+/* character range */
+#if defined(_MSC_VER)
+static void cr_dump(CharRange *cr)
+#else
+static __attribute__((unused)) void cr_dump(CharRange *cr)
+#endif
+{
+ int i;
+ for(i = 0; i < cr->len; i++)
+ printf("%d: 0x%04x\n", i, cr->points[i]);
+}
+
+static void *cr_default_realloc(void *opaque, void *ptr, size_t size)
+{
+ return realloc(ptr, size);
+}
+
+void cr_init(CharRange *cr, void *mem_opaque, DynBufReallocFunc *realloc_func)
+{
+ cr->len = cr->size = 0;
+ cr->points = NULL;
+ cr->mem_opaque = mem_opaque;
+ cr->realloc_func = realloc_func ? realloc_func : cr_default_realloc;
+}
+
+void cr_free(CharRange *cr)
+{
+ cr->realloc_func(cr->mem_opaque, cr->points, 0);
+}
+
+int cr_realloc(CharRange *cr, int size)
+{
+ int new_size;
+ uint32_t *new_buf;
+
+ if (size > cr->size) {
+ new_size = max_int(size, cr->size * 3 / 2);
+ new_buf = cr->realloc_func(cr->mem_opaque, cr->points,
+ new_size * sizeof(cr->points[0]));
+ if (!new_buf)
+ return -1;
+ cr->points = new_buf;
+ cr->size = new_size;
+ }
+ return 0;
+}
+
+int cr_copy(CharRange *cr, const CharRange *cr1)
+{
+ if (cr_realloc(cr, cr1->len))
+ return -1;
+ memcpy(cr->points, cr1->points, sizeof(cr->points[0]) * cr1->len);
+ cr->len = cr1->len;
+ return 0;
+}
+
+/* merge consecutive intervals and remove empty intervals */
+static void cr_compress(CharRange *cr)
+{
+ int i, j, k, len;
+ uint32_t *pt;
+
+ pt = cr->points;
+ len = cr->len;
+ i = 0;
+ j = 0;
+ k = 0;
+ while ((i + 1) < len) {
+ if (pt[i] == pt[i + 1]) {
+ /* empty interval */
+ i += 2;
+ } else {
+ j = i;
+ while ((j + 3) < len && pt[j + 1] == pt[j + 2])
+ j += 2;
+ /* just copy */
+ pt[k] = pt[i];
+ pt[k + 1] = pt[j + 1];
+ k += 2;
+ i = j + 2;
+ }
+ }
+ cr->len = k;
+}
+
+/* union or intersection */
+int cr_op(CharRange *cr, const uint32_t *a_pt, int a_len,
+ const uint32_t *b_pt, int b_len, int op)
+{
+ int a_idx, b_idx, is_in;
+ uint32_t v;
+
+ a_idx = 0;
+ b_idx = 0;
+ for(;;) {
+ /* get one more point from a or b in increasing order */
+ if (a_idx < a_len && b_idx < b_len) {
+ if (a_pt[a_idx] < b_pt[b_idx]) {
+ goto a_add;
+ } else if (a_pt[a_idx] == b_pt[b_idx]) {
+ v = a_pt[a_idx];
+ a_idx++;
+ b_idx++;
+ } else {
+ goto b_add;
+ }
+ } else if (a_idx < a_len) {
+ a_add:
+ v = a_pt[a_idx++];
+ } else if (b_idx < b_len) {
+ b_add:
+ v = b_pt[b_idx++];
+ } else {
+ break;
+ }
+ /* add the point if the in/out status changes */
+ switch(op) {
+ case CR_OP_UNION:
+ is_in = (a_idx & 1) | (b_idx & 1);
+ break;
+ case CR_OP_INTER:
+ is_in = (a_idx & 1) & (b_idx & 1);
+ break;
+ case CR_OP_XOR:
+ is_in = (a_idx & 1) ^ (b_idx & 1);
+ break;
+ default:
+ abort();
+ }
+ if (is_in != (cr->len & 1)) {
+ if (cr_add_point(cr, v))
+ return -1;
+ }
+ }
+ cr_compress(cr);
+ return 0;
+}
+
+int cr_union1(CharRange *cr, const uint32_t *b_pt, int b_len)
+{
+ CharRange a = *cr;
+ int ret;
+ cr->len = 0;
+ cr->size = 0;
+ cr->points = NULL;
+ ret = cr_op(cr, a.points, a.len, b_pt, b_len, CR_OP_UNION);
+ cr_free(&a);
+ return ret;
+}
+
+int cr_invert(CharRange *cr)
+{
+ int len;
+ len = cr->len;
+ if (cr_realloc(cr, len + 2))
+ return -1;
+ memmove(cr->points + 1, cr->points, len * sizeof(cr->points[0]));
+ cr->points[0] = 0;
+ cr->points[len + 1] = UINT32_MAX;
+ cr->len = len + 2;
+ cr_compress(cr);
+ return 0;
+}
+
+#ifdef CONFIG_ALL_UNICODE
+
+BOOL lre_is_id_start(uint32_t c)
+{
+ return lre_is_in_table(c, unicode_prop_ID_Start_table,
+ unicode_prop_ID_Start_index,
+ sizeof(unicode_prop_ID_Start_index) / 3);
+}
+
+BOOL lre_is_id_continue(uint32_t c)
+{
+ return lre_is_id_start(c) ||
+ lre_is_in_table(c, unicode_prop_ID_Continue1_table,
+ unicode_prop_ID_Continue1_index,
+ sizeof(unicode_prop_ID_Continue1_index) / 3);
+}
+
+#define UNICODE_DECOMP_LEN_MAX 18
+
+typedef enum {
+ DECOMP_TYPE_C1, /* 16 bit char */
+ DECOMP_TYPE_L1, /* 16 bit char table */
+ DECOMP_TYPE_L2,
+ DECOMP_TYPE_L3,
+ DECOMP_TYPE_L4,
+ DECOMP_TYPE_L5, /* XXX: not used */
+ DECOMP_TYPE_L6, /* XXX: could remove */
+ DECOMP_TYPE_L7, /* XXX: could remove */
+ DECOMP_TYPE_LL1, /* 18 bit char table */
+ DECOMP_TYPE_LL2,
+ DECOMP_TYPE_S1, /* 8 bit char table */
+ DECOMP_TYPE_S2,
+ DECOMP_TYPE_S3,
+ DECOMP_TYPE_S4,
+ DECOMP_TYPE_S5,
+ DECOMP_TYPE_I1, /* increment 16 bit char value */
+ DECOMP_TYPE_I2_0,
+ DECOMP_TYPE_I2_1,
+ DECOMP_TYPE_I3_1,
+ DECOMP_TYPE_I3_2,
+ DECOMP_TYPE_I4_1,
+ DECOMP_TYPE_I4_2,
+ DECOMP_TYPE_B1, /* 16 bit base + 8 bit offset */
+ DECOMP_TYPE_B2,
+ DECOMP_TYPE_B3,
+ DECOMP_TYPE_B4,
+ DECOMP_TYPE_B5,
+ DECOMP_TYPE_B6,
+ DECOMP_TYPE_B7,
+ DECOMP_TYPE_B8,
+ DECOMP_TYPE_B18,
+ DECOMP_TYPE_LS2,
+ DECOMP_TYPE_PAT3,
+ DECOMP_TYPE_S2_UL,
+ DECOMP_TYPE_LS2_UL,
+} DecompTypeEnum;
+
+static uint32_t unicode_get_short_code(uint32_t c)
+{
+ static const uint16_t unicode_short_table[2] = { 0x2044, 0x2215 };
+
+ if (c < 0x80)
+ return c;
+ else if (c < 0x80 + 0x50)
+ return c - 0x80 + 0x300;
+ else
+ return unicode_short_table[c - 0x80 - 0x50];
+}
+
+static uint32_t unicode_get_lower_simple(uint32_t c)
+{
+ if (c < 0x100 || (c >= 0x410 && c <= 0x42f))
+ c += 0x20;
+ else
+ c++;
+ return c;
+}
+
+static uint16_t unicode_get16(const uint8_t *p)
+{
+ return p[0] | (p[1] << 8);
+}
+
+static int unicode_decomp_entry(uint32_t *res, uint32_t c,
+ int idx, uint32_t code, uint32_t len,
+ uint32_t type)
+{
+ uint32_t c1;
+ int l, i, p;
+ const uint8_t *d;
+
+ if (type == DECOMP_TYPE_C1) {
+ res[0] = unicode_decomp_table2[idx];
+ return 1;
+ } else {
+ d = unicode_decomp_data + unicode_decomp_table2[idx];
+ if (type >= DECOMP_TYPE_L1 && type <= DECOMP_TYPE_L7) {
+ l = type - DECOMP_TYPE_L1 + 1;
+ d += (c - code) * l * 2;
+ for(i = 0; i < l; i++) {
+ if ((res[i] = unicode_get16(d + 2 * i)) == 0)
+ return 0;
+ }
+ return l;
+ } else if (type >= DECOMP_TYPE_LL1 && type <= DECOMP_TYPE_LL2) {
+ {
+ uint32_t k, p;
+ l = type - DECOMP_TYPE_LL1 + 1;
+ k = (c - code) * l;
+ p = len * l * 2;
+ for(i = 0; i < l; i++) {
+ c1 = unicode_get16(d + 2 * k) |
+ (((d[p + (k / 4)] >> ((k % 4) * 2)) & 3) << 16);
+ if (!c1)
+ return 0;
+ res[i] = c1;
+ k++;
+ }
+ }
+ return l;
+ } else if (type >= DECOMP_TYPE_S1 && type <= DECOMP_TYPE_S5) {
+ l = type - DECOMP_TYPE_S1 + 1;
+ d += (c - code) * l;
+ for(i = 0; i < l; i++) {
+ if ((res[i] = unicode_get_short_code(d[i])) == 0)
+ return 0;
+ }
+ return l;
+ } else if (type == DECOMP_TYPE_I1) {
+ l = 1;
+ p = 0;
+ goto decomp_type_i;
+ } else if (type == DECOMP_TYPE_I2_0 ||
+ type == DECOMP_TYPE_I2_1 ||
+ type == DECOMP_TYPE_I3_1 ||
+ type == DECOMP_TYPE_I3_2 ||
+ type == DECOMP_TYPE_I4_1 ||
+ type == DECOMP_TYPE_I4_2) {
+ l = 2 + ((type - DECOMP_TYPE_I2_0) >> 1);
+ p = ((type - DECOMP_TYPE_I2_0) & 1) + (l > 2);
+ decomp_type_i:
+ for(i = 0; i < l; i++) {
+ c1 = unicode_get16(d + 2 * i);
+ if (i == p)
+ c1 += c - code;
+ res[i] = c1;
+ }
+ return l;
+ } else if (type == DECOMP_TYPE_B18) {
+ l = 18;
+ goto decomp_type_b;
+ } else if (type >= DECOMP_TYPE_B1 && type <= DECOMP_TYPE_B8) {
+ l = type - DECOMP_TYPE_B1 + 1;
+ decomp_type_b:
+ {
+ uint32_t c_min;
+ c_min = unicode_get16(d);
+ d += 2 + (c - code) * l;
+ for(i = 0; i < l; i++) {
+ c1 = d[i];
+ if (c1 == 0xff)
+ c1 = 0x20;
+ else
+ c1 += c_min;
+ res[i] = c1;
+ }
+ }
+ return l;
+ } else if (type == DECOMP_TYPE_LS2) {
+ d += (c - code) * 3;
+ if (!(res[0] = unicode_get16(d)))
+ return 0;
+ res[1] = unicode_get_short_code(d[2]);
+ return 2;
+ } else if (type == DECOMP_TYPE_PAT3) {
+ res[0] = unicode_get16(d);
+ res[2] = unicode_get16(d + 2);
+ d += 4 + (c - code) * 2;
+ res[1] = unicode_get16(d);
+ return 3;
+ } else if (type == DECOMP_TYPE_S2_UL ||
+ type == DECOMP_TYPE_LS2_UL) {
+ c1 = c - code;
+ if (type == DECOMP_TYPE_S2_UL) {
+ d += c1 & ~1;
+ c = unicode_get_short_code(*d);
+ d++;
+ } else {
+ d += (c1 >> 1) * 3;
+ c = unicode_get16(d);
+ d += 2;
+ }
+ if (c1 & 1)
+ c = unicode_get_lower_simple(c);
+ res[0] = c;
+ res[1] = unicode_get_short_code(*d);
+ return 2;
+ }
+ }
+ return 0;
+}
+
+
+/* return the length of the decomposition (length <=
+ UNICODE_DECOMP_LEN_MAX) or 0 if no decomposition */
+static int unicode_decomp_char(uint32_t *res, uint32_t c, BOOL is_compat1)
+{
+ uint32_t v, type, is_compat, code, len;
+ int idx_min, idx_max, idx;
+
+ idx_min = 0;
+ idx_max = countof(unicode_decomp_table1) - 1;
+ while (idx_min <= idx_max) {
+ idx = (idx_max + idx_min) / 2;
+ v = unicode_decomp_table1[idx];
+ code = v >> (32 - 18);
+ len = (v >> (32 - 18 - 7)) & 0x7f;
+ // printf("idx=%d code=%05x len=%d\n", idx, code, len);
+ if (c < code) {
+ idx_max = idx - 1;
+ } else if (c >= code + len) {
+ idx_min = idx + 1;
+ } else {
+ is_compat = v & 1;
+ if (is_compat1 < is_compat)
+ break;
+ type = (v >> (32 - 18 - 7 - 6)) & 0x3f;
+ return unicode_decomp_entry(res, c, idx, code, len, type);
+ }
+ }
+ return 0;
+}
+
+/* return 0 if no pair found */
+static int unicode_compose_pair(uint32_t c0, uint32_t c1)
+{
+ uint32_t code, len, type, v, idx1, d_idx, d_offset, ch;
+ int idx_min, idx_max, idx, d;
+ uint32_t pair[2];
+
+ idx_min = 0;
+ idx_max = countof(unicode_comp_table) - 1;
+ while (idx_min <= idx_max) {
+ idx = (idx_max + idx_min) / 2;
+ idx1 = unicode_comp_table[idx];
+
+ /* idx1 represent an entry of the decomposition table */
+ d_idx = idx1 >> 6;
+ d_offset = idx1 & 0x3f;
+ v = unicode_decomp_table1[d_idx];
+ code = v >> (32 - 18);
+ len = (v >> (32 - 18 - 7)) & 0x7f;
+ type = (v >> (32 - 18 - 7 - 6)) & 0x3f;
+ ch = code + d_offset;
+ unicode_decomp_entry(pair, ch, d_idx, code, len, type);
+ d = c0 - pair[0];
+ if (d == 0)
+ d = c1 - pair[1];
+ if (d < 0) {
+ idx_max = idx - 1;
+ } else if (d > 0) {
+ idx_min = idx + 1;
+ } else {
+ return ch;
+ }
+ }
+ return 0;
+}
+
+/* return the combining class of character c (between 0 and 255) */
+static int unicode_get_cc(uint32_t c)
+{
+ uint32_t code, n, type, cc, c1, b;
+ int pos;
+ const uint8_t *p;
+
+ pos = get_index_pos(&code, c,
+ unicode_cc_index, sizeof(unicode_cc_index) / 3);
+ if (pos < 0)
+ return 0;
+ p = unicode_cc_table + pos;
+ for(;;) {
+ b = *p++;
+ type = b >> 6;
+ n = b & 0x3f;
+ if (n < 48) {
+ } else if (n < 56) {
+ n = (n - 48) << 8;
+ n |= *p++;
+ n += 48;
+ } else {
+ n = (n - 56) << 8;
+ n |= *p++ << 8;
+ n |= *p++;
+ n += 48 + (1 << 11);
+ }
+ if (type <= 1)
+ p++;
+ c1 = code + n + 1;
+ if (c < c1) {
+ switch(type) {
+ case 0:
+ cc = p[-1];
+ break;
+ case 1:
+ cc = p[-1] + c - code;
+ break;
+ case 2:
+ cc = 0;
+ break;
+ default:
+ case 3:
+ cc = 230;
+ break;
+ }
+ return cc;
+ }
+ code = c1;
+ }
+}
+
+static void sort_cc(int *buf, int len)
+{
+ int i, j, k, cc, cc1, start, ch1;
+
+ for(i = 0; i < len; i++) {
+ cc = unicode_get_cc(buf[i]);
+ if (cc != 0) {
+ start = i;
+ j = i + 1;
+ while (j < len) {
+ ch1 = buf[j];
+ cc1 = unicode_get_cc(ch1);
+ if (cc1 == 0)
+ break;
+ k = j - 1;
+ while (k >= start) {
+ if (unicode_get_cc(buf[k]) <= cc1)
+ break;
+ buf[k + 1] = buf[k];
+ k--;
+ }
+ buf[k + 1] = ch1;
+ j++;
+ }
+#if 0
+ printf("cc:");
+ for(k = start; k < j; k++) {
+ printf(" %3d", unicode_get_cc(buf[k]));
+ }
+ printf("\n");
+#endif
+ i = j;
+ }
+ }
+}
+
+static void to_nfd_rec(DynBuf *dbuf,
+ const int *src, int src_len, int is_compat)
+{
+ uint32_t c, v;
+ int i, l;
+ uint32_t res[UNICODE_DECOMP_LEN_MAX];
+
+ for(i = 0; i < src_len; i++) {
+ c = src[i];
+ if (c >= 0xac00 && c < 0xd7a4) {
+ /* Hangul decomposition */
+ c -= 0xac00;
+ dbuf_put_u32(dbuf, 0x1100 + c / 588);
+ dbuf_put_u32(dbuf, 0x1161 + (c % 588) / 28);
+ v = c % 28;
+ if (v != 0)
+ dbuf_put_u32(dbuf, 0x11a7 + v);
+ } else {
+ l = unicode_decomp_char(res, c, is_compat);
+ if (l) {
+ to_nfd_rec(dbuf, (int *)res, l, is_compat);
+ } else {
+ dbuf_put_u32(dbuf, c);
+ }
+ }
+ }
+}
+
+/* return 0 if not found */
+static int compose_pair(uint32_t c0, uint32_t c1)
+{
+ /* Hangul composition */
+ if (c0 >= 0x1100 && c0 < 0x1100 + 19 &&
+ c1 >= 0x1161 && c1 < 0x1161 + 21) {
+ return 0xac00 + (c0 - 0x1100) * 588 + (c1 - 0x1161) * 28;
+ } else if (c0 >= 0xac00 && c0 < 0xac00 + 11172 &&
+ (c0 - 0xac00) % 28 == 0 &&
+ c1 >= 0x11a7 && c1 < 0x11a7 + 28) {
+ return c0 + c1 - 0x11a7;
+ } else {
+ return unicode_compose_pair(c0, c1);
+ }
+}
+
+int unicode_normalize(uint32_t **pdst, const uint32_t *src, int src_len,
+ UnicodeNormalizationEnum n_type,
+ void *opaque, DynBufReallocFunc *realloc_func)
+{
+ int *buf, buf_len, i, p, starter_pos, cc, last_cc, out_len;
+ BOOL is_compat;
+ DynBuf dbuf_s, *dbuf = &dbuf_s;
+
+ is_compat = n_type >> 1;
+
+ dbuf_init2(dbuf, opaque, realloc_func);
+ if (dbuf_realloc(dbuf, sizeof(int) * src_len))
+ goto fail;
+
+ /* common case: latin1 is unaffected by NFC */
+ if (n_type == UNICODE_NFC) {
+ for(i = 0; i < src_len; i++) {
+ if (src[i] >= 0x100)
+ goto not_latin1;
+ }
+ buf = (int *)dbuf->buf;
+ memcpy(buf, src, src_len * sizeof(int));
+ *pdst = (uint32_t *)buf;
+ return src_len;
+ not_latin1: ;
+ }
+
+ to_nfd_rec(dbuf, (const int *)src, src_len, is_compat);
+ if (dbuf_error(dbuf)) {
+ fail:
+ *pdst = NULL;
+ return -1;
+ }
+ buf = (int *)dbuf->buf;
+ buf_len = dbuf->size / sizeof(int);
+
+ sort_cc(buf, buf_len);
+
+ if (buf_len <= 1 || (n_type & 1) != 0) {
+ /* NFD / NFKD */
+ *pdst = (uint32_t *)buf;
+ return buf_len;
+ }
+
+ i = 1;
+ out_len = 1;
+ while (i < buf_len) {
+ /* find the starter character and test if it is blocked from
+ the character at 'i' */
+ last_cc = unicode_get_cc(buf[i]);
+ starter_pos = out_len - 1;
+ while (starter_pos >= 0) {
+ cc = unicode_get_cc(buf[starter_pos]);
+ if (cc == 0)
+ break;
+ if (cc >= last_cc)
+ goto next;
+ last_cc = 256;
+ starter_pos--;
+ }
+ if (starter_pos >= 0 &&
+ (p = compose_pair(buf[starter_pos], buf[i])) != 0) {
+ buf[starter_pos] = p;
+ i++;
+ } else {
+ next:
+ buf[out_len++] = buf[i++];
+ }
+ }
+ *pdst = (uint32_t *)buf;
+ return out_len;
+}
+
+/* char ranges for various unicode properties */
+
+static int unicode_find_name(const char *name_table, const char *name)
+{
+ const char *p, *r;
+ int pos;
+ size_t name_len, len;
+
+ p = name_table;
+ pos = 0;
+ name_len = strlen(name);
+ while (*p) {
+ for(;;) {
+ r = strchr(p, ',');
+ if (!r)
+ len = strlen(p);
+ else
+ len = r - p;
+ if (len == name_len && !memcmp(p, name, name_len))
+ return pos;
+ p += len + 1;
+ if (!r)
+ break;
+ }
+ pos++;
+ }
+ return -1;
+}
+
+/* 'cr' must be initialized and empty. Return 0 if OK, -1 if error, -2
+ if not found */
+int unicode_script(CharRange *cr,
+ const char *script_name, BOOL is_ext)
+{
+ int script_idx;
+ const uint8_t *p, *p_end;
+ uint32_t c, c1, b, n, v, v_len, i, type;
+ CharRange cr1_s, *cr1;
+ CharRange cr2_s, *cr2 = &cr2_s;
+ BOOL is_common;
+
+ script_idx = unicode_find_name(unicode_script_name_table, script_name);
+ if (script_idx < 0)
+ return -2;
+ /* Note: we remove the "Unknown" Script */
+ script_idx += UNICODE_SCRIPT_Unknown + 1;
+
+ is_common = (script_idx == UNICODE_SCRIPT_Common ||
+ script_idx == UNICODE_SCRIPT_Inherited);
+ if (is_ext) {
+ cr1 = &cr1_s;
+ cr_init(cr1, cr->mem_opaque, cr->realloc_func);
+ cr_init(cr2, cr->mem_opaque, cr->realloc_func);
+ } else {
+ cr1 = cr;
+ }
+
+ p = unicode_script_table;
+ p_end = unicode_script_table + countof(unicode_script_table);
+ c = 0;
+ while (p < p_end) {
+ b = *p++;
+ type = b >> 7;
+ n = b & 0x7f;
+ if (n < 96) {
+ } else if (n < 112) {
+ n = (n - 96) << 8;
+ n |= *p++;
+ n += 96;
+ } else {
+ n = (n - 112) << 16;
+ n |= *p++ << 8;
+ n |= *p++;
+ n += 96 + (1 << 12);
+ }
+ if (type == 0)
+ v = 0;
+ else
+ v = *p++;
+ c1 = c + n + 1;
+ if (v == script_idx) {
+ if (cr_add_interval(cr1, c, c1))
+ goto fail;
+ }
+ c = c1;
+ }
+
+ if (is_ext) {
+ /* add the script extensions */
+ p = unicode_script_ext_table;
+ p_end = unicode_script_ext_table + countof(unicode_script_ext_table);
+ c = 0;
+ while (p < p_end) {
+ b = *p++;
+ if (b < 128) {
+ n = b;
+ } else if (b < 128 + 64) {
+ n = (b - 128) << 8;
+ n |= *p++;
+ n += 128;
+ } else {
+ n = (b - 128 - 64) << 16;
+ n |= *p++ << 8;
+ n |= *p++;
+ n += 128 + (1 << 14);
+ }
+ c1 = c + n + 1;
+ v_len = *p++;
+ if (is_common) {
+ if (v_len != 0) {
+ if (cr_add_interval(cr2, c, c1))
+ goto fail;
+ }
+ } else {
+ for(i = 0; i < v_len; i++) {
+ if (p[i] == script_idx) {
+ if (cr_add_interval(cr2, c, c1))
+ goto fail;
+ break;
+ }
+ }
+ }
+ p += v_len;
+ c = c1;
+ }
+ if (is_common) {
+ /* remove all the characters with script extensions */
+ if (cr_invert(cr2))
+ goto fail;
+ if (cr_op(cr, cr1->points, cr1->len, cr2->points, cr2->len,
+ CR_OP_INTER))
+ goto fail;
+ } else {
+ if (cr_op(cr, cr1->points, cr1->len, cr2->points, cr2->len,
+ CR_OP_UNION))
+ goto fail;
+ }
+ cr_free(cr1);
+ cr_free(cr2);
+ }
+ return 0;
+ fail:
+ if (is_ext) {
+ cr_free(cr1);
+ cr_free(cr2);
+ }
+ goto fail;
+}
+
+#define M(id) (1U << UNICODE_GC_ ## id)
+
+static int unicode_general_category1(CharRange *cr, uint32_t gc_mask)
+{
+ const uint8_t *p, *p_end;
+ uint32_t c, c0, b, n, v;
+
+ p = unicode_gc_table;
+ p_end = unicode_gc_table + countof(unicode_gc_table);
+ c = 0;
+ while (p < p_end) {
+ b = *p++;
+ n = b >> 5;
+ v = b & 0x1f;
+ if (n == 7) {
+ n = *p++;
+ if (n < 128) {
+ n += 7;
+ } else if (n < 128 + 64) {
+ n = (n - 128) << 8;
+ n |= *p++;
+ n += 7 + 128;
+ } else {
+ n = (n - 128 - 64) << 16;
+ n |= *p++ << 8;
+ n |= *p++;
+ n += 7 + 128 + (1 << 14);
+ }
+ }
+ c0 = c;
+ c += n + 1;
+ if (v == 31) {
+ /* run of Lu / Ll */
+ b = gc_mask & (M(Lu) | M(Ll));
+ if (b != 0) {
+ if (b == (M(Lu) | M(Ll))) {
+ goto add_range;
+ } else {
+ c0 += ((gc_mask & M(Ll)) != 0);
+ for(; c0 < c; c0 += 2) {
+ if (cr_add_interval(cr, c0, c0 + 1))
+ return -1;
+ }
+ }
+ }
+ } else if ((gc_mask >> v) & 1) {
+ add_range:
+ if (cr_add_interval(cr, c0, c))
+ return -1;
+ }
+ }
+ return 0;
+}
+
+static int unicode_prop1(CharRange *cr, int prop_idx)
+{
+ const uint8_t *p, *p_end;
+ uint32_t c, c0, b, bit;
+
+ p = unicode_prop_table[prop_idx];
+ p_end = p + unicode_prop_len_table[prop_idx];
+ c = 0;
+ bit = 0;
+ while (p < p_end) {
+ c0 = c;
+ b = *p++;
+ if (b < 64) {
+ c += (b >> 3) + 1;
+ if (bit) {
+ if (cr_add_interval(cr, c0, c))
+ return -1;
+ }
+ bit ^= 1;
+ c0 = c;
+ c += (b & 7) + 1;
+ } else if (b >= 0x80) {
+ c += b - 0x80 + 1;
+ } else if (b < 0x60) {
+ c += (((b - 0x40) << 8) | p[0]) + 1;
+ p++;
+ } else {
+ c += (((b - 0x60) << 16) | (p[0] << 8) | p[1]) + 1;
+ p += 2;
+ }
+ if (bit) {
+ if (cr_add_interval(cr, c0, c))
+ return -1;
+ }
+ bit ^= 1;
+ }
+ return 0;
+}
+
+#define CASE_U (1 << 0)
+#define CASE_L (1 << 1)
+#define CASE_F (1 << 2)
+
+/* use the case conversion table to generate range of characters.
+ CASE_U: set char if modified by uppercasing,
+ CASE_L: set char if modified by lowercasing,
+ CASE_F: set char if modified by case folding,
+ */
+static int unicode_case1(CharRange *cr, int case_mask)
+{
+#define MR(x) (1 << RUN_TYPE_ ## x)
+ const uint32_t tab_run_mask[3] = {
+ MR(U) | MR(UF) | MR(UL) | MR(LSU) | MR(U2L_399_EXT2) | MR(UF_D20) |
+ MR(UF_D1_EXT) | MR(U_EXT) | MR(U_EXT2) | MR(U_EXT3),
+
+ MR(L) | MR(LF) | MR(UL) | MR(LSU) | MR(U2L_399_EXT2) | MR(LF_EXT) | MR(L_EXT2),
+
+ MR(UF) | MR(LF) | MR(UL) | MR(LSU) | MR(U2L_399_EXT2) | MR(LF_EXT) | MR(UF_D20) | MR(UF_D1_EXT) | MR(LF_EXT),
+ };
+#undef MR
+ uint32_t mask, v, code, type, len, i, idx;
+
+ if (case_mask == 0)
+ return 0;
+ mask = 0;
+ for(i = 0; i < 3; i++) {
+ if ((case_mask >> i) & 1)
+ mask |= tab_run_mask[i];
+ }
+ for(idx = 0; idx < countof(case_conv_table1); idx++) {
+ v = case_conv_table1[idx];
+ type = (v >> (32 - 17 - 7 - 4)) & 0xf;
+ code = v >> (32 - 17);
+ len = (v >> (32 - 17 - 7)) & 0x7f;
+ if ((mask >> type) & 1) {
+ // printf("%d: type=%d %04x %04x\n", idx, type, code, code + len - 1);
+ switch(type) {
+ case RUN_TYPE_UL:
+ if ((case_mask & CASE_U) && (case_mask & (CASE_L | CASE_F)))
+ goto def_case;
+ code += ((case_mask & CASE_U) != 0);
+ for(i = 0; i < len; i += 2) {
+ if (cr_add_interval(cr, code + i, code + i + 1))
+ return -1;
+ }
+ break;
+ case RUN_TYPE_LSU:
+ if ((case_mask & CASE_U) && (case_mask & (CASE_L | CASE_F)))
+ goto def_case;
+ if (!(case_mask & CASE_U)) {
+ if (cr_add_interval(cr, code, code + 1))
+ return -1;
+ }
+ if (cr_add_interval(cr, code + 1, code + 2))
+ return -1;
+ if (case_mask & CASE_U) {
+ if (cr_add_interval(cr, code + 2, code + 3))
+ return -1;
+ }
+ break;
+ default:
+ def_case:
+ if (cr_add_interval(cr, code, code + len))
+ return -1;
+ break;
+ }
+ }
+ }
+ return 0;
+}
+
+typedef enum {
+ POP_GC,
+ POP_PROP,
+ POP_CASE,
+ POP_UNION,
+ POP_INTER,
+ POP_XOR,
+ POP_INVERT,
+ POP_END,
+} PropOPEnum;
+
+#define POP_STACK_LEN_MAX 4
+
+static int unicode_prop_ops(CharRange *cr, ...)
+{
+ va_list ap;
+ CharRange stack[POP_STACK_LEN_MAX];
+ int stack_len, op, ret, i;
+ uint32_t a;
+
+ va_start(ap, cr);
+ stack_len = 0;
+ for(;;) {
+ op = va_arg(ap, int);
+ switch(op) {
+ case POP_GC:
+ assert(stack_len < POP_STACK_LEN_MAX);
+ a = va_arg(ap, int);
+ cr_init(&stack[stack_len++], cr->mem_opaque, cr->realloc_func);
+ if (unicode_general_category1(&stack[stack_len - 1], a))
+ goto fail;
+ break;
+ case POP_PROP:
+ assert(stack_len < POP_STACK_LEN_MAX);
+ a = va_arg(ap, int);
+ cr_init(&stack[stack_len++], cr->mem_opaque, cr->realloc_func);
+ if (unicode_prop1(&stack[stack_len - 1], a))
+ goto fail;
+ break;
+ case POP_CASE:
+ assert(stack_len < POP_STACK_LEN_MAX);
+ a = va_arg(ap, int);
+ cr_init(&stack[stack_len++], cr->mem_opaque, cr->realloc_func);
+ if (unicode_case1(&stack[stack_len - 1], a))
+ goto fail;
+ break;
+ case POP_UNION:
+ case POP_INTER:
+ case POP_XOR:
+ {
+ CharRange *cr1, *cr2, *cr3;
+ assert(stack_len >= 2);
+ assert(stack_len < POP_STACK_LEN_MAX);
+ cr1 = &stack[stack_len - 2];
+ cr2 = &stack[stack_len - 1];
+ cr3 = &stack[stack_len++];
+ cr_init(cr3, cr->mem_opaque, cr->realloc_func);
+ if (cr_op(cr3, cr1->points, cr1->len,
+ cr2->points, cr2->len, op - POP_UNION + CR_OP_UNION))
+ goto fail;
+ cr_free(cr1);
+ cr_free(cr2);
+ *cr1 = *cr3;
+ stack_len -= 2;
+ }
+ break;
+ case POP_INVERT:
+ assert(stack_len >= 1);
+ if (cr_invert(&stack[stack_len - 1]))
+ goto fail;
+ break;
+ case POP_END:
+ goto done;
+ default:
+ abort();
+ }
+ }
+ done:
+ assert(stack_len == 1);
+ ret = cr_copy(cr, &stack[0]);
+ cr_free(&stack[0]);
+ return ret;
+ fail:
+ for(i = 0; i < stack_len; i++)
+ cr_free(&stack[i]);
+ return -1;
+}
+
+static const uint32_t unicode_gc_mask_table[] = {
+ M(Lu) | M(Ll) | M(Lt), /* LC */
+ M(Lu) | M(Ll) | M(Lt) | M(Lm) | M(Lo), /* L */
+ M(Mn) | M(Mc) | M(Me), /* M */
+ M(Nd) | M(Nl) | M(No), /* N */
+ M(Sm) | M(Sc) | M(Sk) | M(So), /* S */
+ M(Pc) | M(Pd) | M(Ps) | M(Pe) | M(Pi) | M(Pf) | M(Po), /* P */
+ M(Zs) | M(Zl) | M(Zp), /* Z */
+ M(Cc) | M(Cf) | M(Cs) | M(Co) | M(Cn), /* C */
+};
+
+/* 'cr' must be initialized and empty. Return 0 if OK, -1 if error, -2
+ if not found */
+int unicode_general_category(CharRange *cr, const char *gc_name)
+{
+ int gc_idx;
+ uint32_t gc_mask;
+
+ gc_idx = unicode_find_name(unicode_gc_name_table, gc_name);
+ if (gc_idx < 0)
+ return -2;
+ if (gc_idx <= UNICODE_GC_Co) {
+ gc_mask = (uint64_t)1 << gc_idx;
+ } else {
+ gc_mask = unicode_gc_mask_table[gc_idx - UNICODE_GC_LC];
+ }
+ return unicode_general_category1(cr, gc_mask);
+}
+
+
+/* 'cr' must be initialized and empty. Return 0 if OK, -1 if error, -2
+ if not found */
+int unicode_prop(CharRange *cr, const char *prop_name)
+{
+ int prop_idx, ret;
+
+ prop_idx = unicode_find_name(unicode_prop_name_table, prop_name);
+ if (prop_idx < 0)
+ return -2;
+ prop_idx += UNICODE_PROP_ASCII_Hex_Digit;
+
+ ret = 0;
+ switch(prop_idx) {
+ case UNICODE_PROP_ASCII:
+ if (cr_add_interval(cr, 0x00, 0x7f + 1))
+ return -1;
+ break;
+ case UNICODE_PROP_Any:
+ if (cr_add_interval(cr, 0x00000, 0x10ffff + 1))
+ return -1;
+ break;
+ case UNICODE_PROP_Assigned:
+ ret = unicode_prop_ops(cr,
+ POP_GC, M(Cn),
+ POP_INVERT,
+ POP_END);
+ break;
+ case UNICODE_PROP_Math:
+ ret = unicode_prop_ops(cr,
+ POP_GC, M(Sm),
+ POP_PROP, UNICODE_PROP_Other_Math,
+ POP_UNION,
+ POP_END);
+ break;
+ case UNICODE_PROP_Lowercase:
+ ret = unicode_prop_ops(cr,
+ POP_GC, M(Ll),
+ POP_PROP, UNICODE_PROP_Other_Lowercase,
+ POP_UNION,
+ POP_END);
+ break;
+ case UNICODE_PROP_Uppercase:
+ ret = unicode_prop_ops(cr,
+ POP_GC, M(Lu),
+ POP_PROP, UNICODE_PROP_Other_Uppercase,
+ POP_UNION,
+ POP_END);
+ break;
+ case UNICODE_PROP_Cased:
+ ret = unicode_prop_ops(cr,
+ POP_GC, M(Lu) | M(Ll) | M(Lt),
+ POP_PROP, UNICODE_PROP_Other_Uppercase,
+ POP_UNION,
+ POP_PROP, UNICODE_PROP_Other_Lowercase,
+ POP_UNION,
+ POP_END);
+ break;
+ case UNICODE_PROP_Alphabetic:
+ ret = unicode_prop_ops(cr,
+ POP_GC, M(Lu) | M(Ll) | M(Lt) | M(Lm) | M(Lo) | M(Nl),
+ POP_PROP, UNICODE_PROP_Other_Uppercase,
+ POP_UNION,
+ POP_PROP, UNICODE_PROP_Other_Lowercase,
+ POP_UNION,
+ POP_PROP, UNICODE_PROP_Other_Alphabetic,
+ POP_UNION,
+ POP_END);
+ break;
+ case UNICODE_PROP_Grapheme_Base:
+ ret = unicode_prop_ops(cr,
+ POP_GC, M(Cc) | M(Cf) | M(Cs) | M(Co) | M(Cn) | M(Zl) | M(Zp) | M(Me) | M(Mn),
+ POP_PROP, UNICODE_PROP_Other_Grapheme_Extend,
+ POP_UNION,
+ POP_INVERT,
+ POP_END);
+ break;
+ case UNICODE_PROP_Grapheme_Extend:
+ ret = unicode_prop_ops(cr,
+ POP_GC, M(Me) | M(Mn),
+ POP_PROP, UNICODE_PROP_Other_Grapheme_Extend,
+ POP_UNION,
+ POP_END);
+ break;
+ case UNICODE_PROP_XID_Start:
+ ret = unicode_prop_ops(cr,
+ POP_GC, M(Lu) | M(Ll) | M(Lt) | M(Lm) | M(Lo) | M(Nl),
+ POP_PROP, UNICODE_PROP_Other_ID_Start,
+ POP_UNION,
+ POP_PROP, UNICODE_PROP_Pattern_Syntax,
+ POP_PROP, UNICODE_PROP_Pattern_White_Space,
+ POP_UNION,
+ POP_PROP, UNICODE_PROP_XID_Start1,
+ POP_UNION,
+ POP_INVERT,
+ POP_INTER,
+ POP_END);
+ break;
+ case UNICODE_PROP_XID_Continue:
+ ret = unicode_prop_ops(cr,
+ POP_GC, M(Lu) | M(Ll) | M(Lt) | M(Lm) | M(Lo) | M(Nl) |
+ M(Mn) | M(Mc) | M(Nd) | M(Pc),
+ POP_PROP, UNICODE_PROP_Other_ID_Start,
+ POP_UNION,
+ POP_PROP, UNICODE_PROP_Other_ID_Continue,
+ POP_UNION,
+ POP_PROP, UNICODE_PROP_Pattern_Syntax,
+ POP_PROP, UNICODE_PROP_Pattern_White_Space,
+ POP_UNION,
+ POP_PROP, UNICODE_PROP_XID_Continue1,
+ POP_UNION,
+ POP_INVERT,
+ POP_INTER,
+ POP_END);
+ break;
+ case UNICODE_PROP_Changes_When_Uppercased:
+ ret = unicode_case1(cr, CASE_U);
+ break;
+ case UNICODE_PROP_Changes_When_Lowercased:
+ ret = unicode_case1(cr, CASE_L);
+ break;
+ case UNICODE_PROP_Changes_When_Casemapped:
+ ret = unicode_case1(cr, CASE_U | CASE_L | CASE_F);
+ break;
+ case UNICODE_PROP_Changes_When_Titlecased:
+ ret = unicode_prop_ops(cr,
+ POP_CASE, CASE_U,
+ POP_PROP, UNICODE_PROP_Changes_When_Titlecased1,
+ POP_XOR,
+ POP_END);
+ break;
+ case UNICODE_PROP_Changes_When_Casefolded:
+ ret = unicode_prop_ops(cr,
+ POP_CASE, CASE_F,
+ POP_PROP, UNICODE_PROP_Changes_When_Casefolded1,
+ POP_XOR,
+ POP_END);
+ break;
+ case UNICODE_PROP_Changes_When_NFKC_Casefolded:
+ ret = unicode_prop_ops(cr,
+ POP_CASE, CASE_F,
+ POP_PROP, UNICODE_PROP_Changes_When_NFKC_Casefolded1,
+ POP_XOR,
+ POP_END);
+ break;
+#if 0
+ case UNICODE_PROP_ID_Start:
+ ret = unicode_prop_ops(cr,
+ POP_GC, M(Lu) | M(Ll) | M(Lt) | M(Lm) | M(Lo) | M(Nl),
+ POP_PROP, UNICODE_PROP_Other_ID_Start,
+ POP_UNION,
+ POP_PROP, UNICODE_PROP_Pattern_Syntax,
+ POP_PROP, UNICODE_PROP_Pattern_White_Space,
+ POP_UNION,
+ POP_INVERT,
+ POP_INTER,
+ POP_END);
+ break;
+ case UNICODE_PROP_ID_Continue:
+ ret = unicode_prop_ops(cr,
+ POP_GC, M(Lu) | M(Ll) | M(Lt) | M(Lm) | M(Lo) | M(Nl) |
+ M(Mn) | M(Mc) | M(Nd) | M(Pc),
+ POP_PROP, UNICODE_PROP_Other_ID_Start,
+ POP_UNION,
+ POP_PROP, UNICODE_PROP_Other_ID_Continue,
+ POP_UNION,
+ POP_PROP, UNICODE_PROP_Pattern_Syntax,
+ POP_PROP, UNICODE_PROP_Pattern_White_Space,
+ POP_UNION,
+ POP_INVERT,
+ POP_INTER,
+ POP_END);
+ break;
+ case UNICODE_PROP_Case_Ignorable:
+ ret = unicode_prop_ops(cr,
+ POP_GC, M(Mn) | M(Cf) | M(Lm) | M(Sk),
+ POP_PROP, UNICODE_PROP_Case_Ignorable1,
+ POP_XOR,
+ POP_END);
+ break;
+#else
+ /* we use the existing tables */
+ case UNICODE_PROP_ID_Continue:
+ ret = unicode_prop_ops(cr,
+ POP_PROP, UNICODE_PROP_ID_Start,
+ POP_PROP, UNICODE_PROP_ID_Continue1,
+ POP_XOR,
+ POP_END);
+ break;
+#endif
+ default:
+ if (prop_idx >= countof(unicode_prop_table))
+ return -2;
+ ret = unicode_prop1(cr, prop_idx);
+ break;
+ }
+ return ret;
+}
+
+#endif /* CONFIG_ALL_UNICODE */
diff --git a/thirdparty/quickjs/quickjs-2019-07-09-dust3d/libunicode.h b/thirdparty/quickjs/quickjs-2019-07-09-dust3d/libunicode.h
new file mode 100755
index 00000000..cfa600a5
--- /dev/null
+++ b/thirdparty/quickjs/quickjs-2019-07-09-dust3d/libunicode.h
@@ -0,0 +1,124 @@
+/*
+ * Unicode utilities
+ *
+ * Copyright (c) 2017-2018 Fabrice Bellard
+ *
+ * Permission is hereby granted, free of charge, to any person obtaining a copy
+ * of this software and associated documentation files (the "Software"), to deal
+ * in the Software without restriction, including without limitation the rights
+ * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+ * copies of the Software, and to permit persons to whom the Software is
+ * furnished to do so, subject to the following conditions:
+ *
+ * The above copyright notice and this permission notice shall be included in
+ * all copies or substantial portions of the Software.
+ *
+ * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+ * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+ * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
+ * THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+ * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+ * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
+ * THE SOFTWARE.
+ */
+#ifndef LIBUNICODE_H
+#define LIBUNICODE_H
+
+#include
+
+#define LRE_BOOL int /* for documentation purposes */
+
+/* define it to include all the unicode tables (40KB larger) */
+#define CONFIG_ALL_UNICODE
+
+#define LRE_CC_RES_LEN_MAX 3
+
+typedef enum {
+ UNICODE_NFC,
+ UNICODE_NFD,
+ UNICODE_NFKC,
+ UNICODE_NFKD,
+} UnicodeNormalizationEnum;
+
+int lre_case_conv(uint32_t *res, uint32_t c, int conv_type);
+LRE_BOOL lre_is_cased(uint32_t c);
+LRE_BOOL lre_is_case_ignorable(uint32_t c);
+
+/* char ranges */
+
+typedef struct {
+ int len; /* in points, always even */
+ int size;
+ uint32_t *points; /* points sorted by increasing value */
+ void *mem_opaque;
+ void *(*realloc_func)(void *opaque, void *ptr, size_t size);
+} CharRange;
+
+typedef enum {
+ CR_OP_UNION,
+ CR_OP_INTER,
+ CR_OP_XOR,
+} CharRangeOpEnum;
+
+void cr_init(CharRange *cr, void *mem_opaque, void *(*realloc_func)(void *opaque, void *ptr, size_t size));
+void cr_free(CharRange *cr);
+int cr_realloc(CharRange *cr, int size);
+int cr_copy(CharRange *cr, const CharRange *cr1);
+
+static inline int cr_add_point(CharRange *cr, uint32_t v)
+{
+ if (cr->len >= cr->size) {
+ if (cr_realloc(cr, cr->len + 1))
+ return -1;
+ }
+ cr->points[cr->len++] = v;
+ return 0;
+}
+
+static inline int cr_add_interval(CharRange *cr, uint32_t c1, uint32_t c2)
+{
+ if ((cr->len + 2) > cr->size) {
+ if (cr_realloc(cr, cr->len + 2))
+ return -1;
+ }
+ cr->points[cr->len++] = c1;
+ cr->points[cr->len++] = c2;
+ return 0;
+}
+
+int cr_union1(CharRange *cr, const uint32_t *b_pt, int b_len);
+
+static inline int cr_union_interval(CharRange *cr, uint32_t c1, uint32_t c2)
+{
+ uint32_t b_pt[2];
+ b_pt[0] = c1;
+ b_pt[1] = c2 + 1;
+ return cr_union1(cr, b_pt, 2);
+}
+
+int cr_op(CharRange *cr, const uint32_t *a_pt, int a_len,
+ const uint32_t *b_pt, int b_len, int op);
+
+int cr_invert(CharRange *cr);
+
+#ifdef CONFIG_ALL_UNICODE
+
+LRE_BOOL lre_is_id_start(uint32_t c);
+LRE_BOOL lre_is_id_continue(uint32_t c);
+
+int unicode_normalize(uint32_t **pdst, const uint32_t *src, int src_len,
+ UnicodeNormalizationEnum n_type,
+ void *opaque, void *(*realloc_func)(void *opaque, void *ptr, size_t size));
+
+/* Unicode character range functions */
+
+int unicode_script(CharRange *cr,
+ const char *script_name, LRE_BOOL is_ext);
+int unicode_general_category(CharRange *cr, const char *gc_name);
+int unicode_prop(CharRange *cr, const char *prop_name);
+
+#endif /* CONFIG_ALL_UNICODE */
+
+#undef LRE_BOOL
+
+#endif /* LIBUNICODE_H */
diff --git a/thirdparty/quickjs/quickjs-2019-07-09-dust3d/list.h b/thirdparty/quickjs/quickjs-2019-07-09-dust3d/list.h
new file mode 100755
index 00000000..0a1bc5a4
--- /dev/null
+++ b/thirdparty/quickjs/quickjs-2019-07-09-dust3d/list.h
@@ -0,0 +1,100 @@
+/*
+ * Linux klist like system
+ *
+ * Copyright (c) 2016-2017 Fabrice Bellard
+ *
+ * Permission is hereby granted, free of charge, to any person obtaining a copy
+ * of this software and associated documentation files (the "Software"), to deal
+ * in the Software without restriction, including without limitation the rights
+ * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+ * copies of the Software, and to permit persons to whom the Software is
+ * furnished to do so, subject to the following conditions:
+ *
+ * The above copyright notice and this permission notice shall be included in
+ * all copies or substantial portions of the Software.
+ *
+ * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+ * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+ * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
+ * THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+ * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+ * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
+ * THE SOFTWARE.
+ */
+#ifndef LIST_H
+#define LIST_H
+
+#ifndef NULL
+#include
+#endif
+
+struct list_head {
+ struct list_head *prev;
+ struct list_head *next;
+};
+
+#define LIST_HEAD_INIT(el) { &(el), &(el) }
+
+/* return the pointer of type 'type *' containing 'el' as field 'member' */
+#define list_entry(el, type, member) \
+ ((type *)((uint8_t *)(el) - offsetof(type, member)))
+
+static inline void init_list_head(struct list_head *head)
+{
+ head->prev = head;
+ head->next = head;
+}
+
+/* insert 'el' between 'prev' and 'next' */
+static inline void __list_add(struct list_head *el,
+ struct list_head *prev, struct list_head *next)
+{
+ prev->next = el;
+ el->prev = prev;
+ el->next = next;
+ next->prev = el;
+}
+
+/* add 'el' at the head of the list 'head' (= after element head) */
+static inline void list_add(struct list_head *el, struct list_head *head)
+{
+ __list_add(el, head, head->next);
+}
+
+/* add 'el' at the end of the list 'head' (= before element head) */
+static inline void list_add_tail(struct list_head *el, struct list_head *head)
+{
+ __list_add(el, head->prev, head);
+}
+
+static inline void list_del(struct list_head *el)
+{
+ struct list_head *prev, *next;
+ prev = el->prev;
+ next = el->next;
+ prev->next = next;
+ next->prev = prev;
+ el->prev = NULL; /* fail safe */
+ el->next = NULL; /* fail safe */
+}
+
+static inline int list_empty(struct list_head *el)
+{
+ return el->next == el;
+}
+
+#define list_for_each(el, head) \
+ for(el = (head)->next; el != (head); el = el->next)
+
+#define list_for_each_safe(el, el1, head) \
+ for(el = (head)->next, el1 = el->next; el != (head); \
+ el = el1, el1 = el->next)
+
+#define list_for_each_prev(el, head) \
+ for(el = (head)->prev; el != (head); el = el->prev)
+
+#define list_for_each_prev_safe(el, el1, head) \
+ for(el = (head)->prev, el1 = el->prev; el != (head); \
+ el = el1, el1 = el->prev)
+
+#endif /* LIST_H */
diff --git a/thirdparty/quickjs/quickjs-2019-07-09-dust3d/qjs.c b/thirdparty/quickjs/quickjs-2019-07-09-dust3d/qjs.c
new file mode 100755
index 00000000..975e83c9
--- /dev/null
+++ b/thirdparty/quickjs/quickjs-2019-07-09-dust3d/qjs.c
@@ -0,0 +1,466 @@
+/*
+ * QuickJS stand alone interpreter
+ *
+ * Copyright (c) 2017-2018 Fabrice Bellard
+ * Copyright (c) 2017-2018 Charlie Gordon
+ *
+ * Permission is hereby granted, free of charge, to any person obtaining a copy
+ * of this software and associated documentation files (the "Software"), to deal
+ * in the Software without restriction, including without limitation the rights
+ * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+ * copies of the Software, and to permit persons to whom the Software is
+ * furnished to do so, subject to the following conditions:
+ *
+ * The above copyright notice and this permission notice shall be included in
+ * all copies or substantial portions of the Software.
+ *
+ * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+ * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+ * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
+ * THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+ * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+ * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
+ * THE SOFTWARE.
+ */
+#include
+#include
+#include
+#include
+#include
+#include
+#include
+#include
+#include
+#include
+#if defined(__APPLE__)
+#include
+#elif defined(__linux__)
+#include
+#endif
+
+#include "cutils.h"
+#include "quickjs-libc.h"
+
+extern const uint8_t repl[];
+extern const uint32_t repl_size;
+#ifdef CONFIG_BIGNUM
+extern const uint8_t qjscalc[];
+extern const uint32_t qjscalc_size;
+#endif
+
+static int eval_buf(JSContext *ctx, const void *buf, int buf_len,
+ const char *filename, int eval_flags)
+{
+ JSValue val;
+ int ret;
+
+ val = JS_Eval(ctx, buf, buf_len, filename, eval_flags);
+ if (JS_IsException(val)) {
+ js_std_dump_error(ctx);
+ ret = -1;
+ } else {
+ ret = 0;
+ }
+ JS_FreeValue(ctx, val);
+ return ret;
+}
+
+static int eval_file(JSContext *ctx, const char *filename, int eval_flags)
+{
+ uint8_t *buf;
+ int ret;
+ size_t buf_len;
+
+ buf = js_load_file(ctx, &buf_len, filename);
+ if (!buf) {
+ perror(filename);
+ exit(1);
+ }
+ ret = eval_buf(ctx, buf, buf_len, filename, eval_flags);
+ js_free(ctx, buf);
+ return ret;
+}
+
+#if defined(__APPLE__)
+#define MALLOC_OVERHEAD 0
+#else
+#define MALLOC_OVERHEAD 8
+#endif
+
+struct trace_malloc_data {
+ uint8_t *base;
+};
+
+static inline unsigned long long js_trace_malloc_ptr_offset(uint8_t *ptr,
+ struct trace_malloc_data *dp)
+{
+ return ptr - dp->base;
+}
+
+/* default memory allocation functions with memory limitation */
+static inline size_t js_trace_malloc_usable_size(void *ptr)
+{
+#if defined(__APPLE__)
+ return malloc_size(ptr);
+#elif defined(_WIN32)
+ return _msize(ptr);
+#elif defined(EMSCRIPTEN)
+ return 0;
+#elif defined(__linux__)
+ return malloc_usable_size(ptr);
+#else
+ /* change this to `return 0;` if compilation fails */
+ return malloc_usable_size(ptr);
+#endif
+}
+
+static void __attribute__((format(printf, 2, 3)))
+ js_trace_malloc_printf(JSMallocState *s, const char *fmt, ...)
+{
+ va_list ap;
+ int c;
+
+ va_start(ap, fmt);
+ while ((c = *fmt++) != '\0') {
+ if (c == '%') {
+ /* only handle %p and %zd */
+ if (*fmt == 'p') {
+ uint8_t *ptr = va_arg(ap, void *);
+ if (ptr == NULL) {
+ printf("NULL");
+ } else {
+ printf("H%+06lld.%zd",
+ js_trace_malloc_ptr_offset(ptr, s->opaque),
+ js_trace_malloc_usable_size(ptr));
+ }
+ fmt++;
+ continue;
+ }
+ if (fmt[0] == 'z' && fmt[1] == 'd') {
+ size_t sz = va_arg(ap, size_t);
+ printf("%zd", sz);
+ fmt += 2;
+ continue;
+ }
+ }
+ putc(c, stdout);
+ }
+ va_end(ap);
+}
+
+static void js_trace_malloc_init(struct trace_malloc_data *s)
+{
+ free(s->base = malloc(8));
+}
+
+static void *js_trace_malloc(JSMallocState *s, size_t size)
+{
+ void *ptr;
+
+ /* Do not allocate zero bytes: behavior is platform dependent */
+ assert(size != 0);
+
+ if (unlikely(s->malloc_size + size > s->malloc_limit))
+ return NULL;
+ ptr = malloc(size);
+ js_trace_malloc_printf(s, "A %zd -> %p\n", size, ptr);
+ if (ptr) {
+ s->malloc_count++;
+ s->malloc_size += js_trace_malloc_usable_size(ptr) + MALLOC_OVERHEAD;
+ }
+ return ptr;
+}
+
+static void js_trace_free(JSMallocState *s, void *ptr)
+{
+ if (!ptr)
+ return;
+
+ js_trace_malloc_printf(s, "F %p\n", ptr);
+ s->malloc_count--;
+ s->malloc_size -= js_trace_malloc_usable_size(ptr) + MALLOC_OVERHEAD;
+ free(ptr);
+}
+
+static void *js_trace_realloc(JSMallocState *s, void *ptr, size_t size)
+{
+ size_t old_size;
+
+ if (!ptr) {
+ if (size == 0)
+ return NULL;
+ return js_trace_malloc(s, size);
+ }
+ old_size = js_trace_malloc_usable_size(ptr);
+ if (size == 0) {
+ js_trace_malloc_printf(s, "R %zd %p\n", size, ptr);
+ s->malloc_count--;
+ s->malloc_size -= old_size + MALLOC_OVERHEAD;
+ free(ptr);
+ return NULL;
+ }
+ if (s->malloc_size + size - old_size > s->malloc_limit)
+ return NULL;
+
+ js_trace_malloc_printf(s, "R %zd %p", size, ptr);
+
+ ptr = realloc(ptr, size);
+ js_trace_malloc_printf(s, " -> %p\n", ptr);
+ if (ptr) {
+ s->malloc_size += js_trace_malloc_usable_size(ptr) - old_size;
+ }
+ return ptr;
+}
+
+static const JSMallocFunctions trace_mf = {
+ js_trace_malloc,
+ js_trace_free,
+ js_trace_realloc,
+#if defined(__APPLE__)
+ malloc_size,
+#elif defined(_WIN32)
+ (size_t (*)(const void *))_msize,
+#elif defined(EMSCRIPTEN)
+ NULL,
+#elif defined(__linux__)
+ (size_t (*)(const void *))malloc_usable_size,
+#else
+ /* change this to `NULL,` if compilation fails */
+ malloc_usable_size,
+#endif
+};
+
+#ifdef CONFIG_BIGNUM
+#define PROG_NAME "qjsbn"
+#else
+#define PROG_NAME "qjs"
+#endif
+
+void help(void)
+{
+ printf("QuickJS version " CONFIG_VERSION "\n"
+ "usage: " PROG_NAME " [options] [files]\n"
+ "-h --help list options\n"
+ "-e --eval EXPR evaluate EXPR\n"
+ "-i --interactive go to interactive mode\n"
+ "-m --module load as ES6 module (default if .mjs file extension)\n"
+#ifdef CONFIG_BIGNUM
+ " --qjscalc load the QJSCalc runtime (default if invoked as qjscalc)\n"
+#endif
+ "-T --trace trace memory allocation\n"
+ "-d --dump dump the memory usage stats\n"
+ "-q --quit just instantiate the interpreter and quit\n");
+ exit(1);
+}
+
+int main(int argc, char **argv)
+{
+ JSRuntime *rt;
+ JSContext *ctx;
+ struct trace_malloc_data trace_data = { NULL };
+ int optind;
+ char *expr = NULL;
+ int interactive = 0;
+ int dump_memory = 0;
+ int trace_memory = 0;
+ int empty_run = 0;
+ int module = 0;
+ int load_std = 1;
+#ifdef CONFIG_BIGNUM
+ int load_jscalc;
+#endif
+
+#ifdef CONFIG_BIGNUM
+ /* load jscalc runtime if invoked as 'qjscalc' */
+ {
+ const char *p, *exename;
+ exename = argv[0];
+ p = strrchr(exename, '/');
+ if (p)
+ exename = p + 1;
+ load_jscalc = !strcmp(exename, "qjscalc");
+ }
+#endif
+
+ /* cannot use getopt because we want to pass the command line to
+ the script */
+ optind = 1;
+ while (optind < argc && *argv[optind] == '-') {
+ char *arg = argv[optind] + 1;
+ const char *longopt = "";
+ /* a single - is not an option, it also stops argument scanning */
+ if (!*arg)
+ break;
+ optind++;
+ if (*arg == '-') {
+ longopt = arg + 1;
+ arg += strlen(arg);
+ /* -- stops argument scanning */
+ if (!*longopt)
+ break;
+ }
+ for (; *arg || *longopt; longopt = "") {
+ char opt = *arg;
+ if (opt)
+ arg++;
+ if (opt == 'h' || opt == '?' || !strcmp(longopt, "help")) {
+ help();
+ continue;
+ }
+ if (opt == 'e' || !strcmp(longopt, "eval")) {
+ if (*arg) {
+ expr = arg;
+ break;
+ }
+ if (optind < argc) {
+ expr = argv[optind++];
+ break;
+ }
+ fprintf(stderr, "qjs: missing expression for -e\n");
+ exit(2);
+ }
+ if (opt == 'i' || !strcmp(longopt, "interactive")) {
+ interactive++;
+ continue;
+ }
+ if (opt == 'm' || !strcmp(longopt, "module")) {
+ module = 1;
+ continue;
+ }
+ if (opt == 'd' || !strcmp(longopt, "dump")) {
+ dump_memory++;
+ continue;
+ }
+ if (opt == 'T' || !strcmp(longopt, "trace")) {
+ trace_memory++;
+ continue;
+ }
+ if (!strcmp(longopt, "nostd")) {
+ load_std = 0;
+ continue;
+ }
+#ifdef CONFIG_BIGNUM
+ if (!strcmp(longopt, "qjscalc")) {
+ load_jscalc = 1;
+ continue;
+ }
+#endif
+ if (opt == 'q' || !strcmp(longopt, "quit")) {
+ empty_run++;
+ continue;
+ }
+ if (opt) {
+ fprintf(stderr, "qjs: unknown option '-%c'\n", opt);
+ } else {
+ fprintf(stderr, "qjs: unknown option '--%s'\n", longopt);
+ }
+ help();
+ }
+ }
+
+ if (trace_memory) {
+ js_trace_malloc_init(&trace_data);
+ rt = JS_NewRuntime2(&trace_mf, &trace_data);
+ } else {
+ rt = JS_NewRuntime();
+ }
+ if (!rt) {
+ fprintf(stderr, "qjs: cannot allocate JS runtime\n");
+ exit(2);
+ }
+ ctx = JS_NewContext(rt);
+ if (!ctx) {
+ fprintf(stderr, "qjs: cannot allocate JS context\n");
+ exit(2);
+ }
+
+ /* loader for ES6 modules */
+ JS_SetModuleLoaderFunc(rt, NULL, js_module_loader, NULL);
+
+ if (!empty_run) {
+#ifdef CONFIG_BIGNUM
+ if (load_jscalc) {
+ js_std_eval_binary(ctx, qjscalc, qjscalc_size, 0);
+ }
+#endif
+ js_std_add_helpers(ctx, argc - optind, argv + optind);
+
+ /* system modules */
+ js_init_module_std(ctx, "std");
+ js_init_module_os(ctx, "os");
+
+ /* make 'std' and 'os' visible to non module code */
+ if (load_std) {
+ const char *str = "import * as std from 'std';\n"
+ "import * as os from 'os';\n"
+ "std.global.std = std;\n"
+ "std.global.os = os;\n";
+ eval_buf(ctx, str, strlen(str), "", JS_EVAL_TYPE_MODULE);
+ }
+
+ if (expr) {
+ if (eval_buf(ctx, expr, strlen(expr), "", 0))
+ goto fail;
+ } else
+ if (optind >= argc) {
+ /* interactive mode */
+ interactive = 1;
+ } else {
+ int eval_flags;
+ const char *filename;
+ filename = argv[optind];
+
+ if (module || has_suffix(filename, ".mjs"))
+ eval_flags = JS_EVAL_TYPE_MODULE;
+ else
+ eval_flags = JS_EVAL_TYPE_GLOBAL;
+ eval_flags |= JS_EVAL_FLAG_SHEBANG;
+ if (eval_file(ctx, filename, eval_flags))
+ goto fail;
+ }
+ if (interactive) {
+ js_std_eval_binary(ctx, repl, repl_size, 0);
+ }
+ js_std_loop(ctx);
+ }
+
+ if (dump_memory) {
+ JSMemoryUsage stats;
+ JS_ComputeMemoryUsage(rt, &stats);
+ JS_DumpMemoryUsage(stdout, &stats, rt);
+ }
+ js_std_free_handlers(rt);
+ JS_FreeContext(ctx);
+ JS_FreeRuntime(rt);
+
+ if (empty_run && dump_memory) {
+ clock_t t[5];
+ double best[5];
+ int i, j;
+ for (i = 0; i < 100; i++) {
+ t[0] = clock();
+ rt = JS_NewRuntime();
+ t[1] = clock();
+ ctx = JS_NewContext(rt);
+ t[2] = clock();
+ JS_FreeContext(ctx);
+ t[3] = clock();
+ JS_FreeRuntime(rt);
+ t[4] = clock();
+ for (j = 4; j > 0; j--) {
+ double ms = 1000.0 * (t[j] - t[j - 1]) / CLOCKS_PER_SEC;
+ if (i == 0 || best[j] > ms)
+ best[j] = ms;
+ }
+ }
+ printf("\nInstantiation times (ms): %.3f = %.3f+%.3f+%.3f+%.3f\n",
+ best[1] + best[2] + best[3] + best[4],
+ best[1], best[2], best[3], best[4]);
+ }
+ return 0;
+ fail:
+ js_std_free_handlers(rt);
+ JS_FreeContext(ctx);
+ JS_FreeRuntime(rt);
+ return 1;
+}
diff --git a/thirdparty/quickjs/quickjs-2019-07-09-dust3d/qjsc.c b/thirdparty/quickjs/quickjs-2019-07-09-dust3d/qjsc.c
new file mode 100755
index 00000000..9e6c7524
--- /dev/null
+++ b/thirdparty/quickjs/quickjs-2019-07-09-dust3d/qjsc.c
@@ -0,0 +1,636 @@
+/*
+ * QuickJS command line compiler
+ *
+ * Copyright (c) 2018-2019 Fabrice Bellard
+ *
+ * Permission is hereby granted, free of charge, to any person obtaining a copy
+ * of this software and associated documentation files (the "Software"), to deal
+ * in the Software without restriction, including without limitation the rights
+ * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+ * copies of the Software, and to permit persons to whom the Software is
+ * furnished to do so, subject to the following conditions:
+ *
+ * The above copyright notice and this permission notice shall be included in
+ * all copies or substantial portions of the Software.
+ *
+ * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+ * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+ * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
+ * THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+ * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+ * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
+ * THE SOFTWARE.
+ */
+#include
+#include
+#include
+#include
+#include
+#include
+#include
+#include
+#if !defined(_WIN32)
+#include
+#endif
+
+#include "cutils.h"
+#include "quickjs-libc.h"
+
+typedef struct {
+ char *name;
+ char *short_name;
+ int flags;
+} namelist_entry_t;
+
+typedef struct namelist_t {
+ namelist_entry_t *array;
+ int count;
+ int size;
+} namelist_t;
+
+typedef struct {
+ const char *option_name;
+ const char *init_name;
+} FeatureEntry;
+
+#define FE_ALL (-1)
+
+static namelist_t cname_list;
+static namelist_t cmodule_list;
+static namelist_t init_module_list;
+static uint64_t feature_bitmap;
+static FILE *outfile;
+static BOOL byte_swap;
+
+static const FeatureEntry feature_list[] = {
+ { "eval", "Eval" },
+ { "string-normalize", "StringNormalize" },
+ { "regexp", "RegExp" },
+ { "json", "JSON" },
+ { "proxy", "Proxy" },
+ { "map", "MapSet" },
+ { "typedarray", "TypedArrays" },
+ { "promise", "Promise" },
+};
+
+void namelist_add(namelist_t *lp, const char *name, const char *short_name,
+ int flags)
+{
+ namelist_entry_t *e;
+ if (lp->count == lp->size) {
+ size_t newsize = lp->size + (lp->size >> 1) + 4;
+ namelist_entry_t *a =
+ realloc(lp->array, sizeof(lp->array[0]) * newsize);
+ /* XXX: check for realloc failure */
+ lp->array = a;
+ lp->size = newsize;
+ }
+ e = &lp->array[lp->count++];
+ e->name = strdup(name);
+ if (short_name)
+ e->short_name = strdup(short_name);
+ else
+ e->short_name = NULL;
+ e->flags = flags;
+}
+
+void namelist_free(namelist_t *lp)
+{
+ while (lp->count > 0) {
+ namelist_entry_t *e = &lp->array[--lp->count];
+ free(e->name);
+ free(e->short_name);
+ }
+ free(lp->array);
+ lp->array = NULL;
+ lp->size = 0;
+}
+
+namelist_entry_t *namelist_find(namelist_t *lp, const char *name)
+{
+ int i;
+ for(i = 0; i < lp->count; i++) {
+ namelist_entry_t *e = &lp->array[i];
+ if (!strcmp(e->name, name))
+ return e;
+ }
+ return NULL;
+}
+
+
+static void get_c_name(char *buf, int buf_size, const char *file)
+{
+ const char *p, *r;
+ size_t len;
+
+ p = strrchr(file, '/');
+ if (!p)
+ p = file;
+ else
+ p++;
+ r = strrchr(p, '.');
+ if (!r)
+ r = p + strlen(p);
+ len = r - p;
+ if (len > buf_size - 1)
+ len = buf_size - 1;
+ memcpy(buf, p, len);
+ buf[len] = '\0';
+}
+
+static void dump_hex(FILE *f, const uint8_t *buf, size_t len)
+{
+ size_t i, col;
+ col = 0;
+ for(i = 0; i < len; i++) {
+ fprintf(f, " 0x%02x,", buf[i]);
+ if (++col == 8) {
+ fprintf(f, "\n");
+ col = 0;
+ }
+ }
+ if (col != 0)
+ fprintf(f, "\n");
+}
+
+static void output_object_code(JSContext *ctx,
+ FILE *fo, JSValueConst obj, const char *c_name,
+ BOOL load_only)
+{
+ uint8_t *out_buf;
+ size_t out_buf_len;
+ int flags;
+ flags = JS_WRITE_OBJ_BYTECODE;
+ if (byte_swap)
+ flags |= JS_WRITE_OBJ_BSWAP;
+ out_buf = JS_WriteObject(ctx, &out_buf_len, obj, flags);
+ if (!out_buf) {
+ js_std_dump_error(ctx);
+ exit(1);
+ }
+
+ namelist_add(&cname_list, c_name, NULL, load_only);
+
+ fprintf(fo, "const uint32_t %s_size = %u;\n\n",
+ c_name, (unsigned int)out_buf_len);
+ fprintf(fo, "const uint8_t %s[%u] = {\n",
+ c_name, (unsigned int)out_buf_len);
+ dump_hex(fo, out_buf, out_buf_len);
+ fprintf(fo, "};\n\n");
+
+ js_free(ctx, out_buf);
+}
+
+static int js_module_dummy_init(JSContext *ctx, JSModuleDef *m)
+{
+ /* should never be called when compiling JS code */
+ abort();
+}
+
+JSModuleDef *jsc_module_loader(JSContext *ctx,
+ const char *module_name, void *opaque)
+{
+ JSModuleDef *m;
+ namelist_entry_t *e;
+
+ /* check if it is a declared C or system module */
+ e = namelist_find(&cmodule_list, module_name);
+ if (e) {
+ /* add in the static init module list */
+ namelist_add(&init_module_list, e->name, e->short_name, 0);
+ /* create a dummy module */
+ m = JS_NewCModule(ctx, module_name, js_module_dummy_init);
+ } else if (has_suffix(module_name, ".so")) {
+ fprintf(stderr, "Warning: binary module '%s' is not compiled\n", module_name);
+ /* create a dummy module */
+ m = JS_NewCModule(ctx, module_name, js_module_dummy_init);
+ } else {
+ size_t buf_len;
+ uint8_t *buf;
+ JSValue func_val;
+ char cname[1024];
+
+ buf = js_load_file(ctx, &buf_len, module_name);
+ if (!buf) {
+ JS_ThrowReferenceError(ctx, "could not load module filename '%s'",
+ module_name);
+ return NULL;
+ }
+
+ /* compile the module */
+ func_val = JS_Eval(ctx, (char *)buf, buf_len, module_name,
+ JS_EVAL_TYPE_MODULE | JS_EVAL_FLAG_COMPILE_ONLY);
+ js_free(ctx, buf);
+ if (JS_IsException(func_val))
+ return NULL;
+ get_c_name(cname, sizeof(cname), module_name);
+ output_object_code(ctx, outfile, func_val, cname, TRUE);
+
+ /* the module is already referenced, so we must free it */
+ m = JS_VALUE_GET_PTR(func_val);
+ JS_FreeValue(ctx, func_val);
+ }
+ return m;
+}
+
+static void compile_file(JSContext *ctx, FILE *fo,
+ const char *filename,
+ const char *c_name1,
+ BOOL is_module)
+{
+ uint8_t *buf;
+ char c_name[1024];
+ int eval_flags;
+ JSValue obj;
+ size_t buf_len;
+
+ buf = js_load_file(ctx, &buf_len, filename);
+ if (!buf) {
+ fprintf(stderr, "Could not load '%s'\n", filename);
+ exit(1);
+ }
+ eval_flags = JS_EVAL_FLAG_SHEBANG | JS_EVAL_FLAG_COMPILE_ONLY;
+ if (is_module)
+ eval_flags |= JS_EVAL_TYPE_MODULE;
+ else
+ eval_flags |= JS_EVAL_TYPE_GLOBAL;
+ obj = JS_Eval(ctx, (char *)buf, buf_len, filename, eval_flags);
+ if (JS_IsException(obj)) {
+ js_std_dump_error(ctx);
+ exit(1);
+ }
+ js_free(ctx, buf);
+ if (c_name1) {
+ pstrcpy(c_name, sizeof(c_name), c_name1);
+ } else {
+ get_c_name(c_name, sizeof(c_name), filename);
+ }
+ output_object_code(ctx, fo, obj, c_name, FALSE);
+ JS_FreeValue(ctx, obj);
+}
+
+static const char main_c_template1[] =
+ "int main(int argc, char **argv)\n"
+ "{\n"
+ " JSRuntime *rt;\n"
+ " JSContext *ctx;\n"
+ " rt = JS_NewRuntime();\n"
+ ;
+
+static const char main_c_template2[] =
+ " js_std_loop(ctx);\n"
+ " JS_FreeContext(ctx);\n"
+ " JS_FreeRuntime(rt);\n"
+ " return 0;\n"
+ "}\n";
+
+#ifdef CONFIG_BIGNUM
+#define PROG_NAME "qjscbn"
+#else
+#define PROG_NAME "qjsc"
+#endif
+
+void help(void)
+{
+ printf("QuickJS Compiler version " CONFIG_VERSION "\n"
+ "usage: " PROG_NAME " [options] [files]\n"
+ "\n"
+ "options are:\n"
+ "-c only output bytecode in a C file\n"
+ "-e output main() and bytecode in a C file (default = executable output)\n"
+ "-o output set the output filename\n"
+ "-N cname set the C name of the generated data\n"
+ "-m compile as Javascript module\n"
+ "-M module_name[,cname] add initialization code for an external C module\n"
+ "-x byte swapped output\n"
+ );
+#ifdef CONFIG_LTO
+ {
+ int i;
+ printf("-flto use link time optimization\n");
+ printf("-fno-[");
+ for(i = 0; i < countof(feature_list); i++) {
+ if (i != 0)
+ printf("|");
+ printf("%s", feature_list[i].option_name);
+ }
+ printf("]\n"
+ " disable selected language features (smaller code size)\n");
+ }
+#endif
+ exit(1);
+}
+
+#if defined(CONFIG_CC) && !defined(_WIN32)
+
+int exec_cmd(char **argv)
+{
+ int pid, status, ret;
+
+ pid = fork();
+ if (pid == 0) {
+ execvp(argv[0], argv);
+ exit(1);
+ }
+
+ for(;;) {
+ ret = waitpid(pid, &status, 0);
+ if (ret == pid && WIFEXITED(status))
+ break;
+ }
+ return WEXITSTATUS(status);
+}
+
+static int output_executable(const char *out_filename, const char *cfilename,
+ BOOL use_lto, BOOL verbose, const char *exename)
+{
+ const char *argv[64];
+ const char **arg, *bn_suffix, *lto_suffix;
+ char libjsname[1024];
+ char exe_dir[1024], inc_dir[1024], lib_dir[1024], buf[1024], *p;
+ int ret;
+
+ /* get the directory of the executable */
+ pstrcpy(exe_dir, sizeof(exe_dir), exename);
+ p = strrchr(exe_dir, '/');
+ if (p) {
+ *p = '\0';
+ } else {
+ pstrcpy(exe_dir, sizeof(exe_dir), ".");
+ }
+
+ /* if 'quickjs.h' is present at the same path as the executable, we
+ use it as include and lib directory */
+ snprintf(buf, sizeof(buf), "%s/quickjs.h", exe_dir);
+ if (access(buf, R_OK) == 0) {
+ pstrcpy(inc_dir, sizeof(inc_dir), exe_dir);
+ pstrcpy(lib_dir, sizeof(lib_dir), exe_dir);
+ } else {
+ snprintf(inc_dir, sizeof(inc_dir), "%s/include/quickjs", CONFIG_PREFIX);
+ snprintf(lib_dir, sizeof(lib_dir), "%s/lib/quickjs", CONFIG_PREFIX);
+ }
+
+ lto_suffix = "";
+#ifdef CONFIG_BIGNUM
+ bn_suffix = ".bn";
+#else
+ bn_suffix = "";
+#endif
+
+ arg = argv;
+ *arg++ = CONFIG_CC;
+ *arg++ = "-O2";
+#ifdef CONFIG_LTO
+ if (use_lto) {
+ *arg++ = "-flto";
+ lto_suffix = ".lto";
+ }
+#endif
+ /* XXX: use the executable path to find the includes files and
+ libraries */
+ *arg++ = "-D";
+ *arg++ = "_GNU_SOURCE";
+ *arg++ = "-I";
+ *arg++ = inc_dir;
+ *arg++ = "-o";
+ *arg++ = out_filename;
+ *arg++ = cfilename;
+ snprintf(libjsname, sizeof(libjsname), "%s/libquickjs%s%s.a",
+ lib_dir, bn_suffix, lto_suffix);
+ *arg++ = libjsname;
+ *arg++ = "-lm";
+ *arg++ = "-ldl";
+ *arg = NULL;
+
+ if (verbose) {
+ for(arg = argv; *arg != NULL; arg++)
+ printf("%s ", *arg);
+ printf("\n");
+ }
+
+ ret = exec_cmd((char **)argv);
+ unlink(cfilename);
+ return ret;
+}
+#else
+static int output_executable(const char *out_filename, const char *cfilename,
+ BOOL use_lto, BOOL verbose, const char *exename)
+{
+ fprintf(stderr, "Executable output is not supported for this target\n");
+ exit(1);
+ return 0;
+}
+#endif
+
+
+typedef enum {
+ OUTPUT_C,
+ OUTPUT_C_MAIN,
+ OUTPUT_EXECUTABLE,
+} OutputTypeEnum;
+
+int main(int argc, char **argv)
+{
+ int c, i, verbose;
+ const char *out_filename, *cname;
+ char cfilename[1024];
+ FILE *fo;
+ JSRuntime *rt;
+ JSContext *ctx;
+ BOOL module, use_lto;
+ OutputTypeEnum output_type;
+
+ out_filename = NULL;
+ output_type = OUTPUT_EXECUTABLE;
+ cname = NULL;
+ feature_bitmap = FE_ALL;
+ module = FALSE;
+ byte_swap = FALSE;
+ verbose = 0;
+ use_lto = FALSE;
+
+ /* add system modules */
+ namelist_add(&cmodule_list, "std", "std", 0);
+ namelist_add(&cmodule_list, "os", "os", 0);
+
+ for(;;) {
+ c = getopt(argc, argv, "ho:cN:f:mxevM:");
+ if (c == -1)
+ break;
+ switch(c) {
+ case 'h':
+ help();
+ case 'o':
+ out_filename = optarg;
+ break;
+ case 'c':
+ output_type = OUTPUT_C;
+ break;
+ case 'e':
+ output_type = OUTPUT_C_MAIN;
+ break;
+ case 'N':
+ cname = optarg;
+ break;
+ case 'f':
+ {
+ const char *p;
+ p = optarg;
+ if (!strcmp(optarg, "lto")) {
+ use_lto = TRUE;
+ } else if (strstart(p, "no-", &p)) {
+ use_lto = TRUE;
+ for(i = 0; i < countof(feature_list); i++) {
+ if (!strcmp(p, feature_list[i].option_name)) {
+ feature_bitmap &= ~((uint64_t)1 << i);
+ break;
+ }
+ }
+ if (i == countof(feature_list))
+ goto bad_feature;
+ } else {
+ bad_feature:
+ fprintf(stderr, "unsupported feature: %s\n", optarg);
+ exit(1);
+ }
+ }
+ break;
+ case 'm':
+ module = TRUE;
+ break;
+ case 'M':
+ {
+ char *p;
+ char path[1024];
+ char cname[1024];
+ pstrcpy(path, sizeof(path), optarg);
+ p = strchr(path, ',');
+ if (p) {
+ *p = '\0';
+ pstrcpy(cname, sizeof(cname), p + 1);
+ } else {
+ get_c_name(cname, sizeof(cname), path);
+ }
+ namelist_add(&cmodule_list, path, cname, 0);
+ }
+ break;
+ case 'x':
+ byte_swap = TRUE;
+ break;
+ case 'v':
+ verbose++;
+ break;
+ default:
+ break;
+ }
+ }
+
+ if (optind >= argc)
+ help();
+
+ if (!out_filename) {
+ if (output_type == OUTPUT_EXECUTABLE) {
+ out_filename = "a.out";
+ } else {
+ out_filename = "out.c";
+ }
+ }
+
+ if (output_type == OUTPUT_EXECUTABLE) {
+#if defined(_WIN32) || defined(__ANDROID__)
+ /* XXX: find a /tmp directory ? */
+ snprintf(cfilename, sizeof(cfilename), "out%d.c", getpid());
+#else
+ snprintf(cfilename, sizeof(cfilename), "/tmp/out%d.c", getpid());
+#endif
+ } else {
+ pstrcpy(cfilename, sizeof(cfilename), out_filename);
+ }
+
+ fo = fopen(cfilename, "w");
+ if (!fo) {
+ perror(cfilename);
+ exit(1);
+ }
+ outfile = fo;
+
+ rt = JS_NewRuntime();
+ ctx = JS_NewContextRaw(rt);
+ JS_AddIntrinsicEval(ctx);
+ JS_AddIntrinsicRegExpCompiler(ctx);
+
+ /* loader for ES6 modules */
+ JS_SetModuleLoaderFunc(rt, NULL, jsc_module_loader, NULL);
+
+ fprintf(fo, "/* File generated automatically by the QuickJS compiler. */\n"
+ "\n"
+ );
+
+ if (output_type != OUTPUT_C) {
+ fprintf(fo, "#include \"quickjs-libc.h\"\n"
+ "\n"
+ );
+ } else {
+ fprintf(fo, "#include \n"
+ "\n"
+ );
+ }
+
+ for(i = optind; i < argc; i++) {
+ const char *filename = argv[i];
+ BOOL module1 = module || has_suffix(filename, ".mjs");
+ compile_file(ctx, fo, filename, cname, module1);
+ cname = NULL;
+ }
+
+ if (output_type != OUTPUT_C) {
+ fputs(main_c_template1, fo);
+ fprintf(fo, " ctx = JS_NewContextRaw(rt);\n");
+
+ /* add the basic objects */
+
+ fprintf(fo, " JS_AddIntrinsicBaseObjects(ctx);\n");
+ for(i = 0; i < countof(feature_list); i++) {
+ if (feature_bitmap & ((uint64_t)1 << i)) {
+ fprintf(fo, " JS_AddIntrinsic%s(ctx);\n",
+ feature_list[i].init_name);
+ }
+ }
+
+ fprintf(fo, " js_std_add_helpers(ctx, argc, argv);\n");
+
+ for(i = 0; i < init_module_list.count; i++) {
+ namelist_entry_t *e = &init_module_list.array[i];
+ /* initialize the static C modules */
+
+ fprintf(fo,
+ " {\n"
+ " extern JSModuleDef *js_init_module_%s(JSContext *ctx, const char *name);\n"
+ " js_init_module_%s(ctx, \"%s\");\n"
+ " }\n",
+ e->short_name, e->short_name, e->name);
+ }
+
+ for(i = 0; i < cname_list.count; i++) {
+ namelist_entry_t *e = &cname_list.array[i];
+ fprintf(fo, " js_std_eval_binary(ctx, %s, %s_size, %s);\n",
+ e->name, e->name,
+ e->flags ? "JS_EVAL_BINARY_LOAD_ONLY" : "0");
+ }
+ fputs(main_c_template2, fo);
+ }
+
+ JS_FreeContext(ctx);
+ JS_FreeRuntime(rt);
+
+ fclose(fo);
+
+ if (output_type == OUTPUT_EXECUTABLE) {
+ return output_executable(out_filename, cfilename, use_lto, verbose,
+ argv[0]);
+ }
+ namelist_free(&cname_list);
+ namelist_free(&cmodule_list);
+ namelist_free(&init_module_list);
+ return 0;
+}
diff --git a/thirdparty/quickjs/quickjs-2019-07-09-dust3d/qjscalc.js b/thirdparty/quickjs/quickjs-2019-07-09-dust3d/qjscalc.js
new file mode 100755
index 00000000..05f33e94
--- /dev/null
+++ b/thirdparty/quickjs/quickjs-2019-07-09-dust3d/qjscalc.js
@@ -0,0 +1,2454 @@
+/*
+ * QuickJS Javascript Calculator
+ *
+ * Copyright (c) 2017-2018 Fabrice Bellard
+ *
+ * Permission is hereby granted, free of charge, to any person obtaining a copy
+ * of this software and associated documentation files (the "Software"), to deal
+ * in the Software without restriction, including without limitation the rights
+ * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+ * copies of the Software, and to permit persons to whom the Software is
+ * furnished to do so, subject to the following conditions:
+ *
+ * The above copyright notice and this permission notice shall be included in
+ * all copies or substantial portions of the Software.
+ *
+ * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+ * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+ * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
+ * THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+ * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+ * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
+ * THE SOFTWARE.
+ */
+"use strict";
+"use math";
+
+var Integer, Float, Fraction, Complex, Mod, Polynomial, PolyMod, RationalFunction, Series, Matrix;
+
+(function(global) {
+ /* the types index are used to dispatch the operator functions */
+ var OT_INT = 0;
+ var OT_FRACTION = 10;
+ var OT_FLOAT64 = 19;
+ var OT_FLOAT = 20;
+ var OT_COMPLEX = 30;
+ var OT_MOD = 40;
+ var OT_POLY = 50;
+ var OT_POLYMOD = 55;
+ var OT_RFUNC = 60;
+ var OT_SERIES = 70;
+ var OT_ARRAY = 80;
+
+ global.Integer = global.BigInt;
+ global.algebraicMode = true;
+
+ /* add non enumerable properties */
+ function add_props(obj, props) {
+ var i, val, prop, tab, desc, prop1;
+ tab = Reflect.ownKeys(props);
+ for(i = 0; i < tab.length; i++) {
+ prop = tab[i];
+ desc = Object.getOwnPropertyDescriptor(props, prop);
+ desc.enumerable = false;
+ if ("value" in desc) {
+ if (typeof desc.value !== "function") {
+ desc.writable = false;
+ desc.configurable = false;
+ }
+ } else {
+ /* getter/setter */
+ desc.configurable = false;
+ }
+ Object.defineProperty(obj, prop, desc);
+ if (obj !== Integer) {
+ /* by default also add the non math operators */
+ switch(prop) {
+ case Symbol.operatorMathDiv:
+ prop1 = Symbol.operatorDiv;
+ break;
+ case Symbol.operatorMathMod:
+ prop1 = Symbol.operatorMod;
+ break;
+ case Symbol.operatorMathPow:
+ prop1 = Symbol.operatorPow;
+ break;
+ default:
+ prop1 = null;
+ break;
+ }
+ if (prop1)
+ Object.defineProperty(obj, prop1, desc);
+ }
+ }
+ }
+
+ /* Integer */
+
+ function generic_pow(a, b) {
+ var r, is_neg, i;
+ if (!Integer.isInteger(b)) {
+ return exp(log(a) * b);
+ }
+ if (Array.isArray(a) && !(a instanceof Polynomial ||
+ a instanceof Series)) {
+ r = idn(Matrix.check_square(a));
+ } else {
+ r = 1;
+ }
+ if (b == 0)
+ return r;
+ is_neg = false;
+ if (b < 0) {
+ is_neg = true;
+ b = -b;
+ }
+ r = a;
+ for(i = Integer.floorLog2(b) - 1; i >= 0; i--) {
+ r *= r;
+ if ((b >> i) & 1)
+ r *= a;
+ }
+ if (is_neg) {
+ if (typeof r.inverse != "function")
+ throw "negative powers are not supported for this type";
+ r = r.inverse();
+ }
+ return r;
+ }
+
+ var small_primes = [ 2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 101, 103, 107, 109, 113, 127, 131, 137, 139, 149, 151, 157, 163, 167, 173, 179, 181, 191, 193, 197, 199, 211, 223, 227, 229, 233, 239, 241, 251, 257, 263, 269, 271, 277, 281, 283, 293, 307, 311, 313, 317, 331, 337, 347, 349, 353, 359, 367, 373, 379, 383, 389, 397, 401, 409, 419, 421, 431, 433, 439, 443, 449, 457, 461, 463, 467, 479, 487, 491, 499 ];
+
+ function miller_rabin_test(n, t) {
+ var d, r, s, i, j, a;
+ d = n - 1;
+ s = 0;
+ while (d & 1) {
+ d >>= 1;
+ s++;
+ }
+ t = Math.min(t, small_primes.length);
+ loop: for(j = 0; j < t; j++) {
+ a = small_primes[j];
+ r = Integer.pmod(a, d, n);
+ if (r == 1 || r == (n - 1))
+ continue;
+ for(i = 1; i < s; i++) {
+ r = (r * r) % n;
+ if (r == 1)
+ return false;
+ if (r == (n - 1))
+ continue loop;
+ }
+ return false; /* n is composite */
+ }
+ return true; /* n is probably prime with probability (1-0.5^t) */
+ }
+
+ function fact_rec(a, b) { /* assumes a <= b */
+ var i, r;
+ if ((b - a) <= 5) {
+ r = a;
+ for(i = a + 1; i <= b; i++)
+ r *= i;
+ return r;
+ } else {
+ /* to avoid a quadratic running time it is better to
+ multiply numbers of similar size */
+ i = (a + b) >> 1;
+ return fact_rec(a, i) * fact_rec(i + 1, b);
+ }
+ }
+
+ add_props(Integer, {
+ isInteger(a) {
+ return typeof a === "bigint";
+ },
+ [Symbol.operatorOrder]: OT_INT,
+ [Symbol.operatorMathDiv](a, b) {
+ if (algebraicMode) {
+ return Fraction.toFraction(a, b);
+ } else {
+ return Float(a) / Float(b);
+ }
+ },
+ [Symbol.operatorMathPow](a, b) {
+ if (algebraicMode) {
+ return generic_pow(a, b);
+ } else {
+ return Float(a) ** Float(b);
+ }
+ },
+ gcd(a, b) {
+ var r;
+ while (b != 0) {
+ r = a % b;
+ a = b;
+ b = r;
+ }
+ return a;
+ },
+ fact(n) {
+ return n <= 0 ? 1 : fact_rec(1, n);
+ },
+ /* binomial coefficient */
+ comb(n, k) {
+ if (k < 0 || k > n)
+ return 0;
+ if (k > n - k)
+ k = n - k;
+ if (k == 0)
+ return 1;
+ return Integer.tdiv(fact_rec(n - k + 1, n), fact_rec(1, k));
+ },
+ /* inverse of x modulo y */
+ invmod(x, y) {
+ var q, u, v, a, c, t;
+ u = x;
+ v = y;
+ c = 1;
+ a = 0;
+ while (u != 0) {
+ t = Integer.fdivrem(v, u);
+ q = t[0];
+ v = u;
+ u = t[1];
+ t = c;
+ c = a - q * c;
+ a = t;
+ }
+ /* v = gcd(x, y) */
+ if (v != 1)
+ throw RangeError("not invertible");
+ return a % y;
+ },
+ /* return a ^ b modulo m */
+ pmod(a, b, m) {
+ var r;
+ if (b == 0)
+ return 1;
+ if (b < 0) {
+ a = Integer.invmod(a, m);
+ b = -b;
+ }
+ r = 1;
+ for(;;) {
+ if (b & 1) {
+ r = (r * a) % m;
+ }
+ b >>= 1;
+ if (b == 0)
+ break;
+ a = (a * a) % m;
+ }
+ return r;
+ },
+
+ /* return true if n is prime (or probably prime with
+ probability 1-0.5^t) */
+ isPrime(n, t) {
+ var i, d, n1;
+ if (!Integer.isInteger(n))
+ throw TypeError("invalid type");
+ if (n <= 1)
+ return false;
+ n1 = small_primes.length;
+ /* XXX: need Integer.sqrt() */
+ for(i = 0; i < n1; i++) {
+ d = small_primes[i];
+ if (d == n)
+ return true;
+ if (d > n)
+ return false;
+ if ((n % d) == 0)
+ return false;
+ }
+ if (n < d * d)
+ return true;
+ if (typeof t == "undefined")
+ t = 64;
+ return miller_rabin_test(n, t);
+ },
+ nextPrime(n) {
+ if (!Integer.isInteger(n))
+ throw TypeError("invalid type");
+ if (n < 1)
+ n = 1;
+ for(;;) {
+ n++;
+ if (Integer.isPrime(n))
+ return n;
+ }
+ },
+ factor(n) {
+ var r, d;
+ if (!Integer.isInteger(n))
+ throw TypeError("invalid type");
+ r = [];
+ if (abs(n) <= 1) {
+ r.push(n);
+ return r;
+ }
+ if (n < 0) {
+ r.push(-1);
+ n = -n;
+ }
+
+ while ((n % 2) == 0) {
+ n >>= 1;
+ r.push(2);
+ }
+
+ d = 3;
+ while (n != 1) {
+ if (Integer.isPrime(n)) {
+ r.push(n);
+ break;
+ }
+ /* we are sure there is at least one divisor, so one test */
+ for(;;) {
+ if ((n % d) == 0)
+ break;
+ d += 2;
+ }
+ for(;;) {
+ r.push(d);
+ n = Integer.tdiv(n, d);
+ if ((n % d) != 0)
+ break;
+ }
+ }
+ return r;
+ },
+ });
+
+ add_props(Integer.prototype, {
+ inverse() {
+ return 1 / this;
+ },
+ norm2() {
+ return this * this;
+ },
+ abs() {
+ return Math.abs(this);
+ },
+ conj() {
+ return this;
+ },
+ arg() {
+ if (this >= 0)
+ return 0;
+ else
+ return Float.PI;
+ },
+ exp() {
+ if (this == 0)
+ return 1;
+ else
+ return Float.exp(this);
+ },
+ log() {
+ if (this == 1)
+ return 0;
+ else
+ return Float(this).log();
+ },
+ });
+
+ /* Fraction */
+
+ Fraction = function Fraction(a, b)
+ {
+ var d, r, obj;
+
+ if (new.target)
+ throw TypeError("not a constructor");
+ if (a instanceof Fraction)
+ return a;
+ if (!Integer.isInteger(a))
+ throw TypeError("integer expected");
+ if (typeof b === "undefined") {
+ b = 1;
+ } else {
+ if (!Integer.isInteger(b))
+ throw TypeError("integer expected");
+ if (b == 0)
+ throw RangeError("division by zero");
+ d = Integer.gcd(a, b);
+ if (d != 1) {
+ a = Integer.tdiv(a, d);
+ b = Integer.tdiv(b, d);
+ }
+
+ /* the fractions are normalized with den > 0 */
+ if (b < 0) {
+ a = -a;
+ b = -b;
+ }
+ }
+ obj = Object.create(Fraction.prototype);
+ obj.num = a;
+ obj.den = b;
+ return obj;
+ }
+
+ add_props(Fraction, {
+ [Symbol.operatorOrder]: OT_FRACTION,
+ /* (internal use) simplify 'a' to an integer when possible */
+ toFraction(a, b) {
+ var r = Fraction(a, b);
+ if (algebraicMode && r.den == 1)
+ return r.num;
+ else
+ return r;
+ },
+
+ [Symbol.operatorAdd](a, b) {
+ a = Fraction(a);
+ b = Fraction(b);
+ return Fraction.toFraction(a.num * b.den + a.den * b.num, a.den * b.den);
+ },
+ [Symbol.operatorSub](a, b) {
+ a = Fraction(a);
+ b = Fraction(b);
+ return Fraction.toFraction(a.num * b.den - a.den * b.num, a.den * b.den);
+ },
+ [Symbol.operatorMul](a, b) {
+ a = Fraction(a);
+ b = Fraction(b);
+ return Fraction.toFraction(a.num * b.num, a.den * b.den);
+ },
+ [Symbol.operatorMathDiv](a, b) {
+ a = Fraction(a);
+ b = Fraction(b);
+ return Fraction.toFraction(a.num * b.den, a.den * b.num);
+ },
+ [Symbol.operatorMathMod](a, b) {
+ var a1 = Fraction(a);
+ var b1 = Fraction(b);
+ return a - Integer.ediv(a1.num * b1.den, a1.den * b1.num) * b;
+ },
+ [Symbol.operatorMathPow]: generic_pow,
+ [Symbol.operatorCmpEQ](a, b) {
+ a = Fraction(a);
+ b = Fraction(b);
+ /* we assume the fractions are normalized */
+ return (a.num == b.num && a.den == b.den);
+ },
+ [Symbol.operatorCmpLT](a, b) {
+ a = Fraction(a);
+ b = Fraction(b);
+ return (a.num * b.den < b.num * a.den);
+ },
+ [Symbol.operatorCmpLE](a, b) {
+ a = Fraction(a);
+ b = Fraction(b);
+ return (a.num * b.den <= b.num * a.den);
+ },
+ });
+
+ add_props(Fraction.prototype, {
+ [Symbol.toPrimitive](hint) {
+ if (hint === "integer") {
+ return Integer.tdiv(this.num, this.den);
+ } else if (hint === "string") {
+ return this.toString();
+ } else {
+ return Float(this.num) / this.den;
+ }
+ },
+ [Symbol.operatorPlus]() {
+ return this;
+ },
+ [Symbol.operatorNeg]() {
+ return Fraction(-this.num, this.den);
+ },
+ inverse() {
+ return Fraction(this.den, this.num);
+ },
+ toString() {
+ return this.num + "/" + this.den;
+ },
+ norm2() {
+ return this * this;
+ },
+ abs() {
+ if (this.num < 0)
+ return this[Symbol.operatorNeg]();
+ else
+ return this;
+ },
+ conj() {
+ return this;
+ },
+ arg() {
+ if (this.num >= 0)
+ return 0;
+ else
+ return Float.PI;
+ },
+ exp() {
+ return Float.exp(Float(this));
+ },
+ log() {
+ return Float(this).log();
+ },
+ });
+
+ /* Number (Float64) */
+
+ add_props(Number, {
+ [Symbol.operatorOrder]: OT_FLOAT64,
+ /* operators are needed for fractions */
+ [Symbol.operatorAdd](a, b) {
+ return Number(a) + Number(b);
+ },
+ [Symbol.operatorSub](a, b) {
+ return Number(a) - Number(b);
+ },
+ [Symbol.operatorMul](a, b) {
+ return Number(a) * Number(b);
+ },
+ [Symbol.operatorMathDiv](a, b) {
+ return Number(a) / Number(b);
+ },
+ [Symbol.operatorMathPow](a, b) {
+ return Number(a) ** Number(b);
+ },
+ });
+
+ add_props(Number.prototype, {
+ inverse() {
+ return 1.0 / this;
+ },
+ norm2() {
+ return this * this;
+ },
+ abs() {
+ return Math.abs(this);
+ },
+ conj() {
+ return this;
+ },
+ arg() {
+ if (this >= 0)
+ return 0;
+ else
+ return Float.PI;
+ },
+ exp() {
+ return Float.exp(this);
+ },
+ log() {
+ if (this < 0) {
+ return Complex(this).log();
+ } else {
+ return Float.log(this);
+ }
+ },
+ });
+
+ /* Float */
+
+ global.Float = global.BigFloat;
+
+ var const_tab = [];
+
+ /* we cache the constants for small precisions */
+ function get_const(n) {
+ var t, c, p;
+ t = const_tab[n];
+ p = BigFloatEnv.prec;
+ if (t && t.prec == p) {
+ return t.val;
+ } else {
+ switch(n) {
+ case 0: c = Float.exp(1); break;
+ case 1: c = Float.log(10); break;
+// case 2: c = Float.log(2); break;
+ case 3: c = 1/Float.log(2); break;
+ case 4: c = 1/Float.log(10); break;
+// case 5: c = Float.atan(1) * 4; break;
+ case 6: c = Float.sqrt(0.5); break;
+ case 7: c = Float.sqrt(2); break;
+ }
+ if (p <= 1024) {
+ const_tab[n] = { prec: p, val: c };
+ }
+ return c;
+ }
+ }
+
+ add_props(Float, {
+ isFloat(a) {
+ return typeof a === "number" || typeof a === "bigfloat";
+ },
+ bestappr(u, b) {
+ var num1, num0, den1, den0, u, num, den, n;
+
+ if (typeof b === "undefined")
+ throw TypeError("second argument expected");
+ num1 = 1;
+ num0 = 0;
+ den1 = 0;
+ den0 = 1;
+ for(;;) {
+ n = Integer(Float.floor(u));
+ num = n * num1 + num0;
+ den = n * den1 + den0;
+ if (den > b)
+ break;
+ u = 1.0 / (u - n);
+ num0 = num1;
+ num1 = num;
+ den0 = den1;
+ den1 = den;
+ }
+ return Fraction(num1, den1);
+ },
+ /* similar constants as Math.x */
+ get E() { return get_const(0); },
+ get LN10() { return get_const(1); },
+// get LN2() { return get_const(2); },
+ get LOG2E() { return get_const(3); },
+ get LOG10E() { return get_const(4); },
+// get PI() { return get_const(5); },
+ get SQRT1_2() { return get_const(6); },
+ get SQRT2() { return get_const(7); },
+ });
+
+ add_props(Float, {
+ [Symbol.operatorOrder]: OT_FLOAT,
+ /* operators are needed for fractions */
+ [Symbol.operatorAdd](a, b) {
+ return Float(a) + Float(b);
+ },
+ [Symbol.operatorSub](a, b) {
+ return Float(a) - Float(b);
+ },
+ [Symbol.operatorMul](a, b) {
+ return Float(a) * Float(b);
+ },
+ [Symbol.operatorMathDiv](a, b) {
+ return Float(a) / Float(b);
+ },
+ [Symbol.operatorMathPow](a, b) {
+ return Float(a) ** Float(b);
+ },
+ });
+
+ add_props(Float.prototype, {
+ inverse() {
+ return 1.0 / this;
+ },
+ norm2() {
+ return this * this;
+ },
+ abs() {
+ return Math.abs(this);
+ },
+ conj() {
+ return this;
+ },
+ arg() {
+ if (this >= 0)
+ return 0;
+ else
+ return Float.PI;
+ },
+ exp() {
+ return Float.exp(this);
+ },
+ log() {
+ if (this < 0) {
+ return Complex(this).log();
+ } else {
+ return Float.log(this);
+ }
+ },
+ });
+
+ /* Complex */
+
+ Complex = function Complex(re, im)
+ {
+ var obj;
+ if (new.target)
+ throw TypeError("not a constructor");
+ if (re instanceof Complex)
+ return re;
+ if (typeof im === "undefined") {
+ im = 0;
+ }
+ obj = Object.create(Complex.prototype);
+ obj.re = re;
+ obj.im = im;
+ return obj;
+ }
+
+ add_props(Complex, {
+ [Symbol.operatorOrder]: OT_COMPLEX,
+ /* simplify to real number when possible */
+ toComplex(re, im) {
+ if (algebraicMode && im == 0)
+ return re;
+ else
+ return Complex(re, im);
+ },
+
+ [Symbol.operatorAdd](a, b) {
+ a = Complex(a);
+ b = Complex(b);
+ return Complex.toComplex(a.re + b.re, a.im + b.im);
+ },
+ [Symbol.operatorSub](a, b) {
+ a = Complex(a);
+ b = Complex(b);
+ return Complex.toComplex(a.re - b.re, a.im - b.im);
+ },
+ [Symbol.operatorMul](a, b) {
+ a = Complex(a);
+ b = Complex(b);
+ return Complex.toComplex(a.re * b.re - a.im * b.im,
+ a.re * b.im + a.im * b.re);
+ },
+ [Symbol.operatorMathDiv](a, b) {
+ a = Complex(a);
+ b = Complex(b);
+ return a * b.inverse();
+ },
+ [Symbol.operatorMathPow]: generic_pow,
+ [Symbol.operatorCmpEQ](a, b) {
+ a = Complex(a);
+ b = Complex(b);
+ return a.re == b.re && a.im == b.im;
+ }
+ });
+
+ add_props(Complex.prototype, {
+ [Symbol.operatorPlus]() {
+ return this;
+ },
+ [Symbol.operatorNeg]() {
+ return Complex(-this.re, -this.im);
+ },
+ inverse() {
+ var c = this.norm2();
+ return Complex(this.re / c, -this.im / c);
+ },
+ toString() {
+ var v, s = "", a = this;
+ if (a.re != 0)
+ s += a.re.toString();
+ if (a.im == 1) {
+ if (s != "")
+ s += "+";
+ s += "I";
+ } else if (a.im == -1) {
+ s += "-I";
+ } else {
+ v = a.im.toString();
+ if (v[0] != "-" && s != "")
+ s += "+";
+ s += v + "*I";
+ }
+ return s;
+ },
+ norm2() {
+ return this.re * this.re + this.im * this.im;
+ },
+ abs() {
+ return Float.sqrt(norm2(this));
+ },
+ conj() {
+ return Complex(this.re, -this.im);
+ },
+ arg() {
+ return Float.atan2(this.im, this.re);
+ },
+ exp() {
+ var arg = this.im, r = this.re.exp();
+ return Complex(r * cos(arg), r * sin(arg));
+ },
+ log() {
+ return Complex(abs(this).log(), atan2(this.im, this.re));
+ },
+ });
+
+ /* Mod */
+
+ Mod = function Mod(a, m) {
+ var obj, t;
+ if (new.target)
+ throw TypeError("not a constructor");
+ obj = Object.create(Mod.prototype);
+ if (Integer.isInteger(m)) {
+ if (m <= 0)
+ throw RangeError("the modulo cannot be <= 0");
+ if (Integer.isInteger(a)) {
+ a %= m;
+ } else if (a instanceof Fraction) {
+ return Mod(a.num, m) / a.den;
+ } else {
+ throw TypeError("invalid types");
+ }
+ } else {
+ throw TypeError("invalid types");
+ }
+ obj.res = a;
+ obj.mod = m;
+ return obj;
+ };
+
+ add_props(Mod.prototype, {
+ [Symbol.operatorPlus]() {
+ return this;
+ },
+ [Symbol.operatorNeg]() {
+ return Mod(-this.res, this.mod);
+ },
+ inverse() {
+ var a = this, m = a.mod;
+ if (Integer.isInteger(m)) {
+ return Mod(Integer.invmod(a.res, m), m);
+ } else {
+ throw TypeError("unsupported type");
+ }
+ },
+ toString() {
+ return "Mod(" + this.res + "," + this.mod + ")";
+ },
+ });
+
+ add_props(Mod, {
+ [Symbol.operatorOrder]: OT_MOD,
+ [Symbol.operatorAdd](a, b) {
+ if (!(a instanceof Mod)) {
+ return Mod(a + b.res, b.mod);
+ } else if (!(b instanceof Mod)) {
+ return Mod(a.res + b, a.mod);
+ } else {
+ if (a.mod != b.mod)
+ throw TypeError("different modulo for binary operator");
+ return Mod(a.res + b.res, a.mod);
+ }
+ },
+ [Symbol.operatorSub](a, b) {
+ if (!(a instanceof Mod)) {
+ return Mod(a - b.res, b.mod);
+ } else if (!(b instanceof Mod)) {
+ return Mod(a.res - b, a.mod);
+ } else {
+ if (a.mod != b.mod)
+ throw TypeError("different modulo for binary operator");
+ return Mod(a.res - b.res, a.mod);
+ }
+ },
+ [Symbol.operatorMul](a, b) {
+ if (!(a instanceof Mod)) {
+ return Mod(a * b.res, b.mod);
+ } else if (!(b instanceof Mod)) {
+ return Mod(a.res * b, a.mod);
+ } else {
+ if (a.mod != b.mod)
+ throw TypeError("different modulo for binary operator");
+ return Mod(a.res * b.res, a.mod);
+ }
+ },
+ [Symbol.operatorMathDiv](a, b) {
+ if (!(b instanceof Mod))
+ b = Mod(b, a.mod);
+ return Mod[Symbol.operatorMul](a, b.inverse());
+ },
+ [Symbol.operatorMathPow]: generic_pow,
+ [Symbol.operatorCmpEQ](a, b) {
+ if (!(a instanceof Mod) ||
+ !(b instanceof Mod))
+ return false;
+ return (a.mod == b.mod && a.res == b.res);
+ }
+ });
+
+ /* Polynomial */
+
+ Polynomial = function Polynomial(a)
+ {
+ if (new.target)
+ throw TypeError("not a constructor");
+ if (a instanceof Polynomial) {
+ return a;
+ } else if (Array.isArray(a)) {
+ if (a.length == 0)
+ a = [ 0 ];
+ Object.setPrototypeOf(a, Polynomial.prototype);
+ return a.trim();
+ } else if (a.constructor[Symbol.operatorOrder] <= OT_MOD) {
+ a = [a];
+ Object.setPrototypeOf(a, Polynomial.prototype);
+ return a;
+ } else {
+ throw TypeError("invalid type");
+ }
+ }
+
+ function number_need_paren(c)
+ {
+ return !(Integer.isInteger(c) ||
+ Float.isFloat(c) ||
+ c instanceof Fraction ||
+ (c instanceof Complex && c.re == 0));
+ }
+
+ /* string for c*X^i */
+ function monomial_toString(c, i)
+ {
+ var str1;
+ if (i == 0) {
+ str1 = c.toString();
+ } else {
+ if (c == 1) {
+ str1 = "";
+ } else if (c == -1) {
+ str1 = "-";
+ } else {
+ if (number_need_paren(c)) {
+ str1 = "(" + c + ")";
+ } else {
+ str1 = String(c);
+ }
+ str1 += "*";
+ }
+ str1 += "X";
+ if (i != 1) {
+ str1 += "^" + i;
+ }
+ }
+ return str1;
+ }
+
+ /* find one complex root of 'p' starting from z at precision eps using
+ at most max_it iterations. Return null if could not find root. */
+ function poly_root_laguerre1(p, z, max_it)
+ {
+ var p1, p2, i, z0, z1, z2, d, t0, t1, d1, d2, e, el, zl;
+
+ d = p.deg();
+ if (d == 1) {
+ /* monomial case */
+ return -p[0] / p[1];
+ }
+ /* trivial zero */
+ if (p[0] == 0)
+ return 0.0;
+
+ p1 = p.deriv();
+ p2 = p1.deriv();
+ el = 0.0;
+ zl = 0.0;
+ for(i = 0; i < max_it; i++) {
+ z0 = p.apply(z);
+ if (z0 == 0)
+ return z; /* simple exit case */
+
+ /* Ward stopping criteria */
+ e = abs(z - zl);
+// print("e", i, e);
+ if (i >= 2 && e >= el) {
+ if (abs(zl) < 1e-4) {
+ if (e < 1e-7)
+ return zl;
+ } else {
+ if (e < abs(zl) * 1e-3)
+ return zl;
+ }
+ }
+ el = e;
+ zl = z;
+
+ z1 = p1.apply(z);
+ z2 = p2.apply(z);
+ t0 = (d - 1) * z1;
+ t0 = t0 * t0;
+ t1 = d * (d - 1) * z0 * z2;
+ t0 = sqrt(t0 - t1);
+ d1 = z1 + t0;
+ d2 = z1 - t0;
+ if (norm2(d2) > norm2(d1))
+ d1 = d2;
+ if (d1 == 0)
+ return null;
+ z = z - d * z0 / d1;
+ }
+ return null;
+ }
+
+ function poly_roots(p)
+ {
+ var d, i, roots, j, z, eps;
+ var start_points = [ 0.1, -1.4, 1.7 ];
+
+ if (!(p instanceof Polynomial))
+ throw TypeError("polynomial expected");
+ d = p.deg();
+ if (d <= 0)
+ return [];
+ eps = 2.0 ^ (-BigFloatEnv.prec);
+ roots = [];
+ for(i = 0; i < d; i++) {
+ /* XXX: should select another start point if error */
+ for(j = 0; j < 3; j++) {
+ z = poly_root_laguerre1(p, start_points[j], 100);
+ if (z !== null)
+ break;
+ }
+ if (j == 3)
+ throw RangeError("error in root finding algorithm");
+ roots[i] = z;
+ p = Polynomial.divrem(p, X - z)[0];
+ }
+ return roots;
+ }
+
+ add_props(Polynomial.prototype, {
+ trim() {
+ var a = this, i;
+ i = a.length;
+ while (i > 1 && a[i - 1] == 0)
+ i--;
+ a.length = i;
+ return a;
+ },
+ [Symbol.operatorPlus]() {
+ return this;
+ },
+ [Symbol.operatorNeg]() {
+ var r, i, n, a;
+ a = this;
+ n = a.length;
+ r = [];
+ for(i = 0; i < n; i++)
+ r[i] = -a[i];
+ return Polynomial(r);
+ },
+ conj() {
+ var r, i, n, a;
+ a = this;
+ n = a.length;
+ r = [];
+ for(i = 0; i < n; i++)
+ r[i] = a[i].conj();
+ return Polynomial(r);
+ },
+ inverse() {
+ return RationalFunction(Polynomial([1]), this);
+ },
+ toString() {
+ var i, str, str1, c, a = this;
+ if (a.length == 1) {
+ return a[0].toString();
+ }
+ str="";
+ for(i = a.length - 1; i >= 0; i--) {
+ c = a[i];
+ if (c == 0 ||
+ (c instanceof Mod) && c.res == 0)
+ continue;
+ str1 = monomial_toString(c, i);
+ if (str1[0] != "-") {
+ if (str != "")
+ str += "+";
+ }
+ str += str1;
+ }
+ return str;
+ },
+ deg() {
+ if (this.length == 1 && this[0] == 0)
+ return -Infinity;
+ else
+ return this.length - 1;
+ },
+ apply(b) {
+ var i, n, r, a = this;
+ n = a.length - 1;
+ r = a[n];
+ while (n > 0) {
+ n--;
+ r = r * b + a[n];
+ }
+ return r;
+ },
+ deriv() {
+ var a = this, n, r, i;
+ n = a.length;
+ if (n == 1) {
+ return Polynomial(0);
+ } else {
+ r = [];
+ for(i = 1; i < n; i++) {
+ r[i - 1] = i * a[i];
+ }
+ return Polynomial(r);
+ }
+ },
+ integ() {
+ var a = this, n, r, i;
+ n = a.length;
+ r = [0];
+ for(i = 0; i < n; i++) {
+ r[i + 1] = a[i] / (i + 1);
+ }
+ return Polynomial(r);
+ },
+ norm2() {
+ var a = this, n, r, i;
+ n = a.length;
+ r = 0;
+ for(i = 0; i < n; i++) {
+ r += a[i].norm2();
+ }
+ return r;
+ },
+ });
+
+ add_props(Polynomial, {
+ [Symbol.operatorOrder]: OT_POLY,
+ [Symbol.operatorAdd](a, b) {
+ var tmp, r, i, n1, n2;
+ a = Polynomial(a);
+ b = Polynomial(b);
+ if (a.length < b.length) {
+ tmp = a;
+ a = b;
+ b = tmp;
+ }
+ n1 = b.length;
+ n2 = a.length;
+ r = [];
+ for(i = 0; i < n1; i++)
+ r[i] = a[i] + b[i];
+ for(i = n1; i < n2; i++)
+ r[i] = a[i];
+ return Polynomial(r);
+ },
+ [Symbol.operatorSub](a, b) {
+ return Polynomial[Symbol.operatorAdd](a, -b);
+ },
+ [Symbol.operatorMul](a, b) {
+ var i, j, n1, n2, n, r;
+ a = Polynomial(a);
+ b = Polynomial(b);
+ n1 = a.length;
+ n2 = b.length;
+ n = n1 + n2 - 1;
+ r = [];
+ for(i = 0; i < n; i++)
+ r[i] = 0;
+ for(i = 0; i < n1; i++) {
+ for(j = 0; j < n2; j++) {
+ r[i + j] += a[i] * b[j];
+ }
+ }
+ return Polynomial(r);
+ },
+ [Symbol.operatorMathDiv](a, b) {
+ if (b.constructor[Symbol.operatorOrder] <= OT_COMPLEX)
+ return a * (1 / b);
+ else
+ return RationalFunction(Polynomial(a),
+ Polynomial(b));
+ },
+ [Symbol.operatorMathPow]: generic_pow,
+ [Symbol.operatorMathMod](a, b) {
+ return Polynomial.divrem(a, b)[1];
+ },
+ [Symbol.operatorCmpEQ](a, b) {
+ var n, i;
+ if (!(a instanceof Polynomial) ||
+ !(b instanceof Polynomial))
+ return false;
+ n = a.length;
+ if (n != b.length)
+ return false;
+ for(i = 0; i < n; i++) {
+ if (a[i] != b[i])
+ return false;
+ }
+ return true;
+ },
+ divrem(a, b) {
+ var n1, n2, i, j, q, r, n, c;
+ if (b.deg() < 0)
+ throw RangeError("division by zero");
+ n1 = a.length;
+ n2 = b.length;
+ if (n1 < n2)
+ return [Polynomial([0]), a];
+ r = Array.prototype.dup.call(a);
+ q = [];
+ n2--;
+ n = n1 - n2;
+ for(i = 0; i < n; i++)
+ q[i] = 0;
+ for(i = n - 1; i >= 0; i--) {
+ c = r[i + n2];
+ if (c != 0) {
+ c = c / b[n2];
+ r[i + n2] = 0;
+ for(j = 0; j < n2; j++) {
+ r[i + j] -= b[j] * c;
+ }
+ q[i] = c;
+ }
+ }
+ return [Polynomial(q), Polynomial(r)];
+ },
+ gcd(a, b) {
+ var t;
+ while (b.deg() >= 0) {
+ t = Polynomial.divrem(a, b);
+ a = b;
+ b = t[1];
+ }
+ /* convert to monic form */
+ return a / a[a.length - 1];
+ },
+ invmod(x, y) {
+ var q, u, v, a, c, t;
+ u = x;
+ v = y;
+ c = Polynomial([1]);
+ a = Polynomial([0]);
+ while (u.deg() >= 0) {
+ t = Polynomial.divrem(v, u);
+ q = t[0];
+ v = u;
+ u = t[1];
+ t = c;
+ c = a - q * c;
+ a = t;
+ }
+ /* v = gcd(x, y) */
+ if (v.deg() > 0)
+ throw RangeError("not invertible");
+ return Polynomial.divrem(a, y)[1];
+ },
+ roots(p) {
+ return poly_roots(p);
+ }
+ });
+
+ /* Polynomial Modulo Q */
+
+ PolyMod = function PolyMod(a, m) {
+ var obj, t;
+ if (new.target)
+ throw TypeError("not a constructor");
+ obj = Object.create(PolyMod.prototype);
+ if (m instanceof Polynomial) {
+ if (m.deg() <= 0)
+ throw RangeError("the modulo cannot have a degree <= 0");
+ if (a instanceof RationalFunction) {
+ return PolyMod(a.num, m) / a.den;
+ } else {
+ a = Polynomial(a);
+ t = Polynomial.divrem(a, m);
+ a = t[1];
+ }
+ } else {
+ throw TypeError("invalid types");
+ }
+ obj.res = a;
+ obj.mod = m;
+ return obj;
+ };
+
+ add_props(PolyMod.prototype, {
+ [Symbol.operatorPlus]() {
+ return this;
+ },
+ [Symbol.operatorNeg]() {
+ return PolyMod(-this.res, this.mod);
+ },
+ inverse() {
+ var a = this, m = a.mod;
+ if (m instanceof Polynomial) {
+ return PolyMod(Polynomial.invmod(a.res, m), m);
+ } else {
+ throw TypeError("unsupported type");
+ }
+ },
+ toString() {
+ return "PolyMod(" + this.res + "," + this.mod + ")";
+ },
+ });
+
+ add_props(PolyMod, {
+ [Symbol.operatorOrder]: OT_POLYMOD,
+ [Symbol.operatorAdd](a, b) {
+ if (!(a instanceof PolyMod)) {
+ return PolyMod(a + b.res, b.mod);
+ } else if (!(b instanceof PolyMod)) {
+ return PolyMod(a.res + b, a.mod);
+ } else {
+ if (a.mod != b.mod)
+ throw TypeError("different modulo for binary operator");
+ return PolyMod(a.res + b.res, a.mod);
+ }
+ },
+ [Symbol.operatorSub](a, b) {
+ if (!(a instanceof PolyMod)) {
+ return PolyMod(a - b.res, b.mod);
+ } else if (!(b instanceof PolyMod)) {
+ return PolyMod(a.res - b, a.mod);
+ } else {
+ if (a.mod != b.mod)
+ throw TypeError("different modulo for binary operator");
+ return PolyMod(a.res - b.res, a.mod);
+ }
+ },
+ [Symbol.operatorMul](a, b) {
+ if (!(a instanceof PolyMod)) {
+ return PolyMod(a * b.res, b.mod);
+ } else if (!(b instanceof PolyMod)) {
+ return PolyMod(a.res * b, a.mod);
+ } else {
+ if (a.mod != b.mod)
+ throw TypeError("different modulo for binary operator");
+ return PolyMod(a.res * b.res, a.mod);
+ }
+ },
+ [Symbol.operatorMathDiv](a, b) {
+ if (!(b instanceof PolyMod))
+ b = PolyMod(b, a.mod);
+ return PolyMod[Symbol.operatorMul](a, b.inverse());
+ },
+ [Symbol.operatorMathPow]: generic_pow,
+ [Symbol.operatorCmpEQ](a, b) {
+ if (!(a instanceof PolyMod) ||
+ !(b instanceof PolyMod))
+ return false;
+ return (a.mod == b.mod && a.res == b.res);
+ }
+ });
+
+ /* Rational function */
+
+ RationalFunction = function RationalFunction(a, b)
+ {
+ var t, r, d, obj;
+ if (new.target)
+ throw TypeError("not a constructor");
+ if (!(a instanceof Polynomial) ||
+ !(b instanceof Polynomial))
+ throw TypeError("polynomial expected");
+ t = Polynomial.divrem(a, b);
+ r = t[1];
+ if (r.deg() < 0)
+ return t[0]; /* no need for a fraction */
+ d = Polynomial.gcd(b, r);
+ if (d.deg() > 0) {
+ a = Polynomial.divrem(a, d)[0];
+ b = Polynomial.divrem(b, d)[0];
+ }
+ obj = Object.create(RationalFunction.prototype);
+ obj.num = a;
+ obj.den = b;
+ return obj;
+ }
+
+ add_props(RationalFunction.prototype, {
+ [Symbol.operatorPlus]() {
+ return this;
+ },
+ [Symbol.operatorNeg]() {
+ return RationalFunction(-this.num, this.den);
+ },
+ inverse() {
+ return RationalFunction(this.den, this.num);
+ },
+ conj() {
+ return RationalFunction(this.num.conj(), this.den.conj());
+ },
+ toString() {
+ var str;
+ if (this.num.deg() <= 0 &&
+ !number_need_paren(this.num[0]))
+ str = this.num.toString();
+ else
+ str = "(" + this.num.toString() + ")";
+ str += "/(" + this.den.toString() + ")"
+ return str;
+ },
+ apply(b) {
+ return this.num.apply(b) / this.den.apply(b);
+ },
+ deriv() {
+ var n = this.num, d = this.den;
+ return RationalFunction(n.deriv() * d - n * d.deriv(), d * d);
+ },
+ });
+
+ add_props(RationalFunction, {
+ [Symbol.operatorOrder]: OT_RFUNC,
+ /* This function always return a RationalFunction object even
+ if it could simplified to a polynomial, so it is not
+ equivalent to RationalFunction(a) */
+ toRationalFunction(a) {
+ var obj;
+ if (a instanceof RationalFunction) {
+ return a;
+ } else {
+ obj = Object.create(RationalFunction.prototype);
+ obj.num = Polynomial(a);
+ obj.den = Polynomial(1);
+ return obj;
+ }
+ },
+ [Symbol.operatorAdd](a, b) {
+ a = RationalFunction.toRationalFunction(a);
+ b = RationalFunction.toRationalFunction(b);
+ return RationalFunction(a.num * b.den + a.den * b.num, a.den * b.den);
+ },
+ [Symbol.operatorSub](a, b) {
+ a = RationalFunction.toRationalFunction(a);
+ b = RationalFunction.toRationalFunction(b);
+ return RationalFunction(a.num * b.den - a.den * b.num, a.den * b.den);
+ },
+ [Symbol.operatorMul](a, b) {
+ a = RationalFunction.toRationalFunction(a);
+ b = RationalFunction.toRationalFunction(b);
+ return RationalFunction(a.num * b.num, a.den * b.den);
+ },
+ [Symbol.operatorMathDiv](a, b) {
+ a = RationalFunction.toRationalFunction(a);
+ b = RationalFunction.toRationalFunction(b);
+ return RationalFunction(a.num * b.den, a.den * b.num);
+ },
+ [Symbol.operatorMathPow]: generic_pow,
+ [Symbol.operatorCmpEQ](a, b) {
+ a = RationalFunction.toRationalFunction(a);
+ b = RationalFunction.toRationalFunction(b);
+ /* we assume the fractions are normalized */
+ return (a.num == b.num && a.den == b.den);
+ },
+ });
+
+ /* Power series */
+
+ /* 'a' is an array */
+ function get_emin(a) {
+ var i, n;
+ n = a.length;
+ for(i = 0; i < n; i++) {
+ if (a[i] != 0)
+ return i;
+ }
+ return n;
+ };
+
+ /* n is the maximum number of terms if 'a' is not a serie */
+ Series = function Series(a, n) {
+ var emin, r, i;
+
+ if (a instanceof Series) {
+ return a;
+ } else if (a.constructor[Symbol.operatorOrder] <= OT_POLY) {
+ if (n <= 0) {
+ /* XXX: should still use the polynomial degree */
+ return Series.zero(0, 0);
+ } else {
+ a = Polynomial(a);
+ emin = get_emin(a);
+ r = Series.zero(n, emin);
+ n = Math.min(a.length - emin, n);
+ for(i = 0; i < n; i++)
+ r[i] = a[i + emin];
+ return r;
+ }
+ } else if (a instanceof RationalFunction) {
+ return Series(a.num, n) / a.den;
+ } else {
+ throw TypeError("invalid type");
+ }
+ };
+
+ add_props(Series.prototype, {
+ [Symbol.operatorPlus]() {
+ return this;
+ },
+ [Symbol.operatorNeg]() {
+ var obj, n, i;
+ n = this.length;
+ obj = Series.zero(this.length, this.emin);
+ for(i = 0; i < n; i++) {
+ obj[i] = -this[i];
+ }
+ return obj;
+ },
+ conj() {
+ var obj, n, i;
+ n = this.length;
+ obj = Series.zero(this.length, this.emin);
+ for(i = 0; i < n; i++) {
+ obj[i] = this[i].conj();
+ }
+ return obj;
+ },
+ inverse() {
+ var r, n, i, j, sum, v1 = this;
+ n = v1.length;
+ if (n == 0)
+ throw RangeError("division by zero");
+ r = Series.zero(n, -v1.emin);
+ r[0] = 1 / v1[0];
+ for(i = 1; i < n; i++) {
+ sum = 0;
+ for(j = 1; j <= i; j++) {
+ sum += v1[j] * r[i - j];
+ }
+ r[i] = -sum * r[0];
+ }
+ return r;
+ },
+ /* remove leading zero terms */
+ trim() {
+ var i, j, n, r, v1 = this;
+ n = v1.length;
+ i = 0;
+ while (i < n && v1[i] == 0)
+ i++;
+ if (i == 0)
+ return v1;
+ for(j = i; j < n; j++)
+ v1[j - i] = v1[j];
+ v1.length = n - i;
+ v1.__proto__.emin += i;
+ return v1;
+ },
+ toString() {
+ var i, j, str, str1, c, a = this, emin, n;
+ str="";
+ emin = this.emin;
+ n = this.length;
+ for(j = 0; j < n; j++) {
+ i = j + emin;
+ c = a[j];
+ if (c != 0) {
+ str1 = monomial_toString(c, i);
+ if (str1[0] != "-") {
+ if (str != "")
+ str += "+";
+ }
+ str += str1;
+ }
+ }
+ if (str != "")
+ str += "+";
+ str += "O(" + monomial_toString(1, n + emin) + ")";
+ return str;
+ },
+ apply(b) {
+ var i, n, r, a = this;
+ n = a.length;
+ if (n == 0)
+ return 0;
+ r = a[--n];
+ while (n > 0) {
+ n--;
+ r = r * b + a[n];
+ }
+ if (a.emin != 0)
+ r *= b ^ a.emin;
+ return r;
+ },
+ deriv() {
+ var a = this, n = a.length, emin = a.emin, r, i, j;
+ if (n == 0 && emin == 0) {
+ return Series.zero(0, 0);
+ } else {
+ r = Series.zero(n, emin - 1);
+ for(i = 0; i < n; i++) {
+ j = emin + i;
+ if (j == 0)
+ r[i] = 0;
+ else
+ r[i] = j * a[i];
+ }
+ return r.trim();
+ }
+ },
+ integ() {
+ var a = this, n = a.length, emin = a.emin, i, j, r;
+ r = Series.zero(n, emin + 1);
+ for(i = 0; i < n; i++) {
+ j = emin + i;
+ if (j == -1) {
+ if (a[i] != 0)
+ throw RangError("cannot represent integ(1/X)");
+ } else {
+ r[i] = a[i] / (j + 1);
+ }
+ }
+ return r.trim();
+ },
+ exp() {
+ var c, i, r, n, a = this;
+ n = a.emin;
+ if (n < 0)
+ throw RangeError("negative exponent in exp");
+ if (n > 0 || a[0] == 0) {
+ c = 1;
+ } else {
+ c = global.exp(a[0]);
+ a -= a[0];
+ }
+ n += a.length;
+ r = Series.zero(n, 0);
+ for(i = 0; i < n; i++) {
+ r[i] = c / fact(i);
+ }
+ return r.apply(a);
+ },
+ log() {
+ var a = this, r;
+ if (a.emin != 0)
+ throw Range("log argument must have a non zero constant term");
+ r = integ(deriv(a) / a);
+ /* add the constant term */
+ r += global.log(a[0]);
+ return r;
+ },
+ });
+
+ add_props(Series, {
+ [Symbol.operatorOrder]: OT_SERIES,
+ /* new series of length n and first exponent emin */
+ zero(n, emin) {
+ var r, i, obj;
+
+ r = [];
+ for(i = 0; i < n; i++)
+ r[i] = 0;
+ /* we return an array and store emin in its prototype */
+ obj = Object.create(Series.prototype);
+ obj.emin = emin;
+ Object.setPrototypeOf(r, obj);
+ return r;
+ },
+ [Symbol.operatorAdd](v1, v2) {
+ var tmp, d, emin, n, r, i, j, v2_emin, c1, c2;
+ if (!(v1 instanceof Series)) {
+ tmp = v1;
+ v1 = v2;
+ v2 = tmp;
+ }
+ d = v1.emin + v1.length;
+ if (v2.constructor[Symbol.operatorOrder] <= OT_POLY) {
+ v2 = Polynomial(v2);
+ if (d <= 0)
+ return v1;
+ v2_emin = 0;
+ } else if (v2 instanceof RationalFunction) {
+ /* compute the emin of the rational fonction */
+ i = get_emin(v2.num) - get_emin(v2.den);
+ if (d <= i)
+ return v1;
+ /* compute the serie with the required terms */
+ v2 = Series(v2, d - i);
+ v2_emin = v2.emin;
+ } else {
+ v2_emin = v2.emin;
+ d = Math.min(d, v2_emin + v2.length);
+ }
+ emin = Math.min(v1.emin, v2_emin);
+ n = d - emin;
+ r = Series.zero(n, emin);
+ /* XXX: slow */
+ for(i = emin; i < d; i++) {
+ j = i - v1.emin;
+ if (j >= 0 && j < v1.length)
+ c1 = v1[j];
+ else
+ c1 = 0;
+ j = i - v2_emin;
+ if (j >= 0 && j < v2.length)
+ c2 = v2[j];
+ else
+ c2 = 0;
+ r[i - emin] = c1 + c2;
+ }
+ return r.trim();
+ },
+ [Symbol.operatorSub](a, b) {
+ return Series[Symbol.operatorAdd](a, -b);
+ },
+ [Symbol.operatorMul](v1, v2) {
+ var n, i, j, r, n, emin, n1, n2, k;
+ if (!(v1 instanceof Series))
+ v1 = Series(v1, v2.length);
+ else if (!(v2 instanceof Series))
+ v2 = Series(v2, v1.length);
+ emin = v1.emin + v2.emin;
+ n = Math.min(v1.length, v2.length);
+ n1 = v1.length;
+ n2 = v2.length;
+ r = Series.zero(n, emin);
+ for(i = 0; i < n1; i++) {
+ k = Math.min(n2, n - i);
+ for(j = 0; j < k; j++) {
+ r[i + j] += v1[i] * v2[j];
+ }
+ }
+ return r.trim();
+ },
+ [Symbol.operatorMathDiv](v1, v2) {
+ if (!(v2 instanceof Series))
+ v2 = Series(v2, v1.length);
+ return Series[Symbol.operatorMul](v1, v2.inverse());
+ },
+ [Symbol.operatorMathPow](a, b) {
+ if (Integer.isInteger(b)) {
+ return generic_pow(a, b);
+ } else {
+ if (!(a instanceof Series))
+ a = Series(a, b.length);
+ return exp(log(a) * b);
+ }
+ },
+ [Symbol.operatorCmpEQ](a, b) {
+ var n, i;
+ if (!(a instanceof Series) ||
+ !(b instanceof Series))
+ return false;
+ if (a.emin != b.emin)
+ return false;
+ n = a.length;
+ if (n != b.length)
+ return false;
+ for(i = 0; i < n; i++) {
+ if (a[i] != b[i])
+ return false;
+ }
+ return true;
+ },
+ O(a) {
+ function ErrorO() {
+ return TypeError("invalid O() argument");
+ }
+ var n;
+ if (a.constructor[Symbol.operatorOrder] <= OT_POLY) {
+ a = Polynomial(a);
+ n = a.deg();
+ if (n < 0)
+ throw ErrorO();
+ } else if (a instanceof RationalFunction) {
+ if (a.num.deg() != 0)
+ throw ErrorO();
+ n = a.den.deg();
+ if (n < 0)
+ throw ErrorO();
+ n = -n;
+ } else
+ throw ErrorO();
+ return Series.zero(0, n);
+ },
+ });
+
+ /* Array (Matrix) */
+
+ Matrix = function Matrix(h, w) {
+ var i, j, r, rl;
+ if (typeof w === "undefined")
+ w = h;
+ r = [];
+ for(i = 0; i < h; i++) {
+ rl = [];
+ for(j = 0; j < w; j++)
+ rl[j] = 0;
+ r[i] = rl;
+ }
+ return r;
+ };
+
+ add_props(Matrix, {
+ idn(n) {
+ var r, i;
+ r = Matrix(n, n);
+ for(i = 0; i < n; i++)
+ r[i][i] = 1;
+ return r;
+ },
+ diag(a) {
+ var r, i, n;
+ n = a.length;
+ r = Matrix(n, n);
+ for(i = 0; i < n; i++)
+ r[i][i] = a[i];
+ return r;
+ },
+ hilbert(n) {
+ var i, j, r;
+ r = Matrix(n);
+ for(i = 0; i < n; i++) {
+ for(j = 0; j < n; j++) {
+ r[i][j] = 1 / (1 + i + j);
+ }
+ }
+ return r;
+ },
+ trans(a) {
+ var h, w, r, i, j;
+ if (!Array.isArray(a))
+ throw TypeError("matrix expected");
+ h = a.length;
+ if (!Array.isArray(a[0])) {
+ w = 1;
+ r = Matrix(w, h);
+ for(i = 0; i < h; i++) {
+ r[0][i] = a[i];
+ }
+ } else {
+ w = a[0].length;
+ r = Matrix(w, h);
+ for(i = 0; i < h; i++) {
+ for(j = 0; j < w; j++) {
+ r[j][i] = a[i][j];
+ }
+ }
+ }
+ return r;
+ },
+ check_square(a) {
+ var a, n;
+ if (!Array.isArray(a))
+ throw TypeError("array expected");
+ n = a.length;
+ if (!Array.isArray(a[0]) || n != a[0].length)
+ throw TypeError("square matrix expected");
+ return n;
+ },
+ trace(a) {
+ var n, r, i;
+ n = Matrix.check_square(a);
+ r = a[0][0];
+ for(i = 1; i < n; i++) {
+ r += a[i][i];
+ }
+ return r;
+ },
+ charpoly(a) {
+ var n, p, c, i, j, coef;
+ n = Matrix.check_square(a);
+ p = [];
+ for(i = 0; i < n + 1; i++)
+ p[i] = 0;
+ p[n] = 1;
+ c = Matrix.idn(n);
+ for(i = 0; i < n; i++) {
+ c = c * a;
+ coef = -trace(c) / (i + 1);
+ p[n - i - 1] = coef;
+ for(j = 0; j < n; j++)
+ c[j][j] += coef;
+ }
+ return Polynomial(p);
+ },
+ eigenvals(a) {
+ return Polynomial.roots(Matrix.charpoly(a));
+ },
+ det(a) {
+ var n, i, j, k, s, src, v, c;
+
+ n = Matrix.check_square(a);
+ s = 1;
+ src = a.dup();
+ for(i=0;i")
+DEF(_ret_, "")
+DEF(_var_, "")
+DEF(_with_, "")
+DEF(lastIndex, "lastIndex")
+DEF(target, "target")
+DEF(index, "index")
+DEF(input, "input")
+DEF(defineProperties, "defineProperties")
+DEF(apply, "apply")
+DEF(join, "join")
+DEF(concat, "concat")
+DEF(split, "split")
+DEF(construct, "construct")
+DEF(getPrototypeOf, "getPrototypeOf")
+DEF(setPrototypeOf, "setPrototypeOf")
+DEF(isExtensible, "isExtensible")
+DEF(preventExtensions, "preventExtensions")
+DEF(has, "has")
+DEF(deleteProperty, "deleteProperty")
+DEF(defineProperty, "defineProperty")
+DEF(getOwnPropertyDescriptor, "getOwnPropertyDescriptor")
+DEF(ownKeys, "ownKeys")
+DEF(add, "add")
+DEF(done, "done")
+DEF(next, "next")
+DEF(values, "values")
+DEF(source, "source")
+DEF(flags, "flags")
+DEF(global, "global")
+DEF(unicode, "unicode")
+DEF(raw, "raw")
+DEF(new_target, "new.target")
+DEF(this_active_func, "this.active_func")
+DEF(home_object, "")
+DEF(as, "as")
+DEF(from, "from")
+DEF(_default_, "*default*")
+DEF(_star_, "*")
+DEF(Module, "Module")
+DEF(then, "then")
+DEF(resolve, "resolve")
+DEF(reject, "reject")
+DEF(promise, "promise")
+DEF(proxy, "proxy")
+DEF(revoke, "revoke")
+DEF(async, "async")
+DEF(exec, "exec")
+DEF(groups, "groups")
+#ifdef CONFIG_BIGNUM
+DEF(bigint, "bigint")
+DEF(bigfloat, "bigfloat")
+#endif
+#ifdef CONFIG_ATOMICS
+DEF(not_equal, "not-equal")
+DEF(timed_out, "timed-out")
+DEF(ok, "ok")
+#endif
+DEF(toJSON, "toJSON")
+/* class names */
+DEF(Object, "Object")
+DEF(Array, "Array")
+DEF(Error, "Error")
+DEF(Number, "Number")
+DEF(String, "String")
+DEF(Boolean, "Boolean")
+DEF(Symbol, "Symbol")
+DEF(Arguments, "Arguments")
+DEF(Math, "Math")
+DEF(JSON, "JSON")
+DEF(Date, "Date")
+DEF(Function, "Function")
+DEF(GeneratorFunction, "GeneratorFunction")
+DEF(ForInIterator, "ForInIterator")
+DEF(RegExp, "RegExp")
+DEF(ArrayBuffer, "ArrayBuffer")
+DEF(SharedArrayBuffer, "SharedArrayBuffer")
+/* must keep same order as class IDs for typed arrays */
+DEF(Uint8ClampedArray, "Uint8ClampedArray")
+DEF(Int8Array, "Int8Array")
+DEF(Uint8Array, "Uint8Array")
+DEF(Int16Array, "Int16Array")
+DEF(Uint16Array, "Uint16Array")
+DEF(Int32Array, "Int32Array")
+DEF(Uint32Array, "Uint32Array")
+#ifdef CONFIG_BIGNUM
+DEF(BigInt64Array, "BigInt64Array")
+DEF(BigUint64Array, "BigUint64Array")
+#endif
+DEF(Float32Array, "Float32Array")
+DEF(Float64Array, "Float64Array")
+DEF(DataView, "DataView")
+#ifdef CONFIG_BIGNUM
+DEF(BigInt, "BigInt")
+DEF(BigFloat, "BigFloat")
+DEF(BigFloatEnv, "BigFloatEnv")
+#endif
+DEF(Map, "Map")
+DEF(Set, "Set") /* Map + 1 */
+DEF(WeakMap, "WeakMap") /* Map + 2 */
+DEF(WeakSet, "WeakSet") /* Map + 3 */
+DEF(Map_Iterator, "Map Iterator")
+DEF(Set_Iterator, "Set Iterator")
+DEF(Array_Iterator, "Array Iterator")
+DEF(String_Iterator, "String Iterator")
+DEF(Generator, "Generator")
+DEF(Proxy, "Proxy")
+DEF(Promise, "Promise")
+DEF(PromiseResolveFunction, "PromiseResolveFunction")
+DEF(PromiseRejectFunction, "PromiseRejectFunction")
+DEF(AsyncFunction, "AsyncFunction")
+DEF(AsyncFunctionResolve, "AsyncFunctionResolve")
+DEF(AsyncFunctionReject, "AsyncFunctionReject")
+DEF(AsyncGeneratorFunction, "AsyncGeneratorFunction")
+DEF(AsyncGenerator, "AsyncGenerator")
+DEF(EvalError, "EvalError")
+DEF(RangeError, "RangeError")
+DEF(ReferenceError, "ReferenceError")
+DEF(SyntaxError, "SyntaxError")
+DEF(TypeError, "TypeError")
+DEF(URIError, "URIError")
+DEF(InternalError, "InternalError")
+
+/* symbols */
+DEF(Symbol_toPrimitive, "Symbol.toPrimitive")
+DEF(Symbol_iterator, "Symbol.iterator")
+DEF(Symbol_match, "Symbol.match")
+DEF(Symbol_replace, "Symbol.replace")
+DEF(Symbol_search, "Symbol.search")
+DEF(Symbol_split, "Symbol.split")
+DEF(Symbol_toStringTag, "Symbol.toStringTag")
+DEF(Symbol_isConcatSpreadable, "Symbol.isConcatSpreadable")
+DEF(Symbol_hasInstance, "Symbol.hasInstance")
+DEF(Symbol_species, "Symbol.species")
+DEF(Symbol_unscopables, "Symbol.unscopables")
+DEF(Symbol_asyncIterator, "Symbol.asyncIterator")
+#ifdef CONFIG_BIGNUM
+DEF(Symbol_operatorOrder, "Symbol.operatorOrder")
+DEF(Symbol_operatorAdd, "Symbol.operatorAdd")
+DEF(Symbol_operatorSub, "Symbol.operatorSub")
+DEF(Symbol_operatorMul, "Symbol.operatorMul")
+DEF(Symbol_operatorDiv, "Symbol.operatorDiv")
+DEF(Symbol_operatorMod, "Symbol.operatorMod")
+DEF(Symbol_operatorPow, "Symbol.operatorPow")
+DEF(Symbol_operatorShl, "Symbol.operatorShl")
+DEF(Symbol_operatorShr, "Symbol.operatorShr")
+DEF(Symbol_operatorAnd, "Symbol.operatorAnd")
+DEF(Symbol_operatorOr, "Symbol.operatorOr")
+DEF(Symbol_operatorXor, "Symbol.operatorXor")
+DEF(Symbol_operatorCmpLT, "Symbol.operatorCmpLT")
+DEF(Symbol_operatorCmpLE, "Symbol.operatorCmpLE")
+DEF(Symbol_operatorCmpEQ, "Symbol.operatorCmpEQ")
+DEF(Symbol_operatorPlus, "Symbol.operatorPlus")
+DEF(Symbol_operatorNeg, "Symbol.operatorNeg")
+DEF(Symbol_operatorNot, "Symbol.operatorNot")
+DEF(Symbol_operatorInc, "Symbol.operatorInc")
+DEF(Symbol_operatorDec, "Symbol.operatorDec")
+DEF(Symbol_operatorMathDiv, "Symbol.operatorMathDiv")
+DEF(Symbol_operatorMathMod, "Symbol.operatorMathMod")
+DEF(Symbol_operatorMathPow, "Symbol.operatorMathPow")
+#endif
+
+#endif /* DEF */
diff --git a/thirdparty/quickjs/quickjs-2019-07-09-dust3d/quickjs-libc.c b/thirdparty/quickjs/quickjs-2019-07-09-dust3d/quickjs-libc.c
new file mode 100755
index 00000000..4d248b60
--- /dev/null
+++ b/thirdparty/quickjs/quickjs-2019-07-09-dust3d/quickjs-libc.c
@@ -0,0 +1,1825 @@
+/*
+ * QuickJS C library
+ *
+ * Copyright (c) 2017-2019 Fabrice Bellard
+ * Copyright (c) 2017-2019 Charlie Gordon
+ *
+ * Permission is hereby granted, free of charge, to any person obtaining a copy
+ * of this software and associated documentation files (the "Software"), to deal
+ * in the Software without restriction, including without limitation the rights
+ * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+ * copies of the Software, and to permit persons to whom the Software is
+ * furnished to do so, subject to the following conditions:
+ *
+ * The above copyright notice and this permission notice shall be included in
+ * all copies or substantial portions of the Software.
+ *
+ * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+ * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+ * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
+ * THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+ * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+ * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
+ * THE SOFTWARE.
+ */
+#include
+#include
+#include
+#include
+#include
+#include
+#include
+#include
+#include
+#include
+#include
+#include
+#if defined(_WIN32)
+#include
+#include
+#else
+#include
+#include
+#include
+#if defined(__APPLE__)
+typedef sig_t sighandler_t;
+#endif
+#endif
+
+#include "cutils.h"
+#include "list.h"
+#include "quickjs-libc.h"
+
+static void js_std_dbuf_init(JSContext *ctx, DynBuf *s)
+{
+ dbuf_init2(s, JS_GetRuntime(ctx), (DynBufReallocFunc *)js_realloc_rt);
+}
+
+/* TODO:
+ - add exec() wrapper
+ - add minimal VT100 emulation for win32
+ - add socket calls
+*/
+
+typedef struct {
+ struct list_head link;
+ int fd;
+ JSValue rw_func[2];
+} JSOSRWHandler;
+
+typedef struct {
+ struct list_head link;
+ int sig_num;
+ JSValue func;
+} JSOSSignalHandler;
+
+typedef struct {
+ struct list_head link;
+ BOOL has_object;
+ int64_t timeout;
+ JSValue func;
+} JSOSTimer;
+
+/* initialize the lists so js_std_free_handlers() can always be called */
+static struct list_head os_rw_handlers = LIST_HEAD_INIT(os_rw_handlers);
+static struct list_head os_signal_handlers = LIST_HEAD_INIT(os_signal_handlers);
+static struct list_head os_timers = LIST_HEAD_INIT(os_timers);
+static uint64_t os_pending_signals;
+static int eval_script_recurse;
+static int (*os_poll_func)(JSContext *ctx);
+
+static JSValue js_printf_internal(JSContext *ctx,
+ int argc, JSValueConst *argv, FILE *fp)
+{
+ char fmtbuf[32];
+ uint8_t cbuf[UTF8_CHAR_LEN_MAX+1];
+ JSValue res;
+ DynBuf dbuf;
+ const char *fmt_str;
+ const uint8_t *fmt, *fmt_end;
+ const uint8_t *p;
+ char *q;
+ int i, c, len;
+ int32_t int32_arg;
+ int64_t int64_arg;
+ double double_arg;
+ const char *string_arg;
+ enum { PART_FLAGS, PART_WIDTH, PART_DOT, PART_PREC, PART_MODIFIER } part;
+ int modsize;
+ /* Use indirect call to dbuf_printf to prevent gcc warning */
+ int (*dbuf_printf_fun)(DynBuf *s, const char *fmt, ...) = (void*)dbuf_printf;
+
+ js_std_dbuf_init(ctx, &dbuf);
+
+ if (argc > 0) {
+ fmt_str = JS_ToCStringLen(ctx, &len, argv[0], FALSE);
+ if (!fmt_str)
+ goto fail;
+
+ i = 1;
+ fmt = (const uint8_t *)fmt_str;
+ fmt_end = fmt + len;
+ while (fmt < fmt_end) {
+ for (p = fmt; fmt < fmt_end && *fmt != '%'; fmt++)
+ continue;
+ dbuf_put(&dbuf, p, fmt - p);
+ if (fmt >= fmt_end)
+ break;
+ q = fmtbuf;
+ *q++ = *fmt++; /* copy '%' */
+ part = PART_FLAGS;
+ modsize = 0;
+ for (;;) {
+ if (q >= fmtbuf + sizeof(fmtbuf) - 1)
+ goto invalid;
+
+ c = *fmt++;
+ *q++ = c;
+ *q = '\0';
+
+ switch (c) {
+ case '1': case '2': case '3':
+ case '4': case '5': case '6':
+ case '7': case '8': case '9':
+ if (part != PART_PREC) {
+ if (part <= PART_WIDTH)
+ part = PART_WIDTH;
+ else
+ goto invalid;
+ }
+ continue;
+
+ case '0': case '#': case '+': case '-': case ' ': case '\'':
+ if (part > PART_FLAGS)
+ goto invalid;
+ continue;
+
+ case '.':
+ if (part > PART_DOT)
+ goto invalid;
+ part = PART_DOT;
+ continue;
+
+ case '*':
+ if (part < PART_WIDTH)
+ part = PART_DOT;
+ else if (part == PART_DOT)
+ part = PART_MODIFIER;
+ else
+ goto invalid;
+
+ if (i >= argc)
+ goto missing;
+
+ if (JS_ToInt32(ctx, &int32_arg, argv[i++]))
+ goto fail;
+ q += snprintf(q, fmtbuf + sizeof(fmtbuf) - q, "%d", int32_arg);
+ continue;
+
+ case 'h':
+ if (modsize != 0 && modsize != -1)
+ goto invalid;
+ modsize--;
+ part = PART_MODIFIER;
+ continue;
+ case 'l':
+ q--;
+ if (modsize != 0 && modsize != 1)
+ goto invalid;
+ modsize++;
+ part = PART_MODIFIER;
+ continue;
+
+ case 'c':
+ if (i >= argc)
+ goto missing;
+ if (JS_IsString(argv[i])) {
+ string_arg = JS_ToCString(ctx, argv[i++]);
+ if (!string_arg)
+ goto fail;
+ int32_arg = unicode_from_utf8((uint8_t *)string_arg, UTF8_CHAR_LEN_MAX, &p);
+ JS_FreeCString(ctx, string_arg);
+ } else {
+ if (JS_ToInt32(ctx, &int32_arg, argv[i++]))
+ goto fail;
+ }
+ /* handle utf-8 encoding explicitly */
+ if ((unsigned)int32_arg > 0x10FFFF)
+ int32_arg = 0xFFFD;
+ /* ignore conversion flags, width and precision */
+ len = unicode_to_utf8(cbuf, int32_arg);
+ dbuf_put(&dbuf, cbuf, len);
+ break;
+
+ case 'd':
+ case 'i':
+ case 'o':
+ case 'u':
+ case 'x':
+ case 'X':
+ if (i >= argc)
+ goto missing;
+ if (modsize > 0) {
+ if (JS_ToInt64(ctx, &int64_arg, argv[i++]))
+ goto fail;
+ q[1] = q[-1];
+ q[-1] = q[0] = 'l';
+ q[2] = '\0';
+ dbuf_printf_fun(&dbuf, fmtbuf, (long long)int64_arg);
+ } else {
+ if (JS_ToInt32(ctx, &int32_arg, argv[i++]))
+ goto fail;
+ dbuf_printf_fun(&dbuf, fmtbuf, int32_arg);
+ }
+ break;
+
+ case 's':
+ if (i >= argc)
+ goto missing;
+ string_arg = JS_ToCString(ctx, argv[i++]);
+ if (!string_arg)
+ goto fail;
+ dbuf_printf_fun(&dbuf, fmtbuf, string_arg);
+ JS_FreeCString(ctx, string_arg);
+ break;
+
+ case 'e':
+ case 'f':
+ case 'g':
+ case 'a':
+ case 'E':
+ case 'F':
+ case 'G':
+ case 'A':
+ if (i >= argc)
+ goto missing;
+ if (JS_ToFloat64(ctx, &double_arg, argv[i++]))
+ goto fail;
+ dbuf_printf_fun(&dbuf, fmtbuf, double_arg);
+ break;
+
+ case '%':
+ dbuf_putc(&dbuf, '%');
+ break;
+
+ default:
+ /* XXX: should support an extension mechanism */
+ invalid:
+ JS_ThrowTypeError(ctx, "invalid conversion specifier in format string");
+ goto fail;
+ missing:
+ JS_ThrowReferenceError(ctx, "missing argument for conversion specifier");
+ goto fail;
+ }
+ break;
+ }
+ }
+ JS_FreeCString(ctx, fmt_str);
+ }
+ if (dbuf.error) {
+ res = JS_ThrowOutOfMemory(ctx);
+ } else {
+ if (fp) {
+ len = fwrite(dbuf.buf, 1, dbuf.size, fp);
+ res = JS_NewInt32(ctx, len);
+ } else {
+ res = JS_NewStringLen(ctx, (char *)dbuf.buf, dbuf.size);
+ }
+ }
+ dbuf_free(&dbuf);
+ return res;
+
+fail:
+ dbuf_free(&dbuf);
+ return JS_EXCEPTION;
+}
+
+uint8_t *js_load_file(JSContext *ctx, size_t *pbuf_len, const char *filename)
+{
+ FILE *f;
+ uint8_t *buf;
+ size_t buf_len;
+
+ f = fopen(filename, "rb");
+ if (!f)
+ return NULL;
+ fseek(f, 0, SEEK_END);
+ buf_len = ftell(f);
+ fseek(f, 0, SEEK_SET);
+ if (ctx)
+ buf = js_malloc(ctx, buf_len + 1);
+ else
+ buf = malloc(buf_len + 1);
+ fread(buf, 1, buf_len, f);
+ buf[buf_len] = '\0';
+ fclose(f);
+ *pbuf_len = buf_len;
+ return buf;
+}
+
+/* load and evaluate a file */
+static JSValue js_loadScript(JSContext *ctx, JSValueConst this_val,
+ int argc, JSValueConst *argv)
+{
+ uint8_t *buf;
+ const char *filename;
+ JSValue ret;
+ size_t buf_len;
+
+ filename = JS_ToCString(ctx, argv[0]);
+ if (!filename)
+ return JS_EXCEPTION;
+ buf = js_load_file(ctx, &buf_len, filename);
+ if (!buf) {
+ JS_ThrowReferenceError(ctx, "could not load '%s'", filename);
+ JS_FreeCString(ctx, filename);
+ return JS_EXCEPTION;
+ }
+ ret = JS_Eval(ctx, (char *)buf, buf_len, filename,
+ JS_EVAL_TYPE_GLOBAL | JS_EVAL_FLAG_SHEBANG);
+ js_free(ctx, buf);
+ JS_FreeCString(ctx, filename);
+ return ret;
+}
+
+typedef JSModuleDef *(JSInitModuleFunc)(JSContext *ctx,
+ const char *module_name);
+
+
+#if defined(_WIN32)
+static JSModuleDef *js_module_loader_so(JSContext *ctx,
+ const char *module_name)
+{
+ JS_ThrowReferenceError(ctx, "shared library modules are not supported yet");
+ return NULL;
+}
+#else
+static JSModuleDef *js_module_loader_so(JSContext *ctx,
+ const char *module_name)
+{
+ JSModuleDef *m;
+ void *hd;
+ JSInitModuleFunc *init;
+ char *filename;
+
+ if (!strchr(module_name, '/')) {
+ /* must add a '/' so that the DLL is not searched in the
+ system library paths */
+ filename = js_malloc(ctx, strlen(module_name) + 2 + 1);
+ if (!filename)
+ return NULL;
+ strcpy(filename, "./");
+ strcpy(filename + 2, module_name);
+ } else {
+ filename = (char *)module_name;
+ }
+
+ /* C module */
+ hd = dlopen(filename, RTLD_NOW | RTLD_LOCAL);
+ if (filename != module_name)
+ js_free(ctx, filename);
+ if (!hd) {
+ JS_ThrowReferenceError(ctx, "could not load module filename '%s' as shared library",
+ module_name);
+ goto fail;
+ }
+
+ init = dlsym(hd, "js_init_module");
+ if (!init) {
+ JS_ThrowReferenceError(ctx, "could not load module filename '%s': js_init_module not found",
+ module_name);
+ goto fail;
+ }
+
+ m = init(ctx, module_name);
+ if (!m) {
+ JS_ThrowReferenceError(ctx, "could not load module filename '%s': initialization error",
+ module_name);
+ fail:
+ if (hd)
+ dlclose(hd);
+ return NULL;
+ }
+ return m;
+}
+#endif /* !_WIN32 */
+
+JSModuleDef *js_module_loader(JSContext *ctx,
+ const char *module_name, void *opaque)
+{
+ JSModuleDef *m;
+
+ if (has_suffix(module_name, ".so")) {
+ m = js_module_loader_so(ctx, module_name);
+ } else {
+ size_t buf_len;
+ uint8_t *buf;
+ JSValue func_val;
+
+ buf = js_load_file(ctx, &buf_len, module_name);
+ if (!buf) {
+ JS_ThrowReferenceError(ctx, "could not load module filename '%s'",
+ module_name);
+ return NULL;
+ }
+
+ /* compile the module */
+ func_val = JS_Eval(ctx, (char *)buf, buf_len, module_name,
+ JS_EVAL_TYPE_MODULE | JS_EVAL_FLAG_COMPILE_ONLY);
+ js_free(ctx, buf);
+ if (JS_IsException(func_val))
+ return NULL;
+ /* the module is already referenced, so we must free it */
+ m = JS_VALUE_GET_PTR(func_val);
+ JS_FreeValue(ctx, func_val);
+ }
+ return m;
+}
+
+static JSValue js_std_exit(JSContext *ctx, JSValueConst this_val,
+ int argc, JSValueConst *argv)
+{
+ int status;
+ if (JS_ToInt32(ctx, &status, argv[0]))
+ status = -1;
+ exit(status);
+ return JS_UNDEFINED;
+}
+
+static JSValue js_std_getenv(JSContext *ctx, JSValueConst this_val,
+ int argc, JSValueConst *argv)
+{
+ const char *name, *str;
+ name = JS_ToCString(ctx, argv[0]);
+ if (!name)
+ return JS_EXCEPTION;
+ str = getenv(name);
+ JS_FreeCString(ctx, name);
+ if (!str)
+ return JS_UNDEFINED;
+ else
+ return JS_NewString(ctx, str);
+}
+
+static JSValue js_std_gc(JSContext *ctx, JSValueConst this_val,
+ int argc, JSValueConst *argv)
+{
+ JS_RunGC(JS_GetRuntime(ctx));
+ return JS_UNDEFINED;
+}
+
+static int interrupt_handler(JSRuntime *rt, void *opaque)
+{
+ return (os_pending_signals >> SIGINT) & 1;
+}
+
+static JSValue js_evalScript(JSContext *ctx, JSValueConst this_val,
+ int argc, JSValueConst *argv)
+{
+ const char *str;
+ int len;
+ JSValue ret;
+ str = JS_ToCStringLen(ctx, &len, argv[0], FALSE);
+ if (!str)
+ return JS_EXCEPTION;
+ if (++eval_script_recurse == 1) {
+ /* install the interrupt handler */
+ JS_SetInterruptHandler(JS_GetRuntime(ctx), interrupt_handler, NULL);
+ }
+ ret = JS_Eval(ctx, str, len, "", JS_EVAL_TYPE_GLOBAL);
+ if (--eval_script_recurse == 0) {
+ /* remove the interrupt handler */
+ JS_SetInterruptHandler(JS_GetRuntime(ctx), NULL, NULL);
+ os_pending_signals &= ~((uint64_t)1 << SIGINT);
+ /* convert the uncatchable "interrupted" error into a normal error
+ so that it can be caught by the REPL */
+ if (JS_IsException(ret))
+ JS_ResetUncatchableError(ctx);
+ }
+ return ret;
+}
+
+static JSClassID js_std_file_class_id;
+
+typedef struct {
+ FILE *f;
+ BOOL close_in_finalizer;
+} JSSTDFile;
+
+static void js_std_file_finalizer(JSRuntime *rt, JSValue val)
+{
+ JSSTDFile *s = JS_GetOpaque(val, js_std_file_class_id);
+ if (s) {
+ if (s->f && s->close_in_finalizer)
+ fclose(s->f);
+ js_free_rt(rt, s);
+ }
+}
+
+static JSValue js_new_std_error(JSContext *ctx, int err)
+{
+ JSValue obj;
+ /* XXX: could add a specific Error prototype */
+ obj = JS_NewError(ctx);
+ JS_DefinePropertyValueStr(ctx, obj, "message",
+ JS_NewString(ctx, strerror(err)),
+ JS_PROP_WRITABLE | JS_PROP_CONFIGURABLE);
+ JS_DefinePropertyValueStr(ctx, obj, "errno",
+ JS_NewInt32(ctx, err),
+ JS_PROP_WRITABLE | JS_PROP_CONFIGURABLE);
+ return obj;
+}
+
+static JSValue js_std_error_constructor(JSContext *ctx, JSValueConst new_target,
+ int argc, JSValueConst *argv)
+{
+ int err;
+ if (JS_ToInt32(ctx, &err, argv[0]))
+ return JS_EXCEPTION;
+ return js_new_std_error(ctx, err);
+}
+
+static JSValue js_std_error_strerror(JSContext *ctx, JSValueConst this_val,
+ int argc, JSValueConst *argv)
+{
+ int err;
+ if (JS_ToInt32(ctx, &err, argv[0]))
+ return JS_EXCEPTION;
+ return JS_NewString(ctx, strerror(err));
+}
+
+static JSValue js_std_throw_errno(JSContext *ctx, int err)
+{
+ JSValue obj;
+ obj = js_new_std_error(ctx, err);
+ if (JS_IsException(obj))
+ obj = JS_NULL;
+ return JS_Throw(ctx, obj);
+}
+
+static JSValue js_new_std_file(JSContext *ctx, FILE *f, BOOL close_in_finalizer)
+{
+ JSSTDFile *s;
+ JSValue obj;
+ obj = JS_NewObjectClass(ctx, js_std_file_class_id);
+ if (JS_IsException(obj))
+ return obj;
+ s = js_mallocz(ctx, sizeof(*s));
+ if (!s) {
+ JS_FreeValue(ctx, obj);
+ return JS_EXCEPTION;
+ }
+ s->close_in_finalizer = close_in_finalizer;
+ s->f = f;
+ JS_SetOpaque(obj, s);
+ return obj;
+}
+
+static JSValue js_std_open(JSContext *ctx, JSValueConst this_val,
+ int argc, JSValueConst *argv)
+{
+ const char *filename, *mode = NULL;
+ FILE *f;
+
+ filename = JS_ToCString(ctx, argv[0]);
+ if (!filename)
+ goto fail;
+ mode = JS_ToCString(ctx, argv[1]);
+ if (!mode)
+ goto fail;
+ if (mode[strspn(mode, "rwa+b")] != '\0') {
+ js_std_throw_errno(ctx, EINVAL);
+ goto fail;
+ }
+
+ f = fopen(filename, mode);
+ JS_FreeCString(ctx, filename);
+ JS_FreeCString(ctx, mode);
+ if (!f)
+ return js_std_throw_errno(ctx, errno);
+ return js_new_std_file(ctx, f, TRUE);
+ fail:
+ JS_FreeCString(ctx, filename);
+ JS_FreeCString(ctx, mode);
+ return JS_EXCEPTION;
+}
+
+static JSValue js_std_tmpfile(JSContext *ctx, JSValueConst this_val,
+ int argc, JSValueConst *argv)
+{
+ FILE *f;
+ f = tmpfile();
+ if (!f)
+ return js_std_throw_errno(ctx, errno);
+ return js_new_std_file(ctx, f, TRUE);
+}
+
+static JSValue js_std_sprintf(JSContext *ctx, JSValueConst this_val,
+ int argc, JSValueConst *argv)
+{
+ return js_printf_internal(ctx, argc, argv, NULL);
+}
+
+static JSValue js_std_printf(JSContext *ctx, JSValueConst this_val,
+ int argc, JSValueConst *argv)
+{
+ return js_printf_internal(ctx, argc, argv, stdout);
+}
+
+static FILE *js_std_file_get(JSContext *ctx, JSValueConst obj)
+{
+ JSSTDFile *s = JS_GetOpaque2(ctx, obj, js_std_file_class_id);
+ if (!s)
+ return NULL;
+ if (!s->f) {
+ js_std_throw_errno(ctx, EBADF);
+ return NULL;
+ }
+ return s->f;
+}
+
+static JSValue js_std_file_puts(JSContext *ctx, JSValueConst this_val,
+ int argc, JSValueConst *argv, int magic)
+{
+ FILE *f;
+ int i;
+ const char *str;
+
+ if (magic == 0) {
+ f = stdout;
+ } else {
+ f = js_std_file_get(ctx, this_val);
+ if (!f)
+ return JS_EXCEPTION;
+ }
+
+ for(i = 0; i < argc; i++) {
+ str = JS_ToCString(ctx, argv[i]);
+ if (!str)
+ return JS_EXCEPTION;
+ fputs(str, f);
+ JS_FreeCString(ctx, str);
+ }
+ return JS_UNDEFINED;
+}
+
+static JSValue js_std_file_close(JSContext *ctx, JSValueConst this_val,
+ int argc, JSValueConst *argv)
+{
+ JSSTDFile *s = JS_GetOpaque2(ctx, this_val, js_std_file_class_id);
+ if (!s)
+ return JS_EXCEPTION;
+ if (!s->f)
+ return js_std_throw_errno(ctx, EBADF);
+ fclose(s->f);
+ s->f = NULL;
+ return JS_UNDEFINED;
+}
+
+static JSValue js_std_file_printf(JSContext *ctx, JSValueConst this_val,
+ int argc, JSValueConst *argv)
+{
+ FILE *f = js_std_file_get(ctx, this_val);
+ if (!f)
+ return JS_EXCEPTION;
+ return js_printf_internal(ctx, argc, argv, f);
+}
+
+static JSValue js_std_file_flush(JSContext *ctx, JSValueConst this_val,
+ int argc, JSValueConst *argv)
+{
+ FILE *f = js_std_file_get(ctx, this_val);
+ if (!f)
+ return JS_EXCEPTION;
+ fflush(f);
+ return JS_UNDEFINED;
+}
+
+static JSValue js_std_file_tell(JSContext *ctx, JSValueConst this_val,
+ int argc, JSValueConst *argv)
+{
+ FILE *f = js_std_file_get(ctx, this_val);
+ int64_t pos;
+ if (!f)
+ return JS_EXCEPTION;
+#if defined(__linux__)
+ pos = ftello(f);
+#else
+ pos = ftell(f);
+#endif
+ return JS_NewInt64(ctx, pos);
+}
+
+static JSValue js_std_file_seek(JSContext *ctx, JSValueConst this_val,
+ int argc, JSValueConst *argv)
+{
+ FILE *f = js_std_file_get(ctx, this_val);
+ int64_t pos;
+ int whence, ret;
+ if (!f)
+ return JS_EXCEPTION;
+ if (JS_ToInt64(ctx, &pos, argv[0]))
+ return JS_EXCEPTION;
+ if (JS_ToInt32(ctx, &whence, argv[1]))
+ return JS_EXCEPTION;
+#if defined(__linux__)
+ ret = fseeko(f, pos, whence);
+#else
+ ret = fseek(f, pos, whence);
+#endif
+ if (ret < 0)
+ return js_std_throw_errno(ctx, EBADF);
+ return JS_UNDEFINED;
+}
+
+static JSValue js_std_file_eof(JSContext *ctx, JSValueConst this_val,
+ int argc, JSValueConst *argv)
+{
+ FILE *f = js_std_file_get(ctx, this_val);
+ if (!f)
+ return JS_EXCEPTION;
+ return JS_NewBool(ctx, feof(f));
+}
+
+static JSValue js_std_file_fileno(JSContext *ctx, JSValueConst this_val,
+ int argc, JSValueConst *argv)
+{
+ FILE *f = js_std_file_get(ctx, this_val);
+ if (!f)
+ return JS_EXCEPTION;
+ return JS_NewInt32(ctx, fileno(f));
+}
+
+static JSValue js_std_file_read_write(JSContext *ctx, JSValueConst this_val,
+ int argc, JSValueConst *argv, int magic)
+{
+ FILE *f = js_std_file_get(ctx, this_val);
+ uint64_t pos, len;
+ size_t size, ret;
+ uint8_t *buf;
+
+ if (!f)
+ return JS_EXCEPTION;
+ if (JS_ToIndex(ctx, &pos, argv[1]))
+ return JS_EXCEPTION;
+ if (JS_ToIndex(ctx, &len, argv[2]))
+ return JS_EXCEPTION;
+ buf = JS_GetArrayBuffer(ctx, &size, argv[0]);
+ if (!buf)
+ return JS_EXCEPTION;
+ if (pos + len > size)
+ return JS_ThrowRangeError(ctx, "read/write array buffer overflow");
+ if (magic)
+ ret = fwrite(buf + pos, 1, len, f);
+ else
+ ret = fread(buf + pos, 1, len, f);
+ return JS_NewInt64(ctx, ret);
+}
+
+/* XXX: could use less memory and go faster */
+static JSValue js_std_file_getline(JSContext *ctx, JSValueConst this_val,
+ int argc, JSValueConst *argv)
+{
+ FILE *f = js_std_file_get(ctx, this_val);
+ int c;
+ DynBuf dbuf;
+ JSValue obj;
+
+ if (!f)
+ return JS_EXCEPTION;
+
+ js_std_dbuf_init(ctx, &dbuf);
+ for(;;) {
+ c = fgetc(f);
+ if (c == EOF) {
+ if (dbuf.size == 0) {
+ /* EOF */
+ dbuf_free(&dbuf);
+ return JS_NULL;
+ } else {
+ break;
+ }
+ }
+ if (c == '\n')
+ break;
+ if (dbuf_putc(&dbuf, c)) {
+ dbuf_free(&dbuf);
+ return JS_ThrowOutOfMemory(ctx);
+ }
+ }
+ obj = JS_NewStringLen(ctx, (const char *)dbuf.buf, dbuf.size);
+ dbuf_free(&dbuf);
+ return obj;
+}
+
+/* XXX: could use less memory and go faster */
+static JSValue js_std_file_readAsString(JSContext *ctx, JSValueConst this_val,
+ int argc, JSValueConst *argv)
+{
+ FILE *f = js_std_file_get(ctx, this_val);
+ int c;
+ DynBuf dbuf;
+ JSValue obj;
+ uint64_t max_size64;
+ size_t max_size;
+ JSValueConst max_size_val;
+
+ if (!f)
+ return JS_EXCEPTION;
+
+ if (argc >= 1)
+ max_size_val = argv[0];
+ else
+ max_size_val = JS_UNDEFINED;
+ max_size = (size_t)-1;
+ if (!JS_IsUndefined(max_size_val)) {
+ if (JS_ToIndex(ctx, &max_size64, max_size_val))
+ return JS_EXCEPTION;
+ if (max_size64 < max_size)
+ max_size = max_size64;
+ }
+
+ js_std_dbuf_init(ctx, &dbuf);
+ while (max_size != 0) {
+ c = fgetc(f);
+ if (c == EOF)
+ break;
+ if (dbuf_putc(&dbuf, c)) {
+ dbuf_free(&dbuf);
+ return JS_EXCEPTION;
+ }
+ max_size--;
+ }
+ obj = JS_NewStringLen(ctx, (const char *)dbuf.buf, dbuf.size);
+ dbuf_free(&dbuf);
+ return obj;
+}
+
+static JSValue js_std_file_getByte(JSContext *ctx, JSValueConst this_val,
+ int argc, JSValueConst *argv)
+{
+ FILE *f = js_std_file_get(ctx, this_val);
+ if (!f)
+ return JS_EXCEPTION;
+ return JS_NewInt32(ctx, fgetc(f));
+}
+
+static JSValue js_std_file_putByte(JSContext *ctx, JSValueConst this_val,
+ int argc, JSValueConst *argv)
+{
+ FILE *f = js_std_file_get(ctx, this_val);
+ int c;
+ if (!f)
+ return JS_EXCEPTION;
+ if (JS_ToInt32(ctx, &c, argv[0]))
+ return JS_EXCEPTION;
+ c = fputc(c, f);
+ return JS_NewInt32(ctx, c);
+}
+
+static JSClassDef js_std_file_class = {
+ "FILE",
+ .finalizer = js_std_file_finalizer,
+};
+
+static const JSCFunctionListEntry js_std_funcs[] = {
+ JS_CFUNC_DEF("exit", 1, js_std_exit ),
+ JS_CFUNC_DEF("gc", 0, js_std_gc ),
+ JS_CFUNC_DEF("evalScript", 1, js_evalScript ),
+ JS_CFUNC_DEF("loadScript", 1, js_loadScript ),
+ JS_CFUNC_DEF("getenv", 1, js_std_getenv ),
+
+ /* FILE I/O */
+ JS_CFUNC_DEF("open", 2, js_std_open ),
+ JS_CFUNC_DEF("tmpfile", 0, js_std_tmpfile ),
+ JS_CFUNC_MAGIC_DEF("puts", 1, js_std_file_puts, 0 ),
+ JS_CFUNC_DEF("printf", 1, js_std_printf ),
+ JS_CFUNC_DEF("sprintf", 1, js_std_sprintf ),
+ JS_PROP_INT32_DEF("SEEK_SET", SEEK_SET, JS_PROP_CONFIGURABLE ),
+ JS_PROP_INT32_DEF("SEEK_CUR", SEEK_CUR, JS_PROP_CONFIGURABLE ),
+ JS_PROP_INT32_DEF("SEEK_END", SEEK_END, JS_PROP_CONFIGURABLE ),
+
+ /* setenv, ... */
+};
+
+static const JSCFunctionListEntry js_std_error_funcs[] = {
+ JS_CFUNC_DEF("strerror", 1, js_std_error_strerror ),
+ /* various errno values */
+#define DEF(x) JS_PROP_INT32_DEF(#x, x, JS_PROP_CONFIGURABLE )
+ DEF(EINVAL),
+ DEF(EIO),
+ DEF(EACCES),
+ DEF(EEXIST),
+ DEF(ENOSPC),
+ DEF(ENOSYS),
+ DEF(EBUSY),
+ DEF(ENOENT),
+ DEF(EPERM),
+ DEF(EPIPE),
+ DEF(EBADF),
+#undef DEF
+};
+
+static const JSCFunctionListEntry js_std_file_proto_funcs[] = {
+ JS_CFUNC_DEF("close", 0, js_std_file_close ),
+ JS_CFUNC_MAGIC_DEF("puts", 1, js_std_file_puts, 1 ),
+ JS_CFUNC_DEF("printf", 1, js_std_file_printf ),
+ JS_CFUNC_DEF("flush", 0, js_std_file_flush ),
+ JS_CFUNC_DEF("tell", 0, js_std_file_tell ),
+ JS_CFUNC_DEF("seek", 2, js_std_file_seek ),
+ JS_CFUNC_DEF("eof", 0, js_std_file_eof ),
+ JS_CFUNC_DEF("fileno", 0, js_std_file_fileno ),
+ JS_CFUNC_MAGIC_DEF("read", 3, js_std_file_read_write, 0 ),
+ JS_CFUNC_MAGIC_DEF("write", 3, js_std_file_read_write, 1 ),
+ JS_CFUNC_DEF("getline", 0, js_std_file_getline ),
+ JS_CFUNC_DEF("readAsString", 0, js_std_file_readAsString ),
+ JS_CFUNC_DEF("getByte", 0, js_std_file_getByte ),
+ JS_CFUNC_DEF("putByte", 1, js_std_file_putByte ),
+ /* setvbuf, ferror, clearerr, ... */
+};
+
+static int js_std_init(JSContext *ctx, JSModuleDef *m)
+{
+ JSValue proto, obj;
+
+ /* FILE class */
+ /* the class ID is created once */
+ JS_NewClassID(&js_std_file_class_id);
+ /* the class is created once per runtime */
+ JS_NewClass(JS_GetRuntime(ctx), js_std_file_class_id, &js_std_file_class);
+ proto = JS_NewObject(ctx);
+ JS_SetPropertyFunctionList(ctx, proto, js_std_file_proto_funcs,
+ countof(js_std_file_proto_funcs));
+ JS_SetClassProto(ctx, js_std_file_class_id, proto);
+
+ JS_SetModuleExportList(ctx, m, js_std_funcs,
+ countof(js_std_funcs));
+ JS_SetModuleExport(ctx, m, "in", js_new_std_file(ctx, stdin, FALSE));
+ JS_SetModuleExport(ctx, m, "out", js_new_std_file(ctx, stdout, FALSE));
+ JS_SetModuleExport(ctx, m, "err", js_new_std_file(ctx, stderr, FALSE));
+
+ obj = JS_NewCFunction2(ctx, js_std_error_constructor,
+ "Error", 1, JS_CFUNC_constructor, 0);
+ JS_SetPropertyFunctionList(ctx, obj, js_std_error_funcs,
+ countof(js_std_error_funcs));
+ JS_SetModuleExport(ctx, m, "Error", obj);
+
+ /* global object */
+ JS_SetModuleExport(ctx, m, "global", JS_GetGlobalObject(ctx));
+ return 0;
+}
+
+JSModuleDef *js_init_module_std(JSContext *ctx, const char *module_name)
+{
+ JSModuleDef *m;
+ m = JS_NewCModule(ctx, module_name, js_std_init);
+ if (!m)
+ return NULL;
+ JS_AddModuleExportList(ctx, m, js_std_funcs, countof(js_std_funcs));
+ JS_AddModuleExport(ctx, m, "in");
+ JS_AddModuleExport(ctx, m, "out");
+ JS_AddModuleExport(ctx, m, "err");
+ JS_AddModuleExport(ctx, m, "global");
+ JS_AddModuleExport(ctx, m, "Error");
+ return m;
+}
+
+/**********************************************************/
+/* 'os' object */
+
+static JSValue js_os_return(JSContext *ctx, ssize_t ret)
+{
+ if (ret < 0)
+ ret = -errno;
+ return JS_NewInt64(ctx, ret);
+}
+
+static JSValue js_os_open(JSContext *ctx, JSValueConst this_val,
+ int argc, JSValueConst *argv)
+{
+ const char *filename;
+ int flags, mode, ret;
+
+ filename = JS_ToCString(ctx, argv[0]);
+ if (!filename)
+ return JS_EXCEPTION;
+ if (JS_ToInt32(ctx, &flags, argv[1]))
+ goto fail;
+ if (argc >= 3 && !JS_IsUndefined(argv[2])) {
+ if (JS_ToInt32(ctx, &mode, argv[2])) {
+ fail:
+ JS_FreeCString(ctx, filename);
+ return JS_EXCEPTION;
+ }
+ } else {
+ mode = 0666;
+ }
+#if defined(_WIN32)
+ /* force binary mode by default */
+ if (!(flags & O_TEXT))
+ flags |= O_BINARY;
+#endif
+ ret = open(filename, flags, mode);
+ JS_FreeCString(ctx, filename);
+ return js_os_return(ctx, ret);
+}
+
+static JSValue js_os_close(JSContext *ctx, JSValueConst this_val,
+ int argc, JSValueConst *argv)
+{
+ int fd, ret;
+ if (JS_ToInt32(ctx, &fd, argv[0]))
+ return JS_EXCEPTION;
+ ret = close(fd);
+ return js_os_return(ctx, ret);
+}
+
+static JSValue js_os_seek(JSContext *ctx, JSValueConst this_val,
+ int argc, JSValueConst *argv)
+{
+ int fd, whence, ret;
+ int64_t pos;
+
+ if (JS_ToInt32(ctx, &fd, argv[0]))
+ return JS_EXCEPTION;
+ if (JS_ToInt64(ctx, &pos, argv[1]))
+ return JS_EXCEPTION;
+ if (JS_ToInt32(ctx, &whence, argv[2]))
+ return JS_EXCEPTION;
+ ret = lseek(fd, pos, whence);
+ return js_os_return(ctx, ret);
+}
+
+static JSValue js_os_read_write(JSContext *ctx, JSValueConst this_val,
+ int argc, JSValueConst *argv, int magic)
+{
+ int fd;
+ uint64_t pos, len;
+ size_t size;
+ ssize_t ret;
+ uint8_t *buf;
+
+ if (JS_ToInt32(ctx, &fd, argv[0]))
+ return JS_EXCEPTION;
+ if (JS_ToIndex(ctx, &pos, argv[2]))
+ return JS_EXCEPTION;
+ if (JS_ToIndex(ctx, &len, argv[3]))
+ return JS_EXCEPTION;
+ buf = JS_GetArrayBuffer(ctx, &size, argv[1]);
+ if (!buf)
+ return JS_EXCEPTION;
+ if (pos + len > size)
+ return JS_ThrowRangeError(ctx, "read/write array buffer overflow");
+ if (magic)
+ ret = write(fd, buf + pos, len);
+ else
+ ret = read(fd, buf + pos, len);
+ return js_os_return(ctx, ret);
+}
+
+static JSValue js_os_isatty(JSContext *ctx, JSValueConst this_val,
+ int argc, JSValueConst *argv)
+{
+ int fd;
+ if (JS_ToInt32(ctx, &fd, argv[0]))
+ return JS_EXCEPTION;
+ return JS_NewBool(ctx, isatty(fd) == 1);
+}
+
+#if defined(_WIN32)
+static JSValue js_os_ttyGetWinSize(JSContext *ctx, JSValueConst this_val,
+ int argc, JSValueConst *argv)
+{
+ int fd;
+ HANDLE handle;
+ CONSOLE_SCREEN_BUFFER_INFO info;
+ JSValue obj;
+
+ if (JS_ToInt32(ctx, &fd, argv[0]))
+ return JS_EXCEPTION;
+ handle = (HANDLE)_get_osfhandle(fd);
+
+ if (!GetConsoleScreenBufferInfo(handle, &info))
+ return JS_NULL;
+ obj = JS_NewArray(ctx);
+ if (JS_IsException(obj))
+ return obj;
+ JS_DefinePropertyValueUint32(ctx, obj, 0, JS_NewInt32(ctx, info.dwSize.X), JS_PROP_C_W_E);
+ JS_DefinePropertyValueUint32(ctx, obj, 1, JS_NewInt32(ctx, info.dwSize.Y), JS_PROP_C_W_E);
+ return obj;
+}
+
+static JSValue js_os_ttySetRaw(JSContext *ctx, JSValueConst this_val,
+ int argc, JSValueConst *argv)
+{
+ int fd;
+ HANDLE handle;
+
+ if (JS_ToInt32(ctx, &fd, argv[0]))
+ return JS_EXCEPTION;
+ handle = (HANDLE)_get_osfhandle(fd);
+
+ SetConsoleMode(handle, ENABLE_WINDOW_INPUT);
+ return JS_UNDEFINED;
+}
+#else
+static JSValue js_os_ttyGetWinSize(JSContext *ctx, JSValueConst this_val,
+ int argc, JSValueConst *argv)
+{
+ int fd;
+ struct winsize ws;
+ JSValue obj;
+
+ if (JS_ToInt32(ctx, &fd, argv[0]))
+ return JS_EXCEPTION;
+ if (ioctl(fd, TIOCGWINSZ, &ws) == 0 &&
+ ws.ws_col >= 4 && ws.ws_row >= 4) {
+ obj = JS_NewArray(ctx);
+ if (JS_IsException(obj))
+ return obj;
+ JS_DefinePropertyValueUint32(ctx, obj, 0, JS_NewInt32(ctx, ws.ws_col), JS_PROP_C_W_E);
+ JS_DefinePropertyValueUint32(ctx, obj, 1, JS_NewInt32(ctx, ws.ws_row), JS_PROP_C_W_E);
+ return obj;
+ } else {
+ return JS_NULL;
+ }
+}
+
+static struct termios oldtty;
+
+static void term_exit(void)
+{
+ tcsetattr(0, TCSANOW, &oldtty);
+}
+
+/* XXX: should add a way to go back to normal mode */
+static JSValue js_os_ttySetRaw(JSContext *ctx, JSValueConst this_val,
+ int argc, JSValueConst *argv)
+{
+ struct termios tty;
+ int fd;
+
+ if (JS_ToInt32(ctx, &fd, argv[0]))
+ return JS_EXCEPTION;
+
+ memset(&tty, 0, sizeof(tty));
+ tcgetattr(fd, &tty);
+ oldtty = tty;
+
+ tty.c_iflag &= ~(IGNBRK|BRKINT|PARMRK|ISTRIP
+ |INLCR|IGNCR|ICRNL|IXON);
+ tty.c_oflag |= OPOST;
+ tty.c_lflag &= ~(ECHO|ECHONL|ICANON|IEXTEN);
+ tty.c_cflag &= ~(CSIZE|PARENB);
+ tty.c_cflag |= CS8;
+ tty.c_cc[VMIN] = 1;
+ tty.c_cc[VTIME] = 0;
+
+ tcsetattr(fd, TCSANOW, &tty);
+
+ atexit(term_exit);
+ return JS_UNDEFINED;
+}
+
+#endif /* !_WIN32 */
+
+static JSValue js_os_remove(JSContext *ctx, JSValueConst this_val,
+ int argc, JSValueConst *argv)
+{
+ const char *filename;
+ int ret;
+
+ filename = JS_ToCString(ctx, argv[0]);
+ if (!filename)
+ return JS_EXCEPTION;
+ ret = remove(filename);
+ JS_FreeCString(ctx, filename);
+ return js_os_return(ctx, ret);
+}
+
+static JSValue js_os_rename(JSContext *ctx, JSValueConst this_val,
+ int argc, JSValueConst *argv)
+{
+ const char *oldpath, *newpath;
+ int ret;
+
+ oldpath = JS_ToCString(ctx, argv[0]);
+ if (!oldpath)
+ return JS_EXCEPTION;
+ newpath = JS_ToCString(ctx, argv[1]);
+ if (!newpath) {
+ JS_FreeCString(ctx, oldpath);
+ return JS_EXCEPTION;
+ }
+ ret = rename(oldpath, newpath);
+ JS_FreeCString(ctx, oldpath);
+ JS_FreeCString(ctx, newpath);
+ return js_os_return(ctx, ret);
+}
+
+static JSOSRWHandler *find_rh(int fd)
+{
+ JSOSRWHandler *rh;
+ struct list_head *el;
+ list_for_each(el, &os_rw_handlers) {
+ rh = list_entry(el, JSOSRWHandler, link);
+ if (rh->fd == fd)
+ return rh;
+ }
+ return NULL;
+}
+
+static void free_rw_handler(JSRuntime *rt, JSOSRWHandler *rh)
+{
+ int i;
+ list_del(&rh->link);
+ for(i = 0; i < 2; i++) {
+ JS_FreeValueRT(rt, rh->rw_func[i]);
+ }
+ js_free_rt(rt, rh);
+}
+
+static JSValue js_os_setReadHandler(JSContext *ctx, JSValueConst this_val,
+ int argc, JSValueConst *argv, int magic)
+{
+ JSOSRWHandler *rh;
+ int fd;
+ JSValueConst func;
+
+ if (JS_ToInt32(ctx, &fd, argv[0]))
+ return JS_EXCEPTION;
+ func = argv[1];
+ if (JS_IsNull(func)) {
+ rh = find_rh(fd);
+ if (rh) {
+ JS_FreeValue(ctx, rh->rw_func[magic]);
+ rh->rw_func[magic] = JS_NULL;
+ if (JS_IsNull(rh->rw_func[0]) &&
+ JS_IsNull(rh->rw_func[1])) {
+ /* remove the entry */
+ free_rw_handler(JS_GetRuntime(ctx), rh);
+ }
+ }
+ } else {
+ if (!JS_IsFunction(ctx, func))
+ return JS_ThrowTypeError(ctx, "not a function");
+ rh = find_rh(fd);
+ if (!rh) {
+ rh = js_mallocz(ctx, sizeof(*rh));
+ if (!rh)
+ return JS_EXCEPTION;
+ rh->fd = fd;
+ rh->rw_func[0] = JS_NULL;
+ rh->rw_func[1] = JS_NULL;
+ list_add_tail(&rh->link, &os_rw_handlers);
+ }
+ JS_FreeValue(ctx, rh->rw_func[magic]);
+ rh->rw_func[magic] = JS_DupValue(ctx, func);
+ }
+ return JS_UNDEFINED;
+}
+
+static JSOSSignalHandler *find_sh(int sig_num)
+{
+ JSOSSignalHandler *sh;
+ struct list_head *el;
+ list_for_each(el, &os_signal_handlers) {
+ sh = list_entry(el, JSOSSignalHandler, link);
+ if (sh->sig_num == sig_num)
+ return sh;
+ }
+ return NULL;
+}
+
+static void free_sh(JSRuntime *rt, JSOSSignalHandler *sh)
+{
+ list_del(&sh->link);
+ JS_FreeValueRT(rt, sh->func);
+ js_free_rt(rt, sh);
+}
+
+static void os_signal_handler(int sig_num)
+{
+ os_pending_signals |= ((uint64_t)1 << sig_num);
+}
+
+#if defined(_WIN32)
+typedef void (*sighandler_t)(int sig_num);
+#endif
+
+static JSValue js_os_signal(JSContext *ctx, JSValueConst this_val,
+ int argc, JSValueConst *argv)
+{
+ JSOSSignalHandler *sh;
+ uint32_t sig_num;
+ JSValueConst func;
+ sighandler_t handler;
+
+ if (JS_ToUint32(ctx, &sig_num, argv[0]))
+ return JS_EXCEPTION;
+ if (sig_num >= 64)
+ return JS_ThrowRangeError(ctx, "invalid signal number");
+ func = argv[1];
+ /* func = null: SIG_DFL, func = undefined, SIG_IGN */
+ if (JS_IsNull(func) || JS_IsUndefined(func)) {
+ sh = find_sh(sig_num);
+ if (sh) {
+ free_sh(JS_GetRuntime(ctx), sh);
+ }
+ if (JS_IsNull(func))
+ handler = SIG_DFL;
+ else
+ handler = SIG_IGN;
+ signal(sig_num, handler);
+ } else {
+ if (!JS_IsFunction(ctx, func))
+ return JS_ThrowTypeError(ctx, "not a function");
+ sh = find_sh(sig_num);
+ if (!sh) {
+ sh = js_mallocz(ctx, sizeof(*sh));
+ if (!sh)
+ return JS_EXCEPTION;
+ sh->sig_num = sig_num;
+ list_add_tail(&sh->link, &os_signal_handlers);
+ }
+ JS_FreeValue(ctx, sh->func);
+ sh->func = JS_DupValue(ctx, func);
+ signal(sig_num, os_signal_handler);
+ }
+ return JS_UNDEFINED;
+}
+
+#if defined(__linux__) || defined(__APPLE__)
+static int64_t get_time_ms(void)
+{
+ struct timespec ts;
+ clock_gettime(CLOCK_MONOTONIC, &ts);
+ return (uint64_t)ts.tv_sec * 1000 + (ts.tv_nsec / 1000000);
+}
+#else
+/* more portable, but does not work if the date is updated */
+static int64_t get_time_ms(void)
+{
+ struct timeval tv;
+ gettimeofday(&tv, NULL);
+ return (int64_t)tv.tv_sec * 1000 + (tv.tv_usec / 1000);
+}
+#endif
+
+static void unlink_timer(JSRuntime *rt, JSOSTimer *th)
+{
+ if (th->link.prev) {
+ list_del(&th->link);
+ th->link.prev = th->link.next = NULL;
+ }
+}
+
+static void free_timer(JSRuntime *rt, JSOSTimer *th)
+{
+ JS_FreeValueRT(rt, th->func);
+ js_free_rt(rt, th);
+}
+
+static JSClassID js_os_timer_class_id;
+
+static void js_os_timer_finalizer(JSRuntime *rt, JSValue val)
+{
+ JSOSTimer *th = JS_GetOpaque(val, js_os_timer_class_id);
+ if (th) {
+ th->has_object = FALSE;
+ if (!th->link.prev)
+ free_timer(rt, th);
+ }
+}
+
+static void js_os_timer_mark(JSRuntime *rt, JSValueConst val,
+ JS_MarkFunc *mark_func)
+{
+ JSOSTimer *th = JS_GetOpaque(val, js_os_timer_class_id);
+ if (th) {
+ JS_MarkValue(rt, th->func, mark_func);
+ }
+}
+
+static JSValue js_os_setTimeout(JSContext *ctx, JSValueConst this_val,
+ int argc, JSValueConst *argv)
+{
+ int64_t delay;
+ JSValueConst func;
+ JSOSTimer *th;
+ JSValue obj;
+
+ if (JS_ToInt64(ctx, &delay, argv[0]))
+ return JS_EXCEPTION;
+ func = argv[1];
+ if (!JS_IsFunction(ctx, func))
+ return JS_ThrowTypeError(ctx, "not a function");
+ obj = JS_NewObjectClass(ctx, js_os_timer_class_id);
+ if (JS_IsException(obj))
+ return obj;
+ th = js_mallocz(ctx, sizeof(*th));
+ th->has_object = TRUE;
+ if (!th) {
+ JS_FreeValue(ctx, obj);
+ return JS_EXCEPTION;
+ }
+ th->timeout = get_time_ms() + delay;
+ th->func = JS_DupValue(ctx, func);
+ list_add_tail(&th->link, &os_timers);
+ JS_SetOpaque(obj, th);
+ return obj;
+}
+
+static JSValue js_os_clearTimeout(JSContext *ctx, JSValueConst this_val,
+ int argc, JSValueConst *argv)
+{
+ JSOSTimer *th = JS_GetOpaque2(ctx, argv[0], js_os_timer_class_id);
+ if (!th)
+ return JS_EXCEPTION;
+ unlink_timer(JS_GetRuntime(ctx), th);
+ return JS_UNDEFINED;
+}
+
+static JSClassDef js_os_timer_class = {
+ "OSTimer",
+ .finalizer = js_os_timer_finalizer,
+ .gc_mark = js_os_timer_mark,
+};
+
+static void call_handler(JSContext *ctx, JSValueConst func)
+{
+ JSValue ret;
+ ret = JS_Call(ctx, func, JS_UNDEFINED, 0, NULL);
+ if (JS_IsException(ret))
+ js_std_dump_error(ctx);
+ JS_FreeValue(ctx, ret);
+}
+
+#if defined(_WIN32)
+
+static int js_os_poll(JSContext *ctx)
+{
+ int min_delay, console_fd;
+ int64_t cur_time, delay;
+ JSOSRWHandler *rh;
+ struct list_head *el;
+
+ /* XXX: handle signals if useful */
+
+ if (list_empty(&os_rw_handlers) && list_empty(&os_timers))
+ return -1; /* no more events */
+
+ /* XXX: only timers and basic console input are supported */
+ if (!list_empty(&os_timers)) {
+ cur_time = get_time_ms();
+ min_delay = 10000;
+ list_for_each(el, &os_timers) {
+ JSOSTimer *th = list_entry(el, JSOSTimer, link);
+ delay = th->timeout - cur_time;
+ if (delay <= 0) {
+ JSValue func;
+ /* the timer expired */
+ func = th->func;
+ th->func = JS_UNDEFINED;
+ unlink_timer(JS_GetRuntime(ctx), th);
+ if (!th->has_object)
+ free_timer(JS_GetRuntime(ctx), th);
+ call_handler(ctx, func);
+ JS_FreeValue(ctx, func);
+ return 0;
+ } else if (delay < min_delay) {
+ min_delay = delay;
+ }
+ }
+ } else {
+ min_delay = -1;
+ }
+
+ console_fd = -1;
+ list_for_each(el, &os_rw_handlers) {
+ rh = list_entry(el, JSOSRWHandler, link);
+ if (rh->fd == 0 && !JS_IsNull(rh->rw_func[0])) {
+ console_fd = rh->fd;
+ break;
+ }
+ }
+
+ if (console_fd >= 0) {
+ DWORD ti, ret;
+ HANDLE handle;
+ if (min_delay == -1)
+ ti = INFINITE;
+ else
+ ti = min_delay;
+ handle = (HANDLE)_get_osfhandle(console_fd);
+ ret = WaitForSingleObject(handle, ti);
+ if (ret == WAIT_OBJECT_0) {
+ list_for_each(el, &os_rw_handlers) {
+ rh = list_entry(el, JSOSRWHandler, link);
+ if (rh->fd == console_fd && !JS_IsNull(rh->rw_func[0])) {
+ call_handler(ctx, rh->rw_func[0]);
+ /* must stop because the list may have been modified */
+ break;
+ }
+ }
+ }
+ } else {
+ Sleep(min_delay);
+ }
+ return 0;
+}
+#else
+static int js_os_poll(JSContext *ctx)
+{
+ int ret, fd_max, min_delay;
+ int64_t cur_time, delay;
+ fd_set rfds, wfds;
+ JSOSRWHandler *rh;
+ struct list_head *el;
+ struct timeval tv, *tvp;
+
+ if (unlikely(os_pending_signals != 0)) {
+ JSOSSignalHandler *sh;
+ uint64_t mask;
+
+ list_for_each(el, &os_signal_handlers) {
+ sh = list_entry(el, JSOSSignalHandler, link);
+ mask = (uint64_t)1 << sh->sig_num;
+ if (os_pending_signals & mask) {
+ os_pending_signals &= ~mask;
+ call_handler(ctx, sh->func);
+ return 0;
+ }
+ }
+ }
+
+ if (list_empty(&os_rw_handlers) && list_empty(&os_timers))
+ return -1; /* no more events */
+
+ if (!list_empty(&os_timers)) {
+ cur_time = get_time_ms();
+ min_delay = 10000;
+ list_for_each(el, &os_timers) {
+ JSOSTimer *th = list_entry(el, JSOSTimer, link);
+ delay = th->timeout - cur_time;
+ if (delay <= 0) {
+ JSValue func;
+ /* the timer expired */
+ func = th->func;
+ th->func = JS_UNDEFINED;
+ unlink_timer(JS_GetRuntime(ctx), th);
+ if (!th->has_object)
+ free_timer(JS_GetRuntime(ctx), th);
+ call_handler(ctx, func);
+ JS_FreeValue(ctx, func);
+ return 0;
+ } else if (delay < min_delay) {
+ min_delay = delay;
+ }
+ }
+ tv.tv_sec = min_delay / 1000;
+ tv.tv_usec = (min_delay % 1000) * 1000;
+ tvp = &tv;
+ } else {
+ tvp = NULL;
+ }
+
+ FD_ZERO(&rfds);
+ FD_ZERO(&wfds);
+ fd_max = -1;
+ list_for_each(el, &os_rw_handlers) {
+ rh = list_entry(el, JSOSRWHandler, link);
+ fd_max = max_int(fd_max, rh->fd);
+ if (!JS_IsNull(rh->rw_func[0]))
+ FD_SET(rh->fd, &rfds);
+ if (!JS_IsNull(rh->rw_func[1]))
+ FD_SET(rh->fd, &wfds);
+ }
+
+ ret = select(fd_max + 1, &rfds, &wfds, NULL, tvp);
+ if (ret > 0) {
+ list_for_each(el, &os_rw_handlers) {
+ rh = list_entry(el, JSOSRWHandler, link);
+ if (!JS_IsNull(rh->rw_func[0]) &&
+ FD_ISSET(rh->fd, &rfds)) {
+ call_handler(ctx, rh->rw_func[0]);
+ /* must stop because the list may have been modified */
+ break;
+ }
+ if (!JS_IsNull(rh->rw_func[1])) {
+ FD_SET(rh->fd, &wfds);
+ call_handler(ctx, rh->rw_func[1]);
+ /* must stop because the list may have been modified */
+ break;
+ }
+ }
+ }
+ return 0;
+}
+#endif /* !_WIN32 */
+
+#if defined(_WIN32)
+#define OS_PLATFORM "win32"
+#elif defined(__APPLE__)
+#define OS_PLATFORM "darwin"
+#elif defined(EMSCRIPTEN)
+#define OS_PLATFORM "js"
+#else
+#define OS_PLATFORM "linux"
+#endif
+
+#define OS_FLAG(x) JS_PROP_INT32_DEF(#x, x, JS_PROP_CONFIGURABLE )
+
+static const JSCFunctionListEntry js_os_funcs[] = {
+ JS_CFUNC_DEF("open", 2, js_os_open ),
+ OS_FLAG(O_RDONLY),
+ OS_FLAG(O_WRONLY),
+ OS_FLAG(O_RDWR),
+ OS_FLAG(O_APPEND),
+ OS_FLAG(O_CREAT),
+ OS_FLAG(O_EXCL),
+ OS_FLAG(O_TRUNC),
+#if defined(_WIN32)
+ OS_FLAG(O_BINARY),
+ OS_FLAG(O_TEXT),
+#endif
+ JS_CFUNC_DEF("close", 1, js_os_close ),
+ JS_CFUNC_DEF("seek", 3, js_os_seek ),
+ JS_CFUNC_MAGIC_DEF("read", 4, js_os_read_write, 0 ),
+ JS_CFUNC_MAGIC_DEF("write", 4, js_os_read_write, 1 ),
+ JS_CFUNC_DEF("isatty", 1, js_os_isatty ),
+ JS_CFUNC_DEF("ttyGetWinSize", 1, js_os_ttyGetWinSize ),
+ JS_CFUNC_DEF("ttySetRaw", 1, js_os_ttySetRaw ),
+ JS_CFUNC_DEF("remove", 1, js_os_remove ),
+ JS_CFUNC_DEF("rename", 2, js_os_rename ),
+ JS_CFUNC_MAGIC_DEF("setReadHandler", 2, js_os_setReadHandler, 0 ),
+ JS_CFUNC_MAGIC_DEF("setWriteHandler", 2, js_os_setReadHandler, 1 ),
+ JS_CFUNC_DEF("signal", 2, js_os_signal ),
+ OS_FLAG(SIGINT),
+ OS_FLAG(SIGABRT),
+ OS_FLAG(SIGFPE),
+ OS_FLAG(SIGILL),
+ OS_FLAG(SIGSEGV),
+ OS_FLAG(SIGTERM),
+ JS_CFUNC_DEF("setTimeout", 2, js_os_setTimeout ),
+ JS_CFUNC_DEF("clearTimeout", 1, js_os_clearTimeout ),
+ JS_PROP_STRING_DEF("platform", OS_PLATFORM, 0 ),
+ /* stat, readlink, opendir, closedir, ... */
+};
+
+static int js_os_init(JSContext *ctx, JSModuleDef *m)
+{
+ os_poll_func = js_os_poll;
+
+ /* OSTimer class */
+ JS_NewClassID(&js_os_timer_class_id);
+ JS_NewClass(JS_GetRuntime(ctx), js_os_timer_class_id, &js_os_timer_class);
+
+ return JS_SetModuleExportList(ctx, m, js_os_funcs,
+ countof(js_os_funcs));
+}
+
+JSModuleDef *js_init_module_os(JSContext *ctx, const char *module_name)
+{
+ JSModuleDef *m;
+ m = JS_NewCModule(ctx, module_name, js_os_init);
+ if (!m)
+ return NULL;
+ JS_AddModuleExportList(ctx, m, js_os_funcs, countof(js_os_funcs));
+ return m;
+}
+
+/**********************************************************/
+
+static JSValue js_print(JSContext *ctx, JSValueConst this_val,
+ int argc, JSValueConst *argv)
+{
+ int i;
+ const char *str;
+
+ for(i = 0; i < argc; i++) {
+ if (i != 0)
+ putchar(' ');
+ str = JS_ToCString(ctx, argv[i]);
+ if (!str)
+ return JS_EXCEPTION;
+ fputs(str, stdout);
+ JS_FreeCString(ctx, str);
+ }
+ putchar('\n');
+ return JS_UNDEFINED;
+}
+
+void js_std_add_helpers(JSContext *ctx, int argc, char **argv)
+{
+ JSValue global_obj, console, args;
+ int i;
+
+ /* XXX: should these global definitions be enumerable? */
+ global_obj = JS_GetGlobalObject(ctx);
+
+ console = JS_NewObject(ctx);
+ JS_SetPropertyStr(ctx, console, "log",
+ JS_NewCFunction(ctx, js_print, "log", 1));
+ JS_SetPropertyStr(ctx, global_obj, "console", console);
+
+ /* same methods as the mozilla JS shell */
+ args = JS_NewArray(ctx);
+ for(i = 0; i < argc; i++) {
+ JS_SetPropertyUint32(ctx, args, i, JS_NewString(ctx, argv[i]));
+ }
+ JS_SetPropertyStr(ctx, global_obj, "scriptArgs", args);
+
+ JS_SetPropertyStr(ctx, global_obj, "print",
+ JS_NewCFunction(ctx, js_print, "print", 1));
+ JS_SetPropertyStr(ctx, global_obj, "__loadScript",
+ JS_NewCFunction(ctx, js_loadScript, "__loadScript", 1));
+
+ JS_FreeValue(ctx, global_obj);
+
+ /* XXX: not multi-context */
+ init_list_head(&os_rw_handlers);
+ init_list_head(&os_signal_handlers);
+ init_list_head(&os_timers);
+ os_pending_signals = 0;
+}
+
+void js_std_free_handlers(JSRuntime *rt)
+{
+ struct list_head *el, *el1;
+
+ list_for_each_safe(el, el1, &os_rw_handlers) {
+ JSOSRWHandler *rh = list_entry(el, JSOSRWHandler, link);
+ free_rw_handler(rt, rh);
+ }
+
+ list_for_each_safe(el, el1, &os_signal_handlers) {
+ JSOSSignalHandler *sh = list_entry(el, JSOSSignalHandler, link);
+ free_sh(rt, sh);
+ }
+
+ list_for_each_safe(el, el1, &os_timers) {
+ JSOSTimer *th = list_entry(el, JSOSTimer, link);
+ unlink_timer(rt, th);
+ if (!th->has_object)
+ free_timer(rt, th);
+ }
+}
+
+void js_std_dump_error(JSContext *ctx)
+{
+ JSValue exception_val, val;
+ const char *stack;
+ BOOL is_error;
+
+ exception_val = JS_GetException(ctx);
+ is_error = JS_IsError(ctx, exception_val);
+ if (!is_error)
+ printf("Throw: ");
+ js_print(ctx, JS_NULL, 1, (JSValueConst *)&exception_val);
+ if (is_error) {
+ val = JS_GetPropertyStr(ctx, exception_val, "stack");
+ if (!JS_IsUndefined(val)) {
+ stack = JS_ToCString(ctx, val);
+ printf("%s\n", stack);
+ JS_FreeCString(ctx, stack);
+ }
+ JS_FreeValue(ctx, val);
+ }
+ JS_FreeValue(ctx, exception_val);
+}
+
+/* main loop which calls the user JS callbacks */
+void js_std_loop(JSContext *ctx)
+{
+ JSContext *ctx1;
+ int err;
+
+ for(;;) {
+ /* execute the pending jobs */
+ for(;;) {
+ err = JS_ExecutePendingJob(JS_GetRuntime(ctx), &ctx1);
+ if (err <= 0) {
+ if (err < 0) {
+ js_std_dump_error(ctx1);
+ }
+ break;
+ }
+ }
+
+ if (!os_poll_func || os_poll_func(ctx))
+ break;
+ }
+}
+
+void js_std_eval_binary(JSContext *ctx, const uint8_t *buf, size_t buf_len,
+ int flags)
+{
+ JSValue val;
+ val = JS_EvalBinary(ctx, buf, buf_len, flags);
+ if (JS_IsException(val)) {
+ js_std_dump_error(ctx);
+ exit(1);
+ }
+ JS_FreeValue(ctx, val);
+}
diff --git a/thirdparty/quickjs/quickjs-2019-07-09-dust3d/quickjs-libc.h b/thirdparty/quickjs/quickjs-2019-07-09-dust3d/quickjs-libc.h
new file mode 100755
index 00000000..35ca4cff
--- /dev/null
+++ b/thirdparty/quickjs/quickjs-2019-07-09-dust3d/quickjs-libc.h
@@ -0,0 +1,44 @@
+/*
+ * QuickJS C library
+ *
+ * Copyright (c) 2017-2018 Fabrice Bellard
+ *
+ * Permission is hereby granted, free of charge, to any person obtaining a copy
+ * of this software and associated documentation files (the "Software"), to deal
+ * in the Software without restriction, including without limitation the rights
+ * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+ * copies of the Software, and to permit persons to whom the Software is
+ * furnished to do so, subject to the following conditions:
+ *
+ * The above copyright notice and this permission notice shall be included in
+ * all copies or substantial portions of the Software.
+ *
+ * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+ * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+ * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
+ * THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+ * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+ * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
+ * THE SOFTWARE.
+ */
+#ifndef QUICKJS_LIBC_H
+#define QUICKJS_LIBC_H
+
+#include
+#include
+
+#include "quickjs.h"
+
+JSModuleDef *js_init_module_std(JSContext *ctx, const char *module_name);
+JSModuleDef *js_init_module_os(JSContext *ctx, const char *module_name);
+void js_std_add_helpers(JSContext *ctx, int argc, char **argv);
+void js_std_loop(JSContext *ctx);
+void js_std_free_handlers(JSRuntime *rt);
+void js_std_dump_error(JSContext *ctx);
+uint8_t *js_load_file(JSContext *ctx, size_t *pbuf_len, const char *filename);
+JSModuleDef *js_module_loader(JSContext *ctx,
+ const char *module_name, void *opaque);
+void js_std_eval_binary(JSContext *ctx, const uint8_t *buf, size_t buf_len,
+ int flags);
+
+#endif /* QUICKJS_LIBC_H */
diff --git a/thirdparty/quickjs/quickjs-2019-07-09-dust3d/quickjs-opcode.h b/thirdparty/quickjs/quickjs-2019-07-09-dust3d/quickjs-opcode.h
new file mode 100755
index 00000000..44fcc83c
--- /dev/null
+++ b/thirdparty/quickjs/quickjs-2019-07-09-dust3d/quickjs-opcode.h
@@ -0,0 +1,354 @@
+/*
+ * QuickJS opcode definitions
+ *
+ * Copyright (c) 2017-2018 Fabrice Bellard
+ * Copyright (c) 2017-2018 Charlie Gordon
+ *
+ * Permission is hereby granted, free of charge, to any person obtaining a copy
+ * of this software and associated documentation files (the "Software"), to deal
+ * in the Software without restriction, including without limitation the rights
+ * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+ * copies of the Software, and to permit persons to whom the Software is
+ * furnished to do so, subject to the following conditions:
+ *
+ * The above copyright notice and this permission notice shall be included in
+ * all copies or substantial portions of the Software.
+ *
+ * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+ * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+ * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
+ * THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+ * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+ * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
+ * THE SOFTWARE.
+ */
+
+#ifdef FMT
+FMT(none)
+FMT(none_int)
+FMT(none_loc)
+FMT(none_arg)
+FMT(none_var_ref)
+FMT(u8)
+FMT(i8)
+FMT(loc8)
+FMT(const8)
+FMT(label8)
+FMT(u16)
+FMT(i16)
+FMT(label16)
+FMT(npop)
+FMT(npopx)
+FMT(loc)
+FMT(arg)
+FMT(var_ref)
+FMT(u32)
+FMT(i32)
+FMT(const)
+FMT(label)
+FMT(atom)
+FMT(atom_u8)
+FMT(atom_u16)
+FMT(atom_label_u8)
+FMT(atom_label_u16)
+FMT(label_u16)
+#undef FMT
+#endif /* FMT */
+
+#ifdef DEF
+
+#ifndef def
+#define def(id, size, n_pop, n_push, f) DEF(id, size, n_pop, n_push, f)
+#endif
+
+def(invalid, 1, 0, 0, none) /* never emitted */
+
+/* push values */
+DEF( push_i32, 5, 0, 1, i32)
+DEF( push_const, 5, 0, 1, const)
+DEF( fclosure, 5, 0, 1, const) /* must follow push_const */
+DEF(push_atom_value, 5, 0, 1, atom)
+DEF( undefined, 1, 0, 1, none)
+DEF( null, 1, 0, 1, none)
+DEF( push_this, 1, 0, 1, none) /* only used at the start of a function */
+DEF( push_false, 1, 0, 1, none)
+DEF( push_true, 1, 0, 1, none)
+DEF( object, 1, 0, 1, none)
+DEF( var_object, 1, 0, 1, none)
+DEF( this_func, 1, 0, 1, none) /* only used at the start of a function */
+DEF( arguments, 2, 0, 1, none) /* only used at the start of a function */
+DEF( rest, 3, 0, 1, u16) /* only used at the start of a function */
+DEF( new_target, 1, 0, 1, none) /* only used at the start of a function */
+DEF( home_object, 1, 0, 1, none) /* only used at the start of a function */
+
+DEF( drop, 1, 1, 0, none) /* a -> */
+DEF( nip, 1, 2, 1, none) /* a b -> b */
+DEF( nip1, 1, 3, 2, none) /* a b c -> b c */
+DEF( dup, 1, 1, 2, none) /* a -> a a */
+DEF( dup1, 1, 2, 3, none) /* a b -> a a b */
+DEF( dup2, 1, 2, 4, none) /* a b -> a b a b */
+DEF( dup3, 1, 3, 6, none) /* a b c -> a b c a b c */
+DEF( insert2, 1, 2, 3, none) /* obj a -> a obj a (dup_x1) */
+DEF( insert3, 1, 3, 4, none) /* obj prop a -> a obj prop a (dup_x2) */
+DEF( insert4, 1, 4, 5, none) /* this obj prop a -> a this obj prop a */
+DEF( perm3, 1, 3, 3, none) /* obj a b -> a obj b */
+DEF( perm4, 1, 4, 4, none) /* obj prop a b -> a obj prop b */
+DEF( perm5, 1, 5, 5, none) /* this obj prop a b -> a this obj prop b */
+DEF( swap, 1, 2, 2, none) /* a b -> b a */
+DEF( swap2, 1, 4, 4, none) /* a b c d -> c d a b */
+DEF( rot3l, 1, 3, 3, none) /* x a b -> a b x */
+DEF( rot3r, 1, 3, 3, none) /* a b x -> x a b */
+DEF( rot4l, 1, 4, 4, none) /* x a b c -> a b c x */
+DEF( rot5l, 1, 5, 5, none) /* x a b c d -> a b c d x */
+
+DEF(call_constructor, 3, 2, 1, npop) /* func new.target args -> ret. arguments are not counted in n_pop */
+DEF( call, 3, 1, 1, npop) /* arguments are not counted in n_pop */
+DEF( tail_call, 3, 1, 0, npop) /* arguments are not counted in n_pop */
+DEF( call_method, 3, 2, 1, npop) /* arguments are not counted in n_pop */
+DEF(tail_call_method, 3, 2, 0, npop) /* arguments are not counted in n_pop */
+DEF( array_from, 3, 0, 1, npop) /* arguments are not counted in n_pop */
+DEF( apply, 3, 3, 1, u16)
+DEF( return, 1, 1, 0, none)
+DEF( return_undef, 1, 0, 0, none)
+DEF(check_ctor_return, 1, 1, 2, none)
+DEF( check_ctor, 1, 0, 0, none)
+DEF( return_async, 1, 1, 0, none)
+DEF( throw, 1, 1, 0, none)
+DEF( throw_var, 6, 0, 0, atom_u8)
+DEF( eval, 3, 1, 1, u16)
+DEF( regexp, 1, 2, 1, none) /* create a RegExp object from the pattern and a
+ bytecode string */
+DEF( get_super_ctor, 1, 1, 1, none)
+DEF( get_super, 1, 1, 1, none)
+
+DEF( check_var, 5, 0, 1, atom) /* check if a variable exists */
+DEF( get_var_undef, 5, 0, 1, atom) /* push undefined if the variable does not exist */
+DEF( get_var, 5, 0, 1, atom) /* throw an exception if the variable does not exist */
+DEF( put_var, 5, 1, 0, atom) /* must come after get_var */
+DEF( put_var_init, 5, 1, 0, atom) /* must come after put_var. Used to initialize a global lexical variable */
+DEF( put_var_strict, 5, 2, 0, atom) /* for strict mode variable write */
+
+DEF( get_ref_value, 1, 2, 3, none)
+DEF( put_ref_value, 1, 3, 0, none)
+
+DEF( define_var, 6, 0, 0, atom_u8)
+DEF(check_define_var, 6, 0, 0, atom_u8)
+DEF( define_func, 6, 1, 0, atom_u8)
+DEF( get_field, 5, 1, 1, atom)
+DEF( get_field2, 5, 1, 2, atom)
+DEF( put_field, 5, 2, 0, atom)
+DEF( get_array_el, 1, 2, 1, none)
+DEF( get_array_el2, 1, 2, 2, none) /* obj prop -> obj value */
+DEF( put_array_el, 1, 3, 0, none)
+DEF(get_super_value, 1, 3, 1, none) /* this obj prop -> value */
+DEF(put_super_value, 1, 4, 0, none) /* this obj prop value -> */
+DEF( define_field, 5, 2, 1, atom)
+DEF( set_name, 5, 1, 1, atom)
+DEF(set_name_computed, 1, 2, 2, none)
+DEF( set_proto, 1, 2, 1, none)
+DEF(define_array_el, 1, 3, 2, none)
+DEF( append, 1, 3, 2, none) /* append enumerated object, update length */
+DEF(copy_data_properties, 2, 3, 3, u8)
+DEF( define_method, 6, 2, 1, atom_u8)
+DEF(define_method_computed, 2, 3, 1, u8) /* must come after define_method */
+DEF( define_class, 2, 2, 2, u8)
+
+DEF( get_loc, 3, 0, 1, loc)
+DEF( put_loc, 3, 1, 0, loc) /* must come after get_loc */
+DEF( set_loc, 3, 1, 1, loc) /* must come after put_loc */
+DEF( get_arg, 3, 0, 1, arg)
+DEF( put_arg, 3, 1, 0, arg) /* must come after get_arg */
+DEF( set_arg, 3, 1, 1, arg) /* must come after put_arg */
+DEF( get_var_ref, 3, 0, 1, var_ref)
+DEF( put_var_ref, 3, 1, 0, var_ref) /* must come after get_var_ref */
+DEF( set_var_ref, 3, 1, 1, var_ref) /* must come after put_var_ref */
+DEF(set_loc_uninitialized, 3, 0, 0, loc)
+def(set_arg_valid_upto, 3, 0, 0, arg) /* emitted in phase 1, removed in phase 2 */
+DEF( get_loc_check, 3, 0, 1, loc)
+DEF( put_loc_check, 3, 1, 0, loc) /* must come after get_loc_check */
+DEF( put_loc_check_init, 3, 1, 0, loc)
+DEF(get_var_ref_check, 3, 0, 1, var_ref)
+DEF(put_var_ref_check, 3, 1, 0, var_ref) /* must come after get_var_ref_check */
+DEF(put_var_ref_check_init, 3, 1, 0, var_ref)
+DEF( close_loc, 3, 0, 0, loc)
+def(close_var_object, 1, 0, 0, none) /* emitted in phase 1, removed in phase 2 */
+def( enter_scope, 3, 0, 0, u16) /* emitted in phase 1, removed in phase 2 */
+def( leave_scope, 3, 0, 0, u16) /* emitted in phase 1, removed in phase 2 */
+
+DEF( if_false, 5, 1, 0, label)
+DEF( if_true, 5, 1, 0, label) /* must come after if_false */
+DEF( goto, 5, 0, 0, label) /* must come after if_true */
+def( label, 5, 0, 0, label) /* emitted in phase 1, removed in phase 3 */
+DEF( catch, 5, 0, 1, label)
+DEF( gosub, 5, 0, 0, label) /* used to execute the finally block */
+DEF( ret, 1, 1, 0, none) /* used to return from the finally block */
+
+def(scope_get_var_undef, 7, 0, 1, atom_u16) /* emitted in phase 1, removed in phase 2 */
+def( scope_get_var, 7, 0, 1, atom_u16) /* emitted in phase 1, removed in phase 2 */
+def( scope_put_var, 7, 1, 0, atom_u16) /* emitted in phase 1, removed in phase 2 */
+def(scope_delete_var, 7, 0, 1, atom_u16) /* emitted in phase 1, removed in phase 2 */
+def( scope_make_ref, 11, 0, 2, atom_label_u16) /* emitted in phase 1, removed in phase 2 */
+def( scope_get_ref, 7, 0, 2, atom_u16) /* emitted in phase 1, removed in phase 2 */
+def(scope_put_var_init, 7, 0, 2, atom_u16) /* emitted in phase 1, removed in phase 2 */
+
+DEF( to_object, 1, 1, 1, none)
+//DEF( to_string, 1, 1, 1, none)
+DEF( to_propkey, 1, 1, 1, none)
+DEF( to_propkey2, 1, 2, 2, none)
+
+DEF( with_get_var, 10, 1, 0, atom_label_u8) /* must be in the same order as scope_xxx */
+DEF( with_put_var, 10, 2, 1, atom_label_u8) /* must be in the same order as scope_xxx */
+DEF(with_delete_var, 10, 1, 0, atom_label_u8) /* must be in the same order as scope_xxx */
+DEF( with_make_ref, 10, 1, 0, atom_label_u8) /* must be in the same order as scope_xxx */
+DEF( with_get_ref, 10, 1, 0, atom_label_u8) /* must be in the same order as scope_xxx */
+DEF(with_get_ref_undef, 10, 1, 0, atom_label_u8)
+
+DEF( make_loc_ref, 7, 0, 2, atom_u16)
+DEF( make_arg_ref, 7, 0, 2, atom_u16)
+DEF(make_var_ref_ref, 7, 0, 2, atom_u16)
+DEF( make_var_ref, 5, 0, 2, atom)
+
+def( line_num, 5, 0, 0, u32) /* emitted in phase 1, removed in phase 3 */
+
+DEF( for_in_start, 1, 1, 1, none)
+DEF( for_of_start, 1, 1, 3, none)
+DEF(for_await_of_start, 1, 1, 3, none)
+DEF( for_in_next, 1, 1, 3, none)
+DEF( for_of_next, 2, 3, 5, u8)
+DEF(for_await_of_next, 1, 3, 4, none)
+DEF(iterator_get_value_done, 1, 1, 2, none)
+DEF( iterator_close, 1, 3, 0, none)
+DEF(iterator_close_return, 1, 4, 4, none)
+DEF(async_iterator_close, 1, 3, 2, none)
+DEF(async_iterator_next, 1, 4, 4, none)
+DEF(async_iterator_get, 2, 4, 5, u8)
+DEF( initial_yield, 1, 0, 0, none)
+DEF( yield, 1, 1, 2, none)
+DEF( yield_star, 1, 2, 2, none)
+DEF(async_yield_star, 1, 1, 2, none)
+DEF( await, 1, 1, 1, none)
+
+/* arithmetic/logic operations */
+DEF( neg, 1, 1, 1, none)
+DEF( plus, 1, 1, 1, none)
+DEF( dec, 1, 1, 1, none)
+DEF( inc, 1, 1, 1, none)
+DEF( post_dec, 1, 1, 2, none)
+DEF( post_inc, 1, 1, 2, none)
+DEF( dec_loc, 2, 0, 0, loc8)
+DEF( inc_loc, 2, 0, 0, loc8)
+DEF( add_loc, 2, 1, 0, loc8)
+DEF( not, 1, 1, 1, none)
+DEF( lnot, 1, 1, 1, none)
+DEF( typeof, 1, 1, 1, none)
+DEF( delete, 1, 2, 1, none)
+DEF( delete_var, 5, 0, 1, atom)
+
+DEF( mul, 1, 2, 1, none)
+DEF( div, 1, 2, 1, none)
+DEF( mod, 1, 2, 1, none)
+DEF( add, 1, 2, 1, none)
+DEF( sub, 1, 2, 1, none)
+DEF( pow, 1, 2, 1, none)
+DEF( shl, 1, 2, 1, none)
+DEF( sar, 1, 2, 1, none)
+DEF( shr, 1, 2, 1, none)
+DEF( lt, 1, 2, 1, none)
+DEF( lte, 1, 2, 1, none)
+DEF( gt, 1, 2, 1, none)
+DEF( gte, 1, 2, 1, none)
+DEF( instanceof, 1, 2, 1, none)
+DEF( in, 1, 2, 1, none)
+DEF( eq, 1, 2, 1, none)
+DEF( neq, 1, 2, 1, none)
+DEF( strict_eq, 1, 2, 1, none)
+DEF( strict_neq, 1, 2, 1, none)
+DEF( and, 1, 2, 1, none)
+DEF( xor, 1, 2, 1, none)
+DEF( or, 1, 2, 1, none)
+#ifdef CONFIG_BIGNUM
+DEF( mul_pow10, 1, 2, 1, none)
+DEF( math_div, 1, 2, 1, none)
+DEF( math_mod, 1, 2, 1, none)
+DEF( math_pow, 1, 2, 1, none)
+#endif
+
+#if SHORT_OPCODES
+DEF( push_minus1, 1, 0, 1, none_int)
+DEF( push_0, 1, 0, 1, none_int)
+DEF( push_1, 1, 0, 1, none_int)
+DEF( push_2, 1, 0, 1, none_int)
+DEF( push_3, 1, 0, 1, none_int)
+DEF( push_4, 1, 0, 1, none_int)
+DEF( push_5, 1, 0, 1, none_int)
+DEF( push_6, 1, 0, 1, none_int)
+DEF( push_7, 1, 0, 1, none_int)
+DEF( push_i8, 2, 0, 1, i8)
+DEF( push_i16, 3, 0, 1, i16)
+DEF( push_const8, 2, 0, 1, const8)
+DEF( fclosure8, 2, 0, 1, const8) /* must follow push_const8 */
+DEF(push_empty_string, 1, 0, 1, none)
+
+DEF( get_loc8, 2, 0, 1, loc8)
+DEF( put_loc8, 2, 1, 0, loc8)
+DEF( set_loc8, 2, 1, 1, loc8)
+
+DEF( get_loc0, 1, 0, 1, none_loc)
+DEF( get_loc1, 1, 0, 1, none_loc)
+DEF( get_loc2, 1, 0, 1, none_loc)
+DEF( get_loc3, 1, 0, 1, none_loc)
+DEF( put_loc0, 1, 1, 0, none_loc)
+DEF( put_loc1, 1, 1, 0, none_loc)
+DEF( put_loc2, 1, 1, 0, none_loc)
+DEF( put_loc3, 1, 1, 0, none_loc)
+DEF( set_loc0, 1, 1, 1, none_loc)
+DEF( set_loc1, 1, 1, 1, none_loc)
+DEF( set_loc2, 1, 1, 1, none_loc)
+DEF( set_loc3, 1, 1, 1, none_loc)
+DEF( get_arg0, 1, 0, 1, none_arg)
+DEF( get_arg1, 1, 0, 1, none_arg)
+DEF( get_arg2, 1, 0, 1, none_arg)
+DEF( get_arg3, 1, 0, 1, none_arg)
+DEF( put_arg0, 1, 1, 0, none_arg)
+DEF( put_arg1, 1, 1, 0, none_arg)
+DEF( put_arg2, 1, 1, 0, none_arg)
+DEF( put_arg3, 1, 1, 0, none_arg)
+DEF( set_arg0, 1, 1, 1, none_arg)
+DEF( set_arg1, 1, 1, 1, none_arg)
+DEF( set_arg2, 1, 1, 1, none_arg)
+DEF( set_arg3, 1, 1, 1, none_arg)
+DEF( get_var_ref0, 1, 0, 1, none_var_ref)
+DEF( get_var_ref1, 1, 0, 1, none_var_ref)
+DEF( get_var_ref2, 1, 0, 1, none_var_ref)
+DEF( get_var_ref3, 1, 0, 1, none_var_ref)
+DEF( put_var_ref0, 1, 1, 0, none_var_ref)
+DEF( put_var_ref1, 1, 1, 0, none_var_ref)
+DEF( put_var_ref2, 1, 1, 0, none_var_ref)
+DEF( put_var_ref3, 1, 1, 0, none_var_ref)
+DEF( set_var_ref0, 1, 1, 1, none_var_ref)
+DEF( set_var_ref1, 1, 1, 1, none_var_ref)
+DEF( set_var_ref2, 1, 1, 1, none_var_ref)
+DEF( set_var_ref3, 1, 1, 1, none_var_ref)
+
+DEF( get_length, 1, 1, 1, none)
+
+DEF( if_false8, 2, 1, 0, label8)
+DEF( if_true8, 2, 1, 0, label8) /* must come after if_false8 */
+DEF( goto8, 2, 0, 0, label8) /* must come after if_true8 */
+DEF( goto16, 3, 0, 0, label16)
+
+DEF( call0, 1, 1, 1, npopx)
+DEF( call1, 1, 1, 1, npopx)
+DEF( call2, 1, 1, 1, npopx)
+DEF( call3, 1, 1, 1, npopx)
+
+DEF( is_undefined, 1, 1, 1, none)
+DEF( is_null, 1, 1, 1, none)
+DEF( is_function, 1, 1, 1, none)
+#endif
+
+DEF( nop, 1, 0, 0, none) /* temporary use during code generation */
+
+#undef DEF
+#undef def
+#endif /* DEF */
diff --git a/thirdparty/quickjs/quickjs-2019-07-09-dust3d/quickjs.c b/thirdparty/quickjs/quickjs-2019-07-09-dust3d/quickjs.c
new file mode 100755
index 00000000..059a69ef
--- /dev/null
+++ b/thirdparty/quickjs/quickjs-2019-07-09-dust3d/quickjs.c
@@ -0,0 +1,48183 @@
+/*
+ * QuickJS Javascript Engine
+ *
+ * Copyright (c) 2017-2019 Fabrice Bellard
+ * Copyright (c) 2017-2019 Charlie Gordon
+ *
+ * Permission is hereby granted, free of charge, to any person obtaining a copy
+ * of this software and associated documentation files (the "Software"), to deal
+ * in the Software without restriction, including without limitation the rights
+ * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+ * copies of the Software, and to permit persons to whom the Software is
+ * furnished to do so, subject to the following conditions:
+ *
+ * The above copyright notice and this permission notice shall be included in
+ * all copies or substantial portions of the Software.
+ *
+ * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+ * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+ * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
+ * THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+ * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+ * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
+ * THE SOFTWARE.
+ */
+#include
+#include
+#include
+#include
+#include
+#include
+//#include
+#include
+#include
+#include
+#if defined(__APPLE__)
+#include
+#elif defined(__linux__)
+#include
+#endif
+
+#include "cutils.h"
+#include "list.h"
+#include "quickjs.h"
+#include "libregexp.h"
+#ifdef CONFIG_BIGNUM
+#include "libbf.h"
+#endif
+
+#define OPTIMIZE 1
+#define SHORT_OPCODES 1
+#if defined(_MSC_VER)
+#define DIRECT_DISPATCH 0
+#else
+#if defined(EMSCRIPTEN)
+#define DIRECT_DISPATCH 0
+#else
+#define DIRECT_DISPATCH 1
+#endif
+#endif
+
+#if defined(__APPLE__)
+#define MALLOC_OVERHEAD 0
+#else
+#define MALLOC_OVERHEAD 8
+#endif
+
+#if !defined(_WIN32)
+/* define it if printf uses the RNDN rounding mode instead of RNDNA */
+#define CONFIG_PRINTF_RNDN
+#endif
+
+/* define to include Atomics.* operations which depend on the OS
+ threads */
+#if !defined(EMSCRIPTEN)
+#if !defined(_MSC_VER) && !defined(__linux__)
+#define CONFIG_ATOMICS
+#endif
+#endif
+#define JSON_SUPERSET 1
+
+/* dump object free */
+//#define DUMP_FREE
+//#define DUMP_CLOSURE
+/* dump the bytecode of the compiled functions: combination of bits
+ 1: dump pass 3 final byte code
+ 2: dump pass 2 code
+ 4: dump pass 1 code
+ 8: dump stdlib functions
+ 16: dump bytecode in hex
+ 32: dump line number table
+ */
+//#define DUMP_BYTECODE (1)
+/* dump the occurence of the automatic GC */
+//#define DUMP_GC
+/* dump objects freed by the garbage collector */
+//#define DUMP_GC_FREE
+/* dump objects leaking when freeing the runtime */
+//#define DUMP_LEAKS 1
+/* dump memory usage before running the garbage collector */
+//#define DUMP_MEM
+//#define DUMP_OBJECTS /* dump objects in JS_FreeContext */
+//#define DUMP_ATOMS /* dump atoms in JS_FreeContext */
+//#define DUMP_SHAPES /* dump shapes in JS_FreeContext */
+//#define DUMP_MODULE_RESOLVE
+//#define DUMP_PROMISE
+//#define DUMP_READ_OBJECT
+
+/* test the GC by forcing it before each object allocation */
+//#define FORCE_GC_AT_MALLOC
+
+#ifdef CONFIG_ATOMICS
+#include
+#include
+#include
+#endif
+
+enum {
+ /* classid tag */ /* union usage | properties */
+ JS_CLASS_OBJECT = 1, /* must be first */
+ JS_CLASS_ARRAY, /* u.array | length */
+ JS_CLASS_ERROR,
+ JS_CLASS_NUMBER, /* u.object_data */
+ JS_CLASS_STRING, /* u.object_data */
+ JS_CLASS_BOOLEAN, /* u.object_data */
+ JS_CLASS_SYMBOL, /* u.object_data */
+ JS_CLASS_ARGUMENTS, /* u.array | length */
+ JS_CLASS_MAPPED_ARGUMENTS, /* | length */
+ JS_CLASS_DATE, /* u.object_data */
+ JS_CLASS_MODULE_NS,
+ JS_CLASS_C_FUNCTION, /* u.cfunc */
+ JS_CLASS_BYTECODE_FUNCTION, /* u.func */
+ JS_CLASS_BOUND_FUNCTION, /* u.bound_function */
+ JS_CLASS_C_FUNCTION_DATA, /* u.c_function_data_record */
+ JS_CLASS_GENERATOR_FUNCTION, /* u.func */
+ JS_CLASS_FOR_IN_ITERATOR, /* u.for_in_iterator */
+ JS_CLASS_REGEXP, /* u.regexp */
+ JS_CLASS_ARRAY_BUFFER, /* u.array_buffer */
+ JS_CLASS_SHARED_ARRAY_BUFFER, /* u.array_buffer */
+ JS_CLASS_UINT8C_ARRAY, /* u.array (typed_array) */
+ JS_CLASS_INT8_ARRAY, /* u.array (typed_array) */
+ JS_CLASS_UINT8_ARRAY, /* u.array (typed_array) */
+ JS_CLASS_INT16_ARRAY, /* u.array (typed_array) */
+ JS_CLASS_UINT16_ARRAY, /* u.array (typed_array) */
+ JS_CLASS_INT32_ARRAY, /* u.array (typed_array) */
+ JS_CLASS_UINT32_ARRAY, /* u.array (typed_array) */
+#ifdef CONFIG_BIGNUM
+ JS_CLASS_BIG_INT64_ARRAY, /* u.array (typed_array) */
+ JS_CLASS_BIG_UINT64_ARRAY, /* u.array (typed_array) */
+#endif
+ JS_CLASS_FLOAT32_ARRAY, /* u.array (typed_array) */
+ JS_CLASS_FLOAT64_ARRAY, /* u.array (typed_array) */
+ JS_CLASS_DATAVIEW, /* u.typed_array */
+#ifdef CONFIG_BIGNUM
+ JS_CLASS_BIG_INT, /* u.object_data */
+ JS_CLASS_BIG_FLOAT, /* u.object_data */
+ JS_CLASS_FLOAT_ENV, /* u.float_env */
+#endif
+ JS_CLASS_MAP, /* u.map_state */
+ JS_CLASS_SET, /* u.map_state */
+ JS_CLASS_WEAKMAP, /* u.map_state */
+ JS_CLASS_WEAKSET, /* u.map_state */
+ JS_CLASS_MAP_ITERATOR, /* u.map_iterator_data */
+ JS_CLASS_SET_ITERATOR, /* u.map_iterator_data */
+ JS_CLASS_ARRAY_ITERATOR, /* u.array_iterator_data */
+ JS_CLASS_STRING_ITERATOR, /* u.array_iterator_data */
+ JS_CLASS_GENERATOR, /* u.generator_data */
+ JS_CLASS_PROXY, /* u.proxy_data */
+ JS_CLASS_PROMISE, /* u.promise_data */
+ JS_CLASS_PROMISE_RESOLVE_FUNCTION, /* u.promise_function_data */
+ JS_CLASS_PROMISE_REJECT_FUNCTION, /* u.promise_function_data */
+ JS_CLASS_ASYNC_FUNCTION, /* u.func */
+ JS_CLASS_ASYNC_FUNCTION_RESOLVE, /* u.async_function_data */
+ JS_CLASS_ASYNC_FUNCTION_REJECT, /* u.async_function_data */
+ JS_CLASS_ASYNC_FROM_SYNC_ITERATOR, /* u.async_from_sync_iterator_data */
+ JS_CLASS_ASYNC_GENERATOR_FUNCTION, /* u.func */
+ JS_CLASS_ASYNC_GENERATOR, /* u.async_generator_data */
+
+ JS_CLASS_INIT_COUNT, /* last entry for predefined classes */
+};
+
+/* number of typed array types */
+#define JS_TYPED_ARRAY_COUNT (JS_CLASS_FLOAT64_ARRAY - JS_CLASS_UINT8C_ARRAY + 1)
+static uint8_t const typed_array_size_log2[JS_TYPED_ARRAY_COUNT];
+#define typed_array_size_log2(classid) (typed_array_size_log2[(classid)- JS_CLASS_UINT8C_ARRAY])
+
+typedef enum JSErrorEnum {
+ JS_EVAL_ERROR,
+ JS_RANGE_ERROR,
+ JS_REFERENCE_ERROR,
+ JS_SYNTAX_ERROR,
+ JS_TYPE_ERROR,
+ JS_URI_ERROR,
+ JS_INTERNAL_ERROR,
+
+ JS_NATIVE_ERROR_COUNT, /* number of different NativeError objects */
+} JSErrorEnum;
+
+#define JS_MAX_LOCAL_VARS 65536
+#define JS_STACK_SIZE_MAX 65536
+#define JS_STRING_LEN_MAX ((1 << 30) - 1)
+
+#if defined(_MSC_VER)
+#define __exception
+#else
+#define __exception __attribute__((warn_unused_result))
+#endif
+
+typedef struct JSShape JSShape;
+typedef struct JSString JSString;
+typedef struct JSString JSAtomStruct;
+
+struct JSRuntime {
+ JSMallocFunctions mf;
+ JSMallocState malloc_state;
+ const char *rt_info;
+
+ int atom_hash_size; /* power of two */
+ int atom_count;
+ int atom_size;
+ int atom_count_resize; /* resize hash table at this count */
+ uint32_t *atom_hash;
+ JSAtomStruct **atom_array;
+ int atom_free_index; /* 0 = none */
+
+ int class_count; /* size of class_array */
+ JSClass *class_array;
+
+ struct list_head context_list; /* list of JSContext.link */
+ /* list of allocated objects (used by the garbage collector) */
+ struct list_head obj_list; /* list of JSObject.link */
+ size_t malloc_gc_threshold;
+#ifdef DUMP_LEAKS
+ struct list_head string_list; /* list of JSString.link */
+#endif
+ struct list_head tmp_obj_list; /* used during gc */
+ struct list_head free_obj_list; /* used during gc */
+ struct list_head *el_next; /* used during gc */
+
+ JSInterruptHandler *interrupt_handler;
+ void *interrupt_opaque;
+
+ struct list_head job_list; /* list of JSJobEntry.link */
+
+ JSModuleNormalizeFunc *module_normalize_func;
+ JSModuleLoaderFunc *module_loader_func;
+ void *module_loader_opaque;
+
+ BOOL in_gc_sweep : 8;
+ BOOL can_block : 8; /* TRUE if Atomics.wait can block */
+
+ /* Shape hash table */
+ int shape_hash_bits;
+ int shape_hash_size;
+ int shape_hash_count; /* number of hashed shapes */
+ JSShape **shape_hash;
+#ifdef CONFIG_BIGNUM
+ bf_context_t bf_ctx;
+#endif
+};
+
+struct JSClass {
+ uint32_t class_id; /* 0 means free entry */
+ JSAtom class_name;
+ JSClassFinalizer *finalizer;
+ JSClassGCMark *gc_mark;
+ JSClassCall *call;
+ /* pointers for exotic behavior, can be NULL if none are present */
+ const JSClassExoticMethods *exotic;
+};
+
+#define JS_MODE_STRICT (1 << 0)
+#define JS_MODE_STRIP (1 << 1)
+#define JS_MODE_BIGINT (1 << 2)
+#define JS_MODE_MATH (1 << 3)
+
+typedef struct JSStackFrame {
+ struct JSStackFrame *prev_frame; /* NULL if first stack frame */
+ JSValue cur_func; /* current function, JS_UNDEFINED if the frame is detached */
+ JSValue *arg_buf; /* arguments */
+ JSValue *var_buf; /* variables */
+ struct list_head var_ref_list; /* list of JSVarRef.link */
+ const uint8_t *cur_pc; /* only used in bytecode functions : PC of the
+ instruction after the call */
+ int arg_count;
+ int js_mode; /* for C functions: 0 */
+ /* only used in generators. Current stack pointer value. NULL if
+ the function is running. */
+ JSValue *cur_sp;
+} JSStackFrame;
+
+typedef struct JSGCHeader {
+ uint8_t mark;
+} JSGCHeader;
+
+typedef struct JSVarRef {
+ JSRefCountHeader header; /* must come first, 32-bit */
+ JSGCHeader gc_header; /* must come after JSRefCountHeader, 8-bit */
+ uint8_t is_arg : 1;
+ int var_idx; /* index of the corresponding function variable on
+ the stack */
+ struct list_head link; /* prev = NULL if no longer on the stack */
+ JSValue *pvalue; /* pointer to the value, either on the stack or
+ to 'value' */
+ JSValue value; /* used when the variable is no longer on the stack */
+} JSVarRef;
+
+#ifdef CONFIG_BIGNUM
+typedef struct JSFloatEnv {
+ limb_t prec;
+ bf_flags_t flags;
+ unsigned int status;
+} JSFloatEnv;
+
+/* the same structure is used for big integers and big floats. Big
+ integers are never infinite or NaNs */
+typedef struct JSBigFloat {
+ JSRefCountHeader header; /* must come first, 32-bit */
+ bf_t num;
+} JSBigFloat;
+#endif
+
+/* must be large enough to have a negligible runtime cost and small
+ enough to call the interrupt callback often. */
+#define JS_INTERRUPT_COUNTER_INIT 10000
+
+struct JSContext {
+ JSRuntime *rt;
+ struct list_head link;
+ const uint8_t *stack_top;
+ size_t stack_size; /* in bytes */
+
+ JSValue current_exception;
+ /* true if a backtrace needs to be added to the current exception
+ (the backtrace generation cannot be done immediately in a bytecode
+ function) */
+ BOOL exception_needs_backtrace : 8;
+ /* true if inside an out of memory error, to avoid recursing */
+ BOOL in_out_of_memory : 8;
+ uint16_t binary_object_count;
+ int binary_object_size;
+
+ JSShape *array_shape; /* initial shape for Array objects */
+
+ JSStackFrame *current_stack_frame;
+
+ JSValue *class_proto;
+ JSValue function_proto;
+ JSValue function_ctor;
+ JSValue regexp_ctor;
+ JSValue native_error_proto[JS_NATIVE_ERROR_COUNT];
+ JSValue iterator_proto;
+ JSValue async_iterator_proto;
+ JSValue array_proto_values;
+ JSValue throw_type_error;
+
+ JSValue global_obj; /* global object */
+ JSValue global_var_obj; /* contains the global let/const definitions */
+
+ uint64_t random_state;
+#ifdef CONFIG_BIGNUM
+ bf_context_t *bf_ctx; /* points to rt->bf_ctx, shared by all contexts */
+ JSFloatEnv fp_env; /* global FP environment */
+#endif
+ /* when the counter reaches zero, JSRutime.interrupt_handler is called */
+ int interrupt_counter;
+ BOOL is_error_property_enabled;
+
+ struct list_head loaded_modules; /* list of JSModuleDef.link */
+
+ /* if NULL, RegExp compilation is not supported */
+ JSValue (*compile_regexp)(JSContext *ctx, JSValueConst pattern,
+ JSValueConst flags);
+ /* if NULL, eval is not supported */
+ JSValue (*eval_internal)(JSContext *ctx, JSValueConst this_obj,
+ const char *input, size_t input_len,
+ const char *filename, int flags, int scope_idx);
+ void *user_opaque;
+};
+
+typedef union JSFloat64Union {
+ double d;
+ uint64_t u64;
+ uint32_t u32[2];
+} JSFloat64Union;
+
+enum {
+ JS_ATOM_TYPE_STRING = 1,
+ JS_ATOM_TYPE_GLOBAL_SYMBOL,
+ JS_ATOM_TYPE_SYMBOL,
+};
+
+#define JS_ATOM_HASH_MASK ((1 << 30) - 1)
+
+struct JSString {
+ JSRefCountHeader header; /* must come first, 32-bit */
+ uint32_t len : 31;
+ uint8_t is_wide_char : 1; /* 0 = 8 bits, 1 = 16 bits characters */
+ uint32_t hash : 30;
+ uint8_t atom_type : 2; /* != 0 if atom, JS_ATOM_TYPE_x */
+ uint32_t hash_next; /* atom_index for JS_ATOM_TYPE_SYMBOL */
+#ifdef DUMP_LEAKS
+ struct list_head link; /* string list */
+#endif
+ union {
+ uint8_t str8[0]; /* 8 bit strings will get an extra null terminator */
+ uint16_t str16[0];
+ } u;
+};
+
+typedef struct JSClosureVar {
+ uint8_t is_local : 1;
+ uint8_t is_arg : 1;
+ uint8_t is_const : 1;
+ uint8_t is_lexical : 1;
+ uint8_t is_catch : 1;
+ /* 11 bits available */
+ uint16_t var_idx; /* is_local = TRUE: index to a normal variable of the
+ parent function. otherwise: index to a closure
+ variable of the parent function */
+ JSAtom var_name;
+} JSClosureVar;
+
+typedef struct JSVarScope {
+ int parent; /* index into fd->scopes of the enclosing scope */
+ int first; /* index into fd->vars of the last variable in this scope */
+} JSVarScope;
+
+typedef struct JSVarDef {
+ JSAtom var_name;
+ int scope_level; /* index into fd->scopes of this variable lexical scope */
+ int scope_next; /* index into fd->vars of the next variable in the
+ * same or enclosing lexical scope */
+ uint8_t is_catch : 1;
+ uint8_t is_function : 1; /* only used for debug */
+ uint8_t is_func_var : 1; /* used for the function self reference */
+ uint8_t is_const : 1;
+ uint8_t is_lexical : 1;
+ uint8_t is_captured : 1;
+ int func_pool_idx : 26; /* only used during compilation */
+} JSVarDef;
+
+/* for the encoding of the pc2line table */
+#define PC2LINE_BASE (-1)
+#define PC2LINE_RANGE 5
+#define PC2LINE_OP_FIRST 1
+#define PC2LINE_DIFF_PC_MAX ((255 - PC2LINE_OP_FIRST) / PC2LINE_RANGE)
+
+typedef enum JSFunctionKindEnum {
+ JS_FUNC_NORMAL = 0,
+ JS_FUNC_GENERATOR = (1 << 0),
+ JS_FUNC_ASYNC = (1 << 1),
+ JS_FUNC_ASYNC_GENERATOR = (JS_FUNC_GENERATOR | JS_FUNC_ASYNC),
+} JSFunctionKindEnum;
+
+typedef struct JSFunctionBytecode {
+ JSRefCountHeader header; /* must come first, 32-bit */
+ JSGCHeader gc_header; /* must come after header, 8-bit */
+ uint8_t js_mode;
+ uint8_t has_prototype : 1; /* true if a prototype field is necessary */
+ uint8_t has_simple_parameter_list : 1;
+ uint8_t is_derived_class_constructor : 1;
+ /* true if home_object needs to be initialized */
+ uint8_t need_home_object : 1;
+ uint8_t func_kind : 2;
+ uint8_t new_target_allowed : 1;
+ uint8_t super_call_allowed : 1;
+ uint8_t super_allowed : 1;
+ uint8_t has_debug : 1;
+ uint8_t read_only_bytecode : 1;
+ /* XXX: 5 bits available */
+ uint8_t *byte_code_buf; /* (self pointer) */
+ int byte_code_len;
+ JSAtom func_name;
+ JSVarDef *vardefs; /* arguments + local variables (arg_count + var_count) (self pointer) */
+ JSClosureVar *closure_var; /* list of variables in the closure (self pointer) */
+ uint16_t arg_count;
+ uint16_t var_count;
+ uint16_t defined_arg_count; /* for length function property */
+ uint16_t stack_size; /* maximum stack size */
+ JSValue *cpool; /* constant pool (self pointer) */
+ int cpool_count;
+ int closure_var_count;
+ struct {
+ /* debug info, move to separate structure to save memory? */
+ JSAtom filename;
+ int line_num;
+ int source_len;
+ int pc2line_len;
+ uint8_t *pc2line_buf;
+ char *source;
+ } debug;
+} JSFunctionBytecode;
+
+typedef struct JSBoundFunction {
+ JSValue func_obj;
+ JSValue this_val;
+ int argc;
+ JSValue argv[0];
+} JSBoundFunction;
+
+typedef enum JSIteratorKindEnum {
+ JS_ITERATOR_KIND_KEY,
+ JS_ITERATOR_KIND_VALUE,
+ JS_ITERATOR_KIND_KEY_AND_VALUE,
+} JSIteratorKindEnum;
+
+typedef struct JSForInIterator {
+ JSValue obj;
+ BOOL is_array;
+ uint32_t array_length;
+ uint32_t idx;
+} JSForInIterator;
+
+typedef struct JSRegExp {
+ JSString *pattern;
+ JSString *bytecode; /* also contains the flags */
+} JSRegExp;
+
+typedef struct JSProxyData {
+ JSValue target;
+ JSValue handler;
+ JSValue proto;
+ uint8_t is_func;
+} JSProxyData;
+
+typedef struct JSArrayBuffer {
+ int byte_length; /* 0 if detached */
+ uint8_t detached;
+ uint8_t shared; /* if shared, the array buffer cannot be detached */
+ uint8_t *data; /* NULL if detached */
+ struct list_head array_list;
+ void *opaque;
+ JSFreeArrayBufferDataFunc *free_func;
+} JSArrayBuffer;
+
+typedef struct JSTypedArray {
+ struct list_head link; /* link to arraybuffer */
+ JSObject *obj; /* back pointer to the TypedArray/DataView object */
+ JSObject *buffer; /* based array buffer */
+ uint32_t offset; /* offset in the array buffer */
+ uint32_t length; /* length in the array buffer */
+} JSTypedArray;
+
+typedef struct JSAsyncFunctionState {
+ JSValue this_val; /* 'this' generator argument */
+ int argc; /* number of function arguments */
+ BOOL throw_flag; /* used to throw an exception in JS_CallInternal() */
+ JSStackFrame frame;
+} JSAsyncFunctionState;
+
+/* XXX: could use an object instead to avoid the
+ JS_TAG_ASYNC_FUNCTION tag for the GC */
+typedef struct JSAsyncFunctionData {
+ JSRefCountHeader header; /* must come first, 32-bit */
+ JSGCHeader gc_header; /* must come after JSRefCountHeader, 8-bit */
+ JSValue resolving_funcs[2];
+ BOOL is_active; /* true if the async function state is valid */
+ JSAsyncFunctionState func_state;
+} JSAsyncFunctionData;
+
+typedef struct JSReqModuleEntry {
+ JSAtom module_name;
+ JSModuleDef *module; /* used using resolution */
+} JSReqModuleEntry;
+
+typedef enum JSExportTypeEnum {
+ JS_EXPORT_TYPE_LOCAL,
+ JS_EXPORT_TYPE_INDIRECT,
+} JSExportTypeEnum;
+
+typedef struct JSExportEntry {
+ union {
+ struct {
+ int var_idx; /* closure variable index */
+ JSVarRef *var_ref; /* if != NULL, reference to the variable */
+ } local; /* for local export */
+ int req_module_idx; /* module for indirect export */
+ } u;
+ JSExportTypeEnum export_type;
+ JSAtom local_name; /* not used for local export after compilation */
+ JSAtom export_name; /* exported variable name */
+} JSExportEntry;
+
+typedef struct JSStarExportEntry {
+ int req_module_idx; /* in req_module_entries */
+} JSStarExportEntry;
+
+typedef struct JSImportEntry {
+ int var_idx; /* closure variable index */
+ JSAtom import_name;
+ int req_module_idx; /* in req_module_entries */
+} JSImportEntry;
+
+struct JSModuleDef {
+ JSRefCountHeader header; /* must come first, 32-bit */
+ JSAtom module_name;
+ struct list_head link;
+
+ JSReqModuleEntry *req_module_entries;
+ int req_module_entries_count;
+ int req_module_entries_size;
+
+ JSExportEntry *export_entries;
+ int export_entries_count;
+ int export_entries_size;
+
+ JSStarExportEntry *star_export_entries;
+ int star_export_entries_count;
+ int star_export_entries_size;
+
+ JSImportEntry *import_entries;
+ int import_entries_count;
+ int import_entries_size;
+
+ JSValue module_ns;
+ JSValue func_obj; /* only used for JS modules */
+ JSModuleInitFunc *init_func; /* only used for C modules */
+ BOOL resolved;
+ BOOL instantiated;
+ BOOL evaluated;
+};
+
+typedef struct JSJobEntry {
+ struct list_head link;
+ JSContext *ctx;
+ JSJobFunc *job_func;
+ int argc;
+ JSValue argv[0];
+} JSJobEntry;
+
+typedef struct JSProperty {
+ union {
+ JSValue value; /* JS_PROP_NORMAL */
+ struct { /* JS_PROP_GETSET */
+ JSObject *getter; /* NULL if undefined */
+ JSObject *setter; /* NULL if undefined */
+ } getset;
+ JSVarRef *var_ref; /* JS_PROP_VARREF */
+ struct { /* JS_PROP_AUTOINIT */
+ int (*init_func)(JSContext *ctx, JSObject *obj,
+ JSAtom prop, void *opaque);
+ void *opaque;
+ } init;
+ } u;
+} JSProperty;
+
+#define JS_PROP_INITIAL_SIZE 2
+#define JS_PROP_INITIAL_HASH_SIZE 4 /* must be a power of two */
+#define JS_ARRAY_INITIAL_SIZE 2
+
+typedef struct JSShapeProperty {
+ uint32_t hash_next : 26; /* 0 if last in list */
+ uint32_t flags : 6; /* JS_PROP_XXX */
+ JSAtom atom; /* JS_ATOM_NULL = free property entry */
+} JSShapeProperty;
+
+struct JSShape {
+#if !defined(_MSC_VER)
+ uint32_t prop_hash_end[0]; /* hash table of size hash_mask + 1
+ before the start of the structure. */
+#endif
+ JSRefCountHeader header; /* must come first, 32-bit */
+ JSGCHeader gc_header; /* must come after JSRefCountHeader, 8-bit */
+ /* true if the shape is inserted in the shape hash table. If not,
+ JSShape.hash is not valid */
+ uint8_t is_hashed;
+ /* If true, the shape may have small array index properties 'n' with 0
+ <= n <= 2^31-1. If false, the shape is guaranteed not to have
+ small array index properties */
+ uint8_t has_small_array_index;
+ uint32_t hash; /* current hash value */
+ uint32_t prop_hash_mask;
+ int prop_size; /* allocated properties */
+ int prop_count;
+ JSShape *shape_hash_next; /* in JSRuntime.shape_hash[h] list */
+ JSObject *proto;
+ JSShapeProperty prop[0]; /* prop_size elements */
+};
+#if defined(_MSC_VER)
+#define prop_hash_end_field_of_shape(shape) ((uint32_t *)(shape))
+#else
+#define prop_hash_end_field_of_shape(shape) (shape)->prop_hash_end
+#endif
+struct JSObject {
+ JSRefCountHeader header; /* must come first, 32-bit */
+ JSGCHeader gc_header; /* must come after JSRefCountHeader, 8-bit */
+ uint8_t extensible : 1;
+ uint8_t free_mark : 1; /* only used when freeing objects with cycles */
+ uint8_t is_exotic : 1; /* TRUE if object has exotic property handlers */
+ uint8_t fast_array : 1; /* TRUE if u.array is used for get/put */
+ uint8_t is_constructor : 1; /* TRUE if object is a constructor function */
+ uint8_t is_uncatchable_error : 1; /* if TRUE, error is not catchable */
+ uint8_t is_class : 1; /* TRUE if object is a class constructor */
+ uint8_t tmp_mark : 1; /* used in JS_WriteObjectRec() */
+ uint16_t class_id; /* see JS_CLASS_x */
+ /* byte offsets: 8/8 */
+ struct list_head link; /* object list */
+ /* byte offsets: 16/24 */
+ JSShape *shape; /* prototype and property names + flag */
+ JSProperty *prop; /* array of properties */
+ /* byte offsets: 24/40 */
+ struct JSMapRecord *first_weak_ref; /* XXX: use a bit and an external hash table? */
+ /* byte offsets: 28/48 */
+ union {
+ void *opaque;
+ struct JSBoundFunction *bound_function; /* JS_CLASS_BOUND_FUNCTION */
+ struct JSCFunctionDataRecord *c_function_data_record; /* JS_CLASS_C_FUNCTION_DATA */
+ struct JSForInIterator *for_in_iterator; /* JS_CLASS_FOR_IN_ITERATOR */
+ struct JSArrayBuffer *array_buffer; /* JS_CLASS_ARRAY_BUFFER, JS_CLASS_SHARED_ARRAY_BUFFER */
+ struct JSTypedArray *typed_array; /* JS_CLASS_UINT8C_ARRAY..JS_CLASS_DATAVIEW */
+#ifdef CONFIG_BIGNUM
+ struct JSFloatEnv *float_env; /* JS_CLASS_FLOAT_ENV */
+#endif
+ struct JSMapState *map_state; /* JS_CLASS_MAP..JS_CLASS_WEAKSET */
+ struct JSMapIteratorData *map_iterator_data; /* JS_CLASS_MAP_ITERATOR, JS_CLASS_SET_ITERATOR */
+ struct JSArrayIteratorData *array_iterator_data; /* JS_CLASS_ARRAY_ITERATOR, JS_CLASS_STRING_ITERATOR */
+ struct JSGeneratorData *generator_data; /* JS_CLASS_GENERATOR */
+ struct JSProxyData *proxy_data; /* JS_CLASS_PROXY */
+ struct JSPromiseData *promise_data; /* JS_CLASS_PROMISE */
+ struct JSPromiseFunctionData *promise_function_data; /* JS_CLASS_PROMISE_RESOLVE_FUNCTION, JS_CLASS_PROMISE_REJECT_FUNCTION */
+ struct JSAsyncFunctionData *async_function_data; /* JS_CLASS_ASYNC_FUNCTION_RESOLVE, JS_CLASS_ASYNC_FUNCTION_REJECT */
+ struct JSAsyncFromSyncIteratorData *async_from_sync_iterator_data; /* JS_CLASS_ASYNC_FROM_SYNC_ITERATOR */
+ struct JSAsyncGeneratorData *async_generator_data; /* JS_CLASS_ASYNC_GENERATOR */
+ struct { /* JS_CLASS_BYTECODE_FUNCTION: 12/24 bytes */
+ /* also used by JS_CLASS_GENERATOR_FUNCTION, JS_CLASS_ASYNC_FUNCTION and JS_CLASS_ASYNC_GENERATOR_FUNCTION */
+ struct JSFunctionBytecode *function_bytecode;
+ JSVarRef **var_refs;
+ JSObject *home_object; /* for 'super' access */
+ } func;
+ struct { /* JS_CLASS_C_FUNCTION: 8/12 bytes */
+ JSCFunctionType c_function;
+ uint8_t length;
+ uint8_t cproto;
+ int16_t magic;
+ } cfunc;
+ /* array part for fast arrays and typed arrays */
+ struct { /* JS_CLASS_ARRAY, JS_CLASS_ARGUMENTS, JS_CLASS_UINT8C_ARRAY..JS_CLASS_FLOAT64_ARRAY */
+ union {
+ uint32_t size; /* JS_CLASS_ARRAY, JS_CLASS_ARGUMENTS */
+ struct JSTypedArray *typed_array; /* JS_CLASS_UINT8C_ARRAY..JS_CLASS_FLOAT64_ARRAY */
+ } u1;
+ union {
+ JSValue *values; /* JS_CLASS_ARRAY, JS_CLASS_ARGUMENTS */
+ void *ptr; /* JS_CLASS_UINT8C_ARRAY..JS_CLASS_FLOAT64_ARRAY */
+ int8_t *int8_ptr; /* JS_CLASS_INT8_ARRAY */
+ uint8_t *uint8_ptr; /* JS_CLASS_UINT8_ARRAY, JS_CLASS_UINT8C_ARRAY */
+ int16_t *int16_ptr; /* JS_CLASS_INT16_ARRAY */
+ uint16_t *uint16_ptr; /* JS_CLASS_UINT16_ARRAY */
+ int32_t *int32_ptr; /* JS_CLASS_INT32_ARRAY */
+ uint32_t *uint32_ptr; /* JS_CLASS_UINT32_ARRAY */
+ int64_t *int64_ptr; /* JS_CLASS_INT64_ARRAY */
+ uint64_t *uint64_ptr; /* JS_CLASS_UINT64_ARRAY */
+ float *float_ptr; /* JS_CLASS_FLOAT32_ARRAY */
+ double *double_ptr; /* JS_CLASS_FLOAT64_ARRAY */
+ } u;
+ uint32_t count; /* <= 2^31-1. 0 for a detached typed array */
+ } array; /* 12/20 bytes */
+ JSRegExp regexp; /* JS_CLASS_REGEXP: 8/16 bytes */
+ JSValue object_data; /* for JS_SetObjectData(): 8/16/16 bytes */
+ } u;
+ /* byte sizes: 40/48/72 */
+};
+enum {
+ JS_ATOM_NULL,
+#define DEF(name, str) JS_ATOM_ ## name,
+#include "quickjs-atom.h"
+#undef DEF
+ JS_ATOM_END,
+};
+#define JS_ATOM_LAST_KEYWORD JS_ATOM_super
+#define JS_ATOM_LAST_STRICT_KEYWORD JS_ATOM_yield
+
+static const char js_atom_init[] =
+#define DEF(name, str) str "\0"
+#include "quickjs-atom.h"
+#undef DEF
+;
+
+typedef enum OPCodeFormat {
+#define FMT(f) OP_FMT_ ## f,
+#define DEF(id, size, n_pop, n_push, f)
+#include "quickjs-opcode.h"
+#undef DEF
+#undef FMT
+} OPCodeFormat;
+
+typedef enum OPCodeEnum {
+#define FMT(f)
+#define DEF(id, size, n_pop, n_push, f) OP_ ## id,
+#include "quickjs-opcode.h"
+#undef DEF
+#undef FMT
+ OP_COUNT,
+} OPCodeEnum;
+
+static int JS_InitAtoms(JSRuntime *rt);
+static JSAtom __JS_NewAtomInit(JSRuntime *rt, const char *str, int len,
+ int atom_type);
+static void JS_FreeAtomStruct(JSRuntime *rt, JSAtomStruct *p);
+static void free_function_bytecode(JSRuntime *rt, JSFunctionBytecode *b);
+static JSValue JS_CallInternal(JSContext *ctx, JSValueConst func_obj,
+ JSValueConst this_obj, JSValueConst new_target,
+ int argc, JSValue *argv, int flags);
+static JSValue JS_CallConstructorInternal(JSContext *ctx,
+ JSValueConst func_obj,
+ JSValueConst new_target,
+ int argc, JSValue *argv, int flags);
+static JSValue JS_CallFree(JSContext *ctx, JSValue func_obj, JSValueConst this_obj,
+ int argc, JSValueConst *argv);
+static JSValue JS_InvokeFree(JSContext *ctx, JSValue this_val, JSAtom atom,
+ int argc, JSValueConst *argv);
+static __exception int JS_ToArrayLengthFree(JSContext *ctx, uint32_t *plen,
+ JSValue val);
+static JSValue JS_EvalObject(JSContext *ctx, JSValueConst this_obj,
+ JSValueConst val, int flags, int scope_idx);
+#if defined(_MSC_VER)
+JSValue JS_ThrowInternalError(JSContext *ctx, const char *fmt, ...);
+static void JS_DumpAtoms(JSRuntime *rt);
+static void JS_DumpString(JSRuntime *rt,
+ const JSString *p);
+static void JS_DumpObjectHeader(JSRuntime *rt);
+static void JS_DumpObject(JSRuntime *rt, JSObject *p);
+static void JS_DumpValueShort(JSRuntime *rt,
+ JSValueConst val);
+static void JS_DumpValue(JSContext *ctx, JSValueConst val);
+static void JS_PrintValue(JSContext *ctx,
+ const char *str,
+ JSValueConst val);
+static void JS_DumpShapes(JSRuntime *rt);
+#else
+JSValue __attribute__((format(printf, 2, 3))) JS_ThrowInternalError(JSContext *ctx, const char *fmt, ...);
+static __attribute__((unused)) void JS_DumpAtoms(JSRuntime *rt);
+static __attribute__((unused)) void JS_DumpString(JSRuntime *rt,
+ const JSString *p);
+static __attribute__((unused)) void JS_DumpObjectHeader(JSRuntime *rt);
+static __attribute__((unused)) void JS_DumpObject(JSRuntime *rt, JSObject *p);
+static __attribute__((unused)) void JS_DumpValueShort(JSRuntime *rt,
+ JSValueConst val);
+static __attribute__((unused)) void JS_DumpValue(JSContext *ctx, JSValueConst val);
+static __attribute__((unused)) void JS_PrintValue(JSContext *ctx,
+ const char *str,
+ JSValueConst val);
+static __attribute__((unused)) void JS_DumpShapes(JSRuntime *rt);
+#endif
+static JSValue js_function_apply(JSContext *ctx, JSValueConst this_val,
+ int argc, JSValueConst *argv, int magic);
+static void js_array_finalizer(JSRuntime *rt, JSValue val);
+static void js_array_mark(JSRuntime *rt, JSValueConst val,
+ JS_MarkFunc *mark_func);
+static void js_object_data_finalizer(JSRuntime *rt, JSValue val);
+static void js_object_data_mark(JSRuntime *rt, JSValueConst val,
+ JS_MarkFunc *mark_func);
+static void js_bytecode_function_finalizer(JSRuntime *rt, JSValue val);
+static void js_bytecode_function_mark(JSRuntime *rt, JSValueConst val,
+ JS_MarkFunc *mark_func);
+static void js_bound_function_finalizer(JSRuntime *rt, JSValue val);
+static void js_bound_function_mark(JSRuntime *rt, JSValueConst val,
+ JS_MarkFunc *mark_func);
+static void js_for_in_iterator_finalizer(JSRuntime *rt, JSValue val);
+static void js_for_in_iterator_mark(JSRuntime *rt, JSValueConst val,
+ JS_MarkFunc *mark_func);
+static void js_regexp_finalizer(JSRuntime *rt, JSValue val);
+static void js_array_buffer_finalizer(JSRuntime *rt, JSValue val);
+static void js_typed_array_finalizer(JSRuntime *rt, JSValue val);
+static void js_typed_array_mark(JSRuntime *rt, JSValueConst val,
+ JS_MarkFunc *mark_func);
+static void js_proxy_finalizer(JSRuntime *rt, JSValue val);
+static void js_proxy_mark(JSRuntime *rt, JSValueConst val,
+ JS_MarkFunc *mark_func);
+static void js_map_finalizer(JSRuntime *rt, JSValue val);
+static void js_map_mark(JSRuntime *rt, JSValueConst val,
+ JS_MarkFunc *mark_func);
+static void js_map_iterator_finalizer(JSRuntime *rt, JSValue val);
+static void js_map_iterator_mark(JSRuntime *rt, JSValueConst val,
+ JS_MarkFunc *mark_func);
+static void js_array_iterator_finalizer(JSRuntime *rt, JSValue val);
+static void js_array_iterator_mark(JSRuntime *rt, JSValueConst val,
+ JS_MarkFunc *mark_func);
+static void js_generator_finalizer(JSRuntime *rt, JSValue obj);
+static void js_generator_mark(JSRuntime *rt, JSValueConst val,
+ JS_MarkFunc *mark_func);
+static void js_promise_finalizer(JSRuntime *rt, JSValue val);
+static void js_promise_mark(JSRuntime *rt, JSValueConst val,
+ JS_MarkFunc *mark_func);
+static void js_promise_resolve_function_finalizer(JSRuntime *rt, JSValue val);
+static void js_promise_resolve_function_mark(JSRuntime *rt, JSValueConst val,
+ JS_MarkFunc *mark_func);
+static JSValue js_promise_resolve_function_call(JSContext *ctx,
+ JSValueConst func_obj,
+ JSValueConst this_val,
+ int argc, JSValueConst *argv);
+static JSValue JS_ToStringFree(JSContext *ctx, JSValue val);
+static int JS_ToBoolFree(JSContext *ctx, JSValue val);
+static int JS_ToInt32Free(JSContext *ctx, int32_t *pres, JSValue val);
+static int JS_ToFloat64Free(JSContext *ctx, double *pres, JSValue val);
+static int JS_ToUint8ClampFree(JSContext *ctx, int32_t *pres, JSValue val);
+static JSValue js_compile_regexp(JSContext *ctx, JSValueConst pattern,
+ JSValueConst flags);
+static JSValue js_regexp_constructor_internal(JSContext *ctx, JSValueConst ctor,
+ JSValue pattern, JSValue bc);
+static void gc_decref(JSRuntime *rt);
+static int JS_NewClass1(JSRuntime *rt, JSClassID class_id,
+ const JSClassDef *class_def, JSAtom name);
+
+typedef enum JSStrictEqModeEnum {
+ JS_EQ_STRICT,
+ JS_EQ_SAME_VALUE,
+ JS_EQ_SAME_VALUE_ZERO,
+} JSStrictEqModeEnum;
+
+static BOOL js_strict_eq2(JSContext *ctx, JSValue op1, JSValue op2,
+ JSStrictEqModeEnum eq_mode);
+static BOOL js_strict_eq(JSContext *ctx, JSValue op1, JSValue op2);
+static BOOL js_same_value(JSContext *ctx, JSValueConst op1, JSValueConst op2);
+static BOOL js_same_value_zero(JSContext *ctx, JSValueConst op1, JSValueConst op2);
+static JSValue JS_ToObject(JSContext *ctx, JSValueConst val);
+static JSValue JS_ToObjectFree(JSContext *ctx, JSValue val);
+static JSProperty *add_property(JSContext *ctx,
+ JSObject *p, JSAtom prop, int prop_flags);
+#ifdef CONFIG_BIGNUM
+static void js_float_env_finalizer(JSRuntime *rt, JSValue val);
+static JSValue JS_NewBigInt64(JSContext *ctx, int64_t v);
+static JSValue JS_NewBigUint64(JSContext *ctx, uint64_t v);
+static JSValue JS_NewBigFloat(JSContext *ctx, bf_t *a);
+static JSValue JS_NewBigInt2(JSContext *ctx, bf_t *a, BOOL force_bigint);
+static JSValue JS_NewBigInt(JSContext *ctx, bf_t *a);
+static int JS_ToBigInt64Free(JSContext *ctx, int64_t *pres, JSValue val);
+static int JS_ToBigInt64(JSContext *ctx, int64_t *pres, JSValueConst val);
+static bf_t *JS_ToBigFloat(JSContext *ctx, BOOL *pis_float, bf_t *buf,
+ JSValueConst val);
+#endif
+JSValue JS_ThrowOutOfMemory(JSContext *ctx);
+static JSValue js_proxy_call(JSContext *ctx, JSValueConst func_obj,
+ JSValueConst this_obj,
+ int argc, JSValueConst *argv);
+static JSValue js_proxy_call_constructor(JSContext *ctx, JSValueConst func_obj,
+ JSValueConst new_target,
+ int argc, JSValueConst *argv);
+static JSValueConst js_proxy_getPrototypeOf(JSContext *ctx, JSValueConst obj);
+static int js_proxy_setPrototypeOf(JSContext *ctx, JSValueConst obj,
+ JSValueConst proto_val, BOOL throw_flag);
+static int js_proxy_isExtensible(JSContext *ctx, JSValueConst obj);
+static int js_proxy_preventExtensions(JSContext *ctx, JSValueConst obj);
+static int js_proxy_isArray(JSContext *ctx, JSValueConst obj);
+static int JS_CreateProperty(JSContext *ctx, JSObject *p,
+ JSAtom prop, JSValueConst val,
+ JSValueConst getter, JSValueConst setter,
+ int flags);
+static int js_string_memcmp(const JSString *p1, const JSString *p2, int len);
+static void reset_weak_ref(JSRuntime *rt, JSObject *p);
+static BOOL typed_array_is_detached(JSContext *ctx, JSObject *p);
+static uint32_t typed_array_get_length(JSContext *ctx, JSObject *p);
+static JSValue JS_ThrowTypeErrorDetachedArrayBuffer(JSContext *ctx);
+static JSVarRef *get_var_ref(JSContext *ctx, JSStackFrame *sf, int var_idx,
+ BOOL is_arg);
+static JSValue js_generator_function_call(JSContext *ctx, JSValueConst func_obj,
+ JSValueConst this_obj,
+ int argc, JSValueConst *argv);
+static void js_async_function_resolve_finalizer(JSRuntime *rt, JSValue val);
+static void js_async_function_resolve_mark(JSRuntime *rt, JSValueConst val,
+ JS_MarkFunc *mark_func);
+static JSValue JS_EvalInternal(JSContext *ctx, JSValueConst this_obj,
+ const char *input, size_t input_len,
+ const char *filename, int flags, int scope_idx);
+static void js_free_module_def(JSContext *ctx, JSModuleDef *m);
+static void free_var_ref(JSRuntime *rt, JSVarRef *var_ref);
+static JSValue js_new_promise_capability(JSContext *ctx,
+ JSValue *resolving_funcs,
+ JSValueConst ctor);
+static __exception int perform_promise_then(JSContext *ctx,
+ JSValueConst promise,
+ JSValueConst *resolve_reject,
+ JSValueConst *cap_resolving_funcs);
+static int js_string_compare(JSContext *ctx,
+ const JSString *p1, const JSString *p2);
+static JSValue JS_ToNumber(JSContext *ctx, JSValueConst val);
+static int JS_SetPropertyValue(JSContext *ctx, JSValueConst this_obj,
+ JSValue prop, JSValue val, int flags);
+static int JS_NumberIsInteger(JSContext *ctx, JSValueConst val);
+static BOOL JS_NumberIsNegativeOrMinusZero(JSContext *ctx, JSValueConst val);
+static JSValue JS_ToNumberFree(JSContext *ctx, JSValue val);
+static int JS_GetOwnProperty(JSContext *ctx, JSPropertyDescriptor *desc,
+ JSObject *p, JSAtom prop);
+static void js_free_desc(JSContext *ctx, JSPropertyDescriptor *desc);
+static void async_func_mark(JSRuntime *rt, JSAsyncFunctionState *s,
+ JS_MarkFunc *mark_func);
+static void JS_AddIntrinsicBasicObjects(JSContext *ctx);
+static void js_free_shape(JSRuntime *rt, JSShape *sh);
+static void js_free_shape_null(JSRuntime *rt, JSShape *sh);
+static int js_shape_prepare_update(JSContext *ctx, JSObject *p,
+ JSShapeProperty **pprs);
+static int init_shape_hash(JSRuntime *rt);
+static __exception int js_get_length32(JSContext *ctx, uint32_t *pres,
+ JSValueConst obj);
+static __exception int js_get_length64(JSContext *ctx, int64_t *pres,
+ JSValueConst obj);
+static JSValue JS_CreateAsyncFromSyncIterator(JSContext *ctx,
+ JSValueConst sync_iter);
+static void js_c_function_data_finalizer(JSRuntime *rt, JSValue val);
+static void js_c_function_data_mark(JSRuntime *rt, JSValueConst val,
+ JS_MarkFunc *mark_func);
+static JSValue js_c_function_data_call(JSContext *ctx, JSValueConst func_obj,
+ JSValueConst this_val,
+ int argc, JSValueConst *argv);
+
+static const JSClassExoticMethods js_arguments_exotic_methods;
+static const JSClassExoticMethods js_string_exotic_methods;
+static const JSClassExoticMethods js_proxy_exotic_methods;
+static const JSClassExoticMethods js_module_ns_exotic_methods;
+static JSClassID js_class_id_alloc = JS_CLASS_INIT_COUNT;
+
+JS_BOOL JS_IsNumber(JSValueConst v)
+{
+#ifdef CONFIG_BIGNUM
+ int tag = JS_VALUE_GET_TAG(v);
+ return tag == JS_TAG_INT || tag == JS_TAG_BIG_INT ||
+ tag == JS_TAG_BIG_FLOAT || JS_TAG_IS_FLOAT64(tag);
+#else
+ int tag = JS_VALUE_GET_TAG(v);
+ return tag == JS_TAG_INT || JS_TAG_IS_FLOAT64(tag);
+#endif
+}
+
+static void js_trigger_gc(JSRuntime *rt, size_t size)
+{
+ BOOL force_gc;
+#ifdef FORCE_GC_AT_MALLOC
+ force_gc = TRUE;
+#else
+ force_gc = ((rt->malloc_state.malloc_size + size) >
+ rt->malloc_gc_threshold);
+#endif
+ if (force_gc) {
+#ifdef DUMP_GC
+ printf("GC: size=%" PRIu64 "\n",
+ (uint64_t)rt->malloc_state.malloc_size);
+#endif
+ JS_RunGC(rt);
+ rt->malloc_gc_threshold = rt->malloc_state.malloc_size +
+ (rt->malloc_state.malloc_size >> 1);
+ }
+}
+
+static size_t js_malloc_usable_size_unknown(const void *ptr)
+{
+ return 0;
+}
+
+void *js_malloc_rt(JSRuntime *rt, size_t size)
+{
+ return rt->mf.js_malloc(&rt->malloc_state, size);
+}
+
+void js_free_rt(JSRuntime *rt, void *ptr)
+{
+ rt->mf.js_free(&rt->malloc_state, ptr);
+}
+
+void *js_realloc_rt(JSRuntime *rt, void *ptr, size_t size)
+{
+ return rt->mf.js_realloc(&rt->malloc_state, ptr, size);
+}
+
+size_t js_malloc_usable_size_rt(JSRuntime *rt, const void *ptr)
+{
+ return rt->mf.js_malloc_usable_size(ptr);
+}
+
+void *js_mallocz_rt(JSRuntime *rt, size_t size)
+{
+ void *ptr;
+ ptr = js_malloc_rt(rt, size);
+ if (!ptr)
+ return NULL;
+ return memset(ptr, 0, size);
+}
+
+#ifdef CONFIG_BIGNUM
+/* called by libbf */
+static void *js_bf_realloc(void *opaque, void *ptr, size_t size)
+{
+ JSRuntime *rt = opaque;
+ return js_realloc_rt(rt, ptr, size);
+}
+#endif /* CONFIG_BIGNUM */
+
+/* Throw out of memory in case of error */
+void *js_malloc(JSContext *ctx, size_t size)
+{
+ void *ptr;
+ ptr = js_malloc_rt(ctx->rt, size);
+ if (unlikely(!ptr)) {
+ JS_ThrowOutOfMemory(ctx);
+ return NULL;
+ }
+ return ptr;
+}
+
+/* Throw out of memory in case of error */
+void *js_mallocz(JSContext *ctx, size_t size)
+{
+ void *ptr;
+ ptr = js_mallocz_rt(ctx->rt, size);
+ if (unlikely(!ptr)) {
+ JS_ThrowOutOfMemory(ctx);
+ return NULL;
+ }
+ return ptr;
+}
+
+void js_free(JSContext *ctx, void *ptr)
+{
+ js_free_rt(ctx->rt, ptr);
+}
+
+/* Throw out of memory in case of error */
+void *js_realloc(JSContext *ctx, void *ptr, size_t size)
+{
+ void *ret;
+ ret = js_realloc_rt(ctx->rt, ptr, size);
+ if (unlikely(!ret && size != 0)) {
+ JS_ThrowOutOfMemory(ctx);
+ return NULL;
+ }
+ return ret;
+}
+
+/* store extra allocated size in *pslack if successful */
+void *js_realloc2(JSContext *ctx, void *ptr, size_t size, size_t *pslack)
+{
+ void *ret;
+ ret = js_realloc_rt(ctx->rt, ptr, size);
+ if (unlikely(!ret && size != 0)) {
+ JS_ThrowOutOfMemory(ctx);
+ return NULL;
+ }
+ if (pslack) {
+ size_t new_size = js_malloc_usable_size_rt(ctx->rt, ret);
+ *pslack = (new_size > size) ? new_size - size : 0;
+ }
+ return ret;
+}
+
+size_t js_malloc_usable_size(JSContext *ctx, const void *ptr)
+{
+ return js_malloc_usable_size_rt(ctx->rt, ptr);
+}
+
+/* Throw out of memory exception in case of error */
+char *js_strndup(JSContext *ctx, const char *s, size_t n)
+{
+ char *ptr;
+ ptr = js_malloc(ctx, n + 1);
+ if (ptr) {
+ memcpy(ptr, s, n);
+ ptr[n] = '\0';
+ }
+ return ptr;
+}
+
+char *js_strdup(JSContext *ctx, const char *str)
+{
+ return js_strndup(ctx, str, strlen(str));
+}
+
+static inline void js_dbuf_init(JSContext *ctx, DynBuf *s)
+{
+ dbuf_init2(s, ctx->rt, (DynBufReallocFunc *)js_realloc_rt);
+}
+
+static inline int is_digit(int c) {
+ return c >= '0' && c <= '9';
+}
+
+typedef struct JSClassShortDef {
+ JSAtom class_name;
+ JSClassFinalizer *finalizer;
+ JSClassGCMark *gc_mark;
+} JSClassShortDef;
+
+static JSClassShortDef const js_std_class_def[] = {
+ { JS_ATOM_Object, NULL, NULL }, /* JS_CLASS_OBJECT */
+ { JS_ATOM_Array, js_array_finalizer, js_array_mark }, /* JS_CLASS_ARRAY */
+ { JS_ATOM_Error, NULL, NULL }, /* JS_CLASS_ERROR */
+ { JS_ATOM_Number, js_object_data_finalizer, js_object_data_mark }, /* JS_CLASS_NUMBER */
+ { JS_ATOM_String, js_object_data_finalizer, js_object_data_mark }, /* JS_CLASS_STRING */
+ { JS_ATOM_Boolean, js_object_data_finalizer, js_object_data_mark }, /* JS_CLASS_BOOLEAN */
+ { JS_ATOM_Symbol, js_object_data_finalizer, js_object_data_mark }, /* JS_CLASS_SYMBOL */
+ { JS_ATOM_Arguments, js_array_finalizer, js_array_mark }, /* JS_CLASS_ARGUMENTS */
+ { JS_ATOM_Arguments, NULL, NULL }, /* JS_CLASS_MAPPED_ARGUMENTS */
+ { JS_ATOM_Date, js_object_data_finalizer, js_object_data_mark }, /* JS_CLASS_DATE */
+ { JS_ATOM_Object, NULL, NULL }, /* JS_CLASS_MODULE_NS */
+ { JS_ATOM_Function, NULL, NULL }, /* JS_CLASS_C_FUNCTION */
+ { JS_ATOM_Function, js_bytecode_function_finalizer, js_bytecode_function_mark }, /* JS_CLASS_BYTECODE_FUNCTION */
+ { JS_ATOM_Function, js_bound_function_finalizer, js_bound_function_mark }, /* JS_CLASS_BOUND_FUNCTION */
+ { JS_ATOM_Function, js_c_function_data_finalizer, js_c_function_data_mark }, /* JS_CLASS_C_FUNCTION_DATA */
+ { JS_ATOM_GeneratorFunction, js_bytecode_function_finalizer, js_bytecode_function_mark }, /* JS_CLASS_GENERATOR_FUNCTION */
+ { JS_ATOM_ForInIterator, js_for_in_iterator_finalizer, js_for_in_iterator_mark }, /* JS_CLASS_FOR_IN_ITERATOR */
+ { JS_ATOM_RegExp, js_regexp_finalizer, NULL }, /* JS_CLASS_REGEXP */
+ { JS_ATOM_ArrayBuffer, js_array_buffer_finalizer, NULL }, /* JS_CLASS_ARRAY_BUFFER */
+ { JS_ATOM_SharedArrayBuffer, js_array_buffer_finalizer, NULL }, /* JS_CLASS_SHARED_ARRAY_BUFFER */
+ { JS_ATOM_Uint8ClampedArray, js_typed_array_finalizer, js_typed_array_mark }, /* JS_CLASS_UINT8C_ARRAY */
+ { JS_ATOM_Int8Array, js_typed_array_finalizer, js_typed_array_mark }, /* JS_CLASS_INT8_ARRAY */
+ { JS_ATOM_Uint8Array, js_typed_array_finalizer, js_typed_array_mark }, /* JS_CLASS_UINT8_ARRAY */
+ { JS_ATOM_Int16Array, js_typed_array_finalizer, js_typed_array_mark }, /* JS_CLASS_INT16_ARRAY */
+ { JS_ATOM_Uint16Array, js_typed_array_finalizer, js_typed_array_mark }, /* JS_CLASS_UINT16_ARRAY */
+ { JS_ATOM_Int32Array, js_typed_array_finalizer, js_typed_array_mark }, /* JS_CLASS_INT32_ARRAY */
+ { JS_ATOM_Uint32Array, js_typed_array_finalizer, js_typed_array_mark }, /* JS_CLASS_UINT32_ARRAY */
+#ifdef CONFIG_BIGNUM
+ { JS_ATOM_BigInt64Array, js_typed_array_finalizer, js_typed_array_mark }, /* JS_CLASS_BIG_INT64_ARRAY */
+ { JS_ATOM_BigUint64Array, js_typed_array_finalizer, js_typed_array_mark }, /* JS_CLASS_BIG_UINT64_ARRAY */
+#endif
+ { JS_ATOM_Float32Array, js_typed_array_finalizer, js_typed_array_mark }, /* JS_CLASS_FLOAT32_ARRAY */
+ { JS_ATOM_Float64Array, js_typed_array_finalizer, js_typed_array_mark }, /* JS_CLASS_FLOAT64_ARRAY */
+ { JS_ATOM_DataView, js_typed_array_finalizer, js_typed_array_mark }, /* JS_CLASS_DATAVIEW */
+#ifdef CONFIG_BIGNUM
+ { JS_ATOM_BigInt, js_object_data_finalizer, js_object_data_mark }, /* JS_CLASS_BIG_INT */
+ { JS_ATOM_BigFloat, js_object_data_finalizer, js_object_data_mark }, /* JS_CLASS_BIG_FLOAT */
+ { JS_ATOM_BigFloatEnv, js_float_env_finalizer, NULL }, /* JS_CLASS_FLOAT_ENV */
+#endif
+ { JS_ATOM_Map, js_map_finalizer, js_map_mark }, /* JS_CLASS_MAP */
+ { JS_ATOM_Set, js_map_finalizer, js_map_mark }, /* JS_CLASS_SET */
+ { JS_ATOM_WeakMap, js_map_finalizer, js_map_mark }, /* JS_CLASS_WEAKMAP */
+ { JS_ATOM_WeakSet, js_map_finalizer, js_map_mark }, /* JS_CLASS_WEAKSET */
+ { JS_ATOM_Map_Iterator, js_map_iterator_finalizer, js_map_iterator_mark }, /* JS_CLASS_MAP_ITERATOR */
+ { JS_ATOM_Set_Iterator, js_map_iterator_finalizer, js_map_iterator_mark }, /* JS_CLASS_SET_ITERATOR */
+ { JS_ATOM_Array_Iterator, js_array_iterator_finalizer, js_array_iterator_mark }, /* JS_CLASS_ARRAY_ITERATOR */
+ { JS_ATOM_String_Iterator, js_array_iterator_finalizer, js_array_iterator_mark }, /* JS_CLASS_STRING_ITERATOR */
+ { JS_ATOM_Generator, js_generator_finalizer, js_generator_mark }, /* JS_CLASS_GENERATOR */
+};
+
+static int init_class_range(JSRuntime *rt, JSClassShortDef const *tab,
+ int start, int count)
+{
+ JSClassDef cm_s, *cm = &cm_s;
+ int i, class_id;
+
+ for(i = 0; i < count; i++) {
+ class_id = i + start;
+ memset(cm, 0, sizeof(*cm));
+ cm->finalizer = tab[i].finalizer;
+ cm->gc_mark = tab[i].gc_mark;
+ if (JS_NewClass1(rt, class_id, cm, tab[i].class_name) < 0)
+ return -1;
+ }
+ return 0;
+}
+
+JSRuntime *JS_NewRuntime2(const JSMallocFunctions *mf, void *opaque)
+{
+ JSRuntime *rt;
+ JSMallocState ms;
+
+ memset(&ms, 0, sizeof(ms));
+ ms.opaque = opaque;
+ ms.malloc_limit = -1;
+
+ rt = mf->js_malloc(&ms, sizeof(JSRuntime));
+ if (!rt)
+ return NULL;
+ memset(rt, 0, sizeof(*rt));
+ rt->mf = *mf;
+ if (!rt->mf.js_malloc_usable_size) {
+ /* use dummy function if none provided */
+ rt->mf.js_malloc_usable_size = js_malloc_usable_size_unknown;
+ }
+ rt->malloc_state = ms;
+ rt->malloc_gc_threshold = 256 * 1024;
+
+#ifdef CONFIG_BIGNUM
+ bf_context_init(&rt->bf_ctx, js_bf_realloc, rt);
+#endif
+
+ init_list_head(&rt->context_list);
+ init_list_head(&rt->obj_list);
+#ifdef DUMP_LEAKS
+ init_list_head(&rt->string_list);
+#endif
+ init_list_head(&rt->job_list);
+
+ if (JS_InitAtoms(rt))
+ goto fail;
+
+ /* create the object, array and function classes */
+ if (init_class_range(rt, js_std_class_def, JS_CLASS_OBJECT,
+ countof(js_std_class_def)) < 0)
+ goto fail;
+ rt->class_array[JS_CLASS_ARGUMENTS].exotic = &js_arguments_exotic_methods;
+ rt->class_array[JS_CLASS_STRING].exotic = &js_string_exotic_methods;
+ rt->class_array[JS_CLASS_MODULE_NS].exotic = &js_module_ns_exotic_methods;
+
+ rt->class_array[JS_CLASS_C_FUNCTION_DATA].call = js_c_function_data_call;
+ rt->class_array[JS_CLASS_GENERATOR_FUNCTION].call = js_generator_function_call;
+ if (init_shape_hash(rt))
+ goto fail;
+ return rt;
+ fail:
+ JS_FreeRuntime(rt);
+ return NULL;
+}
+
+/* default memory allocation functions with memory limitation */
+static inline size_t js_def_malloc_usable_size(void *ptr)
+{
+#if defined(__APPLE__)
+ return malloc_size(ptr);
+#elif defined(_WIN32)
+ return _msize(ptr);
+#elif defined(EMSCRIPTEN)
+ return 0;
+#elif defined(__linux__)
+ return malloc_usable_size(ptr);
+#else
+ /* change this to `return 0;` if compilation fails */
+ return malloc_usable_size(ptr);
+#endif
+}
+
+static void *js_def_malloc(JSMallocState *s, size_t size)
+{
+ void *ptr;
+
+ /* Do not allocate zero bytes: behavior is platform dependent */
+ assert(size != 0);
+
+ if (unlikely(s->malloc_size + size > s->malloc_limit))
+ return NULL;
+
+ ptr = malloc(size);
+ if (!ptr)
+ return NULL;
+
+ s->malloc_count++;
+ s->malloc_size += js_def_malloc_usable_size(ptr) + MALLOC_OVERHEAD;
+ return ptr;
+}
+
+static void js_def_free(JSMallocState *s, void *ptr)
+{
+ if (!ptr)
+ return;
+
+ s->malloc_count--;
+ s->malloc_size -= js_def_malloc_usable_size(ptr) + MALLOC_OVERHEAD;
+ free(ptr);
+}
+
+static void *js_def_realloc(JSMallocState *s, void *ptr, size_t size)
+{
+ size_t old_size;
+
+ if (!ptr) {
+ if (size == 0)
+ return NULL;
+ return js_def_malloc(s, size);
+ }
+ old_size = js_def_malloc_usable_size(ptr);
+ if (size == 0) {
+ s->malloc_count--;
+ s->malloc_size -= old_size + MALLOC_OVERHEAD;
+ free(ptr);
+ return NULL;
+ }
+ if (s->malloc_size + size - old_size > s->malloc_limit)
+ return NULL;
+
+ ptr = realloc(ptr, size);
+ if (!ptr)
+ return NULL;
+
+ s->malloc_size += js_def_malloc_usable_size(ptr) - old_size;
+ return ptr;
+}
+
+static const JSMallocFunctions def_malloc_funcs = {
+ js_def_malloc,
+ js_def_free,
+ js_def_realloc,
+#if defined(__APPLE__)
+ malloc_size,
+#elif defined(_WIN32)
+ (size_t (*)(const void *))_msize,
+#elif defined(EMSCRIPTEN)
+ NULL,
+#elif defined(__linux__)
+ (size_t (*)(const void *))malloc_usable_size,
+#else
+ /* change this to `NULL,` if compilation fails */
+ malloc_usable_size,
+#endif
+};
+
+JSRuntime *JS_NewRuntime(void)
+{
+ return JS_NewRuntime2(&def_malloc_funcs, NULL);
+}
+
+void JS_SetMemoryLimit(JSRuntime *rt, size_t limit)
+{
+ rt->malloc_state.malloc_limit = limit;
+}
+
+/* use -1 to disable automatic GC */
+void JS_SetGCThreshold(JSRuntime *rt, size_t gc_threshold)
+{
+ rt->malloc_gc_threshold = gc_threshold;
+}
+
+#define malloc(s) malloc_is_forbidden(s)
+#define free(p) free_is_forbidden(p)
+#define realloc(p,s) realloc_is_forbidden(p,s)
+
+void JS_SetInterruptHandler(JSRuntime *rt, JSInterruptHandler *cb, void *opaque)
+{
+ rt->interrupt_handler = cb;
+ rt->interrupt_opaque = opaque;
+}
+
+void JS_SetCanBlock(JSRuntime *rt, BOOL can_block)
+{
+ rt->can_block = can_block;
+}
+
+/* return 0 if OK, < 0 if exception */
+int JS_EnqueueJob(JSContext *ctx, JSJobFunc *job_func,
+ int argc, JSValueConst *argv)
+{
+ JSRuntime *rt = ctx->rt;
+ JSJobEntry *e;
+ int i;
+
+ e = js_malloc(ctx, sizeof(*e) + argc * sizeof(JSValue));
+ if (!e)
+ return -1;
+ e->ctx = ctx;
+ e->job_func = job_func;
+ e->argc = argc;
+ for(i = 0; i < argc; i++) {
+ e->argv[i] = JS_DupValue(ctx, argv[i]);
+ }
+ list_add_tail(&e->link, &rt->job_list);
+ return 0;
+}
+
+BOOL JS_IsJobPending(JSRuntime *rt)
+{
+ return !list_empty(&rt->job_list);
+}
+
+/* return < 0 if exception, 0 if no job pending, 1 if a job was
+ executed successfully. the context of the job is stored in '*pctx' */
+int JS_ExecutePendingJob(JSRuntime *rt, JSContext **pctx)
+{
+ JSContext *ctx;
+ JSJobEntry *e;
+ JSValue res;
+ int i, ret;
+
+ if (list_empty(&rt->job_list)) {
+ *pctx = NULL;
+ return 0;
+ }
+
+ /* get the first pending job and execute it */
+ e = list_entry(rt->job_list.next, JSJobEntry, link);
+ list_del(&e->link);
+ ctx = e->ctx;
+ res = e->job_func(e->ctx, e->argc, (JSValueConst *)e->argv);
+ for(i = 0; i < e->argc; i++)
+ JS_FreeValue(ctx, e->argv[i]);
+ if (JS_IsException(res))
+ ret = -1;
+ else
+ ret = 1;
+ JS_FreeValue(ctx, res);
+ js_free(ctx, e);
+ *pctx = ctx;
+ return ret;
+}
+
+static inline uint32_t atom_get_free(const JSAtomStruct *p)
+{
+ return (uintptr_t)p >> 1;
+}
+
+static inline BOOL atom_is_free(const JSAtomStruct *p)
+{
+ return (uintptr_t)p & 1;
+}
+
+static inline JSAtomStruct *atom_set_free(uint32_t v)
+{
+ return (JSAtomStruct *)(((uintptr_t)v << 1) | 1);
+}
+
+/* Note: the string contents are uninitialized */
+static JSString *js_alloc_string_rt(JSRuntime *rt, int max_len, int is_wide_char)
+{
+ JSString *str;
+ str = js_malloc_rt(rt, sizeof(JSString) + (max_len << is_wide_char) + 1 - is_wide_char);
+ if (unlikely(!str))
+ return NULL;
+ str->header.ref_count = 1;
+ str->is_wide_char = is_wide_char;
+ str->len = max_len;
+ str->atom_type = 0;
+ str->hash = 0; /* optional but costless */
+ str->hash_next = 0; /* optional */
+#ifdef DUMP_LEAKS
+ list_add_tail(&str->link, &rt->string_list);
+#endif
+ return str;
+}
+
+static JSString *js_alloc_string(JSContext *ctx, int max_len, int is_wide_char)
+{
+ JSString *p;
+ p = js_alloc_string_rt(ctx->rt, max_len, is_wide_char);
+ if (unlikely(!p)) {
+ JS_ThrowOutOfMemory(ctx);
+ return NULL;
+ }
+ return p;
+}
+
+/* same as JS_FreeValueRT() but faster */
+static inline void js_free_string(JSRuntime *rt, JSString *str)
+{
+ if (--str->header.ref_count <= 0) {
+ if (str->atom_type) {
+ JS_FreeAtomStruct(rt, str);
+ } else {
+#ifdef DUMP_LEAKS
+ list_del(&str->link);
+#endif
+ js_free_rt(rt, str);
+ }
+ }
+}
+
+void JS_SetRuntimeInfo(JSRuntime *rt, const char *s)
+{
+ if (rt)
+ rt->rt_info = s;
+}
+
+void JS_FreeRuntime(JSRuntime *rt)
+{
+ struct list_head *el, *el1;
+ int i;
+
+ list_for_each_safe(el, el1, &rt->context_list) {
+ JSContext *ctx = list_entry(el, JSContext, link);
+ JS_FreeContext(ctx);
+ }
+
+ list_for_each_safe(el, el1, &rt->job_list) {
+ JSJobEntry *e = list_entry(el, JSJobEntry, link);
+ for(i = 0; i < e->argc; i++)
+ JS_FreeValueRT(rt, e->argv[i]);
+ js_free_rt(rt, e);
+ }
+ init_list_head(&rt->job_list);
+
+ JS_RunGC(rt);
+
+#ifdef DUMP_LEAKS
+ /* leaking objects */
+ {
+ BOOL header_done;
+ JSObject *p;
+ int count;
+
+ /* remove the internal refcounts to display only the object
+ referenced externally */
+ list_for_each(el, &rt->obj_list) {
+ p = list_entry(el, JSObject, link);
+ p->gc_header.mark = 0;
+ }
+ gc_decref(rt);
+
+ header_done = FALSE;
+ list_for_each(el, &rt->obj_list) {
+ p = list_entry(el, JSObject, link);
+ if (p->header.ref_count != 0) {
+ if (!header_done) {
+ printf("Object leaks:\n");
+ JS_DumpObjectHeader(rt);
+ header_done = TRUE;
+ }
+ JS_DumpObject(rt, p);
+ }
+ }
+
+ count = 0;
+ list_for_each(el, &rt->obj_list) {
+ p = list_entry(el, JSObject, link);
+ if (p->header.ref_count == 0) {
+ count++;
+ }
+ }
+ if (count != 0)
+ printf("Secondary object leaks: %d\n", count);
+ }
+#endif
+ assert(list_empty(&rt->obj_list));
+
+ /* free the classes */
+ for(i = 0; i < rt->class_count; i++) {
+ JSClass *cl = &rt->class_array[i];
+ if (cl->class_id != 0) {
+ JS_FreeAtomRT(rt, cl->class_name);
+ }
+ }
+ js_free_rt(rt, rt->class_array);
+
+#ifdef CONFIG_BIGNUM
+ bf_context_end(&rt->bf_ctx);
+#endif
+
+#ifdef DUMP_LEAKS
+ /* only the atoms defined in JS_InitAtoms() should be left */
+ {
+ BOOL header_done = FALSE;
+
+ for(i = 0; i < rt->atom_size; i++) {
+ JSAtomStruct *p = rt->atom_array[i];
+ if (!atom_is_free(p) /* && p->str*/) {
+ if (i >= JS_ATOM_END || p->header.ref_count != 1) {
+ if (!header_done) {
+ header_done = TRUE;
+ if (rt->rt_info) {
+ printf("%s:1: atom leakage:", rt->rt_info);
+ } else {
+ printf("Atom leaks:\n"
+ " %6s %6s %s\n",
+ "ID", "REFCNT", "NAME");
+ }
+ }
+ if (rt->rt_info) {
+ printf(" ");
+ } else {
+ printf(" %6u %6u ", i, p->header.ref_count);
+ }
+ switch (p->atom_type) {
+ case JS_ATOM_TYPE_STRING:
+ JS_DumpString(rt, p);
+ break;
+ case JS_ATOM_TYPE_GLOBAL_SYMBOL:
+ printf("Symbol.for(");
+ JS_DumpString(rt, p);
+ printf(")");
+ break;
+ case JS_ATOM_TYPE_SYMBOL:
+ printf("Symbol(");
+ JS_DumpString(rt, p);
+ printf(")");
+ break;
+ }
+ if (rt->rt_info) {
+ printf(":%u", p->header.ref_count);
+ } else {
+ printf("\n");
+ }
+ }
+ }
+ }
+ if (rt->rt_info && header_done)
+ printf("\n");
+ }
+#endif
+
+ /* free the atoms */
+ for(i = 0; i < rt->atom_size; i++) {
+ JSAtomStruct *p = rt->atom_array[i];
+ if (!atom_is_free(p)) {
+#ifdef DUMP_LEAKS
+ list_del(&p->link);
+#endif
+ js_free_rt(rt, p);
+ }
+ }
+ js_free_rt(rt, rt->atom_array);
+ js_free_rt(rt, rt->atom_hash);
+ js_free_rt(rt, rt->shape_hash);
+#ifdef DUMP_LEAKS
+ if (!list_empty(&rt->string_list)) {
+ if (rt->rt_info) {
+ printf("%s:1: string leakage:", rt->rt_info);
+ } else {
+ printf("String leaks:\n"
+ " %6s %s\n",
+ "REFCNT", "VALUE");
+ }
+ list_for_each_safe(el, el1, &rt->string_list) {
+ JSString *str = list_entry(el, JSString, link);
+ if (rt->rt_info) {
+ printf(" ");
+ } else {
+ printf(" %6u ", str->header.ref_count);
+ }
+ JS_DumpString(rt, str);
+ if (rt->rt_info) {
+ printf(":%u", str->header.ref_count);
+ } else {
+ printf("\n");
+ }
+ list_del(&str->link);
+ js_free_rt(rt, str);
+ }
+ if (rt->rt_info)
+ printf("\n");
+ }
+ {
+ JSMallocState *s = &rt->malloc_state;
+ if (s->malloc_count > 1) {
+ if (rt->rt_info)
+ printf("%s:1: ", rt->rt_info);
+ printf("Memory leak: %"PRIu64" bytes lost in %"PRIu64" block%s\n",
+ (uint64_t)(s->malloc_size - sizeof(JSRuntime)),
+ (uint64_t)(s->malloc_count - 1), &"s"[s->malloc_count == 2]);
+ }
+ }
+#endif
+
+ {
+ JSMallocState ms = rt->malloc_state;
+ rt->mf.js_free(&ms, rt);
+ }
+}
+
+#if defined(_MSC_VER)
+static inline uint8_t *js_get_stack_pointer(void)
+{
+ return NULL;
+}
+
+static inline BOOL js_check_stack_overflow(JSContext *ctx, size_t alloca_size)
+{
+ return FALSE;
+}
+#else
+#if defined(EMSCRIPTEN)
+/* currently no stack limitation */
+static inline uint8_t *js_get_stack_pointer(void)
+{
+ return NULL;
+}
+
+static inline BOOL js_check_stack_overflow(JSContext *ctx, size_t alloca_size)
+{
+ return FALSE;
+}
+#else
+/* Note: OS and CPU dependent */
+static inline uint8_t *js_get_stack_pointer(void)
+{
+ return __builtin_frame_address(0);
+}
+
+static inline BOOL js_check_stack_overflow(JSContext *ctx, size_t alloca_size)
+{
+ size_t size;
+ size = ctx->stack_top - js_get_stack_pointer();
+ return unlikely((size + alloca_size) > ctx->stack_size);
+}
+#endif
+#endif
+
+JSContext *JS_NewContextRaw(JSRuntime *rt)
+{
+ JSContext *ctx;
+ int i;
+
+ ctx = js_mallocz_rt(rt, sizeof(JSContext));
+ if (!ctx)
+ return NULL;
+ ctx->class_proto = js_malloc_rt(rt, sizeof(ctx->class_proto[0]) *
+ rt->class_count);
+ if (!ctx->class_proto) {
+ js_free_rt(rt, ctx);
+ return NULL;
+ }
+ ctx->rt = rt;
+ list_add_tail(&ctx->link, &rt->context_list);
+ ctx->stack_top = js_get_stack_pointer();
+ ctx->stack_size = JS_DEFAULT_STACK_SIZE;
+ ctx->current_exception = JS_NULL;
+#ifdef CONFIG_BIGNUM
+ ctx->bf_ctx = &rt->bf_ctx;
+ ctx->fp_env.prec = 53;
+ ctx->fp_env.flags = bf_set_exp_bits(11) | BF_RNDN | BF_FLAG_SUBNORMAL;
+#endif
+ for(i = 0; i < rt->class_count; i++)
+ ctx->class_proto[i] = JS_NULL;
+ init_list_head(&ctx->loaded_modules);
+
+ JS_AddIntrinsicBasicObjects(ctx);
+ return ctx;
+}
+
+JSContext *JS_NewContext(JSRuntime *rt)
+{
+ JSContext *ctx;
+
+ ctx = JS_NewContextRaw(rt);
+ if (!ctx)
+ return NULL;
+
+ JS_AddIntrinsicBaseObjects(ctx);
+ //JS_AddIntrinsicDate(ctx);
+ JS_AddIntrinsicEval(ctx);
+ JS_AddIntrinsicStringNormalize(ctx);
+ JS_AddIntrinsicRegExp(ctx);
+ JS_AddIntrinsicJSON(ctx);
+ JS_AddIntrinsicProxy(ctx);
+ JS_AddIntrinsicMapSet(ctx);
+ JS_AddIntrinsicTypedArrays(ctx);
+ JS_AddIntrinsicPromise(ctx);
+
+ return ctx;
+}
+
+void *JS_GetContextOpaque(JSContext *ctx)
+{
+ return ctx->user_opaque;
+}
+
+void JS_SetContextOpaque(JSContext *ctx, void *opaque)
+{
+ ctx->user_opaque = opaque;
+}
+
+/* set the new value and free the old value after (freeing the value
+ can reallocate the object data) */
+static inline void set_value(JSContext *ctx, JSValue *pval, JSValue new_val)
+{
+ JSValue old_val;
+ old_val = *pval;
+ *pval = new_val;
+ JS_FreeValue(ctx, old_val);
+}
+
+void JS_SetClassProto(JSContext *ctx, JSClassID class_id, JSValue obj)
+{
+ JSRuntime *rt = ctx->rt;
+ assert(class_id < rt->class_count);
+ set_value(ctx, &ctx->class_proto[class_id], obj);
+}
+
+JSValue JS_GetClassProto(JSContext *ctx, JSClassID class_id)
+{
+ JSRuntime *rt = ctx->rt;
+ assert(class_id < rt->class_count);
+ return JS_DupValue(ctx, ctx->class_proto[class_id]);
+}
+
+typedef enum JSFreeModuleEnum {
+ JS_FREE_MODULE_ALL,
+ JS_FREE_MODULE_NOT_RESOLVED,
+ JS_FREE_MODULE_NOT_EVALUATED,
+} JSFreeModuleEnum;
+
+/* XXX: would be more efficient with separate module lists */
+static void js_free_modules(JSContext *ctx, JSFreeModuleEnum flag)
+{
+ struct list_head *el, *el1;
+ list_for_each_safe(el, el1, &ctx->loaded_modules) {
+ JSModuleDef *m = list_entry(el, JSModuleDef, link);
+ if (flag == JS_FREE_MODULE_ALL ||
+ (flag == JS_FREE_MODULE_NOT_RESOLVED && !m->resolved) ||
+ (flag == JS_FREE_MODULE_NOT_EVALUATED && !m->evaluated)) {
+ js_free_module_def(ctx, m);
+ }
+ }
+}
+
+void JS_FreeContext(JSContext *ctx)
+{
+ JSRuntime *rt = ctx->rt;
+ int i;
+
+#ifdef DUMP_ATOMS
+ JS_DumpAtoms(ctx->rt);
+#endif
+#ifdef DUMP_SHAPES
+ JS_DumpShapes(ctx->rt);
+#endif
+#ifdef DUMP_OBJECTS
+ {
+ struct list_head *el;
+ JSObject *p;
+ printf("JSObjects: {\n");
+ JS_DumpObjectHeader(ctx->rt);
+ list_for_each(el, &rt->obj_list) {
+ p = list_entry(el, JSObject, link);
+ JS_DumpObject(rt, p);
+ }
+ printf("}\n");
+ }
+#endif
+#ifdef DUMP_MEM
+ {
+ JSMemoryUsage stats;
+ JS_ComputeMemoryUsage(rt, &stats);
+ JS_DumpMemoryUsage(stdout, &stats, rt);
+ }
+#endif
+
+ js_free_modules(ctx, JS_FREE_MODULE_ALL);
+
+ JS_FreeValue(ctx, ctx->current_exception);
+
+ JS_FreeValue(ctx, ctx->global_obj);
+ JS_FreeValue(ctx, ctx->global_var_obj);
+
+ JS_FreeValue(ctx, ctx->throw_type_error);
+
+ JS_FreeValue(ctx, ctx->array_proto_values);
+ for(i = 0; i < JS_NATIVE_ERROR_COUNT; i++) {
+ JS_FreeValue(ctx, ctx->native_error_proto[i]);
+ }
+ for(i = 0; i < rt->class_count; i++) {
+ JS_FreeValue(ctx, ctx->class_proto[i]);
+ }
+ js_free_rt(rt, ctx->class_proto);
+ JS_FreeValue(ctx, ctx->iterator_proto);
+ JS_FreeValue(ctx, ctx->async_iterator_proto);
+ JS_FreeValue(ctx, ctx->regexp_ctor);
+ JS_FreeValue(ctx, ctx->function_ctor);
+ JS_FreeValue(ctx, ctx->function_proto);
+
+ js_free_shape_null(ctx->rt, ctx->array_shape);
+
+ list_del(&ctx->link);
+ js_free_rt(ctx->rt, ctx);
+}
+
+JSRuntime *JS_GetRuntime(JSContext *ctx)
+{
+ return ctx->rt;
+}
+
+void JS_SetMaxStackSize(JSContext *ctx, size_t stack_size)
+{
+ ctx->stack_size = stack_size;
+}
+
+static inline BOOL is_strict_mode(JSContext *ctx)
+{
+ JSStackFrame *sf = ctx->current_stack_frame;
+ return (sf && (sf->js_mode & JS_MODE_STRICT));
+}
+
+#ifdef CONFIG_BIGNUM
+static inline BOOL is_bignum_mode(JSContext *ctx)
+{
+ JSStackFrame *sf = ctx->current_stack_frame;
+ return (sf && (sf->js_mode & JS_MODE_BIGINT));
+}
+#endif
+
+JSValue JS_NewInt64(JSContext *ctx, int64_t v)
+{
+ if (v == (int32_t)v) {
+ return JS_NewInt32(ctx, v);
+ } else {
+#ifdef CONFIG_BIGNUM
+ if (is_bignum_mode(ctx)) {
+ bf_t a_s, *a = &a_s;
+ bf_init(ctx->bf_ctx, a);
+ bf_set_si(a, v);
+ return JS_NewBigInt(ctx, a);
+ } else
+#endif
+ {
+ return __JS_NewFloat64(ctx, (double)v);
+ }
+ }
+}
+
+static force_inline JSValue JS_NewUint32(JSContext *ctx, uint32_t val)
+{
+#ifdef CONFIG_BIGNUM
+ return JS_NewInt64(ctx, val);
+#else
+ JSValue v;
+ if (val <= 0x7fffffff) {
+ v = JS_MKVAL(JS_TAG_INT, val);
+ } else {
+ v = __JS_NewFloat64(ctx, val);
+ }
+ return v;
+#endif
+}
+
+/* JSAtom support */
+
+#define JS_ATOM_TAG_INT (1U << 31)
+#define JS_ATOM_MAX_INT (JS_ATOM_TAG_INT - 1)
+#define JS_ATOM_MAX ((1U << 30) - 1)
+
+/* return the max count from the hash size */
+#define JS_ATOM_COUNT_RESIZE(n) ((n) * 2)
+
+static inline BOOL __JS_AtomIsConst(JSAtom v)
+{
+#if defined(DUMP_LEAKS) && DUMP_LEAKS > 1
+ return (int32_t)v <= 0;
+#else
+ return (int32_t)v < JS_ATOM_END;
+#endif
+}
+
+static inline BOOL __JS_AtomIsTaggedInt(JSAtom v)
+{
+ return (v & JS_ATOM_TAG_INT) != 0;
+}
+
+static inline JSAtom __JS_AtomFromUInt32(uint32_t v)
+{
+ return v | JS_ATOM_TAG_INT;
+}
+
+static inline uint32_t __JS_AtomToUInt32(JSAtom atom)
+{
+ return atom & ~JS_ATOM_TAG_INT;
+}
+
+static inline int is_num(int c)
+{
+ return c >= '0' && c <= '9';
+}
+
+/* return TRUE if the string is a number n with 0 <= n <= 2^32-1 */
+static inline BOOL is_num_string(uint32_t *pval, const JSString *p)
+{
+ uint32_t n;
+ uint64_t n64;
+ int c, i, len;
+
+ len = p->len;
+ if (len == 0 || len > 10)
+ return FALSE;
+ if (p->is_wide_char)
+ c = p->u.str16[0];
+ else
+ c = p->u.str8[0];
+ if (is_num(c)) {
+ if (c == '0') {
+ if (len != 1)
+ return FALSE;
+ n = 0;
+ } else {
+ n = c - '0';
+ for(i = 1; i < len; i++) {
+ if (p->is_wide_char)
+ c = p->u.str16[i];
+ else
+ c = p->u.str8[i];
+ if (!is_num(c))
+ return FALSE;
+ n64 = (uint64_t)n * 10 + (c - '0');
+ if ((n64 >> 32) != 0)
+ return FALSE;
+ n = n64;
+ }
+ }
+ *pval = n;
+ return TRUE;
+ } else {
+ return FALSE;
+ }
+}
+
+/* XXX: could use faster version ? */
+static inline uint32_t hash_string8(const uint8_t *str, int len, uint32_t h)
+{
+ int i;
+
+ for(i = 0; i < len; i++)
+ h = h * 263 + str[i];
+ return h;
+}
+
+static inline uint32_t hash_string16(const uint16_t *str, int len, uint32_t h)
+{
+ int i;
+
+ for(i = 0; i < len; i++)
+ h = h * 263 + str[i];
+ return h;
+}
+
+static uint32_t hash_string(const JSString *str, uint32_t h)
+{
+ if (str->is_wide_char)
+ h = hash_string16(str->u.str16, str->len, h);
+ else
+ h = hash_string8(str->u.str8, str->len, h);
+ return h;
+}
+
+#if defined(_MSC_VER)
+static void JS_DumpString(JSRuntime *rt,
+ const JSString *p)
+#else
+static __attribute__((unused)) void JS_DumpString(JSRuntime *rt,
+ const JSString *p)
+#endif
+{
+ int i, c, sep;
+
+ if (p == NULL) {
+ printf("");
+ return;
+ }
+ printf("%d", p->header.ref_count);
+ sep = (p->header.ref_count == 1) ? '\"' : '\'';
+ putchar(sep);
+ for(i = 0; i < p->len; i++) {
+ if (p->is_wide_char)
+ c = p->u.str16[i];
+ else
+ c = p->u.str8[i];
+ if (c == sep || c == '\\') {
+ putchar('\\');
+ putchar(c);
+ } else if (c >= ' ' && c <= 126) {
+ putchar(c);
+ } else if (c == '\n') {
+ putchar('\\');
+ putchar('n');
+ } else {
+ printf("\\u%04x", c);
+ }
+ }
+ putchar(sep);
+}
+
+#if defined(_MSC_VER)
+static void JS_DumpAtoms(JSRuntime *rt)
+#else
+static __attribute__((unused)) void JS_DumpAtoms(JSRuntime *rt)
+#endif
+{
+ JSAtomStruct *p;
+ int h, i;
+ /* This only dumps hashed atoms, not JS_ATOM_TYPE_SYMBOL atoms */
+ printf("JSAtom count=%d size=%d hash_size=%d:\n",
+ rt->atom_count, rt->atom_size, rt->atom_hash_size);
+ printf("JSAtom hash table: {\n");
+ for(i = 0; i < rt->atom_hash_size; i++) {
+ h = rt->atom_hash[i];
+ if (h) {
+ printf(" %d:", i);
+ while (h) {
+ p = rt->atom_array[h];
+ printf(" ");
+ JS_DumpString(rt, p);
+ h = p->hash_next;
+ }
+ printf("\n");
+ }
+ }
+ printf("}\n");
+ printf("JSAtom table: {\n");
+ for(i = 0; i < rt->atom_size; i++) {
+ p = rt->atom_array[i];
+ if (!atom_is_free(p)) {
+ printf(" %d: { %d %08x ", i, p->atom_type, p->hash);
+ if (!(p->len == 0 && p->is_wide_char != 0))
+ JS_DumpString(rt, p);
+ printf(" %d }\n", p->hash_next);
+ }
+ }
+ printf("}\n");
+}
+
+static int JS_ResizeAtomHash(JSRuntime *rt, int new_hash_size)
+{
+ JSAtomStruct *p;
+ uint32_t new_hash_mask, h, i, hash_next1, j, *new_hash;
+
+ assert((new_hash_size & (new_hash_size - 1)) == 0); /* power of two */
+ new_hash_mask = new_hash_size - 1;
+ new_hash = js_mallocz_rt(rt, sizeof(rt->atom_hash[0]) * new_hash_size);
+ if (!new_hash)
+ return -1;
+ for(i = 0; i < rt->atom_hash_size; i++) {
+ h = rt->atom_hash[i];
+ while (h != 0) {
+ p = rt->atom_array[h];
+ hash_next1 = p->hash_next;
+ /* add in new hash table */
+ j = p->hash & new_hash_mask;
+ p->hash_next = new_hash[j];
+ new_hash[j] = h;
+ h = hash_next1;
+ }
+ }
+ js_free_rt(rt, rt->atom_hash);
+ rt->atom_hash = new_hash;
+ rt->atom_hash_size = new_hash_size;
+ rt->atom_count_resize = JS_ATOM_COUNT_RESIZE(new_hash_size);
+ // JS_DumpAtoms(rt);
+ return 0;
+}
+
+static int JS_InitAtoms(JSRuntime *rt)
+{
+ int i, len, atom_type;
+ const char *p;
+
+ rt->atom_hash_size = 0;
+ rt->atom_hash = NULL;
+ rt->atom_count = 0;
+ rt->atom_size = 0;
+ rt->atom_free_index = 0;
+ if (JS_ResizeAtomHash(rt, 256)) /* there are at least 195 predefined atoms */
+ return -1;
+
+ p = js_atom_init;
+ for(i = 1; i < JS_ATOM_END; i++) {
+ if (i >= JS_ATOM_Symbol_toPrimitive)
+ atom_type = JS_ATOM_TYPE_SYMBOL;
+ else
+ atom_type = JS_ATOM_TYPE_STRING;
+ len = strlen(p);
+ if (__JS_NewAtomInit(rt, p, len, atom_type) == JS_ATOM_NULL)
+ return -1;
+ p = p + len + 1;
+ }
+ return 0;
+}
+
+static JSAtom JS_DupAtomRT(JSRuntime *rt, JSAtom v)
+{
+ JSAtomStruct *p;
+
+ if (!__JS_AtomIsConst(v)) {
+ p = rt->atom_array[v];
+ p->header.ref_count++;
+ }
+ return v;
+}
+
+JSAtom JS_DupAtom(JSContext *ctx, JSAtom v)
+{
+ JSRuntime *rt;
+ JSAtomStruct *p;
+
+ if (!__JS_AtomIsConst(v)) {
+ rt = ctx->rt;
+ p = rt->atom_array[v];
+ p->header.ref_count++;
+ }
+ return v;
+}
+
+static BOOL JS_AtomIsString(JSContext *ctx, JSAtom v)
+{
+ JSRuntime *rt;
+ JSAtomStruct *p;
+
+ rt = ctx->rt;
+ if (__JS_AtomIsTaggedInt(v))
+ return TRUE;
+ p = rt->atom_array[v];
+ return p->atom_type == JS_ATOM_TYPE_STRING;
+}
+
+static JSAtom js_get_atom_index(JSRuntime *rt, JSAtomStruct *p)
+{
+ uint32_t i = p->hash_next; /* atom_index */
+ if (p->atom_type != JS_ATOM_TYPE_SYMBOL) {
+ JSAtomStruct *p1;
+
+ i = rt->atom_hash[p->hash & (rt->atom_hash_size - 1)];
+ p1 = rt->atom_array[i];
+ while (p1 != p) {
+ assert(i != 0);
+ i = p1->hash_next;
+ p1 = rt->atom_array[i];
+ }
+ }
+ return i;
+}
+
+/* string case (internal). Return JS_ATOM_NULL if error. 'str' is
+ freed. */
+static JSAtom __JS_NewAtom(JSRuntime *rt, JSString *str, int atom_type)
+{
+ uint32_t h, h1, i;
+ JSAtomStruct *p;
+ int len;
+
+#if 0
+ printf("__JS_NewAtom: "); JS_DumpString(rt, str); printf("\n");
+#endif
+ if (atom_type != JS_ATOM_TYPE_SYMBOL) {
+ /* str is not NULL */
+ if (str->atom_type == atom_type) {
+ /* str is the atom, return its index */
+ i = js_get_atom_index(rt, str);
+ /* reduce string refcount and increase atom's unless constant */
+ if (__JS_AtomIsConst(i))
+ str->header.ref_count--;
+ return i;
+ }
+ /* try and locate an already registered atom */
+ len = str->len;
+ h = hash_string(str, atom_type);
+ h &= JS_ATOM_HASH_MASK;
+ h1 = h & (rt->atom_hash_size - 1);
+ i = rt->atom_hash[h1];
+ while (i != 0) {
+ p = rt->atom_array[i];
+ if (p->hash == h &&
+ p->atom_type == atom_type &&
+ p->len == len &&
+ js_string_memcmp(p, str, len) == 0) {
+ if (!__JS_AtomIsConst(i))
+ p->header.ref_count++;
+ goto done;
+ }
+ i = p->hash_next;
+ }
+ } else {
+ h1 = 0; /* avoid warning */
+ h = 0; /* avoid warning */
+ }
+
+ if (rt->atom_free_index == 0) {
+ /* allow new atom entries */
+ uint32_t new_size, start;
+ JSAtomStruct **new_array;
+
+ /* alloc new with size progression 3/2:
+ 4 6 9 13 19 28 42 63 94 141 211 316 474 711 1066 1599 2398 3597 5395 8092
+ preallocating space for predefined atoms (at least 195).
+ */
+ new_size = max_int(211, rt->atom_size * 3 / 2);
+ if (new_size > JS_ATOM_MAX)
+ goto fail;
+ /* XXX: should use realloc2 to use slack space */
+ new_array = js_realloc_rt(rt, rt->atom_array, sizeof(*new_array) * new_size);
+ if (!new_array)
+ goto fail;
+ /* Note: the atom 0 is not used */
+ start = rt->atom_size;
+ if (start == 0) {
+ /* JS_ATOM_NULL entry */
+ p = js_mallocz_rt(rt, sizeof(JSAtomStruct));
+ if (!p) {
+ js_free_rt(rt, new_array);
+ goto fail;
+ }
+ p->header.ref_count = 1; /* not refcounted */
+ p->atom_type = JS_ATOM_TYPE_SYMBOL;
+#ifdef DUMP_LEAKS
+ list_add_tail(&p->link, &rt->string_list);
+#endif
+ new_array[0] = p;
+ rt->atom_count++;
+ start = 1;
+ }
+ rt->atom_size = new_size;
+ rt->atom_array = new_array;
+ rt->atom_free_index = start;
+ for(i = start; i < new_size; i++) {
+ uint32_t next;
+ if (i == (new_size - 1))
+ next = 0;
+ else
+ next = i + 1;
+ rt->atom_array[i] = atom_set_free(next);
+ }
+ }
+
+ if (str) {
+ if (str->atom_type == 0) {
+ p = str;
+ p->atom_type = atom_type;
+ } else {
+ p = js_malloc_rt(rt, sizeof(JSString) +
+ (str->len << str->is_wide_char) +
+ 1 - str->is_wide_char);
+ if (unlikely(!p))
+ goto fail;
+ p->header.ref_count = 1;
+ p->is_wide_char = str->is_wide_char;
+ p->len = str->len;
+#ifdef DUMP_LEAKS
+ list_add_tail(&p->link, &rt->string_list);
+#endif
+ memcpy(p->u.str8, str->u.str8, (str->len << str->is_wide_char) +
+ 1 - str->is_wide_char);
+ js_free_string(rt, str);
+ }
+ } else {
+ p = js_malloc_rt(rt, sizeof(JSAtomStruct)); /* empty wide string */
+ if (!p)
+ return JS_ATOM_NULL;
+ p->header.ref_count = 1;
+ p->is_wide_char = 1; /* Hack to represent NULL as a JSString */
+ p->len = 0;
+#ifdef DUMP_LEAKS
+ list_add_tail(&p->link, &rt->string_list);
+#endif
+ }
+
+ /* use an already free entry */
+ i = rt->atom_free_index;
+ rt->atom_free_index = atom_get_free(rt->atom_array[i]);
+ rt->atom_array[i] = p;
+
+ p->hash = h;
+ p->hash_next = i; /* atom_index */
+ p->atom_type = atom_type;
+
+ rt->atom_count++;
+
+ if (atom_type != JS_ATOM_TYPE_SYMBOL) {
+ p->hash_next = rt->atom_hash[h1];
+ rt->atom_hash[h1] = i;
+ if (unlikely(rt->atom_count >= rt->atom_count_resize))
+ JS_ResizeAtomHash(rt, rt->atom_hash_size * 2);
+ }
+
+ // JS_DumpAtoms(rt);
+ return i;
+
+ fail:
+ i = JS_ATOM_NULL;
+ done:
+ if (str)
+ js_free_string(rt, str);
+ return i;
+}
+
+/* only works with zero terminated 8 bit strings */
+static JSAtom __JS_NewAtomInit(JSRuntime *rt, const char *str, int len,
+ int atom_type)
+{
+ JSString *p;
+ p = js_alloc_string_rt(rt, len, 0);
+ if (!p)
+ return JS_ATOM_NULL;
+ memcpy(p->u.str8, str, len);
+ p->u.str8[len] = '\0';
+ return __JS_NewAtom(rt, p, atom_type);
+}
+
+static JSAtom __JS_FindAtom(JSRuntime *rt, const char *str, int len,
+ int atom_type)
+{
+ uint32_t h, h1, i;
+ JSAtomStruct *p;
+
+ h = hash_string8((const uint8_t *)str, len, JS_ATOM_TYPE_STRING);
+ h &= JS_ATOM_HASH_MASK;
+ h1 = h & (rt->atom_hash_size - 1);
+ i = rt->atom_hash[h1];
+ while (i != 0) {
+ p = rt->atom_array[i];
+ if (p->hash == h &&
+ p->atom_type == JS_ATOM_TYPE_STRING &&
+ p->len == len &&
+ p->is_wide_char == 0 &&
+ memcmp(p->u.str8, str, len) == 0) {
+ if (!__JS_AtomIsConst(i))
+ p->header.ref_count++;
+ return i;
+ }
+ i = p->hash_next;
+ }
+ return JS_ATOM_NULL;
+}
+
+static void JS_FreeAtomStruct(JSRuntime *rt, JSAtomStruct *p)
+{
+#if 0 /* JS_ATOM_NULL is not refcounted: __JS_AtomIsConst() includes 0 */
+ if (unlikely(i == JS_ATOM_NULL)) {
+ p->header.ref_count = INT32_MAX / 2;
+ return;
+ }
+#endif
+ uint32_t i = p->hash_next; /* atom_index */
+ if (p->atom_type != JS_ATOM_TYPE_SYMBOL) {
+ JSAtomStruct *p0, *p1;
+ uint32_t h0;
+
+ h0 = p->hash & (rt->atom_hash_size - 1);
+ i = rt->atom_hash[h0];
+ p1 = rt->atom_array[i];
+ if (p1 == p) {
+ rt->atom_hash[h0] = p1->hash_next;
+ } else {
+ for(;;) {
+ assert(i != 0);
+ p0 = p1;
+ i = p1->hash_next;
+ p1 = rt->atom_array[i];
+ if (p1 == p) {
+ p0->hash_next = p1->hash_next;
+ break;
+ }
+ }
+ }
+ }
+ /* insert in free atom list */
+ rt->atom_array[i] = atom_set_free(rt->atom_free_index);
+ rt->atom_free_index = i;
+ /* free the string structure */
+#ifdef DUMP_LEAKS
+ list_del(&p->link);
+#endif
+ js_free_rt(rt, p);
+ rt->atom_count--;
+ assert(rt->atom_count >= 0);
+}
+
+static void __JS_FreeAtom(JSRuntime *rt, uint32_t i)
+{
+ JSAtomStruct *p;
+
+ p = rt->atom_array[i];
+ if (--p->header.ref_count > 0)
+ return;
+ JS_FreeAtomStruct(rt, p);
+}
+
+/* Warning: 'p' is freed */
+static JSAtom JS_NewAtomStr(JSContext *ctx, JSString *p)
+{
+ JSRuntime *rt = ctx->rt;
+ uint32_t n;
+ if (is_num_string(&n, p)) {
+ if (n <= JS_ATOM_MAX_INT) {
+ js_free_string(rt, p);
+ return __JS_AtomFromUInt32(n);
+ }
+ }
+ /* XXX: should generate an exception */
+ return __JS_NewAtom(rt, p, JS_ATOM_TYPE_STRING);
+}
+
+JSAtom JS_NewAtomLen(JSContext *ctx, const char *str, int len)
+{
+ JSValue val;
+
+ if (len == 0 || !is_digit(*str)) {
+ JSAtom atom = __JS_FindAtom(ctx->rt, str, len, JS_ATOM_TYPE_STRING);
+ if (atom)
+ return atom;
+ }
+ val = JS_NewStringLen(ctx, str, len);
+ if (JS_IsException(val))
+ return JS_ATOM_NULL;
+ return JS_NewAtomStr(ctx, JS_VALUE_GET_STRING(val));
+}
+
+JSAtom JS_NewAtom(JSContext *ctx, const char *str)
+{
+ return JS_NewAtomLen(ctx, str, strlen(str));
+}
+
+JSAtom JS_NewAtomUInt32(JSContext *ctx, uint32_t n)
+{
+ if (n <= JS_ATOM_MAX_INT) {
+ return __JS_AtomFromUInt32(n);
+ } else {
+ char buf[11];
+ JSValue val;
+ snprintf(buf, sizeof(buf), "%u", n);
+ val = JS_NewString(ctx, buf);
+ if (JS_IsException(val))
+ return JS_ATOM_NULL;
+ return __JS_NewAtom(ctx->rt, JS_VALUE_GET_STRING(val),
+ JS_ATOM_TYPE_STRING);
+ }
+}
+
+static JSAtom JS_NewAtomInt64(JSContext *ctx, int64_t n)
+{
+ if ((uint64_t)n <= JS_ATOM_MAX_INT) {
+ return __JS_AtomFromUInt32((uint32_t)n);
+ } else {
+ char buf[24];
+ JSValue val;
+ snprintf(buf, sizeof(buf), "%" PRId64 , n);
+ val = JS_NewString(ctx, buf);
+ if (JS_IsException(val))
+ return JS_ATOM_NULL;
+ return __JS_NewAtom(ctx->rt, JS_VALUE_GET_STRING(val),
+ JS_ATOM_TYPE_STRING);
+ }
+}
+
+/* 'p' is freed */
+static JSValue JS_NewSymbol(JSContext *ctx, JSString *p, int atom_type)
+{
+ JSRuntime *rt = ctx->rt;
+ JSAtom atom;
+ atom = __JS_NewAtom(rt, p, atom_type);
+ if (atom == JS_ATOM_NULL)
+ return JS_ThrowOutOfMemory(ctx);
+ return JS_MKPTR(JS_TAG_SYMBOL, rt->atom_array[atom]);
+}
+
+#define ATOM_GET_STR_BUF_SIZE 64
+
+/* Should only be used for debug. */
+static const char *JS_AtomGetStrRT(JSRuntime *rt, char *buf, int buf_size,
+ JSAtom atom)
+{
+ if (__JS_AtomIsTaggedInt(atom)) {
+ snprintf(buf, buf_size, "%u", __JS_AtomToUInt32(atom));
+ } else {
+ JSAtomStruct *p;
+ assert(atom < rt->atom_size);
+ if (atom == JS_ATOM_NULL) {
+ snprintf(buf, buf_size, "");
+ } else {
+ int i, c;
+ char *q;
+ JSString *str;
+
+ q = buf;
+ p = rt->atom_array[atom];
+ assert(!atom_is_free(p));
+ str = p;
+ if (str) {
+ if (!str->is_wide_char) {
+ /* special case ASCII strings */
+ c = 0;
+ for(i = 0; i < str->len; i++) {
+ c |= str->u.str8[i];
+ }
+ if (c < 0x80)
+ return (const char *)str->u.str8;
+ }
+ for(i = 0; i < str->len; i++) {
+ if (str->is_wide_char)
+ c = str->u.str16[i];
+ else
+ c = str->u.str8[i];
+ if ((q - buf) >= buf_size - UTF8_CHAR_LEN_MAX)
+ break;
+ if (c < 128) {
+ *q++ = c;
+ } else {
+ q += unicode_to_utf8((uint8_t *)q, c);
+ }
+ }
+ }
+ *q = '\0';
+ }
+ }
+ return buf;
+}
+
+static const char *JS_AtomGetStr(JSContext *ctx, char *buf, int buf_size, JSAtom atom)
+{
+ return JS_AtomGetStrRT(ctx->rt, buf, buf_size, atom);
+}
+
+static JSValue __JS_AtomToValue(JSContext *ctx, JSAtom atom, BOOL force_string)
+{
+ char buf[ATOM_GET_STR_BUF_SIZE];
+
+ if (__JS_AtomIsTaggedInt(atom)) {
+ snprintf(buf, sizeof(buf), "%u", __JS_AtomToUInt32(atom));
+ return JS_NewString(ctx, buf);
+ } else {
+ JSRuntime *rt = ctx->rt;
+ JSAtomStruct *p;
+ assert(atom < rt->atom_size);
+ p = rt->atom_array[atom];
+ if (p->atom_type == JS_ATOM_TYPE_STRING) {
+ goto ret_string;
+ } else if (force_string) {
+ if (p->len == 0 && p->is_wide_char != 0) {
+ /* no description string */
+ p = rt->atom_array[JS_ATOM_empty_string];
+ }
+ ret_string:
+ return JS_DupValue(ctx, JS_MKPTR(JS_TAG_STRING, p));
+ } else {
+ return JS_DupValue(ctx, JS_MKPTR(JS_TAG_SYMBOL, p));
+ }
+ }
+}
+
+JSValue JS_AtomToValue(JSContext *ctx, JSAtom atom)
+{
+ return __JS_AtomToValue(ctx, atom, FALSE);
+}
+
+JSValue JS_AtomToString(JSContext *ctx, JSAtom atom)
+{
+ return __JS_AtomToValue(ctx, atom, TRUE);
+}
+
+/* return TRUE if the atom is a uint32 and return its value */
+static BOOL JS_AtomGetUint32(JSContext *ctx, uint32_t *pval, JSAtom atom)
+{
+ if (__JS_AtomIsTaggedInt(atom)) {
+ *pval = __JS_AtomToUInt32(atom);
+ return TRUE;
+ } else {
+ JSRuntime *rt = ctx->rt;
+ JSAtomStruct *p;
+ uint32_t val;
+
+ assert(atom < rt->atom_size);
+ p = rt->atom_array[atom];
+ if (p->atom_type == JS_ATOM_TYPE_STRING &&
+ is_num_string(&val, p)) {
+ *pval = val;
+ return TRUE;
+ } else {
+ *pval = 0;
+ return FALSE;
+ }
+ }
+}
+
+/* return TRUE if the string is a number n with 0 <= n <= 2^53-1 */
+static inline BOOL is_integer_index_string(uint64_t *pval, const JSString *p)
+{
+ uint64_t n;
+ int c, i, len;
+
+ len = p->len;
+ if (len == 0 || len > 16)
+ return FALSE;
+ if (p->is_wide_char)
+ c = p->u.str16[0];
+ else
+ c = p->u.str8[0];
+ if (is_num(c)) {
+ if (c == '0') {
+ if (len != 1)
+ return FALSE;
+ n = 0;
+ } else {
+ n = c - '0';
+ for(i = 1; i < len; i++) {
+ if (p->is_wide_char)
+ c = p->u.str16[i];
+ else
+ c = p->u.str8[i];
+ if (!is_num(c))
+ return FALSE;
+ n = n * 10 + (c - '0');
+ if (n >= ((uint64_t)1 << 53))
+ return FALSE;
+ }
+ }
+ *pval = n;
+ return TRUE;
+ } else {
+ return FALSE;
+ }
+}
+
+/* return TRUE if the atom is an integer index (i.e. 0 <= index <=
+ 2^53-1 and return its value */
+static BOOL JS_AtomIsIntegerIndex(JSContext *ctx, uint64_t *pval, JSAtom atom)
+{
+ if (__JS_AtomIsTaggedInt(atom)) {
+ *pval = __JS_AtomToUInt32(atom);
+ return TRUE;
+ } else {
+ JSRuntime *rt = ctx->rt;
+ JSAtomStruct *p;
+ uint64_t val;
+
+ assert(atom < rt->atom_size);
+ p = rt->atom_array[atom];
+ if (p->atom_type == JS_ATOM_TYPE_STRING &&
+ is_integer_index_string(&val, p)) {
+ *pval = val;
+ return TRUE;
+ } else {
+ *pval = 0;
+ return FALSE;
+ }
+ }
+}
+
+/* This test must be fast if atom is not a numeric index (e.g. a
+ method name). Return JS_UNDEFINED if not a numeric
+ index. JS_EXCEPTION can also be returned. */
+static JSValue JS_AtomIsNumericIndex1(JSContext *ctx, JSAtom atom)
+{
+ JSRuntime *rt = ctx->rt;
+ JSAtomStruct *p1;
+ JSString *p;
+ int c, len, ret;
+ JSValue num, str;
+
+ if (__JS_AtomIsTaggedInt(atom))
+ return JS_NewInt32(ctx, __JS_AtomToUInt32(atom));
+ assert(atom < rt->atom_size);
+ p1 = rt->atom_array[atom];
+ if (p1->atom_type != JS_ATOM_TYPE_STRING)
+ return JS_UNDEFINED;
+ p = p1;
+ len = p->len;
+ if (p->is_wide_char) {
+ const uint16_t *r = p->u.str16, *r_end = p->u.str16 + len;
+ if (r >= r_end)
+ return JS_UNDEFINED;
+ c = *r;
+ if (c == '-') {
+ if (r >= r_end)
+ return JS_UNDEFINED;
+ r++;
+ c = *r;
+ /* -0 case is specific */
+ if (c == '0' && len == 2)
+ goto minus_zero;
+ }
+ /* XXX: should test NaN, but the tests do not check it */
+ if (!is_num(c)) {
+ /* XXX: String should be normalized, therefore 8-bit only */
+ const uint16_t nfinity16[7] = { 'n', 'f', 'i', 'n', 'i', 't', 'y' };
+ if (!(c =='I' && (r_end - r) == 8 &&
+ !memcmp(r + 1, nfinity16, sizeof(nfinity16))))
+ return JS_UNDEFINED;
+ }
+ } else {
+ const uint8_t *r = p->u.str8, *r_end = p->u.str8 + len;
+ if (r >= r_end)
+ return JS_UNDEFINED;
+ c = *r;
+ if (c == '-') {
+ if (r >= r_end)
+ return JS_UNDEFINED;
+ r++;
+ c = *r;
+ /* -0 case is specific */
+ if (c == '0' && len == 2) {
+ minus_zero:
+ return __JS_NewFloat64(ctx, -0.0);
+ }
+ }
+ if (!is_num(c)) {
+ if (!(c =='I' && (r_end - r) == 8 &&
+ !memcmp(r + 1, "nfinity", 7)))
+ return JS_UNDEFINED;
+ }
+ }
+ /* XXX: bignum: would be better to only accept integer to avoid
+ relying on current floating point precision */
+ /* this is ECMA CanonicalNumericIndexString primitive */
+ num = JS_ToNumber(ctx, JS_MKPTR(JS_TAG_STRING, p));
+ if (JS_IsException(num))
+ return num;
+ str = JS_ToString(ctx, num);
+ if (JS_IsException(str)) {
+ JS_FreeValue(ctx, num);
+ return str;
+ }
+ ret = js_string_compare(ctx, p, JS_VALUE_GET_STRING(str));
+ JS_FreeValue(ctx, str);
+ if (ret == 0) {
+ return num;
+ } else {
+ JS_FreeValue(ctx, num);
+ return JS_UNDEFINED;
+ }
+}
+
+/* return -1 if exception or TRUE/FALSE */
+static int JS_AtomIsNumericIndex(JSContext *ctx, JSAtom atom)
+{
+ JSValue num;
+ num = JS_AtomIsNumericIndex1(ctx, atom);
+ if (likely(JS_IsUndefined(num)))
+ return FALSE;
+ if (JS_IsException(num))
+ return -1;
+ JS_FreeValue(ctx, num);
+ return TRUE;
+}
+
+void JS_FreeAtom(JSContext *ctx, JSAtom v)
+{
+ if (!__JS_AtomIsConst(v))
+ __JS_FreeAtom(ctx->rt, v);
+}
+
+void JS_FreeAtomRT(JSRuntime *rt, JSAtom v)
+{
+ if (!__JS_AtomIsConst(v))
+ __JS_FreeAtom(rt, v);
+}
+
+/* return TRUE if 'v' is a symbol with a string description */
+static BOOL JS_AtomSymbolHasDescription(JSContext *ctx, JSAtom v)
+{
+ JSRuntime *rt;
+ JSAtomStruct *p;
+
+ rt = ctx->rt;
+ if (__JS_AtomIsTaggedInt(v))
+ return FALSE;
+ p = rt->atom_array[v];
+ return (p->atom_type != JS_ATOM_TYPE_STRING &&
+ !(p->len == 0 && p->is_wide_char != 0));
+}
+
+#if defined(_MSC_VER)
+static void print_atom(JSContext *ctx, JSAtom atom)
+#else
+static __attribute__((unused)) void print_atom(JSContext *ctx, JSAtom atom)
+#endif
+{
+ char buf[ATOM_GET_STR_BUF_SIZE];
+ const char *p;
+ int i;
+
+ /* XXX: should handle embedded null characters */
+ /* XXX: should move encoding code to JS_AtomGetStr */
+ p = JS_AtomGetStr(ctx, buf, sizeof(buf), atom);
+ for (i = 0; p[i]; i++) {
+ int c = (unsigned char)p[i];
+ if (!((c >= 'a' && c <= 'z') || (c >= 'A' && c <= 'Z') ||
+ (c == '_' || c == '$') || (c >= '0' && c <= '9' && i > 0)))
+ break;
+ }
+ if (i > 0 && p[i] == '\0') {
+ printf("%s", p);
+ } else {
+ putchar('"');
+ printf("%.*s", i, p);
+ for (; p[i]; i++) {
+ int c = (unsigned char)p[i];
+ if (c == '\"' || c == '\\') {
+ putchar('\\');
+ putchar(c);
+ } else if (c >= ' ' && c <= 126) {
+ putchar(c);
+ } else if (c == '\n') {
+ putchar('\\');
+ putchar('n');
+ } else {
+ printf("\\u%04x", c);
+ }
+ }
+ putchar('\"');
+ }
+}
+
+/* free with JS_FreeCString() */
+const char *JS_AtomToCString(JSContext *ctx, JSAtom atom)
+{
+ JSValue str;
+ const char *cstr;
+
+ str = JS_AtomToString(ctx, atom);
+ if (JS_IsException(str))
+ return NULL;
+ cstr = JS_ToCString(ctx, str);
+ JS_FreeValue(ctx, str);
+ return cstr;
+}
+
+static inline BOOL JS_IsEmptyString(JSValueConst v)
+{
+ return JS_VALUE_GET_TAG(v) == JS_TAG_STRING && JS_VALUE_GET_STRING(v)->len == 0;
+}
+
+/* JSClass support */
+
+/* a new class ID is allocated if *pclass_id != 0 */
+JSClassID JS_NewClassID(JSClassID *pclass_id)
+{
+ JSClassID class_id;
+ /* XXX: make it thread safe */
+ class_id = *pclass_id;
+ if (class_id == 0) {
+ class_id = js_class_id_alloc++;
+ *pclass_id = class_id;
+ }
+ return class_id;
+}
+
+BOOL JS_IsRegisteredClass(JSRuntime *rt, JSClassID class_id)
+{
+ return (class_id < rt->class_count &&
+ rt->class_array[class_id].class_id != 0);
+}
+
+/* create a new object internal class. Return -1 if error, 0 if
+ OK. The finalizer can be NULL if none is needed. */
+static int JS_NewClass1(JSRuntime *rt, JSClassID class_id,
+ const JSClassDef *class_def, JSAtom name)
+{
+ int new_size, i;
+ JSClass *cl, *new_class_array;
+ struct list_head *el;
+
+ if (class_id < rt->class_count &&
+ rt->class_array[class_id].class_id != 0)
+ return -1;
+
+ if (class_id >= rt->class_count) {
+ new_size = max_int(JS_CLASS_INIT_COUNT,
+ max_int(class_id + 1, rt->class_count * 3 / 2));
+
+ /* reallocate the context class prototype array, if any */
+ list_for_each(el, &rt->context_list) {
+ JSContext *ctx = list_entry(el, JSContext, link);
+ JSValue *new_tab;
+ new_tab = js_realloc_rt(rt, ctx->class_proto,
+ sizeof(ctx->class_proto[0]) * new_size);
+ if (!new_tab)
+ return -1;
+ for(i = rt->class_count; i < new_size; i++)
+ new_tab[i] = JS_NULL;
+ ctx->class_proto = new_tab;
+ }
+ /* reallocate the class array */
+ new_class_array = js_realloc_rt(rt, rt->class_array,
+ sizeof(JSClass) * new_size);
+ if (!new_class_array)
+ return -1;
+ memset(new_class_array + rt->class_count, 0,
+ (new_size - rt->class_count) * sizeof(JSClass));
+ rt->class_array = new_class_array;
+ rt->class_count = new_size;
+ }
+ cl = &rt->class_array[class_id];
+ cl->class_id = class_id;
+ cl->class_name = JS_DupAtomRT(rt, name);
+ cl->finalizer = class_def->finalizer;
+ cl->gc_mark = class_def->gc_mark;
+ cl->call = class_def->call;
+ cl->exotic = class_def->exotic;
+ return 0;
+}
+
+int JS_NewClass(JSRuntime *rt, JSClassID class_id, const JSClassDef *class_def)
+{
+ int ret, len;
+ JSAtom name;
+
+ len = strlen(class_def->class_name);
+ name = __JS_FindAtom(rt, class_def->class_name, len, JS_ATOM_TYPE_STRING);
+ if (name == JS_ATOM_NULL) {
+ name = __JS_NewAtomInit(rt, class_def->class_name, len, JS_ATOM_TYPE_STRING);
+ if (name == JS_ATOM_NULL)
+ return -1;
+ }
+ ret = JS_NewClass1(rt, class_id, class_def, name);
+ JS_FreeAtomRT(rt, name);
+ return ret;
+}
+
+static JSValue js_new_string8(JSContext *ctx, const uint8_t *buf, int len)
+{
+ JSString *str;
+
+ if (len <= 0) {
+ return JS_AtomToString(ctx, JS_ATOM_empty_string);
+ }
+ str = js_alloc_string(ctx, len, 0);
+ if (!str)
+ return JS_EXCEPTION;
+ memcpy(str->u.str8, buf, len);
+ str->u.str8[len] = '\0';
+ return JS_MKPTR(JS_TAG_STRING, str);
+}
+
+static JSValue js_new_string16(JSContext *ctx, const uint16_t *buf, int len)
+{
+ JSString *str;
+ str = js_alloc_string(ctx, len, 1);
+ if (!str)
+ return JS_EXCEPTION;
+ memcpy(str->u.str16, buf, len * 2);
+ return JS_MKPTR(JS_TAG_STRING, str);
+}
+
+static JSValue js_new_string_char(JSContext *ctx, uint16_t c)
+{
+ if (c < 0x100) {
+ uint8_t ch8 = c;
+ return js_new_string8(ctx, &ch8, 1);
+ } else {
+ uint16_t ch16 = c;
+ return js_new_string16(ctx, &ch16, 1);
+ }
+}
+
+static JSValue js_sub_string(JSContext *ctx, JSString *p, int start, int end)
+{
+ int len = end - start;
+ if (start == 0 && end == p->len) {
+ return JS_DupValue(ctx, JS_MKPTR(JS_TAG_STRING, p));
+ }
+ if (p->is_wide_char && len > 0) {
+ JSString *str;
+ int i;
+ uint16_t c = 0;
+ for (i = start; i < end; i++) {
+ c |= p->u.str16[i];
+ }
+ if (c > 0xFF)
+ return js_new_string16(ctx, p->u.str16 + start, len);
+
+ str = js_alloc_string(ctx, len, 0);
+ if (!str)
+ return JS_EXCEPTION;
+ for (i = 0; i < len; i++) {
+ str->u.str8[i] = p->u.str16[start + i];
+ }
+ str->u.str8[len] = '\0';
+ return JS_MKPTR(JS_TAG_STRING, str);
+ } else {
+ return js_new_string8(ctx, p->u.str8 + start, len);
+ }
+}
+
+typedef struct StringBuffer {
+ JSContext *ctx;
+ JSString *str;
+ int len;
+ int size;
+ int is_wide_char;
+ int error_status;
+} StringBuffer;
+
+/* It is valid to call string_buffer_end() and all string_buffer functions even
+ if string_buffer_init() or another string_buffer function returns an error.
+ If the error_status is set, string_buffer_end() returns JS_EXCEPTION.
+ */
+static int string_buffer_init2(JSContext *ctx, StringBuffer *s, int size,
+ int is_wide)
+{
+ s->ctx = ctx;
+ s->size = size;
+ s->len = 0;
+ s->is_wide_char = is_wide;
+ s->error_status = 0;
+ s->str = js_alloc_string(ctx, size, is_wide);
+ if (unlikely(!s->str)) {
+ s->size = 0;
+ return s->error_status = -1;
+ }
+#ifdef DUMP_LEAKS
+ /* the StringBuffer may reallocate the JSString, only link it at the end */
+ list_del(&s->str->link);
+#endif
+ return 0;
+}
+
+static inline int string_buffer_init(JSContext *ctx, StringBuffer *s, int size)
+{
+ return string_buffer_init2(ctx, s, size, 0);
+}
+
+static void string_buffer_free(StringBuffer *s)
+{
+ js_free(s->ctx, s->str);
+ s->str = NULL;
+}
+
+static int string_buffer_set_error(StringBuffer *s)
+{
+ js_free(s->ctx, s->str);
+ s->str = NULL;
+ s->size = 0;
+ s->len = 0;
+ return s->error_status = -1;
+}
+
+static no_inline int string_buffer_widen(StringBuffer *s, int size)
+{
+ JSString *str;
+ size_t slack;
+ int i;
+
+ if (s->error_status)
+ return -1;
+
+ str = js_realloc2(s->ctx, s->str, sizeof(JSString) + (size << 1), &slack);
+ if (!str)
+ return string_buffer_set_error(s);
+ size += slack >> 1;
+ for(i = s->len; i-- > 0;) {
+ str->u.str16[i] = str->u.str8[i];
+ }
+ s->is_wide_char = 1;
+ s->size = size;
+ s->str = str;
+ return 0;
+}
+
+static no_inline int string_buffer_realloc(StringBuffer *s, int new_len, int c)
+{
+ JSString *new_str;
+ int new_size;
+ size_t new_size_bytes, slack;
+
+ if (s->error_status)
+ return -1;
+
+ if (new_len > JS_STRING_LEN_MAX) {
+ JS_ThrowInternalError(s->ctx, "string too long");
+ return string_buffer_set_error(s);
+ }
+ new_size = min_int(max_int(new_len, s->size * 3 / 2), JS_STRING_LEN_MAX);
+ if (!s->is_wide_char && c >= 0x100) {
+ return string_buffer_widen(s, new_size);
+ }
+ new_size_bytes = sizeof(JSString) + (new_size << s->is_wide_char) + 1 - s->is_wide_char;
+ new_str = js_realloc2(s->ctx, s->str, new_size_bytes, &slack);
+ if (!new_str)
+ return string_buffer_set_error(s);
+ new_size = min_int(new_size + (slack >> s->is_wide_char), JS_STRING_LEN_MAX);
+ s->size = new_size;
+ s->str = new_str;
+ return 0;
+}
+
+static no_inline int string_buffer_putc_slow(StringBuffer *s, uint32_t c)
+{
+ if (unlikely(s->len >= s->size)) {
+ if (string_buffer_realloc(s, s->len + 1, c))
+ return -1;
+ }
+ if (s->is_wide_char) {
+ s->str->u.str16[s->len++] = c;
+ } else if (c < 0x100) {
+ s->str->u.str8[s->len++] = c;
+ } else {
+ if (string_buffer_widen(s, s->size))
+ return -1;
+ s->str->u.str16[s->len++] = c;
+ }
+ return 0;
+}
+
+/* 0 <= c <= 0xff */
+static int string_buffer_putc8(StringBuffer *s, uint32_t c)
+{
+ if (unlikely(s->len >= s->size)) {
+ if (string_buffer_realloc(s, s->len + 1, c))
+ return -1;
+ }
+ if (s->is_wide_char) {
+ s->str->u.str16[s->len++] = c;
+ } else {
+ s->str->u.str8[s->len++] = c;
+ }
+ return 0;
+}
+
+/* 0 <= c <= 0xffff */
+static int string_buffer_putc16(StringBuffer *s, uint32_t c)
+{
+ if (likely(s->len < s->size)) {
+ if (s->is_wide_char) {
+ s->str->u.str16[s->len++] = c;
+ return 0;
+ } else if (c < 0x100) {
+ s->str->u.str8[s->len++] = c;
+ return 0;
+ }
+ }
+ return string_buffer_putc_slow(s, c);
+}
+
+/* 0 <= c <= 0x10ffff */
+static int string_buffer_putc(StringBuffer *s, uint32_t c)
+{
+ if (unlikely(c >= 0x10000)) {
+ /* surrogate pair */
+ c -= 0x10000;
+ if (string_buffer_putc16(s, (c >> 10) + 0xd800))
+ return -1;
+ c = (c & 0x3ff) + 0xdc00;
+ }
+ return string_buffer_putc16(s, c);
+}
+
+static int string_get(const JSString *p, int idx) {
+ return p->is_wide_char ? p->u.str16[idx] : p->u.str8[idx];
+}
+
+static int string_buffer_write8(StringBuffer *s, const uint8_t *p, int len)
+{
+ int i;
+
+ if (s->len + len > s->size) {
+ if (string_buffer_realloc(s, s->len + len, 0))
+ return -1;
+ }
+ if (s->is_wide_char) {
+ for (i = 0; i < len; i++) {
+ s->str->u.str16[s->len + i] = p[i];
+ }
+ s->len += len;
+ } else {
+ memcpy(&s->str->u.str8[s->len], p, len);
+ s->len += len;
+ }
+ return 0;
+}
+
+static int string_buffer_write16(StringBuffer *s, const uint16_t *p, int len)
+{
+ int c = 0, i;
+
+ for (i = 0; i < len; i++) {
+ c |= p[i];
+ }
+ if (s->len + len > s->size) {
+ if (string_buffer_realloc(s, s->len + len, c))
+ return -1;
+ } else if (!s->is_wide_char && c >= 0x100) {
+ if (string_buffer_widen(s, s->size))
+ return -1;
+ }
+ if (s->is_wide_char) {
+ memcpy(&s->str->u.str16[s->len], p, len << 1);
+ s->len += len;
+ } else {
+ for (i = 0; i < len; i++) {
+ s->str->u.str8[s->len + i] = p[i];
+ }
+ s->len += len;
+ }
+ return 0;
+}
+
+/* appending an ASCII string */
+static int string_buffer_puts8(StringBuffer *s, const char *str)
+{
+ return string_buffer_write8(s, (const uint8_t *)str, strlen(str));
+}
+
+static int string_buffer_concat(StringBuffer *s, const JSString *p,
+ uint32_t from, uint32_t to)
+{
+ if (to <= from)
+ return 0;
+ if (p->is_wide_char)
+ return string_buffer_write16(s, p->u.str16 + from, to - from);
+ else
+ return string_buffer_write8(s, p->u.str8 + from, to - from);
+}
+
+static int string_buffer_concat_value(StringBuffer *s, JSValueConst v)
+{
+ JSString *p;
+ JSValue v1;
+ int res;
+
+ if (s->error_status) {
+ /* prevent exception overload */
+ return -1;
+ }
+ if (unlikely(JS_VALUE_GET_TAG(v) != JS_TAG_STRING)) {
+ v1 = JS_ToString(s->ctx, v);
+ if (JS_IsException(v1))
+ return string_buffer_set_error(s);
+ p = JS_VALUE_GET_STRING(v1);
+ res = string_buffer_concat(s, p, 0, p->len);
+ JS_FreeValue(s->ctx, v1);
+ return res;
+ }
+ p = JS_VALUE_GET_STRING(v);
+ return string_buffer_concat(s, p, 0, p->len);
+}
+
+static int string_buffer_concat_value_free(StringBuffer *s, JSValue v)
+{
+ JSString *p;
+ int res;
+
+ if (s->error_status) {
+ /* prevent exception overload */
+ JS_FreeValue(s->ctx, v);
+ return -1;
+ }
+ if (unlikely(JS_VALUE_GET_TAG(v) != JS_TAG_STRING)) {
+ v = JS_ToStringFree(s->ctx, v);
+ if (JS_IsException(v))
+ return string_buffer_set_error(s);
+ }
+ p = JS_VALUE_GET_STRING(v);
+ res = string_buffer_concat(s, p, 0, p->len);
+ JS_FreeValue(s->ctx, v);
+ return res;
+}
+
+static int string_buffer_fill(StringBuffer *s, int c, int count)
+{
+ /* XXX: optimize */
+ if (s->len + count > s->size) {
+ if (string_buffer_realloc(s, s->len + count, c))
+ return -1;
+ }
+ while (count-- > 0) {
+ if (string_buffer_putc16(s, c))
+ return -1;
+ }
+ return 0;
+}
+
+static JSValue string_buffer_end(StringBuffer *s)
+{
+ JSString *str;
+ str = s->str;
+ if (s->error_status)
+ return JS_EXCEPTION;
+ if (s->len == 0) {
+ js_free(s->ctx, str);
+ s->str = NULL;
+ return JS_AtomToString(s->ctx, JS_ATOM_empty_string);
+ }
+ if (s->len < s->size) {
+ /* smaller size so js_realloc should not fail, but OK if it does */
+ /* XXX: should add some slack to avoid unnecessary calls */
+ /* XXX: might need to use malloc+free to ensure smaller size */
+ str = js_realloc_rt(s->ctx->rt, str, sizeof(JSString) +
+ (s->len << s->is_wide_char) + 1 - s->is_wide_char);
+ if (str == NULL)
+ str = s->str;
+ s->str = str;
+ }
+ if (!s->is_wide_char)
+ str->u.str8[s->len] = 0;
+#ifdef DUMP_LEAKS
+ list_add_tail(&str->link, &s->ctx->rt->string_list);
+#endif
+ str->is_wide_char = s->is_wide_char;
+ str->len = s->len;
+ s->str = NULL;
+ return JS_MKPTR(JS_TAG_STRING, str);
+}
+
+/* create a string from a UTF-8 buffer */
+JSValue JS_NewStringLen(JSContext *ctx, const char *buf, int buf_len)
+{
+ const uint8_t *p, *p_end, *p_start, *p_next;
+ uint32_t c;
+ StringBuffer b_s, *b = &b_s;
+
+ p_start = (const uint8_t *)buf;
+ p_end = p_start + buf_len;
+ p = p_start;
+ while (p < p_end && *p < 128)
+ p++;
+ if (p == p_end) {
+ /* ASCII string */
+ return js_new_string8(ctx, (const uint8_t *)buf, buf_len);
+ } else {
+ int len1 = p - p_start;
+ if (string_buffer_init(ctx, b, buf_len))
+ goto fail;
+ string_buffer_write8(b, p_start, len1);
+ while (p < p_end) {
+ if (*p < 128) {
+ string_buffer_putc8(b, *p++);
+ } else {
+ /* parse utf-8 sequence, return 0xFFFFFFFF for error */
+ c = unicode_from_utf8(p, p_end - p, &p_next);
+ if (c < 0x10000) {
+ p = p_next;
+ } else if (c <= 0x10FFFF) {
+ p = p_next;
+ /* surrogate pair */
+ c -= 0x10000;
+ string_buffer_putc16(b, (c >> 10) + 0xd800);
+ c = (c & 0x3ff) + 0xdc00;
+ } else {
+ /* invalid char */
+ c = 0xfffd;
+ /* skip the invalid chars */
+ /* XXX: seems incorrect. Why not just use c = *p++; ? */
+ while (p < p_end && (*p >= 0x80 && *p < 0xc0))
+ p++;
+ if (p < p_end) {
+ p++;
+ while (p < p_end && (*p >= 0x80 && *p < 0xc0))
+ p++;
+ }
+ }
+ string_buffer_putc16(b, c);
+ }
+ }
+ }
+ return string_buffer_end(b);
+
+ fail:
+ string_buffer_free(b);
+ return JS_EXCEPTION;
+}
+
+static JSValue JS_ConcatString3(JSContext *ctx, const char *str1,
+ JSValue str2, const char *str3)
+{
+ StringBuffer b_s, *b = &b_s;
+ int len1, len3;
+ JSString *p;
+
+ if (unlikely(JS_VALUE_GET_TAG(str2) != JS_TAG_STRING)) {
+ str2 = JS_ToStringFree(ctx, str2);
+ if (JS_IsException(str2))
+ goto fail;
+ }
+ p = JS_VALUE_GET_STRING(str2);
+ len1 = strlen(str1);
+ len3 = strlen(str3);
+
+ if (string_buffer_init2(ctx, b, len1 + p->len + len3, p->is_wide_char))
+ goto fail;
+
+ string_buffer_write8(b, (const uint8_t *)str1, len1);
+ string_buffer_concat(b, p, 0, p->len);
+ string_buffer_write8(b, (const uint8_t *)str3, len3);
+
+ JS_FreeValue(ctx, str2);
+ return string_buffer_end(b);
+
+ fail:
+ JS_FreeValue(ctx, str2);
+ return JS_EXCEPTION;
+}
+
+JSValue JS_NewString(JSContext *ctx, const char *str)
+{
+ return JS_NewStringLen(ctx, str, strlen(str));
+}
+
+JSValue JS_NewAtomString(JSContext *ctx, const char *str)
+{
+ JSAtom atom = JS_NewAtom(ctx, str);
+ if (atom == JS_ATOM_NULL)
+ return JS_EXCEPTION;
+ JSValue val = JS_AtomToString(ctx, atom);
+ JS_FreeAtom(ctx, atom);
+ return val;
+}
+
+/* return (NULL, 0) if exception. */
+/* return pointer into a JSString with a live ref_count */
+/* cesu8 determines if non-BMP1 codepoints are encoded as 1 or 2 utf-8 sequences */
+const char *JS_ToCStringLen(JSContext *ctx, int *plen, JSValueConst val1, BOOL cesu8)
+{
+ JSValue val;
+ JSString *str, *str_new;
+ int pos, len, c, c1;
+ uint8_t *q;
+
+ if (JS_VALUE_GET_TAG(val1) != JS_TAG_STRING) {
+ val = JS_ToString(ctx, val1);
+ if (JS_IsException(val))
+ goto fail;
+ } else {
+ val = JS_DupValue(ctx, val1);
+ }
+
+ str = JS_VALUE_GET_STRING(val);
+ len = str->len;
+ if (!str->is_wide_char) {
+ const uint8_t *src = str->u.str8;
+ int count;
+
+ /* count the number of non-ASCII characters */
+ /* Scanning the whole string is required for ASCII strings,
+ and computing the number of non-ASCII bytes is less expensive
+ than testing each byte, hence this method is faster for ASCII
+ strings, which is the most common case.
+ */
+ count = 0;
+ for (pos = 0; pos < len; pos++) {
+ count += src[pos] >> 7;
+ }
+ if (count == 0) {
+ if (plen)
+ *plen = len;
+ return (const char *)src;
+ }
+ str_new = js_alloc_string(ctx, len + count, 0);
+ if (!str_new)
+ goto fail;
+ q = str_new->u.str8;
+ for (pos = 0; pos < len; pos++) {
+ c = src[pos];
+ if (c < 0x80) {
+ *q++ = c;
+ } else {
+ *q++ = (c >> 6) | 0xc0;
+ *q++ = (c & 0x3f) | 0x80;
+ }
+ }
+ } else {
+ const uint16_t *src = str->u.str16;
+ /* Allocate 3 bytes per 16 bit code point. Surrogate pairs may
+ produce 4 bytes but use 2 code points.
+ */
+ str_new = js_alloc_string(ctx, len * 3, 0);
+ if (!str_new)
+ goto fail;
+ q = str_new->u.str8;
+ pos = 0;
+ while (pos < len) {
+ c = src[pos++];
+ if (c < 0x80) {
+ *q++ = c;
+ } else {
+ if (c >= 0xd800 && c < 0xdc00) {
+ if (pos < len && !cesu8) {
+ c1 = src[pos];
+ if (c1 >= 0xdc00 && c1 < 0xe000) {
+ pos++;
+ /* surrogate pair */
+ c = (((c & 0x3ff) << 10) | (c1 & 0x3ff)) + 0x10000;
+ } else {
+ /* Keep unmatched surrogate code points */
+ /* c = 0xfffd; */ /* error */
+ }
+ } else {
+ /* Keep unmatched surrogate code points */
+ /* c = 0xfffd; */ /* error */
+ }
+ }
+ q += unicode_to_utf8(q, c);
+ }
+ }
+ }
+
+ *q = '\0';
+ str_new->len = q - str_new->u.str8;
+ JS_FreeValue(ctx, val);
+ if (plen)
+ *plen = str_new->len;
+ return (const char *)str_new->u.str8;
+ fail:
+ if (plen)
+ *plen = 0;
+ return NULL;
+}
+
+void JS_FreeCString(JSContext *ctx, const char *ptr)
+{
+ JSString *p;
+ if (!ptr)
+ return;
+ /* purposely removing constness */
+ p = (JSString *)(void *)(ptr - offsetof(JSString, u));
+ JS_FreeValue(ctx, JS_MKPTR(JS_TAG_STRING, p));
+}
+
+static int memcmp16_8(const uint16_t *src1, const uint8_t *src2, int len)
+{
+ int c, i;
+ for(i = 0; i < len; i++) {
+ c = src1[i] - src2[i];
+ if (c != 0)
+ return c;
+ }
+ return 0;
+}
+
+static int memcmp16(const uint16_t *src1, const uint16_t *src2, int len)
+{
+ int c, i;
+ for(i = 0; i < len; i++) {
+ c = src1[i] - src2[i];
+ if (c != 0)
+ return c;
+ }
+ return 0;
+}
+
+static int js_string_memcmp(const JSString *p1, const JSString *p2, int len)
+{
+ int res;
+
+ if (likely(!p1->is_wide_char)) {
+ if (likely(!p2->is_wide_char))
+ res = memcmp(p1->u.str8, p2->u.str8, len);
+ else
+ res = -memcmp16_8(p2->u.str16, p1->u.str8, len);
+ } else {
+ if (!p2->is_wide_char)
+ res = memcmp16_8(p1->u.str16, p2->u.str8, len);
+ else
+ res = memcmp16(p1->u.str16, p2->u.str16, len);
+ }
+ return res;
+}
+
+/* return < 0, 0 or > 0 */
+static int js_string_compare(JSContext *ctx,
+ const JSString *p1, const JSString *p2)
+{
+ int res, len;
+ len = min_int(p1->len, p2->len);
+ res = js_string_memcmp(p1, p2, len);
+ if (res == 0) {
+ if (p1->len == p2->len)
+ res = 0;
+ else if (p1->len < p2->len)
+ res = -1;
+ else
+ res = 1;
+ }
+ return res;
+}
+
+static void copy_str16(uint16_t *dst, const JSString *p, int offset, int len)
+{
+ if (p->is_wide_char) {
+ memcpy(dst, p->u.str16 + offset, len * 2);
+ } else {
+ const uint8_t *src1 = p->u.str8 + offset;
+ int i;
+
+ for(i = 0; i < len; i++)
+ dst[i] = src1[i];
+ }
+}
+
+static JSValue JS_ConcatString1(JSContext *ctx,
+ const JSString *p1, const JSString *p2)
+{
+ JSString *p;
+ uint32_t len;
+ int is_wide_char;
+
+ len = p1->len + p2->len;
+ if (len > JS_STRING_LEN_MAX)
+ return JS_ThrowInternalError(ctx, "string too long");
+ is_wide_char = p1->is_wide_char | p2->is_wide_char;
+ p = js_alloc_string(ctx, len, is_wide_char);
+ if (!p)
+ return JS_EXCEPTION;
+ if (!is_wide_char) {
+ memcpy(p->u.str8, p1->u.str8, p1->len);
+ memcpy(p->u.str8 + p1->len, p2->u.str8, p2->len);
+ p->u.str8[len] = '\0';
+ } else {
+ copy_str16(p->u.str16, p1, 0, p1->len);
+ copy_str16(p->u.str16 + p1->len, p2, 0, p2->len);
+ }
+ return JS_MKPTR(JS_TAG_STRING, p);
+}
+
+/* op1 and op2 are converted to strings. For convience, op1 or op2 =
+ JS_EXCEPTION are accepted and return JS_EXCEPTION. */
+static JSValue JS_ConcatString(JSContext *ctx, JSValue op1, JSValue op2)
+{
+ JSValue ret;
+ JSString *p1, *p2;
+
+ if (unlikely(JS_VALUE_GET_TAG(op1) != JS_TAG_STRING)) {
+ op1 = JS_ToStringFree(ctx, op1);
+ if (JS_IsException(op1)) {
+ JS_FreeValue(ctx, op2);
+ return JS_EXCEPTION;
+ }
+ }
+ if (unlikely(JS_VALUE_GET_TAG(op2) != JS_TAG_STRING)) {
+ op2 = JS_ToStringFree(ctx, op2);
+ if (JS_IsException(op2)) {
+ JS_FreeValue(ctx, op1);
+ return JS_EXCEPTION;
+ }
+ }
+ p1 = JS_VALUE_GET_STRING(op1);
+ p2 = JS_VALUE_GET_STRING(op2);
+
+ /* XXX: could also check if p1 is empty */
+ if (p2->len == 0) {
+ goto ret_op1;
+ }
+ if (p1->header.ref_count == 1 && p1->is_wide_char == p2->is_wide_char
+ && js_malloc_usable_size(ctx, p1) >= sizeof(*p1) + ((p1->len + p2->len) << p2->is_wide_char) + 1 - p1->is_wide_char) {
+ /* Concatenate in place in available space at the end of p1 */
+ if (p1->is_wide_char) {
+ memcpy(p1->u.str16 + p1->len, p2->u.str16, p2->len << 1);
+ p1->len += p2->len;
+ } else {
+ memcpy(p1->u.str8 + p1->len, p2->u.str8, p2->len);
+ p1->len += p2->len;
+ p1->u.str8[p1->len] = '\0';
+ }
+ ret_op1:
+ JS_FreeValue(ctx, op2);
+ return op1;
+ }
+ ret = JS_ConcatString1(ctx, p1, p2);
+ JS_FreeValue(ctx, op1);
+ JS_FreeValue(ctx, op2);
+ return ret;
+}
+
+/* Shape support */
+
+static inline size_t get_shape_size(size_t hash_size, size_t prop_size)
+{
+ return hash_size * sizeof(uint32_t) + sizeof(JSShape) +
+ prop_size * sizeof(JSShapeProperty);
+}
+
+static inline JSShape *get_shape_from_alloc(void *sh_alloc, size_t hash_size)
+{
+ return (JSShape *)(void *)((uint32_t *)sh_alloc + hash_size);
+}
+
+static inline void *get_alloc_from_shape(JSShape *sh)
+{
+ return prop_hash_end_field_of_shape(sh) - ((intptr_t)sh->prop_hash_mask + 1);
+}
+
+static inline JSShapeProperty *get_shape_prop(JSShape *sh)
+{
+ return sh->prop;
+}
+
+static int init_shape_hash(JSRuntime *rt)
+{
+ rt->shape_hash_bits = 4; /* 16 shapes */
+ rt->shape_hash_size = 1 << rt->shape_hash_bits;
+ rt->shape_hash_count = 0;
+ rt->shape_hash = js_mallocz_rt(rt, sizeof(rt->shape_hash[0]) *
+ rt->shape_hash_size);
+ if (!rt->shape_hash)
+ return -1;
+ return 0;
+}
+
+/* same magic hash multiplier as the Linux kernel */
+static uint32_t shape_hash(uint32_t h, uint32_t val)
+{
+ return (h + val) * 0x9e370001;
+}
+
+/* truncate the shape hash to 'hash_bits' bits */
+static uint32_t get_shape_hash(uint32_t h, int hash_bits)
+{
+ return h >> (32 - hash_bits);
+}
+
+static uint32_t shape_initial_hash(JSObject *proto)
+{
+ uint32_t h;
+ h = shape_hash(1, (uintptr_t)proto);
+ if (sizeof(proto) > 4)
+ h = shape_hash(h, (uint64_t)(uintptr_t)proto >> 32);
+ return h;
+}
+
+static int resize_shape_hash(JSRuntime *rt, int new_shape_hash_bits)
+{
+ int new_shape_hash_size, i;
+ uint32_t h;
+ JSShape **new_shape_hash, *sh, *sh_next;
+
+ new_shape_hash_size = 1 << new_shape_hash_bits;
+ new_shape_hash = js_mallocz_rt(rt, sizeof(rt->shape_hash[0]) *
+ new_shape_hash_size);
+ if (!new_shape_hash)
+ return -1;
+ for(i = 0; i < rt->shape_hash_size; i++) {
+ for(sh = rt->shape_hash[i]; sh != NULL; sh = sh_next) {
+ sh_next = sh->shape_hash_next;
+ h = get_shape_hash(sh->hash, new_shape_hash_bits);
+ sh->shape_hash_next = new_shape_hash[h];
+ new_shape_hash[h] = sh;
+ }
+ }
+ js_free_rt(rt, rt->shape_hash);
+ rt->shape_hash_bits = new_shape_hash_bits;
+ rt->shape_hash_size = new_shape_hash_size;
+ rt->shape_hash = new_shape_hash;
+ return 0;
+}
+
+static void js_shape_hash_link(JSRuntime *rt, JSShape *sh)
+{
+ uint32_t h;
+ h = get_shape_hash(sh->hash, rt->shape_hash_bits);
+ sh->shape_hash_next = rt->shape_hash[h];
+ rt->shape_hash[h] = sh;
+ rt->shape_hash_count++;
+}
+
+static void js_shape_hash_unlink(JSRuntime *rt, JSShape *sh)
+{
+ uint32_t h;
+ JSShape **psh;
+
+ h = get_shape_hash(sh->hash, rt->shape_hash_bits);
+ psh = &rt->shape_hash[h];
+ while (*psh != sh)
+ psh = &(*psh)->shape_hash_next;
+ *psh = sh->shape_hash_next;
+ rt->shape_hash_count--;
+}
+
+/* create a new empty shape with prototype 'proto' */
+static no_inline JSShape *js_new_shape2(JSContext *ctx, JSObject *proto,
+ int hash_size, int prop_size)
+{
+ JSRuntime *rt = ctx->rt;
+ void *sh_alloc;
+ JSShape *sh;
+
+ /* resize the shape hash table if necessary */
+ if (2 * (rt->shape_hash_count + 1) > rt->shape_hash_size) {
+ resize_shape_hash(rt, rt->shape_hash_bits + 1);
+ }
+
+ sh_alloc = js_malloc(ctx, get_shape_size(hash_size, prop_size));
+ if (!sh_alloc)
+ return NULL;
+ sh = get_shape_from_alloc(sh_alloc, hash_size);
+ sh->header.ref_count = 1;
+ sh->gc_header.mark = 0;
+ if (proto)
+ JS_DupValue(ctx, JS_MKPTR(JS_TAG_OBJECT, proto));
+ sh->proto = proto;
+ memset(prop_hash_end_field_of_shape(sh) - hash_size, 0, sizeof(prop_hash_end_field_of_shape(sh)[0]) *
+ hash_size);
+ sh->prop_hash_mask = hash_size - 1;
+ sh->prop_count = 0;
+ sh->prop_size = prop_size;
+
+ /* insert in the hash table */
+ sh->hash = shape_initial_hash(proto);
+ sh->is_hashed = TRUE;
+ sh->has_small_array_index = FALSE;
+ js_shape_hash_link(ctx->rt, sh);
+ return sh;
+}
+
+static JSShape *js_new_shape(JSContext *ctx, JSObject *proto)
+{
+ return js_new_shape2(ctx, proto, JS_PROP_INITIAL_HASH_SIZE,
+ JS_PROP_INITIAL_SIZE);
+}
+
+/* The shape is cloned. The new shape is not inserted in the shape
+ hash table */
+static JSShape *js_clone_shape(JSContext *ctx, JSShape *sh1)
+{
+ JSShape *sh;
+ void *sh_alloc, *sh_alloc1;
+ size_t size;
+ JSShapeProperty *pr;
+ uint32_t i, hash_size;
+
+ hash_size = sh1->prop_hash_mask + 1;
+ size = get_shape_size(hash_size, sh1->prop_size);
+ sh_alloc = js_malloc(ctx, size);
+ if (!sh_alloc)
+ return NULL;
+ sh_alloc1 = get_alloc_from_shape(sh1);
+ memcpy(sh_alloc, sh_alloc1, size);
+ sh = get_shape_from_alloc(sh_alloc, hash_size);
+ sh->header.ref_count = 1;
+ sh->gc_header.mark = 0;
+ sh->is_hashed = FALSE;
+ if (sh->proto) {
+ JS_DupValue(ctx, JS_MKPTR(JS_TAG_OBJECT, sh->proto));
+ }
+ for(i = 0, pr = get_shape_prop(sh); i < sh->prop_count; i++, pr++) {
+ JS_DupAtom(ctx, pr->atom);
+ }
+ return sh;
+}
+
+static JSShape *js_dup_shape(JSShape *sh)
+{
+ sh->header.ref_count++;
+ return sh;
+}
+
+static void js_free_shape(JSRuntime *rt, JSShape *sh)
+{
+ uint32_t i;
+ JSShapeProperty *pr;
+
+ if (unlikely(--sh->header.ref_count <= 0)) {
+ assert(sh->header.ref_count == 0);
+ if (sh->is_hashed)
+ js_shape_hash_unlink(rt, sh);
+ if (sh->proto != NULL) {
+ JS_FreeValueRT(rt, JS_MKPTR(JS_TAG_OBJECT, sh->proto));
+ }
+ pr = get_shape_prop(sh);
+ for(i = 0; i < sh->prop_count; i++) {
+ JS_FreeAtomRT(rt, pr->atom);
+ pr++;
+ }
+ js_free_rt(rt, get_alloc_from_shape(sh));
+ }
+}
+
+static void js_free_shape_null(JSRuntime *rt, JSShape *sh)
+{
+ if (sh)
+ js_free_shape(rt, sh);
+}
+
+/* make space to hold at least 'count' properties */
+static no_inline int resize_properties(JSContext *ctx, JSShape **psh,
+ JSObject *p, uint32_t count)
+{
+ JSShape *sh;
+ uint32_t new_size, new_hash_size, new_hash_mask, i;
+ JSShapeProperty *pr;
+ void *sh_alloc;
+ intptr_t h;
+
+ sh = *psh;
+ new_size = max_int(count, sh->prop_size * 3 / 2);
+ /* Reallocate prop array first to avoid crash or size inconsistency
+ in case of memory allocation failure */
+ if (p) {
+ JSProperty *new_prop;
+ new_prop = js_realloc(ctx, p->prop, sizeof(new_prop[0]) * new_size);
+ if (unlikely(!new_prop))
+ return -1;
+ p->prop = new_prop;
+ }
+ new_hash_size = sh->prop_hash_mask + 1;
+ while (new_hash_size < new_size)
+ new_hash_size = 2 * new_hash_size;
+ if (new_hash_size != (sh->prop_hash_mask + 1)) {
+ JSShape *old_sh;
+ /* resize the hash table and the properties */
+ old_sh = sh;
+ sh_alloc = js_malloc(ctx, get_shape_size(new_hash_size, new_size));
+ if (!sh_alloc)
+ return -1;
+ sh = get_shape_from_alloc(sh_alloc, new_hash_size);
+ /* copy all the fields and the properties */
+ memcpy(sh, old_sh,
+ sizeof(JSShape) + sizeof(sh->prop[0]) * old_sh->prop_count);
+ new_hash_mask = new_hash_size - 1;
+ sh->prop_hash_mask = new_hash_mask;
+ memset(prop_hash_end_field_of_shape(sh) - new_hash_size, 0,
+ sizeof(prop_hash_end_field_of_shape(sh)[0]) * new_hash_size);
+ for(i = 0, pr = sh->prop; i < sh->prop_count; i++, pr++) {
+ if (pr->atom != JS_ATOM_NULL) {
+ h = ((uintptr_t)pr->atom & new_hash_mask);
+ pr->hash_next = prop_hash_end_field_of_shape(sh)[-h - 1];
+ prop_hash_end_field_of_shape(sh)[-h - 1] = i + 1;
+ }
+ }
+ js_free(ctx, get_alloc_from_shape(old_sh));
+ } else {
+ /* only resize the properties */
+ sh_alloc = js_realloc(ctx, get_alloc_from_shape(sh),
+ get_shape_size(new_hash_size, new_size));
+ if (unlikely(!sh_alloc))
+ return -1;
+ sh = get_shape_from_alloc(sh_alloc, new_hash_size);
+ }
+ *psh = sh;
+ sh->prop_size = new_size;
+ return 0;
+}
+
+static int add_shape_property(JSContext *ctx, JSShape **psh,
+ JSObject *p, JSAtom atom, int prop_flags)
+{
+ JSRuntime *rt = ctx->rt;
+ JSShape *sh = *psh;
+ JSShapeProperty *pr, *prop;
+ uint32_t hash_mask, new_shape_hash = 0;
+ intptr_t h;
+
+ /* update the shape hash */
+ if (sh->is_hashed) {
+ js_shape_hash_unlink(rt, sh);
+ new_shape_hash = shape_hash(shape_hash(sh->hash, atom), prop_flags);
+ }
+
+ if (unlikely(sh->prop_count >= sh->prop_size)) {
+ if (resize_properties(ctx, psh, p, sh->prop_count + 1)) {
+ /* in case of error, reinsert in the hash table.
+ sh is still valid if resize_properties() failed */
+ if (sh->is_hashed)
+ js_shape_hash_link(rt, sh);
+ return -1;
+ }
+ sh = *psh;
+ }
+ if (sh->is_hashed) {
+ sh->hash = new_shape_hash;
+ js_shape_hash_link(rt, sh);
+ }
+ /* Initialize the new shape property.
+ The object property at p->prop[sh->prop_count] is uninitialized */
+ prop = get_shape_prop(sh);
+ pr = &prop[sh->prop_count++];
+ pr->atom = JS_DupAtom(ctx, atom);
+ pr->flags = prop_flags;
+ sh->has_small_array_index |= __JS_AtomIsTaggedInt(atom);
+ /* add in hash table */
+ hash_mask = sh->prop_hash_mask;
+ h = atom & hash_mask;
+ pr->hash_next = prop_hash_end_field_of_shape(sh)[-h - 1];
+ prop_hash_end_field_of_shape(sh)[-h - 1] = sh->prop_count;
+ return 0;
+}
+
+/* find a hashed empty shape matching the prototype. Return NULL if
+ not found */
+static JSShape *find_hashed_shape_proto(JSRuntime *rt, JSObject *proto)
+{
+ JSShape *sh1;
+ uint32_t h, h1;
+
+ h = shape_initial_hash(proto);
+ h1 = get_shape_hash(h, rt->shape_hash_bits);
+ for(sh1 = rt->shape_hash[h1]; sh1 != NULL; sh1 = sh1->shape_hash_next) {
+ if (sh1->hash == h &&
+ sh1->proto == proto &&
+ sh1->prop_count == 0) {
+ return sh1;
+ }
+ }
+ return NULL;
+}
+
+/* find a hashed shape matching sh + (prop, prop_flags). Return NULL if
+ not found */
+static JSShape *find_hashed_shape_prop(JSRuntime *rt, JSShape *sh,
+ JSAtom atom, int prop_flags)
+{
+ JSShape *sh1;
+ uint32_t h, h1, i, n;
+
+ h = sh->hash;
+ h = shape_hash(h, atom);
+ h = shape_hash(h, prop_flags);
+ h1 = get_shape_hash(h, rt->shape_hash_bits);
+ for(sh1 = rt->shape_hash[h1]; sh1 != NULL; sh1 = sh1->shape_hash_next) {
+ /* we test the hash first so that the rest is done only if the
+ shapes really match */
+ if (sh1->hash == h &&
+ sh1->proto == sh->proto &&
+ sh1->prop_count == ((n = sh->prop_count) + 1)) {
+ for(i = 0; i < n; i++) {
+ if (unlikely(sh1->prop[i].atom != sh->prop[i].atom) ||
+ unlikely(sh1->prop[i].flags != sh->prop[i].flags))
+ goto next;
+ }
+ if (unlikely(sh1->prop[n].atom != atom) ||
+ unlikely(sh1->prop[n].flags != prop_flags))
+ goto next;
+ return sh1;
+ }
+ next: ;
+ }
+ return NULL;
+}
+
+#if defined(_MSC_VER)
+static void JS_DumpShape(JSRuntime *rt, int i, JSShape *sh)
+#else
+static __attribute__((unused)) void JS_DumpShape(JSRuntime *rt, int i, JSShape *sh)
+#endif
+{
+ char atom_buf[ATOM_GET_STR_BUF_SIZE];
+ int j;
+
+ /* XXX: should output readable class prototype */
+ printf("%5d %3d%c %14p %5d %5d", i,
+ sh->header.ref_count, " *"[sh->is_hashed],
+ (void *)sh->proto, sh->prop_size, sh->prop_count);
+ for(j = 0; j < sh->prop_count; j++) {
+ printf(" %s", JS_AtomGetStrRT(rt, atom_buf, sizeof(atom_buf),
+ sh->prop[j].atom));
+ }
+ printf("\n");
+}
+
+#if defined(_MSC_VER)
+static void JS_DumpShapes(JSRuntime *rt)
+#else
+static __attribute__((unused)) void JS_DumpShapes(JSRuntime *rt)
+#endif
+{
+ int i;
+ JSShape *sh;
+ struct list_head *el;
+ JSObject *p;
+
+ printf("JSShapes: {\n");
+ printf("%5s %4s %14s %5s %5s %s\n", "SLOT", "REFS", "PROTO", "SIZE", "COUNT", "PROPS");
+ for(i = 0; i < rt->shape_hash_size; i++) {
+ for(sh = rt->shape_hash[i]; sh != NULL; sh = sh->shape_hash_next) {
+ JS_DumpShape(rt, i, sh);
+ assert(sh->is_hashed);
+ }
+ }
+ /* dump non-hashed shapes */
+ list_for_each(el, &rt->obj_list) {
+ p = list_entry(el, JSObject, link);
+ if (!p->shape->is_hashed) {
+ JS_DumpShape(rt, -1, p->shape);
+ }
+ }
+ printf("}\n");
+}
+
+static JSValue JS_NewObjectFromShape(JSContext *ctx, JSShape *sh, JSClassID class_id)
+{
+ JSObject *p;
+
+ js_trigger_gc(ctx->rt, sizeof(JSObject));
+ p = js_malloc(ctx, sizeof(JSObject));
+ if (unlikely(!p))
+ goto fail;
+ p->header.ref_count = 1;
+ p->gc_header.mark = 0;
+ p->class_id = class_id;
+ p->extensible = TRUE;
+ p->free_mark = 0;
+ p->is_exotic = 0;
+ p->fast_array = 0;
+ p->is_constructor = 0;
+ p->is_uncatchable_error = 0;
+ p->is_class = 0;
+ p->tmp_mark = 0;
+ p->first_weak_ref = NULL;
+ p->u.opaque = NULL;
+ p->shape = sh;
+ p->prop = js_malloc(ctx, sizeof(JSProperty) * sh->prop_size);
+ if (unlikely(!p->prop)) {
+ js_free(ctx, p);
+ fail:
+ js_free_shape(ctx->rt, sh);
+ return JS_EXCEPTION;
+ }
+
+ switch(class_id) {
+ case JS_CLASS_OBJECT:
+ break;
+ case JS_CLASS_ARRAY:
+ {
+ JSProperty *pr;
+ p->is_exotic = 1;
+ p->fast_array = 1;
+ p->u.array.u.values = NULL;
+ p->u.array.count = 0;
+ p->u.array.u1.size = 0;
+ /* the length property is always the first one */
+ if (likely(sh == ctx->array_shape)) {
+ pr = &p->prop[0];
+ } else {
+ /* only used for the first array */
+ /* cannot fail */
+ pr = add_property(ctx, p, JS_ATOM_length,
+ JS_PROP_WRITABLE | JS_PROP_LENGTH);
+ }
+ pr->u.value = JS_NewInt32(ctx, 0);
+ }
+ break;
+ case JS_CLASS_C_FUNCTION:
+ p->prop[0].u.value = JS_UNDEFINED;
+ break;
+ case JS_CLASS_ARGUMENTS:
+#if defined(_MSC_VER)
+ case JS_CLASS_UINT8C_ARRAY: /* u.array (typed_array) */
+ case JS_CLASS_INT8_ARRAY: /* u.array (typed_array) */
+ case JS_CLASS_UINT8_ARRAY: /* u.array (typed_array) */
+ case JS_CLASS_INT16_ARRAY: /* u.array (typed_array) */
+ case JS_CLASS_UINT16_ARRAY: /* u.array (typed_array) */
+ case JS_CLASS_INT32_ARRAY: /* u.array (typed_array) */
+ case JS_CLASS_UINT32_ARRAY: /* u.array (typed_array) */
+#ifdef CONFIG_BIGNUM
+ case JS_CLASS_BIG_INT64_ARRAY: /* u.array (typed_array) */
+ case JS_CLASS_BIG_UINT64_ARRAY: /* u.array (typed_array) */
+#endif
+ case JS_CLASS_FLOAT32_ARRAY: /* u.array (typed_array) */
+ case JS_CLASS_FLOAT64_ARRAY: /* u.array (typed_array) */
+#else
+ case JS_CLASS_UINT8C_ARRAY ... JS_CLASS_FLOAT64_ARRAY:
+#endif
+ p->is_exotic = 1;
+ p->fast_array = 1;
+ p->u.array.u.ptr = NULL;
+ p->u.array.count = 0;
+ break;
+ case JS_CLASS_DATAVIEW:
+ p->u.array.u.ptr = NULL;
+ p->u.array.count = 0;
+ break;
+ case JS_CLASS_NUMBER:
+ case JS_CLASS_STRING:
+ case JS_CLASS_BOOLEAN:
+ case JS_CLASS_SYMBOL:
+ case JS_CLASS_DATE:
+#ifdef CONFIG_BIGNUM
+ case JS_CLASS_BIG_INT:
+ case JS_CLASS_BIG_FLOAT:
+#endif
+ p->u.object_data = JS_UNDEFINED;
+ goto set_exotic;
+ case JS_CLASS_REGEXP:
+ p->u.regexp.pattern = NULL;
+ p->u.regexp.bytecode = NULL;
+ goto set_exotic;
+ default:
+ set_exotic:
+ if (ctx->rt->class_array[class_id].exotic) {
+ p->is_exotic = 1;
+ }
+ break;
+ }
+ list_add_tail(&p->link, &ctx->rt->obj_list);
+ return JS_MKPTR(JS_TAG_OBJECT, p);
+}
+
+static JSObject *get_proto_obj(JSValueConst proto_val)
+{
+ if (JS_VALUE_GET_TAG(proto_val) != JS_TAG_OBJECT)
+ return NULL;
+ else
+ return JS_VALUE_GET_OBJ(proto_val);
+}
+
+/* WARNING: proto must be an object or JS_NULL */
+JSValue JS_NewObjectProtoClass(JSContext *ctx, JSValueConst proto_val,
+ JSClassID class_id)
+{
+ JSShape *sh;
+ JSObject *proto;
+
+ proto = get_proto_obj(proto_val);
+ sh = find_hashed_shape_proto(ctx->rt, proto);
+ if (likely(sh)) {
+ sh = js_dup_shape(sh);
+ } else {
+ sh = js_new_shape(ctx, proto);
+ if (!sh)
+ return JS_EXCEPTION;
+ }
+ return JS_NewObjectFromShape(ctx, sh, class_id);
+}
+
+#if 0
+static JSValue JS_GetObjectData(JSContext *ctx, JSValueConst obj)
+{
+ JSObject *p;
+
+ if (JS_VALUE_GET_TAG(obj) == JS_TAG_OBJECT) {
+ p = JS_VALUE_GET_OBJ(obj);
+ switch(p->class_id) {
+ case JS_CLASS_NUMBER:
+ case JS_CLASS_STRING:
+ case JS_CLASS_BOOLEAN:
+ case JS_CLASS_SYMBOL:
+ case JS_CLASS_DATE:
+#ifdef CONFIG_BIGNUM
+ case JS_CLASS_BIG_INT:
+ case JS_CLASS_BIG_FLOAT:
+#endif
+ return JS_DupValue(ctx, p->u.object_data);
+ }
+ }
+ return JS_UNDEFINED;
+}
+#endif
+
+static int JS_SetObjectData(JSContext *ctx, JSValueConst obj, JSValue val)
+{
+ JSObject *p;
+
+ if (JS_VALUE_GET_TAG(obj) == JS_TAG_OBJECT) {
+ p = JS_VALUE_GET_OBJ(obj);
+ switch(p->class_id) {
+ case JS_CLASS_NUMBER:
+ case JS_CLASS_STRING:
+ case JS_CLASS_BOOLEAN:
+ case JS_CLASS_SYMBOL:
+ case JS_CLASS_DATE:
+#ifdef CONFIG_BIGNUM
+ case JS_CLASS_BIG_INT:
+ case JS_CLASS_BIG_FLOAT:
+#endif
+ JS_FreeValue(ctx, p->u.object_data);
+ p->u.object_data = val;
+ return 0;
+ }
+ }
+ JS_FreeValue(ctx, val);
+ if (!JS_IsException(obj))
+ JS_ThrowTypeError(ctx, "invalid object type");
+ return -1;
+}
+
+JSValue JS_NewObjectClass(JSContext *ctx, int class_id)
+{
+ return JS_NewObjectProtoClass(ctx, ctx->class_proto[class_id], class_id);
+}
+
+JSValue JS_NewObjectProto(JSContext *ctx, JSValueConst proto)
+{
+ return JS_NewObjectProtoClass(ctx, proto, JS_CLASS_OBJECT);
+}
+
+JSValue JS_NewArray(JSContext *ctx)
+{
+ return JS_NewObjectFromShape(ctx, js_dup_shape(ctx->array_shape),
+ JS_CLASS_ARRAY);
+}
+
+JSValue JS_NewObject(JSContext *ctx)
+{
+ /* inline JS_NewObjectClass(ctx, JS_CLASS_OBJECT); */
+ return JS_NewObjectProtoClass(ctx, ctx->class_proto[JS_CLASS_OBJECT], JS_CLASS_OBJECT);
+}
+
+static void js_function_set_properties(JSContext *ctx, JSValueConst func_obj,
+ JSValue name, int len)
+{
+ /* ES6 feature non compatible with ES5.1: length is configurable */
+ JS_DefinePropertyValue(ctx, func_obj, JS_ATOM_length, JS_NewInt32(ctx, len),
+ JS_PROP_CONFIGURABLE);
+ if (!JS_IsUndefined(name)) {
+ JS_DefinePropertyValue(ctx, func_obj, JS_ATOM_name, name,
+ JS_PROP_CONFIGURABLE);
+ }
+}
+
+static BOOL js_class_has_bytecode(JSClassID class_id)
+{
+ return (class_id == JS_CLASS_BYTECODE_FUNCTION ||
+ class_id == JS_CLASS_GENERATOR_FUNCTION ||
+ class_id == JS_CLASS_ASYNC_FUNCTION ||
+ class_id == JS_CLASS_ASYNC_GENERATOR_FUNCTION);
+}
+
+/* return NULL without exception if not a function or no bytecode */
+static JSFunctionBytecode *JS_GetFunctionBytecode(JSValueConst val)
+{
+ JSObject *p;
+ if (JS_VALUE_GET_TAG(val) != JS_TAG_OBJECT)
+ return NULL;
+ p = JS_VALUE_GET_OBJ(val);
+ if (!js_class_has_bytecode(p->class_id))
+ return NULL;
+ return p->u.func.function_bytecode;
+}
+
+static void js_method_set_home_object(JSContext *ctx, JSValueConst func_obj,
+ JSValueConst home_obj)
+{
+ JSObject *p, *p1;
+ JSFunctionBytecode *b;
+
+ if (JS_VALUE_GET_TAG(func_obj) != JS_TAG_OBJECT)
+ return;
+ p = JS_VALUE_GET_OBJ(func_obj);
+ if (!js_class_has_bytecode(p->class_id))
+ return;
+ b = p->u.func.function_bytecode;
+ if (b->need_home_object) {
+ p1 = p->u.func.home_object;
+ if (p1) {
+ JS_FreeValue(ctx, JS_MKPTR(JS_TAG_OBJECT, p1));
+ }
+ if (JS_VALUE_GET_TAG(home_obj) == JS_TAG_OBJECT)
+ p1 = JS_VALUE_GET_OBJ(JS_DupValue(ctx, home_obj));
+ else
+ p1 = NULL;
+ p->u.func.home_object = p1;
+ }
+}
+
+static JSValue js_get_function_name(JSContext *ctx, JSAtom name)
+{
+ JSValue name_str;
+
+ name_str = JS_AtomToString(ctx, name);
+ if (JS_AtomSymbolHasDescription(ctx, name)) {
+ name_str = JS_ConcatString3(ctx, "[", name_str, "]");
+ }
+ return name_str;
+}
+
+/* Modify the name of a method according to the atom and
+ 'flags'. 'flags' is a bitmask of JS_PROP_HAS_GET and
+ JS_PROP_HAS_SET. Also set the home object of the method.
+ Return < 0 if exception. */
+static int js_method_set_properties(JSContext *ctx, JSValueConst func_obj,
+ JSAtom name, int flags, JSValueConst home_obj)
+{
+ JSValue name_str;
+
+ name_str = js_get_function_name(ctx, name);
+ if (flags & JS_PROP_HAS_GET) {
+ name_str = JS_ConcatString3(ctx, "get ", name_str, "");
+ } else if (flags & JS_PROP_HAS_SET) {
+ name_str = JS_ConcatString3(ctx, "set ", name_str, "");
+ }
+ if (JS_IsException(name_str))
+ return -1;
+ if (JS_DefinePropertyValue(ctx, func_obj, JS_ATOM_name, name_str,
+ JS_PROP_CONFIGURABLE) < 0)
+ return -1;
+ js_method_set_home_object(ctx, func_obj, home_obj);
+ return 0;
+}
+
+/* Note: at least 'length' arguments will be readable in 'argv' */
+static JSValue JS_NewCFunction3(JSContext *ctx, JSCFunction *func,
+ const char *name,
+ int length, JSCFunctionEnum cproto, int magic,
+ JSValueConst proto_val)
+{
+ JSValue func_obj, name_val;
+ JSObject *p;
+
+ func_obj = JS_NewObjectProtoClass(ctx, proto_val, JS_CLASS_C_FUNCTION);
+ if (JS_IsException(func_obj))
+ return func_obj;
+ p = JS_VALUE_GET_OBJ(func_obj);
+ p->u.cfunc.c_function.generic = func;
+ p->u.cfunc.length = length;
+ p->u.cfunc.cproto = cproto;
+ p->u.cfunc.magic = magic;
+ p->is_constructor = (cproto == JS_CFUNC_constructor ||
+ cproto == JS_CFUNC_constructor_magic ||
+ cproto == JS_CFUNC_constructor_or_func ||
+ cproto == JS_CFUNC_constructor_or_func_magic);
+ if (name)
+ name_val = JS_NewAtomString(ctx, name);
+ else
+ name_val = JS_UNDEFINED;
+ js_function_set_properties(ctx, func_obj, name_val, length);
+ return func_obj;
+}
+
+/* Note: at least 'length' arguments will be readable in 'argv' */
+JSValue JS_NewCFunction2(JSContext *ctx, JSCFunction *func,
+ const char *name,
+ int length, JSCFunctionEnum cproto, int magic)
+{
+ return JS_NewCFunction3(ctx, func, name, length, cproto, magic,
+ ctx->function_proto);
+}
+
+typedef struct JSCFunctionDataRecord {
+ JSCFunctionData *func;
+ uint8_t length;
+ uint8_t data_len;
+ uint16_t magic;
+ JSValue data[0];
+} JSCFunctionDataRecord;
+
+static void js_c_function_data_finalizer(JSRuntime *rt, JSValue val)
+{
+ JSCFunctionDataRecord *s = JS_GetOpaque(val, JS_CLASS_C_FUNCTION_DATA);
+ int i;
+
+ if (s) {
+ for(i = 0; i < s->data_len; i++) {
+ JS_FreeValueRT(rt, s->data[i]);
+ }
+ js_free_rt(rt, s);
+ }
+}
+
+static void js_c_function_data_mark(JSRuntime *rt, JSValueConst val,
+ JS_MarkFunc *mark_func)
+{
+ JSCFunctionDataRecord *s = JS_GetOpaque(val, JS_CLASS_C_FUNCTION_DATA);
+ int i;
+
+ if (s) {
+ for(i = 0; i < s->data_len; i++) {
+ JS_MarkValue(rt, s->data[i], mark_func);
+ }
+ }
+}
+
+static JSValue js_c_function_data_call(JSContext *ctx, JSValueConst func_obj,
+ JSValueConst this_val,
+ int argc, JSValueConst *argv)
+{
+ JSCFunctionDataRecord *s = JS_GetOpaque(func_obj, JS_CLASS_C_FUNCTION_DATA);
+ JSValueConst *arg_buf;
+ int i;
+
+ /* XXX: could add the function on the stack for debug */
+ if (unlikely(argc < s->length)) {
+ arg_buf = alloca(sizeof(arg_buf[0]) * s->length);
+ for(i = 0; i < argc; i++)
+ arg_buf[i] = argv[i];
+ for(i = argc; i < s->length; i++)
+ arg_buf[i] = JS_UNDEFINED;
+ } else {
+ arg_buf = argv;
+ }
+
+ return s->func(ctx, this_val, argc, arg_buf, s->magic, s->data);
+}
+
+JSValue JS_NewCFunctionData(JSContext *ctx, JSCFunctionData *func,
+ int length, int magic, int data_len,
+ JSValueConst *data)
+{
+ JSCFunctionDataRecord *s;
+ JSValue func_obj;
+ int i;
+
+ func_obj = JS_NewObjectProtoClass(ctx, ctx->function_proto,
+ JS_CLASS_C_FUNCTION_DATA);
+ if (JS_IsException(func_obj))
+ return func_obj;
+ s = js_malloc(ctx, sizeof(*s) + data_len * sizeof(JSValue));
+ if (!s) {
+ JS_FreeValue(ctx, func_obj);
+ return JS_EXCEPTION;
+ }
+ s->func = func;
+ s->length = length;
+ s->data_len = data_len;
+ s->magic = magic;
+ for(i = 0; i < data_len; i++)
+ s->data[i] = JS_DupValue(ctx, data[i]);
+ JS_SetOpaque(func_obj, s);
+ js_function_set_properties(ctx, func_obj, JS_UNDEFINED, length);
+ return func_obj;
+}
+
+static void free_property(JSRuntime *rt, JSProperty *pr, int prop_flags)
+{
+ if (unlikely(prop_flags & JS_PROP_TMASK)) {
+ if ((prop_flags & JS_PROP_TMASK) == JS_PROP_GETSET) {
+ if (pr->u.getset.getter)
+ JS_FreeValueRT(rt, JS_MKPTR(JS_TAG_OBJECT, pr->u.getset.getter));
+ if (pr->u.getset.setter)
+ JS_FreeValueRT(rt, JS_MKPTR(JS_TAG_OBJECT, pr->u.getset.setter));
+ } else if ((prop_flags & JS_PROP_TMASK) == JS_PROP_VARREF) {
+ free_var_ref(rt, pr->u.var_ref);
+ } else if ((prop_flags & JS_PROP_TMASK) == JS_PROP_AUTOINIT) {
+ /* nothing to do */
+ }
+ } else {
+ JS_FreeValueRT(rt, pr->u.value);
+ }
+}
+
+static force_inline JSShapeProperty *find_own_property1(JSObject *p,
+ JSAtom atom)
+{
+ JSShape *sh;
+ JSShapeProperty *pr, *prop;
+ intptr_t h;
+ sh = p->shape;
+ h = (uintptr_t)atom & sh->prop_hash_mask;
+ h = prop_hash_end_field_of_shape(sh)[-h - 1];
+ prop = get_shape_prop(sh);
+ while (h) {
+ pr = &prop[h - 1];
+ if (likely(pr->atom == atom)) {
+ return pr;
+ }
+ h = pr->hash_next;
+ }
+ return NULL;
+}
+
+static force_inline JSShapeProperty *find_own_property(JSProperty **ppr,
+ JSObject *p,
+ JSAtom atom)
+{
+ JSShape *sh;
+ JSShapeProperty *pr, *prop;
+ intptr_t h;
+ sh = p->shape;
+ h = (uintptr_t)atom & sh->prop_hash_mask;
+ h = prop_hash_end_field_of_shape(sh)[-h - 1];
+ prop = get_shape_prop(sh);
+ while (h) {
+ pr = &prop[h - 1];
+ if (likely(pr->atom == atom)) {
+ *ppr = &p->prop[h - 1];
+ /* the compiler should be able to assume that pr != NULL here */
+ return pr;
+ }
+ h = pr->hash_next;
+ }
+ *ppr = NULL;
+ return NULL;
+}
+
+/* indicate that the object may be part of a function prototype cycle */
+static void set_cycle_flag(JSContext *ctx, JSValueConst obj)
+{
+}
+
+static void free_var_ref(JSRuntime *rt, JSVarRef *var_ref)
+{
+ if (var_ref) {
+ assert(var_ref->header.ref_count > 0);
+ if (--var_ref->header.ref_count == 0) {
+ if (var_ref->link.prev != NULL) {
+ list_del(&var_ref->link); /* still on the stack */
+ } else {
+ JS_FreeValueRT(rt, var_ref->value);
+ }
+ js_free_rt(rt, var_ref);
+ }
+ }
+}
+
+static void js_array_finalizer(JSRuntime *rt, JSValue val)
+{
+ JSObject *p = JS_VALUE_GET_OBJ(val);
+ int i;
+
+ for(i = 0; i < p->u.array.count; i++) {
+ JS_FreeValueRT(rt, p->u.array.u.values[i]);
+ }
+ js_free_rt(rt, p->u.array.u.values);
+}
+
+static void js_array_mark(JSRuntime *rt, JSValueConst val,
+ JS_MarkFunc *mark_func)
+{
+ JSObject *p = JS_VALUE_GET_OBJ(val);
+ int i;
+
+ for(i = 0; i < p->u.array.count; i++) {
+ JS_MarkValue(rt, p->u.array.u.values[i], mark_func);
+ }
+}
+
+static void js_object_data_finalizer(JSRuntime *rt, JSValue val)
+{
+ JSObject *p = JS_VALUE_GET_OBJ(val);
+ JS_FreeValueRT(rt, p->u.object_data);
+ p->u.object_data = JS_UNDEFINED;
+}
+
+static void js_object_data_mark(JSRuntime *rt, JSValueConst val,
+ JS_MarkFunc *mark_func)
+{
+ JSObject *p = JS_VALUE_GET_OBJ(val);
+ JS_MarkValue(rt, p->u.object_data, mark_func);
+}
+
+static void js_bytecode_function_finalizer(JSRuntime *rt, JSValue val)
+{
+ JSObject *p1, *p = JS_VALUE_GET_OBJ(val);
+ JSFunctionBytecode *b;
+ JSVarRef **var_refs;
+ int i;
+
+ p1 = p->u.func.home_object;
+ if (p1) {
+ JS_FreeValueRT(rt, JS_MKPTR(JS_TAG_OBJECT, p1));
+ }
+ b = p->u.func.function_bytecode;
+ if (b) {
+ var_refs = p->u.func.var_refs;
+ if (var_refs) {
+ for(i = 0; i < b->closure_var_count; i++)
+ free_var_ref(rt, var_refs[i]);
+ js_free_rt(rt, var_refs);
+ }
+ JS_FreeValueRT(rt, JS_MKPTR(JS_TAG_FUNCTION_BYTECODE, b));
+ }
+}
+
+static void js_bytecode_function_mark(JSRuntime *rt, JSValueConst val,
+ JS_MarkFunc *mark_func)
+{
+ JSObject *p = JS_VALUE_GET_OBJ(val);
+ JSVarRef **var_refs = p->u.func.var_refs;
+ JSFunctionBytecode *b = p->u.func.function_bytecode;
+ int i;
+
+ if (p->u.func.home_object) {
+ JS_MarkValue(rt, JS_MKPTR(JS_TAG_OBJECT, p->u.func.home_object),
+ mark_func);
+ }
+ if (b) {
+ if (var_refs) {
+ for(i = 0; i < b->closure_var_count; i++) {
+ JSVarRef *var_ref = var_refs[i];
+ if (var_ref) {
+ JS_MarkValue(rt, JS_MKPTR(JS_TAG_VAR_REF, var_ref),
+ mark_func);
+ }
+ }
+ }
+ /* must mark the function bytecode because template objects may be
+ part of a cycle */
+ JS_MarkValue(rt, JS_MKPTR(JS_TAG_FUNCTION_BYTECODE, b), mark_func);
+ }
+}
+
+static void js_bound_function_finalizer(JSRuntime *rt, JSValue val)
+{
+ JSObject *p = JS_VALUE_GET_OBJ(val);
+ JSBoundFunction *bf = p->u.bound_function;
+ int i;
+
+ JS_FreeValueRT(rt, bf->func_obj);
+ JS_FreeValueRT(rt, bf->this_val);
+ for(i = 0; i < bf->argc; i++) {
+ JS_FreeValueRT(rt, bf->argv[i]);
+ }
+ js_free_rt(rt, bf);
+}
+
+static void js_bound_function_mark(JSRuntime *rt, JSValueConst val,
+ JS_MarkFunc *mark_func)
+{
+ JSObject *p = JS_VALUE_GET_OBJ(val);
+ JSBoundFunction *bf = p->u.bound_function;
+ int i;
+
+ JS_MarkValue(rt, bf->func_obj, mark_func);
+ JS_MarkValue(rt, bf->this_val, mark_func);
+ for(i = 0; i < bf->argc; i++)
+ JS_MarkValue(rt, bf->argv[i], mark_func);
+}
+
+static void js_for_in_iterator_finalizer(JSRuntime *rt, JSValue val)
+{
+ JSObject *p = JS_VALUE_GET_OBJ(val);
+ JSForInIterator *it = p->u.for_in_iterator;
+ JS_FreeValueRT(rt, it->obj);
+ js_free_rt(rt, it);
+}
+
+static void js_for_in_iterator_mark(JSRuntime *rt, JSValueConst val,
+ JS_MarkFunc *mark_func)
+{
+ JSObject *p = JS_VALUE_GET_OBJ(val);
+ JSForInIterator *it = p->u.for_in_iterator;
+ JS_MarkValue(rt, it->obj, mark_func);
+}
+
+static void free_object_struct(JSRuntime *rt, JSObject *p)
+{
+ int i;
+ JSClassFinalizer *finalizer;
+ JSShape *sh;
+ JSShapeProperty *pr;
+
+ /* free all the fields */
+ sh = p->shape;
+ pr = get_shape_prop(sh);
+ for(i = 0; i < sh->prop_count; i++) {
+ free_property(rt, &p->prop[i], pr->flags);
+ pr++;
+ }
+ js_free_rt(rt, p->prop);
+ js_free_shape(rt, sh);
+
+ /* fail safe */
+ p->shape = NULL;
+ p->prop = NULL;
+
+ if (unlikely(p->first_weak_ref)) {
+ reset_weak_ref(rt, p);
+ }
+
+ finalizer = rt->class_array[p->class_id].finalizer;
+ if (finalizer)
+ (*finalizer)(rt, JS_MKPTR(JS_TAG_OBJECT, p));
+
+ /* fail safe */
+ p->class_id = 0;
+ p->u.opaque = NULL;
+ p->u.func.var_refs = NULL;
+ p->u.func.home_object = NULL;
+}
+
+static void free_object2(JSRuntime *rt, JSObject *p)
+{
+ if (p->free_mark) {
+ /* already freed (happen when freeing cycles) */
+ return;
+ }
+ /* indicate that the object is being freed */
+ p->free_mark = 1;
+
+ free_object_struct(rt, p);
+
+ /* remove from the global object list */
+ list_del(&p->link);
+ if (rt->in_gc_sweep) {
+ list_add_tail(&p->link, &rt->free_obj_list);
+ } else {
+ js_free_rt(rt, p);
+ }
+}
+
+static void free_object(JSRuntime *rt, JSObject *p)
+{
+ assert(p->header.ref_count == 0);
+ if (!rt->in_gc_sweep)
+ free_object2(rt, p);
+}
+
+/* called with the ref_count of 'v' reaches zero. */
+void __JS_FreeValueRT(JSRuntime *rt, JSValue v)
+{
+ uint32_t tag = JS_VALUE_GET_TAG(v);
+
+#ifdef DUMP_FREE
+ {
+ printf("Freeing ");
+ if (tag == JS_TAG_OBJECT) {
+ JS_DumpObject(rt, JS_VALUE_GET_OBJ(v));
+ } else {
+ JS_DumpValueShort(rt, v);
+ printf("\n");
+ }
+ }
+#endif
+
+ switch(tag) {
+ case JS_TAG_STRING:
+ {
+ JSString *p = JS_VALUE_GET_STRING(v);
+ if (p->atom_type) {
+ JS_FreeAtomStruct(rt, p);
+ } else {
+#ifdef DUMP_LEAKS
+ list_del(&p->link);
+#endif
+ js_free_rt(rt, p);
+ }
+ }
+ break;
+ case JS_TAG_OBJECT:
+ free_object(rt, JS_VALUE_GET_OBJ(v));
+ break;
+ case JS_TAG_FUNCTION_BYTECODE:
+ free_function_bytecode(rt, JS_VALUE_GET_PTR(v));
+ break;
+ case JS_TAG_SHAPE:
+ case JS_TAG_ASYNC_FUNCTION:
+ case JS_TAG_VAR_REF:
+ case JS_TAG_MODULE:
+ abort(); /* never freed here */
+ break;
+#ifdef CONFIG_BIGNUM
+ case JS_TAG_BIG_INT:
+ case JS_TAG_BIG_FLOAT:
+ {
+ JSBigFloat *bf = JS_VALUE_GET_PTR(v);
+ bf_delete(&bf->num);
+ js_free_rt(rt, bf);
+ }
+ break;
+#endif
+ case JS_TAG_SYMBOL:
+ {
+ JSAtomStruct *p = JS_VALUE_GET_PTR(v);
+ JS_FreeAtomStruct(rt, p);
+ }
+ break;
+ default:
+ printf("__JS_FreeValue: unknown tag=%d\n", tag);
+ abort();
+ }
+}
+
+void __JS_FreeValue(JSContext *ctx, JSValue v)
+{
+ __JS_FreeValueRT(ctx->rt, v);
+}
+
+/* garbage collection */
+
+static BOOL has_children(JSValueConst val)
+{
+ switch(JS_VALUE_GET_TAG(val)) {
+ case JS_TAG_VAR_REF:
+ case JS_TAG_OBJECT:
+ case JS_TAG_FUNCTION_BYTECODE:
+ case JS_TAG_ASYNC_FUNCTION:
+ case JS_TAG_SHAPE:
+ return TRUE;
+ default:
+ return FALSE;
+ }
+}
+
+void JS_MarkValue(JSRuntime *rt, JSValueConst val, JS_MarkFunc *mark_func)
+{
+ if (JS_VALUE_HAS_REF_COUNT(val) && has_children(val)) {
+ mark_func(rt, val);
+ }
+}
+
+static void mark_children(JSRuntime *rt, JSValueConst val, JS_MarkFunc *mark_func)
+{
+ switch(JS_VALUE_GET_TAG(val)) {
+ case JS_TAG_OBJECT:
+ {
+ JSObject *p = JS_VALUE_GET_OBJ(val);
+ JSShapeProperty *prs;
+ JSShape *sh;
+ int i;
+ sh = p->shape;
+ mark_func(rt, JS_MKPTR(JS_TAG_SHAPE, sh));
+ /* mark all the fields */
+ prs = get_shape_prop(sh);
+ for(i = 0; i < sh->prop_count; i++) {
+ JSProperty *pr = &p->prop[i];
+ if (prs->atom != JS_ATOM_NULL) {
+ if (prs->flags & JS_PROP_TMASK) {
+ if ((prs->flags & JS_PROP_TMASK) == JS_PROP_GETSET) {
+ if (pr->u.getset.getter)
+ mark_func(rt, JS_MKPTR(JS_TAG_OBJECT, pr->u.getset.getter));
+ if (pr->u.getset.setter)
+ mark_func(rt, JS_MKPTR(JS_TAG_OBJECT, pr->u.getset.setter));
+ } else if ((prs->flags & JS_PROP_TMASK) == JS_PROP_VARREF) {
+ JS_MarkValue(rt, JS_MKPTR(JS_TAG_VAR_REF, pr->u.var_ref), mark_func);
+ } else if ((prs->flags & JS_PROP_TMASK) == JS_PROP_AUTOINIT) {
+ /* nothing to do */
+ }
+ } else {
+ JS_MarkValue(rt, pr->u.value, mark_func);
+ }
+ }
+ prs++;
+ }
+
+ if (p->class_id != JS_CLASS_OBJECT) {
+ JSClassGCMark *gc_mark;
+ gc_mark = rt->class_array[p->class_id].gc_mark;
+ if (gc_mark)
+ gc_mark(rt, JS_MKPTR(JS_TAG_OBJECT, p), mark_func);
+ }
+ }
+ break;
+ case JS_TAG_FUNCTION_BYTECODE:
+ /* the template objects can be part of a cycle */
+ {
+ JSFunctionBytecode *b = JS_VALUE_GET_PTR(val);
+ int i;
+ for(i = 0; i < b->cpool_count; i++) {
+ JS_MarkValue(rt, b->cpool[i], mark_func);
+ }
+ }
+ break;
+ case JS_TAG_VAR_REF:
+ {
+ JSVarRef *var_ref = JS_VALUE_GET_PTR(val);
+ /* the refcount of stack values is not incremented, hence
+ the test */
+ if (var_ref->link.prev == NULL) {
+ JS_MarkValue(rt, *var_ref->pvalue, mark_func);
+ }
+ }
+ break;
+ case JS_TAG_ASYNC_FUNCTION:
+ {
+ JSAsyncFunctionData *s = JS_VALUE_GET_PTR(val);
+ if (s->is_active)
+ async_func_mark(rt, &s->func_state, mark_func);
+ JS_MarkValue(rt, s->resolving_funcs[0], mark_func);
+ JS_MarkValue(rt, s->resolving_funcs[1], mark_func);
+ }
+ break;
+ case JS_TAG_SHAPE:
+ {
+ JSShape *sh = JS_VALUE_GET_PTR(val);
+ if (sh->proto != NULL) {
+ mark_func(rt, JS_MKPTR(JS_TAG_OBJECT, sh->proto));
+ }
+ }
+ break;
+ default:
+ /* no children */
+ break;
+ }
+}
+
+#if 0
+/* not useful until realms are supported */
+static void mark_context(JSRuntime *rt, JSContext *ctx)
+{
+ int i;
+ struct list_head *el;
+
+ list_for_each(el, &ctx->loaded_modules) {
+ JSModuleDef *m = list_entry(el, JSModuleDef, link);
+ JS_MarkValue(rt, m->module_ns);
+ JS_MarkValue(rt, m->func_obj);
+ }
+
+ JS_MarkValue(rt, ctx->current_exception);
+
+ for(i = 0; i < rt->class_count; i++)
+ JS_MarkValue(rt, ctx->class_proto[i]);
+ JS_MarkValue(rt, ctx->regexp_ctor);
+ JS_MarkValue(rt, ctx->function_ctor);
+ JS_MarkValue(rt, ctx->function_proto);
+ JS_MarkValue(rt, ctx->iterator_proto);
+ JS_MarkValue(rt, ctx->async_iterator_proto);
+ JS_MarkValue(rt, ctx->array_proto_values);
+
+ for(i = 0; i < JS_NATIVE_ERROR_COUNT; i++)
+ JS_MarkValue(rt, ctx->native_error_proto[i]);
+
+ JS_MarkValue(rt, ctx->throw_type_error);
+ JS_MarkValue(rt, ctx->global_obj);
+ JS_MarkValue(rt, ctx->global_var_obj);
+}
+#endif
+
+/* 1 = possible member of a cycle
+ 2 = member of a cycle
+*/
+
+static void gc_decref_mark(JSRuntime *rt, JSValueConst obj);
+
+//#define DUMP_GC_DECREF
+
+#ifdef DUMP_GC_DECREF
+static int decref_indent;
+#endif
+
+static void gc_decref_child(JSRuntime *rt, JSValueConst obj)
+{
+ JSObject *p = JS_VALUE_GET_OBJ(obj);
+
+#ifdef DUMP_LEAKS
+#ifdef DUMP_GC_DECREF
+ {
+ int i;
+ for(i = 0; i < decref_indent; i++)
+ printf(" ");
+ if (JS_IsObject(obj)) {
+ JS_DumpObject(rt, p);
+ } else {
+ JS_DumpValueShort(rt, obj); printf("\n");
+ }
+ }
+#endif
+ if (p->header.ref_count <= 0) {
+ printf("%p: invalid refcount (%d)\n", p, p->header.ref_count);
+ if (JS_IsObject(obj)) {
+ JS_DumpObject(rt, p);
+ } else {
+ JS_DumpValueShort(rt, obj);
+ }
+ }
+#endif
+ assert(p->header.ref_count > 0);
+ p->header.ref_count--;
+ gc_decref_mark(rt, obj);
+}
+
+static void gc_decref_mark(JSRuntime *rt, JSValueConst obj)
+{
+ JSObject *p = JS_VALUE_GET_OBJ(obj);
+ if (p->gc_header.mark == 0) {
+ p->gc_header.mark = 1;
+#ifdef DUMP_GC_DECREF
+ decref_indent++;
+#endif
+ mark_children(rt, obj, gc_decref_child);
+#ifdef DUMP_GC_DECREF
+ decref_indent--;
+#endif
+ }
+}
+
+static void gc_decref(JSRuntime *rt)
+{
+ struct list_head *el;
+ JSObject *p;
+
+ list_for_each(el, &rt->obj_list) {
+ p = list_entry(el, JSObject, link);
+ gc_decref_mark(rt, JS_MKPTR(JS_TAG_OBJECT, p));
+ }
+}
+
+static void gc_scan_incref(JSRuntime *rt, JSValueConst obj);
+
+static void gc_scan_incref_child(JSRuntime *rt, JSValueConst obj)
+{
+ JSObject *p = JS_VALUE_GET_OBJ(obj);
+ p->header.ref_count++;
+ if (p->gc_header.mark != 0) {
+ gc_scan_incref(rt, obj);
+ }
+}
+
+static void gc_scan_incref(JSRuntime *rt, JSValueConst obj)
+{
+ JSObject *p = JS_VALUE_GET_OBJ(obj);
+ p->gc_header.mark = 0; /* not freed */
+ if (JS_IsObject(obj)) {
+ /* remove the tmp_obj_list and update the next object to
+ explore */
+ if (rt->el_next == &p->link)
+ rt->el_next = rt->el_next->next;
+ /* add to rt->obj_list */
+ list_del(&p->link);
+ list_add_tail(&p->link, &rt->obj_list);
+ }
+ mark_children(rt, obj, gc_scan_incref_child);
+}
+
+static void gc_scan_obj(JSRuntime *rt, JSValueConst obj)
+{
+ JSObject *p = JS_VALUE_GET_OBJ(obj);
+ if (p->gc_header.mark == 1) {
+ if (p->header.ref_count > 0) {
+ gc_scan_incref(rt, obj);
+ } else {
+ p->gc_header.mark = 2;
+ mark_children(rt, obj, gc_scan_obj);
+ }
+ }
+}
+
+static void gc_scan_obj2(JSRuntime *rt, JSValueConst obj);
+
+static void gc_scan_incref_child2(JSRuntime *rt, JSValueConst obj)
+{
+ JSObject *p = JS_VALUE_GET_OBJ(obj);
+ p->header.ref_count++;
+ gc_scan_obj2(rt, obj);
+}
+
+static void gc_scan_obj2(JSRuntime *rt, JSValueConst obj)
+{
+ JSObject *p = JS_VALUE_GET_OBJ(obj);
+ if (p->gc_header.mark == 2) {
+ p->gc_header.mark = 3;
+ mark_children(rt, obj, gc_scan_incref_child2);
+ }
+}
+
+static void gc_scan(JSRuntime *rt)
+{
+ struct list_head *el;
+ JSObject *p;
+
+ /* move obj_list to tmp_obj_list */
+ list_add(&rt->tmp_obj_list, &rt->obj_list);
+ list_del(&rt->obj_list);
+ init_list_head(&rt->obj_list);
+
+ /* keep the objects with a refcount > 0 and their children. After
+ this pass, obj_list contains the objects to be deleted. Their
+ mark is 2. */
+ for(el = rt->tmp_obj_list.next; el != &rt->tmp_obj_list;
+ el = rt->el_next) {
+ rt->el_next = el->next; /* may be modified by gc_scan_obj() */
+ p = list_entry(el, JSObject, link);
+ gc_scan_obj(rt, JS_MKPTR(JS_TAG_OBJECT, p));
+ }
+
+ /* restore the refcount of the objects to be deleted. After this
+ pass, their mark is 3 */
+ list_for_each(el, &rt->tmp_obj_list) {
+ p = list_entry(el, JSObject, link);
+ gc_scan_obj2(rt, JS_MKPTR(JS_TAG_OBJECT, p));
+ }
+}
+
+static void gc_free_cycles(JSRuntime *rt)
+{
+ struct list_head *el, *el1;
+ JSObject *p;
+#ifdef DUMP_GC_FREE
+ BOOL header_done = FALSE;
+#endif
+ init_list_head(&rt->free_obj_list);
+ rt->in_gc_sweep = TRUE;
+ list_for_each_safe(el, el1, &rt->tmp_obj_list) {
+ p = list_entry(el, JSObject, link);
+ assert(p->gc_header.mark == 3);
+#ifdef DUMP_GC_FREE
+ if (!header_done) {
+ printf("Freeing cycles:\n");
+ JS_DumpObjectHeader(rt);
+ header_done = TRUE;
+ }
+ JS_DumpObject(rt, p);
+#endif
+ free_object2(rt, p);
+ }
+ rt->in_gc_sweep = FALSE;
+
+ /* free all the object structures */
+ list_for_each_safe(el, el1, &rt->free_obj_list) {
+ p = list_entry(el, JSObject, link);
+ js_free_rt(rt, p);
+ }
+}
+
+void JS_RunGC(JSRuntime *rt)
+{
+ /* decrement the reference of the children of each object. mark =
+ 1 after this pass. */
+ gc_decref(rt);
+
+ /* keep objects with a non zero refcount and their childs */
+ gc_scan(rt);
+
+ /* free the objects with a zero refcount */
+ gc_free_cycles(rt);
+}
+
+/* Return false if not an object or if the object has already been
+ freed (zombie objects are visible in finalizers when freeing
+ cycles). */
+BOOL JS_IsLiveObject(JSRuntime *rt, JSValueConst obj)
+{
+ JSObject *p;
+ if (!JS_IsObject(obj))
+ return FALSE;
+ p = JS_VALUE_GET_OBJ(obj);
+ return !p->free_mark;
+}
+
+/* Return true during the GC sweep phase (can be useful inside in finalizer) */
+BOOL JS_IsInGCSweep(JSRuntime *rt)
+{
+ return rt->in_gc_sweep;
+}
+
+/* Compute memory used by various object types */
+/* XXX: poor man's approach to handling multiply referenced objects */
+typedef struct JSMemoryUsage_helper {
+ double memory_used_count;
+ double str_count;
+ double str_size;
+ double js_func_count;
+ double js_func_size;
+ double js_func_code_size;
+ double js_func_pc2line_count;
+ double js_func_pc2line_size;
+} JSMemoryUsage_helper;
+
+static void compute_value_size(JSValueConst val, JSMemoryUsage_helper *hp);
+
+static void compute_jsstring_size(JSString *str, JSMemoryUsage_helper *hp)
+{
+ if (!str->atom_type) { /* atoms are handled separately */
+ double s_ref_count = str->header.ref_count;
+ hp->str_count += 1 / s_ref_count;
+ hp->str_size += ((sizeof(*str) + (str->len << str->is_wide_char) +
+ 1 - str->is_wide_char) / s_ref_count);
+ }
+}
+
+static void compute_bytecode_size(JSFunctionBytecode *b, JSMemoryUsage_helper *hp)
+{
+ int memory_used_count, js_func_size, i;
+ double ref_count = b->header.ref_count;
+
+ memory_used_count = 0;
+ js_func_size = offsetof(JSFunctionBytecode, debug);
+ if (b->vardefs) {
+ js_func_size += (b->arg_count + b->var_count) * sizeof(*b->vardefs);
+ }
+ if (b->cpool) {
+ js_func_size += b->cpool_count * sizeof(*b->cpool);
+ for (i = 0; i < b->cpool_count; i++) {
+ JSValueConst val = b->cpool[i];
+ compute_value_size(val, hp);
+ }
+ }
+ if (b->closure_var) {
+ js_func_size += b->closure_var_count * sizeof(*b->closure_var);
+ }
+ if (!b->read_only_bytecode && b->byte_code_buf) {
+ hp->js_func_code_size += b->byte_code_len / ref_count;
+ }
+ if (b->has_debug) {
+ js_func_size += sizeof(*b) - offsetof(JSFunctionBytecode, debug);
+ if (b->debug.source) {
+ memory_used_count++;
+ js_func_size += b->debug.source_len + 1;
+ }
+ if (b->debug.pc2line_len) {
+ memory_used_count++;
+ hp->js_func_pc2line_count += 1 / ref_count;
+ hp->js_func_pc2line_size += b->debug.pc2line_len / ref_count;
+ }
+ }
+ hp->js_func_size += js_func_size / ref_count;
+ hp->js_func_count += 1 / ref_count;
+ hp->memory_used_count += memory_used_count / ref_count;
+}
+
+static void compute_value_size(JSValueConst val, JSMemoryUsage_helper *hp)
+{
+ switch(JS_VALUE_GET_TAG(val)) {
+ case JS_TAG_STRING:
+ compute_jsstring_size(JS_VALUE_GET_STRING(val), hp);
+ break;
+ case JS_TAG_FUNCTION_BYTECODE:
+ compute_bytecode_size(JS_VALUE_GET_PTR(val), hp);
+ break;
+#ifdef CONFIG_BIGNUM
+ case JS_TAG_BIG_INT:
+ case JS_TAG_BIG_FLOAT:
+ /* should track JSBigFloat usage */
+ break;
+#endif
+ }
+}
+
+void JS_ComputeMemoryUsage(JSRuntime *rt, JSMemoryUsage *s)
+{
+ struct list_head *el, *el1;
+ int i;
+ JSMemoryUsage_helper mem = { 0 }, *hp = &mem;
+
+ memset(s, 0, sizeof(*s));
+ s->malloc_count = rt->malloc_state.malloc_count;
+ s->malloc_size = rt->malloc_state.malloc_size;
+ s->malloc_limit = rt->malloc_state.malloc_limit;
+
+ s->memory_used_count = 2; /* rt + rt->class_array */
+ s->memory_used_size = sizeof(JSRuntime) + sizeof(JSValue) * rt->class_count;
+
+ list_for_each(el, &rt->context_list) {
+ JSContext *ctx = list_entry(el, JSContext, link);
+ JSShape *sh = ctx->array_shape;
+ s->memory_used_count += 2; /* ctx + ctx->class_proto */
+ s->memory_used_size += sizeof(JSContext) +
+ sizeof(JSValue) * rt->class_count;
+ s->binary_object_count += ctx->binary_object_count;
+ s->binary_object_size += ctx->binary_object_size;
+
+ /* the hashed shapes are counted separately */
+ if (sh && !sh->is_hashed) {
+ int hash_size = sh->prop_hash_mask + 1;
+ s->shape_count++;
+ s->shape_size += get_shape_size(hash_size, sh->prop_size);
+ }
+ list_for_each(el1, &ctx->loaded_modules) {
+ JSModuleDef *m = list_entry(el1, JSModuleDef, link);
+ s->memory_used_count += 1;
+ s->memory_used_size += sizeof(*m);
+ if (m->req_module_entries) {
+ s->memory_used_count += 1;
+ s->memory_used_size += m->req_module_entries_count * sizeof(*m->req_module_entries);
+ }
+ if (m->export_entries) {
+ s->memory_used_count += 1;
+ s->memory_used_size += m->export_entries_count * sizeof(*m->export_entries);
+ for (i = 0; i < m->export_entries_count; i++) {
+ JSExportEntry *me = &m->export_entries[i];
+ if (me->export_type == JS_EXPORT_TYPE_LOCAL && me->u.local.var_ref) {
+ /* potential multiple count */
+ s->memory_used_count += 1;
+ compute_value_size(me->u.local.var_ref->value, hp);
+ }
+ }
+ }
+ if (m->star_export_entries) {
+ s->memory_used_count += 1;
+ s->memory_used_size += m->star_export_entries_count * sizeof(*m->star_export_entries);
+ }
+ if (m->import_entries) {
+ s->memory_used_count += 1;
+ s->memory_used_size += m->import_entries_count * sizeof(*m->import_entries);
+ }
+ compute_value_size(m->module_ns, hp);
+ compute_value_size(m->func_obj, hp);
+ }
+ }
+
+ list_for_each(el, &rt->obj_list) {
+ JSObject *p = list_entry(el, JSObject, link);
+ JSShape *sh = p->shape;
+ JSShapeProperty *prs;
+ s->obj_count++;
+ if (p->prop) {
+ s->memory_used_count++;
+ s->prop_size += sh->prop_size * sizeof(*p->prop);
+ s->prop_count += sh->prop_count;
+ prs = get_shape_prop(sh);
+ for(i = 0; i < sh->prop_count; i++) {
+ JSProperty *pr = &p->prop[i];
+ if (prs->atom != JS_ATOM_NULL && !(prs->flags & JS_PROP_TMASK)) {
+ compute_value_size(pr->u.value, hp);
+ }
+ prs++;
+ }
+ }
+ /* the hashed shapes are counted separately */
+ if (!sh->is_hashed) {
+ int hash_size = sh->prop_hash_mask + 1;
+ s->shape_count++;
+ s->shape_size += get_shape_size(hash_size, sh->prop_size);
+ }
+
+ switch(p->class_id) {
+ case JS_CLASS_ARRAY: /* u.array | length */
+ case JS_CLASS_ARGUMENTS: /* u.array | length */
+ s->array_count++;
+ if (p->fast_array) {
+ s->fast_array_count++;
+ if (p->u.array.u.values) {
+ s->memory_used_count++;
+ s->memory_used_size += p->u.array.count *
+ sizeof(*p->u.array.u.values);
+ s->fast_array_elements += p->u.array.count;
+ for (i = 0; i < p->u.array.count; i++) {
+ compute_value_size(p->u.array.u.values[i], hp);
+ }
+ }
+ }
+ break;
+ case JS_CLASS_NUMBER: /* u.object_data */
+ case JS_CLASS_STRING: /* u.object_data */
+ case JS_CLASS_BOOLEAN: /* u.object_data */
+ case JS_CLASS_SYMBOL: /* u.object_data */
+ case JS_CLASS_DATE: /* u.object_data */
+#ifdef CONFIG_BIGNUM
+ case JS_CLASS_BIG_INT: /* u.object_data */
+ case JS_CLASS_BIG_FLOAT: /* u.object_data */
+#endif
+ compute_value_size(p->u.object_data, hp);
+ break;
+ case JS_CLASS_C_FUNCTION: /* u.cfunc */
+ s->c_func_count++;
+ break;
+ case JS_CLASS_BYTECODE_FUNCTION: /* u.func */
+ {
+ JSFunctionBytecode *b = p->u.func.function_bytecode;
+ JSVarRef **var_refs = p->u.func.var_refs;
+ /* home_object: object will be accounted for in list scan */
+ if (var_refs) {
+ s->memory_used_count++;
+ s->js_func_size += b->closure_var_count * sizeof(*var_refs);
+ for (i = 0; i < b->closure_var_count; i++) {
+ if (var_refs[i]) {
+ double ref_count = var_refs[i]->header.ref_count;
+ s->memory_used_count += 1 / ref_count;
+ s->js_func_size += sizeof(*var_refs[i]) / ref_count;
+ /* handle non object closed values */
+ if (var_refs[i]->pvalue == &var_refs[i]->value) {
+ /* potential multiple count */
+ compute_value_size(var_refs[i]->value, hp);
+ }
+ }
+ }
+ }
+ compute_bytecode_size(b, hp);
+ }
+ break;
+ case JS_CLASS_BOUND_FUNCTION: /* u.bound_function */
+ {
+ JSBoundFunction *bf = p->u.bound_function;
+ /* func_obj and this_val are objects */
+ for (i = 0; i < bf->argc; i++) {
+ compute_value_size(bf->argv[i], hp);
+ }
+ s->memory_used_count += 1;
+ s->memory_used_size += sizeof(*bf) + bf->argc * sizeof(*bf->argv);
+ }
+ break;
+ case JS_CLASS_C_FUNCTION_DATA: /* u.c_function_data_record */
+ {
+ JSCFunctionDataRecord *fd = p->u.c_function_data_record;
+ if (fd) {
+ for (i = 0; i < fd->data_len; i++) {
+ compute_value_size(fd->data[i], hp);
+ }
+ s->memory_used_count += 1;
+ s->memory_used_size += sizeof(*fd) + fd->data_len * sizeof(*fd->data);
+ }
+ }
+ break;
+ case JS_CLASS_REGEXP: /* u.regexp */
+ compute_jsstring_size(p->u.regexp.pattern, hp);
+ compute_jsstring_size(p->u.regexp.bytecode, hp);
+ break;
+
+ case JS_CLASS_FOR_IN_ITERATOR: /* u.for_in_iterator */
+ {
+ JSForInIterator *it = p->u.for_in_iterator;
+ if (it) {
+ compute_value_size(it->obj, hp);
+ s->memory_used_count += 1;
+ s->memory_used_size += sizeof(*it);
+ }
+ }
+ break;
+ case JS_CLASS_ARRAY_BUFFER: /* u.array_buffer */
+ case JS_CLASS_SHARED_ARRAY_BUFFER: /* u.array_buffer */
+ {
+ JSArrayBuffer *abuf = p->u.array_buffer;
+ if (abuf) {
+ s->memory_used_count += 1;
+ s->memory_used_size += sizeof(*abuf);
+ if (abuf->data) {
+ s->memory_used_count += 1;
+ s->memory_used_size += abuf->byte_length;
+ }
+ }
+ }
+ break;
+ case JS_CLASS_GENERATOR: /* u.generator_data */
+ case JS_CLASS_UINT8C_ARRAY: /* u.typed_array / u.array */
+ case JS_CLASS_INT8_ARRAY: /* u.typed_array / u.array */
+ case JS_CLASS_UINT8_ARRAY: /* u.typed_array / u.array */
+ case JS_CLASS_INT16_ARRAY: /* u.typed_array / u.array */
+ case JS_CLASS_UINT16_ARRAY: /* u.typed_array / u.array */
+ case JS_CLASS_INT32_ARRAY: /* u.typed_array / u.array */
+ case JS_CLASS_UINT32_ARRAY: /* u.typed_array / u.array */
+#ifdef CONFIG_BIGNUM
+ case JS_CLASS_BIG_INT64_ARRAY: /* u.typed_array / u.array */
+ case JS_CLASS_BIG_UINT64_ARRAY: /* u.typed_array / u.array */
+#endif
+ case JS_CLASS_FLOAT32_ARRAY: /* u.typed_array / u.array */
+ case JS_CLASS_FLOAT64_ARRAY: /* u.typed_array / u.array */
+ case JS_CLASS_DATAVIEW: /* u.typed_array */
+#ifdef CONFIG_BIGNUM
+ case JS_CLASS_FLOAT_ENV: /* u.float_env */
+#endif
+ case JS_CLASS_MAP: /* u.map_state */
+ case JS_CLASS_SET: /* u.map_state */
+ case JS_CLASS_WEAKMAP: /* u.map_state */
+ case JS_CLASS_WEAKSET: /* u.map_state */
+ case JS_CLASS_MAP_ITERATOR: /* u.map_iterator_data */
+ case JS_CLASS_SET_ITERATOR: /* u.map_iterator_data */
+ case JS_CLASS_ARRAY_ITERATOR: /* u.array_iterator_data */
+ case JS_CLASS_STRING_ITERATOR: /* u.array_iterator_data */
+ case JS_CLASS_PROXY: /* u.proxy_data */
+ case JS_CLASS_PROMISE: /* u.promise_data */
+ case JS_CLASS_PROMISE_RESOLVE_FUNCTION: /* u.promise_function_data */
+ case JS_CLASS_PROMISE_REJECT_FUNCTION: /* u.promise_function_data */
+ case JS_CLASS_ASYNC_FUNCTION_RESOLVE: /* u.async_function_data */
+ case JS_CLASS_ASYNC_FUNCTION_REJECT: /* u.async_function_data */
+ case JS_CLASS_ASYNC_FROM_SYNC_ITERATOR: /* u.async_from_sync_iterator_data */
+ case JS_CLASS_ASYNC_GENERATOR: /* u.async_generator_data */
+ /* TODO */
+ default:
+ /* XXX: class definition should have an opaque block size */
+ if (p->u.opaque) {
+ s->memory_used_count += 1;
+ }
+ break;
+ }
+ }
+ s->obj_size += s->obj_count * sizeof(JSObject);
+
+ /* hashed shapes */
+ s->memory_used_count++; /* rt->shape_hash */
+ s->memory_used_size += sizeof(rt->shape_hash[0]) * rt->shape_hash_size;
+ for(i = 0; i < rt->shape_hash_size; i++) {
+ JSShape *sh;
+ for(sh = rt->shape_hash[i]; sh != NULL; sh = sh->shape_hash_next) {
+ int hash_size = sh->prop_hash_mask + 1;
+ s->shape_count++;
+ s->shape_size += get_shape_size(hash_size, sh->prop_size);
+ }
+ }
+
+ /* atoms */
+ s->memory_used_count += 2; /* rt->atom_array, rt->atom_hash */
+ s->atom_count = rt->atom_count;
+ s->atom_size = sizeof(rt->atom_array[0]) * rt->atom_size +
+ sizeof(rt->atom_hash[0]) * rt->atom_hash_size;
+ for(i = 0; i < rt->atom_size; i++) {
+ JSAtomStruct *p = rt->atom_array[i];
+ if (!atom_is_free(p)) {
+ s->atom_size += (sizeof(*p) + (p->len << p->is_wide_char) +
+ 1 - p->is_wide_char);
+ }
+ }
+ s->str_count = round(mem.str_count);
+ s->str_size = round(mem.str_size);
+ s->js_func_count = round(mem.js_func_count);
+ s->js_func_size = round(mem.js_func_size);
+ s->js_func_code_size = round(mem.js_func_code_size);
+ s->js_func_pc2line_count = round(mem.js_func_pc2line_count);
+ s->js_func_pc2line_size = round(mem.js_func_pc2line_size);
+ s->memory_used_count += round(mem.memory_used_count) +
+ s->atom_count + s->str_count +
+ s->obj_count + s->shape_count +
+ s->js_func_count + s->js_func_pc2line_count;
+ s->memory_used_size += s->atom_size + s->str_size +
+ s->obj_size + s->prop_size + s->shape_size +
+ s->js_func_size + s->js_func_code_size + s->js_func_pc2line_size;
+}
+
+void JS_DumpMemoryUsage(FILE *fp, const JSMemoryUsage *s, JSRuntime *rt)
+{
+ fprintf(fp, "QuickJS memory usage -- "
+#ifdef CONFIG_BIGNUM
+ "BigNum "
+#endif
+ CONFIG_VERSION " version, %d-bit, malloc limit: %"PRId64"\n\n",
+ (int)sizeof(void *) * 8, (int64_t)(ssize_t)s->malloc_limit);
+#if 1
+ if (rt) {
+ static const struct {
+ const char *name;
+ size_t size;
+ } object_types[] = {
+ { "JSRuntime", sizeof(JSRuntime) },
+ { "JSContext", sizeof(JSContext) },
+ { "JSObject", sizeof(JSObject) },
+ { "JSString", sizeof(JSString) },
+ { "JSFunctionBytecode", sizeof(JSFunctionBytecode) },
+ };
+ int i, usage_size_ok = 0;
+ for(i = 0; i < countof(object_types); i++) {
+ unsigned int size = object_types[i].size;
+ void *p = js_malloc_rt(rt, size);
+ if (p) {
+ unsigned int size1 = js_malloc_usable_size_rt(rt, p);
+ if (size1 >= size) {
+ usage_size_ok = 1;
+ fprintf(fp, " %3u + %-2u %s\n",
+ size, size1 - size, object_types[i].name);
+ }
+ js_free_rt(rt, p);
+ }
+ }
+ if (!usage_size_ok) {
+ fprintf(fp, " malloc_usable_size unavailable\n");
+ }
+ {
+ int obj_classes[JS_CLASS_INIT_COUNT + 1] = { 0 };
+ int class_id;
+ struct list_head *el;
+ list_for_each(el, &rt->obj_list) {
+ JSObject *p = list_entry(el, JSObject, link);
+ obj_classes[min_uint32(p->class_id, JS_CLASS_INIT_COUNT)]++;
+ }
+ fprintf(fp, "\n" "JSObject classes\n");
+ if (obj_classes[0])
+ fprintf(fp, " %5d %2.0d %s\n", obj_classes[0], 0, "none");
+ for (class_id = 1; class_id < JS_CLASS_INIT_COUNT; class_id++) {
+ if (obj_classes[class_id]) {
+ char buf[ATOM_GET_STR_BUF_SIZE];
+ fprintf(fp, " %5d %2.0d %s\n", obj_classes[class_id], class_id,
+ JS_AtomGetStrRT(rt, buf, sizeof(buf), js_std_class_def[class_id - 1].class_name));
+ }
+ }
+ if (obj_classes[JS_CLASS_INIT_COUNT])
+ fprintf(fp, " %5d %2.0d %s\n", obj_classes[JS_CLASS_INIT_COUNT], 0, "other");
+ }
+ fprintf(fp, "\n");
+ }
+#endif
+ fprintf(fp, "%-20s %8s %8s\n", "NAME", "COUNT", "SIZE");
+
+ if (s->malloc_count) {
+ fprintf(fp, "%-20s %8"PRId64" %8"PRId64" (%0.1f per block)\n",
+ "memory allocated", s->malloc_count, s->malloc_size,
+ (double)s->malloc_size / s->malloc_count);
+ fprintf(fp, "%-20s %8"PRId64" %8"PRId64" (%d overhead, %0.1f average slack)\n",
+ "memory used", s->memory_used_count, s->memory_used_size,
+ MALLOC_OVERHEAD, ((double)(s->malloc_size - s->memory_used_size) /
+ s->memory_used_count));
+ }
+ if (s->atom_count) {
+ fprintf(fp, "%-20s %8"PRId64" %8"PRId64" (%0.1f per atom)\n",
+ "atoms", s->atom_count, s->atom_size,
+ (double)s->atom_size / s->atom_count);
+ }
+ if (s->str_count) {
+ fprintf(fp, "%-20s %8"PRId64" %8"PRId64" (%0.1f per string)\n",
+ "strings", s->str_count, s->str_size,
+ (double)s->str_size / s->str_count);
+ }
+ if (s->obj_count) {
+ fprintf(fp, "%-20s %8"PRId64" %8"PRId64" (%0.1f per object)\n",
+ "objects", s->obj_count, s->obj_size,
+ (double)s->obj_size / s->obj_count);
+ fprintf(fp, "%-20s %8"PRId64" %8"PRId64" (%0.1f per object)\n",
+ " properties", s->prop_count, s->prop_size,
+ (double)s->prop_count / s->obj_count);
+ fprintf(fp, "%-20s %8"PRId64" %8"PRId64" (%0.1f per shape)\n",
+ " shapes", s->shape_count, s->shape_size,
+ (double)s->shape_size / s->shape_count);
+ }
+ if (s->js_func_count) {
+ fprintf(fp, "%-20s %8"PRId64" %8"PRId64"\n",
+ "bytecode functions", s->js_func_count, s->js_func_size);
+ fprintf(fp, "%-20s %8"PRId64" %8"PRId64" (%0.1f per function)\n",
+ " bytecode", s->js_func_count, s->js_func_code_size,
+ (double)s->js_func_code_size / s->js_func_count);
+ if (s->js_func_pc2line_count) {
+ fprintf(fp, "%-20s %8"PRId64" %8"PRId64" (%0.1f per function)\n",
+ " pc2line", s->js_func_pc2line_count,
+ s->js_func_pc2line_size,
+ (double)s->js_func_pc2line_size / s->js_func_pc2line_count);
+ }
+ }
+ if (s->c_func_count) {
+ fprintf(fp, "%-20s %8"PRId64"\n", "C functions", s->c_func_count);
+ }
+ if (s->array_count) {
+ fprintf(fp, "%-20s %8"PRId64"\n", "arrays", s->array_count);
+ if (s->fast_array_count) {
+ fprintf(fp, "%-20s %8"PRId64"\n", " fast arrays", s->fast_array_count);
+ fprintf(fp, "%-20s %8"PRId64" %8"PRId64" (%0.1f per fast array)\n",
+ " elements", s->fast_array_elements,
+ s->fast_array_elements * (int)sizeof(JSValue),
+ (double)s->fast_array_elements / s->fast_array_count);
+ }
+ }
+ if (s->binary_object_count) {
+ fprintf(fp, "%-20s %8"PRId64" %8"PRId64"\n",
+ "binary objects", s->binary_object_count, s->binary_object_size);
+ }
+}
+
+JSValue JS_GetGlobalObject(JSContext *ctx)
+{
+ return JS_DupValue(ctx, ctx->global_obj);
+}
+
+/* WARNING: obj is freed */
+JSValue JS_Throw(JSContext *ctx, JSValue obj)
+{
+ JS_FreeValue(ctx, ctx->current_exception);
+ ctx->current_exception = obj;
+ ctx->exception_needs_backtrace = JS_IsError(ctx, obj);
+ return JS_EXCEPTION;
+}
+
+/* return the pending exception (cannot be called twice). */
+JSValue JS_GetException(JSContext *ctx)
+{
+ JSValue val;
+ val = ctx->current_exception;
+ ctx->current_exception = JS_NULL;
+ ctx->exception_needs_backtrace = FALSE;
+ return val;
+}
+
+static void dbuf_put_leb128(DynBuf *s, uint32_t v)
+{
+ uint32_t a;
+ for(;;) {
+ a = v & 0x7f;
+ v >>= 7;
+ if (v != 0) {
+ dbuf_putc(s, a | 0x80);
+ } else {
+ dbuf_putc(s, a);
+ break;
+ }
+ }
+}
+
+static void dbuf_put_sleb128(DynBuf *s, int32_t v1)
+{
+ uint32_t v = v1;
+ dbuf_put_leb128(s, (2 * v) ^ -(v >> 31));
+}
+
+static int get_leb128(uint32_t *pval, const uint8_t *buf,
+ const uint8_t *buf_end)
+{
+ const uint8_t *ptr = buf;
+ uint32_t v, a, i;
+ v = 0;
+ for(i = 0; i < 5; i++) {
+ if (unlikely(ptr >= buf_end))
+ break;
+ a = *ptr++;
+ v |= (a & 0x7f) << (i * 7);
+ if (!(a & 0x80)) {
+ *pval = v;
+ return ptr - buf;
+ }
+ }
+ *pval = 0;
+ return -1;
+}
+
+static int get_sleb128(int32_t *pval, const uint8_t *buf,
+ const uint8_t *buf_end)
+{
+ int ret;
+ uint32_t val;
+ ret = get_leb128(&val, buf, buf_end);
+ if (ret < 0) {
+ *pval = 0;
+ return -1;
+ }
+ *pval = (val >> 1) ^ -(val & 1);
+ return ret;
+}
+
+static int find_line_num(JSContext *ctx, JSFunctionBytecode *b,
+ uint32_t pc_value)
+{
+ const uint8_t *p_end, *p;
+ int new_line_num, line_num, pc, v, ret;
+ unsigned int op;
+
+ if (!b->has_debug || !b->debug.pc2line_buf) {
+ /* function was stripped */
+ return -1;
+ }
+
+ p = b->debug.pc2line_buf;
+ p_end = p + b->debug.pc2line_len;
+ pc = 0;
+ line_num = b->debug.line_num;
+ while (p < p_end) {
+ op = *p++;
+ if (op == 0) {
+ uint32_t val;
+ ret = get_leb128(&val, p, p_end);
+ if (ret < 0)
+ goto fail;
+ pc += val;
+ p += ret;
+ ret = get_sleb128(&v, p, p_end);
+ if (ret < 0) {
+ fail:
+ /* should never happen */
+ return b->debug.line_num;
+ }
+ p += ret;
+ new_line_num = line_num + v;
+ } else {
+ op -= PC2LINE_OP_FIRST;
+ pc += (op / PC2LINE_RANGE);
+ new_line_num = line_num + (op % PC2LINE_RANGE) + PC2LINE_BASE;
+ }
+ if (pc_value < pc)
+ return line_num;
+ line_num = new_line_num;
+ }
+ return line_num;
+}
+
+/* if filename != NULL, an additional level is added with the filename
+ and line number information (used for parse error). If 'pc' !=
+ NULL, it is used as the cur_pc value for the current stack frame */
+static void build_backtrace(JSContext *ctx, JSValueConst error_obj,
+ const char *filename, int line_num,
+ const uint8_t *cur_pc)
+{
+ JSStackFrame *sf;
+ JSValue str, func_name;
+ DynBuf dbuf;
+ const char *func_name_str;
+ const char *str1;
+ JSObject *p;
+
+ ctx->exception_needs_backtrace = FALSE;
+ js_dbuf_init(ctx, &dbuf);
+ if (filename) {
+ dbuf_printf(&dbuf, " at %s", filename);
+ if (line_num != -1)
+ dbuf_printf(&dbuf, ":%d", line_num);
+ dbuf_putc(&dbuf, '\n');
+ str = JS_NewString(ctx, filename);
+ JS_DefinePropertyValue(ctx, error_obj, JS_ATOM_fileName, str,
+ JS_PROP_WRITABLE | JS_PROP_CONFIGURABLE);
+ JS_DefinePropertyValue(ctx, error_obj, JS_ATOM_lineNumber, JS_NewInt32(ctx, line_num),
+ JS_PROP_WRITABLE | JS_PROP_CONFIGURABLE);
+ }
+ for(sf = ctx->current_stack_frame; sf != NULL; sf = sf->prev_frame) {
+ func_name = JS_GetProperty(ctx, sf->cur_func, JS_ATOM_name);
+ func_name_str = JS_ToCString(ctx, func_name);
+ if (!func_name_str || func_name_str[0] == '\0')
+ str1 = "";
+ else
+ str1 = func_name_str;
+ dbuf_printf(&dbuf, " at %s", str1);
+ JS_FreeCString(ctx, func_name_str);
+ JS_FreeValue(ctx, func_name);
+
+ p = JS_VALUE_GET_OBJ(sf->cur_func);
+ if (js_class_has_bytecode(p->class_id)) {
+ JSFunctionBytecode *b;
+ char atom_buf[ATOM_GET_STR_BUF_SIZE];
+ int line_num1;
+
+ b = p->u.func.function_bytecode;
+ if (b->has_debug) {
+ if (sf == ctx->current_stack_frame) {
+ if (!cur_pc) {
+ line_num1 = b->debug.line_num;
+ } else {
+ line_num1 = find_line_num(ctx, b,
+ cur_pc - b->byte_code_buf - 1);
+ }
+ } else {
+ line_num1 = find_line_num(ctx, b,
+ sf->cur_pc - b->byte_code_buf - 1);
+ }
+ dbuf_printf(&dbuf, " (%s",
+ JS_AtomGetStr(ctx, atom_buf, sizeof(atom_buf),
+ b->debug.filename));
+ if (line_num1 != -1)
+ dbuf_printf(&dbuf, ":%d", line_num1);
+ dbuf_putc(&dbuf, ')');
+ }
+ } else {
+ dbuf_printf(&dbuf, " (native)");
+ }
+ dbuf_putc(&dbuf, '\n');
+ }
+ dbuf_putc(&dbuf, '\0');
+ str = JS_NewString(ctx, (char *)dbuf.buf);
+ dbuf_free(&dbuf);
+ JS_DefinePropertyValue(ctx, error_obj, JS_ATOM_stack, str,
+ JS_PROP_WRITABLE | JS_PROP_CONFIGURABLE);
+}
+
+JSValue JS_NewError(JSContext *ctx)
+{
+ return JS_NewObjectClass(ctx, JS_CLASS_ERROR);
+}
+
+static JSValue JS_ThrowError(JSContext *ctx, JSErrorEnum error_num,
+ const char *fmt, va_list ap)
+{
+ char buf[256];
+ JSValue obj, ret;
+
+ vsnprintf(buf, sizeof(buf), fmt, ap);
+ obj = JS_NewObjectProtoClass(ctx, ctx->native_error_proto[error_num],
+ JS_CLASS_ERROR);
+ if (unlikely(JS_IsException(obj))) {
+ /* out of memory: throw JS_NULL to avoid recursing */
+ obj = JS_NULL;
+ } else {
+ JS_DefinePropertyValue(ctx, obj, JS_ATOM_message,
+ JS_NewString(ctx, buf),
+ JS_PROP_WRITABLE | JS_PROP_CONFIGURABLE);
+ }
+ ret = JS_Throw(ctx, obj);
+ return ret;
+}
+
+#if defined(_MSC_VER)
+JSValue JS_ThrowSyntaxError(JSContext *ctx, const char *fmt, ...)
+#else
+JSValue __attribute__((format(printf, 2, 3))) JS_ThrowSyntaxError(JSContext *ctx, const char *fmt, ...)
+#endif
+{
+ JSValue val;
+ va_list ap;
+
+ va_start(ap, fmt);
+ val = JS_ThrowError(ctx, JS_SYNTAX_ERROR, fmt, ap);
+ va_end(ap);
+ return val;
+}
+
+#if defined(_MSC_VER)
+JSValue JS_ThrowTypeError(JSContext *ctx, const char *fmt, ...)
+#else
+JSValue __attribute__((format(printf, 2, 3))) JS_ThrowTypeError(JSContext *ctx, const char *fmt, ...)
+#endif
+{
+ JSValue val;
+ va_list ap;
+
+ va_start(ap, fmt);
+ val = JS_ThrowError(ctx, JS_TYPE_ERROR, fmt, ap);
+ va_end(ap);
+ return val;
+}
+
+#if defined(_MSC_VER)
+static int JS_ThrowTypeErrorOrFalse(JSContext *ctx, int flags, const char *fmt, ...)
+#else
+static int __attribute__((format(printf, 3, 4))) JS_ThrowTypeErrorOrFalse(JSContext *ctx, int flags, const char *fmt, ...)
+#endif
+{
+ va_list ap;
+
+ if ((flags & JS_PROP_THROW) ||
+ ((flags & JS_PROP_THROW_STRICT) && is_strict_mode(ctx))) {
+ va_start(ap, fmt);
+ JS_ThrowError(ctx, JS_TYPE_ERROR, fmt, ap);
+ va_end(ap);
+ return -1;
+ } else {
+ return FALSE;
+ }
+}
+
+static int JS_ThrowTypeErrorReadOnly(JSContext *ctx, int flags, JSAtom atom)
+{
+ if ((flags & JS_PROP_THROW) ||
+ ((flags & JS_PROP_THROW_STRICT) && is_strict_mode(ctx))) {
+ char buf[ATOM_GET_STR_BUF_SIZE];
+ JS_ThrowTypeError(ctx, "%s is read-only",
+ JS_AtomGetStr(ctx, buf, sizeof(buf), atom));
+ return -1;
+ } else {
+ return FALSE;
+ }
+}
+
+#if defined(_MSC_VER)
+JSValue JS_ThrowReferenceError(JSContext *ctx, const char *fmt, ...)
+#else
+JSValue __attribute__((format(printf, 2, 3))) JS_ThrowReferenceError(JSContext *ctx, const char *fmt, ...)
+#endif
+{
+ JSValue val;
+ va_list ap;
+
+ va_start(ap, fmt);
+ val = JS_ThrowError(ctx, JS_REFERENCE_ERROR, fmt, ap);
+ va_end(ap);
+ return val;
+}
+
+#if defined(_MSC_VER)
+JSValue JS_ThrowRangeError(JSContext *ctx, const char *fmt, ...)
+#else
+JSValue __attribute__((format(printf, 2, 3))) JS_ThrowRangeError(JSContext *ctx, const char *fmt, ...)
+#endif
+{
+ JSValue val;
+ va_list ap;
+
+ va_start(ap, fmt);
+ val = JS_ThrowError(ctx, JS_RANGE_ERROR, fmt, ap);
+ va_end(ap);
+ return val;
+}
+
+#if defined(_MSC_VER)
+JSValue JS_ThrowInternalError(JSContext *ctx, const char *fmt, ...)
+#else
+JSValue __attribute__((format(printf, 2, 3))) JS_ThrowInternalError(JSContext *ctx, const char *fmt, ...)
+#endif
+{
+ JSValue val;
+ va_list ap;
+
+ va_start(ap, fmt);
+ val = JS_ThrowError(ctx, JS_INTERNAL_ERROR, fmt, ap);
+ va_end(ap);
+ return val;
+}
+
+JSValue JS_ThrowOutOfMemory(JSContext *ctx)
+{
+ if (!ctx->in_out_of_memory) {
+ ctx->in_out_of_memory = TRUE;
+ JS_ThrowInternalError(ctx, "out of memory");
+ ctx->in_out_of_memory = FALSE;
+ }
+ return JS_EXCEPTION;
+}
+
+static JSValue JS_ThrowStackOverflow(JSContext *ctx)
+{
+ return JS_ThrowInternalError(ctx, "stack overflow");
+}
+
+static JSValue JS_ThrowTypeErrorNotAnObject(JSContext *ctx)
+{
+ return JS_ThrowTypeError(ctx, "not an object");
+}
+
+static JSValue JS_ThrowReferenceErrorNotDefined(JSContext *ctx, JSAtom name)
+{
+ char buf[ATOM_GET_STR_BUF_SIZE];
+ return JS_ThrowReferenceError(ctx, "%s is not defined",
+ JS_AtomGetStr(ctx, buf, sizeof(buf), name));
+}
+
+static JSValue JS_ThrowReferenceErrorUninitialized(JSContext *ctx, JSAtom name)
+{
+ char buf[ATOM_GET_STR_BUF_SIZE];
+ return JS_ThrowReferenceError(ctx, "%s is not initialized",
+ name == JS_ATOM_NULL ? "lexical variable" :
+ JS_AtomGetStr(ctx, buf, sizeof(buf), name));
+}
+
+static JSValue JS_ThrowTypeErrorInvalidClass(JSContext *ctx, int class_id)
+{
+ JSRuntime *rt = ctx->rt;
+ char buf[ATOM_GET_STR_BUF_SIZE];
+ JSAtom name;
+ name = rt->class_array[class_id].class_name;
+ return JS_ThrowTypeError(ctx, "%s object expected",
+ JS_AtomGetStr(ctx, buf, sizeof(buf), name));
+}
+
+/* return -1 (exception) or TRUE/FALSE */
+static int JS_SetPrototypeInternal(JSContext *ctx, JSValueConst obj,
+ JSValueConst proto_val,
+ BOOL throw_flag)
+{
+ JSObject *proto, *p, *p1;
+ JSShape *sh;
+
+ if (throw_flag) {
+ if (JS_VALUE_GET_TAG(obj) == JS_TAG_NULL ||
+ JS_VALUE_GET_TAG(obj) == JS_TAG_UNDEFINED)
+ goto not_obj;
+ } else {
+ if (JS_VALUE_GET_TAG(obj) != JS_TAG_OBJECT)
+ goto not_obj;
+ }
+ p = JS_VALUE_GET_OBJ(obj);
+ if (JS_VALUE_GET_TAG(proto_val) != JS_TAG_OBJECT) {
+ if (JS_VALUE_GET_TAG(proto_val) != JS_TAG_NULL) {
+ not_obj:
+ JS_ThrowTypeErrorNotAnObject(ctx);
+ return -1;
+ }
+ proto = NULL;
+ } else {
+ proto = JS_VALUE_GET_OBJ(proto_val);
+ }
+
+ if (throw_flag && JS_VALUE_GET_TAG(obj) != JS_TAG_OBJECT)
+ return TRUE;
+
+ if (unlikely(p->class_id == JS_CLASS_PROXY))
+ return js_proxy_setPrototypeOf(ctx, obj, proto_val, throw_flag);
+ sh = p->shape;
+ if (sh->proto == proto)
+ return TRUE;
+ if (!p->extensible) {
+ if (throw_flag) {
+ JS_ThrowTypeError(ctx, "object is not extensible");
+ return -1;
+ } else {
+ return FALSE;
+ }
+ }
+ if (proto) {
+ /* check if there is a cycle */
+ p1 = proto;
+ do {
+ if (p1 == p) {
+ if (throw_flag) {
+ JS_ThrowTypeError(ctx, "circular prototype chain");
+ return -1;
+ } else {
+ return FALSE;
+ }
+ }
+ /* Note: for Proxy objects, proto is NULL */
+ p1 = p1->shape->proto;
+ } while (p1 != NULL);
+ JS_DupValue(ctx, proto_val);
+ }
+
+ if (js_shape_prepare_update(ctx, p, NULL))
+ return -1;
+ sh = p->shape;
+ if (sh->proto)
+ JS_FreeValue(ctx, JS_MKPTR(JS_TAG_OBJECT, sh->proto));
+ sh->proto = proto;
+ return TRUE;
+}
+
+/* return -1 (exception) or TRUE/FALSE */
+int JS_SetPrototype(JSContext *ctx, JSValueConst obj, JSValueConst proto_val)
+{
+ return JS_SetPrototypeInternal(ctx, obj, proto_val, TRUE);
+}
+
+/* Return an Object, JS_NULL or JS_EXCEPTION in case of Proxy object. */
+JSValueConst JS_GetPrototype(JSContext *ctx, JSValueConst val)
+{
+ JSObject *p;
+
+ switch(JS_VALUE_GET_NORM_TAG(val)) {
+#ifdef CONFIG_BIGNUM
+ case JS_TAG_BIG_INT:
+ val = ctx->class_proto[JS_CLASS_BIG_INT];
+ break;
+ case JS_TAG_INT:
+ if (is_bignum_mode(ctx)) {
+ val = ctx->class_proto[JS_CLASS_BIG_INT];
+ } else {
+ val = ctx->class_proto[JS_CLASS_NUMBER];
+ }
+ break;
+ case JS_TAG_FLOAT64:
+ val = ctx->class_proto[JS_CLASS_NUMBER];
+ break;
+ case JS_TAG_BIG_FLOAT:
+ val = ctx->class_proto[JS_CLASS_BIG_FLOAT];
+ break;
+#else
+ case JS_TAG_INT:
+ case JS_TAG_FLOAT64:
+ val = ctx->class_proto[JS_CLASS_NUMBER];
+ break;
+#endif
+ case JS_TAG_BOOL:
+ val = ctx->class_proto[JS_CLASS_BOOLEAN];
+ break;
+ case JS_TAG_STRING:
+ val = ctx->class_proto[JS_CLASS_STRING];
+ break;
+ case JS_TAG_SYMBOL:
+ val = ctx->class_proto[JS_CLASS_SYMBOL];
+ break;
+ case JS_TAG_OBJECT:
+ p = JS_VALUE_GET_OBJ(val);
+ if (unlikely(p->class_id == JS_CLASS_PROXY)) {
+ val = js_proxy_getPrototypeOf(ctx, val);
+ } else {
+ p = p->shape->proto;
+ if (!p)
+ val = JS_NULL;
+ else
+ val = JS_MKPTR(JS_TAG_OBJECT, p);
+ }
+ break;
+ case JS_TAG_NULL:
+ case JS_TAG_UNDEFINED:
+ default:
+ val = JS_NULL;
+ break;
+ }
+ return val;
+}
+
+/* return TRUE, FALSE or (-1) in case of exception */
+static int JS_OrdinaryIsInstanceOf(JSContext *ctx, JSValueConst val,
+ JSValueConst obj)
+{
+ JSValue obj_proto;
+ JSObject *proto;
+ const JSObject *p, *proto1;
+ BOOL ret;
+
+ if (!JS_IsFunction(ctx, obj))
+ return FALSE;
+ p = JS_VALUE_GET_OBJ(obj);
+ if (p->class_id == JS_CLASS_BOUND_FUNCTION) {
+ JSBoundFunction *s = p->u.bound_function;
+ return JS_IsInstanceOf(ctx, val, s->func_obj);
+ }
+
+ /* Only explicitly boxed values are instances of constructors */
+ if (JS_VALUE_GET_TAG(val) != JS_TAG_OBJECT)
+ return FALSE;
+ ret = FALSE;
+ obj_proto = JS_GetProperty(ctx, obj, JS_ATOM_prototype);
+ if (JS_VALUE_GET_TAG(obj_proto) != JS_TAG_OBJECT) {
+ if (!JS_IsException(obj_proto))
+ JS_ThrowTypeError(ctx, "operand 'prototype' property is not an object");
+ ret = -1;
+ goto done;
+ }
+ proto = JS_VALUE_GET_OBJ(obj_proto);
+ p = JS_VALUE_GET_OBJ(val);
+ for(;;) {
+ proto1 = p->shape->proto;
+ if (!proto1) {
+ if (p->class_id == JS_CLASS_PROXY) {
+ JSValueConst proto_val;
+ proto_val = JS_GetPrototype(ctx, JS_MKPTR(JS_TAG_OBJECT, (JSObject *)p));
+ if (JS_IsException(proto_val)) {
+ ret = -1;
+ goto done;
+ }
+ proto1 = JS_VALUE_GET_OBJ(proto_val);
+ if (!proto1)
+ break;
+ } else {
+ break;
+ }
+ }
+ p = proto1;
+ if (proto == p) {
+ ret = TRUE;
+ break;
+ }
+ }
+done:
+ JS_FreeValue(ctx, obj_proto);
+ return ret;
+}
+
+/* return TRUE, FALSE or (-1) in case of exception */
+int JS_IsInstanceOf(JSContext *ctx, JSValueConst val, JSValueConst obj)
+{
+ JSValue method;
+
+ if (!JS_IsObject(obj))
+ goto fail;
+ method = JS_GetProperty(ctx, obj, JS_ATOM_Symbol_hasInstance);
+ if (JS_IsException(method))
+ return -1;
+ if (!JS_IsNull(method) && !JS_IsUndefined(method)) {
+ JSValue ret;
+ ret = JS_CallFree(ctx, method, obj, 1, &val);
+ return JS_ToBoolFree(ctx, ret);
+ }
+
+ /* legacy case */
+ if (!JS_IsFunction(ctx, obj)) {
+ fail:
+ JS_ThrowTypeError(ctx, "invalid 'instanceof' right operand");
+ return -1;
+ }
+ return JS_OrdinaryIsInstanceOf(ctx, val, obj);
+}
+
+static int JS_AutoInitProperty(JSContext *ctx, JSObject *p, JSAtom prop, JSProperty *pr)
+{
+ return (*pr->u.init.init_func)(ctx, p, prop, pr->u.init.opaque);
+}
+
+JSValue JS_GetPropertyInternal(JSContext *ctx, JSValueConst obj,
+ JSAtom prop, JSValueConst this_obj,
+ BOOL throw_ref_error)
+{
+ JSObject *p;
+ JSProperty *pr;
+ JSShapeProperty *prs;
+ uint32_t tag;
+
+ tag = JS_VALUE_GET_TAG(obj);
+ if (unlikely(tag != JS_TAG_OBJECT)) {
+ switch(tag) {
+ case JS_TAG_NULL:
+ case JS_TAG_UNDEFINED:
+ return JS_ThrowTypeError(ctx, "value has no property");
+ case JS_TAG_EXCEPTION:
+ return JS_EXCEPTION;
+ case JS_TAG_STRING:
+ {
+ JSString *p1 = JS_VALUE_GET_STRING(obj);
+ if (__JS_AtomIsTaggedInt(prop)) {
+ uint32_t idx, ch;
+ idx = __JS_AtomToUInt32(prop);
+ if (idx < p1->len) {
+ if (p1->is_wide_char)
+ ch = p1->u.str16[idx];
+ else
+ ch = p1->u.str8[idx];
+ return js_new_string_char(ctx, ch);
+ }
+ } else if (prop == JS_ATOM_length) {
+ return JS_NewInt32(ctx, p1->len);
+ }
+ }
+ break;
+ default:
+ break;
+ }
+ /* cannot raise an exception */
+ p = JS_VALUE_GET_OBJ(JS_GetPrototype(ctx, obj));
+ if (!p)
+ return JS_UNDEFINED;
+ } else {
+ p = JS_VALUE_GET_OBJ(obj);
+ }
+
+ for(;;) {
+ prs = find_own_property(&pr, p, prop);
+ if (prs) {
+ /* found */
+ if (unlikely(prs->flags & JS_PROP_TMASK)) {
+ if ((prs->flags & JS_PROP_TMASK) == JS_PROP_GETSET) {
+ if (unlikely(!pr->u.getset.getter)) {
+ return JS_UNDEFINED;
+ } else {
+ JSValue func = JS_MKPTR(JS_TAG_OBJECT, pr->u.getset.getter);
+ /* Note: the field could be removed in the getter */
+ func = JS_DupValue(ctx, func);
+ return JS_CallFree(ctx, func, this_obj, 0, NULL);
+ }
+ } else if ((prs->flags & JS_PROP_TMASK) == JS_PROP_VARREF) {
+ JSValue val = *pr->u.var_ref->pvalue;
+ if (unlikely(JS_IsUninitialized(val)))
+ return JS_ThrowReferenceErrorUninitialized(ctx, prs->atom);
+ return JS_DupValue(ctx, val);
+ } else if ((prs->flags & JS_PROP_TMASK) == JS_PROP_AUTOINIT) {
+ /* Instantiate property and retry */
+ if (JS_AutoInitProperty(ctx, p, prop, pr))
+ return JS_EXCEPTION;
+ continue;
+ }
+ } else {
+ return JS_DupValue(ctx, pr->u.value);
+ }
+ }
+ if (unlikely(p->is_exotic)) {
+ /* exotic behaviors */
+ if (p->fast_array) {
+ if (__JS_AtomIsTaggedInt(prop)) {
+ uint32_t idx = __JS_AtomToUInt32(prop);
+ if (idx < p->u.array.count) {
+ /* we avoid duplicating the code */
+ return JS_GetPropertyUint32(ctx, JS_MKPTR(JS_TAG_OBJECT, p), idx);
+ } else if (p->class_id >= JS_CLASS_UINT8C_ARRAY &&
+ p->class_id <= JS_CLASS_FLOAT64_ARRAY) {
+ goto typed_array_oob;
+ }
+ } else if (p->class_id >= JS_CLASS_UINT8C_ARRAY &&
+ p->class_id <= JS_CLASS_FLOAT64_ARRAY) {
+ int ret;
+ ret = JS_AtomIsNumericIndex(ctx, prop);
+ if (ret != 0) {
+ if (ret < 0)
+ return JS_EXCEPTION;
+ typed_array_oob:
+ if (typed_array_is_detached(ctx, p))
+ return JS_ThrowTypeErrorDetachedArrayBuffer(ctx);
+ return JS_UNDEFINED;
+ }
+ }
+ } else {
+ const JSClassExoticMethods *em = ctx->rt->class_array[p->class_id].exotic;
+ if (em) {
+ if (em->get_property) {
+ /* XXX: should pass throw_ref_error */
+ return em->get_property(ctx, JS_MKPTR(JS_TAG_OBJECT, p),
+ prop, this_obj);
+ }
+ if (em->get_own_property) {
+ JSPropertyDescriptor desc;
+ int ret;
+
+ ret = em->get_own_property(ctx, &desc, JS_MKPTR(JS_TAG_OBJECT, p), prop);
+ if (ret < 0)
+ return JS_EXCEPTION;
+ if (ret) {
+ if (desc.flags & JS_PROP_GETSET) {
+ JS_FreeValue(ctx, desc.setter);
+ return JS_CallFree(ctx, desc.getter, this_obj, 0, NULL);
+ } else {
+ return desc.value;
+ }
+ }
+ }
+ }
+ }
+ }
+ p = p->shape->proto;
+ if (!p)
+ break;
+ }
+ if (unlikely(throw_ref_error)) {
+ return JS_ThrowReferenceErrorNotDefined(ctx, prop);
+ } else {
+ return JS_UNDEFINED;
+ }
+}
+
+static int num_keys_cmp(const void *p1, const void *p2, void *opaque)
+{
+ JSContext *ctx = opaque;
+ JSAtom atom1 = ((const JSPropertyEnum *)p1)->atom;
+ JSAtom atom2 = ((const JSPropertyEnum *)p2)->atom;
+ uint64_t v1, v2;
+ BOOL atom1_is_integer, atom2_is_integer;
+
+ atom1_is_integer = JS_AtomIsIntegerIndex(ctx, &v1, atom1);
+ atom2_is_integer = JS_AtomIsIntegerIndex(ctx, &v2, atom2);
+ assert(atom1_is_integer && atom2_is_integer);
+ if (v1 < v2)
+ return -1;
+ else if (v1 == v2)
+ return 0;
+ else
+ return 1;
+}
+
+static void js_free_prop_enum(JSContext *ctx, JSPropertyEnum *tab, uint32_t len)
+{
+ uint32_t i;
+ if (tab) {
+ for(i = 0; i < len; i++)
+ JS_FreeAtom(ctx, tab[i].atom);
+ js_free(ctx, tab);
+ }
+}
+
+#define JS_GPN_SYMBOL_MASK (1 << 0)
+#define JS_GPN_STRING_MASK (1 << 1)
+/* only include the enumerable properties */
+#define JS_GPN_ENUM_ONLY (1 << 2)
+/* set theJSPropertyEnum.is_enumerable field */
+#define JS_GPN_SET_ENUM (1 << 3)
+
+static int __exception JS_GetOwnPropertyNames(JSContext *ctx, JSPropertyEnum **ptab,
+ uint32_t *plen,
+ JSObject *p, int flags)
+{
+ int i, j;
+ JSShape *sh;
+ JSShapeProperty *prs;
+ JSPropertyEnum *tab_atom, *tab_exotic;
+ JSAtom atom;
+ uint32_t num_keys_count, str_keys_count, sym_keys_count, atom_count;
+ uint32_t num_index, str_index, sym_index, exotic_count;
+ BOOL is_enumerable, is_string, num_sorted;
+ uint64_t num_key;
+
+ /* clear pointer for consistency in case of failure */
+ *ptab = NULL;
+ *plen = 0;
+
+ /* compute the number of returned properties */
+ num_keys_count = 0;
+ str_keys_count = 0;
+ sym_keys_count = 0;
+ exotic_count = 0;
+ tab_exotic = NULL;
+ sh = p->shape;
+ for(i = 0, prs = get_shape_prop(sh); i < sh->prop_count; i++, prs++) {
+ atom = prs->atom;
+ if (atom != JS_ATOM_NULL) {
+ is_enumerable = ((prs->flags & JS_PROP_ENUMERABLE) != 0);
+ is_string = JS_AtomIsString(ctx, atom);
+ if ((!(flags & JS_GPN_ENUM_ONLY) || is_enumerable) &&
+ ((flags >> is_string) & 1) != 0) {
+ /* need to raise an exception in case of the module
+ name space (implicit GetOwnProperty) */
+ if (unlikely((prs->flags & JS_PROP_TMASK) == JS_PROP_VARREF) &&
+ (flags & (JS_GPN_SET_ENUM | JS_GPN_ENUM_ONLY))) {
+ JSVarRef *var_ref = p->prop[i].u.var_ref;
+ if (unlikely(JS_IsUninitialized(*var_ref->pvalue))) {
+ JS_ThrowReferenceErrorUninitialized(ctx, prs->atom);
+ return -1;
+ }
+ }
+ if (JS_AtomIsIntegerIndex(ctx, &num_key, atom)) {
+ num_keys_count++;
+ } else if (is_string) {
+ str_keys_count++;
+ } else {
+ sym_keys_count++;
+ }
+ }
+ }
+ }
+
+ if (p->is_exotic) {
+ if (p->fast_array) {
+ /* the implicit GetOwnProperty raises an exception if the
+ typed array is detached */
+ if ((flags & (JS_GPN_SET_ENUM | JS_GPN_ENUM_ONLY)) &&
+ (p->class_id >= JS_CLASS_UINT8C_ARRAY &&
+ p->class_id <= JS_CLASS_FLOAT64_ARRAY) &&
+ typed_array_is_detached(ctx, p) &&
+ typed_array_get_length(ctx, p) != 0) {
+ JS_ThrowTypeErrorDetachedArrayBuffer(ctx);
+ return -1;
+ }
+ num_keys_count += p->u.array.count;
+ } else {
+ const JSClassExoticMethods *em = ctx->rt->class_array[p->class_id].exotic;
+ if (em && em->get_own_property_names) {
+ if (em->get_own_property_names(ctx, &tab_exotic, &exotic_count,
+ JS_MKPTR(JS_TAG_OBJECT, p)))
+ return -1;
+ for(i = 0; i < exotic_count; i++) {
+ atom = tab_exotic[i].atom;
+ is_string = JS_AtomIsString(ctx, atom);
+ if (((flags >> is_string) & 1) != 0) {
+ is_enumerable = FALSE;
+ if (flags & (JS_GPN_SET_ENUM | JS_GPN_ENUM_ONLY)) {
+ JSPropertyDescriptor desc;
+ int res;
+ /* set the "is_enumerable" field if necessary */
+ res = JS_GetOwnProperty(ctx, &desc, p, atom);
+ if (res < 0) {
+ js_free_prop_enum(ctx, tab_exotic, exotic_count);
+ return -1;
+ }
+ if (res) {
+ is_enumerable =
+ ((desc.flags & JS_PROP_ENUMERABLE) != 0);
+ js_free_desc(ctx, &desc);
+ }
+ tab_exotic[i].is_enumerable = is_enumerable;
+ }
+ if (!(flags & JS_GPN_ENUM_ONLY) || is_enumerable) {
+ if (JS_AtomIsIntegerIndex(ctx, &num_key, atom)) {
+ num_keys_count++;
+ } else if (is_string) {
+ str_keys_count++;
+ } else {
+ sym_keys_count++;
+ }
+ }
+ }
+ }
+ }
+ }
+ }
+
+ /* fill them */
+
+ atom_count = num_keys_count + str_keys_count + sym_keys_count;
+ /* avoid allocating 0 bytes */
+ tab_atom = js_malloc(ctx, sizeof(tab_atom[0]) * max_int(atom_count, 1));
+ if (!tab_atom) {
+ js_free_prop_enum(ctx, tab_exotic, exotic_count);
+ return -1;
+ }
+
+ num_index = 0;
+ str_index = num_keys_count;
+ sym_index = str_index + str_keys_count;
+
+ num_sorted = TRUE;
+ sh = p->shape;
+ for(i = 0, prs = get_shape_prop(sh); i < sh->prop_count; i++, prs++) {
+ atom = prs->atom;
+ if (atom != JS_ATOM_NULL) {
+ is_enumerable = ((prs->flags & JS_PROP_ENUMERABLE) != 0);
+ is_string = JS_AtomIsString(ctx, atom);
+ if ((!(flags & JS_GPN_ENUM_ONLY) || is_enumerable) &&
+ ((flags >> is_string) & 1) != 0) {
+ if (JS_AtomIsIntegerIndex(ctx, &num_key, atom)) {
+ j = num_index++;
+ num_sorted = FALSE;
+ } else if (is_string) {
+ j = str_index++;
+ } else {
+ j = sym_index++;
+ }
+ tab_atom[j].atom = JS_DupAtom(ctx, atom);
+ tab_atom[j].is_enumerable = is_enumerable;
+ }
+ }
+ }
+
+ if (p->is_exotic) {
+ if (p->fast_array) {
+ for(i = 0; i < p->u.array.count; i++) {
+ tab_atom[num_index].atom = __JS_AtomFromUInt32(i);
+ if (tab_atom[num_index].atom == JS_ATOM_NULL) {
+ js_free_prop_enum(ctx, tab_exotic, exotic_count);
+ js_free_prop_enum(ctx, tab_atom, num_index);
+ return -1;
+ }
+ tab_atom[num_index].is_enumerable = TRUE;
+ num_index++;
+ }
+ }
+ if (exotic_count > 0) {
+ for(i = 0; i < exotic_count; i++) {
+ atom = tab_exotic[i].atom;
+ is_enumerable = tab_exotic[i].is_enumerable;
+ is_string = JS_AtomIsString(ctx, atom);
+ if ((!(flags & JS_GPN_ENUM_ONLY) || is_enumerable) &&
+ ((flags >> is_string) & 1) != 0) {
+ if (JS_AtomIsIntegerIndex(ctx, &num_key, atom)) {
+ j = num_index++;
+ num_sorted = FALSE;
+ } else if (is_string) {
+ j = str_index++;
+ } else {
+ j = sym_index++;
+ }
+ tab_atom[j].atom = atom;
+ tab_atom[j].is_enumerable = is_enumerable;
+ } else {
+ JS_FreeAtom(ctx, atom);
+ }
+ }
+ }
+ js_free(ctx, tab_exotic);
+ }
+
+ assert(num_index == num_keys_count);
+ assert(str_index == num_keys_count + str_keys_count);
+ assert(sym_index == atom_count);
+
+ if (num_keys_count != 0 && !num_sorted) {
+ rqsort(tab_atom, num_keys_count, sizeof(tab_atom[0]), num_keys_cmp,
+ ctx);
+ }
+ *ptab = tab_atom;
+ *plen = atom_count;
+ return 0;
+}
+
+/* Return -1 if exception,
+ FALSE if the property does not exist, TRUE if it exists. If TRUE is
+ returned, the property descriptor 'desc' is filled present. */
+static int JS_GetOwnProperty(JSContext *ctx, JSPropertyDescriptor *desc,
+ JSObject *p, JSAtom prop)
+{
+ JSShapeProperty *prs;
+ JSProperty *pr;
+
+retry:
+ prs = find_own_property(&pr, p, prop);
+ if (prs) {
+ if (desc) {
+ desc->flags = prs->flags & JS_PROP_C_W_E;
+ desc->getter = JS_UNDEFINED;
+ desc->setter = JS_UNDEFINED;
+ desc->value = JS_UNDEFINED;
+ if (unlikely(prs->flags & JS_PROP_TMASK)) {
+ if ((prs->flags & JS_PROP_TMASK) == JS_PROP_GETSET) {
+ desc->flags |= JS_PROP_GETSET;
+ if (pr->u.getset.getter)
+ desc->getter = JS_DupValue(ctx, JS_MKPTR(JS_TAG_OBJECT, pr->u.getset.getter));
+ if (pr->u.getset.setter)
+ desc->setter = JS_DupValue(ctx, JS_MKPTR(JS_TAG_OBJECT, pr->u.getset.setter));
+ } else if ((prs->flags & JS_PROP_TMASK) == JS_PROP_VARREF) {
+ JSValue val = *pr->u.var_ref->pvalue;
+ if (unlikely(JS_IsUninitialized(val))) {
+ JS_ThrowReferenceErrorUninitialized(ctx, prs->atom);
+ return -1;
+ }
+ desc->value = JS_DupValue(ctx, val);
+ } else if ((prs->flags & JS_PROP_TMASK) == JS_PROP_AUTOINIT) {
+ /* Instantiate property and retry */
+ if (JS_AutoInitProperty(ctx, p, prop, pr))
+ return -1;
+ goto retry;
+ }
+ } else {
+ desc->value = JS_DupValue(ctx, pr->u.value);
+ }
+ } else {
+ /* for consistency, send the exception even if desc is NULL */
+ if (unlikely((prs->flags & JS_PROP_TMASK) == JS_PROP_VARREF)) {
+ if (unlikely(JS_IsUninitialized(*pr->u.var_ref->pvalue))) {
+ JS_ThrowReferenceErrorUninitialized(ctx, prs->atom);
+ return -1;
+ }
+ } else if ((prs->flags & JS_PROP_TMASK) == JS_PROP_AUTOINIT) {
+ /* nothing to do: delay instantiation until actual value and/or attributes are read */
+ }
+ }
+ return TRUE;
+ }
+ if (p->is_exotic) {
+ if (p->fast_array) {
+ /* specific case for fast arrays */
+ if (__JS_AtomIsTaggedInt(prop)) {
+ uint32_t idx;
+ idx = __JS_AtomToUInt32(prop);
+ if (idx < p->u.array.count) {
+ if (desc) {
+ desc->flags = JS_PROP_WRITABLE | JS_PROP_ENUMERABLE;
+ if (p->class_id == JS_CLASS_ARRAY ||
+ p->class_id == JS_CLASS_ARGUMENTS)
+ desc->flags |= JS_PROP_CONFIGURABLE;
+ desc->getter = JS_UNDEFINED;
+ desc->setter = JS_UNDEFINED;
+ desc->value = JS_GetPropertyUint32(ctx, JS_MKPTR(JS_TAG_OBJECT, p), idx);
+ }
+ return TRUE;
+ }
+ }
+ if (p->class_id >= JS_CLASS_UINT8C_ARRAY &&
+ p->class_id <= JS_CLASS_FLOAT64_ARRAY) {
+ int ret;
+ ret = JS_AtomIsNumericIndex(ctx, prop);
+ if (ret != 0) {
+ if (ret < 0)
+ return -1;
+ if (typed_array_is_detached(ctx, p)) {
+ JS_ThrowTypeErrorDetachedArrayBuffer(ctx);
+ return -1;
+ }
+ }
+ }
+ } else {
+ const JSClassExoticMethods *em = ctx->rt->class_array[p->class_id].exotic;
+ if (em && em->get_own_property) {
+ return em->get_own_property(ctx, desc,
+ JS_MKPTR(JS_TAG_OBJECT, p), prop);
+ }
+ }
+ }
+ return FALSE;
+}
+
+/* return -1 if exception (Proxy object only) or TRUE/FALSE */
+int JS_IsExtensible(JSContext *ctx, JSValueConst obj)
+{
+ JSObject *p;
+
+ if (unlikely(JS_VALUE_GET_TAG(obj) != JS_TAG_OBJECT))
+ return FALSE;
+ p = JS_VALUE_GET_OBJ(obj);
+ if (unlikely(p->class_id == JS_CLASS_PROXY))
+ return js_proxy_isExtensible(ctx, obj);
+ else
+ return p->extensible;
+}
+
+/* return -1 if exception (Proxy object only) or TRUE/FALSE */
+int JS_PreventExtensions(JSContext *ctx, JSValueConst obj)
+{
+ JSObject *p;
+
+ if (unlikely(JS_VALUE_GET_TAG(obj) != JS_TAG_OBJECT))
+ return FALSE;
+ p = JS_VALUE_GET_OBJ(obj);
+ if (unlikely(p->class_id == JS_CLASS_PROXY))
+ return js_proxy_preventExtensions(ctx, obj);
+ p->extensible = FALSE;
+ return TRUE;
+}
+
+/* return -1 if exception otherwise TRUE or FALSE */
+int JS_HasProperty(JSContext *ctx, JSValueConst obj, JSAtom prop)
+{
+ JSObject *p;
+ int ret;
+
+ if (unlikely(JS_VALUE_GET_TAG(obj) != JS_TAG_OBJECT))
+ return FALSE;
+ p = JS_VALUE_GET_OBJ(obj);
+ for(;;) {
+ if (p->is_exotic) {
+ const JSClassExoticMethods *em = ctx->rt->class_array[p->class_id].exotic;
+ if (em && em->has_property)
+ return em->has_property(ctx, JS_MKPTR(JS_TAG_OBJECT, p), prop);
+ }
+ ret = JS_GetOwnProperty(ctx, NULL, p, prop);
+ if (ret != 0)
+ return ret;
+ if (p->class_id >= JS_CLASS_UINT8C_ARRAY &&
+ p->class_id <= JS_CLASS_FLOAT64_ARRAY) {
+ ret = JS_AtomIsNumericIndex(ctx, prop);
+ if (ret != 0) {
+ if (ret < 0)
+ return -1;
+ /* the detached array test was done in
+ JS_GetOwnProperty() */
+ return FALSE;
+ }
+ }
+ p = p->shape->proto;
+ if (!p)
+ break;
+ }
+ return FALSE;
+}
+
+/* return JS_ATOM_NULL in case of exception */
+static JSAtom js_value_to_atom(JSContext *ctx, JSValueConst val)
+{
+ JSAtom atom;
+ uint32_t tag;
+ tag = JS_VALUE_GET_TAG(val);
+ if (tag == JS_TAG_INT &&
+ (uint32_t)JS_VALUE_GET_INT(val) <= JS_ATOM_MAX_INT) {
+ /* fast path for integer values */
+ atom = __JS_AtomFromUInt32(JS_VALUE_GET_INT(val));
+ } else if (tag == JS_TAG_SYMBOL) {
+ JSAtomStruct *p = JS_VALUE_GET_PTR(val);
+ atom = JS_DupAtom(ctx, js_get_atom_index(ctx->rt, p));
+ } else {
+ JSValue str;
+ str = JS_ToPropertyKey(ctx, val);
+ if (JS_IsException(str))
+ return JS_ATOM_NULL;
+ if (JS_VALUE_GET_TAG(str) == JS_TAG_SYMBOL) {
+ JSAtomStruct *p = JS_VALUE_GET_PTR(str);
+ atom = js_get_atom_index(ctx->rt, p);
+ } else {
+ atom = JS_NewAtomStr(ctx, JS_VALUE_GET_STRING(str));
+ }
+ }
+ return atom;
+}
+
+static JSValue JS_GetPropertyValue(JSContext *ctx, JSValueConst this_obj,
+ JSValue prop)
+{
+ JSAtom atom;
+ JSValue ret;
+
+ if (likely(JS_VALUE_GET_TAG(this_obj) == JS_TAG_OBJECT &&
+ JS_VALUE_GET_TAG(prop) == JS_TAG_INT)) {
+ JSObject *p;
+ uint32_t idx, len;
+ /* fast path for array access */
+ p = JS_VALUE_GET_OBJ(this_obj);
+ idx = JS_VALUE_GET_INT(prop);
+ len = (uint32_t)p->u.array.count;
+ if (unlikely(idx >= len))
+ goto slow_path;
+ switch(p->class_id) {
+ case JS_CLASS_ARRAY:
+ case JS_CLASS_ARGUMENTS:
+ return JS_DupValue(ctx, p->u.array.u.values[idx]);
+ case JS_CLASS_INT8_ARRAY:
+ return JS_NewInt32(ctx, p->u.array.u.int8_ptr[idx]);
+ case JS_CLASS_UINT8C_ARRAY:
+ case JS_CLASS_UINT8_ARRAY:
+ return JS_NewInt32(ctx, p->u.array.u.uint8_ptr[idx]);
+ case JS_CLASS_INT16_ARRAY:
+ return JS_NewInt32(ctx, p->u.array.u.int16_ptr[idx]);
+ case JS_CLASS_UINT16_ARRAY:
+ return JS_NewInt32(ctx, p->u.array.u.uint16_ptr[idx]);
+ case JS_CLASS_INT32_ARRAY:
+ return JS_NewInt32(ctx, p->u.array.u.int32_ptr[idx]);
+ case JS_CLASS_UINT32_ARRAY:
+ return JS_NewUint32(ctx, p->u.array.u.uint32_ptr[idx]);
+#ifdef CONFIG_BIGNUM
+ case JS_CLASS_BIG_INT64_ARRAY:
+ return JS_NewBigInt64(ctx, p->u.array.u.int64_ptr[idx]);
+ case JS_CLASS_BIG_UINT64_ARRAY:
+ return JS_NewBigUint64(ctx, p->u.array.u.uint64_ptr[idx]);
+#endif
+ case JS_CLASS_FLOAT32_ARRAY:
+ return __JS_NewFloat64(ctx, p->u.array.u.float_ptr[idx]);
+ case JS_CLASS_FLOAT64_ARRAY:
+ return __JS_NewFloat64(ctx, p->u.array.u.double_ptr[idx]);
+ default:
+ goto slow_path;
+ }
+ } else {
+ slow_path:
+ atom = js_value_to_atom(ctx, prop);
+ JS_FreeValue(ctx, prop);
+ if (unlikely(atom == JS_ATOM_NULL))
+ return JS_EXCEPTION;
+ ret = JS_GetProperty(ctx, this_obj, atom);
+ JS_FreeAtom(ctx, atom);
+ return ret;
+ }
+}
+
+JSValue JS_GetPropertyUint32(JSContext *ctx, JSValueConst this_obj,
+ uint32_t idx)
+{
+ return JS_GetPropertyValue(ctx, this_obj, JS_NewUint32(ctx, idx));
+}
+
+/* Check if an object has a generalized numeric property. Return value:
+ -1 for exception,
+ TRUE if property exists, stored into *pval,
+ FALSE if proprty does not exist.
+ */
+static int JS_TryGetPropertyInt64(JSContext *ctx, JSValueConst obj, int64_t idx, JSValue *pval)
+{
+ JSValue val = JS_UNDEFINED;
+ JSAtom prop;
+ int present;
+
+ if (likely((uint64_t)idx <= JS_ATOM_MAX_INT)) {
+ /* fast path */
+ present = JS_HasProperty(ctx, obj, __JS_AtomFromUInt32(idx));
+ if (present > 0) {
+ val = JS_GetPropertyValue(ctx, obj, JS_NewInt32(ctx, idx));
+ if (unlikely(JS_IsException(val)))
+ present = -1;
+ }
+ } else {
+ prop = JS_NewAtomInt64(ctx, idx);
+ present = -1;
+ if (likely(prop != JS_ATOM_NULL)) {
+ present = JS_HasProperty(ctx, obj, prop);
+ if (present > 0) {
+ val = JS_GetProperty(ctx, obj, prop);
+ if (unlikely(JS_IsException(val)))
+ present = -1;
+ }
+ JS_FreeAtom(ctx, prop);
+ }
+ }
+ *pval = val;
+ return present;
+}
+
+static JSValue JS_GetPropertyInt64(JSContext *ctx, JSValueConst obj, int64_t idx)
+{
+ JSAtom prop;
+ JSValue val;
+
+ if ((uint64_t)idx <= INT32_MAX) {
+ /* fast path for fast arrays */
+ return JS_GetPropertyValue(ctx, obj, JS_NewInt32(ctx, idx));
+ }
+ prop = JS_NewAtomInt64(ctx, idx);
+ if (prop == JS_ATOM_NULL)
+ return JS_EXCEPTION;
+
+ val = JS_GetProperty(ctx, obj, prop);
+ JS_FreeAtom(ctx, prop);
+ return val;
+}
+
+JSValue JS_GetPropertyStr(JSContext *ctx, JSValueConst this_obj,
+ const char *prop)
+{
+ JSAtom atom;
+ JSValue ret;
+ atom = JS_NewAtom(ctx, prop);
+ ret = JS_GetProperty(ctx, this_obj, atom);
+ JS_FreeAtom(ctx, atom);
+ return ret;
+}
+
+/* Note: the property value is not initialized. Return NULL if memory
+ error. */
+static JSProperty *add_property(JSContext *ctx,
+ JSObject *p, JSAtom prop, int prop_flags)
+{
+ JSShape *sh, *new_sh;
+
+ sh = p->shape;
+ if (sh->is_hashed) {
+ /* try to find an existing shape */
+ new_sh = find_hashed_shape_prop(ctx->rt, sh, prop, prop_flags);
+ if (new_sh) {
+ /* matching shape found: use it */
+ /* the property array may need to be resized */
+ if (new_sh->prop_size != sh->prop_size) {
+ JSProperty *new_prop;
+ new_prop = js_realloc(ctx, p->prop, sizeof(p->prop[0]) *
+ new_sh->prop_size);
+ if (!new_prop)
+ return NULL;
+ p->prop = new_prop;
+ }
+ p->shape = js_dup_shape(new_sh);
+ js_free_shape(ctx->rt, sh);
+ return &p->prop[new_sh->prop_count - 1];
+ } else if (sh->header.ref_count != 1) {
+ /* if the shape is shared, clone it */
+ new_sh = js_clone_shape(ctx, sh);
+ if (!new_sh)
+ return NULL;
+ /* hash the cloned shape */
+ new_sh->is_hashed = TRUE;
+ js_shape_hash_link(ctx->rt, new_sh);
+ js_free_shape(ctx->rt, p->shape);
+ p->shape = new_sh;
+ }
+ }
+ assert(p->shape->header.ref_count == 1);
+ if (add_shape_property(ctx, &p->shape, p, prop, prop_flags))
+ return NULL;
+ return &p->prop[p->shape->prop_count - 1];
+}
+
+/* can be called on Array or Arguments objects. return < 0 if
+ memory alloc error. */
+static no_inline __exception int convert_fast_array_to_array(JSContext *ctx,
+ JSObject *p)
+{
+ JSProperty *pr;
+ JSShape *sh;
+ JSValue *tab;
+ uint32_t i, len, new_count;
+
+ if (js_shape_prepare_update(ctx, p, NULL))
+ return -1;
+ len = p->u.array.count;
+ /* resize the properties once to simplify the error handling */
+ sh = p->shape;
+ new_count = sh->prop_count + len;
+ if (new_count > sh->prop_size) {
+ if (resize_properties(ctx, &p->shape, p, new_count))
+ return -1;
+ }
+
+ tab = p->u.array.u.values;
+ for(i = 0; i < len; i++) {
+ /* add_property cannot fail here but
+ __JS_AtomFromUInt32(i) fails for i > INT32_MAX */
+ pr = add_property(ctx, p, __JS_AtomFromUInt32(i), JS_PROP_C_W_E);
+ pr->u.value = *tab++;
+ }
+ js_free(ctx, p->u.array.u.values);
+ p->u.array.count = 0;
+ p->u.array.u.values = NULL; /* fail safe */
+ p->u.array.u1.size = 0;
+ p->fast_array = 0;
+ return 0;
+}
+
+static int delete_property(JSContext *ctx, JSObject *p, JSAtom atom)
+{
+ JSShape *sh;
+ JSShapeProperty *pr, *lpr, *prop;
+ JSProperty *pr1;
+ uint32_t lpr_idx;
+ intptr_t h, h1;
+
+ redo:
+ sh = p->shape;
+ h1 = atom & sh->prop_hash_mask;
+ h = prop_hash_end_field_of_shape(sh)[-h1 - 1];
+ prop = get_shape_prop(sh);
+ lpr = NULL;
+ lpr_idx = 0; /* prevent warning */
+ while (h != 0) {
+ pr = &prop[h - 1];
+ if (likely(pr->atom == atom)) {
+ /* found ! */
+ if (!(pr->flags & JS_PROP_CONFIGURABLE))
+ return FALSE;
+ /* realloc the shape if needed */
+ if (lpr)
+ lpr_idx = lpr - get_shape_prop(sh);
+ if (js_shape_prepare_update(ctx, p, &pr))
+ return -1;
+ sh = p->shape;
+ /* remove property */
+ if (lpr) {
+ lpr = get_shape_prop(sh) + lpr_idx;
+ lpr->hash_next = pr->hash_next;
+ } else {
+ prop_hash_end_field_of_shape(sh)[-h1 - 1] = pr->hash_next;
+ }
+ /* free the entry */
+ pr1 = &p->prop[h - 1];
+ free_property(ctx->rt, pr1, pr->flags);
+ JS_FreeAtom(ctx, pr->atom);
+ /* put default values */
+ pr->flags = 0;
+ pr->atom = JS_ATOM_NULL;
+ pr1->u.value = JS_UNDEFINED;
+ return TRUE;
+ }
+ lpr = pr;
+ h = pr->hash_next;
+ }
+
+ if (p->is_exotic) {
+ if (p->fast_array) {
+ uint32_t idx;
+ if (JS_AtomGetUint32(ctx, &idx, atom) &&
+ idx < p->u.array.count) {
+ if (p->class_id == JS_CLASS_ARRAY ||
+ p->class_id == JS_CLASS_ARGUMENTS) {
+ /* Special case deleting the last element of a fast Array */
+ if (idx == p->u.array.count - 1) {
+ JS_FreeValue(ctx, p->u.array.u.values[idx]);
+ p->u.array.count = idx;
+ return TRUE;
+ }
+ if (convert_fast_array_to_array(ctx, p))
+ return -1;
+ goto redo;
+ } else {
+ return FALSE; /* not configurable */
+ }
+ }
+ } else {
+ const JSClassExoticMethods *em = ctx->rt->class_array[p->class_id].exotic;
+ if (em && em->delete_property) {
+ return em->delete_property(ctx, JS_MKPTR(JS_TAG_OBJECT, p), atom);
+ }
+ }
+ }
+ /* not found */
+ return TRUE;
+}
+
+static int call_setter(JSContext *ctx, JSObject *setter,
+ JSValueConst this_obj, JSValue val, int flags)
+{
+ JSValue ret, func;
+ if (likely(setter)) {
+ func = JS_MKPTR(JS_TAG_OBJECT, setter);
+ /* Note: the field could be removed in the setter */
+ func = JS_DupValue(ctx, func);
+ ret = JS_CallFree(ctx, func, this_obj, 1, (JSValueConst *)&val);
+ JS_FreeValue(ctx, val);
+ if (JS_IsException(ret))
+ return -1;
+ JS_FreeValue(ctx, ret);
+ } else {
+ JS_FreeValue(ctx, val);
+ if ((flags & JS_PROP_THROW) ||
+ ((flags & JS_PROP_THROW_STRICT) && is_strict_mode(ctx))) {
+ JS_ThrowTypeError(ctx, "no setter for property");
+ return -1;
+ }
+ /* XXX: should return FALSE? */
+ }
+ return TRUE;
+}
+
+/* set the array length and remove the array elements if necessary. */
+static int set_array_length(JSContext *ctx, JSObject *p, JSProperty *prop,
+ JSValue val, int flags)
+{
+ uint32_t len, idx, cur_len;
+ int i, ret;
+
+ ret = JS_ToArrayLengthFree(ctx, &len, val);
+ if (ret)
+ return -1;
+ if (likely(p->fast_array)) {
+ uint32_t old_len = p->u.array.count;
+ if (len < old_len) {
+ for(i = len; i < old_len; i++) {
+ JS_FreeValue(ctx, p->u.array.u.values[i]);
+ }
+ p->u.array.count = len;
+ }
+#ifdef CONFIG_BIGNUM
+ set_value(ctx, &prop->u.value, JS_NewUint32(ctx, len));
+#else
+ prop->u.value = JS_NewUint32(ctx, len);
+#endif
+ } else {
+ /* Note: length is always a uint32 because the object is an
+ array */
+ JS_ToUint32(ctx, &cur_len, prop->u.value);
+ if (len < cur_len) {
+ uint32_t d;
+ JSShape *sh;
+ JSShapeProperty *pr;
+
+ d = cur_len - len;
+ sh = p->shape;
+ if (d <= sh->prop_count) {
+ JSAtom atom;
+
+ /* faster to iterate */
+ while (cur_len > len) {
+ atom = JS_NewAtomUInt32(ctx, cur_len - 1);
+ ret = delete_property(ctx, p, atom);
+ JS_FreeAtom(ctx, atom);
+ if (unlikely(!ret)) {
+ /* unlikely case: property is not
+ configurable */
+ break;
+ }
+ cur_len--;
+ }
+ } else {
+ /* faster to iterate thru all the properties. Need two
+ passes in case one of the property is not
+ configurable */
+ cur_len = len;
+ for(i = 0, pr = get_shape_prop(sh); i < sh->prop_count;
+ i++, pr++) {
+ if (pr->atom != JS_ATOM_NULL &&
+ JS_AtomGetUint32(ctx, &idx, pr->atom) &&
+ idx != 0xffffffff) {
+ if (idx >= cur_len &&
+ !(pr->flags & JS_PROP_CONFIGURABLE)) {
+ cur_len = idx + 1;
+ }
+ }
+ }
+
+ for(i = 0, pr = get_shape_prop(sh); i < sh->prop_count;
+ i++, pr++) {
+ if (pr->atom != JS_ATOM_NULL &&
+ JS_AtomGetUint32(ctx, &idx, pr->atom) &&
+ idx != 0xffffffff) {
+ if (idx >= cur_len) {
+ /* remove the property */
+ delete_property(ctx, p, pr->atom);
+ /* WARNING: the shape may have been modified */
+ sh = p->shape;
+ pr = get_shape_prop(sh) + i;
+ }
+ }
+ }
+ }
+ } else {
+ cur_len = len;
+ }
+ set_value(ctx, &p->prop[0].u.value, JS_NewUint32(ctx, cur_len));
+ if (unlikely(cur_len > len)) {
+ return JS_ThrowTypeErrorOrFalse(ctx, flags, "not configurable");
+ }
+ }
+ return TRUE;
+}
+
+/* Preconditions: 'p' must be of class JS_CLASS_ARRAY, p->fast_array =
+ TRUE and p->extensible = TRUE */
+static int add_fast_array_element(JSContext *ctx, JSObject *p,
+ JSValue val, int flags)
+{
+ uint32_t new_len, array_len;
+ /* extend the array by one */
+ /* XXX: convert to slow array if new_len > 2^31-1 elements */
+ new_len = p->u.array.count + 1;
+ /* update the length if necessary. We assume that if the length is
+ not an integer, then if it >= 2^31. */
+ if (likely(JS_VALUE_GET_TAG(p->prop[0].u.value) == JS_TAG_INT)) {
+ array_len = JS_VALUE_GET_INT(p->prop[0].u.value);
+ if (new_len > array_len) {
+ if (unlikely(!(get_shape_prop(p->shape)->flags & JS_PROP_WRITABLE))) {
+ JS_FreeValue(ctx, val);
+ return JS_ThrowTypeErrorReadOnly(ctx, flags, JS_ATOM_length);
+ }
+ p->prop[0].u.value = JS_NewInt32(ctx, new_len);
+ }
+ }
+ if (unlikely(new_len > p->u.array.u1.size)) {
+ uint32_t new_size;
+ size_t slack;
+ JSValue *new_array_prop;
+ /* XXX: potential arithmetic overflow */
+ new_size = max_int(new_len, p->u.array.u1.size * 3 / 2);
+ new_array_prop = js_realloc2(ctx, p->u.array.u.values, sizeof(JSValue) * new_size, &slack);
+ if (!new_array_prop) {
+ JS_FreeValue(ctx, val);
+ return -1;
+ }
+ new_size += slack / sizeof(*new_array_prop);
+ p->u.array.u.values = new_array_prop;
+ p->u.array.u1.size = new_size;
+ }
+ p->u.array.u.values[new_len - 1] = val;
+ p->u.array.count = new_len;
+ return TRUE;
+}
+
+static void js_free_desc(JSContext *ctx, JSPropertyDescriptor *desc)
+{
+ JS_FreeValue(ctx, desc->getter);
+ JS_FreeValue(ctx, desc->setter);
+ JS_FreeValue(ctx, desc->value);
+}
+
+/* generic (and slower) version of JS_SetProperty() for Reflect.set() */
+static int JS_SetPropertyGeneric(JSContext *ctx,
+ JSObject *p, JSAtom prop,
+ JSValue val, JSValueConst this_obj,
+ int flags)
+{
+ int ret;
+ JSPropertyDescriptor desc;
+
+ while (p != NULL) {
+ if (p->is_exotic) {
+ const JSClassExoticMethods *em = ctx->rt->class_array[p->class_id].exotic;
+ if (em && em->set_property) {
+ ret = em->set_property(ctx, JS_MKPTR(JS_TAG_OBJECT, p), prop,
+ val, this_obj, flags);
+ JS_FreeValue(ctx, val);
+ return ret;
+ }
+ }
+
+ ret = JS_GetOwnProperty(ctx, &desc, p, prop);
+ if (ret < 0)
+ return ret;
+ if (ret) {
+ if (desc.flags & JS_PROP_GETSET) {
+ JSObject *setter;
+ if (JS_IsUndefined(desc.setter))
+ setter = NULL;
+ else
+ setter = JS_VALUE_GET_OBJ(desc.setter);
+ ret = call_setter(ctx, setter, this_obj, val, flags);
+ JS_FreeValue(ctx, desc.getter);
+ JS_FreeValue(ctx, desc.setter);
+ return ret;
+ } else {
+ JS_FreeValue(ctx, desc.value);
+ if (!(desc.flags & JS_PROP_WRITABLE)) {
+ goto read_only_error;
+ }
+ }
+ break;
+ }
+ p = p->shape->proto;
+ }
+
+ if (!JS_IsObject(this_obj))
+ return JS_ThrowTypeErrorOrFalse(ctx, flags, "receiver is not an object");
+
+ p = JS_VALUE_GET_OBJ(this_obj);
+
+ /* modify the property in this_obj if it already exists */
+ ret = JS_GetOwnProperty(ctx, &desc, p, prop);
+ if (ret < 0)
+ return ret;
+ if (ret) {
+ if (desc.flags & JS_PROP_GETSET) {
+ JS_FreeValue(ctx, desc.getter);
+ JS_FreeValue(ctx, desc.setter);
+ JS_FreeValue(ctx, val);
+ return JS_ThrowTypeErrorOrFalse(ctx, flags, "setter is forbidden");
+ } else {
+ JS_FreeValue(ctx, desc.value);
+ if (!(desc.flags & JS_PROP_WRITABLE) ||
+ p->class_id == JS_CLASS_MODULE_NS) {
+ read_only_error:
+ JS_FreeValue(ctx, val);
+ return JS_ThrowTypeErrorReadOnly(ctx, flags, prop);
+ }
+ }
+ ret = JS_DefineProperty(ctx, this_obj, prop, val,
+ JS_UNDEFINED, JS_UNDEFINED,
+ JS_PROP_HAS_VALUE);
+ JS_FreeValue(ctx, val);
+ return ret;
+ }
+
+ ret = JS_CreateProperty(ctx, p, prop, val, JS_UNDEFINED, JS_UNDEFINED,
+ flags |
+ JS_PROP_HAS_VALUE |
+ JS_PROP_HAS_ENUMERABLE |
+ JS_PROP_HAS_WRITABLE |
+ JS_PROP_HAS_CONFIGURABLE |
+ JS_PROP_C_W_E);
+ JS_FreeValue(ctx, val);
+ return ret;
+}
+
+/* return -1 in case of exception or TRUE or FALSE. Warning: 'val' is
+ freed by the function. 'flags' is a bitmask of JS_PROP_NO_ADD,
+ JS_PROP_THROW or JS_PROP_THROW_STRICT. If JS_PROP_NO_ADD is set,
+ the new property is not added and an error is raised. */
+int JS_SetPropertyInternal(JSContext *ctx, JSValueConst this_obj,
+ JSAtom prop, JSValue val, int flags)
+{
+ JSObject *p, *p1;
+ JSShapeProperty *prs;
+ JSProperty *pr;
+ uint32_t tag;
+ JSPropertyDescriptor desc;
+ int ret;
+#if 0
+ printf("JS_SetPropertyInternal: "); print_atom(ctx, prop); printf("\n");
+#endif
+ tag = JS_VALUE_GET_TAG(this_obj);
+ if (unlikely(tag != JS_TAG_OBJECT)) {
+ switch(tag) {
+ case JS_TAG_NULL:
+ case JS_TAG_UNDEFINED:
+ JS_FreeValue(ctx, val);
+ JS_ThrowTypeError(ctx, "value has no property");
+ return -1;
+ default:
+ /* even on a primitive type we can have setters on the prototype */
+ p = NULL;
+ p1 = JS_VALUE_GET_OBJ(JS_GetPrototype(ctx, this_obj));
+ goto prototype_lookup;
+ }
+ }
+ p = JS_VALUE_GET_OBJ(this_obj);
+retry:
+ prs = find_own_property(&pr, p, prop);
+ if (prs) {
+ if (likely((prs->flags & (JS_PROP_TMASK | JS_PROP_WRITABLE |
+ JS_PROP_LENGTH)) == JS_PROP_WRITABLE)) {
+ /* fast case */
+ set_value(ctx, &pr->u.value, val);
+ return TRUE;
+ } else if ((prs->flags & (JS_PROP_LENGTH | JS_PROP_WRITABLE)) ==
+ (JS_PROP_LENGTH | JS_PROP_WRITABLE)) {
+ assert(p->class_id == JS_CLASS_ARRAY);
+ assert(prop == JS_ATOM_length);
+ return set_array_length(ctx, p, pr, val, flags);
+ } else if ((prs->flags & JS_PROP_TMASK) == JS_PROP_GETSET) {
+ return call_setter(ctx, pr->u.getset.setter, this_obj, val, flags);
+ } else if ((prs->flags & JS_PROP_TMASK) == JS_PROP_VARREF) {
+ /* JS_PROP_WRITABLE is always true for variable
+ references, but they are write protected in module name
+ spaces. */
+ if (p->class_id == JS_CLASS_MODULE_NS)
+ goto read_only_prop;
+ set_value(ctx, pr->u.var_ref->pvalue, val);
+ return TRUE;
+ } else if ((prs->flags & JS_PROP_TMASK) == JS_PROP_AUTOINIT) {
+ /* Instantiate property and retry (potentially useless) */
+ if (JS_AutoInitProperty(ctx, p, prop, pr)) {
+ JS_FreeValue(ctx, val);
+ return -1;
+ }
+ goto retry;
+ } else {
+ goto read_only_prop;
+ }
+ }
+
+ p1 = p;
+ for(;;) {
+ if (p1->is_exotic) {
+ if (p1->fast_array) {
+ if (__JS_AtomIsTaggedInt(prop)) {
+ uint32_t idx = __JS_AtomToUInt32(prop);
+ if (idx < p1->u.array.count) {
+ if (unlikely(p == p1))
+ return JS_SetPropertyValue(ctx, this_obj, JS_NewInt32(ctx, idx), val, flags);
+ else
+ break;
+ } else if (p->class_id >= JS_CLASS_UINT8C_ARRAY &&
+ p->class_id <= JS_CLASS_FLOAT64_ARRAY) {
+ goto typed_array_oob;
+ }
+ } else if (p->class_id >= JS_CLASS_UINT8C_ARRAY &&
+ p->class_id <= JS_CLASS_FLOAT64_ARRAY) {
+ ret = JS_AtomIsNumericIndex(ctx, prop);
+ if (ret != 0) {
+ if (ret < 0) {
+ JS_FreeValue(ctx, val);
+ return -1;
+ }
+ typed_array_oob:
+ val = JS_ToNumberFree(ctx, val);
+ JS_FreeValue(ctx, val);
+ if (JS_IsException(val))
+ return -1;
+ if (typed_array_is_detached(ctx, p)) {
+ JS_ThrowTypeErrorDetachedArrayBuffer(ctx);
+ return -1;
+ }
+ return JS_ThrowTypeErrorOrFalse(ctx, flags, "out-of-bound numeric index");
+ }
+ }
+ } else {
+ const JSClassExoticMethods *em = ctx->rt->class_array[p1->class_id].exotic;
+ if (em) {
+ if (em->set_property) {
+ ret = em->set_property(ctx, JS_MKPTR(JS_TAG_OBJECT, p1), prop,
+ val, this_obj, flags);
+ JS_FreeValue(ctx, val);
+ return ret;
+ }
+ if (em->get_own_property) {
+ ret = em->get_own_property(ctx, &desc,
+ JS_MKPTR(JS_TAG_OBJECT, p1), prop);
+ if (ret < 0) {
+ JS_FreeValue(ctx, val);
+ return ret;
+ }
+ if (ret) {
+ if (desc.flags & JS_PROP_GETSET) {
+ JSObject *setter;
+ if (JS_IsUndefined(desc.setter))
+ setter = NULL;
+ else
+ setter = JS_VALUE_GET_OBJ(desc.setter);
+ ret = call_setter(ctx, setter, this_obj, val, flags);
+ JS_FreeValue(ctx, desc.getter);
+ JS_FreeValue(ctx, desc.setter);
+ return ret;
+ } else {
+ JS_FreeValue(ctx, desc.value);
+ if (!(desc.flags & JS_PROP_WRITABLE))
+ goto read_only_prop;
+ if (likely(p == p1)) {
+ ret = JS_DefineProperty(ctx, this_obj, prop, val,
+ JS_UNDEFINED, JS_UNDEFINED,
+ JS_PROP_HAS_VALUE);
+ JS_FreeValue(ctx, val);
+ return ret;
+ } else {
+ break;
+ }
+ }
+ }
+ }
+ }
+ }
+ }
+ p1 = p1->shape->proto;
+ prototype_lookup:
+ if (!p1)
+ break;
+
+ retry2:
+ prs = find_own_property(&pr, p1, prop);
+ if (prs) {
+ if ((prs->flags & JS_PROP_TMASK) == JS_PROP_GETSET) {
+ return call_setter(ctx, pr->u.getset.setter, this_obj, val, flags);
+ } else if ((prs->flags & JS_PROP_TMASK) == JS_PROP_AUTOINIT) {
+ /* Instantiate property and retry (potentially useless) */
+ if (JS_AutoInitProperty(ctx, p1, prop, pr))
+ return -1;
+ goto retry2;
+ } else if (!(prs->flags & JS_PROP_WRITABLE)) {
+ read_only_prop:
+ JS_FreeValue(ctx, val);
+ return JS_ThrowTypeErrorReadOnly(ctx, flags, prop);
+ }
+ }
+ }
+
+ if (unlikely(flags & JS_PROP_NO_ADD)) {
+ JS_FreeValue(ctx, val);
+ JS_ThrowReferenceErrorNotDefined(ctx, prop);
+ return -1;
+ }
+
+ if (unlikely(!p)) {
+ JS_FreeValue(ctx, val);
+ return JS_ThrowTypeErrorOrFalse(ctx, flags, "not an object");
+ }
+
+ if (unlikely(!p->extensible)) {
+ JS_FreeValue(ctx, val);
+ return JS_ThrowTypeErrorOrFalse(ctx, flags, "object is not extensible");
+ }
+
+ if (p->is_exotic) {
+ if (p->class_id == JS_CLASS_ARRAY && p->fast_array) {
+ uint32_t idx = __JS_AtomToUInt32(prop);
+ if (idx == p->u.array.count) {
+ /* fast case */
+ return add_fast_array_element(ctx, p, val, flags);
+ } else {
+ goto generic_create_prop;
+ }
+ } else {
+ generic_create_prop:
+ ret = JS_CreateProperty(ctx, p, prop, val, JS_UNDEFINED, JS_UNDEFINED,
+ flags |
+ JS_PROP_HAS_VALUE |
+ JS_PROP_HAS_ENUMERABLE |
+ JS_PROP_HAS_WRITABLE |
+ JS_PROP_HAS_CONFIGURABLE |
+ JS_PROP_C_W_E);
+ JS_FreeValue(ctx, val);
+ return ret;
+ }
+ }
+
+ pr = add_property(ctx, p, prop, JS_PROP_C_W_E);
+ if (unlikely(!pr)) {
+ JS_FreeValue(ctx, val);
+ return -1;
+ }
+ pr->u.value = val;
+ return TRUE;
+}
+
+/* flags can be JS_PROP_THROW or JS_PROP_THROW_STRICT */
+static int JS_SetPropertyValue(JSContext *ctx, JSValueConst this_obj,
+ JSValue prop, JSValue val, int flags)
+{
+ if (likely(JS_VALUE_GET_TAG(this_obj) == JS_TAG_OBJECT &&
+ JS_VALUE_GET_TAG(prop) == JS_TAG_INT)) {
+ JSObject *p;
+ uint32_t idx;
+ double d;
+ int32_t v;
+
+ /* fast path for array access */
+ p = JS_VALUE_GET_OBJ(this_obj);
+ idx = JS_VALUE_GET_INT(prop);
+ switch(p->class_id) {
+ case JS_CLASS_ARRAY:
+ if (unlikely(idx >= (uint32_t)p->u.array.count)) {
+ JSObject *p1;
+ JSShape *sh1;
+
+ /* fast path to add an element to the array */
+ if (idx != (uint32_t)p->u.array.count ||
+ !p->fast_array || !p->extensible)
+ goto slow_path;
+ /* check if prototype chain has a numeric property */
+ p1 = p->shape->proto;
+ while (p1 != NULL) {
+ sh1 = p1->shape;
+ if (p1->class_id == JS_CLASS_ARRAY) {
+ if (unlikely(!p1->fast_array))
+ goto slow_path;
+ } else if (p1->class_id == JS_CLASS_OBJECT) {
+ if (unlikely(sh1->has_small_array_index))
+ goto slow_path;
+ } else {
+ goto slow_path;
+ }
+ p1 = sh1->proto;
+ }
+ /* add element */
+ return add_fast_array_element(ctx, p, val, flags);
+ }
+ set_value(ctx, &p->u.array.u.values[idx], val);
+ break;
+ case JS_CLASS_ARGUMENTS:
+ if (unlikely(idx >= (uint32_t)p->u.array.count))
+ goto slow_path;
+ set_value(ctx, &p->u.array.u.values[idx], val);
+ break;
+ case JS_CLASS_UINT8C_ARRAY:
+ if (JS_ToUint8ClampFree(ctx, &v, val))
+ return -1;
+ /* Note: the conversion can detach the typed array, so the
+ array bound check must be done after */
+ if (unlikely(idx >= (uint32_t)p->u.array.count))
+ goto ta_out_of_bound;
+ p->u.array.u.uint8_ptr[idx] = v;
+ break;
+ case JS_CLASS_INT8_ARRAY:
+ case JS_CLASS_UINT8_ARRAY:
+ if (JS_ToInt32Free(ctx, &v, val))
+ return -1;
+ if (unlikely(idx >= (uint32_t)p->u.array.count))
+ goto ta_out_of_bound;
+ p->u.array.u.uint8_ptr[idx] = v;
+ break;
+ case JS_CLASS_INT16_ARRAY:
+ case JS_CLASS_UINT16_ARRAY:
+ if (JS_ToInt32Free(ctx, &v, val))
+ return -1;
+ if (unlikely(idx >= (uint32_t)p->u.array.count))
+ goto ta_out_of_bound;
+ p->u.array.u.uint16_ptr[idx] = v;
+ break;
+ case JS_CLASS_INT32_ARRAY:
+ case JS_CLASS_UINT32_ARRAY:
+ if (JS_ToInt32Free(ctx, &v, val))
+ return -1;
+ if (unlikely(idx >= (uint32_t)p->u.array.count))
+ goto ta_out_of_bound;
+ p->u.array.u.uint32_ptr[idx] = v;
+ break;
+#ifdef CONFIG_BIGNUM
+ case JS_CLASS_BIG_INT64_ARRAY:
+ case JS_CLASS_BIG_UINT64_ARRAY:
+ /* XXX: need specific conversion function */
+ {
+ int64_t v;
+ if (JS_ToBigInt64Free(ctx, &v, val))
+ return -1;
+ if (unlikely(idx >= (uint32_t)p->u.array.count))
+ goto ta_out_of_bound;
+ p->u.array.u.uint64_ptr[idx] = v;
+ }
+ break;
+#endif
+ case JS_CLASS_FLOAT32_ARRAY:
+ if (JS_ToFloat64Free(ctx, &d, val))
+ return -1;
+ if (unlikely(idx >= (uint32_t)p->u.array.count))
+ goto ta_out_of_bound;
+ p->u.array.u.float_ptr[idx] = d;
+ break;
+ case JS_CLASS_FLOAT64_ARRAY:
+ if (JS_ToFloat64Free(ctx, &d, val))
+ return -1;
+ if (unlikely(idx >= (uint32_t)p->u.array.count)) {
+ ta_out_of_bound:
+ if (typed_array_is_detached(ctx, p)) {
+ JS_ThrowTypeErrorDetachedArrayBuffer(ctx);
+ return -1;
+ } else {
+ return JS_ThrowTypeErrorOrFalse(ctx, flags, "out-of-bound numeric index");
+ }
+ }
+ p->u.array.u.double_ptr[idx] = d;
+ break;
+ default:
+ goto slow_path;
+ }
+ return TRUE;
+ } else {
+ JSAtom atom;
+ int ret;
+ slow_path:
+ atom = js_value_to_atom(ctx, prop);
+ JS_FreeValue(ctx, prop);
+ if (unlikely(atom == JS_ATOM_NULL)) {
+ JS_FreeValue(ctx, val);
+ return -1;
+ }
+ ret = JS_SetPropertyInternal(ctx, this_obj, atom, val, flags);
+ JS_FreeAtom(ctx, atom);
+ return ret;
+ }
+}
+
+int JS_SetPropertyUint32(JSContext *ctx, JSValueConst this_obj,
+ uint32_t idx, JSValue val)
+{
+ return JS_SetPropertyValue(ctx, this_obj, JS_NewUint32(ctx, idx), val,
+ JS_PROP_THROW);
+}
+
+int JS_SetPropertyInt64(JSContext *ctx, JSValueConst this_obj,
+ int64_t idx, JSValue val)
+{
+ JSAtom prop;
+ int res;
+
+ if ((uint64_t)idx <= INT32_MAX) {
+ /* fast path for fast arrays */
+ return JS_SetPropertyValue(ctx, this_obj, JS_NewInt32(ctx, idx), val,
+ JS_PROP_THROW);
+ }
+ prop = JS_NewAtomInt64(ctx, idx);
+ if (prop == JS_ATOM_NULL) {
+ JS_FreeValue(ctx, val);
+ return -1;
+ }
+ res = JS_SetProperty(ctx, this_obj, prop, val);
+ JS_FreeAtom(ctx, prop);
+ return res;
+}
+
+int JS_SetPropertyStr(JSContext *ctx, JSValueConst this_obj,
+ const char *prop, JSValue val)
+{
+ JSAtom atom;
+ int ret;
+ atom = JS_NewAtom(ctx, prop);
+ ret = JS_SetPropertyInternal(ctx, this_obj, atom, val, JS_PROP_THROW);
+ JS_FreeAtom(ctx, atom);
+ return ret;
+}
+
+/* compute the property flags. For each flag: (JS_PROP_HAS_x forces
+ it, otherwise def_flags is used)
+ Note: makes assumption about the bit pattern of the flags
+*/
+static int get_prop_flags(int flags, int def_flags)
+{
+ int mask;
+ mask = (flags >> JS_PROP_HAS_SHIFT) & JS_PROP_C_W_E;
+ return (flags & mask) | (def_flags & ~mask);
+}
+
+static int JS_CreateProperty(JSContext *ctx, JSObject *p,
+ JSAtom prop, JSValueConst val,
+ JSValueConst getter, JSValueConst setter,
+ int flags)
+{
+ JSProperty *pr;
+ int ret, prop_flags;
+
+ /* add a new property or modify an existing exotic one */
+ if (p->is_exotic) {
+ if (p->class_id == JS_CLASS_ARRAY) {
+ uint32_t idx, len;
+
+ if (p->fast_array) {
+ if (__JS_AtomIsTaggedInt(prop)) {
+ idx = __JS_AtomToUInt32(prop);
+ if (idx == p->u.array.count) {
+ if (!p->extensible)
+ goto not_extensible;
+ if (flags & (JS_PROP_HAS_GET | JS_PROP_HAS_SET))
+ goto convert_to_array;
+ prop_flags = get_prop_flags(flags, 0);
+ if (prop_flags != JS_PROP_C_W_E)
+ goto convert_to_array;
+ return add_fast_array_element(ctx, p,
+ JS_DupValue(ctx, val), flags);
+ } else {
+ goto convert_to_array;
+ }
+ } else if (JS_AtomGetUint32(ctx, &idx, prop) && idx != 0xffffffff) {
+ /* convert the fast array to normal array */
+ convert_to_array:
+ if (convert_fast_array_to_array(ctx, p))
+ return -1;
+ goto generic_array;
+ }
+ } else if (JS_AtomGetUint32(ctx, &idx, prop) && idx != 0xffffffff) {
+ JSProperty *plen;
+ JSShapeProperty *pslen;
+ generic_array:
+ /* update the length field */
+ plen = &p->prop[0];
+ JS_ToUint32(ctx, &len, plen->u.value);
+ if ((idx + 1) > len) {
+ pslen = get_shape_prop(p->shape);
+ if (unlikely(!(pslen->flags & JS_PROP_WRITABLE)))
+ return JS_ThrowTypeErrorReadOnly(ctx, flags, JS_ATOM_length);
+ /* XXX: should update the length after defining
+ the property */
+ len = idx + 1;
+ set_value(ctx, &plen->u.value, JS_NewUint32(ctx, len));
+ }
+ }
+ } else if (p->class_id >= JS_CLASS_UINT8C_ARRAY &&
+ p->class_id <= JS_CLASS_FLOAT64_ARRAY) {
+ ret = JS_AtomIsNumericIndex(ctx, prop);
+ if (ret != 0) {
+ if (ret < 0)
+ return -1;
+ return JS_ThrowTypeErrorOrFalse(ctx, flags, "cannot create numeric index in typed array");
+ }
+ } else if (!(flags & JS_PROP_NO_EXOTIC)) {
+ const JSClassExoticMethods *em = ctx->rt->class_array[p->class_id].exotic;
+ if (em) {
+ if (em->define_own_property) {
+ return em->define_own_property(ctx, JS_MKPTR(JS_TAG_OBJECT, p),
+ prop, val, getter, setter, flags);
+ }
+ ret = JS_IsExtensible(ctx, JS_MKPTR(JS_TAG_OBJECT, p));
+ if (ret < 0)
+ return -1;
+ if (!ret)
+ goto not_extensible;
+ }
+ }
+ }
+
+ if (!p->extensible) {
+ not_extensible:
+ return JS_ThrowTypeErrorOrFalse(ctx, flags, "object is not extensible");
+ }
+
+ if (flags & (JS_PROP_HAS_GET | JS_PROP_HAS_SET)) {
+ prop_flags = (flags & (JS_PROP_CONFIGURABLE | JS_PROP_ENUMERABLE)) |
+ JS_PROP_GETSET;
+ } else {
+ prop_flags = flags & JS_PROP_C_W_E;
+ }
+ pr = add_property(ctx, p, prop, prop_flags);
+ if (unlikely(!pr))
+ return -1;
+ if (flags & (JS_PROP_HAS_GET | JS_PROP_HAS_SET)) {
+ pr->u.getset.getter = NULL;
+ if ((flags & JS_PROP_HAS_GET) && JS_IsFunction(ctx, getter)) {
+ pr->u.getset.getter =
+ JS_VALUE_GET_OBJ(JS_DupValue(ctx, getter));
+ }
+ pr->u.getset.setter = NULL;
+ if ((flags & JS_PROP_HAS_SET) && JS_IsFunction(ctx, setter)) {
+ pr->u.getset.setter =
+ JS_VALUE_GET_OBJ(JS_DupValue(ctx, setter));
+ }
+ } else {
+ if (flags & JS_PROP_HAS_VALUE) {
+ pr->u.value = JS_DupValue(ctx, val);
+ } else {
+ pr->u.value = JS_UNDEFINED;
+ }
+ }
+ return TRUE;
+}
+
+/* return FALSE if not OK */
+static BOOL check_define_prop_flags(int prop_flags, int flags)
+{
+ BOOL has_accessor, is_getset;
+
+ if (!(prop_flags & JS_PROP_CONFIGURABLE)) {
+ if ((flags & (JS_PROP_HAS_CONFIGURABLE | JS_PROP_CONFIGURABLE)) ==
+ (JS_PROP_HAS_CONFIGURABLE | JS_PROP_CONFIGURABLE)) {
+ return FALSE;
+ }
+ if ((flags & JS_PROP_HAS_ENUMERABLE) &&
+ (flags & JS_PROP_ENUMERABLE) != (prop_flags & JS_PROP_ENUMERABLE))
+ return FALSE;
+ }
+ if (flags & (JS_PROP_HAS_VALUE | JS_PROP_HAS_WRITABLE |
+ JS_PROP_HAS_GET | JS_PROP_HAS_SET)) {
+ if (!(prop_flags & JS_PROP_CONFIGURABLE)) {
+ has_accessor = ((flags & (JS_PROP_HAS_GET | JS_PROP_HAS_SET)) != 0);
+ is_getset = ((prop_flags & JS_PROP_TMASK) == JS_PROP_GETSET);
+ if (has_accessor != is_getset)
+ return FALSE;
+ if (!has_accessor && !is_getset && !(prop_flags & JS_PROP_WRITABLE)) {
+ /* not writable: cannot set the writable bit */
+ if ((flags & (JS_PROP_HAS_WRITABLE | JS_PROP_WRITABLE)) ==
+ (JS_PROP_HAS_WRITABLE | JS_PROP_WRITABLE))
+ return FALSE;
+ }
+ }
+ }
+ return TRUE;
+}
+
+/* ensure that the shape can be safely modified */
+static int js_shape_prepare_update(JSContext *ctx, JSObject *p,
+ JSShapeProperty **pprs)
+{
+ JSShape *sh;
+ uint32_t idx = 0; /* prevent warning */
+
+ sh = p->shape;
+ if (sh->is_hashed) {
+ if (sh->header.ref_count != 1) {
+ if (pprs)
+ idx = *pprs - get_shape_prop(sh);
+ /* clone the shape (the resulting one is no longer hashed) */
+ sh = js_clone_shape(ctx, sh);
+ if (!sh)
+ return -1;
+ js_free_shape(ctx->rt, p->shape);
+ p->shape = sh;
+ if (pprs)
+ *pprs = get_shape_prop(sh) + idx;
+ } else {
+ js_shape_hash_unlink(ctx->rt, sh);
+ sh->is_hashed = FALSE;
+ }
+ }
+ return 0;
+}
+
+static int js_update_property_flags(JSContext *ctx, JSObject *p,
+ JSShapeProperty **pprs, int flags)
+{
+ if (flags != (*pprs)->flags) {
+ if (js_shape_prepare_update(ctx, p, pprs))
+ return -1;
+ (*pprs)->flags = flags;
+ }
+ return 0;
+}
+
+/* allowed flags:
+ JS_PROP_CONFIGURABLE, JS_PROP_WRITABLE, JS_PROP_ENUMERABLE
+ JS_PROP_HAS_GET, JS_PROP_HAS_SET, JS_PROP_HAS_VALUE,
+ JS_PROP_HAS_CONFIGURABLE, JS_PROP_HAS_WRITABLE, JS_PROP_HAS_ENUMERABLE,
+ JS_PROP_THROW, JS_PROP_NO_EXOTIC.
+ If JS_PROP_THROW is set, return an exception instead of FALSE.
+ if JS_PROP_NO_EXOTIC is set, do not call the exotic
+ define_own_property callback.
+ return -1 (exception), FALSE or TRUE.
+*/
+int JS_DefineProperty(JSContext *ctx, JSValueConst this_obj,
+ JSAtom prop, JSValueConst val,
+ JSValueConst getter, JSValueConst setter, int flags)
+{
+ JSObject *p;
+ JSShapeProperty *prs;
+ JSProperty *pr;
+ int mask, res;
+
+ if (JS_VALUE_GET_TAG(this_obj) != JS_TAG_OBJECT) {
+ JS_ThrowTypeErrorNotAnObject(ctx);
+ return -1;
+ }
+ p = JS_VALUE_GET_OBJ(this_obj);
+
+ redo_prop_update:
+ prs = find_own_property(&pr, p, prop);
+ if (prs) {
+ /* property already exists */
+ if (!check_define_prop_flags(prs->flags, flags)) {
+ not_configurable:
+ return JS_ThrowTypeErrorOrFalse(ctx, flags, "property is not configurable");
+ }
+
+ retry:
+ if (flags & (JS_PROP_HAS_VALUE | JS_PROP_HAS_WRITABLE |
+ JS_PROP_HAS_GET | JS_PROP_HAS_SET)) {
+ if (flags & (JS_PROP_HAS_GET | JS_PROP_HAS_SET)) {
+ JSObject *new_getter, *new_setter;
+
+ if (JS_IsFunction(ctx, getter)) {
+ new_getter = JS_VALUE_GET_OBJ(getter);
+ } else {
+ new_getter = NULL;
+ }
+ if (JS_IsFunction(ctx, setter)) {
+ new_setter = JS_VALUE_GET_OBJ(setter);
+ } else {
+ new_setter = NULL;
+ }
+
+ if ((prs->flags & JS_PROP_TMASK) != JS_PROP_GETSET) {
+ if (js_shape_prepare_update(ctx, p, &prs))
+ return -1;
+ /* convert to getset */
+ if ((prs->flags & JS_PROP_TMASK) == JS_PROP_VARREF) {
+ free_var_ref(ctx->rt, pr->u.var_ref);
+ } else if ((prs->flags & JS_PROP_TMASK) == JS_PROP_AUTOINIT) {
+ /* clear property and update */
+ if (js_shape_prepare_update(ctx, p, &prs))
+ return -1;
+ prs->flags &= ~JS_PROP_TMASK;
+ pr->u.value = JS_UNDEFINED;
+ goto retry;
+ } else {
+ JS_FreeValue(ctx, pr->u.value);
+ }
+ prs->flags = (prs->flags &
+ (JS_PROP_CONFIGURABLE | JS_PROP_ENUMERABLE)) |
+ JS_PROP_GETSET;
+ pr->u.getset.getter = NULL;
+ pr->u.getset.setter = NULL;
+ } else {
+ if (!(prs->flags & JS_PROP_CONFIGURABLE)) {
+ if ((flags & JS_PROP_HAS_GET) &&
+ new_getter != pr->u.getset.getter) {
+ goto not_configurable;
+ }
+ if ((flags & JS_PROP_HAS_SET) &&
+ new_setter != pr->u.getset.setter) {
+ goto not_configurable;
+ }
+ }
+ }
+ if (flags & JS_PROP_HAS_GET) {
+ if (pr->u.getset.getter)
+ JS_FreeValue(ctx, JS_MKPTR(JS_TAG_OBJECT, pr->u.getset.getter));
+ if (new_getter)
+ JS_DupValue(ctx, getter);
+ pr->u.getset.getter = new_getter;
+ }
+ if (flags & JS_PROP_HAS_SET) {
+ if (pr->u.getset.setter)
+ JS_FreeValue(ctx, JS_MKPTR(JS_TAG_OBJECT, pr->u.getset.setter));
+ if (new_setter)
+ JS_DupValue(ctx, setter);
+ pr->u.getset.setter = new_setter;
+ }
+ } else {
+ if ((prs->flags & JS_PROP_TMASK) == JS_PROP_GETSET) {
+ /* convert to data descriptor */
+ if (js_shape_prepare_update(ctx, p, &prs))
+ return -1;
+ if (pr->u.getset.getter)
+ JS_FreeValue(ctx, JS_MKPTR(JS_TAG_OBJECT, pr->u.getset.getter));
+ if (pr->u.getset.setter)
+ JS_FreeValue(ctx, JS_MKPTR(JS_TAG_OBJECT, pr->u.getset.setter));
+ prs->flags &= ~(JS_PROP_TMASK | JS_PROP_WRITABLE);
+ pr->u.value = JS_UNDEFINED;
+ } else if ((prs->flags & JS_PROP_TMASK) == JS_PROP_VARREF) {
+ /* Note: JS_PROP_VARREF is always writable */
+ } else if ((prs->flags & JS_PROP_TMASK) == JS_PROP_AUTOINIT) {
+ /* clear property and update */
+ if (js_shape_prepare_update(ctx, p, &prs))
+ return -1;
+ prs->flags &= ~JS_PROP_TMASK;
+ pr->u.value = JS_UNDEFINED;
+ } else {
+ if ((prs->flags & (JS_PROP_CONFIGURABLE | JS_PROP_WRITABLE)) == 0 &&
+ (flags & JS_PROP_HAS_VALUE) &&
+ !js_same_value(ctx, val, pr->u.value)) {
+ goto not_configurable;
+ }
+ }
+ if (prs->flags & JS_PROP_LENGTH) {
+ if (flags & JS_PROP_HAS_VALUE) {
+ res = set_array_length(ctx, p, pr, JS_DupValue(ctx, val),
+ flags);
+ } else {
+ res = TRUE;
+ }
+ /* still need to reset the writable flag if needed.
+ The JS_PROP_LENGTH is reset to have the correct
+ read-only behavior in JS_SetProperty(). */
+ if ((flags & (JS_PROP_HAS_WRITABLE | JS_PROP_WRITABLE)) ==
+ JS_PROP_HAS_WRITABLE) {
+ prs = get_shape_prop(p->shape);
+ if (js_update_property_flags(ctx, p, &prs,
+ prs->flags & ~(JS_PROP_WRITABLE | JS_PROP_LENGTH)))
+ return -1;
+ }
+ return res;
+ } else if ((prs->flags & JS_PROP_TMASK) == JS_PROP_VARREF) {
+ if (flags & JS_PROP_HAS_VALUE) {
+ if (p->class_id == JS_CLASS_MODULE_NS) {
+ /* JS_PROP_WRITABLE is always true for variable
+ references, but they are write protected in module name
+ spaces. */
+ if (!js_same_value(ctx, val, *pr->u.var_ref->pvalue))
+ goto not_configurable;
+ }
+ /* update the reference */
+ set_value(ctx, pr->u.var_ref->pvalue,
+ JS_DupValue(ctx, val));
+ }
+ /* if writable is set to false, no longer a
+ reference (for mapped arguments) */
+ if ((flags & (JS_PROP_HAS_WRITABLE | JS_PROP_WRITABLE)) == JS_PROP_HAS_WRITABLE) {
+ JSValue val1;
+ if (js_shape_prepare_update(ctx, p, &prs))
+ return -1;
+ val1 = JS_DupValue(ctx, *pr->u.var_ref->pvalue);
+ free_var_ref(ctx->rt, pr->u.var_ref);
+ pr->u.value = val1;
+ prs->flags &= ~(JS_PROP_TMASK | JS_PROP_WRITABLE);
+ }
+ } else if ((prs->flags & JS_PROP_TMASK) == JS_PROP_AUTOINIT) {
+ /* XXX: should never happen, type was reset above */
+ abort();
+ } else {
+ if (flags & JS_PROP_HAS_VALUE) {
+ JS_FreeValue(ctx, pr->u.value);
+ pr->u.value = JS_DupValue(ctx, val);
+ }
+ if (flags & JS_PROP_HAS_WRITABLE) {
+ if (js_update_property_flags(ctx, p, &prs,
+ (prs->flags & ~JS_PROP_WRITABLE) |
+ (flags & JS_PROP_WRITABLE)))
+ return -1;
+ }
+ }
+ }
+ }
+ mask = 0;
+ if (flags & JS_PROP_HAS_CONFIGURABLE)
+ mask |= JS_PROP_CONFIGURABLE;
+ if (flags & JS_PROP_HAS_ENUMERABLE)
+ mask |= JS_PROP_ENUMERABLE;
+ if (js_update_property_flags(ctx, p, &prs,
+ (prs->flags & ~mask) | (flags & mask)))
+ return -1;
+ return TRUE;
+ }
+
+ /* handle modification of fast array elements */
+ if (p->fast_array) {
+ uint32_t idx;
+ uint32_t prop_flags;
+ if (p->class_id == JS_CLASS_ARRAY) {
+ if (__JS_AtomIsTaggedInt(prop)) {
+ idx = __JS_AtomToUInt32(prop);
+ if (idx < p->u.array.count) {
+ prop_flags = get_prop_flags(flags, JS_PROP_C_W_E);
+ if (prop_flags != JS_PROP_C_W_E)
+ goto convert_to_slow_array;
+ if (flags & (JS_PROP_HAS_GET | JS_PROP_HAS_SET)) {
+ convert_to_slow_array:
+ if (convert_fast_array_to_array(ctx, p))
+ return -1;
+ else
+ goto redo_prop_update;
+ }
+ if (flags & JS_PROP_HAS_VALUE) {
+ set_value(ctx, &p->u.array.u.values[idx], JS_DupValue(ctx, val));
+ }
+ return TRUE;
+ }
+ }
+ } else if (p->class_id >= JS_CLASS_UINT8C_ARRAY &&
+ p->class_id <= JS_CLASS_FLOAT64_ARRAY) {
+ JSValue num;
+ int ret;
+
+ if (!__JS_AtomIsTaggedInt(prop)) {
+ /* slow path with to handle all numeric indexes */
+ num = JS_AtomIsNumericIndex1(ctx, prop);
+ if (JS_IsUndefined(num))
+ goto typed_array_done;
+ if (JS_IsException(num))
+ return -1;
+ ret = JS_NumberIsInteger(ctx, num);
+ if (ret < 0) {
+ JS_FreeValue(ctx, num);
+ return -1;
+ }
+ if (!ret) {
+ JS_FreeValue(ctx, num);
+ return JS_ThrowTypeErrorOrFalse(ctx, flags, "non integer index in typed array");
+ }
+ ret = JS_NumberIsNegativeOrMinusZero(ctx, num);
+ JS_FreeValue(ctx, num);
+ if (ret) {
+ return JS_ThrowTypeErrorOrFalse(ctx, flags, "negative index in typed array");
+ }
+ if (!__JS_AtomIsTaggedInt(prop))
+ goto typed_array_oob;
+ }
+ idx = __JS_AtomToUInt32(prop);
+ /* if the typed array is detached, p->u.array.count = 0 */
+ if (idx >= typed_array_get_length(ctx, p)) {
+ typed_array_oob:
+ return JS_ThrowTypeErrorOrFalse(ctx, flags, "out-of-bound index in typed array");
+ }
+ prop_flags = get_prop_flags(flags, JS_PROP_ENUMERABLE | JS_PROP_WRITABLE);
+ if (flags & (JS_PROP_HAS_GET | JS_PROP_HAS_SET) ||
+ prop_flags != (JS_PROP_ENUMERABLE | JS_PROP_WRITABLE)) {
+ return JS_ThrowTypeErrorOrFalse(ctx, flags, "invalid descriptor flags");
+ }
+ if (flags & JS_PROP_HAS_VALUE) {
+ return JS_SetPropertyValue(ctx, this_obj, JS_NewInt32(ctx, idx), JS_DupValue(ctx, val), flags);
+ }
+ return TRUE;
+ typed_array_done: ;
+ }
+ }
+
+ return JS_CreateProperty(ctx, p, prop, val, getter, setter, flags);
+}
+
+static int JS_DefineAutoInitProperty(JSContext *ctx, JSValueConst this_obj,
+ JSAtom prop, int (*init_func)(JSContext *ctx, JSObject *obj,
+ JSAtom prop, void *opaque),
+ void *opaque, int flags)
+{
+ JSObject *p;
+ JSProperty *pr;
+
+ if (JS_VALUE_GET_TAG(this_obj) != JS_TAG_OBJECT)
+ return FALSE;
+
+ p = JS_VALUE_GET_OBJ(this_obj);
+
+ if (find_own_property(&pr, p, prop)) {
+ /* property already exists */
+ abort();
+ return FALSE;
+ }
+
+ /* Specialized CreateProperty */
+ pr = add_property(ctx, p, prop, (flags & JS_PROP_C_W_E) | JS_PROP_AUTOINIT);
+ if (unlikely(!pr))
+ return -1;
+
+ pr->u.init.init_func = init_func;
+ pr->u.init.opaque = opaque;
+ return TRUE;
+}
+
+/* shortcut to add or redefine a new property value */
+int JS_DefinePropertyValue(JSContext *ctx, JSValueConst this_obj,
+ JSAtom prop, JSValue val, int flags)
+{
+ int ret;
+ ret = JS_DefineProperty(ctx, this_obj, prop, val, JS_UNDEFINED, JS_UNDEFINED,
+ flags | JS_PROP_HAS_VALUE | JS_PROP_HAS_CONFIGURABLE | JS_PROP_HAS_WRITABLE | JS_PROP_HAS_ENUMERABLE);
+ JS_FreeValue(ctx, val);
+ return ret;
+}
+
+int JS_DefinePropertyValueValue(JSContext *ctx, JSValueConst this_obj,
+ JSValue prop, JSValue val, int flags)
+{
+ JSAtom atom;
+ int ret;
+ atom = js_value_to_atom(ctx, prop);
+ JS_FreeValue(ctx, prop);
+ if (unlikely(atom == JS_ATOM_NULL)) {
+ JS_FreeValue(ctx, val);
+ return -1;
+ }
+ ret = JS_DefinePropertyValue(ctx, this_obj, atom, val, flags);
+ JS_FreeAtom(ctx, atom);
+ return ret;
+}
+
+int JS_DefinePropertyValueUint32(JSContext *ctx, JSValueConst this_obj,
+ uint32_t idx, JSValue val, int flags)
+{
+ return JS_DefinePropertyValueValue(ctx, this_obj, JS_NewUint32(ctx, idx),
+ val, flags);
+}
+
+int JS_DefinePropertyValueInt64(JSContext *ctx, JSValueConst this_obj,
+ int64_t idx, JSValue val, int flags)
+{
+ return JS_DefinePropertyValueValue(ctx, this_obj, JS_NewInt64(ctx, idx),
+ val, flags);
+}
+
+int JS_DefinePropertyValueStr(JSContext *ctx, JSValueConst this_obj,
+ const char *prop, JSValue val, int flags)
+{
+ JSAtom atom;
+ int ret;
+ atom = JS_NewAtom(ctx, prop);
+ ret = JS_DefinePropertyValue(ctx, this_obj, atom, val, flags);
+ JS_FreeAtom(ctx, atom);
+ return ret;
+}
+
+/* shortcut to add getter & setter */
+int JS_DefinePropertyGetSet(JSContext *ctx, JSValueConst this_obj,
+ JSAtom prop, JSValue getter, JSValue setter,
+ int flags)
+{
+ int ret;
+ ret = JS_DefineProperty(ctx, this_obj, prop, JS_UNDEFINED, getter, setter,
+ flags | JS_PROP_HAS_GET | JS_PROP_HAS_SET |
+ JS_PROP_HAS_CONFIGURABLE | JS_PROP_HAS_ENUMERABLE);
+ JS_FreeValue(ctx, getter);
+ JS_FreeValue(ctx, setter);
+ return ret;
+}
+
+static int JS_CreateDataPropertyUint32(JSContext *ctx, JSValueConst this_obj,
+ int64_t idx, JSValue val, int flags)
+{
+ return JS_DefinePropertyValueValue(ctx, this_obj, JS_NewInt64(ctx, idx),
+ val, flags | JS_PROP_CONFIGURABLE |
+ JS_PROP_ENUMERABLE | JS_PROP_WRITABLE);
+}
+
+static int JS_DefineObjectName(JSContext *ctx, JSValueConst obj,
+ JSAtom name, int flags)
+{
+ if (name != JS_ATOM_NULL
+ && JS_IsObject(obj)
+ && !find_own_property1(JS_VALUE_GET_OBJ(obj), JS_ATOM_name)
+ && JS_DefinePropertyValue(ctx, obj, JS_ATOM_name, JS_AtomToString(ctx, name), flags) < 0) {
+ return -1;
+ }
+ return 0;
+}
+
+static int JS_DefineObjectNameComputed(JSContext *ctx, JSValueConst obj,
+ JSValueConst str, int flags)
+{
+ if (JS_IsObject(obj) &&
+ !find_own_property1(JS_VALUE_GET_OBJ(obj), JS_ATOM_name)) {
+ JSAtom prop;
+ JSValue name_str;
+ prop = js_value_to_atom(ctx, str);
+ if (prop == JS_ATOM_NULL)
+ return -1;
+ name_str = js_get_function_name(ctx, prop);
+ JS_FreeAtom(ctx, prop);
+ if (JS_IsException(name_str))
+ return -1;
+ if (JS_DefinePropertyValue(ctx, obj, JS_ATOM_name, name_str, flags) < 0)
+ return -1;
+ }
+ return 0;
+}
+
+#define DEFINE_GLOBAL_LEX_VAR (1 << 7)
+#define DEFINE_GLOBAL_FUNC_VAR (1 << 6)
+
+static JSValue JS_ThrowSyntaxErrorVarRedeclaration(JSContext *ctx, JSAtom prop)
+{
+ char buf[ATOM_GET_STR_BUF_SIZE];
+ return JS_ThrowSyntaxError(ctx, "redeclaration of %s",
+ JS_AtomGetStr(ctx, buf, sizeof(buf), prop));
+}
+
+/* flags is 0, DEFINE_GLOBAL_LEX_VAR or DEFINE_GLOBAL_FUNC_VAR */
+/* XXX: could support exotic global object. */
+static int JS_CheckDefineGlobalVar(JSContext *ctx, JSAtom prop, int flags)
+{
+ JSObject *p;
+ JSShapeProperty *prs;
+ char buf[ATOM_GET_STR_BUF_SIZE];
+
+ p = JS_VALUE_GET_OBJ(ctx->global_obj);
+ prs = find_own_property1(p, prop);
+ /* XXX: should handle JS_PROP_AUTOINIT */
+ if (flags & DEFINE_GLOBAL_LEX_VAR) {
+ if (prs && !(prs->flags & JS_PROP_CONFIGURABLE))
+ goto fail_redeclaration;
+ } else {
+ if (!prs && !p->extensible)
+ goto define_error;
+ if (flags & DEFINE_GLOBAL_FUNC_VAR) {
+ if (prs) {
+ if (!(prs->flags & JS_PROP_CONFIGURABLE) &&
+ ((prs->flags & JS_PROP_TMASK) == JS_PROP_GETSET ||
+ ((prs->flags & (JS_PROP_WRITABLE | JS_PROP_ENUMERABLE)) !=
+ (JS_PROP_WRITABLE | JS_PROP_ENUMERABLE)))) {
+ define_error:
+ JS_ThrowTypeError(ctx, "cannot define variable %s",
+ JS_AtomGetStr(ctx, buf, sizeof(buf), prop));
+ return -1;
+ }
+ }
+ }
+ }
+ /* check if there already is a lexical declaration */
+ p = JS_VALUE_GET_OBJ(ctx->global_var_obj);
+ prs = find_own_property1(p, prop);
+ if (prs) {
+ fail_redeclaration:
+ JS_ThrowSyntaxErrorVarRedeclaration(ctx, prop);
+ return -1;
+ }
+ return 0;
+}
+
+/* def_flags is (0, DEFINE_GLOBAL_LEX_VAR) |
+ JS_PROP_CONFIGURABLE | JS_PROP_WRITABLE */
+/* XXX: could support exotic global object. */
+static int JS_DefineGlobalVar(JSContext *ctx, JSAtom prop, int def_flags)
+{
+ JSObject *p;
+ JSShapeProperty *prs;
+ JSProperty *pr;
+ JSValue val;
+ int flags;
+
+ if (def_flags & DEFINE_GLOBAL_LEX_VAR) {
+ p = JS_VALUE_GET_OBJ(ctx->global_var_obj);
+ flags = JS_PROP_ENUMERABLE | (def_flags & JS_PROP_WRITABLE) |
+ JS_PROP_CONFIGURABLE;
+ val = JS_UNINITIALIZED;
+ } else {
+ p = JS_VALUE_GET_OBJ(ctx->global_obj);
+ flags = JS_PROP_ENUMERABLE | JS_PROP_WRITABLE |
+ (def_flags & JS_PROP_CONFIGURABLE);
+ val = JS_UNDEFINED;
+ }
+ prs = find_own_property1(p, prop);
+ if (prs)
+ return 0;
+ if (!p->extensible)
+ return 0;
+ pr = add_property(ctx, p, prop, flags);
+ if (unlikely(!pr))
+ return -1;
+ pr->u.value = val;
+ return 0;
+}
+
+/* 'def_flags' is 0 or JS_PROP_CONFIGURABLE. */
+/* XXX: could support exotic global object. */
+static int JS_DefineGlobalFunction(JSContext *ctx, JSAtom prop,
+ JSValueConst func, int def_flags)
+{
+
+ JSObject *p;
+ JSShapeProperty *prs;
+ int flags;
+
+ p = JS_VALUE_GET_OBJ(ctx->global_obj);
+ prs = find_own_property1(p, prop);
+ flags = JS_PROP_HAS_VALUE | JS_PROP_THROW;
+ if (!prs || (prs->flags & JS_PROP_CONFIGURABLE)) {
+ flags |= JS_PROP_ENUMERABLE | JS_PROP_WRITABLE | def_flags |
+ JS_PROP_HAS_CONFIGURABLE | JS_PROP_HAS_WRITABLE | JS_PROP_HAS_ENUMERABLE;
+ }
+ if (JS_DefineProperty(ctx, ctx->global_obj, prop, func,
+ JS_UNDEFINED, JS_UNDEFINED, flags) < 0)
+ return -1;
+ return 0;
+}
+
+static JSValue JS_GetGlobalVar(JSContext *ctx, JSAtom prop,
+ BOOL throw_ref_error)
+{
+ JSObject *p;
+ JSShapeProperty *prs;
+ JSProperty *pr;
+
+ /* no exotic behavior is possible in global_var_obj */
+ p = JS_VALUE_GET_OBJ(ctx->global_var_obj);
+ prs = find_own_property(&pr, p, prop);
+ if (prs) {
+ /* XXX: should handle JS_PROP_TMASK properties */
+ if (unlikely(JS_IsUninitialized(pr->u.value)))
+ return JS_ThrowReferenceErrorUninitialized(ctx, prs->atom);
+ return JS_DupValue(ctx, pr->u.value);
+ }
+ return JS_GetPropertyInternal(ctx, ctx->global_obj, prop,
+ ctx->global_obj, throw_ref_error);
+}
+
+/* construct a reference to a global variable */
+static int JS_GetGlobalVarRef(JSContext *ctx, JSAtom prop, JSValue *sp)
+{
+ JSObject *p;
+ JSShapeProperty *prs;
+ JSProperty *pr;
+
+ /* no exotic behavior is possible in global_var_obj */
+ p = JS_VALUE_GET_OBJ(ctx->global_var_obj);
+ prs = find_own_property(&pr, p, prop);
+ if (prs) {
+ /* XXX: should handle JS_PROP_AUTOINIT properties? */
+ /* XXX: conformance: do these tests in
+ OP_put_var_ref/OP_get_var_ref ? */
+ if (unlikely(JS_IsUninitialized(pr->u.value))) {
+ JS_ThrowReferenceErrorUninitialized(ctx, prs->atom);
+ return -1;
+ }
+ if (unlikely(!(prs->flags & JS_PROP_WRITABLE))) {
+ return JS_ThrowTypeErrorReadOnly(ctx, JS_PROP_THROW, prop);
+ }
+ sp[0] = JS_DupValue(ctx, ctx->global_var_obj);
+ } else {
+ int ret;
+ ret = JS_HasProperty(ctx, ctx->global_obj, prop);
+ if (ret < 0)
+ return -1;
+ if (ret) {
+ sp[0] = JS_DupValue(ctx, ctx->global_obj);
+ } else {
+ sp[0] = JS_UNDEFINED;
+ }
+ }
+ sp[1] = JS_AtomToValue(ctx, prop);
+ return 0;
+}
+
+/* use for strict variable access: test if the variable exists */
+static int JS_CheckGlobalVar(JSContext *ctx, JSAtom prop)
+{
+ JSObject *p;
+ JSShapeProperty *prs;
+ int ret;
+
+ /* no exotic behavior is possible in global_var_obj */
+ p = JS_VALUE_GET_OBJ(ctx->global_var_obj);
+ prs = find_own_property1(p, prop);
+ if (prs) {
+ ret = TRUE;
+ } else {
+ ret = JS_HasProperty(ctx, ctx->global_obj, prop);
+ if (ret < 0)
+ return -1;
+ }
+ return ret;
+}
+
+/* flag = 0: normal variable write
+ flag = 1: initialize lexical variable
+ flag = 2: normal variable write, strict check was done before
+*/
+static int JS_SetGlobalVar(JSContext *ctx, JSAtom prop, JSValue val,
+ int flag)
+{
+ JSObject *p;
+ JSShapeProperty *prs;
+ JSProperty *pr;
+ int flags;
+
+ /* no exotic behavior is possible in global_var_obj */
+ p = JS_VALUE_GET_OBJ(ctx->global_var_obj);
+ prs = find_own_property(&pr, p, prop);
+ if (prs) {
+ /* XXX: should handle JS_PROP_AUTOINIT properties? */
+ if (flag != 1) {
+ if (unlikely(JS_IsUninitialized(pr->u.value))) {
+ JS_ThrowReferenceErrorUninitialized(ctx, prs->atom);
+ return -1;
+ }
+ if (unlikely(!(prs->flags & JS_PROP_WRITABLE))) {
+ JS_FreeValue(ctx, val);
+ return JS_ThrowTypeErrorReadOnly(ctx, JS_PROP_THROW, prop);
+ }
+ }
+ set_value(ctx, &pr->u.value, val);
+ return 0;
+ }
+
+ flags = JS_PROP_THROW_STRICT;
+ if (flag != 2 && is_strict_mode(ctx))
+ flags |= JS_PROP_NO_ADD;
+ return JS_SetPropertyInternal(ctx, ctx->global_obj, prop, val, flags);
+}
+
+/* return -1, FALSE or TRUE. return FALSE if not configurable or
+ invalid object. return -1 in case of exception.
+ flags can be 0, JS_PROP_THROW or JS_PROP_THROW_STRICT */
+int JS_DeleteProperty(JSContext *ctx, JSValueConst obj, JSAtom prop, int flags)
+{
+ if (JS_VALUE_GET_TAG(obj) == JS_TAG_OBJECT) {
+ JSObject *p = JS_VALUE_GET_OBJ(obj);
+ int res = delete_property(ctx, p, prop);
+ if (res != FALSE)
+ return res;
+ }
+ if ((flags & JS_PROP_THROW) ||
+ ((flags & JS_PROP_THROW_STRICT) && is_strict_mode(ctx))) {
+ JS_ThrowTypeError(ctx, "could not delete property");
+ return -1;
+ }
+ return FALSE;
+}
+
+int JS_DeletePropertyInt64(JSContext *ctx, JSValueConst obj, int64_t idx, int flags)
+{
+ JSAtom prop;
+ int res;
+
+ if ((uint64_t)idx <= JS_ATOM_MAX_INT) {
+ /* fast path for fast arrays */
+ return JS_DeleteProperty(ctx, obj, __JS_AtomFromUInt32(idx), flags);
+ }
+ prop = JS_NewAtomInt64(ctx, idx);
+ if (prop == JS_ATOM_NULL)
+ return -1;
+ res = JS_DeleteProperty(ctx, obj, prop, flags);
+ JS_FreeAtom(ctx, prop);
+ return res;
+}
+
+BOOL JS_IsFunction(JSContext *ctx, JSValueConst val)
+{
+ JSObject *p;
+ if (JS_VALUE_GET_TAG(val) != JS_TAG_OBJECT)
+ return FALSE;
+ p = JS_VALUE_GET_OBJ(val);
+ switch(p->class_id) {
+ case JS_CLASS_BYTECODE_FUNCTION:
+ case JS_CLASS_C_FUNCTION:
+ case JS_CLASS_BOUND_FUNCTION:
+ return TRUE;
+ case JS_CLASS_PROXY:
+ return p->u.proxy_data->is_func;
+ default:
+ return (ctx->rt->class_array[p->class_id].call != NULL);
+ }
+}
+
+BOOL JS_IsCFunction(JSContext *ctx, JSValueConst val, JSCFunction *func, int magic)
+{
+ JSObject *p;
+ if (JS_VALUE_GET_TAG(val) != JS_TAG_OBJECT)
+ return FALSE;
+ p = JS_VALUE_GET_OBJ(val);
+ if (p->class_id == JS_CLASS_C_FUNCTION)
+ return (p->u.cfunc.c_function.generic == func && p->u.cfunc.magic == magic);
+ else
+ return FALSE;
+}
+
+BOOL JS_IsConstructor(JSContext *ctx, JSValueConst val)
+{
+ JSObject *p;
+ if (JS_VALUE_GET_TAG(val) != JS_TAG_OBJECT)
+ return FALSE;
+ p = JS_VALUE_GET_OBJ(val);
+ return p->is_constructor;
+}
+
+static BOOL JS_SetConstructorBit(JSContext *ctx, JSValueConst func_obj,
+ BOOL val)
+{
+ JSObject *p;
+ if (JS_VALUE_GET_TAG(func_obj) != JS_TAG_OBJECT)
+ return FALSE;
+ p = JS_VALUE_GET_OBJ(func_obj);
+ p->is_constructor = val;
+ return TRUE;
+}
+
+BOOL JS_IsError(JSContext *ctx, JSValueConst val)
+{
+ JSObject *p;
+ if (JS_VALUE_GET_TAG(val) != JS_TAG_OBJECT)
+ return FALSE;
+ p = JS_VALUE_GET_OBJ(val);
+ if (p->class_id == JS_CLASS_ERROR)
+ return TRUE;
+ if (ctx->is_error_property_enabled) {
+ /* check for a special property for test262 test suites */
+ JSValue isError;
+ isError = JS_GetPropertyStr(ctx, val, "isError");
+ return JS_ToBoolFree(ctx, isError);
+ } else {
+ return FALSE;
+ }
+}
+
+/* only used for test262 test suites */
+void JS_EnableIsErrorProperty(JSContext *ctx, BOOL enable)
+{
+ ctx->is_error_property_enabled = enable;
+}
+
+/* used to avoid catching interrupt exceptions */
+BOOL JS_IsUncatchableError(JSContext *ctx, JSValueConst val)
+{
+ JSObject *p;
+ if (JS_VALUE_GET_TAG(val) != JS_TAG_OBJECT)
+ return FALSE;
+ p = JS_VALUE_GET_OBJ(val);
+ return p->class_id == JS_CLASS_ERROR && p->is_uncatchable_error;
+}
+
+void JS_SetUncatchableError(JSContext *ctx, JSValueConst val, BOOL flag)
+{
+ JSObject *p;
+ if (JS_VALUE_GET_TAG(val) != JS_TAG_OBJECT)
+ return;
+ p = JS_VALUE_GET_OBJ(val);
+ if (p->class_id == JS_CLASS_ERROR)
+ p->is_uncatchable_error = flag;
+}
+
+void JS_ResetUncatchableError(JSContext *ctx)
+{
+ JS_SetUncatchableError(ctx, ctx->current_exception, FALSE);
+}
+
+void JS_SetOpaque(JSValue obj, void *opaque)
+{
+ JSObject *p;
+ if (JS_VALUE_GET_TAG(obj) == JS_TAG_OBJECT) {
+ p = JS_VALUE_GET_OBJ(obj);
+ p->u.opaque = opaque;
+ }
+}
+
+/* return NULL if not an object of class class_id */
+void *JS_GetOpaque(JSValueConst obj, JSClassID class_id)
+{
+ JSObject *p;
+ if (JS_VALUE_GET_TAG(obj) != JS_TAG_OBJECT)
+ return NULL;
+ p = JS_VALUE_GET_OBJ(obj);
+ if (p->class_id != class_id)
+ return NULL;
+ return p->u.opaque;
+}
+
+void *JS_GetOpaque2(JSContext *ctx, JSValueConst obj, JSClassID class_id)
+{
+ void *p = JS_GetOpaque(obj, class_id);
+ if (unlikely(!p)) {
+ JS_ThrowTypeErrorInvalidClass(ctx, class_id);
+ }
+ return p;
+}
+
+#define HINT_STRING 0
+#define HINT_NUMBER 1
+#define HINT_NONE 2
+#ifdef CONFIG_BIGNUM
+#define HINT_INTEGER 3
+#endif
+/* don't try Symbol.toPrimitive */
+#define HINT_FORCE_ORDINARY (1 << 4)
+
+static JSValue JS_ToPrimitiveFree(JSContext *ctx, JSValue val, int hint)
+{
+ int i;
+ BOOL force_ordinary;
+
+ JSAtom method_name;
+ JSValue method, ret;
+ if (JS_VALUE_GET_TAG(val) != JS_TAG_OBJECT)
+ return val;
+ force_ordinary = hint & HINT_FORCE_ORDINARY;
+ hint &= ~HINT_FORCE_ORDINARY;
+ if (!force_ordinary) {
+ method = JS_GetProperty(ctx, val, JS_ATOM_Symbol_toPrimitive);
+ if (JS_IsException(method))
+ goto exception;
+ /* ECMA says *If exoticToPrim is not undefined* but tests in
+ test262 use null as a non callable converter */
+ if (!JS_IsUndefined(method) && !JS_IsNull(method)) {
+ JSAtom atom;
+ JSValue arg;
+ switch(hint) {
+ case HINT_STRING:
+ atom = JS_ATOM_string;
+ break;
+ case HINT_NUMBER:
+ atom = JS_ATOM_number;
+ break;
+ default:
+ case HINT_NONE:
+ atom = JS_ATOM_default;
+ break;
+#ifdef CONFIG_BIGNUM
+ case HINT_INTEGER:
+ atom = JS_ATOM_integer;
+ break;
+#endif
+ }
+ arg = JS_AtomToString(ctx, atom);
+ ret = JS_CallFree(ctx, method, val, 1, (JSValueConst *)&arg);
+ JS_FreeValue(ctx, arg);
+ if (JS_IsException(ret))
+ goto exception;
+ JS_FreeValue(ctx, val);
+ if (JS_VALUE_GET_TAG(ret) != JS_TAG_OBJECT)
+ return ret;
+ JS_FreeValue(ctx, ret);
+ return JS_ThrowTypeError(ctx, "toPrimitive");
+ }
+ }
+ if (hint != HINT_STRING)
+ hint = HINT_NUMBER;
+ for(i = 0; i < 2; i++) {
+ if ((i ^ hint) == 0) {
+ method_name = JS_ATOM_toString;
+ } else {
+ method_name = JS_ATOM_valueOf;
+ }
+ method = JS_GetProperty(ctx, val, method_name);
+ if (JS_IsException(method))
+ goto exception;
+ if (JS_IsFunction(ctx, method)) {
+ ret = JS_CallFree(ctx, method, val, 0, NULL);
+ if (JS_IsException(ret))
+ goto exception;
+ if (JS_VALUE_GET_TAG(ret) != JS_TAG_OBJECT) {
+ JS_FreeValue(ctx, val);
+ return ret;
+ }
+ JS_FreeValue(ctx, ret);
+ } else {
+ JS_FreeValue(ctx, method);
+ }
+ }
+ JS_ThrowTypeError(ctx, "toPrimitive");
+exception:
+ JS_FreeValue(ctx, val);
+ return JS_EXCEPTION;
+}
+
+static JSValue JS_ToPrimitive(JSContext *ctx, JSValueConst val, int hint)
+{
+ return JS_ToPrimitiveFree(ctx, JS_DupValue(ctx, val), hint);
+}
+
+static int JS_ToBoolFree(JSContext *ctx, JSValue val)
+{
+ uint32_t tag = JS_VALUE_GET_TAG(val);
+ switch(tag) {
+ case JS_TAG_INT:
+ return JS_VALUE_GET_INT(val) != 0;
+ case JS_TAG_BOOL:
+ case JS_TAG_NULL:
+ case JS_TAG_UNDEFINED:
+ return JS_VALUE_GET_INT(val);
+ case JS_TAG_EXCEPTION:
+ return -1;
+ case JS_TAG_STRING:
+ {
+ BOOL ret = JS_VALUE_GET_STRING(val)->len != 0;
+ JS_FreeValue(ctx, val);
+ return ret;
+ }
+#ifdef CONFIG_BIGNUM
+ case JS_TAG_BIG_INT:
+ case JS_TAG_BIG_FLOAT:
+ {
+ JSBigFloat *p = JS_VALUE_GET_PTR(val);
+ BOOL ret;
+ ret = p->num.expn != BF_EXP_ZERO && p->num.expn != BF_EXP_NAN;
+ JS_FreeValue(ctx, val);
+ return ret;
+ }
+#endif
+ default:
+ if (JS_TAG_IS_FLOAT64(tag)) {
+ double d = JS_VALUE_GET_FLOAT64(val);
+ return !isnan(d) && d != 0;
+ } else {
+ JS_FreeValue(ctx, val);
+ return TRUE;
+ }
+ }
+}
+
+int JS_ToBool(JSContext *ctx, JSValueConst val)
+{
+ return JS_ToBoolFree(ctx, JS_DupValue(ctx, val));
+}
+
+static int skip_spaces(const char *pc)
+{
+ const uint8_t *p, *p_next, *p_start;
+ uint32_t c;
+
+ p = p_start = (const uint8_t *)pc;
+ for (;;) {
+ c = *p;
+ if (c < 128) {
+ if (!((c >= 0x09 && c <= 0x0d) || (c == 0x20)))
+ break;
+ p++;
+ } else {
+ c = unicode_from_utf8(p, UTF8_CHAR_LEN_MAX, &p_next);
+ if (!lre_is_space(c))
+ break;
+ p = p_next;
+ }
+ }
+ return p - p_start;
+}
+
+#ifdef CONFIG_BIGNUM
+
+/* force big int type if integer result */
+#define BF_ATOF_BIG_INT (1 << 30)
+/* return JS_EXCEPTION if invalid syntax. Otherwise return NaN */
+#define BF_ATOF_THROW (1 << 29)
+#define BF_ATOF_FLOAT64 (1 << 28)
+
+static JSValue js_atof(JSContext *ctx, const char *p, const char **pp,
+ int radix, int flags)
+{
+ bf_t a_s, *a = &a_s;
+ int res;
+ slimb_t prec;
+ JSValue val;
+
+ bf_init(ctx->bf_ctx, a);
+ if (flags & BF_ATOF_FLOAT64) {
+ prec = 53;
+ flags |= bf_set_exp_bits(11) | BF_RNDN | BF_FLAG_SUBNORMAL;
+ } else {
+ /* use the current precision */
+ prec = ctx->fp_env.prec;
+ flags |= ctx->fp_env.flags;
+ }
+ p += skip_spaces(p);
+ res = bf_atof(a, p, &p, radix, prec, flags);
+ if ((flags & BF_ATOF_THROW) && bf_is_nan(a)) {
+ bf_delete(a);
+ return JS_EXCEPTION;
+ }
+ if (res & BF_ATOF_ST_INTEGER) {
+ val = JS_NewBigInt2(ctx, a, (flags & BF_ATOF_BIG_INT) != 0);
+ } else if (flags & BF_ATOF_FLOAT64) {
+ double d;
+ bf_get_float64(a, &d, BF_RNDN);
+ bf_delete(a);
+ /* return int or float64 */
+ val = JS_NewFloat64(ctx, d);
+ } else {
+ val = JS_NewBigFloat(ctx, a);
+ }
+ if (pp)
+ *pp = p;
+ return val;
+}
+
+#else
+
+static inline int to_digit(int c)
+{
+ if (c >= '0' && c <= '9')
+ return c - '0';
+ else if (c >= 'A' && c <= 'Z')
+ return c - 'A' + 10;
+ else if (c >= 'a' && c <= 'z')
+ return c - 'a' + 10;
+ else
+ return 36;
+}
+
+#define ATOD_INT_ONLY (1 << 0)
+/* return JS_EXCEPTION if invalid syntax. Otherwise return NaN */
+#define ATOD_THROW (1 << 1)
+/* accept Oo and Ob prefixes in addition to 0x prefix if radix = 0 */
+#define ATOD_ACCEPT_BIN_OCT (1 << 2)
+/* if set return NaN if empty number string */
+#define ATOD_NAN_IF_EMPTY (1 << 3)
+/* accept O prefix as octal if radix == 0 and properly formed (Annex B) */
+#define ATOD_ACCEPT_LEGACY_OCTAL (1 << 4)
+/* accept _ between digits as a digit separator */
+#define ATOD_ACCEPT_UNDERSCORES (1 << 5)
+
+#if defined(_MSC_VER)
+static inline float Infinite() {
+ int value = 0x7f800000;
+ return *(float*)&value;
+}
+#endif
+
+/* radix = 0 accepts prefixes. radix = 16 also
+ accepts 0x prefix. radix must be 0 or between 2 and 36 */
+static JSValue js_atod(JSContext *ctx, const char *str, const char **pp,
+ int radix, int flags)
+{
+ const char *p;
+ const char *p_start;
+ int is_neg, c, sep;
+ double d;
+
+ /* optional separator between digits */
+ sep = (flags & ATOD_ACCEPT_UNDERSCORES) ? '_' : 256;
+
+ p = str + skip_spaces(str);
+ p_start = p;
+ is_neg = 0;
+ if (p[0] == '+') {
+ p++;
+ p_start++;
+ if (!(flags & ATOD_INT_ONLY))
+ goto no_radix_prefix;
+ } else if (p[0] == '-') {
+ is_neg = 1;
+ p++;
+ p_start++;
+ if (!(flags & ATOD_INT_ONLY))
+ goto no_radix_prefix;
+ }
+ if (p[0] == '0') {
+ if ((p[1] == 'x' || p[1] == 'X') &&
+ (radix == 0 || radix == 16)) {
+ p += 2;
+ radix = 16;
+ } else if ((p[1] == 'o' || p[1] == 'O') &&
+ radix == 0 && (flags & ATOD_ACCEPT_BIN_OCT)) {
+ p += 2;
+ radix = 8;
+ } else if ((p[1] == 'b' || p[1] == 'B') &&
+ radix == 0 && (flags & ATOD_ACCEPT_BIN_OCT)) {
+ p += 2;
+ radix = 2;
+ } else if ((p[1] >= '0' && p[1] <= '7') &&
+ radix == 0 && (flags & ATOD_ACCEPT_LEGACY_OCTAL)) {
+ int i;
+ for (i = 2; (p[i] >= '0' && p[i] <= '7') ||
+ (p[i] == sep && is_digit((uint8_t)p[i + 1])); i++)
+ continue;
+ if (p[i] == '8' || p[i] == '9')
+ goto no_prefix;
+ p += 1;
+ radix = 8;
+ } else {
+ goto no_prefix;
+ }
+ /* there must be a digit after the prefix */
+ if (to_digit((uint8_t)*p) >= radix)
+ goto fail;
+ no_prefix: ;
+ } else {
+ no_radix_prefix:
+ if (!(flags & ATOD_INT_ONLY) && strstart(p, "Infinity", &p)) {
+#if defined(_MSC_VER)
+ d = Infinite();
+#else
+ d = 1.0 / 0.0;
+#endif
+ goto done;
+ }
+ }
+ if (radix == 0)
+ radix = 10;
+ if ((flags & ATOD_INT_ONLY) || radix != 10) {
+ uint64_t n_max, n;
+ int int_exp;
+
+ /* skip leading zeros */
+ while (*p == '0')
+ p++;
+ n = 0;
+ if (radix == 10)
+ n_max = ((uint64_t)-1 - 9) / 10; /* most common case */
+ else
+ n_max = ((uint64_t)-1 - (radix - 1)) / radix;
+ /* XXX: could be more precise */
+ int_exp = 0;
+ while (*p != '\0') {
+ if (*p == sep && to_digit(p[1]) < radix)
+ p++;
+ c = to_digit((uint8_t)*p);
+ if (c >= radix)
+ break;
+ if (n <= n_max) {
+ n = n * radix + c;
+ } else {
+ int_exp++;
+ }
+ p++;
+ }
+ d = n;
+ if (int_exp != 0) {
+ d *= pow(radix, int_exp);
+ }
+ } else {
+ p_start = p;
+ while (is_digit((uint8_t)*p)
+ || (*p == sep && (p != p_start + 1 || p[-1] != '0') &&
+ is_digit((uint8_t)p[1]))) {
+ p++;
+ }
+ if (*p == '.' && (p > p_start || is_digit((uint8_t)p[1]))) {
+ p++;
+ while (is_digit((uint8_t)*p) || (*p == sep && is_digit((uint8_t)p[1])))
+ p++;
+ }
+ if (p > p_start && (*p == 'e' || *p == 'E')) {
+ const char *p1 = p + 1;
+ if (*p1 == '+') {
+ p1++;
+ } else if (*p1 == '-') {
+ p1++;
+ }
+ if (is_digit((uint8_t)*p1)) {
+ p = p1 + 1;
+ while (is_digit((uint8_t)*p) || (*p == sep && is_digit((uint8_t)p[1])))
+ p++;
+ }
+ }
+ if (*p == '\0' && sep != '_') {
+ d = strtod(p_start, NULL);
+ } else {
+ char buf1[64], *buf;
+ int i, j, len;
+ BOOL buf_allocated;
+
+ buf = buf1;
+ buf_allocated = FALSE;
+ len = p - p_start;
+ if (len >= sizeof(buf1)) {
+ buf = js_malloc(ctx, len + 1);
+ if (!buf)
+ return JS_EXCEPTION;
+ buf_allocated = TRUE;
+ }
+ for (i = j = 0; i < len; i++) {
+ if (p_start[i] != '_')
+ buf[j++] = p_start[i];
+ }
+ buf[j] = '\0';
+ d = strtod(buf, NULL);
+ if (buf_allocated)
+ js_free(ctx, buf);
+ }
+ }
+done:
+ if (is_neg)
+ d = -d;
+ if (p == p_start && (flags & ATOD_NAN_IF_EMPTY)) {
+ d = JS_FLOAT64_NAN;
+ }
+ if (pp)
+ *pp = p;
+ return JS_NewFloat64(ctx, d);
+ fail:
+ if (pp)
+ *pp = p;
+ if (flags & ATOD_THROW)
+ return JS_EXCEPTION;
+ else
+ return JS_NAN;
+}
+#endif
+
+typedef enum JSToNumberHintEnum {
+ TON_FLAG_NUMBER,
+ TON_FLAG_INTEGER,
+ TON_FLAG_NUMERIC,
+} JSToNumberHintEnum;
+
+static JSValue JS_ToNumberHintFree(JSContext *ctx, JSValue val,
+ JSToNumberHintEnum flag)
+{
+ uint32_t tag;
+ JSValue ret;
+ int hint;
+
+ redo:
+ tag = JS_VALUE_GET_NORM_TAG(val);
+ switch(tag) {
+#ifdef CONFIG_BIGNUM
+ case JS_TAG_BIG_INT:
+ if (flag == TON_FLAG_NUMBER && !is_bignum_mode(ctx)) {
+ JS_FreeValue(ctx, val);
+ return JS_ThrowTypeError(ctx, "cannot convert bigint to number");
+ }
+ /* fall thru */
+ case JS_TAG_BIG_FLOAT:
+#endif
+ case JS_TAG_FLOAT64:
+ case JS_TAG_INT:
+ case JS_TAG_EXCEPTION:
+ ret = val;
+ break;
+ case JS_TAG_BOOL:
+ case JS_TAG_NULL:
+ ret = JS_NewInt32(ctx, JS_VALUE_GET_INT(val));
+ break;
+ case JS_TAG_UNDEFINED:
+ ret = JS_NAN;
+ break;
+ case JS_TAG_OBJECT:
+#ifdef CONFIG_BIGNUM
+ hint = flag == TON_FLAG_INTEGER ? HINT_INTEGER : HINT_NUMBER;
+#else
+ hint = HINT_NUMBER;
+#endif
+ val = JS_ToPrimitiveFree(ctx, val, hint);
+ if (JS_IsException(val))
+ return JS_EXCEPTION;
+ goto redo;
+ case JS_TAG_STRING:
+ {
+ const char *str;
+ const char *p;
+
+ str = JS_ToCString(ctx, val);
+ JS_FreeValue(ctx, val);
+ if (!str)
+ return JS_EXCEPTION;
+#ifdef CONFIG_BIGNUM
+ {
+ int flags;
+ flags = BF_ATOF_BIN_OCT | BF_ATOF_NO_PREFIX_AFTER_SIGN |
+ BF_ATOF_JS_QUIRKS | BF_ATOF_FLOAT64;
+ if (is_bignum_mode(ctx))
+ flags |= BF_ATOF_INT_PREC_INF;
+ else
+ flags |= BF_ATOF_ONLY_DEC_FLOAT;
+ ret = js_atof(ctx, str, &p, 0, flags);
+ }
+#else
+ ret = js_atod(ctx, str, &p, 0, ATOD_ACCEPT_BIN_OCT);
+#endif
+ p += skip_spaces(p);
+ if (*p != '\0') {
+ JS_FreeValue(ctx, ret);
+ ret = JS_NAN;
+ }
+ JS_FreeCString(ctx, str);
+ }
+ break;
+ case JS_TAG_SYMBOL:
+ JS_FreeValue(ctx, val);
+ return JS_ThrowTypeError(ctx, "cannot convert symbol to number");
+ default:
+ JS_FreeValue(ctx, val);
+ ret = JS_NAN;
+ break;
+ }
+ return ret;
+}
+
+static JSValue JS_ToNumberFree(JSContext *ctx, JSValue val)
+{
+ return JS_ToNumberHintFree(ctx, val, TON_FLAG_NUMBER);
+}
+
+#ifdef CONFIG_BIGNUM
+static JSValue JS_ToNumericFree(JSContext *ctx, JSValue val)
+{
+ return JS_ToNumberHintFree(ctx, val, TON_FLAG_NUMERIC);
+}
+
+static JSValue JS_ToNumeric(JSContext *ctx, JSValueConst val)
+{
+ return JS_ToNumericFree(ctx, JS_DupValue(ctx, val));
+}
+#endif
+
+static __exception int __JS_ToFloat64Free(JSContext *ctx, double *pres,
+ JSValue val)
+{
+ double d;
+ uint32_t tag;
+
+ val = JS_ToNumberFree(ctx, val);
+ if (JS_IsException(val)) {
+ *pres = JS_FLOAT64_NAN;
+ return -1;
+ }
+ tag = JS_VALUE_GET_NORM_TAG(val);
+ switch(tag) {
+ case JS_TAG_INT:
+ d = JS_VALUE_GET_INT(val);
+ break;
+ case JS_TAG_FLOAT64:
+ d = JS_VALUE_GET_FLOAT64(val);
+ break;
+#ifdef CONFIG_BIGNUM
+ case JS_TAG_BIG_INT:
+ case JS_TAG_BIG_FLOAT:
+ {
+ JSBigFloat *p = JS_VALUE_GET_PTR(val);
+ /* XXX: there can be a double rounding issue with some
+ primitives (such as JS_ToUint8ClampFree()), but it is
+ not critical to fix it. */
+ bf_get_float64(&p->num, &d, BF_RNDN);
+ JS_FreeValue(ctx, val);
+ }
+ break;
+#endif
+ default:
+ abort();
+ }
+ *pres = d;
+ return 0;
+}
+
+static inline int JS_ToFloat64Free(JSContext *ctx, double *pres, JSValue val)
+{
+ uint32_t tag;
+
+ tag = JS_VALUE_GET_TAG(val);
+ if (tag <= JS_TAG_NULL) {
+ *pres = JS_VALUE_GET_INT(val);
+ return 0;
+ } else if (JS_TAG_IS_FLOAT64(tag)) {
+ *pres = JS_VALUE_GET_FLOAT64(val);
+ return 0;
+ } else {
+ return __JS_ToFloat64Free(ctx, pres, val);
+ }
+}
+
+int JS_ToFloat64(JSContext *ctx, double *pres, JSValueConst val)
+{
+ return JS_ToFloat64Free(ctx, pres, JS_DupValue(ctx, val));
+}
+
+static JSValue JS_ToNumber(JSContext *ctx, JSValueConst val)
+{
+ return JS_ToNumberFree(ctx, JS_DupValue(ctx, val));
+}
+
+#if defined(_MSC_VER)
+static JSValue JS_ToIntegerFree(JSContext *ctx, JSValue val)
+#else
+static __attribute__((unused)) JSValue JS_ToIntegerFree(JSContext *ctx, JSValue val)
+#endif
+{
+ uint32_t tag;
+ JSValue ret;
+
+ redo:
+ tag = JS_VALUE_GET_NORM_TAG(val);
+ switch(tag) {
+ case JS_TAG_INT:
+ case JS_TAG_BOOL:
+ case JS_TAG_NULL:
+ case JS_TAG_UNDEFINED:
+ ret = JS_NewInt32(ctx, JS_VALUE_GET_INT(val));
+ break;
+ case JS_TAG_FLOAT64:
+ {
+ double d = JS_VALUE_GET_FLOAT64(val);
+ if (isnan(d)) {
+ ret = JS_NewInt32(ctx, 0);
+ } else {
+ /* convert -0 to +0 */
+ /* XXX: should not be done here ? */
+ d = trunc(d) + 0.0;
+ ret = JS_NewFloat64(ctx, d);
+ }
+ }
+ break;
+#ifdef CONFIG_BIGNUM
+ case JS_TAG_BIG_INT:
+ if (!is_bignum_mode(ctx))
+ goto to_number;
+ ret = val;
+ break;
+ case JS_TAG_BIG_FLOAT:
+ {
+ bf_t a_s, *a, r_s, *r = &r_s;
+ BOOL is_float, is_nan;
+
+ a = JS_ToBigFloat(ctx, &is_float, &a_s, val);
+ if (!bf_is_finite(a)) {
+ is_nan = bf_is_nan(a);
+ if (is_nan)
+ ret = JS_NewInt32(ctx, 0);
+ else
+ ret = JS_DupValue(ctx, val);
+ } else {
+ bf_init(ctx->bf_ctx, r);
+ bf_set(r, a);
+ bf_rint(r, BF_PREC_INF, BF_RNDZ);
+ ret = JS_NewBigInt(ctx, r);
+ }
+ if (a == &a_s)
+ bf_delete(a);
+ JS_FreeValue(ctx, val);
+ }
+ break;
+#endif
+ default:
+#ifdef CONFIG_BIGNUM
+ to_number:
+#endif
+ val = JS_ToNumberFree(ctx, val);
+ if (JS_IsException(val))
+ return val;
+ goto redo;
+ }
+ return ret;
+}
+
+/* Note: the integer value is satured to 32 bits */
+static int JS_ToInt32SatFree(JSContext *ctx, int *pres, JSValue val)
+{
+ uint32_t tag;
+ int ret;
+
+ redo:
+ tag = JS_VALUE_GET_NORM_TAG(val);
+ switch(tag) {
+ case JS_TAG_INT:
+ case JS_TAG_BOOL:
+ case JS_TAG_NULL:
+ case JS_TAG_UNDEFINED:
+ ret = JS_VALUE_GET_INT(val);
+ break;
+ case JS_TAG_EXCEPTION:
+ *pres = 0;
+ return -1;
+ case JS_TAG_FLOAT64:
+ {
+ double d = JS_VALUE_GET_FLOAT64(val);
+ if (isnan(d)) {
+ ret = 0;
+ } else {
+ if (d < INT32_MIN)
+ ret = INT32_MIN;
+ else if (d > INT32_MAX)
+ ret = INT32_MAX;
+ else
+ ret = (int)d;
+ }
+ }
+ break;
+#ifdef CONFIG_BIGNUM
+ case JS_TAG_BIG_FLOAT:
+ to_bf:
+ {
+ JSBigFloat *p = JS_VALUE_GET_PTR(val);
+ bf_get_int32(&ret, &p->num, 0);
+ JS_FreeValue(ctx, val);
+ }
+ break;
+ case JS_TAG_BIG_INT:
+ if (is_bignum_mode(ctx))
+ goto to_bf;
+ /* fall thru */
+#endif
+ default:
+ val = JS_ToNumberFree(ctx, val);
+ if (JS_IsException(val)) {
+ *pres = 0;
+ return -1;
+ }
+ goto redo;
+ }
+ *pres = ret;
+ return 0;
+}
+
+int JS_ToInt32Sat(JSContext *ctx, int *pres, JSValueConst val)
+{
+ return JS_ToInt32SatFree(ctx, pres, JS_DupValue(ctx, val));
+}
+
+int JS_ToInt32Clamp(JSContext *ctx, int *pres, JSValueConst val,
+ int min, int max, int min_offset)
+{
+ int res = JS_ToInt32SatFree(ctx, pres, JS_DupValue(ctx, val));
+ if (res == 0) {
+ if (*pres < min) {
+ *pres += min_offset;
+ if (*pres < min)
+ *pres = min;
+ } else {
+ if (*pres > max)
+ *pres = max;
+ }
+ }
+ return res;
+}
+
+static int JS_ToInt64SatFree(JSContext *ctx, int64_t *pres, JSValue val)
+{
+ uint32_t tag;
+
+ redo:
+ tag = JS_VALUE_GET_NORM_TAG(val);
+ switch(tag) {
+ case JS_TAG_INT:
+ case JS_TAG_BOOL:
+ case JS_TAG_NULL:
+ case JS_TAG_UNDEFINED:
+ *pres = JS_VALUE_GET_INT(val);
+ return 0;
+ case JS_TAG_EXCEPTION:
+ *pres = 0;
+ return -1;
+ case JS_TAG_FLOAT64:
+ {
+ double d = JS_VALUE_GET_FLOAT64(val);
+ if (isnan(d)) {
+ *pres = 0;
+ } else {
+ if (d < INT64_MIN)
+ *pres = INT64_MIN;
+ else if (d > INT64_MAX)
+ *pres = INT64_MAX;
+ else
+ *pres = (int64_t)d;
+ }
+ }
+ return 0;
+#ifdef CONFIG_BIGNUM
+ case JS_TAG_BIG_FLOAT:
+ to_bf:
+ {
+ JSBigFloat *p = JS_VALUE_GET_PTR(val);
+ bf_get_int64(pres, &p->num, 0);
+ JS_FreeValue(ctx, val);
+ }
+ return 0;
+ case JS_TAG_BIG_INT:
+ if (is_bignum_mode(ctx))
+ goto to_bf;
+ /* fall thru */
+#endif
+ default:
+ val = JS_ToNumberFree(ctx, val);
+ if (JS_IsException(val)) {
+ *pres = 0;
+ return -1;
+ }
+ goto redo;
+ }
+}
+
+int JS_ToInt64Sat(JSContext *ctx, int64_t *pres, JSValueConst val)
+{
+ return JS_ToInt64SatFree(ctx, pres, JS_DupValue(ctx, val));
+}
+
+int JS_ToInt64Clamp(JSContext *ctx, int64_t *pres, JSValueConst val,
+ int64_t min, int64_t max, int64_t neg_offset)
+{
+ int res = JS_ToInt64SatFree(ctx, pres, JS_DupValue(ctx, val));
+ if (res == 0) {
+ if (*pres < 0)
+ *pres += neg_offset;
+ if (*pres < min)
+ *pres = min;
+ else if (*pres > max)
+ *pres = max;
+ }
+ return res;
+}
+
+/* Same as JS_ToInt32Free() but with a 64 bit result. Return (<0, 0)
+ in case of exception */
+static int JS_ToInt64Free(JSContext *ctx, int64_t *pres, JSValue val)
+{
+ uint32_t tag;
+ int64_t ret;
+
+ redo:
+ tag = JS_VALUE_GET_NORM_TAG(val);
+ switch(tag) {
+ case JS_TAG_INT:
+ case JS_TAG_BOOL:
+ case JS_TAG_NULL:
+ case JS_TAG_UNDEFINED:
+ ret = JS_VALUE_GET_INT(val);
+ break;
+ case JS_TAG_FLOAT64:
+ {
+ JSFloat64Union u;
+ double d;
+ int e;
+ d = JS_VALUE_GET_FLOAT64(val);
+ u.d = d;
+ /* we avoid doing fmod(x, 2^64) */
+ e = (u.u64 >> 52) & 0x7ff;
+ if (likely(e <= (1023 + 62))) {
+ /* fast case */
+ ret = (int64_t)d;
+ } else if (e <= (1023 + 62 + 53)) {
+ uint64_t v;
+ /* remainder modulo 2^64 */
+ v = (u.u64 & (((uint64_t)1 << 52) - 1)) | ((uint64_t)1 << 52);
+ ret = v << ((e - 1023) - 52);
+ /* take the sign into account */
+ if (u.u64 >> 63)
+ ret = -ret;
+ } else {
+ ret = 0; /* also handles NaN and +inf */
+ }
+ }
+ break;
+#ifdef CONFIG_BIGNUM
+ case JS_TAG_BIG_FLOAT:
+ to_bf:
+ {
+ JSBigFloat *p = JS_VALUE_GET_PTR(val);
+ bf_get_int64(&ret, &p->num, BF_GET_INT_MOD);
+ JS_FreeValue(ctx, val);
+ }
+ break;
+ case JS_TAG_BIG_INT:
+ if (is_bignum_mode(ctx))
+ goto to_bf;
+ /* fall thru */
+#endif
+ default:
+ val = JS_ToNumberFree(ctx, val);
+ if (JS_IsException(val)) {
+ *pres = 0;
+ return -1;
+ }
+ goto redo;
+ }
+ *pres = ret;
+ return 0;
+}
+
+int JS_ToInt64(JSContext *ctx, int64_t *pres, JSValueConst val)
+{
+ return JS_ToInt64Free(ctx, pres, JS_DupValue(ctx, val));
+}
+
+/* return (<0, 0) in case of exception */
+static int JS_ToInt32Free(JSContext *ctx, int32_t *pres, JSValue val)
+{
+ uint32_t tag;
+ int32_t ret;
+
+ redo:
+ tag = JS_VALUE_GET_NORM_TAG(val);
+ switch(tag) {
+ case JS_TAG_INT:
+ case JS_TAG_BOOL:
+ case JS_TAG_NULL:
+ case JS_TAG_UNDEFINED:
+ ret = JS_VALUE_GET_INT(val);
+ break;
+ case JS_TAG_FLOAT64:
+ {
+ JSFloat64Union u;
+ double d;
+ int e;
+ d = JS_VALUE_GET_FLOAT64(val);
+ u.d = d;
+ /* we avoid doing fmod(x, 2^32) */
+ e = (u.u64 >> 52) & 0x7ff;
+ if (likely(e <= (1023 + 30))) {
+ /* fast case */
+ ret = (int32_t)d;
+ } else if (e <= (1023 + 30 + 53)) {
+ uint64_t v;
+ /* remainder modulo 2^32 */
+ v = (u.u64 & (((uint64_t)1 << 52) - 1)) | ((uint64_t)1 << 52);
+ v = v << ((e - 1023) - 52 + 32);
+ ret = v >> 32;
+ /* take the sign into account */
+ if (u.u64 >> 63)
+ ret = -ret;
+ } else {
+ ret = 0; /* also handles NaN and +inf */
+ }
+ }
+ break;
+#ifdef CONFIG_BIGNUM
+ case JS_TAG_BIG_FLOAT:
+ to_bf:
+ {
+ JSBigFloat *p = JS_VALUE_GET_PTR(val);
+ bf_get_int32(&ret, &p->num, BF_GET_INT_MOD);
+ JS_FreeValue(ctx, val);
+ }
+ break;
+ case JS_TAG_BIG_INT:
+ if (is_bignum_mode(ctx))
+ goto to_bf;
+ /* fall thru */
+#endif
+ default:
+ val = JS_ToNumberFree(ctx, val);
+ if (JS_IsException(val)) {
+ *pres = 0;
+ return -1;
+ }
+ goto redo;
+ }
+ *pres = ret;
+ return 0;
+}
+
+int JS_ToInt32(JSContext *ctx, int32_t *pres, JSValueConst val)
+{
+ return JS_ToInt32Free(ctx, pres, JS_DupValue(ctx, val));
+}
+
+static inline int JS_ToUint32Free(JSContext *ctx, uint32_t *pres, JSValue val)
+{
+ return JS_ToInt32Free(ctx, (int32_t *)pres, val);
+}
+
+static int JS_ToUint8ClampFree(JSContext *ctx, int32_t *pres, JSValue val)
+{
+ uint32_t tag;
+ int res;
+
+ redo:
+ tag = JS_VALUE_GET_NORM_TAG(val);
+ switch(tag) {
+ case JS_TAG_INT:
+ case JS_TAG_BOOL:
+ case JS_TAG_NULL:
+ case JS_TAG_UNDEFINED:
+ res = JS_VALUE_GET_INT(val);
+#ifdef CONFIG_BIGNUM
+ int_clamp:
+#endif
+ res = max_int(0, min_int(255, res));
+ break;
+ case JS_TAG_FLOAT64:
+ {
+ double d = JS_VALUE_GET_FLOAT64(val);
+ if (isnan(d)) {
+ res = 0;
+ } else {
+ if (d < 0)
+ res = 0;
+ else if (d > 255)
+ res = 255;
+ else
+ res = lrint(d);
+ }
+ }
+ break;
+#ifdef CONFIG_BIGNUM
+ case JS_TAG_BIG_INT:
+ {
+ JSBigFloat *p = JS_VALUE_GET_PTR(val);
+ if (!is_bignum_mode(ctx))
+ goto to_number;
+ bf_get_int32(&res, &p->num, 0);
+ JS_FreeValue(ctx, val);
+ }
+ goto int_clamp;
+ case JS_TAG_BIG_FLOAT:
+ {
+ JSBigFloat *p = JS_VALUE_GET_PTR(val);
+ bf_t r_s, *r = &r_s;
+ bf_init(ctx->bf_ctx, r);
+ bf_set(r, &p->num);
+ bf_rint(r, BF_PREC_INF, BF_RNDN);
+ bf_get_int32(&res, r, 0);
+ bf_delete(r);
+ JS_FreeValue(ctx, val);
+ }
+ goto int_clamp;
+#endif
+ default:
+#ifdef CONFIG_BIGNUM
+ to_number:
+#endif
+ val = JS_ToNumberFree(ctx, val);
+ if (JS_IsException(val)) {
+ *pres = 0;
+ return -1;
+ }
+ goto redo;
+ }
+ *pres = res;
+ return 0;
+}
+
+static __exception int JS_ToArrayLengthFree(JSContext *ctx, uint32_t *plen,
+ JSValue val)
+{
+ uint32_t tag, len;
+
+ redo:
+ tag = JS_VALUE_GET_TAG(val);
+ switch(tag) {
+ case JS_TAG_INT:
+ case JS_TAG_BOOL:
+ case JS_TAG_NULL:
+ {
+ int v;
+ v = JS_VALUE_GET_INT(val);
+ if (v < 0)
+ goto fail;
+ len = v;
+ }
+ break;
+#ifdef CONFIG_BIGNUM
+ case JS_TAG_BIG_INT:
+ case JS_TAG_BIG_FLOAT:
+ {
+ JSBigFloat *p = JS_VALUE_GET_PTR(val);
+ bf_t a;
+ BOOL res;
+ bf_get_int32((int32_t *)&len, &p->num, BF_GET_INT_MOD);
+ bf_init(ctx->bf_ctx, &a);
+ bf_set_ui(&a, len);
+ res = bf_cmp_eq(&a, &p->num);
+ bf_delete(&a);
+ JS_FreeValue(ctx, val);
+ if (!res)
+ goto fail;
+ }
+ break;
+#endif
+ default:
+ if (JS_TAG_IS_FLOAT64(tag)) {
+ double d;
+ d = JS_VALUE_GET_FLOAT64(val);
+ len = (uint32_t)d;
+ if (len != d) {
+ fail:
+ JS_ThrowRangeError(ctx, "invalid array length");
+ return -1;
+ }
+ } else {
+ val = JS_ToNumberFree(ctx, val);
+ if (JS_IsException(val))
+ return -1;
+ goto redo;
+ }
+ break;
+ }
+ *plen = len;
+ return 0;
+}
+
+#define MAX_SAFE_INTEGER (((int64_t)1 << 53) - 1)
+
+int JS_ToIndex(JSContext *ctx, uint64_t *plen, JSValueConst val)
+{
+ int64_t v;
+ if (JS_ToInt64Sat(ctx, &v, val))
+ return -1;
+ if (v < 0 || v > MAX_SAFE_INTEGER) {
+ JS_ThrowRangeError(ctx, "invalid array index");
+ *plen = 0;
+ return -1;
+ }
+ *plen = v;
+ return 0;
+}
+
+/* convert a value to a length between 0 and MAX_SAFE_INTEGER.
+ return -1 for exception */
+static __exception int JS_ToLengthFree(JSContext *ctx, int64_t *plen,
+ JSValue val)
+{
+ int res = JS_ToInt64Clamp(ctx, plen, val, 0, MAX_SAFE_INTEGER, 0);
+ JS_FreeValue(ctx, val);
+ return res;
+}
+
+/* Note: can return an exception */
+/* XXX: bignum case */
+static int JS_NumberIsInteger(JSContext *ctx, JSValueConst val)
+{
+ double d;
+ if (!JS_IsNumber(val))
+ return FALSE;
+ if (unlikely(JS_ToFloat64(ctx, &d, val)))
+ return -1;
+ return isfinite(d) && floor(d) == d;
+}
+
+static BOOL JS_NumberIsNegativeOrMinusZero(JSContext *ctx, JSValueConst val)
+{
+ uint32_t tag;
+
+ tag = JS_VALUE_GET_NORM_TAG(val);
+ switch(tag) {
+ case JS_TAG_INT:
+ {
+ int v;
+ v = JS_VALUE_GET_INT(val);
+ return (v < 0);
+ }
+ case JS_TAG_FLOAT64:
+ {
+ JSFloat64Union u;
+ u.d = JS_VALUE_GET_FLOAT64(val);
+ return (u.u64 >> 63);
+ }
+#ifdef CONFIG_BIGNUM
+ case JS_TAG_BIG_INT:
+ {
+ JSBigFloat *p = JS_VALUE_GET_PTR(val);
+ /* Note: integer zeros are not necessarily positive */
+ return p->num.sign && !bf_is_zero(&p->num);
+ }
+ case JS_TAG_BIG_FLOAT:
+ {
+ JSBigFloat *p = JS_VALUE_GET_PTR(val);
+ return p->num.sign;
+ }
+ break;
+#endif
+ default:
+ return FALSE;
+ }
+}
+
+#ifdef CONFIG_BIGNUM
+
+static JSValue js_ftoa(JSContext *ctx, JSValueConst val1, int radix,
+ limb_t prec, bf_flags_t flags)
+{
+ JSValue val, ret;
+ bf_t a_s, *a;
+ BOOL is_float;
+ char *str;
+ int saved_sign;
+
+ val = JS_ToNumeric(ctx, val1);
+ if (JS_IsException(val))
+ return val;
+ a = JS_ToBigFloat(ctx, &is_float, &a_s, val);
+ saved_sign = a->sign;
+ if (a->expn == BF_EXP_ZERO)
+ a->sign = 0;
+ flags |= BF_FTOA_JS_QUIRKS;
+ if ((flags & BF_FTOA_FORMAT_MASK) == BF_FTOA_FORMAT_FREE_MIN) {
+ /* Note: for floating point numbers with a radix which is not
+ a power of two, the current precision is used to compute
+ the number of digits. For integers, the full precision is
+ always returned. */
+ if (is_float || (flags & BF_FTOA_FORCE_EXP)) {
+ if ((radix & (radix - 1)) != 0) {
+ bf_t r_s, *r = &r_s;
+ int prec, flags1;
+ /* must round first */
+ if (JS_VALUE_GET_TAG(val) == JS_TAG_BIG_FLOAT) {
+ prec = ctx->fp_env.prec;
+ flags1 = ctx->fp_env.flags &
+ (BF_FLAG_SUBNORMAL | (BF_EXP_BITS_MASK << BF_EXP_BITS_SHIFT));
+ } else {
+ prec = 53;
+ flags1 = bf_set_exp_bits(11) | BF_FLAG_SUBNORMAL;
+ }
+ bf_init(ctx->bf_ctx, r);
+ bf_set(r, a);
+ bf_round(r, prec, flags1 | BF_RNDN);
+ bf_ftoa(&str, r, radix, prec, flags1 | flags);
+ bf_delete(r);
+ } else {
+ bf_ftoa(&str, a, radix, BF_PREC_INF, flags);
+ }
+ } else {
+ bf_ftoa(&str, a, radix, 0, BF_RNDZ | BF_FTOA_FORMAT_FRAC | BF_FTOA_JS_QUIRKS);
+ }
+ } else {
+ bf_ftoa(&str, a, radix, prec, flags);
+ }
+ a->sign = saved_sign;
+ if (a == &a_s)
+ bf_delete(a);
+ JS_FreeValue(ctx, val);
+ ret = JS_NewString(ctx, str);
+ bf_realloc(ctx->bf_ctx, str, 0);
+ return ret;
+}
+
+#else /* !CONFIG_BIGNUM */
+
+/* 2 <= base <= 36 */
+static char *i64toa(char *buf_end, int64_t n, unsigned int base)
+{
+ char *q = buf_end;
+ int digit, is_neg;
+
+ is_neg = 0;
+ if (n < 0) {
+ is_neg = 1;
+ n = -n;
+ }
+ *--q = '\0';
+ do {
+ digit = (uint64_t)n % base;
+ n = (uint64_t)n / base;
+ if (digit < 10)
+ digit += '0';
+ else
+ digit += 'a' - 10;
+ *--q = digit;
+ } while (n != 0);
+ if (is_neg)
+ *--q = '-';
+ return q;
+}
+
+/* buf1 contains the printf result */
+static void js_ecvt1(double d, int n_digits, int *decpt, int *sign, char *buf,
+ int rounding_mode, char *buf1, int buf1_size)
+{
+ if (rounding_mode != FE_TONEAREST)
+ fesetround(rounding_mode);
+ snprintf(buf1, buf1_size, "%+.*e", n_digits - 1, d);
+ if (rounding_mode != FE_TONEAREST)
+ fesetround(FE_TONEAREST);
+ *sign = (buf1[0] == '-');
+ /* mantissa */
+ buf[0] = buf1[1];
+ if (n_digits > 1)
+ memcpy(buf + 1, buf1 + 3, n_digits - 1);
+ buf[n_digits] = '\0';
+ /* exponent */
+ *decpt = atoi(buf1 + n_digits + 2 + (n_digits > 1)) + 1;
+}
+
+/* maximum buffer size for js_dtoa */
+#define JS_DTOA_BUF_SIZE 128
+
+/* needed because ecvt usually limits the number of digits to
+ 17. Return the number of digits. */
+static int js_ecvt(double d, int n_digits, int *decpt, int *sign, char *buf,
+ BOOL is_fixed)
+{
+ int rounding_mode;
+ char buf_tmp[JS_DTOA_BUF_SIZE];
+
+ if (!is_fixed) {
+ unsigned int n_digits_min, n_digits_max;
+ /* find the minimum amount of digits (XXX: inefficient but simple) */
+ n_digits_min = 1;
+ n_digits_max = 17;
+ while (n_digits_min < n_digits_max) {
+ n_digits = (n_digits_min + n_digits_max) / 2;
+ js_ecvt1(d, n_digits, decpt, sign, buf, FE_TONEAREST,
+ buf_tmp, sizeof(buf_tmp));
+ if (strtod(buf_tmp, NULL) == d) {
+ /* no need to keep the trailing zeros */
+ while (n_digits >= 2 && buf[n_digits - 1] == '0')
+ n_digits--;
+ n_digits_max = n_digits;
+ } else {
+ n_digits_min = n_digits + 1;
+ }
+ }
+ n_digits = n_digits_max;
+ rounding_mode = FE_TONEAREST;
+ } else {
+ rounding_mode = FE_TONEAREST;
+#ifdef CONFIG_PRINTF_RNDN
+ {
+ char buf1[JS_DTOA_BUF_SIZE], buf2[JS_DTOA_BUF_SIZE];
+ int decpt1, sign1, decpt2, sign2;
+ /* The JS rounding is specified as round to nearest ties away
+ from zero (RNDNA), but in printf the "ties" case is not
+ specified (for example it is RNDN for glibc, RNDNA for
+ Windows), so we must round manually. */
+ js_ecvt1(d, n_digits + 1, &decpt1, &sign1, buf1, FE_TONEAREST,
+ buf_tmp, sizeof(buf_tmp));
+ /* XXX: could use 2 digits to reduce the average running time */
+ if (buf1[n_digits] == '5') {
+ js_ecvt1(d, n_digits + 1, &decpt1, &sign1, buf1, FE_DOWNWARD,
+ buf_tmp, sizeof(buf_tmp));
+ js_ecvt1(d, n_digits + 1, &decpt2, &sign2, buf2, FE_UPWARD,
+ buf_tmp, sizeof(buf_tmp));
+ if (memcmp(buf1, buf2, n_digits + 1) == 0 && decpt1 == decpt2) {
+ /* exact result: round away from zero */
+ if (sign1)
+ rounding_mode = FE_DOWNWARD;
+ else
+ rounding_mode = FE_UPWARD;
+ }
+ }
+ }
+#endif /* CONFIG_PRINTF_RNDN */
+ }
+ js_ecvt1(d, n_digits, decpt, sign, buf, rounding_mode,
+ buf_tmp, sizeof(buf_tmp));
+ return n_digits;
+}
+
+static int js_fcvt1(char *buf, int buf_size, double d, int n_digits,
+ int rounding_mode)
+{
+ int n;
+ if (rounding_mode != FE_TONEAREST)
+ fesetround(rounding_mode);
+ n = snprintf(buf, buf_size, "%.*f", n_digits, d);
+ if (rounding_mode != FE_TONEAREST)
+ fesetround(FE_TONEAREST);
+ assert(n < buf_size);
+ return n;
+}
+
+static void js_fcvt(char *buf, int buf_size, double d, int n_digits)
+{
+ int rounding_mode;
+ rounding_mode = FE_TONEAREST;
+#ifdef CONFIG_PRINTF_RNDN
+ {
+ int n1, n2;
+ char buf1[JS_DTOA_BUF_SIZE];
+ char buf2[JS_DTOA_BUF_SIZE];
+
+ /* The JS rounding is specified as round to nearest ties away from
+ zero (RNDNA), but in printf the "ties" case is not specified
+ (for example it is RNDN for glibc, RNDNA for Windows), so we
+ must round manually. */
+ n1 = js_fcvt1(buf1, sizeof(buf1), d, n_digits + 1, FE_TONEAREST);
+ rounding_mode = FE_TONEAREST;
+ /* XXX: could use 2 digits to reduce the average running time */
+ if (buf1[n1 - 1] == '5') {
+ n1 = js_fcvt1(buf1, sizeof(buf1), d, n_digits + 1, FE_DOWNWARD);
+ n2 = js_fcvt1(buf2, sizeof(buf2), d, n_digits + 1, FE_UPWARD);
+ if (n1 == n2 && memcmp(buf1, buf2, n1) == 0) {
+ /* exact result: round away from zero */
+ if (buf1[0] == '-')
+ rounding_mode = FE_DOWNWARD;
+ else
+ rounding_mode = FE_UPWARD;
+ }
+ }
+ }
+#endif /* CONFIG_PRINTF_RNDN */
+ js_fcvt1(buf, buf_size, d, n_digits, rounding_mode);
+}
+
+/* radix != 10 is only supported with flags = JS_DTOA_VAR_FORMAT */
+/* use as many digits as necessary */
+#define JS_DTOA_VAR_FORMAT (0 << 0)
+/* use n_digits significant digits (1 <= n_digits <= 101) */
+#define JS_DTOA_FIXED_FORMAT (1 << 0)
+/* force fractional format: [-]dd.dd with n_digits fractional digits */
+#define JS_DTOA_FRAC_FORMAT (2 << 0)
+/* force exponential notation either in fixed or variable format */
+#define JS_DTOA_FORCE_EXP (1 << 2)
+
+/* XXX: slow and maybe not fully correct
+ XXX: radix != 10 is only supported for small integers
+*/
+static void js_dtoa1(char *buf, double d, int radix, int n_digits, int flags)
+{
+ char *q;
+
+ if (!isfinite(d)) {
+ if (isnan(d)) {
+ strcpy(buf, "NaN");
+ } else {
+ q = buf;
+ if (d < 0)
+ *q++ = '-';
+ strcpy(q, "Infinity");
+ }
+ } else if (flags == JS_DTOA_VAR_FORMAT) {
+ int64_t i64;
+ char buf1[70], *ptr;
+ i64 = (int64_t)d;
+ if (d != i64 || i64 > MAX_SAFE_INTEGER || i64 < -MAX_SAFE_INTEGER)
+ goto generic_conv;
+ /* fast path for integers */
+ ptr = i64toa(buf1 + sizeof(buf1), i64, radix);
+ strcpy(buf, ptr);
+ } else {
+ if (d == 0.0)
+ d = 0.0; /* convert -0 to 0 */
+ if (flags == JS_DTOA_FRAC_FORMAT) {
+ js_fcvt(buf, JS_DTOA_BUF_SIZE, d, n_digits);
+ } else {
+ char buf1[JS_DTOA_BUF_SIZE];
+ int sign, decpt, k, n, i, p, n_max;
+ BOOL is_fixed;
+ generic_conv:
+ is_fixed = ((flags & 3) == JS_DTOA_FIXED_FORMAT);
+ if (is_fixed) {
+ n_max = n_digits;
+ } else {
+ n_max = 21;
+ }
+ /* the number has k digits (k >= 1) */
+ k = js_ecvt(d, n_digits, &decpt, &sign, buf1, is_fixed);
+ n = decpt; /* d=10^(n-k)*(buf1) i.e. d= < x.yyyy 10^(n-1) */
+ q = buf;
+ if (sign)
+ *q++ = '-';
+ if (flags & JS_DTOA_FORCE_EXP)
+ goto force_exp;
+ if (n >= 1 && n <= n_max) {
+ if (k <= n) {
+ memcpy(q, buf1, k);
+ q += k;
+ for(i = 0; i < (n - k); i++)
+ *q++ = '0';
+ *q = '\0';
+ } else {
+ /* k > n */
+ memcpy(q, buf1, n);
+ q += n;
+ *q++ = '.';
+ for(i = 0; i < (k - n); i++)
+ *q++ = buf1[n + i];
+ *q = '\0';
+ }
+ } else if (n >= -5 && n <= 0) {
+ *q++ = '0';
+ *q++ = '.';
+ for(i = 0; i < -n; i++)
+ *q++ = '0';
+ memcpy(q, buf1, k);
+ q += k;
+ *q = '\0';
+ } else {
+ force_exp:
+ /* exponential notation */
+ *q++ = buf1[0];
+ if (k > 1) {
+ *q++ = '.';
+ for(i = 1; i < k; i++)
+ *q++ = buf1[i];
+ }
+ *q++ = 'e';
+ p = n - 1;
+ if (p >= 0)
+ *q++ = '+';
+ sprintf(q, "%d", p);
+ }
+ }
+ }
+}
+
+static JSValue js_dtoa(JSContext *ctx,
+ double d, int radix, int n_digits, int flags)
+{
+ char buf[JS_DTOA_BUF_SIZE];
+ js_dtoa1(buf, d, radix, n_digits, flags);
+ return JS_NewString(ctx, buf);
+}
+
+#endif /* !CONFIG_BIGNUM */
+
+JSValue JS_ToStringInternal(JSContext *ctx, JSValueConst val, BOOL is_ToPropertyKey)
+{
+ uint32_t tag;
+ const char *str;
+ char buf[32];
+
+ tag = JS_VALUE_GET_NORM_TAG(val);
+ switch(tag) {
+ case JS_TAG_STRING:
+ return JS_DupValue(ctx, val);
+ case JS_TAG_INT:
+ snprintf(buf, sizeof(buf), "%d", JS_VALUE_GET_INT(val));
+ str = buf;
+ goto new_string;
+ case JS_TAG_BOOL:
+ return JS_AtomToString(ctx, JS_VALUE_GET_BOOL(val) ?
+ JS_ATOM_true : JS_ATOM_false);
+ case JS_TAG_NULL:
+ return JS_AtomToString(ctx, JS_ATOM_null);
+ case JS_TAG_UNDEFINED:
+ return JS_AtomToString(ctx, JS_ATOM_undefined);
+ case JS_TAG_EXCEPTION:
+ return JS_EXCEPTION;
+ case JS_TAG_OBJECT:
+ {
+ JSValue val1, ret;
+ val1 = JS_ToPrimitive(ctx, val, HINT_STRING);
+ if (JS_IsException(val1))
+ return val1;
+ ret = JS_ToStringInternal(ctx, val1, is_ToPropertyKey);
+ JS_FreeValue(ctx, val1);
+ return ret;
+ }
+ break;
+ case JS_TAG_FUNCTION_BYTECODE:
+ str = "[function bytecode]";
+ goto new_string;
+ case JS_TAG_SYMBOL:
+ if (is_ToPropertyKey) {
+ return JS_DupValue(ctx, val);
+ } else {
+ return JS_ThrowTypeError(ctx, "cannot convert symbol to string");
+ }
+#ifdef CONFIG_BIGNUM
+ case JS_TAG_FLOAT64:
+ case JS_TAG_BIG_FLOAT:
+ case JS_TAG_BIG_INT:
+ return js_ftoa(ctx, val, 10, 0, BF_RNDN | BF_FTOA_FORMAT_FREE_MIN);
+#else
+ case JS_TAG_FLOAT64:
+ return js_dtoa(ctx, JS_VALUE_GET_FLOAT64(val), 10, 0,
+ JS_DTOA_VAR_FORMAT);
+#endif
+ default:
+ str = "[unsupported type]";
+ new_string:
+ return JS_NewString(ctx, str);
+ }
+}
+
+JSValue JS_ToString(JSContext *ctx, JSValueConst val)
+{
+ return JS_ToStringInternal(ctx, val, FALSE);
+}
+
+static JSValue JS_ToStringFree(JSContext *ctx, JSValue val)
+{
+ JSValue ret;
+ ret = JS_ToString(ctx, val);
+ JS_FreeValue(ctx, val);
+ return ret;
+}
+
+static JSValue JS_ToLocaleStringFree(JSContext *ctx, JSValue val)
+{
+ if (JS_IsUndefined(val) || JS_IsNull(val))
+ return JS_ToStringFree(ctx, val);
+ return JS_InvokeFree(ctx, val, JS_ATOM_toLocaleString, 0, NULL);
+}
+
+JSValue JS_ToPropertyKey(JSContext *ctx, JSValueConst val)
+{
+ return JS_ToStringInternal(ctx, val, TRUE);
+}
+
+static JSValue JS_ToStringCheckObject(JSContext *ctx, JSValueConst val)
+{
+ uint32_t tag = JS_VALUE_GET_TAG(val);
+ if (tag == JS_TAG_NULL || tag == JS_TAG_UNDEFINED)
+ return JS_ThrowTypeError(ctx, "null or undefined are forbidden");
+ return JS_ToString(ctx, val);
+}
+
+static JSValue JS_ToQuotedString(JSContext *ctx, JSValueConst val1)
+{
+ JSValue val;
+ JSString *p;
+ int i;
+ uint32_t c;
+ StringBuffer b_s, *b = &b_s;
+ char buf[16];
+
+ val = JS_ToStringCheckObject(ctx, val1);
+ if (JS_IsException(val))
+ return val;
+ p = JS_VALUE_GET_STRING(val);
+
+ if (string_buffer_init(ctx, b, p->len + 2))
+ goto fail;
+
+ if (string_buffer_putc8(b, '\"'))
+ goto fail;
+ for(i = 0; i < p->len; i++) {
+ c = string_get(p, i);
+ switch(c) {
+ case '\t':
+ c = 't';
+ goto quote;
+ case '\r':
+ c = 'r';
+ goto quote;
+ case '\n':
+ c = 'n';
+ goto quote;
+ case '\b':
+ c = 'b';
+ goto quote;
+ case '\f':
+ c = 'f';
+ goto quote;
+ case '\"':
+ case '\\':
+ quote:
+ if (string_buffer_putc8(b, '\\'))
+ goto fail;
+ if (string_buffer_putc8(b, c))
+ goto fail;
+ break;
+ default:
+ if (c < 32) {
+ snprintf(buf, sizeof(buf), "\\u%04x", c);
+ if (string_buffer_puts8(b, buf))
+ goto fail;
+ } else {
+ if (string_buffer_putc16(b, c))
+ goto fail;
+ }
+ break;
+ }
+ }
+ if (string_buffer_putc8(b, '\"'))
+ goto fail;
+ JS_FreeValue(ctx, val);
+ return string_buffer_end(b);
+ fail:
+ JS_FreeValue(ctx, val);
+ string_buffer_free(b);
+ return JS_EXCEPTION;
+}
+
+#if defined(_MSC_VER)
+static void JS_DumpObjectHeader(JSRuntime *rt)
+#else
+static __attribute__((unused)) void JS_DumpObjectHeader(JSRuntime *rt)
+#endif
+{
+ printf("%14s %4s %4s %14s %10s %s\n",
+ "ADDRESS", "REFS", "SHRF", "PROTO", "CLASS", "PROPS");
+}
+
+/* for debug only: dump an object without side effect */
+#if defined(_MSC_VER)
+static void JS_DumpObject(JSRuntime *rt, JSObject *p)
+#else
+static __attribute__((unused)) void JS_DumpObject(JSRuntime *rt, JSObject *p)
+#endif
+{
+ uint32_t i;
+ char atom_buf[ATOM_GET_STR_BUF_SIZE];
+ JSShape *sh;
+ JSShapeProperty *prs;
+ JSProperty *pr;
+ BOOL is_first = TRUE;
+
+ /* XXX: should encode atoms with special characters */
+ printf("%14p %4d %3d%c %14p %10s ",
+ (void *)p,
+ p->header.ref_count,
+ p->shape->header.ref_count,
+ " *"[p->shape->is_hashed],
+ (void *)p->shape->proto,
+ JS_AtomGetStrRT(rt, atom_buf, sizeof(atom_buf), rt->class_array[p->class_id].class_name));
+ if (p->is_exotic && p->fast_array) {
+ printf("[ ");
+ for(i = 0; i < p->u.array.count; i++) {
+ if (i != 0)
+ printf(", ");
+ switch (p->class_id) {
+ case JS_CLASS_ARRAY:
+ case JS_CLASS_ARGUMENTS:
+ JS_DumpValueShort(rt, p->u.array.u.values[i]);
+ break;
+#if defined(_MSC_VER)
+ case JS_CLASS_UINT8C_ARRAY: /* u.array (typed_array) */
+ case JS_CLASS_INT8_ARRAY: /* u.array (typed_array) */
+ case JS_CLASS_UINT8_ARRAY: /* u.array (typed_array) */
+ case JS_CLASS_INT16_ARRAY: /* u.array (typed_array) */
+ case JS_CLASS_UINT16_ARRAY: /* u.array (typed_array) */
+ case JS_CLASS_INT32_ARRAY: /* u.array (typed_array) */
+ case JS_CLASS_UINT32_ARRAY: /* u.array (typed_array) */
+ #ifdef CONFIG_BIGNUM
+ case JS_CLASS_BIG_INT64_ARRAY: /* u.array (typed_array) */
+ case JS_CLASS_BIG_UINT64_ARRAY: /* u.array (typed_array) */
+ #endif
+ case JS_CLASS_FLOAT32_ARRAY: /* u.array (typed_array) */
+ case JS_CLASS_FLOAT64_ARRAY: /* u.array (typed_array) */
+#else
+ case JS_CLASS_UINT8C_ARRAY ... JS_CLASS_FLOAT64_ARRAY:
+#endif
+ {
+ int size = 1 << typed_array_size_log2(p->class_id);
+ const uint8_t *b = p->u.array.u.uint8_ptr + i * size;
+ while (size-- > 0)
+ printf("%02X", *b++);
+ }
+ break;
+ }
+ }
+ printf(" ] ");
+ }
+
+ printf("{ ");
+ sh = p->shape;
+ for(i = 0, prs = get_shape_prop(sh); i < sh->prop_count; i++, prs++) {
+ if (prs->atom != JS_ATOM_NULL) {
+ pr = &p->prop[i];
+ if (!is_first)
+ printf(", ");
+ printf("%s: ",
+ JS_AtomGetStrRT(rt, atom_buf, sizeof(atom_buf), prs->atom));
+ if ((prs->flags & JS_PROP_TMASK) == JS_PROP_GETSET) {
+ printf("[getset %p %p]", (void *)pr->u.getset.getter,
+ (void *)pr->u.getset.setter);
+ } else if ((prs->flags & JS_PROP_TMASK) == JS_PROP_VARREF) {
+ printf("[varref %p]", (void *)pr->u.var_ref);
+ } else if ((prs->flags & JS_PROP_TMASK) == JS_PROP_AUTOINIT) {
+ printf("[autoinit %p %p]", (void *)pr->u.init.init_func,
+ (void *)pr->u.init.opaque);
+ } else {
+ JS_DumpValueShort(rt, pr->u.value);
+ }
+ is_first = FALSE;
+ }
+ }
+ printf(" }");
+
+ if (js_class_has_bytecode(p->class_id)) {
+ JSFunctionBytecode *b = p->u.func.function_bytecode;
+ JSVarRef **var_refs;
+ if (b->closure_var_count) {
+ var_refs = p->u.func.var_refs;
+ printf(" Closure:");
+ for(i = 0; i < b->closure_var_count; i++) {
+ printf(" ");
+ JS_DumpValueShort(rt, var_refs[i]->value);
+ }
+ if (p->u.func.home_object) {
+ printf(" HomeObject: ");
+ JS_DumpValueShort(rt, JS_MKPTR(JS_TAG_OBJECT, p->u.func.home_object));
+ }
+ }
+ }
+ printf("\n");
+}
+
+#if defined(_MSC_VER)
+static void JS_DumpValueShort(JSRuntime *rt,
+ JSValueConst val)
+#else
+static __attribute__((unused)) void JS_DumpValueShort(JSRuntime *rt,
+ JSValueConst val)
+#endif
+{
+ uint32_t tag = JS_VALUE_GET_NORM_TAG(val);
+ const char *str;
+
+ switch(tag) {
+ case JS_TAG_INT:
+ printf("%d", JS_VALUE_GET_INT(val));
+ break;
+ case JS_TAG_BOOL:
+ if (JS_VALUE_GET_BOOL(val))
+ str = "true";
+ else
+ str = "false";
+ goto print_str;
+ case JS_TAG_NULL:
+ str = "null";
+ goto print_str;
+ case JS_TAG_EXCEPTION:
+ str = "exception";
+ goto print_str;
+ case JS_TAG_UNINITIALIZED:
+ str = "uninitialized";
+ goto print_str;
+ case JS_TAG_UNDEFINED:
+ str = "undefined";
+ print_str:
+ printf("%s", str);
+ break;
+ case JS_TAG_FLOAT64:
+ printf("%.14g", JS_VALUE_GET_FLOAT64(val));
+ break;
+#ifdef CONFIG_BIGNUM
+ case JS_TAG_BIG_INT:
+ {
+ JSBigFloat *p = JS_VALUE_GET_PTR(val);
+ char *str;
+ bf_ftoa(&str, &p->num, 10, 0,
+ BF_RNDZ | BF_FTOA_FORMAT_FRAC);
+ printf("%sn", str);
+ bf_realloc(&rt->bf_ctx, str, 0);
+ }
+ break;
+ case JS_TAG_BIG_FLOAT:
+ {
+ JSBigFloat *p = JS_VALUE_GET_PTR(val);
+ char *str;
+ bf_ftoa(&str, &p->num, 16, BF_PREC_INF,
+ BF_RNDZ | BF_FTOA_FORMAT_FREE | BF_FTOA_ADD_PREFIX);
+ printf("%sl", str);
+ bf_realloc(&rt->bf_ctx, str, 0);
+ }
+ break;
+#endif
+ case JS_TAG_STRING:
+ {
+ JSString *p;
+ p = JS_VALUE_GET_STRING(val);
+ JS_DumpString(rt, p);
+ }
+ break;
+ case JS_TAG_FUNCTION_BYTECODE:
+ {
+ JSFunctionBytecode *b = JS_VALUE_GET_PTR(val);
+ char buf[ATOM_GET_STR_BUF_SIZE];
+ printf("[bytecode %s]", JS_AtomGetStrRT(rt, buf, sizeof(buf), b->func_name));
+ }
+ break;
+ case JS_TAG_OBJECT:
+ {
+ JSObject *p = JS_VALUE_GET_OBJ(val);
+ JSAtom atom = rt->class_array[p->class_id].class_name;
+ char atom_buf[ATOM_GET_STR_BUF_SIZE];
+ printf("[%s %p]",
+ JS_AtomGetStrRT(rt, atom_buf, sizeof(atom_buf), atom), (void *)p);
+ }
+ break;
+ case JS_TAG_SYMBOL:
+ {
+ JSAtomStruct *p = JS_VALUE_GET_PTR(val);
+ char atom_buf[ATOM_GET_STR_BUF_SIZE];
+ printf("Symbol(%s)",
+ JS_AtomGetStrRT(rt, atom_buf, sizeof(atom_buf), js_get_atom_index(rt, p)));
+ }
+ break;
+ case JS_TAG_MODULE:
+ printf("[module]");
+ break;
+ case JS_TAG_VAR_REF:
+ printf("[var_ref]");
+ break;
+ default:
+ printf("[unknown tag %d]", tag);
+ break;
+ }
+}
+
+#if defined(_MSC_VER)
+static void JS_DumpValue(JSContext *ctx,
+ JSValueConst val)
+#else
+static __attribute__((unused)) void JS_DumpValue(JSContext *ctx,
+ JSValueConst val)
+#endif
+{
+ JS_DumpValueShort(ctx->rt, val);
+}
+
+#if defined(_MSC_VER)
+static void JS_PrintValue(JSContext *ctx,
+ const char *str,
+ JSValueConst val)
+#else
+static __attribute__((unused)) void JS_PrintValue(JSContext *ctx,
+ const char *str,
+ JSValueConst val)
+#endif
+{
+ printf("%s=", str);
+ JS_DumpValueShort(ctx->rt, val);
+ printf("\n");
+}
+
+/* return -1 if exception (proxy case) or TRUE/FALSE */
+int JS_IsArray(JSContext *ctx, JSValueConst val)
+{
+ JSObject *p;
+ if (JS_VALUE_GET_TAG(val) == JS_TAG_OBJECT) {
+ p = JS_VALUE_GET_OBJ(val);
+ if (unlikely(p->class_id == JS_CLASS_PROXY))
+ return js_proxy_isArray(ctx, val);
+ else
+ return p->class_id == JS_CLASS_ARRAY;
+ } else {
+ return FALSE;
+ }
+}
+
+static double js_pow(double a, double b)
+{
+ if (unlikely(!isfinite(b)) && fabs(a) == 1) {
+ /* not compatible with IEEE 754 */
+ return JS_FLOAT64_NAN;
+ } else {
+ return pow(a, b);
+ }
+}
+
+#ifdef CONFIG_BIGNUM
+
+static JSValue JS_NewBigInt64(JSContext *ctx, int64_t v)
+{
+ BOOL is_bignum = is_bignum_mode(ctx);
+ if (is_bignum && v == (int32_t)v) {
+ return JS_NewInt32(ctx, v);
+ } else {
+ bf_t a_s, *a = &a_s;
+ bf_init(ctx->bf_ctx, a);
+ bf_set_si(a, v);
+ return JS_NewBigInt2(ctx, a, TRUE);
+ }
+}
+
+static JSValue JS_NewBigUint64(JSContext *ctx, uint64_t v)
+{
+ BOOL is_bignum = is_bignum_mode(ctx);
+ if (is_bignum && v == (int32_t)v) {
+ return JS_NewInt32(ctx, v);
+ } else {
+ bf_t a_s, *a = &a_s;
+ bf_init(ctx->bf_ctx, a);
+ bf_set_ui(a, v);
+ return JS_NewBigInt2(ctx, a, TRUE);
+ }
+}
+
+/* if the returned bigfloat is allocated it is equal to
+ 'buf'. Otherwise it is a pointer to the bigfloat in 'val'. */
+static bf_t *JS_ToBigFloat(JSContext *ctx, BOOL *pis_float, bf_t *buf,
+ JSValueConst val)
+{
+ uint32_t tag;
+ bf_t *r;
+ BOOL is_float;
+ JSBigFloat *p;
+
+ tag = JS_VALUE_GET_NORM_TAG(val);
+ switch(tag) {
+ case JS_TAG_INT:
+ case JS_TAG_BOOL:
+ case JS_TAG_NULL:
+ r = buf;
+ bf_init(ctx->bf_ctx, r);
+ bf_set_si(r, JS_VALUE_GET_INT(val));
+ is_float = FALSE;
+ break;
+ case JS_TAG_FLOAT64:
+ r = buf;
+ bf_init(ctx->bf_ctx, r);
+ bf_set_float64(r, JS_VALUE_GET_FLOAT64(val));
+ is_float = TRUE;
+ break;
+ case JS_TAG_BIG_INT:
+ is_float = FALSE;
+ goto get_ptr;
+ case JS_TAG_BIG_FLOAT:
+ is_float = TRUE;
+ get_ptr:
+ p = JS_VALUE_GET_PTR(val);
+ r = &p->num;
+ break;
+ case JS_TAG_UNDEFINED:
+ default:
+ r = buf;
+ bf_init(ctx->bf_ctx, r);
+ bf_set_nan(r);
+ is_float = TRUE;
+ break;
+ }
+ *pis_float = is_float;
+ return r;
+}
+
+/* return NaN if bad bigint literal */
+static JSValue JS_StringToBigInt(JSContext *ctx, JSValue val)
+{
+ const char *str;
+ const char *p;
+ int flags, err;
+
+ str = JS_ToCString(ctx, val);
+ JS_FreeValue(ctx, val);
+ if (!str)
+ return JS_EXCEPTION;
+ flags = BF_ATOF_BIN_OCT | BF_ATOF_NO_PREFIX_AFTER_SIGN |
+ BF_ATOF_JS_QUIRKS | BF_ATOF_INT_ONLY | BF_ATOF_INT_PREC_INF;
+ if (!is_bignum_mode(ctx))
+ flags |= BF_ATOF_BIG_INT;
+ val = js_atof(ctx, str, &p, 0, flags);
+ p += skip_spaces(p);
+ err = (*p != '\0');
+ JS_FreeCString(ctx, str);
+ if (err) {
+ JS_FreeValue(ctx, val);
+ val = JS_NAN;
+ }
+ return val;
+}
+
+static JSValue JS_StringToBigIntErr(JSContext *ctx, JSValue val)
+{
+ val = JS_StringToBigInt(ctx, val);
+ if (JS_VALUE_GET_TAG(val) != JS_TAG_BIG_INT) {
+ JS_FreeValue(ctx, val);
+ return JS_ThrowSyntaxError(ctx, "invalid bigint literal");
+ }
+ return val;
+}
+
+/* if the returned bigfloat is allocated it is equal to
+ 'buf'. Otherwise it is a pointer to the bigfloat in 'val'. */
+static bf_t *JS_ToBigIntFree(JSContext *ctx, bf_t *buf, JSValue val)
+{
+ uint32_t tag;
+ bf_t *r;
+ JSBigFloat *p;
+
+ redo:
+ tag = JS_VALUE_GET_NORM_TAG(val);
+ switch(tag) {
+ case JS_TAG_INT:
+ case JS_TAG_NULL:
+ case JS_TAG_UNDEFINED:
+ if (!is_bignum_mode(ctx))
+ goto fail;
+ /* fall tru */
+ case JS_TAG_BOOL:
+ r = buf;
+ bf_init(ctx->bf_ctx, r);
+ bf_set_si(r, JS_VALUE_GET_INT(val));
+ break;
+ case JS_TAG_FLOAT64:
+ {
+ double d = JS_VALUE_GET_FLOAT64(val);
+ if (!is_bignum_mode(ctx))
+ goto fail;
+ if (!isfinite(d))
+ goto fail;
+ r = buf;
+ bf_init(ctx->bf_ctx, r);
+ d = trunc(d);
+ bf_set_float64(r, d);
+ }
+ break;
+ case JS_TAG_BIG_INT:
+ p = JS_VALUE_GET_PTR(val);
+ r = &p->num;
+ break;
+ case JS_TAG_BIG_FLOAT:
+ if (!is_bignum_mode(ctx))
+ goto fail;
+ p = JS_VALUE_GET_PTR(val);
+ if (!bf_is_finite(&p->num))
+ goto fail;
+ r = buf;
+ bf_init(ctx->bf_ctx, r);
+ bf_set(r, &p->num);
+ bf_rint(r, BF_PREC_INF, BF_RNDZ);
+ JS_FreeValue(ctx, val);
+ break;
+ case JS_TAG_STRING:
+ val = JS_StringToBigIntErr(ctx, val);
+ if (JS_IsException(val))
+ return NULL;
+ goto redo;
+ case JS_TAG_OBJECT:
+ val = JS_ToPrimitiveFree(ctx, val,
+ is_bignum_mode(ctx) ? HINT_INTEGER : HINT_NUMBER);
+ if (JS_IsException(val))
+ return NULL;
+ goto redo;
+ default:
+ fail:
+ JS_FreeValue(ctx, val);
+ JS_ThrowTypeError(ctx, "cannot convert to bigint");
+ return NULL;
+ }
+ return r;
+}
+
+static bf_t *JS_ToBigInt(JSContext *ctx, bf_t *buf, JSValueConst val)
+{
+ return JS_ToBigIntFree(ctx, buf, JS_DupValue(ctx, val));
+}
+
+/* free the bf_t allocated by JS_ToBigInt */
+static void JS_FreeBigInt(JSContext *ctx, bf_t *a, bf_t *buf)
+{
+ if (a == buf) {
+ bf_delete(a);
+ } else {
+ JSBigFloat *p = (JSBigFloat *)((uint8_t *)a -
+ offsetof(JSBigFloat, num));
+ JS_FreeValue(ctx, JS_MKPTR(JS_TAG_BIG_FLOAT, p));
+ }
+}
+
+/* XXX: merge with JS_ToInt64Free with a specific flag */
+static int JS_ToBigInt64Free(JSContext *ctx, int64_t *pres, JSValue val)
+{
+ bf_t a_s, *a;
+
+ a = JS_ToBigIntFree(ctx, &a_s, val);
+ if (!a) {
+ *pres = 0;
+ return -1;
+ }
+ bf_get_int64(pres, a, BF_GET_INT_MOD);
+ JS_FreeBigInt(ctx, a, &a_s);
+ return 0;
+}
+
+static int JS_ToBigInt64(JSContext *ctx, int64_t *pres, JSValueConst val)
+{
+ return JS_ToBigInt64Free(ctx, pres, JS_DupValue(ctx, val));
+}
+
+static JSBigFloat *js_new_bf(JSContext *ctx)
+{
+ JSBigFloat *p;
+ p = js_mallocz(ctx, sizeof(*p));
+ if (!p)
+ return NULL;
+ p->header.ref_count = 1;
+ bf_init(ctx->bf_ctx, &p->num);
+ return p;
+}
+
+/* WARNING: 'a' is freed */
+static JSValue JS_NewBigFloat(JSContext *ctx, bf_t *a)
+{
+ JSValue ret;
+ JSBigFloat *p;
+
+ p = js_new_bf(ctx);
+ p->num = *a;
+ ret = JS_MKPTR(JS_TAG_BIG_FLOAT, p);
+ return ret;
+}
+
+/* WARNING: 'a' is freed */
+static JSValue JS_NewBigInt2(JSContext *ctx, bf_t *a, BOOL force_bigint)
+{
+ JSValue ret;
+ JSBigFloat *p;
+ int32_t v;
+
+ if (!force_bigint && bf_get_int32(&v, a, 0) == 0) {
+ /* can fit in an int32 */
+ ret = JS_NewInt32(ctx, v);
+ bf_delete(a);
+ } else {
+ p = js_new_bf(ctx);
+ p->num = *a;
+ /* normalize the zero representation */
+ if (bf_is_zero(&p->num))
+ p->num.sign = 0;
+ ret = JS_MKPTR(JS_TAG_BIG_INT, p);
+ }
+ return ret;
+}
+
+static JSValue JS_NewBigInt(JSContext *ctx, bf_t *a)
+{
+ return JS_NewBigInt2(ctx, a, FALSE);
+}
+
+/* return < 0 if exception, 0 if overloading method, 1 if overloading
+ operator called */
+static __exception int js_call_binary_op_fallback(JSContext *ctx,
+ JSValue *pret,
+ JSValueConst op1,
+ JSValueConst op2,
+ OPCodeEnum op)
+{
+ JSAtom op_name;
+ JSValue method, ret, c1, c2;
+ BOOL bool_result, swap_op;
+ JSValueConst args[2];
+
+ bool_result = FALSE;
+ swap_op = FALSE;
+ c1 = JS_UNDEFINED;
+ c2 = JS_UNDEFINED;
+ switch(op) {
+ case OP_add:
+ op_name = JS_ATOM_Symbol_operatorAdd;
+ break;
+ case OP_sub:
+ op_name = JS_ATOM_Symbol_operatorSub;
+ break;
+ case OP_mul:
+ op_name = JS_ATOM_Symbol_operatorMul;
+ break;
+ case OP_div:
+ op_name = JS_ATOM_Symbol_operatorDiv;
+ break;
+ case OP_mod:
+ op_name = JS_ATOM_Symbol_operatorMod;
+ break;
+ case OP_pow:
+ op_name = JS_ATOM_Symbol_operatorPow;
+ break;
+ case OP_math_div:
+ op_name = JS_ATOM_Symbol_operatorMathDiv;
+ break;
+ case OP_math_mod:
+ op_name = JS_ATOM_Symbol_operatorMathMod;
+ break;
+ case OP_math_pow:
+ op_name = JS_ATOM_Symbol_operatorMathPow;
+ break;
+ case OP_shl:
+ op_name = JS_ATOM_Symbol_operatorShl;
+ break;
+ case OP_sar:
+ op_name = JS_ATOM_Symbol_operatorShr;
+ break;
+ case OP_and:
+ op_name = JS_ATOM_Symbol_operatorAnd;
+ break;
+ case OP_or:
+ op_name = JS_ATOM_Symbol_operatorOr;
+ break;
+ case OP_xor:
+ op_name = JS_ATOM_Symbol_operatorXor;
+ break;
+ case OP_lt:
+ op_name = JS_ATOM_Symbol_operatorCmpLT;
+ bool_result = TRUE;
+ break;
+ case OP_lte:
+ op_name = JS_ATOM_Symbol_operatorCmpLE;
+ bool_result = TRUE;
+ break;
+ case OP_gt:
+ op_name = JS_ATOM_Symbol_operatorCmpLT;
+ bool_result = TRUE;
+ swap_op = TRUE;
+ break;
+ case OP_gte:
+ op_name = JS_ATOM_Symbol_operatorCmpLE;
+ bool_result = TRUE;
+ swap_op = TRUE;
+ break;
+ case OP_eq:
+ case OP_neq:
+ op_name = JS_ATOM_Symbol_operatorCmpEQ;
+ bool_result = TRUE;
+ break;
+ default:
+ goto fail;
+ }
+ c1 = JS_GetProperty(ctx, op1, JS_ATOM_constructor);
+ if (JS_IsException(c1))
+ goto exception;
+ c2 = JS_GetProperty(ctx, op2, JS_ATOM_constructor);
+ if (JS_IsException(c2))
+ goto exception;
+ if (JS_VALUE_GET_TAG(c1) != JS_TAG_OBJECT ||
+ JS_VALUE_GET_TAG(c2) != JS_TAG_OBJECT)
+ goto fail;
+ if (JS_VALUE_GET_OBJ(c1) == JS_VALUE_GET_OBJ(c2)) {
+ /* if same constructor, there is no ambiguity */
+ method = JS_GetProperty(ctx, c1, op_name);
+ } else {
+ JSValue val;
+ int order1, order2;
+
+ /* different constructors: we use a user-defined ordering */
+ val = JS_GetProperty(ctx, c1, JS_ATOM_Symbol_operatorOrder);
+ if (JS_IsException(val))
+ goto exception;
+ if (JS_IsUndefined(val))
+ goto undef_order;
+ if (JS_ToInt32Free(ctx, &order1, val))
+ goto exception;
+ val = JS_GetProperty(ctx, c2, JS_ATOM_Symbol_operatorOrder);
+ if (JS_IsException(val))
+ goto exception;
+ if (JS_IsUndefined(val)) {
+ undef_order:
+ JS_FreeValue(ctx, c1);
+ JS_FreeValue(ctx, c2);
+ *pret = JS_UNDEFINED;
+ return 0;
+ }
+ if (JS_ToInt32Free(ctx, &order2, val))
+ goto exception;
+ /* ambiguous priority: error */
+ if (order1 == order2) {
+ JS_ThrowTypeError(ctx, "operator_order is identical in both constructors");
+ goto exception;
+ }
+ if (order1 > order2) {
+ val = c1;
+ } else {
+ val = c2;
+ }
+ method = JS_GetProperty(ctx, val, op_name);
+ }
+ JS_FreeValue(ctx, c1);
+ JS_FreeValue(ctx, c2);
+ c1 = JS_UNDEFINED;
+ c2 = JS_UNDEFINED;
+ if (JS_IsException(method))
+ goto exception;
+ if (JS_IsUndefined(method) || JS_IsNull(method)) {
+ *pret = JS_UNDEFINED;
+ return 0;
+ }
+ if (swap_op) {
+ args[0] = op2;
+ args[1] = op1;
+ } else {
+ args[0] = op1;
+ args[1] = op2;
+ }
+ ret = JS_CallFree(ctx, method, JS_UNDEFINED, 2, args);
+ if (JS_IsException(ret))
+ goto exception;
+ if (bool_result) {
+ BOOL res = JS_ToBoolFree(ctx, ret);
+ if (op == OP_neq)
+ res ^= 1;
+ ret = JS_NewBool(ctx, res);
+ }
+ *pret = ret;
+ return 1;
+ fail:
+ JS_ThrowTypeError(ctx, "invalid types for binary operator");
+ exception:
+ JS_FreeValue(ctx, c1);
+ JS_FreeValue(ctx, c2);
+ *pret = JS_UNDEFINED;
+ return -1;
+}
+
+static JSValue throw_bf_exception(JSContext *ctx, int status)
+{
+ const char *str;
+ if (status & BF_ST_DIVIDE_ZERO) {
+ str = "division by zero";
+ } else if (status & BF_ST_INVALID_OP) {
+ str = "invalid operation";
+ } else {
+ str = "integer overflow";
+ }
+ return JS_ThrowRangeError(ctx, "%s", str);
+}
+
+static no_inline __exception int js_unary_arith_slow(JSContext *ctx,
+ JSValue *sp,
+ OPCodeEnum op)
+{
+ JSValue op1, val, method;
+ bf_t a_s, r_s, *r = &r_s, *a;
+ BOOL is_float, is_legacy;
+ JSAtom op_name;
+ int ret, v;
+ uint32_t tag;
+
+ op1 = sp[-1];
+ /* fast path for float64 */
+ if (JS_TAG_IS_FLOAT64(JS_VALUE_GET_TAG(op1)))
+ goto handle_float64;
+ if (JS_IsObject(op1)) {
+ switch(op) {
+ case OP_plus:
+ op_name = JS_ATOM_Symbol_operatorPlus;
+ break;
+ case OP_neg:
+ op_name = JS_ATOM_Symbol_operatorNeg;
+ break;
+ case OP_inc:
+ op_name = JS_ATOM_Symbol_operatorInc;
+ break;
+ case OP_dec:
+ op_name = JS_ATOM_Symbol_operatorDec;
+ break;
+ default:
+ abort();
+ }
+ method = JS_GetProperty(ctx, op1, op_name);
+ if (JS_IsException(method))
+ return -1;
+ if (JS_IsUndefined(method) || JS_IsNull(method))
+ goto to_number;
+ val = JS_CallFree(ctx, method, op1, 0, NULL);
+ if (JS_IsException(val))
+ return -1;
+ JS_FreeValue(ctx, op1);
+ sp[-1] = val;
+ } else {
+ to_number:
+ op1 = JS_ToNumericFree(ctx, op1);
+ if (JS_IsException(op1))
+ goto exception;
+ is_legacy = is_bignum_mode(ctx) ^ 1;
+ tag = JS_VALUE_GET_TAG(op1);
+ switch(tag) {
+ case JS_TAG_INT:
+ {
+ int64_t v64;
+ v64 = JS_VALUE_GET_INT(op1);
+ switch(op) {
+ case OP_inc:
+ case OP_dec:
+ v = 2 * (op - OP_dec) - 1;
+ v64 += v;
+ break;
+ case OP_plus:
+ break;
+ case OP_neg:
+ if (v64 == 0 && is_legacy) {
+ sp[-1] = __JS_NewFloat64(ctx, -0.0);
+ return 0;
+ } else {
+ v64 = -v64;
+ }
+ break;
+ default:
+ abort();
+ }
+ sp[-1] = JS_NewInt64(ctx, v64);
+ }
+ break;
+ case JS_TAG_BIG_INT:
+ if (is_legacy && op == OP_plus) {
+ JS_ThrowTypeError(ctx, "bigint argument with unary +");
+ JS_FreeValue(ctx, op1);
+ goto exception;
+ }
+ a = JS_ToBigFloat(ctx, &is_float, &a_s, op1);
+ bf_init(ctx->bf_ctx, r);
+ ret = 0;
+ switch(op) {
+ case OP_inc:
+ case OP_dec:
+ v = 2 * (op - OP_dec) - 1;
+ ret = bf_add_si(r, a, v, BF_PREC_INF, BF_RNDZ) & BF_ST_OVERFLOW;
+ break;
+ case OP_plus:
+ bf_set(r, a);
+ break;
+ case OP_neg:
+ bf_set(r, a);
+ bf_neg(r);
+ break;
+ default:
+ abort();
+ }
+ if (a == &a_s)
+ bf_delete(a);
+ JS_FreeValue(ctx, op1);
+ if (unlikely(ret)) {
+ bf_delete(r);
+ throw_bf_exception(ctx, ret);
+ goto exception;
+ }
+ sp[-1] = JS_NewBigInt2(ctx, r, is_legacy);
+ break;
+ case JS_TAG_BIG_FLOAT:
+ a = JS_ToBigFloat(ctx, &is_float, &a_s, op1);
+ bf_init(ctx->bf_ctx, r);
+ ret = 0;
+ switch(op) {
+ case OP_inc:
+ case OP_dec:
+ v = 2 * (op - OP_dec) - 1;
+ bf_add_si(r, a, v, ctx->fp_env.prec, ctx->fp_env.flags);
+ break;
+ case OP_plus:
+ bf_set(r, a);
+ break;
+ case OP_neg:
+ bf_set(r, a);
+ bf_neg(r);
+ break;
+ default:
+ abort();
+ }
+ if (a == &a_s)
+ bf_delete(a);
+ JS_FreeValue(ctx, op1);
+ if (unlikely(ret)) {
+ bf_delete(r);
+ throw_bf_exception(ctx, ret);
+ goto exception;
+ }
+ sp[-1] = JS_NewBigFloat(ctx, r);
+ break;
+ default:
+ handle_float64:
+ {
+ double d;
+ d = JS_VALUE_GET_FLOAT64(op1);
+ switch(op) {
+ case OP_inc:
+ case OP_dec:
+ v = 2 * (op - OP_dec) - 1;
+ d += v;
+ break;
+ case OP_plus:
+ break;
+ case OP_neg:
+ d = -d;
+ break;
+ default:
+ abort();
+ }
+ sp[-1] = __JS_NewFloat64(ctx, d);
+ }
+ break;
+ }
+ }
+ return 0;
+ exception:
+ sp[-1] = JS_UNDEFINED;
+ return -1;
+}
+
+static __exception int js_post_inc_slow(JSContext *ctx,
+ JSValue *sp, OPCodeEnum op)
+{
+ JSValue op1;
+
+ /* XXX: allow custom operators */
+ op1 = sp[-1];
+ op1 = JS_ToNumericFree(ctx, op1);
+ if (JS_IsException(op1)) {
+ sp[-1] = JS_UNDEFINED;
+ return -1;
+ }
+ sp[-1] = op1;
+ sp[0] = JS_DupValue(ctx, op1);
+ return js_unary_arith_slow(ctx, sp + 1, op - OP_post_dec + OP_dec);
+}
+
+static no_inline int js_not_slow(JSContext *ctx, JSValue *sp)
+{
+ JSValue op1, method, val;
+ bf_t a_s, r_s, *r = &r_s, *a;
+ int ret;
+ BOOL is_legacy;
+
+ op1 = sp[-1];
+ if (JS_IsObject(op1)) {
+ method = JS_GetProperty(ctx, op1, JS_ATOM_Symbol_operatorNot);
+ if (JS_IsException(method))
+ return -1;
+ if (JS_IsUndefined(method) || JS_IsNull(method))
+ goto to_number;
+ val = JS_CallFree(ctx, method, op1, 0, NULL);
+ if (JS_IsException(val))
+ return -1;
+ JS_FreeValue(ctx, op1);
+ sp[-1] = val;
+ } else {
+ if (JS_IsString(op1)) {
+ to_number:
+ op1 = JS_ToNumberHintFree(ctx, op1, TON_FLAG_INTEGER);
+ if (JS_IsException(op1))
+ goto exception;
+ }
+ is_legacy = is_bignum_mode(ctx) ^ 1;
+ if (!is_legacy || JS_VALUE_GET_TAG(op1) == JS_TAG_BIG_INT) {
+ a = JS_ToBigIntFree(ctx, &a_s, op1);
+ bf_init(ctx->bf_ctx, r);
+ ret = bf_add_si(r, a, 1, BF_PREC_INF, BF_RNDZ) & BF_ST_OVERFLOW;
+ bf_neg(r);
+ JS_FreeBigInt(ctx, a, &a_s);
+ if (unlikely(ret)) {
+ bf_delete(r);
+ throw_bf_exception(ctx, ret);
+ goto exception;
+ }
+ sp[-1] = JS_NewBigInt2(ctx, r, is_legacy);
+ } else {
+ int32_t v1;
+ if (unlikely(JS_ToInt32Free(ctx, &v1, op1)))
+ goto exception;
+ sp[-1] = JS_NewInt32(ctx, ~v1);
+ }
+ }
+ return 0;
+ exception:
+ sp[-1] = JS_UNDEFINED;
+ return -1;
+}
+
+static no_inline __exception int js_binary_arith_slow(JSContext *ctx, JSValue *sp,
+ OPCodeEnum op)
+{
+ JSValue op1, op2, res;
+ BOOL is_float, is_legacy;
+ uint32_t tag1, tag2;
+ int ret, rnd_mode;
+ double d1, d2;
+
+ op1 = sp[-2];
+ op2 = sp[-1];
+ tag1 = JS_VALUE_GET_NORM_TAG(op1);
+ tag2 = JS_VALUE_GET_NORM_TAG(op2);
+ /* fast path for float operations */
+ if (tag1 == JS_TAG_FLOAT64 && tag2 == JS_TAG_FLOAT64) {
+ d1 = JS_VALUE_GET_FLOAT64(op1);
+ d2 = JS_VALUE_GET_FLOAT64(op2);
+ goto handle_float64;
+ }
+
+ /* try to call an overloaded operator */
+ if ((tag1 == JS_TAG_OBJECT &&
+ (tag2 != JS_TAG_NULL && tag2 != JS_TAG_UNDEFINED)) ||
+ (tag2 == JS_TAG_OBJECT &&
+ (tag1 != JS_TAG_NULL && tag1 != JS_TAG_UNDEFINED))) {
+ ret = js_call_binary_op_fallback(ctx, &res, op1, op2, op);
+ if (ret != 0) {
+ JS_FreeValue(ctx, op1);
+ JS_FreeValue(ctx, op2);
+ if (ret < 0) {
+ goto exception;
+ } else {
+ sp[-2] = res;
+ return 0;
+ }
+ }
+ }
+
+ op1 = JS_ToNumericFree(ctx, op1);
+ if (JS_IsException(op1)) {
+ JS_FreeValue(ctx, op2);
+ goto exception;
+ }
+ op2 = JS_ToNumericFree(ctx, op2);
+ if (JS_IsException(op2)) {
+ JS_FreeValue(ctx, op1);
+ goto exception;
+ }
+ tag1 = JS_VALUE_GET_NORM_TAG(op1);
+ tag2 = JS_VALUE_GET_NORM_TAG(op2);
+
+ is_legacy = is_bignum_mode(ctx) ^ 1;
+ if (is_legacy && (tag1 == JS_TAG_BIG_INT || tag2 == JS_TAG_BIG_INT) &&
+ tag1 != tag2) {
+ JS_FreeValue(ctx, op1);
+ JS_FreeValue(ctx, op2);
+ JS_ThrowTypeError(ctx, "both operands must be bigint");
+ goto exception;
+ }
+
+ if (tag1 == JS_TAG_INT && tag2 == JS_TAG_INT) {
+ int32_t v1, v2;
+ int64_t v;
+ v1 = JS_VALUE_GET_INT(op1);
+ v2 = JS_VALUE_GET_INT(op2);
+ switch(op) {
+ case OP_sub:
+ v = (int64_t)v1 - (int64_t)v2;
+ break;
+ case OP_mul:
+ v = (int64_t)v1 * (int64_t)v2;
+ if (is_legacy && v == 0 && (v1 | v2) < 0) {
+ sp[-2] = __JS_NewFloat64(ctx, -0.0);
+ return 0;
+ }
+ break;
+ case OP_math_div:
+ goto op_fallback2;
+ case OP_div:
+ sp[-2] = __JS_NewFloat64(ctx, (double)v1 / (double)v2);
+ return 0;
+ case OP_math_mod:
+ if (unlikely(v2 == 0)) {
+ throw_bf_exception(ctx, BF_ST_DIVIDE_ZERO);
+ goto exception;
+ }
+ v = (int64_t)v1 % (int64_t)v2;
+ if (v < 0) {
+ if (v2 < 0)
+ v -= v2;
+ else
+ v += v2;
+ }
+ break;
+ case OP_mod:
+ if (is_legacy && (v1 < 0 || v2 <= 0)) {
+ sp[-2] = JS_NewFloat64(ctx, fmod(v1, v2));
+ return 0;
+ } else {
+ if (unlikely(v2 == 0)) {
+ throw_bf_exception(ctx, BF_ST_DIVIDE_ZERO);
+ goto exception;
+ }
+ v = (int64_t)v1 % (int64_t)v2;
+ }
+ break;
+ case OP_pow:
+ case OP_math_pow:
+ if (is_legacy) {
+ sp[-2] = JS_NewFloat64(ctx, js_pow(v1, v2));
+ return 0;
+ } else {
+ goto handle_bigint;
+ }
+ break;
+ default:
+ abort();
+ }
+ sp[-2] = JS_NewInt64(ctx, v);
+ } else if ((tag1 == JS_TAG_BIG_INT && (tag2 == JS_TAG_INT ||
+ tag2 == JS_TAG_BIG_INT)) ||
+ (tag2 == JS_TAG_BIG_INT && tag1 == JS_TAG_INT)) {
+ /* big int result */
+ bf_t a_s, b_s, r_s, *r, *a, *b;
+ handle_bigint:
+ a = JS_ToBigFloat(ctx, &is_float, &a_s, op1);
+ b = JS_ToBigFloat(ctx, &is_float, &b_s, op2);
+ r = &r_s;
+ bf_init(ctx->bf_ctx, r);
+ ret = 0;
+ switch(op) {
+ case OP_sub:
+ ret = bf_sub(r, a, b, BF_PREC_INF, BF_RNDZ) & BF_ST_OVERFLOW;
+ break;
+ case OP_mul:
+ ret = bf_mul(r, a, b, BF_PREC_INF, BF_RNDZ) & BF_ST_OVERFLOW;
+ break;
+ case OP_math_div:
+ goto op_fallback;
+ case OP_div:
+ if (is_legacy) {
+ bf_t rem_s, *rem = &rem_s;
+ bf_init(ctx->bf_ctx, rem);
+ ret = bf_divrem(r, rem, a, b, BF_PREC_INF, BF_RNDZ,
+ BF_RNDZ) & BF_ST_INVALID_OP;
+ bf_delete(rem);
+ } else {
+ bf_div(r, a, b, ctx->fp_env.prec, ctx->fp_env.flags);
+ goto float64_result;
+ }
+ break;
+ case OP_math_mod:
+ /* Euclidian remainder */
+ rnd_mode = BF_DIVREM_EUCLIDIAN;
+ goto do_int_mod;
+ case OP_mod:
+ rnd_mode = BF_RNDZ;
+ do_int_mod:
+ {
+ bf_t q_s, *q = &q_s;
+ bf_init(ctx->bf_ctx, q);
+ ret = bf_divrem(q, r, a, b, BF_PREC_INF, BF_RNDZ,
+ rnd_mode) & BF_ST_INVALID_OP;
+ bf_delete(q);
+ }
+ break;
+ case OP_pow:
+ case OP_math_pow:
+ if (b->sign) {
+ if (is_legacy) {
+ ret = BF_ST_INVALID_OP;
+ } else {
+ bf_set_ui(r, 1);
+ if (bf_cmpu(a, r) <= 0) {
+ goto do_int_pow;
+ } else if (op == OP_math_pow) {
+ op_fallback:
+ bf_delete(r);
+ if (a == &a_s)
+ bf_delete(a);
+ if (b == &b_s)
+ bf_delete(b);
+ op_fallback2:
+ ret = js_call_binary_op_fallback(ctx, &res, op1, op2, op);
+ JS_FreeValue(ctx, op1);
+ JS_FreeValue(ctx, op2);
+ if (ret < 0) {
+ goto exception;
+ } else if (ret == 0) {
+ JS_ThrowTypeError(ctx, "operator must be defined for exact division or power");
+ goto exception;
+ }
+ sp[-2] = res;
+ return 0;
+ } else {
+ double dr;
+ bf_pow(r, a, b, 53, bf_set_exp_bits(11) |
+ BF_RNDN | BF_FLAG_SUBNORMAL);
+ float64_result:
+ bf_get_float64(r, &dr, BF_RNDN);
+ bf_delete(r);
+ if (a == &a_s)
+ bf_delete(a);
+ if (b == &b_s)
+ bf_delete(b);
+ JS_FreeValue(ctx, op1);
+ JS_FreeValue(ctx, op2);
+ sp[-2] = __JS_NewFloat64(ctx, dr);
+ return 0;
+ }
+ }
+ } else {
+ do_int_pow:
+ ret = bf_pow(r, a, b, BF_PREC_INF, BF_RNDZ | BF_POW_JS_QUICKS) &
+ (BF_ST_OVERFLOW | BF_ST_DIVIDE_ZERO);
+ }
+ break;
+ default:
+ abort();
+ }
+ if (a == &a_s)
+ bf_delete(a);
+ if (b == &b_s)
+ bf_delete(b);
+ JS_FreeValue(ctx, op1);
+ JS_FreeValue(ctx, op2);
+ if (unlikely(ret)) {
+ bf_delete(r);
+ throw_bf_exception(ctx, ret);
+ goto exception;
+ }
+ sp[-2] = JS_NewBigInt2(ctx, r, is_legacy);
+ } else if ((tag1 == JS_TAG_FLOAT64 && (tag2 == JS_TAG_FLOAT64 ||
+ tag2 == JS_TAG_INT ||
+ tag2 == JS_TAG_BIG_INT)) ||
+ (tag2 == JS_TAG_FLOAT64 && (tag1 == JS_TAG_INT ||
+ tag1 == JS_TAG_BIG_INT))) {
+ double dr;
+ /* float64 result */
+ JS_ToFloat64Free(ctx, &d1, op1);
+ JS_ToFloat64Free(ctx, &d2, op2);
+ handle_float64:
+ switch(op) {
+ case OP_sub:
+ dr = d1 - d2;
+ break;
+ case OP_mul:
+ dr = d1 * d2;
+ break;
+ case OP_div:
+ case OP_math_div:
+ dr = d1 / d2;
+ break;
+ case OP_mod:
+ dr = fmod(d1, d2);
+ break;
+ case OP_math_mod:
+ if (d1 >= 0 && d2 >= 0) {
+ dr = fmod(d1, d2);
+ } else {
+ /* XXX: slow */
+ bf_t a, b, r, q;
+ bf_init(ctx->bf_ctx, &a);
+ bf_init(ctx->bf_ctx, &b);
+ bf_init(ctx->bf_ctx, &r);
+ bf_set_float64(&a, d1);
+ bf_set_float64(&b, d2);
+ bf_divrem(&q, &r, &a, &b,
+ 53, bf_set_exp_bits(11) | BF_RNDN | BF_FLAG_SUBNORMAL,
+ BF_DIVREM_EUCLIDIAN);
+ bf_get_float64(&q, &dr, BF_RNDN);
+ bf_delete(&a);
+ bf_delete(&b);
+ bf_delete(&q);
+ bf_delete(&r);
+ }
+ break;
+ case OP_pow:
+ case OP_math_pow:
+ dr = js_pow(d1, d2);
+ break;
+ default:
+ abort();
+ }
+ sp[-2] = __JS_NewFloat64(ctx, dr);
+ } else {
+ bf_t a_s, b_s, r_s, *r, *a, *b;
+ /* big float result */
+ a = JS_ToBigFloat(ctx, &is_float, &a_s, op1);
+ b = JS_ToBigFloat(ctx, &is_float, &b_s, op2);
+ r = &r_s;
+ bf_init(ctx->bf_ctx, r);
+ ret = 0;
+ switch(op) {
+ case OP_sub:
+ bf_sub(r, a, b, ctx->fp_env.prec, ctx->fp_env.flags);
+ break;
+ case OP_mul:
+ bf_mul(r, a, b, ctx->fp_env.prec, ctx->fp_env.flags);
+ break;
+ case OP_math_div:
+ case OP_div:
+ bf_div(r, a, b, ctx->fp_env.prec, ctx->fp_env.flags);
+ break;
+ case OP_math_mod:
+ /* Euclidian remainder */
+ rnd_mode = BF_DIVREM_EUCLIDIAN;
+ goto do_mod;
+ case OP_mod:
+ rnd_mode = BF_RNDZ;
+ do_mod:
+ {
+ bf_t q_s, *q = &q_s;
+ bf_init(ctx->bf_ctx, q);
+ bf_divrem(q, r, a, b, ctx->fp_env.prec, ctx->fp_env.flags,
+ rnd_mode);
+ bf_delete(q);
+ }
+ break;
+ case OP_pow:
+ case OP_math_pow:
+ bf_pow(r, a, b, ctx->fp_env.prec,
+ ctx->fp_env.flags | BF_POW_JS_QUICKS);
+ break;
+ default:
+ abort();
+ }
+ if (a == &a_s)
+ bf_delete(a);
+ if (b == &b_s)
+ bf_delete(b);
+ JS_FreeValue(ctx, op1);
+ JS_FreeValue(ctx, op2);
+ if (unlikely(ret)) {
+ bf_delete(r);
+ throw_bf_exception(ctx, ret);
+ goto exception;
+ }
+ sp[-2] = JS_NewBigFloat(ctx, r);
+ }
+ return 0;
+ exception:
+ sp[-2] = JS_UNDEFINED;
+ sp[-1] = JS_UNDEFINED;
+ return -1;
+}
+
+static no_inline __exception int js_add_slow(JSContext *ctx, JSValue *sp)
+{
+ JSValue op1, op2, res;
+ uint32_t tag1, tag2;
+ BOOL is_float, is_legacy;
+ int ret;
+
+ op1 = sp[-2];
+ op2 = sp[-1];
+
+ tag1 = JS_VALUE_GET_NORM_TAG(op1);
+ tag2 = JS_VALUE_GET_NORM_TAG(op2);
+ /* fast path for float64 */
+ if (tag1 == JS_TAG_FLOAT64 && tag2 == JS_TAG_FLOAT64) {
+ double d1, d2;
+ d1 = JS_VALUE_GET_FLOAT64(op1);
+ d2 = JS_VALUE_GET_FLOAT64(op2);
+ sp[-2] = __JS_NewFloat64(ctx, d1 + d2);
+ return 0;
+ }
+
+ if (tag1 == JS_TAG_OBJECT || tag2 == JS_TAG_OBJECT) {
+ /* try to call an overloaded operator */
+ if ((tag1 == JS_TAG_OBJECT &&
+ (tag2 != JS_TAG_NULL && tag2 != JS_TAG_UNDEFINED)) ||
+ (tag2 == JS_TAG_OBJECT &&
+ (tag1 != JS_TAG_NULL && tag1 != JS_TAG_UNDEFINED))) {
+ ret = js_call_binary_op_fallback(ctx, &res, op1, op2, OP_add);
+ if (ret != 0) {
+ JS_FreeValue(ctx, op1);
+ JS_FreeValue(ctx, op2);
+ if (ret < 0) {
+ goto exception;
+ } else {
+ sp[-2] = res;
+ return 0;
+ }
+ }
+ }
+
+ op1 = JS_ToPrimitiveFree(ctx, op1, HINT_NONE);
+ if (JS_IsException(op1)) {
+ JS_FreeValue(ctx, op2);
+ goto exception;
+ }
+
+ op2 = JS_ToPrimitiveFree(ctx, op2, HINT_NONE);
+ if (JS_IsException(op2)) {
+ JS_FreeValue(ctx, op1);
+ goto exception;
+ }
+ tag1 = JS_VALUE_GET_NORM_TAG(op1);
+ tag2 = JS_VALUE_GET_NORM_TAG(op2);
+ }
+
+ if (tag1 == JS_TAG_STRING || tag2 == JS_TAG_STRING) {
+ sp[-2] = JS_ConcatString(ctx, op1, op2);
+ if (JS_IsException(sp[-2]))
+ goto exception;
+ return 0;
+ }
+
+ op1 = JS_ToNumericFree(ctx, op1);
+ if (JS_IsException(op1)) {
+ JS_FreeValue(ctx, op2);
+ goto exception;
+ }
+ op2 = JS_ToNumericFree(ctx, op2);
+ if (JS_IsException(op2)) {
+ JS_FreeValue(ctx, op1);
+ goto exception;
+ }
+ tag1 = JS_VALUE_GET_NORM_TAG(op1);
+ tag2 = JS_VALUE_GET_NORM_TAG(op2);
+
+ is_legacy = is_bignum_mode(ctx) ^ 1;
+ if (is_legacy && (tag1 == JS_TAG_BIG_INT || tag2 == JS_TAG_BIG_INT) &&
+ tag1 != tag2) {
+ JS_FreeValue(ctx, op1);
+ JS_FreeValue(ctx, op2);
+ JS_ThrowTypeError(ctx, "both operands must be bigint");
+ goto exception;
+ }
+
+ if (tag1 == JS_TAG_INT && tag2 == JS_TAG_INT) {
+ int32_t v1, v2;
+ int64_t v;
+ v1 = JS_VALUE_GET_INT(op1);
+ v2 = JS_VALUE_GET_INT(op2);
+ v = (int64_t)v1 + (int64_t)v2;
+ sp[-2] = JS_NewInt64(ctx, v);
+ } else if ((tag1 == JS_TAG_BIG_INT && (tag2 == JS_TAG_INT ||
+ tag2 == JS_TAG_BIG_INT)) ||
+ (tag2 == JS_TAG_BIG_INT && tag1 == JS_TAG_INT)) {
+ bf_t a_s, b_s, r_s, *r, *a, *b;
+ /* big int result */
+ a = JS_ToBigFloat(ctx, &is_float, &a_s, op1);
+ b = JS_ToBigFloat(ctx, &is_float, &b_s, op2);
+ r = &r_s;
+ bf_init(ctx->bf_ctx, r);
+ ret = bf_add(r, a, b, BF_PREC_INF, BF_RNDZ) & BF_ST_OVERFLOW;
+ if (a == &a_s)
+ bf_delete(a);
+ if (b == &b_s)
+ bf_delete(b);
+ JS_FreeValue(ctx, op1);
+ JS_FreeValue(ctx, op2);
+ if (unlikely(ret)) {
+ bf_delete(r);
+ throw_bf_exception(ctx, ret);
+ goto exception;
+ }
+ sp[-2] = JS_NewBigInt2(ctx, r, is_legacy);
+ } else if ((tag1 == JS_TAG_FLOAT64 && (tag2 == JS_TAG_FLOAT64 ||
+ tag2 == JS_TAG_INT ||
+ tag2 == JS_TAG_BIG_INT)) ||
+ (tag2 == JS_TAG_FLOAT64 && (tag1 == JS_TAG_INT ||
+ tag1 == JS_TAG_BIG_INT))) {
+ double d1, d2;
+ /* float64 result */
+ JS_ToFloat64Free(ctx, &d1, op1);
+ JS_ToFloat64Free(ctx, &d2, op2);
+ sp[-2] = __JS_NewFloat64(ctx, d1 + d2);
+ } else {
+ bf_t a_s, b_s, r_s, *r, *a, *b;
+ /* big float result */
+ a = JS_ToBigFloat(ctx, &is_float, &a_s, op1);
+ b = JS_ToBigFloat(ctx, &is_float, &b_s, op2);
+
+ r = &r_s;
+ bf_init(ctx->bf_ctx, r);
+ bf_add(r, a, b, ctx->fp_env.prec, ctx->fp_env.flags);
+ if (a == &a_s)
+ bf_delete(a);
+ if (b == &b_s)
+ bf_delete(b);
+ JS_FreeValue(ctx, op1);
+ JS_FreeValue(ctx, op2);
+ if (unlikely(ret)) {
+ bf_delete(r);
+ throw_bf_exception(ctx, ret);
+ goto exception;
+ }
+ sp[-2] = JS_NewBigFloat(ctx, r);
+ }
+ return 0;
+ exception:
+ sp[-2] = JS_UNDEFINED;
+ sp[-1] = JS_UNDEFINED;
+ return -1;
+}
+
+static no_inline __exception int js_binary_logic_slow(JSContext *ctx,
+ JSValue *sp,
+ OPCodeEnum op)
+{
+ JSValue op1, op2, res;
+ bf_t a_s, b_s, r_s, *r, *a, *b;
+ int ret;
+ uint32_t tag1, tag2;
+ BOOL is_legacy;
+
+ op1 = sp[-2];
+ op2 = sp[-1];
+ tag1 = JS_VALUE_GET_NORM_TAG(op1);
+ tag2 = JS_VALUE_GET_NORM_TAG(op2);
+
+ /* try to call an overloaded operator */
+ if ((tag1 == JS_TAG_OBJECT &&
+ (tag2 != JS_TAG_NULL && tag2 != JS_TAG_UNDEFINED)) ||
+ (tag2 == JS_TAG_OBJECT &&
+ (tag1 != JS_TAG_NULL && tag1 != JS_TAG_UNDEFINED))) {
+ ret = js_call_binary_op_fallback(ctx, &res, op1, op2, op);
+ if (ret != 0) {
+ JS_FreeValue(ctx, op1);
+ JS_FreeValue(ctx, op2);
+ if (ret < 0) {
+ goto exception;
+ } else {
+ sp[-2] = res;
+ return 0;
+ }
+ }
+ }
+
+ op1 = JS_ToNumberHintFree(ctx, op1, TON_FLAG_INTEGER);
+ if (JS_IsException(op1)) {
+ JS_FreeValue(ctx, op2);
+ goto exception;
+ }
+ op2 = JS_ToNumberHintFree(ctx, op2, TON_FLAG_INTEGER);
+ if (JS_IsException(op2)) {
+ JS_FreeValue(ctx, op1);
+ goto exception;
+ }
+
+ is_legacy = is_bignum_mode(ctx) ^ 1;
+ if (is_legacy) {
+ uint32_t v1, v2, r;
+
+ tag1 = JS_VALUE_GET_TAG(op1);
+ tag2 = JS_VALUE_GET_TAG(op2);
+ if (tag1 == JS_TAG_BIG_INT || tag2 == JS_TAG_BIG_INT) {
+ if (tag1 != tag2) {
+ JS_FreeValue(ctx, op1);
+ JS_FreeValue(ctx, op2);
+ JS_ThrowTypeError(ctx, "both operands must be bigint");
+ goto exception;
+ }
+ } else {
+ if (unlikely(JS_ToInt32Free(ctx, (int32_t *)&v1, op1))) {
+ JS_FreeValue(ctx, op2);
+ goto exception;
+ }
+ if (unlikely(JS_ToInt32Free(ctx, (int32_t *)&v2, op2)))
+ goto exception;
+ switch(op) {
+ case OP_shl:
+ r = v1 << (v2 & 0x1f);
+ break;
+ case OP_sar:
+ r = (int)v1 >> (v2 & 0x1f);
+ break;
+ case OP_and:
+ r = v1 & v2;
+ break;
+ case OP_or:
+ r = v1 | v2;
+ break;
+ case OP_xor:
+ r = v1 ^ v2;
+ break;
+ default:
+ abort();
+ }
+ sp[-2] = JS_NewInt32(ctx, r);
+ return 0;
+ }
+ }
+
+ a = JS_ToBigIntFree(ctx, &a_s, op1);
+ b = JS_ToBigIntFree(ctx, &b_s, op2);
+
+ r = &r_s;
+ bf_init(ctx->bf_ctx, r);
+ ret = 0;
+ switch(op) {
+ case OP_shl:
+ case OP_sar:
+ {
+ slimb_t v2;
+#if LIMB_BITS == 32
+ bf_get_int32(&v2, b, 0);
+ if (v2 == INT32_MIN)
+ v2 = INT32_MIN + 1;
+#else
+ bf_get_int64(&v2, b, 0);
+ if (v2 == INT64_MIN)
+ v2 = INT64_MIN + 1;
+#endif
+ if (op == OP_sar)
+ v2 = -v2;
+ bf_set(r, a);
+ ret = bf_mul_2exp(r, v2, BF_PREC_INF, BF_RNDZ);
+ if (v2 < 0) {
+ ret |= bf_rint(r, BF_PREC_INF, BF_RNDD);
+ }
+ ret &= BF_ST_OVERFLOW;
+ }
+ break;
+ case OP_and:
+ bf_logic_and(r, a, b);
+ break;
+ case OP_or:
+ bf_logic_or(r, a, b);
+ break;
+ case OP_xor:
+ bf_logic_xor(r, a, b);
+ break;
+ default:
+ abort();
+ }
+ JS_FreeBigInt(ctx, a, &a_s);
+ JS_FreeBigInt(ctx, b, &b_s);
+ if (unlikely(ret)) {
+ bf_delete(r);
+ throw_bf_exception(ctx, ret);
+ goto exception;
+ }
+ sp[-2] = JS_NewBigInt2(ctx, r, is_legacy);
+ return 0;
+ exception:
+ sp[-2] = JS_UNDEFINED;
+ sp[-1] = JS_UNDEFINED;
+ return -1;
+}
+
+static no_inline int js_relational_slow(JSContext *ctx, JSValue *sp,
+ OPCodeEnum op)
+{
+ JSValue op1, op2, ret;
+ int res;
+ uint32_t tag1, tag2;
+
+ op1 = sp[-2];
+ op2 = sp[-1];
+ tag1 = JS_VALUE_GET_NORM_TAG(op1);
+ tag2 = JS_VALUE_GET_NORM_TAG(op2);
+ /* try to call an overloaded operator */
+ if ((tag1 == JS_TAG_OBJECT &&
+ (tag2 != JS_TAG_NULL && tag2 != JS_TAG_UNDEFINED)) ||
+ (tag2 == JS_TAG_OBJECT &&
+ (tag1 != JS_TAG_NULL && tag1 != JS_TAG_UNDEFINED))) {
+ res = js_call_binary_op_fallback(ctx, &ret, op1, op2, op);
+ if (res != 0) {
+ JS_FreeValue(ctx, op1);
+ JS_FreeValue(ctx, op2);
+ if (res < 0) {
+ goto exception;
+ } else {
+ sp[-2] = ret;
+ return 0;
+ }
+ }
+ }
+ op1 = JS_ToPrimitiveFree(ctx, op1, HINT_NUMBER);
+ if (JS_IsException(op1)) {
+ JS_FreeValue(ctx, op2);
+ goto exception;
+ }
+ op2 = JS_ToPrimitiveFree(ctx, op2, HINT_NUMBER);
+ if (JS_IsException(op2)) {
+ JS_FreeValue(ctx, op1);
+ goto exception;
+ }
+ tag1 = JS_VALUE_GET_NORM_TAG(op1);
+ tag2 = JS_VALUE_GET_NORM_TAG(op2);
+
+ if (tag1 == JS_TAG_STRING && tag2 == JS_TAG_STRING) {
+ JSString *p1, *p2;
+ p1 = JS_VALUE_GET_STRING(op1);
+ p2 = JS_VALUE_GET_STRING(op2);
+ res = js_string_compare(ctx, p1, p2);
+ switch(op) {
+ case OP_lt:
+ res = (res < 0);
+ break;
+ case OP_lte:
+ res = (res <= 0);
+ break;
+ case OP_gt:
+ res = (res > 0);
+ break;
+ default:
+ case OP_gte:
+ res = (res >= 0);
+ break;
+ }
+ JS_FreeValue(ctx, op1);
+ JS_FreeValue(ctx, op2);
+ } else if ((tag1 <= JS_TAG_NULL || tag1 == JS_TAG_FLOAT64) &&
+ (tag2 <= JS_TAG_NULL || tag2 == JS_TAG_FLOAT64)) {
+ /* can use floating point comparison */
+ double d1, d2;
+ if (tag1 == JS_TAG_FLOAT64) {
+ d1 = JS_VALUE_GET_FLOAT64(op1);
+ } else {
+ d1 = JS_VALUE_GET_INT(op1);
+ }
+ if (tag2 == JS_TAG_FLOAT64) {
+ d2 = JS_VALUE_GET_FLOAT64(op2);
+ } else {
+ d2 = JS_VALUE_GET_INT(op2);
+ }
+ switch(op) {
+ case OP_lt:
+ res = (d1 < d2); /* if NaN return false */
+ break;
+ case OP_lte:
+ res = (d1 <= d2); /* if NaN return false */
+ break;
+ case OP_gt:
+ res = (d1 > d2); /* if NaN return false */
+ break;
+ default:
+ case OP_gte:
+ res = (d1 >= d2); /* if NaN return false */
+ break;
+ }
+ } else {
+ bf_t a_s, b_s, *a, *b;
+ BOOL is_float;
+
+ if (((tag1 == JS_TAG_BIG_INT && tag2 == JS_TAG_STRING) ||
+ (tag2 == JS_TAG_BIG_INT && tag1 == JS_TAG_STRING)) &&
+ !is_bignum_mode(ctx)) {
+ if (tag1 == JS_TAG_STRING) {
+ op1 = JS_StringToBigInt(ctx, op1);
+ if (JS_VALUE_GET_TAG(op1) != JS_TAG_BIG_INT)
+ goto invalid_bigint_string;
+ }
+ if (tag2 == JS_TAG_STRING) {
+ op2 = JS_StringToBigInt(ctx, op2);
+ if (JS_VALUE_GET_TAG(op2) != JS_TAG_BIG_INT) {
+ invalid_bigint_string:
+ JS_FreeValue(ctx, op1);
+ JS_FreeValue(ctx, op2);
+ res = FALSE;
+ goto done;
+ }
+ }
+ } else {
+ op1 = JS_ToNumericFree(ctx, op1);
+ if (JS_IsException(op1)) {
+ JS_FreeValue(ctx, op2);
+ goto exception;
+ }
+ op2 = JS_ToNumericFree(ctx, op2);
+ if (JS_IsException(op2)) {
+ JS_FreeValue(ctx, op1);
+ goto exception;
+ }
+ }
+
+ a = JS_ToBigFloat(ctx, &is_float, &a_s, op1);
+ b = JS_ToBigFloat(ctx, &is_float, &b_s, op2);
+
+ switch(op) {
+ case OP_lt:
+ res = bf_cmp_lt(a, b); /* if NaN return false */
+ break;
+ case OP_lte:
+ res = bf_cmp_le(a, b); /* if NaN return false */
+ break;
+ case OP_gt:
+ res = bf_cmp_lt(b, a); /* if NaN return false */
+ break;
+ default:
+ case OP_gte:
+ res = bf_cmp_le(b, a); /* if NaN return false */
+ break;
+ }
+ if (a == &a_s)
+ bf_delete(a);
+ if (b == &b_s)
+ bf_delete(b);
+ JS_FreeValue(ctx, op1);
+ JS_FreeValue(ctx, op2);
+ }
+ done:
+ sp[-2] = JS_NewBool(ctx, res);
+ return 0;
+ exception:
+ sp[-2] = JS_UNDEFINED;
+ sp[-1] = JS_UNDEFINED;
+ return -1;
+}
+
+static BOOL tag_is_number(uint32_t tag)
+{
+ return (tag == JS_TAG_INT || tag == JS_TAG_BIG_INT ||
+ tag == JS_TAG_FLOAT64 || tag == JS_TAG_BIG_FLOAT);
+}
+
+static no_inline __exception int js_eq_slow(JSContext *ctx, JSValue *sp,
+ BOOL is_neq)
+{
+ JSValue op1, op2, ret;
+ int res;
+ uint32_t tag1, tag2;
+
+ op1 = sp[-2];
+ op2 = sp[-1];
+ redo:
+ tag1 = JS_VALUE_GET_NORM_TAG(op1);
+ tag2 = JS_VALUE_GET_NORM_TAG(op2);
+ if (tag_is_number(tag1) && tag_is_number(tag2)) {
+ if (tag1 == JS_TAG_INT && tag2 == JS_TAG_INT) {
+ res = JS_VALUE_GET_INT(op1) == JS_VALUE_GET_INT(op2);
+ } else if ((tag1 == JS_TAG_FLOAT64 &&
+ (tag2 == JS_TAG_INT || tag2 == JS_TAG_FLOAT64)) ||
+ (tag2 == JS_TAG_FLOAT64 &&
+ (tag1 == JS_TAG_INT || tag1 == JS_TAG_FLOAT64))) {
+ double d1, d2;
+ if (tag1 == JS_TAG_FLOAT64) {
+ d1 = JS_VALUE_GET_FLOAT64(op1);
+ } else {
+ d1 = JS_VALUE_GET_INT(op1);
+ }
+ if (tag2 == JS_TAG_FLOAT64) {
+ d2 = JS_VALUE_GET_FLOAT64(op2);
+ } else {
+ d2 = JS_VALUE_GET_INT(op2);
+ }
+ res = (d1 == d2);
+ } else {
+ bf_t a_s, b_s, *a, *b;
+ BOOL is_float;
+ a = JS_ToBigFloat(ctx, &is_float, &a_s, op1);
+ b = JS_ToBigFloat(ctx, &is_float, &b_s, op2);
+ res = bf_cmp_eq(a, b);
+ if (a == &a_s)
+ bf_delete(a);
+ if (b == &b_s)
+ bf_delete(b);
+ JS_FreeValue(ctx, op1);
+ JS_FreeValue(ctx, op2);
+ }
+ } else if (tag1 == tag2) {
+ if (tag1 == JS_TAG_OBJECT) {
+ /* try the fallback operator */
+ res = js_call_binary_op_fallback(ctx, &ret, op1, op2,
+ is_neq ? OP_neq : OP_eq);
+ if (res != 0) {
+ JS_FreeValue(ctx, op1);
+ JS_FreeValue(ctx, op2);
+ if (res < 0) {
+ goto exception;
+ } else {
+ sp[-2] = ret;
+ return 0;
+ }
+ }
+ }
+ res = js_strict_eq2(ctx, op1, op2, JS_EQ_STRICT);
+ } else if ((tag1 == JS_TAG_NULL && tag2 == JS_TAG_UNDEFINED) ||
+ (tag2 == JS_TAG_NULL && tag1 == JS_TAG_UNDEFINED)) {
+ res = TRUE;
+ } else if ((tag1 == JS_TAG_STRING && tag_is_number(tag2)) ||
+ (tag2 == JS_TAG_STRING && tag_is_number(tag1))) {
+
+ if ((tag1 == JS_TAG_BIG_INT || tag2 == JS_TAG_BIG_INT) &&
+ !is_bignum_mode(ctx)) {
+ if (tag1 == JS_TAG_STRING) {
+ op1 = JS_StringToBigInt(ctx, op1);
+ if (JS_VALUE_GET_TAG(op1) != JS_TAG_BIG_INT)
+ goto invalid_bigint_string;
+ }
+ if (tag2 == JS_TAG_STRING) {
+ op2 = JS_StringToBigInt(ctx, op2);
+ if (JS_VALUE_GET_TAG(op2) != JS_TAG_BIG_INT) {
+ invalid_bigint_string:
+ JS_FreeValue(ctx, op1);
+ JS_FreeValue(ctx, op2);
+ res = FALSE;
+ goto done;
+ }
+ }
+ } else {
+ op1 = JS_ToNumericFree(ctx, op1);
+ if (JS_IsException(op1)) {
+ JS_FreeValue(ctx, op2);
+ goto exception;
+ }
+ op2 = JS_ToNumericFree(ctx, op2);
+ if (JS_IsException(op2)) {
+ JS_FreeValue(ctx, op1);
+ goto exception;
+ }
+ }
+ res = js_strict_eq(ctx, op1, op2);
+ } else if (tag1 == JS_TAG_BOOL) {
+ op1 = JS_NewInt32(ctx, JS_VALUE_GET_INT(op1));
+ goto redo;
+ } else if (tag2 == JS_TAG_BOOL) {
+ op2 = JS_NewInt32(ctx, JS_VALUE_GET_INT(op2));
+ goto redo;
+ } else if ((tag1 == JS_TAG_OBJECT &&
+ (tag_is_number(tag2) || tag2 == JS_TAG_STRING || tag2 == JS_TAG_SYMBOL)) ||
+ (tag2 == JS_TAG_OBJECT &&
+ (tag_is_number(tag1) || tag1 == JS_TAG_STRING || tag1 == JS_TAG_SYMBOL))) {
+
+ /* try the fallback operator */
+ res = js_call_binary_op_fallback(ctx, &ret, op1, op2,
+ is_neq ? OP_neq : OP_eq);
+ if (res != 0) {
+ JS_FreeValue(ctx, op1);
+ JS_FreeValue(ctx, op2);
+ if (res < 0) {
+ goto exception;
+ } else {
+ sp[-2] = ret;
+ return 0;
+ }
+ }
+
+ op1 = JS_ToPrimitiveFree(ctx, op1, HINT_NONE);
+ if (JS_IsException(op1)) {
+ JS_FreeValue(ctx, op2);
+ goto exception;
+ }
+ op2 = JS_ToPrimitiveFree(ctx, op2, HINT_NONE);
+ if (JS_IsException(op2)) {
+ JS_FreeValue(ctx, op1);
+ goto exception;
+ }
+ goto redo;
+ } else {
+ JS_FreeValue(ctx, op1);
+ JS_FreeValue(ctx, op2);
+ res = FALSE;
+ }
+ done:
+ sp[-2] = JS_NewBool(ctx, res ^ is_neq);
+ return 0;
+ exception:
+ sp[-2] = JS_UNDEFINED;
+ sp[-1] = JS_UNDEFINED;
+ return -1;
+}
+
+static no_inline int js_shr_slow(JSContext *ctx, JSValue *sp)
+{
+ JSValue op1, op2;
+ uint32_t v1, v2, r;
+
+ op1 = sp[-2];
+ op2 = sp[-1];
+ op1 = JS_ToNumericFree(ctx, op1);
+ if (JS_IsException(op1)) {
+ JS_FreeValue(ctx, op2);
+ goto exception;
+ }
+ op2 = JS_ToNumericFree(ctx, op2);
+ if (JS_IsException(op2)) {
+ JS_FreeValue(ctx, op1);
+ goto exception;
+ }
+ /* XXX: could forbid >>> in bignum mode */
+ if (!is_bignum_mode(ctx) &&
+ (JS_VALUE_GET_TAG(op1) == JS_TAG_BIG_INT ||
+ JS_VALUE_GET_TAG(op2) == JS_TAG_BIG_INT)) {
+ JS_ThrowTypeError(ctx, "bigint operands are forbidden for >>>");
+ JS_FreeValue(ctx, op1);
+ JS_FreeValue(ctx, op2);
+ goto exception;
+ }
+ /* cannot give an exception */
+ JS_ToUint32Free(ctx, &v1, op1);
+ JS_ToUint32Free(ctx, &v2, op2);
+ r = v1 >> (v2 & 0x1f);
+ sp[-2] = JS_NewUint32(ctx, r);
+ return 0;
+ exception:
+ sp[-2] = JS_UNDEFINED;
+ sp[-1] = JS_UNDEFINED;
+ return -1;
+}
+
+static double bf_mul_pow10_to_float64(JSContext *ctx, const bf_t *a,
+ int64_t exponent)
+{
+ bf_t r_s, *r = &r_s;
+ double d;
+ /* always convert to Float64 */
+ bf_init(ctx->bf_ctx, r);
+ bf_mul_pow_radix(r, a, 10, exponent,
+ 53, bf_set_exp_bits(11) | BF_RNDN | BF_FLAG_SUBNORMAL);
+ bf_get_float64(r, &d, BF_RNDN);
+ bf_delete(r);
+ return d;
+}
+
+static no_inline int js_mul_pow10(JSContext *ctx, JSValue *sp)
+{
+ bf_t a_s, *a, r_s, *r = &r_s;
+ BOOL is_float;
+ JSValue op1, op2;
+ slimb_t e;
+ int ret;
+
+ op1 = sp[-2];
+ op2 = sp[-1];
+ a = JS_ToBigFloat(ctx, &is_float, &a_s, op1);
+ if (!a)
+ return -1;
+#if LIMB_BITS == 32
+ ret = JS_ToInt32(ctx, &e, op2);
+#else
+ ret = JS_ToInt64(ctx, &e, op2);
+#endif
+ if (ret) {
+ if (a == &a_s)
+ bf_delete(a);
+ return -1;
+ }
+
+ bf_init(ctx->bf_ctx, r);
+ bf_mul_pow_radix(r, a, 10, e, ctx->fp_env.prec, ctx->fp_env.flags);
+ if (a == &a_s)
+ bf_delete(a);
+ JS_FreeValue(ctx, op1);
+ JS_FreeValue(ctx, op2);
+ sp[-2] = JS_NewBigFloat(ctx, r);
+ return 0;
+}
+
+#else /* !CONFIG_BIGNUM */
+
+static no_inline __exception int js_unary_arith_slow(JSContext *ctx,
+ JSValue *sp,
+ OPCodeEnum op)
+{
+ JSValue op1;
+ double d;
+
+ op1 = sp[-1];
+ if (unlikely(JS_ToFloat64Free(ctx, &d, op1))) {
+ sp[-1] = JS_UNDEFINED;
+ return -1;
+ }
+ switch(op) {
+ case OP_inc:
+ d++;
+ break;
+ case OP_dec:
+ d--;
+ break;
+ case OP_plus:
+ break;
+ case OP_neg:
+ d = -d;
+ break;
+ default:
+ abort();
+ }
+ sp[-1] = JS_NewFloat64(ctx, d);
+ return 0;
+}
+
+/* specific case necessary for correct return value semantics */
+static __exception int js_post_inc_slow(JSContext *ctx,
+ JSValue *sp, OPCodeEnum op)
+{
+ JSValue op1;
+ double d, r;
+
+ op1 = sp[-1];
+ if (unlikely(JS_ToFloat64Free(ctx, &d, op1))) {
+ sp[-1] = JS_UNDEFINED;
+ return -1;
+ }
+ r = d + 2 * (op - OP_post_dec) - 1;
+ sp[0] = JS_NewFloat64(ctx, r);
+ sp[-1] = JS_NewFloat64(ctx, d);
+ return 0;
+}
+
+static no_inline __exception int js_binary_arith_slow(JSContext *ctx, JSValue *sp,
+ OPCodeEnum op)
+{
+ JSValue op1, op2;
+ double d1, d2, r;
+
+ op1 = sp[-2];
+ op2 = sp[-1];
+ if (unlikely(JS_ToFloat64Free(ctx, &d1, op1))) {
+ JS_FreeValue(ctx, op2);
+ goto exception;
+ }
+ if (unlikely(JS_ToFloat64Free(ctx, &d2, op2))) {
+ goto exception;
+ }
+ switch(op) {
+ case OP_sub:
+ r = d1 - d2;
+ break;
+ case OP_mul:
+ r = d1 * d2;
+ break;
+ case OP_div:
+ r = d1 / d2;
+ break;
+ case OP_mod:
+ r = fmod(d1, d2);
+ break;
+ case OP_pow:
+ r = js_pow(d1, d2);
+ break;
+ default:
+ abort();
+ }
+ sp[-2] = JS_NewFloat64(ctx, r);
+ return 0;
+ exception:
+ sp[-2] = JS_UNDEFINED;
+ sp[-1] = JS_UNDEFINED;
+ return -1;
+}
+
+static no_inline __exception int js_add_slow(JSContext *ctx, JSValue *sp)
+{
+ JSValue op1, op2;
+ uint32_t tag1, tag2;
+
+ op1 = sp[-2];
+ op2 = sp[-1];
+ tag1 = JS_VALUE_GET_TAG(op1);
+ tag2 = JS_VALUE_GET_TAG(op2);
+ if ((tag1 == JS_TAG_INT || JS_TAG_IS_FLOAT64(tag1)) &&
+ (tag2 == JS_TAG_INT || JS_TAG_IS_FLOAT64(tag2))) {
+ goto add_numbers;
+ } else {
+ op1 = JS_ToPrimitiveFree(ctx, op1, HINT_NONE);
+ if (JS_IsException(op1)) {
+ JS_FreeValue(ctx, op2);
+ goto exception;
+ }
+ op2 = JS_ToPrimitiveFree(ctx, op2, HINT_NONE);
+ if (JS_IsException(op2)) {
+ JS_FreeValue(ctx, op1);
+ goto exception;
+ }
+ tag1 = JS_VALUE_GET_TAG(op1);
+ tag2 = JS_VALUE_GET_TAG(op2);
+ if (tag1 == JS_TAG_STRING || tag2 == JS_TAG_STRING) {
+ sp[-2] = JS_ConcatString(ctx, op1, op2);
+ if (JS_IsException(sp[-2]))
+ goto exception;
+ } else {
+ double d1, d2;
+ add_numbers:
+ if (JS_ToFloat64Free(ctx, &d1, op1)) {
+ JS_FreeValue(ctx, op2);
+ goto exception;
+ }
+ if (JS_ToFloat64Free(ctx, &d2, op2))
+ goto exception;
+ sp[-2] = JS_NewFloat64(ctx, d1 + d2);
+ }
+ }
+ return 0;
+ exception:
+ sp[-2] = JS_UNDEFINED;
+ sp[-1] = JS_UNDEFINED;
+ return -1;
+}
+
+static no_inline __exception int js_binary_logic_slow(JSContext *ctx,
+ JSValue *sp,
+ OPCodeEnum op)
+{
+ JSValue op1, op2;
+ uint32_t v1, v2, r;
+
+ op1 = sp[-2];
+ op2 = sp[-1];
+ if (unlikely(JS_ToInt32Free(ctx, (int32_t *)&v1, op1))) {
+ JS_FreeValue(ctx, op2);
+ goto exception;
+ }
+ if (unlikely(JS_ToInt32Free(ctx, (int32_t *)&v2, op2)))
+ goto exception;
+ switch(op) {
+ case OP_shl:
+ r = v1 << (v2 & 0x1f);
+ break;
+ case OP_sar:
+ r = (int)v1 >> (v2 & 0x1f);
+ break;
+ case OP_and:
+ r = v1 & v2;
+ break;
+ case OP_or:
+ r = v1 | v2;
+ break;
+ case OP_xor:
+ r = v1 ^ v2;
+ break;
+ default:
+ abort();
+ }
+ sp[-2] = JS_NewInt32(ctx, r);
+ return 0;
+ exception:
+ sp[-2] = JS_UNDEFINED;
+ sp[-1] = JS_UNDEFINED;
+ return -1;
+}
+
+static no_inline int js_not_slow(JSContext *ctx, JSValue *sp)
+{
+ int32_t v1;
+
+ if (unlikely(JS_ToInt32Free(ctx, &v1, sp[-1]))) {
+ sp[-1] = JS_UNDEFINED;
+ return -1;
+ }
+ sp[-1] = JS_NewInt32(ctx, ~v1);
+ return 0;
+}
+
+static no_inline int js_relational_slow(JSContext *ctx, JSValue *sp,
+ OPCodeEnum op)
+{
+ JSValue op1, op2;
+ int res;
+
+ op1 = sp[-2];
+ op2 = sp[-1];
+ op1 = JS_ToPrimitiveFree(ctx, op1, HINT_NUMBER);
+ if (JS_IsException(op1)) {
+ JS_FreeValue(ctx, op2);
+ goto exception;
+ }
+ op2 = JS_ToPrimitiveFree(ctx, op2, HINT_NUMBER);
+ if (JS_IsException(op2)) {
+ JS_FreeValue(ctx, op1);
+ goto exception;
+ }
+ if (JS_VALUE_GET_TAG(op1) == JS_TAG_STRING &&
+ JS_VALUE_GET_TAG(op2) == JS_TAG_STRING) {
+ JSString *p1, *p2;
+ p1 = JS_VALUE_GET_STRING(op1);
+ p2 = JS_VALUE_GET_STRING(op2);
+ res = js_string_compare(ctx, p1, p2);
+ JS_FreeValue(ctx, op1);
+ JS_FreeValue(ctx, op2);
+ switch(op) {
+ case OP_lt:
+ res = (res < 0);
+ break;
+ case OP_lte:
+ res = (res <= 0);
+ break;
+ case OP_gt:
+ res = (res > 0);
+ break;
+ default:
+ case OP_gte:
+ res = (res >= 0);
+ break;
+ }
+ } else {
+ double d1, d2;
+ if (JS_ToFloat64Free(ctx, &d1, op1)) {
+ JS_FreeValue(ctx, op2);
+ goto exception;
+ }
+ if (JS_ToFloat64Free(ctx, &d2, op2))
+ goto exception;
+ switch(op) {
+ case OP_lt:
+ res = (d1 < d2); /* if NaN return false */
+ break;
+ case OP_lte:
+ res = (d1 <= d2); /* if NaN return false */
+ break;
+ case OP_gt:
+ res = (d1 > d2); /* if NaN return false */
+ break;
+ default:
+ case OP_gte:
+ res = (d1 >= d2); /* if NaN return false */
+ break;
+ }
+ }
+ sp[-2] = JS_NewBool(ctx, res);
+ return 0;
+ exception:
+ sp[-2] = JS_UNDEFINED;
+ sp[-1] = JS_UNDEFINED;
+ return -1;
+}
+
+static no_inline __exception int js_eq_slow(JSContext *ctx, JSValue *sp,
+ BOOL is_neq)
+{
+ JSValue op1, op2;
+ int tag1, tag2;
+ BOOL res;
+
+ op1 = sp[-2];
+ op2 = sp[-1];
+ redo:
+ tag1 = JS_VALUE_GET_NORM_TAG(op1);
+ tag2 = JS_VALUE_GET_NORM_TAG(op2);
+ if (tag1 == tag2 ||
+ (tag1 == JS_TAG_INT && tag2 == JS_TAG_FLOAT64) ||
+ (tag2 == JS_TAG_INT && tag1 == JS_TAG_FLOAT64)) {
+ res = js_strict_eq(ctx, op1, op2);
+ } else if ((tag1 == JS_TAG_NULL && tag2 == JS_TAG_UNDEFINED) ||
+ (tag2 == JS_TAG_NULL && tag1 == JS_TAG_UNDEFINED)) {
+ res = TRUE;
+ } else if ((tag1 == JS_TAG_STRING && (tag2 == JS_TAG_INT ||
+ tag2 == JS_TAG_FLOAT64)) ||
+ (tag2 == JS_TAG_STRING && (tag1 == JS_TAG_INT ||
+ tag1 == JS_TAG_FLOAT64))) {
+ double d1;
+ double d2;
+ if (JS_ToFloat64Free(ctx, &d1, op1)) {
+ JS_FreeValue(ctx, op2);
+ goto exception;
+ }
+ if (JS_ToFloat64Free(ctx, &d2, op2))
+ goto exception;
+ res = (d1 == d2);
+ } else if (tag1 == JS_TAG_BOOL) {
+ op1 = JS_NewInt32(ctx, JS_VALUE_GET_INT(op1));
+ goto redo;
+ } else if (tag2 == JS_TAG_BOOL) {
+ op2 = JS_NewInt32(ctx, JS_VALUE_GET_INT(op2));
+ goto redo;
+ } else if (tag1 == JS_TAG_OBJECT &&
+ (tag2 == JS_TAG_INT || tag2 == JS_TAG_FLOAT64 || tag2 == JS_TAG_STRING || tag2 == JS_TAG_SYMBOL)) {
+ op1 = JS_ToPrimitiveFree(ctx, op1, HINT_NONE);
+ if (JS_IsException(op1)) {
+ JS_FreeValue(ctx, op2);
+ goto exception;
+ }
+ goto redo;
+ } else if (tag2 == JS_TAG_OBJECT &&
+ (tag1 == JS_TAG_INT || tag1 == JS_TAG_FLOAT64 || tag1 == JS_TAG_STRING || tag1 == JS_TAG_SYMBOL)) {
+ op2 = JS_ToPrimitiveFree(ctx, op2, HINT_NONE);
+ if (JS_IsException(op2)) {
+ JS_FreeValue(ctx, op1);
+ goto exception;
+ }
+ goto redo;
+ } else {
+ JS_FreeValue(ctx, op1);
+ JS_FreeValue(ctx, op2);
+ res = FALSE;
+ }
+ sp[-2] = JS_NewBool(ctx, res ^ is_neq);
+ return 0;
+ exception:
+ sp[-2] = JS_UNDEFINED;
+ sp[-1] = JS_UNDEFINED;
+ return -1;
+}
+
+static no_inline int js_shr_slow(JSContext *ctx, JSValue *sp)
+{
+ JSValue op1, op2;
+ uint32_t v1, v2, r;
+
+ op1 = sp[-2];
+ op2 = sp[-1];
+ if (unlikely(JS_ToUint32Free(ctx, &v1, op1))) {
+ JS_FreeValue(ctx, op2);
+ goto exception;
+ }
+ if (unlikely(JS_ToUint32Free(ctx, &v2, op2)))
+ goto exception;
+ r = v1 >> (v2 & 0x1f);
+ sp[-2] = JS_NewUint32(ctx, r);
+ return 0;
+ exception:
+ sp[-2] = JS_UNDEFINED;
+ sp[-1] = JS_UNDEFINED;
+ return -1;
+}
+
+#endif /* !CONFIG_BIGNUM */
+
+/* XXX: Should take JSValueConst arguments */
+static BOOL js_strict_eq2(JSContext *ctx, JSValue op1, JSValue op2,
+ JSStrictEqModeEnum eq_mode)
+{
+ BOOL res;
+ int tag1, tag2;
+ double d1, d2;
+
+ tag1 = JS_VALUE_GET_NORM_TAG(op1);
+ tag2 = JS_VALUE_GET_NORM_TAG(op2);
+ switch(tag1) {
+ case JS_TAG_BOOL:
+ if (tag1 != tag2) {
+ res = FALSE;
+ } else {
+ res = JS_VALUE_GET_INT(op1) == JS_VALUE_GET_INT(op2);
+ goto done_no_free;
+ }
+ break;
+ case JS_TAG_NULL:
+ case JS_TAG_UNDEFINED:
+ res = (tag1 == tag2);
+ break;
+ case JS_TAG_STRING:
+ {
+ JSString *p1, *p2;
+ if (tag1 != tag2) {
+ res = FALSE;
+ } else {
+ p1 = JS_VALUE_GET_STRING(op1);
+ p2 = JS_VALUE_GET_STRING(op2);
+ res = (js_string_compare(ctx, p1, p2) == 0);
+ }
+ }
+ break;
+ case JS_TAG_SYMBOL:
+ {
+ JSAtomStruct *p1, *p2;
+ if (tag1 != tag2) {
+ res = FALSE;
+ } else {
+ p1 = JS_VALUE_GET_PTR(op1);
+ p2 = JS_VALUE_GET_PTR(op2);
+ res = (p1 == p2);
+ }
+ }
+ break;
+ case JS_TAG_OBJECT:
+ if (tag1 != tag2)
+ res = FALSE;
+ else
+ res = JS_VALUE_GET_OBJ(op1) == JS_VALUE_GET_OBJ(op2);
+ break;
+ case JS_TAG_INT:
+ d1 = JS_VALUE_GET_INT(op1);
+ if (tag2 == JS_TAG_INT) {
+ d2 = JS_VALUE_GET_INT(op2);
+ goto number_test;
+ } else if (tag2 == JS_TAG_FLOAT64) {
+#ifdef CONFIG_BIGNUM
+ if (is_bignum_mode(ctx)) {
+ res = FALSE;
+ } else
+#endif
+ {
+ d2 = JS_VALUE_GET_FLOAT64(op2);
+ goto number_test;
+ }
+ } else
+#ifdef CONFIG_BIGNUM
+ if (tag2 == JS_TAG_BIG_INT && is_bignum_mode(ctx)) {
+ goto bigint_test;
+ } else
+#endif
+ {
+ res = FALSE;
+ }
+ break;
+ case JS_TAG_FLOAT64:
+ d1 = JS_VALUE_GET_FLOAT64(op1);
+ if (tag2 == JS_TAG_FLOAT64) {
+ d2 = JS_VALUE_GET_FLOAT64(op2);
+ } else if (tag2 == JS_TAG_INT
+#ifdef CONFIG_BIGNUM
+ && !is_bignum_mode(ctx)
+#endif
+ ) {
+ d2 = JS_VALUE_GET_INT(op2);
+ } else {
+ res = FALSE;
+ break;
+ }
+ number_test:
+ if (unlikely(eq_mode >= JS_EQ_SAME_VALUE)) {
+ JSFloat64Union u1, u2;
+ /* NaN is not always normalized, so this test is necessary */
+ if (isnan(d1) || isnan(d2)) {
+ res = isnan(d1) == isnan(d2);
+ } else if (eq_mode == JS_EQ_SAME_VALUE_ZERO) {
+ res = (d1 == d2); /* +0 == -0 */
+ } else {
+ u1.d = d1;
+ u2.d = d2;
+ res = (u1.u64 == u2.u64); /* +0 != -0 */
+ }
+ } else {
+ res = (d1 == d2); /* if NaN return false and +0 == -0 */
+ }
+ goto done_no_free;
+#ifdef CONFIG_BIGNUM
+ case JS_TAG_BIG_INT:
+ {
+ bf_t a_s, *a, b_s, *b;
+ BOOL is_float;
+ if (tag1 == tag2) {
+ /* OK */
+ } else if (tag2 == JS_TAG_INT && is_bignum_mode(ctx)) {
+ /* OK */
+ } else {
+ res = FALSE;
+ break;
+ }
+ bigint_test:
+ a = JS_ToBigFloat(ctx, &is_float, &a_s, op1);
+ b = JS_ToBigFloat(ctx, &is_float, &b_s, op2);
+ res = bf_cmp_eq(a, b);
+ if (a == &a_s)
+ bf_delete(a);
+ if (b == &b_s)
+ bf_delete(a);
+ }
+ break;
+ case JS_TAG_BIG_FLOAT:
+ {
+ JSBigFloat *p1, *p2;
+ const bf_t *a, *b;
+ if (tag1 != tag2) {
+ res = FALSE;
+ break;
+ }
+ p1 = JS_VALUE_GET_PTR(op1);
+ p2 = JS_VALUE_GET_PTR(op2);
+ a = &p1->num;
+ b = &p2->num;
+ if (unlikely(eq_mode >= JS_EQ_SAME_VALUE)) {
+ if (eq_mode == JS_EQ_SAME_VALUE_ZERO &&
+ a->expn == BF_EXP_ZERO && b->expn == BF_EXP_ZERO) {
+ res = TRUE;
+ } else {
+ res = (bf_cmp_full(a, b) == 0);
+ }
+ } else {
+ res = bf_cmp_eq(a, b);
+ }
+ }
+ break;
+#endif
+ default:
+ res = FALSE;
+ break;
+ }
+ JS_FreeValue(ctx, op1);
+ JS_FreeValue(ctx, op2);
+ done_no_free:
+ return res;
+}
+
+static BOOL js_strict_eq(JSContext *ctx, JSValue op1, JSValue op2)
+{
+ return js_strict_eq2(ctx, op1, op2, JS_EQ_STRICT);
+}
+
+static BOOL js_same_value(JSContext *ctx, JSValueConst op1, JSValueConst op2)
+{
+ return js_strict_eq2(ctx,
+ JS_DupValue(ctx, op1), JS_DupValue(ctx, op2),
+ JS_EQ_SAME_VALUE);
+}
+
+static BOOL js_same_value_zero(JSContext *ctx, JSValueConst op1, JSValueConst op2)
+{
+ return js_strict_eq2(ctx,
+ JS_DupValue(ctx, op1), JS_DupValue(ctx, op2),
+ JS_EQ_SAME_VALUE_ZERO);
+}
+
+static no_inline int js_strict_eq_slow(JSContext *ctx, JSValue *sp,
+ BOOL is_neq)
+{
+ BOOL res;
+ res = js_strict_eq(ctx, sp[-2], sp[-1]);
+ sp[-2] = JS_NewBool(ctx, res ^ is_neq);
+ return 0;
+}
+
+static __exception int js_operator_in(JSContext *ctx, JSValue *sp)
+{
+ JSValue op1, op2;
+ JSAtom atom;
+ int ret;
+
+ op1 = sp[-2];
+ op2 = sp[-1];
+
+ if (JS_VALUE_GET_TAG(op2) != JS_TAG_OBJECT) {
+ JS_ThrowTypeError(ctx, "invalid 'in' operand");
+ return -1;
+ }
+ atom = js_value_to_atom(ctx, op1);
+ if (unlikely(atom == JS_ATOM_NULL))
+ return -1;
+ ret = JS_HasProperty(ctx, op2, atom);
+ JS_FreeAtom(ctx, atom);
+ if (ret < 0)
+ return -1;
+ JS_FreeValue(ctx, op1);
+ JS_FreeValue(ctx, op2);
+ sp[-2] = JS_NewBool(ctx, ret);
+ return 0;
+}
+
+static __exception int js_has_unscopable(JSContext *ctx, JSValueConst obj,
+ JSAtom atom)
+{
+ JSValue arr, val;
+ int ret;
+
+ arr = JS_GetProperty(ctx, obj, JS_ATOM_Symbol_unscopables);
+ if (JS_IsException(arr))
+ return -1;
+ ret = 0;
+ if (JS_IsObject(arr)) {
+ val = JS_GetProperty(ctx, arr, atom);
+ ret = JS_ToBoolFree(ctx, val);
+ }
+ JS_FreeValue(ctx, arr);
+ return ret;
+}
+
+static __exception int js_operator_instanceof(JSContext *ctx, JSValue *sp)
+{
+ JSValue op1, op2;
+ BOOL ret;
+
+ op1 = sp[-2];
+ op2 = sp[-1];
+ ret = JS_IsInstanceOf(ctx, op1, op2);
+ if (ret < 0)
+ return ret;
+ JS_FreeValue(ctx, op1);
+ JS_FreeValue(ctx, op2);
+ sp[-2] = JS_NewBool(ctx, ret);
+ return 0;
+}
+
+static __exception int js_operator_typeof(JSContext *ctx, JSValue op1)
+{
+ JSAtom atom;
+ uint32_t tag;
+
+ tag = JS_VALUE_GET_NORM_TAG(op1);
+ switch(tag) {
+#ifdef CONFIG_BIGNUM
+ case JS_TAG_INT:
+ if (is_bignum_mode(ctx))
+ atom = JS_ATOM_bigint;
+ else
+ atom = JS_ATOM_number;
+ break;
+ case JS_TAG_BIG_INT:
+ atom = JS_ATOM_bigint;
+ break;
+ case JS_TAG_FLOAT64:
+ atom = JS_ATOM_number;
+ break;
+ case JS_TAG_BIG_FLOAT:
+ atom = JS_ATOM_bigfloat;
+ break;
+#else
+ case JS_TAG_INT:
+ case JS_TAG_FLOAT64:
+ atom = JS_ATOM_number;
+ break;
+#endif
+ case JS_TAG_UNDEFINED:
+ atom = JS_ATOM_undefined;
+ break;
+ case JS_TAG_BOOL:
+ atom = JS_ATOM_boolean;
+ break;
+ case JS_TAG_STRING:
+ atom = JS_ATOM_string;
+ break;
+ case JS_TAG_OBJECT:
+ if (JS_IsFunction(ctx, op1))
+ atom = JS_ATOM_function;
+ else
+ goto obj_type;
+ break;
+ case JS_TAG_NULL:
+ obj_type:
+ atom = JS_ATOM_object;
+ break;
+ case JS_TAG_SYMBOL:
+ atom = JS_ATOM_symbol;
+ break;
+ default:
+ atom = JS_ATOM_unknown;
+ break;
+ }
+ return atom;
+}
+
+static __exception int js_operator_delete(JSContext *ctx, JSValue *sp)
+{
+ JSValue op1, op2;
+ JSAtom atom;
+ int ret;
+
+ op1 = sp[-2];
+ op2 = sp[-1];
+ atom = js_value_to_atom(ctx, op2);
+ if (unlikely(atom == JS_ATOM_NULL))
+ return -1;
+ ret = JS_DeleteProperty(ctx, op1, atom, JS_PROP_THROW_STRICT);
+ JS_FreeAtom(ctx, atom);
+ if (unlikely(ret < 0))
+ return -1;
+ JS_FreeValue(ctx, op1);
+ JS_FreeValue(ctx, op2);
+ sp[-2] = JS_NewBool(ctx, ret);
+ return 0;
+}
+
+static JSValue js_throw_type_error(JSContext *ctx, JSValueConst this_val,
+ int argc, JSValueConst *argv)
+{
+ return JS_ThrowTypeError(ctx, "invalid property access");
+}
+
+/* XXX: not 100% compatible, but mozilla seems to use a similar
+ implementation to ensure that caller in non strict mode does not
+ throw (ES5 compatibility) */
+static JSValue js_function_proto_caller(JSContext *ctx, JSValueConst this_val,
+ int argc, JSValueConst *argv)
+{
+ JSFunctionBytecode *b = JS_GetFunctionBytecode(this_val);
+ if (!b || (b->js_mode & JS_MODE_STRICT) || !b->has_prototype) {
+ return js_throw_type_error(ctx, this_val, 0, NULL);
+ }
+ return JS_UNDEFINED;
+}
+
+static JSValue js_function_proto_fileName(JSContext *ctx,
+ JSValueConst this_val)
+{
+ JSFunctionBytecode *b = JS_GetFunctionBytecode(this_val);
+ if (b && b->has_debug) {
+ return JS_AtomToString(ctx, b->debug.filename);
+ }
+ return JS_UNDEFINED;
+}
+
+static JSValue js_function_proto_lineNumber(JSContext *ctx,
+ JSValueConst this_val)
+{
+ JSFunctionBytecode *b = JS_GetFunctionBytecode(this_val);
+ if (b && b->has_debug) {
+ return JS_NewInt32(ctx, b->debug.line_num);
+ }
+ return JS_UNDEFINED;
+}
+
+static int js_arguments_define_own_property(JSContext *ctx,
+ JSValueConst this_obj,
+ JSAtom prop, JSValueConst val,
+ JSValueConst getter, JSValueConst setter, int flags)
+{
+ JSObject *p;
+ uint32_t idx;
+ p = JS_VALUE_GET_OBJ(this_obj);
+ /* convert to normal array when redefining an existing numeric field */
+ if (p->fast_array && JS_AtomGetUint32(ctx, &idx, prop) &&
+ idx < p->u.array.count) {
+ if (convert_fast_array_to_array(ctx, p))
+ return -1;
+ }
+ /* run the default define own property */
+ return JS_DefineProperty(ctx, this_obj, prop, val, getter, setter,
+ flags | JS_PROP_NO_EXOTIC);
+}
+
+static const JSClassExoticMethods js_arguments_exotic_methods = {
+ .define_own_property = js_arguments_define_own_property,
+};
+
+static JSValue js_build_arguments(JSContext *ctx, int argc, JSValueConst *argv)
+{
+ JSValue val, *tab;
+ JSProperty *pr;
+ JSObject *p;
+ int i;
+
+ val = JS_NewObjectProtoClass(ctx, ctx->class_proto[JS_CLASS_OBJECT],
+ JS_CLASS_ARGUMENTS);
+ if (JS_IsException(val))
+ return val;
+ p = JS_VALUE_GET_OBJ(val);
+
+ /* add the length field (cannot fail) */
+ pr = add_property(ctx, p, JS_ATOM_length,
+ JS_PROP_WRITABLE | JS_PROP_CONFIGURABLE);
+ pr->u.value = JS_NewInt32(ctx, argc);
+
+ /* initialize the fast array part */
+ tab = NULL;
+ if (argc > 0) {
+ tab = js_malloc(ctx, sizeof(tab[0]) * argc);
+ if (!tab) {
+ JS_FreeValue(ctx, val);
+ return JS_EXCEPTION;
+ }
+ for(i = 0; i < argc; i++) {
+ tab[i] = JS_DupValue(ctx, argv[i]);
+ }
+ }
+ p->u.array.u.values = tab;
+ p->u.array.count = argc;
+
+ JS_DefinePropertyValue(ctx, val, JS_ATOM_Symbol_iterator,
+ JS_DupValue(ctx, ctx->array_proto_values),
+ JS_PROP_CONFIGURABLE | JS_PROP_WRITABLE);
+ /* add callee property to throw a TypeError in strict mode */
+ JS_DefineProperty(ctx, val, JS_ATOM_callee, JS_UNDEFINED,
+ ctx->throw_type_error, ctx->throw_type_error,
+ JS_PROP_HAS_GET | JS_PROP_HAS_SET);
+ return val;
+}
+
+#define GLOBAL_VAR_OFFSET 0x40000000
+#define ARGUMENT_VAR_OFFSET 0x20000000
+
+/* legacy arguments object: add references to the function arguments */
+static JSValue js_build_mapped_arguments(JSContext *ctx, int argc,
+ JSValueConst *argv,
+ JSStackFrame *sf, int arg_count)
+{
+ JSValue val;
+ JSProperty *pr;
+ JSObject *p;
+ int i;
+
+ val = JS_NewObjectProtoClass(ctx, ctx->class_proto[JS_CLASS_OBJECT],
+ JS_CLASS_MAPPED_ARGUMENTS);
+ if (JS_IsException(val))
+ return val;
+ p = JS_VALUE_GET_OBJ(val);
+
+ /* add the length field (cannot fail) */
+ pr = add_property(ctx, p, JS_ATOM_length,
+ JS_PROP_WRITABLE | JS_PROP_CONFIGURABLE);
+ pr->u.value = JS_NewInt32(ctx, argc);
+
+ for(i = 0; i < arg_count; i++) {
+ JSVarRef *var_ref;
+ var_ref = get_var_ref(ctx, sf, i, TRUE);
+ if (!var_ref)
+ goto fail;
+ pr = add_property(ctx, p, __JS_AtomFromUInt32(i), JS_PROP_C_W_E | JS_PROP_VARREF);
+ if (!pr) {
+ free_var_ref(ctx->rt, var_ref);
+ goto fail;
+ }
+ pr->u.var_ref = var_ref;
+ }
+
+ /* the arguments not mapped to the arguments of the function can
+ be normal properties */
+ for(i = arg_count; i < argc; i++) {
+ if (JS_DefinePropertyValueUint32(ctx, val, i,
+ JS_DupValue(ctx, argv[i]),
+ JS_PROP_C_W_E) < 0)
+ goto fail;
+ }
+
+ JS_DefinePropertyValue(ctx, val, JS_ATOM_Symbol_iterator,
+ JS_DupValue(ctx, ctx->array_proto_values),
+ JS_PROP_CONFIGURABLE | JS_PROP_WRITABLE);
+ /* callee returns this function in non strict mode */
+ JS_DefinePropertyValue(ctx, val, JS_ATOM_callee,
+ JS_DupValue(ctx, ctx->current_stack_frame->cur_func),
+ JS_PROP_CONFIGURABLE | JS_PROP_WRITABLE);
+ return val;
+ fail:
+ JS_FreeValue(ctx, val);
+ return JS_EXCEPTION;
+}
+
+static JSValue js_build_rest(JSContext *ctx, int first, int argc, JSValueConst *argv)
+{
+ JSValue val;
+ int i, ret;
+
+ val = JS_NewArray(ctx);
+ if (JS_IsException(val))
+ return val;
+ for (i = first; i < argc; i++) {
+ ret = JS_DefinePropertyValueUint32(ctx, val, i - first,
+ JS_DupValue(ctx, argv[i]),
+ JS_PROP_C_W_E);
+ if (ret < 0) {
+ JS_FreeValue(ctx, val);
+ return JS_EXCEPTION;
+ }
+ }
+ return val;
+}
+
+static JSValue build_for_in_iterator(JSContext *ctx, JSValue obj)
+{
+ JSObject *p, *p1;
+ JSPropertyEnum *tab_atom;
+ int i;
+ JSValue enum_obj;
+ JSForInIterator *it;
+ uint32_t tag, tab_atom_count;
+
+ tag = JS_VALUE_GET_TAG(obj);
+ if (tag != JS_TAG_OBJECT && tag != JS_TAG_NULL && tag != JS_TAG_UNDEFINED) {
+ obj = JS_ToObjectFree(ctx, obj);
+ }
+
+ it = js_malloc(ctx, sizeof(*it));
+ if (!it) {
+ JS_FreeValue(ctx, obj);
+ return JS_EXCEPTION;
+ }
+ enum_obj = JS_NewObjectProtoClass(ctx, JS_NULL, JS_CLASS_FOR_IN_ITERATOR);
+ if (JS_IsException(enum_obj)) {
+ js_free(ctx, it);
+ JS_FreeValue(ctx, obj);
+ return JS_EXCEPTION;
+ }
+ it->is_array = FALSE;
+ it->obj = obj;
+ it->idx = 0;
+ p = JS_VALUE_GET_OBJ(enum_obj);
+ p->u.for_in_iterator = it;
+
+ if (tag == JS_TAG_NULL || tag == JS_TAG_UNDEFINED)
+ return enum_obj;
+
+ p = JS_VALUE_GET_OBJ(obj);
+
+ /* fast path: assume no enumerable properties in the prototype chain */
+ p1 = p->shape->proto;
+ while (p1 != NULL) {
+ if (JS_GetOwnPropertyNames(ctx, &tab_atom, &tab_atom_count, p1,
+ JS_GPN_STRING_MASK | JS_GPN_ENUM_ONLY))
+ goto fail;
+ js_free_prop_enum(ctx, tab_atom, tab_atom_count);
+ if (tab_atom_count != 0) {
+ goto slow_path;
+ }
+ p1 = p1->shape->proto;
+ }
+ if (p->fast_array) {
+ JSShape *sh;
+ JSShapeProperty *prs;
+ /* check that there are no enumerable normal fields */
+ sh = p->shape;
+ for(i = 0, prs = get_shape_prop(sh); i < sh->prop_count; i++, prs++) {
+ if (prs->flags & JS_PROP_ENUMERABLE)
+ goto normal_case;
+ }
+ /* the implicit GetOwnProperty raises an exception if the
+ typed array is detached */
+ if ((p->class_id >= JS_CLASS_UINT8C_ARRAY &&
+ p->class_id <= JS_CLASS_FLOAT64_ARRAY) &&
+ typed_array_is_detached(ctx, p) &&
+ typed_array_get_length(ctx, p) != 0) {
+ JS_ThrowTypeErrorDetachedArrayBuffer(ctx);
+ goto fail;
+ }
+ /* for fast arrays, we only store the number of elements */
+ it->is_array = TRUE;
+ it->array_length = p->u.array.count;
+ } else {
+ normal_case:
+ if (JS_GetOwnPropertyNames(ctx, &tab_atom, &tab_atom_count, p,
+ JS_GPN_STRING_MASK | JS_GPN_ENUM_ONLY))
+ goto fail;
+ for(i = 0; i < tab_atom_count; i++) {
+ JS_SetPropertyInternal(ctx, enum_obj, tab_atom[i].atom, JS_NULL, 0);
+ }
+ js_free_prop_enum(ctx, tab_atom, tab_atom_count);
+ }
+ return enum_obj;
+
+ slow_path:
+ /* non enumerable properties hide the enumerables ones in the
+ prototype chain */
+ while (p != NULL) {
+ if (JS_GetOwnPropertyNames(ctx, &tab_atom, &tab_atom_count, p,
+ JS_GPN_STRING_MASK | JS_GPN_SET_ENUM))
+ goto fail;
+ for(i = 0; i < tab_atom_count; i++) {
+ JS_DefinePropertyValue(ctx, enum_obj, tab_atom[i].atom, JS_NULL,
+ (tab_atom[i].is_enumerable ?
+ JS_PROP_ENUMERABLE : 0));
+ }
+ js_free_prop_enum(ctx, tab_atom, tab_atom_count);
+ p = p->shape->proto;
+ }
+ return enum_obj;
+
+ fail:
+ JS_FreeValue(ctx, enum_obj);
+ return JS_EXCEPTION;
+}
+
+/* obj -> enum_obj */
+static __exception int js_for_in_start(JSContext *ctx, JSValue *sp)
+{
+ sp[-1] = build_for_in_iterator(ctx, sp[-1]);
+ if (JS_IsException(sp[-1]))
+ return -1;
+ return 0;
+}
+
+/* enum_obj -> enum_obj value done */
+static __exception int js_for_in_next(JSContext *ctx, JSValue *sp)
+{
+ JSValueConst enum_obj;
+ JSObject *p;
+ JSAtom prop;
+ JSForInIterator *it;
+ int ret;
+
+ enum_obj = sp[-1];
+ /* fail safe */
+ if (JS_VALUE_GET_TAG(enum_obj) != JS_TAG_OBJECT)
+ goto done;
+ p = JS_VALUE_GET_OBJ(enum_obj);
+ if (p->class_id != JS_CLASS_FOR_IN_ITERATOR)
+ goto done;
+ it = p->u.for_in_iterator;
+
+ for(;;) {
+ if (it->is_array) {
+ if (it->idx >= it->array_length)
+ goto done;
+ prop = __JS_AtomFromUInt32(it->idx);
+ it->idx++;
+ } else {
+ JSShape *sh = p->shape;
+ JSShapeProperty *prs;
+ if (it->idx >= sh->prop_count)
+ goto done;
+ prs = get_shape_prop(sh) + it->idx;
+ prop = prs->atom;
+ it->idx++;
+ if (prop == JS_ATOM_NULL || !(prs->flags & JS_PROP_ENUMERABLE))
+ continue;
+ }
+ /* check if the property was deleted */
+ ret = JS_HasProperty(ctx, it->obj, prop);
+ if (ret < 0)
+ return ret;
+ if (ret)
+ break;
+ }
+ /* return the property */
+ sp[0] = JS_AtomToValue(ctx, prop);
+ sp[1] = JS_FALSE;
+ return 0;
+ done:
+ /* return the end */
+ sp[0] = JS_UNDEFINED;
+ sp[1] = JS_TRUE;
+ return 0;
+}
+
+static JSValue JS_GetIterator2(JSContext *ctx, JSValueConst obj,
+ JSValueConst method)
+{
+ JSValue enum_obj;
+
+ enum_obj = JS_Call(ctx, method, obj, 0, NULL);
+ if (JS_IsException(enum_obj))
+ return enum_obj;
+ if (!JS_IsObject(enum_obj)) {
+ JS_FreeValue(ctx, enum_obj);
+ return JS_ThrowTypeErrorNotAnObject(ctx);
+ }
+ return enum_obj;
+}
+
+JSValue JS_GetIterator(JSContext *ctx, JSValueConst obj, BOOL is_async)
+{
+ JSValue method, ret, sync_iter;
+
+ if (is_async) {
+ method = JS_GetProperty(ctx, obj, JS_ATOM_Symbol_asyncIterator);
+ if (JS_IsException(method))
+ return method;
+ if (JS_IsUndefined(method) || JS_IsNull(method)) {
+ method = JS_GetProperty(ctx, obj, JS_ATOM_Symbol_iterator);
+ if (JS_IsException(method))
+ return method;
+ sync_iter = JS_GetIterator2(ctx, obj, method);
+ JS_FreeValue(ctx, method);
+ if (JS_IsException(sync_iter))
+ return sync_iter;
+ ret = JS_CreateAsyncFromSyncIterator(ctx, sync_iter);
+ JS_FreeValue(ctx, sync_iter);
+ return ret;
+ }
+ } else {
+ method = JS_GetProperty(ctx, obj, JS_ATOM_Symbol_iterator);
+ if (JS_IsException(method))
+ return method;
+ }
+ if (!JS_IsFunction(ctx, method)) {
+ JS_FreeValue(ctx, method);
+ return JS_ThrowTypeError(ctx, "value is not iterable");
+ }
+ ret = JS_GetIterator2(ctx, obj, method);
+ JS_FreeValue(ctx, method);
+ return ret;
+}
+
+/* return *pdone = 2 if the iterator object is not parsed */
+static JSValue JS_IteratorNext2(JSContext *ctx, JSValueConst enum_obj,
+ JSValueConst method,
+ int argc, JSValueConst *argv, int *pdone)
+{
+ JSValue obj;
+
+ /* fast path for the built-in iterators (avoid creating the
+ intermediate result object) */
+ if (JS_IsObject(method)) {
+ JSObject *p = JS_VALUE_GET_OBJ(method);
+ if (p->class_id == JS_CLASS_C_FUNCTION &&
+ p->u.cfunc.cproto == JS_CFUNC_iterator_next) {
+ JSCFunctionType func;
+ JSValueConst args[1];
+
+ /* in case the function expects one argument */
+ if (argc == 0) {
+ args[0] = JS_UNDEFINED;
+ argv = args;
+ }
+ func = p->u.cfunc.c_function;
+ return func.iterator_next(ctx, enum_obj, argc, argv,
+ pdone, p->u.cfunc.magic);
+ }
+ }
+ obj = JS_Call(ctx, method, enum_obj, argc, argv);
+ if (JS_IsException(obj))
+ goto fail;
+ if (!JS_IsObject(obj)) {
+ JS_FreeValue(ctx, obj);
+ JS_ThrowTypeError(ctx, "iterator must return an object");
+ goto fail;
+ }
+ *pdone = 2;
+ return obj;
+ fail:
+ *pdone = FALSE;
+ return JS_EXCEPTION;
+}
+
+JSValue JS_IteratorNext(JSContext *ctx, JSValueConst enum_obj,
+ JSValueConst method,
+ int argc, JSValueConst *argv, BOOL *pdone)
+{
+ JSValue obj, value, done_val;
+ int done;
+
+ obj = JS_IteratorNext2(ctx, enum_obj, method, argc, argv, &done);
+ if (JS_IsException(obj))
+ goto fail;
+ if (done != 2) {
+ *pdone = done;
+ return obj;
+ } else {
+ done_val = JS_GetProperty(ctx, obj, JS_ATOM_done);
+ if (JS_IsException(done_val))
+ goto fail;
+ *pdone = JS_ToBoolFree(ctx, done_val);
+ value = JS_UNDEFINED;
+ if (!*pdone) {
+ value = JS_GetProperty(ctx, obj, JS_ATOM_value);
+ }
+ JS_FreeValue(ctx, obj);
+ return value;
+ }
+ fail:
+ JS_FreeValue(ctx, obj);
+ *pdone = FALSE;
+ return JS_EXCEPTION;
+}
+
+/* return < 0 in case of exception */
+static int JS_IteratorClose(JSContext *ctx, JSValueConst enum_obj,
+ BOOL is_exception_pending)
+{
+ JSValue method, ret, ex_obj;
+ int res;
+
+ if (is_exception_pending) {
+ ex_obj = ctx->current_exception;
+ ctx->current_exception = JS_NULL;
+ res = -1;
+ } else {
+ ex_obj = JS_UNDEFINED;
+ res = 0;
+ }
+ method = JS_GetProperty(ctx, enum_obj, JS_ATOM_return);
+ if (JS_IsException(method)) {
+ res = -1;
+ goto done;
+ }
+ if (JS_IsUndefined(method) || JS_IsNull(method)) {
+ goto done;
+ }
+ ret = JS_CallFree(ctx, method, enum_obj, 0, NULL);
+ if (!is_exception_pending) {
+ if (JS_IsException(ret)) {
+ res = -1;
+ } else if (!JS_IsObject(ret)) {
+ JS_ThrowTypeErrorNotAnObject(ctx);
+ res = -1;
+ }
+ }
+ JS_FreeValue(ctx, ret);
+ done:
+ if (is_exception_pending) {
+ JS_Throw(ctx, ex_obj);
+ }
+ return res;
+}
+
+/* obj -> enum_rec (3 slots) */
+static __exception int js_for_of_start(JSContext *ctx, JSValue *sp,
+ BOOL is_async)
+{
+ JSValue op1, obj, method;
+ op1 = sp[-1];
+ obj = JS_GetIterator(ctx, op1, is_async);
+ if (JS_IsException(obj))
+ return -1;
+ JS_FreeValue(ctx, op1);
+ sp[-1] = obj;
+ method = JS_GetProperty(ctx, obj, JS_ATOM_next);
+ if (JS_IsException(method))
+ return -1;
+ sp[0] = method;
+ return 0;
+}
+
+/* enum_rec -> enum_rec value done */
+static __exception int js_for_of_next(JSContext *ctx, JSValue *sp, int offset)
+{
+ JSValue value = JS_UNDEFINED;
+ int done = 1;
+
+ if (likely(!JS_IsUndefined(sp[offset]))) {
+ value = JS_IteratorNext(ctx, sp[offset], sp[offset + 1], 0, NULL, &done);
+ if (JS_IsException(value))
+ done = -1;
+ if (done) {
+ /* value is JS_UNDEFINED or JS_EXCEPTION */
+ /* replace the iteration object with undefined */
+ JS_FreeValue(ctx, sp[offset]);
+ sp[offset] = JS_UNDEFINED;
+ if (done < 0)
+ return -1;
+ }
+ }
+ sp[0] = value;
+ sp[1] = JS_NewBool(ctx, done);
+ return 0;
+}
+
+static __exception int js_for_await_of_next(JSContext *ctx, JSValue *sp)
+{
+ JSValue result;
+ result = JS_Call(ctx, sp[-2], sp[-3], 0, NULL);
+ if (JS_IsException(result))
+ return -1;
+ sp[0] = result;
+ return 0;
+}
+
+static JSValue JS_IteratorGetCompleteValue(JSContext *ctx, JSValueConst obj,
+ BOOL *pdone)
+{
+ JSValue done_val, value;
+ BOOL done;
+ done_val = JS_GetProperty(ctx, obj, JS_ATOM_done);
+ if (JS_IsException(done_val))
+ goto fail;
+ done = JS_ToBoolFree(ctx, done_val);
+ value = JS_GetProperty(ctx, obj, JS_ATOM_value);
+ if (JS_IsException(value))
+ goto fail;
+ *pdone = done;
+ return value;
+ fail:
+ *pdone = FALSE;
+ return JS_EXCEPTION;
+}
+
+static __exception int js_iterator_get_value_done(JSContext *ctx, JSValue *sp)
+{
+ JSValue obj, value;
+ BOOL done;
+ obj = sp[-1];
+ if (!JS_IsObject(obj)) {
+ JS_ThrowTypeError(ctx, "iterator must return an object");
+ return -1;
+ }
+ value = JS_IteratorGetCompleteValue(ctx, obj, &done);
+ if (JS_IsException(value))
+ return -1;
+ JS_FreeValue(ctx, obj);
+ sp[-1] = value;
+ sp[0] = JS_NewBool(ctx, done);
+ return 0;
+}
+
+static JSValue js_create_iterator_result(JSContext *ctx,
+ JSValue val,
+ BOOL done)
+{
+ JSValue obj;
+ obj = JS_NewObject(ctx);
+ if (JS_IsException(obj)) {
+ JS_FreeValue(ctx, val);
+ return obj;
+ }
+ if (JS_DefinePropertyValue(ctx, obj, JS_ATOM_value,
+ val, JS_PROP_C_W_E) < 0) {
+ goto fail;
+ }
+ if (JS_DefinePropertyValue(ctx, obj, JS_ATOM_done,
+ JS_NewBool(ctx, done), JS_PROP_C_W_E) < 0) {
+ fail:
+ JS_FreeValue(ctx, obj);
+ return JS_EXCEPTION;
+ }
+ return obj;
+}
+
+static JSValue js_array_iterator_next(JSContext *ctx, JSValueConst this_val,
+ int argc, JSValueConst *argv,
+ BOOL *pdone, int magic);
+
+static JSValue js_create_array_iterator(JSContext *ctx, JSValueConst this_val,
+ int argc, JSValueConst *argv, int magic);
+
+/* Access an Array's internal JSValue array if available */
+int js_get_fast_array(JSContext *ctx, JSValueConst obj,
+ JSValue **arrpp, uint32_t *countp)
+{
+ /* Try and handle fast arrays explicitly */
+ if (JS_VALUE_GET_TAG(obj) == JS_TAG_OBJECT) {
+ JSObject *p = JS_VALUE_GET_OBJ(obj);
+ if (p->class_id == JS_CLASS_ARRAY && p->fast_array) {
+ *countp = p->u.array.count;
+ *arrpp = p->u.array.u.values;
+ return TRUE;
+ }
+ }
+ return FALSE;
+}
+
+static __exception int js_append_enumerate(JSContext *ctx, JSValue *sp)
+{
+ JSValue iterator, enumobj, method, value;
+ int pos, is_array_iterator;
+ JSValue *arrp;
+ uint32_t i, count32;
+
+ if (JS_VALUE_GET_TAG(sp[-2]) != JS_TAG_INT) {
+ JS_ThrowInternalError(ctx, "invalid index for append");
+ return -1;
+ }
+
+ pos = JS_VALUE_GET_INT(sp[-2]);
+
+ /* XXX: further optimisations:
+ - use ctx->array_proto_values?
+ - check if array_iterator_prototype next method is built-in and
+ avoid constructing actual iterator object?
+ - build this into js_for_of_start and use in all `for (x of o)` loops
+ */
+ iterator = JS_GetProperty(ctx, sp[-1], JS_ATOM_Symbol_iterator);
+ if (JS_IsException(iterator))
+ return -1;
+ is_array_iterator = JS_IsCFunction(ctx, iterator,
+ (JSCFunction *)js_create_array_iterator,
+ JS_ITERATOR_KIND_VALUE);
+ JS_FreeValue(ctx, iterator);
+
+ enumobj = JS_GetIterator(ctx, sp[-1], FALSE);
+ if (JS_IsException(enumobj))
+ return -1;
+ method = JS_GetProperty(ctx, enumobj, JS_ATOM_next);
+ if (JS_IsException(method)) {
+ JS_FreeValue(ctx, enumobj);
+ return -1;
+ }
+ if (is_array_iterator
+ && JS_IsCFunction(ctx, method, (JSCFunction *)js_array_iterator_next, 0)
+ && js_get_fast_array(ctx, sp[-1], &arrp, &count32)) {
+ int64_t len;
+ /* Handle fast arrays explicitly */
+ if (js_get_length64(ctx, &len, sp[-1]))
+ goto exception;
+ for (i = 0; i < count32; i++) {
+ if (JS_DefinePropertyValueUint32(ctx, sp[-3], pos++,
+ JS_DupValue(ctx, arrp[i]), JS_PROP_C_W_E) < 0)
+ goto exception;
+ }
+ if (len > count32) {
+ /* This is not strictly correct because the trailing elements are
+ empty instead of undefined. Append undefined entries instead.
+ */
+ pos += len - count32;
+ if (JS_SetProperty(ctx, sp[-3], JS_ATOM_length, JS_NewUint32(ctx, pos)) < 0)
+ goto exception;
+ }
+ } else {
+ for (;;) {
+ BOOL done;
+ value = JS_IteratorNext(ctx, enumobj, method, 0, NULL, &done);
+ if (JS_IsException(value))
+ goto exception;
+ if (done) {
+ /* value is JS_UNDEFINED */
+ break;
+ }
+ if (JS_DefinePropertyValueUint32(ctx, sp[-3], pos++, value, JS_PROP_C_W_E) < 0)
+ goto exception;
+ }
+ }
+ sp[-2] = JS_NewInt32(ctx, pos);
+ JS_FreeValue(ctx, enumobj);
+ JS_FreeValue(ctx, method);
+ return 0;
+
+exception:
+ JS_IteratorClose(ctx, enumobj, TRUE);
+ JS_FreeValue(ctx, enumobj);
+ JS_FreeValue(ctx, method);
+ return -1;
+}
+
+static __exception int JS_CopyDataProperties(JSContext *ctx,
+ JSValueConst target,
+ JSValueConst source,
+ JSValueConst excluded,
+ BOOL setprop)
+{
+ JSPropertyEnum *tab_atom;
+ JSValue val;
+ uint32_t i, tab_atom_count;
+ JSObject *p;
+ JSObject *pexcl = NULL;
+ int ret = 0, flags;
+
+ if (JS_VALUE_GET_TAG(source) != JS_TAG_OBJECT)
+ return 0;
+
+ if (JS_VALUE_GET_TAG(excluded) == JS_TAG_OBJECT)
+ pexcl = JS_VALUE_GET_OBJ(excluded);
+
+ p = JS_VALUE_GET_OBJ(source);
+ if (JS_GetOwnPropertyNames(ctx, &tab_atom, &tab_atom_count, p,
+ JS_GPN_STRING_MASK | JS_GPN_SYMBOL_MASK |
+ JS_GPN_ENUM_ONLY))
+ return -1;
+
+ flags = JS_PROP_C_W_E;
+
+ for (i = 0; i < tab_atom_count; i++) {
+ if (pexcl) {
+ ret = JS_GetOwnProperty(ctx, NULL, pexcl, tab_atom[i].atom);
+ if (ret) {
+ if (ret < 0)
+ break;
+ ret = 0;
+ continue;
+ }
+ }
+ ret = -1;
+ val = JS_GetProperty(ctx, source, tab_atom[i].atom);
+ if (JS_IsException(val))
+ break;
+ if (setprop)
+ ret = JS_SetProperty(ctx, target, tab_atom[i].atom, val);
+ else
+ ret = JS_DefinePropertyValue(ctx, target, tab_atom[i].atom, val, flags);
+ if (ret < 0)
+ break;
+ ret = 0;
+ }
+ js_free_prop_enum(ctx, tab_atom, tab_atom_count);
+ return ret;
+}
+
+/* only valid inside C functions */
+static JSValueConst JS_GetActiveFunction(JSContext *ctx)
+{
+ return ctx->current_stack_frame->cur_func;
+}
+
+static JSVarRef *get_var_ref(JSContext *ctx, JSStackFrame *sf,
+ int var_idx, BOOL is_arg)
+{
+ JSVarRef *var_ref;
+ struct list_head *el;
+
+ list_for_each(el, &sf->var_ref_list) {
+ var_ref = list_entry(el, JSVarRef, link);
+ if (var_ref->var_idx == var_idx && var_ref->is_arg == is_arg) {
+ var_ref->header.ref_count++;
+ return var_ref;
+ }
+ }
+ /* create a new one */
+ var_ref = js_malloc(ctx, sizeof(JSVarRef));
+ if (!var_ref)
+ return NULL;
+ var_ref->header.ref_count = 1;
+ var_ref->gc_header.mark = 0;
+ var_ref->is_arg = is_arg;
+ var_ref->var_idx = var_idx;
+ list_add_tail(&var_ref->link, &sf->var_ref_list);
+ if (is_arg)
+ var_ref->pvalue = &sf->arg_buf[var_idx];
+ else
+ var_ref->pvalue = &sf->var_buf[var_idx];
+ var_ref->value = JS_UNDEFINED;
+ return var_ref;
+}
+
+static JSValue js_closure2(JSContext *ctx, JSValue func_obj,
+ JSFunctionBytecode *b,
+ JSVarRef **cur_var_refs,
+ JSStackFrame *sf)
+{
+ JSObject *p;
+ JSVarRef **var_refs;
+ int i;
+
+ p = JS_VALUE_GET_OBJ(func_obj);
+ p->u.func.function_bytecode = b;
+ p->u.func.home_object = NULL;
+ p->u.func.var_refs = NULL;
+ if (b->closure_var_count) {
+ var_refs = js_mallocz(ctx, sizeof(var_refs[0]) * b->closure_var_count);
+ if (!var_refs)
+ goto fail;
+ p->u.func.var_refs = var_refs;
+ for(i = 0; i < b->closure_var_count; i++) {
+ JSClosureVar *cv = &b->closure_var[i];
+ JSVarRef *var_ref;
+ if (cv->is_local) {
+ /* reuse the existing variable reference if it already exists */
+ var_ref = get_var_ref(ctx, sf, cv->var_idx, cv->is_arg);
+ if (!var_ref)
+ goto fail;
+ } else {
+ var_ref = cur_var_refs[cv->var_idx];
+ var_ref->header.ref_count++;
+ }
+ var_refs[i] = var_ref;
+ }
+ }
+ return func_obj;
+ fail:
+ /* bfunc is freed when func_obj is freed */
+ JS_FreeValue(ctx, func_obj);
+ return JS_EXCEPTION;
+}
+
+static int js_instantiate_prototype(JSContext *ctx, JSObject *p, JSAtom atom, void *opaque)
+{
+ JSValue obj, this_val;
+ int ret;
+
+ this_val = JS_MKPTR(JS_TAG_OBJECT, p);
+ obj = JS_NewObject(ctx);
+ if (JS_IsException(obj))
+ return -1;
+ set_cycle_flag(ctx, obj);
+ set_cycle_flag(ctx, this_val);
+ ret = JS_DefinePropertyValue(ctx, obj, JS_ATOM_constructor,
+ JS_DupValue(ctx, this_val),
+ JS_PROP_WRITABLE | JS_PROP_CONFIGURABLE);
+ if (JS_DefinePropertyValue(ctx, this_val, atom, obj, JS_PROP_WRITABLE) < 0 || ret < 0)
+ return -1;
+ return 0;
+}
+
+static JSValue js_closure(JSContext *ctx, JSValue bfunc,
+ JSVarRef **cur_var_refs,
+ JSStackFrame *sf)
+{
+ JSFunctionBytecode *b;
+ JSValue name_val, func_obj;
+ JSAtom name_atom;
+ static const uint16_t func_kind_to_class_id[] = {
+ [JS_FUNC_NORMAL] = JS_CLASS_BYTECODE_FUNCTION,
+ [JS_FUNC_GENERATOR] = JS_CLASS_GENERATOR_FUNCTION,
+ [JS_FUNC_ASYNC] = JS_CLASS_ASYNC_FUNCTION,
+ [JS_FUNC_ASYNC_GENERATOR] = JS_CLASS_ASYNC_GENERATOR_FUNCTION,
+ };
+
+ b = JS_VALUE_GET_PTR(bfunc);
+ func_obj = JS_NewObjectClass(ctx, func_kind_to_class_id[b->func_kind]);
+ if (JS_IsException(func_obj)) {
+ JS_FreeValue(ctx, bfunc);
+ return JS_EXCEPTION;
+ }
+ func_obj = js_closure2(ctx, func_obj, b, cur_var_refs, sf);
+ if (JS_IsException(func_obj)) {
+ /* bfunc has been freed */
+ goto fail;
+ }
+ name_val = JS_UNDEFINED;
+ name_atom = b->func_name;
+ if (name_atom != JS_ATOM_NULL)
+ name_val = JS_AtomToString(ctx, name_atom);
+ js_function_set_properties(ctx, func_obj, name_val,
+ b->defined_arg_count);
+
+ if (b->func_kind & JS_FUNC_GENERATOR) {
+ JSValue proto;
+ int proto_class_id;
+ /* generators have a prototype field which is used as
+ prototype for the generator object */
+ if (b->func_kind == JS_FUNC_ASYNC_GENERATOR)
+ proto_class_id = JS_CLASS_ASYNC_GENERATOR;
+ else
+ proto_class_id = JS_CLASS_GENERATOR;
+ proto = JS_NewObjectProto(ctx, ctx->class_proto[proto_class_id]);
+ if (JS_IsException(proto))
+ goto fail;
+ JS_DefinePropertyValue(ctx, func_obj, JS_ATOM_prototype, proto,
+ JS_PROP_WRITABLE);
+ } else if (b->has_prototype) {
+ /* add the 'prototype' property: delay instantiation to avoid
+ creating cycles for every javascript function. The prototype
+ object is created on the fly when first accessed */
+ JS_SetConstructorBit(ctx, func_obj, TRUE);
+ JS_DefineAutoInitProperty(ctx, func_obj, JS_ATOM_prototype,
+ js_instantiate_prototype, NULL,
+ JS_PROP_WRITABLE);
+ }
+ return func_obj;
+ fail:
+ /* bfunc is freed when func_obj is freed */
+ JS_FreeValue(ctx, func_obj);
+ return JS_EXCEPTION;
+}
+
+#define JS_DEFINE_CLASS_HAS_HERITAGE (1 << 0)
+
+static int js_op_define_class(JSContext *ctx, JSValue *sp,
+ int class_flags,
+ JSVarRef **cur_var_refs,
+ JSStackFrame *sf)
+{
+ JSValue bfunc, parent_class, proto = JS_UNDEFINED;
+ JSValue ctor = JS_UNDEFINED, parent_proto = JS_UNDEFINED;
+ JSFunctionBytecode *b;
+
+ parent_class = sp[-2];
+ bfunc = sp[-1];
+
+ if (class_flags & JS_DEFINE_CLASS_HAS_HERITAGE) {
+ if (JS_IsNull(parent_class)) {
+ parent_proto = JS_NULL;
+ parent_class = JS_DupValue(ctx, ctx->function_proto);
+ } else {
+ if (!JS_IsConstructor(ctx, parent_class)) {
+ JS_ThrowTypeError(ctx, "parent class must be constructor");
+ goto fail;
+ }
+ parent_proto = JS_GetProperty(ctx, parent_class, JS_ATOM_prototype);
+ if (JS_IsException(parent_proto))
+ goto fail;
+ if (!JS_IsNull(parent_proto) && !JS_IsObject(parent_proto)) {
+ JS_ThrowTypeError(ctx, "parent prototype must be an object or null");
+ goto fail;
+ }
+ }
+ } else {
+ /* parent_class is JS_UNDEFINED in this case */
+ parent_proto = JS_DupValue(ctx, ctx->class_proto[JS_CLASS_OBJECT]);
+ parent_class = JS_DupValue(ctx, ctx->function_proto);
+ }
+ proto = JS_NewObjectProto(ctx, parent_proto);
+ if (JS_IsException(proto))
+ goto fail;
+
+ b = JS_VALUE_GET_PTR(bfunc);
+ assert(b->func_kind == JS_FUNC_NORMAL);
+ ctor = JS_NewObjectProtoClass(ctx, parent_class,
+ JS_CLASS_BYTECODE_FUNCTION);
+ if (JS_IsException(ctor))
+ goto fail;
+ ctor = js_closure2(ctx, ctor, b, cur_var_refs, sf);
+ bfunc = JS_UNDEFINED;
+ if (JS_IsException(ctor))
+ goto fail;
+ js_method_set_home_object(ctx, ctor, proto);
+ JS_SetConstructorBit(ctx, ctor, TRUE);
+
+ JS_DefinePropertyValue(ctx, ctor, JS_ATOM_length,
+ JS_NewInt32(ctx, b->defined_arg_count),
+ JS_PROP_CONFIGURABLE);
+
+ /* the constructor property must be first. It can be overriden by
+ computed property names */
+ if (JS_DefinePropertyValue(ctx, proto, JS_ATOM_constructor,
+ JS_DupValue(ctx, ctor),
+ JS_PROP_CONFIGURABLE |
+ JS_PROP_WRITABLE | JS_PROP_THROW) < 0)
+ goto fail;
+ /* set the prototype property */
+ if (JS_DefinePropertyValue(ctx, ctor, JS_ATOM_prototype,
+ JS_DupValue(ctx, proto), JS_PROP_THROW) < 0)
+ goto fail;
+ set_cycle_flag(ctx, ctor);
+ set_cycle_flag(ctx, proto);
+
+ JS_FreeValue(ctx, parent_proto);
+ JS_FreeValue(ctx, parent_class);
+
+ sp[-2] = ctor;
+ sp[-1] = proto;
+ return 0;
+ fail:
+ JS_FreeValue(ctx, parent_class);
+ JS_FreeValue(ctx, parent_proto);
+ JS_FreeValue(ctx, bfunc);
+ JS_FreeValue(ctx, proto);
+ JS_FreeValue(ctx, ctor);
+ sp[-2] = JS_UNDEFINED;
+ sp[-1] = JS_UNDEFINED;
+ return -1;
+}
+
+static void close_var_refs(JSContext *ctx, JSStackFrame *sf)
+{
+ struct list_head *el, *el1;
+ JSVarRef *var_ref;
+ int var_idx;
+
+ list_for_each_safe(el, el1, &sf->var_ref_list) {
+ var_ref = list_entry(el, JSVarRef, link);
+ var_idx = var_ref->var_idx;
+ if (var_ref->is_arg)
+ var_ref->value = JS_DupValue(ctx, sf->arg_buf[var_idx]);
+ else
+ var_ref->value = JS_DupValue(ctx, sf->var_buf[var_idx]);
+ var_ref->pvalue = &var_ref->value;
+ var_ref->link.prev = NULL; /* the reference is no longer to a
+ local variable */
+ }
+}
+
+static void close_lexical_var(JSContext *ctx, JSStackFrame *sf, int idx, int is_arg)
+{
+ struct list_head *el, *el1;
+ JSVarRef *var_ref;
+ int var_idx = idx;
+
+ list_for_each_safe(el, el1, &sf->var_ref_list) {
+ var_ref = list_entry(el, JSVarRef, link);
+ if (var_idx == var_ref->var_idx && var_ref->is_arg == is_arg) {
+ var_ref->value = JS_DupValue(ctx, sf->var_buf[var_idx]);
+ var_ref->pvalue = &var_ref->value;
+ list_del(&var_ref->link);
+ var_ref->link.prev = NULL; /* the reference is no longer to a
+ local variable */
+ }
+ }
+}
+
+#define CALL_FLAG_CONSTRUCTOR (1 << 0)
+#define CALL_FLAG_COPY_ARGV (1 << 1)
+#define CALL_FLAG_GENERATOR (1 << 2)
+
+static JSValue js_call_c_function(JSContext *ctx, JSValueConst func_obj,
+ JSValueConst this_obj,
+ int argc, JSValueConst *argv, int flags)
+{
+ JSCFunctionType func;
+ JSObject *p;
+ JSStackFrame sf_s, *sf = &sf_s, *prev_sf;
+ JSValue ret_val;
+ JSValueConst *arg_buf;
+ int arg_count, i;
+ JSCFunctionEnum cproto;
+
+ p = JS_VALUE_GET_OBJ(func_obj);
+ cproto = p->u.cfunc.cproto;
+ prev_sf = ctx->current_stack_frame;
+ sf->prev_frame = prev_sf;
+ ctx->current_stack_frame = sf;
+#ifdef CONFIG_BIGNUM
+ /* we only propagate the bignum mode as some runtime functions
+ test it */
+ if (prev_sf)
+ sf->js_mode = prev_sf->js_mode & JS_MODE_BIGINT;
+ else
+ sf->js_mode = 0;
+#else
+ sf->js_mode = 0;
+#endif
+ sf->cur_func = CastToJSValue(func_obj);
+ sf->arg_count = argc;
+ arg_buf = argv;
+
+ arg_count = p->u.cfunc.length;
+
+ if (unlikely(argc < arg_count)) {
+ /* ensure that at least argc_count arguments are readable */
+ arg_buf = alloca(sizeof(arg_buf[0]) * arg_count);
+ for(i = 0; i < argc; i++)
+ arg_buf[i] = argv[i];
+ for(i = argc; i < arg_count; i++)
+ arg_buf[i] = JS_UNDEFINED;
+ sf->arg_count = arg_count;
+ }
+ sf->arg_buf = (JSValue*)arg_buf;
+
+ func = p->u.cfunc.c_function;
+ switch(cproto) {
+ case JS_CFUNC_constructor:
+ case JS_CFUNC_constructor_or_func:
+ if (!(flags & CALL_FLAG_CONSTRUCTOR)) {
+ if (cproto == JS_CFUNC_constructor) {
+ not_a_constructor:
+ ret_val = JS_ThrowTypeError(ctx, "must be called with new");
+ break;
+ } else {
+ this_obj = JS_UNDEFINED;
+ }
+ }
+ /* here this_obj is new_target */
+ /* fall thru */
+ case JS_CFUNC_generic:
+ ret_val = func.generic(ctx, this_obj, argc, arg_buf);
+ break;
+ case JS_CFUNC_constructor_magic:
+ case JS_CFUNC_constructor_or_func_magic:
+ if (!(flags & CALL_FLAG_CONSTRUCTOR)) {
+ if (cproto == JS_CFUNC_constructor_magic) {
+ goto not_a_constructor;
+ } else {
+ this_obj = JS_UNDEFINED;
+ }
+ }
+ /* fall thru */
+ case JS_CFUNC_generic_magic:
+ ret_val = func.generic_magic(ctx, this_obj, argc, arg_buf,
+ p->u.cfunc.magic);
+ break;
+ case JS_CFUNC_getter:
+ ret_val = func.getter(ctx, this_obj);
+ break;
+ case JS_CFUNC_setter:
+ ret_val = func.setter(ctx, this_obj, arg_buf[0]);
+ break;
+ case JS_CFUNC_getter_magic:
+ ret_val = func.getter_magic(ctx, this_obj, p->u.cfunc.magic);
+ break;
+ case JS_CFUNC_setter_magic:
+ ret_val = func.setter_magic(ctx, this_obj, arg_buf[0], p->u.cfunc.magic);
+ break;
+ case JS_CFUNC_f_f:
+ {
+ double d1;
+
+ if (unlikely(JS_ToFloat64(ctx, &d1, arg_buf[0]))) {
+ ret_val = JS_EXCEPTION;
+ break;
+ }
+ ret_val = JS_NewFloat64(ctx, func.f_f(d1));
+ }
+ break;
+ case JS_CFUNC_f_f_f:
+ {
+ double d1, d2;
+
+ if (unlikely(JS_ToFloat64(ctx, &d1, arg_buf[0]))) {
+ ret_val = JS_EXCEPTION;
+ break;
+ }
+ if (unlikely(JS_ToFloat64(ctx, &d2, arg_buf[1]))) {
+ ret_val = JS_EXCEPTION;
+ break;
+ }
+ ret_val = JS_NewFloat64(ctx, func.f_f_f(d1, d2));
+ }
+ break;
+ case JS_CFUNC_iterator_next:
+ {
+ int done;
+ ret_val = func.iterator_next(ctx, this_obj, argc, arg_buf,
+ &done, p->u.cfunc.magic);
+ if (!JS_IsException(ret_val) && done != 2) {
+ ret_val = js_create_iterator_result(ctx, ret_val, done);
+ }
+ }
+ break;
+ default:
+ abort();
+ }
+
+ ctx->current_stack_frame = sf->prev_frame;
+ return ret_val;
+}
+
+static JSValue js_call_bound_function(JSContext *ctx, JSValueConst func_obj,
+ JSValueConst this_obj,
+ int argc, JSValueConst *argv, int flags)
+{
+ JSObject *p;
+ JSBoundFunction *bf;
+ JSValueConst *arg_buf, new_target;
+ int arg_count, i;
+
+ p = JS_VALUE_GET_OBJ(func_obj);
+ bf = p->u.bound_function;
+ arg_count = bf->argc + argc;
+ arg_buf = alloca(sizeof(JSValue) * arg_count);
+ for(i = 0; i < bf->argc; i++) {
+ arg_buf[i] = bf->argv[i];
+ }
+ for(i = 0; i < argc; i++) {
+ arg_buf[bf->argc + i] = argv[i];
+ }
+ if (flags & CALL_FLAG_CONSTRUCTOR) {
+ new_target = this_obj;
+ if (js_same_value(ctx, func_obj, new_target))
+ new_target = bf->func_obj;
+ return JS_CallConstructor2(ctx, bf->func_obj, new_target,
+ arg_count, arg_buf);
+ } else {
+ return JS_Call(ctx, bf->func_obj, bf->this_val,
+ arg_count, arg_buf);
+ }
+}
+
+static no_inline __exception int __js_poll_interrupts(JSContext *ctx)
+{
+ JSRuntime *rt = ctx->rt;
+ ctx->interrupt_counter = JS_INTERRUPT_COUNTER_INIT;
+ if (rt->interrupt_handler) {
+ if (rt->interrupt_handler(rt, rt->interrupt_opaque)) {
+ /* XXX: should set a specific flag to avoid catching */
+ JS_ThrowInternalError(ctx, "interrupted");
+ JS_SetUncatchableError(ctx, ctx->current_exception, TRUE);
+ return -1;
+ }
+ }
+ return 0;
+}
+
+static inline __exception int js_poll_interrupts(JSContext *ctx)
+{
+ if (unlikely(--ctx->interrupt_counter <= 0)) {
+ return __js_poll_interrupts(ctx);
+ } else {
+ return 0;
+ }
+}
+
+#define FUNC_RET_AWAIT 0
+#define FUNC_RET_YIELD 1
+#define FUNC_RET_YIELD_STAR 2
+
+/* argv[] is modified if (flags & CALL_FLAG_COPY_ARGV) = 0. */
+static JSValue JS_CallInternal(JSContext *ctx, JSValueConst func_obj,
+ JSValueConst this_obj, JSValueConst new_target,
+ int argc, JSValue *argv, int flags)
+{
+ JSObject *p;
+ JSFunctionBytecode *b;
+ JSStackFrame sf_s, *sf = &sf_s;
+ const uint8_t *pc;
+ int opcode, arg_allocated_size, i;
+ JSValue *local_buf, *stack_buf, *var_buf, *arg_buf, *sp, ret_val, *pval;
+ JSVarRef **var_refs;
+ size_t alloca_size;
+
+#if !DIRECT_DISPATCH
+#define SWITCH(pc) switch (opcode = *pc++)
+#define CASE(op) case op
+#define DEFAULT default
+#define BREAK break
+#else
+ static const void * const dispatch_table[256] = {
+#define DEF(id, size, n_pop, n_push, f) && case_OP_ ## id,
+#define def(id, size, n_pop, n_push, f) && case_default,
+#include "quickjs-opcode.h"
+ [ OP_nop + 1 ... 255 ] = &&case_default
+ };
+#define SWITCH(pc) goto *dispatch_table[opcode = *pc++];
+#define CASE(op) case_ ## op
+#define DEFAULT case_default
+#define BREAK SWITCH(pc)
+#endif
+
+ if (js_poll_interrupts(ctx))
+ return JS_EXCEPTION;
+ if (unlikely(JS_VALUE_GET_TAG(func_obj) != JS_TAG_OBJECT)) {
+ if (flags & CALL_FLAG_GENERATOR) {
+ JSAsyncFunctionState *s = JS_VALUE_GET_PTR(func_obj);
+ /* func_obj get contains a pointer to JSFuncAsyncState */
+ /* the stack frame is already allocated */
+ sf = &s->frame;
+ p = JS_VALUE_GET_OBJ(sf->cur_func);
+ b = p->u.func.function_bytecode;
+ var_refs = p->u.func.var_refs;
+ local_buf = arg_buf = sf->arg_buf;
+ var_buf = sf->var_buf;
+ stack_buf = sf->var_buf + b->var_count;
+ sp = sf->cur_sp;
+ sf->cur_sp = NULL; /* cur_sp is NULL if the function is running */
+ pc = sf->cur_pc;
+ sf->prev_frame = ctx->current_stack_frame;
+ ctx->current_stack_frame = sf;
+ if (s->throw_flag)
+ goto exception;
+ else
+ goto restart;
+ } else {
+ goto not_a_function;
+ }
+ }
+ p = JS_VALUE_GET_OBJ(func_obj);
+ if (unlikely(p->class_id != JS_CLASS_BYTECODE_FUNCTION)) {
+ switch(p->class_id) {
+ case JS_CLASS_C_FUNCTION:
+ return js_call_c_function(ctx, func_obj, this_obj, argc,
+ (JSValueConst *)argv, flags);
+ case JS_CLASS_BOUND_FUNCTION:
+ return js_call_bound_function(ctx, func_obj, this_obj, argc,
+ (JSValueConst *)argv, flags);
+ default:
+ {
+ JSClassCall *call_func;
+ call_func = ctx->rt->class_array[p->class_id].call;
+ if (!call_func) {
+ not_a_function:
+ return JS_ThrowTypeError(ctx, "not a function");
+ }
+ return call_func(ctx, func_obj, this_obj, argc,
+ (JSValueConst *)argv);
+ }
+ }
+ }
+ b = p->u.func.function_bytecode;
+
+ if (unlikely(argc < b->arg_count || (flags & CALL_FLAG_COPY_ARGV))) {
+ arg_allocated_size = b->arg_count;
+ } else {
+ arg_allocated_size = 0;
+ }
+
+ alloca_size = sizeof(JSValue) * (arg_allocated_size + b->var_count +
+ b->stack_size);
+ if (js_check_stack_overflow(ctx, alloca_size))
+ return JS_ThrowStackOverflow(ctx);
+
+ sf->js_mode = b->js_mode;
+ arg_buf = argv;
+ sf->arg_count = argc;
+ sf->cur_func = CastToJSValue(func_obj);
+ init_list_head(&sf->var_ref_list);
+ var_refs = p->u.func.var_refs;
+
+ local_buf = alloca(alloca_size);
+ if (unlikely(arg_allocated_size)) {
+ int n = min_int(argc, b->arg_count);
+ arg_buf = local_buf;
+ for(i = 0; i < n; i++)
+ arg_buf[i] = JS_DupValue(ctx, argv[i]);
+ for(; i < b->arg_count; i++)
+ arg_buf[i] = JS_UNDEFINED;
+ sf->arg_count = b->arg_count;
+ }
+ var_buf = local_buf + arg_allocated_size;
+ sf->var_buf = var_buf;
+ sf->arg_buf = arg_buf;
+
+ for(i = 0; i < b->var_count; i++)
+ var_buf[i] = JS_UNDEFINED;
+
+ stack_buf = var_buf + b->var_count;
+ sp = stack_buf;
+ pc = b->byte_code_buf;
+ sf->prev_frame = ctx->current_stack_frame;
+ ctx->current_stack_frame = sf;
+ restart:
+ for(;;) {
+ int call_argc;
+ JSValue *call_argv;
+
+ SWITCH(pc) {
+ CASE(OP_push_i32):
+ *sp++ = JS_NewInt32(ctx, get_u32(pc));
+ pc += 4;
+ BREAK;
+ CASE(OP_push_const):
+ *sp++ = JS_DupValue(ctx, b->cpool[get_u32(pc)]);
+ pc += 4;
+ BREAK;
+#if SHORT_OPCODES
+ CASE(OP_push_minus1):
+ CASE(OP_push_0):
+ CASE(OP_push_1):
+ CASE(OP_push_2):
+ CASE(OP_push_3):
+ CASE(OP_push_4):
+ CASE(OP_push_5):
+ CASE(OP_push_6):
+ CASE(OP_push_7):
+ *sp++ = JS_NewInt32(ctx, opcode - OP_push_0);
+ BREAK;
+ CASE(OP_push_i8):
+ *sp++ = JS_NewInt32(ctx, get_i8(pc));
+ pc += 1;
+ BREAK;
+ CASE(OP_push_i16):
+ *sp++ = JS_NewInt32(ctx, get_i16(pc));
+ pc += 2;
+ BREAK;
+ CASE(OP_push_const8):
+ *sp++ = JS_DupValue(ctx, b->cpool[*pc++]);
+ BREAK;
+ CASE(OP_fclosure8):
+ *sp++ = js_closure(ctx, JS_DupValue(ctx, b->cpool[*pc++]), var_refs, sf);
+ if (unlikely(JS_IsException(sp[-1])))
+ goto exception;
+ BREAK;
+ CASE(OP_push_empty_string):
+ *sp++ = JS_AtomToString(ctx, JS_ATOM_empty_string);
+ BREAK;
+ CASE(OP_get_length):
+ {
+ JSValue val;
+
+ val = JS_GetProperty(ctx, sp[-1], JS_ATOM_length);
+ if (unlikely(JS_IsException(val)))
+ goto exception;
+ JS_FreeValue(ctx, sp[-1]);
+ sp[-1] = val;
+ }
+ BREAK;
+#endif
+ CASE(OP_push_atom_value):
+ *sp++ = JS_AtomToValue(ctx, get_u32(pc));
+ pc += 4;
+ BREAK;
+ CASE(OP_undefined):
+ *sp++ = JS_UNDEFINED;
+ BREAK;
+ CASE(OP_null):
+ *sp++ = JS_NULL;
+ BREAK;
+ CASE(OP_push_this):
+ /* OP_push_this is only called at the start of a function */
+ {
+ JSValue val;
+ if (!(b->js_mode & JS_MODE_STRICT)) {
+ uint32_t tag = JS_VALUE_GET_TAG(this_obj);
+ if (likely(tag == JS_TAG_OBJECT))
+ goto normal_this;
+ if (tag == JS_TAG_NULL || tag == JS_TAG_UNDEFINED) {
+ val = JS_DupValue(ctx, ctx->global_obj);
+ } else {
+ val = JS_ToObject(ctx, this_obj);
+ if (JS_IsException(val))
+ goto exception;
+ }
+ } else {
+ normal_this:
+ val = JS_DupValue(ctx, this_obj);
+ }
+ *sp++ = val;
+ }
+ BREAK;
+ CASE(OP_push_false):
+ *sp++ = JS_FALSE;
+ BREAK;
+ CASE(OP_push_true):
+ *sp++ = JS_TRUE;
+ BREAK;
+ CASE(OP_object):
+ *sp++ = JS_NewObject(ctx);
+ if (unlikely(JS_IsException(sp[-1])))
+ goto exception;
+ BREAK;
+ CASE(OP_var_object):
+ *sp++ = JS_NewObjectProto(ctx, JS_NULL);
+ if (unlikely(JS_IsException(sp[-1])))
+ goto exception;
+ BREAK;
+ CASE(OP_this_func):
+ *sp++ = JS_DupValue(ctx, sf->cur_func);
+ BREAK;
+ CASE(OP_arguments):
+ {
+ int mapped = *pc++;
+ if (mapped) {
+ *sp++ = js_build_mapped_arguments(ctx, argc, (JSValueConst *)argv,
+ sf, min_int(argc, b->arg_count));
+ } else {
+ *sp++ = js_build_arguments(ctx, argc, (JSValueConst *)argv);
+ }
+ if (unlikely(JS_IsException(sp[-1])))
+ goto exception;
+ }
+ BREAK;
+ CASE(OP_rest):
+ {
+ int first = get_u16(pc);
+ pc += 2;
+ *sp++ = js_build_rest(ctx, first, argc, (JSValueConst *)argv);
+ if (unlikely(JS_IsException(sp[-1])))
+ goto exception;
+ }
+ BREAK;
+ CASE(OP_new_target):
+ *sp++ = JS_DupValue(ctx, new_target);
+ BREAK;
+ CASE(OP_home_object):
+ {
+ JSObject *p1;
+ p1 = p->u.func.home_object;
+ if (unlikely(!p1))
+ *sp++ = JS_UNDEFINED;
+ else
+ *sp++ = JS_DupValue(ctx, JS_MKPTR(JS_TAG_OBJECT, p1));
+ }
+ BREAK;
+
+ CASE(OP_drop):
+ JS_FreeValue(ctx, sp[-1]);
+ sp--;
+ BREAK;
+ CASE(OP_nip):
+ JS_FreeValue(ctx, sp[-2]);
+ sp[-2] = sp[-1];
+ sp--;
+ BREAK;
+ CASE(OP_nip1): /* a b c -> b c */
+ JS_FreeValue(ctx, sp[-3]);
+ sp[-3] = sp[-2];
+ sp[-2] = sp[-1];
+ sp--;
+ BREAK;
+ CASE(OP_dup):
+ sp[0] = JS_DupValue(ctx, sp[-1]);
+ sp++;
+ BREAK;
+ CASE(OP_dup2): /* a b -> a b a b */
+ sp[0] = JS_DupValue(ctx, sp[-2]);
+ sp[1] = JS_DupValue(ctx, sp[-1]);
+ sp += 2;
+ BREAK;
+ CASE(OP_dup3): /* a b c -> a b c a b c */
+ sp[0] = JS_DupValue(ctx, sp[-3]);
+ sp[1] = JS_DupValue(ctx, sp[-2]);
+ sp[2] = JS_DupValue(ctx, sp[-1]);
+ sp += 3;
+ BREAK;
+ CASE(OP_dup1): /* a b -> a a b */
+ sp[0] = sp[-1];
+ sp[-1] = JS_DupValue(ctx, sp[-2]);
+ sp++;
+ BREAK;
+ CASE(OP_insert2): /* obj a -> a obj a (dup_x1) */
+ sp[0] = sp[-1];
+ sp[-1] = sp[-2];
+ sp[-2] = JS_DupValue(ctx, sp[0]);
+ sp++;
+ BREAK;
+ CASE(OP_insert3): /* obj prop a -> a obj prop a (dup_x2) */
+ sp[0] = sp[-1];
+ sp[-1] = sp[-2];
+ sp[-2] = sp[-3];
+ sp[-3] = JS_DupValue(ctx, sp[0]);
+ sp++;
+ BREAK;
+ CASE(OP_insert4): /* this obj prop a -> a this obj prop a */
+ sp[0] = sp[-1];
+ sp[-1] = sp[-2];
+ sp[-2] = sp[-3];
+ sp[-3] = sp[-4];
+ sp[-4] = JS_DupValue(ctx, sp[0]);
+ sp++;
+ BREAK;
+ CASE(OP_perm3): /* obj a b -> a obj b (213) */
+ {
+ JSValue tmp;
+ tmp = sp[-2];
+ sp[-2] = sp[-3];
+ sp[-3] = tmp;
+ }
+ BREAK;
+ CASE(OP_rot3l): /* x a b -> a b x (231) */
+ {
+ JSValue tmp;
+ tmp = sp[-3];
+ sp[-3] = sp[-2];
+ sp[-2] = sp[-1];
+ sp[-1] = tmp;
+ }
+ BREAK;
+ CASE(OP_rot4l): /* x a b c -> a b c x */
+ {
+ JSValue tmp;
+ tmp = sp[-4];
+ sp[-4] = sp[-3];
+ sp[-3] = sp[-2];
+ sp[-2] = sp[-1];
+ sp[-1] = tmp;
+ }
+ BREAK;
+ CASE(OP_rot5l): /* x a b c d -> a b c d x */
+ {
+ JSValue tmp;
+ tmp = sp[-5];
+ sp[-5] = sp[-4];
+ sp[-4] = sp[-3];
+ sp[-3] = sp[-2];
+ sp[-2] = sp[-1];
+ sp[-1] = tmp;
+ }
+ BREAK;
+ CASE(OP_rot3r): /* a b x -> x a b (312) */
+ {
+ JSValue tmp;
+ tmp = sp[-1];
+ sp[-1] = sp[-2];
+ sp[-2] = sp[-3];
+ sp[-3] = tmp;
+ }
+ BREAK;
+ CASE(OP_perm4): /* obj prop a b -> a obj prop b */
+ {
+ JSValue tmp;
+ tmp = sp[-2];
+ sp[-2] = sp[-3];
+ sp[-3] = sp[-4];
+ sp[-4] = tmp;
+ }
+ BREAK;
+ CASE(OP_perm5): /* this obj prop a b -> a this obj prop b */
+ {
+ JSValue tmp;
+ tmp = sp[-2];
+ sp[-2] = sp[-3];
+ sp[-3] = sp[-4];
+ sp[-4] = sp[-5];
+ sp[-5] = tmp;
+ }
+ BREAK;
+ CASE(OP_swap): /* a b -> b a */
+ {
+ JSValue tmp;
+ tmp = sp[-2];
+ sp[-2] = sp[-1];
+ sp[-1] = tmp;
+ }
+ BREAK;
+ CASE(OP_swap2): /* a b c d -> c d a b */
+ {
+ JSValue tmp1, tmp2;
+ tmp1 = sp[-4];
+ tmp2 = sp[-3];
+ sp[-4] = sp[-2];
+ sp[-3] = sp[-1];
+ sp[-2] = tmp1;
+ sp[-1] = tmp2;
+ }
+ BREAK;
+
+ CASE(OP_fclosure):
+ {
+ JSValue bfunc = JS_DupValue(ctx, b->cpool[get_u32(pc)]);
+ pc += 4;
+ *sp++ = js_closure(ctx, bfunc, var_refs, sf);
+ if (unlikely(JS_IsException(sp[-1])))
+ goto exception;
+ }
+ BREAK;
+#if SHORT_OPCODES
+ CASE(OP_call0):
+ CASE(OP_call1):
+ CASE(OP_call2):
+ CASE(OP_call3):
+ call_argc = opcode - OP_call0;
+ goto has_call_argc;
+#endif
+ CASE(OP_call):
+ CASE(OP_tail_call):
+ {
+ call_argc = get_u16(pc);
+ pc += 2;
+ goto has_call_argc;
+ has_call_argc:
+ call_argv = sp - call_argc;
+ sf->cur_pc = pc;
+ ret_val = JS_CallInternal(ctx, call_argv[-1], JS_UNDEFINED,
+ JS_UNDEFINED, call_argc, call_argv, 0);
+ if (unlikely(JS_IsException(ret_val)))
+ goto exception;
+ if (opcode == OP_tail_call)
+ goto done;
+ for(i = -1; i < call_argc; i++)
+ JS_FreeValue(ctx, call_argv[i]);
+ sp -= call_argc + 1;
+ *sp++ = ret_val;
+ }
+ BREAK;
+ CASE(OP_call_constructor):
+ {
+ call_argc = get_u16(pc);
+ pc += 2;
+ call_argv = sp - call_argc;
+ sf->cur_pc = pc;
+ ret_val = JS_CallConstructorInternal(ctx, call_argv[-2],
+ call_argv[-1],
+ call_argc, call_argv, 0);
+ if (unlikely(JS_IsException(ret_val)))
+ goto exception;
+ for(i = -2; i < call_argc; i++)
+ JS_FreeValue(ctx, call_argv[i]);
+ sp -= call_argc + 2;
+ *sp++ = ret_val;
+ }
+ BREAK;
+ CASE(OP_call_method):
+ CASE(OP_tail_call_method):
+ {
+ call_argc = get_u16(pc);
+ pc += 2;
+ call_argv = sp - call_argc;
+ sf->cur_pc = pc;
+ ret_val = JS_CallInternal(ctx, call_argv[-1], call_argv[-2],
+ JS_UNDEFINED, call_argc, call_argv, 0);
+ if (unlikely(JS_IsException(ret_val)))
+ goto exception;
+ if (opcode == OP_tail_call_method)
+ goto done;
+ for(i = -2; i < call_argc; i++)
+ JS_FreeValue(ctx, call_argv[i]);
+ sp -= call_argc + 2;
+ *sp++ = ret_val;
+ }
+ BREAK;
+ CASE(OP_array_from):
+ {
+ int i, ret;
+
+ call_argc = get_u16(pc);
+ pc += 2;
+ ret_val = JS_NewArray(ctx);
+ if (unlikely(JS_IsException(ret_val)))
+ goto exception;
+ call_argv = sp - call_argc;
+ for(i = 0; i < call_argc; i++) {
+ ret = JS_DefinePropertyValue(ctx, ret_val, __JS_AtomFromUInt32(i), call_argv[i],
+ JS_PROP_C_W_E | JS_PROP_THROW);
+ call_argv[i] = JS_UNDEFINED;
+ if (ret < 0) {
+ JS_FreeValue(ctx, ret_val);
+ goto exception;
+ }
+ }
+ sp -= call_argc;
+ *sp++ = ret_val;
+ }
+ BREAK;
+
+ CASE(OP_apply):
+ {
+ int magic;
+ magic = get_u16(pc);
+ pc += 2;
+
+ ret_val = js_function_apply(ctx, sp[-3], 2, (JSValueConst *)&sp[-2], magic);
+ if (unlikely(JS_IsException(ret_val)))
+ goto exception;
+ JS_FreeValue(ctx, sp[-3]);
+ JS_FreeValue(ctx, sp[-2]);
+ JS_FreeValue(ctx, sp[-1]);
+ sp -= 3;
+ *sp++ = ret_val;
+ }
+ BREAK;
+ CASE(OP_return):
+ ret_val = *--sp;
+ goto done;
+ CASE(OP_return_undef):
+ ret_val = JS_UNDEFINED;
+ goto done;
+
+ CASE(OP_check_ctor_return):
+ /* return TRUE if 'this' should be returned */
+ if (!JS_IsObject(sp[-1])) {
+ if (!JS_IsUndefined(sp[-1])) {
+ JS_ThrowTypeError(ctx, "derived class constructor must return an object or undefined");
+ goto exception;
+ }
+ sp[0] = JS_TRUE;
+ } else {
+ sp[0] = JS_FALSE;
+ }
+ sp++;
+ BREAK;
+ CASE(OP_check_ctor):
+ if (JS_IsUndefined(new_target)) {
+ JS_ThrowTypeError(ctx, "class constructors must be invoked with 'new'");
+ goto exception;
+ }
+ BREAK;
+
+ CASE(OP_throw):
+ JS_Throw(ctx, *--sp);
+ goto exception;
+
+ CASE(OP_throw_var):
+#define JS_THROW_VAR_RO 0
+#define JS_THROW_VAR_REDECL 1
+#define JS_THROW_VAR_UNINITIALIZED 2
+ {
+ JSAtom atom;
+ atom = get_u32(pc);
+ int type = pc[4];
+ pc += 5;
+ if (type == JS_THROW_VAR_RO)
+ JS_ThrowTypeErrorReadOnly(ctx, JS_PROP_THROW, atom);
+ else
+ if (type == JS_THROW_VAR_REDECL)
+ JS_ThrowSyntaxErrorVarRedeclaration(ctx, atom);
+ else
+ if (type == JS_THROW_VAR_UNINITIALIZED)
+ JS_ThrowReferenceErrorUninitialized(ctx, atom);
+ else
+ JS_ThrowInternalError(ctx, "invalid throw var type %d", type);
+ }
+ goto exception;
+
+ CASE(OP_eval):
+ {
+ JSValue obj;
+ int scope_idx;
+
+ scope_idx = get_u16(pc) - 1;
+ pc += 2;
+ obj = sp[-1];
+ sp[-1] = JS_EvalObject(ctx, JS_UNDEFINED, obj,
+ JS_EVAL_TYPE_DIRECT, scope_idx);
+ JS_FreeValue(ctx, obj);
+ if (unlikely(JS_IsException(sp[-1])))
+ goto exception;
+ }
+ BREAK;
+
+ CASE(OP_regexp):
+ {
+ sp[-2] = js_regexp_constructor_internal(ctx, JS_UNDEFINED,
+ sp[-2], sp[-1]);
+ sp--;
+ }
+ BREAK;
+
+ CASE(OP_get_super_ctor):
+ {
+ JSValue proto;
+ proto = JS_DupValue(ctx, JS_GetPrototype(ctx, sp[-1]));
+ if (JS_IsException(proto))
+ goto exception;
+ if (!JS_IsConstructor(ctx, proto)) {
+ JS_FreeValue(ctx, proto);
+ JS_ThrowTypeError(ctx, "not a constructor");
+ goto exception;
+ }
+ JS_FreeValue(ctx, sp[-1]);
+ sp[-1] = proto;
+ }
+ BREAK;
+
+ CASE(OP_get_super):
+ {
+ JSValue proto;
+ proto = JS_DupValue(ctx, JS_GetPrototype(ctx, sp[-1]));
+ if (JS_IsException(proto))
+ goto exception;
+ JS_FreeValue(ctx, sp[-1]);
+ sp[-1] = proto;
+ }
+ BREAK;
+
+ CASE(OP_check_var):
+ {
+ int ret;
+ JSAtom atom;
+ atom = get_u32(pc);
+ pc += 4;
+
+ ret = JS_CheckGlobalVar(ctx, atom);
+ if (ret < 0)
+ goto exception;
+ *sp++ = JS_NewBool(ctx, ret);
+ }
+ BREAK;
+
+ CASE(OP_get_var_undef):
+ CASE(OP_get_var):
+ {
+ JSValue val;
+ JSAtom atom;
+ atom = get_u32(pc);
+ pc += 4;
+
+ val = JS_GetGlobalVar(ctx, atom, opcode - OP_get_var_undef);
+ if (unlikely(JS_IsException(val)))
+ goto exception;
+ *sp++ = val;
+ }
+ BREAK;
+
+ CASE(OP_put_var):
+ CASE(OP_put_var_init):
+ {
+ int ret;
+ JSAtom atom;
+ atom = get_u32(pc);
+ pc += 4;
+
+ ret = JS_SetGlobalVar(ctx, atom, sp[-1], opcode - OP_put_var);
+ sp--;
+ if (unlikely(ret < 0))
+ goto exception;
+ }
+ BREAK;
+
+ CASE(OP_put_var_strict):
+ {
+ int ret;
+ JSAtom atom;
+ atom = get_u32(pc);
+ pc += 4;
+
+ /* sp[-2] is JS_TRUE or JS_FALSE */
+ if (unlikely(!JS_VALUE_GET_INT(sp[-2]))) {
+ JS_ThrowReferenceErrorNotDefined(ctx, atom);
+ goto exception;
+ }
+ ret = JS_SetGlobalVar(ctx, atom, sp[-1], 2);
+ sp -= 2;
+ if (unlikely(ret < 0))
+ goto exception;
+ }
+ BREAK;
+
+ CASE(OP_check_define_var):
+ {
+ JSAtom atom;
+ int flags;
+ atom = get_u32(pc);
+ flags = pc[4];
+ pc += 5;
+ if (JS_CheckDefineGlobalVar(ctx, atom, flags))
+ goto exception;
+ }
+ BREAK;
+ CASE(OP_define_var):
+ {
+ JSAtom atom;
+ int flags;
+ atom = get_u32(pc);
+ flags = pc[4];
+ pc += 5;
+ if (JS_DefineGlobalVar(ctx, atom, flags))
+ goto exception;
+ }
+ BREAK;
+ CASE(OP_define_func):
+ {
+ JSAtom atom;
+ int flags;
+ atom = get_u32(pc);
+ flags = pc[4];
+ pc += 5;
+ if (JS_DefineGlobalFunction(ctx, atom, sp[-1], flags))
+ goto exception;
+ JS_FreeValue(ctx, sp[-1]);
+ sp--;
+ }
+ BREAK;
+
+ CASE(OP_get_loc):
+ {
+ int idx;
+ idx = get_u16(pc);
+ pc += 2;
+ sp[0] = JS_DupValue(ctx, var_buf[idx]);
+ sp++;
+ }
+ BREAK;
+ CASE(OP_put_loc):
+ {
+ int idx;
+ idx = get_u16(pc);
+ pc += 2;
+ set_value(ctx, &var_buf[idx], sp[-1]);
+ sp--;
+ }
+ BREAK;
+ CASE(OP_set_loc):
+ {
+ int idx;
+ idx = get_u16(pc);
+ pc += 2;
+ set_value(ctx, &var_buf[idx], JS_DupValue(ctx, sp[-1]));
+ }
+ BREAK;
+ CASE(OP_get_arg):
+ {
+ int idx;
+ idx = get_u16(pc);
+ pc += 2;
+ sp[0] = JS_DupValue(ctx, arg_buf[idx]);
+ sp++;
+ }
+ BREAK;
+ CASE(OP_put_arg):
+ {
+ int idx;
+ idx = get_u16(pc);
+ pc += 2;
+ set_value(ctx, &arg_buf[idx], sp[-1]);
+ sp--;
+ }
+ BREAK;
+ CASE(OP_set_arg):
+ {
+ int idx;
+ idx = get_u16(pc);
+ pc += 2;
+ set_value(ctx, &arg_buf[idx], JS_DupValue(ctx, sp[-1]));
+ }
+ BREAK;
+
+#if SHORT_OPCODES
+ CASE(OP_get_loc8): *sp++ = JS_DupValue(ctx, var_buf[*pc++]); BREAK;
+ CASE(OP_put_loc8): set_value(ctx, &var_buf[*pc++], *--sp); BREAK;
+ CASE(OP_set_loc8): set_value(ctx, &var_buf[*pc++], JS_DupValue(ctx, sp[-1])); BREAK;
+
+ CASE(OP_get_loc0): *sp++ = JS_DupValue(ctx, var_buf[0]); BREAK;
+ CASE(OP_get_loc1): *sp++ = JS_DupValue(ctx, var_buf[1]); BREAK;
+ CASE(OP_get_loc2): *sp++ = JS_DupValue(ctx, var_buf[2]); BREAK;
+ CASE(OP_get_loc3): *sp++ = JS_DupValue(ctx, var_buf[3]); BREAK;
+ CASE(OP_put_loc0): set_value(ctx, &var_buf[0], *--sp); BREAK;
+ CASE(OP_put_loc1): set_value(ctx, &var_buf[1], *--sp); BREAK;
+ CASE(OP_put_loc2): set_value(ctx, &var_buf[2], *--sp); BREAK;
+ CASE(OP_put_loc3): set_value(ctx, &var_buf[3], *--sp); BREAK;
+ CASE(OP_set_loc0): set_value(ctx, &var_buf[0], JS_DupValue(ctx, sp[-1])); BREAK;
+ CASE(OP_set_loc1): set_value(ctx, &var_buf[1], JS_DupValue(ctx, sp[-1])); BREAK;
+ CASE(OP_set_loc2): set_value(ctx, &var_buf[2], JS_DupValue(ctx, sp[-1])); BREAK;
+ CASE(OP_set_loc3): set_value(ctx, &var_buf[3], JS_DupValue(ctx, sp[-1])); BREAK;
+ CASE(OP_get_arg0): *sp++ = JS_DupValue(ctx, arg_buf[0]); BREAK;
+ CASE(OP_get_arg1): *sp++ = JS_DupValue(ctx, arg_buf[1]); BREAK;
+ CASE(OP_get_arg2): *sp++ = JS_DupValue(ctx, arg_buf[2]); BREAK;
+ CASE(OP_get_arg3): *sp++ = JS_DupValue(ctx, arg_buf[3]); BREAK;
+ CASE(OP_put_arg0): set_value(ctx, &arg_buf[0], *--sp); BREAK;
+ CASE(OP_put_arg1): set_value(ctx, &arg_buf[1], *--sp); BREAK;
+ CASE(OP_put_arg2): set_value(ctx, &arg_buf[2], *--sp); BREAK;
+ CASE(OP_put_arg3): set_value(ctx, &arg_buf[3], *--sp); BREAK;
+ CASE(OP_set_arg0): set_value(ctx, &arg_buf[0], JS_DupValue(ctx, sp[-1])); BREAK;
+ CASE(OP_set_arg1): set_value(ctx, &arg_buf[1], JS_DupValue(ctx, sp[-1])); BREAK;
+ CASE(OP_set_arg2): set_value(ctx, &arg_buf[2], JS_DupValue(ctx, sp[-1])); BREAK;
+ CASE(OP_set_arg3): set_value(ctx, &arg_buf[3], JS_DupValue(ctx, sp[-1])); BREAK;
+ CASE(OP_get_var_ref0): *sp++ = JS_DupValue(ctx, *var_refs[0]->pvalue); BREAK;
+ CASE(OP_get_var_ref1): *sp++ = JS_DupValue(ctx, *var_refs[1]->pvalue); BREAK;
+ CASE(OP_get_var_ref2): *sp++ = JS_DupValue(ctx, *var_refs[2]->pvalue); BREAK;
+ CASE(OP_get_var_ref3): *sp++ = JS_DupValue(ctx, *var_refs[3]->pvalue); BREAK;
+ CASE(OP_put_var_ref0): set_value(ctx, var_refs[0]->pvalue, *--sp); BREAK;
+ CASE(OP_put_var_ref1): set_value(ctx, var_refs[1]->pvalue, *--sp); BREAK;
+ CASE(OP_put_var_ref2): set_value(ctx, var_refs[2]->pvalue, *--sp); BREAK;
+ CASE(OP_put_var_ref3): set_value(ctx, var_refs[3]->pvalue, *--sp); BREAK;
+ CASE(OP_set_var_ref0): set_value(ctx, var_refs[0]->pvalue, JS_DupValue(ctx, sp[-1])); BREAK;
+ CASE(OP_set_var_ref1): set_value(ctx, var_refs[1]->pvalue, JS_DupValue(ctx, sp[-1])); BREAK;
+ CASE(OP_set_var_ref2): set_value(ctx, var_refs[2]->pvalue, JS_DupValue(ctx, sp[-1])); BREAK;
+ CASE(OP_set_var_ref3): set_value(ctx, var_refs[3]->pvalue, JS_DupValue(ctx, sp[-1])); BREAK;
+#endif
+
+ CASE(OP_get_var_ref):
+ {
+ int idx;
+ JSValue val;
+ idx = get_u16(pc);
+ pc += 2;
+ val = *var_refs[idx]->pvalue;
+ sp[0] = JS_DupValue(ctx, val);
+ sp++;
+ }
+ BREAK;
+ CASE(OP_put_var_ref):
+ {
+ int idx;
+ idx = get_u16(pc);
+ pc += 2;
+ set_value(ctx, var_refs[idx]->pvalue, sp[-1]);
+ sp--;
+ }
+ BREAK;
+ CASE(OP_set_var_ref):
+ {
+ int idx;
+ idx = get_u16(pc);
+ pc += 2;
+ set_value(ctx, var_refs[idx]->pvalue, JS_DupValue(ctx, sp[-1]));
+ }
+ BREAK;
+ CASE(OP_get_var_ref_check):
+ {
+ int idx;
+ JSValue val;
+ idx = get_u16(pc);
+ pc += 2;
+ val = *var_refs[idx]->pvalue;
+ if (unlikely(JS_IsUninitialized(val))) {
+ JS_ThrowReferenceErrorUninitialized(ctx, JS_ATOM_NULL);
+ goto exception;
+ }
+ sp[0] = JS_DupValue(ctx, val);
+ sp++;
+ }
+ BREAK;
+ CASE(OP_put_var_ref_check):
+ {
+ int idx;
+ idx = get_u16(pc);
+ pc += 2;
+ if (unlikely(JS_IsUninitialized(*var_refs[idx]->pvalue))) {
+ JS_ThrowReferenceErrorUninitialized(ctx, JS_ATOM_NULL);
+ goto exception;
+ }
+ set_value(ctx, var_refs[idx]->pvalue, sp[-1]);
+ sp--;
+ }
+ BREAK;
+ CASE(OP_put_var_ref_check_init):
+ {
+ int idx;
+ idx = get_u16(pc);
+ pc += 2;
+ if (unlikely(!JS_IsUninitialized(*var_refs[idx]->pvalue))) {
+ JS_ThrowReferenceErrorUninitialized(ctx, JS_ATOM_NULL);
+ goto exception;
+ }
+ set_value(ctx, var_refs[idx]->pvalue, sp[-1]);
+ sp--;
+ }
+ BREAK;
+ CASE(OP_set_loc_uninitialized):
+ {
+ int idx;
+ idx = get_u16(pc);
+ pc += 2;
+ set_value(ctx, &var_buf[idx], JS_UNINITIALIZED);
+ }
+ BREAK;
+ CASE(OP_get_loc_check):
+ {
+ int idx;
+ idx = get_u16(pc);
+ pc += 2;
+ if (unlikely(JS_IsUninitialized(var_buf[idx]))) {
+ JS_ThrowReferenceErrorUninitialized(ctx, JS_ATOM_NULL);
+ goto exception;
+ }
+ sp[0] = JS_DupValue(ctx, var_buf[idx]);
+ sp++;
+ }
+ BREAK;
+ CASE(OP_put_loc_check):
+ {
+ int idx;
+ idx = get_u16(pc);
+ pc += 2;
+ if (unlikely(JS_IsUninitialized(var_buf[idx]))) {
+ JS_ThrowReferenceErrorUninitialized(ctx, JS_ATOM_NULL);
+ goto exception;
+ }
+ set_value(ctx, &var_buf[idx], sp[-1]);
+ sp--;
+ }
+ BREAK;
+ CASE(OP_put_loc_check_init):
+ {
+ int idx;
+ idx = get_u16(pc);
+ pc += 2;
+ if (unlikely(!JS_IsUninitialized(var_buf[idx]))) {
+ JS_ThrowReferenceError(ctx, "'this' can be initialized only once");
+ goto exception;
+ }
+ set_value(ctx, &var_buf[idx], sp[-1]);
+ sp--;
+ }
+ BREAK;
+ CASE(OP_close_loc):
+ {
+ int idx;
+ idx = get_u16(pc);
+ pc += 2;
+ close_lexical_var(ctx, sf, idx, FALSE);
+ }
+ BREAK;
+
+ CASE(OP_make_loc_ref):
+ CASE(OP_make_arg_ref):
+ CASE(OP_make_var_ref_ref):
+ {
+ JSVarRef *var_ref;
+ JSProperty *pr;
+ JSAtom atom;
+ int idx;
+ atom = get_u32(pc);
+ idx = get_u16(pc + 4);
+ pc += 6;
+ *sp++ = JS_NewObjectProto(ctx, JS_NULL);
+ if (unlikely(JS_IsException(sp[-1])))
+ goto exception;
+ if (opcode == OP_make_var_ref_ref) {
+ var_ref = var_refs[idx];
+ var_ref->header.ref_count++;
+ } else {
+ var_ref = get_var_ref(ctx, sf, idx, opcode == OP_make_arg_ref);
+ if (!var_ref)
+ goto exception;
+ }
+ pr = add_property(ctx, JS_VALUE_GET_OBJ(sp[-1]), atom,
+ JS_PROP_WRITABLE | JS_PROP_VARREF);
+ if (!pr) {
+ free_var_ref(ctx->rt, var_ref);
+ goto exception;
+ }
+ pr->u.var_ref = var_ref;
+ *sp++ = JS_AtomToValue(ctx, atom);
+ }
+ BREAK;
+ CASE(OP_make_var_ref):
+ {
+ JSAtom atom;
+ atom = get_u32(pc);
+ pc += 4;
+
+ if (JS_GetGlobalVarRef(ctx, atom, sp))
+ goto exception;
+ sp += 2;
+ }
+ BREAK;
+
+ CASE(OP_goto):
+ pc += (int32_t)get_u32(pc);
+ if (unlikely(js_poll_interrupts(ctx)))
+ goto exception;
+ BREAK;
+#if SHORT_OPCODES
+ CASE(OP_goto16):
+ pc += (int16_t)get_u16(pc);
+ if (unlikely(js_poll_interrupts(ctx)))
+ goto exception;
+ BREAK;
+ CASE(OP_goto8):
+ pc += (int8_t)pc[0];
+ if (unlikely(js_poll_interrupts(ctx)))
+ goto exception;
+ BREAK;
+#endif
+ CASE(OP_if_true):
+ {
+ int res;
+ JSValue op1;
+
+ op1 = sp[-1];
+ pc += 4;
+ if ((uint32_t)JS_VALUE_GET_TAG(op1) <= JS_TAG_UNDEFINED) {
+ res = JS_VALUE_GET_INT(op1);
+ } else {
+ res = JS_ToBoolFree(ctx, op1);
+ }
+ sp--;
+ if (res) {
+ pc += (int32_t)get_u32(pc - 4) - 4;
+ }
+ if (unlikely(js_poll_interrupts(ctx)))
+ goto exception;
+ }
+ BREAK;
+ CASE(OP_if_false):
+ {
+ int res;
+ JSValue op1;
+
+ op1 = sp[-1];
+ pc += 4;
+ if ((uint32_t)JS_VALUE_GET_TAG(op1) <= JS_TAG_UNDEFINED) {
+ res = JS_VALUE_GET_INT(op1);
+ } else {
+ res = JS_ToBoolFree(ctx, op1);
+ }
+ sp--;
+ if (!res) {
+ pc += (int32_t)get_u32(pc - 4) - 4;
+ }
+ if (unlikely(js_poll_interrupts(ctx)))
+ goto exception;
+ }
+ BREAK;
+#if SHORT_OPCODES
+ CASE(OP_if_true8):
+ {
+ int res;
+ JSValue op1;
+
+ op1 = sp[-1];
+ pc += 1;
+ if ((uint32_t)JS_VALUE_GET_TAG(op1) <= JS_TAG_UNDEFINED) {
+ res = JS_VALUE_GET_INT(op1);
+ } else {
+ res = JS_ToBoolFree(ctx, op1);
+ }
+ sp--;
+ if (res) {
+ pc += (int8_t)pc[-1] - 1;
+ }
+ if (unlikely(js_poll_interrupts(ctx)))
+ goto exception;
+ }
+ BREAK;
+ CASE(OP_if_false8):
+ {
+ int res;
+ JSValue op1;
+
+ op1 = sp[-1];
+ pc += 1;
+ if ((uint32_t)JS_VALUE_GET_TAG(op1) <= JS_TAG_UNDEFINED) {
+ res = JS_VALUE_GET_INT(op1);
+ } else {
+ res = JS_ToBoolFree(ctx, op1);
+ }
+ sp--;
+ if (!res) {
+ pc += (int8_t)pc[-1] - 1;
+ }
+ if (unlikely(js_poll_interrupts(ctx)))
+ goto exception;
+ }
+ BREAK;
+#endif
+ CASE(OP_catch):
+ {
+ int32_t diff;
+ diff = get_u32(pc);
+ sp[0] = JS_NewCatchOffset(ctx, pc + diff - b->byte_code_buf);
+ sp++;
+ pc += 4;
+ }
+ BREAK;
+ CASE(OP_gosub):
+ {
+ int32_t diff;
+ diff = get_u32(pc);
+ /* XXX: should have a different tag to avoid security flaw */
+ sp[0] = JS_NewInt32(ctx, pc + 4 - b->byte_code_buf);
+ sp++;
+ pc += diff;
+ }
+ BREAK;
+ CASE(OP_ret):
+ {
+ JSValue op1;
+ uint32_t pos;
+ op1 = sp[-1];
+ if (unlikely(JS_VALUE_GET_TAG(op1) != JS_TAG_INT))
+ goto ret_fail;
+ pos = JS_VALUE_GET_INT(op1);
+ if (unlikely(pos >= b->byte_code_len)) {
+ ret_fail:
+ JS_ThrowInternalError(ctx, "invalid ret value");
+ goto exception;
+ }
+ sp--;
+ pc = b->byte_code_buf + pos;
+ }
+ BREAK;
+
+ CASE(OP_for_in_start):
+ if (js_for_in_start(ctx, sp))
+ goto exception;
+ BREAK;
+ CASE(OP_for_in_next):
+ if (js_for_in_next(ctx, sp))
+ goto exception;
+ sp += 2;
+ BREAK;
+ CASE(OP_for_of_start):
+ if (js_for_of_start(ctx, sp, FALSE))
+ goto exception;
+ sp += 1;
+ *sp++ = JS_NewCatchOffset(ctx, 0);
+ BREAK;
+ CASE(OP_for_of_next):
+ {
+ int offset = -3 - pc[0];
+ pc += 1;
+ if (js_for_of_next(ctx, sp, offset))
+ goto exception;
+ sp += 2;
+ }
+ BREAK;
+ CASE(OP_for_await_of_start):
+ if (js_for_of_start(ctx, sp, TRUE))
+ goto exception;
+ sp += 1;
+ *sp++ = JS_NewCatchOffset(ctx, 0);
+ BREAK;
+ CASE(OP_for_await_of_next):
+ if (js_for_await_of_next(ctx, sp))
+ goto exception;
+ sp += 1;
+ BREAK;
+ CASE(OP_iterator_get_value_done):
+ if (js_iterator_get_value_done(ctx, sp))
+ goto exception;
+ sp += 1;
+ BREAK;
+
+ CASE(OP_iterator_close):
+ sp--; /* drop the catch offset to avoid getting caught by exception */
+ JS_FreeValue(ctx, sp[-1]); /* drop the next method */
+ sp--;
+ if (!JS_IsUndefined(sp[-1])) {
+ if (JS_IteratorClose(ctx, sp[-1], FALSE))
+ goto exception;
+ JS_FreeValue(ctx, sp[-1]);
+ }
+ sp--;
+ BREAK;
+ CASE(OP_iterator_close_return):
+ {
+ JSValue ret_val;
+ /* iter_obj next catch_offset ... ret_val ->
+ ret_eval iter_obj next catch_offset */
+ ret_val = *--sp;
+ while (sp > stack_buf &&
+ JS_VALUE_GET_TAG(sp[-1]) != JS_TAG_CATCH_OFFSET) {
+ JS_FreeValue(ctx, *--sp);
+ }
+ if (unlikely(sp < stack_buf + 3)) {
+ JS_ThrowInternalError(ctx, "iterator_close_return");
+ JS_FreeValue(ctx, ret_val);
+ goto exception;
+ }
+ sp[0] = sp[-1];
+ sp[-1] = sp[-2];
+ sp[-2] = sp[-3];
+ sp[-3] = ret_val;
+ sp++;
+ }
+ BREAK;
+
+ CASE(OP_async_iterator_close):
+ /* iter_obj next catch_offset -> value flag */
+ {
+ JSValue ret, method;
+ int ret_flag;
+ method = JS_GetProperty(ctx, sp[-3], JS_ATOM_return);
+ if (JS_IsException(method))
+ goto exception;
+ if (JS_IsUndefined(method) || JS_IsNull(method)) {
+ ret = JS_UNDEFINED;
+ ret_flag = TRUE;
+ } else {
+ ret = JS_CallFree(ctx, method, sp[-3], 0, NULL);
+ if (JS_IsException(ret))
+ goto exception;
+ ret_flag = FALSE;
+ }
+ JS_FreeValue(ctx, sp[-3]);
+ JS_FreeValue(ctx, sp[-2]);
+ JS_FreeValue(ctx, sp[-1]);
+ sp[-3] = ret;
+ sp[-2] = JS_NewBool(ctx, ret_flag);
+ sp -= 1;
+ }
+ BREAK;
+
+ CASE(OP_async_iterator_next):
+ /* stack: iter_obj next catch_offset val */
+ {
+ JSValue ret;
+ ret = JS_Call(ctx, sp[-3], sp[-4],
+ 1, (JSValueConst *)(sp - 1));
+ if (JS_IsException(ret))
+ goto exception;
+ JS_FreeValue(ctx, sp[-1]);
+ sp[-1] = ret;
+ }
+ BREAK;
+
+ CASE(OP_async_iterator_get):
+ /* stack: iter_obj next catch_offset val */
+ {
+ JSValue method, ret;
+ BOOL ret_flag;
+ int flags;
+ flags = *pc++;
+ if (flags == 2) {
+ JS_ThrowTypeError(ctx, "iterator does not have a throw method");
+ goto exception;
+ }
+ method = JS_GetProperty(ctx, sp[-4], flags ? JS_ATOM_throw : JS_ATOM_return);
+ if (JS_IsException(method))
+ goto exception;
+ if (JS_IsUndefined(method) || JS_IsNull(method)) {
+ ret_flag = TRUE;
+ } else {
+ ret = JS_CallFree(ctx, method, sp[-4],
+ 1, (JSValueConst *)(sp - 1));
+ if (JS_IsException(ret))
+ goto exception;
+ JS_FreeValue(ctx, sp[-1]);
+ sp[-1] = ret;
+ ret_flag = FALSE;
+ }
+ sp[0] = JS_NewBool(ctx, ret_flag);
+ sp += 1;
+ }
+ BREAK;
+
+ CASE(OP_lnot):
+ {
+ int res;
+ JSValue op1;
+
+ op1 = sp[-1];
+ if ((uint32_t)JS_VALUE_GET_TAG(op1) <= JS_TAG_UNDEFINED) {
+ res = JS_VALUE_GET_INT(op1) != 0;
+ } else {
+ res = JS_ToBoolFree(ctx, op1);
+ }
+ sp[-1] = JS_NewBool(ctx, !res);
+ }
+ BREAK;
+
+ CASE(OP_get_field):
+ {
+ JSValue val;
+ JSAtom atom;
+ atom = get_u32(pc);
+ pc += 4;
+
+ val = JS_GetProperty(ctx, sp[-1], atom);
+ if (unlikely(JS_IsException(val)))
+ goto exception;
+ JS_FreeValue(ctx, sp[-1]);
+ sp[-1] = val;
+ }
+ BREAK;
+
+ CASE(OP_get_field2):
+ {
+ JSValue val;
+ JSAtom atom;
+ atom = get_u32(pc);
+ pc += 4;
+
+ val = JS_GetProperty(ctx, sp[-1], atom);
+ if (unlikely(JS_IsException(val)))
+ goto exception;
+ *sp++ = val;
+ }
+ BREAK;
+
+ CASE(OP_put_field):
+ {
+ int ret;
+ JSAtom atom;
+ atom = get_u32(pc);
+ pc += 4;
+
+ ret = JS_SetPropertyInternal(ctx, sp[-2], atom, sp[-1],
+ JS_PROP_THROW_STRICT);
+ JS_FreeValue(ctx, sp[-2]);
+ sp -= 2;
+ if (unlikely(ret < 0))
+ goto exception;
+ }
+ BREAK;
+
+ CASE(OP_define_field):
+ {
+ int ret;
+ JSAtom atom;
+ atom = get_u32(pc);
+ pc += 4;
+
+ ret = JS_DefinePropertyValue(ctx, sp[-2], atom, sp[-1],
+ JS_PROP_C_W_E | JS_PROP_THROW);
+ sp--;
+ if (unlikely(ret < 0))
+ goto exception;
+ }
+ BREAK;
+
+ CASE(OP_set_name):
+ {
+ int ret;
+ JSAtom atom;
+ atom = get_u32(pc);
+ pc += 4;
+
+ ret = JS_DefineObjectName(ctx, sp[-1], atom, JS_PROP_CONFIGURABLE);
+ if (unlikely(ret < 0))
+ goto exception;
+ }
+ BREAK;
+ CASE(OP_set_name_computed):
+ {
+ int ret;
+ ret = JS_DefineObjectNameComputed(ctx, sp[-1], sp[-2], JS_PROP_CONFIGURABLE);
+ if (unlikely(ret < 0))
+ goto exception;
+ }
+ BREAK;
+ CASE(OP_set_proto):
+ {
+ JSValue proto;
+ proto = sp[-1];
+ if (JS_IsObject(proto) || JS_IsNull(proto)) {
+ if (JS_SetPrototypeInternal(ctx, sp[-2], proto, TRUE) < 0)
+ goto exception;
+ }
+ JS_FreeValue(ctx, proto);
+ sp--;
+ }
+ BREAK;
+ CASE(OP_define_method):
+ CASE(OP_define_method_computed):
+ {
+ JSValue getter, setter, value;
+ JSValueConst obj;
+ JSAtom atom;
+ int flags, ret, op_flags;
+ BOOL is_computed;
+#define OP_DEFINE_METHOD_METHOD 0
+#define OP_DEFINE_METHOD_GETTER 1
+#define OP_DEFINE_METHOD_SETTER 2
+#define OP_DEFINE_METHOD_ENUMERABLE 4
+
+ is_computed = (opcode == OP_define_method_computed);
+ if (is_computed) {
+ atom = js_value_to_atom(ctx, sp[-2]);
+ if (unlikely(atom == JS_ATOM_NULL))
+ goto exception;
+ opcode += OP_define_method - OP_define_method_computed;
+ } else {
+ atom = get_u32(pc);
+ pc += 4;
+ }
+ op_flags = *pc++;
+
+ obj = sp[-2 - is_computed];
+ flags = JS_PROP_HAS_CONFIGURABLE | JS_PROP_CONFIGURABLE |
+ JS_PROP_HAS_ENUMERABLE | JS_PROP_THROW;
+ if (op_flags & OP_DEFINE_METHOD_ENUMERABLE)
+ flags |= JS_PROP_ENUMERABLE;
+ op_flags &= 3;
+ value = JS_UNDEFINED;
+ getter = JS_UNDEFINED;
+ setter = JS_UNDEFINED;
+ if (op_flags == OP_DEFINE_METHOD_METHOD) {
+ value = sp[-1];
+ flags |= JS_PROP_HAS_VALUE | JS_PROP_HAS_WRITABLE | JS_PROP_WRITABLE;
+ } else if (op_flags == OP_DEFINE_METHOD_GETTER) {
+ getter = sp[-1];
+ flags |= JS_PROP_HAS_GET;
+ } else {
+ setter = sp[-1];
+ flags |= JS_PROP_HAS_SET;
+ }
+ ret = js_method_set_properties(ctx, sp[-1], atom, flags, obj);
+ if (ret >= 0) {
+ ret = JS_DefineProperty(ctx, obj, atom, value,
+ getter, setter, flags);
+ }
+ JS_FreeValue(ctx, sp[-1]);
+ if (is_computed) {
+ JS_FreeAtom(ctx, atom);
+ JS_FreeValue(ctx, sp[-2]);
+ }
+ sp -= 1 + is_computed;
+ if (unlikely(ret < 0))
+ goto exception;
+ }
+ BREAK;
+
+ CASE(OP_define_class):
+ {
+ int class_flags;
+
+ class_flags = *pc++;
+ if (js_op_define_class(ctx, sp, class_flags,
+ var_refs, sf) < 0)
+ goto exception;
+ }
+ BREAK;
+
+ CASE(OP_get_array_el):
+ {
+ JSValue val;
+
+ val = JS_GetPropertyValue(ctx, sp[-2], sp[-1]);
+ JS_FreeValue(ctx, sp[-2]);
+ sp[-2] = val;
+ sp--;
+ if (unlikely(JS_IsException(val)))
+ goto exception;
+ }
+ BREAK;
+
+ CASE(OP_get_array_el2):
+ {
+ JSValue val;
+
+ val = JS_GetPropertyValue(ctx, sp[-2], sp[-1]);
+ sp[-1] = val;
+ if (unlikely(JS_IsException(val)))
+ goto exception;
+ }
+ BREAK;
+
+ CASE(OP_get_ref_value):
+ {
+ JSValue val;
+ if (unlikely(JS_IsUndefined(sp[-2]))) {
+ JSAtom atom = js_value_to_atom(ctx, sp[-1]);
+ if (atom != JS_ATOM_NULL) {
+ JS_ThrowReferenceErrorNotDefined(ctx, atom);
+ JS_FreeAtom(ctx, atom);
+ }
+ goto exception;
+ }
+ val = JS_GetPropertyValue(ctx, sp[-2],
+ JS_DupValue(ctx, sp[-1]));
+ if (unlikely(JS_IsException(val)))
+ goto exception;
+ sp[0] = val;
+ sp++;
+ }
+ BREAK;
+
+ CASE(OP_get_super_value):
+ {
+ JSValue val;
+ JSAtom atom;
+ atom = js_value_to_atom(ctx, sp[-1]);
+ if (unlikely(atom == JS_ATOM_NULL))
+ goto exception;
+ val = JS_GetPropertyInternal(ctx, sp[-2], atom, sp[-3], FALSE);
+ JS_FreeAtom(ctx, atom);
+ if (unlikely(JS_IsException(val)))
+ goto exception;
+ JS_FreeValue(ctx, sp[-1]);
+ JS_FreeValue(ctx, sp[-2]);
+ JS_FreeValue(ctx, sp[-3]);
+ sp[-3] = val;
+ sp -= 2;
+ }
+ BREAK;
+
+ CASE(OP_put_array_el):
+ {
+ int ret;
+
+ ret = JS_SetPropertyValue(ctx, sp[-3], sp[-2], sp[-1], JS_PROP_THROW_STRICT);
+ JS_FreeValue(ctx, sp[-3]);
+ sp -= 3;
+ if (unlikely(ret < 0))
+ goto exception;
+ }
+ BREAK;
+
+ CASE(OP_put_ref_value):
+ {
+ int ret;
+ if (unlikely(JS_IsUndefined(sp[-3]))) {
+ if (is_strict_mode(ctx)) {
+ JSAtom atom = js_value_to_atom(ctx, sp[-2]);
+ if (atom != JS_ATOM_NULL) {
+ JS_ThrowReferenceErrorNotDefined(ctx, atom);
+ JS_FreeAtom(ctx, atom);
+ }
+ goto exception;
+ } else {
+ sp[-3] = JS_DupValue(ctx, ctx->global_obj);
+ }
+ }
+ ret = JS_SetPropertyValue(ctx, sp[-3], sp[-2], sp[-1], JS_PROP_THROW_STRICT);
+ JS_FreeValue(ctx, sp[-3]);
+ sp -= 3;
+ if (unlikely(ret < 0))
+ goto exception;
+ }
+ BREAK;
+
+ CASE(OP_put_super_value):
+ {
+ int ret;
+ JSAtom atom;
+ if (JS_VALUE_GET_TAG(sp[-3]) != JS_TAG_OBJECT) {
+ JS_ThrowTypeErrorNotAnObject(ctx);
+ goto exception;
+ }
+ atom = js_value_to_atom(ctx, sp[-2]);
+ if (unlikely(atom == JS_ATOM_NULL))
+ goto exception;
+ ret = JS_SetPropertyGeneric(ctx, JS_VALUE_GET_OBJ(sp[-3]),
+ atom, sp[-1], sp[-4],
+ JS_PROP_THROW_STRICT);
+ JS_FreeAtom(ctx, atom);
+ if (ret < 0)
+ goto exception;
+ JS_FreeValue(ctx, sp[-4]);
+ JS_FreeValue(ctx, sp[-3]);
+ JS_FreeValue(ctx, sp[-2]);
+ sp -= 4;
+ }
+ BREAK;
+
+ CASE(OP_define_array_el):
+ {
+ int ret;
+ ret = JS_DefinePropertyValueValue(ctx, sp[-3], JS_DupValue(ctx, sp[-2]), sp[-1],
+ JS_PROP_C_W_E | JS_PROP_THROW);
+ sp -= 1;
+ if (unlikely(ret < 0))
+ goto exception;
+ }
+ BREAK;
+
+ CASE(OP_append): /* array pos enumobj -- array pos */
+ {
+ if (js_append_enumerate(ctx, sp))
+ goto exception;
+ JS_FreeValue(ctx, *--sp);
+ }
+ BREAK;
+
+ CASE(OP_copy_data_properties): /* target source excludeList */
+ {
+ /* stack offsets (-1 based):
+ 2 bits for target,
+ 3 bits for source,
+ 2 bits for exclusionList */
+ int mask;
+
+ mask = *pc++;
+ if (JS_CopyDataProperties(ctx, sp[-1 - (mask & 3)],
+ sp[-1 - ((mask >> 2) & 7)],
+ sp[-1 - ((mask >> 5) & 7)], 0))
+ goto exception;
+ }
+ BREAK;
+
+ CASE(OP_add):
+ {
+ JSValue op1, op2;
+ op1 = sp[-2];
+ op2 = sp[-1];
+ if (likely(JS_VALUE_IS_BOTH_INT(op1, op2))) {
+ int64_t r;
+ r = (int64_t)JS_VALUE_GET_INT(op1) + JS_VALUE_GET_INT(op2);
+ if (unlikely((int)r != r))
+ goto add_slow;
+ sp[-2] = JS_NewInt32(ctx, r);
+ sp--;
+ } else if (JS_VALUE_IS_BOTH_FLOAT(op1, op2)) {
+ sp[-2] = __JS_NewFloat64(ctx, JS_VALUE_GET_FLOAT64(op1) +
+ JS_VALUE_GET_FLOAT64(op2));
+ sp--;
+ } else {
+ add_slow:
+ if (js_add_slow(ctx, sp))
+ goto exception;
+ sp--;
+ }
+ }
+ BREAK;
+ CASE(OP_add_loc):
+ {
+ JSValue ops[2];
+ int idx;
+ idx = *pc;
+ pc += 1;
+
+ ops[0] = var_buf[idx];
+ ops[1] = sp[-1];
+ if (likely(JS_VALUE_IS_BOTH_INT(ops[0], ops[1]))) {
+ int64_t r;
+ r = (int64_t)JS_VALUE_GET_INT(ops[0]) + JS_VALUE_GET_INT(ops[1]);
+ if (unlikely((int)r != r))
+ goto add_loc_slow;
+ var_buf[idx] = JS_NewInt32(ctx, r);
+ sp--;
+ } else if (JS_VALUE_GET_TAG(ops[0]) == JS_TAG_STRING) {
+ ops[0] = JS_ConcatString(ctx, ops[0], ops[1]);
+ sp--;
+ if (JS_IsException(ops[0])) {
+ var_buf[idx] = JS_UNDEFINED;
+ goto exception;
+ }
+ var_buf[idx] = ops[0];
+ } else {
+ add_loc_slow:
+ /* XXX: change API */
+ if (js_add_slow(ctx, ops + 2))
+ goto exception;
+ var_buf[idx] = ops[0];
+ sp--;
+ }
+ }
+ BREAK;
+ CASE(OP_sub):
+ {
+ JSValue op1, op2;
+ op1 = sp[-2];
+ op2 = sp[-1];
+ if (likely(JS_VALUE_IS_BOTH_INT(op1, op2))) {
+ int64_t r;
+ r = (int64_t)JS_VALUE_GET_INT(op1) - JS_VALUE_GET_INT(op2);
+ if (unlikely((int)r != r))
+ goto binary_arith_slow;
+ sp[-2] = JS_NewInt32(ctx, r);
+ sp--;
+ } else if (JS_VALUE_IS_BOTH_FLOAT(op1, op2)) {
+ sp[-2] = __JS_NewFloat64(ctx, JS_VALUE_GET_FLOAT64(op1) -
+ JS_VALUE_GET_FLOAT64(op2));
+ sp--;
+ } else {
+ goto binary_arith_slow;
+ }
+ }
+ BREAK;
+ CASE(OP_mul):
+ {
+ JSValue op1, op2;
+ double d;
+ op1 = sp[-2];
+ op2 = sp[-1];
+ if (likely(JS_VALUE_IS_BOTH_INT(op1, op2))) {
+ int32_t v1, v2;
+ int64_t r;
+ v1 = JS_VALUE_GET_INT(op1);
+ v2 = JS_VALUE_GET_INT(op2);
+ r = (int64_t)v1 * v2;
+#ifdef CONFIG_BIGNUM
+ if (unlikely((int)r != r) || (r == 0 && !is_bignum_mode(ctx)))
+ goto binary_arith_slow;
+#else
+ if (unlikely((int)r != r)) {
+ d = (double)r;
+ goto mul_fp_res;
+ }
+ /* need to test zero case for -0 result */
+ if (unlikely(r == 0 && (v1 | v2) < 0)) {
+ d = -0.0;
+ goto mul_fp_res;
+ }
+#endif
+ sp[-2] = JS_NewInt32(ctx, r);
+ sp--;
+ } else if (JS_VALUE_IS_BOTH_FLOAT(op1, op2)) {
+ d = JS_VALUE_GET_FLOAT64(op1) * JS_VALUE_GET_FLOAT64(op2);
+#ifndef CONFIG_BIGNUM
+ mul_fp_res:
+#endif
+ sp[-2] = __JS_NewFloat64(ctx, d);
+ sp--;
+ } else {
+ goto binary_arith_slow;
+ }
+ }
+ BREAK;
+#ifdef CONFIG_BIGNUM
+ CASE(OP_math_div):
+ CASE(OP_div):
+ goto binary_arith_slow;
+#else
+ CASE(OP_div):
+ {
+ JSValue op1, op2;
+ op1 = sp[-2];
+ op2 = sp[-1];
+ if (likely(JS_VALUE_IS_BOTH_INT(op1, op2))) {
+ int v1, v2;
+ v1 = JS_VALUE_GET_INT(op1);
+ v2 = JS_VALUE_GET_INT(op2);
+ sp[-2] = JS_NewFloat64(ctx, (double)v1 / (double)v2);
+ sp--;
+ } else {
+ goto binary_arith_slow;
+ }
+ }
+ BREAK;
+#endif
+ CASE(OP_mod):
+#ifdef CONFIG_BIGNUM
+ CASE(OP_math_mod):
+#endif
+ {
+ JSValue op1, op2;
+ op1 = sp[-2];
+ op2 = sp[-1];
+ if (likely(JS_VALUE_IS_BOTH_INT(op1, op2))) {
+ int v1, v2, r;
+ v1 = JS_VALUE_GET_INT(op1);
+ v2 = JS_VALUE_GET_INT(op2);
+ /* We must avoid v2 = 0, v1 = INT32_MIN and v2 =
+ -1 and the cases where the result is -0. */
+ if (unlikely(v1 < 0 || v2 <= 0))
+ goto binary_arith_slow;
+ r = v1 % v2;
+ sp[-2] = JS_NewInt32(ctx, r);
+ sp--;
+ } else {
+ goto binary_arith_slow;
+ }
+ }
+ BREAK;
+ CASE(OP_pow):
+#ifdef CONFIG_BIGNUM
+ CASE(OP_math_pow):
+#endif
+ binary_arith_slow:
+ if (js_binary_arith_slow(ctx, sp, opcode))
+ goto exception;
+ sp--;
+ BREAK;
+
+ CASE(OP_plus):
+ {
+ JSValue op1;
+ uint32_t tag;
+ op1 = sp[-1];
+ tag = JS_VALUE_GET_TAG(op1);
+ if (tag == JS_TAG_INT || JS_TAG_IS_FLOAT64(tag)) {
+ } else {
+ if (js_unary_arith_slow(ctx, sp, opcode))
+ goto exception;
+ }
+ }
+ BREAK;
+ CASE(OP_neg):
+ {
+ JSValue op1;
+ uint32_t tag;
+ int val;
+ double d;
+ op1 = sp[-1];
+ tag = JS_VALUE_GET_TAG(op1);
+ if (tag == JS_TAG_INT) {
+ val = JS_VALUE_GET_INT(op1);
+#ifdef CONFIG_BIGNUM
+ if (unlikely(val == INT32_MIN) ||
+ (val == 0 && !is_bignum_mode(ctx)))
+ goto slow_neg;
+#else
+ /* Note: -0 cannot be expressed as integer */
+ if (unlikely(val == 0)) {
+ d = -0.0;
+ goto neg_fp_res;
+ }
+ if (unlikely(val == INT32_MIN)) {
+ d = -(double)val;
+ goto neg_fp_res;
+ }
+#endif
+ sp[-1] = JS_NewInt32(ctx, -val);
+ } else if (JS_TAG_IS_FLOAT64(tag)) {
+ d = -JS_VALUE_GET_FLOAT64(op1);
+#ifndef CONFIG_BIGNUM
+ neg_fp_res:
+#endif
+ sp[-1] = __JS_NewFloat64(ctx, d);
+ } else {
+#ifdef CONFIG_BIGNUM
+ slow_neg:
+#endif
+ if (js_unary_arith_slow(ctx, sp, opcode))
+ goto exception;
+ }
+ }
+ BREAK;
+ CASE(OP_inc):
+ {
+ JSValue op1;
+ int val;
+ op1 = sp[-1];
+ if (JS_VALUE_GET_TAG(op1) == JS_TAG_INT) {
+ val = JS_VALUE_GET_INT(op1);
+ if (unlikely(val == INT32_MAX))
+ goto inc_slow;
+ sp[-1] = JS_NewInt32(ctx, val + 1);
+ } else {
+ inc_slow:
+ if (js_unary_arith_slow(ctx, sp, opcode))
+ goto exception;
+ }
+ }
+ BREAK;
+ CASE(OP_dec):
+ {
+ JSValue op1;
+ int val;
+ op1 = sp[-1];
+ if (JS_VALUE_GET_TAG(op1) == JS_TAG_INT) {
+ val = JS_VALUE_GET_INT(op1);
+ if (unlikely(val == INT32_MIN))
+ goto dec_slow;
+ sp[-1] = JS_NewInt32(ctx, val - 1);
+ } else {
+ dec_slow:
+ if (js_unary_arith_slow(ctx, sp, opcode))
+ goto exception;
+ }
+ }
+ BREAK;
+ CASE(OP_post_inc):
+ CASE(OP_post_dec):
+ if (js_post_inc_slow(ctx, sp, opcode))
+ goto exception;
+ sp++;
+ BREAK;
+ CASE(OP_inc_loc):
+ {
+ JSValue op1;
+ int val;
+ int idx;
+ idx = *pc;
+ pc += 1;
+
+ op1 = var_buf[idx];
+ if (JS_VALUE_GET_TAG(op1) == JS_TAG_INT) {
+ val = JS_VALUE_GET_INT(op1);
+ if (unlikely(val == INT32_MAX))
+ goto inc_loc_slow;
+ var_buf[idx] = JS_NewInt32(ctx, val + 1);
+ } else {
+ inc_loc_slow:
+ if (js_unary_arith_slow(ctx, var_buf + idx + 1, OP_inc))
+ goto exception;
+ }
+ }
+ BREAK;
+ CASE(OP_dec_loc):
+ {
+ JSValue op1;
+ int val;
+ int idx;
+ idx = *pc;
+ pc += 1;
+
+ op1 = var_buf[idx];
+ if (JS_VALUE_GET_TAG(op1) == JS_TAG_INT) {
+ val = JS_VALUE_GET_INT(op1);
+ if (unlikely(val == INT32_MIN))
+ goto dec_loc_slow;
+ var_buf[idx] = JS_NewInt32(ctx, val - 1);
+ } else {
+ dec_loc_slow:
+ if (js_unary_arith_slow(ctx, var_buf + idx + 1, OP_dec))
+ goto exception;
+ }
+ }
+ BREAK;
+ CASE(OP_not):
+ {
+ JSValue op1;
+ op1 = sp[-1];
+ if (JS_VALUE_GET_TAG(op1) == JS_TAG_INT) {
+ sp[-1] = JS_NewInt32(ctx, ~JS_VALUE_GET_INT(op1));
+ } else {
+ if (js_not_slow(ctx, sp))
+ goto exception;
+ }
+ }
+ BREAK;
+
+ CASE(OP_shl):
+ {
+ JSValue op1, op2;
+ op1 = sp[-2];
+ op2 = sp[-1];
+ if (likely(JS_VALUE_IS_BOTH_INT(op1, op2))) {
+ uint32_t v1, v2;
+ v1 = JS_VALUE_GET_INT(op1);
+ v2 = JS_VALUE_GET_INT(op2);
+#ifdef CONFIG_BIGNUM
+ {
+ int64_t r;
+ if (is_bignum_mode(ctx)) {
+ if (v2 > 0x1f)
+ goto shl_slow;
+ r = (int64_t)v1 << v2;
+ if ((int)r != r)
+ goto shl_slow;
+ } else {
+ v2 &= 0x1f;
+ }
+ }
+#else
+ v2 &= 0x1f;
+#endif
+ sp[-2] = JS_NewInt32(ctx, v1 << v2);
+ sp--;
+ } else {
+#ifdef CONFIG_BIGNUM
+ shl_slow:
+#endif
+ if (js_binary_logic_slow(ctx, sp, opcode))
+ goto exception;
+ sp--;
+ }
+ }
+ BREAK;
+ CASE(OP_shr):
+ {
+ JSValue op1, op2;
+ op1 = sp[-2];
+ op2 = sp[-1];
+ if (likely(JS_VALUE_IS_BOTH_INT(op1, op2))) {
+ uint32_t v2;
+ v2 = JS_VALUE_GET_INT(op2);
+ /* v1 >>> v2 retains its JS semantics if CONFIG_BIGNUM */
+ v2 &= 0x1f;
+ sp[-2] = JS_NewUint32(ctx,
+ (uint32_t)JS_VALUE_GET_INT(op1) >>
+ v2);
+ sp--;
+ } else {
+ if (js_shr_slow(ctx, sp))
+ goto exception;
+ sp--;
+ }
+ }
+ BREAK;
+ CASE(OP_sar):
+ {
+ JSValue op1, op2;
+ op1 = sp[-2];
+ op2 = sp[-1];
+ if (likely(JS_VALUE_IS_BOTH_INT(op1, op2))) {
+ uint32_t v2;
+ v2 = JS_VALUE_GET_INT(op2);
+#ifdef CONFIG_BIGNUM
+ if (unlikely(v2 > 0x1f)) {
+ if (is_bignum_mode(ctx))
+ goto sar_slow;
+ else
+ v2 &= 0x1f;
+ }
+#else
+ v2 &= 0x1f;
+#endif
+ sp[-2] = JS_NewInt32(ctx,
+ (int)JS_VALUE_GET_INT(op1) >> v2);
+ sp--;
+ } else {
+#ifdef CONFIG_BIGNUM
+ sar_slow:
+#endif
+ if (js_binary_logic_slow(ctx, sp, opcode))
+ goto exception;
+ sp--;
+ }
+ }
+ BREAK;
+ CASE(OP_and):
+ {
+ JSValue op1, op2;
+ op1 = sp[-2];
+ op2 = sp[-1];
+ if (likely(JS_VALUE_IS_BOTH_INT(op1, op2))) {
+ sp[-2] = JS_NewInt32(ctx,
+ JS_VALUE_GET_INT(op1) &
+ JS_VALUE_GET_INT(op2));
+ sp--;
+ } else {
+ if (js_binary_logic_slow(ctx, sp, opcode))
+ goto exception;
+ sp--;
+ }
+ }
+ BREAK;
+ CASE(OP_or):
+ {
+ JSValue op1, op2;
+ op1 = sp[-2];
+ op2 = sp[-1];
+ if (likely(JS_VALUE_IS_BOTH_INT(op1, op2))) {
+ sp[-2] = JS_NewInt32(ctx,
+ JS_VALUE_GET_INT(op1) |
+ JS_VALUE_GET_INT(op2));
+ sp--;
+ } else {
+ if (js_binary_logic_slow(ctx, sp, opcode))
+ goto exception;
+ sp--;
+ }
+ }
+ BREAK;
+ CASE(OP_xor):
+ {
+ JSValue op1, op2;
+ op1 = sp[-2];
+ op2 = sp[-1];
+ if (likely(JS_VALUE_IS_BOTH_INT(op1, op2))) {
+ sp[-2] = JS_NewInt32(ctx,
+ JS_VALUE_GET_INT(op1) ^
+ JS_VALUE_GET_INT(op2));
+ sp--;
+ } else {
+ if (js_binary_logic_slow(ctx, sp, opcode))
+ goto exception;
+ sp--;
+ }
+ }
+ BREAK;
+
+
+#define OP_CMP(opcode, binary_op, slow_call) \
+ CASE(opcode): \
+ { \
+ JSValue op1, op2; \
+ op1 = sp[-2]; \
+ op2 = sp[-1]; \
+ if (likely(JS_VALUE_IS_BOTH_INT(op1, op2))) { \
+ sp[-2] = JS_NewBool(ctx, JS_VALUE_GET_INT(op1) binary_op JS_VALUE_GET_INT(op2)); \
+ sp--; \
+ } else { \
+ if (slow_call) \
+ goto exception; \
+ sp--; \
+ } \
+ } \
+ BREAK
+
+ OP_CMP(OP_lt, <, js_relational_slow(ctx, sp, opcode));
+ OP_CMP(OP_lte, <=, js_relational_slow(ctx, sp, opcode));
+ OP_CMP(OP_gt, >, js_relational_slow(ctx, sp, opcode));
+ OP_CMP(OP_gte, >=, js_relational_slow(ctx, sp, opcode));
+ OP_CMP(OP_eq, ==, js_eq_slow(ctx, sp, 0));
+ OP_CMP(OP_neq, !=, js_eq_slow(ctx, sp, 1));
+ OP_CMP(OP_strict_eq, ==, js_strict_eq_slow(ctx, sp, 0));
+ OP_CMP(OP_strict_neq, !=, js_strict_eq_slow(ctx, sp, 1));
+
+#ifdef CONFIG_BIGNUM
+ CASE(OP_mul_pow10):
+ if (js_mul_pow10(ctx, sp))
+ goto exception;
+ sp--;
+ BREAK;
+#endif
+ CASE(OP_in):
+ if (js_operator_in(ctx, sp))
+ goto exception;
+ sp--;
+ BREAK;
+ CASE(OP_instanceof):
+ if (js_operator_instanceof(ctx, sp))
+ goto exception;
+ sp--;
+ BREAK;
+ CASE(OP_typeof):
+ {
+ JSValue op1;
+ JSAtom atom;
+
+ op1 = sp[-1];
+ atom = js_operator_typeof(ctx, op1);
+ JS_FreeValue(ctx, op1);
+ sp[-1] = JS_AtomToString(ctx, atom);
+ }
+ BREAK;
+ CASE(OP_delete):
+ if (js_operator_delete(ctx, sp))
+ goto exception;
+ sp--;
+ BREAK;
+ CASE(OP_delete_var):
+ {
+ JSAtom atom;
+ int ret;
+
+ atom = get_u32(pc);
+ pc += 4;
+
+ ret = JS_DeleteProperty(ctx, ctx->global_obj, atom, 0);
+ if (unlikely(ret < 0))
+ goto exception;
+ *sp++ = JS_NewBool(ctx, ret);
+ }
+ BREAK;
+
+ CASE(OP_to_object):
+ if (JS_VALUE_GET_TAG(sp[-1]) != JS_TAG_OBJECT) {
+ ret_val = JS_ToObject(ctx, sp[-1]);
+ if (JS_IsException(ret_val))
+ goto exception;
+ JS_FreeValue(ctx, sp[-1]);
+ sp[-1] = ret_val;
+ }
+ BREAK;
+
+ CASE(OP_to_propkey):
+ switch (JS_VALUE_GET_TAG(sp[-1])) {
+ case JS_TAG_INT:
+ case JS_TAG_STRING:
+ case JS_TAG_SYMBOL:
+ break;
+ default:
+ ret_val = JS_ToPropertyKey(ctx, sp[-1]);
+ if (JS_IsException(ret_val))
+ goto exception;
+ JS_FreeValue(ctx, sp[-1]);
+ sp[-1] = ret_val;
+ break;
+ }
+ BREAK;
+
+ CASE(OP_to_propkey2):
+ /* must be tested first */
+ if (unlikely(JS_IsUndefined(sp[-2]) || JS_IsNull(sp[-2]))) {
+ JS_ThrowTypeError(ctx, "value has no property");
+ goto exception;
+ }
+ switch (JS_VALUE_GET_TAG(sp[-1])) {
+ case JS_TAG_INT:
+ case JS_TAG_STRING:
+ case JS_TAG_SYMBOL:
+ break;
+ default:
+ ret_val = JS_ToPropertyKey(ctx, sp[-1]);
+ if (JS_IsException(ret_val))
+ goto exception;
+ JS_FreeValue(ctx, sp[-1]);
+ sp[-1] = ret_val;
+ break;
+ }
+ BREAK;
+#if 0
+ CASE(OP_to_string):
+ if (JS_VALUE_GET_TAG(sp[-1]) != JS_TAG_STRING) {
+ ret_val = JS_ToString(ctx, sp[-1]);
+ if (JS_IsException(ret_val))
+ goto exception;
+ JS_FreeValue(ctx, sp[-1]);
+ sp[-1] = ret_val;
+ }
+ BREAK;
+#endif
+ CASE(OP_with_get_var):
+ CASE(OP_with_put_var):
+ CASE(OP_with_delete_var):
+ CASE(OP_with_make_ref):
+ CASE(OP_with_get_ref):
+ CASE(OP_with_get_ref_undef):
+ {
+ JSAtom atom;
+ int32_t diff;
+ JSValue obj, val;
+ int ret, is_with;
+ atom = get_u32(pc);
+ diff = get_u32(pc + 4);
+ is_with = pc[8];
+ pc += 9;
+
+ obj = sp[-1];
+ ret = JS_HasProperty(ctx, obj, atom);
+ if (unlikely(ret < 0))
+ goto exception;
+ if (ret) {
+ if (is_with) {
+ ret = js_has_unscopable(ctx, obj, atom);
+ if (unlikely(ret < 0))
+ goto exception;
+ if (ret)
+ goto no_with;
+ }
+ switch (opcode) {
+ case OP_with_get_var:
+ val = JS_GetProperty(ctx, obj, atom);
+ if (unlikely(JS_IsException(val)))
+ goto exception;
+ set_value(ctx, &sp[-1], val);
+ break;
+ case OP_with_put_var:
+ ret = JS_SetPropertyInternal(ctx, obj, atom, sp[-2],
+ JS_PROP_THROW_STRICT);
+ JS_FreeValue(ctx, sp[-1]);
+ sp -= 2;
+ if (unlikely(ret < 0))
+ goto exception;
+ break;
+ case OP_with_delete_var:
+ ret = JS_DeleteProperty(ctx, obj, atom, 0);
+ if (unlikely(ret < 0))
+ goto exception;
+ JS_FreeValue(ctx, sp[-1]);
+ sp[-1] = JS_NewBool(ctx, ret);
+ break;
+ case OP_with_make_ref:
+ /* produce a pair object/propname on the stack */
+ *sp++ = JS_AtomToValue(ctx, atom);
+ break;
+ case OP_with_get_ref:
+ /* produce a pair object/method on the stack */
+ val = JS_GetProperty(ctx, obj, atom);
+ if (unlikely(JS_IsException(val)))
+ goto exception;
+ *sp++ = val;
+ break;
+ case OP_with_get_ref_undef:
+ /* produce a pair undefined/function on the stack */
+ val = JS_GetProperty(ctx, obj, atom);
+ if (unlikely(JS_IsException(val)))
+ goto exception;
+ JS_FreeValue(ctx, sp[-1]);
+ sp[-1] = JS_UNDEFINED;
+ *sp++ = val;
+ break;
+ }
+ pc += diff - 5;
+ } else {
+ no_with:
+ /* if not jumping, drop the object argument */
+ JS_FreeValue(ctx, sp[-1]);
+ sp--;
+ }
+ }
+ BREAK;
+
+ CASE(OP_await):
+ ret_val = JS_NewInt32(ctx, FUNC_RET_AWAIT);
+ goto done_generator;
+ CASE(OP_yield):
+ ret_val = JS_NewInt32(ctx, FUNC_RET_YIELD);
+ goto done_generator;
+ CASE(OP_yield_star):
+ CASE(OP_async_yield_star):
+ ret_val = JS_NewInt32(ctx, FUNC_RET_YIELD_STAR);
+ goto done_generator;
+ CASE(OP_return_async):
+ CASE(OP_initial_yield):
+ ret_val = JS_UNDEFINED;
+ goto done_generator;
+
+ CASE(OP_nop):
+ BREAK;
+#if SHORT_OPCODES
+ CASE(OP_is_undefined):
+ if (JS_VALUE_GET_TAG(sp[-1]) == JS_TAG_UNDEFINED) {
+ goto set_true;
+ } else {
+ goto free_and_set_false;
+ }
+ CASE(OP_is_null):
+ if (JS_VALUE_GET_TAG(sp[-1]) == JS_TAG_NULL) {
+ goto set_true;
+ } else {
+ goto free_and_set_false;
+ }
+ CASE(OP_is_function):
+ if (js_operator_typeof(ctx, sp[-1]) == JS_ATOM_function) {
+ goto free_and_set_true;
+ } else {
+ goto free_and_set_false;
+ }
+ free_and_set_true:
+ JS_FreeValue(ctx, sp[-1]);
+ set_true:
+ sp[-1] = JS_TRUE;
+ BREAK;
+ free_and_set_false:
+ JS_FreeValue(ctx, sp[-1]);
+ sp[-1] = JS_FALSE;
+ BREAK;
+#endif
+ DEFAULT:
+ JS_ThrowInternalError(ctx, "invalid opcode: pc=%u opcode=0x%02x",
+ (int)(pc - b->byte_code_buf - 1), opcode);
+ goto exception;
+ }
+ }
+ exception:
+ if (ctx->exception_needs_backtrace) {
+ /* add the backtrace information now (it is not done
+ before if the exception happens in a bytecode
+ operation */
+ build_backtrace(ctx, ctx->current_exception, NULL, 0, pc);
+ }
+ if (!JS_IsUncatchableError(ctx, ctx->current_exception)) {
+ while (sp > stack_buf) {
+ JSValue val = *--sp;
+ JS_FreeValue(ctx, val);
+ if (JS_VALUE_GET_TAG(val) == JS_TAG_CATCH_OFFSET) {
+ int pos = JS_VALUE_GET_INT(val);
+ if (pos == 0) {
+ /* enumerator: close it with a throw */
+ JS_FreeValue(ctx, sp[-1]); /* drop the next method */
+ sp--;
+ JS_IteratorClose(ctx, sp[-1], TRUE);
+ } else {
+ *sp++ = ctx->current_exception;
+ ctx->current_exception = JS_NULL;
+ pc = b->byte_code_buf + pos;
+ goto restart;
+ }
+ }
+ }
+ }
+ ret_val = JS_EXCEPTION;
+ /* the local variables are freed by the caller in the generator
+ case. Hence the label 'done' should never be reached in a
+ generator function. */
+ if (b->func_kind != JS_FUNC_NORMAL) {
+ done_generator:
+ sf->cur_pc = pc;
+ sf->cur_sp = sp;
+ } else {
+ done:
+ if (unlikely(!list_empty(&sf->var_ref_list))) {
+ /* variable references reference the stack: must close them */
+ close_var_refs(ctx, sf);
+ }
+ /* free the local variables and stack */
+ for(pval = local_buf; pval < sp; pval++) {
+ JS_FreeValue(ctx, *pval);
+ }
+ }
+ ctx->current_stack_frame = sf->prev_frame;
+ return ret_val;
+}
+
+JSValue JS_Call(JSContext *ctx, JSValueConst func_obj, JSValueConst this_obj,
+ int argc, JSValueConst *argv)
+{
+ return JS_CallInternal(ctx, func_obj, this_obj, JS_UNDEFINED,
+ argc, (JSValue *)argv, CALL_FLAG_COPY_ARGV);
+}
+
+static JSValue JS_CallFree(JSContext *ctx, JSValue func_obj, JSValueConst this_obj,
+ int argc, JSValueConst *argv)
+{
+ JSValue res = JS_CallInternal(ctx, func_obj, this_obj, JS_UNDEFINED,
+ argc, (JSValue *)argv, CALL_FLAG_COPY_ARGV);
+ JS_FreeValue(ctx, func_obj);
+ return res;
+}
+
+static JSValue js_get_prototype_from_ctor(JSContext *ctx, JSValueConst ctor,
+ JSValueConst def_proto)
+{
+ JSValue proto;
+ proto = JS_GetProperty(ctx, ctor, JS_ATOM_prototype);
+ if (JS_IsException(proto))
+ return proto;
+ if (!JS_IsObject(proto)) {
+ JS_FreeValue(ctx, proto);
+ proto = JS_DupValue(ctx, def_proto);
+ }
+ return proto;
+}
+
+static JSValue js_create_from_ctor(JSContext *ctx, JSValueConst ctor,
+ int class_id)
+{
+ JSValue proto, obj;
+ if (JS_IsUndefined(ctor)) {
+ proto = JS_DupValue(ctx, ctx->class_proto[class_id]);
+ } else {
+ proto = JS_GetProperty(ctx, ctor, JS_ATOM_prototype);
+ if (JS_IsException(proto))
+ return proto;
+ if (!JS_IsObject(proto)) {
+ JS_FreeValue(ctx, proto);
+ /* check if revoked proxy */
+ {
+ JSProxyData *s = JS_GetOpaque(ctor, JS_CLASS_PROXY);
+ if (s && JS_IsNull(s->handler))
+ return JS_ThrowTypeError(ctx, "revoked proxy");
+ }
+ /* XXX: should use the ctor realm instead of 'ctx' */
+ proto = JS_DupValue(ctx, ctx->class_proto[class_id]);
+ }
+ }
+ obj = JS_NewObjectProtoClass(ctx, proto, class_id);
+ JS_FreeValue(ctx, proto);
+ return obj;
+}
+
+/* argv[] is modified if (flags & CALL_FLAG_COPY_ARGV) = 0. */
+static JSValue JS_CallConstructorInternal(JSContext *ctx,
+ JSValueConst func_obj,
+ JSValueConst new_target,
+ int argc, JSValue *argv, int flags)
+{
+ JSObject *p;
+ JSFunctionBytecode *b;
+
+ if (js_poll_interrupts(ctx))
+ return JS_EXCEPTION;
+ flags |= CALL_FLAG_CONSTRUCTOR;
+ if (unlikely(JS_VALUE_GET_TAG(func_obj) != JS_TAG_OBJECT))
+ goto not_a_function;
+ p = JS_VALUE_GET_OBJ(func_obj);
+ if (unlikely(!p->is_constructor))
+ return JS_ThrowTypeError(ctx, "not a constructor");
+ if (unlikely(p->class_id != JS_CLASS_BYTECODE_FUNCTION)) {
+ switch(p->class_id) {
+ case JS_CLASS_C_FUNCTION:
+ return js_call_c_function(ctx, func_obj, new_target,
+ argc, (JSValueConst *)argv, flags);
+ case JS_CLASS_BOUND_FUNCTION:
+ return js_call_bound_function(ctx, func_obj, new_target, argc,
+ (JSValueConst *)argv, flags);
+ case JS_CLASS_PROXY:
+ return js_proxy_call_constructor(ctx, func_obj, new_target, argc,
+ (JSValueConst *)argv);
+ default:
+ not_a_function:
+ return JS_ThrowTypeError(ctx, "not a function");
+ }
+ }
+
+ b = p->u.func.function_bytecode;
+ if (b->is_derived_class_constructor) {
+ return JS_CallInternal(ctx, func_obj, JS_UNDEFINED, new_target, argc, argv, flags);
+ } else {
+ JSValue obj, ret;
+ /* legacy constructor behavior */
+ obj = js_create_from_ctor(ctx, new_target, JS_CLASS_OBJECT);
+ if (JS_IsException(obj))
+ return JS_EXCEPTION;
+ ret = JS_CallInternal(ctx, func_obj, obj, new_target, argc, argv, flags);
+ if (JS_VALUE_GET_TAG(ret) == JS_TAG_OBJECT ||
+ JS_IsException(ret)) {
+ JS_FreeValue(ctx, obj);
+ return ret;
+ } else {
+ JS_FreeValue(ctx, ret);
+ return obj;
+ }
+ }
+}
+
+JSValue JS_CallConstructor2(JSContext *ctx, JSValueConst func_obj,
+ JSValueConst new_target,
+ int argc, JSValueConst *argv)
+{
+ return JS_CallConstructorInternal(ctx, func_obj, new_target,
+ argc, (JSValue *)argv,
+ CALL_FLAG_COPY_ARGV);
+}
+
+JSValue JS_CallConstructor(JSContext *ctx, JSValueConst func_obj,
+ int argc, JSValueConst *argv)
+{
+ return JS_CallConstructorInternal(ctx, func_obj, func_obj,
+ argc, (JSValue *)argv,
+ CALL_FLAG_COPY_ARGV);
+}
+
+JSValue JS_Invoke(JSContext *ctx, JSValueConst this_val, JSAtom atom,
+ int argc, JSValueConst *argv)
+{
+ JSValue func_obj;
+ func_obj = JS_GetProperty(ctx, this_val, atom);
+ if (JS_IsException(func_obj))
+ return func_obj;
+ return JS_CallFree(ctx, func_obj, this_val, argc, argv);
+}
+
+static JSValue JS_InvokeFree(JSContext *ctx, JSValue this_val, JSAtom atom,
+ int argc, JSValueConst *argv)
+{
+ JSValue res = JS_Invoke(ctx, this_val, atom, argc, argv);
+ JS_FreeValue(ctx, this_val);
+ return res;
+}
+
+/* JSAsyncFunctionState (used by generator and async functions) */
+static __exception int async_func_init(JSContext *ctx, JSAsyncFunctionState *s,
+ JSValueConst func_obj, JSValueConst this_obj,
+ int argc, JSValueConst *argv)
+{
+ JSObject *p;
+ JSFunctionBytecode *b;
+ JSStackFrame *sf;
+ int local_count, i, arg_buf_len, n;
+
+ sf = &s->frame;
+ init_list_head(&sf->var_ref_list);
+ p = JS_VALUE_GET_OBJ(func_obj);
+ b = p->u.func.function_bytecode;
+ sf->js_mode = b->js_mode;
+ sf->cur_pc = b->byte_code_buf;
+ arg_buf_len = max_int(b->arg_count, argc);
+ local_count = arg_buf_len + b->var_count + b->stack_size;
+ sf->arg_buf = js_malloc(ctx, sizeof(JSValue) * local_count);
+ if (!sf->arg_buf && local_count != 0)
+ return -1;
+ sf->cur_func = JS_DupValue(ctx, func_obj);
+ s->this_val = JS_DupValue(ctx, this_obj);
+ s->argc = argc;
+ sf->arg_count = arg_buf_len;
+ sf->var_buf = sf->arg_buf + arg_buf_len;
+ sf->cur_sp = sf->var_buf + b->var_count;
+ for(i = 0; i < argc; i++)
+ sf->arg_buf[i] = JS_DupValue(ctx, argv[i]);
+ n = arg_buf_len + b->var_count;
+ for(i = argc; i < n; i++)
+ sf->arg_buf[i] = JS_UNDEFINED;
+ return 0;
+}
+
+static void async_func_mark(JSRuntime *rt, JSAsyncFunctionState *s,
+ JS_MarkFunc *mark_func)
+{
+ JSStackFrame *sf;
+ JSValue *sp;
+
+ sf = &s->frame;
+ JS_MarkValue(rt, sf->cur_func, mark_func);
+ JS_MarkValue(rt, s->this_val, mark_func);
+ if (sf->cur_sp) {
+ /* if the function is running, cur_sp is not known so we
+ cannot mark the stack. Marking the variables is not needed
+ because a running function cannot be part of a removable
+ cycle */
+ for(sp = sf->arg_buf; sp < sf->cur_sp; sp++)
+ JS_MarkValue(rt, *sp, mark_func);
+ }
+}
+
+static void async_func_free(JSRuntime *rt, JSAsyncFunctionState *s)
+{
+ JSStackFrame *sf;
+ JSValue *sp;
+
+ sf = &s->frame;
+ if (sf->arg_buf) {
+ /* cannot free the function if it is running */
+ assert(sf->cur_sp != NULL);
+ for(sp = sf->arg_buf; sp < sf->cur_sp; sp++) {
+ JS_FreeValueRT(rt, *sp);
+ }
+ js_free_rt(rt, sf->arg_buf);
+ }
+ JS_FreeValueRT(rt, sf->cur_func);
+ JS_FreeValueRT(rt, s->this_val);
+}
+
+/* close the closure variables */
+static void async_func_detach(JSContext *ctx, JSAsyncFunctionState *s)
+{
+ JSStackFrame *sf = &s->frame;
+ close_var_refs(ctx, sf);
+}
+
+static JSValue async_func_resume(JSContext *ctx, JSAsyncFunctionState *s)
+{
+ JSValue func_obj;
+
+ /* the tag does not matter provided it is not an object */
+ func_obj = JS_MKPTR(JS_TAG_INT, s);
+ return JS_CallInternal(ctx, func_obj, s->this_val, JS_UNDEFINED,
+ s->argc, s->frame.arg_buf, CALL_FLAG_GENERATOR);
+}
+
+
+/* Generators */
+
+typedef enum JSGeneratorStateEnum {
+ JS_GENERATOR_STATE_SUSPENDED_START,
+ JS_GENERATOR_STATE_SUSPENDED_YIELD,
+ JS_GENERATOR_STATE_SUSPENDED_YIELD_STAR,
+ JS_GENERATOR_STATE_EXECUTING,
+ JS_GENERATOR_STATE_COMPLETED,
+} JSGeneratorStateEnum;
+
+typedef struct JSGeneratorData {
+ JSGeneratorStateEnum state;
+ JSAsyncFunctionState func_state;
+} JSGeneratorData;
+
+static void free_generator_stack_rt(JSRuntime *rt, JSGeneratorData *s)
+{
+ if (s->state == JS_GENERATOR_STATE_COMPLETED)
+ return;
+ async_func_free(rt, &s->func_state);
+ s->state = JS_GENERATOR_STATE_COMPLETED;
+}
+
+static void js_generator_finalizer(JSRuntime *rt, JSValue obj)
+{
+ JSGeneratorData *s = JS_GetOpaque(obj, JS_CLASS_GENERATOR);
+
+ if (s) {
+ free_generator_stack_rt(rt, s);
+ js_free_rt(rt, s);
+ }
+}
+
+static void free_generator_stack(JSContext *ctx, JSGeneratorData *s)
+{
+ if (s->state != JS_GENERATOR_STATE_COMPLETED) {
+ /* detach the closures variables */
+ async_func_detach(ctx, &s->func_state);
+ free_generator_stack_rt(ctx->rt, s);
+ }
+}
+
+static void js_generator_mark(JSRuntime *rt, JSValueConst val,
+ JS_MarkFunc *mark_func)
+{
+ JSObject *p = JS_VALUE_GET_OBJ(val);
+ JSGeneratorData *s = p->u.generator_data;
+
+ if (!s || s->state == JS_GENERATOR_STATE_COMPLETED)
+ return;
+ async_func_mark(rt, &s->func_state, mark_func);
+}
+
+/* XXX: use enum */
+#define GEN_MAGIC_NEXT 0
+#define GEN_MAGIC_RETURN 1
+#define GEN_MAGIC_THROW 2
+
+static JSValue js_generator_next(JSContext *ctx, JSValueConst this_val,
+ int argc, JSValueConst *argv,
+ BOOL *pdone, int magic)
+{
+ JSGeneratorData *s = JS_GetOpaque(this_val, JS_CLASS_GENERATOR);
+ JSStackFrame *sf;
+ JSValue ret, func_ret;
+ JSValueConst iter_args[1];
+
+ *pdone = TRUE;
+ if (!s)
+ return JS_ThrowTypeError(ctx, "not a generator");
+ sf = &s->func_state.frame;
+ redo:
+ switch(s->state) {
+ default:
+ case JS_GENERATOR_STATE_SUSPENDED_START:
+ if (magic == GEN_MAGIC_NEXT) {
+ goto exec_no_arg;
+ } else {
+ free_generator_stack(ctx, s);
+ goto done;
+ }
+ break;
+ case JS_GENERATOR_STATE_SUSPENDED_YIELD_STAR:
+ {
+ int done;
+ JSValue method, iter_obj;
+
+ iter_obj = sf->cur_sp[-2];
+ if (magic == GEN_MAGIC_NEXT) {
+ method = JS_DupValue(ctx, sf->cur_sp[-1]);
+ } else {
+ method = JS_GetProperty(ctx, iter_obj,
+ magic == GEN_MAGIC_RETURN ?
+ JS_ATOM_return : JS_ATOM_throw);
+ if (JS_IsException(method))
+ goto iter_exception;
+ }
+ if (magic != GEN_MAGIC_NEXT &&
+ (JS_IsUndefined(method) || JS_IsNull(method))) {
+ /* default action */
+ if (magic == GEN_MAGIC_RETURN) {
+ ret = JS_DupValue(ctx, argv[0]);
+ goto iter_done;
+ } else {
+ if (JS_IteratorClose(ctx, iter_obj, FALSE))
+ goto iter_exception;
+ JS_ThrowTypeError(ctx, "iterator does not have a throw method");
+ goto iter_exception;
+ }
+ }
+ ret = JS_IteratorNext2(ctx, iter_obj, method, argc, argv, &done);
+ JS_FreeValue(ctx, method);
+ if (JS_IsException(ret)) {
+ iter_exception:
+ goto exec_throw;
+ }
+ /* if not done, the iterator returns the exact object
+ returned by 'method' */
+ if (done == 2) {
+ JSValue done_val, value;
+ done_val = JS_GetProperty(ctx, ret, JS_ATOM_done);
+ if (JS_IsException(done_val)) {
+ JS_FreeValue(ctx, ret);
+ goto iter_exception;
+ }
+ done = JS_ToBoolFree(ctx, done_val);
+ if (done) {
+ value = JS_GetProperty(ctx, ret, JS_ATOM_value);
+ JS_FreeValue(ctx, ret);
+ if (JS_IsException(value))
+ goto iter_exception;
+ ret = value;
+ goto iter_done;
+ } else {
+ *pdone = 2;
+ }
+ } else {
+ if (done) {
+ /* 'yield *' returns the value associated to done = true */
+ iter_done:
+ JS_FreeValue(ctx, sf->cur_sp[-2]);
+ JS_FreeValue(ctx, sf->cur_sp[-1]);
+ sf->cur_sp--;
+ goto exec_arg;
+ } else {
+ *pdone = FALSE;
+ }
+ }
+ break;
+ }
+ break;
+ case JS_GENERATOR_STATE_SUSPENDED_YIELD:
+ /* cur_sp[-1] was set to JS_UNDEFINED in the previous call */
+ ret = JS_DupValue(ctx, argv[0]);
+ if (magic == GEN_MAGIC_THROW) {
+ JS_Throw(ctx, ret);
+ exec_throw:
+ s->func_state.throw_flag = TRUE;
+ } else {
+ exec_arg:
+ sf->cur_sp[-1] = ret;
+ sf->cur_sp[0] = JS_NewBool(ctx, (magic == GEN_MAGIC_RETURN));
+ sf->cur_sp++;
+ exec_no_arg:
+ s->func_state.throw_flag = FALSE;
+ }
+ s->state = JS_GENERATOR_STATE_EXECUTING;
+ func_ret = async_func_resume(ctx, &s->func_state);
+ s->state = JS_GENERATOR_STATE_SUSPENDED_YIELD;
+ if (JS_IsException(func_ret)) {
+ /* finalize the execution in case of exception */
+ free_generator_stack(ctx, s);
+ return func_ret;
+ }
+ if (JS_VALUE_GET_TAG(func_ret) == JS_TAG_INT) {
+ if (JS_VALUE_GET_INT(func_ret) == FUNC_RET_YIELD_STAR) {
+ /* 'yield *' */
+ s->state = JS_GENERATOR_STATE_SUSPENDED_YIELD_STAR;
+ iter_args[0] = JS_UNDEFINED;
+ argc = 1;
+ argv = iter_args;
+ goto redo;
+ } else {
+ /* get the return the yield value at the top of the stack */
+ ret = sf->cur_sp[-1];
+ sf->cur_sp[-1] = JS_UNDEFINED;
+ *pdone = FALSE;
+ }
+ } else {
+ /* end of iterator */
+ ret = sf->cur_sp[-1];
+ sf->cur_sp[-1] = JS_UNDEFINED;
+ JS_FreeValue(ctx, func_ret);
+ free_generator_stack(ctx, s);
+ }
+ break;
+ case JS_GENERATOR_STATE_COMPLETED:
+ done:
+ /* execution is finished */
+ switch(magic) {
+ default:
+ case GEN_MAGIC_NEXT:
+ ret = JS_UNDEFINED;
+ break;
+ case GEN_MAGIC_RETURN:
+ ret = JS_DupValue(ctx, argv[0]);
+ break;
+ case GEN_MAGIC_THROW:
+ ret = JS_Throw(ctx, JS_DupValue(ctx, argv[0]));
+ break;
+ }
+ break;
+ case JS_GENERATOR_STATE_EXECUTING:
+ ret = JS_ThrowTypeError(ctx, "cannot invoke a running generator");
+ break;
+ }
+ return ret;
+}
+
+static JSValue js_generator_function_call(JSContext *ctx, JSValueConst func_obj,
+ JSValueConst this_obj,
+ int argc, JSValueConst *argv)
+{
+ JSValue obj, func_ret;
+ JSGeneratorData *s;
+
+ s = js_mallocz(ctx, sizeof(*s));
+ if (!s)
+ return JS_EXCEPTION;
+ s->state = JS_GENERATOR_STATE_SUSPENDED_START;
+ if (async_func_init(ctx, &s->func_state, func_obj, this_obj, argc, argv)) {
+ s->state = JS_GENERATOR_STATE_COMPLETED;
+ goto fail;
+ }
+
+ /* execute the function up to 'OP_initial_yield' */
+ func_ret = async_func_resume(ctx, &s->func_state);
+ if (JS_IsException(func_ret))
+ goto fail;
+ JS_FreeValue(ctx, func_ret);
+
+ obj = js_create_from_ctor(ctx, func_obj, JS_CLASS_GENERATOR);
+ if (JS_IsException(obj))
+ goto fail;
+ JS_SetOpaque(obj, s);
+ return obj;
+ fail:
+ free_generator_stack_rt(ctx->rt, s);
+ js_free(ctx, s);
+ return JS_EXCEPTION;
+}
+
+/* AsyncFunction */
+
+static void js_async_function_terminate(JSRuntime *rt, JSContext *ctx,
+ JSAsyncFunctionData *s)
+{
+ if (s->is_active) {
+ if (ctx)
+ async_func_detach(ctx, &s->func_state);
+ async_func_free(rt, &s->func_state);
+ s->is_active = FALSE;
+ }
+}
+
+/* ctx can be NULL */
+static void js_async_function_free(JSRuntime *rt, JSContext *ctx,
+ JSAsyncFunctionData *s)
+{
+ if (--s->header.ref_count == 0) {
+ js_async_function_terminate(rt, ctx, s);
+ JS_FreeValueRT(rt, s->resolving_funcs[0]);
+ JS_FreeValueRT(rt, s->resolving_funcs[1]);
+ js_free_rt(rt, s);
+ }
+}
+
+static void js_async_function_resolve_finalizer(JSRuntime *rt, JSValue val)
+{
+ JSObject *p = JS_VALUE_GET_OBJ(val);
+ JSAsyncFunctionData *s = p->u.async_function_data;
+ if (s) {
+ js_async_function_free(rt, NULL, s);
+ }
+}
+
+static void js_async_function_resolve_mark(JSRuntime *rt, JSValueConst val,
+ JS_MarkFunc *mark_func)
+{
+ JSObject *p = JS_VALUE_GET_OBJ(val);
+ JSAsyncFunctionData *s = p->u.async_function_data;
+ if (s) {
+ JS_MarkValue(rt, JS_MKPTR(JS_TAG_ASYNC_FUNCTION, s), mark_func);
+ }
+}
+
+static int js_async_function_resolve_create(JSContext *ctx,
+ JSAsyncFunctionData *s,
+ JSValue *resolving_funcs)
+{
+ int i;
+ JSObject *p;
+
+ for(i = 0; i < 2; i++) {
+ resolving_funcs[i] =
+ JS_NewObjectProtoClass(ctx, ctx->function_proto,
+ JS_CLASS_ASYNC_FUNCTION_RESOLVE + i);
+ if (JS_IsException(resolving_funcs[i])) {
+ if (i == 1)
+ JS_FreeValue(ctx, resolving_funcs[0]);
+ return -1;
+ }
+ p = JS_VALUE_GET_OBJ(resolving_funcs[i]);
+ s->header.ref_count++;
+ p->u.async_function_data = s;
+ }
+ return 0;
+}
+
+static void js_async_function_resume(JSContext *ctx, JSAsyncFunctionData *s)
+{
+ JSValue func_ret, ret2;
+
+ func_ret = async_func_resume(ctx, &s->func_state);
+ if (JS_IsException(func_ret)) {
+ JSValue error;
+ fail:
+ error = JS_GetException(ctx);
+ ret2 = JS_Call(ctx, s->resolving_funcs[1], JS_UNDEFINED,
+ 1, (JSValueConst *)&error);
+ JS_FreeValue(ctx, error);
+ js_async_function_terminate(ctx->rt, ctx, s);
+ JS_FreeValue(ctx, ret2); /* XXX: what to do if exception ? */
+ } else {
+ JSValue value;
+ value = s->func_state.frame.cur_sp[-1];
+ s->func_state.frame.cur_sp[-1] = JS_UNDEFINED;
+ if (JS_IsUndefined(func_ret)) {
+ /* function returned */
+ ret2 = JS_Call(ctx, s->resolving_funcs[0], JS_UNDEFINED,
+ 1, (JSValueConst *)&value);
+ JS_FreeValue(ctx, ret2); /* XXX: what to do if exception ? */
+ JS_FreeValue(ctx, value);
+ js_async_function_terminate(ctx->rt, ctx, s);
+ } else {
+ JSValue promise, resolving_funcs[2], resolving_funcs1[2];
+ int i, res;
+
+ /* await */
+ JS_FreeValue(ctx, func_ret); /* not used */
+ promise = js_new_promise_capability(ctx, resolving_funcs, JS_UNDEFINED);
+ if (JS_IsException(promise))
+ goto fail;
+ ret2 = JS_Call(ctx, resolving_funcs[0], JS_UNDEFINED,
+ 1, (JSValueConst *)&value);
+ JS_FreeValue(ctx, resolving_funcs[0]);
+ JS_FreeValue(ctx, resolving_funcs[1]);
+ JS_FreeValue(ctx, value);
+ if (JS_IsException(ret2)) {
+ JS_FreeValue(ctx, promise);
+ goto fail;
+ }
+ JS_FreeValue(ctx, ret2);
+
+ if (js_async_function_resolve_create(ctx, s, resolving_funcs)) {
+ JS_FreeValue(ctx, promise);
+ goto fail;
+ }
+
+ /* Note: no need to create 'thrownawayCapability' as in
+ the spec */
+ for(i = 0; i < 2; i++)
+ resolving_funcs1[i] = JS_UNDEFINED;
+ res = perform_promise_then(ctx, promise,
+ (JSValueConst *)resolving_funcs,
+ (JSValueConst *)resolving_funcs1);
+ JS_FreeValue(ctx, promise);
+ for(i = 0; i < 2; i++)
+ JS_FreeValue(ctx, resolving_funcs[i]);
+ if (res)
+ goto fail;
+ }
+ }
+}
+
+static JSValue js_async_function_resolve_call(JSContext *ctx,
+ JSValueConst func_obj,
+ JSValueConst this_obj,
+ int argc, JSValueConst *argv)
+{
+ JSObject *p = JS_VALUE_GET_OBJ(func_obj);
+ JSAsyncFunctionData *s = p->u.async_function_data;
+ BOOL is_reject = p->class_id - JS_CLASS_ASYNC_FUNCTION_RESOLVE;
+ JSValueConst arg;
+
+ if (argc > 0)
+ arg = argv[0];
+ else
+ arg = JS_UNDEFINED;
+ s->func_state.throw_flag = is_reject;
+ if (is_reject) {
+ JS_Throw(ctx, JS_DupValue(ctx, arg));
+ } else {
+ /* return value of await */
+ s->func_state.frame.cur_sp[-1] = JS_DupValue(ctx, arg);
+ }
+ js_async_function_resume(ctx, s);
+ return JS_UNDEFINED;
+}
+
+static JSValue js_async_function_call(JSContext *ctx, JSValueConst func_obj,
+ JSValueConst this_obj,
+ int argc, JSValueConst *argv)
+{
+ JSValue promise;
+ JSAsyncFunctionData *s;
+
+ s = js_mallocz(ctx, sizeof(*s));
+ if (!s)
+ return JS_EXCEPTION;
+ s->header.ref_count = 1;
+ s->gc_header.mark = 0;
+ s->is_active = FALSE;
+ s->resolving_funcs[0] = JS_UNDEFINED;
+ s->resolving_funcs[1] = JS_UNDEFINED;
+
+ promise = js_new_promise_capability(ctx, s->resolving_funcs, JS_UNDEFINED);
+ if (JS_IsException(promise))
+ goto fail;
+
+ if (async_func_init(ctx, &s->func_state, func_obj, this_obj, argc, argv)) {
+ fail:
+ JS_FreeValue(ctx, promise);
+ js_async_function_free(ctx->rt, ctx, s);
+ return JS_EXCEPTION;
+ }
+ s->is_active = TRUE;
+
+ js_async_function_resume(ctx, s);
+
+ js_async_function_free(ctx->rt, ctx, s);
+
+ return promise;
+}
+
+/* AsyncGenerator */
+
+typedef enum JSAsyncGeneratorStateEnum {
+ JS_ASYNC_GENERATOR_STATE_SUSPENDED_START,
+ JS_ASYNC_GENERATOR_STATE_SUSPENDED_YIELD,
+ JS_ASYNC_GENERATOR_STATE_SUSPENDED_YIELD_STAR,
+ JS_ASYNC_GENERATOR_STATE_EXECUTING,
+ JS_ASYNC_GENERATOR_STATE_AWAITING_RETURN,
+ JS_ASYNC_GENERATOR_STATE_COMPLETED,
+} JSAsyncGeneratorStateEnum;
+
+typedef struct JSAsyncGeneratorRequest {
+ struct list_head link;
+ /* completion */
+ int completion_type; /* GEN_MAGIC_x */
+ JSValue result;
+ /* promise capability */
+ JSValue promise;
+ JSValue resolving_funcs[2];
+} JSAsyncGeneratorRequest;
+
+typedef struct JSAsyncGeneratorData {
+ JSObject *generator; /* back pointer to the object (const) */
+ JSAsyncGeneratorStateEnum state;
+ JSAsyncFunctionState func_state;
+ struct list_head queue; /* list of JSAsyncGeneratorRequest.link */
+} JSAsyncGeneratorData;
+
+static void js_async_generator_free(JSRuntime *rt,
+ JSAsyncGeneratorData *s)
+{
+ struct list_head *el, *el1;
+ JSAsyncGeneratorRequest *req;
+
+ list_for_each_safe(el, el1, &s->queue) {
+ req = list_entry(el, JSAsyncGeneratorRequest, link);
+ JS_FreeValueRT(rt, req->result);
+ JS_FreeValueRT(rt, req->promise);
+ JS_FreeValueRT(rt, req->resolving_funcs[0]);
+ JS_FreeValueRT(rt, req->resolving_funcs[1]);
+ js_free_rt(rt, req);
+ }
+ if (s->state != JS_ASYNC_GENERATOR_STATE_COMPLETED &&
+ s->state != JS_ASYNC_GENERATOR_STATE_AWAITING_RETURN) {
+ async_func_free(rt, &s->func_state);
+ }
+ js_free_rt(rt, s);
+}
+
+static void js_async_generator_finalizer(JSRuntime *rt, JSValue obj)
+{
+ JSAsyncGeneratorData *s = JS_GetOpaque(obj, JS_CLASS_ASYNC_GENERATOR);
+
+ if (s) {
+ js_async_generator_free(rt, s);
+ }
+}
+
+static void js_async_generator_mark(JSRuntime *rt, JSValueConst val,
+ JS_MarkFunc *mark_func)
+{
+ JSAsyncGeneratorData *s = JS_GetOpaque(val, JS_CLASS_ASYNC_GENERATOR);
+ struct list_head *el;
+ JSAsyncGeneratorRequest *req;
+ if (s) {
+ list_for_each(el, &s->queue) {
+ req = list_entry(el, JSAsyncGeneratorRequest, link);
+ JS_MarkValue(rt, req->result, mark_func);
+ JS_MarkValue(rt, req->promise, mark_func);
+ JS_MarkValue(rt, req->resolving_funcs[0], mark_func);
+ JS_MarkValue(rt, req->resolving_funcs[1], mark_func);
+ }
+ if (s->state != JS_ASYNC_GENERATOR_STATE_COMPLETED &&
+ s->state != JS_ASYNC_GENERATOR_STATE_AWAITING_RETURN) {
+ async_func_mark(rt, &s->func_state, mark_func);
+ }
+ }
+}
+
+static JSValue js_async_generator_resolve_function(JSContext *ctx,
+ JSValueConst this_obj,
+ int argc, JSValueConst *argv,
+ int magic, JSValue *func_data);
+
+static int js_async_generator_resolve_function_create(JSContext *ctx,
+ JSValueConst generator,
+ JSValue *resolving_funcs,
+ BOOL is_resume_next)
+{
+ int i;
+ JSValue func;
+
+ for(i = 0; i < 2; i++) {
+ func = JS_NewCFunctionData(ctx, js_async_generator_resolve_function, 1,
+ i + is_resume_next * 2, 1, &generator);
+ if (JS_IsException(func)) {
+ if (i == 1)
+ JS_FreeValue(ctx, resolving_funcs[0]);
+ return -1;
+ }
+ resolving_funcs[i] = func;
+ }
+ return 0;
+}
+
+static int js_async_generator_await(JSContext *ctx,
+ JSAsyncGeneratorData *s,
+ JSValueConst value)
+{
+ JSValue promise, resolving_funcs[2], resolving_funcs1[2], ret2;
+ int i, res;
+
+ promise = js_new_promise_capability(ctx, resolving_funcs, JS_UNDEFINED);
+ if (JS_IsException(promise))
+ goto fail;
+ ret2 = JS_Call(ctx, resolving_funcs[0], JS_UNDEFINED,
+ 1, &value);
+ JS_FreeValue(ctx, resolving_funcs[0]);
+ JS_FreeValue(ctx, resolving_funcs[1]);
+ if (JS_IsException(ret2)) {
+ JS_FreeValue(ctx, promise);
+ goto fail;
+ }
+ JS_FreeValue(ctx, ret2);
+
+ if (js_async_generator_resolve_function_create(ctx, JS_MKPTR(JS_TAG_OBJECT, s->generator),
+ resolving_funcs, FALSE)) {
+ JS_FreeValue(ctx, promise);
+ goto fail;
+ }
+
+ /* Note: no need to create 'thrownawayCapability' as in
+ the spec */
+ for(i = 0; i < 2; i++)
+ resolving_funcs1[i] = JS_UNDEFINED;
+ res = perform_promise_then(ctx, promise,
+ (JSValueConst *)resolving_funcs,
+ (JSValueConst *)resolving_funcs1);
+ JS_FreeValue(ctx, promise);
+ for(i = 0; i < 2; i++)
+ JS_FreeValue(ctx, resolving_funcs[i]);
+ if (res)
+ goto fail;
+ return 0;
+ fail:
+ return -1;
+}
+
+static void js_async_generator_resolve_or_reject(JSContext *ctx,
+ JSAsyncGeneratorData *s,
+ JSValueConst result,
+ int is_reject)
+{
+ JSAsyncGeneratorRequest *next;
+ JSValue ret;
+
+ next = list_entry(s->queue.next, JSAsyncGeneratorRequest, link);
+ list_del(&next->link);
+ ret = JS_Call(ctx, next->resolving_funcs[is_reject], JS_UNDEFINED, 1,
+ &result);
+ JS_FreeValue(ctx, ret);
+ JS_FreeValue(ctx, next->result);
+ JS_FreeValue(ctx, next->promise);
+ JS_FreeValue(ctx, next->resolving_funcs[0]);
+ JS_FreeValue(ctx, next->resolving_funcs[1]);
+ js_free(ctx, next);
+}
+
+static void js_async_generator_resolve(JSContext *ctx,
+ JSAsyncGeneratorData *s,
+ JSValueConst value,
+ BOOL done)
+{
+ JSValue result;
+ result = js_create_iterator_result(ctx, JS_DupValue(ctx, value), done);
+ /* XXX: better exception handling ? */
+ js_async_generator_resolve_or_reject(ctx, s, result, 0);
+ JS_FreeValue(ctx, result);
+ }
+
+static void js_async_generator_reject(JSContext *ctx,
+ JSAsyncGeneratorData *s,
+ JSValueConst exception)
+{
+ js_async_generator_resolve_or_reject(ctx, s, exception, 1);
+}
+
+static void js_async_generator_complete(JSContext *ctx,
+ JSAsyncGeneratorData *s)
+{
+ if (s->state != JS_ASYNC_GENERATOR_STATE_COMPLETED) {
+ s->state = JS_ASYNC_GENERATOR_STATE_COMPLETED;
+ async_func_detach(ctx, &s->func_state);
+ async_func_free(ctx->rt, &s->func_state);
+ }
+}
+
+static int js_async_generator_completed_return(JSContext *ctx,
+ JSAsyncGeneratorData *s,
+ JSValueConst value)
+{
+ JSValue promise, resolving_funcs[2], ret, resolving_funcs1[2];
+ int res;
+
+ promise = js_new_promise_capability(ctx, resolving_funcs, JS_UNDEFINED);
+ if (JS_IsException(promise))
+ return -1;
+ ret = JS_Call(ctx, resolving_funcs[0], JS_UNDEFINED, 1, &value);
+ JS_FreeValue(ctx, resolving_funcs[0]);
+ JS_FreeValue(ctx, resolving_funcs[1]);
+ if (JS_IsException(ret)) {
+ JS_FreeValue(ctx, promise);
+ return -1;
+ }
+ JS_FreeValue(ctx, ret);
+ if (js_async_generator_resolve_function_create(ctx,
+ JS_MKPTR(JS_TAG_OBJECT, s->generator),
+ resolving_funcs1,
+ TRUE)) {
+ JS_FreeValue(ctx, promise);
+ return -1;
+ }
+ resolving_funcs[0] = JS_UNDEFINED;
+ resolving_funcs[1] = JS_UNDEFINED;
+ res = perform_promise_then(ctx, promise,
+ (JSValueConst *)resolving_funcs1,
+ (JSValueConst *)resolving_funcs);
+ JS_FreeValue(ctx, resolving_funcs1[0]);
+ JS_FreeValue(ctx, resolving_funcs1[1]);
+ JS_FreeValue(ctx, promise);
+ return res;
+}
+
+static void js_async_generator_resume_next(JSContext *ctx,
+ JSAsyncGeneratorData *s)
+{
+ JSAsyncGeneratorRequest *next;
+ JSValue func_ret, value;
+
+ for(;;) {
+ if (list_empty(&s->queue))
+ break;
+ next = list_entry(s->queue.next, JSAsyncGeneratorRequest, link);
+ switch(s->state) {
+ case JS_ASYNC_GENERATOR_STATE_EXECUTING:
+ /* only happens when restarting execution after await() */
+ goto resume_exec;
+ case JS_ASYNC_GENERATOR_STATE_AWAITING_RETURN:
+ goto done;
+ case JS_ASYNC_GENERATOR_STATE_SUSPENDED_START:
+ if (next->completion_type == GEN_MAGIC_NEXT) {
+ goto exec_no_arg;
+ } else {
+ js_async_generator_complete(ctx, s);
+ }
+ break;
+ case JS_ASYNC_GENERATOR_STATE_COMPLETED:
+ if (next->completion_type == GEN_MAGIC_NEXT) {
+ js_async_generator_resolve(ctx, s, JS_UNDEFINED, TRUE);
+ } else if (next->completion_type == GEN_MAGIC_RETURN) {
+ s->state = JS_ASYNC_GENERATOR_STATE_AWAITING_RETURN;
+ js_async_generator_completed_return(ctx, s, next->result);
+ goto done;
+ } else {
+ js_async_generator_reject(ctx, s, next->result);
+ }
+ goto done;
+ case JS_ASYNC_GENERATOR_STATE_SUSPENDED_YIELD:
+ case JS_ASYNC_GENERATOR_STATE_SUSPENDED_YIELD_STAR:
+ value = JS_DupValue(ctx, next->result);
+ if (next->completion_type == GEN_MAGIC_THROW &&
+ s->state == JS_ASYNC_GENERATOR_STATE_SUSPENDED_YIELD) {
+ JS_Throw(ctx, value);
+ s->func_state.throw_flag = TRUE;
+ } else {
+ /* 'yield' returns a value. 'yield *' also returns a value
+ in case the 'throw' method is called */
+ s->func_state.frame.cur_sp[-1] = value;
+ s->func_state.frame.cur_sp[0] =
+ JS_NewInt32(ctx, next->completion_type);
+ s->func_state.frame.cur_sp++;
+ exec_no_arg:
+ s->func_state.throw_flag = FALSE;
+ }
+ s->state = JS_ASYNC_GENERATOR_STATE_EXECUTING;
+ resume_exec:
+ func_ret = async_func_resume(ctx, &s->func_state);
+ if (JS_IsException(func_ret)) {
+ value = JS_GetException(ctx);
+ js_async_generator_complete(ctx, s);
+ js_async_generator_reject(ctx, s, value);
+ JS_FreeValue(ctx, value);
+ } else if (JS_VALUE_GET_TAG(func_ret) == JS_TAG_INT) {
+ int func_ret_code;
+ value = s->func_state.frame.cur_sp[-1];
+ s->func_state.frame.cur_sp[-1] = JS_UNDEFINED;
+ func_ret_code = JS_VALUE_GET_INT(func_ret);
+ switch(func_ret_code) {
+ case FUNC_RET_YIELD:
+ case FUNC_RET_YIELD_STAR:
+ if (func_ret_code == FUNC_RET_YIELD_STAR)
+ s->state = JS_ASYNC_GENERATOR_STATE_SUSPENDED_YIELD_STAR;
+ else
+ s->state = JS_ASYNC_GENERATOR_STATE_SUSPENDED_YIELD;
+ js_async_generator_resolve(ctx, s, value, FALSE);
+ JS_FreeValue(ctx, value);
+ break;
+ case FUNC_RET_AWAIT:
+ js_async_generator_await(ctx, s, value);
+ JS_FreeValue(ctx, value);
+ goto done;
+ default:
+ abort();
+ }
+ } else {
+ assert(JS_IsUndefined(func_ret));
+ /* end of function */
+ value = s->func_state.frame.cur_sp[-1];
+ s->func_state.frame.cur_sp[-1] = JS_UNDEFINED;
+ js_async_generator_complete(ctx, s);
+ js_async_generator_resolve(ctx, s, value, TRUE);
+ JS_FreeValue(ctx, value);
+ }
+ break;
+ default:
+ abort();
+ }
+ }
+ done: ;
+}
+
+static JSValue js_async_generator_resolve_function(JSContext *ctx,
+ JSValueConst this_obj,
+ int argc, JSValueConst *argv,
+ int magic, JSValue *func_data)
+{
+ BOOL is_reject = magic & 1;
+ JSAsyncGeneratorData *s = JS_GetOpaque(func_data[0], JS_CLASS_ASYNC_GENERATOR);
+ JSValueConst arg = argv[0];
+
+ /* XXX: what if s == NULL */
+
+ if (magic >= 2) {
+ /* resume next case in AWAITING_RETURN state */
+ assert(s->state == JS_ASYNC_GENERATOR_STATE_AWAITING_RETURN ||
+ s->state == JS_ASYNC_GENERATOR_STATE_COMPLETED);
+ s->state = JS_ASYNC_GENERATOR_STATE_COMPLETED;
+ if (is_reject) {
+ js_async_generator_reject(ctx, s, arg);
+ } else {
+ js_async_generator_resolve(ctx, s, arg, TRUE);
+ }
+ } else {
+ /* restart function execution after await() */
+ assert(s->state == JS_ASYNC_GENERATOR_STATE_EXECUTING);
+ s->func_state.throw_flag = is_reject;
+ if (is_reject) {
+ JS_Throw(ctx, JS_DupValue(ctx, arg));
+ } else {
+ /* return value of await */
+ s->func_state.frame.cur_sp[-1] = JS_DupValue(ctx, arg);
+ }
+ js_async_generator_resume_next(ctx, s);
+ }
+ return JS_UNDEFINED;
+}
+
+/* magic = GEN_MAGIC_x */
+static JSValue js_async_generator_next(JSContext *ctx, JSValueConst this_val,
+ int argc, JSValueConst *argv,
+ int magic)
+{
+ JSAsyncGeneratorData *s = JS_GetOpaque(this_val, JS_CLASS_ASYNC_GENERATOR);
+ JSValue promise, resolving_funcs[2];
+ JSAsyncGeneratorRequest *req;
+
+ promise = js_new_promise_capability(ctx, resolving_funcs, JS_UNDEFINED);
+ if (JS_IsException(promise))
+ return JS_EXCEPTION;
+ if (!s) {
+ JSValue err, res2;
+ JS_ThrowTypeError(ctx, "not an AsyncGenerator object");
+ err = JS_GetException(ctx);
+ res2 = JS_Call(ctx, resolving_funcs[1], JS_UNDEFINED,
+ 1, (JSValueConst *)&err);
+ JS_FreeValue(ctx, err);
+ JS_FreeValue(ctx, res2);
+ JS_FreeValue(ctx, resolving_funcs[0]);
+ JS_FreeValue(ctx, resolving_funcs[1]);
+ return promise;
+ }
+ req = js_mallocz(ctx, sizeof(*req));
+ if (!req)
+ goto fail;
+ req->completion_type = magic;
+ req->result = JS_DupValue(ctx, argv[0]);
+ req->promise = JS_DupValue(ctx, promise);
+ req->resolving_funcs[0] = resolving_funcs[0];
+ req->resolving_funcs[1] = resolving_funcs[1];
+ list_add_tail(&req->link, &s->queue);
+ if (s->state != JS_ASYNC_GENERATOR_STATE_EXECUTING) {
+ js_async_generator_resume_next(ctx, s);
+ }
+ return promise;
+ fail:
+ JS_FreeValue(ctx, resolving_funcs[0]);
+ JS_FreeValue(ctx, resolving_funcs[1]);
+ JS_FreeValue(ctx, promise);
+ return JS_EXCEPTION;
+}
+
+static JSValue js_async_generator_function_call(JSContext *ctx, JSValueConst func_obj,
+ JSValueConst this_obj,
+ int argc, JSValueConst *argv)
+{
+ JSValue obj, func_ret;
+ JSAsyncGeneratorData *s;
+
+ s = js_mallocz(ctx, sizeof(*s));
+ if (!s)
+ return JS_EXCEPTION;
+ s->state = JS_ASYNC_GENERATOR_STATE_SUSPENDED_START;
+ init_list_head(&s->queue);
+ if (async_func_init(ctx, &s->func_state, func_obj, this_obj, argc, argv)) {
+ s->state = JS_ASYNC_GENERATOR_STATE_COMPLETED;
+ goto fail;
+ }
+
+ /* execute the function up to 'OP_initial_yield' (no yield nor
+ await are possible) */
+ func_ret = async_func_resume(ctx, &s->func_state);
+ if (JS_IsException(func_ret))
+ goto fail;
+ JS_FreeValue(ctx, func_ret);
+
+ obj = js_create_from_ctor(ctx, func_obj, JS_CLASS_ASYNC_GENERATOR);
+ if (JS_IsException(obj))
+ goto fail;
+ s->generator = JS_VALUE_GET_OBJ(obj);
+ JS_SetOpaque(obj, s);
+ return obj;
+ fail:
+ js_async_generator_free(ctx->rt, s);
+ return JS_EXCEPTION;
+}
+
+/* JS parser */
+
+enum {
+ TOK_NUMBER = -128,
+ TOK_STRING,
+ TOK_TEMPLATE,
+ TOK_IDENT,
+ TOK_REGEXP,
+ /* warning: order matters (see js_parse_assign_expr) */
+ TOK_MUL_ASSIGN,
+ TOK_DIV_ASSIGN,
+ TOK_MOD_ASSIGN,
+ TOK_PLUS_ASSIGN,
+ TOK_MINUS_ASSIGN,
+ TOK_SHL_ASSIGN,
+ TOK_SAR_ASSIGN,
+ TOK_SHR_ASSIGN,
+ TOK_AND_ASSIGN,
+ TOK_XOR_ASSIGN,
+ TOK_OR_ASSIGN,
+#ifdef CONFIG_BIGNUM
+ TOK_MATH_POW_ASSIGN,
+#endif
+ TOK_POW_ASSIGN,
+ TOK_DEC,
+ TOK_INC,
+ TOK_SHL,
+ TOK_SAR,
+ TOK_SHR,
+ TOK_LT,
+ TOK_LTE,
+ TOK_GT,
+ TOK_GTE,
+ TOK_EQ,
+ TOK_STRICT_EQ,
+ TOK_NEQ,
+ TOK_STRICT_NEQ,
+ TOK_LAND,
+ TOK_LOR,
+#ifdef CONFIG_BIGNUM
+ TOK_MATH_POW,
+#endif
+ TOK_POW,
+ TOK_ARROW,
+ TOK_ELLIPSIS,
+ TOK_ERROR,
+ TOK_EOF,
+ /* keywords: WARNING: same order as atoms */
+ TOK_NULL, /* must be first */
+ TOK_FALSE,
+ TOK_TRUE,
+ TOK_IF,
+ TOK_ELSE,
+ TOK_RETURN,
+ TOK_VAR,
+ TOK_THIS,
+ TOK_DELETE,
+ TOK_VOID,
+ TOK_TYPEOF,
+ TOK_NEW,
+ TOK_IN,
+ TOK_INSTANCEOF,
+ TOK_DO,
+ TOK_WHILE,
+ TOK_FOR,
+ TOK_BREAK,
+ TOK_CONTINUE,
+ TOK_SWITCH,
+ TOK_CASE,
+ TOK_DEFAULT,
+ TOK_THROW,
+ TOK_TRY,
+ TOK_CATCH,
+ TOK_FINALLY,
+ TOK_FUNCTION,
+ TOK_DEBUGGER,
+ TOK_WITH,
+ /* FutureReservedWord */
+ TOK_CLASS,
+ TOK_CONST,
+ TOK_ENUM,
+ TOK_EXPORT,
+ TOK_EXTENDS,
+ TOK_IMPORT,
+ TOK_SUPER,
+ /* FutureReservedWords when parsing strict mode code */
+ TOK_IMPLEMENTS,
+ TOK_INTERFACE,
+ TOK_LET,
+ TOK_PACKAGE,
+ TOK_PRIVATE,
+ TOK_PROTECTED,
+ TOK_PUBLIC,
+ TOK_STATIC,
+ TOK_YIELD,
+ TOK_AWAIT, /* must be last */
+ TOK_OF, /* only used for js_parse_skip_parens_token() */
+};
+
+#define TOK_FIRST_KEYWORD TOK_NULL
+#define TOK_LAST_KEYWORD TOK_AWAIT
+
+/* unicode code points */
+#define CP_NBSP 0x00a0
+#define CP_BOM 0xfeff
+
+#define CP_LS 0x2028
+#define CP_PS 0x2029
+
+typedef struct BlockEnv {
+ struct BlockEnv *prev;
+ JSAtom label_name; /* JS_ATOM_NULL if none */
+ int label_break; /* -1 if none */
+ int label_cont; /* -1 if none */
+ int drop_count; /* number of stack elements to drop */
+ int label_finally; /* -1 if none */
+ int scope_level;
+ int has_iterator;
+} BlockEnv;
+
+typedef struct JSHoistedDef {
+ int cpool_idx; /* -1 means variable global definition */
+ uint8_t force_init : 1; /* initialize to undefined */
+ uint8_t is_lexical : 1; /* global let/const definition */
+ uint8_t is_const : 1; /* const definition */
+ uint8_t is_for_of : 1; /* variable defined in for-of */
+ int var_idx; /* function object index if cpool_idx >= 0 */
+ int scope_level; /* scope of definition */
+ JSAtom var_name; /* variable name if cpool_idx < 0 */
+} JSHoistedDef;
+
+typedef struct RelocEntry {
+ struct RelocEntry *next;
+ uint32_t addr; /* address to patch */
+ int size; /* address size: 1, 2 or 4 bytes */
+} RelocEntry;
+
+typedef struct JumpSlot {
+ int op;
+ int size;
+ int pos;
+ int label;
+} JumpSlot;
+
+typedef struct LabelSlot {
+ int ref_count;
+ int pos; /* phase 1 address, -1 means not resolved yet */
+ int pos2; /* phase 2 address, -1 means not resolved yet */
+ int addr; /* phase 3 address, -1 means not resolved yet */
+ RelocEntry *first_reloc;
+} LabelSlot;
+
+typedef struct LineNumberSlot {
+ uint32_t pc;
+ int line_num;
+} LineNumberSlot;
+
+typedef enum JSParseFunctionEnum {
+ JS_PARSE_FUNC_STATEMENT,
+ JS_PARSE_FUNC_VAR,
+ JS_PARSE_FUNC_EXPR,
+ JS_PARSE_FUNC_ARROW,
+ JS_PARSE_FUNC_GETTER,
+ JS_PARSE_FUNC_SETTER,
+ JS_PARSE_FUNC_METHOD,
+ JS_PARSE_FUNC_CLASS_CONSTRUCTOR,
+ JS_PARSE_FUNC_DERIVED_CLASS_CONSTRUCTOR,
+} JSParseFunctionEnum;
+
+typedef enum JSParseExportEnum {
+ JS_PARSE_EXPORT_NONE,
+ JS_PARSE_EXPORT_NAMED,
+ JS_PARSE_EXPORT_DEFAULT,
+} JSParseExportEnum;
+
+typedef struct JSFunctionDef {
+ JSContext *ctx;
+ struct JSFunctionDef *parent;
+ int parent_cpool_idx; /* index in the constant pool of the parent
+ or -1 if none */
+ int parent_scope_level; /* scope level in parent at point of definition */
+ struct list_head child_list; /* list of JSFunctionDef.link */
+ struct list_head link;
+
+ BOOL is_eval; /* TRUE if eval code */
+ int eval_type; /* only valid if is_eval = TRUE */
+ BOOL is_global_var; /* TRUE if variables are not defined locally:
+ eval global, eval module or non strict eval */
+ BOOL is_func_expr; /* TRUE if function expression */
+ BOOL has_home_object; /* TRUE if the home object is available */
+ BOOL has_prototype; /* true if a prototype field is necessary */
+ BOOL has_simple_parameter_list;
+ BOOL has_use_strict; /* to reject directive in special cases */
+ BOOL has_eval_call; /* true if the function contains a call to eval() */
+ BOOL has_arguments_binding; /* true if the 'arguments' binding is
+ available in the function */
+ BOOL has_this_binding; /* true if the 'this' and new.target binding are
+ available in the function */
+ BOOL new_target_allowed; /* true if the 'new.target' does not
+ throw a syntax error */
+ BOOL super_call_allowed; /* true if super() is allowed */
+ BOOL super_allowed; /* true if super. or super[] is allowed */
+ BOOL is_derived_class_constructor;
+ BOOL in_function_body;
+ JSFunctionKindEnum func_kind : 8;
+ JSParseFunctionEnum func_type : 8;
+ uint8_t js_mode; /* bitmap of JS_MODE_x */
+ JSAtom func_name; /* JS_ATOM_NULL if no name */
+
+ JSVarDef *vars;
+ int var_size; /* allocated size for vars[] */
+ int var_count;
+ JSVarDef *args;
+ int arg_size; /* allocated size for args[] */
+ int arg_count; /* number of arguments */
+ int defined_arg_count;
+ int var_object_idx; /* -1 if none */
+ int arguments_var_idx; /* -1 if none */
+ int func_var_idx; /* variable containing the current function (-1
+ if none, only used if is_func_expr is true) */
+ int eval_ret_idx; /* variable containing the return value of the eval, -1 if none */
+ int this_var_idx; /* variable containg the 'this' value, -1 if none */
+ int new_target_var_idx; /* variable containg the 'new.target' value, -1 if none */
+ int this_active_func_var_idx; /* variable containg the 'this.active_func' value, -1 if none */
+ int home_object_var_idx;
+
+ int scope_level; /* index into fd->scopes if the current lexical scope */
+ int scope_first; /* index into vd->vars of first lexically scoped variable */
+ int scope_size; /* allocated size of fd->scopes array */
+ int scope_count; /* number of entries used in the fd->scopes array */
+ JSVarScope *scopes;
+ JSVarScope def_scope_array[4];
+
+ int hoisted_def_count;
+ int hoisted_def_size;
+ JSHoistedDef *hoisted_def;
+
+ DynBuf byte_code;
+ int last_opcode_pos; /* -1 if no last opcode */
+ int last_opcode_line_num;
+
+ LabelSlot *label_slots;
+ int label_size; /* allocated size for label_slots[] */
+ int label_count;
+ BlockEnv *top_break; /* break/continue label stack */
+
+ /* constant pool (strings, functions, numbers) */
+ JSValue *cpool;
+ uint32_t cpool_count;
+ uint32_t cpool_size;
+
+ /* list of variables in the closure */
+ int closure_var_count;
+ int closure_var_size;
+ JSClosureVar *closure_var;
+
+ JumpSlot *jump_slots;
+ int jump_size;
+ int jump_count;
+
+ LineNumberSlot *line_number_slots;
+ int line_number_size;
+ int line_number_count;
+ int line_number_last;
+ int line_number_last_pc;
+
+ /* pc2line table */
+ JSAtom filename;
+ int line_num;
+ DynBuf pc2line;
+
+ char *source; /* raw source, utf-8 encoded */
+ int source_len;
+
+ JSModuleDef *module; /* != NULL when parsing a module */
+} JSFunctionDef;
+
+typedef struct JSToken {
+ int val;
+ int line_num; /* line number of token start */
+ const uint8_t *ptr;
+ union {
+ struct {
+ JSValue str;
+ int sep;
+ } str;
+ struct {
+ JSValue val;
+#ifdef CONFIG_BIGNUM
+ slimb_t exponent; /* may be != 0 only if val is a float */
+#endif
+ } num;
+ struct {
+ JSAtom atom;
+ BOOL has_escape;
+ BOOL is_reserved;
+ } ident;
+ struct {
+ JSValue body;
+ JSValue flags;
+ } regexp;
+ } u;
+} JSToken;
+
+typedef struct JSParseState {
+ JSContext *ctx;
+ int last_line_num; /* line number of last token */
+ int line_num; /* line number of current offset */
+ const char *filename;
+ JSToken token;
+ BOOL got_lf; /* true if got line feed before the current token */
+ const uint8_t *last_ptr;
+ const uint8_t *buf_ptr;
+ const uint8_t *buf_end;
+
+ /* current function code */
+ JSFunctionDef *cur_func;
+ BOOL is_module; /* parsing a module */
+ BOOL allow_html_comments;
+} JSParseState;
+
+typedef struct JSOpCode {
+#ifdef DUMP_BYTECODE
+ const char *name;
+#endif
+ uint8_t size; /* in bytes */
+ /* the opcodes remove n_pop items from the top of the stack, then
+ pushes n_push items */
+ uint8_t n_pop;
+ uint8_t n_push;
+ uint8_t fmt;
+} JSOpCode;
+
+static const JSOpCode opcode_info[OP_COUNT] = {
+#define FMT(f)
+#ifdef DUMP_BYTECODE
+#define DEF(id, size, n_pop, n_push, f) { #id, size, n_pop, n_push, OP_FMT_ ## f },
+#else
+#define DEF(id, size, n_pop, n_push, f) { size, n_pop, n_push, OP_FMT_ ## f },
+#endif
+#include "quickjs-opcode.h"
+#undef DEF
+#undef FMT
+};
+
+static __exception int next_token(JSParseState *s);
+
+static void free_token(JSParseState *s, JSToken *token)
+{
+ switch(token->val) {
+#ifdef CONFIG_BIGNUM
+ case TOK_NUMBER:
+ JS_FreeValue(s->ctx, token->u.num.val);
+ break;
+#endif
+ case TOK_STRING:
+ case TOK_TEMPLATE:
+ JS_FreeValue(s->ctx, token->u.str.str);
+ break;
+ case TOK_REGEXP:
+ JS_FreeValue(s->ctx, token->u.regexp.body);
+ JS_FreeValue(s->ctx, token->u.regexp.flags);
+ break;
+ case TOK_IDENT:
+#if defined(_MSC_VER)
+ case TOK_NULL: /* must be first */
+ case TOK_FALSE:
+ case TOK_TRUE:
+ case TOK_IF:
+ case TOK_ELSE:
+ case TOK_RETURN:
+ case TOK_VAR:
+ case TOK_THIS:
+ case TOK_DELETE:
+ case TOK_VOID:
+ case TOK_TYPEOF:
+ case TOK_NEW:
+ case TOK_IN:
+ case TOK_INSTANCEOF:
+ case TOK_DO:
+ case TOK_WHILE:
+ case TOK_FOR:
+ case TOK_BREAK:
+ case TOK_CONTINUE:
+ case TOK_SWITCH:
+ case TOK_CASE:
+ case TOK_DEFAULT:
+ case TOK_THROW:
+ case TOK_TRY:
+ case TOK_CATCH:
+ case TOK_FINALLY:
+ case TOK_FUNCTION:
+ case TOK_DEBUGGER:
+ case TOK_WITH:
+ /* FutureReservedWord */
+ case TOK_CLASS:
+ case TOK_CONST:
+ case TOK_ENUM:
+ case TOK_EXPORT:
+ case TOK_EXTENDS:
+ case TOK_IMPORT:
+ case TOK_SUPER:
+ /* FutureReservedWords when parsing strict mode code */
+ case TOK_IMPLEMENTS:
+ case TOK_INTERFACE:
+ case TOK_LET:
+ case TOK_PACKAGE:
+ case TOK_PRIVATE:
+ case TOK_PROTECTED:
+ case TOK_PUBLIC:
+ case TOK_STATIC:
+ case TOK_YIELD:
+ case TOK_AWAIT: /* must be last */
+#else
+ case TOK_FIRST_KEYWORD ... TOK_LAST_KEYWORD:
+#endif
+ JS_FreeAtom(s->ctx, token->u.ident.atom);
+ break;
+ default:
+ break;
+ }
+}
+
+#if defined(_MSC_VER)
+static void dump_token(JSParseState *s,
+ const JSToken *token)
+#else
+static void __attribute((unused)) dump_token(JSParseState *s,
+ const JSToken *token)
+#endif
+{
+ switch(token->val) {
+ case TOK_NUMBER:
+ {
+ double d;
+ JS_ToFloat64(s->ctx, &d, token->u.num.val); /* no exception possible */
+ printf("number: %.14g\n", d);
+ }
+ break;
+ case TOK_IDENT:
+ dump_atom:
+ {
+ char buf[ATOM_GET_STR_BUF_SIZE];
+ printf("ident: '%s'\n",
+ JS_AtomGetStr(s->ctx, buf, sizeof(buf), token->u.ident.atom));
+ }
+ break;
+ case TOK_STRING:
+ {
+ const char *str;
+ /* XXX: quote the string */
+ str = JS_ToCString(s->ctx, token->u.str.str);
+ printf("string: '%s'\n", str);
+ JS_FreeCString(s->ctx, str);
+ }
+ break;
+ case TOK_TEMPLATE:
+ {
+ const char *str;
+ str = JS_ToCString(s->ctx, token->u.str.str);
+ printf("template: `%s`\n", str);
+ JS_FreeCString(s->ctx, str);
+ }
+ break;
+ case TOK_REGEXP:
+ {
+ const char *str, *str2;
+ str = JS_ToCString(s->ctx, token->u.regexp.body);
+ str2 = JS_ToCString(s->ctx, token->u.regexp.flags);
+ printf("regexp: '%s' '%s'\n", str, str2);
+ JS_FreeCString(s->ctx, str);
+ JS_FreeCString(s->ctx, str2);
+ }
+ break;
+ case TOK_EOF:
+ printf("eof\n");
+ break;
+ default:
+ if (s->token.val >= TOK_NULL && s->token.val <= TOK_LAST_KEYWORD) {
+ goto dump_atom;
+ } else if (s->token.val >= 256) {
+ printf("token: %d\n", token->val);
+ } else {
+ printf("token: '%c'\n", token->val);
+ }
+ break;
+ }
+}
+
+#if defined(_MSC_VER)
+int js_parse_error(JSParseState *s, const char *fmt, ...)
+#else
+int __attribute__((format(printf, 2, 3))) js_parse_error(JSParseState *s, const char *fmt, ...)
+#endif
+{
+ JSContext *ctx = s->ctx;
+ va_list ap;
+
+ va_start(ap, fmt);
+ JS_ThrowError(ctx, JS_SYNTAX_ERROR, fmt, ap);
+ va_end(ap);
+
+ build_backtrace(ctx, ctx->current_exception, s->filename, s->line_num, NULL);
+ return -1;
+}
+
+#if defined(_MSC_VER)
+int js_parse_error1(JSParseState *s, JSErrorEnum error_num,
+ const char *fmt, ...)
+#else
+int __attribute__((format(printf, 3, 4))) js_parse_error1(JSParseState *s, JSErrorEnum error_num,
+ const char *fmt, ...)
+#endif
+{
+ JSContext *ctx = s->ctx;
+ va_list ap;
+
+ va_start(ap, fmt);
+ JS_ThrowError(ctx, error_num, fmt, ap);
+ va_end(ap);
+
+ build_backtrace(ctx, ctx->current_exception, s->filename, s->line_num, NULL);
+ return -1;
+}
+
+static int js_parse_expect(JSParseState *s, int tok)
+{
+ if (s->token.val != tok) {
+ /* XXX: dump token correctly in all cases */
+ return js_parse_error(s, "expecting '%c'", tok);
+ }
+ return next_token(s);
+}
+
+static int js_parse_expect_semi(JSParseState *s)
+{
+ if (s->token.val != ';') {
+ /* automatic insertion of ';' */
+ if (s->token.val == TOK_EOF || s->token.val == '}' || s->got_lf) {
+ return 0;
+ }
+ return js_parse_error(s, "expecting '%c'", ';');
+ }
+ return next_token(s);
+}
+
+static int js_parse_error_reserved_identifier(JSParseState *s)
+{
+ char buf1[ATOM_GET_STR_BUF_SIZE];
+ return js_parse_error(s, "'%s' is a reserved identifier",
+ JS_AtomGetStr(s->ctx, buf1, sizeof(buf1),
+ s->token.u.ident.atom));
+}
+
+static __exception int js_parse_template_part(JSParseState *s, const uint8_t *p)
+{
+ uint32_t c;
+ StringBuffer b_s, *b = &b_s;
+
+ /* p points to the first byte of the template part */
+ if (string_buffer_init(s->ctx, b, 32))
+ goto fail;
+ for(;;) {
+ if (p >= s->buf_end)
+ goto unexpected_eof;
+ c = *p++;
+ if (c == '`') {
+ /* template end part */
+ break;
+ }
+ if (c == '$' && *p == '{') {
+ /* template start or middle part */
+ p++;
+ break;
+ }
+ if (c == '\\') {
+ if (string_buffer_putc8(b, c))
+ goto fail;
+ if (p >= s->buf_end)
+ goto unexpected_eof;
+ c = *p++;
+ }
+ /* newline sequences are normalized as single '\n' bytes */
+ if (c == '\r') {
+ if (*p == '\n')
+ p++;
+ c = '\n';
+ }
+ if (c == '\n') {
+ s->line_num++;
+ } else if (c >= 0x80) {
+ const uint8_t *p_next;
+ c = unicode_from_utf8(p - 1, UTF8_CHAR_LEN_MAX, &p_next);
+ if (c > 0x10FFFF) {
+ js_parse_error(s, "invalid UTF-8 sequence");
+ goto fail;
+ }
+ p = p_next;
+ }
+ if (string_buffer_putc(b, c))
+ goto fail;
+ }
+ s->token.val = TOK_TEMPLATE;
+ s->token.u.str.sep = c;
+ s->token.u.str.str = string_buffer_end(b);
+ s->buf_ptr = p;
+ return 0;
+
+ unexpected_eof:
+ js_parse_error(s, "unexpected end of string");
+ fail:
+ string_buffer_free(b);
+ return -1;
+}
+
+static __exception int js_parse_string(JSParseState *s, int sep,
+ BOOL do_throw, const uint8_t *p,
+ JSToken *token, const uint8_t **pp)
+{
+ int ret;
+ uint32_t c;
+ StringBuffer b_s, *b = &b_s;
+
+ /* string */
+ if (string_buffer_init(s->ctx, b, 32))
+ goto fail;
+ for(;;) {
+ if (p >= s->buf_end)
+ goto invalid_char;
+ c = *p;
+ if (c < 0x20) {
+ if (!s->cur_func) {
+ if (do_throw)
+ js_parse_error(s, "invalid character in a JSON string");
+ goto fail;
+ }
+ if (sep == '`') {
+ if (c == '\r') {
+ if (p[1] == '\n')
+ p++;
+ c = '\n';
+ }
+ /* do not update s->line_num */
+ } else if (c == '\n' || c == '\r')
+ goto invalid_char;
+ }
+ p++;
+ if (c == sep)
+ break;
+ if (c == '$' && *p == '{' && sep == '`') {
+ /* template start or middle part */
+ p++;
+ break;
+ }
+ if (c == '\\') {
+ c = *p;
+ switch(c) {
+ case '\0':
+ if (p >= s->buf_end)
+ goto invalid_char;
+ p++;
+ break;
+ case '\'':
+ case '\"':
+ case '\\':
+ p++;
+ break;
+ case '\r': /* accept DOS and MAC newline sequences */
+ if (p[1] == '\n') {
+ p++;
+ }
+ /* fall thru */
+ case '\n':
+ /* ignore escaped newline sequence */
+ p++;
+ if (sep != '`')
+ s->line_num++;
+ continue;
+ default:
+ if (c >= '0' && c <= '7') {
+ if (!s->cur_func)
+ goto invalid_octal; /* JSON case */
+ if (!(s->cur_func->js_mode & JS_MODE_STRICT) && sep != '`')
+ goto parse_escape;
+ if (c == '0' && !(p[1] >= '0' && p[1] <= '9')) {
+ p++;
+ c = '\0';
+ } else {
+ invalid_octal:
+ if (do_throw)
+ js_parse_error(s, "invalid octal syntax in strict mode");
+ goto fail;
+ }
+ } else if (c >= 0x80) {
+ const uint8_t *p_next;
+ c = unicode_from_utf8(p, UTF8_CHAR_LEN_MAX, &p_next);
+ if (c > 0x10FFFF) {
+ goto invalid_utf8;
+ }
+ p = p_next;
+ /* LS or PS are skipped */
+ if (c == CP_LS || c == CP_PS)
+ continue;
+ } else {
+ parse_escape:
+ ret = lre_parse_escape(&p, TRUE);
+ if (ret == -1) {
+ if (do_throw)
+ js_parse_error(s, "malformed escape sequence in string literal");
+ goto fail;
+ } else if (ret < 0) {
+ /* ignore the '\' (could output a warning) */
+ p++;
+ } else {
+ c = ret;
+ }
+ }
+ break;
+ }
+ } else if (c >= 0x80) {
+ const uint8_t *p_next;
+ c = unicode_from_utf8(p - 1, UTF8_CHAR_LEN_MAX, &p_next);
+ if (c > 0x10FFFF)
+ goto invalid_utf8;
+ p = p_next;
+#ifndef JSON_SUPERSET
+ /* LS or PS are invalid in Javascript string literals, considered
+ as line terminators, but allowed in JSON source and template
+ literals.
+ ECMA 2019 proposal json-superset removes this restriction.
+ */
+ if ((c == CP_LS || c == CP_PS) && sep != '`' && s->cur_func)
+ goto invalid_char;
+#endif
+ }
+ if (string_buffer_putc(b, c))
+ goto fail;
+ }
+ token->val = TOK_STRING;
+ token->u.str.sep = c;
+ token->u.str.str = string_buffer_end(b);
+ *pp = p;
+ return 0;
+
+ invalid_utf8:
+ if (do_throw)
+ js_parse_error(s, "invalid UTF-8 sequence");
+ goto fail;
+ invalid_char:
+ if (do_throw)
+ js_parse_error(s, "unexpected end of string");
+ fail:
+ string_buffer_free(b);
+ return -1;
+}
+
+static inline BOOL token_is_pseudo_keyword(JSParseState *s, JSAtom atom) {
+ return s->token.val == TOK_IDENT && s->token.u.ident.atom == atom &&
+ !s->token.u.ident.has_escape;
+}
+
+/* return TRUE if a regexp literal is allowed after this token */
+static BOOL is_regexp_allowed(JSParseState *s)
+{
+ switch (s->token.val) {
+ case TOK_NUMBER:
+ case TOK_STRING:
+ case TOK_REGEXP:
+ case TOK_DEC:
+ case TOK_INC:
+ case TOK_NULL:
+ case TOK_FALSE:
+ case TOK_TRUE:
+ case TOK_THIS:
+ case ')':
+ case ']':
+ case '}':
+ return FALSE;
+ case TOK_IDENT:
+ return token_is_pseudo_keyword(s, JS_ATOM_of) || token_is_pseudo_keyword(s, JS_ATOM_yield);
+ default:
+ return TRUE;
+ }
+}
+
+static __exception int js_parse_regexp(JSParseState *s)
+{
+ const uint8_t *p;
+ BOOL in_class;
+ StringBuffer b_s, *b = &b_s;
+ StringBuffer b2_s, *b2 = &b2_s;
+ uint32_t c;
+
+ p = s->buf_ptr;
+ p++;
+ in_class = FALSE;
+ if (string_buffer_init(s->ctx, b, 32))
+ return -1;
+ if (string_buffer_init(s->ctx, b2, 1))
+ goto fail;
+ for(;;) {
+ if (p >= s->buf_end) {
+ eof_error:
+ js_parse_error(s, "unexpected end of regexp");
+ goto fail;
+ }
+ c = *p++;
+ if (c == '\n' || c == '\r') {
+ goto eol_error;
+ } else if (c == '/') {
+ if (!in_class)
+ break;
+ } else if (c == '[') {
+ in_class = TRUE;
+ } else if (c == ']') {
+ /* XXX: incorrect as the first character in a class */
+ in_class = FALSE;
+ } else if (c == '\\') {
+ if (string_buffer_putc8(b, c))
+ goto fail;
+ c = *p++;
+ if (c == '\n' || c == '\r')
+ goto eol_error;
+ else if (c == '\0' && p >= s->buf_end)
+ goto eof_error;
+ else if (c >= 0x80) {
+ const uint8_t *p_next;
+ c = unicode_from_utf8(p - 1, UTF8_CHAR_LEN_MAX, &p_next);
+ if (c > 0x10FFFF) {
+ goto invalid_utf8;
+ }
+ p = p_next;
+ if (c == CP_LS || c == CP_PS)
+ goto eol_error;
+ }
+ } else if (c >= 0x80) {
+ const uint8_t *p_next;
+ c = unicode_from_utf8(p - 1, UTF8_CHAR_LEN_MAX, &p_next);
+ if (c > 0x10FFFF) {
+ invalid_utf8:
+ js_parse_error(s, "invalid UTF-8 sequence");
+ goto fail;
+ }
+ p = p_next;
+ /* LS or PS are considered as line terminator */
+ if (c == CP_LS || c == CP_PS) {
+ eol_error:
+ js_parse_error(s, "unexpected line terminator in regexp");
+ goto fail;
+ }
+ }
+ if (string_buffer_putc(b, c))
+ goto fail;
+ }
+
+ /* flags */
+ for(;;) {
+ const uint8_t *p_next = p;
+ c = *p_next++;
+ if (c >= 0x80) {
+ c = unicode_from_utf8(p, UTF8_CHAR_LEN_MAX, &p_next);
+ if (c > 0x10FFFF) {
+ goto invalid_utf8;
+ }
+ }
+ if (!lre_js_is_ident_next(c))
+ break;
+ if (string_buffer_putc(b2, c))
+ goto fail;
+ p = p_next;
+ }
+
+ s->token.val = TOK_REGEXP;
+ s->token.u.regexp.body = string_buffer_end(b);
+ s->token.u.regexp.flags = string_buffer_end(b2);
+ s->buf_ptr = p;
+ return 0;
+ fail:
+ string_buffer_free(b);
+ string_buffer_free(b2);
+ return -1;
+}
+
+static __exception int next_token(JSParseState *s)
+{
+ const uint8_t *p;
+ int c;
+ char buf[4096], *q;
+ BOOL ident_has_escape;
+
+ free_token(s, &s->token);
+
+ p = s->last_ptr = s->buf_ptr;
+ s->got_lf = FALSE;
+ s->last_line_num = s->token.line_num;
+ redo:
+ s->token.line_num = s->line_num;
+ s->token.ptr = p;
+ c = *p;
+ switch(c) {
+ case 0:
+ s->token.val = TOK_EOF;
+ break;
+ case '`':
+ if (!s->cur_func) {
+ /* JSON does not accept templates */
+ goto def_token;
+ }
+ if (js_parse_template_part(s, p + 1))
+ goto fail;
+ p = s->buf_ptr;
+ break;
+ case '\'':
+ if (!s->cur_func) {
+ /* JSON does not accept single quoted strings */
+ goto def_token;
+ }
+ /* fall through */
+ case '\"':
+ if (js_parse_string(s, c, TRUE, p + 1, &s->token, &p))
+ goto fail;
+ break;
+ case '\r': /* accept DOS and MAC newline sequences */
+ if (p[1] == '\n') {
+ p++;
+ }
+ /* fall thru */
+ case '\n':
+ p++;
+ line_terminator:
+ s->got_lf = TRUE;
+ s->line_num++;
+ goto redo;
+ case '\f':
+ case '\v':
+ if (!s->cur_func) {
+ /* JSONWhitespace does not match , nor */
+ goto def_token;
+ }
+ /* fall through */
+ case ' ':
+ case '\t':
+ p++;
+ goto redo;
+ case '/':
+ if (p[1] == '*') {
+ /* comment */
+ p += 2;
+ for(;;) {
+ if (*p == '\0' && p >= s->buf_end) {
+ js_parse_error(s, "unexpected end of comment");
+ goto fail;
+ }
+ if (p[0] == '*' && p[1] == '/') {
+ p += 2;
+ break;
+ }
+ if (*p == '\n')
+ s->line_num++;
+ p++;
+ }
+ goto redo;
+ } else if (p[1] == '/') {
+ /* line comment */
+ p += 2;
+ skip_line_comment:
+ for(;;) {
+ if (*p == '\0' && p >= s->buf_end)
+ break;
+ if (*p == '\r' || *p == '\n')
+ break;
+ if (*p >= 0x80) {
+ c = unicode_from_utf8(p, UTF8_CHAR_LEN_MAX, &p);
+ /* LS or PS are considered as line terminator */
+ if (c == CP_LS || c == CP_PS)
+ break;
+ } else {
+ p++;
+ }
+ }
+ goto redo;
+ } else if (is_regexp_allowed(s)) {
+ s->buf_ptr = p;
+ if (js_parse_regexp(s))
+ goto fail;
+ p = s->buf_ptr;
+ } else if (p[1] == '=') {
+ p += 2;
+ s->token.val = TOK_DIV_ASSIGN;
+ } else {
+ p++;
+ s->token.val = c;
+ }
+ break;
+ case '\\':
+ if (p[1] == 'u') {
+ const uint8_t *p1 = p + 1;
+ int c1 = lre_parse_escape(&p1, TRUE);
+ if (c1 >= 0 && lre_js_is_ident_first(c1)) {
+ c = c1;
+ p = p1;
+ ident_has_escape = TRUE;
+ goto has_ident;
+ } else {
+ /* XXX: syntax error? */
+ }
+ }
+ goto def_token;
+#if defined(_MSC_VER)
+ case 'a':
+ case 'b':
+ case 'c':
+ case 'd':
+ case 'e':
+ case 'f':
+ case 'g':
+ case 'h':
+ case 'i':
+ case 'j':
+ case 'k':
+ case 'l':
+ case 'm':
+ case 'n':
+ case 'o':
+ case 'p':
+ case 'q':
+ case 'r':
+ case 's':
+ case 't':
+ case 'u':
+ case 'v':
+ case 'w':
+ case 'x':
+ case 'y':
+ case 'z':
+#else
+ case 'a' ... 'z':
+#endif
+#if defined(_MSC_VER)
+ case 'A':
+ case 'B':
+ case 'C':
+ case 'D':
+ case 'E':
+ case 'F':
+ case 'G':
+ case 'H':
+ case 'I':
+ case 'J':
+ case 'K':
+ case 'L':
+ case 'M':
+ case 'N':
+ case 'O':
+ case 'P':
+ case 'Q':
+ case 'R':
+ case 'S':
+ case 'T':
+ case 'U':
+ case 'V':
+ case 'W':
+ case 'X':
+ case 'Y':
+ case 'Z':
+#else
+ case 'A' ... 'Z':
+#endif
+ case '_':
+ case '$':
+ /* identifier */
+ p++;
+ ident_has_escape = FALSE;
+ has_ident:
+ q = buf;
+ for(;;) {
+ const uint8_t *p1 = p;
+
+ if (c < 128) {
+ *q++ = c;
+ } else {
+ q += unicode_to_utf8((uint8_t*)q, c);
+ }
+ c = *p1++;
+ if (c == '\\' && *p1 == 'u') {
+ c = lre_parse_escape(&p1, TRUE);
+ ident_has_escape = TRUE;
+ } else if (c >= 128) {
+ c = unicode_from_utf8(p, UTF8_CHAR_LEN_MAX, &p1);
+ }
+ /* XXX: check if c >= 0 and c <= 0x10FFFF */
+ if (!lre_js_is_ident_next(c))
+ break;
+ p = p1;
+ if ((q - buf) >= sizeof(buf) - UTF8_CHAR_LEN_MAX) {
+ js_parse_error(s, "identifier too long");
+ goto fail;
+ }
+ }
+ *q = '\0';
+ s->token.u.ident.atom = JS_NewAtomLen(s->ctx, buf, q - buf);
+ s->token.u.ident.has_escape = ident_has_escape;
+ s->token.u.ident.is_reserved = FALSE;
+ if (s->token.u.ident.atom <= JS_ATOM_LAST_KEYWORD ||
+ (s->token.u.ident.atom <= JS_ATOM_LAST_STRICT_KEYWORD &&
+ s->cur_func && (s->cur_func->js_mode & JS_MODE_STRICT)) ||
+ (s->token.u.ident.atom == JS_ATOM_yield && s->cur_func &&
+ ((s->cur_func->func_kind & JS_FUNC_GENERATOR) ||
+ (s->cur_func->func_type == JS_PARSE_FUNC_ARROW &&
+ !s->cur_func->in_function_body && s->cur_func->parent &&
+ (s->cur_func->parent->func_kind & JS_FUNC_GENERATOR)))) ||
+ (s->token.u.ident.atom == JS_ATOM_await &&
+ (s->is_module ||
+ (s->cur_func &&
+ ((s->cur_func->func_kind & JS_FUNC_ASYNC) ||
+ (s->cur_func->func_type == JS_PARSE_FUNC_ARROW &&
+ !s->cur_func->in_function_body && s->cur_func->parent &&
+ (s->cur_func->parent->func_kind & JS_FUNC_ASYNC))))))) {
+ if (ident_has_escape) {
+ s->token.u.ident.is_reserved = TRUE;
+ s->token.val = TOK_IDENT;
+ } else {
+ /* The keywords atoms are pre allocated */
+ s->token.val = s->token.u.ident.atom - 1 + TOK_FIRST_KEYWORD;
+ }
+ } else {
+ s->token.val = TOK_IDENT;
+ }
+ break;
+ case '.':
+ if (p[1] == '.' && p[2] == '.') {
+ p += 3;
+ s->token.val = TOK_ELLIPSIS;
+ break;
+ }
+ if (p[1] >= '0' && p[1] <= '9') {
+ goto parse_number;
+ } else {
+ goto def_token;
+ }
+ break;
+ case '0':
+ /* in strict or JSON parsing mode, octal literals are not accepted */
+ if (is_digit(p[1]) && (!s->cur_func ||
+ (s->cur_func->js_mode & JS_MODE_STRICT))) {
+ js_parse_error(s, "octal literals are deprecated in strict mode");
+ goto fail;
+ }
+ goto parse_number;
+#if defined(_MSC_VER)
+ case '1':
+ case '2':
+ case '3':
+ case '4':
+ case '5':
+ case '6':
+ case '7':
+ case '8':
+ case '9':
+#else
+ case '1' ... '9':
+#endif
+ /* number */
+ parse_number:
+#ifdef CONFIG_BIGNUM
+ {
+ const uint8_t *p1;
+ int flags;
+ slimb_t exponent;
+ JSValue val;
+
+ s->token.val = TOK_NUMBER;
+ s->token.u.num.val = JS_UNDEFINED;
+ s->token.u.num.exponent = 0;
+ if (!s->cur_func) {
+ /* JSON: use current float precision */
+ flags = BF_ATOF_THROW;
+ if (is_bignum_mode(s->ctx))
+ flags |= BF_ATOF_INT_PREC_INF;
+ else
+ flags |= BF_ATOF_FLOAT64;
+ val = js_atof(s->ctx, (const char *)p, (const char **)&p,
+ 10, flags);
+ if (JS_IsException(val))
+ goto bad_number;
+ } else {
+ bf_t r_s, *r = &r_s;
+ BOOL bigint_mode, is_bigint, is_bigfloat;
+ int res;
+
+ bigint_mode = (s->cur_func->js_mode & JS_MODE_BIGINT) != 0;
+ flags = BF_ATOF_BIN_OCT | BF_ATOF_LEGACY_OCTAL |
+ BF_ATOF_UNDERSCORE_SEP | BF_ATOF_INT_PREC_INF | BF_RNDZ;
+ if (!bigint_mode)
+ flags |= BF_ATOF_ONLY_DEC_FLOAT;
+ p += skip_spaces((char *)p);
+ bf_init(s->ctx->bf_ctx, r);
+ res = bf_atof2(r, &exponent, (const char *)p,
+ (const char **)&p, 0, BF_PREC_INF, flags);
+ if (bf_is_nan(r)) {
+ bf_delete(r);
+ goto bad_number;
+ }
+ is_bigint = FALSE;
+ is_bigfloat = FALSE;
+ if (*p == 'n') {
+ if (!(res & BF_ATOF_ST_INTEGER)) {
+ bf_delete(r);
+ goto bad_number;
+ }
+ p++;
+ is_bigint = TRUE;
+ } else if (*p == 'l') {
+ p++;
+ is_bigfloat = TRUE;
+ }
+ if ((res & BF_ATOF_ST_INTEGER) && !is_bigfloat &&
+ (bigint_mode || is_bigint)) {
+ /* in bigint mode: small integer or bigint
+ in legacy mode: always a bigint */
+ val = JS_NewBigInt2(s->ctx, r, bigint_mode ^ 1);
+ } else {
+ /* `n` suffix is implied in math mode */
+ if (s->cur_func->js_mode & JS_MODE_MATH)
+ is_bigfloat = TRUE;
+ if (is_bigfloat) {
+ /* infinite precision */
+ val = JS_NewBigFloat(s->ctx, r);
+ s->token.u.num.exponent = exponent;
+ } else {
+ double d;
+ d = bf_mul_pow10_to_float64(s->ctx, r, exponent);
+ bf_delete(r);
+ val = JS_NewFloat64(s->ctx, d);
+ }
+ }
+ }
+ s->token.u.num.val = val;
+ if (lre_js_is_ident_next(unicode_from_utf8(p, UTF8_CHAR_LEN_MAX, &p1))) {
+ bad_number:
+ js_parse_error(s, "invalid number literal");
+ goto fail;
+ }
+ }
+#else
+ {
+ JSValue ret;
+ const uint8_t *p1;
+ int flags, radix;
+ if (!s->cur_func) {
+ flags = ATOD_THROW;
+ radix = 10;
+ } else {
+ flags = ATOD_ACCEPT_BIN_OCT | ATOD_THROW | ATOD_ACCEPT_LEGACY_OCTAL |
+ ATOD_ACCEPT_UNDERSCORES;
+ radix = 0;
+ }
+ ret = js_atod(s->ctx, (const char *)p, (const char **)&p, radix,
+ flags);
+ /* reject `10instanceof Number` */
+ if (JS_IsException(ret) ||
+ lre_js_is_ident_next(unicode_from_utf8(p, UTF8_CHAR_LEN_MAX, &p1))) {
+ js_parse_error(s, "invalid number literal");
+ goto fail;
+ }
+ s->token.val = TOK_NUMBER;
+ s->token.u.num.val = ret;
+ }
+#endif
+ break;
+ case '*':
+ if (p[1] == '=') {
+ p += 2;
+ s->token.val = TOK_MUL_ASSIGN;
+ } else if (p[1] == '*') {
+ if (p[2] == '=') {
+ p += 3;
+ s->token.val = TOK_POW_ASSIGN;
+ } else {
+ p += 2;
+ s->token.val = TOK_POW;
+ }
+ } else {
+ goto def_token;
+ }
+ break;
+ case '%':
+ if (p[1] == '=') {
+ p += 2;
+ s->token.val = TOK_MOD_ASSIGN;
+ } else {
+ goto def_token;
+ }
+ break;
+ case '+':
+ if (p[1] == '=') {
+ p += 2;
+ s->token.val = TOK_PLUS_ASSIGN;
+ } else if (p[1] == '+') {
+ p += 2;
+ s->token.val = TOK_INC;
+ } else {
+ goto def_token;
+ }
+ break;
+ case '-':
+ if (p[1] == '=') {
+ p += 2;
+ s->token.val = TOK_MINUS_ASSIGN;
+ } else if (p[1] == '-') {
+ if (s->allow_html_comments &&
+ p[2] == '>' && s->last_line_num != s->line_num) {
+ /* Annex B: `-->` at beginning of line is an html comment end.
+ It extends to the end of the line.
+ */
+ goto skip_line_comment;
+ }
+ p += 2;
+ s->token.val = TOK_DEC;
+ } else {
+ goto def_token;
+ }
+ break;
+ case '<':
+ if (p[1] == '=') {
+ p += 2;
+ s->token.val = TOK_LTE;
+ } else if (p[1] == '<') {
+ if (p[2] == '=') {
+ p += 3;
+ s->token.val = TOK_SHL_ASSIGN;
+ } else {
+ p += 2;
+ s->token.val = TOK_SHL;
+ }
+ } else if (s->allow_html_comments &&
+ p[1] == '!' && p[2] == '-' && p[3] == '-') {
+ /* Annex B: handle `