blob: 22dbb09e7cef8391c29e91b2bbe9fa916ed51ffa (
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
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
|
// Copyright (C) 2020 Klarälvdalens Datakonsult AB, a KDAB Group company, info@kdab.com, author Marc Mutz <marc.mutz@kdab.com>
// Copyright (C) 2022 The Qt Company Ltd.
// SPDX-License-Identifier: LicenseRef-Qt-Commercial OR GPL-3.0-only
#include <q20memory.h>
#include <QtCore/q20memory.h>
#include <QTest>
#include <QObject>
#include <QExplicitlySharedDataPointer>
#include <QSharedDataPointer>
struct Private : QSharedData {};
class tst_q20_memory : public QObject
{
Q_OBJECT
private Q_SLOTS:
void raw();
void smart();
void recursion();
void usesPointerTraits();
void prefersPointerTraits();
private Q_SLOTS:
void to_address_broken_const_propagation_QExplicitlySharedDataPointer()
{ to_address_broken_const_propagation<QExplicitlySharedDataPointer<Private>>(); }
void to_address_broken_const_propagation_QSharedDataPointer()
{ to_address_broken_const_propagation<QSharedDataPointer<Private>>(); }
void to_address_broken_const_propagation_shared_ptr()
{ to_address_broken_const_propagation<std::shared_ptr<Private>>(); }
void to_address_broken_const_propagation_unique_ptr()
{ to_address_broken_const_propagation<std::unique_ptr<Private>>(); }
private:
template <typename Pointer>
void to_address_broken_const_propagation();
};
void tst_q20_memory::raw()
{
auto i = 0;
auto p = &i;
QVERIFY(q20::to_address(p) == &i);
}
template <typename T>
class MinimalPtr {
public:
using element_type = T;
explicit MinimalPtr(T *d) : d(d) {}
T *operator->() const noexcept { return d; }
private:
T *d;
};
void tst_q20_memory::smart()
{
int i;
MinimalPtr ptr(&i);
QCOMPARE_EQ(q20::to_address(ptr), &i);
}
template <typename T>
class RecursivePtr {
public:
using element_type = T;
explicit RecursivePtr(T *d) : d(d) {}
MinimalPtr<T> operator->() const noexcept { return d; }
private:
MinimalPtr<T> d;
};
void tst_q20_memory::recursion()
{
int i;
RecursivePtr ptr(&i);
QCOMPARE_EQ(q20::to_address(ptr), &i);
}
template <typename T>
class NoDerefOperatorPtr {
public:
using element_type = T;
explicit NoDerefOperatorPtr(T *d) : d(d) {}
T *get() const noexcept { return d; }
private:
T *d;
};
namespace std {
template <typename T>
struct pointer_traits<NoDerefOperatorPtr<T>>
{
static T *to_address(const NoDerefOperatorPtr<T> &ptr) noexcept { return ptr.get(); }
};
} // namespace std
void tst_q20_memory::usesPointerTraits()
{
int i;
NoDerefOperatorPtr ptr(&i);
QCOMPARE_EQ(q20::to_address(ptr), &i);
}
template <typename T>
class PrefersPointerTraitsPtr
{
public:
using element_type = T;
explicit PrefersPointerTraitsPtr(T *d) : d(d) {}
T *operator->() const noexcept { return nullptr; }
T *get() const noexcept { return d; }
private:
T *d;
};
namespace std {
template <typename T>
struct pointer_traits<PrefersPointerTraitsPtr<T>>
{
static T *to_address(const PrefersPointerTraitsPtr<T> &p) noexcept { return p.get(); }
};
} // namespace std
void tst_q20_memory::prefersPointerTraits()
{
int i;
PrefersPointerTraitsPtr ptr(&i);
QCOMPARE_EQ(q20::to_address(ptr), &i);
}
template <typename Pointer>
void tst_q20_memory::to_address_broken_const_propagation()
{
Pointer p(nullptr);
QCOMPARE_EQ(q20::to_address(p), nullptr);
p = Pointer{new Private()};
QCOMPARE_EQ(q20::to_address(p), p.operator->());
static_assert(std::is_same_v<decltype(q20::to_address(p)),
decltype(std::as_const(p).operator->())>);
}
QTEST_GUILESS_MAIN(tst_q20_memory)
#include "tst_q20_memory.moc"
|
