/* -*- Mode: C++; tab-width: 8; indent-tabs-mode: nil; c-basic-offset: 4 -*- * vim: set ts=8 sw=4 et tw=78: * * ***** BEGIN LICENSE BLOCK ***** * Version: MPL 1.1/GPL 2.0/LGPL 2.1 * * The contents of this file are subject to the Mozilla Public License Version * 1.1 (the "License"); you may not use this file except in compliance with * the License. You may obtain a copy of the License at * http://www.mozilla.org/MPL/ * * Software distributed under the License is distributed on an "AS IS" basis, * WITHOUT WARRANTY OF ANY KIND, either express or implied. See the License * for the specific language governing rights and limitations under the * License. * * The Original Code is Mozilla Communicator client code, released * March 31, 1998. * * The Initial Developer of the Original Code is * Netscape Communications Corporation. * Portions created by the Initial Developer are Copyright (C) 1998 * the Initial Developer. All Rights Reserved. * * Contributor(s): * * Alternatively, the contents of this file may be used under the terms of * either of the GNU General Public License Version 2 or later (the "GPL"), * or the GNU Lesser General Public License Version 2.1 or later (the "LGPL"), * in which case the provisions of the GPL or the LGPL are applicable instead * of those above. If you wish to allow use of your version of this file only * under the terms of either the GPL or the LGPL, and not to allow others to * use your version of this file under the terms of the MPL, indicate your * decision by deleting the provisions above and replace them with the notice * and other provisions required by the GPL or the LGPL. If you do not delete * the provisions above, a recipient may use your version of this file under * the terms of any one of the MPL, the GPL or the LGPL. * * ***** END LICENSE BLOCK ***** */ #ifndef jscntxt_h___ #define jscntxt_h___ /* * JS execution context. */ #include /* Gross special case for Gecko, which defines malloc/calloc/free. */ #ifdef mozilla_mozalloc_macro_wrappers_h # define JS_UNDEFD_MOZALLOC_WRAPPERS /* The "anti-header" */ # include "mozilla/mozalloc_undef_macro_wrappers.h" #endif #include "jsprvtd.h" #include "jsarena.h" /* Added by JSIFY */ #include "jsclist.h" #include "jslong.h" #include "jsatom.h" #include "jsdhash.h" #include "jsdtoa.h" #include "jsgc.h" #include "jsgcchunk.h" #include "jshashtable.h" #include "jsinterp.h" #include "jsobj.h" #include "jspropertycache.h" #include "jspropertytree.h" #include "jsregexp.h" #include "jsutil.h" #include "jsarray.h" #include "jstask.h" #include "jsvector.h" #include "prmjtime.h" #ifdef _MSC_VER #pragma warning(push) #pragma warning(disable:4100) /* Silence unreferenced formal parameter warnings */ #pragma warning(push) #pragma warning(disable:4355) /* Silence warning about "this" used in base member initializer list */ #endif /* * js_GetSrcNote cache to avoid O(n^2) growth in finding a source note for a * given pc in a script. We use the script->code pointer to tag the cache, * instead of the script address itself, so that source notes are always found * by offset from the bytecode with which they were generated. */ typedef struct JSGSNCache { jsbytecode *code; JSDHashTable table; #ifdef JS_GSNMETER uint32 hits; uint32 misses; uint32 fills; uint32 purges; # define GSN_CACHE_METER(cache,cnt) (++(cache)->cnt) #else # define GSN_CACHE_METER(cache,cnt) /* nothing */ #endif } JSGSNCache; #define js_FinishGSNCache(cache) js_PurgeGSNCache(cache) extern void js_PurgeGSNCache(JSGSNCache *cache); /* These helper macros take a cx as parameter and operate on its GSN cache. */ #define JS_PURGE_GSN_CACHE(cx) js_PurgeGSNCache(&JS_GSN_CACHE(cx)) #define JS_METER_GSN_CACHE(cx,cnt) GSN_CACHE_METER(&JS_GSN_CACHE(cx), cnt) /* Forward declarations of nanojit types. */ namespace nanojit { class Assembler; class CodeAlloc; class Fragment; template struct DefaultHash; template class HashMap; template class Seq; } /* namespace nanojit */ namespace JSC { class ExecutableAllocator; } namespace js { /* Tracer constants. */ static const size_t MONITOR_N_GLOBAL_STATES = 4; static const size_t FRAGMENT_TABLE_SIZE = 512; static const size_t MAX_NATIVE_STACK_SLOTS = 4096; static const size_t MAX_CALL_STACK_ENTRIES = 500; static const size_t MAX_GLOBAL_SLOTS = 4096; static const size_t GLOBAL_SLOTS_BUFFER_SIZE = MAX_GLOBAL_SLOTS + 1; static const size_t MAX_SLOW_NATIVE_EXTRA_SLOTS = 16; /* Forward declarations of tracer types. */ class VMAllocator; class FrameInfoCache; struct REHashFn; struct REHashKey; struct FrameInfo; struct VMSideExit; struct TreeFragment; struct TracerState; template class Queue; typedef Queue SlotList; class TypeMap; struct REFragment; typedef nanojit::HashMap REHashMap; #if defined(JS_JIT_SPEW) || defined(DEBUG) struct FragPI; typedef nanojit::HashMap > FragStatsMap; #endif /* * Allocation policy that calls JSContext memory functions and reports errors * to the context. Since the JSContext given on construction is stored for * the lifetime of the container, this policy may only be used for containers * whose lifetime is a shorter than the given JSContext. */ class ContextAllocPolicy { JSContext *cx; public: ContextAllocPolicy(JSContext *cx) : cx(cx) {} JSContext *context() const { return cx; } /* Inline definitions below. */ void *malloc(size_t bytes); void free(void *p); void *realloc(void *p, size_t bytes); void reportAllocOverflow() const; }; /* Holds the execution state during trace execution. */ struct TracerState { JSContext* cx; // current VM context handle double* stackBase; // native stack base double* sp; // native stack pointer, stack[0] is spbase[0] double* eos; // first unusable word after the native stack / begin of globals FrameInfo** callstackBase; // call stack base void* sor; // start of rp stack FrameInfo** rp; // call stack pointer void* eor; // first unusable word after the call stack VMSideExit* lastTreeExitGuard; // guard we exited on during a tree call VMSideExit* lastTreeCallGuard; // guard we want to grow from if the tree // call exit guard mismatched void* rpAtLastTreeCall; // value of rp at innermost tree call guard VMSideExit* outermostTreeExitGuard; // the last side exit returned by js_CallTree TreeFragment* outermostTree; // the outermost tree we initially invoked uintN* inlineCallCountp; // inline call count counter VMSideExit** innermostNestedGuardp; VMSideExit* innermost; uint64 startTime; TracerState* prev; // Used by _FAIL builtins; see jsbuiltins.h. The builtin sets the // JSBUILTIN_BAILED bit if it bails off trace and the JSBUILTIN_ERROR bit // if an error or exception occurred. uint32 builtinStatus; // Used to communicate the location of the return value in case of a deep bail. double* deepBailSp; // Used when calling natives from trace to root the vp vector. uintN nativeVpLen; js::Value* nativeVp; // The regs pointed to by cx->regs while a deep-bailed slow native // completes execution. JSFrameRegs bailedSlowNativeRegs; TracerState(JSContext *cx, TraceMonitor *tm, TreeFragment *ti, uintN &inlineCallCountp, VMSideExit** innermostNestedGuardp); ~TracerState(); }; /* * Storage for the execution state and store during trace execution. Generated * code depends on the fact that the globals begin |MAX_NATIVE_STACK_SLOTS| * doubles after the stack begins. Thus, on trace, |TracerState::eos| holds a * pointer to the first global. */ struct TraceNativeStorage { double stack_global_buf[MAX_NATIVE_STACK_SLOTS + GLOBAL_SLOTS_BUFFER_SIZE]; FrameInfo *callstack_buf[MAX_CALL_STACK_ENTRIES]; double *stack() { return stack_global_buf; } double *global() { return stack_global_buf + MAX_NATIVE_STACK_SLOTS; } FrameInfo **callstack() { return callstack_buf; } }; /* Holds data to track a single globa. */ struct GlobalState { JSObject* globalObj; uint32 globalShape; SlotList* globalSlots; }; /* * A StackSegment (referred to as just a 'segment') contains a down-linked set * of stack frames and the slots associated with each frame. A segment and its * contained frames/slots also have a precise memory layout that is described * in the js::StackSpace comment. A key layout invariant for segments is that * down-linked frames are adjacent in memory, separated only by the values that * constitute the locals and expression stack of the down-frame and arguments * of the up-frame. * * The set of stack frames in a non-empty segment start at the segment's * "current frame", which is the most recently pushed frame, and ends at the * segment's "initial frame". Note that, while all stack frames in a segment * are down-linked, not all down-linked frames are in the same segment. Hence, * for a segment |ss|, |ss->getInitialFrame()->down| may be non-null and in a * different segment. This occurs when the VM reenters itself (via Invoke or * Execute). In full generality, a single context may contain a forest of trees * of stack frames. With respect to this forest, a segment contains a linear * path along a single tree, not necessarily to the root. * * The frames of a non-empty segment must all be in the same context and thus * each non-empty segment is referred to as being "in" a context. Segments in a * context have an additional state of being either "active" or "suspended". A * suspended segment |ss| has a "suspended frame" which is snapshot of |cx->fp| * when the segment was suspended and serves as the current frame of |ss|. * There is at most one active segment in a given context. Segments in a * context execute LIFO and are maintained in a stack. The top of this stack * is the context's "current segment". If a context |cx| has an active segment * |ss|, then: * 1. |ss| is |cx|'s current segment, * 2. |cx->fp != NULL|, and * 3. |ss|'s current frame is |cx->fp|. * Moreover, |cx->fp != NULL| iff |cx| has an active segment. * * An empty segment is not associated with any context. Empty segments are * created when there is not an active segment for a context at the top of the * stack and claim space for the arguments of an Invoke before the Invoke's * stack frame is pushed. During the intervals when the arguments have been * pushed, but not the stack frame, the segment cannot be pushed onto the * context, since that would require some hack to deal with cx->fp not being * the current frame of cx->currentSegment. * * Finally, (to support JS_SaveFrameChain/JS_RestoreFrameChain) a suspended * segment may or may not be "saved". Normally, when the active segment is * popped, the previous segment (which is necessarily suspended) becomes * active. If the previous segment was saved, however, then it stays suspended * until it is made active by a call to JS_RestoreFrameChain. This is why a * context may have a current segment, but not an active segment. */ class StackSegment { /* The context to which this segment belongs. */ JSContext *cx; /* Link for JSContext segment stack mentioned in big comment above. */ StackSegment *previousInContext; /* Link for StackSpace segment stack mentioned in StackSpace comment. */ StackSegment *previousInMemory; /* The first frame executed in this segment. null iff cx is null */ JSStackFrame *initialFrame; /* If this segment is suspended, the top of the segment. */ JSStackFrame *suspendedFrame; /* If this segment is suspended, |cx->regs| when it was suspended. */ JSFrameRegs *suspendedRegs; /* The varobj on entry to initialFrame. */ JSObject *initialVarObj; /* Whether this segment was suspended by JS_SaveFrameChain. */ bool saved; /* * To make isActive a single null-ness check, this non-null constant is * assigned to suspendedFrame when !inContext. */ #define NON_NULL_SUSPENDED_FRAME ((JSStackFrame *)0x1) public: StackSegment() : cx(NULL), previousInContext(NULL), previousInMemory(NULL), initialFrame(NULL), suspendedFrame(NON_NULL_SUSPENDED_FRAME), suspendedRegs(NULL), initialVarObj(NULL), saved(false) { JS_ASSERT(!inContext()); } /* Safe casts guaranteed by the contiguous-stack layout. */ Value *previousSegmentEnd() const { return (Value *)this; } Value *getInitialArgBegin() const { return (Value *)(this + 1); } /* * As described in the comment at the beginning of the class, a segment * is in one of three states: * * !inContext: the segment has been created to root arguments for a * future call to Invoke. * isActive: the segment describes a set of stack frames in a context, * where the top frame currently executing. * isSuspended: like isActive, but the top frame has been suspended. */ bool inContext() const { JS_ASSERT(!!cx == !!initialFrame); JS_ASSERT_IF(!cx, suspendedFrame == NON_NULL_SUSPENDED_FRAME && !saved); return cx; } bool isActive() const { JS_ASSERT_IF(!suspendedFrame, cx && !saved); JS_ASSERT_IF(!cx, suspendedFrame == NON_NULL_SUSPENDED_FRAME); return !suspendedFrame; } bool isSuspended() const { JS_ASSERT_IF(!cx || !suspendedFrame, !saved); JS_ASSERT_IF(!cx, suspendedFrame == NON_NULL_SUSPENDED_FRAME); return cx && suspendedFrame; } /* Substate of suspended, queryable in any state. */ bool isSaved() const { JS_ASSERT_IF(saved, isSuspended()); return saved; } /* Transitioning between inContext <--> isActive */ void joinContext(JSContext *cx, JSStackFrame *f) { JS_ASSERT(!inContext()); this->cx = cx; initialFrame = f; suspendedFrame = NULL; JS_ASSERT(isActive()); } void leaveContext() { JS_ASSERT(isActive()); this->cx = NULL; initialFrame = NULL; suspendedFrame = NON_NULL_SUSPENDED_FRAME; JS_ASSERT(!inContext()); } JSContext *maybeContext() const { return cx; } #undef NON_NULL_SUSPENDED_FRAME /* Transitioning between isActive <--> isSuspended */ void suspend(JSStackFrame *fp, JSFrameRegs *regs) { JS_ASSERT(isActive()); JS_ASSERT(fp && contains(fp)); suspendedFrame = fp; JS_ASSERT(isSuspended()); suspendedRegs = regs; } void resume() { JS_ASSERT(isSuspended()); suspendedFrame = NULL; JS_ASSERT(isActive()); } /* When isSuspended, transitioning isSaved <--> !isSaved */ void save(JSStackFrame *fp, JSFrameRegs *regs) { JS_ASSERT(!isSuspended()); suspend(fp, regs); saved = true; JS_ASSERT(isSaved()); } void restore() { JS_ASSERT(isSaved()); saved = false; resume(); JS_ASSERT(!isSuspended()); } /* Data available when inContext */ JSStackFrame *getInitialFrame() const { JS_ASSERT(inContext()); return initialFrame; } inline JSStackFrame *getCurrentFrame() const; inline JSFrameRegs *getCurrentRegs() const; /* Data available when isSuspended. */ JSStackFrame *getSuspendedFrame() const { JS_ASSERT(isSuspended()); return suspendedFrame; } JSFrameRegs *getSuspendedRegs() const { JS_ASSERT(isSuspended()); return suspendedRegs; } /* JSContext / js::StackSpace bookkeeping. */ void setPreviousInContext(StackSegment *seg) { previousInContext = seg; } StackSegment *getPreviousInContext() const { return previousInContext; } void setPreviousInMemory(StackSegment *seg) { previousInMemory = seg; } StackSegment *getPreviousInMemory() const { return previousInMemory; } void setInitialVarObj(JSObject *obj) { JS_ASSERT(inContext()); initialVarObj = obj; } JSObject *getInitialVarObj() const { JS_ASSERT(inContext()); return initialVarObj; } #ifdef DEBUG JS_REQUIRES_STACK bool contains(const JSStackFrame *fp) const; #endif }; static const size_t VALUES_PER_STACK_SEGMENT = sizeof(StackSegment) / sizeof(Value); JS_STATIC_ASSERT(sizeof(StackSegment) % sizeof(Value) == 0); /* See StackSpace::pushInvokeArgs. */ class InvokeArgsGuard : public CallArgs { friend class StackSpace; JSContext *cx; /* null implies nothing pushed */ StackSegment *seg; Value *prevInvokeArgEnd; #ifdef DEBUG StackSegment *prevInvokeSegment; JSStackFrame *prevInvokeFrame; #endif public: inline InvokeArgsGuard() : cx(NULL), seg(NULL) {} inline InvokeArgsGuard(JSContext *cx, Value *vp, uintN argc); inline ~InvokeArgsGuard(); bool pushed() const { return cx != NULL; } }; /* * This type can be used to call Invoke when the arguments have already been * pushed onto the stack as part of normal execution. */ struct InvokeArgsAlreadyOnTheStack : CallArgs { InvokeArgsAlreadyOnTheStack(Value *vp, uintN argc) : CallArgs(vp + 2, argc) {} }; /* See StackSpace::pushInvokeFrame. */ class InvokeFrameGuard { friend class StackSpace; JSContext *cx; /* null implies nothing pushed */ JSStackFrame *fp; JSFrameRegs regs; JSFrameRegs *prevRegs; public: InvokeFrameGuard() : cx(NULL), fp(NULL) {} JS_REQUIRES_STACK ~InvokeFrameGuard(); bool pushed() const { return cx != NULL; } JSStackFrame *getFrame() { return fp; } JSFrameRegs &getRegs() { return regs; } }; /* See StackSpace::pushExecuteFrame. */ class ExecuteFrameGuard { friend class StackSpace; JSContext *cx; /* null implies nothing pushed */ StackSegment *seg; Value *vp; JSStackFrame *fp; JSStackFrame *down; public: ExecuteFrameGuard() : cx(NULL), vp(NULL), fp(NULL) {} JS_REQUIRES_STACK ~ExecuteFrameGuard(); bool pushed() const { return cx != NULL; } Value *getvp() const { return vp; } JSStackFrame *getFrame() const { return fp; } }; /* * Stack layout * * Each JSThreadData has one associated StackSpace object which allocates all * segments for the thread. StackSpace performs all such allocations in a * single, fixed-size buffer using a specific layout scheme that allows some * associations between segments, frames, and slots to be implicit, rather * than explicitly stored as pointers. To maintain useful invariants, stack * space is not given out arbitrarily, but rather allocated/deallocated for * specific purposes. The use cases currently supported are: calling a function * with arguments (e.g. Invoke), executing a script (e.g. Execute) and inline * interpreter calls. See associated member functions below. * * First, we consider the layout of individual segments. (See the * js::StackSegment comment for terminology.) A non-empty segment (i.e., a * segment in a context) has the following layout: * * initial frame current frame ------. if regs, * .------------. | | regs->sp * | V V V * |segment| slots |frame| slots |frame| slots |frame| slots | * | ^ | ^ | * ? <----------' `----------' `----------' * down down down * * Moreover, the bytes in the following ranges form a contiguous array of * Values that are marked during GC: * 1. between a segment and its first frame * 2. between two adjacent frames in a segment * 3. between a segment's current frame and (if fp->regs) fp->regs->sp * Thus, the VM must ensure that all such Values are safe to be marked. * * An empty segment is followed by arguments that are rooted by the * StackSpace::invokeArgEnd pointer: * * invokeArgEnd * | * V * |segment| slots | * * Above the level of segments, a StackSpace is simply a contiguous sequence * of segments kept in a linked list: * * base currentSegment firstUnused end * | | | | * V V V V * |segment| --- |segment| --- |segment| ------- | | * | ^ | ^ | * 0 <---' `-----------' `-----------' * previous previous previous * * Both js::StackSpace and JSContext maintain a stack of segments, the top of * which is the "current segment" for that thread or context, respectively. * Since different contexts can arbitrarily interleave execution in a single * thread, these stacks are different enough that a segment needs both * "previousInMemory" and "previousInContext". * * For example, in a single thread, a function in segment S1 in a context CX1 * may call out into C++ code that reenters the VM in a context CX2, which * creates a new segment S2 in CX2, and CX1 may or may not equal CX2. * * Note that there is some structure to this interleaving of segments: * 1. the inclusion from segments in a context to segments in a thread * preserves order (in terms of previousInContext and previousInMemory, * respectively). * 2. the mapping from stack frames to their containing segment preserves * order (in terms of down and previousInContext, respectively). */ class StackSpace { Value *base; #ifdef XP_WIN mutable Value *commitEnd; #endif Value *end; StackSegment *currentSegment; #ifdef DEBUG /* * Keep track of which segment/frame bumped invokeArgEnd so that * firstUnused() can assert that, when invokeArgEnd is used as the top of * the stack, it is being used appropriately. */ StackSegment *invokeSegment; JSStackFrame *invokeFrame; #endif Value *invokeArgEnd; JS_REQUIRES_STACK bool pushSegmentForInvoke(JSContext *cx, uintN argc, InvokeArgsGuard &ag); JS_REQUIRES_STACK bool pushInvokeFrameSlow(JSContext *cx, const InvokeArgsGuard &ag, InvokeFrameGuard &fg); JS_REQUIRES_STACK void popInvokeFrameSlow(const CallArgs &args); JS_REQUIRES_STACK void popSegmentForInvoke(const InvokeArgsGuard &ag); /* Although guards are friends, XGuard should only call popX(). */ friend class InvokeArgsGuard; JS_REQUIRES_STACK inline void popInvokeArgs(const InvokeArgsGuard &args); friend class InvokeFrameGuard; JS_REQUIRES_STACK void popInvokeFrame(const InvokeFrameGuard &ag); friend class ExecuteFrameGuard; JS_REQUIRES_STACK void popExecuteFrame(JSContext *cx); /* Return a pointer to the first unused slot. */ JS_REQUIRES_STACK inline Value *firstUnused() const; inline bool isCurrentAndActive(JSContext *cx) const; #ifdef DEBUG StackSegment *getCurrentSegment() const { return currentSegment; } #endif /* * Allocate nvals on the top of the stack, report error on failure. * N.B. the caller must ensure |from == firstUnused()|. */ inline bool ensureSpace(JSContext *maybecx, Value *from, ptrdiff_t nvals) const; #ifdef XP_WIN /* Commit more memory from the reserved stack space. */ JS_FRIEND_API(bool) bumpCommit(Value *from, ptrdiff_t nvals) const; #endif public: static const size_t CAPACITY_VALS = 512 * 1024; static const size_t CAPACITY_BYTES = CAPACITY_VALS * sizeof(Value); static const size_t COMMIT_VALS = 16 * 1024; static const size_t COMMIT_BYTES = COMMIT_VALS * sizeof(Value); /* Kept as a member of JSThreadData; cannot use constructor/destructor. */ bool init(); void finish(); #ifdef DEBUG template bool contains(T *t) const { char *v = (char *)t; JS_ASSERT(size_t(-1) - uintptr_t(t) >= sizeof(T)); return v >= (char *)base && v + sizeof(T) <= (char *)end; } #endif /* * When we LeaveTree, we need to rebuild the stack, which requires stack * allocation. There is no good way to handle an OOM for these allocations, * so this function checks that they cannot occur using the size of the * TraceNativeStorage as a conservative upper bound. */ inline bool ensureEnoughSpaceToEnterTrace(); /* +1 for slow native's stack frame. */ static const ptrdiff_t MAX_TRACE_SPACE_VALS = MAX_NATIVE_STACK_SLOTS + MAX_CALL_STACK_ENTRIES * VALUES_PER_STACK_FRAME + (VALUES_PER_STACK_SEGMENT + VALUES_PER_STACK_FRAME /* synthesized slow native */); /* Mark all segments, frames, and slots on the stack. */ JS_REQUIRES_STACK void mark(JSTracer *trc); /* * For all three use cases below: * - The boolean-valued functions call js_ReportOutOfScriptQuota on OOM. * - The "get*Frame" functions do not change any global state, they just * check OOM and return pointers to an uninitialized frame with the * requested missing arguments/slots. Only once the "push*Frame" * function has been called is global state updated. Thus, between * "get*Frame" and "push*Frame", the frame and slots are unrooted. * - The "push*Frame" functions will set fp->down; the caller needn't. * - Functions taking "*Guard" arguments will use the guard's destructor * to pop the allocation. The caller must ensure the guard has the * appropriate lifetime. * - The get*Frame functions put the 'nmissing' slots contiguously after * the arguments. */ /* * pushInvokeArgs allocates |argc + 2| rooted values that will be passed as * the arguments to Invoke. A single allocation can be used for multiple * Invoke calls. The InvokeArgumentsGuard passed to Invoke must come from * an immediately-enclosing (stack-wise) call to pushInvokeArgs. */ JS_REQUIRES_STACK bool pushInvokeArgs(JSContext *cx, uintN argc, InvokeArgsGuard &ag); /* These functions are called inside Invoke, not Invoke clients. */ bool getInvokeFrame(JSContext *cx, const CallArgs &args, uintN nmissing, uintN nfixed, InvokeFrameGuard &fg) const; JS_REQUIRES_STACK void pushInvokeFrame(JSContext *cx, const CallArgs &args, InvokeFrameGuard &fg); /* * For the simpler case when arguments are allocated at the same time as * the frame and it is not necessary to have rooted argument values before * pushing the frame. */ JS_REQUIRES_STACK bool getExecuteFrame(JSContext *cx, JSStackFrame *down, uintN vplen, uintN nfixed, ExecuteFrameGuard &fg) const; JS_REQUIRES_STACK void pushExecuteFrame(JSContext *cx, ExecuteFrameGuard &fg, JSFrameRegs ®s, JSObject *initialVarObj); /* * Since RAII cannot be used for inline frames, callers must manually * call pushInlineFrame/popInlineFrame. */ JS_REQUIRES_STACK inline JSStackFrame *getInlineFrame(JSContext *cx, Value *sp, uintN nmissing, uintN nfixed) const; JS_REQUIRES_STACK inline void pushInlineFrame(JSContext *cx, JSStackFrame *fp, jsbytecode *pc, JSStackFrame *newfp); JS_REQUIRES_STACK inline void popInlineFrame(JSContext *cx, JSStackFrame *up, JSStackFrame *down); /* * For the special case of the slow native stack frame pushed and popped by * tracing deep bail logic. */ JS_REQUIRES_STACK void getSynthesizedSlowNativeFrame(JSContext *cx, StackSegment *&seg, JSStackFrame *&fp); JS_REQUIRES_STACK void pushSynthesizedSlowNativeFrame(JSContext *cx, StackSegment *seg, JSStackFrame *fp, JSFrameRegs ®s); JS_REQUIRES_STACK void popSynthesizedSlowNativeFrame(JSContext *cx); }; JS_STATIC_ASSERT(StackSpace::CAPACITY_VALS % StackSpace::COMMIT_VALS == 0); /* * While |cx->fp|'s pc/sp are available in |cx->regs|, to compute the saved * value of pc/sp for any other frame, it is necessary to know about that * frame's up-frame. This iterator maintains this information when walking down * a chain of stack frames starting at |cx->fp|. * * Usage: * for (FrameRegsIter i(cx); !i.done(); ++i) * ... i.fp() ... i.sp() ... i.pc() */ class FrameRegsIter { StackSegment *curseg; JSStackFrame *curfp; Value *cursp; jsbytecode *curpc; void initSlow(); void incSlow(JSStackFrame *up, JSStackFrame *down); static inline Value *contiguousDownFrameSP(JSStackFrame *up); public: JS_REQUIRES_STACK inline FrameRegsIter(JSContext *cx); bool done() const { return curfp == NULL; } inline FrameRegsIter &operator++(); JSStackFrame *fp() const { return curfp; } Value *sp() const { return cursp; } jsbytecode *pc() const { return curpc; } }; /* Holds the number of recording attemps for an address. */ typedef HashMap, SystemAllocPolicy> RecordAttemptMap; class Oracle; /* * Trace monitor. Every JSThread (if JS_THREADSAFE) or JSRuntime (if not * JS_THREADSAFE) has an associated trace monitor that keeps track of loop * frequencies for all JavaScript code loaded into that runtime. */ struct TraceMonitor { /* * The context currently executing JIT-compiled code on this thread, or * NULL if none. Among other things, this can in certain cases prevent * last-ditch GC and suppress calls to JS_ReportOutOfMemory. * * !tracecx && !recorder: not on trace * !tracecx && recorder: recording * tracecx && !recorder: executing a trace * tracecx && recorder: executing inner loop, recording outer loop */ JSContext *tracecx; /* * Cached storage to use when executing on trace. While we may enter nested * traces, we always reuse the outer trace's storage, so never need more * than of these. */ TraceNativeStorage *storage; /* * There are 5 allocators here. This might seem like overkill, but they * have different lifecycles, and by keeping them separate we keep the * amount of retained memory down significantly. They are flushed (ie. * all the allocated memory is freed) periodically. * * - dataAlloc has the lifecycle of the monitor. It's flushed only when * the monitor is flushed. It's used for fragments. * * - traceAlloc has the same flush lifecycle as the dataAlloc, but it is * also *marked* when a recording starts and rewinds to the mark point * if recording aborts. So you can put things in it that are only * reachable on a successful record/compile cycle like GuardRecords and * SideExits. * * - tempAlloc is flushed after each recording, successful or not. It's * used to store LIR code and for all other elements in the LIR * pipeline. * * - reTempAlloc is just like tempAlloc, but is used for regexp * compilation in RegExpNativeCompiler rather than normal compilation in * TraceRecorder. * * - codeAlloc has the same lifetime as dataAlloc, but its API is * different (CodeAlloc vs. VMAllocator). It's used for native code. * It's also a good idea to keep code and data separate to avoid I-cache * vs. D-cache issues. */ VMAllocator* dataAlloc; VMAllocator* traceAlloc; VMAllocator* tempAlloc; VMAllocator* reTempAlloc; nanojit::CodeAlloc* codeAlloc; nanojit::Assembler* assembler; FrameInfoCache* frameCache; Oracle* oracle; TraceRecorder* recorder; GlobalState globalStates[MONITOR_N_GLOBAL_STATES]; TreeFragment* vmfragments[FRAGMENT_TABLE_SIZE]; RecordAttemptMap* recordAttempts; /* * Maximum size of the code cache before we start flushing. 1/16 of this * size is used as threshold for the regular expression code cache. */ uint32 maxCodeCacheBytes; /* * If nonzero, do not flush the JIT cache after a deep bail. That would * free JITted code pages that we will later return to. Instead, set the * needFlush flag so that it can be flushed later. */ JSBool needFlush; /* * Fragment map for the regular expression compiler. */ REHashMap* reFragments; // Cached temporary typemap to avoid realloc'ing every time we create one. // This must be used in only one place at a given time. It must be cleared // before use. TypeMap* cachedTempTypeMap; #ifdef DEBUG /* Fields needed for fragment/guard profiling. */ nanojit::Seq* branches; uint32 lastFragID; /* * profAlloc has a lifetime which spans exactly from js_InitJIT to * js_FinishJIT. */ VMAllocator* profAlloc; FragStatsMap* profTab; #endif /* Flush the JIT cache. */ void flush(); /* Mark all objects baked into native code in the code cache. */ void mark(JSTracer *trc); bool outOfMemory() const; }; } /* namespace js */ /* * N.B. JS_ON_TRACE(cx) is true if JIT code is on the stack in the current * thread, regardless of whether cx is the context in which that trace is * executing. cx must be a context on the current thread. */ #ifdef JS_TRACER # define JS_ON_TRACE(cx) (JS_TRACE_MONITOR(cx).tracecx != NULL) #else # define JS_ON_TRACE(cx) JS_FALSE #endif /* Number of potentially reusable scriptsToGC to search for the eval cache. */ #ifndef JS_EVAL_CACHE_SHIFT # define JS_EVAL_CACHE_SHIFT 6 #endif #define JS_EVAL_CACHE_SIZE JS_BIT(JS_EVAL_CACHE_SHIFT) #ifdef DEBUG # define EVAL_CACHE_METER_LIST(_) _(probe), _(hit), _(step), _(noscope) # define identity(x) x struct JSEvalCacheMeter { uint64 EVAL_CACHE_METER_LIST(identity); }; # undef identity #endif #ifdef DEBUG # define FUNCTION_KIND_METER_LIST(_) \ _(allfun), _(heavy), _(nofreeupvar), _(onlyfreevar), \ _(display), _(flat), _(setupvar), _(badfunarg), \ _(joinedsetmethod), _(joinedinitmethod), \ _(joinedreplace), _(joinedsort), _(joinedmodulepat), \ _(mreadbarrier), _(mwritebarrier), _(mwslotbarrier), \ _(unjoined) # define identity(x) x struct JSFunctionMeter { int32 FUNCTION_KIND_METER_LIST(identity); }; # undef identity # define JS_FUNCTION_METER(cx,x) JS_RUNTIME_METER((cx)->runtime, functionMeter.x) #else # define JS_FUNCTION_METER(cx,x) ((void)0) #endif #define NATIVE_ITER_CACHE_LOG2 8 #define NATIVE_ITER_CACHE_MASK JS_BITMASK(NATIVE_ITER_CACHE_LOG2) #define NATIVE_ITER_CACHE_SIZE JS_BIT(NATIVE_ITER_CACHE_LOG2) struct JSPendingProxyOperation { JSPendingProxyOperation *next; JSObject *object; }; struct JSThreadData { /* * If this flag is set, we were asked to call back the operation callback * as soon as possible. */ volatile int32 operationCallbackFlag; JSGCFreeLists gcFreeLists; /* Keeper of the contiguous stack used by all contexts in this thread. */ js::StackSpace stackSpace; /* * Flag indicating that we are waiving any soft limits on the GC heap * because we want allocations to be infallible (except when we hit * a hard quota). */ bool waiveGCQuota; /* * The GSN cache is per thread since even multi-cx-per-thread embeddings * do not interleave js_GetSrcNote calls. */ JSGSNCache gsnCache; /* Property cache for faster call/get/set invocation. */ js::PropertyCache propertyCache; #ifdef JS_TRACER /* Trace-tree JIT recorder/interpreter state. */ js::TraceMonitor traceMonitor; #endif /* Lock-free hashed lists of scripts created by eval to garbage-collect. */ JSScript *scriptsToGC[JS_EVAL_CACHE_SIZE]; #ifdef DEBUG JSEvalCacheMeter evalCacheMeter; #endif /* State used by dtoa.c. */ DtoaState *dtoaState; /* * State used to cache some double-to-string conversions. A stupid * optimization aimed directly at v8-splay.js, which stupidly converts * many doubles multiple times in a row. */ struct { jsdouble d; jsint base; JSString *s; // if s==NULL, d and base are not valid } dtoaCache; /* Cached native iterators. */ JSObject *cachedNativeIterators[NATIVE_ITER_CACHE_SIZE]; /* Base address of the native stack for the current thread. */ jsuword *nativeStackBase; /* List of currently pending operations on proxies. */ JSPendingProxyOperation *pendingProxyOperation; js::ConservativeGCThreadData conservativeGC; bool init(); void finish(); void mark(JSTracer *trc); void purge(JSContext *cx); void triggerOperationCallback() { /* * Use JS_ATOMIC_SET in the hope that it will make sure the write will * become immediately visible to other processors polling the flag. * Note that we only care about visibility here, not read/write * ordering. */ JS_ATOMIC_SET(&operationCallbackFlag, 1); } }; #ifdef JS_THREADSAFE /* * Structure uniquely representing a thread. It holds thread-private data * that can be accessed without a global lock. */ struct JSThread { typedef js::HashMap, js::SystemAllocPolicy> Map; /* Linked list of all contexts in use on this thread. */ JSCList contextList; /* Opaque thread-id, from NSPR's PR_GetCurrentThread(). */ void *id; /* Indicates that the thread is waiting in ClaimTitle from jslock.cpp. */ JSTitle *titleToShare; /* * Thread-local version of JSRuntime.gcMallocBytes to avoid taking * locks on each JS_malloc. */ ptrdiff_t gcThreadMallocBytes; /* * This thread is inside js_GC, either waiting until it can start GC, or * waiting for GC to finish on another thread. This thread holds no locks; * other threads may steal titles from it. * * Protected by rt->gcLock. */ bool gcWaiting; /* * The context running the requests. */ JSContext *requestContext; /* Factored out of JSThread for !JS_THREADSAFE embedding in JSRuntime. */ JSThreadData data; }; /* * Only when JSThread::gcThreadMallocBytes exhausts the following limit we * update JSRuntime::gcMallocBytes. * . */ const size_t JS_GC_THREAD_MALLOC_LIMIT = 1 << 19; #define JS_THREAD_DATA(cx) (&(cx)->thread->data) extern JSThread * js_CurrentThread(JSRuntime *rt); /* * The function takes the GC lock and does not release in successful return. * On error (out of memory) the function releases the lock but delegates * the error reporting to the caller. */ extern JSBool js_InitContextThread(JSContext *cx); /* * On entrance the GC lock must be held and it will be held on exit. */ extern void js_ClearContextThread(JSContext *cx); #endif /* JS_THREADSAFE */ typedef enum JSDestroyContextMode { JSDCM_NO_GC, JSDCM_MAYBE_GC, JSDCM_FORCE_GC, JSDCM_NEW_FAILED } JSDestroyContextMode; typedef enum JSRuntimeState { JSRTS_DOWN, JSRTS_LAUNCHING, JSRTS_UP, JSRTS_LANDING } JSRuntimeState; typedef struct JSPropertyTreeEntry { JSDHashEntryHdr hdr; JSScopeProperty *child; } JSPropertyTreeEntry; namespace js { struct GCPtrHasher { typedef void *Lookup; static HashNumber hash(void *key) { return HashNumber(uintptr_t(key) >> JS_GCTHING_ZEROBITS); } static bool match(void *l, void *k) { return l == k; } }; typedef HashMap GCLocks; struct RootInfo { RootInfo() {} RootInfo(const char *name, JSGCRootType type) : name(name), type(type) {} const char *name; JSGCRootType type; }; typedef js::HashMap, js::SystemAllocPolicy> RootedValueMap; /* If HashNumber grows, need to change WrapperHasher. */ JS_STATIC_ASSERT(sizeof(HashNumber) == 4); struct WrapperHasher { typedef Value Lookup; static HashNumber hash(Value key) { uint64 bits = JSVAL_BITS(Jsvalify(key)); return (uint32)bits ^ (uint32)(bits >> 32); } static bool match(const Value &l, const Value &k) { return l == k; } }; typedef HashMap WrapperMap; class AutoValueVector; class AutoIdVector; } /* namespace js */ struct JSCompartment { JSRuntime *rt; JSPrincipals *principals; void *data; bool marked; js::WrapperMap crossCompartmentWrappers; JSCompartment(JSRuntime *cx); ~JSCompartment(); bool init(); bool wrap(JSContext *cx, js::Value *vp); bool wrap(JSContext *cx, JSString **strp); bool wrap(JSContext *cx, JSObject **objp); bool wrapId(JSContext *cx, jsid *idp); bool wrap(JSContext *cx, js::PropertyOp *op); bool wrap(JSContext *cx, js::PropertyDescriptor *desc); bool wrap(JSContext *cx, js::AutoIdVector &props); bool wrapException(JSContext *cx); void sweep(JSContext *cx); }; typedef void (* JSActivityCallback)(void *arg, JSBool active); struct JSRuntime { /* Default compartment. */ JSCompartment *defaultCompartment; /* List of compartments (protected by the GC lock). */ js::Vector compartments; /* Runtime state, synchronized by the stateChange/gcLock condvar/lock. */ JSRuntimeState state; /* Context create/destroy callback. */ JSContextCallback cxCallback; /* Compartment create/destroy callback. */ JSCompartmentCallback compartmentCallback; /* * Sets a callback that is run whenever the runtime goes idle - the * last active request ceases - and begins activity - when it was * idle and a request begins. Note: The callback is called under the * GC lock. */ void setActivityCallback(JSActivityCallback cb, void *arg) { activityCallback = cb; activityCallbackArg = arg; } JSActivityCallback activityCallback; void *activityCallbackArg; /* * Shape regenerated whenever a prototype implicated by an "add property" * property cache fill and induced trace guard has a readonly property or a * setter defined on it. This number proxies for the shapes of all objects * along the prototype chain of all objects in the runtime on which such an * add-property result has been cached/traced. * * See bug 492355 for more details. * * This comes early in JSRuntime to minimize the immediate format used by * trace-JITted code that reads it. */ uint32 protoHazardShape; /* Garbage collector state, used by jsgc.c. */ js::GCChunkSet gcChunkSet; /* GC chunks with at least one free arena. */ js::GCChunkInfoVector gcFreeArenaChunks; #ifdef DEBUG JSGCArena *gcEmptyArenaList; #endif JSGCArenaList gcArenaList[FINALIZE_LIMIT]; js::RootedValueMap gcRootsHash; js::GCLocks gcLocksHash; jsrefcount gcKeepAtoms; size_t gcBytes; size_t gcLastBytes; size_t gcMaxBytes; size_t gcMaxMallocBytes; uint32 gcEmptyArenaPoolLifespan; uint32 gcNumber; js::GCMarker *gcMarkingTracer; uint32 gcTriggerFactor; size_t gcTriggerBytes; volatile JSBool gcIsNeeded; volatile JSBool gcFlushCodeCaches; /* * NB: do not pack another flag here by claiming gcPadding unless the new * flag is written only by the GC thread. Atomic updates to packed bytes * are not guaranteed, so stores issued by one thread may be lost due to * unsynchronized read-modify-write cycles on other threads. */ JSPackedBool gcPoke; JSPackedBool gcRunning; JSPackedBool gcRegenShapes; /* * During gc, if rt->gcRegenShapes && * (scope->flags & JSScope::SHAPE_REGEN) == rt->gcRegenShapesScopeFlag, * then the scope's shape has already been regenerated during this GC. * To avoid having to sweep JSScopes, the bit's meaning toggles with each * shape-regenerating GC. * * FIXME Once scopes are GC'd (bug 505004), this will be obsolete. */ uint8 gcRegenShapesScopeFlag; #ifdef JS_GC_ZEAL jsrefcount gcZeal; #endif JSGCCallback gcCallback; /* * Malloc counter to measure memory pressure for GC scheduling. It runs * from gcMaxMallocBytes down to zero. */ ptrdiff_t gcMallocBytes; #ifdef JS_THREADSAFE JSBackgroundThread gcHelperThread; #endif js::GCChunkAllocator *gcChunkAllocator; void setCustomGCChunkAllocator(js::GCChunkAllocator *allocator) { JS_ASSERT(allocator); JS_ASSERT(state == JSRTS_DOWN); gcChunkAllocator = allocator; } /* * The trace operation and its data argument to trace embedding-specific * GC roots. */ JSTraceDataOp gcExtraRootsTraceOp; void *gcExtraRootsData; /* Well-known numbers held for use by this runtime's contexts. */ js::Value NaNValue; js::Value negativeInfinityValue; js::Value positiveInfinityValue; js::DeflatedStringCache *deflatedStringCache; JSString *emptyString; /* List of active contexts sharing this runtime; protected by gcLock. */ JSCList contextList; /* Per runtime debug hooks -- see jsprvtd.h and jsdbgapi.h. */ JSDebugHooks globalDebugHooks; #ifdef JS_TRACER /* True if any debug hooks not supported by the JIT are enabled. */ bool debuggerInhibitsJIT() const { return (globalDebugHooks.interruptHook || globalDebugHooks.callHook); } #endif /* More debugging state, see jsdbgapi.c. */ JSCList trapList; JSCList watchPointList; /* Client opaque pointers */ void *data; #ifdef JS_THREADSAFE /* These combine to interlock the GC and new requests. */ PRLock *gcLock; PRCondVar *gcDone; PRCondVar *requestDone; uint32 requestCount; JSThread *gcThread; /* Lock and owning thread pointer for JS_LOCK_RUNTIME. */ PRLock *rtLock; #ifdef DEBUG void * rtLockOwner; #endif /* Used to synchronize down/up state change; protected by gcLock. */ PRCondVar *stateChange; /* * State for sharing single-threaded titles, once a second thread tries to * lock a title. The titleSharingDone condvar is protected by rt->gcLock * to minimize number of locks taken in JS_EndRequest. * * The titleSharingTodo linked list is likewise "global" per runtime, not * one-list-per-context, to conserve space over all contexts, optimizing * for the likely case that titles become shared rarely, and among a very * small set of threads (contexts). */ PRCondVar *titleSharingDone; JSTitle *titleSharingTodo; /* * Magic terminator for the rt->titleSharingTodo linked list, threaded through * title->u.link. This hack allows us to test whether a title is on the list * by asking whether title->u.link is non-null. We use a large, likely bogus * pointer here to distinguish this value from any valid u.count (small int) * value. */ #define NO_TITLE_SHARING_TODO ((JSTitle *) 0xfeedbeef) /* * Lock serializing trapList and watchPointList accesses, and count of all * mutations to trapList and watchPointList made by debugger threads. To * keep the code simple, we define debuggerMutations for the thread-unsafe * case too. */ PRLock *debuggerLock; JSThread::Map threads; #endif /* JS_THREADSAFE */ uint32 debuggerMutations; /* * Security callbacks set on the runtime are used by each context unless * an override is set on the context. */ JSSecurityCallbacks *securityCallbacks; /* * Shared scope property tree, and arena-pool for allocating its nodes. * This really should be free of all locking overhead and allocated in * thread-local storage, hence the JS_PROPERTY_TREE(cx) macro. */ js::PropertyTree propertyTree; #define JS_PROPERTY_TREE(cx) ((cx)->runtime->propertyTree) /* * The propertyRemovals counter is incremented for every JSScope::clear, * and for each JSScope::remove method call that frees a slot in an object. * See js_NativeGet and js_NativeSet in jsobj.cpp. */ int32 propertyRemovals; /* Script filename table. */ struct JSHashTable *scriptFilenameTable; JSCList scriptFilenamePrefixes; #ifdef JS_THREADSAFE PRLock *scriptFilenameTableLock; #endif /* Number localization, used by jsnum.c */ const char *thousandsSeparator; const char *decimalSeparator; const char *numGrouping; /* * Weak references to lazily-created, well-known XML singletons. * * NB: Singleton objects must be carefully disconnected from the rest of * the object graph usually associated with a JSContext's global object, * including the set of standard class objects. See jsxml.c for details. */ JSObject *anynameObject; JSObject *functionNamespaceObject; #ifndef JS_THREADSAFE JSThreadData threadData; #define JS_THREAD_DATA(cx) (&(cx)->runtime->threadData) #endif /* * Object shape (property cache structural type) identifier generator. * * Type 0 stands for the empty scope, and must not be regenerated due to * uint32 wrap-around. Since js_GenerateShape (in jsinterp.cpp) uses * atomic pre-increment, the initial value for the first typed non-empty * scope will be 1. * * If this counter overflows into SHAPE_OVERFLOW_BIT (in jsinterp.h), the * cache is disabled, to avoid aliasing two different types. It stays * disabled until a triggered GC at some later moment compresses live * types, minimizing rt->shapeGen in the process. */ volatile uint32 shapeGen; /* Literal table maintained by jsatom.c functions. */ JSAtomState atomState; /* * Runtime-shared empty scopes for well-known built-in objects that lack * class prototypes (the usual locus of an emptyScope). Mnemonic: ABCDEW */ JSEmptyScope *emptyArgumentsScope; JSEmptyScope *emptyBlockScope; JSEmptyScope *emptyCallScope; JSEmptyScope *emptyDeclEnvScope; JSEmptyScope *emptyEnumeratorScope; JSEmptyScope *emptyWithScope; /* * Various metering fields are defined at the end of JSRuntime. In this * way there is no need to recompile all the code that refers to other * fields of JSRuntime after enabling the corresponding metering macro. */ #ifdef JS_DUMP_ENUM_CACHE_STATS int32 nativeEnumProbes; int32 nativeEnumMisses; # define ENUM_CACHE_METER(name) JS_ATOMIC_INCREMENT(&cx->runtime->name) #else # define ENUM_CACHE_METER(name) ((void) 0) #endif #ifdef JS_DUMP_LOOP_STATS /* Loop statistics, to trigger trace recording and compiling. */ JSBasicStats loopStats; #endif #ifdef DEBUG /* Function invocation metering. */ jsrefcount inlineCalls; jsrefcount nativeCalls; jsrefcount nonInlineCalls; jsrefcount constructs; /* Title lock and scope property metering. */ jsrefcount claimAttempts; jsrefcount claimedTitles; jsrefcount deadContexts; jsrefcount deadlocksAvoided; jsrefcount liveScopes; jsrefcount sharedTitles; jsrefcount totalScopes; jsrefcount liveScopeProps; jsrefcount liveScopePropsPreSweep; jsrefcount totalScopeProps; jsrefcount livePropTreeNodes; jsrefcount duplicatePropTreeNodes; jsrefcount totalPropTreeNodes; jsrefcount propTreeKidsChunks; /* String instrumentation. */ jsrefcount liveStrings; jsrefcount totalStrings; jsrefcount liveDependentStrings; jsrefcount totalDependentStrings; jsrefcount badUndependStrings; double lengthSum; double lengthSquaredSum; double strdepLengthSum; double strdepLengthSquaredSum; /* Script instrumentation. */ jsrefcount liveScripts; jsrefcount totalScripts; jsrefcount liveEmptyScripts; jsrefcount totalEmptyScripts; #endif /* DEBUG */ #ifdef JS_SCOPE_DEPTH_METER /* * Stats on runtime prototype chain lookups and scope chain depths, i.e., * counts of objects traversed on a chain until the wanted id is found. */ JSBasicStats protoLookupDepthStats; JSBasicStats scopeSearchDepthStats; /* * Stats on compile-time host environment and lexical scope chain lengths * (maximum depths). */ JSBasicStats hostenvScopeDepthStats; JSBasicStats lexicalScopeDepthStats; #endif #ifdef JS_GCMETER JSGCStats gcStats; #endif #ifdef DEBUG /* * If functionMeterFilename, set from an envariable in JSRuntime's ctor, is * null, the remaining members in this ifdef'ed group are not initialized. */ const char *functionMeterFilename; JSFunctionMeter functionMeter; char lastScriptFilename[1024]; typedef js::HashMap, js::SystemAllocPolicy> FunctionCountMap; FunctionCountMap methodReadBarrierCountMap; FunctionCountMap unjoinedFunctionCountMap; #endif JSWrapObjectCallback wrapObjectCallback; JSC::ExecutableAllocator *regExpAllocator; JSRuntime(); ~JSRuntime(); bool init(uint32 maxbytes); void setGCTriggerFactor(uint32 factor); void setGCLastBytes(size_t lastBytes); void* malloc(size_t bytes) { return ::js_malloc(bytes); } void* calloc(size_t bytes) { return ::js_calloc(bytes); } void* realloc(void* p, size_t bytes) { return ::js_realloc(p, bytes); } void free(void* p) { ::js_free(p); } bool isGCMallocLimitReached() const { return gcMallocBytes <= 0; } void resetGCMallocBytes() { gcMallocBytes = ptrdiff_t(gcMaxMallocBytes); } void setGCMaxMallocBytes(size_t value) { /* * For compatibility treat any value that exceeds PTRDIFF_T_MAX to * mean that value. */ gcMaxMallocBytes = (ptrdiff_t(value) >= 0) ? value : size_t(-1) >> 1; resetGCMallocBytes(); } }; /* Common macros to access thread-local caches in JSThread or JSRuntime. */ #define JS_GSN_CACHE(cx) (JS_THREAD_DATA(cx)->gsnCache) #define JS_PROPERTY_CACHE(cx) (JS_THREAD_DATA(cx)->propertyCache) #define JS_TRACE_MONITOR(cx) (JS_THREAD_DATA(cx)->traceMonitor) #define JS_SCRIPTS_TO_GC(cx) (JS_THREAD_DATA(cx)->scriptsToGC) #ifdef DEBUG # define EVAL_CACHE_METER(x) (JS_THREAD_DATA(cx)->evalCacheMeter.x++) #else # define EVAL_CACHE_METER(x) ((void) 0) #endif #ifdef DEBUG # define JS_RUNTIME_METER(rt, which) JS_ATOMIC_INCREMENT(&(rt)->which) # define JS_RUNTIME_UNMETER(rt, which) JS_ATOMIC_DECREMENT(&(rt)->which) #else # define JS_RUNTIME_METER(rt, which) /* nothing */ # define JS_RUNTIME_UNMETER(rt, which) /* nothing */ #endif #define JS_KEEP_ATOMS(rt) JS_ATOMIC_INCREMENT(&(rt)->gcKeepAtoms); #define JS_UNKEEP_ATOMS(rt) JS_ATOMIC_DECREMENT(&(rt)->gcKeepAtoms); #ifdef JS_ARGUMENT_FORMATTER_DEFINED /* * Linked list mapping format strings for JS_{Convert,Push}Arguments{,VA} to * formatter functions. Elements are sorted in non-increasing format string * length order. */ struct JSArgumentFormatMap { const char *format; size_t length; JSArgumentFormatter formatter; JSArgumentFormatMap *next; }; #endif /* * Key and entry types for the JSContext.resolvingTable hash table, typedef'd * here because all consumers need to see these declarations (and not just the * typedef names, as would be the case for an opaque pointer-to-typedef'd-type * declaration), along with cx->resolvingTable. */ typedef struct JSResolvingKey { JSObject *obj; jsid id; } JSResolvingKey; typedef struct JSResolvingEntry { JSDHashEntryHdr hdr; JSResolvingKey key; uint32 flags; } JSResolvingEntry; #define JSRESFLAG_LOOKUP 0x1 /* resolving id from lookup */ #define JSRESFLAG_WATCH 0x2 /* resolving id from watch */ #define JSRESOLVE_INFER 0xffff /* infer bits from current bytecode */ extern const JSDebugHooks js_NullDebugHooks; /* defined in jsdbgapi.cpp */ namespace js { class AutoGCRooter; } namespace js { class RegExp; class RegExpStatics { js::Vector matchPairs; JSContext *cx; JSString *input; uintN flags; bool createDependent(size_t start, size_t end, Value *out) const; size_t pairCount() const { JS_ASSERT(matchPairs.length() % 2 == 0); return matchPairs.length() / 2; } /* * Check whether the index at |checkValidIndex| is valid (>= 0). * If so, construct a string for it and place it in |*out|. * If not, place undefined in |*out|. */ bool makeMatch(size_t checkValidIndex, size_t pairNum, Value *out) const; static const uintN allFlags = JSREG_FOLD | JSREG_GLOB | JSREG_STICKY | JSREG_MULTILINE; friend class RegExp; public: explicit RegExpStatics(JSContext *cx) : matchPairs(cx), cx(cx) { clear(); } void clone(const RegExpStatics &other); /* Mutators. */ void setMultiline(bool enabled) { if (enabled) flags = flags | JSREG_MULTILINE; else flags = flags & ~JSREG_MULTILINE; } void clear() { input = 0; flags = 0; matchPairs.clear(); } void checkInvariants() { if (pairCount() > 0) { JS_ASSERT(input); JS_ASSERT(get(0, 0) <= get(0, 1)); JS_ASSERT(get(0, 1) <= int(input->length())); } } void reset(JSString *newInput, bool newMultiline) { clear(); input = newInput; setMultiline(newMultiline); checkInvariants(); } void setInput(JSString *newInput) { input = newInput; } /* Accessors. */ JSString *getInput() const { return input; } uintN getFlags() const { return flags; } bool multiline() const { return flags & JSREG_MULTILINE; } bool matched() const { JS_ASSERT(pairCount() > 0); return get(0, 1) - get(0, 0) > 0; } size_t getParenCount() const { JS_ASSERT(pairCount() > 0); return pairCount() - 1; } void mark(JSTracer *trc) const { if (input) JS_CALL_STRING_TRACER(trc, input, "res->input"); } size_t getParenLength(size_t parenNum) const { if (pairCount() <= parenNum + 1) return 0; return get(parenNum + 1, 1) - get(parenNum + 1, 0); } int get(size_t pairNum, bool which) const { JS_ASSERT(pairNum < pairCount()); return matchPairs[2 * pairNum + which]; } /* Value creators. */ bool createInput(Value *out) const; bool createLastMatch(Value *out) const { return makeMatch(0, 0, out); } bool createLastParen(Value *out) const; bool createLeftContext(Value *out) const; bool createRightContext(Value *out) const; bool createParen(size_t parenNum, Value *out) const { return makeMatch((parenNum + 1) * 2, parenNum + 1, out); } /* Substring creators. */ void getParen(size_t num, JSSubString *out) const; void getLastMatch(JSSubString *out) const; void getLastParen(JSSubString *out) const; void getLeftContext(JSSubString *out) const; void getRightContext(JSSubString *out) const; }; } struct JSContext { explicit JSContext(JSRuntime *rt); /* JSRuntime contextList linkage. */ JSCList link; /* Runtime version control identifier. */ uint16 version; /* Per-context options. */ uint32 options; /* see jsapi.h for JSOPTION_* */ /* Locale specific callbacks for string conversion. */ JSLocaleCallbacks *localeCallbacks; /* * cx->resolvingTable is non-null and non-empty if we are initializing * standard classes lazily, or if we are otherwise recursing indirectly * from js_LookupProperty through a Class.resolve hook. It is used to * limit runaway recursion (see jsapi.c and jsobj.c). */ JSDHashTable *resolvingTable; /* * True if generating an error, to prevent runaway recursion. * NB: generatingError packs with throwing below. */ JSPackedBool generatingError; /* Exception state -- the exception member is a GC root by definition. */ JSPackedBool throwing; /* is there a pending exception? */ js::Value exception; /* most-recently-thrown exception */ /* Limit pointer for checking native stack consumption during recursion. */ jsuword stackLimit; /* Quota on the size of arenas used to compile and execute scripts. */ size_t scriptStackQuota; /* Data shared by threads in an address space. */ JSRuntime *const runtime; /* GC heap compartment. */ JSCompartment *compartment; /* Currently executing frame, set by stack operations. */ JS_REQUIRES_STACK JSStackFrame *fp; /* * Currently executing frame's regs, set by stack operations. * |fp != NULL| iff |regs != NULL| (although regs->pc can be NULL) */ JS_REQUIRES_STACK JSFrameRegs *regs; private: friend class js::StackSpace; friend bool js::Interpret(JSContext *); /* 'fp' and 'regs' must only be changed by calling these functions. */ void setCurrentFrame(JSStackFrame *fp) { this->fp = fp; } void setCurrentRegs(JSFrameRegs *regs) { this->regs = regs; } public: /* Temporary arena pool used while compiling and decompiling. */ JSArenaPool tempPool; /* Temporary arena pool used while evaluate regular expressions. */ JSArenaPool regExpPool; /* Top-level object and pointer to top stack frame's scope chain. */ JSObject *globalObject; /* Storage to root recently allocated GC things and script result. */ JSWeakRoots weakRoots; /* Regular expression class statics. */ js::RegExpStatics regExpStatics; /* State for object and array toSource conversion. */ JSSharpObjectMap sharpObjectMap; js::HashSet busyArrays; /* Argument formatter support for JS_{Convert,Push}Arguments{,VA}. */ JSArgumentFormatMap *argumentFormatMap; /* Last message string and trace file for debugging. */ char *lastMessage; #ifdef DEBUG void *tracefp; jsbytecode *tracePrevPc; #endif /* Per-context optional error reporter. */ JSErrorReporter errorReporter; /* Branch callback. */ JSOperationCallback operationCallback; /* Interpreter activation count. */ uintN interpLevel; /* Client opaque pointers. */ void *data; void *data2; private: /* Linked list of segments. See StackSegment. */ js::StackSegment *currentSegment; public: void assertSegmentsInSync() const { #ifdef DEBUG if (fp) { JS_ASSERT(currentSegment->isActive()); if (js::StackSegment *prev = currentSegment->getPreviousInContext()) JS_ASSERT(!prev->isActive()); } else { JS_ASSERT_IF(currentSegment, !currentSegment->isActive()); } #endif } /* Return whether this context has an active segment. */ bool hasActiveSegment() const { assertSegmentsInSync(); return !!fp; } /* Assuming there is an active segment, return it. */ js::StackSegment *activeSegment() const { JS_ASSERT(hasActiveSegment()); return currentSegment; } /* Return the current segment, which may or may not be active. */ js::StackSegment *getCurrentSegment() const { assertSegmentsInSync(); return currentSegment; } /* Add the given segment to the list as the new active segment. */ void pushSegmentAndFrame(js::StackSegment *newseg, JSStackFrame *newfp, JSFrameRegs ®s); /* Remove the active segment and make the next segment active. */ void popSegmentAndFrame(); /* Mark the top segment as suspended, without pushing a new one. */ void saveActiveSegment(); /* Undoes calls to suspendActiveSegment. */ void restoreSegment(); /* * Perform a linear search of all frames in all segments in the given context * for the given frame, returning the segment, if found, and null otherwise. */ js::StackSegment *containingSegment(const JSStackFrame *target); /* * Search the call stack for the nearest frame with static level targetLevel. */ JSStackFrame *findFrameAtLevel(uintN targetLevel) { JSStackFrame *fp = this->fp; while (true) { JS_ASSERT(fp && fp->hasScript()); if (fp->getScript()->staticLevel == targetLevel) break; fp = fp->down; } return fp; } #ifdef JS_THREADSAFE JSThread *thread; jsrefcount requestDepth; /* Same as requestDepth but ignoring JS_SuspendRequest/JS_ResumeRequest */ jsrefcount outstandingRequests; JSContext *prevRequestContext; jsrefcount prevRequestDepth; # ifdef DEBUG unsigned checkRequestDepth; # endif JSTitle *lockedSealedTitle; /* weak ref, for low-cost sealed title locking */ JSCList threadLinks; /* JSThread contextList linkage */ #define CX_FROM_THREAD_LINKS(tl) \ ((JSContext *)((char *)(tl) - offsetof(JSContext, threadLinks))) #endif /* Stack of thread-stack-allocated GC roots. */ js::AutoGCRooter *autoGCRooters; /* Debug hooks associated with the current context. */ const JSDebugHooks *debugHooks; /* Security callbacks that override any defined on the runtime. */ JSSecurityCallbacks *securityCallbacks; /* Stored here to avoid passing it around as a parameter. */ uintN resolveFlags; /* Random number generator state, used by jsmath.cpp. */ int64 rngSeed; /* Location to stash the iteration value between JSOP_MOREITER and JSOP_FOR*. */ js::Value iterValue; #ifdef JS_TRACER /* * State for the current tree execution. bailExit is valid if the tree has * called back into native code via a _FAIL builtin and has not yet bailed, * else garbage (NULL in debug builds). */ js::TracerState *tracerState; js::VMSideExit *bailExit; /* * True if traces may be executed. Invariant: The value of jitEnabled is * always equal to the expression in updateJITEnabled below. * * This flag and the fields accessed by updateJITEnabled are written only * in runtime->gcLock, to avoid race conditions that would leave the wrong * value in jitEnabled. (But the interpreter reads this without * locking. That can race against another thread setting debug hooks, but * we always read cx->debugHooks without locking anyway.) */ bool jitEnabled; #endif /* Caller must be holding runtime->gcLock. */ void updateJITEnabled() { #ifdef JS_TRACER jitEnabled = ((options & JSOPTION_JIT) && (debugHooks == &js_NullDebugHooks || (debugHooks == &runtime->globalDebugHooks && !runtime->debuggerInhibitsJIT()))); #endif } #ifdef MOZ_TRACE_JSCALLS /* Function entry/exit debugging callback. */ JSFunctionCallback functionCallback; void doFunctionCallback(const JSFunction *fun, const JSScript *scr, JSBool entering) const { if (functionCallback) functionCallback(fun, scr, this, entering); } #endif DSTOffsetCache dstOffsetCache; /* List of currently active non-escaping enumerators (for-in). */ JSObject *enumerators; private: /* * To go from a live generator frame (on the stack) to its generator object * (see comment js_FloatingFrameIfGenerator), we maintain a stack of active * generators, pushing and popping when entering and leaving generator * frames, respectively. */ js::Vector genStack; public: /* Return the generator object for the given generator frame. */ JSGenerator *generatorFor(JSStackFrame *fp) const; /* Early OOM-check. */ inline bool ensureGeneratorStackSpace(); bool enterGenerator(JSGenerator *gen) { return genStack.append(gen); } void leaveGenerator(JSGenerator *gen) { JS_ASSERT(genStack.back() == gen); genStack.popBack(); } #ifdef JS_THREADSAFE /* * The sweep task for this context. */ js::BackgroundSweepTask *gcSweepTask; #endif ptrdiff_t &getMallocCounter() { #ifdef JS_THREADSAFE return thread->gcThreadMallocBytes; #else return runtime->gcMallocBytes; #endif } /* * Call this after allocating memory held by GC things, to update memory * pressure counters or report the OOM error if necessary. */ inline void updateMallocCounter(void *p, size_t nbytes) { JS_ASSERT(ptrdiff_t(nbytes) >= 0); ptrdiff_t &counter = getMallocCounter(); counter -= ptrdiff_t(nbytes); if (!p || counter <= 0) checkMallocGCPressure(p); } /* * Call this after successfully allocating memory held by GC things, to * update memory pressure counters. */ inline void updateMallocCounter(size_t nbytes) { JS_ASSERT(ptrdiff_t(nbytes) >= 0); ptrdiff_t &counter = getMallocCounter(); counter -= ptrdiff_t(nbytes); if (counter <= 0) { /* * Use 1 as an arbitrary non-null pointer indicating successful * allocation. */ checkMallocGCPressure(reinterpret_cast(jsuword(1))); } } inline void* malloc(size_t bytes) { JS_ASSERT(bytes != 0); void *p = runtime->malloc(bytes); updateMallocCounter(p, bytes); return p; } inline void* mallocNoReport(size_t bytes) { JS_ASSERT(bytes != 0); void *p = runtime->malloc(bytes); if (!p) return NULL; updateMallocCounter(bytes); return p; } inline void* calloc(size_t bytes) { JS_ASSERT(bytes != 0); void *p = runtime->calloc(bytes); updateMallocCounter(p, bytes); return p; } inline void* realloc(void* p, size_t bytes) { void *orig = p; p = runtime->realloc(p, bytes); /* * For compatibility we do not account for realloc that increases * previously allocated memory. */ updateMallocCounter(p, orig ? 0 : bytes); return p; } inline void free(void* p) { #ifdef JS_THREADSAFE if (gcSweepTask) { gcSweepTask->freeLater(p); return; } #endif runtime->free(p); } /* * In the common case that we'd like to allocate the memory for an object * with cx->malloc/free, we cannot use overloaded C++ operators (no * placement delete). Factor the common workaround into one place. */ #define CREATE_BODY(parms) \ void *memory = this->malloc(sizeof(T)); \ if (!memory) \ return NULL; \ return new(memory) T parms; template JS_ALWAYS_INLINE T *create() { CREATE_BODY(()) } template JS_ALWAYS_INLINE T *create(const P1 &p1) { CREATE_BODY((p1)) } template JS_ALWAYS_INLINE T *create(const P1 &p1, const P2 &p2) { CREATE_BODY((p1, p2)) } template JS_ALWAYS_INLINE T *create(const P1 &p1, const P2 &p2, const P3 &p3) { CREATE_BODY((p1, p2, p3)) } #undef CREATE_BODY template JS_ALWAYS_INLINE void destroy(T *p) { p->~T(); this->free(p); } bool isConstructing(); void purge(); js::StackSpace &stack() const { return JS_THREAD_DATA(this)->stackSpace; } #ifdef DEBUG void assertValidStackDepth(uintN depth) { JS_ASSERT(0 <= regs->sp - fp->base()); JS_ASSERT(depth <= uintptr_t(regs->sp - fp->base())); } #else void assertValidStackDepth(uintN /*depth*/) {} #endif private: /* * The allocation code calls the function to indicate either OOM failure * when p is null or that a memory pressure counter has reached some * threshold when p is not null. The function takes the pointer and not * a boolean flag to minimize the amount of code in its inlined callers. */ JS_FRIEND_API(void) checkMallocGCPressure(void *p); }; static inline void js_TraceRegExpStatics(JSTracer *trc, JSContext *acx) { acx->regExpStatics.mark(trc); } JS_ALWAYS_INLINE JSObject * JSStackFrame::varobj(js::StackSegment *seg) const { JS_ASSERT(seg->contains(this)); return hasFunction() ? maybeCallObj() : seg->getInitialVarObj(); } JS_ALWAYS_INLINE JSObject * JSStackFrame::varobj(JSContext *cx) const { JS_ASSERT(cx->activeSegment()->contains(this)); return hasFunction() ? maybeCallObj() : cx->activeSegment()->getInitialVarObj(); } JS_ALWAYS_INLINE jsbytecode * JSStackFrame::pc(JSContext *cx) const { JS_ASSERT(cx->containingSegment(this) != NULL); return (cx->fp == this) ? cx->regs->pc : savedPC; } #ifdef JS_THREADSAFE # define JS_THREAD_ID(cx) ((cx)->thread ? (cx)->thread->id : 0) #endif #if defined JS_THREADSAFE && defined DEBUG namespace js { class AutoCheckRequestDepth { JSContext *cx; public: AutoCheckRequestDepth(JSContext *cx) : cx(cx) { cx->checkRequestDepth++; } ~AutoCheckRequestDepth() { JS_ASSERT(cx->checkRequestDepth != 0); cx->checkRequestDepth--; } }; } # define CHECK_REQUEST(cx) \ JS_ASSERT((cx)->requestDepth || (cx)->thread == (cx)->runtime->gcThread);\ AutoCheckRequestDepth _autoCheckRequestDepth(cx); #else # define CHECK_REQUEST(cx) ((void)0) #endif static inline uintN FramePCOffset(JSContext *cx, JSStackFrame* fp) { jsbytecode *pc = fp->hasIMacroPC() ? fp->getIMacroPC() : fp->pc(cx); return uintN(pc - fp->getScript()->code); } static inline JSAtom ** FrameAtomBase(JSContext *cx, JSStackFrame *fp) { return fp->hasIMacroPC() ? COMMON_ATOMS_START(&cx->runtime->atomState) : fp->getScript()->atomMap.vector; } namespace js { class AutoGCRooter { public: AutoGCRooter(JSContext *cx, ptrdiff_t tag) : down(cx->autoGCRooters), tag(tag), context(cx) { JS_ASSERT(this != cx->autoGCRooters); #ifdef JS_THREADSAFE JS_ASSERT(cx->requestDepth != 0); #endif cx->autoGCRooters = this; } ~AutoGCRooter() { JS_ASSERT(this == context->autoGCRooters); #ifdef JS_THREADSAFE JS_ASSERT(context->requestDepth != 0); #endif context->autoGCRooters = down; } /* Implemented in jsgc.cpp. */ inline void trace(JSTracer *trc); #ifdef __GNUC__ # pragma GCC visibility push(default) #endif friend void ::js_TraceContext(JSTracer *trc, JSContext *acx); friend void ::js_TraceRuntime(JSTracer *trc); #ifdef __GNUC__ # pragma GCC visibility pop #endif protected: AutoGCRooter * const down; /* * Discriminates actual subclass of this being used. If non-negative, the * subclass roots an array of values of the length stored in this field. * If negative, meaning is indicated by the corresponding value in the enum * below. Any other negative value indicates some deeper problem such as * memory corruption. */ ptrdiff_t tag; JSContext * const context; enum { JSVAL = -1, /* js::AutoValueRooter */ SPROP = -2, /* js::AutoScopePropertyRooter */ WEAKROOTS = -3, /* js::AutoSaveWeakRoots */ PARSER = -4, /* js::Parser */ SCRIPT = -5, /* js::AutoScriptRooter */ ENUMERATOR = -6, /* js::AutoEnumStateRooter */ IDARRAY = -7, /* js::AutoIdArray */ DESCRIPTORS = -8, /* js::AutoPropDescArrayRooter */ NAMESPACES = -9, /* js::AutoNamespaceArray */ XML = -10, /* js::AutoXMLRooter */ OBJECT = -11, /* js::AutoObjectRooter */ ID = -12, /* js::AutoIdRooter */ VALVECTOR = -13, /* js::AutoValueVector */ DESCRIPTOR = -14, /* js::AutoPropertyDescriptorRooter */ STRING = -15, /* js::AutoStringRooter */ IDVECTOR = -16 /* js::AutoIdVector */ }; private: /* No copy or assignment semantics. */ AutoGCRooter(AutoGCRooter &ida); void operator=(AutoGCRooter &ida); }; class AutoPreserveWeakRoots : private AutoGCRooter { public: explicit AutoPreserveWeakRoots(JSContext *cx JS_GUARD_OBJECT_NOTIFIER_PARAM) : AutoGCRooter(cx, WEAKROOTS), savedRoots(cx->weakRoots) { JS_GUARD_OBJECT_NOTIFIER_INIT; } ~AutoPreserveWeakRoots() { context->weakRoots = savedRoots; } friend void AutoGCRooter::trace(JSTracer *trc); private: JSWeakRoots savedRoots; JS_DECL_USE_GUARD_OBJECT_NOTIFIER }; /* FIXME(bug 332648): Move this into a public header. */ class AutoValueRooter : private AutoGCRooter { public: explicit AutoValueRooter(JSContext *cx JS_GUARD_OBJECT_NOTIFIER_PARAM) : AutoGCRooter(cx, JSVAL), val(js::NullValue()) { JS_GUARD_OBJECT_NOTIFIER_INIT; } AutoValueRooter(JSContext *cx, const Value &v JS_GUARD_OBJECT_NOTIFIER_PARAM) : AutoGCRooter(cx, JSVAL), val(v) { JS_GUARD_OBJECT_NOTIFIER_INIT; } AutoValueRooter(JSContext *cx, jsval v JS_GUARD_OBJECT_NOTIFIER_PARAM) : AutoGCRooter(cx, JSVAL), val(js::Valueify(v)) { JS_GUARD_OBJECT_NOTIFIER_INIT; } /* * If you are looking for Object* overloads, use AutoObjectRooter instead; * rooting Object*s as a js::Value requires discerning whether or not it is * a function object. Also, AutoObjectRooter is smaller. */ void set(Value v) { JS_ASSERT(tag == JSVAL); val = v; } void set(jsval v) { JS_ASSERT(tag == JSVAL); val = js::Valueify(v); } const Value &value() const { JS_ASSERT(tag == JSVAL); return val; } Value *addr() { JS_ASSERT(tag == JSVAL); return &val; } const jsval &jsval_value() const { JS_ASSERT(tag == JSVAL); return Jsvalify(val); } jsval *jsval_addr() { JS_ASSERT(tag == JSVAL); return Jsvalify(&val); } friend void AutoGCRooter::trace(JSTracer *trc); friend void ::js_TraceRuntime(JSTracer *trc); private: Value val; JS_DECL_USE_GUARD_OBJECT_NOTIFIER }; class AutoObjectRooter : private AutoGCRooter { public: AutoObjectRooter(JSContext *cx, JSObject *obj = NULL JS_GUARD_OBJECT_NOTIFIER_PARAM) : AutoGCRooter(cx, OBJECT), obj(obj) { JS_GUARD_OBJECT_NOTIFIER_INIT; } void setObject(JSObject *obj) { this->obj = obj; } JSObject * object() const { return obj; } JSObject ** addr() { return &obj; } friend void AutoGCRooter::trace(JSTracer *trc); friend void ::js_TraceRuntime(JSTracer *trc); private: JSObject *obj; JS_DECL_USE_GUARD_OBJECT_NOTIFIER }; class AutoStringRooter : private AutoGCRooter { public: AutoStringRooter(JSContext *cx, JSString *str = NULL JS_GUARD_OBJECT_NOTIFIER_PARAM) : AutoGCRooter(cx, STRING), str(str) { JS_GUARD_OBJECT_NOTIFIER_INIT; } void setString(JSString *str) { this->str = str; } JSString * string() const { return str; } JSString ** addr() { return &str; } friend void AutoGCRooter::trace(JSTracer *trc); private: JSString *str; JS_DECL_USE_GUARD_OBJECT_NOTIFIER }; class AutoArrayRooter : private AutoGCRooter { public: AutoArrayRooter(JSContext *cx, size_t len, Value *vec JS_GUARD_OBJECT_NOTIFIER_PARAM) : AutoGCRooter(cx, len), array(vec) { JS_GUARD_OBJECT_NOTIFIER_INIT; JS_ASSERT(tag >= 0); } AutoArrayRooter(JSContext *cx, size_t len, jsval *vec JS_GUARD_OBJECT_NOTIFIER_PARAM) : AutoGCRooter(cx, len), array(Valueify(vec)) { JS_GUARD_OBJECT_NOTIFIER_INIT; JS_ASSERT(tag >= 0); } void changeLength(size_t newLength) { tag = ptrdiff_t(newLength); JS_ASSERT(tag >= 0); } void changeArray(Value *newArray, size_t newLength) { changeLength(newLength); array = newArray; } Value *array; friend void AutoGCRooter::trace(JSTracer *trc); private: JS_DECL_USE_GUARD_OBJECT_NOTIFIER }; class AutoScopePropertyRooter : private AutoGCRooter { public: AutoScopePropertyRooter(JSContext *cx, JSScopeProperty *sprop JS_GUARD_OBJECT_NOTIFIER_PARAM) : AutoGCRooter(cx, SPROP), sprop(sprop) { JS_GUARD_OBJECT_NOTIFIER_INIT; } friend void AutoGCRooter::trace(JSTracer *trc); friend void ::js_TraceRuntime(JSTracer *trc); private: JSScopeProperty * const sprop; JS_DECL_USE_GUARD_OBJECT_NOTIFIER }; class AutoScriptRooter : private AutoGCRooter { public: AutoScriptRooter(JSContext *cx, JSScript *script JS_GUARD_OBJECT_NOTIFIER_PARAM) : AutoGCRooter(cx, SCRIPT), script(script) { JS_GUARD_OBJECT_NOTIFIER_INIT; } void setScript(JSScript *script) { this->script = script; } friend void AutoGCRooter::trace(JSTracer *trc); private: JSScript *script; JS_DECL_USE_GUARD_OBJECT_NOTIFIER }; class AutoIdRooter : private AutoGCRooter { public: explicit AutoIdRooter(JSContext *cx, jsid id = INT_TO_JSID(0) JS_GUARD_OBJECT_NOTIFIER_PARAM) : AutoGCRooter(cx, ID), id_(id) { JS_GUARD_OBJECT_NOTIFIER_INIT; } jsid id() { return id_; } jsid * addr() { return &id_; } friend void AutoGCRooter::trace(JSTracer *trc); friend void ::js_TraceRuntime(JSTracer *trc); private: jsid id_; JS_DECL_USE_GUARD_OBJECT_NOTIFIER }; class AutoIdArray : private AutoGCRooter { public: AutoIdArray(JSContext *cx, JSIdArray *ida JS_GUARD_OBJECT_NOTIFIER_PARAM) : AutoGCRooter(cx, IDARRAY), idArray(ida) { JS_GUARD_OBJECT_NOTIFIER_INIT; } ~AutoIdArray() { if (idArray) JS_DestroyIdArray(context, idArray); } bool operator!() { return idArray == NULL; } jsid operator[](size_t i) const { JS_ASSERT(idArray); JS_ASSERT(i < size_t(idArray->length)); return idArray->vector[i]; } size_t length() const { return idArray->length; } friend void AutoGCRooter::trace(JSTracer *trc); JSIdArray *steal() { JSIdArray *copy = idArray; idArray = NULL; return copy; } protected: inline void trace(JSTracer *trc); private: JSIdArray * idArray; JS_DECL_USE_GUARD_OBJECT_NOTIFIER /* No copy or assignment semantics. */ AutoIdArray(AutoIdArray &ida); void operator=(AutoIdArray &ida); }; /* The auto-root for enumeration object and its state. */ class AutoEnumStateRooter : private AutoGCRooter { public: AutoEnumStateRooter(JSContext *cx, JSObject *obj JS_GUARD_OBJECT_NOTIFIER_PARAM) : AutoGCRooter(cx, ENUMERATOR), obj(obj), stateValue() { JS_GUARD_OBJECT_NOTIFIER_INIT; JS_ASSERT(obj); } ~AutoEnumStateRooter() { if (!stateValue.isNull()) { #ifdef DEBUG JSBool ok = #endif obj->enumerate(context, JSENUMERATE_DESTROY, &stateValue, 0); JS_ASSERT(ok); } } friend void AutoGCRooter::trace(JSTracer *trc); const Value &state() const { return stateValue; } Value *addr() { return &stateValue; } protected: void trace(JSTracer *trc) { JS_CALL_OBJECT_TRACER(trc, obj, "js::AutoEnumStateRooter.obj"); } JSObject * const obj; private: Value stateValue; JS_DECL_USE_GUARD_OBJECT_NOTIFIER }; #ifdef JS_HAS_XML_SUPPORT class AutoXMLRooter : private AutoGCRooter { public: AutoXMLRooter(JSContext *cx, JSXML *xml) : AutoGCRooter(cx, XML), xml(xml) { JS_ASSERT(xml); } friend void AutoGCRooter::trace(JSTracer *trc); friend void ::js_TraceRuntime(JSTracer *trc); private: JSXML * const xml; }; #endif /* JS_HAS_XML_SUPPORT */ class AutoLockGC { private: JSRuntime *rt; public: explicit AutoLockGC(JSRuntime *rt) : rt(rt) { JS_LOCK_GC(rt); } ~AutoLockGC() { JS_UNLOCK_GC(rt); } }; class AutoUnlockGC { private: JSRuntime *rt; public: explicit AutoUnlockGC(JSRuntime *rt) : rt(rt) { JS_UNLOCK_GC(rt); } ~AutoUnlockGC() { JS_LOCK_GC(rt); } }; class AutoKeepAtoms { JSRuntime *rt; public: explicit AutoKeepAtoms(JSRuntime *rt) : rt(rt) { JS_KEEP_ATOMS(rt); } ~AutoKeepAtoms() { JS_UNKEEP_ATOMS(rt); } }; class AutoArenaAllocator { JSArenaPool *pool; void *mark; public: explicit AutoArenaAllocator(JSArenaPool *pool) : pool(pool) { mark = JS_ARENA_MARK(pool); } ~AutoArenaAllocator() { JS_ARENA_RELEASE(pool, mark); } template T *alloc(size_t elems) { void *ptr; JS_ARENA_ALLOCATE(ptr, pool, elems * sizeof(T)); return static_cast(ptr); } }; class AutoReleasePtr { JSContext *cx; void *ptr; AutoReleasePtr operator=(const AutoReleasePtr &other); public: explicit AutoReleasePtr(JSContext *cx, void *ptr) : cx(cx), ptr(ptr) {} ~AutoReleasePtr() { cx->free(ptr); } }; } /* namespace js */ class JSAutoResolveFlags { public: JSAutoResolveFlags(JSContext *cx, uintN flags JS_GUARD_OBJECT_NOTIFIER_PARAM) : mContext(cx), mSaved(cx->resolveFlags) { JS_GUARD_OBJECT_NOTIFIER_INIT; cx->resolveFlags = flags; } ~JSAutoResolveFlags() { mContext->resolveFlags = mSaved; } private: JSContext *mContext; uintN mSaved; JS_DECL_USE_GUARD_OBJECT_NOTIFIER }; /* * Slightly more readable macros for testing per-context option settings (also * to hide bitset implementation detail). * * JSOPTION_XML must be handled specially in order to propagate from compile- * to run-time (from cx->options to script->version/cx->version). To do that, * we copy JSOPTION_XML from cx->options into cx->version as JSVERSION_HAS_XML * whenever options are set, and preserve this XML flag across version number * changes done via the JS_SetVersion API. * * But when executing a script or scripted function, the interpreter changes * cx->version, including the XML flag, to script->version. Thus JSOPTION_XML * is a compile-time option that causes a run-time version change during each * activation of the compiled script. That version change has the effect of * changing JS_HAS_XML_OPTION, so that any compiling done via eval enables XML * support. If an XML-enabled script or function calls a non-XML function, * the flag bit will be cleared during the callee's activation. * * Note that JS_SetVersion API calls never pass JSVERSION_HAS_XML or'd into * that API's version parameter. * * Note also that script->version must contain this XML option flag in order * for XDR'ed scripts to serialize and deserialize with that option preserved * for detection at run-time. We can't copy other compile-time options into * script->version because that would break backward compatibility (certain * other options, e.g. JSOPTION_VAROBJFIX, are analogous to JSOPTION_XML). */ #define JS_HAS_OPTION(cx,option) (((cx)->options & (option)) != 0) #define JS_HAS_STRICT_OPTION(cx) JS_HAS_OPTION(cx, JSOPTION_STRICT) #define JS_HAS_WERROR_OPTION(cx) JS_HAS_OPTION(cx, JSOPTION_WERROR) #define JS_HAS_COMPILE_N_GO_OPTION(cx) JS_HAS_OPTION(cx, JSOPTION_COMPILE_N_GO) #define JS_HAS_ATLINE_OPTION(cx) JS_HAS_OPTION(cx, JSOPTION_ATLINE) #define JSVERSION_MASK 0x0FFF /* see JSVersion in jspubtd.h */ #define JSVERSION_HAS_XML 0x1000 /* flag induced by XML option */ #define JSVERSION_ANONFUNFIX 0x2000 /* see jsapi.h, the comments for JSOPTION_ANONFUNFIX */ #define JSVERSION_NUMBER(cx) ((JSVersion)((cx)->version & \ JSVERSION_MASK)) #define JS_HAS_XML_OPTION(cx) ((cx)->version & JSVERSION_HAS_XML || \ JSVERSION_NUMBER(cx) >= JSVERSION_1_6) extern JSThreadData * js_CurrentThreadData(JSRuntime *rt); extern JSBool js_InitThreads(JSRuntime *rt); extern void js_FinishThreads(JSRuntime *rt); extern void js_PurgeThreads(JSContext *cx); namespace js { #ifdef JS_THREADSAFE /* Iterator over JSThreadData from all JSThread instances. */ class ThreadDataIter : public JSThread::Map::Range { public: ThreadDataIter(JSRuntime *rt) : JSThread::Map::Range(rt->threads.all()) {} JSThreadData *threadData() const { return &front().value->data; } }; #else /* !JS_THREADSAFE */ class ThreadDataIter { JSRuntime *runtime; bool done; public: ThreadDataIter(JSRuntime *rt) : runtime(rt), done(false) {} bool empty() const { return done; } void popFront() { JS_ASSERT(!done); done = true; } JSThreadData *threadData() const { JS_ASSERT(!done); return &runtime->threadData; } }; #endif /* !JS_THREADSAFE */ } /* namespace js */ /* * Ensures the JSOPTION_XML and JSOPTION_ANONFUNFIX bits of cx->options are * reflected in cx->version, since each bit must travel with a script that has * it set. */ extern void js_SyncOptionsToVersion(JSContext *cx); /* * Common subroutine of JS_SetVersion and js_SetVersion, to update per-context * data that depends on version. */ extern void js_OnVersionChange(JSContext *cx); /* * Unlike the JS_SetVersion API, this function stores JSVERSION_HAS_XML and * any future non-version-number flags induced by compiler options. */ extern void js_SetVersion(JSContext *cx, JSVersion version); /* * Create and destroy functions for JSContext, which is manually allocated * and exclusively owned. */ extern JSContext * js_NewContext(JSRuntime *rt, size_t stackChunkSize); extern void js_DestroyContext(JSContext *cx, JSDestroyContextMode mode); /* * Return true if cx points to a context in rt->contextList, else return false. * NB: the caller (see jslock.c:ClaimTitle) must hold rt->gcLock. */ extern JSBool js_ValidContextPointer(JSRuntime *rt, JSContext *cx); static JS_INLINE JSContext * js_ContextFromLinkField(JSCList *link) { JS_ASSERT(link); return (JSContext *) ((uint8 *) link - offsetof(JSContext, link)); } /* * If unlocked, acquire and release rt->gcLock around *iterp update; otherwise * the caller must be holding rt->gcLock. */ extern JSContext * js_ContextIterator(JSRuntime *rt, JSBool unlocked, JSContext **iterp); /* * Iterate through contexts with active requests. The caller must be holding * rt->gcLock in case of a thread-safe build, or otherwise guarantee that the * context list is not alternated asynchroniously. */ extern JS_FRIEND_API(JSContext *) js_NextActiveContext(JSRuntime *, JSContext *); /* * Class.resolve and watchpoint recursion damping machinery. */ extern JSBool js_StartResolving(JSContext *cx, JSResolvingKey *key, uint32 flag, JSResolvingEntry **entryp); extern void js_StopResolving(JSContext *cx, JSResolvingKey *key, uint32 flag, JSResolvingEntry *entry, uint32 generation); /* * Report an exception, which is currently realized as a printf-style format * string and its arguments. */ typedef enum JSErrNum { #define MSG_DEF(name, number, count, exception, format) \ name = number, #include "js.msg" #undef MSG_DEF JSErr_Limit } JSErrNum; extern JS_FRIEND_API(const JSErrorFormatString *) js_GetErrorMessage(void *userRef, const char *locale, const uintN errorNumber); #ifdef va_start extern JSBool js_ReportErrorVA(JSContext *cx, uintN flags, const char *format, va_list ap); extern JSBool js_ReportErrorNumberVA(JSContext *cx, uintN flags, JSErrorCallback callback, void *userRef, const uintN errorNumber, JSBool charArgs, va_list ap); extern JSBool js_ExpandErrorArguments(JSContext *cx, JSErrorCallback callback, void *userRef, const uintN errorNumber, char **message, JSErrorReport *reportp, bool charArgs, va_list ap); #endif extern void js_ReportOutOfMemory(JSContext *cx); /* * Report that cx->scriptStackQuota is exhausted. */ void js_ReportOutOfScriptQuota(JSContext *cx); extern void js_ReportOverRecursed(JSContext *cx); extern JS_FRIEND_API(void) js_ReportAllocationOverflow(JSContext *cx); #define JS_CHECK_RECURSION(cx, onerror) \ JS_BEGIN_MACRO \ int stackDummy_; \ \ if (!JS_CHECK_STACK_SIZE(cx, stackDummy_)) { \ js_ReportOverRecursed(cx); \ onerror; \ } \ JS_END_MACRO /* * Report an exception using a previously composed JSErrorReport. * XXXbe remove from "friend" API */ extern JS_FRIEND_API(void) js_ReportErrorAgain(JSContext *cx, const char *message, JSErrorReport *report); extern void js_ReportIsNotDefined(JSContext *cx, const char *name); /* * Report an attempt to access the property of a null or undefined value (v). */ extern JSBool js_ReportIsNullOrUndefined(JSContext *cx, intN spindex, const js::Value &v, JSString *fallback); extern void js_ReportMissingArg(JSContext *cx, const js::Value &v, uintN arg); /* * Report error using js_DecompileValueGenerator(cx, spindex, v, fallback) as * the first argument for the error message. If the error message has less * then 3 arguments, use null for arg1 or arg2. */ extern JSBool js_ReportValueErrorFlags(JSContext *cx, uintN flags, const uintN errorNumber, intN spindex, const js::Value &v, JSString *fallback, const char *arg1, const char *arg2); #define js_ReportValueError(cx,errorNumber,spindex,v,fallback) \ ((void)js_ReportValueErrorFlags(cx, JSREPORT_ERROR, errorNumber, \ spindex, v, fallback, NULL, NULL)) #define js_ReportValueError2(cx,errorNumber,spindex,v,fallback,arg1) \ ((void)js_ReportValueErrorFlags(cx, JSREPORT_ERROR, errorNumber, \ spindex, v, fallback, arg1, NULL)) #define js_ReportValueError3(cx,errorNumber,spindex,v,fallback,arg1,arg2) \ ((void)js_ReportValueErrorFlags(cx, JSREPORT_ERROR, errorNumber, \ spindex, v, fallback, arg1, arg2)) extern JSErrorFormatString js_ErrorFormatString[JSErr_Limit]; /* * See JS_SetThreadStackLimit in jsapi.c, where we check that the stack * grows in the expected direction. */ #if JS_STACK_GROWTH_DIRECTION > 0 # define JS_CHECK_STACK_SIZE(cx, lval) ((jsuword)&(lval) < (cx)->stackLimit) #else # define JS_CHECK_STACK_SIZE(cx, lval) ((jsuword)&(lval) > (cx)->stackLimit) #endif #ifdef JS_THREADSAFE # define JS_ASSERT_REQUEST_DEPTH(cx) JS_ASSERT((cx)->requestDepth >= 1) #else # define JS_ASSERT_REQUEST_DEPTH(cx) ((void) 0) #endif /* * If the operation callback flag was set, call the operation callback. * This macro can run the full GC. Return true if it is OK to continue and * false otherwise. */ #define JS_CHECK_OPERATION_LIMIT(cx) \ (JS_ASSERT_REQUEST_DEPTH(cx), \ (!JS_THREAD_DATA(cx)->operationCallbackFlag || js_InvokeOperationCallback(cx))) /* * Invoke the operation callback and return false if the current execution * is to be terminated. */ extern JSBool js_InvokeOperationCallback(JSContext *cx); #ifndef JS_THREADSAFE # define js_TriggerAllOperationCallbacks(rt, gcLocked) \ js_TriggerAllOperationCallbacks (rt) #endif void js_TriggerAllOperationCallbacks(JSRuntime *rt, JSBool gcLocked); extern JSStackFrame * js_GetScriptedCaller(JSContext *cx, JSStackFrame *fp); extern jsbytecode* js_GetCurrentBytecodePC(JSContext* cx); extern bool js_CurrentPCIsInImacro(JSContext *cx); namespace js { #ifdef JS_TRACER /* * Reconstruct the JS stack and clear cx->tracecx. We must be currently in a * _FAIL builtin from trace on cx or another context on the same thread. The * machine code for the trace remains on the C stack when js_DeepBail returns. * * Implemented in jstracer.cpp. */ JS_FORCES_STACK JS_FRIEND_API(void) DeepBail(JSContext *cx); #endif static JS_FORCES_STACK JS_INLINE void LeaveTrace(JSContext *cx) { #ifdef JS_TRACER if (JS_ON_TRACE(cx)) DeepBail(cx); #endif } static JS_INLINE void LeaveTraceIfGlobalObject(JSContext *cx, JSObject *obj) { if (!obj->parent) LeaveTrace(cx); } static JS_INLINE JSBool CanLeaveTrace(JSContext *cx) { JS_ASSERT(JS_ON_TRACE(cx)); #ifdef JS_TRACER return cx->bailExit != NULL; #else return JS_FALSE; #endif } extern void SetPendingException(JSContext *cx, const Value &v); } /* namespace js */ /* * Get the current cx->fp, first lazily instantiating stack frames if needed. * (Do not access cx->fp directly except in JS_REQUIRES_STACK code.) * * Defined in jstracer.cpp if JS_TRACER is defined. */ static JS_FORCES_STACK JS_INLINE JSStackFrame * js_GetTopStackFrame(JSContext *cx) { js::LeaveTrace(cx); return cx->fp; } static JS_INLINE JSBool js_IsPropertyCacheDisabled(JSContext *cx) { return cx->runtime->shapeGen >= js::SHAPE_OVERFLOW_BIT; } static JS_INLINE uint32 js_RegenerateShapeForGC(JSContext *cx) { JS_ASSERT(cx->runtime->gcRunning); JS_ASSERT(cx->runtime->gcRegenShapes); /* * Under the GC, compared with js_GenerateShape, we don't need to use * atomic increments but we still must make sure that after an overflow * the shape stays such. */ uint32 shape = cx->runtime->shapeGen; shape = (shape + 1) | (shape & js::SHAPE_OVERFLOW_BIT); cx->runtime->shapeGen = shape; return shape; } namespace js { inline void * ContextAllocPolicy::malloc(size_t bytes) { return cx->malloc(bytes); } inline void ContextAllocPolicy::free(void *p) { cx->free(p); } inline void * ContextAllocPolicy::realloc(void *p, size_t bytes) { return cx->realloc(p, bytes); } inline void ContextAllocPolicy::reportAllocOverflow() const { js_ReportAllocationOverflow(cx); } class AutoValueVector : private AutoGCRooter { public: explicit AutoValueVector(JSContext *cx JS_GUARD_OBJECT_NOTIFIER_PARAM) : AutoGCRooter(cx, VALVECTOR), vector(cx) { JS_GUARD_OBJECT_NOTIFIER_INIT; } size_t length() const { return vector.length(); } bool append(const Value &v) { return vector.append(v); } void popBack() { vector.popBack(); } bool growBy(size_t inc) { /* N.B. Value's default ctor leaves the Value undefined */ size_t oldLength = vector.length(); if (!vector.growByUninitialized(inc)) return false; MakeValueRangeGCSafe(vector.begin() + oldLength, vector.end()); return true; } bool resize(size_t newLength) { size_t oldLength = vector.length(); if (newLength <= oldLength) { vector.shrinkBy(oldLength - newLength); return true; } /* N.B. Value's default ctor leaves the Value undefined */ if (!vector.growByUninitialized(newLength - oldLength)) return false; MakeValueRangeGCSafe(vector.begin() + oldLength, vector.end()); return true; } bool reserve(size_t newLength) { return vector.reserve(newLength); } Value &operator[](size_t i) { return vector[i]; } const Value &operator[](size_t i) const { return vector[i]; } const Value *begin() const { return vector.begin(); } Value *begin() { return vector.begin(); } const Value *end() const { return vector.end(); } Value *end() { return vector.end(); } const jsval *jsval_begin() const { return Jsvalify(begin()); } jsval *jsval_begin() { return Jsvalify(begin()); } const jsval *jsval_end() const { return Jsvalify(end()); } jsval *jsval_end() { return Jsvalify(end()); } const Value &back() const { return vector.back(); } friend void AutoGCRooter::trace(JSTracer *trc); private: Vector vector; JS_DECL_USE_GUARD_OBJECT_NOTIFIER }; class AutoIdVector : private AutoGCRooter { public: explicit AutoIdVector(JSContext *cx JS_GUARD_OBJECT_NOTIFIER_PARAM) : AutoGCRooter(cx, IDVECTOR), vector(cx) { JS_GUARD_OBJECT_NOTIFIER_INIT; } size_t length() const { return vector.length(); } bool append(jsid id) { return vector.append(id); } void popBack() { vector.popBack(); } bool growBy(size_t inc) { /* N.B. jsid's default ctor leaves the jsid undefined */ size_t oldLength = vector.length(); if (!vector.growByUninitialized(inc)) return false; MakeIdRangeGCSafe(vector.begin() + oldLength, vector.end()); return true; } bool resize(size_t newLength) { size_t oldLength = vector.length(); if (newLength <= oldLength) { vector.shrinkBy(oldLength - newLength); return true; } /* N.B. jsid's default ctor leaves the jsid undefined */ if (!vector.growByUninitialized(newLength - oldLength)) return false; MakeIdRangeGCSafe(vector.begin() + oldLength, vector.end()); return true; } bool reserve(size_t newLength) { return vector.reserve(newLength); } jsid &operator[](size_t i) { return vector[i]; } const jsid &operator[](size_t i) const { return vector[i]; } const jsid *begin() const { return vector.begin(); } jsid *begin() { return vector.begin(); } const jsid *end() const { return vector.end(); } jsid *end() { return vector.end(); } const jsid &back() const { return vector.back(); } friend void AutoGCRooter::trace(JSTracer *trc); private: Vector vector; JS_DECL_USE_GUARD_OBJECT_NOTIFIER }; JSIdArray * NewIdArray(JSContext *cx, jsint length); } /* namespace js */ #ifdef _MSC_VER #pragma warning(pop) #pragma warning(pop) #endif #ifdef JS_UNDEFD_MOZALLOC_WRAPPERS # include "mozilla/mozalloc_macro_wrappers.h" #endif #endif /* jscntxt_h___ */