mirror of
https://github.com/capstone-engine/llvm-capstone.git
synced 2024-12-28 02:37:37 +00:00
57b08b0944
to reflect the new license. These used slightly different spellings that defeated my regular expressions. We understand that people may be surprised that we're moving the header entirely to discuss the new license. We checked this carefully with the Foundation's lawyer and we believe this is the correct approach. Essentially, all code in the project is now made available by the LLVM project under our new license, so you will see that the license headers include that license only. Some of our contributors have contributed code under our old license, and accordingly, we have retained a copy of our old license notice in the top-level files in each project and repository. llvm-svn: 351648
281 lines
11 KiB
C++
281 lines
11 KiB
C++
//===---------------------------- test_vector.cpp -------------------------===//
|
|
//
|
|
// 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
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
#include "cxxabi.h"
|
|
|
|
#include <iostream>
|
|
#include <cstdlib>
|
|
#include <cassert>
|
|
|
|
// Wrapper routines
|
|
void *my_alloc2 ( size_t sz ) {
|
|
void *p = std::malloc ( sz );
|
|
// std::printf ( "Allocated %ld bytes at %lx\n", sz, (unsigned long) p );
|
|
return p;
|
|
}
|
|
|
|
void my_dealloc2 ( void *p ) {
|
|
// std::printf ( "Freeing %lx\n", (unsigned long) p );
|
|
std::free ( p );
|
|
}
|
|
|
|
void my_dealloc3 ( void *p, size_t ) {
|
|
// std::printf ( "Freeing %lx (size %ld)\n", (unsigned long) p, sz );
|
|
std::free ( p );
|
|
}
|
|
|
|
void my_construct ( void * ) {
|
|
// std::printf ( "Constructing %lx\n", (unsigned long) p );
|
|
}
|
|
|
|
void my_destruct ( void * ) {
|
|
// std::printf ( "Destructing %lx\n", (unsigned long) p );
|
|
}
|
|
|
|
int gCounter;
|
|
void count_construct ( void * ) { ++gCounter; }
|
|
void count_destruct ( void * ) { --gCounter; }
|
|
|
|
|
|
int gConstructorCounter;
|
|
int gConstructorThrowTarget;
|
|
int gDestructorCounter;
|
|
int gDestructorThrowTarget;
|
|
void throw_construct ( void * ) {
|
|
#ifndef LIBCXXABI_HAS_NO_EXCEPTIONS
|
|
if ( gConstructorCounter == gConstructorThrowTarget )
|
|
throw 1;
|
|
++gConstructorCounter;
|
|
#endif
|
|
}
|
|
void throw_destruct ( void * ) {
|
|
#ifndef LIBCXXABI_HAS_NO_EXCEPTIONS
|
|
if ( ++gDestructorCounter == gDestructorThrowTarget )
|
|
throw 2;
|
|
#endif
|
|
}
|
|
|
|
#if __cplusplus >= 201103L
|
|
# define CAN_THROW noexcept(false)
|
|
#else
|
|
# define CAN_THROW
|
|
#endif
|
|
|
|
struct vec_on_stack {
|
|
void *storage;
|
|
vec_on_stack () : storage ( __cxxabiv1::__cxa_vec_new ( 10, 40, 8, throw_construct, throw_destruct )) {}
|
|
~vec_on_stack () CAN_THROW {__cxxabiv1::__cxa_vec_delete ( storage, 40, 8, throw_destruct ); }
|
|
};
|
|
|
|
// Test calls with empty constructors and destructors
|
|
int test_empty ( ) {
|
|
void *one, *two, *three;
|
|
|
|
// Try with no padding and no con/destructors
|
|
one = __cxxabiv1::__cxa_vec_new ( 10, 40, 0, NULL, NULL );
|
|
two = __cxxabiv1::__cxa_vec_new2( 10, 40, 0, NULL, NULL, my_alloc2, my_dealloc2 );
|
|
three = __cxxabiv1::__cxa_vec_new3( 10, 40, 0, NULL, NULL, my_alloc2, my_dealloc3 );
|
|
|
|
__cxxabiv1::__cxa_vec_delete ( one, 40, 0, NULL );
|
|
__cxxabiv1::__cxa_vec_delete2( two, 40, 0, NULL, my_dealloc2 );
|
|
__cxxabiv1::__cxa_vec_delete3( three, 40, 0, NULL, my_dealloc3 );
|
|
|
|
// Try with no padding
|
|
one = __cxxabiv1::__cxa_vec_new ( 10, 40, 0, my_construct, my_destruct );
|
|
two = __cxxabiv1::__cxa_vec_new2( 10, 40, 0, my_construct, my_destruct, my_alloc2, my_dealloc2 );
|
|
three = __cxxabiv1::__cxa_vec_new3( 10, 40, 0, my_construct, my_destruct, my_alloc2, my_dealloc3 );
|
|
|
|
__cxxabiv1::__cxa_vec_delete ( one, 40, 0, my_destruct );
|
|
__cxxabiv1::__cxa_vec_delete2( two, 40, 0, my_destruct, my_dealloc2 );
|
|
__cxxabiv1::__cxa_vec_delete3( three, 40, 0, my_destruct, my_dealloc3 );
|
|
|
|
// Padding and no con/destructors
|
|
one = __cxxabiv1::__cxa_vec_new ( 10, 40, 8, NULL, NULL );
|
|
two = __cxxabiv1::__cxa_vec_new2( 10, 40, 8, NULL, NULL, my_alloc2, my_dealloc2 );
|
|
three = __cxxabiv1::__cxa_vec_new3( 10, 40, 8, NULL, NULL, my_alloc2, my_dealloc3 );
|
|
|
|
__cxxabiv1::__cxa_vec_delete ( one, 40, 8, NULL );
|
|
__cxxabiv1::__cxa_vec_delete2( two, 40, 8, NULL, my_dealloc2 );
|
|
__cxxabiv1::__cxa_vec_delete3( three, 40, 8, NULL, my_dealloc3 );
|
|
|
|
// Padding with con/destructors
|
|
one = __cxxabiv1::__cxa_vec_new ( 10, 40, 8, my_construct, my_destruct );
|
|
two = __cxxabiv1::__cxa_vec_new2( 10, 40, 8, my_construct, my_destruct, my_alloc2, my_dealloc2 );
|
|
three = __cxxabiv1::__cxa_vec_new3( 10, 40, 8, my_construct, my_destruct, my_alloc2, my_dealloc3 );
|
|
|
|
__cxxabiv1::__cxa_vec_delete ( one, 40, 8, my_destruct );
|
|
__cxxabiv1::__cxa_vec_delete2( two, 40, 8, my_destruct, my_dealloc2 );
|
|
__cxxabiv1::__cxa_vec_delete3( three, 40, 8, my_destruct, my_dealloc3 );
|
|
|
|
return 0;
|
|
}
|
|
|
|
// Make sure the constructors and destructors are matched
|
|
int test_counted ( ) {
|
|
int retVal = 0;
|
|
void *one, *two, *three;
|
|
|
|
// Try with no padding
|
|
gCounter = 0;
|
|
one = __cxxabiv1::__cxa_vec_new ( 10, 40, 0, count_construct, count_destruct );
|
|
two = __cxxabiv1::__cxa_vec_new2( 10, 40, 0, count_construct, count_destruct, my_alloc2, my_dealloc2 );
|
|
three = __cxxabiv1::__cxa_vec_new3( 10, 40, 0, count_construct, count_destruct, my_alloc2, my_dealloc3 );
|
|
|
|
__cxxabiv1::__cxa_vec_delete ( one, 40, 0, count_destruct );
|
|
__cxxabiv1::__cxa_vec_delete2( two, 40, 0, count_destruct, my_dealloc2 );
|
|
__cxxabiv1::__cxa_vec_delete3( three, 40, 0, count_destruct, my_dealloc3 );
|
|
|
|
// Since there was no padding, the # of elements in the array are not stored
|
|
// and the destructors are not called.
|
|
if ( gCounter != 30 ) {
|
|
std::cerr << "Mismatched Constructor/Destructor calls (1)" << std::endl;
|
|
std::cerr << " Expected 30, got " << gCounter << std::endl;
|
|
retVal = 1;
|
|
}
|
|
|
|
gCounter = 0;
|
|
one = __cxxabiv1::__cxa_vec_new ( 10, 40, 8, count_construct, count_destruct );
|
|
two = __cxxabiv1::__cxa_vec_new2( 10, 40, 8, count_construct, count_destruct, my_alloc2, my_dealloc2 );
|
|
three = __cxxabiv1::__cxa_vec_new3( 10, 40, 8, count_construct, count_destruct, my_alloc2, my_dealloc3 );
|
|
|
|
__cxxabiv1::__cxa_vec_delete ( one, 40, 8, count_destruct );
|
|
__cxxabiv1::__cxa_vec_delete2( two, 40, 8, count_destruct, my_dealloc2 );
|
|
__cxxabiv1::__cxa_vec_delete3( three, 40, 8, count_destruct, my_dealloc3 );
|
|
|
|
if ( gCounter != 0 ) {
|
|
std::cerr << "Mismatched Constructor/Destructor calls (2)" << std::endl;
|
|
std::cerr << " Expected 0, got " << gCounter << std::endl;
|
|
retVal = 1;
|
|
}
|
|
|
|
return retVal;
|
|
}
|
|
|
|
#ifndef LIBCXXABI_HAS_NO_EXCEPTIONS
|
|
// Make sure the constructors and destructors are matched
|
|
int test_exception_in_constructor ( ) {
|
|
int retVal = 0;
|
|
void *one, *two, *three;
|
|
|
|
// Try with no padding
|
|
gConstructorCounter = gDestructorCounter = 0;
|
|
gConstructorThrowTarget = 15;
|
|
gDestructorThrowTarget = -1;
|
|
try {
|
|
one = two = three = NULL;
|
|
one = __cxxabiv1::__cxa_vec_new ( 10, 40, 0, throw_construct, throw_destruct );
|
|
two = __cxxabiv1::__cxa_vec_new2( 10, 40, 0, throw_construct, throw_destruct, my_alloc2, my_dealloc2 );
|
|
three = __cxxabiv1::__cxa_vec_new3( 10, 40, 0, throw_construct, throw_destruct, my_alloc2, my_dealloc3 );
|
|
}
|
|
catch ( int i ) {}
|
|
|
|
__cxxabiv1::__cxa_vec_delete ( one, 40, 0, throw_destruct );
|
|
__cxxabiv1::__cxa_vec_delete2( two, 40, 0, throw_destruct, my_dealloc2 );
|
|
__cxxabiv1::__cxa_vec_delete3( three, 40, 0, throw_destruct, my_dealloc3 );
|
|
|
|
// Since there was no padding, the # of elements in the array are not stored
|
|
// and the destructors are not called.
|
|
// Since we threw after 15 calls to the constructor, we should see 5 calls to
|
|
// the destructor from the partially constructed array.
|
|
if ( gConstructorCounter - gDestructorCounter != 10 ) {
|
|
std::cerr << "Mismatched Constructor/Destructor calls (1C)" << std::endl;
|
|
std::cerr << gConstructorCounter << " constructors, but " <<
|
|
gDestructorCounter << " destructors" << std::endl;
|
|
retVal = 1;
|
|
}
|
|
|
|
gConstructorCounter = gDestructorCounter = 0;
|
|
gConstructorThrowTarget = 15;
|
|
gDestructorThrowTarget = -1;
|
|
try {
|
|
one = two = three = NULL;
|
|
one = __cxxabiv1::__cxa_vec_new ( 10, 40, 8, throw_construct, throw_destruct );
|
|
two = __cxxabiv1::__cxa_vec_new2( 10, 40, 8, throw_construct, throw_destruct, my_alloc2, my_dealloc2 );
|
|
three = __cxxabiv1::__cxa_vec_new3( 10, 40, 8, throw_construct, throw_destruct, my_alloc2, my_dealloc3 );
|
|
}
|
|
catch ( int i ) {}
|
|
|
|
__cxxabiv1::__cxa_vec_delete ( one, 40, 8, throw_destruct );
|
|
__cxxabiv1::__cxa_vec_delete2( two, 40, 8, throw_destruct, my_dealloc2 );
|
|
__cxxabiv1::__cxa_vec_delete3( three, 40, 8, throw_destruct, my_dealloc3 );
|
|
|
|
if ( gConstructorCounter != gDestructorCounter ) {
|
|
std::cerr << "Mismatched Constructor/Destructor calls (2C)" << std::endl;
|
|
std::cerr << gConstructorCounter << " constructors, but " <<
|
|
gDestructorCounter << " destructors" << std::endl;
|
|
retVal = 1;
|
|
}
|
|
|
|
return retVal;
|
|
}
|
|
#endif
|
|
|
|
#ifndef LIBCXXABI_HAS_NO_EXCEPTIONS
|
|
// Make sure the constructors and destructors are matched
|
|
int test_exception_in_destructor ( ) {
|
|
int retVal = 0;
|
|
void *one, *two, *three;
|
|
one = two = three = NULL;
|
|
|
|
// Throw from within a destructor
|
|
gConstructorCounter = gDestructorCounter = 0;
|
|
gConstructorThrowTarget = -1;
|
|
gDestructorThrowTarget = 15;
|
|
try {
|
|
one = two = NULL;
|
|
one = __cxxabiv1::__cxa_vec_new ( 10, 40, 8, throw_construct, throw_destruct );
|
|
two = __cxxabiv1::__cxa_vec_new2( 10, 40, 8, throw_construct, throw_destruct, my_alloc2, my_dealloc2 );
|
|
}
|
|
catch ( int i ) {}
|
|
|
|
try {
|
|
__cxxabiv1::__cxa_vec_delete ( one, 40, 8, throw_destruct );
|
|
__cxxabiv1::__cxa_vec_delete2( two, 40, 8, throw_destruct, my_dealloc2 );
|
|
assert(false);
|
|
}
|
|
catch ( int i ) {}
|
|
|
|
// We should have thrown in the middle of cleaning up "two", which means that
|
|
// there should be 20 calls to the destructor and the try block should exit
|
|
// before the assertion.
|
|
if ( gConstructorCounter != 20 || gDestructorCounter != 20 ) {
|
|
std::cerr << "Unexpected Constructor/Destructor calls (1D)" << std::endl;
|
|
std::cerr << "Expected (20, 20), but got (" << gConstructorCounter << ", " <<
|
|
gDestructorCounter << ")" << std::endl;
|
|
retVal = 1;
|
|
}
|
|
|
|
// Try throwing from a destructor - should be fine.
|
|
gConstructorCounter = gDestructorCounter = 0;
|
|
gConstructorThrowTarget = -1;
|
|
gDestructorThrowTarget = 5;
|
|
try { vec_on_stack v; }
|
|
catch ( int i ) {}
|
|
|
|
if ( gConstructorCounter != gDestructorCounter ) {
|
|
std::cerr << "Mismatched Constructor/Destructor calls (2D)" << std::endl;
|
|
std::cerr << gConstructorCounter << " constructors, but " <<
|
|
gDestructorCounter << " destructors" << std::endl;
|
|
retVal = 1;
|
|
}
|
|
|
|
return retVal;
|
|
}
|
|
#endif
|
|
|
|
int main () {
|
|
int retVal = 0;
|
|
retVal += test_empty ();
|
|
retVal += test_counted ();
|
|
#ifndef LIBCXXABI_HAS_NO_EXCEPTIONS
|
|
retVal += test_exception_in_constructor ();
|
|
retVal += test_exception_in_destructor ();
|
|
#endif
|
|
return retVal;
|
|
}
|