XXX: we use the same chars for name and value */

check if there are pending promise rejections. It must be done asynchrously in case a rejected promise is handled later. Currently we do it once

conv_type: 0 = to upper 1 = to lower 2 = case folding (= to lower with modifications) */

'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

Return 1 if match, 0 if not match or < 0 if error (see LRE_RET_x). cindex is the starting position of the match and must be such as 0 <= cindex <=

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

tabr[] = taba[] * b + l. Return the high carry */

r = (a << shift) + low. 1 <= shift <= LIMB_BITS - 1, 0 <= low < 2^shift. */

floor_log2() = position of the first non zero bit or -1 if zero. */

r = r * radix_base + a. radix_base = 0 means radix_base = 2^32 */

return (m, e) such that m*2^(e-53) = round(a * radix^f) with 2^52 <= m < 2^53 or m = 0. 'a' is modified. */

return round(a*2^e_offset) rounded as a float64. 'a' is modified */

not reentrant, but not needed with emscripten */

for power of 2 radixes. len >= 1 */

return 0 if no pair found */

return the length of the decomposition (length <= UNICODE_DECOMP_LEN_MAX) or 0 if no decomposition */

'cr' must be initialized and empty. Return 0 if OK, -1 if error, -2 if not found */

Note: at most 31 bits are encoded. At most UTF8_CHAR_LEN_MAX bytes are output. */

also used to initialize the worker context */