7
7
// ===----------------------------------------------------------------------===//
8
8
9
9
#include " fallback_malloc.h"
10
+ #include " abort_message.h"
10
11
11
12
#include < __threading_support>
12
13
#ifndef _LIBCXXABI_HAS_NO_THREADS
@@ -142,7 +143,7 @@ void* fallback_malloc(size_t len) {
142
143
143
144
// Check the invariant that all heap_nodes pointers 'p' are aligned
144
145
// so that 'p + 1' has an alignment of at least RequiredAlignment
145
- _LIBCPP_ASSERT_UNCATEGORIZED (reinterpret_cast <size_t >(p + 1 ) % RequiredAlignment == 0 , " " );
146
+ _LIBCXXABI_ASSERT (reinterpret_cast <size_t >(p + 1 ) % RequiredAlignment == 0 , " " );
146
147
147
148
// Calculate the number of extra padding elements needed in order
148
149
// to split 'p' and create a properly aligned heap_node from the tail
@@ -163,7 +164,7 @@ void* fallback_malloc(size_t len) {
163
164
q->next_node = 0 ;
164
165
q->len = static_cast <heap_size>(aligned_nelems);
165
166
void * ptr = q + 1 ;
166
- _LIBCPP_ASSERT_UNCATEGORIZED (reinterpret_cast <size_t >(ptr) % RequiredAlignment == 0 , " " );
167
+ _LIBCXXABI_ASSERT (reinterpret_cast <size_t >(ptr) % RequiredAlignment == 0 , " " );
167
168
return ptr;
168
169
}
169
170
@@ -176,7 +177,7 @@ void* fallback_malloc(size_t len) {
176
177
prev->next_node = p->next_node ;
177
178
p->next_node = 0 ;
178
179
void * ptr = p + 1 ;
179
- _LIBCPP_ASSERT_UNCATEGORIZED (reinterpret_cast <size_t >(ptr) % RequiredAlignment == 0 , " " );
180
+ _LIBCXXABI_ASSERT (reinterpret_cast <size_t >(ptr) % RequiredAlignment == 0 , " " );
180
181
return ptr;
181
182
}
182
183
}
0 commit comments