** Start the scope for the last 'nvars' created variables. */

used in setup, and for huffman that doesn't go fast path

Emits one bytecode instruction followed by a 8-bit argument. Returns the index of the argument in the bytecode.

Emits [instruction] followed by a placeholder for a jump offset. The placeholder can be patched by calling [jumpPatch]. Returns the index of the place

** create a new collectable object (with given type and size) and link ** it to 'allgc' list. */

** Search function for integers. If integer is inside 'alimit', get it ** directly from the array part. Otherwise, if 'alimit' is not equal to ** the

** Change line information associated with current position, by removing ** previous info and adding it again with new line. */

** new string (with explicit length) */

** Finish the table access 'val = t[key]'. ** if 'slot' is NULL, 't' is not a table; otherwise, 'slot' points to ** t[k] entry (which must be empty).

** About the overflow check: an overflow cannot occur when time ** is represented by a lua_Integer, because either lua_Integer is ** large enough to r

take a -128..127 value and stbi__clamp it and convert to 0..255

returns 1 if "a*b*c + add" has no negative terms/factors and doesn't overflow

p_min = upper-left, p_max = lower-right

We should in theory be using fseeko()/ftello() with off_t and _fseeki64()/_ftelli64() with __int64, waiting for the PR that does that in a very portab

[1.71: 2019/06/07: Updating prototypes of some of the internal functions. Leaving those for reference for a short while]

Creates a new constant for the current value and emits the bytecode to load it from the constant table.

** Free register 'reg', if it is neither a constant index nor ** a local variable. ) */

Returns true if [c] is a digit.

** advances the garbage collector until it reaches a state allowed ** by 'statemask' */

** Similar to 'luaD_call', but does not allow yields during the call. */

** Finishes a function call: calls hook if necessary, moves current ** number of results to proper place, and returns to previous call ** info. If fun

** Close all upvalues and to-be-closed variables up to the given stack ** level. */

** returns current 'pc' and marks it as a jump target (to avoid wrong ** optimizations with consecutive instructions not in the same basic block). */

** set functions from list 'l' into table at top - 'nup'; each ** function gets the 'nup' elements at the top as upvalues. ** Returns with only the ta

** Finish a table assignment 't[key] = val'. ** If 'slot' is NULL, 't' is not a table. Otherwise, 'slot' points ** to the entry 't[key]', or to a val

** Convert 'nvar', a compiler index level, to its corresponding ** register. For that, search for the highest variable below that level ** that is in

Transfer execution to [fiber] coming from the current fiber whose stack has [args]. [isCall] is true if [fiber] is being called and not transferred.

initialize a callback-based context

initialize a memory-decode context

For perf reasons this code is duplicated in stbir__resample_horizontal_upsample/downsample, if you change it here change it there too.

** If expression is a numeric constant, fills 'v' with its value ** and returns 1. Otherwise, returns 0. */

If the current character is [c], then consumes it and makes a token of type [two]. Otherwise makes a token of type [one].