Mercurial > hg > truffle
view src/cpu/sparc/vm/interpreter_sparc.hpp @ 453:c96030fff130
6684579: SoftReference processing can be made more efficient
Summary: For current soft-ref clearing policies, we can decide at marking time if a soft-reference will definitely not be cleared, postponing the decision of whether it will definitely be cleared to the final reference processing phase. This can be especially beneficial in the case of concurrent collectors where the marking is usually concurrent but reference processing is usually not.
Reviewed-by: jmasa
author | ysr |
---|---|
date | Thu, 20 Nov 2008 16:56:09 -0800 |
parents | a61af66fc99e |
children | 2338d41fbd81 |
line wrap: on
line source
/* * Copyright 1997-2007 Sun Microsystems, Inc. All Rights Reserved. * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. * * This code is free software; you can redistribute it and/or modify it * under the terms of the GNU General Public License version 2 only, as * published by the Free Software Foundation. * * This code is distributed in the hope that it will be useful, but WITHOUT * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License * version 2 for more details (a copy is included in the LICENSE file that * accompanied this code). * * You should have received a copy of the GNU General Public License version * 2 along with this work; if not, write to the Free Software Foundation, * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. * * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara, * CA 95054 USA or visit www.sun.com if you need additional information or * have any questions. * */ public: // Support for Tagged Stacks // Stack index relative to tos (which points at value) static int expr_index_at(int i) { return stackElementWords() * i; } static int expr_tag_index_at(int i) { assert(TaggedStackInterpreter, "should not call this"); // tag is one word above java stack element return stackElementWords() * i + 1; } static int expr_offset_in_bytes(int i) { return stackElementSize()*i + wordSize; } static int expr_tag_offset_in_bytes (int i) { assert(TaggedStackInterpreter, "should not call this"); return expr_offset_in_bytes(i) + wordSize; } // Already negated by c++ interpreter static int local_index_at(int i) { assert(i<=0, "local direction already negated"); return stackElementWords() * i + (value_offset_in_bytes()/wordSize); } static int local_tag_index_at(int i) { assert(i<=0, "local direction already negated"); assert(TaggedStackInterpreter, "should not call this"); return stackElementWords() * i + (tag_offset_in_bytes()/wordSize); }