139 lines
2.6 KiB
C++
139 lines
2.6 KiB
C++
/* Copyright 2023 Joaquin M Lopez Munoz.
|
|
* Distributed under the Boost Software License, Version 1.0.
|
|
* (See accompanying file LICENSE_1_0.txt or copy at
|
|
* http://www.boost.org/LICENSE_1_0.txt)
|
|
*
|
|
* See https://www.boost.org/libs/unordered for library home page.
|
|
*/
|
|
|
|
#ifndef BOOST_UNORDERED_DETAIL_FOA_REENTRANCY_CHECK_HPP
|
|
#define BOOST_UNORDERED_DETAIL_FOA_REENTRANCY_CHECK_HPP
|
|
|
|
#include <boost/assert.hpp>
|
|
#include <utility>
|
|
|
|
#if !defined(BOOST_UNORDERED_DISABLE_REENTRANCY_CHECK)&& \
|
|
!defined(BOOST_ASSERT_IS_VOID)
|
|
#define BOOST_UNORDERED_REENTRANCY_CHECK
|
|
#endif
|
|
|
|
namespace boost{
|
|
namespace unordered{
|
|
namespace detail{
|
|
namespace foa{
|
|
|
|
#if defined(BOOST_UNORDERED_REENTRANCY_CHECK)
|
|
|
|
class entry_trace
|
|
{
|
|
public:
|
|
entry_trace(const void* px_):px{px_}
|
|
{
|
|
if(px){
|
|
BOOST_ASSERT_MSG(!find(px),"reentrancy not allowed");
|
|
header()=this;
|
|
}
|
|
}
|
|
|
|
/* not used but VS in pre-C++17 mode needs to see it for RVO */
|
|
entry_trace(const entry_trace&);
|
|
|
|
~entry_trace(){clear();}
|
|
|
|
void clear()
|
|
{
|
|
if(px){
|
|
header()=next;
|
|
px=nullptr;
|
|
}
|
|
}
|
|
|
|
private:
|
|
static entry_trace*& header()
|
|
{
|
|
thread_local entry_trace *pe=nullptr;
|
|
return pe;
|
|
}
|
|
|
|
static bool find(const void* px)
|
|
{
|
|
for(auto pe=header();pe;pe=pe->next){
|
|
if(pe->px==px)return true;
|
|
}
|
|
return false;
|
|
}
|
|
|
|
const void *px;
|
|
entry_trace *next=header();
|
|
};
|
|
|
|
template<typename LockGuard>
|
|
struct reentrancy_checked
|
|
{
|
|
template<typename... Args>
|
|
reentrancy_checked(const void* px,Args&&... args):
|
|
tr{px},lck{std::forward<Args>(args)...}{}
|
|
|
|
void unlock()
|
|
{
|
|
lck.unlock();
|
|
tr.clear();
|
|
}
|
|
|
|
entry_trace tr;
|
|
LockGuard lck;
|
|
};
|
|
|
|
template<typename LockGuard>
|
|
struct reentrancy_bichecked
|
|
{
|
|
template<typename... Args>
|
|
reentrancy_bichecked(const void* px,const void* py,Args&&... args):
|
|
tr1{px},tr2{py!=px?py:nullptr},lck{std::forward<Args>(args)...}{}
|
|
|
|
void unlock()
|
|
{
|
|
lck.unlock();
|
|
tr2.clear();
|
|
tr1.clear();
|
|
}
|
|
|
|
entry_trace tr1,tr2;
|
|
LockGuard lck;
|
|
};
|
|
|
|
#else
|
|
|
|
template<typename LockGuard>
|
|
struct reentrancy_checked
|
|
{
|
|
template<typename... Args>
|
|
reentrancy_checked(const void*,Args&&... args):
|
|
lck{std::forward<Args>(args)...}{}
|
|
|
|
void unlock(){lck.unlock();}
|
|
|
|
LockGuard lck;
|
|
};
|
|
|
|
template<typename LockGuard>
|
|
struct reentrancy_bichecked
|
|
{
|
|
template<typename... Args>
|
|
reentrancy_bichecked(const void*,const void*,Args&&... args):
|
|
lck{std::forward<Args>(args)...}{}
|
|
|
|
void unlock(){lck.unlock();}
|
|
|
|
LockGuard lck;
|
|
};
|
|
|
|
#endif
|
|
|
|
} /* namespace foa */
|
|
} /* namespace detail */
|
|
} /* namespace unordered */
|
|
} /* namespace boost */
|
|
|
|
#endif
|