intrusive_ptr_*(): specify memory_order explicitly

More relaxed memory_order = less safety guarantees = faster execution.

This is safe because std::shared_ptr does the same. See also:
https://en.cppreference.com/w/cpp/atomic/memory_order
"Typical use for relaxed memory ordering is incrementing counters, such as the reference counters of std::shared_ptr, since this only requires atomicity, but not ordering or synchronization (note that decrementing the std::shared_ptr counters requires acquire-release synchronization with the destructor)."

Author: Al2Klimov

lib/base/object.cpp

@@ -245,13 +245,13 @@ void icinga::intrusive_ptr_add_ref(Object *object)
 	if (object->m_References.fetch_add(1) == 0u)
 		TypeAddObject(object);
 #else /* I2_LEAK_DEBUG */
-	object->m_References.fetch_add(1);
+	object->m_References.fetch_add(1, std::memory_order_relaxed);
 #endif /* I2_LEAK_DEBUG */
 }
 
 void icinga::intrusive_ptr_release(Object *object)
 {
-	auto previous (object->m_References.fetch_sub(1));
+	auto previous (object->m_References.fetch_sub(1, std::memory_order_acq_rel));
 
 	if (previous == 1u) {
 #ifdef I2_LEAK_DEBUG

lib/base/shared-object.hpp

@@ -58,12 +58,12 @@ class SharedObject
 
 inline void intrusive_ptr_add_ref(SharedObject *object)
 {
-	object->m_References.fetch_add(1);
+	object->m_References.fetch_add(1, std::memory_order_relaxed);
 }
 
 inline void intrusive_ptr_release(SharedObject *object)
 {
-	if (object->m_References.fetch_sub(1) == 1u) {
+	if (object->m_References.fetch_sub(1, std::memory_order_acq_rel) == 1u) {
 		delete object;
 	}
 }

lib/base/shared.hpp

@@ -17,13 +17,13 @@ class Shared;
 template<class T>
 inline void intrusive_ptr_add_ref(Shared<T> *object)
 {
-	object->m_References.fetch_add(1);
+	object->m_References.fetch_add(1, std::memory_order_relaxed);
 }
 
 template<class T>
 inline void intrusive_ptr_release(Shared<T> *object)
 {
-	if (object->m_References.fetch_sub(1) == 1u) {
+	if (object->m_References.fetch_sub(1, std::memory_order_acq_rel) == 1u) {
 		delete object;
 	}
 }