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
|
//===----------------------------------------------------------------------===//
//
// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
// See https://llvm.org/LICENSE.txt for license information.
// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
//
//===----------------------------------------------------------------------===//
// UNSUPPORTED: no-exceptions
// PR41395 isn't fixed until the dylib shipped with macOS 10.15
// XFAIL: stdlib=apple-libc++ && target={{.+}}-apple-macosx10.{{9|10|11|12|13|14}}
#include "cxxabi.h"
#include <new>
#include <cassert>
void dummy_ctor(void*) { assert(false && "should not be called"); }
void dummy_dtor(void*) { assert(false && "should not be called"); }
void *dummy_alloc(size_t) { assert(false && "should not be called"); return nullptr; }
void dummy_dealloc(void*) { assert(false && "should not be called"); }
void dummy_dealloc_sized(void*, size_t) { assert(false && "should not be called"); }
bool check_mul_overflows(size_t x, size_t y) {
size_t tmp = x * y;
if (tmp / x != y)
return true;
return false;
}
bool check_add_overflows(size_t x, size_t y) {
size_t tmp = x + y;
if (tmp < x)
return true;
return false;
}
void test_overflow_in_multiplication() {
const size_t elem_count = std::size_t(1) << (sizeof(std::size_t) * 8 - 2);
const size_t elem_size = 8;
const size_t padding = 0;
assert(check_mul_overflows(elem_count, elem_size));
try {
__cxxabiv1::__cxa_vec_new(elem_count, elem_size, padding, dummy_ctor,
dummy_dtor);
assert(false && "allocation should fail");
} catch (std::bad_array_new_length const&) {
// OK
} catch (...) {
assert(false && "unexpected exception");
}
try {
__cxxabiv1::__cxa_vec_new2(elem_count, elem_size, padding, dummy_ctor,
dummy_dtor, &dummy_alloc, &dummy_dealloc);
assert(false && "allocation should fail");
} catch (std::bad_array_new_length const&) {
// OK
} catch (...) {
assert(false && "unexpected exception");
}
try {
__cxxabiv1::__cxa_vec_new3(elem_count, elem_size, padding, dummy_ctor,
dummy_dtor, &dummy_alloc, &dummy_dealloc_sized);
assert(false && "allocation should fail");
} catch (std::bad_array_new_length const&) {
// OK
} catch (...) {
assert(false && "unexpected exception");
}
}
void test_overflow_in_addition() {
const size_t elem_size = 4;
const size_t elem_count = static_cast<size_t>(-1) / 4u;
#if defined(_LIBCXXABI_ARM_EHABI)
const size_t padding = 8;
#else
const size_t padding = sizeof(std::size_t);
#endif
assert(!check_mul_overflows(elem_count, elem_size));
assert(check_add_overflows(elem_count * elem_size, padding));
try {
__cxxabiv1::__cxa_vec_new(elem_count, elem_size, padding, dummy_ctor,
dummy_dtor);
assert(false && "allocation should fail");
} catch (std::bad_array_new_length const&) {
// OK
} catch (...) {
assert(false && "unexpected exception");
}
try {
__cxxabiv1::__cxa_vec_new2(elem_count, elem_size, padding, dummy_ctor,
dummy_dtor, &dummy_alloc, &dummy_dealloc);
assert(false && "allocation should fail");
} catch (std::bad_array_new_length const&) {
// OK
} catch (...) {
assert(false && "unexpected exception");
}
try {
__cxxabiv1::__cxa_vec_new3(elem_count, elem_size, padding, dummy_ctor,
dummy_dtor, &dummy_alloc, &dummy_dealloc_sized);
assert(false && "allocation should fail");
} catch (std::bad_array_new_length const&) {
// OK
} catch (...) {
assert(false && "unexpected exception");
}
}
int main(int, char**) {
test_overflow_in_multiplication();
test_overflow_in_addition();
return 0;
}
|
