10 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
11 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
12 * version 2 for more details (a copy is included in the LICENSE file that
13 * accompanied this code).
14 *
15 * You should have received a copy of the GNU General Public License version
16 * 2 along with this work; if not, write to the Free Software Foundation,
17 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
18 *
19 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
20 * or visit www.oracle.com if you need additional information or have any
21 * questions.
22 *
23 */
24
25 #include "precompiled.hpp"
26 #include "asm/macroAssembler.inline.hpp"
27 #include "gc/shared/barrierSet.hpp"
28 #include "gc/shared/cardTable.hpp"
29 #include "gc/shared/cardTableBarrierSet.hpp"
30 #include "gc/shared/cardTableModRefBSCodeGen.hpp"
31 #include "gc/shared/collectedHeap.hpp"
32 #include "interpreter/interp_masm.hpp"
33
34 #define __ masm->
35
36 #ifdef PRODUCT
37 #define BLOCK_COMMENT(str) /* nothing */
38 #else
39 #define BLOCK_COMMENT(str) __ block_comment(str)
40 #endif
41
42 #define BIND(label) bind(label); BLOCK_COMMENT(#label ":")
43
44 void CardTableModRefBSCodeGen::gen_write_ref_array_post_barrier(MacroAssembler* masm, DecoratorSet decorators, Register addr, Registe
45 CardTableBarrierSet* ctbs = barrier_set_cast<CardTableBarrierSet>(Universe::heap()->barrier_set());
46 CardTable* ct = ctbs->card_table();
47 assert(sizeof(*ct->byte_map_base()) == sizeof(jbyte), "adjust this code");
48 assert_different_registers(addr, count, tmp);
49
50 Label L_loop, L_done;
51
52 __ cmp_and_br_short(count, 0, Assembler::equal, Assembler::pt, L_done); // zero count - nothing to do
53
54 __ sll_ptr(count, LogBytesPerHeapOop, count);
55 __ sub(count, BytesPerHeapOop, count);
56 __ add(count, addr, count);
57 // Use two shifts to clear out those low order two bits! (Cannot opt. into 1.)
58 __ srl_ptr(addr, CardTable::card_shift, addr);
59 __ srl_ptr(count, CardTable::card_shift, count);
60 __ sub(count, addr, count);
61 AddressLiteral rs(ct->byte_map_base());
62 __ set(rs, tmp);
63 __ BIND(L_loop);
|
10 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
11 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
12 * version 2 for more details (a copy is included in the LICENSE file that
13 * accompanied this code).
14 *
15 * You should have received a copy of the GNU General Public License version
16 * 2 along with this work; if not, write to the Free Software Foundation,
17 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
18 *
19 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
20 * or visit www.oracle.com if you need additional information or have any
21 * questions.
22 *
23 */
24
25 #include "precompiled.hpp"
26 #include "asm/macroAssembler.inline.hpp"
27 #include "gc/shared/barrierSet.hpp"
28 #include "gc/shared/cardTable.hpp"
29 #include "gc/shared/cardTableBarrierSet.hpp"
30 #include "gc/shared/cardTableBarrierSetAssembler.hpp"
31 #include "gc/shared/collectedHeap.hpp"
32 #include "interpreter/interp_masm.hpp"
33
34 #define __ masm->
35
36 #ifdef PRODUCT
37 #define BLOCK_COMMENT(str) /* nothing */
38 #else
39 #define BLOCK_COMMENT(str) __ block_comment(str)
40 #endif
41
42 #define BIND(label) bind(label); BLOCK_COMMENT(#label ":")
43
44 void CardTableBarrierSetAssembler::gen_write_ref_array_post_barrier(MacroAssembler* masm, DecoratorSet decorators,
45 Register addr, Register count, Register tmp) {
46 CardTableBarrierSet* ctbs = barrier_set_cast<CardTableBarrierSet>(Universe::heap()->barrier_set());
47 CardTable* ct = ctbs->card_table();
48 assert(sizeof(*ct->byte_map_base()) == sizeof(jbyte), "adjust this code");
49 assert_different_registers(addr, count, tmp);
50
51 Label L_loop, L_done;
52
53 __ cmp_and_br_short(count, 0, Assembler::equal, Assembler::pt, L_done); // zero count - nothing to do
54
55 __ sll_ptr(count, LogBytesPerHeapOop, count);
56 __ sub(count, BytesPerHeapOop, count);
57 __ add(count, addr, count);
58 // Use two shifts to clear out those low order two bits! (Cannot opt. into 1.)
59 __ srl_ptr(addr, CardTable::card_shift, addr);
60 __ srl_ptr(count, CardTable::card_shift, count);
61 __ sub(count, addr, count);
62 AddressLiteral rs(ct->byte_map_base());
63 __ set(rs, tmp);
64 __ BIND(L_loop);
|