| OLD | NEW |
| (Empty) |
| 1 // Copyright 2009, 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. | |
| 29 // | |
| 30 // Author: wan@google.com (Zhanyong Wan) | |
| 31 | |
| 32 // Google Mock - a framework for writing C++ mock classes. | |
| 33 // | |
| 34 // This program is for verifying that a leaked mock object can be | |
| 35 // caught by Google Mock's leak detector. | |
| 36 | |
| 37 #include <gmock/gmock.h> | |
| 38 | |
| 39 namespace { | |
| 40 | |
| 41 using ::testing::Return; | |
| 42 | |
| 43 class FooInterface { | |
| 44 public: | |
| 45 virtual ~FooInterface() {} | |
| 46 virtual void DoThis() = 0; | |
| 47 }; | |
| 48 | |
| 49 class MockFoo : public FooInterface { | |
| 50 public: | |
| 51 MockFoo() {} | |
| 52 | |
| 53 MOCK_METHOD0(DoThis, void()); | |
| 54 | |
| 55 private: | |
| 56 GTEST_DISALLOW_COPY_AND_ASSIGN_(MockFoo); | |
| 57 }; | |
| 58 | |
| 59 TEST(LeakTest, LeakedMockWithExpectCallCausesFailureWhenLeakCheckingIsEnabled) { | |
| 60 MockFoo* foo = new MockFoo; | |
| 61 | |
| 62 EXPECT_CALL(*foo, DoThis()); | |
| 63 foo->DoThis(); | |
| 64 | |
| 65 // In order to test the leak detector, we deliberately leak foo. | |
| 66 | |
| 67 // Makes sure Google Mock's leak detector can change the exit code | |
| 68 // to 1 even when the code is already exiting with 0. | |
| 69 exit(0); | |
| 70 } | |
| 71 | |
| 72 TEST(LeakTest, LeakedMockWithOnCallCausesFailureWhenLeakCheckingIsEnabled) { | |
| 73 MockFoo* foo = new MockFoo; | |
| 74 | |
| 75 ON_CALL(*foo, DoThis()).WillByDefault(Return()); | |
| 76 | |
| 77 // In order to test the leak detector, we deliberately leak foo. | |
| 78 | |
| 79 // Makes sure Google Mock's leak detector can change the exit code | |
| 80 // to 1 even when the code is already exiting with 0. | |
| 81 exit(0); | |
| 82 } | |
| 83 | |
| 84 TEST(LeakTest, CatchesMultipleLeakedMockObjects) { | |
| 85 MockFoo* foo1 = new MockFoo; | |
| 86 MockFoo* foo2 = new MockFoo; | |
| 87 | |
| 88 ON_CALL(*foo1, DoThis()).WillByDefault(Return()); | |
| 89 EXPECT_CALL(*foo2, DoThis()); | |
| 90 foo2->DoThis(); | |
| 91 | |
| 92 // In order to test the leak detector, we deliberately leak foo1 and | |
| 93 // foo2. | |
| 94 | |
| 95 // Makes sure Google Mock's leak detector can change the exit code | |
| 96 // to 1 even when the code is already exiting with 0. | |
| 97 exit(0); | |
| 98 } | |
| 99 | |
| 100 } // namespace | |
| OLD | NEW |