1 /* |
1 /* |
2 * Copyright (c) 1997, 2006, Oracle and/or its affiliates. All rights reserved. |
2 * Copyright (c) 1997, 2010, Oracle and/or its affiliates. All rights reserved. |
3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. |
3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. |
4 * |
4 * |
5 * This code is free software; you can redistribute it and/or modify it |
5 * This code is free software; you can redistribute it and/or modify it |
6 * under the terms of the GNU General Public License version 2 only, as |
6 * under the terms of the GNU General Public License version 2 only, as |
7 * published by the Free Software Foundation. |
7 * published by the Free Software Foundation. |
20 * or visit www.oracle.com if you need additional information or have any |
20 * or visit www.oracle.com if you need additional information or have any |
21 * questions. |
21 * questions. |
22 * |
22 * |
23 */ |
23 */ |
24 |
24 |
25 # include "incls/_precompiled.incl" |
25 #include "precompiled.hpp" |
26 # include "incls/_barrierSet.cpp.incl" |
26 #include "gc_interface/collectedHeap.hpp" |
|
27 #include "memory/barrierSet.inline.hpp" |
|
28 #include "memory/universe.hpp" |
27 |
29 |
28 // count is number of array elements being written |
30 // count is number of array elements being written |
29 void BarrierSet::static_write_ref_array_pre(HeapWord* start, size_t count) { |
31 void BarrierSet::static_write_ref_array_pre(HeapWord* start, size_t count) { |
30 assert(count <= (size_t)max_intx, "count too large"); |
32 assert(count <= (size_t)max_intx, "count too large"); |
31 #if 0 |
33 #if 0 |