** Add elements in 'list' to list of pending jumps to "here" ** (current position) */

** Ensures the stack has at least 'space' extra slots, raising an error ** if it cannot fulfill the request. (The error handling needs a few ** extra

Place a 32-bit number into a buffer in PNG byte order. We work * with unsigned numbers for convenience, although one supported * ancillary chunk us

Internal use only. Called when finished processing a row of data. */

convert UTF-8 back to WCHAR. Caller is responsible for freeing memory */

The FP format map uses two bits (Q, size<0>) to encode the NEON FP vector formats: NF_2S, NF_4S, NF_2D.

Provide both double and float interfaces for FP immediate loads, rather than relying on implicit C++ casts. This allows signalling NaNs to be preserve

functions !

========================================================================= */

** Concatenate jump-list 'l2' into jump-list 'l1' */

** returns a pointer to a free area with at least 'sz' bytes */

** new string (with explicit length) */

On windows, transform / to \\

* Checks if the DNS name doesn't exceed 256 bytes including zero-byte. * * @param namelen Length of the DNS name-string including zero-byte * @r

Free all memory used by the read */

This does the right thing based on the bit_depth field of the * png_struct, interpreting values as 8-bit or 16-bit. While the result * is nominally

Manage the read buffer; this simply reallocates the buffer if it is not small * enough (or if it is not allocated). The routine returns a pointer to

Return current cycle count, in 64 bits (effectivelly never wraps) */