| OLD | NEW |
| 1 // Copyright (c) 2007, Google Inc. | 1 // Copyright (c) 2007, Google Inc. |
| 2 // All rights reserved. | 2 // All rights reserved. |
| 3 // | 3 // |
| 4 // Redistribution and use in source and binary forms, with or without | 4 // Redistribution and use in source and binary forms, with or without |
| 5 // modification, are permitted provided that the following conditions are | 5 // modification, are permitted provided that the following conditions are |
| 6 // met: | 6 // met: |
| 7 // | 7 // |
| 8 // * Redistributions of source code must retain the above copyright | 8 // * Redistributions of source code must retain the above copyright |
| 9 // notice, this list of conditions and the following disclaimer. | 9 // notice, this list of conditions and the following disclaimer. |
| 10 // * Redistributions in binary form must reproduce the above | 10 // * Redistributions in binary form must reproduce the above |
| (...skipping 15 matching lines...) Expand all Loading... |
| 26 // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT | 26 // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
| 27 // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE | 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. | 28 // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
| 29 | 29 |
| 30 // --- | 30 // --- |
| 31 // Author: Fred Akalin | 31 // Author: Fred Akalin |
| 32 | 32 |
| 33 #include <stdio.h> | 33 #include <stdio.h> |
| 34 #include <stdlib.h> | 34 #include <stdlib.h> |
| 35 #include <vector> | 35 #include <vector> |
| 36 #include "google/malloc_extension.h" | 36 #include "gperftools/malloc_extension.h" |
| 37 #include "base/logging.h" | 37 #include "base/logging.h" |
| 38 | 38 |
| 39 using std::vector; | 39 using std::vector; |
| 40 | 40 |
| 41 vector<void (*)()> g_testlist; // the tests to run | 41 vector<void (*)()> g_testlist; // the tests to run |
| 42 | 42 |
| 43 #define TEST(a, b) \ | 43 #define TEST(a, b) \ |
| 44 struct Test_##a##_##b { \ | 44 struct Test_##a##_##b { \ |
| 45 Test_##a##_##b() { g_testlist.push_back(&Run); } \ | 45 Test_##a##_##b() { g_testlist.push_back(&Run); } \ |
| 46 static void Run(); \ | 46 static void Run(); \ |
| (...skipping 257 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 304 // death tests, we will run only the non-death parts. One way to | 304 // death tests, we will run only the non-death parts. One way to |
| 305 // tell when you are done with all tests is when no 'expected | 305 // tell when you are done with all tests is when no 'expected |
| 306 // regexp' message is printed for a given argv[1]. | 306 // regexp' message is printed for a given argv[1]. |
| 307 if (argc < 2) { | 307 if (argc < 2) { |
| 308 test_to_run = -1; // will never match | 308 test_to_run = -1; // will never match |
| 309 } else { | 309 } else { |
| 310 test_to_run = atoi(argv[1]); | 310 test_to_run = atoi(argv[1]); |
| 311 } | 311 } |
| 312 return RUN_ALL_TESTS(); | 312 return RUN_ALL_TESTS(); |
| 313 } | 313 } |
| OLD | NEW |