Tag Archive for: Memory

Posts

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…

uniquePtr

std::unique_ptr

December 9, 2016

/

According to the RAII idiom, a std::unique_ptr manages automatically and exclusively the lifetime of…

comparisonEng

Memory and Performance Overhead of Smart Pointers

December 6, 2016

/

C++11 offers four different smart pointers. I will have a closer look in this post regarding memory and…

RessourcenmanagementEng

Careful Handling of Resources

December 5, 2016

/

The careful handling of resources - may it be, for example, memory, files, or sockets - is a key concern…

Latest news

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 […]
My Next Mentoring Program: “Generic Programming (Templates) with C++” startsFebruary 4, 2025 - 4:51 pm
My next mentoring program, “Embedded Programming with Modern C++,” starts on January 31st. Registration is open. Here are more details. Embedded Programming with Modern C++ The mentoring program consists of 16 stations. You have to invest at least 3 hours per week for each one. This means the program takes four months, and you can […]
A Lock-Free Stack: A Simplified ImplementationFebruary 3, 2025 - 10:37 am
Today, I continue my mini story about lock-free data structures. General Considerations From the outside, the caller’s responsibility (application) is to protect the data. From inside, the data structure is responsible for protecting itself. A data structure that protects itself so a data race cannot appear is called thread-safe. First, what general considerations must you […]
Deferred Reclamation in C++26: Read-Copy Update and Hazard PointersJanuary 27, 2025 - 12:23 pm
Before I dive into lock-free programming, there’s a little bit of theory necessary. A common problem in concurrency is the so-called ABA problem. That means you read a variable twice, which returns the same value each time, A. Therefore, you conclude that nothing changed in between. But you forgot the B. Let me first use […]
std::format ExtensionJanuary 20, 2025 - 11:55 am
Displaying the address of an arbitrary pointer in C++ 20 fails but succeeds with C++26. C++20 Only void, const void, and std::nullptr_t pointer types are valid. If you want to display the address of an arbitrary pointer, you must cast it to (const) void*. // formatPointer20.cpp #include <format> #include <iostream> #include <string> int main() { […]