author seabld
Tue, 29 Jun 2010 09:58:35 -0700
changeset 46406 5609120be1aa93b5771d0ffbf01a3678d3616728
parent 40847 3989d32b13fc4568ffbff4d4133bb179a88236c5
child 52503 e5958cd4a1350776d8eda499c3e345623dea5d95
permissions -rw-r--r--
Added tag SEAMONKEY_2_1a2_RELEASE for changeset f6cf82daa5bd. CLOSED TREE

/* -*- Mode: C++; tab-width: 8; indent-tabs-mode: nil; c-basic-offset: 4 -*-
 * vim: set ts=8 sw=4 et tw=99:
 * ***** 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
 * Mozilla Corporation.
 * Portions created by the Initial Developer are Copyright (C) 2010
 * the Initial Developer. All Rights Reserved.
 * Contributor(s):
 *   Igor Bukanov <igor@mir2.org>
 * 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 jspropertycacheinlines_h___
#define jspropertycacheinlines_h___

#include "jspropertycache.h"
#include "jsscope.h"

using namespace js;

/* static */ inline bool
PropertyCache::matchShape(JSContext *cx, JSObject *obj, uint32 shape)
    return CX_OWNS_OBJECT_TITLE(cx, obj) && obj->shape() == shape;

 * This method is designed to inline the fast path in js_Interpret, so it makes
 * "just-so" restrictions on parameters, e.g. pobj and obj should not be the
 * same variable, since for JOF_PROP-mode opcodes, obj must not be changed
 * because of a cache miss.
 * On return, if atom is null then obj points to the scope chain element in
 * which the property was found, pobj is locked, and entry is valid. If atom is
 * non-null then no object is locked but entry is still set correctly for use,
 * e.g., by PropertyCache::fill and atom should be used as the id to find.
 * We must lock pobj on a hit in order to close races with threads that might
 * be deleting a property from its scope, or otherwise invalidating property
 * caches (on all threads) by re-generating scope->shape.
PropertyCache::test(JSContext *cx, jsbytecode *pc, JSObject *&obj,
                    JSObject *&pobj, PropertyCacheEntry *&entry, JSAtom *&atom)
    JS_ASSERT(this == &JS_PROPERTY_CACHE(cx));

    uint32 kshape = obj->map->shape;
    entry = &table[hash(pc, kshape)];
    PCMETER(pctestentry = entry);
    JS_ASSERT(&obj != &pobj);
    JS_ASSERT(entry->kshape < SHAPE_OVERFLOW_BIT);
    if (entry->kpc == pc && entry->kshape == kshape) {
        JSObject *tmp;
        pobj = obj;
        if (entry->vcapTag() == 1 &&
            (tmp = pobj->getProto()) != NULL) {
            pobj = tmp;

        if (matchShape(cx, pobj, entry->vshape())) {
            PCMETER(!entry->vcapTag() || protopchits++);
            atom = NULL;
    atom = fullTest(cx, pc, &obj, &pobj, entry);
    if (atom)

PropertyCache::testForSet(JSContext *cx, jsbytecode *pc, JSObject *obj,
                          PropertyCacheEntry **entryp, JSObject **obj2p, JSAtom **atomp)
    uint32 shape = obj->map->shape;
    PropertyCacheEntry *entry = &table[hash(pc, shape)];
    *entryp = entry;
    PCMETER(pctestentry = entry);
    JS_ASSERT(entry->kshape < SHAPE_OVERFLOW_BIT);
    if (entry->kpc == pc && entry->kshape == shape && matchShape(cx, obj, shape))
        return true;

#ifdef DEBUG
    JSObject *orig = obj;
    JSAtom *atom = fullTest(cx, pc, &obj, obj2p, entry);
    if (atom) {
    } else {
        JS_ASSERT(obj == orig);
    *atomp = atom;
    return false;

PropertyCache::testForInit(JSRuntime *rt, jsbytecode *pc, JSObject *obj, JSScope *scope,
                           JSScopeProperty **spropp, PropertyCacheEntry **entryp)
    JS_ASSERT(scope->object == obj);
    uint32 kshape = scope->shape;
    PropertyCacheEntry *entry = &table[hash(pc, kshape)];
    *entryp = entry;
    PCMETER(pctestentry = entry);
    JS_ASSERT(entry->kshape < SHAPE_OVERFLOW_BIT);

    if (entry->kpc == pc &&
        entry->kshape == kshape &&
        entry->vshape() == rt->protoHazardShape) {
        JS_ASSERT(entry->vcapTag() == 0);
        *spropp = entry->vword.toSprop();
        return true;
    return false;

#endif /* jspropertycacheinlines_h___ */