* Fetch the string at index "idx", or NULL if no string is stored at that * offset. */

* Wraps vasync's pipeline so that each function in the pipeline gets called * with (state, cb) as its arguments. state contains the output of previou

* Append a path string, "inp", to the end of the path string already present * in "path". Ensures that there is a "/" between the existing path, if

* This routine tries to optimize name gets and sets to stack slot loads and * stores, given the variables object and scope chain in cx's top frame, t

* If the property at the given index exists, get its value into location * pointed by vp and set *hole to false. Otherwise set *hole to true and *vp

* Determine if the id represents an array index or an XML property index. * * An id is an array index according to ECMA by (15.4): * * "Array obje

* Contact the hypervisor metadata agent and request the value for the provided * key name. Returns a C string if a value is found, NULL if no value

Return b*m + a. Deallocate the old b. Both a and m must be between 0 and * 65535 inclusive. NOTE: old b is deallocated on memory failure. */

Return b * 2^k. Deallocate the old b. k must be nonnegative. * NOTE: on memory failure, old b is deallocated. */

Return -1, 0, or 1 depending on whether a<b, a==b, or a>b, respectively. */

* Merges two objects based on their keys and returns the result. In a key * conflict, obj1 wins.

* Creates a nested set of objects based on the argument names, like: * args[0] = { args[1]: { args[2]: {} } } * If the last argument is an objec

* 1. If IgnoreCase is false, return ch. * 2. Let u be ch converted to upper case as if by calling * String.prototype.toUpperCase on the one-chara

ECMA-357 9.1.1.1 XML [[Get]] and 9.2.1.1 XMLList [[Get]]. */

** Iterate over the entries in the hash table calling func for each ** entry found. Stop if "f" says to (return value & JS_ENUMERATE_STOP). ** Return

* Allocate a strlist_t. */

* Copy "str" into the first non-NULL element of the array, or fail with ENOSPC * if all elements are occupied. */

* Allocate a Bigint with 2^k words. * This is not threadsafe. The caller must use thread locks */