src/share/vm/memory/barrierSet.hpp
Index Unified diffs Context diffs Sdiffs Patch New Old Previous File Next File
*** old/src/share/vm/memory/barrierSet.hpp	Wed Jan 15 01:41:44 2014
--- new/src/share/vm/memory/barrierSet.hpp	Wed Jan 15 01:41:44 2014

*** 122,132 **** --- 122,132 ---- virtual bool has_write_prim_array_opt() = 0; virtual bool has_read_region_opt() = 0; virtual bool has_write_region_opt() = 0; ! // These operations should assert false unless the correponding operation ! // These operations should assert false unless the corresponding operation // above returns true. Otherwise, they should perform an appropriate // barrier for an array whose elements are all in the given memory region. virtual void read_ref_array(MemRegion mr) = 0; virtual void read_prim_array(MemRegion mr) = 0;
*** 163,173 **** --- 163,173 ---- // Some barrier sets create tables whose elements correspond to parts of // the heap; the CardTableModRefBS is an example. Such barrier sets will // normally reserve space for such tables, and commit parts of the table // "covering" parts of the heap that are committed. The constructor is // passed the maximum number of independently committable subregions to ! // be covered, and the "resize_covoered_region" function allows the ! // be covered, and the "resize_covered_region" function allows the // sub-parts of the heap to inform the barrier set of changes of their // sizes. BarrierSet(int max_covered_regions) : _max_covered_regions(max_covered_regions) {}

src/share/vm/memory/barrierSet.hpp
Index Unified diffs Context diffs Sdiffs Patch New Old Previous File Next File