mirror of
https://github.com/openjdk/jdk.git
synced 2025-09-16 00:54:38 +02:00
8230796: Remove BarrierSet::oop_equals_operator_allowed()
Reviewed-by: tschatzl, shade
This commit is contained in:
parent
c6543f1a2a
commit
0848c76a66
3 changed files with 2 additions and 19 deletions
|
@ -144,10 +144,6 @@ public:
|
|||
|
||||
virtual void make_parsable(JavaThread* thread) {}
|
||||
|
||||
#ifdef CHECK_UNHANDLED_OOPS
|
||||
virtual bool oop_equals_operator_allowed() { return true; }
|
||||
#endif
|
||||
|
||||
public:
|
||||
// Print a description of the memory for the barrier set
|
||||
virtual void print_on(outputStream* st) const = 0;
|
||||
|
|
|
@ -23,9 +23,6 @@
|
|||
*/
|
||||
|
||||
#include "precompiled.hpp"
|
||||
#include "gc/shared/barrierSet.hpp"
|
||||
#include "gc/shared/collectedHeap.hpp"
|
||||
#include "gc/shared/collectedHeap.inline.hpp"
|
||||
#include "memory/universe.hpp"
|
||||
#include "oops/oopsHierarchy.hpp"
|
||||
#include "runtime/thread.inline.hpp"
|
||||
|
@ -56,14 +53,4 @@ void oop::unregister_oop() {
|
|||
}
|
||||
}
|
||||
|
||||
bool oop::operator==(const oop o) const {
|
||||
assert(BarrierSet::barrier_set()->oop_equals_operator_allowed(), "Not allowed");
|
||||
return obj() == o.obj();
|
||||
}
|
||||
|
||||
bool oop::operator!=(const volatile oop o) const {
|
||||
assert(BarrierSet::barrier_set()->oop_equals_operator_allowed(), "Not allowed");
|
||||
return obj() != o.obj();
|
||||
}
|
||||
|
||||
#endif // CHECK_UNHANDLED_OOPS
|
||||
|
|
|
@ -100,9 +100,9 @@ public:
|
|||
|
||||
// General access
|
||||
oopDesc* operator->() const { return obj(); }
|
||||
bool operator==(const oop o) const;
|
||||
bool operator==(const oop o) const { return obj() == o.obj(); }
|
||||
bool operator==(void *p) const { return obj() == p; }
|
||||
bool operator!=(const volatile oop o) const;
|
||||
bool operator!=(const volatile oop o) const { return obj() != o.obj(); }
|
||||
bool operator!=(void *p) const { return obj() != p; }
|
||||
|
||||
// Assignment
|
||||
|
|
Loading…
Add table
Add a link
Reference in a new issue