barrierSet.hpp revision 0
196N/A * Copyright 2000-2002 Sun Microsystems, Inc. All Rights Reserved. 0N/A * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. 0N/A * This code is free software; you can redistribute it and/or modify it 0N/A * under the terms of the GNU General Public License version 2 only, as 0N/A * published by the Free Software Foundation. 0N/A * This code is distributed in the hope that it will be useful, but WITHOUT 0N/A * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or 0N/A * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License 0N/A * version 2 for more details (a copy is included in the LICENSE file that 0N/A * accompanied this code). 0N/A * You should have received a copy of the GNU General Public License version 0N/A * 2 along with this work; if not, write to the Free Software Foundation, 0N/A * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. 0N/A * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara, 0N/A * CA 95054 USA or visit www.sun.com if you need additional information or 0N/A * have any questions. 0N/A// This class provides the interface between a barrier implementation and 0N/A// the rest of the system. 0N/A // To get around prohibition on RTTI. 342N/A // These operations indicate what kind of barriers the BarrierSet has. 0N/A // These functions indicate whether a particular access of the given 342N/A // kinds requires a barrier. 0N/A // The first four operations provide a direct implementation of the 113N/A // barrier set. An interpreter loop, for example, could call these 342N/A // directly, as appropriate. 0N/A // Invoke the barrier, if any, necessary when reading the given ref field. 0N/A // Invoke the barrier, if any, necessary when reading the given primitive 0N/A // "field" of "bytes" bytes in "obj". 0N/A // Invoke the barrier, if any, necessary when writing "new_val" into the 0N/A // ref field at "offset" in "obj". 0N/A // (For efficiency reasons, this operation is specialized for certain 0N/A // barrier types. Semantically, it should be thought of as a call to the 0N/A // virtual "_work" function below, which must implement the barrier.) 342N/A // Invoke the barrier, if any, necessary when writing the "bytes"-byte 845N/A // value(s) "val1" (and "val2") into the primitive "field". 342N/A // Operations on arrays, or general regions (e.g., for "clone") may be 845N/A // optimized by some barriers. 342N/A // The first six operations tell whether such an optimization exists for 342N/A // the particular barrier. 0N/A // These operations should assert false unless the correponding operation 0N/A // above returns true. Otherwise, they should perform an appropriate 0N/A // barrier for an array whose elements are all in the given memory region. 0N/A // (For efficiency reasons, this operation is specialized for certain 0N/A // barrier types. Semantically, it should be thought of as a call to the 0N/A // virtual "_work" function below, which must implement the barrier.) 0N/A // The remaining sets of operations are called by compilers or other code 1091N/A // generators to insert barriers into generated code. There may be 845N/A // several such code generators; the signatures of these 845N/A // barrier-generating functions may differ from generator to generator. 1091N/A // There will be a set of four function signatures for each code 0N/A // generator, which accomplish the generation of barriers of the four 342N/A // Generates code to invoke the barrier, if any, necessary when reading 1091N/A // the ref field at "offset" in "obj". 342N/A // Generates code to invoke the barrier, if any, necessary when reading 342N/A // the primitive field of "bytes" bytes at offset" in "obj". 0N/A // Generates code to invoke the barrier, if any, necessary when writing 0N/A // "new_val" into the ref field at "offset" in "obj". 0N/A // Generates code to invoke the barrier, if any, necessary when writing 0N/A // the "bytes"-byte value "new_val" into the primitive field at "offset" 0N/A // Some barrier sets create tables whose elements correspond to parts of 0N/A // the heap; the CardTableModRefBS is an example. Such barrier sets will 0N/A // normally reserve space for such tables, and commit parts of the table 0N/A // "covering" parts of the heap that are committed. The constructor is 0N/A // passed the maximum number of independently committable subregions to 0N/A // be covered, and the "resize_covoered_region" function allows the 0N/A // sub-parts of the heap to inform the barrier set of changes of their 0N/A // Inform the BarrierSet that the the covered heap region that starts 0N/A // with "base" has been changed to have the given size (possibly from 0, 0N/A // for initialization.) 0N/A // If the barrier set imposes any alignment restrictions on boundaries 0N/A // within the heap, this function tells whether they are met.