You can not select more than 25 topics
			Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
		
		
		
		
		
			
		
			
				
					
					
						
							154 lines
						
					
					
						
							4.0 KiB
						
					
					
				
			
		
		
		
			
			
			
				
					
				
				
					
				
			
		
		
	
	
							154 lines
						
					
					
						
							4.0 KiB
						
					
					
				| // Copyright 2003, Google Inc. | |
| // All rights reserved. | |
| // | |
| // Redistribution and use in source and binary forms, with or without | |
| // modification, are permitted provided that the following conditions are | |
| // met: | |
| // | |
| //     * Redistributions of source code must retain the above copyright | |
| // notice, this list of conditions and the following disclaimer. | |
| //     * Redistributions in binary form must reproduce the above | |
| // copyright notice, this list of conditions and the following disclaimer | |
| // in the documentation and/or other materials provided with the | |
| // distribution. | |
| //     * Neither the name of Google Inc. nor the names of its | |
| // contributors may be used to endorse or promote products derived from | |
| // this software without specific prior written permission. | |
| // | |
| // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS | |
| // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT | |
| // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR | |
| // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT | |
| // OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, | |
| // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT | |
| // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, | |
| // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY | |
| // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT | |
| // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE | |
| // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. | |
| // | |
| // Authors: Dan Egnor (egnor@google.com) | |
| // Ported to Windows: Vadim Berman (vadimb@google.com) | |
|  | |
| #include "gtest/internal/gtest-linked_ptr.h" | |
|  | |
| #include <stdlib.h> | |
| #include "gtest/gtest.h" | |
|  | |
| namespace { | |
| 
 | |
| using testing::Message; | |
| using testing::internal::linked_ptr; | |
| 
 | |
| int num; | |
| Message* history = NULL; | |
| 
 | |
| // Class which tracks allocation/deallocation | |
| class A { | |
|  public: | |
|   A(): mynum(num++) { *history << "A" << mynum << " ctor\n"; } | |
|   virtual ~A() { *history << "A" << mynum << " dtor\n"; } | |
|   virtual void Use() { *history << "A" << mynum << " use\n"; } | |
|  protected: | |
|   int mynum; | |
| }; | |
| 
 | |
| // Subclass | |
| class B : public A { | |
|  public: | |
|   B() { *history << "B" << mynum << " ctor\n"; } | |
|   ~B() { *history << "B" << mynum << " dtor\n"; } | |
|   virtual void Use() { *history << "B" << mynum << " use\n"; } | |
| }; | |
| 
 | |
| class LinkedPtrTest : public testing::Test { | |
|  public: | |
|   LinkedPtrTest() { | |
|     num = 0; | |
|     history = new Message; | |
|   } | |
| 
 | |
|   virtual ~LinkedPtrTest() { | |
|     delete history; | |
|     history = NULL; | |
|   } | |
| }; | |
| 
 | |
| TEST_F(LinkedPtrTest, GeneralTest) { | |
|   { | |
|     linked_ptr<A> a0, a1, a2; | |
|     // Use explicit function call notation here to suppress self-assign warning. | |
|     a0.operator=(a0); | |
|     a1 = a2; | |
|     ASSERT_EQ(a0.get(), static_cast<A*>(NULL)); | |
|     ASSERT_EQ(a1.get(), static_cast<A*>(NULL)); | |
|     ASSERT_EQ(a2.get(), static_cast<A*>(NULL)); | |
|     ASSERT_TRUE(a0 == NULL); | |
|     ASSERT_TRUE(a1 == NULL); | |
|     ASSERT_TRUE(a2 == NULL); | |
| 
 | |
|     { | |
|       linked_ptr<A> a3(new A); | |
|       a0 = a3; | |
|       ASSERT_TRUE(a0 == a3); | |
|       ASSERT_TRUE(a0 != NULL); | |
|       ASSERT_TRUE(a0.get() == a3); | |
|       ASSERT_TRUE(a0 == a3.get()); | |
|       linked_ptr<A> a4(a0); | |
|       a1 = a4; | |
|       linked_ptr<A> a5(new A); | |
|       ASSERT_TRUE(a5.get() != a3); | |
|       ASSERT_TRUE(a5 != a3.get()); | |
|       a2 = a5; | |
|       linked_ptr<B> b0(new B); | |
|       linked_ptr<A> a6(b0); | |
|       ASSERT_TRUE(b0 == a6); | |
|       ASSERT_TRUE(a6 == b0); | |
|       ASSERT_TRUE(b0 != NULL); | |
|       a5 = b0; | |
|       a5 = b0; | |
|       a3->Use(); | |
|       a4->Use(); | |
|       a5->Use(); | |
|       a6->Use(); | |
|       b0->Use(); | |
|       (*b0).Use(); | |
|       b0.get()->Use(); | |
|     } | |
| 
 | |
|     a0->Use(); | |
|     a1->Use(); | |
|     a2->Use(); | |
| 
 | |
|     a1 = a2; | |
|     a2.reset(new A); | |
|     a0.reset(); | |
| 
 | |
|     linked_ptr<A> a7; | |
|   } | |
| 
 | |
|   ASSERT_STREQ( | |
|     "A0 ctor\n" | |
|     "A1 ctor\n" | |
|     "A2 ctor\n" | |
|     "B2 ctor\n" | |
|     "A0 use\n" | |
|     "A0 use\n" | |
|     "B2 use\n" | |
|     "B2 use\n" | |
|     "B2 use\n" | |
|     "B2 use\n" | |
|     "B2 use\n" | |
|     "B2 dtor\n" | |
|     "A2 dtor\n" | |
|     "A0 use\n" | |
|     "A0 use\n" | |
|     "A1 use\n" | |
|     "A3 ctor\n" | |
|     "A0 dtor\n" | |
|     "A3 dtor\n" | |
|     "A1 dtor\n", | |
|     history->GetString().c_str()); | |
| } | |
| 
 | |
| }  // Unnamed namespace
 |