blob: 121da37389b185a803ff02a77d1388f80e2df304 [file] [log] [blame]
Ian Rogers5d76c432011-10-31 21:42:49 -07001/*
2 * Copyright (C) 2010 The Android Open Source Project
3 *
4 * Licensed under the Apache License, Version 2.0 (the "License");
5 * you may not use this file except in compliance with the License.
6 * You may obtain a copy of the License at
7 *
8 * http://www.apache.org/licenses/LICENSE-2.0
9 *
10 * Unless required by applicable law or agreed to in writing, software
11 * distributed under the License is distributed on an "AS IS" BASIS,
12 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
13 * See the License for the specific language governing permissions and
14 * limitations under the License.
15 */
16
17#include "card_table.h"
18
Elliott Hughes07ed66b2012-12-12 18:34:25 -080019#include "base/logging.h"
Mathieu Chartierdabdc0f2016-03-04 14:58:03 -080020#include "base/systrace.h"
Ian Rogers1d54e732013-05-02 21:10:01 -070021#include "card_table-inl.h"
22#include "gc/heap.h"
23#include "gc/space/space.h"
Ian Rogers5d76c432011-10-31 21:42:49 -070024#include "heap_bitmap.h"
Vladimir Marko3481ba22015-04-13 12:22:36 +010025#include "mem_map.h"
Elliott Hughesb3bd5f02012-03-08 21:05:27 -080026#include "runtime.h"
Elliott Hughesf0605a02012-01-13 20:12:02 -080027#include "utils.h"
Ian Rogers5d76c432011-10-31 21:42:49 -070028
29namespace art {
Ian Rogers1d54e732013-05-02 21:10:01 -070030namespace gc {
31namespace accounting {
32
Mathieu Chartier2c265012014-08-05 18:15:56 -070033constexpr size_t CardTable::kCardShift;
34constexpr size_t CardTable::kCardSize;
35constexpr uint8_t CardTable::kCardClean;
36constexpr uint8_t CardTable::kCardDirty;
37
Ian Rogers5d76c432011-10-31 21:42:49 -070038/*
39 * Maintain a card table from the write barrier. All writes of
Mathieu Chartier2cebb242015-04-21 16:50:40 -070040 * non-null values to heap addresses should go through an entry in
Ian Rogers5d76c432011-10-31 21:42:49 -070041 * WriteBarrier, and from there to here.
42 *
43 * The heap is divided into "cards" of GC_CARD_SIZE bytes, as
44 * determined by GC_CARD_SHIFT. The card table contains one byte of
45 * data per card, to be used by the GC. The value of the byte will be
46 * one of GC_CARD_CLEAN or GC_CARD_DIRTY.
47 *
Mathieu Chartier2cebb242015-04-21 16:50:40 -070048 * After any store of a non-null object pointer into a heap object,
Ian Rogers5d76c432011-10-31 21:42:49 -070049 * code is obliged to mark the card dirty. The setters in
50 * object.h [such as SetFieldObject] do this for you. The
51 * compiler also contains code to mark cards as dirty.
52 *
53 * The card table's base [the "biased card table"] gets set to a
54 * rather strange value. In order to keep the JIT from having to
55 * fabricate or load GC_DIRTY_CARD to store into the card table,
56 * biased base is within the mmap allocation at a point where its low
Ian Rogers30fab402012-01-23 15:43:46 -080057 * byte is equal to GC_DIRTY_CARD. See CardTable::Create for details.
Ian Rogers5d76c432011-10-31 21:42:49 -070058 */
59
Ian Rogers13735952014-10-08 12:43:28 -070060CardTable* CardTable::Create(const uint8_t* heap_begin, size_t heap_capacity) {
Mathieu Chartierdabdc0f2016-03-04 14:58:03 -080061 ScopedTrace trace(__PRETTY_FUNCTION__);
Ian Rogers5d76c432011-10-31 21:42:49 -070062 /* Set up the card table */
Mathieu Chartier7469ebf2012-09-24 16:28:36 -070063 size_t capacity = heap_capacity / kCardSize;
Ian Rogers5d76c432011-10-31 21:42:49 -070064 /* Allocate an extra 256 bytes to allow fixed low-byte of base */
Ian Rogers8d31bbd2013-10-13 10:44:14 -070065 std::string error_msg;
Mathieu Chartier2c265012014-08-05 18:15:56 -070066 std::unique_ptr<MemMap> mem_map(
67 MemMap::MapAnonymous("card table", nullptr, capacity + 256, PROT_READ | PROT_WRITE,
Vladimir Marko5c42c292015-02-25 12:02:49 +000068 false, false, &error_msg));
Mathieu Chartier2cebb242015-04-21 16:50:40 -070069 CHECK(mem_map.get() != nullptr) << "couldn't allocate card table: " << error_msg;
Ian Rogers30fab402012-01-23 15:43:46 -080070 // All zeros is the correct initial value; all clean. Anonymous mmaps are initialized to zero, we
71 // don't clear the card table to avoid unnecessary pages being allocated
Andreas Gampe575e78c2014-11-03 23:41:03 -080072 static_assert(kCardClean == 0, "kCardClean must be 0");
Ian Rogers30fab402012-01-23 15:43:46 -080073
Ian Rogers13735952014-10-08 12:43:28 -070074 uint8_t* cardtable_begin = mem_map->Begin();
Mathieu Chartier2cebb242015-04-21 16:50:40 -070075 CHECK(cardtable_begin != nullptr);
Ian Rogers30fab402012-01-23 15:43:46 -080076
77 // We allocated up to a bytes worth of extra space to allow biased_begin's byte value to equal
Mathieu Chartier2c265012014-08-05 18:15:56 -070078 // kCardDirty, compute a offset value to make this the case
Ian Rogers30fab402012-01-23 15:43:46 -080079 size_t offset = 0;
Ian Rogers13735952014-10-08 12:43:28 -070080 uint8_t* biased_begin = reinterpret_cast<uint8_t*>(reinterpret_cast<uintptr_t>(cardtable_begin) -
Mathieu Chartier7469ebf2012-09-24 16:28:36 -070081 (reinterpret_cast<uintptr_t>(heap_begin) >> kCardShift));
Mathieu Chartier2c265012014-08-05 18:15:56 -070082 uintptr_t biased_byte = reinterpret_cast<uintptr_t>(biased_begin) & 0xff;
83 if (biased_byte != kCardDirty) {
84 int delta = kCardDirty - biased_byte;
Ian Rogers30fab402012-01-23 15:43:46 -080085 offset = delta + (delta < 0 ? 0x100 : 0);
86 biased_begin += offset;
Ian Rogers5d76c432011-10-31 21:42:49 -070087 }
Ian Rogersef7d42f2014-01-06 12:55:46 -080088 CHECK_EQ(reinterpret_cast<uintptr_t>(biased_begin) & 0xff, kCardDirty);
Ian Rogers30fab402012-01-23 15:43:46 -080089 return new CardTable(mem_map.release(), biased_begin, offset);
Ian Rogers5d76c432011-10-31 21:42:49 -070090}
91
Ian Rogers13735952014-10-08 12:43:28 -070092CardTable::CardTable(MemMap* mem_map, uint8_t* biased_begin, size_t offset)
Elliott Hughesa168c832012-06-12 15:34:20 -070093 : mem_map_(mem_map), biased_begin_(biased_begin), offset_(offset) {
Elliott Hughesa168c832012-06-12 15:34:20 -070094}
95
Vladimir Marko3481ba22015-04-13 12:22:36 +010096CardTable::~CardTable() {
97 // Destroys MemMap via std::unique_ptr<>.
98}
99
Ian Rogers1d54e732013-05-02 21:10:01 -0700100void CardTable::ClearSpaceCards(space::ContinuousSpace* space) {
Mathieu Chartier262e5ff2012-06-01 17:35:38 -0700101 // TODO: clear just the range of the table that has been modified
Ian Rogers13735952014-10-08 12:43:28 -0700102 uint8_t* card_start = CardFromAddr(space->Begin());
103 uint8_t* card_end = CardFromAddr(space->End()); // Make sure to round up.
Mathieu Chartier7469ebf2012-09-24 16:28:36 -0700104 memset(reinterpret_cast<void*>(card_start), kCardClean, card_end - card_start);
Mathieu Chartier262e5ff2012-06-01 17:35:38 -0700105}
106
Ian Rogers5d76c432011-10-31 21:42:49 -0700107void CardTable::ClearCardTable() {
Andreas Gampe575e78c2014-11-03 23:41:03 -0800108 static_assert(kCardClean == 0, "kCardClean must be 0");
Ian Rogersc5f17732014-06-05 20:48:42 -0700109 mem_map_->MadviseDontNeedAndZero();
Ian Rogers5d76c432011-10-31 21:42:49 -0700110}
111
Lei Li4add3b42015-01-15 11:55:26 +0800112void CardTable::ClearCardRange(uint8_t* start, uint8_t* end) {
113 if (!kMadviseZeroes) {
114 memset(start, 0, end - start);
115 return;
116 }
117 CHECK_ALIGNED(reinterpret_cast<uintptr_t>(start), kCardSize);
118 CHECK_ALIGNED(reinterpret_cast<uintptr_t>(end), kCardSize);
119 static_assert(kCardClean == 0, "kCardClean must be 0");
120 uint8_t* start_card = CardFromAddr(start);
121 uint8_t* end_card = CardFromAddr(end);
122 uint8_t* round_start = AlignUp(start_card, kPageSize);
123 uint8_t* round_end = AlignDown(end_card, kPageSize);
124 if (round_start < round_end) {
125 madvise(round_start, round_end - round_start, MADV_DONTNEED);
126 }
127 // Handle unaligned regions at start / end.
128 memset(start_card, 0, std::min(round_start, end_card) - start_card);
129 memset(std::max(round_end, start_card), 0, end_card - std::max(round_end, start_card));
130}
131
Mathieu Chartier7469ebf2012-09-24 16:28:36 -0700132bool CardTable::AddrIsInCardTable(const void* addr) const {
133 return IsValidCard(biased_begin_ + ((uintptr_t)addr >> kCardShift));
134}
135
Ian Rogers13735952014-10-08 12:43:28 -0700136void CardTable::CheckAddrIsInCardTable(const uint8_t* addr) const {
137 uint8_t* card_addr = biased_begin_ + ((uintptr_t)addr >> kCardShift);
138 uint8_t* begin = mem_map_->Begin() + offset_;
139 uint8_t* end = mem_map_->End();
Mathieu Chartier7469ebf2012-09-24 16:28:36 -0700140 CHECK(AddrIsInCardTable(addr))
141 << "Card table " << this
142 << " begin: " << reinterpret_cast<void*>(begin)
143 << " end: " << reinterpret_cast<void*>(end)
144 << " card_addr: " << reinterpret_cast<void*>(card_addr)
145 << " heap begin: " << AddrFromCard(begin)
146 << " heap end: " << AddrFromCard(end)
147 << " addr: " << reinterpret_cast<const void*>(addr);
Ian Rogers5d76c432011-10-31 21:42:49 -0700148}
149
Ian Rogers5d76c432011-10-31 21:42:49 -0700150void CardTable::VerifyCardTable() {
151 UNIMPLEMENTED(WARNING) << "Card table verification";
152}
153
Ian Rogers1d54e732013-05-02 21:10:01 -0700154} // namespace accounting
155} // namespace gc
Ian Rogers5d76c432011-10-31 21:42:49 -0700156} // namespace art