Tag Archive for: Smart Pointers

Posts

ClassIdioms

Covariant Return Type

February 26, 2023

/

The Covariant Return Type of a member function allows an overriding member function to return a narrower…

patterns

The Proxy Pattern

November 13, 2022

/

The Proxy Pattern is probably the most influential design pattern for C++. The Proxy provides a placeholder…

patterns

The Bridge Pattern

October 16, 2022

/

The Bridge Pattern is a structural pattern. It decouples the interface from the implementation. In C++,…

TimelineCpp20

Barriers and Atomic Smart Pointers in C++20

January 29, 2021

/

In my last post, I introduced latches in C++20. A latch enables its threads to wait until a counter becomes…

relay race

C++ Core Guidelines: Passing Smart Pointers

December 23, 2017

/

Passing smart pointers is a critical topic that is seldom addressed. This ends with the C++ core guidelines…

gold 513062 640

C++ Core Guidelines: Rules for Smart Pointers

December 15, 2017

/

There were a lot of C++ experts who said that smart pointers were the essential feature of C++11. Today,…

sharedPtr

Atomic Smart Pointers

February 20, 2017

/

C++20 will have atomic smart pointers. To be exact, we will get a std::atomic_shared_ptr and a std::atomic_weak_ptr.…

weakPtr

std::weak_ptr

December 14, 2016

/

std::unique_ptr models the concept of exclusive ownership, std::shared_ptr the concept of shared ownership.…

enabledShared

Specialities of std::shared_ptr

December 12, 2016

/

After I draw the big picture of a std::shared_ptr in the last post, I want to present two special aspects…

sharedPtr

std::shared_ptr

December 11, 2016

/

std::shared_ptr's share the resource. The shared reference counter counts the number of owners. Copying…

Latest news

A Lock-Free Stack: A Hazard Pointer Implementation Explained IIApril 7, 2025 - 11:11 am
In my last post, I started to explain a hazard pointer implementation: A Lock-Free Stack: A Hazard Pointer Implementation Explained I. Today, I will continue to explain the implementation. The Retire List The retire list has the public member functions isInUse, addNode, and deleteUnusedNodes. Additionally, it has the inner class RetireNode, an atomic member of […]
A Lock-Free Stack: A Hazard Pointer Implementation Explained IMarch 24, 2025 - 11:37 am
In my last post, I presented a hazard pointer implementation: A Lock-Free Stack: A Hazard Pointer Implementation. Today, I will explain the implementation. MyNode is a class template, parametrized by the type it holds: data. MyNode models the concept Node. template <typename T> concept Node = requires(T a) { {T::data}; { *a.next } -> std::same_as<T&>; […]
A Lock-Free Stack: A Hazard Pointer ImplementationMarch 10, 2025 - 11:42 am
Hazard Pointers solve all issues of the previous implementation: A Lock-Free Stack: A Simple Garbage Collector. From one Week to two Weeks You may have already noticed. I will change my blog publishing frequency from one to two weeks in the future. Writing a post using your voice is exceptionally exhausting and time-consuming. Hazard Pointers […]
A Lock-Free Stack: A Simple Garbage CollectorFebruary 24, 2025 - 11:58 am
My next lock-free stack includes a simple garbage collector. I discussed the concurrent execution of more than one topAndPush call is a Race Condition. I can safely delete a node if not more than one topAndPush call is executing concurrently. This observation is crucial for solving this memory leak issue: I store removed nodes on […]
A Lock-Free Stack: Atomic Smart PointerFebruary 17, 2025 - 11:47 am
The easiest way to solve this memory leak issue from the last post is to use a std::shared_ptr. Atomic Smart Pointer There are two ways to apply atomic operations on a std::shared_ptr: In C++11, you can use the free atomic functions on std::shared_ptr. With C++20, you can use atomic smart pointers. C++11 Using atomic operations […]
A Lock-Free Stack: A Complete ImplementationFebruary 10, 2025 - 3:01 pm
My last lock-free stack implementation was incomplete. It only supported push operations. Let’s change this. The following paragraph about sequential consistency is optional. You can easily ignore it. Sequential Consistency In my examples, I use the default memory ordering: sequential consistency. The reason is simple. Sequential consistency provides the strongest guarantees of all memory ordering […]