Searched refs:_entries (Results 1 - 4 of 4) sorted by relevance
| /openjdk7/hotspot/src/share/vm/c1/ |
| H A D | c1_ValueMap.cpp | 49 , _entries(ValueMapInitialSize, NULL)
59 , _entries(old->_entries.length())
64 _entries.at_put(i, old->entry_at(i));
104 _entries = new_entries;
141 _entries.at_put(idx, new ValueMapEntry(hash, x, nesting(), entry_at(idx)));
165 _entries.at_put(i, entry->next()); \
225 _entries.at_put(i, NULL);
|
| H A D | c1_ValueMap.hpp | 62 // ValueMapEntries names _entries. Each ValueMapEntry has a nesting
77 ValueMapEntryArray _entries; member in class:ValueMap
86 int size() { return _entries.length(); }
87 ValueMapEntry* entry_at(int i) { return _entries.at(i); }
|
| /openjdk7/hotspot/src/share/vm/gc_implementation/g1/ |
| H A D | sparsePRT.hpp | 117 SparsePRTEntry* _entries; member in class:RSHashTable
135 // Returns the index of the next free entry in "_entries".
171 SparsePRTEntry* entry(int i) const { return (SparsePRTEntry*)((char*)_entries + SparsePRTEntry::size() * i); }
|
| H A D | sparsePRT.cpp | 151 _entries((SparsePRTEntry*)NEW_C_HEAP_ARRAY(char, SparsePRTEntry::size() * capacity, mtGC)),
159 if (_entries != NULL) {
160 FREE_C_HEAP_ARRAY(SparsePRTEntry, _entries, mtGC);
161 _entries = NULL;
172 guarantee(_entries != NULL, "INV");
179 memset(_entries, NullEntry, _capacity * SparsePRTEntry::size());
193 pointer_delta(e, _entries, SparsePRTEntry::size()),
|
Completed in 26 milliseconds