Austin Schuh | 0cbef62 | 2015-09-06 17:34:52 -0700 | [diff] [blame] | 1 | // Copyright 2003, Google Inc. |
| 2 | // All rights reserved. |
| 3 | // |
| 4 | // Redistribution and use in source and binary forms, with or without |
| 5 | // modification, are permitted provided that the following conditions are |
| 6 | // met: |
| 7 | // |
| 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 |
| 11 | // copyright notice, this list of conditions and the following disclaimer |
| 12 | // in the documentation and/or other materials provided with the |
| 13 | // distribution. |
| 14 | // * Neither the name of Google Inc. nor the names of its |
| 15 | // contributors may be used to endorse or promote products derived from |
| 16 | // this software without specific prior written permission. |
| 17 | // |
| 18 | // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS |
| 19 | // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT |
| 20 | // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR |
| 21 | // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT |
| 22 | // OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, |
| 23 | // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT |
| 24 | // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |
| 25 | // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
| 26 | // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
| 27 | // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE |
| 28 | // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
Austin Schuh | 0cbef62 | 2015-09-06 17:34:52 -0700 | [diff] [blame] | 29 | |
| 30 | #include <stdlib.h> |
Austin Schuh | 889ac43 | 2018-10-29 22:57:02 -0700 | [diff] [blame^] | 31 | |
| 32 | #include "gtest/internal/gtest-linked_ptr.h" |
Austin Schuh | 0cbef62 | 2015-09-06 17:34:52 -0700 | [diff] [blame] | 33 | #include "gtest/gtest.h" |
| 34 | |
| 35 | namespace { |
| 36 | |
| 37 | using testing::Message; |
| 38 | using testing::internal::linked_ptr; |
| 39 | |
| 40 | int num; |
| 41 | Message* history = NULL; |
| 42 | |
| 43 | // Class which tracks allocation/deallocation |
| 44 | class A { |
| 45 | public: |
| 46 | A(): mynum(num++) { *history << "A" << mynum << " ctor\n"; } |
| 47 | virtual ~A() { *history << "A" << mynum << " dtor\n"; } |
| 48 | virtual void Use() { *history << "A" << mynum << " use\n"; } |
| 49 | protected: |
| 50 | int mynum; |
| 51 | }; |
| 52 | |
| 53 | // Subclass |
| 54 | class B : public A { |
| 55 | public: |
| 56 | B() { *history << "B" << mynum << " ctor\n"; } |
| 57 | ~B() { *history << "B" << mynum << " dtor\n"; } |
| 58 | virtual void Use() { *history << "B" << mynum << " use\n"; } |
| 59 | }; |
| 60 | |
| 61 | class LinkedPtrTest : public testing::Test { |
| 62 | public: |
| 63 | LinkedPtrTest() { |
| 64 | num = 0; |
| 65 | history = new Message; |
| 66 | } |
| 67 | |
| 68 | virtual ~LinkedPtrTest() { |
| 69 | delete history; |
| 70 | history = NULL; |
| 71 | } |
| 72 | }; |
| 73 | |
| 74 | TEST_F(LinkedPtrTest, GeneralTest) { |
| 75 | { |
| 76 | linked_ptr<A> a0, a1, a2; |
| 77 | // Use explicit function call notation here to suppress self-assign warning. |
| 78 | a0.operator=(a0); |
| 79 | a1 = a2; |
| 80 | ASSERT_EQ(a0.get(), static_cast<A*>(NULL)); |
| 81 | ASSERT_EQ(a1.get(), static_cast<A*>(NULL)); |
| 82 | ASSERT_EQ(a2.get(), static_cast<A*>(NULL)); |
| 83 | ASSERT_TRUE(a0 == NULL); |
| 84 | ASSERT_TRUE(a1 == NULL); |
| 85 | ASSERT_TRUE(a2 == NULL); |
| 86 | |
| 87 | { |
| 88 | linked_ptr<A> a3(new A); |
| 89 | a0 = a3; |
| 90 | ASSERT_TRUE(a0 == a3); |
| 91 | ASSERT_TRUE(a0 != NULL); |
| 92 | ASSERT_TRUE(a0.get() == a3); |
| 93 | ASSERT_TRUE(a0 == a3.get()); |
| 94 | linked_ptr<A> a4(a0); |
| 95 | a1 = a4; |
| 96 | linked_ptr<A> a5(new A); |
| 97 | ASSERT_TRUE(a5.get() != a3); |
| 98 | ASSERT_TRUE(a5 != a3.get()); |
| 99 | a2 = a5; |
| 100 | linked_ptr<B> b0(new B); |
| 101 | linked_ptr<A> a6(b0); |
| 102 | ASSERT_TRUE(b0 == a6); |
| 103 | ASSERT_TRUE(a6 == b0); |
| 104 | ASSERT_TRUE(b0 != NULL); |
| 105 | a5 = b0; |
| 106 | a5 = b0; |
| 107 | a3->Use(); |
| 108 | a4->Use(); |
| 109 | a5->Use(); |
| 110 | a6->Use(); |
| 111 | b0->Use(); |
| 112 | (*b0).Use(); |
| 113 | b0.get()->Use(); |
| 114 | } |
| 115 | |
| 116 | a0->Use(); |
| 117 | a1->Use(); |
| 118 | a2->Use(); |
| 119 | |
| 120 | a1 = a2; |
| 121 | a2.reset(new A); |
| 122 | a0.reset(); |
| 123 | |
| 124 | linked_ptr<A> a7; |
| 125 | } |
| 126 | |
| 127 | ASSERT_STREQ( |
| 128 | "A0 ctor\n" |
| 129 | "A1 ctor\n" |
| 130 | "A2 ctor\n" |
| 131 | "B2 ctor\n" |
| 132 | "A0 use\n" |
| 133 | "A0 use\n" |
| 134 | "B2 use\n" |
| 135 | "B2 use\n" |
| 136 | "B2 use\n" |
| 137 | "B2 use\n" |
| 138 | "B2 use\n" |
| 139 | "B2 dtor\n" |
| 140 | "A2 dtor\n" |
| 141 | "A0 use\n" |
| 142 | "A0 use\n" |
| 143 | "A1 use\n" |
| 144 | "A3 ctor\n" |
| 145 | "A0 dtor\n" |
| 146 | "A3 dtor\n" |
| 147 | "A1 dtor\n", |
| 148 | history->GetString().c_str()); |
| 149 | } |
| 150 | |
| 151 | } // Unnamed namespace |