src/hotspot/share/gc/shared/oopStorage.cpp
changeset 59249 29b0d0b61615
parent 59247 56bf71d64d51
child 59250 a6deb69743d4
--- a/src/hotspot/share/gc/shared/oopStorage.cpp	Mon Nov 25 12:30:24 2019 +0100
+++ b/src/hotspot/share/gc/shared/oopStorage.cpp	Mon Nov 25 12:31:39 2019 +0100
@@ -144,7 +144,7 @@
 }
 
 void OopStorage::ActiveArray::increment_refcount() const {
-  int new_value = Atomic::add(1, &_refcount);
+  int new_value = Atomic::add(&_refcount, 1);
   assert(new_value >= 1, "negative refcount %d", new_value - 1);
 }
 
@@ -1010,7 +1010,7 @@
   // than a CAS loop on some platforms when there is contention.
   // We can cope with the uncertainty by recomputing start/end from
   // the result of the add, and dealing with potential overshoot.
-  size_t end = Atomic::add(step, &_next_block);
+  size_t end = Atomic::add(&_next_block, step);
   // _next_block may have changed, so recompute start from result of add.
   start = end - step;
   // _next_block may have changed so much that end has overshot.