Searched refs:_table (Results 1 - 25 of 26) sorted by relevance

12

/openjdk10/jaxws/src/java.xml.bind/share/classes/com/sun/xml/internal/fastinfoset/util/
H A DFixedEntryStringIntMap.java41 final int tableIndex = indexFor(hash, _table.length);
42 _table[tableIndex] = _fixedEntry = new Entry(fixedEntry, hash, _index++, null);
44 resize(2 * _table.length);
57 for (int i = 0; i < _table.length; i++) {
58 _table[i] = null;
63 final int tableIndex = indexFor(_fixedEntry._hash, _table.length);
64 _table[tableIndex] = _fixedEntry;
99 final int tableIndex = indexFor(_fixedEntry._hash, _table.length);
100 final Entry firstEntry = _table[tableIndex];
102 _table[tableInde
[all...]
H A DLocalNameQualifiedNamesMap.java65 private Entry[] _table; field in class:LocalNameQualifiedNamesMap
70 _table = new Entry[_capacity];
82 for (int i = 0; i < _table.length; i++) {
83 _table[i] = null;
139 final int tableIndex = indexFor(hash, _table.length);
140 for (Entry e = _table[tableIndex]; e != null; e = e._next) {
152 final int tableIndex = indexFor(hash, _table.length);
153 for (Entry e = _table[tableIndex]; e != null; e = e._next) {
170 final int tableIndex = indexFor(hash, _table.length);
171 for (Entry e = _table[tableInde
[all...]
H A DStringIntMap.java50 protected Entry[] _table; field in class:StringIntMap
60 _table = new Entry[_capacity];
72 for (int i = 0; i < _table.length; i++) {
73 _table[i] = null;
123 final int tableIndex = indexFor(hash, _table.length);
124 for (Entry e = _table[tableIndex]; e != null; e = e._next) {
136 final int tableIndex = indexFor(hash, _table.length);
159 final int tableIndex = indexFor(hash, _table.length);
160 for (Entry e = _table[tableIndex]; e != null; e = e._next) {
172 Entry e = _table[bucketInde
[all...]
H A DCharArrayIntMap.java70 private Entry[] _table; field in class:CharArrayIntMap
75 _table = new Entry[_capacity];
87 for (int i = 0; i < _table.length; i++) {
88 _table[i] = null;
146 final int tableIndex = indexFor(hash, _table.length);
147 for (Entry e = _table[tableIndex]; e != null; e = e._next) {
177 final int tableIndex = indexFor(hash, _table.length);
178 for (Entry e = _table[tableIndex]; e != null; e = e._next) {
188 Entry e = _table[bucketIndex];
189 _table[bucketInde
[all...]
/openjdk10/hotspot/src/share/vm/gc/g1/
H A Dg1CodeCacheRemSet.cpp154 delete _table;
158 return (G1CodeRootSetTable*) OrderAccess::load_ptr_acquire(&_table);
164 OrderAccess::release_store_ptr(&_table, temp);
190 _table->copy_to(temp);
192 G1CodeRootSetTable::purge_list_append(_table);
194 OrderAccess::release_store_ptr(&_table, temp);
210 added = _table->add(method);
217 assert(_length == (size_t)_table->number_of_entries(), "sizes should match");
222 if (_table != NULL) {
223 removed = _table
[all...]
H A Dg1CodeCacheRemSet.hpp45 G1CodeRootSetTable* _table; member in class:VALUE_OBJ_CLASS_SPEC
54 G1CodeRootSet() : _table(NULL), _length(0) {}
77 assert(empty == (_table == NULL), "is empty only if table is deallocated");
H A Dg1StringDedupTable.cpp203 G1StringDedupTable* G1StringDedupTable::_table = NULL; member in class:G1StringDedupTable
236 assert(_table == NULL, "One string deduplication table allowed");
238 _table = new G1StringDedupTable(_min_size);
324 hash = AltHashing::murmur3_32(_table->_hash_seed, data, length);
332 hash = AltHashing::murmur3_32(_table->_hash_seed, data, length);
399 size_t size = _table->_size;
402 if (_table->_entries > _table->_grow_threshold) {
409 } else if (_table->_entries < _table
[all...]
H A Dg1StringDedupTable.hpp118 static G1StringDedupTable* _table; member in class:G1StringDedupTable
185 // acts as a fence for _table, which could have been replaced by a new
188 return _table->lookup_or_add_inner(value, latin1, hash);
194 return _table->_hash_seed == 0;
/openjdk10/hotspot/src/share/vm/interpreter/
H A DtemplateInterpreter.cpp139 _table[btos][i],
140 _table[ztos][i],
141 _table[ctos][i],
142 _table[stos][i],
143 _table[atos][i],
144 _table[itos][i],
145 _table[ltos][i],
146 _table[ftos][i],
147 _table[dtos][i],
148 _table[vto
[all...]
H A DtemplateInterpreter.hpp70 address _table[number_of_states][length]; // dispatch tables, indexed by tosca and bytecode member in class:VALUE_OBJ_CLASS_SPEC
76 address* table_for(TosState state) { return _table[state]; }
/openjdk10/hotspot/src/share/vm/services/
H A DmallocSiteTable.cpp58 MallocSiteHashtableEntry* MallocSiteTable::_table[MallocSiteTable::table_size]; member in class:MallocSiteTable
104 _table[index] = entry;
114 head = _table[index];
144 if (_table[index] == NULL) {
150 if (Atomic::cmpxchg_ptr((void*)entry, (volatile void *)&_table[index], NULL) == NULL) {
157 MallocSiteHashtableEntry* head = _table[index];
184 MallocSiteHashtableEntry* head = _table[bucket_idx];
203 MallocSiteHashtableEntry* head = _table[index];
204 _table[index] = NULL;
H A DmallocSiteTable.hpp262 static MallocSiteHashtableEntry* _table[table_size]; member in class:MallocSiteTable
/openjdk10/hotspot/src/share/vm/utilities/
H A DresourceHash.hpp70 Node* _table[SIZE]; member in class:ResourceHashtable
76 Node** ptr = &_table[index];
93 ResourceHashtable() { memset(_table, 0, SIZE * sizeof(Node*)); }
97 Node* const* bucket = _table;
98 while (bucket < &_table[SIZE]) {
161 Node* const* bucket = _table;
162 while (bucket < &_table[SIZE]) {
/openjdk10/hotspot/src/share/vm/code/
H A DvtableStubs.cpp90 // hash value). Each list is anchored in a little hash _table, indexed
93 VtableStub* VtableStubs::_table[VtableStubs::N]; member in class:VtableStubs
104 _table[i] = NULL;
154 VtableStub* s = _table[hash];
165 s->set_next(_table[h]);
166 _table[h] = s;
176 for (s = _table[hash]; s != NULL && s != stub; s = s->next()) {}
193 for (VtableStub* s = _table[i]; s != NULL; s = s->next()) {
206 for (VtableStub* s = _table[i]; s != NULL; s = s->next()) {
H A DexceptionHandlerTable.cpp36 _table = REALLOC_RESOURCE_ARRAY(HandlerTableEntry, _table, _size, new_size);
40 _table[_length++] = entry;
47 HandlerTableEntry* t = _table + i;
62 _table = NEW_RESOURCE_ARRAY(HandlerTableEntry, initial_size);
69 _table = (HandlerTableEntry*)cm->handler_table_begin();
107 memmove(addr, _table, size_in_bytes());
137 HandlerTableEntry* t = _table + i;
H A DexceptionHandlerTable.hpp88 HandlerTableEntry* _table; // the table member in class:VALUE_OBJ_CLASS_SPEC
H A DvtableStubs.hpp109 public: // N must be public (some compilers need this for _table)
116 static VtableStub* _table[N]; // table of existing stubs member in class:VtableStubs
/openjdk10/jdk/src/java.base/share/native/libjimage/
H A DimageFile.cpp208 _table = new ImageFileReader*[_max];
209 assert(_table != NULL && "allocation failed");
213 delete[] _table;
220 _table = static_cast<ImageFileReader**>(realloc(_table, _max * sizeof(ImageFileReader*)));
222 _table[_count++] = image;
228 if (_table[i] == image) {
230 _table[i] = _table[--_count];
237 _table
[all...]
H A DimageFile.hpp370 ImageFileReader** _table; // Growable array of entries
380 inline ImageFileReader* get(u4 i) { return _table[i]; }
/openjdk10/hotspot/src/share/vm/opto/
H A DphaseX.hpp59 Node **_table; // Hash table of Node pointers member in class:NodeHash
81 void grow(); // Grow _table to next power of 2 and rehash
91 return _table[table_index];
365 NodeHash _table; // Hash table for value-numbering member in class:NodeHash::PhaseValues
375 bool hash_delete(Node *n) { return _table.hash_delete(n); }
376 void hash_insert(Node *n) { _table.hash_insert(n); }
377 Node *hash_find_insert(Node *n){ return _table.hash_find_insert(n); }
378 Node *hash_find(const Node *n) { return _table.hash_find(n); }
382 _table.remove_useless_nodes(useful);
422 _table
[all...]
H A DphaseX.cpp46 _table( NEW_ARENA_ARRAY( _a , Node* , _max ) ), // (Node**)_a->Amalloc(_max * sizeof(Node*)) ),
57 memset(_table,0,sizeof(Node*)*_max);
64 _table( NEW_ARENA_ARRAY( _a , Node* , _max ) ),
75 memset(_table,0,sizeof(Node*)*_max);
80 debug_only(_table = (Node**)badAddress); // interact correctly w/ operator=
87 debug_only(_table = (Node**)badAddress); // interact correctly w/ operator=
105 Node *k = _table[key]; // Get hashed value
127 k = _table[key]; // Get hashed value
151 Node *k = _table[key]; // Get hashed value
154 _table[ke
[all...]
/openjdk10/hotspot/src/share/vm/oops/
H A Dmethod.hpp1124 ExceptionTableElement* _table; member in class:ExceptionTable
1130 _table = m->exception_table_start();
1133 _table = NULL;
1144 return _table[idx].start_pc;
1149 _table[idx].start_pc = value;
1154 return _table[idx].end_pc;
1159 _table[idx].end_pc = value;
1164 return _table[idx].handler_pc;
1169 _table[idx].handler_pc = value;
1174 return _table[id
[all...]
/openjdk10/hotspot/src/share/vm/prims/
H A DjvmtiTagMap.cpp138 JvmtiTagHashmapEntry** _table; // the table of entries. member in class:JvmtiTagHashmap
155 _table = (JvmtiTagHashmapEntry**)os::malloc(s, mtInternal);
156 if (_table == NULL) {
161 _table[i] = NULL;
209 JvmtiTagHashmapEntry* entry = _table[i];
228 os::free((void*)_table);
229 _table = new_table;
243 _table[pos] = entry->next();
289 if (_table != NULL) {
290 os::free((void*)_table);
[all...]
/openjdk10/hotspot/src/share/vm/memory/
H A DheapInspection.hpp249 KlassInfoTable *_table; member in class:KlassInfoTable::AllClassesFinder
251 AllClassesFinder(KlassInfoTable* table) : _table(table) {}
H A DheapInspection.cpp162 _table->lookup(k);

Completed in 284 milliseconds

12