blob: 2869c1a9cc80ae3a0ff2f92713d0a0893ab68ed0 (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
|
// file : cutl/shared-ptr/base.cxx
// copyright : Copyright (c) 2009-2019 Code Synthesis Tools CC
// license : MIT; see accompanying LICENSE file
#include <cutl/shared-ptr/base.hxx>
using std::size_t;
//
//
cutl::share shared = cutl::share (1);
cutl::share exclusive = cutl::share (2);
//
//
namespace cutl
{
char const* not_shared::
what () const LIBCUTL_NOTHROW_NOEXCEPT
{
return "object is not shared";
}
}
//
//
void*
operator new (size_t n, cutl::share s)
#ifndef LIBCUTL_CXX11
throw (std::bad_alloc)
#endif
{
if (s == shared)
{
// Here we need to make sure we don't break the alignment of the
// returned block. For that we need to know the maximum alignment
// of this platform. Twice the pointer size is a good guess for
// most platforms.
//
size_t* p = static_cast<size_t*> (operator new (n + 2 * sizeof (size_t)));
*p++ = 1; // Initial count.
*p++ = 0xDEADBEEF; // Signature.
return p;
}
else
return operator new (n);
}
void
operator delete (void* p, cutl::share s) LIBCUTL_NOTHROW_NOEXCEPT
{
// This version of operator delete is only called when the c-tor
// fails. In this case there is no object and we can just free the
// memory.
//
if (s == shared)
{
size_t* sp = static_cast<size_t*> (p);
sp -= 2;
operator delete (sp);
}
else
operator delete (p);
}
|