HomeSort by relevance Sort by last modified time
    Searched defs:TableSlot (Results 1 - 3 of 3) sorted by null

  /art/runtime/
class_table-inl.h 33 for (TableSlot& table_slot : class_set) {
51 for (TableSlot& table_slot : class_set) {
69 for (TableSlot& table_slot : class_set) {
82 for (TableSlot& table_slot : class_set) {
92 inline mirror::Class* ClassTable::TableSlot::Read() const {
106 inline void ClassTable::TableSlot::VisitRoot(const Visitor& visitor) const {
119 inline ObjPtr<mirror::Class> ClassTable::TableSlot::ExtractPtr(uint32_t data) {
123 inline uint32_t ClassTable::TableSlot::Encode(ObjPtr<mirror::Class> klass, uint32_t hash_bits) {
128 inline ClassTable::TableSlot::TableSlot(ObjPtr<mirror::Class> klass, uint32_t descriptor_hash
    [all...]
class_table.h 52 class TableSlot {
54 TableSlot() : data_(0u) {}
56 TableSlot(const TableSlot& copy) : data_(copy.data_.load(std::memory_order_relaxed)) {}
58 explicit TableSlot(ObjPtr<mirror::Class> klass);
60 TableSlot(ObjPtr<mirror::Class> klass, uint32_t descriptor_hash);
62 TableSlot& operator=(const TableSlot& copy) {
111 uint32_t operator()(const TableSlot& slot) const NO_THREAD_SAFETY_ANALYSIS;
113 bool operator()(const TableSlot& a, const TableSlot& b) cons
    [all...]
class_table.cc 38 TableSlot slot(klass);
50 TableSlot slot(klass);
81 *existing_it = TableSlot(klass, hash);
88 for (const TableSlot& root : set) {
137 TableSlot slot(klass);
150 const uint32_t hash = TableSlot::HashDescriptor(klass);
152 classes_.back().InsertWithHash(TableSlot(klass, hash), hash);
162 for (const TableSlot& slot : class_set) {
169 const uint32_t hash = TableSlot::HashDescriptor(klass);
170 classes_.back().InsertWithHash(TableSlot(klass, hash), hash)
    [all...]

Completed in 254 milliseconds