< prev index next >

src/hotspot/share/gc/shared/barrierSet.inline.hpp

include problems

8  * This code is distributed in the hope that it will be useful, but WITHOUT                                                          
9  * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or                                                             
10  * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License                                                             
11  * version 2 for more details (a copy is included in the LICENSE file that                                                           
12  * accompanied this code).                                                                                                           
13  *                                                                                                                                   
14  * You should have received a copy of the GNU General Public License version                                                         
15  * 2 along with this work; if not, write to the Free Software Foundation,                                                            
16  * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.                                                                     
17  *                                                                                                                                   
18  * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA                                                           
19  * or visit www.oracle.com if you need additional information or have any                                                            
20  * questions.                                                                                                                        
21  *                                                                                                                                   
22  */                                                                                                                                  
23 
24 #ifndef SHARE_VM_GC_SHARED_BARRIERSET_INLINE_HPP                                                                                     
25 #define SHARE_VM_GC_SHARED_BARRIERSET_INLINE_HPP                                                                                     
26 
27 #include "gc/shared/barrierSet.hpp"                                                                                                  
28 #include "gc/shared/barrierSetConfig.inline.hpp"                                                                                     
29 #include "utilities/align.hpp"                                                                                                       
30 
31 // count is number of array elements being written                                                                                   
32 void BarrierSet::write_ref_array(HeapWord* start, size_t count) {                                                                    
33   assert(count <= (size_t)max_intx, "count too large");                                                                              
34   HeapWord* end = (HeapWord*)((char*)start + (count*heapOopSize));                                                                   
35   // In the case of compressed oops, start and end may potentially be misaligned;                                                    
36   // so we need to conservatively align the first downward (this is not                                                              
37   // strictly necessary for current uses, but a case of good hygiene and,                                                            
38   // if you will, aesthetics) and the second upward (this is essential for                                                           
39   // current uses) to a HeapWord boundary, so we mark all cards overlapping                                                          
40   // this write. If this evolves in the future to calling a                                                                          
41   // logging barrier of narrow oop granularity, like the pre-barrier for G1                                                          
42   // (mentioned here merely by way of example), we will need to change this                                                          
43   // interface, so it is "exactly precise" (if i may be allowed the adverbial                                                        
44   // redundancy for emphasis) and does not include narrow oop slots not                                                              
45   // included in the original write interval.                                                                                        
46   HeapWord* aligned_start = align_down(start, HeapWordSize);                                                                         
47   HeapWord* aligned_end   = align_up  (end,   HeapWordSize);                                                                         

8  * This code is distributed in the hope that it will be useful, but WITHOUT
9  * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
10  * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
11  * version 2 for more details (a copy is included in the LICENSE file that
12  * accompanied this code).
13  *
14  * You should have received a copy of the GNU General Public License version
15  * 2 along with this work; if not, write to the Free Software Foundation,
16  * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
17  *
18  * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
19  * or visit www.oracle.com if you need additional information or have any
20  * questions.
21  *
22  */
23 
24 #ifndef SHARE_VM_GC_SHARED_BARRIERSET_INLINE_HPP
25 #define SHARE_VM_GC_SHARED_BARRIERSET_INLINE_HPP
26 
27 #include "gc/shared/barrierSet.hpp"

28 #include "utilities/align.hpp"
29 
30 // count is number of array elements being written
31 void BarrierSet::write_ref_array(HeapWord* start, size_t count) {
32   assert(count <= (size_t)max_intx, "count too large");
33   HeapWord* end = (HeapWord*)((char*)start + (count*heapOopSize));
34   // In the case of compressed oops, start and end may potentially be misaligned;
35   // so we need to conservatively align the first downward (this is not
36   // strictly necessary for current uses, but a case of good hygiene and,
37   // if you will, aesthetics) and the second upward (this is essential for
38   // current uses) to a HeapWord boundary, so we mark all cards overlapping
39   // this write. If this evolves in the future to calling a
40   // logging barrier of narrow oop granularity, like the pre-barrier for G1
41   // (mentioned here merely by way of example), we will need to change this
42   // interface, so it is "exactly precise" (if i may be allowed the adverbial
43   // redundancy for emphasis) and does not include narrow oop slots not
44   // included in the original write interval.
45   HeapWord* aligned_start = align_down(start, HeapWordSize);
46   HeapWord* aligned_end   = align_up  (end,   HeapWordSize);
< prev index next >