archive/jdk
1
0
Fork 0
mirror of https://github.com/openjdk/jdk.git synced 2025-08-28 23:34:52 +02:00
Code Issues Projects Releases Packages Wiki Activity Actions

8003259: NPG: Build with gcc 4.7.2 broken by 7045397

Browse source 
Qualify calls with this pointers to make gcc accept this code.

Reviewed-by: coleenp, andrew
This commit is contained in:
Peter Levart 2012-11-14 22:37:38 -05:00 • committed by Coleen Phillimore
parent 14d6692461
commit bbe12c2488
1 changed files with 6 additions and 6 deletions
Download patch file Download diff file Expand all files Collapse all files

12
hotspot/src/share/vm/memory/binaryTreeDictionary.cpp
View file

@ -239,7 +239,7 @@ TreeList<Chunk_t, FreeList_t>* TreeList<Chunk_t, FreeList_t>::remove_chunk_repla
} else { } else {
if (nextTC == NULL) { if (nextTC == NULL) {
// Removing chunk at tail of list // Removing chunk at tail of list
link_tail(prevFC); this->link_tail(prevFC);
} }
// Chunk is interior to the list // Chunk is interior to the list
prevFC->link_after(nextTC); prevFC->link_after(nextTC);
@ -296,7 +296,7 @@ void TreeList<Chunk_t, FreeList_t>::return_chunk_at_tail(TreeChunk<Chunk_t, Free
Chunk_t* fc = tail(); Chunk_t* fc = tail();
fc->link_after(chunk); fc->link_after(chunk);
link_tail(chunk); this->link_tail(chunk);
assert(!tail() || size() == tail()->size(), "Wrong sized chunk in list"); assert(!tail() || size() == tail()->size(), "Wrong sized chunk in list");
FreeList_t<Chunk_t>::increment_count(); FreeList_t<Chunk_t>::increment_count();
@ -323,7 +323,7 @@ void TreeList<Chunk_t, FreeList_t>::return_chunk_at_head(TreeChunk<Chunk_t, Free
chunk->link_after(fc); chunk->link_after(fc);
} else { } else {
assert(tail() == NULL, "List is inconsistent"); assert(tail() == NULL, "List is inconsistent");
link_tail(chunk); this->link_tail(chunk);
} }
head()->link_after(chunk); head()->link_after(chunk);
assert(!head() || size() == head()->size(), "Wrong sized chunk in list"); assert(!head() || size() == head()->size(), "Wrong sized chunk in list");
@ -940,7 +940,7 @@ class AscendTreeCensusClosure : public TreeCensusClosure<Chunk_t, FreeList_t> {
void do_tree(TreeList<Chunk_t, FreeList_t>* tl) { void do_tree(TreeList<Chunk_t, FreeList_t>* tl) {
if (tl != NULL) { if (tl != NULL) {
do_tree(tl->left()); do_tree(tl->left());
do_list(tl); this->do_list(tl);
do_tree(tl->right()); do_tree(tl->right());
} }
} }
@ -952,7 +952,7 @@ class DescendTreeCensusClosure : public TreeCensusClosure<Chunk_t, FreeList_t> {
void do_tree(TreeList<Chunk_t, FreeList_t>* tl) { void do_tree(TreeList<Chunk_t, FreeList_t>* tl) {
if (tl != NULL) { if (tl != NULL) {
do_tree(tl->right()); do_tree(tl->right());
do_list(tl); this->do_list(tl);
do_tree(tl->left()); do_tree(tl->left());
} }
} }
@ -1022,7 +1022,7 @@ class DescendTreeSearchClosure : public TreeSearchClosure<Chunk_t, FreeList_t> {
bool do_tree(TreeList<Chunk_t, FreeList_t>* tl) { bool do_tree(TreeList<Chunk_t, FreeList_t>* tl) {
if (tl != NULL) { if (tl != NULL) {
if (do_tree(tl->right())) return true; if (do_tree(tl->right())) return true;
if (do_list(tl)) return true; if (this->do_list(tl)) return true;
if (do_tree(tl->left())) return true; if (do_tree(tl->left())) return true;
} }
return false; return false;