Checks whether the given shell list is actually a request to execute raw * commands without an external shell. */

We need a mechanism to release the lock and invoke finalizers. */ We don't really have an opportunity to do this on a rarely executed */ path on which

Return the minimum number of words that must be allocated between */ collections to amortize the collection cost. */

Returns true if running on windows, whether in cygwin or not.

Replaces the grist of a string by a new one. Returns the string with the new grist.

Unlinks the specified file name. The file name may be a list, in which case the elements are concatenated using the os.path.join()

Find the first occurrence of s in x at position start or later. */ This uses an asymptotically poor algorithm, which should typically */ perform acce

* Use the chunk of memory starting at p of size bytes as part of the heap. * Assumes p is HBLKSIZE aligned, and bytes is a multiple of HBLKSIZE. */

Allocate a large block of size lb bytes. Clear if appropriate. */ We hold the allocation lock. */ EXTRA_BYTES were already added to lb. */

Build a free list for objects of size sz inside heap block h. */ Clear objects inside h if clear is set. Add list to the end of */ the free list we b

ARGSUSED*/

Check that all thread-local free-lists in p are completely marked. */

clear all mark bits in the header */

* Clear mark bits in all allocated heap blocks. This invalidates * the marker invariant, and sets GC_mark_state to reflect this. * (This implicitly

If a thread has been joined, but we have not yet */ been notified, then there may be more than one thread */ in the table with the same pthread id.

Mark the page containing p as dirty. Logically, this dirties the */ entire object. */

Try to read the backing store base from /proc/self/maps. */ Return the bounds of the writable mapping with a 0 major device, */ which includes the ad

Return the first nonaddressible location > p (up) or */ the smallest location q s.t. [q,p) is addressable (!up). */ We assume that p (up) or p-1 (!up

* Return a pointer to the free block ending just before h, if any. */

Force a garbage collection and generate a backtrace from a */ random heap address. */

Allocate memory such that only pointers to near the */ beginning of the object are considered. */ We avoid holding alloc

Return a list of 1 or more objects of the indicated size, linked */ through the first word in the object. This has the advantage that */ it acquires

Double the size of a hash table. *size_ptr is the log of its current */ size. May be a noop. */ table is a pointer to an array of hash headers.

Is p the start of either the malloc heap, or of one of our */ heap sections? */

Is p the base of one of the malloc heap sections we already know */ about? */

Return a GC_thread corresponding to a given pthread_t. */ Returns 0 if it's not there. */ We assume that this is only called for pthread ids that

Stubborn object (hard to change, nearly immutable) allocation. */ This interface is deprecated. We mostly emulate it using */ MANUAL_VDB. But that

Mark using the local mark stack until the global mark stack is empty */ and there are no active workers. Update GC_first_nonempty to reflect */ progre