1.1 --- a/src/share/vm/memory/heapInspection.hpp Thu May 16 11:44:33 2013 +0100
1.2 +++ b/src/share/vm/memory/heapInspection.hpp Thu May 23 12:44:18 2013 +0100
1.3 @@ -189,15 +189,15 @@
1.4 KlassInfoEntry(Klass* k, KlassInfoEntry* next) :
1.5 _klass(k), _instance_count(0), _instance_words(0), _next(next), _index(-1)
1.6 {}
1.7 - KlassInfoEntry* next() { return _next; }
1.8 - bool is_equal(Klass* k) { return k == _klass; }
1.9 - Klass* klass() { return _klass; }
1.10 - long count() { return _instance_count; }
1.11 + KlassInfoEntry* next() const { return _next; }
1.12 + bool is_equal(const Klass* k) { return k == _klass; }
1.13 + Klass* klass() const { return _klass; }
1.14 + long count() const { return _instance_count; }
1.15 void set_count(long ct) { _instance_count = ct; }
1.16 - size_t words() { return _instance_words; }
1.17 + size_t words() const { return _instance_words; }
1.18 void set_words(size_t wds) { _instance_words = wds; }
1.19 void set_index(long index) { _index = index; }
1.20 - long index() { return _index; }
1.21 + long index() const { return _index; }
1.22 int compare(KlassInfoEntry* e1, KlassInfoEntry* e2);
1.23 void print_on(outputStream* st) const;
1.24 const char* name() const;
1.25 @@ -215,7 +215,7 @@
1.26 KlassInfoEntry* list() { return _list; }
1.27 void set_list(KlassInfoEntry* l) { _list = l; }
1.28 public:
1.29 - KlassInfoEntry* lookup(Klass* const k);
1.30 + KlassInfoEntry* lookup(Klass* k);
1.31 void initialize() { _list = NULL; }
1.32 void empty();
1.33 void iterate(KlassInfoClosure* cic);
1.34 @@ -231,8 +231,8 @@
1.35 HeapWord* _ref;
1.36
1.37 KlassInfoBucket* _buckets;
1.38 - uint hash(Klass* p);
1.39 - KlassInfoEntry* lookup(Klass* const k); // allocates if not found!
1.40 + uint hash(const Klass* p);
1.41 + KlassInfoEntry* lookup(Klass* k); // allocates if not found!
1.42
1.43 class AllClassesFinder : public KlassClosure {
1.44 KlassInfoTable *_table;
