Mercurial > hg > truffle
comparison src/share/vm/utilities/hashtable.hpp @ 14521:29ccc4cbabca
Merge
author | Gilles Duboscq <duboscq@ssw.jku.at> |
---|---|
date | Wed, 12 Mar 2014 13:30:08 +0100 |
parents | 524b54a7f1b5 |
children | 3c6ae9109a86 4ca6dc0799b6 |
comparison
equal
deleted
inserted
replaced
14520:f84115370178 | 14521:29ccc4cbabca |
---|---|
1 /* | 1 /* |
2 * Copyright (c) 2003, 2012, Oracle and/or its affiliates. All rights reserved. | 2 * Copyright (c) 2003, 2014, Oracle and/or its affiliates. All rights reserved. |
3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. | 3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. |
4 * | 4 * |
5 * This code is free software; you can redistribute it and/or modify it | 5 * This code is free software; you can redistribute it and/or modify it |
6 * under the terms of the GNU General Public License version 2 only, as | 6 * under the terms of the GNU General Public License version 2 only, as |
7 * published by the Free Software Foundation. | 7 * published by the Free Software Foundation. |
278 } | 278 } |
279 | 279 |
280 // Function to move these elements into the new table. | 280 // Function to move these elements into the new table. |
281 void move_to(Hashtable<T, F>* new_table); | 281 void move_to(Hashtable<T, F>* new_table); |
282 static bool use_alternate_hashcode() { return _seed != 0; } | 282 static bool use_alternate_hashcode() { return _seed != 0; } |
283 static jint seed() { return _seed; } | 283 static juint seed() { return _seed; } |
284 | 284 |
285 static int literal_size(Symbol *symbol); | 285 static int literal_size(Symbol *symbol); |
286 static int literal_size(oop oop); | 286 static int literal_size(oop oop); |
287 | 287 |
288 // The following two are currently not used, but are needed anyway because some | 288 // The following two are currently not used, but are needed anyway because some |
294 | 294 |
295 public: | 295 public: |
296 void dump_table(outputStream* st, const char *table_name); | 296 void dump_table(outputStream* st, const char *table_name); |
297 | 297 |
298 private: | 298 private: |
299 static jint _seed; | 299 static juint _seed; |
300 }; | 300 }; |
301 | 301 |
302 | 302 |
303 // Verions of hashtable where two handles are used to compute the index. | 303 // Versions of hashtable where two handles are used to compute the index. |
304 | 304 |
305 template <class T, MEMFLAGS F> class TwoOopHashtable : public Hashtable<T, F> { | 305 template <class T, MEMFLAGS F> class TwoOopHashtable : public Hashtable<T, F> { |
306 friend class VMStructs; | 306 friend class VMStructs; |
307 protected: | 307 protected: |
308 TwoOopHashtable(int table_size, int entry_size) | 308 TwoOopHashtable(int table_size, int entry_size) |
325 int index_for(Symbol* name, ClassLoaderData* loader_data) { | 325 int index_for(Symbol* name, ClassLoaderData* loader_data) { |
326 return this->hash_to_index(compute_hash(name, loader_data)); | 326 return this->hash_to_index(compute_hash(name, loader_data)); |
327 } | 327 } |
328 }; | 328 }; |
329 | 329 |
330 | |
331 /* | |
332 * Usage of GenericHashtable: | |
333 * | |
334 * class X : public GenericHashtableEntry<X, ResourceObj> { | |
335 * | |
336 * // Implement virtual functions in class X | |
337 * bool equals(X* sig) const; | |
338 * uintptr_t hash() const; | |
339 * }; | |
340 * | |
341 * void foo() { | |
342 * GenericHashtable<X, ResourceObj>* table = new GenericHashtable<X, ResourceObj>(11027, false); | |
343 * | |
344 * X* elem = new X(); | |
345 * table->add(elem); | |
346 * table->contains(elem); | |
347 * } | |
348 * | |
349 * You can choose other allocation types as well. For example, to store the hashtable to a | |
350 * particular region (CHeapObj<type>) simply replace ResourceObj with the desired type: | |
351 * | |
352 * class X : public GenericHashtableEntry<X, CHeapObj<mtCode> > { ... }; | |
353 * | |
354 * To make the destructor (and remove) of the hashtable work: | |
355 * 1) override the delete operator of X | |
356 * 2) provide a destructor of the X | |
357 * | |
358 * You may also find it convenient to override the new operator. | |
359 * | |
360 * If you use this templates do not forget to add an explicit initialization | |
361 * (at the end of hashtable.cpp). | |
362 * | |
363 * template class GenericHashtable<X, ResourceObj>; | |
364 */ | |
365 template <class T, class M> class GenericHashtableEntry : public M { | |
366 private: | |
367 T* _next; | |
368 T* _prev; | |
369 public: | |
370 // Must be implemented by subclass. | |
371 virtual uintptr_t key() const = 0; | |
372 virtual bool equals(T* other) const = 0; | |
373 | |
374 T* next() const { return _next; } | |
375 T* prev() const { return _prev; } | |
376 void set_next(T* item) { _next = item; } | |
377 void set_prev(T* item) { _prev = item; } | |
378 | |
379 // Constructor and destructor | |
380 GenericHashtableEntry() : _next(NULL), _prev(NULL) { }; | |
381 virtual ~GenericHashtableEntry() {}; | |
382 }; | |
383 | |
384 template <class T, class M> class GenericHashtable : public M { | |
385 private: | |
386 T** _items; | |
387 int _size; | |
388 bool _C_heap; | |
389 MEMFLAGS _memflag; | |
390 | |
391 // Accessor methods | |
392 T* head (int idx) const { return _items[idx]; } | |
393 void set_head(T* item, int idx) { _items[idx] = item; } | |
394 int index (T* item) { assert(item != NULL, "missing null check"); return item->key() % size(); } | |
395 | |
396 // Helper function | |
397 T* contains_impl(T* item, int idx); | |
398 | |
399 DEBUG_ONLY(int _num_items;) | |
400 public: | |
401 GenericHashtable(int size, bool C_heap = false, MEMFLAGS memflag = mtNone); | |
402 ~GenericHashtable(); | |
403 T* contains(T* match_item); | |
404 T* remove (T* match_item); | |
405 bool add (T* item); | |
406 | |
407 | |
408 bool on_C_heap() const { return _C_heap; } | |
409 int size() const { return _size; } | |
410 }; | |
411 | |
330 #endif // SHARE_VM_UTILITIES_HASHTABLE_HPP | 412 #endif // SHARE_VM_UTILITIES_HASHTABLE_HPP |