| Ryan Prichard | afa983c | 2020-02-04 15:46:15 -0800 | [diff] [blame] | 1 | /* | 
|  | 2 | * Copyright (C) 2020 The Android Open Source Project | 
|  | 3 | * All rights reserved. | 
|  | 4 | * | 
|  | 5 | * Redistribution and use in source and binary forms, with or without | 
|  | 6 | * modification, are permitted provided that the following conditions | 
|  | 7 | * are met: | 
|  | 8 | *  * Redistributions of source code must retain the above copyright | 
|  | 9 | *    notice, this list of conditions and the following disclaimer. | 
|  | 10 | *  * Redistributions in binary form must reproduce the above copyright | 
|  | 11 | *    notice, this list of conditions and the following disclaimer in | 
|  | 12 | *    the documentation and/or other materials provided with the | 
|  | 13 | *    distribution. | 
|  | 14 | * | 
|  | 15 | * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS | 
|  | 16 | * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT | 
|  | 17 | * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS | 
|  | 18 | * FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE | 
|  | 19 | * COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, | 
|  | 20 | * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, | 
|  | 21 | * BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS | 
|  | 22 | * OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED | 
|  | 23 | * AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, | 
|  | 24 | * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT | 
|  | 25 | * OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF | 
|  | 26 | * SUCH DAMAGE. | 
|  | 27 | */ | 
|  | 28 |  | 
|  | 29 | #include <cxxabi.h> | 
|  | 30 | #include <gtest/gtest.h> | 
|  | 31 |  | 
|  | 32 | TEST(__cxa_atexit, simple) { | 
|  | 33 | int counter = 0; | 
|  | 34 |  | 
|  | 35 | __cxxabiv1::__cxa_atexit([](void* arg) { ++*static_cast<int*>(arg); }, &counter, &counter); | 
|  | 36 |  | 
|  | 37 | __cxxabiv1::__cxa_finalize(&counter); | 
|  | 38 | ASSERT_EQ(counter, 1); | 
|  | 39 |  | 
|  | 40 | // The handler won't be called twice. | 
|  | 41 | __cxxabiv1::__cxa_finalize(&counter); | 
|  | 42 | ASSERT_EQ(counter, 1); | 
|  | 43 | } | 
|  | 44 |  | 
|  | 45 | TEST(__cxa_atexit, order) { | 
|  | 46 | static std::vector<int> actual; | 
|  | 47 |  | 
|  | 48 | char handles[2]; | 
|  | 49 |  | 
|  | 50 | auto append_to_actual = [](void* arg) { | 
|  | 51 | int* idx = static_cast<int*>(arg); | 
|  | 52 | actual.push_back(*idx); | 
|  | 53 | delete idx; | 
|  | 54 | }; | 
|  | 55 |  | 
|  | 56 | for (int i = 0; i < 500; ++i) { | 
|  | 57 | __cxxabiv1::__cxa_atexit(append_to_actual, new int{i}, &handles[i % 2]); | 
|  | 58 | } | 
|  | 59 |  | 
|  | 60 | __cxxabiv1::__cxa_finalize(&handles[0]); | 
|  | 61 |  | 
|  | 62 | for (int i = 500; i < 750; ++i) { | 
|  | 63 | __cxxabiv1::__cxa_atexit(append_to_actual, new int{i}, &handles[1]); | 
|  | 64 | } | 
|  | 65 |  | 
|  | 66 | __cxxabiv1::__cxa_finalize(&handles[1]); | 
|  | 67 |  | 
|  | 68 | std::vector<int> expected; | 
|  | 69 | for (int i = 498; i >= 0; i -= 2) expected.push_back(i); | 
|  | 70 | for (int i = 749; i >= 500; --i) expected.push_back(i); | 
|  | 71 | for (int i = 499; i >= 1; i -= 2) expected.push_back(i); | 
|  | 72 |  | 
|  | 73 | ASSERT_EQ(expected.size(), actual.size()); | 
|  | 74 | for (size_t i = 0; i < expected.size(); ++i) { | 
|  | 75 | ASSERT_EQ(expected[i], actual[i]) << "index=" << i; | 
|  | 76 | } | 
|  | 77 | } |