//===---------------------------- test_vector.cpp -------------------------===// // // The LLVM Compiler Infrastructure // // This file is dual licensed under the MIT and the University of Illinois Open // Source Licenses. See LICENSE.TXT for details. // //===----------------------------------------------------------------------===// #include "cxxabi.h" #include <stdio.h> #include <cstdlib> // Wrapper routines void *my_alloc2 ( size_t sz ) { void *p = std::malloc ( sz ); // printf ( "Allocated %u bytes at %p\n", sz, p ); return p; } void my_dealloc2 ( void *p ) { // printf ( "Freeing %p\n", p ); std::free ( p ); } void my_dealloc3 ( void *p, size_t sz ) { // printf ( "Freeing %p (size %u)\n", p, sz ); std::free ( p ); } #ifdef __arm__ #define CTOR_RETURN_TYPE void* #define CTOR_RETURN(x) return x #else #define CTOR_RETURN_TYPE void #define CTOR_RETURN(x) return #endif CTOR_RETURN_TYPE my_construct ( void *p ) { // printf ( "Constructing %p\n", p ); CTOR_RETURN(p); } CTOR_RETURN_TYPE my_destruct ( void *p ) { // printf ( "Destructing %p\n", p ); CTOR_RETURN(p); } int gCounter; CTOR_RETURN_TYPE count_construct ( void *p ) { ++gCounter; CTOR_RETURN(p); } CTOR_RETURN_TYPE count_destruct ( void *p ) { --gCounter; CTOR_RETURN(p); } int gConstructorCounter; int gConstructorThrowTarget; int gDestructorCounter; int gDestructorThrowTarget; CTOR_RETURN_TYPE throw_construct ( void *p ) { if ( gConstructorCounter == gConstructorThrowTarget ) throw 1; ++gConstructorCounter; CTOR_RETURN(p); } CTOR_RETURN_TYPE throw_destruct ( void *p ) { if ( ++gDestructorCounter == gDestructorThrowTarget ) throw 2; CTOR_RETURN(p); } #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 ) { fprintf(stderr, "Mismatched Constructor/Destructor calls (1)\n"); fprintf(stderr, " Expected 30, got %d\n", gCounter); 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 ) { fprintf(stderr, "Mismatched Constructor/Destructor calls (2)\n"); fprintf(stderr, " Expected 0, got %d\n", gCounter); retVal = 1; } return retVal; } // 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 ) { fprintf(stderr, "Mismatched Constructor/Destructor calls (1C)\n"); fprintf(stderr, "%d constructors, but %d destructors\n", gConstructorCounter, gDestructorCounter); 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 ) { fprintf(stderr, "Mismatched Constructor/Destructor calls (2C)\n"); fprintf(stderr, "%d constructors, but %d destructors\n", gConstructorCounter, gDestructorCounter); retVal = 1; } return retVal; } // Make sure the constructors and destructors are matched int test_exception_in_destructor ( ) { int retVal = 0; void *one, *two, *three; // Throw from within a destructor gConstructorCounter = gDestructorCounter = 0; gConstructorThrowTarget = -1; gDestructorThrowTarget = 15; 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 ) {} try { __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 ); } 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 "three" was not cleaned up. if ( gConstructorCounter != 30 || gDestructorCounter != 20 ) { fprintf(stderr, "Unexpected Constructor/Destructor calls (1D)\n"); fprintf(stderr, "Expected (30, 20), but got (%d, %d)\n", gConstructorCounter, gDestructorCounter); 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 ) { fprintf(stderr, "Mismatched Constructor/Destructor calls (2D)\n"); fprintf(stderr, "%d constructors, but %d destructors\n", gConstructorCounter, gDestructorCounter); retVal = 1; } return retVal; } int main ( int argc, char *argv [] ) { int retVal = 0; retVal += test_empty (); retVal += test_counted (); retVal += test_exception_in_constructor (); retVal += test_exception_in_destructor (); return retVal; }