source: doc/theses/thierry_delisle_PhD/code/relaxed_list_layout.cpp @ b232745

#define NO_IO
#define NDEBUG
#include "relaxed_list.hpp"

struct __attribute__((aligned(64))) Node {
        static std::atomic_size_t creates;
        static std::atomic_size_t destroys;

        _LinksFields_t<Node> _links;

        int value;
        Node(int value): value(value) {
                creates++;
        }

        ~Node() {
                destroys++;
        }
};

int main() {
        return sizeof(relaxed_list<Node>) + relaxed_list<Node>::sizeof_queue;
}