198 lines
4.8 KiB
C++
198 lines
4.8 KiB
C++
/*
|
|
* Copyright (C) 2018-2023 Intel Corporation
|
|
*
|
|
* SPDX-License-Identifier: MIT
|
|
*
|
|
*/
|
|
|
|
#pragma once
|
|
|
|
#include "shared/source/helpers/mt_helpers.h"
|
|
|
|
#include <atomic>
|
|
#include <memory>
|
|
#include <type_traits>
|
|
|
|
namespace NEO {
|
|
|
|
template <typename NodeObjectType, bool atomic>
|
|
struct PtrType {
|
|
};
|
|
|
|
template <typename NodeObjectType>
|
|
struct PtrType<NodeObjectType, true> {
|
|
using type = std::atomic<NodeObjectType *>;
|
|
};
|
|
|
|
template <typename NodeObjectType>
|
|
struct PtrType<NodeObjectType, false> {
|
|
using type = NodeObjectType *;
|
|
};
|
|
|
|
template <typename NodeObjectType, bool atomic>
|
|
using PtrType_t = typename PtrType<NodeObjectType, atomic>::type;
|
|
|
|
template <typename NodeObjectType>
|
|
struct IFNode {
|
|
IFNode()
|
|
: next(nullptr) {
|
|
}
|
|
|
|
virtual ~IFNode() = default;
|
|
void insertOneNext(NodeObjectType &nd) {
|
|
nd.next = next;
|
|
next = &nd;
|
|
}
|
|
|
|
NodeObjectType *slice() {
|
|
NodeObjectType *rest = next;
|
|
next = nullptr;
|
|
return rest;
|
|
}
|
|
|
|
void insertAllNext(NodeObjectType &rhs) {
|
|
NodeObjectType *rhsTail = rhs.getTail();
|
|
rhsTail->next = next;
|
|
next = &rhs;
|
|
}
|
|
|
|
NodeObjectType *getTail() {
|
|
NodeObjectType *curr = static_cast<NodeObjectType *>(this);
|
|
while (curr->next != nullptr) {
|
|
curr = curr->next;
|
|
}
|
|
return curr;
|
|
}
|
|
|
|
std::unique_ptr<NodeObjectType> deleteThisAndAllNext() {
|
|
NodeObjectType *curr = this->next;
|
|
while (curr != nullptr) {
|
|
auto n = curr->next;
|
|
delete curr;
|
|
curr = n;
|
|
}
|
|
this->next = nullptr;
|
|
return std::unique_ptr<NodeObjectType>(static_cast<NodeObjectType *>(this));
|
|
}
|
|
|
|
size_t countSuccessors() const {
|
|
const NodeObjectType *curr = static_cast<const NodeObjectType *>(this);
|
|
size_t successors = 0;
|
|
while (curr->next != nullptr) {
|
|
curr = curr->next;
|
|
++successors;
|
|
}
|
|
return successors;
|
|
}
|
|
|
|
NodeObjectType *next;
|
|
};
|
|
|
|
template <typename NodeObjectType, bool threadSafe = true, bool ownsNodes = false>
|
|
class IFList {
|
|
public:
|
|
IFList()
|
|
: head(nullptr) {
|
|
}
|
|
|
|
IFList(NodeObjectType *node) {
|
|
head = node;
|
|
}
|
|
|
|
~IFList() {
|
|
this->cleanup();
|
|
}
|
|
|
|
IFList(const IFList &) = delete;
|
|
IFList &operator=(const IFList &) = delete;
|
|
|
|
template <bool c = threadSafe>
|
|
typename std::enable_if<c, void>::type pushFrontOne(NodeObjectType &node) {
|
|
node.next = head;
|
|
compareExchangeHead(node.next, &node);
|
|
}
|
|
|
|
template <bool c = threadSafe>
|
|
typename std::enable_if<c, NodeObjectType *>::type detachNodes() {
|
|
NodeObjectType *rest = head;
|
|
compareExchangeHead(rest, nullptr);
|
|
return rest;
|
|
}
|
|
|
|
template <bool c = threadSafe>
|
|
typename std::enable_if<!c, void>::type pushFrontOne(NodeObjectType &node) {
|
|
node.next = head;
|
|
head = &node;
|
|
}
|
|
|
|
template <bool c = threadSafe>
|
|
typename std::enable_if<!c, NodeObjectType *>::type detachNodes() {
|
|
NodeObjectType *rest = head;
|
|
head = nullptr;
|
|
return rest;
|
|
}
|
|
|
|
template <bool c = threadSafe>
|
|
typename std::enable_if<!c, void>::type splice(NodeObjectType &nodes) {
|
|
if (head == nullptr) {
|
|
head = &nodes;
|
|
} else {
|
|
head->getTail()->next = &nodes;
|
|
}
|
|
}
|
|
|
|
void deleteAll() {
|
|
NodeObjectType *nodes = detachNodes();
|
|
if (nodes != nullptr) {
|
|
nodes->deleteThisAndAllNext();
|
|
}
|
|
}
|
|
|
|
NodeObjectType *peekHead() {
|
|
return head;
|
|
}
|
|
|
|
bool peekIsEmpty() {
|
|
return (peekHead() == nullptr);
|
|
}
|
|
|
|
protected:
|
|
template <bool c = ownsNodes>
|
|
typename std::enable_if<c, void>::type cleanup() {
|
|
deleteAll();
|
|
}
|
|
|
|
template <bool c = ownsNodes>
|
|
typename std::enable_if<!c, void>::type cleanup() {
|
|
;
|
|
}
|
|
|
|
template <bool c = threadSafe>
|
|
typename std::enable_if<c, void>::type compareExchangeHead(NodeObjectType *&expected, NodeObjectType *desired) {
|
|
while (!NEO::MultiThreadHelpers::atomicCompareExchangeWeakSpin(head, expected, desired)) {
|
|
;
|
|
}
|
|
}
|
|
|
|
PtrType_t<NodeObjectType, threadSafe> head;
|
|
};
|
|
|
|
template <typename NodeObjectType>
|
|
struct IFNodeRef : IFNode<IFNodeRef<NodeObjectType>> {
|
|
IFNodeRef(NodeObjectType *ref)
|
|
: ref(ref) {
|
|
}
|
|
NodeObjectType *ref;
|
|
};
|
|
|
|
template <typename NodeObjectType, bool threadSafe = true, bool ownsNodes = true>
|
|
class IFRefList : public IFList<IFNodeRef<NodeObjectType>, threadSafe, ownsNodes> {
|
|
public:
|
|
void pushRefFrontOne(NodeObjectType &node) {
|
|
auto up = std::unique_ptr<IFNodeRef<NodeObjectType>>(new IFNodeRef<NodeObjectType>(&node));
|
|
this->pushFrontOne(*up);
|
|
up.release();
|
|
} // NOLINT(clang-analyzer-cplusplus.NewDeleteLeaks)
|
|
};
|
|
} // namespace NEO
|