From 78ed17d3f4937fc512298ffc0ffb3f93c09b02eb Mon Sep 17 00:00:00 2001 From: Kamil Dudka Date: Fri, 18 Oct 2024 16:42:58 +0200 Subject: [PATCH 1/2] vra: remove this component from the Predator repo It has not been developed for 10+ years and we are not aware of any active users. In case someone wanted to resume the development, the source code can still be restored from git history. Closes: https://github.com/kdudka/predator/pull/103 --- .gitignore | 1 - vra/.gitignore | 1 - vra/CMakeLists.txt | 76 - vra/COPYING | 674 - vra/GlobAnalysis.cc | 491 - vra/GlobAnalysis.h | 73 - vra/LoopFinder.cc | 1169 -- vra/LoopFinder.h | 123 - vra/Makefile | 74 - vra/MemoryPlace.cc | 27 - vra/MemoryPlace.h | 40 - vra/Number.cc | 1436 -- vra/Number.h | 155 - vra/OperandToMemoryPlace.cc | 199 - vra/OperandToMemoryPlace.h | 47 - vra/README | 87 - vra/Range.cc | 2577 --- vra/Range.h | 184 - vra/Utility.cc | 156 - vra/Utility.h | 30 - vra/ValueAnalysis.cc | 1145 -- vra/ValueAnalysis.h | 205 - vra/config.h | 25 - vra/doc/Doxyfile | 1781 -- vra/doc/Doxygen.h | 31 - vra/doc/Makefile | 10 - vra/tests-overall/.gitignore | 1 - vra/tests-overall/Makefile | 3 - vra/tests-overall/test-0001.c | 23 - vra/tests-overall/test-0001.c.ref | 38 - vra/tests-overall/test-0002.c | 15 - vra/tests-overall/test-0002.c.ref | 11 - vra/tests-overall/test-0003.c | 15 - vra/tests-overall/test-0003.c.ref | 11 - vra/tests-overall/test-0004.c | 25 - vra/tests-overall/test-0004.c.ref | 23 - vra/tests-overall/test-0005.c | 23 - vra/tests-overall/test-0005.c.ref | 23 - vra/tests-overall/test-0006.c | 19 - vra/tests-overall/test-0006.c.ref | 23 - vra/tests-overall/test-0007.c | 23 - vra/tests-overall/test-0007.c.ref | 23 - vra/tests-overall/test-0008.c | 20 - vra/tests-overall/test-0008.c.ref | 23 - vra/tests-overall/test-0009.c | 45 - vra/tests-overall/test-0009.c.ref | 53 - vra/tests-overall/test-0010.c | 36 - vra/tests-overall/test-0010.c.ref | 53 - vra/tests-overall/test-0011.c | 31 - vra/tests-overall/test-0011.c.ref | 53 - vra/tests-overall/test-0012.c | 29 - vra/tests-overall/test-0012.c.ref | 53 - vra/tests-overall/test-0013.c | 14 - vra/tests-overall/test-0013.c.ref | 11 - vra/tests-overall/test-0014.c | 25 - vra/tests-overall/test-0014.c.ref | 11 - vra/tests-overall/test-0015.c | 14 - vra/tests-overall/test-0015.c.ref | 11 - vra/tests-overall/test-0016.c | 14 - vra/tests-overall/test-0016.c.ref | 11 - vra/tests-overall/test-0017.c | 19 - vra/tests-overall/test-0017.c.ref | 11 - vra/tests-overall/test-0018.c | 14 - vra/tests-overall/test-0018.c.ref | 11 - vra/tests-overall/test-0019.c | 17 - vra/tests-overall/test-0019.c.ref | 11 - vra/tests-overall/test-0020.c | 21 - vra/tests-overall/test-0020.c.ref | 17 - vra/tests-overall/test-0021.c | 22 - vra/tests-overall/test-0021.c.ref | 11 - vra/tests-overall/test-0022.c | 17 - vra/tests-overall/test-0022.c.ref | 11 - vra/tests-overall/test-0023.c | 20 - vra/tests-overall/test-0023.c.ref | 17 - vra/tests-overall/test-0024.c | 25 - vra/tests-overall/test-0024.c.ref | 11 - vra/tests-overall/test-0025.c | 24 - vra/tests-overall/test-0025.c.ref | 14 - vra/tests-overall/test-0026.c | 27 - vra/tests-overall/test-0026.c.ref | 23 - vra/tests-overall/test-0027.c | 35 - vra/tests-overall/test-0027.c.ref | 14 - vra/tests-overall/test-0028.c | 18 - vra/tests-overall/test-0028.c.ref | 11 - vra/tests-overall/test-0029.c | 21 - vra/tests-overall/test-0029.c.ref | 20 - vra/tests-overall/test-0030.c | 29 - vra/tests-overall/test-0030.c.ref | 11 - vra/tests-overall/test-0031.c | 24 - vra/tests-overall/test-0031.c.ref | 11 - vra/tests-overall/test-0032.c | 35 - vra/tests-overall/test-0032.c.ref | 17 - vra/tests-overall/test-0033.c | 34 - vra/tests-overall/test-0033.c.ref | 11 - vra/tests-overall/test-0034.c | 46 - vra/tests-overall/test-0034.c.ref | 11 - vra/tests-overall/test-0035.c | 33 - vra/tests-overall/test-0035.c.ref | 53 - vra/tests-overall/test-0036.c | 23 - vra/tests-overall/test-0036.c.ref | 8 - vra/tests-overall/test-0037.c | 14 - vra/tests-overall/test-0037.c.ref | 8 - vra/tests-overall/test-0038.c | 76 - vra/tests-overall/test-0038.c.ref | 74 - vra/tests-overall/test-0039.c | 77 - vra/tests-overall/test-0039.c.ref | 74 - vra/tests-overall/test-0040.c | 76 - vra/tests-overall/test-0040.c.ref | 74 - vra/tests-overall/test-0041.c | 41 - vra/tests-overall/test-0041.c.ref | 56 - vra/tests-overall/test-0042.c | 30 - vra/tests-overall/test-0042.c.ref | 457 - vra/tests-overall/test-0043.c | 33 - vra/tests-overall/test-0043.c.ref | 32 - vra/tests-overall/test-0044.c | 30 - vra/tests-overall/test-0044.c.ref | 26 - vra/tests-overall/test-0045.c | 36 - vra/tests-overall/test-0045.c.ref | 65 - vra/tests-overall/test-0046.c | 18 - vra/tests-overall/test-0046.c.ref | 28 - vra/tests-overall/test-0047.c | 17 - vra/tests-overall/test-0047.c.ref | 28 - vra/tests-overall/test-0048.c | 20 - vra/tests-overall/test-0048.c.ref | 37 - vra/tests-overall/test-0049.c | 21 - vra/tests-overall/test-0049.c.ref | 37 - vra/tests-overall/test-0050.c | 16 - vra/tests-overall/test-0050.c.ref | 20 - vra/tests-overall/test-0051.c | 15 - vra/tests-overall/test-0051.c.ref | 16 - vra/tests-overall/test-0052.c | 22 - vra/tests-overall/test-0052.c.ref | 61 - vra/tests-overall/test-0053.c | 21 - vra/tests-overall/test-0053.c.ref | 38 - vra/tests-overall/test-0054.c | 17 - vra/tests-overall/test-0054.c.ref | 19 - vra/tests-overall/test-0055.c | 18 - vra/tests-overall/test-0055.c.ref | 28 - vra/tests-overall/test-0056.c | 18 - vra/tests-overall/test-0056.c.ref | 29 - vra/tests-overall/test-0057.c | 22 - vra/tests-overall/test-0057.c.ref | 46 - vra/tests-overall/test-0058.c | 21 - vra/tests-overall/test-0058.c.ref | 29 - vra/tests-overall/test-0059.c | 19 - vra/tests-overall/test-0059.c.ref | 29 - vra/tests-overall/test-0060.c | 21 - vra/tests-overall/test-0060.c.ref | 38 - vra/tests-overall/test-0061.c | 16 - vra/tests-overall/test-0061.c.ref | 20 - vra/tests-overall/test-0062.c | 22 - vra/tests-overall/test-0062.c.ref | 47 - vra/tests-overall/test-0063.c | 17 - vra/tests-overall/test-0063.c.ref | 29 - vra/tests-overall/test-0064.c | 13 - vra/tests-overall/test-0064.c.ref | 16 - vra/tests-overall/test-0065.c | 24 - vra/tests-overall/test-0065.c.ref | 23 - vra/tests-overall/test-0066.c | 44 - vra/tests-overall/test-0066.c.ref | 347 - vra/tests-overall/test-0067.c | 23 - vra/tests-overall/test-0067.c.ref | 44 - vra/tests-overall/test-0068.c | 16 - vra/tests-overall/test-0068.c.ref | 18 - vra/tests-overall/test-0069.c | 28 - vra/tests-overall/test-0069.c.ref | 84 - vra/tests-overall/test-0070.c | 16 - vra/tests-overall/test-0070.c.ref | 17 - vra/tests-overall/test-0071.c | 23 - vra/tests-overall/test-0071.c.ref | 47 - vra/tests-overall/test-0072.c | 27 - vra/tests-overall/test-0072.c.ref | 34 - vra/tests-overall/test-0073.c | 19 - vra/tests-overall/test-0073.c.ref | 17 - vra/tests-overall/test-0074.c | 19 - vra/tests-overall/test-0074.c.ref | 11 - vra/tests-overall/test-0075.c | 22 - vra/tests-overall/test-0075.c.ref | 37 - vra/tests-overall/test-0076.c | 27 - vra/tests-overall/test-0076.c.ref | 28 - vra/tests-overall/test-0077.c | 18 - vra/tests-overall/test-0077.c.ref | 11 - vra/tests-overall/test-0078.c | 24 - vra/tests-overall/test-0078.c.ref | 60 - vra/tests-overall/test-0079.c | 28 - vra/tests-overall/test-0079.c.ref | 61 - vra/tests-overall/test-0080.c | 29 - vra/tests-overall/test-0080.c.ref | 61 - vra/tests-overall/test-0081.c | 24 - vra/tests-overall/test-0081.c.ref | 54 - vra/tests-overall/test-0082.c | 23 - vra/tests-overall/test-0082.c.ref | 45 - vra/tests-overall/tests-config.sh | 1 - vra/tests-overall/tests-config.sh.in | 24 - vra/tests-overall/tests-gen-ref-outputs.sh | 49 - vra/tests-overall/tests-run.sh | 64 - vra/tests-overall/tests-utils.sh | 108 - vra/tests-unit/.gitignore | 6 - vra/tests-unit/Makefile | 32 - vra/tests-unit/MemoryPlaceTest.cc | 147 - vra/tests-unit/NumberTest.cc | 2962 --- vra/tests-unit/OperandToMemoryPlaceTest.cc | 913 - vra/tests-unit/RangeTest.cc | 6724 ------- vra/tests-unit/UtilityTest.cc | 390 - vra/tests-unit/gtest/Makefile | 5 - vra/tests-unit/gtest/gtest-all.cc | 9118 --------- vra/tests-unit/gtest/gtest.h | 19537 ------------------- vra/tests-unit/gtest/gtest_main.cc | 39 - vra/tests-unit/run-all-unit-tests.sh | 21 - vra/trap.h | 69 - vra/version.c | 23 - vra/vra.cc | 43 - 212 files changed, 56367 deletions(-) delete mode 100644 vra/.gitignore delete mode 100644 vra/CMakeLists.txt delete mode 100644 vra/COPYING delete mode 100644 vra/GlobAnalysis.cc delete mode 100644 vra/GlobAnalysis.h delete mode 100644 vra/LoopFinder.cc delete mode 100644 vra/LoopFinder.h delete mode 100644 vra/Makefile delete mode 100644 vra/MemoryPlace.cc delete mode 100644 vra/MemoryPlace.h delete mode 100644 vra/Number.cc delete mode 100644 vra/Number.h delete mode 100644 vra/OperandToMemoryPlace.cc delete mode 100644 vra/OperandToMemoryPlace.h delete mode 100644 vra/README delete mode 100644 vra/Range.cc delete mode 100644 vra/Range.h delete mode 100644 vra/Utility.cc delete mode 100644 vra/Utility.h delete mode 100644 vra/ValueAnalysis.cc delete mode 100644 vra/ValueAnalysis.h delete mode 100644 vra/config.h delete mode 100644 vra/doc/Doxyfile delete mode 100644 vra/doc/Doxygen.h delete mode 100644 vra/doc/Makefile delete mode 100644 vra/tests-overall/.gitignore delete mode 100644 vra/tests-overall/Makefile delete mode 100644 vra/tests-overall/test-0001.c delete mode 100644 vra/tests-overall/test-0001.c.ref delete mode 100644 vra/tests-overall/test-0002.c delete mode 100644 vra/tests-overall/test-0002.c.ref delete mode 100644 vra/tests-overall/test-0003.c delete mode 100644 vra/tests-overall/test-0003.c.ref delete mode 100644 vra/tests-overall/test-0004.c delete mode 100644 vra/tests-overall/test-0004.c.ref delete mode 100644 vra/tests-overall/test-0005.c delete mode 100644 vra/tests-overall/test-0005.c.ref delete mode 100644 vra/tests-overall/test-0006.c delete mode 100644 vra/tests-overall/test-0006.c.ref delete mode 100644 vra/tests-overall/test-0007.c delete mode 100644 vra/tests-overall/test-0007.c.ref delete mode 100644 vra/tests-overall/test-0008.c delete mode 100644 vra/tests-overall/test-0008.c.ref delete mode 100644 vra/tests-overall/test-0009.c delete mode 100644 vra/tests-overall/test-0009.c.ref delete mode 100644 vra/tests-overall/test-0010.c delete mode 100644 vra/tests-overall/test-0010.c.ref delete mode 100644 vra/tests-overall/test-0011.c delete mode 100644 vra/tests-overall/test-0011.c.ref delete mode 100644 vra/tests-overall/test-0012.c delete mode 100644 vra/tests-overall/test-0012.c.ref delete mode 100644 vra/tests-overall/test-0013.c delete mode 100644 vra/tests-overall/test-0013.c.ref delete mode 100644 vra/tests-overall/test-0014.c delete mode 100644 vra/tests-overall/test-0014.c.ref delete mode 100644 vra/tests-overall/test-0015.c delete mode 100644 vra/tests-overall/test-0015.c.ref delete mode 100644 vra/tests-overall/test-0016.c delete mode 100644 vra/tests-overall/test-0016.c.ref delete mode 100644 vra/tests-overall/test-0017.c delete mode 100644 vra/tests-overall/test-0017.c.ref delete mode 100644 vra/tests-overall/test-0018.c delete mode 100644 vra/tests-overall/test-0018.c.ref delete mode 100644 vra/tests-overall/test-0019.c delete mode 100644 vra/tests-overall/test-0019.c.ref delete mode 100644 vra/tests-overall/test-0020.c delete mode 100644 vra/tests-overall/test-0020.c.ref delete mode 100644 vra/tests-overall/test-0021.c delete mode 100644 vra/tests-overall/test-0021.c.ref delete mode 100644 vra/tests-overall/test-0022.c delete mode 100644 vra/tests-overall/test-0022.c.ref delete mode 100644 vra/tests-overall/test-0023.c delete mode 100644 vra/tests-overall/test-0023.c.ref delete mode 100644 vra/tests-overall/test-0024.c delete mode 100644 vra/tests-overall/test-0024.c.ref delete mode 100644 vra/tests-overall/test-0025.c delete mode 100644 vra/tests-overall/test-0025.c.ref delete mode 100644 vra/tests-overall/test-0026.c delete mode 100644 vra/tests-overall/test-0026.c.ref delete mode 100644 vra/tests-overall/test-0027.c delete mode 100644 vra/tests-overall/test-0027.c.ref delete mode 100644 vra/tests-overall/test-0028.c delete mode 100644 vra/tests-overall/test-0028.c.ref delete mode 100644 vra/tests-overall/test-0029.c delete mode 100644 vra/tests-overall/test-0029.c.ref delete mode 100644 vra/tests-overall/test-0030.c delete mode 100644 vra/tests-overall/test-0030.c.ref delete mode 100644 vra/tests-overall/test-0031.c delete mode 100644 vra/tests-overall/test-0031.c.ref delete mode 100644 vra/tests-overall/test-0032.c delete mode 100644 vra/tests-overall/test-0032.c.ref delete mode 100644 vra/tests-overall/test-0033.c delete mode 100644 vra/tests-overall/test-0033.c.ref delete mode 100644 vra/tests-overall/test-0034.c delete mode 100644 vra/tests-overall/test-0034.c.ref delete mode 100644 vra/tests-overall/test-0035.c delete mode 100644 vra/tests-overall/test-0035.c.ref delete mode 100644 vra/tests-overall/test-0036.c delete mode 100644 vra/tests-overall/test-0036.c.ref delete mode 100644 vra/tests-overall/test-0037.c delete mode 100644 vra/tests-overall/test-0037.c.ref delete mode 100644 vra/tests-overall/test-0038.c delete mode 100644 vra/tests-overall/test-0038.c.ref delete mode 100644 vra/tests-overall/test-0039.c delete mode 100644 vra/tests-overall/test-0039.c.ref delete mode 100644 vra/tests-overall/test-0040.c delete mode 100644 vra/tests-overall/test-0040.c.ref delete mode 100644 vra/tests-overall/test-0041.c delete mode 100644 vra/tests-overall/test-0041.c.ref delete mode 100644 vra/tests-overall/test-0042.c delete mode 100644 vra/tests-overall/test-0042.c.ref delete mode 100644 vra/tests-overall/test-0043.c delete mode 100644 vra/tests-overall/test-0043.c.ref delete mode 100644 vra/tests-overall/test-0044.c delete mode 100644 vra/tests-overall/test-0044.c.ref delete mode 100644 vra/tests-overall/test-0045.c delete mode 100644 vra/tests-overall/test-0045.c.ref delete mode 100644 vra/tests-overall/test-0046.c delete mode 100644 vra/tests-overall/test-0046.c.ref delete mode 100644 vra/tests-overall/test-0047.c delete mode 100644 vra/tests-overall/test-0047.c.ref delete mode 100644 vra/tests-overall/test-0048.c delete mode 100644 vra/tests-overall/test-0048.c.ref delete mode 100644 vra/tests-overall/test-0049.c delete mode 100644 vra/tests-overall/test-0049.c.ref delete mode 100644 vra/tests-overall/test-0050.c delete mode 100644 vra/tests-overall/test-0050.c.ref delete mode 100644 vra/tests-overall/test-0051.c delete mode 100644 vra/tests-overall/test-0051.c.ref delete mode 100644 vra/tests-overall/test-0052.c delete mode 100644 vra/tests-overall/test-0052.c.ref delete mode 100644 vra/tests-overall/test-0053.c delete mode 100644 vra/tests-overall/test-0053.c.ref delete mode 100644 vra/tests-overall/test-0054.c delete mode 100644 vra/tests-overall/test-0054.c.ref delete mode 100644 vra/tests-overall/test-0055.c delete mode 100644 vra/tests-overall/test-0055.c.ref delete mode 100644 vra/tests-overall/test-0056.c delete mode 100644 vra/tests-overall/test-0056.c.ref delete mode 100644 vra/tests-overall/test-0057.c delete mode 100644 vra/tests-overall/test-0057.c.ref delete mode 100644 vra/tests-overall/test-0058.c delete mode 100644 vra/tests-overall/test-0058.c.ref delete mode 100644 vra/tests-overall/test-0059.c delete mode 100644 vra/tests-overall/test-0059.c.ref delete mode 100644 vra/tests-overall/test-0060.c delete mode 100644 vra/tests-overall/test-0060.c.ref delete mode 100644 vra/tests-overall/test-0061.c delete mode 100644 vra/tests-overall/test-0061.c.ref delete mode 100644 vra/tests-overall/test-0062.c delete mode 100644 vra/tests-overall/test-0062.c.ref delete mode 100644 vra/tests-overall/test-0063.c delete mode 100644 vra/tests-overall/test-0063.c.ref delete mode 100644 vra/tests-overall/test-0064.c delete mode 100644 vra/tests-overall/test-0064.c.ref delete mode 100644 vra/tests-overall/test-0065.c delete mode 100644 vra/tests-overall/test-0065.c.ref delete mode 100644 vra/tests-overall/test-0066.c delete mode 100644 vra/tests-overall/test-0066.c.ref delete mode 100644 vra/tests-overall/test-0067.c delete mode 100644 vra/tests-overall/test-0067.c.ref delete mode 100644 vra/tests-overall/test-0068.c delete mode 100644 vra/tests-overall/test-0068.c.ref delete mode 100644 vra/tests-overall/test-0069.c delete mode 100644 vra/tests-overall/test-0069.c.ref delete mode 100644 vra/tests-overall/test-0070.c delete mode 100644 vra/tests-overall/test-0070.c.ref delete mode 100644 vra/tests-overall/test-0071.c delete mode 100644 vra/tests-overall/test-0071.c.ref delete mode 100644 vra/tests-overall/test-0072.c delete mode 100644 vra/tests-overall/test-0072.c.ref delete mode 100644 vra/tests-overall/test-0073.c delete mode 100644 vra/tests-overall/test-0073.c.ref delete mode 100644 vra/tests-overall/test-0074.c delete mode 100644 vra/tests-overall/test-0074.c.ref delete mode 100644 vra/tests-overall/test-0075.c delete mode 100644 vra/tests-overall/test-0075.c.ref delete mode 100644 vra/tests-overall/test-0076.c delete mode 100644 vra/tests-overall/test-0076.c.ref delete mode 100644 vra/tests-overall/test-0077.c delete mode 100644 vra/tests-overall/test-0077.c.ref delete mode 100644 vra/tests-overall/test-0078.c delete mode 100644 vra/tests-overall/test-0078.c.ref delete mode 100644 vra/tests-overall/test-0079.c delete mode 100644 vra/tests-overall/test-0079.c.ref delete mode 100644 vra/tests-overall/test-0080.c delete mode 100644 vra/tests-overall/test-0080.c.ref delete mode 100644 vra/tests-overall/test-0081.c delete mode 100644 vra/tests-overall/test-0081.c.ref delete mode 100644 vra/tests-overall/test-0082.c delete mode 100644 vra/tests-overall/test-0082.c.ref delete mode 120000 vra/tests-overall/tests-config.sh delete mode 100644 vra/tests-overall/tests-config.sh.in delete mode 100755 vra/tests-overall/tests-gen-ref-outputs.sh delete mode 100755 vra/tests-overall/tests-run.sh delete mode 100644 vra/tests-overall/tests-utils.sh delete mode 100644 vra/tests-unit/.gitignore delete mode 100644 vra/tests-unit/Makefile delete mode 100644 vra/tests-unit/MemoryPlaceTest.cc delete mode 100644 vra/tests-unit/NumberTest.cc delete mode 100644 vra/tests-unit/OperandToMemoryPlaceTest.cc delete mode 100644 vra/tests-unit/RangeTest.cc delete mode 100644 vra/tests-unit/UtilityTest.cc delete mode 100644 vra/tests-unit/gtest/Makefile delete mode 100644 vra/tests-unit/gtest/gtest-all.cc delete mode 100644 vra/tests-unit/gtest/gtest.h delete mode 100644 vra/tests-unit/gtest/gtest_main.cc delete mode 100755 vra/tests-unit/run-all-unit-tests.sh delete mode 100644 vra/trap.h delete mode 100644 vra/version.c delete mode 100644 vra/vra.cc diff --git a/.gitignore b/.gitignore index 302b4d93a..4207de262 100644 --- a/.gitignore +++ b/.gitignore @@ -20,4 +20,3 @@ tags *-bare-gcc.err *-predator.err cscope.out -/vra_build diff --git a/vra/.gitignore b/vra/.gitignore deleted file mode 100644 index 67020331b..000000000 --- a/vra/.gitignore +++ /dev/null @@ -1 +0,0 @@ -version.h diff --git a/vra/CMakeLists.txt b/vra/CMakeLists.txt deleted file mode 100644 index c6723368d..000000000 --- a/vra/CMakeLists.txt +++ /dev/null @@ -1,76 +0,0 @@ -# Copyright (C) 2013 Daniela Ďuričeková -# -# This file is part of value-range analyzer. -# -# Value-range analyzer is free software: you can redistribute it and/or modify -# it under the terms of the GNU General Public License as published by the Free -# Software Foundation, either version 3 of the License, or any later version. -# -# Value-range analyzer is distributed in the hope that it will be useful, but -# WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or -# FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for -# more details. -# -# You should have received a copy of the GNU General Public License along with -# the value-range analyzer. If not, see . - -# project metadata -cmake_minimum_required(VERSION 2.6) -project(vra C CXX) -enable_testing() - -include("../build-aux/common.cmake") - -# debugging -option(VRA_DEBUG "Set to ON to enable debugging support" ON) -if(VRA_DEBUG) - add_definitions("-O0 -g") -else() - add_definitions("-O3 -DNDEBUG") -endif() - -# disable some warnings -add_definitions("-Wno-float-equal") - -# work around a libgmp bug per https://gcc.gnu.org/gcc-4.9/porting_to.html -if(CMAKE_CXX_COMPILER_ID STREQUAL "GNU" - AND NOT CMAKE_CXX_COMPILER_VERSION VERSION_LESS "4.9") - set(CMAKE_CXX_FLAGS "${CMAKE_CXX_FLAGS} -include cstddef") -endif() - -# libvra.so -add_library(vra_core STATIC - vra.cc - Number.cc - Range.cc - MemoryPlace.cc - OperandToMemoryPlace.cc - ValueAnalysis.cc - Utility.cc - LoopFinder.cc - GlobAnalysis.cc - version.c) - -# build compiler plug-in (libvra.so) -CL_BUILD_COMPILER_PLUGIN(vra vra_core ../cl_build) - -# helping scripts -configure_file( ${PROJECT_SOURCE_DIR}/tests-overall/tests-config.sh.in - ${PROJECT_BINARY_DIR}/tests-config.sh @ONLY) - -# link with gmp -find_library(GMP_LIB gmp) -if(NOT GMP_LIB) - message(FATAL_ERROR "gmp library not found.") -endif() - -# link with gmpxx -find_library(GMPXX_LIB gmpxx) -if(NOT GMPXX_LIB) - message(FATAL_ERROR "gmpxx library not found.") -endif() - -target_link_libraries(vra ${CL_LIB} ${GMP_LIB} ${GMPXX_LIB}) - -# make install -install(TARGETS vra DESTINATION lib) diff --git a/vra/COPYING b/vra/COPYING deleted file mode 100644 index 94a9ed024..000000000 --- a/vra/COPYING +++ /dev/null @@ -1,674 +0,0 @@ - GNU GENERAL PUBLIC LICENSE - Version 3, 29 June 2007 - - Copyright (C) 2007 Free Software Foundation, Inc. - Everyone is permitted to copy and distribute verbatim copies - of this license document, but changing it is not allowed. - - Preamble - - The GNU General Public License is a free, copyleft license for -software and other kinds of works. - - The licenses for most software and other practical works are designed -to take away your freedom to share and change the works. By contrast, -the GNU General Public License is intended to guarantee your freedom to -share and change all versions of a program--to make sure it remains free -software for all its users. We, the Free Software Foundation, use the -GNU General Public License for most of our software; it applies also to -any other work released this way by its authors. You can apply it to -your programs, too. - - When we speak of free software, we are referring to freedom, not -price. Our General Public Licenses are designed to make sure that you -have the freedom to distribute copies of free software (and charge for -them if you wish), that you receive source code or can get it if you -want it, that you can change the software or use pieces of it in new -free programs, and that you know you can do these things. - - To protect your rights, we need to prevent others from denying you -these rights or asking you to surrender the rights. Therefore, you have -certain responsibilities if you distribute copies of the software, or if -you modify it: responsibilities to respect the freedom of others. - - For example, if you distribute copies of such a program, whether -gratis or for a fee, you must pass on to the recipients the same -freedoms that you received. You must make sure that they, too, receive -or can get the source code. And you must show them these terms so they -know their rights. - - Developers that use the GNU GPL protect your rights with two steps: -(1) assert copyright on the software, and (2) offer you this License -giving you legal permission to copy, distribute and/or modify it. - - For the developers' and authors' protection, the GPL clearly explains -that there is no warranty for this free software. For both users' and -authors' sake, the GPL requires that modified versions be marked as -changed, so that their problems will not be attributed erroneously to -authors of previous versions. - - Some devices are designed to deny users access to install or run -modified versions of the software inside them, although the manufacturer -can do so. This is fundamentally incompatible with the aim of -protecting users' freedom to change the software. The systematic -pattern of such abuse occurs in the area of products for individuals to -use, which is precisely where it is most unacceptable. Therefore, we -have designed this version of the GPL to prohibit the practice for those -products. If such problems arise substantially in other domains, we -stand ready to extend this provision to those domains in future versions -of the GPL, as needed to protect the freedom of users. - - Finally, every program is threatened constantly by software patents. -States should not allow patents to restrict development and use of -software on general-purpose computers, but in those that do, we wish to -avoid the special danger that patents applied to a free program could -make it effectively proprietary. To prevent this, the GPL assures that -patents cannot be used to render the program non-free. - - The precise terms and conditions for copying, distribution and -modification follow. - - TERMS AND CONDITIONS - - 0. Definitions. - - "This License" refers to version 3 of the GNU General Public License. - - "Copyright" also means copyright-like laws that apply to other kinds of -works, such as semiconductor masks. - - "The Program" refers to any copyrightable work licensed under this -License. Each licensee is addressed as "you". "Licensees" and -"recipients" may be individuals or organizations. - - To "modify" a work means to copy from or adapt all or part of the work -in a fashion requiring copyright permission, other than the making of an -exact copy. The resulting work is called a "modified version" of the -earlier work or a work "based on" the earlier work. - - A "covered work" means either the unmodified Program or a work based -on the Program. - - To "propagate" a work means to do anything with it that, without -permission, would make you directly or secondarily liable for -infringement under applicable copyright law, except executing it on a -computer or modifying a private copy. Propagation includes copying, -distribution (with or without modification), making available to the -public, and in some countries other activities as well. - - To "convey" a work means any kind of propagation that enables other -parties to make or receive copies. Mere interaction with a user through -a computer network, with no transfer of a copy, is not conveying. - - An interactive user interface displays "Appropriate Legal Notices" -to the extent that it includes a convenient and prominently visible -feature that (1) displays an appropriate copyright notice, and (2) -tells the user that there is no warranty for the work (except to the -extent that warranties are provided), that licensees may convey the -work under this License, and how to view a copy of this License. If -the interface presents a list of user commands or options, such as a -menu, a prominent item in the list meets this criterion. - - 1. Source Code. - - The "source code" for a work means the preferred form of the work -for making modifications to it. "Object code" means any non-source -form of a work. - - A "Standard Interface" means an interface that either is an official -standard defined by a recognized standards body, or, in the case of -interfaces specified for a particular programming language, one that -is widely used among developers working in that language. - - The "System Libraries" of an executable work include anything, other -than the work as a whole, that (a) is included in the normal form of -packaging a Major Component, but which is not part of that Major -Component, and (b) serves only to enable use of the work with that -Major Component, or to implement a Standard Interface for which an -implementation is available to the public in source code form. A -"Major Component", in this context, means a major essential component -(kernel, window system, and so on) of the specific operating system -(if any) on which the executable work runs, or a compiler used to -produce the work, or an object code interpreter used to run it. - - The "Corresponding Source" for a work in object code form means all -the source code needed to generate, install, and (for an executable -work) run the object code and to modify the work, including scripts to -control those activities. However, it does not include the work's -System Libraries, or general-purpose tools or generally available free -programs which are used unmodified in performing those activities but -which are not part of the work. For example, Corresponding Source -includes interface definition files associated with source files for -the work, and the source code for shared libraries and dynamically -linked subprograms that the work is specifically designed to require, -such as by intimate data communication or control flow between those -subprograms and other parts of the work. - - The Corresponding Source need not include anything that users -can regenerate automatically from other parts of the Corresponding -Source. - - The Corresponding Source for a work in source code form is that -same work. - - 2. Basic Permissions. - - All rights granted under this License are granted for the term of -copyright on the Program, and are irrevocable provided the stated -conditions are met. This License explicitly affirms your unlimited -permission to run the unmodified Program. The output from running a -covered work is covered by this License only if the output, given its -content, constitutes a covered work. This License acknowledges your -rights of fair use or other equivalent, as provided by copyright law. - - You may make, run and propagate covered works that you do not -convey, without conditions so long as your license otherwise remains -in force. You may convey covered works to others for the sole purpose -of having them make modifications exclusively for you, or provide you -with facilities for running those works, provided that you comply with -the terms of this License in conveying all material for which you do -not control copyright. Those thus making or running the covered works -for you must do so exclusively on your behalf, under your direction -and control, on terms that prohibit them from making any copies of -your copyrighted material outside their relationship with you. - - Conveying under any other circumstances is permitted solely under -the conditions stated below. Sublicensing is not allowed; section 10 -makes it unnecessary. - - 3. Protecting Users' Legal Rights From Anti-Circumvention Law. - - No covered work shall be deemed part of an effective technological -measure under any applicable law fulfilling obligations under article -11 of the WIPO copyright treaty adopted on 20 December 1996, or -similar laws prohibiting or restricting circumvention of such -measures. - - When you convey a covered work, you waive any legal power to forbid -circumvention of technological measures to the extent such circumvention -is effected by exercising rights under this License with respect to -the covered work, and you disclaim any intention to limit operation or -modification of the work as a means of enforcing, against the work's -users, your or third parties' legal rights to forbid circumvention of -technological measures. - - 4. Conveying Verbatim Copies. - - You may convey verbatim copies of the Program's source code as you -receive it, in any medium, provided that you conspicuously and -appropriately publish on each copy an appropriate copyright notice; -keep intact all notices stating that this License and any -non-permissive terms added in accord with section 7 apply to the code; -keep intact all notices of the absence of any warranty; and give all -recipients a copy of this License along with the Program. - - You may charge any price or no price for each copy that you convey, -and you may offer support or warranty protection for a fee. - - 5. Conveying Modified Source Versions. - - You may convey a work based on the Program, or the modifications to -produce it from the Program, in the form of source code under the -terms of section 4, provided that you also meet all of these conditions: - - a) The work must carry prominent notices stating that you modified - it, and giving a relevant date. - - b) The work must carry prominent notices stating that it is - released under this License and any conditions added under section - 7. This requirement modifies the requirement in section 4 to - "keep intact all notices". - - c) You must license the entire work, as a whole, under this - License to anyone who comes into possession of a copy. This - License will therefore apply, along with any applicable section 7 - additional terms, to the whole of the work, and all its parts, - regardless of how they are packaged. This License gives no - permission to license the work in any other way, but it does not - invalidate such permission if you have separately received it. - - d) If the work has interactive user interfaces, each must display - Appropriate Legal Notices; however, if the Program has interactive - interfaces that do not display Appropriate Legal Notices, your - work need not make them do so. - - A compilation of a covered work with other separate and independent -works, which are not by their nature extensions of the covered work, -and which are not combined with it such as to form a larger program, -in or on a volume of a storage or distribution medium, is called an -"aggregate" if the compilation and its resulting copyright are not -used to limit the access or legal rights of the compilation's users -beyond what the individual works permit. Inclusion of a covered work -in an aggregate does not cause this License to apply to the other -parts of the aggregate. - - 6. Conveying Non-Source Forms. - - You may convey a covered work in object code form under the terms -of sections 4 and 5, provided that you also convey the -machine-readable Corresponding Source under the terms of this License, -in one of these ways: - - a) Convey the object code in, or embodied in, a physical product - (including a physical distribution medium), accompanied by the - Corresponding Source fixed on a durable physical medium - customarily used for software interchange. - - b) Convey the object code in, or embodied in, a physical product - (including a physical distribution medium), accompanied by a - written offer, valid for at least three years and valid for as - long as you offer spare parts or customer support for that product - model, to give anyone who possesses the object code either (1) a - copy of the Corresponding Source for all the software in the - product that is covered by this License, on a durable physical - medium customarily used for software interchange, for a price no - more than your reasonable cost of physically performing this - conveying of source, or (2) access to copy the - Corresponding Source from a network server at no charge. - - c) Convey individual copies of the object code with a copy of the - written offer to provide the Corresponding Source. This - alternative is allowed only occasionally and noncommercially, and - only if you received the object code with such an offer, in accord - with subsection 6b. - - d) Convey the object code by offering access from a designated - place (gratis or for a charge), and offer equivalent access to the - Corresponding Source in the same way through the same place at no - further charge. You need not require recipients to copy the - Corresponding Source along with the object code. If the place to - copy the object code is a network server, the Corresponding Source - may be on a different server (operated by you or a third party) - that supports equivalent copying facilities, provided you maintain - clear directions next to the object code saying where to find the - Corresponding Source. Regardless of what server hosts the - Corresponding Source, you remain obligated to ensure that it is - available for as long as needed to satisfy these requirements. - - e) Convey the object code using peer-to-peer transmission, provided - you inform other peers where the object code and Corresponding - Source of the work are being offered to the general public at no - charge under subsection 6d. - - A separable portion of the object code, whose source code is excluded -from the Corresponding Source as a System Library, need not be -included in conveying the object code work. - - A "User Product" is either (1) a "consumer product", which means any -tangible personal property which is normally used for personal, family, -or household purposes, or (2) anything designed or sold for incorporation -into a dwelling. In determining whether a product is a consumer product, -doubtful cases shall be resolved in favor of coverage. For a particular -product received by a particular user, "normally used" refers to a -typical or common use of that class of product, regardless of the status -of the particular user or of the way in which the particular user -actually uses, or expects or is expected to use, the product. A product -is a consumer product regardless of whether the product has substantial -commercial, industrial or non-consumer uses, unless such uses represent -the only significant mode of use of the product. - - "Installation Information" for a User Product means any methods, -procedures, authorization keys, or other information required to install -and execute modified versions of a covered work in that User Product from -a modified version of its Corresponding Source. The information must -suffice to ensure that the continued functioning of the modified object -code is in no case prevented or interfered with solely because -modification has been made. - - If you convey an object code work under this section in, or with, or -specifically for use in, a User Product, and the conveying occurs as -part of a transaction in which the right of possession and use of the -User Product is transferred to the recipient in perpetuity or for a -fixed term (regardless of how the transaction is characterized), the -Corresponding Source conveyed under this section must be accompanied -by the Installation Information. But this requirement does not apply -if neither you nor any third party retains the ability to install -modified object code on the User Product (for example, the work has -been installed in ROM). - - The requirement to provide Installation Information does not include a -requirement to continue to provide support service, warranty, or updates -for a work that has been modified or installed by the recipient, or for -the User Product in which it has been modified or installed. Access to a -network may be denied when the modification itself materially and -adversely affects the operation of the network or violates the rules and -protocols for communication across the network. - - Corresponding Source conveyed, and Installation Information provided, -in accord with this section must be in a format that is publicly -documented (and with an implementation available to the public in -source code form), and must require no special password or key for -unpacking, reading or copying. - - 7. Additional Terms. - - "Additional permissions" are terms that supplement the terms of this -License by making exceptions from one or more of its conditions. -Additional permissions that are applicable to the entire Program shall -be treated as though they were included in this License, to the extent -that they are valid under applicable law. If additional permissions -apply only to part of the Program, that part may be used separately -under those permissions, but the entire Program remains governed by -this License without regard to the additional permissions. - - When you convey a copy of a covered work, you may at your option -remove any additional permissions from that copy, or from any part of -it. (Additional permissions may be written to require their own -removal in certain cases when you modify the work.) You may place -additional permissions on material, added by you to a covered work, -for which you have or can give appropriate copyright permission. - - Notwithstanding any other provision of this License, for material you -add to a covered work, you may (if authorized by the copyright holders of -that material) supplement the terms of this License with terms: - - a) Disclaiming warranty or limiting liability differently from the - terms of sections 15 and 16 of this License; or - - b) Requiring preservation of specified reasonable legal notices or - author attributions in that material or in the Appropriate Legal - Notices displayed by works containing it; or - - c) Prohibiting misrepresentation of the origin of that material, or - requiring that modified versions of such material be marked in - reasonable ways as different from the original version; or - - d) Limiting the use for publicity purposes of names of licensors or - authors of the material; or - - e) Declining to grant rights under trademark law for use of some - trade names, trademarks, or service marks; or - - f) Requiring indemnification of licensors and authors of that - material by anyone who conveys the material (or modified versions of - it) with contractual assumptions of liability to the recipient, for - any liability that these contractual assumptions directly impose on - those licensors and authors. - - All other non-permissive additional terms are considered "further -restrictions" within the meaning of section 10. If the Program as you -received it, or any part of it, contains a notice stating that it is -governed by this License along with a term that is a further -restriction, you may remove that term. If a license document contains -a further restriction but permits relicensing or conveying under this -License, you may add to a covered work material governed by the terms -of that license document, provided that the further restriction does -not survive such relicensing or conveying. - - If you add terms to a covered work in accord with this section, you -must place, in the relevant source files, a statement of the -additional terms that apply to those files, or a notice indicating -where to find the applicable terms. - - Additional terms, permissive or non-permissive, may be stated in the -form of a separately written license, or stated as exceptions; -the above requirements apply either way. - - 8. Termination. - - You may not propagate or modify a covered work except as expressly -provided under this License. Any attempt otherwise to propagate or -modify it is void, and will automatically terminate your rights under -this License (including any patent licenses granted under the third -paragraph of section 11). - - However, if you cease all violation of this License, then your -license from a particular copyright holder is reinstated (a) -provisionally, unless and until the copyright holder explicitly and -finally terminates your license, and (b) permanently, if the copyright -holder fails to notify you of the violation by some reasonable means -prior to 60 days after the cessation. - - Moreover, your license from a particular copyright holder is -reinstated permanently if the copyright holder notifies you of the -violation by some reasonable means, this is the first time you have -received notice of violation of this License (for any work) from that -copyright holder, and you cure the violation prior to 30 days after -your receipt of the notice. - - Termination of your rights under this section does not terminate the -licenses of parties who have received copies or rights from you under -this License. If your rights have been terminated and not permanently -reinstated, you do not qualify to receive new licenses for the same -material under section 10. - - 9. Acceptance Not Required for Having Copies. - - You are not required to accept this License in order to receive or -run a copy of the Program. Ancillary propagation of a covered work -occurring solely as a consequence of using peer-to-peer transmission -to receive a copy likewise does not require acceptance. However, -nothing other than this License grants you permission to propagate or -modify any covered work. These actions infringe copyright if you do -not accept this License. Therefore, by modifying or propagating a -covered work, you indicate your acceptance of this License to do so. - - 10. Automatic Licensing of Downstream Recipients. - - Each time you convey a covered work, the recipient automatically -receives a license from the original licensors, to run, modify and -propagate that work, subject to this License. You are not responsible -for enforcing compliance by third parties with this License. - - An "entity transaction" is a transaction transferring control of an -organization, or substantially all assets of one, or subdividing an -organization, or merging organizations. If propagation of a covered -work results from an entity transaction, each party to that -transaction who receives a copy of the work also receives whatever -licenses to the work the party's predecessor in interest had or could -give under the previous paragraph, plus a right to possession of the -Corresponding Source of the work from the predecessor in interest, if -the predecessor has it or can get it with reasonable efforts. - - You may not impose any further restrictions on the exercise of the -rights granted or affirmed under this License. For example, you may -not impose a license fee, royalty, or other charge for exercise of -rights granted under this License, and you may not initiate litigation -(including a cross-claim or counterclaim in a lawsuit) alleging that -any patent claim is infringed by making, using, selling, offering for -sale, or importing the Program or any portion of it. - - 11. Patents. - - A "contributor" is a copyright holder who authorizes use under this -License of the Program or a work on which the Program is based. The -work thus licensed is called the contributor's "contributor version". - - A contributor's "essential patent claims" are all patent claims -owned or controlled by the contributor, whether already acquired or -hereafter acquired, that would be infringed by some manner, permitted -by this License, of making, using, or selling its contributor version, -but do not include claims that would be infringed only as a -consequence of further modification of the contributor version. For -purposes of this definition, "control" includes the right to grant -patent sublicenses in a manner consistent with the requirements of -this License. - - Each contributor grants you a non-exclusive, worldwide, royalty-free -patent license under the contributor's essential patent claims, to -make, use, sell, offer for sale, import and otherwise run, modify and -propagate the contents of its contributor version. - - In the following three paragraphs, a "patent license" is any express -agreement or commitment, however denominated, not to enforce a patent -(such as an express permission to practice a patent or covenant not to -sue for patent infringement). To "grant" such a patent license to a -party means to make such an agreement or commitment not to enforce a -patent against the party. - - If you convey a covered work, knowingly relying on a patent license, -and the Corresponding Source of the work is not available for anyone -to copy, free of charge and under the terms of this License, through a -publicly available network server or other readily accessible means, -then you must either (1) cause the Corresponding Source to be so -available, or (2) arrange to deprive yourself of the benefit of the -patent license for this particular work, or (3) arrange, in a manner -consistent with the requirements of this License, to extend the patent -license to downstream recipients. "Knowingly relying" means you have -actual knowledge that, but for the patent license, your conveying the -covered work in a country, or your recipient's use of the covered work -in a country, would infringe one or more identifiable patents in that -country that you have reason to believe are valid. - - If, pursuant to or in connection with a single transaction or -arrangement, you convey, or propagate by procuring conveyance of, a -covered work, and grant a patent license to some of the parties -receiving the covered work authorizing them to use, propagate, modify -or convey a specific copy of the covered work, then the patent license -you grant is automatically extended to all recipients of the covered -work and works based on it. - - A patent license is "discriminatory" if it does not include within -the scope of its coverage, prohibits the exercise of, or is -conditioned on the non-exercise of one or more of the rights that are -specifically granted under this License. You may not convey a covered -work if you are a party to an arrangement with a third party that is -in the business of distributing software, under which you make payment -to the third party based on the extent of your activity of conveying -the work, and under which the third party grants, to any of the -parties who would receive the covered work from you, a discriminatory -patent license (a) in connection with copies of the covered work -conveyed by you (or copies made from those copies), or (b) primarily -for and in connection with specific products or compilations that -contain the covered work, unless you entered into that arrangement, -or that patent license was granted, prior to 28 March 2007. - - Nothing in this License shall be construed as excluding or limiting -any implied license or other defenses to infringement that may -otherwise be available to you under applicable patent law. - - 12. No Surrender of Others' Freedom. - - If conditions are imposed on you (whether by court order, agreement or -otherwise) that contradict the conditions of this License, they do not -excuse you from the conditions of this License. If you cannot convey a -covered work so as to satisfy simultaneously your obligations under this -License and any other pertinent obligations, then as a consequence you may -not convey it at all. For example, if you agree to terms that obligate you -to collect a royalty for further conveying from those to whom you convey -the Program, the only way you could satisfy both those terms and this -License would be to refrain entirely from conveying the Program. - - 13. Use with the GNU Affero General Public License. - - Notwithstanding any other provision of this License, you have -permission to link or combine any covered work with a work licensed -under version 3 of the GNU Affero General Public License into a single -combined work, and to convey the resulting work. The terms of this -License will continue to apply to the part which is the covered work, -but the special requirements of the GNU Affero General Public License, -section 13, concerning interaction through a network will apply to the -combination as such. - - 14. Revised Versions of this License. - - The Free Software Foundation may publish revised and/or new versions of -the GNU General Public License from time to time. Such new versions will -be similar in spirit to the present version, but may differ in detail to -address new problems or concerns. - - Each version is given a distinguishing version number. If the -Program specifies that a certain numbered version of the GNU General -Public License "or any later version" applies to it, you have the -option of following the terms and conditions either of that numbered -version or of any later version published by the Free Software -Foundation. If the Program does not specify a version number of the -GNU General Public License, you may choose any version ever published -by the Free Software Foundation. - - If the Program specifies that a proxy can decide which future -versions of the GNU General Public License can be used, that proxy's -public statement of acceptance of a version permanently authorizes you -to choose that version for the Program. - - Later license versions may give you additional or different -permissions. However, no additional obligations are imposed on any -author or copyright holder as a result of your choosing to follow a -later version. - - 15. Disclaimer of Warranty. - - THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY -APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT -HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY -OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, -THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM -IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF -ALL NECESSARY SERVICING, REPAIR OR CORRECTION. - - 16. Limitation of Liability. - - IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING -WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS -THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY -GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE -USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF -DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD -PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS), -EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF -SUCH DAMAGES. - - 17. Interpretation of Sections 15 and 16. - - If the disclaimer of warranty and limitation of liability provided -above cannot be given local legal effect according to their terms, -reviewing courts shall apply local law that most closely approximates -an absolute waiver of all civil liability in connection with the -Program, unless a warranty or assumption of liability accompanies a -copy of the Program in return for a fee. - - END OF TERMS AND CONDITIONS - - How to Apply These Terms to Your New Programs - - If you develop a new program, and you want it to be of the greatest -possible use to the public, the best way to achieve this is to make it -free software which everyone can redistribute and change under these terms. - - To do so, attach the following notices to the program. It is safest -to attach them to the start of each source file to most effectively -state the exclusion of warranty; and each file should have at least -the "copyright" line and a pointer to where the full notice is found. - - - Copyright (C) - - This program is free software: you can redistribute it and/or modify - it under the terms of the GNU General Public License as published by - the Free Software Foundation, either version 3 of the License, or - (at your option) any later version. - - This program is distributed in the hope that it will be useful, - but WITHOUT ANY WARRANTY; without even the implied warranty of - MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the - GNU General Public License for more details. - - You should have received a copy of the GNU General Public License - along with this program. If not, see . - -Also add information on how to contact you by electronic and paper mail. - - If the program does terminal interaction, make it output a short -notice like this when it starts in an interactive mode: - - Copyright (C) - This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'. - This is free software, and you are welcome to redistribute it - under certain conditions; type `show c' for details. - -The hypothetical commands `show w' and `show c' should show the appropriate -parts of the General Public License. Of course, your program's commands -might be different; for a GUI interface, you would use an "about box". - - You should also get your employer (if you work as a programmer) or school, -if any, to sign a "copyright disclaimer" for the program, if necessary. -For more information on this, and how to apply and follow the GNU GPL, see -. - - The GNU General Public License does not permit incorporating your program -into proprietary programs. If your program is a subroutine library, you -may consider it more useful to permit linking proprietary applications with -the library. If this is what you want to do, use the GNU Lesser General -Public License instead of this License. But first, please read -. diff --git a/vra/GlobAnalysis.cc b/vra/GlobAnalysis.cc deleted file mode 100644 index c965f297a..000000000 --- a/vra/GlobAnalysis.cc +++ /dev/null @@ -1,491 +0,0 @@ -/** -* @author Daniela Ďuričeková, xduric00@stud.fit.vutbr.cz -* @file GlobAnalysis.cc -* @brief Because for now only intra-procedural analysis is used, we need to -* recognize if a global variable can be changed in the program or not. -* @date 2013 -*/ - -#undef NDEBUG // It is necessary for using assertions. - -#include -#include -#include -#include - -#include "GlobAnalysis.h" -#include "Range.h" -#include "Number.h" -#include "Utility.h" -#include "OperandToMemoryPlace.h" - -using std::cout; -using std::endl; -using std::iterator; -using std::ostream; -using std::stack; -using std::set; - -using CodeStorage::Storage; -using CodeStorage::Fnc; -using CodeStorage::Block; -using CodeStorage::VarDb; -using CodeStorage::Var; -using CodeStorage::VAR_GL; -using CodeStorage::TTargetList; -using CodeStorage::Insn; -using CodeStorage::TOperandList; - -GlobAnalysis::GlobVarInit GlobAnalysis::globVarInit; -std::set GlobAnalysis::idOfGlobVarSet; -ValueAnalysis::MemoryPlaceToRangeMap GlobAnalysis::globVarMap; - -/** -* @brief Stores the unique id of all global variables used in the program -* represented by the model stored in @a stor. -*/ -void GlobAnalysis::storeGlobVar(const CodeStorage::Storage &stor) -{ - const VarDb &vars = stor.vars; - - for (const Var& var : vars) { - if (VAR_GL == var.code) { - GlobAnalysis::idOfGlobVarSet.insert(var.uid); - } - } -} - -/** -* @brief Initializes that none of the global variables can be modified. This will -* be changed after the analysis. -*/ -void GlobAnalysis::initGlobVar() -{ - for (int uid : GlobAnalysis::idOfGlobVarSet) { - GlobAnalysis::globVarInit[uid] = false; - } -} - -/** -* @brief Returns @c true if the variable identified by @a uid is global, @c false -* otherwise. -*/ -bool GlobAnalysis::isGlobal(int uid) -{ - return (GlobAnalysis::idOfGlobVarSet.find(uid) != - GlobAnalysis::idOfGlobVarSet.end()); -} - -/** -* @brief If the destination variable in @a insn is a global variable, this function -* sets that it is modified. -*/ -void GlobAnalysis::setIfModified(const Insn *insn) -{ - const TOperandList &opList = insn->operands; - const struct cl_operand &dest = opList[0]; // [0] - destination - - // On the left side must be variable. - if (dest.data.var != NULL) { - int uid = dest.data.var->uid; - if (isGlobal(uid)) { - GlobAnalysis::globVarInit[uid] = true; - } - } -} - -/** -* @brief Computes the glob analysis for the given instruction @a insn. -*/ -void GlobAnalysis::computeGlobAnalysisForInsn(const Insn *insn) -{ - const enum cl_insn_e code = insn->code; - - switch (code) { - case CL_INSN_UNOP: - case CL_INSN_BINOP: - case CL_INSN_CALL: - GlobAnalysis::setIfModified(insn); - break; - - default: - // CL_INSN_NOP, CL_INSN_JMP, CL_INSN_COND, CL_INSN_ABORT, CL_INSN_SWITCH - // CL_INSN_LABEL, CL_INSN_RET - break; - } -} - -/** -* @brief Computes the glob analysis for the given block @a block. -*/ -void GlobAnalysis::computeGlobAnalysisForBlock(const Block *block) -{ - for (const Insn *insn : *block) { - GlobAnalysis::computeGlobAnalysisForInsn(insn); - } -} - -/** -* @brief Computes the glob analysis for the given function @a fnc. -*/ -void GlobAnalysis::computeGlobAnalysisForFnc(const Fnc &fnc) -{ - // Schedulers. - stack todoStack; - set doneSet; - - const Block *entryBlock = fnc.cfg.entry(); - todoStack.push(entryBlock); - - while (!todoStack.empty()) { - const Block *block = todoStack.top(); - todoStack.pop(); - GlobAnalysis::computeGlobAnalysisForBlock(block); - doneSet.insert(block); - - // Gets the successors of the processed block. - const TTargetList &succs = block->targets(); - for (const TTargetList::value_type &succ : succs) { - if (doneSet.find(succ) == doneSet.end()) { - // We schedule successors of this block that were not processed - // before. - todoStack.push(succ); - } - } - } -} - -/** -* @brief Computes if the global variables can be modified by some function in the -* program stored in @a stor. -*/ -void GlobAnalysis::computeGlobAnalysis(const CodeStorage::Storage &stor) -{ - // Gets unique ids of all global variables. - GlobAnalysis::storeGlobVar(stor); - - // Sets that none of the global variables can be modified. This will be - // changed during analysis. - GlobAnalysis::initGlobVar(); - - for (const Fnc* pFnc : stor.fncs) { - const Fnc &fnc = *pFnc; - - if (!isDefined(fnc)) - continue; - - GlobAnalysis::computeGlobAnalysisForFnc(fnc); - } - - // Initializes the map storing ranges for global variables. - GlobAnalysis::initGlobVarMap(stor); -} - -/** -* @brief Return @c true if the global variable is modified in some function, @c false -* otherwise. -*/ -bool GlobAnalysis::isModified(int uid) -{ - return GlobAnalysis::globVarInit[uid]; -} - -/** -* @brief Emits the computed information about global variables. -*/ -ostream& GlobAnalysis::printGlobAnalysis(std::ostream &os) -{ - for (const ValueAnalysis::MemoryPlaceToRangeMap::value_type &g : - GlobAnalysis::globVarMap) { - os << g.first << ": " << g.second << endl; - } - return os; -} - -/** -* @brief Computes initial that is represented by unary instruction @a insn. -*/ -void GlobAnalysis::processInitialForUnop(const Insn *insn) -{ - // There are two operands for unary operations. - const TOperandList &opList = insn->operands; - const struct cl_operand &dst = opList[0]; // [0] - destination - const struct cl_operand &src = opList[1]; // [1] - source - - // Checks if left operand is valid. - assert(dst.code == CL_OPERAND_VAR); - - // Checks if right operand is valid. - assert(src.code == CL_OPERAND_CST); - - const enum cl_unop_e code = static_cast(insn->subCode); - - // Gets the destination memory place. - const MemoryPlace *dstVar = OperandToMemoryPlace::convert(&dst); - // Gets the source range. - Range srcRange = Range(Utility::convertOperandToNumber(&src)); - // This is used only to set the type of the result range. - // Necessary for correct behaviour of assign function from the Range class. - Range resultRange = Utility::getMaxRange(dst); - - switch (code) { - case CL_UNOP_ASSIGN: - // Assignment must be solved extra because of the assignment of - // the structure to another structure. - if (dstVar->representsElementOfArray()) { - // There is an array in this structure. - Range result = unite(GlobAnalysis::globVarMap[dstVar], srcRange); - resultRange = resultRange.assign(result); - } else { - // No array in this structure. - resultRange = resultRange.assign(srcRange); - } - break; - - case CL_UNOP_TRUTH_NOT: - // Truth negation. - resultRange = resultRange.assign(logicalNot(srcRange)); - break; - - case CL_UNOP_BIT_NOT: - // Bit negation. - resultRange = resultRange.assign(bitNot(srcRange)); - break; - - case CL_UNOP_MINUS: - // Unary minus. - resultRange = resultRange.assign(-srcRange); - break; - - case CL_UNOP_ABS: - // Absolute value. - resultRange = resultRange.assign(abs(srcRange)); - break; - - case CL_UNOP_FLOAT: - // Casting to float. - resultRange = resultRange.assign(intToFloat(srcRange)); - break; - - default: - assert(false && "Invalid insn->subCode in computeAnalysisorUnop()!"); - break; - } - // Setting the new range for destination. - GlobAnalysis::globVarMap[dstVar] = resultRange; -} - -/** -* @brief Computes initial that is represented by binary instruction @a insn. -*/ -void GlobAnalysis::processInitialForBinop(const Insn *insn) -{ - // There are three operands for binary operation. - const TOperandList &opList = insn->operands; - const struct cl_operand &dst = opList[0]; // [0] - destination - const struct cl_operand &src1 = opList[1]; // [1] - source 1 - const struct cl_operand &src2 = opList[2]; // [2] - source 2 - - // Checks if destination operand is valid. - assert(dst.code == CL_OPERAND_VAR); - MemoryPlace *dstVar = OperandToMemoryPlace::convert(&dst); - - // Checks if source operands are valid. - assert(src1.code == CL_OPERAND_CST); - assert(src2.code == CL_OPERAND_CST); - - // Gets the source ranges. - Range srcRange1 = Range(Utility::convertOperandToNumber(&src1)); - Range srcRange2 = Range(Utility::convertOperandToNumber(&src2)); - - // This is used only to set the type of the result range. - // Necessary for correct behaviour of assign function from the Range class. - Range resultRange = Utility::getMaxRange(dst); - - const enum cl_binop_e code = static_cast(insn->subCode); - - switch (code) { - case CL_BINOP_EQ: - // Equal. - resultRange = resultRange.assign(logicalEq(srcRange1, srcRange2)); - break; - - case CL_BINOP_NE: - // Unequal. - resultRange = resultRange.assign(logicalNeq(srcRange1, srcRange2)); - break; - - case CL_BINOP_LT: - // Less than. - resultRange = resultRange.assign(logicalLt(srcRange1, srcRange2)); - break; - - case CL_BINOP_GT: - // Greater than. - resultRange = resultRange.assign(logicalGt(srcRange1, srcRange2)); - break; - - case CL_BINOP_LE: - // Less or equal than. - resultRange = resultRange.assign(logicalLtEq(srcRange1, srcRange2)); - break; - - case CL_BINOP_GE: - // Greater or equal than - resultRange = resultRange.assign(logicalGtEq(srcRange1, srcRange2)); - break; - - case CL_BINOP_TRUTH_AND: - // Logical AND. - resultRange = resultRange.assign(logicalAnd(srcRange1, srcRange2)); - break; - - case CL_BINOP_TRUTH_OR: - // Logical OR. - resultRange = resultRange.assign(logicalOr(srcRange1, srcRange2)); - break; - - case CL_BINOP_TRUTH_XOR: - // Logical XOR. - resultRange = resultRange.assign(logicalXor(srcRange1, srcRange2)); - break; - - case CL_BINOP_PLUS: - // Addition. - resultRange = resultRange.assign(srcRange1 + srcRange2); - break; - - case CL_BINOP_MINUS: - // Subtraction. - resultRange = resultRange.assign(srcRange1 - srcRange2); - break; - - case CL_BINOP_MULT: - // Multiplication. - resultRange = resultRange.assign(srcRange1 * srcRange2); - break; - - case CL_BINOP_EXACT_DIV: - // Exact division of integral numbers. - resultRange = resultRange.assign(exact_div(srcRange1, srcRange2)); - break; - - case CL_BINOP_TRUNC_DIV: - // Division of integral numbers with the remainder. - resultRange = resultRange.assign(trunc_div(srcRange1, srcRange2)); - break; - - case CL_BINOP_TRUNC_MOD: - // Modulo of integral numbers. - resultRange = resultRange.assign(trunc_mod(srcRange1, srcRange2)); - break; - - case CL_BINOP_RDIV: - // Division of floating-point numbers. - resultRange = resultRange.assign(rdiv(srcRange1, srcRange2)); - break; - - case CL_BINOP_MIN: - // Min value. - resultRange = resultRange.assign(min(srcRange1, srcRange2)); - break; - - case CL_BINOP_MAX: - // Max value. - resultRange = resultRange.assign(max(srcRange1, srcRange2)); - break; - - case CL_BINOP_POINTER_PLUS: - // Pointer addition. - break; - - case CL_BINOP_BIT_AND: - // Bit AND. - resultRange = resultRange.assign(bitAnd(srcRange1, srcRange2)); - break; - - case CL_BINOP_BIT_IOR: - // Bit OR. - resultRange = resultRange.assign(bitOr(srcRange1, srcRange2)); - break; - - case CL_BINOP_BIT_XOR: - // Bit XOR. - resultRange = resultRange.assign(bitXor(srcRange1, srcRange2)); - break; - - case CL_BINOP_LSHIFT: - // Left shift. - resultRange = resultRange.assign(bitLeftShift(srcRange1, srcRange2)); - break; - - case CL_BINOP_RSHIFT: - // Right shift. - resultRange = resultRange.assign(bitRightShift(srcRange1, srcRange2)); - break; - - case CL_BINOP_LROTATE: - // Left rotate. - resultRange = resultRange.assign(bitLeftRotate(srcRange1, srcRange2)); - break; - - case CL_BINOP_RROTATE: - // Right rotate. - resultRange = resultRange.assign(bitRightRotate(srcRange1, srcRange2)); - break; - - default: - assert(false && "Invalid insn->subCode in computeAnalysisForBinop()!"); - break; - } - // Setting the new range for destination. - GlobAnalysis::globVarMap[dstVar] = resultRange; -} - -/** -* @brief Processes one initial for global variable. -*/ -void GlobAnalysis::processInitial(const Insn *insn) -{ - const enum cl_insn_e code = insn->code; - - switch (code) { - case CL_INSN_UNOP: - GlobAnalysis::processInitialForUnop(insn); - break; - - case CL_INSN_BINOP: - GlobAnalysis::processInitialForBinop(insn); - break; - - default: - // CL_INSN_NOP, CL_INSN_JMP, CL_INSN_COND, CL_INSN_ABORT, CL_INSN_SWITCH, - // CL_INSN_LABEL, CL_INSN_RET, CL_INSN_CALL: - assert(false && "Invalid insn->code"); - return; - } -} - -/** -* @brief Initializes the global variable map. -*/ -void GlobAnalysis::initGlobVarMap(const Storage &stor) -{ - for (int uid : GlobAnalysis::getGlobVar()) { - if (GlobAnalysis::isModified(uid)) { - // The global variable can be modified. There is no need to set - // anything. In every function, first using of this variable causes - // its setting to maximum. - } else { - // The global variable cannot be modified. The values are set according - // the initializers. - const VarDb &vars = stor.vars; - const Var &var = vars[uid]; - - for (const Insn* insn : var.initials) { - processInitial(insn); - } - } - } -} - diff --git a/vra/GlobAnalysis.h b/vra/GlobAnalysis.h deleted file mode 100644 index 498f69e2c..000000000 --- a/vra/GlobAnalysis.h +++ /dev/null @@ -1,73 +0,0 @@ -/** -* @author Daniela Ďuričeková, xduric00@stud.fit.vutbr.cz -* @file GlobAnalysis.h -* @brief Because for now only intra-procedural analysis is used, we need to -* recognize if a global variable can be changed in the program or not. -* @date 2013 -*/ - -#ifndef GUARD_GLOB_ANALYSIS_H -#define GUARD_GLOB_ANALYSIS_H - -#include -#include - -#include -#include -#include - -#include "ValueAnalysis.h" - -/** -* @brief Class recognizes global variables that can be modified by functions and -* global variables that cannot be modified by functions. -* -* It is important to know because of usage of intra-procedural analysis. -* If variable cannot be modified by functions, initializers of the global -* variable are used. Otherwise, it is over-approximated. -*/ -class GlobAnalysis { - public: - /// Type used for storing initialization info about global variables. - typedef std::map GlobVarInit; - - static void computeGlobAnalysis(const CodeStorage::Storage &stor); - static bool isGlobal(int uid); - static bool isModified(int uid); - static std::ostream& printGlobAnalysis(std::ostream &os); - - /// Returns the set of unique ids of all global variables. - static std::set getGlobVar() { return idOfGlobVarSet; } - - /// Returns the stored ranges for global variables. - static ValueAnalysis::MemoryPlaceToRangeMap getGlobVarMap() - { return globVarMap; } - - private: - /// Just for assurance that nobody will try to use it. - GlobAnalysis() { } - - /// Stores the ranges for global variables. - static ValueAnalysis::MemoryPlaceToRangeMap globVarMap; - - /// Stores the information about all global variables: @c true if variable - /// was initialized, @c false otherwise. - static GlobVarInit globVarInit; - - // Stored unique if of all global variables. - static std::set idOfGlobVarSet; - - static void initGlobVarMap(const CodeStorage::Storage &stor); - static void storeGlobVar(const CodeStorage::Storage &stor); - static void initGlobVar(); - static void computeGlobAnalysisForFnc(const CodeStorage::Fnc &fnc); - static void computeGlobAnalysisForBlock(const CodeStorage::Block *block); - static void computeGlobAnalysisForInsn(const CodeStorage::Insn *insn); - static void setIfModified(const CodeStorage::Insn *isns); - static void processInitial(const CodeStorage::Insn *insn); - static void processInitialForUnop(const CodeStorage::Insn *insn); - static void processInitialForBinop(const CodeStorage::Insn *insn); -}; - -#endif - diff --git a/vra/LoopFinder.cc b/vra/LoopFinder.cc deleted file mode 100644 index cee5349bf..000000000 --- a/vra/LoopFinder.cc +++ /dev/null @@ -1,1169 +0,0 @@ -/** -* @author Daniela Ďuričeková, xduric00@stud.fit.vutbr.cz -* @file LoopFinder.cc -* @brief Implementation of the class that computes for every block the upper -* limit that represents how many times loops will be entered. -* @date 2013 -*/ - -#undef NDEBUG // It is necessary for using assertions. - -#include -#include -#include -#include - -#include "LoopFinder.h" -#include "Utility.h" - -using CodeStorage::Block; -using CodeStorage::Fnc; -using CodeStorage::TTargetList; -using CodeStorage::Insn; -using CodeStorage::TOperandList; - -using std::ostream; -using std::endl; -using std::stack; -using std::set; -using std::vector; - -const unsigned long LoopFinder::MaxTripCountOfTheLoopBeforeStop = 1000; - -namespace { - bool lt(const Number &n1, const Number &n2) - { - return n1 < n2; - } - - bool gt(const Number &n1, const Number &n2) - { - return n1 > n2; - } - - bool lte(const Number &n1, const Number &n2) - { - return n1 <= n2; - } - - bool gte(const Number &n1, const Number &n2) - { - return n1 >= n2; - } -} - -LoopFinder::BlockToUpperLimit LoopFinder::blockToUpperLimit; - -/** -* @brief Checks if instruction @a insn modifies variable @a variable in the way -* we are able to used to compute loop trip count. -*/ -bool LoopFinder::addUnopInsn(const Insn *insn, const cl_operand *variable, - vector &insns) -{ - // There are two operands for unary operations. - const TOperandList &opList = insn->operands; - const struct cl_operand &dst = opList[0]; // [0] - destination - const struct cl_operand &src = opList[1]; // [1] - source - - if (variable->data.var->uid != dst.data.var->uid) { - // This instruction cannot change our variable. - return true; - } - - if (!((CL_OPERAND_CST == src.code) || - (variable->data.var->uid == src.data.var->uid) )) { - // Source operand can be only loop variable or constant. We have no - // information about other variables. - return false; - } - - insns.push_back(insn); - return true; -} - -/** -* @brief Checks if instruction @a insn modifies variable @a variable in the way -* we are able to used to compute loop trip count. -*/ -bool LoopFinder::addBinopInsn(const Insn *insn, const cl_operand *variable, - vector &insns) -{ - // There are three operands for unary operations. - const TOperandList &opList = insn->operands; - const struct cl_operand &dst = opList[0]; // [0] - destination - const struct cl_operand &src1 = opList[1]; // [1] - source - const struct cl_operand &src2 = opList[2]; // [2] - source - - if (variable->data.var->uid != dst.data.var->uid) { - // This instruction cannot change our variable. - return true; - } - - if (!((variable->data.var->uid == src1.data.var->uid) || - (CL_OPERAND_CST == src1.code))) { - // First source operand can be a variable or a constant. - return false; - } - - if (CL_OPERAND_CST != src2.code) { - // Second source operand can be only a constant. - return false; - } - insns.push_back(insn); - - return true; -} - -/** -* @brief We are not able to compute changes of loop variable @a variable if it -* gets the value from calling function. So, we only check if this calling -* instruction modifies our variable. -*/ -bool LoopFinder::addCallInsn(const Insn *insn, const cl_operand *variable) -{ - const TOperandList &opList = insn->operands; - const struct cl_operand &dst = opList[0]; // [0] - destination - return (variable != &dst); -} - -/** -* @brief Finds all relevant instructions and checks if they are helpful, which means -* that we can compute trip count of the loop that is representable by @a -* block. Relevant instructions has as a destination @a variable. -*/ -bool LoopFinder::findRelevantInsns(const Block *block, const cl_operand *variable, - vector &insns) -{ - BOOST_REVERSE_FOREACH(const Insn *insn, *block) { - switch (insn->code) { - case CL_INSN_NOP: - case CL_INSN_JMP: - case CL_INSN_COND: - case CL_INSN_RET: - case CL_INSN_ABORT: - case CL_INSN_SWITCH: - case CL_INSN_LABEL: - // We are not interested. - break; - - case CL_INSN_UNOP: - if (!LoopFinder::addUnopInsn(insn, variable, insns)) { - // If this instruction modifies our variable but in the way - // we are not able to use. - return false; - } - break; - - case CL_INSN_BINOP: - if (!LoopFinder::addBinopInsn(insn, variable, insns)) { - // If this instruction modifies our variable but in the way - // we are not able to use. - return false; - } - break; - - case CL_INSN_CALL: - if (!LoopFinder::addCallInsn(insn, variable)) { - // If this instruction modifies our variable but in the way - // we are not able to use. - return false; - } - break; - - default: - assert(false && "Invalid insn->code in findRelevantInsns()!"); - return false; - } - } - return true; -} - -/** -* @brief Computes how unary instruction @a insn affects the loop variable that -* starts on @a initialNum. -*/ -void LoopFinder::processUnop(const Insn *insn, Number &initialNum) -{ - const enum cl_unop_e code = static_cast(insn->subCode); - - // Gets the necessary information about instruction. - const TOperandList &opList = insn->operands; - // const struct cl_operand &dst = opList[0]; // [0] - destination - const struct cl_operand &src1 = opList[1]; // [1] - source 1 - - Number srcNum(0, sizeof(int), true); - - if (CL_OPERAND_VAR == src1.code) { - srcNum = initialNum; - } else if (CL_OPERAND_CST == src1.code) { - srcNum = Utility::convertOperandToNumber(&src1); - } - - switch (code) { - case CL_UNOP_ASSIGN: - // Assignment must be solved extra because of the assignment of - // the structure to another structure. - initialNum = initialNum.assign(srcNum); - return; - - case CL_UNOP_TRUTH_NOT: - // Truth negation. - initialNum = initialNum.assign( - Number(logicalNot(srcNum), sizeof(int), true)); - break; - - case CL_UNOP_BIT_NOT: - // Bit negation. - initialNum = initialNum.assign(bitNot(srcNum)); - break; - - case CL_UNOP_MINUS: - // Unary minus. - initialNum = initialNum.assign(-srcNum); - break; - - case CL_UNOP_ABS: - // Absolute value. - initialNum = initialNum.assign(abs(srcNum)); - break; - - case CL_UNOP_FLOAT: - // Casting to float. - initialNum = initialNum.assign(intToFloat(srcNum)); - break; - - default: - assert(false && "Invalid insn->subCode!"); - break; - } -} - -/** -* @brief Computes how binary instruction @a insn affects the loop variable that -* starts on @a initialNum. -*/ -bool LoopFinder::processBinop(const Insn *insn, Number &initialNum) -{ - const enum cl_binop_e code = static_cast(insn->subCode); - - // Gets the necessary information about instruction. - const TOperandList &opList = insn->operands; - // const struct cl_operand &dst = opList[0]; // [0] - destination - const struct cl_operand &src1 = opList[1]; // [1] - source 1 - const struct cl_operand &src2 = opList[2]; // [2] - source 2 - - Number src1Num(0, sizeof(int), true); - Number src2Num(0, sizeof(int), true); - - if (CL_OPERAND_VAR == src1.code) { - src1Num = initialNum; - } else if (CL_OPERAND_CST == src1.code) { - src1Num = Utility::convertOperandToNumber(&src1); - } - - if (CL_OPERAND_VAR == src2.code) { - src2Num = initialNum; - } else if (CL_OPERAND_CST == src2.code) { - src2Num = Utility::convertOperandToNumber(&src2); - } - - switch (code) { - case CL_BINOP_EQ: - // Equal. - initialNum = initialNum.assign( - Number(src1Num == src2Num, sizeof(int), true)); - break; - - case CL_BINOP_NE: - // Unequal. - initialNum = initialNum.assign( - Number(src1Num != src2Num, sizeof(int), true)); - break; - - case CL_BINOP_LT: - // Less than. - initialNum = initialNum.assign( - Number(src1Num < src2Num, sizeof(int), true)); - break; - - case CL_BINOP_GT: - // Greater than. - initialNum = initialNum.assign( - Number(src1Num > src2Num, sizeof(int), true)); - break; - - case CL_BINOP_LE: - // Less or equal than. - initialNum = initialNum.assign( - Number(src1Num <= src2Num, sizeof(int), true)); - break; - - case CL_BINOP_GE: - // Greater or equal than - initialNum = initialNum.assign( - Number(src1Num >= src2Num, sizeof(int), true)); - break; - - case CL_BINOP_TRUTH_AND: - // Logical AND. - initialNum = initialNum.assign( - Number(logicalAnd(src1Num, src2Num), sizeof(int), true)); - break; - - case CL_BINOP_TRUTH_OR: - // Logical OR. - initialNum = initialNum.assign( - Number(logicalOr(src1Num, src2Num), sizeof(int), true)); - break; - - case CL_BINOP_TRUTH_XOR: - // Logical XOR. - initialNum = initialNum.assign( - Number(logicalXor(src1Num, src2Num), sizeof(int), true)); - break; - - case CL_BINOP_PLUS: - // Addition. - initialNum = initialNum.assign(src1Num + src2Num); - break; - - case CL_BINOP_MINUS: - // Subtraction. - initialNum = initialNum.assign(src1Num - src2Num); - break; - - case CL_BINOP_MULT: - // Multiplication. - initialNum = initialNum.assign(src1Num * src2Num); - break; - - case CL_BINOP_EXACT_DIV: - // Exact division of integral numbers. - initialNum = initialNum.assign(exact_div(src1Num, src2Num)); - break; - - case CL_BINOP_TRUNC_DIV: - // Division of integral numbers with the remainder. - initialNum = initialNum.assign(trunc_div(src1Num, src2Num)); - break; - - case CL_BINOP_TRUNC_MOD: - // Modulo of integral numbers. - initialNum = initialNum.assign(trunc_mod(src1Num, src2Num)); - break; - - case CL_BINOP_RDIV: - // Division of floating-point numbers. - initialNum = initialNum.assign(rdiv(src1Num, src2Num)); - break; - - case CL_BINOP_MIN: - // Min value. - initialNum = initialNum.assign(min(src1Num, src2Num)); - break; - - case CL_BINOP_MAX: - // Max value. - initialNum = initialNum.assign(max(src1Num, src2Num)); - break; - - case CL_BINOP_POINTER_PLUS: - // Pointer addition. - break; - - case CL_BINOP_BIT_AND: - // Bit AND. - initialNum = initialNum.assign(bitAnd(src1Num, src2Num)); - break; - - case CL_BINOP_BIT_IOR: - // Bit OR. - initialNum = initialNum.assign(bitOr(src1Num, src2Num)); - break; - - case CL_BINOP_BIT_XOR: - // Bit XOR. - initialNum = initialNum.assign(bitXor(src1Num, src2Num)); - break; - - case CL_BINOP_LSHIFT: - // Left shift. - initialNum = initialNum.assign(bitLeftShift(src1Num, src2Num)); - break; - - case CL_BINOP_RSHIFT: - // Right shift. - initialNum = initialNum.assign(bitRightShift(src1Num, src2Num)); - break; - - case CL_BINOP_LROTATE: - // Left rotate. - return false; - - case CL_BINOP_RROTATE: - // Right rotate. - return false; - - default: - assert(false && "Invalid insn->subCode in computeAnalysisForBinop()!"); - break; - } - return true; -} - -/** -* @brief Computes loop trip count. The loop variable starts with the @a initial. -* The comparison of type is stored in @a type and @a initial is compared -* with @a constant. In the vector @a insns, instructions from the loop body -* are stored. -*/ -unsigned long LoopFinder::computeTripCountOfLoop(const cl_operand *variable, - const cl_operand *constant, const cl_operand *initial, const enum cl_binop_e type, - const vector &insns) -{ - if (insns.size() == 0) { - // There are no instructions changing loop variable. Probably infinite loop. - return 0; - } - - bool (*compare)(const Number &, const Number &); - // Set the type according the type of loop variable. - Number initialNum = Utility::convertOperandToNumber(variable); - initialNum = initialNum.assign(Utility::convertOperandToNumber(initial)); - Number constantNum = Utility::convertOperandToNumber(constant); - - switch (type) { - case CL_BINOP_LT: - compare = lt; - break; - - case CL_BINOP_GT: - compare = gt; - break; - case CL_BINOP_LE: - - compare = lte; - break; - - case CL_BINOP_GE: - compare = gte; - break; - - default: - compare = NULL; - assert(false); - break; - } - - // Maximal number of loop's execution. - unsigned long tripCount = 0; - - while (compare(initialNum, constantNum)) { - // We can afford compute this because it is really ambitious. - if (tripCount > LoopFinder::MaxTripCountOfTheLoopBeforeStop) { - return 0; - } - - for (const Insn* insn : insns) { - const enum cl_insn_e code = insn->code; - - // If there is not change between previous computation an new computation - // we have to stop. - Number prevNum = initialNum; - - switch (code) { - case CL_INSN_UNOP: - LoopFinder::processUnop(insn, initialNum); - break; - - case CL_INSN_BINOP: - if (!LoopFinder::processBinop(insn, initialNum)) { - // The operation was bit rotate. We are not able to handle it. - return 0; - } - break; - - default: - break; - } - - if (prevNum == initialNum) { - // We are not able to compute trip count. Infinite loop. - return 0; - } - } - ++tripCount; - } - - return tripCount; -} - -/** -* @brief Find initial value in the given block @a block for the variable @a variable -* and result stores in @a initial. -* -* @param[in] block Block in which we search for the initial value. -* @param[in] variable Variable for which we try to find initial value. -* @param[in] initial Found initial value. -* -* @return If initial value was found, @c true is returned. Otherwise, @c false is -* returned. -*/ -bool LoopFinder::findInitialValueForCondVar(const Block *block, - const cl_operand* variable, const cl_operand **initial) -{ - BOOST_REVERSE_FOREACH(const Insn *insn, *block) { - if (CL_INSN_UNOP == insn->code) { - // We need an unary operation. - const enum cl_unop_e subCode = static_cast(insn->subCode); - if (CL_UNOP_ASSIGN == subCode) { - // We need an assignment. - const TOperandList &opList = insn->operands; - const struct cl_operand &dst = opList[0]; // [0] - destination - const struct cl_operand &src = opList[1]; // [1] - source - if (dst.data.var->uid == variable->data.var->uid) { - if (CL_OPERAND_CST == src.code) { - // Constant assigned to the loop variable. - *initial = &src; - return true; - } - else { - // Variable assigned to the loop variable. - return false; - } - } - } - } - } - return false; -} - -/** -* @brief Processes the instruction that precede condition. It should be the -* computation for condition. -* -* @param[in] insn Condition instruction. -* @param[in] prevInsn Previous instruction to the condition. -* @param[out] variable Left operand from the comparison will be stored here. -* @param[out] constant Right operand from the comparison will be stored here. -* @param[out] type Type of the comparison will be stored here. -* -* @return If we were able to process the instruction @a prevInsn, then @c true -* is returned. Otherwise, @c false is returned. -*/ -bool LoopFinder::processPreviousInsn(const Insn *insn, const Insn *prevInsn, - const cl_operand **variable, const cl_operand **constant, enum cl_binop_e &type) -{ - if (prevInsn == NULL) { - // There is not previous instruction. - return false; - } - - // Gets the code of previous instruction. - const enum cl_insn_e prevCode = prevInsn->code; - if (prevCode != CL_INSN_BINOP) { - // The previous instruction must be binary operation. - return false; - } - - // Gets the sub-code of the previous instruction. - type = static_cast(prevInsn->subCode); - if ((type != CL_BINOP_LT) && (type != CL_BINOP_GT) && - (type != CL_BINOP_LE) && (type != CL_BINOP_GE)) { - // The previous instruction must comparison: <, >, <=, >=. - return false; - } - - // Gets the necessary information about previous instruction. - const TOperandList &opListPrev = prevInsn->operands; - const struct cl_operand &dst = opListPrev[0]; // [0] - destination - const struct cl_operand &src1 = opListPrev[1]; // [1] - source 1 - const struct cl_operand &src2 = opListPrev[2]; // [2] - source 2 - - if (src1.code != CL_OPERAND_VAR) { - // We need to have variable on the left side. - return false; - } - - if (src2.code != CL_OPERAND_CST) { - // We need to have constant on the right side. - return false; - } - - const TOperandList &opListCond = insn->operands; - const struct cl_operand &cond = opListCond[0]; // [0] - condition - - if (cond.data.var->uid != dst.data.var->uid) { - // Since insn represents condition, we need to find if the condition variable - // is identical with destination variable from the previous instruction. - return false; - } - - *variable = &src1; - *constant = &src2; - - return true; -} - -/** -* @brief Finds the condition in the given block @a block. We are able to process -* condition that have the following shape: (variable [<,>,<=,>=] constant). -* Variable on the left side must be user variable, not artificial one. -* -* @param[in] block Block in which we will search for the condition. -* @param[out] variable Left operand from the comparison will be stored here. -* @param[out] constant Right operand from the comparison will be stored here. -* @param[out] type Type of the comparison will be stored here. -* -* @return If condition is found, it returns @c true and appropriate variables are set. -* Otherwise, @c false is returned. -*/ -bool LoopFinder::checkCondition(const Block *block, const cl_operand **variable, - const cl_operand **constant, enum cl_binop_e &type) -{ - const Insn *prevInsn = NULL; - for (const Insn *insn : *block) { - if (CL_INSN_COND == insn->code) { - // We are not able to process previous instruction. - if (!LoopFinder::processPreviousInsn(insn, prevInsn, variable, - constant, type)) { - return false; - } - - // We need to have non-artificial variable on the left side. - if ((*variable)->data.var->artificial) { - return false; - } else { - return true; - } - } - prevInsn = insn; - } - - return false; -} - -/** -* @brief Sets the given value @a value for the given block @a block. -*/ -void LoopFinder::setValueForBlock(const Block *block, unsigned long value) -{ - LoopFinder::blockToUpperLimit[block] = value; -} - -/** -* @brief Computes the maximal number of loop's traverse, where condition for loop -* is stored in @a block. If this condition is evaluated as @c true, then -* the next block will be @a thenBlock. -*/ -void LoopFinder::computeLoopAnalysisForPatternWhile(const Block *block, - const Block *thenBlock) -{ - LoopFinder::setValueForBlock(block, 0); - - // Finds the previous block. We need to find that predecessor that is not - // block's successor. - const TTargetList &preds = block->inbound(); - const Block *prevBlock; - if (preds[0] != thenBlock) { - prevBlock = preds[0]; - } else { - prevBlock = preds[1]; - } - - // Checks if we can handle the condition in the given block. If can handle it, - // fill the appropriate variables. - const cl_operand* variable = NULL; - const cl_operand* constant = NULL; - enum cl_binop_e type; - if (!LoopFinder::checkCondition(block, &variable, &constant, type)) { - LoopFinder::setValueForBlock(thenBlock, 0); - return; - } - - // Finds the initial value for the variable. - const cl_operand* initial = NULL; - if (!LoopFinder::findInitialValueForCondVar(prevBlock, variable, &initial)) { - LoopFinder::setValueForBlock(thenBlock, 0); - return; - } - - // Finds if the instructions from thenBlock working with loop variable are - // computable for us. If they are, it creates an vector of relevant instructions. - vector insns; - if (!LoopFinder::findRelevantInsns(thenBlock, variable, insns)) { - LoopFinder::setValueForBlock(thenBlock, 0); - return; - } - - // Computes how many times loop will be executed. - unsigned long value = LoopFinder::computeTripCountOfLoop( - variable, constant, initial, type, insns); - LoopFinder::setValueForBlock(thenBlock, value); -} - -/** -* @brief Computes the maximal number of loop's traverse, where condition for loop -* is stored in @a block. If this condition is evaluated as @c true, then -* the next block will be @a ifBlock. -*/ -void LoopFinder::computeLoopAnalysisForPatternWhileIf(const Block *block, - const Block *ifBlock) -{ - LoopFinder::setValueForBlock(block, 0); - - const TTargetList &succsIf = ifBlock->targets(); - const Block *thenBlock = succsIf[0]; - const Block *elseBlock = succsIf[1]; - - // Finds the previous block. We need to find that predecessor that is not - // block's successor. It is the predecessor of the given block. - const TTargetList &preds = block->inbound(); - const Block *prevBlock; - if (preds[0] != elseBlock) { - prevBlock = preds[0]; - } else { - prevBlock = preds[1]; - } - - const cl_operand* variable = NULL; - const cl_operand* constant = NULL; - enum cl_binop_e type; - const cl_operand* initial = NULL; - vector insns; - if (!LoopFinder::checkCondition(block, &variable, &constant, type) || - // Checks if we can handle the condition in the given block. - !LoopFinder::findInitialValueForCondVar(prevBlock, variable, &initial) || - // Finds the initial value for the variable. - LoopFinder::blockModifiesVar(thenBlock, variable) || - // Checks if there is instruction modifying condition variable. - !LoopFinder::findRelevantInsns(ifBlock, variable, insns) || - !LoopFinder::findRelevantInsns(elseBlock, variable, insns) - // Finds if instructions working with loop variable are computable for us - ) { - LoopFinder::setValueForBlock(ifBlock, 0); - LoopFinder::setValueForBlock(thenBlock, 0); - LoopFinder::setValueForBlock(elseBlock, 0); - return; - } - - // Computes how many times loop will be executed. - unsigned long value = LoopFinder::computeTripCountOfLoop( - variable, constant, initial, type, insns); - LoopFinder::setValueForBlock(ifBlock, value); - LoopFinder::setValueForBlock(thenBlock, value); - LoopFinder::setValueForBlock(elseBlock, value); -} - -/** -* @brief Computes the maximal number of loop's traverse, where condition for loop -* is stored in @a block. If this condition is evaluated as @c true, then -* the next block will be @a ifBlock. -*/ -void LoopFinder::computeLoopAnalysisForPatternWhileIfElse(const Block *block, - const Block *ifBlock) -{ - LoopFinder::setValueForBlock(block, 0); - - const TTargetList &succsIf = ifBlock->targets(); - const Block *thenBlock = succsIf[0]; - const Block *elseBlock = succsIf[1]; - const Block *gotoBlock = (thenBlock->targets())[0]; - - // Finds the previous block. We need to find that predecessor that is not - // block's successor. It is the predecessor of the given block. - const TTargetList &preds = block->inbound(); - const Block *prevBlock; - if (preds[0] != gotoBlock) { - prevBlock = preds[0]; - } else { - prevBlock = preds[1]; - } - - const cl_operand* variable = NULL; - const cl_operand* constant = NULL; - enum cl_binop_e type; - const cl_operand* initial = NULL; - vector insns; - if (!LoopFinder::checkCondition(block, &variable, &constant, type) || - // Checks if we can handle the condition in the given block. - !LoopFinder::findInitialValueForCondVar(prevBlock, variable, &initial) || - // Finds the initial value for the variable. - LoopFinder::blockModifiesVar(thenBlock, variable) || - LoopFinder::blockModifiesVar(elseBlock, variable) || - // Checks if there is instruction modifying condition variable. - !LoopFinder::findRelevantInsns(ifBlock, variable, insns) || - !LoopFinder::findRelevantInsns(gotoBlock, variable, insns) - // Finds if instructions working with loop variable are computable for us - ) { - LoopFinder::setValueForBlock(ifBlock, 0); - LoopFinder::setValueForBlock(thenBlock, 0); - LoopFinder::setValueForBlock(elseBlock, 0); - LoopFinder::setValueForBlock(gotoBlock, 0); - return; - } - - // Computes how many times loop will be executed. - unsigned long value = LoopFinder::computeTripCountOfLoop( - variable, constant, initial, type, insns); - LoopFinder::setValueForBlock(ifBlock, value); - LoopFinder::setValueForBlock(thenBlock, value); - LoopFinder::setValueForBlock(elseBlock, value); - LoopFinder::setValueForBlock(gotoBlock, value); -} - -/** -* @brief Returns @c true if block @a block modifies variable @a variable. Otherwise, -* it return @c false. -*/ -bool LoopFinder::blockModifiesVar(const Block *block, const cl_operand *variable) -{ - for (const Insn *insn : *block) { - // Checks if this instruction can modify variable. - enum cl_insn_e code = insn->code; - if (CL_INSN_UNOP == code || CL_INSN_BINOP == code || CL_INSN_CALL == code) { - // Only these instructions use destination operand. - const TOperandList &opList = insn->operands; - const struct cl_operand &dst = opList[0]; // [0] - destination - assert(dst.data.var != NULL); - if (variable->data.var->uid == dst.data.var->uid) { - // This instruction changes our variable. - return true; - } - } - } - return false; // Variable cannot be modified in this block. -} - -/** -* @brief Returns @c true if the given @a block contains the condition that -* represents the entry point to the simple "while" loop. Otherwise, -* it return @c false. -*/ -bool LoopFinder::isPatternWhile(const Block *block, const Block *thenBlock) -{ - // Gets the predecessors and successors of the processed block. - const TTargetList &preds = block->inbound(); - const TTargetList &succs = block->targets(); - - if ((preds.size() != 2) || (succs.size() != 2)) { - // The processed block must have two predecessors and two successors for - // this loop pattern. - return false; - } - - if ((thenBlock != preds[0]) && (thenBlock != preds[1])) { - // Its successor from the if-then branch must be also its predecessor. - return false; - } - - // Gets the predecessors and successors of the if-then block. - const TTargetList &thenPreds = thenBlock->inbound(); - const TTargetList &thenSuccs = thenBlock->targets(); - - if ((thenPreds.size() != 1) || (thenSuccs.size() != 1)) { - // The if-then successor of the currently processed block must have only one - // predecessor and one successor. - return false; - } - - return true; -} - -/** -* @brief Returns @c true if the given block @a block represents a block with -* the condition for simple @c if statement. The last block of the -* @c if statement will be stored in @a gotoBlock. -*/ -bool LoopFinder::isPatternIf(const Block *block, const Block **gotoBlock) -{ - const Block *thenBlock = NULL; - const Block *elseBlock = NULL; - - for (const Insn *insn : *block) { - if (CL_INSN_COND == insn->code) { - // This instruction represents condition. Gets the targets. - const TTargetList &targets = insn->targets; - thenBlock = targets[0]; - elseBlock = targets[1]; - - const TTargetList &preds = block->inbound(); - const TTargetList &succs = block->targets(); - if ((preds.size() != 1) || (succs.size() != 2)) { - // The processed block must have one predecessor and two successors - // for this loop pattern. - return false; - } - - const TTargetList &thenPreds = thenBlock->inbound(); - const TTargetList &thenSuccs = thenBlock->targets(); - if ((thenPreds.size() != 1) || (thenSuccs.size() != 1)) { - // The processed block must have one predecessor and one successor - // for this loop pattern. - return false; - } - - if (thenSuccs[0] != elseBlock) { - return false; - } - - const TTargetList &elsePreds = elseBlock->inbound(); - const TTargetList &elseSuccs = elseBlock->targets(); - if ((elsePreds.size() != 2) || (elseSuccs.size() != 1)) { - // The processed block must have one predecessor and one successor - // for this loop pattern. - return false; - } - - *gotoBlock = elseBlock; - return true; - } - } - - return false; -} - -/** -* @brief Returns @c true if the given block @a block represents a block with -* the condition for simple @c if-else statement. The last block of the -* @c if-else statement will be stored in @a gotoBlock. -*/ -bool LoopFinder::isPatternIfElse(const Block *block, const Block **gotoBlock) -{ - const Block *thenBlock = NULL; - const Block *elseBlock = NULL; - - for (const Insn *insn : *block) { - if (CL_INSN_COND == insn->code) { - // This instruction represents condition. Gets the targets. - const TTargetList &targets = insn->targets; - thenBlock = targets[0]; - elseBlock = targets[1]; - - const TTargetList &preds = block->inbound(); - const TTargetList &succs = block->targets(); - if ((preds.size() != 1) || (succs.size() != 2)) { - // The processed block must have one predecessor and two successors - // for this loop pattern. - return false; - } - - const TTargetList &thenPreds = thenBlock->inbound(); - const TTargetList &thenSuccs = thenBlock->targets(); - if ((thenPreds.size() != 1) || (thenSuccs.size() != 1)) { - // The processed block must have one predecessor and one successor - // for this loop pattern. - return false; - } - - const TTargetList &elsePreds = elseBlock->inbound(); - const TTargetList &elseSuccs = elseBlock->targets(); - if ((elsePreds.size() != 1) || (elseSuccs.size() != 1)) { - // The processed block must have one predecessor and one successor - // for this loop pattern. - return false; - } - - if (thenSuccs[0] != elseSuccs[0]) { - // There is one successor for both blocks and it must be the same. - return false; - } - - *gotoBlock = thenSuccs[0]; - - const TTargetList &gotoPreds = (*gotoBlock)->inbound(); - const TTargetList &gotoSuccs = (*gotoBlock)->targets(); - if ((gotoPreds.size() != 2) || (gotoSuccs.size() != 1)) { - return false; - } - - if (gotoSuccs[0] != preds[0]) { - return false; - } - - return true; - } - } - - return false; -} - -/** -* @brief Returns @c true if the given @a block contains the condition that -* represents the entry point to the simple "while" loop with if statement. -* Otherwise, it return @c false. -*/ -bool LoopFinder::isPatternWhileIf(const Block *block, const Block *thenBlock) -{ - // Gets the predecessors and successors of the processed block. - const TTargetList &preds = block->inbound(); - const TTargetList &succs = block->targets(); - - if ((preds.size() != 2) || (succs.size() != 2)) { - // The processed block must have two predecessors and two successors for - // this loop pattern. - return false; - } - - const Block *gotoBlock; - if (!LoopFinder::isPatternIf(thenBlock, &gotoBlock)) { - return false; - } - - if ((gotoBlock != preds[0]) && (gotoBlock != preds[1])) { - // Its successor from the if-then branch must be also its predecessor. - return false; - } - - return true; -} - -/** -* @brief Returns @c true if the given @a block contains the condition that -* represents the entry point to the simple "while" loop with if-else statement. -* Otherwise, it return @c false. -*/ -bool LoopFinder::isPatternWhileIfElse(const Block *block, const Block *thenBlock) -{ - // Gets the predecessors and successors of the processed block. - const TTargetList &preds = block->inbound(); - const TTargetList &succs = block->targets(); - - if ((preds.size() != 2) || (succs.size() != 2)) { - // The processed block must have two predecessors and two successors for - // this loop pattern. - return false; - } - - const Block *gotoBlock; - if (!LoopFinder::isPatternIfElse(thenBlock, &gotoBlock)) { - return false; - } - - if ((gotoBlock != preds[0]) && (gotoBlock != preds[1])) { - // Its successor from the if-then branch must be also its predecessor. - return false; - } - return true; -} - -/** -* @brief If the given @a block contains condition instruction, then this function -* return the pointer to the block that will be executed after this condition -* is evaluated as @c true. Otherwise, it returns @c NULL. -*/ -const Block* LoopFinder::getThenBlock(const Block *block) -{ - for (const Insn *insn : *block) { - if (CL_INSN_COND == insn->code) { - // This instruction represents condition. Gets the targets. - const TTargetList &targets = insn->targets; - const Block *thenBlock = targets[0]; - return thenBlock; - } - } - return NULL; -} - -/** -* @brief Computes the loops' analysis for the given block @a block. It checks mostly -* used loops' patterns and compute the loop analysis for them. For other -* loops set the upper limit to zero which means that we do not know and -* this heuristic could not be used. -*/ -void LoopFinder::computeLoopAnalysisForBlock(const Block *block) -{ - const Block *thenBlock = getThenBlock(block); - if (thenBlock == NULL) { - // If this block does not contain condition, we are not interested in - // processing this block. - if (LoopFinder::blockToUpperLimit.find(block) == - LoopFinder::blockToUpperLimit.end()) { - LoopFinder::blockToUpperLimit[block] = 0; - } - return; - } - - if (LoopFinder::isPatternWhile(block, thenBlock)) { - LoopFinder::computeLoopAnalysisForPatternWhile(block, thenBlock); - } - - if (LoopFinder::isPatternWhileIf(block, thenBlock)) { - LoopFinder::computeLoopAnalysisForPatternWhileIf(block, thenBlock); - } - - if (LoopFinder::isPatternWhileIfElse(block, thenBlock)) { - LoopFinder::computeLoopAnalysisForPatternWhileIfElse(block, thenBlock); - } -} - -/** -* @brief Computes the loops' analysis for the given function @a fnc. -*/ -void LoopFinder::computeLoopAnalysisForFnc(const Fnc &fnc) -{ - // Schedulers. - stack todoStack; - set doneSet; - - const Block *entryBlock = fnc.cfg.entry(); - todoStack.push(entryBlock); - - while (!todoStack.empty()) { - const Block *block = todoStack.top(); - todoStack.pop(); - LoopFinder::computeLoopAnalysisForBlock(block); - doneSet.insert(block); - - // Gets the successors of the processed block. - const TTargetList &succs = block->targets(); - for (const TTargetList::value_type &succ : succs) { - if (doneSet.find(succ) == doneSet.end()) { - // We schedule successors of this block that were not processed - // before. - todoStack.push(succ); - } - } - } -} - -/** -* @brief Computes the loops' upper limits for the given representation of analysed -* program stored in @a stor. -*/ -void LoopFinder::computeLoopAnalysis(const CodeStorage::Storage &stor) -{ - for (const Fnc* pFnc : stor.fncs) { - const Fnc &fnc = *pFnc; - - if (!isDefined(fnc)) - continue; - - LoopFinder::computeLoopAnalysisForFnc(fnc); - } -} - -/** -* @brief Returns upper limit for the given @a block. -*/ -unsigned long LoopFinder::getUpperLimit(const Block *block) -{ - return LoopFinder::blockToUpperLimit[block]; -} - -/** -* @brief Emits the computed upper limits for each block into @a os. -*/ -ostream& LoopFinder::printLoopAnalysis(std::ostream &os) -{ - for (const BlockToUpperLimit::value_type &b : - LoopFinder::blockToUpperLimit) { - - // Prints information for each block. - os << b.first->name() << ": " << b.second - << std::endl; - } - return os; -} - diff --git a/vra/LoopFinder.h b/vra/LoopFinder.h deleted file mode 100644 index 013539fe8..000000000 --- a/vra/LoopFinder.h +++ /dev/null @@ -1,123 +0,0 @@ -/** -* @author Daniela Ďuričeková, xduric00@stud.fit.vutbr.cz -* @file LoopFinder.h -* @brief Class computes for every block the upper limit that represents how many -* times loops will be entered. -* @date 2013 -*/ - -#ifndef GUARD_LOOP_FOUNDER_H -#define GUARD_LOOP_FOUNDER_H - -#include -#include - -#include -#include -#include - -#include "Number.h" - -/** -* @brief Class computes the upper limit of loop evaluations. -* -* It means that for some types of loops, this class computes the number of loop -* repetitions. The computed upper limit is safe. In the case, that class is not able -* to compute this information or the block does not represent inner block the -* limit is set to zero. So, zero represents that we do not know how many times the -* block will be traversed or the block is not part of any loops. -*/ -class LoopFinder { - public: - /// Type for storing upper limits for each block; - typedef std::map BlockToUpperLimit; - - static unsigned long getUpperLimit(const CodeStorage::Block *block); - - static std::ostream& printLoopAnalysis(std::ostream &os); - - static void computeLoopAnalysis(const CodeStorage::Storage &stor); - - private: - static const unsigned long MaxTripCountOfTheLoopBeforeStop; - - /// Just for assurance that nobody will try to use it. - LoopFinder() { } - - /// For every block stores the upper limit. - static BlockToUpperLimit blockToUpperLimit; - - static void computeLoopAnalysisForFnc(const CodeStorage::Fnc &fnc); - - static void computeLoopAnalysisForBlock(const CodeStorage::Block *block); - - static const CodeStorage::Block* getThenBlock(const - CodeStorage::Block *block); - - static bool isPatternWhile(const CodeStorage::Block *block, - const CodeStorage::Block *thenBlock); - - static bool isPatternWhileIf(const CodeStorage::Block *block, - const CodeStorage::Block *thenBlock); - - static bool isPatternWhileIfElse(const CodeStorage::Block *block, - const CodeStorage::Block *thenBlock); - - static bool isPatternIf(const CodeStorage::Block *block, - const CodeStorage::Block **gotoBlock); - - static bool isPatternIfElse(const CodeStorage::Block *block, - const CodeStorage::Block **gotoBlock); - - static void computeLoopAnalysisForPatternWhile( - const CodeStorage::Block *block, - const CodeStorage::Block *thenBlock); - - static void computeLoopAnalysisForPatternWhileIf( - const CodeStorage::Block *block, - const CodeStorage::Block *ifBlock); - - static void computeLoopAnalysisForPatternWhileIfElse( - const CodeStorage::Block *block, - const CodeStorage::Block *thenBlock); - - static bool checkCondition(const CodeStorage::Block *block, - const cl_operand **variable, const cl_operand **constant, - enum cl_binop_e &type); - - static bool findInitialValueForCondVar(const CodeStorage::Block *block, - const cl_operand *variable, const cl_operand **initial); - - static bool processPreviousInsn(const CodeStorage::Insn *insn, - const CodeStorage::Insn *prevInsn, const cl_operand **variable, - const cl_operand **constant, enum cl_binop_e &type); - - static bool findRelevantInsns(const CodeStorage::Block *block, - const cl_operand *variable, std::vector &insns); - - static unsigned long computeTripCountOfLoop(const cl_operand *variable, - const cl_operand *constant, const cl_operand *initial, - const enum cl_binop_e type, - const std::vector &insns); - - static bool addUnopInsn(const CodeStorage::Insn *insn, - const cl_operand *variable, std::vector &insns); - - static bool addBinopInsn(const CodeStorage::Insn *insn, - const cl_operand *variable, std::vector &insns); - - static bool addCallInsn(const CodeStorage::Insn *insn, - const cl_operand *variable); - - static void setValueForBlock(const CodeStorage::Block *block, - unsigned long value); - - static void processUnop(const CodeStorage::Insn *insn, Number &initialNum); - - static bool processBinop(const CodeStorage::Insn *insn, Number &initialNum); - - static bool blockModifiesVar(const CodeStorage::Block *block, - const cl_operand *variable); -}; - -#endif diff --git a/vra/Makefile b/vra/Makefile deleted file mode 100644 index a75b8bd9f..000000000 --- a/vra/Makefile +++ /dev/null @@ -1,74 +0,0 @@ -# Copyright (C) 2013 Daniela Ďuričeková -# -# This file is part of value-range analyzer. -# -# Value-range analyzer is free software: you can redistribute it and/or modify -# it under the terms of the GNU General Public License as published by the Free -# Software Foundation, either version 3 of the License, or any later version. -# -# Value-range analyzer is distributed in the hope that it will be useful, but -# WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or -# FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for -# more details. -# -# You should have received a copy of the GNU General Public License along with -# the value-range analyzer. If not, see . - -CMAKE ?= cmake -CTEST ?= ctest - -.PHONY: all check check-unit check-overall clean cppcheck doc \ - distclean distcheck pack version.h - -all: version.h - $(MAKE) -C ../cl_build # make sure the libcl.so is up2date - mkdir -p ../vra_build - cd ../vra_build && $(CMAKE) -DCMAKE_BUILD_TYPE=Debug ../vra - $(MAKE) -C ../vra_build - -check-unit: - $(MAKE) -C tests-unit - cd tests-unit && ./run-all-unit-tests.sh - -check-overall: - $(MAKE) -C tests-overall - cd tests-overall && ./tests-run.sh - -check: all - $(MAKE) check-unit check-overall - -cppcheck: all - cppcheck --enable=style,performance,portability,information,missingInclude \ - --template gcc . - -doc: - $(MAKE) -C doc - -version.h: - @if test -e ../.git; then \ - printf "#define VRA_GIT_SHA1 \"%s\"\n" \ - `git log -1 | head -1 | cut -f2 -d" "` \ - | tee $@.tmp \ - && install -m0644 -C -v $@.tmp $@ \ - && rm -f $@.tmp; \ - fi - -clean: - if test -e ../.git; then rm -f version.h; fi - if test -e ../vra_build/Makefile; then \ - $(MAKE) clean -C ../vra_build; \ - fi - find . -name "a.out" -exec rm '{}' \; - $(MAKE) clean -C doc - $(MAKE) clean -C tests-overall - $(MAKE) clean -C tests-unit - -distclean: clean - rm -rf ../vra_build - -distcheck: distclean - $(MAKE) check - -pack: - $(MAKE) clean - tar -C ../ --exclude "*.tar.gz" -f vra-`date +"%Y-%m-%d"`.tar.gz -cvz vra diff --git a/vra/MemoryPlace.cc b/vra/MemoryPlace.cc deleted file mode 100644 index 3c8ae39c2..000000000 --- a/vra/MemoryPlace.cc +++ /dev/null @@ -1,27 +0,0 @@ -/** -* @author Daniela Ďuričeková, xduric00@stud.fit.vutbr.cz -* @file MemoryPlace.cc -* @brief Implementation of the class that represents all types of memory places. -* @date 2012 -*/ - -#include -#include "MemoryPlace.h" - -/** -* @brief Returns @c true if the current memory place represents an element of an -* array (it could be arbitrarily nested in structure), @c false otherwise. -*/ -bool MemoryPlace::representsElementOfArray() const -{ - // If the memory place represents an element of array, its name contains the - // string "[]". - size_t found = name.find("[]"); - - if (found == std::string::npos) { - return false; - } else { - return true; - } -} - diff --git a/vra/MemoryPlace.h b/vra/MemoryPlace.h deleted file mode 100644 index 478827d3a..000000000 --- a/vra/MemoryPlace.h +++ /dev/null @@ -1,40 +0,0 @@ -/** -* @author Daniela Ďuričeková, xduric00@stud.fit.vutbr.cz -* @file MemoryPlace.h -* @brief Class represents all types of memory places. -* @date 2012 -*/ - -#ifndef GUARD_MEMORY_PLACE_H -#define GUARD_MEMORY_PLACE_H - -#include - -/** -* @brief Class represents all types of memory places. -* -* This class represents the memory place, such as variable, item in a structure -* or element in an array. -*/ -class MemoryPlace { - private: - std::string name; - bool artificial; - - public: - /// Creates new memory place. - MemoryPlace(std::string name, bool artificial): name(name), - artificial(artificial) {} - - /// Returns the name of the memory place (as it is represented in a - // program). - std::string asString() const { return name; } - - /// Returns @c true if memory place was created by a compiler, @c false - /// otehrwise. - bool isArtificial() const { return artificial; } - - bool representsElementOfArray() const; -}; - -#endif diff --git a/vra/Number.cc b/vra/Number.cc deleted file mode 100644 index 9da80c265..000000000 --- a/vra/Number.cc +++ /dev/null @@ -1,1436 +0,0 @@ -/** -* @author Daniela Ďuričeková, xduric00@stud.fit.vutbr.cz -* @file Number.cc -* @brief Implementation of the class that represents a number that can be -* integral or floating-point type. -* @date 2012 -*/ - -#include -#include -#include -#include -#include -#include - -// Enable assertions. -#undef NDEBUG -#include - -#include "Number.h" - -using std::numeric_limits; -using std::ostringstream; -using std::string; -using std::ostream; -using std::pair; -using std::swap; - -namespace { - - /** - * @brief Converts the given value into a string. - * - * @tparam T Type of @a value. - */ - template - string toString(const T &value) { - std::ostringstream out; - out << value; - return out.str(); - } - -} - -/** -* @brief Constructs a new number from integral value. -* -* @param[in] value Instance of this class will represent this @a value. -* @param[in] width Bit width of the type that was used to store @a value. -* @param[in] sign Boolean flag specifies if the type is signed or unsigned. -*/ -Number::Number(Int value, unsigned width, bool sign) - :type(INT), intValue(value), sign(sign), bitWidth(width) -{ - setIntLimits(); - fitIntoBitWidth(); -} - -/** -* @brief Constructs a new number from floating-point value. -* -* @param[in] value Instance of this class will represent this @a value. -* @param[in] width Bit width of the type that was used to store @a value. -*/ -Number::Number(Float value, unsigned width) - :type(FLOAT), floatValue(value), bitWidth(width) -{ - setFloatLimits(); - fitIntoBitWidth(); -} - -/** -* @brief Returns a number that would resulted if @a n was assigned into the -* current number in C. -*/ -Number Number::assign(const Number &n) const -{ - Number result(*this); - if (result.isIntegral()) { - if (n.isIntegral()) { - result.intValue = n.intValue; - } else if (n.isFloatingPoint()) { - // The following C code - // - // double fs[] = {-INFINITY, -1e10, -100.0, 0.0, 100.0, 1e10, - // INFINITY, NAN}; - // for (size_t i = 0, e = sizeof(fs)/sizeof(fs[0]); i < e; ++i) { - // int n = fs[i]; - // printf("%le %d\n", fs[i], n); - // } - // - // emits (disregarding whitespace) - // - // -inf -2147483648 - // -1.0e+10 -2147483648 - // -1.0e+02 -100 - // 0.0e+00 0 - // 1.0e+02 100 - // 1.0e+10 -2147483648 - // inf -2147483648 - // nan -2147483648 - if (n.isNotNumber() || - n.floatValue < intToFloat(minIntLimit, isSigned()) || - n.floatValue > intToFloat(maxIntLimit, isSigned())) { - result.intValue = minIntLimit; - } else { - result.intValue = floatToInt(n.floatValue); - } - } - } else if (result.isFloatingPoint()) { - if (n.isIntegral()) { - result.floatValue = intToFloat(n.intValue, n.isSigned()); - } else if (n.isFloatingPoint()) { - result.floatValue = n.floatValue; - } - } - result.fitIntoBitWidth(); - return result; -} - -/** -* @brief Sets limits of an integral number. -*/ -void Number::setIntLimits() -{ - // According to the bitWidth finds out which type was used to store - // the value and computes the suitable limits. - if (sizeof(char) == bitWidth) { - // Signed char. - if (isSigned()) { - minIntLimit = numeric_limits::min(); - maxIntLimit = numeric_limits::max(); - } - // Unsigned char. - else { - minIntLimit = numeric_limits::min(); - maxIntLimit = numeric_limits::max(); - } - } else if (sizeof(short) == bitWidth) { - // Signed short int. - if (isSigned()) { - minIntLimit = numeric_limits::min(); - maxIntLimit = numeric_limits::max(); - } - // Unsigned short int. - else { - minIntLimit = numeric_limits::min(); - maxIntLimit = numeric_limits::max(); - } - } else if (sizeof(int) == bitWidth) { - // Signed int. - if (isSigned()) { - minIntLimit = numeric_limits::min(); - maxIntLimit = numeric_limits::max(); - } - // Unsigned int. - else { - minIntLimit = numeric_limits::min(); - maxIntLimit = numeric_limits::max(); - } - } else if (sizeof(long) == bitWidth) { - // Signed long int. - if (isSigned()) { - minIntLimit = numeric_limits::min(); - maxIntLimit = numeric_limits::max(); - } - // Unsigned long int. - else { - minIntLimit = numeric_limits::min(); - maxIntLimit = numeric_limits::max(); - } - } else { - std::cerr << bitWidth << "\n"; - // This should never happen. - assert(!"Provided bit width of the number does not correspond to bit" - "width of any integral type."); - } -} - -/** -* @brief Sets limits of a floating-point number. -*/ -void Number::setFloatLimits() -{ - // According to the bitWidth finds out which type was used to store - // the value and computes the suitable limits. - if (sizeof(float) == bitWidth) { - minFloatLimit = -numeric_limits::max(); - maxFloatLimit = numeric_limits::max(); - } else if (sizeof(double) == bitWidth) { - minFloatLimit = -numeric_limits::max(); - maxFloatLimit = numeric_limits::max(); - } else if (sizeof(long double) == bitWidth) { - minFloatLimit = -numeric_limits::max(); - maxFloatLimit = numeric_limits::max(); - } else { - // This should never happen. - assert(!"Provided bit width of the number does not correspond to bit" - "width of any floating-point type."); - } -} - -/** -* @brief Returns @c true if the number is an integer, @c false otherwise. -* -* Integers are @c char, @c short, @c int, and @c long. -*/ -bool Number::isIntegral() const { - return type == INT; -} - -/** -* @brief Returns @c true if the number is a floating-point, @c false otherwise. -* -* Floats are @c float, @c double, and @c long @c double. -*/ -bool Number::isFloatingPoint() const { - return type == FLOAT; -} - -/** -* @brief Returns @c true if the number is a signed integer, @c false otherwise. -*/ -bool Number::isSigned() const { - return isIntegral() && sign; -} - -/** -* @brief Returns @c true if the number is an unsigned integer, @c false otherwise. -*/ -bool Number::isUnsigned() const { - return isIntegral() && !sign; -} - -/** -* @brief Returns @c true for the floating-point number if this number represents -* negative or positive infinity, @c false otherwise. -*/ -bool Number::isInf() const -{ - return isFloatingPoint() && (isNegativeInf() || isPositiveInf()); -} - -/** -* @brief Returns @c true for the floating-point number if this number represents -* negative infinity, @c false otherwise. -*/ -bool Number::isNegativeInf() const -{ - // std::isinf() < 0 does not work as expected: - // long double minInf(-INFINITY); - // std::cout << std::isinf(minInf) << "\n"; // emits 1, not -1 - // - // The following solution also does not work. For minimal long double - // value, isinf() returns true but it should return false: - // std::cout << floatValue << std::endl; - // std::cout << isinf(floatValue) << std::endl; - // std::cout << (floatValue == -INFINITY) << std::endl; - // return isFloatingPoint() && isinf(floatValue) && floatValue < 0; - // - // The next solution works as expected. - return isFloatingPoint() && toString(floatValue) == toString(-INFINITY); -} - -/** -* @brief Returns @c true for the floating-point number if this number represents -* positive infinity, @c false otherwise. -*/ -bool Number::isPositiveInf() const -{ - // std::isinf() > 0 does not work as expected. - // long double minInf(-INFINITY); - // std::cout << std::isinf(minInf) << "\n"; // emits 1, not -1 - // - // The following solution also does not work. For maximal long double - // value, isinf() returns true but it should return false: - // std::cout << floatValue << std::endl; - // std::cout << isinf(floatValue) << std::endl; - // std::cout << (floatValue == INFINITY) << std::endl; - // return isFloatingPoint() && isinf(floatValue) && floatValue > 0; - // - // The next solution works as expected. - return isFloatingPoint() && toString(floatValue) == toString(INFINITY); -} - -/** -* @brief Returns @c true for the floating-point number if this number represents -* not a number, @c false otherwise. -*/ -bool Number::isNotNumber() const -{ - return isFloatingPoint() && isnan(floatValue); -} - -/** -* @brief Returns @c true if the current number is not positive/negative INFINITY or -* NAN, @c false otherwise. -*/ -bool Number::isNumber() const -{ - return !isPositiveInf() && !isNegativeInf() && !isNotNumber(); -} - -/** -* @brief Returns @c true if the number equals the minimal representable number -* on its bit width, @c false otherwise. -*/ -bool Number::isMin() const { - if (isIntegral()) { - return intValue == minIntLimit; - } else { // isFloatingPoint() - return floatValue == minFloatLimit; - } -} - -/** -* @brief Returns @c true if the number equals the maximal representable number -* on its bit width, @c false otherwise. -*/ -bool Number::isMax() const { - if (isIntegral()) { - return intValue == maxIntLimit; - } else { // isFloatingPoint() - return floatValue == maxFloatLimit; - } -} - -/** -* @brief Returns the smallest representable value for the current type. -* -* For integral numbers, it returns 1. For floating-point numbers, it returns -* @c std::numeric_limits<>::min(), e.g. 1.17549e-038 for @c float. -*/ -Number Number::getEpsilon() const { - if (isIntegral()) { - return Number(1, bitWidth, isSigned()); - } else { // isFloatingPoint() - if (bitWidth == sizeof(float)) { - return Number(std::numeric_limits::min(), bitWidth); - } else if (bitWidth == sizeof(double)) { - return Number(std::numeric_limits::min(), bitWidth); - } else { // bitWidth == sizeof(long double) - return Number(std::numeric_limits::min(), bitWidth); - } - } -} - -/** -* @brief Returns minimal limit as a number. -*/ -Number Number::getMin() const -{ - if (isIntegral()) { - return Number(minIntLimit, bitWidth, isSigned()); - } else { // isFloatingPoint() - return Number(minFloatLimit, bitWidth); - } -} - -/** -* @brief Returns maximal limit as a number. -*/ -Number Number::getMax() const -{ - if (isIntegral()) { - return Number(maxIntLimit, bitWidth, isSigned()); - } else { // isFloatingPoint() - return Number(maxFloatLimit, bitWidth); - } -} - -/** -* @brief Returns NAN as a number. -*/ -Number Number::getNan() const -{ - assert(isFloatingPoint()); - return Number(NAN, bitWidth); -} - -/** -* @brief Returns INFINITY as a number. -*/ -Number Number::getPositiveInf() const -{ - assert(isFloatingPoint()); - return Number(INFINITY, bitWidth); -} - -/** -* @brief Returns -INFINITY as a number. -*/ -Number Number::getNegativeInf() const -{ - assert(isFloatingPoint()); - return Number(-INFINITY, bitWidth); -} - -/** -* @brief Returns stored number as @c Int. -*/ -Number::Int Number::getInt() const -{ - assert(isIntegral()); - return intValue; -} - -/** -* @brief Returns stored number as @c Float. -*/ -Number::Float Number::getFloat() const -{ - assert(isFloatingPoint()); - return floatValue; -} - -/** -* @brief Returns the number of bytes of the current number's type. -*/ -unsigned Number::getBitWidth() const -{ - return bitWidth; -} - -/** -* @brief Returns the number of bits of the current number's type. -*/ -unsigned Number::getNumOfBits() const -{ - return bitWidth * CHAR_BIT; -} - -/** -* @brief Returns sign of the current number. -*/ -bool Number::getSign() const -{ - assert(isIntegral()); - return sign; -} - -/** -* @brief Performs integral promotion according to the C99 standard. -*/ -void Number::integralPromotion() -{ - if (isFloatingPoint()) - return; - - // It is guaranteed that the type of the number is INT. - if (bitWidth < sizeof(int)) { - bitWidth = sizeof(int); - sign = true; - setIntLimits(); - } -} - -/** -* @brief Sets new integral value. It is used after the conversion from signed -* integral type to the unsigned integral type. Setting value is performed -* according to the C99 standard. -*/ -void Number::convertSignedToUnsigned() -{ - if (intValue < 0) { - Int max = maxIntLimit + 1; - Int tmp = -(intValue / max) + 1; - intValue = intValue + tmp * max; - } -} - -/** -* @brief Extends operands of binary operation according to the C99 standard. -* -* @param[in] first The first operand that will be extended. -* @param[in] second The second operand that will be extended. -* -* @return The pair of extended operands. -*/ -pair Number::extensionByCRules(Number first, Number second) -{ - // It will be set to true if the numbers were swapped. - bool swaped = false; - - // Setting the number with bigger bit width to be the first one. From float - // and int number, the float number will be the first. If int numbers have - // equal bit widths, the unsigned number will be the first. - if (first.isFloatingPoint() && second.isFloatingPoint()) { - if (second.bitWidth > first.bitWidth) { - swap(first, second); - swaped = true; - } - } else if (first.isIntegral() && second.isIntegral()) { - if (second.bitWidth > first.bitWidth) { - swap(first, second); - swaped = true; - } else if (second.bitWidth == first.bitWidth) { - if (first.isSigned() && second.isUnsigned()) { - swap(first, second); - swaped = true; - } - } - } else if (second.isFloatingPoint()) { - swap(first, second); - swaped = true; - } - - if (first.isFloatingPoint()) { - // First, if the corresponding real type of either operand is long double, - // the other operand is converted, without change of type domain, to a type - // whose corresponding real type is long double. - // Otherwise, if the corresponding real type of either operand is double, - // the other operand is converted, without change of type domain, to a type - // whose corresponding real type is double. - // Otherwise, if the corresponding real type of either operand is float, - // the other operand is converted, without change of type domain, to a type - // whose corresponding real type is float. - if (second.isIntegral()) - second.floatValue = intToFloat(second.intValue, second.isSigned()); - second.type = first.type; - second.bitWidth = first.bitWidth; - second.setFloatLimits(); - } else if (first.isIntegral()) { - // Otherwise, the integer promotions are performed on both operands. - first.integralPromotion(); - second.integralPromotion(); - if (first.sign == second.sign) { - // Otherwise, if both operands have signed integer types or both - // have unsigned integer types, the operand with the type of lesser - // integer conversion rank is converted to the type of the operand - // with greater rank. - if (first.bitWidth > second.bitWidth) { - second.bitWidth = first.bitWidth; - second.setIntLimits(); - } - } else if (first.isUnsigned() && second.isSigned()) { - // Otherwise, if the operand that has unsigned integer type has rank - // greater or equal to the rank of the type of the other operand, - // then the operand with signed integer type is converted to the - // type of the operand with unsigned integer type. - second.bitWidth = first.bitWidth; - second.sign = false; - second.setIntLimits(); - second.convertSignedToUnsigned(); - } else if (first.isSigned() && second.isUnsigned()) { - // Otherwise, if the type of the operand with signed integer type - // can represent all of the values of the type of the operand with - // unsigned integer type, then the operand with unsigned integer - // type is converted to the type of the operand with signed integer - // type. - if (first.bitWidth > second.bitWidth) { - second.bitWidth = first.bitWidth; - second.sign = true; - second.setIntLimits(); - } else if (first.bitWidth == second.bitWidth) { - // Otherwise, both operands are converted to the unsigned - // integer type corresponding to the type of the operand with - // signed integer type. - first.sign = false; - first.setIntLimits(); - first.convertSignedToUnsigned(); - } - } - } - - // Check if extension went off without a hitch. - assert(first.type == second.type); - if (Number::INT == first.type) { - assert(first.bitWidth == second.bitWidth && first.sign == second.sign); - } else if (Number::FLOAT == first.type){ - assert(first.bitWidth == second.bitWidth); - } - - // According to the swapping, the pair of extended operands will be returned. - if (!swaped) - return pair(first, second); - else - return pair(second, first); -} - -/** -* @brief Converts the given floating-point number into an integer. -*/ -Number::Int Number::floatToInt(const Float &n) { - Int intNum; - mpf_class floatNum = mpf_class(toString(n)); - mpz_set_f(intNum.get_mpz_t(), floatNum.get_mpf_t()); - return intNum; -} - -/** -* @brief Converts the given integer into a floating-point number. -* -* @param n Integer to be converted. -* @param isSigned @c true if the integer is signed, @c false otherwise. -*/ -Number::Float Number::intToFloat(const Int &n, bool isSigned) { - if (isSigned) { - return Float(n.get_si()); - } else { - return Float(n.get_ui()); - } -} - -/** -* @brief According to the type of the number, converts its value to the predefined -* limits. -*/ -void Number::fitIntoBitWidth() -{ - if (isIntegral()) { - if (isSigned()) { - Int valuesInBitWidth = 2 * maxIntLimit + 2; - intValue -= minIntLimit; - if (intValue < 0) { - intValue += (-intValue / valuesInBitWidth + 1) * valuesInBitWidth; - } - intValue %= valuesInBitWidth; - intValue += minIntLimit; - } else { - convertSignedToUnsigned(); - intValue = intValue % (maxIntLimit + 1); - } - } else if (isFloatingPoint()) { - if (floatValue > maxFloatLimit) - floatValue = INFINITY; - else if (floatValue < minFloatLimit) - floatValue = -INFINITY; - } -} - -/** -* @brief Checks whether operands are equal. -* -* @param[in] num1 The first operand for comparison. -* @param[in] num2 The second operand for comparison. -* -* @return @c true if operands are equal, @c false otherwise -*/ -bool operator==(const Number& num1, const Number& num2) -{ - if (num1.isNotNumber() || num2.isNotNumber()) { - // If one operand represents NAN, then equality comparison - // gives false. - return false; - } - - pair result = Number::extensionByCRules(num1, num2); - Number &n1 = result.first; - Number &n2 = result.second; - - switch (n1.type) { - case Number::INT: - return n1.intValue == n2.intValue; - - case Number::FLOAT: - if (n1.isNegativeInf()) { - return n2.isNegativeInf(); - } else if (n1.isPositiveInf()) { - return n2.isPositiveInf(); - } else { - // Testing two floats should not be done simply by using ==. - // Instead, we say that two floats are equal if and only if - // their value differ at most by an epsilon (a small number). - // - // The inspiration for the below code is from - // http://www.parashift.com/c++-faq-lite/newbie.html#faq-29.17. - // - // See also Section 4.2 in - // [D. Knuth, The Art of Computer Programming, Volume II]. - return std::abs(n1.floatValue - n2.floatValue) <= - 1e-5 * std::abs(n1.floatValue); - } - - default: - // This should never happen. - assert(!"Unsupported type."); - return false; - } -} - -/** -* @brief Checks whether operands are not equal. -* -* @param[in] num1 The first operand for comparison. -* @param[in] num2 The second operand for comparison. -* -* @return @c true if operands are not equal, @c false otherwise -*/ -bool operator!=(const Number& num1, const Number& num2) -{ - return !(num1 == num2); -} - -/** -* @brief Checks whether the first operand is lower or equal than the second one. -* -* @param[in] num1 The first operand for comparison. -* @param[in] num2 The second operand for comparison. -* -* @return @c true if the first operand is lower or equal than the second one, -* @c false otherwise -*/ -bool operator<=(const Number& num1, const Number& num2) -{ - return (num1 < num2) || (num1 == num2); -} - -/** -* @brief Checks whether the first operand is greater or equal than the second one. -* -* @param[in] num1 The first operand for comparison. -* @param[in] num2 The second operand for comparison. -* -* @return @c true if the first operand is greater or equal than the second one, -* @c false otherwise -*/ -bool operator>=(const Number& num1, const Number& num2) -{ - return (num1 > num2) || (num1 == num2); -} - -/** -* @brief Checks whether the first operand is lower than the second one. -* -* @param[in] num1 The first operand for comparison. -* @param[in] num2 The second operand for comparison. -* -* @return @c true if the first operand is lower than the second one, @c false -* otherwise -*/ -bool operator<(const Number& num1, const Number& num2) -{ - if (num1.isNotNumber() || num2.isNotNumber()) { - // If one operand represents NAN, then equality comparison - // gives false. - return false; - } - - pair result = Number::extensionByCRules(num1, num2); - Number &n1 = result.first; - Number &n2 = result.second; - - switch (n1.type) { - case Number::INT: - return n1.intValue < n2.intValue; - - case Number::FLOAT: - return n1.floatValue < n2.floatValue; - - default: - // This should never happen. - assert(!"Unsupported type."); - return false; - } -} - -/** -* @brief Checks whether the first operand is greater than the second one. -* -* @param[in] num1 The first operand for comparison. -* @param[in] num2 The second operand for comparison. -* -* @return @c true if the first operand is greater than the second one, @c false -* otherwise -*/ -bool operator>(const Number& num1, const Number& num2) -{ - if (num1.isNotNumber() || num2.isNotNumber()) { - // If one operand represents NAN, then equality comparison - // gives false. - return false; - } - - pair result = Number::extensionByCRules(num1, num2); - Number &n1 = result.first; - Number &n2 = result.second; - - switch (n1.type) { - case Number::INT: - return n1.intValue > n2.intValue; - - case Number::FLOAT: - return n1.floatValue > n2.floatValue; - - default: - // This should never happen. - assert(!"Unsupported type."); - return false; - } -} - -/** -* @brief Unary minus of the number. -* -* @param[in] op The first operand. -* -* @return Unary minus of @a op. -* -* Special cases that are handled: @code -* -INF = -INF -* -(-INF) = INF -* -NAN = -NAN -* -(-NAN) = NAN @endcode -*/ -Number operator-(const Number& op) -{ - Number result = op; - if (result.isIntegral()) { - // For INT-type numbers. - result.integralPromotion(); - result.intValue = -result.intValue; - // If op is unsigned then after unary minus it is still unsigned. - result.fitIntoBitWidth(); - } else if (result.isFloatingPoint()) { - // For FLOAT-type numbers. - result.floatValue = -result.floatValue; - } - return result; -} - -/** -* @brief Adds two numbers. -* -* @param[in] op1 The first operand. -* @param[in] op2 The second operand. -* -* @return The sum of @a op1 and @a op2. -* -* Special cases that are handled: @code -* INF + INF = INF -* INF + (-INF) = -NAN -* INF + NAN = NAN -* INF + number = INF -* -INF + INF = -NAN -* -INF + (-INF) = -INF -* -INF + NAN = NAN -* -INF + number = -INF -* NAN + INF = NAN -* NAN + (-INF) = NAN -* NAN + NAN = NAN -* NAN + number = NAN -* number + INF = INF -* number + (-INF) = -INF -* number + NAN = NAN @endcode -*/ -Number operator+(const Number& op1, const Number& op2) -{ - // Extension of the operands. - pair r = Number::extensionByCRules(op1, op2); - Number &n1 = r.first; - Number &n2 = r.second; - - if (n1.isIntegral() && n2.isIntegral()) { - Number::Int newValue = n1.intValue + n2.intValue; - Number result(newValue, n1.bitWidth, n1.sign); - result.fitIntoBitWidth(); - return result; - } else if (n1.isFloatingPoint() && n2.isFloatingPoint()) { - Number::Float newValue = n1.floatValue + n2.floatValue; - Number result(newValue, n1.bitWidth); - result.fitIntoBitWidth(); - return result; - } else { - // This should never happen. - assert(!"Unsupported combination of types."); - return Number(0, sizeof(char)); - } -} - -/** -* @brief Subtracts two numbers. -* -* @param[in] op1 The first operand. -* @param[in] op2 The second operand. -* -* @return The difference between @a op1 and @a op2. -* -* Special cases that are handled: @code -* INF - INF = -NAN -* INF - (-INF) = INF -* INF - NAN = NAN -* INF - number = INF -* -INF - INF = -INF -* -INF - (-INF) = -NAN -* -INF - NAN = NAN -* -INF - number = -INF -* NAN - INF = NAN -* NAN - (-INF) = NAN -* NAN - NAN = NAN -* NAN - number = NAN -* number - INF = -INF -* number - (-INF) = INF -* number - NAN = NAN @endcode -*/ -Number operator-(const Number& op1, const Number& op2) -{ - // Extension of the operands. - pair r = Number::extensionByCRules(op1, op2); - Number &n1 = r.first; - Number &n2 = r.second; - - if (n1.isIntegral() && n2.isIntegral()) { - Number::Int newValue = n1.intValue - n2.intValue; - Number result(newValue, n1.bitWidth, n1.sign); - result.fitIntoBitWidth(); - return result; - } else if (n1.isFloatingPoint() && n2.isFloatingPoint()) { - Number::Float newValue = n1.floatValue - n2.floatValue; - Number result(newValue, n1.bitWidth); - result.fitIntoBitWidth(); - return result; - } else { - // This should never happen. - assert(!"Unsupported combination of types."); - return Number(0, sizeof(char)); - } -} - -/** -* @brief Multiplies two numbers. -* -* @param[in] op1 The first operand. -* @param[in] op2 The second operand. -* -* @return The result of multiplication of @a op1 and @a op2. -* -* Special cases that are handled: @code -* INF * INF = INF -* INF * (-INF) = -INF -* INF * NAN = NAN -* INF * number = INF -* -INF * INF = -INF -* -INF * (-INF) = INF -* -INF * NAN = NAN -* -INF * number = -INF -* NAN * INF = NAN -* NAN * (-INF) = NAN -* NAN * NAN = NAN -* NAN * number = NAN -* number * INF = INF -* number * (-INF) = -INF -* number * NAN = NAN @endcode -*/ -Number operator*(const Number& op1, const Number& op2) -{ - // Extension of the operands. - pair r = Number::extensionByCRules(op1, op2); - Number &n1 = r.first; - Number &n2 = r.second; - - if (n1.isIntegral() && n2.isIntegral()) { - Number::Int newValue = n1.intValue * n2.intValue; - Number result(newValue, n1.bitWidth, n1.sign); - result.fitIntoBitWidth(); - return result; - } else if (n1.isFloatingPoint() && n2.isFloatingPoint()) { - Number::Float newValue = n1.floatValue * n2.floatValue; - Number result(newValue, n1.bitWidth); - result.fitIntoBitWidth(); - return result; - } else { - // This should never happen. - assert(!"Unsupported combination of types."); - return Number(0, sizeof(char)); - } -} - -/** -* @brief Performs division of two real numbers. -* -* @param[in] op1 The first operand. -* @param[in] op2 The second operand. -* -* @return The result of division of @a op1 and @a op2. -* -* Special cases that are handled: @code -* INF / INF = -NAN -* INF / (-INF) = -NAN -* INF / NAN = NAN -* INF / number = INF -* -INF / INF = -NAN -* -INF / (-INF) = -NAN -* -INF / NAN = NAN -* -INF / number = -INF -* NAN / INF = NAN -* NAN / (-INF) = NAN -* NAN / NAN = NAN -* NAN / number = NAN -* number / INF = 0 -* number / (-INF) = -0 -* number / NAN = NAN -* +number / 0 = INF -* -number / 0 = -INF -* +number / -0 = -INF -* -number / -0 = INF -* 0 / 0 = NAN @endcode -*/ -Number rdiv(const Number& op1, const Number& op2) -{ - // Extension of the operands. - pair r = Number::extensionByCRules(op1, op2); - Number &n1 = r.first; - Number &n2 = r.second; - - // This division works only for floating-point numbers. - assert(n1.isFloatingPoint() && n2.isFloatingPoint()); - - Number::Float newValue = n1.floatValue / n2.floatValue; - Number result(newValue, n1.bitWidth); - result.fitIntoBitWidth(); - - return result; -} - -/** -* @brief Performs division of two numbers where there is no remainder. -* -* @param[in] op1 The first operand. -* @param[in] op2 The second operand. -* -* @return The result of division of @a op1 and @a op2. -*/ -Number exact_div(const Number& op1, const Number& op2) -{ - // This division works only for integral numbers. - assert(op1.isIntegral() && op2.isIntegral()); - - // Extension of the operands. - pair r = Number::extensionByCRules(op1, op2); - Number &n1 = r.first; - Number &n2 = r.second; - - Number::Int newValue = n1.intValue / n2.intValue; - Number result(newValue, n1.bitWidth, n1.sign); - result.fitIntoBitWidth(); - - return result; -} - -/** -* @brief According to the @a isMod flag, it performs modulo or integral division. -* -* @param[in] op1 The first operand. -* @param[in] op2 The second operand. -* @param[in] isMod @c true means performing modulo operation, @c false means -* performing integral division. -* -* @return If @a isMod flag is set to @c true then the result is modulo of @a op1 -* and @a op2; otherwise the result is integral division of @a op1 and -* @a op2. -*/ -Number Number::performTrunc(const Number &op1, const Number& op2, bool isMod) -{ - // This should work only for integral numbers. - assert(op1.isIntegral() && op2.isIntegral()); - - // Extension of the operands. - pair r = Number::extensionByCRules(op1, op2); - Number &n1 = r.first; - Number &n2 = r.second; - - // Performs operation on the C integral type. - Number::Int res; - if ((sizeof(int) == n1.bitWidth)) { - if (n1.isSigned()) { - int oper1, oper2; - oper1 = mpz_get_si(n1.intValue.get_mpz_t()); - oper2 = mpz_get_si(n2.intValue.get_mpz_t()); - if (isMod) { - // Computes modulo. - res = oper1 % oper2; - } else { - // Computes integral division. - res = oper1 / oper2; - } - } else { - unsigned oper1, oper2; - oper1 = mpz_get_ui(n1.intValue.get_mpz_t()); - oper2 = mpz_get_ui(n2.intValue.get_mpz_t()); - if (isMod) { - // Computes modulo. - res = oper1 % oper2; - } else { - // Computes integral division. - res = oper1 / oper2; - } - } - } else if ((sizeof(long) == n1.bitWidth)) { - if (n1.isSigned()) { - long oper1, oper2; - oper1 = mpz_get_si(n1.intValue.get_mpz_t()); - oper2 = mpz_get_si(n2.intValue.get_mpz_t()); - if (isMod) { - // Computes modulo. - res = oper1 % oper2; - } else { - // Computes integral division. - res = oper1 / oper2; - } - } else { - unsigned long oper1, oper2; - oper1 = mpz_get_ui(n1.intValue.get_mpz_t()); - oper2 = mpz_get_ui(n2.intValue.get_mpz_t()); - if (isMod) { - // Computes modulo. - res = oper1 % oper2; - } else { - // Computes integral division. - res = oper1 / oper2; - } - } - } - - Number result = Number(res, n1.bitWidth, n1.sign); - result.fitIntoBitWidth(); - return result;; -} - -/** -* @brief Performs integer division. The result is rounded to zero. -* -* @param[in] op1 The first operand. -* @param[in] op2 The second operand. -* -* @return The result of division of @a op1 and @a op2. -*/ -Number trunc_div(const Number& op1, const Number& op2) -{ - return Number::performTrunc(op1, op2, false); -} - -/** -* @brief Performs modulo. -* -* @param[in] op1 The first operand. -* @param[in] op2 The second operand. -* -* @return The result of modulo of @a op1 and @a op2. -*/ -Number trunc_mod(const Number& op1, const Number& op2) -{ - return Number::performTrunc(op1, op2, true); -} - -/** -* @brief Converts the instance of @c Number to @c bool. -*/ -bool Number::toBool() const -{ - if (isIntegral()) { - return intValue != 0; - } else { // isFloatingPoint() - // To prevent a warning saying that floats should not be compared by - // using ==, convert it first to bool and return that bool. - bool asBool = floatValue; - return asBool; - } -} - -/** -* @brief Performs logical @c not on @a op. -*/ -bool logicalNot(const Number& op) -{ - return !op.toBool(); -} - -/** -* @brief Performs logical @c and on @a op1 and @a op2. -*/ -bool logicalAnd(const Number& op1, const Number& op2) -{ - return op1.toBool() && op2.toBool(); -} - -/** -* @brief Performs logical @c or on @a op1 and @a op2. -*/ -bool logicalOr(const Number& op1, const Number& op2) -{ - return op1.toBool() || op2.toBool(); -} - -/** -* @brief Performs logical @c xor on @a op1 and @a op2. -*/ -bool logicalXor(const Number& op1, const Number& op2) -{ - return logicalOr(op1, op2) && !logicalAnd(op1, op2); -} - -/** -* @brief Performs bit @c not on @a op. -*/ -Number bitNot(const Number& op) -{ - // Bitwise operations are performed only on integral numbers. - assert(op.isIntegral()); - - Number promotedOp = op; - promotedOp.integralPromotion(); - Number::Int result; - mpz_com(result.get_mpz_t(), promotedOp.intValue.get_mpz_t()); - - return Number(result, promotedOp.bitWidth, promotedOp.sign); -} - -/** -* @brief Performs binary bit operation. Parameter @a mode determines which one -* will be performed. -* -* @param[in] op1 The first operand. -* @param[in] op2 The second operand. -* @param[in] mode @c 'A' means bit @c and, @c 'O' means bit @c or and @c 'X' means -* bit @c xor. -* -* @return Result of binary bit operation specified by @a mode performed on -* @a op1 and @a op2. -*/ -Number Number::performBitOp(const Number &op1, const Number &op2, char mode) -{ - // Bitwise operations are performed only on integral numbers. - assert(op1.isIntegral() && op2.isIntegral()); - - // Extension of the operands. - pair r = Number::extensionByCRules(op1, op2); - Number &n1 = r.first; - Number &n2 = r.second; - - Number::Int res; - switch (mode) { - case 'A': - // Performs bit and. - mpz_and(res.get_mpz_t(), n1.intValue.get_mpz_t(), - n2.intValue.get_mpz_t()); - break; - - case 'O': - // Performs bit or. - mpz_ior(res.get_mpz_t(), n1.intValue.get_mpz_t(), - n2.intValue.get_mpz_t()); - break; - - case 'X': - // Performs bit xor. - mpz_xor(res.get_mpz_t(), n1.intValue.get_mpz_t(), - n2.intValue.get_mpz_t()); - break; - } - - return Number(res, n1.bitWidth, n1.sign); -} - -/** -* @brief Performs bit @c and on @a op1 and @a op2. -*/ -Number bitAnd(const Number& op1, const Number& op2) -{ - return Number::performBitOp(op1, op2, 'A'); -} - -/** -* @brief Performs bit @c or on @a op1 and @a op2. -*/ -Number bitOr(const Number& op1, const Number& op2) -{ - return Number::performBitOp(op1, op2, 'O'); -} - -/** -* @brief Performs bit @c xor on @a op1 and @a op2. -*/ -Number bitXor(const Number& op1, const Number& op2) -{ - return Number::performBitOp(op1, op2, 'X'); -} - -/** -* @brief According to @a isLeft, it performs left or right shift on @a op1 and @a op2. -*/ -Number Number::performShift(Number op1, Number op2, bool isLeft) -{ - // Bit left shift is performed only on integral numbers. - assert(op1.isIntegral() && op2.isIntegral()); - - // Bit shifts are performed only if the second operand is non-negative. - // This is not true for the C language. Thus, approximation must be used in - // the Range class. - assert(op2.intValue >= 0); - - // Extension of the operands. - op1.integralPromotion(); - op2.integralPromotion(); - - // Bit shift is performed only if op2 is lower than the number of bits of - // the op1's type. This is not true for the C language. Thus, approximation - // is used in the Range class. It must be after integralPromotion()! - assert(op1.bitWidth * CHAR_BIT > op2.intValue); - - // Shift are not defined for Int, so we have to use left shift from C. - // We have to store Int values into C types. - Number::Int res; - if ((sizeof(int) == op1.bitWidth)) { - if (op1.isSigned()) { - int signedOP1, signedOP2; - signedOP1 = mpz_get_si(op1.intValue.get_mpz_t()); - signedOP2 = mpz_get_si(op2.intValue.get_mpz_t()); - res = isLeft ? (signedOP1 << signedOP2) : (signedOP1 >> signedOP2); - } else { - unsigned signedOP1, signedOP2; - signedOP1 = mpz_get_ui(op1.intValue.get_mpz_t()); - signedOP2 = mpz_get_ui(op2.intValue.get_mpz_t()); - res = isLeft ? (signedOP1 << signedOP2) : (signedOP1 >> signedOP2); - } - } else if ((sizeof(long) == op1.bitWidth)) { - if (op1.isSigned()) { - long signedOP1, signedOP2; - signedOP1 = mpz_get_si(op1.intValue.get_mpz_t()); - signedOP2 = mpz_get_si(op2.intValue.get_mpz_t()); - res = isLeft ? (signedOP1 << signedOP2) : (signedOP1 >> signedOP2); - } else { - unsigned long signedOP1, signedOP2; - signedOP1 = mpz_get_ui(op1.intValue.get_mpz_t()); - signedOP2 = mpz_get_ui(op2.intValue.get_mpz_t()); - res = isLeft ? (signedOP1 << signedOP2) : (signedOP1 >> signedOP2); - } - } - - Number result = Number(res, op1.bitWidth, op1.sign); - result.fitIntoBitWidth(); - return result; -} - -/** -* @brief Performs bit left shift on @a op1 and @a op2. -* -* Preconditions: -* - @a op1 and @a op2 are integral numbers -* - @a op2 is non-negative number -* - @a op2 is lower than @c op1.bitWidth -*/ -Number bitLeftShift(const Number& op1, const Number& op2) -{ - return Number::performShift(op1, op2, true); -} - -/** -* @brief Performs bit right shift on @a op1 and @a op2. -* -* Preconditions: -* - @a op1 and @a op2 are integral numbers -* - @a op2 is non-negative number -* - @a op2 is lower than @c op1.bitWidth -*/ -Number bitRightShift(const Number& op1, const Number& op2) -{ - return Number::performShift(op1, op2, false); -} - -/** -* @brief Gets absolute value of @a op. The given @a op has to be signed integral -* type. Code Listener does not generate @c abs instruction for unsigned -* integral type or floating type. Code Listener also performs integral -* promotion. So, we do not use @c integralPromotion() function. -*/ -Number abs(const Number& op) -{ - assert(op.isIntegral() && op.isSigned()); - - // Remember that in the C language holds abs(min) == min. - return (op.intValue >= 0 ? op : -op); -} - -/** -* @brief Converts @a op from integral type to floating-point type. -* -* Preconditions: -* - @a op is integral type -*/ -Number intToFloat(const Number& op) -{ - assert(op.isIntegral()); - if (op.sign) { - return Number((float) mpz_get_si(op.intValue.get_mpz_t()), sizeof(float)); - } else { - return Number((float) mpz_get_ui(op.intValue.get_mpz_t()), sizeof(float)); - } -} - -/** -* @brief Gets the minimum from @a op1 and @a op2. -*/ -Number min(const Number &op1, const Number &op2) -{ - // Extension of the operands. - pair r = Number::extensionByCRules(op1, op2); - Number &n1 = r.first; - Number &n2 = r.second; - - if (n1 <= n2) { - return n1; - } else { - return n2; - } -} - -/** -* @brief Gets the maximum number from @a op1 and @a op2. -*/ -Number max(const Number &op1, const Number &op2) -{ - // Extension of the operands. - pair r = Number::extensionByCRules(op1, op2); - Number &n1 = r.first; - Number &n2 = r.second; - - if (n1 >= n2) { - return n1; - } else { - return n2; - } -} - -/** -* @brief Emits @a n into @a os. -*/ -ostream& operator<<(ostream &os, const Number &n) -{ - if (n.isIntegral()) - os << n.intValue; - else if (n.isFloatingPoint()) { - os << n.floatValue; - } - return os; -} diff --git a/vra/Number.h b/vra/Number.h deleted file mode 100644 index 4725cadce..000000000 --- a/vra/Number.h +++ /dev/null @@ -1,155 +0,0 @@ -/** -* @author Daniela Ďuričeková, xduric00@stud.fit.vutbr.cz -* @file Number.h -* @brief Class that represents a number that can be integral or floating-point -* type. -* @date 2012 -*/ - -#ifndef GUARD_NUMBER_H -#define GUARD_NUMBER_H - -#include -#include -#include -#include - -/** -* @brief Class that represents a number that can be integral or floating-point type. -* -* This class encapsulates an integral or floating-point number. It defines common -* arithmetic, logical and bitwise operations and according to the specified bit -* width of the number solves the overflowing. So, instance of this class can represent -* all C-language types and can simulate the behaviour of these types. It also takes -* care of integral promotions and type extensions according to the C rules. -*/ -class Number { - private: - /// Enumeration is used to distinguish the type of the stored number. - enum Type { - INT, - FLOAT - }; - - /// Biggest integer. - typedef mpz_class Int; - - /// Biggest float. - typedef long double Float; - - /// Type of the stored number. - Type type; - - /// Value of the number if @c type of the number is @c INT. - Int intValue; - - /// Value of the number if @c type of the number is @c FLOAT. - Float floatValue; - - /// Is the integer signed? This data item makes sense only if @c type - /// of the number is @c INT. - bool sign; - - /// Bit width of the represented number. - unsigned bitWidth; - - /// Minimal value that can be stored in the number. It is used only if - /// @c type of the number is @c INT. - Int minIntLimit; - - /// Maximal value that can be stored in the number. It is used only if - /// @c type of the number is @c INT. - Int maxIntLimit; - - /// Minimal value that can be stored in the number. It is used only if - /// @c type of the number is @c FLOAT. - Float minFloatLimit; - - /// Maximal value that can be stored in the number. It is used only if - /// @c type of the number is @c FLOAT. - Float maxFloatLimit; - - void setIntLimits(); - void setFloatLimits(); - void fitIntoBitWidth(); - void integralPromotion(); - void convertSignedToUnsigned(); - - static Number performTrunc(const Number &op1, const Number &op2, bool isMod); - static Number performBitOp(const Number &op1, const Number &op2, char mode); - static Number performShift(Number op1, Number op2, bool isLeft); - - public: - Number(Int value, unsigned width, bool sign); - Number(Float value, unsigned width); - - Number assign(const Number &n) const; - - bool isIntegral() const; - bool isFloatingPoint() const; - bool isSigned() const; - bool isUnsigned() const; - bool isInf() const; - bool isNegativeInf() const; - bool isPositiveInf() const; - bool isNotNumber() const; - bool isNumber() const; - bool isMin() const; - bool isMax() const; - bool toBool() const; - Number getEpsilon() const; - Number getMin() const; - Number getMax() const; - Number getNan() const; - Number getPositiveInf() const; - Number getNegativeInf() const; - Int getInt() const; - Float getFloat() const; - unsigned getBitWidth() const; - unsigned getNumOfBits() const; - bool getSign() const; - - static Int floatToInt(const Float &n); - static Float intToFloat(const Int &n, bool isSigned); - static std::pair extensionByCRules(Number n1, Number n2); - - friend bool operator==(const Number &num1, const Number &num2); - friend bool operator!=(const Number &num1, const Number &num2); - friend bool operator<=(const Number &num1, const Number &num2); - friend bool operator>=(const Number &num1, const Number &num2); - friend bool operator<(const Number &num1, const Number &num2); - friend bool operator>(const Number &num1, const Number &num2); - - friend Number operator-(const Number &op); - friend Number operator+(const Number &op1, const Number &op2); - friend Number operator-(const Number &op1, const Number &op2); - friend Number operator*(const Number &op1, const Number &op2); - friend Number rdiv(const Number &op1, const Number &op2); - friend Number exact_div(const Number &op1, const Number &op2); - friend Number trunc_div(const Number &op1, const Number &op2); - friend Number trunc_mod(const Number &op1, const Number &op2); - - friend bool logicalNot(const Number &op); - friend bool logicalAnd(const Number &op1, const Number &op2); - friend bool logicalOr(const Number &op1, const Number &op2); - friend bool logicalXor(const Number &op1, const Number &op2); - - friend Number bitNot(const Number &op); - friend Number bitAnd(const Number &op1, const Number &op2); - friend Number bitOr(const Number &op1, const Number &op2); - friend Number bitXor(const Number &op1, const Number &op2); - friend Number bitLeftShift(const Number &op1, const Number &op2); - friend Number bitRightShift(const Number &op1, const Number &op2); - - friend Number abs(const Number &op); - friend Number intToFloat(const Number &op); - friend Number min(const Number &op1, const Number &op2); - friend Number max(const Number &op1, const Number &op2); - - /** - * @brief Emits @a n into @a os. - */ - friend std::ostream& operator<<(std::ostream &os, const Number &n); -}; - -#endif diff --git a/vra/OperandToMemoryPlace.cc b/vra/OperandToMemoryPlace.cc deleted file mode 100644 index 2bcaee104..000000000 --- a/vra/OperandToMemoryPlace.cc +++ /dev/null @@ -1,199 +0,0 @@ -/** -* @author Daniela Ďuričeková, xduric00@stud.fit.vutbr.cz -* @file OperandToMemoryPlace.cc -* @brief Implementation of class that converts @c cl_operand to the instance -* of the @c MemoryPlace class. -* @date 2012 -*/ - -#undef NDEBUG - -#include -#include -#include -#include "OperandToMemoryPlace.h" - -using std::string; -using std::vector; -using std::map; -using std::deque; - -map - OperandToMemoryPlace::memoryPlaceMap; - -/** -* @brief Converts @c cl_operand to the instance of the @c MemoryPlace class. Used only -* for simple variables, elements of array, items of structures. -* -* @param[in] operand It will be converted to the @c MemoryPlace object. -* -* @return @c MemoryPlace instance that was created from @a operand. -* -* Preconditions: -* - @code operand->code == CL_OPERAND_VAR @endcode -*/ -MemoryPlace* OperandToMemoryPlace::convertSimpleOperand(const cl_operand *operand) -{ - // Checks if the precondition is satisfied. - assert(operand->code == CL_OPERAND_VAR); - - // Stores the name of the variable. - string name; - if (((operand->data).var)->name != NULL) { - // This is necessary because of artificial variables. - name = string(((operand->data).var)->name); - } - - // Stores if the variable was generated by the compiler. - bool artificial = ((operand->data).var)->artificial; - if (name.empty()) { - // In some cases, it happens that artificial variable is set as - // not artificial and in the output, we have variables without name. - artificial = true; - } - - // Stores the unique id of the variable. - Int uid = ((operand->data).var)->uid; - - // Vector represents unique id for the given operand. - vector uidVector; - uidVector.push_back(uid); - - if (NULL == operand->accessor) { - // If the given cl_operand represents a simple variable. - if (OperandToMemoryPlace::memoryPlaceMap.count(uidVector) == 0) { - // This variable is used for the first time. - MemoryPlace *var = new MemoryPlace(name, artificial); - OperandToMemoryPlace::memoryPlaceMap[uidVector] = var; - return var; - } else { - // This variable was used before. We return found record. - return OperandToMemoryPlace::memoryPlaceMap[uidVector]; - } - } else if (CL_ACCESSOR_ITEM == (operand->accessor)->code || - CL_ACCESSOR_DEREF_ARRAY == (operand->accessor)->code) { - // If the given cl_operand represents an item of a structure or - // if the given cl_operand represents an element of an array. - struct cl_accessor *actualAccessor = operand->accessor; - while (actualAccessor != NULL) { - if (CL_ACCESSOR_ITEM == actualAccessor->code) { - // If the given cl_operand represents an item of a structure. - int index = actualAccessor->data.item.id; - uidVector.push_back(index); - name += string("."); - name += string((((actualAccessor->type)->items)[index]).name); - } else if (CL_ACCESSOR_DEREF_ARRAY == actualAccessor->code) { - // If the given cl_operand represents an element of an array. - name += string("[]"); - // Element of an array has always only one item. - uidVector.push_back(0); - } - - actualAccessor = actualAccessor->next; - } - - if (OperandToMemoryPlace::memoryPlaceMap.count(uidVector) == 0) { - // This variable is used for the first time. - MemoryPlace *var = new MemoryPlace(name, artificial); - OperandToMemoryPlace::memoryPlaceMap[uidVector] = var; - return var; - } else { - // This variable was used before. We return found record. - return OperandToMemoryPlace::memoryPlaceMap[uidVector]; - } - } - - assert(!"Memory place cannot be created for the provided cl_operand."); - return new MemoryPlace("", true); - -} - -/** -* @brief Converts @c cl_operand to the instance of the @c MemoryPlace class. -* -* @param[in] operand It will be converted to the @c MemoryPlace object. -* @param[in] indexes It specifies which items of the structure should be converted. -* -* @return @c MemoryPlace instance that was created from @a operand. -* -* Preconditions: -* - @code operand->code == CL_OPERAND_VAR @endcode -*/ -MemoryPlace* OperandToMemoryPlace::convert(const cl_operand *operand, - deque indexes) -{ - if (indexes.empty()) { - // Simple variable. - return OperandToMemoryPlace::convertSimpleOperand(operand); - } - - // Checks if the precondition is satisfied. - assert(operand->code == CL_OPERAND_VAR); - - // Stores the name of the variable. - string name; - if (((operand->data).var)->name != NULL) { - // This is necessary because of artificial variables. - name = string(((operand->data).var)->name); - } - - // Stores if the variable was generated by the compiler. - bool artificial = ((operand->data).var)->artificial; - - // Stores the unique id of the variable. - Int uid = ((operand->data).var)->uid; - - // Vector represents unique id for the given operand. - vector uidVector; - uidVector.push_back(uid); - - const struct cl_type *currentType; - if (operand->accessor != NULL) { - currentType = operand->accessor->type; - } else { - currentType = operand->type; - } - - // If the given cl_operand represents a structure or - // if the given cl_operand represents an array. - while ((CL_TYPE_STRUCT == currentType->code) || - (CL_TYPE_ARRAY == currentType->code)) { - - int index = indexes.front(); - indexes.pop_front(); - uidVector.push_back(index); - - if (CL_TYPE_STRUCT == currentType->code) { - // If the given cl_operand represents a structure. - name += string("."); - name += string(((currentType->items)[index]).name); - } else if (CL_TYPE_ARRAY == currentType->code) { - // If the given cl_operand represents an element of an array. - name += string("[]"); - assert(index == 0); - } - - currentType = ((currentType->items)[index]).type; - } - - if (OperandToMemoryPlace::memoryPlaceMap.count(uidVector) == 0) { - // This variable is used for the first time. - MemoryPlace *var = new MemoryPlace(name, artificial); - OperandToMemoryPlace::memoryPlaceMap[uidVector] = var; - return var; - } else { - // This variable was used before. We return found record. - return OperandToMemoryPlace::memoryPlaceMap[uidVector]; - } - - assert(!"Memory places does not created for provided cl_operand."); - return new MemoryPlace("", true); -} - -/** -* @brief Initializes the @c memoryPlaceMap. Used only for unit tests. -*/ -void OperandToMemoryPlace::init() -{ - OperandToMemoryPlace::memoryPlaceMap.clear(); -} diff --git a/vra/OperandToMemoryPlace.h b/vra/OperandToMemoryPlace.h deleted file mode 100644 index 6ce2337d0..000000000 --- a/vra/OperandToMemoryPlace.h +++ /dev/null @@ -1,47 +0,0 @@ -/** -* @author Daniela Ďuričeková, xduric00@stud.fit.vutbr.cz -* @file OperandToMemoryPlace.h -* @brief Class converts @c cl_operand to the instance of the @c MemoryPlace class. -* @date 2012 -*/ - -#ifndef GUARD_OPERAND_TO_MEMORY_PLACE_H -#define GUARD_OPERAND_TO_MEMORY_PLACE_H - -#include -#include -#include -#include -#include -#include "MemoryPlace.h" - -/** -* @brief Class converts @c cl_operand to the instance of the @c MemoryPlace class. -* -* This class converts the given @c cl_operand to the @c MemoryPlace class according -* to the type of @c cl_operand. -*/ -class OperandToMemoryPlace { - private: - /// Just for assurance that nobody will try to use it. - OperandToMemoryPlace() { } - - /// Represents integral type. - typedef mpz_class Int; - - /// Type used to represent id for memory place. - typedef std::vector UidVector; - - /// Map that for each @c UidVector stores corresponding @c MemoryPlace. - static std::map memoryPlaceMap; - - static MemoryPlace* convertSimpleOperand(const cl_operand *operand); - - public: - static MemoryPlace* convert(const cl_operand *operand, - std::deque indexes = std::deque()); - - static void init(); -}; - -#endif diff --git a/vra/README b/vra/README deleted file mode 100644 index a30ca421d..000000000 --- a/vra/README +++ /dev/null @@ -1,87 +0,0 @@ - - A Value-Range Analyzer Built On Top of Code Listener - - Daniela Ďuričeková , 2013 - - -Description: ------------- - A value-range analyzer that is built on top of the Code Listener infrastructure. - -System requirements: --------------------- - OS GNU/Linux, x86/x86_64, kernel >= 3.0 - -Software requirements: ----------------------- - GNU make >= 3.8 Compilation and linking - g++ >= 4.7 C++ source files compiler and linker - GMP >= 5.1 The GNU multiple precision arithmetic library - Git >= 1.8 Revision control system (to get CL source code) - Doxygen >= 1.7 Generating program documentation (optional) - -Installation: -------------- - (1) Get the latest version of Code Listener: - - git clone https://github.com/kdudka/predator - - (2) Extract the contents of the archive `vra-YYYY-MM-DD.zip` to `predator`: - - tar -C predator -xvzf vra-YYYY-MM-DD.tar.gz - - (3) Build Code Listener: - - cd predator - make build_gcc - make - - (4) Build the analyzer: - - cd predator/vra - make - -Usage: ------- - Assuming that you are in `predator`, run the following command, where - `test.c` is the input C source program: - - ./gcc-install/bin/gcc -fplugin=vra_build/libvra.so \ - -fplugin-arg-libvra-dump-pp test.c - -Unit tests: ------------ - Assuming that you are in `predator/vra/tests-unit`, run - - make - - to build the unit tests, and then run either - - ./run-all-unit-tests.sh - - to run all the unit tests or - - ./TestName - - to run a specific test fixture (for example, `./NumberTest`). - -Overall tests: --------------- - Assuming that you are in `predator/vra/tests-overall`, run - - ./tests-run.sh - - to run all the overall tests. - -Documentation: --------------- - Assuming that you are in `predator/vra`, run the following command to - generate the Doxygen API documentation for the value-range analyzer: - - make doc - - Then, open `predator/vra/doc/html/index.html` in your favorite web browser. - -Feedback: ---------- - Send an email to xduric00@stud.fit.vutbr.cz. diff --git a/vra/Range.cc b/vra/Range.cc deleted file mode 100644 index b1485e8a9..000000000 --- a/vra/Range.cc +++ /dev/null @@ -1,2577 +0,0 @@ -/** -* @author Daniela Ďuričeková, xduric00@stud.fit.vutbr.cz -* @file Range.cc -* @brief Implementation of class that represents the value range of the variable. -* @date 2012 -*/ - -#include -#include -#include -#include - -// Enable assertions. -#undef NDEBUG -#include - -#include "Range.h" - -using std::vector; -using std::sort; -using std::max; -using std::min; -using std::cout; -using std::endl; -using std::pair; - -typedef Range::Interval Interval; - -namespace { - -/** -* @brief Compares two intervals according to their lower bounds. -* -* @param[in] i1 The first interval. -* @param[in] i2 The second interval. -* @return @c true if the first interval is lower than the second one, @c false -* otherwise. -*/ -bool compareLowerBounds(const Range::Interval &i1, const Range::Interval &i2) -{ - if (i1.first.isNotNumber()) - return true; - else if (i2.first.isNotNumber()) - return false; - return (i1.first < i2.first) || - (i1.first == i2.first && i1.second < i2.second); -} - -} - -// Definition of static variables and constants. -const size_t Range::MAX_INTERVALS_IN_RANGE; - -/** -* @brief Constructs an empty range. -*/ -Range::Range() -{ -} - -/** -* @brief Constructs a range containing an interval [@a n, @a n] (a single point). -* -* @param[in] n Number that represents the lower bound and the upper bound of the -* interval that will be added to the range. -*/ -Range::Range(Number n) -{ - data.push_back(Interval(n,n)); -} - -/** -* @brief Constructs a range containing one interval. -* -* @param[in] i The first interval that will be added to the range. -*/ -Range::Range(Interval i) -{ - data.push_back(i); - normalize(); -} - -/** -* @brief Constructs a range containing two intervals. -* -* @param[in] i1 The first interval that will be added to the range. -* @param[in] i2 The second interval that will be added to the range. -*/ -Range::Range(Interval i1, Interval i2) -{ - data.push_back(i1); - data.push_back(i2); - normalize(); -} - -/** -* @brief Constructs a range containing three intervals. -* -* @param[in] i1 The first interval that will be added to the range. -* @param[in] i2 The second interval that will be added to the range. -* @param[in] i3 The third interval that will be added to the range. -*/ -Range::Range(Interval i1, Interval i2, Interval i3) -{ - data.push_back(i1); - data.push_back(i2); - data.push_back(i3); - normalize(); -} - -/** -* @brief Constructs a range containing four intervals. -* -* @param[in] i1 The first interval that will be added to the range. -* @param[in] i2 The second interval that will be added to the range. -* @param[in] i3 The third interval that will be added to the range. -* @param[in] i4 The fourth interval that will be added to the range. -*/ -Range::Range(Interval i1, Interval i2, Interval i3, Interval i4) -{ - data.push_back(i1); - data.push_back(i2); - data.push_back(i3); - data.push_back(i4); - normalize(); -} - -/** -* @brief Normalizes vector of intervals. -* -* It edits intervals, so the lower bounds are always lower or equal than upper -* bounds. It sorts intervals in the vector according to the numerical order and -* if intervals are overlapping or neighbouring it joins them together. -*/ -void Range::normalize() -{ - // It does not make sense to normalize empty vector. - if (data.size() == 0) - return; - - // Only one NAN interval is kept. - vector tmp; - bool isNanThere = false; - for (iterator it = data.begin(); it != data.end(); ++it) { - if (it->first.isNotNumber() || it->second.isNotNumber()) { - if (!isNanThere) { - // The first interval representing NAN is kept. Others are - // removed. - if (it->first.isNotNumber()) { - tmp.push_back(Interval(it->first, it->first)); - } else { - tmp.push_back(Interval(it->second, it->second)); - } - isNanThere = true; - } - } else { - // Everything except extra NAN intervals is kept. - tmp.push_back(*it); - } - } - swap(data, tmp); - - // Pre-processing intervals. - tmp.clear(); - for (iterator it = data.begin(); it != data.end(); ++it) { - if (it->first > it->second) { - // The lower bound is greater than the upper bound. - tmp.push_back(Interval(it->second.getMin(), it->second)); - tmp.push_back(Interval(it->first, it->first.getMax())); - } else { - // The lower bound is lower or equal than the upper bound. - tmp.push_back(*it); - } - } - swap(data, tmp); - - // Sorting intervals. - sort(data.begin(), data.end(), compareLowerBounds); - - tmp.clear(); - tmp.push_back(data.front()); - - // If the space between intervals is lower than or equal epsilon, they - // will be joined together. - Number epsilon(1, sizeof(int), true); - if (data.front().first.isFloatingPoint()) { - epsilon = Number(0.1, sizeof(double)); - } - - // Joining intervals. - for (iterator current = data.begin() + 1; current != data.end(); current++) { - Interval previous = tmp.back(); - // The second condition is necessary because of overflowing of the Number. - if (current->first <= previous.second || - current->first <= previous.second + epsilon) { - // The lower bound of currently processed interval is lower or equal - // than upper bound of the previous processed interval (intervals are - // neighbours or overlap). - Number lowerBound = std::min(previous.first, current->first); - Number upperBound = std::max(previous.second, current->second); - tmp.back() = Interval(lowerBound, upperBound); - } else { - // If it is not possible to join the last processed interval with the - // current one. - tmp.push_back(*current); - } - } - swap(data, tmp); - - // If there are too many intervals, merge them. - if (data.size() > MAX_INTERVALS_IN_RANGE) { - mergeIntervalsInPlace(); - } -} - -/** -* @brief Merges the intervals in the range in place, meaning that the current -* range is changed. -* -* See the description of mergeIntervals() for more information. -*/ -void Range::mergeIntervalsInPlace() { - // On ranges with no more than a single interval, there is nothing to do. - if (data.size() < 2) { - return; - } - - if (isFloatingPoint() && containsNan()) { - // We have to handle the situation when there is NAN separately. - Number nan(data[0].first); - Number min(data[1].first); - Number max(data[data.size() - 1].second); - data.clear(); - data.push_back(Interval(nan, nan)); - data.push_back(Interval(min, max)); - } else { - Number min(data[0].first); - Number max(data[data.size() - 1].second); - data.clear(); - data.push_back(Interval(min, max)); - } -} - -/** -* @brief Splits range into intervals where the intervals (INF, INF) and (-INF, -INF) -* are always extra. Thus, there will be no intervals like (-INF, 5). This will -* be always split into (-INF, -INF) and (MIN, 5). It also splits all intervals -* that contains negative and positive numbers at the same time. For example, -* interval (-5, 5) will be split into intervals (-5, -1) and (0, 5). Also, for -* integral types (MIN, MIN) must be extra. Otherwise, it causes problems. -* Because, MIN * (-1) = MIN. -*/ -Range Range::splitBySpecialValues() const -{ - // I should always work with non-empty range. - assert(!empty()); - - Range result; - if (isFloatingPoint()) { - // Split floating-point range by special values. - for (Range::const_iterator it = begin(); it != end(); ++it) { - const Number &x = it->first; - const Number &y = it->second; - - // In the next code, we need to have zero with the appropriate type. - Number zero = x.assign(Number(0, sizeof(char), true)); - - if (x.isNegativeInf() && y.isNumber() && y < zero) { - // For intervals in the form of (-INF, -number). - result.data.push_back(Interval(x, x)); - result.data.push_back(Interval(x.getMin(), y)); - } else if (x.isNegativeInf() && y.isNumber() && y >= zero) { - // For intervals in the form of (-INF, number). - result.data.push_back(Interval(x, x)); - result.data.push_back(Interval(x.getMin(), zero)); - result.data.push_back(Interval(zero, y)); - } else if (x.isNegativeInf() && y.isPositiveInf()) { - // For intervals in the form of (-INF, INF). - result.data.push_back(Interval(x, x)); - result.data.push_back(Interval(x.getMin(), zero)); - result.data.push_back(Interval(zero, x.getMax())); - result.data.push_back(Interval(y, y)); - } else if (x.isNumber() && x < zero && y.isNumber() && y >= zero) { - // For intervals in the form of (-number, number). - result.data.push_back(Interval(x, zero)); - result.data.push_back(Interval(zero, y)); - } else if (x.isNumber() && x < zero && y.isPositiveInf()) { - // For intervals in the form of (-number, INF) - result.data.push_back(Interval(x, zero)); - result.data.push_back(Interval(zero, x.getMax())); - result.data.push_back(Interval(y, y)); - } else if (x.isNumber() && x >= zero && y.isPositiveInf()) { - // For intervals in the form of (number, INF). - result.data.push_back(Interval(x, x.getMax())); - result.data.push_back(Interval(y, y)); - } else { - // Otherwise, for intervals in the forms (-INF, -INF), - // (-number, -number), (number, number), (INF, INF), (NAN, NAN). - result.data.push_back(Interval(x, y)); - } - } - } else if (isIntegral() && isSigned()) { - // Split signed integral ranges by special values. - for (Range::const_iterator it = begin(); it != end(); ++it) { - const Number &x = it->first; - const Number &y = it->second; - - // In the next code, we need to have zero with the appropriate type. - Number zero = x.assign(Number(0, sizeof(char), true)); - - if (x.isMin() && y.isMin()) { - // For intervals in the form of (MIN, MIN). - result.data.push_back(Interval(x, y)); - } else if (x.isMin() && y.isNumber() && y < zero) { - // For intervals in the form of (MIN, - number). - Number xPlusOne(x.getInt() + 1, x.getBitWidth(), x.getSign()); - result.data.push_back(Interval(x, x)); - result.data.push_back(Interval(xPlusOne, y)); - } else if (x.isMin() && y.isNumber() && y >= zero) { - // For intervals in the form of (MIN, number) and (MIN, MAX). - Number xPlusOne(x.getInt() + 1, x.getBitWidth(), x.getSign()); - result.data.push_back(Interval(x, x)); - result.data.push_back(Interval(xPlusOne, zero)); - result.data.push_back(Interval(zero, y)); - } else if (x.isNumber() && x < zero && y.isNumber() && y >= zero) { - // For intervals in the form of (-number, number) and (-number, MAX). - result.data.push_back(Interval(x, zero)); - result.data.push_back(Interval(zero, y)); - } else { - // Otherwise, for intervals in the forms (MIN, MIN), - // (-number, -number), (number, number), (number, MAX), (MAX, MAX). - result.data.push_back(Interval(x, y)); - } - } - } else if (isIntegral() && isUnsigned()) { - // There are no problems for unsigned integral ranges. - result = *this; - } - - // Do not call the normalize() function here. It blends everything together - // and the resulted range will be same as the given one. - return result; -} - -/** -* @brief Splits the range so that if it contains 0 or 0.0, then this value will -* be in a separate interval (0, 0) or (0.0, 0.0) -* -* @return Splitted range. -*/ -Range Range::splitByZero() const { - // I should always work with non-empty range. - assert(!empty()); - - // In the next code, we need to have zero with the appropriate type. - Number zero = data[0].first.assign(Number(0, sizeof(char), true)); - - Range result; - - for (Range::const_iterator it = begin(); it != end(); ++it) { - const Number &x = it->first; - const Number &y = it->second; - - if (isFloatingPoint()) { - // Split floating-point range. - - if (x == zero && y == zero) { - result.data.push_back(Interval(zero, zero)); - } else if (x == zero) { - result.data.push_back(Interval(zero, zero)); - result.data.push_back(Interval(x.getEpsilon(), y)); - } else if (y == zero) { - result.data.push_back(Interval(zero, zero)); - result.data.push_back(Interval(x, -y.getEpsilon())); - } else if (x < zero && y > zero) { - result.data.push_back(Interval(x, -y.getEpsilon())); - result.data.push_back(Interval(zero, zero)); - result.data.push_back(Interval(x.getEpsilon(), y)); - } else { - result.data.push_back(Interval(x, y)); - } - } else if (isIntegral() && isSigned()) { - // Split a signed integral range. - if (x == zero && y == zero) { - result.data.push_back(Interval(zero, zero)); - } else if (x == zero) { - result.data.push_back(Interval(zero, zero)); - result.data.push_back(Interval(Number(1, x.getBitWidth(), - true), y)); - } else if (y == zero) { - result.data.push_back(Interval(zero, zero)); - result.data.push_back(Interval(x, Number(-1, x.getBitWidth(), - true))); - } else if (x < zero && y > zero) { - result.data.push_back(Interval(x, Number(-1, x.getBitWidth(), - true))); - result.data.push_back(Interval(zero, zero)); - result.data.push_back(Interval(Number(1, x.getBitWidth(), - true), y)); - } else { - result.data.push_back(Interval(x, y)); - } - } else { // isIntegral() && isUnsigned() - assert(isIntegral() && isUnsigned()); - - // Split an unsigned integral range. - if (x == zero && y == zero) { - result.data.push_back(Interval(zero, zero)); - } else if (x == zero) { - result.data.push_back(Interval(zero, zero)); - result.data.push_back(Interval(Number(1, x.getBitWidth(), - false), y)); - } else { - result.data.push_back(Interval(x, y)); - } - } - } - - // Do not call the normalize() function here. It blends everything together - // and the resulted range will be same as the given one. - return result; -} - -/** -* @brief Returns @c true if current range has the same type as the range @a r, @c -* false otherwise. -*/ -bool Range::hasSameTypeAs(const Range &r) const -{ - assert(!empty() && !r.empty()); - - return (((isIntegral() && r.isIntegral()) && - (isSigned() == r.isSigned()) && - (data[0].first.getBitWidth() == r.data[0].first.getBitWidth())) || - ((isFloatingPoint() && r.isFloatingPoint()) && - (data[0].first.getBitWidth() == r.data[0].first.getBitWidth()))); -} - -/** -* @brief Returns @c true if the current range contains just a single number, @c -* false otherwise. -* -* For example, the ranges [1, 1] and [4.5, 4.5] both contain a single number -* while the ranges [1, 2] and [3, 3][5, 7] contains more than a single number. -*/ -bool Range::containsOnlySingleNumber() const -{ - return size() == 1 && data[0].first == data[0].second; -} - -/** -* @brief Returns @c true if the current range contains the minimal integral -* value, @c false otherwise. -* -* If the range is composed of floating-point numbers, this function returns @c -* false. -*/ -bool Range::containsIntegralMin() const -{ - if (empty() || !isIntegral()) { - return false; - } - - // The minimal integral value should be in the first interval (if any). - return data[0].first.isMin(); -} - -/** -* @brief Returns @c true if the current range contains the intergral value @c -* -1, @c false otherwise. -* -* If the range is composed of floating-point numbers, this function -* returns @c false. -*/ -bool Range::containsIntegralMinusOne() const -{ - if (empty() || !isIntegral()) { - return false; - } - - // Create a -1 value of a proper type. - Number minOne(-1, data[0].first.getBitWidth(), data[0].first.isSigned()); - - // Go through the range and try to find -1. - for (const_iterator it = begin(); it != end(); ++it) { - // Notice that the case when it->fist == -1 or it-second == -1 is also - // included in the following check. - if (it->first <= minOne && it->second >= minOne) { - return true; - } - } - - return false; -} - -/** -* @brief Returns the maximal number stored in the current range. -*/ -Number Range::getMax() const -{ - assert(!empty()); - return data[size() - 1].second; -} - -/** -* @brief Returns the minimal number stored in the current range. -*/ -Number Range::getMin() const -{ - assert(!empty()); - if (data[0].first.isNotNumber() && size() > 1) { - return data[1].first; - } - else { - return data[0].first; - } -} - -/** -* @brief Extends ranges according to the C99 standard. -* -* @param[in] r1 The first range that will be extended. -* @param[in] r2 The second range that will be extended. -* -* @return The pair of extended ranges. -*/ -std::pair Range::extensionByCRules(const Range &r1, const Range &r2) -{ - // I should always work with non-empty range. - assert(!r1.empty() && !r2.empty()); - - // This is done in order to get the result that contains the correct type. - const Number &firstOp = r1.data[0].first; - const Number &secondOp = r2.data[0].first; - Number res = firstOp * secondOp; - - Range result1; - for (Range::const_iterator it = r1.begin(); it != r1.end(); ++it) { - // Converts the interval according to the type stored in res. - Interval tmp = Interval(res.assign(it->first), res.assign(it->second)); - result1.data.push_back(tmp); - } - result1.normalize(); - - Range result2; - for (Range::const_iterator it = r2.begin(); it != r2.end(); ++it) { - // Converts the interval according to the type stored in res. - Interval tmp = Interval(res.assign(it->first), res.assign(it->second)); - result2.data.push_back(tmp); - } - result2.normalize(); - - return std::pair(result1, result2); -} - -/** -* @brief Returns @c true if the current range contains @c NAN, @c false otherwise. -*/ -bool Range::containsNan() const -{ - // I should always work with non-empty range. - assert(!empty()); - - Interval i = data[0]; - if (i.first.isNotNumber()) { - return true; - } else { - return false; - } -} - -/** -* @brief Returns @c true if the current range contains @c INF, @c false otherwise. -*/ -bool Range::containsPositiveInf() const -{ - // I should always work with non-empty range. - assert(!empty()); - - // Ranges are sorted. So, if INF is present in the range, it is its last element. - Interval i = data[size() - 1]; - if (i.second.isPositiveInf()) { - // We use second, because (number, INF) is correct interval. - return true; - } else { - return false; - } -} - -/** -* @brief Returns @c true if the current range contains @c -INF, @c false otherwise. -*/ -bool Range::containsNegativeInf() const -{ - // I should always work with non-empty range. - assert(!empty()); - - // Ranges are sorted. So, if -INF is present in the range, it is its - // first or second element. It is second if (NAN, NAN) interval is present. - // Otherwise, it is first. - if (data[0].first.isNegativeInf() || - (size() > 1 && data[1].first.isNegativeInf())) { - // We use second, because (number, INF) is correct interval. - return true; - } else { - return false; - } -} - -/** -* @brief Returns @c true if the current range contains value convertible to @c -* true, @c false otherwise. -*/ -bool Range::containsTrue() const -{ - // I should always work with non-empty range. - assert(!empty()); - - for (Range::const_iterator it = begin(); it != end(); ++it) { - if (it->first.toBool() || it->second.toBool()) { - return true; - } - } - - return false; -} - -/** -* @brief Returns @c true if the current range contains value convertible to @c -* false, @c false otherwise. -*/ -bool Range::containsFalse() const -{ - // I should always work with non-empty range. - assert(!empty()); - - // Only zero is convertible to false. - return containsZero(); -} - -/** -* @brief Returns @c true if the current range contains a zero (@c 0 or @c 0.0), -* @c false otherwise. -*/ -bool Range::containsZero() const -{ - // I should always work with non-empty range. - assert(!empty()); - - Number zeroInt(0, sizeof(int), true); - Number zero(data[0].first.assign(zeroInt)); - for (Range::const_iterator it = begin(); it != end(); ++it) { - if (!it->first.toBool() || !it->second.toBool() || - ((it->first < zero) && (zero < it->second))) { - return true; - } - } - - return false; -} - -/** -* @brief Returns the maximal range for the given number @a n according to the number -* type. -*/ -Range Range::getMaxRange(const Number &n) -{ - if (n.isIntegral()) { - return Range(Range::Interval(n.getMin(), n.getMax())); - } else { // n.isFloatingPoint() - return Range(Range::Interval(n.getNan(), n.getNan()), - Range::Interval(n.getNegativeInf(), n.getPositiveInf())); - } -} - -/** -* @brief Computes logical @c not for range @a r. -*/ -Range logicalNot(const Range &r) -{ - // I should always work with non-empty range. - assert(!r.empty()); - - Range result; - Number zero = Number(0, sizeof(int), true); - Number one = Number(1, sizeof(int), true); - - if (r.containsTrue() && r.containsFalse()) { - // ! [0,1] - result.data.push_back(Range::Interval(zero, one)); - } else if (r.containsTrue()) { - // ! [1] - result.data.push_back(Range::Interval(zero, zero)); - } else if (r.containsFalse()) { - // ! [0] - result.data.push_back(Range::Interval(one, one)); - } - - result.normalize(); - return result; -} - -/** -* @brief Computes logical @c and for ranges @a r1 and @a r2. -*/ -Range logicalAnd(const Range &r1, const Range &r2) -{ - // I should always work with non-empty range. - assert(!r1.empty() && !r2.empty()); - - Range result; - - // I use here int type because in C programs, integral promotion is applied. - // Hence, by using int type instead boolean, I cannot break anything. - Number zero = Number(0, sizeof(int), true); - Number one = Number(1, sizeof(int), true); - - if (r1.containsFalse() || r2.containsFalse()) { - result.data.push_back(Range::Interval(zero, zero)); - } - - if (r1.containsTrue() && r2.containsTrue()) { - result.data.push_back(Range::Interval(one, one)); - } - - result.normalize(); - return result; -} - -/** -* @brief Computes logical @c or for ranges @a r1 and @a r2. -*/ -Range logicalOr(const Range &r1, const Range &r2) -{ - // I should always work with non-empty range. - assert(!r1.empty() && !r2.empty()); - - Range result; - - // I use here int type because in C programs, integral promotion is applied. - // Hence, by using int type instead boolean, I cannot break anything. - Number zero = Number(0, sizeof(int), true); - Number one = Number(1, sizeof(int), true); - - if (r1.containsFalse() && r2.containsFalse()) { - result.data.push_back(Range::Interval(zero, zero)); - } - - if (r1.containsTrue() || r2.containsTrue()) { - result.data.push_back(Range::Interval(one, one)); - } - - result.normalize(); - return result; -} - -/** -* @brief Computes logical @c xor for ranges @a r1 and @a r2. -*/ -Range logicalXor(const Range &r1, const Range &r2) -{ - // I should always work with non-empty range. - assert(!r1.empty() && !r2.empty()); - - Range result; - - // I use here int type because in C programs, integral promotion is applied. - // Hence, by using int type instead boolean, I cannot break anything. - Number zero = Number(0, sizeof(int), true); - Number one = Number(1, sizeof(int), true); - - if ((r1.containsTrue() && r2.containsTrue()) || - (r1.containsFalse() && r2.containsFalse())) { - result.data.push_back(Range::Interval(zero, zero)); - } - - if ((r1.containsFalse() && r2.containsTrue()) || - (r1.containsTrue() && r2.containsFalse())) { - result.data.push_back(Range::Interval(one, one)); - } - - result.normalize(); - return result; -} - -/** -* @brief Checks whether ranges are equal. -* -* @param[in] r1 The first range for comparison. -* @param[in] r2 The second range for comparison. -* -* @return @c true if ranges are equal, @c false otherwise. -*/ -bool operator==(const Range &r1, const Range &r2) -{ - if (r1.size() != r2.size()) { - // Different sizes of ranges. They are not equal. - return false; - } - - if (r1.size() == 0) { - // Empty ranges must be treated separately because of assertions. - return true; - } - - if (!r1.containsNan() && !r1.containsNan()) { - // If they do not contain NAN. - return r1.data == r2.data; - } else if (r1.containsNan() && r1.containsNan()) { - // If they contain NAN. - return std::equal(r1.begin() + 1, r1.end(), r2.begin() + 1); - } else { - // One range contain NAN. The other does not contain NAN. - return false; - } -} - -/** -* @brief Checks whether ranges are not equal. -* -* @param[in] r1 The first range for comparison. -* @param[in] r2 The second range for comparison. -* -* @return @c true if ranges are not equal, @c false otherwise. -*/ -bool operator!=(const Range &r1, const Range &r2) -{ - return r1.data != r2.data; -} - -/** -* @brief Checks whether ranges @a r1 and @a r2 are equal and returns the -* resulting range that can contain three types of intervals: [0,0], -* [1,1] and [0,1]. [0,0] means that no two values from these two ranges -* are equal. [0,1] means that there are values from these two ranges -* that are equal and also values that are not equal. [1,1] means that -* all values from these two rages are equal. -*/ -Range logicalEq(const Range &r1, const Range &r2) -{ - // I should always work with non-empty range. - assert(!r1.empty() && !r2.empty()); - - // I will need this on different places to express interval [0,0]. - Number falseNum(false, sizeof(int), true); - Range::Interval falseInt(falseNum, falseNum); - - Range result; - if (r1.containsNan() || r2.containsNan()) { - // If at least one range contains NAN, it is necessary to add [0,0]. - result.data.push_back(falseInt); - } - - if ((r1.size() > 1 || r2.size() > 1) || - (r1[0].second != r1[0].first) || - (r2[0].second != r2[0].first)) { - // If at least one range represents more than one point, we have to add [0,0]. - result.data.push_back(falseInt); - } - - if ((r1.size() == 1 && r2.size() == 1) && - (r1[0].second == r1[0].first) && - (r2[0].second == r2[0].first) && - (r1[0].first != r2[0].first)) { - // If both ranges represent one point but these points are different. - result.data.push_back(falseInt); - } - - Range::const_iterator it = r1.begin(); - Range::const_iterator jt = r2.begin(); - while (it != r1.end() && jt != r2.end()) { - // We have to find common number. If it exists, we have to add [1,1]. - if (it->first.isNotNumber()) { - // We never compare NAN to something else because it is always false. - ++it; - continue; - } - - if (jt->first.isNotNumber()) { - // We never compare NAN to something else because it is always false. - ++jt; - continue; - } - - if (it->second < jt->first) { - // The first range is strictly lower than the second. - ++it; - continue; - } - - if (jt->second < it->first) { - // The second interval is strictly lower than the first. - ++jt; - continue; - } - - // There is some overlapping of intervals in both ranges. - // Hence, r1 and r2 have common number. We have to add [1,1]. - Number trueNum(true, sizeof(int), true); - Range::Interval trueInt(trueNum, trueNum); - result.data.push_back(trueInt); - break; - } - - result.normalize(); - return result; -} - -/** -* @brief Checks whether ranges @a r1 and @a r2 are not equal and returns the -* resulting range that can contain three types of intervals: [0,0], -* [1,1] and [0,1]. [0,0] means that all values from these two ranges -* are equal. [0,1] means that there are values from these two ranges -* that are equal and also values that are not equal. [1,1] means that -* no values from these two rages are equal. -*/ -Range logicalNeq(const Range &r1, const Range &r2) -{ - // I should always work with non-empty range. - assert(!r1.empty() && !r2.empty()); - - return logicalNot(logicalEq(r1, r2)); -} - -/** -* @brief Checks whether range @a r1 is lower than range @a r2 and returns the -* resulting range that can contain three types of intervals: [0,0], -* [1,1] and [0,1]. [0,0] means that no two values from these two -* ranges accomplish the condition for this comparison. [0,1] means that -* there are values from these two ranges that accomplish the condition for -* this comparison and also values that do not accomplish the condition for -* this comparison. [1,1] means that all values from these two ranges -* accomplish the condition for this comparison. -*/ -Range logicalLt(const Range &r1, const Range &r2) -{ - // I should always work with non-empty range. - assert(!r1.empty() && !r2.empty()); - - // I will need this on different places to express interval [0,0]. - Number falseNum(false, sizeof(int), true); - Range::Interval falseInt(falseNum, falseNum); - - Range result; - if (!r1.containsNan() && !r2.containsNan()) { - // There is no NAN in r1 and r2. - Number r1Min = r1[0].first; - Number r1Max = r1[r1.size() - 1].second; - Number r2Min = r2[0].first; - Number r2Max = r2[r2.size() - 1].second; - Number first = Number(r1Min < r2Max, sizeof(int), true); - Number second = Number(r1Max < r2Min, sizeof(int), true); - result.data.push_back(Range::Interval(first, first)); - result.data.push_back(Range::Interval(second, second)); - } else if (r1.containsNan() && r2.containsNan()) { - // There is NAN in both Ranges. Since there is NAN, we have to add [0,0]. - result.data.push_back(falseInt); - if ((r1.size() > 1) && (r2.size() > 1)) { - // Both ranges have at least two intervals. There is no need to do - // something with ranges where at least one range has only NAN because - // if we compare NAN with anything the result is false. - Number r1Min = r1[1].first; - Number r1Max = r1[r1.size() - 1].second; - Number r2Min = r2[1].first; - Number r2Max = r2[r2.size() - 1].second; - Number first = Number(r1Min < r2Max, sizeof(int), true); - Number second = Number(r1Max < r2Min, sizeof(int), true); - result.data.push_back(Range::Interval(first, first)); - result.data.push_back(Range::Interval(second, second)); - } - } else if (r1.containsNan() && !r2.containsNan()) { - // The first range contains NAN and the second does not contain NAN. - // Since there is NAN, we have to add [0,0]. - result.data.push_back(falseInt); - if (r1.size() > 1) { - // The first range has at least one interval apart from the NAN interval. - // For the second range, we have at least one interval - range cannot - // be empty. - Number r1Min = r1[1].first; - Number r1Max = r1[r1.size() - 1].second; - Number r2Min = r2[0].first; - Number r2Max = r2[r2.size() - 1].second; - Number first = Number(r1Min < r2Max, sizeof(int), true); - Number second = Number(r1Max < r2Min, sizeof(int), true); - result.data.push_back(Range::Interval(first, first)); - result.data.push_back(Range::Interval(second, second)); - } - } else if (!r1.containsNan() && r2.containsNan()) { - // The second range contains NAN and the first does not contain NAN. - // Since there is NAN, we have to add [0,0]. - result.data.push_back(falseInt); - if (r2.size() > 1) { - // The second range has at least one interval apart from the NAN interval. - // For the first range, we have at least one interval - range cannot - // be empty. - Number r1Min = r1[0].first; - Number r1Max = r1[r1.size() - 1].second; - Number r2Min = r2[1].first; - Number r2Max = r2[r2.size() - 1].second; - Number first = Number(r1Min < r2Max, sizeof(int), true); - Number second = Number(r1Max < r2Min, sizeof(int), true); - result.data.push_back(Range::Interval(first, first)); - result.data.push_back(Range::Interval(second, second)); - } - } - - result.normalize(); - return result; -} - -/** -* @brief Checks whether range @a r1 is greater than range @a r2 and returns the -* resulting range that can contain three types of intervals: [0,0], -* [1,1] and [0,1]. [0,0] means that no two values from these two -* ranges accomplish the condition for this comparison. [0,1] means that -* there are values from these two ranges that accomplish the condition for -* this comparison and also values that do not accomplish the condition for -* this comparison. [1,1] means that all values from these two ranges -* accomplish the condition for this comparison. -*/ -Range logicalGt(const Range &r1, const Range &r2) -{ - // I should always work with non-empty range. - assert(!r1.empty() && !r2.empty()); - - return logicalLt(r2,r1); -} - -/** -* @brief Checks whether range @a r1 is lower than or equal to range @a r2 and -* returns the resulting range that can contain three types of intervals: -* [0,0], [1,1] and [0,1]. [0,0] means that no two values from these two -* ranges accomplish the condition for this comparison. [0,1] means that -* there are values from these two ranges that accomplish the condition for -* this comparison and also values that do not accomplish the condition for -* this comparison. [1,1] means that all values from these two ranges -* accomplish the condition for this comparison. -*/ -Range logicalLtEq(const Range &r1, const Range &r2) -{ - // I should always work with non-empty range. - assert(!r1.empty() && !r2.empty()); - - Range eqRange = logicalEq(r1, r2); - Range ltRange = logicalLt(r1, r2); - Range result; - - if (Range(Number(0, sizeof(int), true)) == eqRange) { - // ltRange eqRange result - // 1.) [0,0] [0,0] [0,0] - // 2.) [0,1] [0,0] [0,1] - // 3.) [1,1] [0,0] [1,1] - result = ltRange; - } else if (Range(Number(1, sizeof(int), true)) == eqRange) { - // ltRange eqRange result - // 1.) [0,0] [1,1] [1,1] - // 2.) [0,1] [1,1] [1,1] - // 3.) [1,1] [1,1] [1,1] - result = eqRange; - } else { - // ltRange eqRange result - // 1.) [0,0] [0,1] [0,1] - // 2.) [0,1] [0,1] [0,1] or [1,1] according to situation - // 3.) [1,1] [0,1] [1,1] - if (Range(Number(0, sizeof(int), true)) == ltRange) { - // Implements 1. - result = eqRange; - } else if (Range(Number(1, sizeof(int), true)) == ltRange) { - // Implements 3. - result = ltRange; - } else { - // Implements 2. - if (r1[r1.size() - 1].second <= r2[0].first) { - result = Range(Number(1, sizeof(int), true)); - } else { - result = eqRange; - } - } - } - - result.normalize(); - return result; -} - -/** -* @brief Checks whether range @a r1 is greater than or equal to range @a r2 and -* returns the resulting range that can contain three types of intervals: -* [0,0], [1,1] and [0,1]. [0,0] means that no two values from these two -* ranges accomplish the condition for this comparison. [0,1] means that -* there are values from these two ranges that accomplish the condition for -* this comparison and also values that do not accomplish the condition for -* this comparison. [1,1] means that all values from these two ranges -* accomplish the condition for this comparison. -*/ -Range logicalGtEq(const Range &r1, const Range &r2) -{ - // I should always work with non-empty range. - assert(!r1.empty() && !r2.empty()); - - Range eqRange = logicalEq(r1, r2); - Range gtRange = logicalGt(r1, r2); - Range result; - - if (Range(Number(0, sizeof(int), true)) == eqRange) { - // gtRange eqRange result - // 1.) [0,0] [0,0] [0,0] - // 2.) [0,1] [0,0] [0,1] - // 3.) [1,1] [0,0] [1,1] - result = gtRange; - } else if (Range(Number(1, sizeof(int), true)) == eqRange) { - // gtRange eqRange result - // 1.) [0,0] [1,1] [1,1] - // 2.) [0,1] [1,1] [1,1] - // 3.) [1,1] [1,1] [1,1] - result = eqRange; - } else { - // gtRange eqRange result - // 1.) [0,0] [0,1] [0,1] - // 2.) [0,1] [0,1] [0,1] or [1,1] according to situation - // 3.) [1,1] [0,1] [1,1] - if (Range(Number(0, sizeof(int), true)) == gtRange) { - // Implements 1. - result = eqRange; - } else if (Range(Number(1, sizeof(int), true)) == gtRange) { - // Implements 3. - result = gtRange; - } else { - // Implements 2. - if (r1[0].first >= r2[r2.size() - 1].second) { - result = Range(Number(1, sizeof(int), true)); - } else { - result = eqRange; - } - } - } - - result.normalize(); - return result; -} - -/** -* @brief Returns @c true if range contains integral numbers, @c false otherwise. -*/ -bool Range::isIntegral() const -{ - // I should always work with non-empty range. - assert(!empty()); - return data[0].first.isIntegral(); -} - -/** -* @brief Returns @c true if range contains floating-point numbers, @c false otherwise. -*/ -bool Range::isFloatingPoint() const -{ - // I should always work with non-empty range. - assert(!empty()); - return data[0].first.isFloatingPoint(); -} - -/** -* @brief Returns @c true if range contains signed integral intervals, @c false -* otherwise -*/ -bool Range::isSigned() const -{ - // I should always work with non-empty range. - assert(!empty()); - return isIntegral() && data[0].first.getSign(); -} - -/** -* @brief Returns @c true if range contains unsigned integral intervals, @c false -* otherwise -*/ -bool Range::isUnsigned() const -{ - // I should always work with non-empty range. - assert(!empty()); - return isIntegral() && !data[0].first.getSign(); -} - -/** -* @brief Converts integral range @a r to floating-point range. -*/ -Range intToFloat(const Range &r) -{ - // I should always work with non-empty range. - assert(!r.empty()); - - // I should always work with an integral range. - assert(r.isIntegral()); - - Range result; - for (Range::const_iterator it = r.begin(); it !=r.end(); ++it) { - Number first = intToFloat(it->first); - Number second = intToFloat(it->second); - result.data.push_back(Range::Interval(first, second)); - } - - result.normalize(); - return result; -} - -/** -* @brief Returns a range that would resulted if @a r was assigned into the -* current range with the respect to the type of current range and rules -* in the C language. -*/ -Range Range::assign(const Range &r) const -{ - // I should always work with non-empty ranges. - assert(!empty() && !r.empty()); - - // It is used in order to know the precise type of the range on the left side. - // The assignment can have different properties according to this type, for example - // solving overflows and so on. - Number lowerOld = data[0].first; - Number upperOld = data[0].first; - - Range result; - if (isIntegral() && r.isIntegral()) { - // An integral range is assigned to an integral range. - // We need to compute scope of the type in mpz_class because of overflows. - mpz_class scope = (lowerOld.getMax()).getInt() - (lowerOld.getMin()).getInt(); - scope = scope + 1; - for (Range::const_iterator it = r.begin(); it != r.end(); ++it) { - Number lowerNew = it->first; - Number upperNew = it->second; - mpz_class intervalScope = upperNew.getInt() - lowerNew.getInt(); - if (intervalScope >= scope) { - // If the scope of the new interval is greater than or equal to the - // scope of the type on the left side then maximal range is assigned. - // We can return this maximal range. It is a correct result. - return Range::getMaxRange(lowerOld); - } else { - Number l = lowerOld.assign(lowerNew); - Number u = upperOld.assign(upperNew); - result.data.push_back(Interval(l, u)); - } - } - } else if ((isFloatingPoint() && r.isFloatingPoint()) || - (isFloatingPoint() && r.isIntegral())) { - // A floating-point range is assigned to a floating-point range or - // an integral range is assigned to a floating-point range. - for (Range::const_iterator it = r.begin(); it != r.end(); ++it) { - Number lowerNew = it->first; - Number upperNew = it->second; - Number l = lowerOld.assign(lowerNew); - Number u = upperOld.assign(upperNew); - result.data.push_back(Interval(l,u)); - } - } else if (isIntegral() && r.isFloatingPoint()) { - // A floating-point range is assigned to an integral range. - for (Range::const_iterator it = r.begin(); it != r.end(); ++it) { - Number lowerNew = it->first; - Number upperNew = it->second; - if ((lowerNew >= lowerOld.getMin()) && - (upperNew <= lowerOld.getMax())) { - // Checks if new interval fits into the type of the variable on the - // left side. - Number l = lowerOld.assign(lowerNew); - Number u = upperOld.assign(upperNew); - result.data.push_back(Interval(l,u)); - } else { - // This is not defined according to the C standard. If too big - // floating-point number is assigned to integral number, we return - // the maximal possible range. - return Range::getMaxRange(lowerOld); - } - } - } - - result.normalize(); - return result; -} - -/** -* @brief Expands the current range0* -* For integral ranges: -* - Expands all the intervals in the range by 2. For example, (-5, -2) -* becomes (-10, -1) and (6, 100) becomes (3, 200). -* - If the range is signed and contains a zero, it introduces the -* interval (-1, 1) to the range. -* - If the range is unsigned and contains a zero, it introduces the interval -* (0, 1) to the range. -* -* For floating-point ranges: -* - Returns the maximal range. -*/ -Range Range::expand() const { - // I should always work with non-empty ranges. - assert(!empty()); - - // For floating-points, return the maximal range. - if (isFloatingPoint()) { - return getMaxRange(data[0].first); - } - - // To simplify the implementation, we split the range by special values. - Range r = splitBySpecialValues(); - - Range result; - - // Expand the ranges. - for (Range::const_iterator it = r.data.begin(); it != r.data.end(); it++) { - const Number &x = it->first; - const Number &y = it->second; - - Number zero = x.assign(Number(0, x.getBitWidth(), x.isSigned())); - Number two = x.assign(Number(2, x.getBitWidth(), x.isSigned())); - if (x < zero) { - // The interval is composed of two negative numbers, so multiply x - // with 2 and divide y with 2. - Number newMin(x.assign(x * two)); - if (newMin > x) { - // Make sure that the new minimum is not higher than the - // original x. - newMin = x.getMin(); - } - Number newMax(x.assign(trunc_div(y, two))); - result.data.push_back(Interval(newMin, newMax)); - } else { - // The interval is composed of two positive numbers (or zero), so - // divide x with 2 and multiply y with 2. - Number newMin(x.assign(trunc_div(x, two))); - Number newMax(x.assign(y * two)); - if (newMax < y) { - // Make sure that the new maximum is not lower than the - // original y. - newMax = x.getMax(); - } - result.data.push_back(Interval(newMin, newMax)); - } - } - - // Handle the presence of 0. - if (result.containsZero()) { - if (result.isSigned()) { - result.data.push_back(Interval( - Number(-1, result[0].first.getBitWidth(), true), - Number(1, result[0].first.getBitWidth(), true))); - } else { // result.isUnsigned() - result.data.push_back(Interval( - Number(1, result[0].first.getBitWidth(), false), - Number(1, result[0].first.getBitWidth(), false))); - } - } - - // We have to normalize the result before returning (there will be - // intervals that can be merged). - result.normalize(); - - return result; -} - -/** -* @brief Merges the intervals in the range. -* -* If the range is integral, the returned range is of the form -* @code -* (min, max) -* @endcode -* where @c min is the minimal number from the original range and @c max is the -* maximal number from the original range. -* -* If the range is floating-point, the returned range may have an additional -* range of the form -* @code -* (NAN, NAN) -* @endcode -* if the original range contained @c NAN. -*/ -Range Range::mergeIntervals() const { - Range copy(*this); - copy.mergeIntervalsInPlace(); - return copy; -} - -/** -* @brief Unary minus of the range. -* -* @param[in] r The first range. -* -* @return Unary minus of @a r. -*/ -Range operator-(const Range &r) -{ - // I should always work with non-empty ranges. - assert(!r.empty()); - - Range result; - - for (Range::const_iterator it = r.data.begin(); it != r.data.end(); it++) { - if (it->first.isIntegral()) { - // Handles unary minus of signed and unsigned integral ranges. - if (it->first.isMin()) { - // Special care for minimal value because of asymmetry of - // integral numbers. - if (it->second.isMin()) { - // -(min, min) = (min, min) - result.data.push_back(Interval(it->first, it->second)); - } else { - result.data.push_back(Interval(it->first, it->first)); - // I need to add 'one' to one border of the interval but it - // must be the same type as the type of this border is. - Number intOne(1, sizeof(int), true); - Number one((it->first).assign(intOne)); - Interval tmp = Interval(-it->second, -(it->first + one)); - result.data.push_back(Interval(tmp)); - } - } else { - result.data.push_back(Interval(-it->second, -it->first)); - } - } else { - // Handles unary minus of floating-point ranges. - result.data.push_back(Interval(-it->second, -it->first)); - } - } - - result. normalize(); - return result; -} - -/** -* @brief Performs an addition of two ranges. -* @param[in] r1 The first range. -* @param[in] r2 The second range. -* -* @return The range representing the addition of @a r1 a @a r2. -*/ -Range operator+(const Range &r1, const Range &r2) -{ - // I should always work with non-empty ranges. - assert(!r1.empty() && !r2.empty()); - - Range result; - - for (Range::const_iterator it = r1.begin(); it != r1.end(); it++) { - for (Range::const_iterator jt = r2.begin(); jt != r2.end(); jt++) { - // Consider two intervals (x, y) + (z, w). Interesting computations - // are (x+z, y+w), (x+z, x+w), (y+z, y+w), (z+x, z+y) and (w+x, w+y). - const Number &x = it->first; - const Number &y = it->second; - const Number &z = jt->first; - const Number &w = jt->second; - Interval tmp = Interval(x + z, y + w); - result.data.push_back(tmp); - tmp = Interval(x + z, x + w); - result.data.push_back(tmp); - tmp = Interval(y + z, y + w); - result.data.push_back(tmp); - tmp = Interval(z + x, z + y); - result.data.push_back(tmp); - tmp = Interval(w + x, w + y); - result.data.push_back(tmp); - // It is not necessary to include (x+w, y+z) because it is included in - // (x+z, y+w). - } - } - - result.normalize(); - return result; -} - -/** -* @brief Performs a subtraction of two ranges. -* @param[in] r1 The first range. -* @param[in] r2 The second range. -* -* @return The range representing the subtraction of @a r1 a @a r2. -*/ -Range operator-(const Range &r1, const Range &r2) -{ - // I should always work with non-empty ranges. - assert(!r1.empty() && !r2.empty()); - - Range result; - - for (Range::const_iterator it = r1.begin(); it != r1.end(); it++) { - for (Range::const_iterator jt = r2.begin(); jt != r2.end(); jt++) { - // Consider two intervals: (x, y) - (z, w): Interesting computations - // are only (x-z, y-z), (x-w, y-w) and (x-w, y-z). A computation - // (x-z, y-w) is contained in the (x-w, y-z) and it causes a problem - // than lower bound can be in the position of the upper bound that - // is not recognizable because of overflows (in some cases it could - // be desirable). - const Number &x = it->first; - const Number &y = it->second; - const Number &z = jt->first; - const Number &w = jt->second; - Interval tmp = Interval(x - z, y - z); - result.data.push_back(tmp); - tmp = Interval(x - w, y - z); - result.data.push_back(tmp); - tmp = Interval(x - w, y - w); - result.data.push_back(tmp); - // Needed computations are also (x-z, x-z), (x-w, x-w), (y-z, y-z) and - // (y-w, y-w). It really must be here, do not comment it. You can try it - // and then execute tests for this module. - tmp = Interval(x-z, x-z); - result.data.push_back(tmp); - tmp = Interval(x-w, x-w); - result.data.push_back(tmp); - tmp = Interval(y-z, y-z); - result.data.push_back(tmp); - tmp = Interval(y-w, y-w); - result.data.push_back(tmp); - } - } - - result.normalize(); - return result; -} - -/** -* @brief Performs a multiplication of two ranges. -* @param[in] r1 The first range. -* @param[in] r2 The second range. -* -* @return The range representing the multiplication of @a r1 and @a r2. -*/ -Range operator*(const Range &r1, const Range &r2) -{ - // I should always work with non-empty ranges. - assert(!r1.empty() && !r2.empty()); - - // To make computation easier, we split the given ranges by special values. - Range r1s = r1.splitBySpecialValues(); - Range r2s = r2.splitBySpecialValues(); - - Range result; - - if (r1s.isIntegral() && r2s.isIntegral()) { - // If both ranges are integral, a different approach must be used because - // overflows can cause problems. Consider that we have two ranges: the - // first is (2,10) and the second is (255,255). If we use standard - // approach, we get (254,246). After normalizing, this result is (0,246) - // and (254,255). However, the correct result should be (246,254). - for (Range::const_iterator it = r1s.begin(); it != r1s.end(); it++) { - for (Range::const_iterator jt = r2s.begin(); jt != r2s.end(); jt++) { - const mpz_class &x = it->first.getInt(); - const mpz_class &y = it->second.getInt(); - const mpz_class &z = jt->first.getInt(); - const mpz_class &w = jt->second.getInt(); - - mpz_class limit1, limit2; - if ((x >= 0) && (y >= 0) && (z >= 0) && (w >= 0)) { - // Multiplication of positive intervals. - limit1 = x * z; - limit2 = y * w; - } else if ((x >= 0) && (y >= 0) && (z <= 0) && (w <= 0)) { - // Multiplication of the positive interval with the negative one. - limit1 = y * z; - limit2 = x * w; - } else if ((x <= 0) && (y <= 0) && (z >= 0) && (w >= 0)) { - // Multiplication of the negative interval with the positive one. - limit1 = x * w; - limit2 = y * z; - } else if ((x <= 0) && (y <= 0) && (z <= 0) && (w <= 0)) { - // Multiplication of negative intervals. - limit1 = y * w; - limit2 = x * z; - } - - // We need to know the actual type and scope of the result. - Number info = it->first * jt->first; - mpz_class scope = info.getMax().getInt() - info.getMin().getInt() + 1; - if ((limit2 - limit1) >= scope) { - // If the difference between computed limits is greater or equal - // to the scope of the result's type, we return maximal range. - return Range::getMaxRange(info); - } else { - // Otherwise, we have to convert mzp_class to Number and create - // interval. - Number l1 = Number(limit1, info.getBitWidth(), info.getSign()); - Number l2 = Number(limit2, info.getBitWidth(), info.getSign()); - result.data.push_back(Interval(l1, l2)); - } - } - } - } else { - // If at least one of the ranges is floating-point type, the result will - // be also floating-point. After the extension, both ranges will be - // floating-point type. So, no overflow problems will be here. - for (Range::const_iterator it = r1s.begin(); it != r1s.end(); it++) { - for (Range::const_iterator jt = r2s.begin(); jt != r2s.end(); jt++) { - const Number &x = it->first; - const Number &y = it->second; - const Number &z = jt->first; - const Number &w = jt->second; - Number l1 = x * z; - Number l2 = x * w; - Number l3 = y * z; - Number l4 = y * w; - // Firstly, I thought that there is a problem because of usage - // min() and max(). In C is weird behaviour when I compare - // signed and unsigned variables. However, here it is used only - // for floats. So, it is all right. - Number lower = min(min(l1, l2), min(l3, l4)); - Number upper = max(max(l1, l2), max(l3, l4)); - result.data.push_back(Interval(lower, upper)); - } - } - } - - result.normalize(); - return result; -} - -/** -* @brief Performs a real division of two ranges. -* @param[in] r1 The first range. -* @param[in] r2 The second range. -* -* @return The range representing the real division of @a r1 and @a r2. -*/ -Range rdiv(const Range &r1, const Range &r2) -{ - // This division works only for floating-point ranges. - assert(r1.isFloatingPoint() && r2.isFloatingPoint()); - - // I should always work with non-empty ranges. - assert(!r1.empty() && !r2.empty()); - - // To simplify the computation, we - // (1) extend them by C rules, - std::pair extR = Range::extensionByCRules(r1, r2); - // (2) split them by special values, and - Range r1s = extR.first.splitBySpecialValues(); - Range r2s = extR.second.splitBySpecialValues(); - // (3) split the ranges by 0.0. - r1s = r1s.splitByZero(); - r2s = r2s.splitByZero(); - - Range result; - - for (Range::const_iterator it = r1s.begin(); it != r1s.end(); it++) { - for (Range::const_iterator jt = r2s.begin(); jt != r2s.end(); jt++) { - // Consider two intervals (x, y) / (z, w). - const Number &x = it->first; - const Number &y = it->second; - const Number &z = jt->first; - const Number &w = jt->second; - - Number xw = rdiv(x, w); - Number xz = rdiv(x, z); - result.data.push_back(Interval(std::min(xw, xz), std::max(xw, xz))); - - Number yw = rdiv(y, w); - Number yz = rdiv(y, z); - result.data.push_back(Interval(std::min(yw, yz), std::max(yw, yz))); - } - } - - result.normalize(); - return result; -} - -/** -* @brief Performs an integral division operation over @a r1 and @a r2. -* -* @param[in] r1 The first range. -* @param[in] r2 The second range. -* @param[in] exact If @c true, do @c exact_div; otherwise, do @c trunc_div. -* -* @return The range representing the division of @a r1 and @a r2. -*/ -Range Range::performIntegralDivOp(const Range &r1, const Range &r2, bool exact) -{ - // This division works only for integral ranges. - assert(r1.isIntegral() && r2.isIntegral()); - - // I should always work with non-empty ranges. - assert(!r1.empty() && !r2.empty()); - - // If there is a possibility of dividing by zero, over approximate. - if (r2.containsZero()) { - return overApproximateBinaryOp(r1, r2); - } - - // To simplify the computation, we - // (1) extend them by C rules, and - std::pair extR = Range::extensionByCRules(r1, r2); - // (2) split the given ranges by special values. - Range r1s = extR.first.splitBySpecialValues(); - Range r2s = extR.second.splitBySpecialValues(); - - // If there is a possibility of dividing INT_MIN by -1, over approximate. - // The reason is that in C, INT_MIN / -1 has undefined behaviour. - if (r1s.isIntegral() && r1s.isSigned() && r1s.containsIntegralMin() && - r2s.containsIntegralMinusOne()) { - return overApproximateBinaryOp(r1s, r2s); - } - - Range result; - - for (Range::const_iterator it = r1s.begin(); it != r1s.end(); it++) { - for (Range::const_iterator jt = r2s.begin(); jt != r2s.end(); jt++) { - // Consider two intervals (x, y) / (z, w). - const Number &x = it->first; - const Number &y = it->second; - const Number &z = jt->first; - const Number &w = jt->second; - - Number xw = exact ? exact_div(x, w) : trunc_div(x, w); - Number xz = exact ? exact_div(x, z) : trunc_div(x, z); - result.data.push_back(Interval(std::min(xw, xz), std::max(xw, xz))); - - Number yw = exact ? exact_div(y, w) : trunc_div(y, w); - Number yz = exact ? exact_div(y, z) : trunc_div(y, z); - result.data.push_back(Interval(std::min(yw, yz), std::max(yw, yz))); - } - } - - result.normalize(); - return result; -} - -/** -* @brief Performs an exact division of two ranges. -* @param[in] r1 The first range. -* @param[in] r2 The second range. -* -* @return The range representing the exact division of @a r1 and @a r2. -*/ -Range exact_div(const Range &r1, const Range &r2) -{ - return Range::performIntegralDivOp(r1, r2, true); -} - -/** -* @brief Performs a trunc division of two ranges. -* @param[in] r1 The first range. -* @param[in] r2 The second range. -* -* @return The range representing the trunc division of @a r1 and @a r2. -*/ -Range trunc_div(const Range &r1, const Range &r2) -{ - return Range::performIntegralDivOp(r1, r2, false); -} - -/** -* @brief Performs a modulo of two ranges. -* @param[in] r1 The first range. -* @param[in] r2 The second range. -* -* @return The range representing the modulo of @a r1 and @a r2. -*/ -Range trunc_mod(const Range &r1, const Range &r2) -{ - // This modulo works only for integral ranges. - assert(r1.isIntegral() && r2.isIntegral()); - - // I should always work with non-empty ranges. - assert(!r1.empty() && !r2.empty()); - - // If there is a possibility of modulo by zero, over approximate. - if (r2.containsZero()) { - return overApproximateBinaryOp(r1, r2); - } - - // To simplify the computation, we - // (1) extend them by C rules, and - std::pair extR = Range::extensionByCRules(r1, r2); - // (2) split the given ranges by special values and by zero. - Range r1s = extR.first.splitBySpecialValues().splitByZero(); - Range r2s = extR.second.splitBySpecialValues().splitByZero(); - - // If there is a possibility of INT_MIN % -1, over approximate. - // The reason is that in C, INT_MIN % -1 has undefined behaviour. - if (r1s.isIntegral() && r1s.isSigned() && r1s.containsIntegralMin() && - r2s.containsIntegralMinusOne()) { - return overApproximateBinaryOp(r1s, r2s); - } - - Range result; - - // We cannot compute the result in the analogous way to other operations, - // meaning that for (x, y) % (z, w), we comute x % y, x % z, y % z, and y % - // w, and use these results. Indeed, for example, (-5, -5) % (-5, -1) - // should be (-4, 0), but both -5 % -5 and -5 % -1 equal 0. - // - // Therefore, what we do, for (x, y) % (z, w), we use the interval (x, 0) - // (if x < 0) or (0, y) (if x >= 0). This is a slight over approximation. - // However, it is correct and easier to compute than the precise result. - // - // In this way, it suffices to go over just the first range. Moreover, we - // use the fact that when computing x % y, the sign of the result is the - // sign of x. - for (Range::const_iterator it = r1s.begin(); it != r1s.end(); it++) { - const Number &x = it->first; - const Number &y = it->second; - - Number zero = x.assign(Number(0, x.getBitWidth(), x.isSigned())); - if (x < zero) { - // Use (x, 0). - result.data.push_back(Interval(x, zero)); - } else { // x >= zero - // Use (0, y). - result.data.push_back(Interval(zero, y)); - } - } - - result.normalize(); - return result; -} - -/** -* @brief Performs a not of a given range. Now, it only returns the maximal range. I -* do not see any pattern how to perform this operation on range. -* @param[in] r The first range. -* -* @return The range representing the bit not of @a r. -*/ -Range bitNot(const Range &r) -{ - // This operation works only for integral ranges. - assert(r.isIntegral()); - - // I should always work with non-empty ranges. - assert(!r.empty()); - - // Currently, we compute a precise result only if the range contains just a - // single number. - if (!r.containsOnlySingleNumber()) { - return overApproximateUnaryOp(r); - } - - // Compute a precise result. - return Range(bitNot(r[0].first)); -} - -/** -* @brief Performs an and of two ranges. Now, it only returns the maximal range. I -* do not see any pattern how to perform this operation on ranges. -* @param[in] r1 The first range. -* @param[in] r2 The second range. -* -* @return The range representing the and of @a r1 and @a r2. -*/ -Range bitAnd(const Range &r1, const Range &r2) -{ - // This operation works only for integral ranges. - assert(r1.isIntegral() && r2.isIntegral()); - - // I should always work with non-empty ranges. - assert(!r1.empty() && !r2.empty()); - - // Currently, we compute a precise result only if the ranges contain just a - // single number. - if (!r1.containsOnlySingleNumber() || !r2.containsOnlySingleNumber()) { - // Over approximate. - return overApproximateBinaryOp(r1, r2); - } - - // Compute a precise result. - return Range(bitAnd(r1[0].first, r2[0].first)); -} - -/** -* @brief Performs an inclusive or of two ranges. Now, it only returns the maximal -* range. I do not see any pattern how to perform this operation on ranges. -* @param[in] r1 The first range. -* @param[in] r2 The second range. -* -* @return The range representing the ior of @a r1 and @a r2. -*/ -Range bitOr(const Range &r1, const Range &r2) -{ - // This operation works only for integral ranges. - assert(r1.isIntegral() && r2.isIntegral()); - - // I should always work with non-empty ranges. - assert(!r1.empty() && !r2.empty()); - - // Currently, we compute a precise result only if the ranges contain just a - // single number. - if (!r1.containsOnlySingleNumber() || !r2.containsOnlySingleNumber()) { - // Over approximate. - return overApproximateBinaryOp(r1, r2); - } - - // Compute a precise result. - return Range(bitOr(r1[0].first, r2[0].first)); -} - -/** -* @brief Performs an exclusive or of two ranges. Now, it only returns the maximal -* range. I do not see any pattern how to perform this operation on ranges. -* @param[in] r1 The first range. -* @param[in] r2 The second range. -* -* @return The range representing the xor of @a r1 and @a r2. -*/ -Range bitXor(const Range &r1, const Range &r2) -{ - // This operation works only for integral ranges. - assert(r1.isIntegral() && r2.isIntegral()); - - // I should always work with non-empty ranges. - assert(!r1.empty() && !r2.empty()); - - // Currently, we compute a precise result only if the ranges contain just a - // single number. - if (!r1.containsOnlySingleNumber() || !r2.containsOnlySingleNumber()) { - // Over approximate. - return overApproximateBinaryOp(r1, r2); - } - - // Compute a precise result. - return Range(bitXor(r1[0].first, r2[0].first)); -} - -/** -* @brief Performs a left shift of two ranges. Now, it only returns the maximal -* range. I do not see any pattern how to perform this operation on ranges. -* @param[in] r1 The first range. -* @param[in] r2 The second range. -* -* @return The range representing the left shift of @a r1 and @a r2. -*/ -Range bitLeftShift(const Range &r1, const Range &r2) -{ - // This operation works only for integral ranges. - assert(r1.isIntegral() && r2.isIntegral()); - - // I should always work with non-empty ranges. - assert(!r1.empty() && !r2.empty()); - - // Currently, we compute a precise result only if the ranges contain just a - // single number. - if (!r1.containsOnlySingleNumber() || !r2.containsOnlySingleNumber()) { - // Over approximate. - return overApproximateBinaryOp(r1, r2); - } - - // If we are shifting more bits than the bit width of the left-hand side, - // like in `a << 33`, where `a` is a 32b integer, the result is undefined. - // Therefore, we have to over approximate in such a case. - if (r2[0].first > Number(r1[0].first.getNumOfBits(), r2[0].first.getBitWidth(), true)) { - return overApproximateBinaryOp(r1, r2); - } - - // Compute a precise result. - return Range(bitLeftShift(r1[0].first, r2[0].first)); -} - -/** -* @brief Performs a right shift of two ranges. Now, it only returns the maximal -* range. I do not see any pattern how to perform this operation on ranges. -* @param[in] r1 The first range. -* @param[in] r2 The second range. -* -* @return The range representing the right shift of @a r1 and @a r2. -*/ -Range bitRightShift(const Range &r1, const Range &r2) -{ - // This operation works only for integral ranges. - assert(r1.isIntegral() && r2.isIntegral()); - - // I should always work with non-empty ranges. - assert(!r1.empty() && !r2.empty()); - - // Currently, we compute a precise result only if the ranges contain just a - // single number. - if (!r1.containsOnlySingleNumber() || !r2.containsOnlySingleNumber()) { - // Over approximate. - return overApproximateBinaryOp(r1, r2); - } - - // If we are shifting more bits than the bit width of the left-hand side, - // like in `a >> 33`, where `a` is a 32b integer, the result is undefined. - // Therefore, we have to over approximate in such a case. - if (r2[0].first > Number(r1[0].first.getNumOfBits(), r2[0].first.getBitWidth(), true)) { - return overApproximateBinaryOp(r1, r2); - } - - // Compute a precise result. - return Range(bitRightShift(r1[0].first, r2[0].first)); -} - -/** -* @brief Performs a left rotate of two ranges. Now, it only returns the maximal -* range. I do not see any pattern how to perform this operation on ranges. -* @param[in] r1 The first range. -* @param[in] r2 The second range. -* -* @return The range representing the left rotate of @a r1 and @a r2. -*/ -Range bitLeftRotate(const Range &r1, const Range &r2) -{ - // Currently, we just over approximate the result. - return overApproximateBinaryOp(r1, r2); -} - -/** -* @brief Performs a right rotate of two ranges. Now, it only returns the maximal -* range. I do not see any pattern how to perform this operation on ranges. -* @param[in] r1 The first range. -* @param[in] r2 The second range. -* -* @return The range representing the right rotate of @a r1 and @a r2. -*/ -Range bitRightRotate(const Range &r1, const Range &r2) -{ - // Currently, we just over approximate the result. - return overApproximateBinaryOp(r1, r2); -} - -/** -* @brief Over-approximates the result of unary operations, like not. -*/ -Range overApproximateUnaryOp(const Range &r) -{ - // I should always work with non-empty ranges. - assert(!r.empty()); - - // Bit operations work only for integral ranges. - assert(r.isIntegral()); - - // We need to promote the range to get a proper result. We do this by - // extending the range r with itself. - std::pair promR = Range::extensionByCRules(r, r); - return Range::getMaxRange(promR.first[0].first); -} - -/** -* @brief Over-approximates the result of binary operations, like aditions, -* shifts and so on. -*/ -Range overApproximateBinaryOp(const Range &r1, const Range &r2) -{ - // I should always work with non-empty ranges. - assert(!r1.empty() && !r2.empty()); - - // Bit operations work only for integral ranges. - assert(r1.isIntegral() && r2.isIntegral()); - - // We need to extend the ranges to get a proper result. - std::pair extR = Range::extensionByCRules(r1, r2); - return Range::getMaxRange(extR.first[0].first); -} - -/** -* @brief Computes the absolute value of the given range @a r. -*/ -Range abs(const Range &r) -{ - // I should always work with non-empty range. - assert(!r.empty()); - - // Abs instruction is generated only for signed integral ranges. - assert(r.isIntegral() && r.isSigned()); - - Range rs = r.splitBySpecialValues(); - Range result; - for (Range::const_iterator it = rs.begin(); it != rs.end(); ++it) { - Number absFirst = abs(it->first); - Number absSecond = abs(it->second); - if (absFirst <= absSecond) { - result.data.push_back(Range::Interval(absFirst, absSecond)); - } else { - result.data.push_back(Range::Interval(absSecond, absFirst)); - } - } - - result.normalize(); - return result; -} - -/** -* @brief Computes the minimal range from the given ranges @a r1 and @a r2. -* -* Preconditions: -* - Since Code Listener does not generate min instruction for floating-point types -* this function does not cover the behaviour if the interval (NAN, NAN) is in -* the range. However, otherwise it works correctly even for floating-point types. -*/ -Range min(const Range &r1, const Range &r2) -{ - // I should always work with non-empty ranges. - assert(!r1.empty() && !r2.empty()); - - // We want ranges to have the same type. Otherwise, we have problems with - // signed and unsigned integral ranges. - std::pair r = Range::extensionByCRules(r1, r2); - Range r1s = r.first; - Range r2s = r.second; - - Range result; - Range::const_iterator it = r1s.begin(); - Range::const_iterator jt = r2s.begin(); - - while (it != r1s.end() && jt != r2s.end()) { - const Number &x = it->first; - const Number &y = it->second; - const Number &z = jt->first; - const Number &w = jt->second; - - if (x <= z && y <= w) { - // The first interval is minimal. It also covers the possibility if - // the first interval overlaps the second one or intervals are same. - result.data.push_back(Range::Interval(x, y)); - ++it; - } else if (z <= x && w <= y) { - // The second interval is minimal. It also covers the possibility if - // the second interval overlaps the first one or intervals are same. - result.data.push_back(Range::Interval(z, w)); - ++jt; - } else { - // If one from intervals is nested in the other one. - Number lower = min(x, z); - Number upper = min(y, w); - result.data.push_back(Range::Interval(lower, upper)); - if (y < w) { - ++it; - } else { - ++jt; - } - } - } - result.normalize(); - return result; -} - -/** -* @brief Computes the maximal range from the given ranges @a r1 and @a r2. -* -* Preconditions: -* - Since Code Listener does not generate max instruction for floating-point types -* this function does not cover the behaviour if the interval (NAN, NAN) is in -* the range. However, otherwise it works correctly even for floating-point types. -*/ -Range max(const Range &r1, const Range &r2) -{ - // I should always work with non-empty ranges. - assert(!r1.empty() && !r2.empty()); - - // We want ranges to have the same type. Otherwise, we have problems with - // signed and unsigned integral ranges. - std::pair r = Range::extensionByCRules(r1, r2); - Range r1s = r.first; - Range r2s = r.second; - - Range result; - Range::const_reverse_iterator it = r1s.rbegin(); - Range::const_reverse_iterator jt = r2s.rbegin(); - - while (it != r1s.rend() && jt != r2s.rend()) { - const Number &x = it->first; - const Number &y = it->second; - const Number &z = jt->first; - const Number &w = jt->second; - - if (x >= z && y >= w) { - // The first interval is maximal. It also covers the possibility if - // the first interval overlaps the second one or intervals are same. - result.data.push_back(Range::Interval(x, y)); - ++it; - } else if (z >= x && w >= y) { - // The second interval is maximal. It also covers the possibility if - // the second interval overlaps the first one or intervals are same. - result.data.push_back(Range::Interval(z, w)); - ++jt; - } else { - // If one from intervals is nested in the other one. - Number lower = max(x, z); - Number upper = max(y, w); - result.data.push_back(Range::Interval(lower, upper)); - if (x < z) { - ++jt; - } else { - ++it; - } - } - } - result.normalize(); - return result; -} - -/** -* @brief Returns the union of the given ranges @a r1 and @a r2. -* -* Preconditions: -* - This should be used only for @a r1 and @a r2 that have the same type. -* - It could be used for empty ranges, too. -*/ -Range unite(const Range& r1, const Range& r2) -{ - Range result; - for (Range::const_iterator it = r1.begin(); it != r1.end(); ++it) - result.data.push_back(*it); - - for (Range::const_iterator it = r2.begin(); it != r2.end(); ++it) - result.data.push_back(*it); - - result.normalize(); - return result; -} - -/** -* @brief Returns the range representing the intersection of @a r1 and @a r2. It is -* worth to note that (NAN, NAN) is never covered in the result because NAN -* is not equal to anything (even NAN). -* -* Preconditions: -* - Both ranges have the same type. -*/ -Range intersect(const Range& r1, const Range& r2) -{ - if (r1.empty() || r2.empty()) - return Range(); - - assert(r1.hasSameTypeAs(r2)); - - Range result; - - for (Range::const_iterator it = r1.begin(); it != r1.end(); ++it) { - for (Range::const_iterator jt = r2.begin(); jt != r2.end(); ++jt) { - if (it->first >= jt->first && it->second <= jt->second) { - // Interval from the r1 range is nested in interval from r2. - Interval tmp = Interval(it->first, it->second); - result.data.push_back(tmp); - } else if (jt->first >= it->first && jt->second <= it->second) { - // Interval from the r2 range is nested in interval from r1. - Interval tmp = Interval(jt->first, jt->second); - result.data.push_back(tmp); - } else if (it->second == jt->first) { - // The upper bound of the interval from the range r1 is also the - // lower bound for interval from the range r2. - Interval tmp = Interval(it->second, it->second); - result.data.push_back(tmp); - } else if (jt->second == it->first) { - // The upper bound of the interval from the range r2 is also the - // lower bound for interval from the range r1. - Interval tmp = Interval(jt->second, jt->second); - result.data.push_back(tmp); - } else if (jt->first < it->second && jt->second > it->second) { - // The interval from the range r1 is overlapped by the interval from - // the range r2. - Interval tmp = Interval(jt->first, it->second); - result.data.push_back(tmp); - } else if (it->first < jt->second && it->second > jt->second) { - // The interval from the range r2 is overlapped by the interval from - // the range r1. - Interval tmp = Interval(it->first, jt->second); - result.data.push_back(tmp); - } - } - } - result.normalize(); - return result; -} - -/** -* @brief Computes the new range that is valid after the comparison for equality -* of the given two ranges (@a r1 and @a r2) is evaluated as true. The -* resulted range is valid for the range @a r1. To compute new range for -* the range @a r2, it is necessary to call this function with swapped -* parameters. The result cannot be empty range. In this case, -* over-approximation is done. -*/ -Range computeRangeForEq(const Range &r1, const Range &r2) -{ - // I should always work with non-empty ranges. - assert(!r1.empty() && !r2.empty()); - - pair r = Range::extensionByCRules(r1, r2); - Range r1Extend = r.first; - Range r2Extend = r.second; - Range result = intersect(r1Extend, r2Extend); - - if (!result.empty()) { - // We need to keep the right type of the range, so we use assign to do it - // automatically for us. - result = r1.assign(result); - result.normalize(); - return result; - } else { - // The result is empty, so we have to over-approximate. - return r1.assign(r2); - } -} - -/** -* @brief Computes the new range that is valid after the comparison for non-equality -* of the given two ranges (@a r1 and @a r2) is evaluated as true. The -* resulted range is valid for the range @a r1. To compute new range for -* the range @a r2, it is necessary to call this function with swapped -* parameters. -*/ -Range computeRangeForNeq(const Range &r1, const Range &r2) -{ - // I should always work with non-empty ranges. - assert(!r1.empty() && !r2.empty()); - - // This is correct result in all cases. In the case that the range r1 and r2 - // contains only one same number, the result is over-approximation because - // the result should be an empty range. However, this is not desirable. - return r1; -} - -/** -* @brief Computes the new range that is valid after the comparison (greater than) -* of the given two ranges (@a r1 and @a r2) is evaluated as true. The -* resulted range is valid for the range @a r1. To compute new range for -* the range @a r2, it is necessary to call opposite function (less than) -* with swapped parameters. The result cannot be empty range. -*/ -Range computeRangeForGt(const Range &r1, const Range &r2) -{ - // I should always work with non-empty ranges. - assert(!r1.empty() && !r2.empty()); - - // After extension, both ranges have same type. - pair r = Range::extensionByCRules(r1, r2); - Range r1E = r.first; - Range r2E = r.second; - - Range result; - Number minFromR2 = r2E.getMin(); - - for (Range::const_iterator it = r1E.begin(); it != r1E.end(); ++it) { - const Number &x = it->first; - const Number &y = it->second; - - if (x.isNotNumber() && y.isNotNumber()) { - // We have to take care of the (NAN, NAN) interval separately because - // it always returns false when compared to other numbers (even NAN). - continue; - } - - if (x > minFromR2 && y > minFromR2) { - // If the whole r1 interval is greater than than minimal value from - // the range r2. - result.data.push_back(Range::Interval(x, y)); - } else if (x <= minFromR2 && y > minFromR2) { - // If the part of the r1 interval is less than than minimal value - // from the range r2. - result.data.push_back(Range::Interval(minFromR2 + - minFromR2.getEpsilon(), y)); - } - } - - if (!result.empty()) { - // We need to keep the right type of the range, so we use assign to do it - // automatically for us. - result = r1.assign(result); - result.normalize(); - return result; - } else { - // The result is empty, so we have to over-approximate. We return the - // interval (min from r2 + epsilon, max of r1's type). - Number r2Min = r1[0].first.assign(r2E[0].first); - Number r1Epsilon = r1[0].first.getEpsilon(); - if (r1.isIntegral()) { - // When the min from r2 is the maximum of r1, use it instead of - // adding one. - Number r1Max = r1[0].first.getMax(); - Number newMin = r2Min.isMax() ? r1Max : r2Min + r1Epsilon; - return Range(Interval(newMin, r1Max)); - } else { // r1.isFloatingPoint() - // The maximal value for floating-points is INFINITY. - return Range(Interval(r2Min + r1Epsilon, r1[0].first.getPositiveInf())); - } - } -} - -/** -* @brief Computes the new range that is valid after the comparison (less than) -* of the given two ranges (@a r1 and @a r2) is evaluated as true. The -* resulted range is valid for the range @a r1. To compute new range for -* the range @a r2, it is necessary to call opposite function (greater than) -* with swapped parameters. The result cannot be empty range. -*/ -Range computeRangeForLt(const Range &r1, const Range &r2) -{ - // I should always work with non-empty ranges. - assert(!r1.empty() && !r2.empty()); - - // After extension, both ranges have same type. - pair r = Range::extensionByCRules(r1, r2); - Range r1E = r.first; - Range r2E = r.second; - - Range result; - Number maxFromR2 = r2E.getMax(); - - for (Range::const_iterator it = r1E.begin(); it != r1E.end(); ++it) { - const Number &x = it->first; - const Number &y = it->second; - - if (x.isNotNumber() && y.isNotNumber()) { - // We have to take care of the (NAN, NAN) interval separately because - // it always returns false when compared to other numbers (even NAN). - continue; - } - - if (x < maxFromR2 && y < maxFromR2) { - // If the whole r1 interval is less than than maximal value from - // the range r2. - result.data.push_back(Range::Interval(x, y)); - } else if (x < maxFromR2 && y >= maxFromR2) { - // If the part of the r1 interval is less than than maximal value - // from the range r2. - result.data.push_back(Range::Interval(x, maxFromR2 - y.getEpsilon())); - } else { - // The current r1 interval is bigger than maximal value from r2. - break; - } - } - - if (!result.empty()) { - // We need to keep the right type of the range, so we use assign to do it - // automatically for us. - result = r1.assign(result); - result.normalize(); - return result; - } else { - // The result is empty, so we have to over-approximate. We return the - // interval (min of r1's type, max from r2 - epsilon). - Number r2Max = r1[0].first.assign(r2E[r2.size() - 1].second); - Number r1Epsilon = r1[0].first.getEpsilon(); - if (r1.isIntegral()) { - // When the max from r2 is the minimum of r1, use it instead of - // subtracting one. - Number r1Min = r1[0].first.getMin(); - Number newMax = r2Max.isMin() ? r1Min : r2Max - r1Epsilon; - return Range(Interval(r1Min, newMax)); - } else { // r1.isFloatingPoint() - // The minimal value for floating-points is -INFINITY. - return Range(Interval(r1[0].first.getNegativeInf(), - r2Max - r1Epsilon)); - } - } -} - -/** -* @brief Computes the new range that is valid after the comparison (greater than or -* equal) of the given two ranges (@a r1 and @a r2) is evaluated as true. The -* resulted range is valid for the range @a r1. To compute new range for -* the range @a r2, it is necessary to call opposite function (less than or -* equal) with swapped parameters. The result cannot be empty range. -*/ -Range computeRangeForGtEq(const Range &r1, const Range &r2) -{ - // I should always work with non-empty ranges. - assert(!r1.empty() && !r2.empty()); - - // After extension, both ranges have same type. - pair r = Range::extensionByCRules(r1, r2); - Range r1E = r.first; - Range r2E = r.second; - - Range result; - Number minFromR2 = r2E.getMin(); - - for (Range::const_iterator it = r1E.begin(); it != r1E.end(); ++it) { - const Number &x = it->first; - const Number &y = it->second; - - if (x.isNotNumber() && y.isNotNumber()) { - // We have to take care of the (NAN, NAN) interval separately because - // it always returns false when compared to other numbers (even NAN). - continue; - } - - if (x >= minFromR2 && y >= minFromR2) { - // If the whole r1 interval is greater than or equal than minimal value - // from the range r2. - result.data.push_back(Range::Interval(x, y)); - } else if (x < minFromR2 && y >= minFromR2) { - // If the part of the r1 interval is less than or equal than maximal - // value from the range r2. - result.data.push_back(Range::Interval(minFromR2, y)); - } - } - - if (!result.empty()) { - // We need to keep the right type of the range, so we use assign to do it - // automatically for us. - result = r1.assign(result); - result.normalize(); - return result; - } else { - // The result is empty, so we have to over-approximate. We return the - // interval (min from r2, max of r1's type). - Number r2Min = r1[0].first.assign(r2E[0].first); - if (r1.isIntegral()) { - return Range(Interval(r2Min, r1[0].first.getMax())); - } else { // r1.isFloatingPoint() - // The maximal value for floating-points is INFINITY. - return Range(Interval(r2Min, r1[0].first.getPositiveInf())); - } - } -} - -/** -* @brief Computes the new range that is valid after the comparison (less than or -* equal) of the given two ranges (@a r1 and @a r2) is evaluated as true. The -* resulted range is valid for the range @a r1. To compute new range for -* the range @a r2, it is necessary to call opposite function (greater than -* or equal) with swapped parameters. The result cannot be empty range. -*/ -Range computeRangeForLtEq(const Range &r1, const Range &r2) -{ - // I should always work with non-empty ranges. - assert(!r1.empty() && !r2.empty()); - - // After extension, both ranges have same type. - pair r = Range::extensionByCRules(r1, r2); - Range r1E = r.first; - Range r2E = r.second; - - Range result; - Number maxFromR2 = r2E.getMax(); - - for (Range::const_iterator it = r1E.begin(); it != r1E.end(); ++it) { - const Number &x = it->first; - const Number &y = it->second; - - if (x.isNotNumber() && y.isNotNumber()) { - // We have to take care of the (NAN, NAN) interval separately because - // it always returns false when compared to other numbers (even NAN). - continue; - } - - if (x <= maxFromR2 && y <= maxFromR2) { - // If the whole r1 interval is less than or equal than maximal value - // from the range r2. - result.data.push_back(Range::Interval(x, y)); - } else if (x <= maxFromR2 && y > maxFromR2) { - // If the part of the r1 interval is less than or equal than maximal - // value from the range r2. - result.data.push_back(Range::Interval(x, maxFromR2)); - } else { - // The current r1 interval is bigger than maximal value from r2. - break; - } - } - - if (!result.empty()) { - // We need to keep the right type of the range, so we use assign to do it - // automatically for us. - result = r1.assign(result); - result.normalize(); - return result; - } else { - // The result is empty, so we have to over-approximate. We return the - // interval (min of r1's type, max from r2). - Number r2Max = r1[0].first.assign(r2E[r2.size() - 1].second); - if (r1.isIntegral()) { - return Range(Interval(r1[0].first.getMin(), r2Max)); - } else { // r1.isFloatingPoint() - // The minimal value for floating-points is -INFINITY. - return Range(Interval(r1[0].first.getNegativeInf(), r2Max)); - } - } -} - -/** -* @brief Emits @a r into @a os. -*/ -std::ostream& operator<<(std::ostream& os, const Range& r) -{ - os << "{ "; - for (Range::const_iterator it = r.begin(); it != r.end(); it++) { - os << "<" << it->first << ", " << it->second << ">"; - if (it + 1 != r.end()) - os << ", "; - } - os << " }" << endl; - - return os; -} diff --git a/vra/Range.h b/vra/Range.h deleted file mode 100644 index ed7d42126..000000000 --- a/vra/Range.h +++ /dev/null @@ -1,184 +0,0 @@ -/** -* @author Daniela Ďuričeková, xduric00@stud.fit.vutbr.cz -* @file Range.h -* @brief Class that represents the value range of the variable. -* @date 2012 -*/ - -#ifndef GUARD_RANGE_H -#define GUARD_RANGE_H - -#include -#include - -#include "Number.h" - -/** -* @brief Class that represents the value range of the variable. -* -* This class represents the value range that variable can acquire during the -* program execution and can be used for variables of all types in the C language. -* Also all reasonable operations over ranges are supplied by this class. However, -* the results of some operations are over-approximated. -* -* When a range has more than MAX_INTERVALS_IN_RANGE, mergeIntervals() is called. -*/ -class Range { - public: - /// Definition of interval. - typedef std::pair Interval; - - /// Definition of the iterator for the Range class. - typedef std::vector::iterator iterator; - - /// Definition of the constant iterator for the Range class. - typedef std::vector::const_iterator const_iterator; - - /// Definition of the reverse iterator for the Range class. - typedef std::vector::reverse_iterator reverse_iterator; - - /// Definition of the constant iterator for the Range class. - typedef std::vector::const_reverse_iterator const_reverse_iterator; - - /// Definition of the type for expressing size. - typedef size_t size_type; - - /// Returns the iterator to the first interval. - iterator begin() { return data.begin(); } - - /// Returns the constant iterator to the first interval. - const_iterator begin() const { return data.begin(); } - - /// Returns the iterator behind the last interval. - iterator end() { return data.end(); } - - /// Returns the constant iterator behind the last interval. - const_iterator end() const { return data.end(); } - - /// Returns the iterator to the last interval. - reverse_iterator rbegin() { return data.rbegin(); } - - /// Returns the constant iterator to the last interval. - const_reverse_iterator rbegin() const { return data.rbegin(); } - - /// Returns the iterator before the first interval. - reverse_iterator rend() { return data.rend(); } - - /// Returns the constant iterator before the first interval. - const_reverse_iterator rend() const { return data.rend(); } - - /// Returns the number of stored intervals. - size_type size() const { return data.size(); } - - /// Returns @c true if range is empty. - bool empty() const { return size() == 0; } - - /// Returns the interval on the given position. - Interval& operator[](size_type i) { return data[i]; } - - /// Returns the constant interval on the given position. - const Interval& operator[](size_type i) const { return data[i]; } - - Range(); - explicit Range(Number n); - explicit Range(Interval i); - Range(Interval i1, Interval i2); - Range(Interval i1, Interval i2, Interval i3); - Range(Interval i1, Interval i2, Interval i3, Interval i4); - - Range assign(const Range &r) const; - Range expand() const; - Range mergeIntervals() const; - - bool containsNan() const; - bool containsPositiveInf() const; - bool containsNegativeInf() const; - bool containsTrue() const; - bool containsFalse() const; - bool containsZero() const; - bool isIntegral() const; - bool isFloatingPoint() const; - bool isSigned() const; - bool isUnsigned() const; - bool hasSameTypeAs(const Range &r) const; - bool containsOnlySingleNumber() const; - bool containsIntegralMin() const; - bool containsIntegralMinusOne() const; - Number getMax() const; - Number getMin() const; - - static Range getMaxRange(const Number &n); - - friend bool operator==(const Range &r1, const Range &r2); - friend bool operator!=(const Range &r1, const Range &r2); - - friend Range logicalEq(const Range &r1, const Range &r2); - friend Range logicalNeq(const Range &r1, const Range &r2); - friend Range logicalLt(const Range &r1, const Range &r2); - friend Range logicalGt(const Range &r1, const Range &r2); - friend Range logicalLtEq(const Range &r1, const Range &r2); - friend Range logicalGtEq(const Range &r1, const Range &r2); - - friend Range operator-(const Range &r); - friend Range operator+(const Range &r1, const Range &r2); - friend Range operator-(const Range &r1, const Range &r2); - friend Range operator*(const Range &r1, const Range &r2); - friend Range rdiv(const Range &r1, const Range &r2); - friend Range exact_div(const Range &r1, const Range &r2); - friend Range trunc_div(const Range &r1, const Range &r2); - friend Range trunc_mod(const Range &r1, const Range &r2); - - friend Range logicalNot(const Range &r); - friend Range logicalAnd(const Range &r1, const Range &r2); - friend Range logicalOr(const Range &r1, const Range &r2); - friend Range logicalXor(const Range &r1, const Range &r2); - - friend Range overApproximateUnaryOp(const Range &r); - friend Range overApproximateBinaryOp(const Range &r1, const Range &r2); - - friend Range bitNot(const Range &r); - friend Range bitAnd(const Range &r1, const Range &r2); - friend Range bitOr(const Range &r1, const Range &r2); - friend Range bitXor(const Range &r1, const Range &r2); - friend Range bitLeftShift(const Range &r1, const Range &r2); - friend Range bitRightShift(const Range &r1, const Range &r2); - friend Range bitLeftRotate(const Range &r1, const Range &r2); - friend Range bitRightRotate(const Range &r1, const Range &r2); - - friend Range abs(const Range &r); - friend Range intToFloat(const Range &r); - friend Range min(const Range &r1, const Range &r2); - friend Range max(const Range &r1, const Range &r2); - - friend Range unite(const Range &r1, const Range &r2); - friend Range intersect(const Range& r1, const Range& r2); - - friend Range computeRangeForEq(const Range &r1, const Range &r2); - friend Range computeRangeForNeq(const Range &r1, const Range &r2); - friend Range computeRangeForGt(const Range &r1, const Range &r2); - friend Range computeRangeForLt(const Range &r1, const Range &r2); - friend Range computeRangeForGtEq(const Range &r1, const Range &r2); - friend Range computeRangeForLtEq(const Range &r1, const Range &r2); - - friend std::ostream& operator<<(std::ostream&, const Range&); - - private: - static Range performIntegralDivOp(const Range &r1, const Range &r2, - bool exact); - - void normalize(); - void mergeIntervalsInPlace(); - Range splitBySpecialValues() const; - Range splitByZero() const; - static std::pair - extensionByCRules(const Range &r1, const Range &r2); - - /// Stores the intervals. - std::vector data; - - /// Maximal number of intervals in a range (after that, - /// mergeIntervals() is automatically called). - static const size_t MAX_INTERVALS_IN_RANGE = 15; -}; - -#endif diff --git a/vra/Utility.cc b/vra/Utility.cc deleted file mode 100644 index 6f4a134d8..000000000 --- a/vra/Utility.cc +++ /dev/null @@ -1,156 +0,0 @@ -/** -* @author Daniela Ďuričeková, xduric00@stud.fit.vutbr.cz -* @file Utility.cc -* @brief Class implements help functions for value-range analysis. -* @date 2012 -*/ - -#undef NDEBUG // It is necessary for using assertions. - -#include -#include -#include "Utility.h" - -using std::deque; - -/** -* @brief Converts @c cl_operand to the instance of the @c Number class. -* -* @param[in] operand It will be converted to the @c Number object. -* -* @return @c Number instance that was created from @a operand. -* -* Preconditions: -* - @code operand->code == CL_OPERAND_VAR || operand->type == CL_OEPRAND_CST @endcode -*/ -Number Utility::convertOperandToNumber(const cl_operand *operand) -{ - // Is should be used only for variables or constant. - assert(operand->code == CL_OPERAND_VAR || operand->code == CL_OPERAND_CST); - - // Bit size of the type of the constant. - int bitWidth; - - if (operand->code == CL_OPERAND_CST) { - switch ((operand->data).cst.code) { - case CL_TYPE_INT: - bitWidth = (operand->type)->size; - if ((operand->type)->is_unsigned) { - // Unsigned integral number. - unsigned long value = (operand->data).cst.data.cst_uint.value; - return Number(value, bitWidth, false); - } else { - // Signed integral value. - long value = (operand->data).cst.data.cst_int.value; - return Number(value, bitWidth, true); - } - - case CL_TYPE_REAL: { - bitWidth = (operand->type)->size; - long double value = (operand->data).cst.data.cst_real.value; - return Number(value, bitWidth); - } - - default: - // CL_TYPE_VOID, CL_TYPE_UNKNOWN, CL_TYPE_PTR, CL_TYPE_STRUCT, - // CL_TYPE_UNION, CL_TYPE_ARRAY, CL_TYPE_FNC, CL_TYPE_CHAR, - // CL_TYPE_BOOL, CL_TYPE_ENUM, CL_TYPE_STRING - std::cerr << "Code of the constant: " - << ((operand->data).cst.code) << std::endl; - assert(!"Unsupported!"); - return Number(0, sizeof(int), true); - } - } else if (operand->code == CL_OPERAND_VAR) { - int bitWidth = operand->type->size; - switch (operand->type->code) { - case CL_TYPE_INT: - if (operand->type->is_unsigned) { - // Unsigned integral number. - return Number(0, bitWidth, false); - } else { - // Signed integral value. - return Number(0, bitWidth, true); - } - - case CL_TYPE_BOOL: - return Number(0, bitWidth, true); - - case CL_TYPE_REAL: - return Number(0.0, bitWidth); - - default: - // CL_TYPE_VOID, CL_TYPE_UNKNOWN, CL_TYPE_PTR, CL_TYPE_UNION, - // CL_TYPE_FNC, CL_TYPE_CHAR, CL_TYPE_ENUM, CL_TYPE_STRING - std::cerr << "Type of variable: " << (operand->type->code) << std::endl; - assert(!"Unsupported!"); - return Number(0, bitWidth, true); - } - } - - assert(!"Should not happen!"); - return Number(0, sizeof(int), true); -} - -/** -* @brief According to the type of the @a operand, it returns the maximal -* possible range. -* -* Preconditions: -* - @code operand->code == CL_OPERAND_VAR @endcode -*/ -Range Utility::getMaxRange(const cl_operand &operand, deque indexes) -{ - // Is should be used only for variables. - assert(operand.code == CL_OPERAND_VAR); - - const struct cl_type *currentType; - if (operand.accessor != NULL && !indexes.empty()) { - currentType = operand.accessor->type; - } else { - currentType = operand.type; - } - - // If the variable is nested in a structure or in an array. - if (currentType->code == CL_TYPE_STRUCT || currentType->code == CL_TYPE_ARRAY) { - while (currentType->code != CL_TYPE_INT && - currentType->code != CL_TYPE_REAL && - currentType->code != CL_TYPE_ENUM && - currentType->code != CL_TYPE_BOOL) { - int index = indexes.front(); - indexes.pop_front(); - currentType = ((currentType->items)[index]).type; - } - } - - // Size of the simple variable. - int bitWidth = currentType->size; - - switch (currentType->code) { - case CL_TYPE_INT: - if (currentType->is_unsigned) { - // Unsigned integral number. - return Range::getMaxRange(Number(0, bitWidth, false)); - } else { - // Signed integral value. - return Range::getMaxRange(Number(0, bitWidth, true)); - } - - case CL_TYPE_BOOL: - return Range(Range::Interval(Number(0, sizeof(int), true), - Number(1, sizeof(int), true))); - - case CL_TYPE_REAL: - return Range::getMaxRange(Number(0.0, bitWidth)); - - case CL_TYPE_ENUM: - return Range::getMaxRange(Number(0, bitWidth, true)); - - default: - // CL_TYPE_VOID, CL_TYPE_UNKNOWN, CL_TYPE_PTR, CL_TYPE_UNION, - // CL_TYPE_FNC, CL_TYPE_CHAR, CL_TYPE_ENUM, CL_TYPE_STRING - std::cerr << "Type of variable: " << (operand.type->code) << std::endl; - assert(!"Unsupported!"); - return Range(); - } -} - diff --git a/vra/Utility.h b/vra/Utility.h deleted file mode 100644 index 45c9553c3..000000000 --- a/vra/Utility.h +++ /dev/null @@ -1,30 +0,0 @@ -/** -* @author Daniela Ďuričeková, xduric00@stud.fit.vutbr.cz -* @file Utility.h -* @brief Class implements help functions for value-range analysis. -* @date 2012 -*/ - -#ifndef GUARD_UTILITY_H -#define GUARD_UTILITY_H - -#include -#include -#include "Number.h" -#include "Range.h" - -/** -* @brief Class implements help functions for value-range analysis. -*/ -class Utility { - private: - /// Just for assurance that nobody will try to use it. - Utility() { } - - public: - static Number convertOperandToNumber(const cl_operand *operand); - static Range getMaxRange(const cl_operand &operand, - std::deque indexes = std::deque()); -}; - -#endif diff --git a/vra/ValueAnalysis.cc b/vra/ValueAnalysis.cc deleted file mode 100644 index dfccf50aa..000000000 --- a/vra/ValueAnalysis.cc +++ /dev/null @@ -1,1145 +0,0 @@ -/** -* @author Daniela Ďuričeková, xduric00@stud.fit.vutbr.cz -* @file ValueAnalysis.cc -* @brief Implementation of the class that performs value-range analysis -* and stores the result. -* @date 2012 -*/ - -#undef NDEBUG // It is necessary for using assertions. - -#include -#include -#include -#include - -#include "Utility.h" -#include "ValueAnalysis.h" -#include "OperandToMemoryPlace.h" -#include "GlobAnalysis.h" - -using CodeStorage::Fnc; -using CodeStorage::Storage; -using CodeStorage::ControlFlow; -using CodeStorage::Block; -using CodeStorage::Insn; -using CodeStorage::TTargetList; -using CodeStorage::TOperandList; -using std::string; -using std::ostream; -using std::endl; -using std::vector; -using std::cout; -using std::deque; -using std::sort; -using std::pair; - -ValueAnalysis::BlockToTrimmedRangesMap ValueAnalysis::blockToTrimmedRangesMap; -ValueAnalysis::BlockToResultMap ValueAnalysis::blockToInputRangesMap; -ValueAnalysis::BlockToResultMap ValueAnalysis::blockToOutputRangesMap; -ValueAnalysis::SchedulerQueue ValueAnalysis::todoQueue; -ValueAnalysis::SchedulerSet ValueAnalysis::todoSet; -ValueAnalysis::BlockToCounterMap ValueAnalysis::blockToCounterMap; -LoopFinder::BlockToUpperLimit ValueAnalysis::tripCountOfBlockMap; - -const unsigned ValueAnalysis::NumberOfPassesBeforeExpand = 1000; - -namespace { - -/** -* @brief Sorts memory places information alphabetically according to the names of -* variables stored in memory places. -*/ -bool sortBlockInfo(const ValueAnalysis::MemoryPlaceRangePair &f, - const ValueAnalysis::MemoryPlaceRangePair &s) -{ - return f.first->asString() < s.first->asString(); -} - -} - -/** -* @brief Schedules the block @a block. If @a block was scheduled earlier, it does -* nothing. Otherwise, it inserts @a block into schedulers. -*/ -void ValueAnalysis::scheduleBlock(const Block *block) { - if (todoSet.find(block) == todoSet.end()) { - // If block was not scheduled, we schedule it. - todoQueue.push(block); - todoSet.insert(block); - } -} - -/** -* @brief Gets the range for the given operand @a src. If @a src represents constant, -* new range is created from this constant. If @a src represents variable and -* is stored in @a output, the corresponding range from @a output is returned. -* Otherwise, maximal possible range is returned. -*/ -Range ValueAnalysis::getRange(const struct cl_operand &src, - MemoryPlaceToRangeMap &output, - deque indexes) -{ - Range srcRange; - - if (src.code == CL_OPERAND_CST) { - // Right operand of the unary operation is a constant. - Number num = Utility::convertOperandToNumber(&src); - srcRange = Range(num); - } else if (src.code == CL_OPERAND_VAR) { - // Right operand of the unary operation is a variable. - MemoryPlace *srcVar = OperandToMemoryPlace::convert(&src, indexes); - if (output.find(srcVar) != output.end()) { - srcRange = output[srcVar]; - } else { - // If we do not know what is in the variable, we set the maximal - // possible range. This is used also for the assignment of structure - // to another structure. - srcRange = Utility::getMaxRange(src, indexes); - output[srcVar] = srcRange; - } - } - - return srcRange; -} - -/** -* @brief Assigns simple element @a src into the simple element @a dst. Simple -* element can be a variable, item in a structure or element of an array. -* -* @param[in] dst Destination operand. -* @param[in] src Source operand. -* @param[out] output Stores the result. -* @param[in] indSrc Indexes for source operand. -* @param[in] indDst Indexes for destination operand. -*/ -void ValueAnalysis::assignSimpleElement(const struct cl_operand &dst, - const struct cl_operand &src, - MemoryPlaceToRangeMap &output, - deque indDst, - deque indSrc) -{ - // Preparing source operand. - Range srcRange = ValueAnalysis::getRange(src, output, indSrc); - - // Preparing destination operand. - MemoryPlace *dstVar = OperandToMemoryPlace::convert(&dst, indDst); - Range dstRange = Utility::getMaxRange(dst, indDst); - - - if (dstVar->representsElementOfArray()) { - // There is an array in this structure. - Range result = unite(output[dstVar], srcRange); - dstRange = dstRange.assign(result); - output[dstVar] = dstRange; - } else { - // No array in this structure. - dstRange = dstRange.assign(srcRange); - output[dstVar] = dstRange; - } -} - -/** -* @brief Generates indexes for the given type @a type. The indexes for one -* access are stored in @a ind. Vector @a indVec stores indexes for all -* accesses through the @a type. -*/ -void ValueAnalysis::generateIndexes(const struct cl_type *type, - deque &ind, - vector > &indVec) -{ - if (type->item_cnt == 0) { - indVec.push_back(ind); - } else { - // We have to go further, there is at least one more nesting in the - // structure. - for (int i = 0; i != type->item_cnt; ++i) { - ind.push_back(i); - const struct cl_type *newType; - newType = type->items[i].type; - generateIndexes(newType, ind, indVec); - } - } - - ind.pop_back(); -} - -/** -* @brief Gets the type of the operand @a op. -*/ -const struct cl_type *ValueAnalysis::getType(const struct cl_operand &op) -{ - if (op.accessor != NULL) { - return op.accessor->type; - } else { - return op.type; - } -} - -/** -* @brief Assignment of @a src to @a dst. It is able to perform assignment of simple -* operands and structures. -* -* @param[in] dst Destination operand. -* @param[in] src Source operand. -* @param[in,out] output Holds ranges for all memory places for currently processed -* block. It used for gaining the range of the source operand -* and also for storing new range of the destination operand. -*/ -void ValueAnalysis::assign(const struct cl_operand &dst, - const struct cl_operand &src, - MemoryPlaceToRangeMap &output) -{ - // Checks if left operand is valid. - assert(dst.code == CL_OPERAND_VAR); - - // Checks if right operand is valid. - assert(src.code == CL_OPERAND_CST || src.code == CL_OPERAND_VAR); - - if ((CL_TYPE_STRUCT == src.type->code) && (CL_TYPE_STRUCT == dst.type->code)) { - // Assignment of structure to another structure. - deque indSrc; - deque indDst; - vector > indSrcVec; - vector > indDstVec; - const struct cl_type *typeSrc = getType(src); - const struct cl_type *typeDst = getType(dst); - - // Generates all possible nesting for the source operand. - generateIndexes(typeSrc, indSrc, indSrcVec); - generateIndexes(typeDst, indDst, indDstVec); - assert(indSrcVec.size() == indDstVec.size()); - - for (size_t i = 0; i != indSrcVec.size(); ++i) { - assignSimpleElement(dst, src, output, indDstVec[i], indSrcVec[i]); - } - } else { - // Assignment of simple variable. - assignSimpleElement(dst, src, output); - } -} - -/** -* @brief If the given @a block is found as a key in the given @a inputMap -* then it returns the ranges associated with this key in @a inputMap. -* Otherwise, it returns an empty map. -*/ -ValueAnalysis::MemoryPlaceToRangeMap ValueAnalysis::getRanges(const Block* block, - const BlockToResultMap &inputMap) -{ - BlockToResultMap::const_iterator it = inputMap.find(block); - if (it != inputMap.end()) { - return it->second; - } else { - MemoryPlaceToRangeMap emptyMap; - return emptyMap; - } -} - -/** -* @brief If the given @a block is found as a key in @c blockToTrimmedRangesMap -* then it returns the output ranges that get off the given @a block. -* Otherwise, it returns an empty map. -*/ -ValueAnalysis::TrimmedRangesMap ValueAnalysis::getTrimmedRanges(const Block* block) -{ - if (blockToTrimmedRangesMap.find(block) != blockToTrimmedRangesMap.end()) { - return blockToTrimmedRangesMap[block]; - } else { - TrimmedRangesMap emptyMap; - return emptyMap; - } -} - -/** -* @brief Computes the partial input ranges for the given block @a current from -* the given output ranges of its predecessor stored in @a outs and from -* the given trimmed ranges of its predecessor stored in @a trimmed. -*/ -ValueAnalysis::MemoryPlaceToRangeMap ValueAnalysis::computePartialInputRanges( - const CodeStorage::Block *current, const MemoryPlaceToRangeMap &outs, - const TrimmedRangesMap &trimmed) -{ - MemoryPlaceToRangeMap result; - - for (const TrimmedRangesMap::value_type &trim : trimmed) { - // Firstly, we choose all trimmed ranges that are valid for the given block - // and store them as result. - const struct TrimmedKey key = trim.first; - const Range &range = trim.second; - if (key.block == current) { - // If the trimmed range was computed for the current block, we set - // the variable for which the trimmed range was computed and store - // this trimmed range into the result map. - MemoryPlaceToRangeMap::const_iterator it = outs.find(key.varMp); - if (it != outs.end() && !(intersect(range, it->second)).empty()) { - result[key.varMp] = range; - } - } - } - - for (const MemoryPlaceToRangeMap::value_type &out : outs) { - // Secondly, we choose the output ranges for variables that do not have - // trimmed ranges set. - const MemoryPlace *mp = out.first; - const Range &range = out.second; - if (result.find(mp) == result.end()) { - // If there was no trimming for this memory place, we just add it. - result[mp] = range; - } - } - - return result; -} - -/** -* @brief Computes the input ranges of the @a current block from the output ranges and -* trimmed ranges of predecessors' ranges. Trimmed ranges represents the ranges -* that are trimmed according to some condition in the block. -*/ -void ValueAnalysis::computeInputRanges(const CodeStorage::Block *current) -{ - // Gets the predecessor of the current block. - const TTargetList &preds = current->inbound(); - - // Stores the input ranges of the current block, output ranges or trimmed ranges - // of its predecessors. - MemoryPlaceToRangeMapVector outputOfPreds; - outputOfPreds.push_back(ValueAnalysis::getRanges(current, blockToInputRangesMap)); - - for (const TTargetList::value_type &pred : preds) { - // Get the output ranges of the predecessor. - MemoryPlaceToRangeMap out = ValueAnalysis::getRanges(pred, - blockToOutputRangesMap); - - if (blockToTrimmedRangesMap.find(pred) == blockToTrimmedRangesMap.end()) { - // If there are no trimmed ranges, we store the output ranges of - // predecessor. - outputOfPreds.push_back(out); - } else { - // If there are trimmed ranges, we have to compute the result from - // predecessor's output and trimmed ranges. - TrimmedRangesMap trimmed = ValueAnalysis::getTrimmedRanges(pred); - MemoryPlaceToRangeMap result - = ValueAnalysis::computePartialInputRanges(current, out, trimmed); - outputOfPreds.push_back(result); - } - } - - // Joins the results of predecessors. It represents the input ranges into - // the currently processed block. - MemoryPlaceToRangeMap inputToBlock; - inputToBlock = ValueAnalysis::join(outputOfPreds); - - // Assigns the input ranges to the currently processed block. - blockToInputRangesMap[current] = inputToBlock; -} - -/** -* @brief Gets the ranges that are changing between @a oldResult and @a newResult -* and expands these for faster convergence. Then, these new ranges are -* stored for the output of the given @a block. -*/ -void ValueAnalysis::expandChangingRanges(const Block* block, - const MemoryPlaceToRangeMap &oldResult, - const MemoryPlaceToRangeMap &newResult) -{ - - MemoryPlaceToRangeMap result; - for (MemoryPlaceToRangeMap::const_iterator it = oldResult.begin(); - it != oldResult.end(); ++it) { - - const MemoryPlace *key = it->first; - - // Key must exists in both maps. - assert(newResult.find(key) != newResult.end()); - - Range oldRange = it->second; - MemoryPlaceToRangeMap::const_iterator jt = newResult.find(key); - Range newRange = jt->second; - - if (oldRange == newRange) { - // Ranges do not change. - result[key] = newRange; - } else { - // Ranges change after the last processing of the block. - result[key] = newRange.expand(); - } - } - - // Firstly, I assumed that the size of oldResult and newResult must be same. - // However, this is not true. So, we have to add everything what is in - // newResult to result. - for (MemoryPlaceToRangeMap::const_iterator it = newResult.begin(); - it != newResult.end(); ++it) { - - const MemoryPlace *key = it->first; - if (result.find(key) == result.end()) { - // If key is not in the result, we have to add it. - result[key] = it->second; - } - } - - blockToOutputRangesMap[block] = result; -} - -/** -* @brief Returns @c true if the given block contains only one instruction and -* this instruction is @c goto. Otherwise, it returns @c false. -*/ -bool ValueAnalysis::containOnlyGotoInsn(const Block *block) -{ - if ((block->size() == 1) && (((*block)[0])->code == CL_INSN_JMP)) { - return true; - } - return false; -} - -/** -* @brief Computes value-range analysis for the given @a fnc. -*/ -void ValueAnalysis::computeAnalysisForFnc(const Fnc &fnc) -{ - const Block *entryBlock = fnc.cfg.entry(); - - // Sets the ranges for global variables for the input of the entry block. - blockToInputRangesMap[entryBlock] = GlobAnalysis::getGlobVarMap(); - - todoQueue.push(entryBlock); - todoSet.insert(entryBlock); - - while (!todoQueue.empty()) { - const Block *block = todoQueue.front(); - todoQueue.pop(); - todoSet.erase(block); - - MemoryPlaceToRangeMap oldResult = ValueAnalysis::getRanges(block, - blockToOutputRangesMap); - - unsigned long tripCount = LoopFinder::getUpperLimit(block); - if ((tripCount != 0) && - (tripCount == ValueAnalysis::tripCountOfBlockMap[block]) ) { - // This block was processed enough times. - ValueAnalysis::tripCountOfBlockMap[block] = 0; - continue; - } - - ValueAnalysis::computeAnalysisForBlock(block); - ++ValueAnalysis::tripCountOfBlockMap[block]; - MemoryPlaceToRangeMap newResult = ValueAnalysis::getRanges(block, - blockToOutputRangesMap); - - if (newResult != oldResult) { - // If this block was analysed many times and still does - // not converge, we will help it a little. - if (blockToCounterMap[block] > ValueAnalysis::NumberOfPassesBeforeExpand) { - expandChangingRanges(block, oldResult, newResult); - } - } - - newResult = ValueAnalysis::getRanges(block, blockToOutputRangesMap); - if ((newResult != oldResult) || (ValueAnalysis::containOnlyGotoInsn(block))) { - // Gets the successors of the processed block. - const TTargetList &succs = block->targets(); - for (const TTargetList::value_type &succ : succs) { - ValueAnalysis::scheduleBlock(succ); - } - } - } -} - -/** -* @brief Computes value-range analysis for the given @a block. -*/ -void ValueAnalysis::computeAnalysisForBlock(const Block *block) -{ - computeInputRanges(block); - - MemoryPlaceToRangeMap outputFromBlock; - outputFromBlock = ValueAnalysis::getRanges(block, blockToInputRangesMap); - - // Starts to analyze the given block. - const Insn *prevInsn = NULL; - for (const Insn *insn : *block) { - ValueAnalysis::computeAnalysisForInsn(insn, prevInsn, outputFromBlock); - prevInsn = insn; - } - - // Assigns the output ranges to the currently processed block. - blockToOutputRangesMap[block] = outputFromBlock; - - // Increments counter. - ++blockToCounterMap[block]; -} - -/** -* @brief Computes value-range analysis for the given @a insn that represents -* call instruction. Results are stored in @a output. -*/ -void ValueAnalysis::computeAnalysisForCall(const Insn* insn, - MemoryPlaceToRangeMap &output) -{ - const TOperandList &opList = insn->operands; - const struct cl_operand &ret = opList[0]; // [0] - destination - - if (ret.code == CL_OPERAND_VAR) { - // Without this condition, the problem with functions whose return values - // are not stored in the program occurred. - const MemoryPlace *retVar = OperandToMemoryPlace::convert(&ret); - Range retRange = ValueAnalysis::getRange(ret, output); - output[retVar] = retRange; - } -} - -/** -* @brief Computes value-range analysis for the given @a insn and computed result -* joins to @a output. -*/ -void ValueAnalysis::computeAnalysisForInsn(const Insn *insn, const Insn *prevInsn, - MemoryPlaceToRangeMap &output) -{ - const enum cl_insn_e code = insn->code; - - switch (code) { - case CL_INSN_NOP: - // No operation. - break; - - case CL_INSN_JMP: - // Jump. - break; - - case CL_INSN_COND: - // Condition. - ValueAnalysis::computeAnalysisForCond(insn, prevInsn, output); - break; - - case CL_INSN_RET: - //Return. - break; - - case CL_INSN_ABORT: - // Abort. - break; - - case CL_INSN_UNOP: - // Unary operation. - ValueAnalysis::computeAnalysisForUnop(insn, output); - break; - - case CL_INSN_BINOP: - // Binary operation. - ValueAnalysis::computeAnalysisForBinop(insn, output); - break; - - case CL_INSN_CALL: - // Call. - ValueAnalysis::computeAnalysisForCall(insn, output); - break; - - case CL_INSN_SWITCH: - // Switch. - break; - - case CL_INSN_LABEL: - // Label. - break; - - default: - assert(false && "Invalid insn->code in computeAnalysisForInsn()!"); - return; - } -} - -/** -* @brief Evaluates condition specified by the @a code for ranges @a r1 and @a r2. -*/ -bool ValueAnalysis::evaluateCond(const Range &r1, const Range &r2, - const enum cl_binop_e code) -{ - Range result; - switch (code) { - case CL_BINOP_EQ: - // Equal. - result = logicalEq(r1, r2); - break; - - case CL_BINOP_NE: - // Unequal. - result = logicalNeq(r1, r2); - break; - - case CL_BINOP_LT: - // Less than. - result = logicalLt(r1, r2); - break; - - case CL_BINOP_GT: - // Greater than. - result = logicalGt(r1, r2); - break; - - case CL_BINOP_LE: - // Less or equal than. - result = logicalLtEq(r1, r2); - break; - - case CL_BINOP_GE: - // Greater or equal than - result = logicalGtEq(r1, r2); - break; - - default: - assert(false); - break; - } - - if ((result.size() == 1) && (result.containsZero())) { - // Condition is evaluated as false. - return false; - } - - // Condition can be evaluated as true. - return true; -} - - -/** -* @brief Computes value-range analysis for the condition instruction @a insn, -* where @a prevInsn is previous instruction to the @a insn instruction. -* This function is responsible for computing trimmed ranges. -*/ -void ValueAnalysis::computeAnalysisForCond(const Insn *insn, const Insn *prevInsn, - MemoryPlaceToRangeMap &output) -{ - if (prevInsn == NULL) { - // If we do not have previous instruction, we cannot compute trimmed ranges. - return; - } - - // Gets the codes of both instruction. - const enum cl_insn_e prevCode = prevInsn->code; - if (prevCode != CL_INSN_BINOP) { - // The previous instruction must be binary operation: !=, ==, <=, >=, <, >. - return; - } - - // Gets the necessary information about previous instruction. - const TOperandList &opListPrev = prevInsn->operands; - - // There are three operands for binary operation. - const struct cl_operand &dst = opListPrev[0]; // [0] - destination - const struct cl_operand &src1 = opListPrev[1]; // [1] - source 1 - const struct cl_operand &src2 = opListPrev[2]; // [2] - source 2 - - // Gets the memory place of the destination. - MemoryPlace *dstVar = OperandToMemoryPlace::convert(&dst); - - // Gets the memory places of the sources and sets the source ranges. - const MemoryPlace *srcVar1 = NULL; - Range srcRange1; - if (CL_OPERAND_VAR == src1.code) { - srcVar1 = OperandToMemoryPlace::convert(&src1); - srcRange1 = ValueAnalysis::getRange(src1, output); - } - - const MemoryPlace *srcVar2 = NULL; - Range srcRange2; - if (CL_OPERAND_VAR == src2.code) { - srcVar2 = OperandToMemoryPlace::convert(&src2); - srcRange2 = ValueAnalysis::getRange(src2, output); - } - - // Sets the source ranges for constants. - if (CL_OPERAND_CST == src1.code) { - Number bound = Utility::convertOperandToNumber(&src1); - srcRange1 = Range(bound); - } - - if (CL_OPERAND_CST == src2.code) { - Number bound = Utility::convertOperandToNumber(&src2); - srcRange2 = Range(bound); - } - - // Gets the sub-code of previous instruction. - const enum cl_binop_e prevSubcode = static_cast(prevInsn->subCode); - - // Get the necessary information about current instruction (condition). - const TOperandList &opListCurr = insn->operands; - - // There is one operand for condition operation. - const struct cl_operand &cond = opListCurr[0]; // [0] - condition - - // Gets the memory place of the condition (it is an artificial variable). - const MemoryPlace *condVar = OperandToMemoryPlace::convert(&cond); - - // Gets the targets. - const TTargetList &targets = insn->targets; - const Block *thenTarget = targets[0]; - const Block *elseTarget = targets[1]; - - if (condVar != dstVar) { - // Checks if in the previous instruction was assignment to the condition - // variable. - return; - } - - // Set types of resulted ranges. - Range srcRange1True, srcRange1False; - Range srcRange2True, srcRange2False; - srcRange1True = srcRange1False = srcRange1; - srcRange2True = srcRange2False = srcRange2; - - switch (prevSubcode) { - case CL_BINOP_EQ: - // Equal. - srcRange1True = srcRange1True.assign( - computeRangeForEq(srcRange1,srcRange2)); - srcRange2True = srcRange2True.assign( - computeRangeForEq(srcRange2, srcRange1)); - srcRange1False = srcRange1False.assign( - computeRangeForNeq(srcRange1, srcRange2)); - srcRange2False = srcRange2False.assign( - computeRangeForNeq(srcRange2, srcRange1)); - break; - - case CL_BINOP_NE: - // Unequal. - srcRange1True = srcRange1True.assign( - computeRangeForNeq(srcRange1,srcRange2)); - srcRange2True = srcRange2True.assign( - computeRangeForNeq(srcRange2, srcRange1)); - srcRange1False = srcRange1False.assign( - computeRangeForEq(srcRange1, srcRange2)); - srcRange2False = srcRange2False.assign( - computeRangeForEq(srcRange2, srcRange1)); - break; - - case CL_BINOP_LT: - // Less than. - srcRange1True = srcRange1True.assign( - computeRangeForLt(srcRange1,srcRange2)); - srcRange2True = srcRange2True.assign( - computeRangeForGt(srcRange2, srcRange1)); - srcRange1False = srcRange1False.assign( - computeRangeForGtEq(srcRange1, srcRange2)); - srcRange2False = srcRange2False.assign( - computeRangeForLtEq(srcRange2, srcRange1)); - break; - - case CL_BINOP_GT: - // Greater than. - srcRange1True = srcRange1True.assign( - computeRangeForGt(srcRange1,srcRange2)); - srcRange2True = srcRange2True.assign( - computeRangeForLt(srcRange2, srcRange1)); - srcRange1False = srcRange1False.assign( - computeRangeForLtEq(srcRange1, srcRange2)); - srcRange2False = srcRange2False.assign( - computeRangeForGtEq(srcRange2, srcRange1)); - break; - - case CL_BINOP_LE: - // Less or equal than. - srcRange1True = srcRange1True.assign( - computeRangeForLtEq(srcRange1,srcRange2)); - srcRange2True = srcRange2True.assign( - computeRangeForGtEq(srcRange2, srcRange1)); - srcRange1False = srcRange1False.assign( - computeRangeForGt(srcRange1, srcRange2)); - srcRange2False = srcRange2False.assign( - computeRangeForLt(srcRange2, srcRange1)); - break; - - case CL_BINOP_GE: - // Greater or equal than - srcRange1True = srcRange1True.assign( - computeRangeForGtEq(srcRange1,srcRange2)); - srcRange2True = srcRange2True.assign( - computeRangeForLtEq(srcRange2, srcRange1)); - srcRange1False = srcRange1False.assign( - computeRangeForLt(srcRange1, srcRange2)); - srcRange2False = srcRange2False.assign( - computeRangeForGt(srcRange2, srcRange1)); - break; - - default: - assert(false); - return; - } - - // Compute if there is the possibility that condition is evaluated as true. - // bool condEval = ValueAnalysis::evaluateCond(srcRange1, srcRange2, prevSubcode); - - if (CL_OPERAND_VAR == src1.code) { - // We store the result for the first operand of the condition. - struct TrimmedKey key1(condVar, thenTarget, srcVar1); - struct TrimmedKey key2(condVar, elseTarget, srcVar1); - TrimmedRangesMap trimmedRangesMap; - trimmedRangesMap[key1] = srcRange1True; - trimmedRangesMap[key2] = srcRange1False; - blockToTrimmedRangesMap[insn->bb] = trimmedRangesMap; - } - - if (CL_OPERAND_VAR == src2.code) { - // We store the result for the second operand of the condition. - struct TrimmedKey key1(condVar, thenTarget, srcVar2); - struct TrimmedKey key2(condVar, elseTarget, srcVar2); - TrimmedRangesMap trimmedRangesMap = blockToTrimmedRangesMap[insn->bb]; - trimmedRangesMap[key1] = srcRange2True; - trimmedRangesMap[key2] = srcRange2False; - blockToTrimmedRangesMap[insn->bb] = trimmedRangesMap; - } -} - -/** -* @brief Computes value-range analysis for the given @a insn that represents -* an unary operation and computed result joins to @a output. -*/ -void ValueAnalysis::computeAnalysisForUnop(const Insn *insn, - MemoryPlaceToRangeMap &output) -{ - // There are two operands for unary operations. - const TOperandList &opList = insn->operands; - const struct cl_operand &dst = opList[0]; // [0] - destination - const struct cl_operand &src = opList[1]; // [1] - source - - // Checks if left operand is valid. - assert(dst.code == CL_OPERAND_VAR); - - // Checks if right operand is valid. - assert(src.code == CL_OPERAND_CST || src.code == CL_OPERAND_VAR); - - const enum cl_unop_e code = static_cast(insn->subCode); - - // We do not need to get memory place or source range for assignment - // because operands can be structures. - const MemoryPlace *dstVar = NULL; - Range srcRange, resultRange; - if (code != CL_UNOP_ASSIGN) { - // Gets the destination memory place. - dstVar = OperandToMemoryPlace::convert(&dst); - // Gets the source range. - srcRange = ValueAnalysis::getRange(src, output); - // This is used only to set the type of the result range. - // Necessary for correct behaviour of assign function from the Range class. - resultRange = Utility::getMaxRange(dst); - } - - switch (code) { - case CL_UNOP_ASSIGN: - // Assignment must be solved extra because of the assignment of - // the structure to another structure. - ValueAnalysis::assign(dst, src, output); - return; - - case CL_UNOP_TRUTH_NOT: - // Truth negation. - resultRange = resultRange.assign(logicalNot(srcRange)); - break; - - case CL_UNOP_BIT_NOT: - // Bit negation. - resultRange = resultRange.assign(bitNot(srcRange)); - break; - - case CL_UNOP_MINUS: - // Unary minus. - resultRange = resultRange.assign(-srcRange); - break; - - case CL_UNOP_ABS: - // Absolute value. - resultRange = resultRange.assign(abs(srcRange)); - break; - - case CL_UNOP_FLOAT: - // Casting to float. - resultRange = resultRange.assign(intToFloat(srcRange)); - break; - - default: - assert(false && "Invalid insn->subCode in computeAnalysisForUnop()!"); - break; - } - - // Setting the new range for destination. - output[dstVar] = resultRange; -} - -/** -* @brief Computes value-range analysis for the given @a insn that represents -* a binary operation and computed result joins to @a output. -*/ -void ValueAnalysis::computeAnalysisForBinop(const Insn *insn, - MemoryPlaceToRangeMap &output) -{ - // There are three operands for binary operation. - const TOperandList &opList = insn->operands; - const struct cl_operand &dst = opList[0]; // [0] - destination - const struct cl_operand &src1 = opList[1]; // [1] - source 1 - const struct cl_operand &src2 = opList[2]; // [2] - source 2 - - // Checks if destination operand is valid. - assert(dst.code == CL_OPERAND_VAR); - MemoryPlace *dstVar = OperandToMemoryPlace::convert(&dst); - - // Checks if source operands are valid. - assert(src1.code == CL_OPERAND_CST || src1.code == CL_OPERAND_VAR); - assert(src2.code == CL_OPERAND_CST || src2.code == CL_OPERAND_VAR); - - // Gets the source ranges. - Range srcRange1 = ValueAnalysis::getRange(src1, output); - Range srcRange2 = ValueAnalysis::getRange(src2, output); - - // This is used only to set the type of the result range. - // Necessary for correct behaviour of assign function from the Range class. - Range resultRange = Utility::getMaxRange(dst); - - const enum cl_binop_e code = static_cast(insn->subCode); - - switch (code) { - case CL_BINOP_EQ: - // Equal. - resultRange = resultRange.assign(logicalEq(srcRange1, srcRange2)); - break; - - case CL_BINOP_NE: - // Unequal. - resultRange = resultRange.assign(logicalNeq(srcRange1, srcRange2)); - break; - - case CL_BINOP_LT: - // Less than. - resultRange = resultRange.assign(logicalLt(srcRange1, srcRange2)); - break; - - case CL_BINOP_GT: - // Greater than. - resultRange = resultRange.assign(logicalGt(srcRange1, srcRange2)); - break; - - case CL_BINOP_LE: - // Less or equal than. - resultRange = resultRange.assign(logicalLtEq(srcRange1, srcRange2)); - break; - - case CL_BINOP_GE: - // Greater or equal than - resultRange = resultRange.assign(logicalGtEq(srcRange1, srcRange2)); - break; - - case CL_BINOP_TRUTH_AND: - // Logical AND. - resultRange = resultRange.assign(logicalAnd(srcRange1, srcRange2)); - break; - - case CL_BINOP_TRUTH_OR: - // Logical OR. - resultRange = resultRange.assign(logicalOr(srcRange1, srcRange2)); - break; - - case CL_BINOP_TRUTH_XOR: - // Logical XOR. - resultRange = resultRange.assign(logicalXor(srcRange1, srcRange2)); - break; - - case CL_BINOP_PLUS: - // Addition. - resultRange = resultRange.assign(srcRange1 + srcRange2); - break; - - case CL_BINOP_MINUS: - // Subtraction. - resultRange = resultRange.assign(srcRange1 - srcRange2); - break; - - case CL_BINOP_MULT: - // Multiplication. - resultRange = resultRange.assign(srcRange1 * srcRange2); - break; - - case CL_BINOP_EXACT_DIV: - // Exact division of integral numbers. - resultRange = resultRange.assign(exact_div(srcRange1, srcRange2)); - break; - - case CL_BINOP_TRUNC_DIV: - // Division of integral numbers with the remainder. - resultRange = resultRange.assign(trunc_div(srcRange1, srcRange2)); - break; - - case CL_BINOP_TRUNC_MOD: - // Modulo of integral numbers. - resultRange = resultRange.assign(trunc_mod(srcRange1, srcRange2)); - break; - - case CL_BINOP_RDIV: - // Division of floating-point numbers. - resultRange = resultRange.assign(rdiv(srcRange1, srcRange2)); - break; - - case CL_BINOP_MIN: - // Min value. - resultRange = resultRange.assign(min(srcRange1, srcRange2)); - break; - - case CL_BINOP_MAX: - // Max value. - resultRange = resultRange.assign(max(srcRange1, srcRange2)); - break; - - case CL_BINOP_POINTER_PLUS: - // Pointer addition. - break; - - case CL_BINOP_BIT_AND: - // Bit AND. - resultRange = resultRange.assign(bitAnd(srcRange1, srcRange2)); - break; - - case CL_BINOP_BIT_IOR: - // Bit OR. - resultRange = resultRange.assign(bitOr(srcRange1, srcRange2)); - break; - - case CL_BINOP_BIT_XOR: - // Bit XOR. - resultRange = resultRange.assign(bitXor(srcRange1, srcRange2)); - break; - - case CL_BINOP_LSHIFT: - // Left shift. - resultRange = resultRange.assign(bitLeftShift(srcRange1, srcRange2)); - break; - - case CL_BINOP_RSHIFT: - // Right shift. - resultRange = resultRange.assign(bitRightShift(srcRange1, srcRange2)); - break; - - case CL_BINOP_LROTATE: - // Left rotate. - resultRange = resultRange.assign(bitLeftRotate(srcRange1, srcRange2)); - break; - - case CL_BINOP_RROTATE: - // Right rotate. - resultRange = resultRange.assign(bitRightRotate(srcRange1, srcRange2)); - break; - - default: - assert(false && "Invalid insn->subCode in computeAnalysisForBinop()!"); - break; - } - - // Setting the new range for destination. - output[dstVar] = resultRange; -} - -/** -* @brief Emits the result of analysis for the analyzed program that is -* represented by @a stor into @a os. -*/ -ostream& ValueAnalysis::printRanges(ostream &os, const Storage &stor) -{ - for (const Fnc* pFnc : stor.callGraph.topOrder) { - // Iterates over all functions. - const Fnc &fnc = *pFnc; - if (!isDefined(fnc)) - continue; - - string delimeter(10, '-'); - os << delimeter << " Function " << nameOf(fnc) << "() "; - os << delimeter << endl; - - for (const Block* pBlock : fnc.cfg) { - // Iterates over all blocks. - const Block &block = *pBlock; - int firstLine = ((block.front())->loc).line; - int lastLine = ((block.back())->loc).line; - - if (firstLine > lastLine) { - std::swap(firstLine, lastLine); - } - - // Prints input ranges. - os << "Block " << block.name() << "[IN]" << " at lines from "; - os << firstLine << " to "; - os << lastLine << ":" << endl; - - // Gets the result of analysis for the currently processed block. - MemoryPlaceToRangeMap &blockInfo = blockToInputRangesMap[pBlock]; - vector sortedBlockInfo( - blockInfo.begin(), blockInfo.end()); - - sort(sortedBlockInfo.begin(), sortedBlockInfo.end(), - sortBlockInfo); - - for (MemoryPlaceRangePair &mem : sortedBlockInfo) { - // Iterates over all memory places in the block. - if ((mem.first)->isArtificial()) - continue; - - // User variables and corresponding ranges in block are printed. - os << "\t" << (mem.first)->asString(); - os << " = " << mem.second; - } - - // Prints output ranges. - os << "Block " << block.name() << "[OUT]:" << endl; - - // Gets the result of analysis for the currently processed block. - MemoryPlaceToRangeMap &blockInfoOut = blockToOutputRangesMap[pBlock]; - vector sortedBlockInfoOut( - blockInfoOut.begin(), blockInfoOut.end()); - - sort(sortedBlockInfoOut.begin(), sortedBlockInfoOut.end(), - sortBlockInfo); - - for (MemoryPlaceRangePair &mem : sortedBlockInfoOut) { - // Iterates over all memory places in the block. - if ((mem.first)->isArtificial()) - continue; - - // User variables and corresponding ranges in block are printed. - os << "\t" << (mem.first)->asString(); - os << " = " << mem.second; - } - } - } - return os; -} - -/** -* @brief Joins data that was gained from the analysis of several blocks. -* -* @param[in] vec Data gained from the analysis of several blocks. -* -* @return United data from @a vec. -* -* Value-range analysis of every block is represented by @c MemoryPlaceToRangeMap -* that contains all memory places and corresponding ranges for them. During -* value-range analysis it is necessary to join data of different blocks -* together. For example, join data of all predecessor blocks that will be -* used as an input to the next block. -*/ -ValueAnalysis::MemoryPlaceToRangeMap ValueAnalysis::join(const - MemoryPlaceToRangeMapVector &vec) -{ - MemoryPlaceToRangeMap result; - if (vec.empty()) - return result; - - result = vec[0]; - for (MemoryPlaceToRangeMap::size_type i = 1; i != vec.size(); ++i) { - // Iterates over all data that was got from several blocks. - for (MemoryPlaceToRangeMap::value_type item : vec[i]) { - // Iterates over all memory places. - result[item.first] = unite(result[item.first], item.second); - } - } - - return result; -} - diff --git a/vra/ValueAnalysis.h b/vra/ValueAnalysis.h deleted file mode 100644 index be83f50ab..000000000 --- a/vra/ValueAnalysis.h +++ /dev/null @@ -1,205 +0,0 @@ -/** -* @author Daniela Ďuričeková, xduric00@stud.fit.vutbr.cz -* @file ValueAnalysis.h -* @brief Class performs the value-range analysis and stores the result. -* @date 2012 -*/ - -#ifndef GUARD_VALUE_ANALYSIS_H -#define GUARD_VALUE_ANALYSIS_H - -#include -#include - -#include -#include -#include -#include -#include -#include - -#include "Range.h" -#include "MemoryPlace.h" -#include "LoopFinder.h" - -/** -* @brief Class performs the value-range analysis and stores the result. -* -* It implements functions for computing the value-range analysis for a function, -* for a block, for an instruction and so on. It stores the result of the -* analysis per each function of the program. For each memory place in every block, -* the final range is stored. Class is also responsible for printing tabular output. -*/ -class ValueAnalysis { - public: - /// Type of the data stored per each block. - typedef std::map MemoryPlaceToRangeMap; - - /// Type of the pair consisting of memory place and corresponding range. - typedef std::pair MemoryPlaceRangePair; - - private: - /// Just for assurance that nobody will try to use it. - ValueAnalysis() { } - - /// Stores maximal number of passes through the block or zero if we do - /// not know. - static LoopFinder::BlockToUpperLimit tripCountOfBlockMap; - - /// Type for representing key into map that stores trimmed ranges. - struct TrimmedKey { - /// Pointer to the memory place for the condition variable. - const MemoryPlace *conditionMp; - - /// Block for which the trimmed ranges are valid. - const CodeStorage::Block *block; - - /// Pointer to the memory place representing variable for which trimmed - /// range is computed. - const MemoryPlace *varMp; - - /// Constructor for creating new structure. - TrimmedKey(const MemoryPlace* cond, const CodeStorage::Block *block, - const MemoryPlace *var): - conditionMp(cond), block(block), varMp(var) {} - - /// Comparison on less than for two structures. It will be used as a key - /// to the map, so it is necessary to defined the comparison. - bool operator<(const TrimmedKey &key) const { - if (conditionMp < key.conditionMp) { - return true; - } else if (conditionMp > key.conditionMp) { - return false; - } else if (block < key.block) { - return true; - } else if (block > key.block) { - return false; - } else { - return varMp < key.varMp; - } - } - }; - - /// Type for trimmed ranges stored for one block. - typedef std::map TrimmedRangesMap; - - /// Type for trimmed ranges stored for every block in the analyzed program. - typedef std::map - BlockToTrimmedRangesMap; - - /// Type of data stored for several blocks. - typedef std::vector MemoryPlaceToRangeMapVector; - - /// Type of data stored for the whole analyzed program. - typedef std::map - BlockToResultMap; - - /// Type for representing scheduler. - typedef std::queue SchedulerQueue; - - /// Type for representing scheduler. - typedef std::set SchedulerSet; - - /// Type for representing block counter. - typedef std::map BlockToCounterMap; - - /// Mapping block to the trimmed ranges of this block. - static BlockToTrimmedRangesMap blockToTrimmedRangesMap; - - /// Mapping block to the input ranges of this block. - static BlockToResultMap blockToInputRangesMap; - - /// Mapping block to the output ranges of this block. - static BlockToResultMap blockToOutputRangesMap; - - /// Block scheduler. - static SchedulerQueue todoQueue; - - /// Block scheduler. - static SchedulerSet todoSet; - - /// Specifies how many times the block is executed before the expansion - /// of changing ranges will be performed. - static const unsigned NumberOfPassesBeforeExpand; - - /// Stores how many times was the block executed. - static BlockToCounterMap blockToCounterMap; - - static void scheduleBlock(const CodeStorage::Block *block); - - static MemoryPlaceToRangeMap getRanges(const CodeStorage::Block* block, - const BlockToResultMap &inputMap); - - static TrimmedRangesMap getTrimmedRanges(const CodeStorage::Block* block); - - static MemoryPlaceToRangeMap join(const MemoryPlaceToRangeMapVector &vec); - - static MemoryPlaceToRangeMap computePartialInputRanges( - const CodeStorage::Block *current, - const MemoryPlaceToRangeMap &out, - const TrimmedRangesMap &trimmed); - - static void computeInputRanges(const CodeStorage::Block *current); - - static void expandChangingRanges(const CodeStorage::Block *block, - const MemoryPlaceToRangeMap &oldResult, - const MemoryPlaceToRangeMap &newResult); - - static void computeAnalysisForBlock(const CodeStorage::Block *block); - - static void computeAnalysisForInsn(const CodeStorage::Insn *insn, - const CodeStorage::Insn *prevInsn, - MemoryPlaceToRangeMap &output); - - static void computeAnalysisForCond(const CodeStorage::Insn *insn, - const CodeStorage::Insn *prevInsn, - MemoryPlaceToRangeMap &output); - - static void computeAnalysisForUnop(const CodeStorage::Insn *insn, - MemoryPlaceToRangeMap &output); - - static void computeAnalysisForBinop(const CodeStorage::Insn *insn, - MemoryPlaceToRangeMap &output); - - static void computeAnalysisForCall(const CodeStorage::Insn* insn, - MemoryPlaceToRangeMap &output); - - static Range getRange(const struct cl_operand &src, - MemoryPlaceToRangeMap &output, - std::deque indexes = std::deque()); - - static void assign(const struct cl_operand &dst, const struct cl_operand &src, - MemoryPlaceToRangeMap &output); - - static void assignStructure(const struct cl_type *type, - const struct cl_operand &dst, - const struct cl_operand &src, - MemoryPlaceToRangeMap &output, - std::deque &indexes); - - static void generateIndexes(const struct cl_type *type, - std::deque &ind, - std::vector > &indVec); - - static void assignSimpleElement(const struct cl_operand &dst, - const struct cl_operand &src, - MemoryPlaceToRangeMap &output, - std::deque indDst = std::deque(), - std::deque indSrc = std::deque()); - - static bool containOnlyGotoInsn(const CodeStorage::Block *block); - - static const struct cl_type *getType(const struct cl_operand &op); - - static bool evaluateCond(const Range &r1, const Range &r2, - const enum cl_binop_e code); - - public: - - static std::ostream& printRanges(std::ostream &os, - const CodeStorage::Storage &stor); - - static void computeAnalysisForFnc(const CodeStorage::Fnc &fnc); -}; - -#endif diff --git a/vra/config.h b/vra/config.h deleted file mode 100644 index 84c88dee7..000000000 --- a/vra/config.h +++ /dev/null @@ -1,25 +0,0 @@ -/* - * Copyright (C) 2013 Daniela Ďuričeková - * - * This file is part of value-range analyzer. - * - * Value-range analyzer is free software: you can redistribute it and/or modify - * it under the terms of the GNU General Public License as published by the Free - * Software Foundation, either version 3 of the License, or any later version. - * - * Value-range analyzer is distributed in the hope that it will be useful, but - * WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or - * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for - * more details. - * - * You should have received a copy of the GNU General Public License along with - * the value-range analyzer. If not, see . - */ - -/** - * @file config.h - * various compile-time options - */ - -#define GIT_SHA1 vra_git_sha1 -#include "trap.h" diff --git a/vra/doc/Doxyfile b/vra/doc/Doxyfile deleted file mode 100644 index 3e46dbbf5..000000000 --- a/vra/doc/Doxyfile +++ /dev/null @@ -1,1781 +0,0 @@ -# Doxyfile 1.7.6.1 - -# This file describes the settings to be used by the documentation system -# doxygen (www.doxygen.org) for a project. -# -# All text after a hash (#) is considered a comment and will be ignored. -# The format is: -# TAG = value [value, ...] -# For lists items can also be appended using: -# TAG += value [value, ...] -# Values that contain spaces should be placed between quotes (" "). - -#--------------------------------------------------------------------------- -# Project related configuration options -#--------------------------------------------------------------------------- - -# This tag specifies the encoding used for all characters in the config file -# that follow. The default is UTF-8 which is also the encoding used for all -# text before the first occurrence of this tag. Doxygen uses libiconv (or the -# iconv built into libc) for the transcoding. See -# http://www.gnu.org/software/libiconv for the list of possible encodings. - -DOXYFILE_ENCODING = UTF-8 - -# The PROJECT_NAME tag is a single word (or sequence of words) that should -# identify the project. Note that if you do not use Doxywizard you need -# to put quotes around the project name if it contains spaces. - -PROJECT_NAME = "Value-Range Analyzer" - -# The PROJECT_NUMBER tag can be used to enter a project or revision number. -# This could be handy for archiving the generated documentation or -# if some version control system is used. - -PROJECT_NUMBER = - -# Using the PROJECT_BRIEF tag one can provide an optional one line description -# for a project that appears at the top of each page and should give viewer -# a quick idea about the purpose of the project. Keep the description short. - -PROJECT_BRIEF = - -# With the PROJECT_LOGO tag one can specify an logo or icon that is -# included in the documentation. The maximum height of the logo should not -# exceed 55 pixels and the maximum width should not exceed 200 pixels. -# Doxygen will copy the logo to the output directory. - -PROJECT_LOGO = - -# The OUTPUT_DIRECTORY tag is used to specify the (relative or absolute) -# base path where the generated documentation will be put. -# If a relative path is entered, it will be relative to the location -# where doxygen was started. If left blank the current directory will be used. - -OUTPUT_DIRECTORY = - -# If the CREATE_SUBDIRS tag is set to YES, then doxygen will create -# 4096 sub-directories (in 2 levels) under the output directory of each output -# format and will distribute the generated files over these directories. -# Enabling this option can be useful when feeding doxygen a huge amount of -# source files, where putting all generated files in the same directory would -# otherwise cause performance problems for the file system. - -CREATE_SUBDIRS = NO - -# The OUTPUT_LANGUAGE tag is used to specify the language in which all -# documentation generated by doxygen is written. Doxygen will use this -# information to generate all constant output in the proper language. -# The default language is English, other supported languages are: -# Afrikaans, Arabic, Brazilian, Catalan, Chinese, Chinese-Traditional, -# Croatian, Czech, Danish, Dutch, Esperanto, Farsi, Finnish, French, German, -# Greek, Hungarian, Italian, Japanese, Japanese-en (Japanese with English -# messages), Korean, Korean-en, Lithuanian, Norwegian, Macedonian, Persian, -# Polish, Portuguese, Romanian, Russian, Serbian, Serbian-Cyrillic, Slovak, -# Slovene, Spanish, Swedish, Ukrainian, and Vietnamese. - -OUTPUT_LANGUAGE = English - -# If the BRIEF_MEMBER_DESC tag is set to YES (the default) Doxygen will -# include brief member descriptions after the members that are listed in -# the file and class documentation (similar to JavaDoc). -# Set to NO to disable this. - -BRIEF_MEMBER_DESC = YES - -# If the REPEAT_BRIEF tag is set to YES (the default) Doxygen will prepend -# the brief description of a member or function before the detailed description. -# Note: if both HIDE_UNDOC_MEMBERS and BRIEF_MEMBER_DESC are set to NO, the -# brief descriptions will be completely suppressed. - -REPEAT_BRIEF = YES - -# This tag implements a quasi-intelligent brief description abbreviator -# that is used to form the text in various listings. Each string -# in this list, if found as the leading text of the brief description, will be -# stripped from the text and the result after processing the whole list, is -# used as the annotated text. Otherwise, the brief description is used as-is. -# If left blank, the following values are used ("$name" is automatically -# replaced with the name of the entity): "The $name class" "The $name widget" -# "The $name file" "is" "provides" "specifies" "contains" -# "represents" "a" "an" "the" - -ABBREVIATE_BRIEF = - -# If the ALWAYS_DETAILED_SEC and REPEAT_BRIEF tags are both set to YES then -# Doxygen will generate a detailed section even if there is only a brief -# description. - -ALWAYS_DETAILED_SEC = NO - -# If the INLINE_INHERITED_MEMB tag is set to YES, doxygen will show all -# inherited members of a class in the documentation of that class as if those -# members were ordinary class members. Constructors, destructors and assignment -# operators of the base classes will not be shown. - -INLINE_INHERITED_MEMB = NO - -# If the FULL_PATH_NAMES tag is set to YES then Doxygen will prepend the full -# path before files name in the file list and in the header files. If set -# to NO the shortest path that makes the file name unique will be used. - -FULL_PATH_NAMES = YES - -# If the FULL_PATH_NAMES tag is set to YES then the STRIP_FROM_PATH tag -# can be used to strip a user-defined part of the path. Stripping is -# only done if one of the specified strings matches the left-hand part of -# the path. The tag can be used to show relative paths in the file list. -# If left blank the directory from which doxygen is run is used as the -# path to strip. - -STRIP_FROM_PATH = ../doc ../tests-unit ../tests-overall - -# The STRIP_FROM_INC_PATH tag can be used to strip a user-defined part of -# the path mentioned in the documentation of a class, which tells -# the reader which header file to include in order to use a class. -# If left blank only the name of the header file containing the class -# definition is used. Otherwise one should specify the include paths that -# are normally passed to the compiler using the -I flag. - -STRIP_FROM_INC_PATH = - -# If the SHORT_NAMES tag is set to YES, doxygen will generate much shorter -# (but less readable) file names. This can be useful if your file system -# doesn't support long names like on DOS, Mac, or CD-ROM. - -SHORT_NAMES = NO - -# If the JAVADOC_AUTOBRIEF tag is set to YES then Doxygen -# will interpret the first line (until the first dot) of a JavaDoc-style -# comment as the brief description. If set to NO, the JavaDoc -# comments will behave just like regular Qt-style comments -# (thus requiring an explicit @brief command for a brief description.) - -JAVADOC_AUTOBRIEF = NO - -# If the QT_AUTOBRIEF tag is set to YES then Doxygen will -# interpret the first line (until the first dot) of a Qt-style -# comment as the brief description. If set to NO, the comments -# will behave just like regular Qt-style comments (thus requiring -# an explicit \brief command for a brief description.) - -QT_AUTOBRIEF = NO - -# The MULTILINE_CPP_IS_BRIEF tag can be set to YES to make Doxygen -# treat a multi-line C++ special comment block (i.e. a block of //! or /// -# comments) as a brief description. This used to be the default behaviour. -# The new default is to treat a multi-line C++ comment block as a detailed -# description. Set this tag to YES if you prefer the old behaviour instead. - -MULTILINE_CPP_IS_BRIEF = NO - -# If the INHERIT_DOCS tag is set to YES (the default) then an undocumented -# member inherits the documentation from any documented member that it -# re-implements. - -INHERIT_DOCS = YES - -# If the SEPARATE_MEMBER_PAGES tag is set to YES, then doxygen will produce -# a new page for each member. If set to NO, the documentation of a member will -# be part of the file/class/namespace that contains it. - -SEPARATE_MEMBER_PAGES = NO - -# The TAB_SIZE tag can be used to set the number of spaces in a tab. -# Doxygen uses this value to replace tabs by spaces in code fragments. - -TAB_SIZE = 8 - -# This tag can be used to specify a number of aliases that acts -# as commands in the documentation. An alias has the form "name=value". -# For example adding "sideeffect=\par Side Effects:\n" will allow you to -# put the command \sideeffect (or @sideeffect) in the documentation, which -# will result in a user-defined paragraph with heading "Side Effects:". -# You can put \n's in the value part of an alias to insert newlines. - -ALIASES = - -# This tag can be used to specify a number of word-keyword mappings (TCL only). -# A mapping has the form "name=value". For example adding -# "class=itcl::class" will allow you to use the command class in the -# itcl::class meaning. - -TCL_SUBST = - -# Set the OPTIMIZE_OUTPUT_FOR_C tag to YES if your project consists of C -# sources only. Doxygen will then generate output that is more tailored for C. -# For instance, some of the names that are used will be different. The list -# of all members will be omitted, etc. - -OPTIMIZE_OUTPUT_FOR_C = NO - -# Set the OPTIMIZE_OUTPUT_JAVA tag to YES if your project consists of Java -# sources only. Doxygen will then generate output that is more tailored for -# Java. For instance, namespaces will be presented as packages, qualified -# scopes will look different, etc. - -OPTIMIZE_OUTPUT_JAVA = NO - -# Set the OPTIMIZE_FOR_FORTRAN tag to YES if your project consists of Fortran -# sources only. Doxygen will then generate output that is more tailored for -# Fortran. - -OPTIMIZE_FOR_FORTRAN = NO - -# Set the OPTIMIZE_OUTPUT_VHDL tag to YES if your project consists of VHDL -# sources. Doxygen will then generate output that is tailored for -# VHDL. - -OPTIMIZE_OUTPUT_VHDL = NO - -# Doxygen selects the parser to use depending on the extension of the files it -# parses. With this tag you can assign which parser to use for a given extension. -# Doxygen has a built-in mapping, but you can override or extend it using this -# tag. The format is ext=language, where ext is a file extension, and language -# is one of the parsers supported by doxygen: IDL, Java, Javascript, CSharp, C, -# C++, D, PHP, Objective-C, Python, Fortran, VHDL, C, C++. For instance to make -# doxygen treat .inc files as Fortran files (default is PHP), and .f files as C -# (default is Fortran), use: inc=Fortran f=C. Note that for custom extensions -# you also need to set FILE_PATTERNS otherwise the files are not read by doxygen. - -EXTENSION_MAPPING = - -# If you use STL classes (i.e. std::string, std::vector, etc.) but do not want -# to include (a tag file for) the STL sources as input, then you should -# set this tag to YES in order to let doxygen match functions declarations and -# definitions whose arguments contain STL classes (e.g. func(std::string); v.s. -# func(std::string) {}). This also makes the inheritance and collaboration -# diagrams that involve STL classes more complete and accurate. - -BUILTIN_STL_SUPPORT = NO - -# If you use Microsoft's C++/CLI language, you should set this option to YES to -# enable parsing support. - -CPP_CLI_SUPPORT = NO - -# Set the SIP_SUPPORT tag to YES if your project consists of sip sources only. -# Doxygen will parse them like normal C++ but will assume all classes use public -# instead of private inheritance when no explicit protection keyword is present. - -SIP_SUPPORT = NO - -# For Microsoft's IDL there are propget and propput attributes to indicate getter -# and setter methods for a property. Setting this option to YES (the default) -# will make doxygen replace the get and set methods by a property in the -# documentation. This will only work if the methods are indeed getting or -# setting a simple type. If this is not the case, or you want to show the -# methods anyway, you should set this option to NO. - -IDL_PROPERTY_SUPPORT = YES - -# If member grouping is used in the documentation and the DISTRIBUTE_GROUP_DOC -# tag is set to YES, then doxygen will reuse the documentation of the first -# member in the group (if any) for the other members of the group. By default -# all members of a group must be documented explicitly. - -DISTRIBUTE_GROUP_DOC = NO - -# Set the SUBGROUPING tag to YES (the default) to allow class member groups of -# the same type (for instance a group of public functions) to be put as a -# subgroup of that type (e.g. under the Public Functions section). Set it to -# NO to prevent subgrouping. Alternatively, this can be done per class using -# the \nosubgrouping command. - -SUBGROUPING = YES - -# When the INLINE_GROUPED_CLASSES tag is set to YES, classes, structs and -# unions are shown inside the group in which they are included (e.g. using -# @ingroup) instead of on a separate page (for HTML and Man pages) or -# section (for LaTeX and RTF). - -INLINE_GROUPED_CLASSES = NO - -# When the INLINE_SIMPLE_STRUCTS tag is set to YES, structs, classes, and -# unions with only public data fields will be shown inline in the documentation -# of the scope in which they are defined (i.e. file, namespace, or group -# documentation), provided this scope is documented. If set to NO (the default), -# structs, classes, and unions are shown on a separate page (for HTML and Man -# pages) or section (for LaTeX and RTF). - -INLINE_SIMPLE_STRUCTS = NO - -# When TYPEDEF_HIDES_STRUCT is enabled, a typedef of a struct, union, or enum -# is documented as struct, union, or enum with the name of the typedef. So -# typedef struct TypeS {} TypeT, will appear in the documentation as a struct -# with name TypeT. When disabled the typedef will appear as a member of a file, -# namespace, or class. And the struct will be named TypeS. This can typically -# be useful for C code in case the coding convention dictates that all compound -# types are typedef'ed and only the typedef is referenced, never the tag name. - -TYPEDEF_HIDES_STRUCT = NO - -# The SYMBOL_CACHE_SIZE determines the size of the internal cache use to -# determine which symbols to keep in memory and which to flush to disk. -# When the cache is full, less often used symbols will be written to disk. -# For small to medium size projects (<1000 input files) the default value is -# probably good enough. For larger projects a too small cache size can cause -# doxygen to be busy swapping symbols to and from disk most of the time -# causing a significant performance penalty. -# If the system has enough physical memory increasing the cache will improve the -# performance by keeping more symbols in memory. Note that the value works on -# a logarithmic scale so increasing the size by one will roughly double the -# memory usage. The cache size is given by this formula: -# 2^(16+SYMBOL_CACHE_SIZE). The valid range is 0..9, the default is 0, -# corresponding to a cache size of 2^16 = 65536 symbols. - -SYMBOL_CACHE_SIZE = 0 - -# Similar to the SYMBOL_CACHE_SIZE the size of the symbol lookup cache can be -# set using LOOKUP_CACHE_SIZE. This cache is used to resolve symbols given -# their name and scope. Since this can be an expensive process and often the -# same symbol appear multiple times in the code, doxygen keeps a cache of -# pre-resolved symbols. If the cache is too small doxygen will become slower. -# If the cache is too large, memory is wasted. The cache size is given by this -# formula: 2^(16+LOOKUP_CACHE_SIZE). The valid range is 0..9, the default is 0, -# corresponding to a cache size of 2^16 = 65536 symbols. - -LOOKUP_CACHE_SIZE = 0 - -#--------------------------------------------------------------------------- -# Build related configuration options -#--------------------------------------------------------------------------- - -# If the EXTRACT_ALL tag is set to YES doxygen will assume all entities in -# documentation are documented, even if no documentation was available. -# Private class members and static file members will be hidden unless -# the EXTRACT_PRIVATE and EXTRACT_STATIC tags are set to YES - -EXTRACT_ALL = YES - -# If the EXTRACT_PRIVATE tag is set to YES all private members of a class -# will be included in the documentation. - -EXTRACT_PRIVATE = YES - -# If the EXTRACT_STATIC tag is set to YES all static members of a file -# will be included in the documentation. - -EXTRACT_STATIC = YES - -# If the EXTRACT_LOCAL_CLASSES tag is set to YES classes (and structs) -# defined locally in source files will be included in the documentation. -# If set to NO only classes defined in header files are included. - -EXTRACT_LOCAL_CLASSES = YES - -# This flag is only useful for Objective-C code. When set to YES local -# methods, which are defined in the implementation section but not in -# the interface are included in the documentation. -# If set to NO (the default) only methods in the interface are included. - -EXTRACT_LOCAL_METHODS = YES - -# If this flag is set to YES, the members of anonymous namespaces will be -# extracted and appear in the documentation as a namespace called -# 'anonymous_namespace{file}', where file will be replaced with the base -# name of the file that contains the anonymous namespace. By default -# anonymous namespaces are hidden. - -EXTRACT_ANON_NSPACES = NO - -# If the HIDE_UNDOC_MEMBERS tag is set to YES, Doxygen will hide all -# undocumented members of documented classes, files or namespaces. -# If set to NO (the default) these members will be included in the -# various overviews, but no documentation section is generated. -# This option has no effect if EXTRACT_ALL is enabled. - -HIDE_UNDOC_MEMBERS = NO - -# If the HIDE_UNDOC_CLASSES tag is set to YES, Doxygen will hide all -# undocumented classes that are normally visible in the class hierarchy. -# If set to NO (the default) these classes will be included in the various -# overviews. This option has no effect if EXTRACT_ALL is enabled. - -HIDE_UNDOC_CLASSES = NO - -# If the HIDE_FRIEND_COMPOUNDS tag is set to YES, Doxygen will hide all -# friend (class|struct|union) declarations. -# If set to NO (the default) these declarations will be included in the -# documentation. - -HIDE_FRIEND_COMPOUNDS = NO - -# If the HIDE_IN_BODY_DOCS tag is set to YES, Doxygen will hide any -# documentation blocks found inside the body of a function. -# If set to NO (the default) these blocks will be appended to the -# function's detailed documentation block. - -HIDE_IN_BODY_DOCS = NO - -# The INTERNAL_DOCS tag determines if documentation -# that is typed after a \internal command is included. If the tag is set -# to NO (the default) then the documentation will be excluded. -# Set it to YES to include the internal documentation. - -INTERNAL_DOCS = NO - -# If the CASE_SENSE_NAMES tag is set to NO then Doxygen will only generate -# file names in lower-case letters. If set to YES upper-case letters are also -# allowed. This is useful if you have classes or files whose names only differ -# in case and if your file system supports case sensitive file names. Windows -# and Mac users are advised to set this option to NO. - -CASE_SENSE_NAMES = YES - -# If the HIDE_SCOPE_NAMES tag is set to NO (the default) then Doxygen -# will show members with their full class and namespace scopes in the -# documentation. If set to YES the scope will be hidden. - -HIDE_SCOPE_NAMES = NO - -# If the SHOW_INCLUDE_FILES tag is set to YES (the default) then Doxygen -# will put a list of the files that are included by a file in the documentation -# of that file. - -SHOW_INCLUDE_FILES = YES - -# If the FORCE_LOCAL_INCLUDES tag is set to YES then Doxygen -# will list include files with double quotes in the documentation -# rather than with sharp brackets. - -FORCE_LOCAL_INCLUDES = NO - -# If the INLINE_INFO tag is set to YES (the default) then a tag [inline] -# is inserted in the documentation for inline members. - -INLINE_INFO = YES - -# If the SORT_MEMBER_DOCS tag is set to YES (the default) then doxygen -# will sort the (detailed) documentation of file and class members -# alphabetically by member name. If set to NO the members will appear in -# declaration order. - -SORT_MEMBER_DOCS = YES - -# If the SORT_BRIEF_DOCS tag is set to YES then doxygen will sort the -# brief documentation of file, namespace and class members alphabetically -# by member name. If set to NO (the default) the members will appear in -# declaration order. - -SORT_BRIEF_DOCS = NO - -# If the SORT_MEMBERS_CTORS_1ST tag is set to YES then doxygen -# will sort the (brief and detailed) documentation of class members so that -# constructors and destructors are listed first. If set to NO (the default) -# the constructors will appear in the respective orders defined by -# SORT_MEMBER_DOCS and SORT_BRIEF_DOCS. -# This tag will be ignored for brief docs if SORT_BRIEF_DOCS is set to NO -# and ignored for detailed docs if SORT_MEMBER_DOCS is set to NO. - -SORT_MEMBERS_CTORS_1ST = NO - -# If the SORT_GROUP_NAMES tag is set to YES then doxygen will sort the -# hierarchy of group names into alphabetical order. If set to NO (the default) -# the group names will appear in their defined order. - -SORT_GROUP_NAMES = NO - -# If the SORT_BY_SCOPE_NAME tag is set to YES, the class list will be -# sorted by fully-qualified names, including namespaces. If set to -# NO (the default), the class list will be sorted only by class name, -# not including the namespace part. -# Note: This option is not very useful if HIDE_SCOPE_NAMES is set to YES. -# Note: This option applies only to the class list, not to the -# alphabetical list. - -SORT_BY_SCOPE_NAME = NO - -# If the STRICT_PROTO_MATCHING option is enabled and doxygen fails to -# do proper type resolution of all parameters of a function it will reject a -# match between the prototype and the implementation of a member function even -# if there is only one candidate or it is obvious which candidate to choose -# by doing a simple string match. By disabling STRICT_PROTO_MATCHING doxygen -# will still accept a match between prototype and implementation in such cases. - -STRICT_PROTO_MATCHING = NO - -# The GENERATE_TODOLIST tag can be used to enable (YES) or -# disable (NO) the todo list. This list is created by putting \todo -# commands in the documentation. - -GENERATE_TODOLIST = YES - -# The GENERATE_TESTLIST tag can be used to enable (YES) or -# disable (NO) the test list. This list is created by putting \test -# commands in the documentation. - -GENERATE_TESTLIST = YES - -# The GENERATE_BUGLIST tag can be used to enable (YES) or -# disable (NO) the bug list. This list is created by putting \bug -# commands in the documentation. - -GENERATE_BUGLIST = YES - -# The GENERATE_DEPRECATEDLIST tag can be used to enable (YES) or -# disable (NO) the deprecated list. This list is created by putting -# \deprecated commands in the documentation. - -GENERATE_DEPRECATEDLIST= YES - -# The ENABLED_SECTIONS tag can be used to enable conditional -# documentation sections, marked by \if sectionname ... \endif. - -ENABLED_SECTIONS = - -# The MAX_INITIALIZER_LINES tag determines the maximum number of lines -# the initial value of a variable or macro consists of for it to appear in -# the documentation. If the initializer consists of more lines than specified -# here it will be hidden. Use a value of 0 to hide initializers completely. -# The appearance of the initializer of individual variables and macros in the -# documentation can be controlled using \showinitializer or \hideinitializer -# command in the documentation regardless of this setting. - -MAX_INITIALIZER_LINES = 30 - -# Set the SHOW_USED_FILES tag to NO to disable the list of files generated -# at the bottom of the documentation of classes and structs. If set to YES the -# list will mention the files that were used to generate the documentation. - -SHOW_USED_FILES = YES - -# If the sources in your project are distributed over multiple directories -# then setting the SHOW_DIRECTORIES tag to YES will show the directory hierarchy -# in the documentation. The default is NO. - -SHOW_DIRECTORIES = NO - -# Set the SHOW_FILES tag to NO to disable the generation of the Files page. -# This will remove the Files entry from the Quick Index and from the -# Folder Tree View (if specified). The default is YES. - -SHOW_FILES = YES - -# Set the SHOW_NAMESPACES tag to NO to disable the generation of the -# Namespaces page. -# This will remove the Namespaces entry from the Quick Index -# and from the Folder Tree View (if specified). The default is YES. - -SHOW_NAMESPACES = YES - -# The FILE_VERSION_FILTER tag can be used to specify a program or script that -# doxygen should invoke to get the current version for each file (typically from -# the version control system). Doxygen will invoke the program by executing (via -# popen()) the command , where is the value of -# the FILE_VERSION_FILTER tag, and is the name of an input file -# provided by doxygen. Whatever the program writes to standard output -# is used as the file version. See the manual for examples. - -FILE_VERSION_FILTER = - -# The LAYOUT_FILE tag can be used to specify a layout file which will be parsed -# by doxygen. The layout file controls the global structure of the generated -# output files in an output format independent way. The create the layout file -# that represents doxygen's defaults, run doxygen with the -l option. -# You can optionally specify a file name after the option, if omitted -# DoxygenLayout.xml will be used as the name of the layout file. - -LAYOUT_FILE = - -# The CITE_BIB_FILES tag can be used to specify one or more bib files -# containing the references data. This must be a list of .bib files. The -# .bib extension is automatically appended if omitted. Using this command -# requires the bibtex tool to be installed. See also -# http://en.wikipedia.org/wiki/BibTeX for more info. For LaTeX the style -# of the bibliography can be controlled using LATEX_BIB_STYLE. To use this -# feature you need bibtex and perl available in the search path. - -CITE_BIB_FILES = - -#--------------------------------------------------------------------------- -# configuration options related to warning and progress messages -#--------------------------------------------------------------------------- - -# The QUIET tag can be used to turn on/off the messages that are generated -# by doxygen. Possible values are YES and NO. If left blank NO is used. - -QUIET = NO - -# The WARNINGS tag can be used to turn on/off the warning messages that are -# generated by doxygen. Possible values are YES and NO. If left blank -# NO is used. - -WARNINGS = YES - -# If WARN_IF_UNDOCUMENTED is set to YES, then doxygen will generate warnings -# for undocumented members. If EXTRACT_ALL is set to YES then this flag will -# automatically be disabled. - -WARN_IF_UNDOCUMENTED = YES - -# If WARN_IF_DOC_ERROR is set to YES, doxygen will generate warnings for -# potential errors in the documentation, such as not documenting some -# parameters in a documented function, or documenting parameters that -# don't exist or using markup commands wrongly. - -WARN_IF_DOC_ERROR = YES - -# The WARN_NO_PARAMDOC option can be enabled to get warnings for -# functions that are documented, but have no documentation for their parameters -# or return value. If set to NO (the default) doxygen will only warn about -# wrong or incomplete parameter documentation, but not about the absence of -# documentation. - -WARN_NO_PARAMDOC = NO - -# The WARN_FORMAT tag determines the format of the warning messages that -# doxygen can produce. The string should contain the $file, $line, and $text -# tags, which will be replaced by the file and line number from which the -# warning originated and the warning text. Optionally the format may contain -# $version, which will be replaced by the version of the file (if it could -# be obtained via FILE_VERSION_FILTER) - -WARN_FORMAT = "$file:$line: $text" - -# The WARN_LOGFILE tag can be used to specify a file to which warning -# and error messages should be written. If left blank the output is written -# to stderr. - -WARN_LOGFILE = - -#--------------------------------------------------------------------------- -# configuration options related to the input files -#--------------------------------------------------------------------------- - -# The INPUT tag can be used to specify the files and/or directories that contain -# documented source files. You may enter file names like "myfile.cpp" or -# directories like "/usr/src/myproject". Separate the files or directories -# with spaces. - -INPUT = ../ Doxygen.h - -# This tag can be used to specify the character encoding of the source files -# that doxygen parses. Internally doxygen uses the UTF-8 encoding, which is -# also the default input encoding. Doxygen uses libiconv (or the iconv built -# into libc) for the transcoding. See http://www.gnu.org/software/libiconv for -# the list of possible encodings. - -INPUT_ENCODING = UTF-8 - -# If the value of the INPUT tag contains directories, you can use the -# FILE_PATTERNS tag to specify one or more wildcard pattern (like *.cpp -# and *.h) to filter out the source-files in the directories. If left -# blank the following patterns are tested: -# *.c *.cc *.cxx *.cpp *.c++ *.d *.java *.ii *.ixx *.ipp *.i++ *.inl *.h *.hh -# *.hxx *.hpp *.h++ *.idl *.odl *.cs *.php *.php3 *.inc *.m *.mm *.dox *.py -# *.f90 *.f *.for *.vhd *.vhdl - -FILE_PATTERNS = - -# The RECURSIVE tag can be used to turn specify whether or not subdirectories -# should be searched for input files as well. Possible values are YES and NO. -# If left blank NO is used. - -RECURSIVE = NO - -# The EXCLUDE tag can be used to specify files and/or directories that should be -# excluded from the INPUT source files. This way you can easily exclude a -# subdirectory from a directory tree whose root is specified with the INPUT tag. -# Note that relative paths are relative to the directory from which doxygen is -# run. - -EXCLUDE = ../version.c ../config.h ../trap.h - -# The EXCLUDE_SYMLINKS tag can be used to select whether or not files or -# directories that are symbolic links (a Unix file system feature) are excluded -# from the input. - -EXCLUDE_SYMLINKS = NO - -# If the value of the INPUT tag contains directories, you can use the -# EXCLUDE_PATTERNS tag to specify one or more wildcard patterns to exclude -# certain files from those directories. Note that the wildcards are matched -# against the file with absolute path, so to exclude all test directories -# for example use the pattern */test/* - -EXCLUDE_PATTERNS = - -# The EXCLUDE_SYMBOLS tag can be used to specify one or more symbol names -# (namespaces, classes, functions, etc.) that should be excluded from the -# output. The symbol name can be a fully qualified name, a word, or if the -# wildcard * is used, a substring. Examples: ANamespace, AClass, -# AClass::ANamespace, ANamespace::*Test - -EXCLUDE_SYMBOLS = - -# The EXAMPLE_PATH tag can be used to specify one or more files or -# directories that contain example code fragments that are included (see -# the \include command). - -EXAMPLE_PATH = - -# If the value of the EXAMPLE_PATH tag contains directories, you can use the -# EXAMPLE_PATTERNS tag to specify one or more wildcard pattern (like *.cpp -# and *.h) to filter out the source-files in the directories. If left -# blank all files are included. - -EXAMPLE_PATTERNS = - -# If the EXAMPLE_RECURSIVE tag is set to YES then subdirectories will be -# searched for input files to be used with the \include or \dontinclude -# commands irrespective of the value of the RECURSIVE tag. -# Possible values are YES and NO. If left blank NO is used. - -EXAMPLE_RECURSIVE = NO - -# The IMAGE_PATH tag can be used to specify one or more files or -# directories that contain image that are included in the documentation (see -# the \image command). - -IMAGE_PATH = - -# The INPUT_FILTER tag can be used to specify a program that doxygen should -# invoke to filter for each input file. Doxygen will invoke the filter program -# by executing (via popen()) the command , where -# is the value of the INPUT_FILTER tag, and is the name of an -# input file. Doxygen will then use the output that the filter program writes -# to standard output. -# If FILTER_PATTERNS is specified, this tag will be -# ignored. - -INPUT_FILTER = - -# The FILTER_PATTERNS tag can be used to specify filters on a per file pattern -# basis. -# Doxygen will compare the file name with each pattern and apply the -# filter if there is a match. -# The filters are a list of the form: -# pattern=filter (like *.cpp=my_cpp_filter). See INPUT_FILTER for further -# info on how filters are used. If FILTER_PATTERNS is empty or if -# non of the patterns match the file name, INPUT_FILTER is applied. - -FILTER_PATTERNS = - -# If the FILTER_SOURCE_FILES tag is set to YES, the input filter (if set using -# INPUT_FILTER) will be used to filter the input files when producing source -# files to browse (i.e. when SOURCE_BROWSER is set to YES). - -FILTER_SOURCE_FILES = NO - -# The FILTER_SOURCE_PATTERNS tag can be used to specify source filters per file -# pattern. A pattern will override the setting for FILTER_PATTERN (if any) -# and it is also possible to disable source filtering for a specific pattern -# using *.ext= (so without naming a filter). This option only has effect when -# FILTER_SOURCE_FILES is enabled. - -FILTER_SOURCE_PATTERNS = - -#--------------------------------------------------------------------------- -# configuration options related to source browsing -#--------------------------------------------------------------------------- - -# If the SOURCE_BROWSER tag is set to YES then a list of source files will -# be generated. Documented entities will be cross-referenced with these sources. -# Note: To get rid of all source code in the generated output, make sure also -# VERBATIM_HEADERS is set to NO. - -SOURCE_BROWSER = NO - -# Setting the INLINE_SOURCES tag to YES will include the body -# of functions and classes directly in the documentation. - -INLINE_SOURCES = NO - -# Setting the STRIP_CODE_COMMENTS tag to YES (the default) will instruct -# doxygen to hide any special comment blocks from generated source code -# fragments. Normal C and C++ comments will always remain visible. - -STRIP_CODE_COMMENTS = YES - -# If the REFERENCED_BY_RELATION tag is set to YES -# then for each documented function all documented -# functions referencing it will be listed. - -REFERENCED_BY_RELATION = NO - -# If the REFERENCES_RELATION tag is set to YES -# then for each documented function all documented entities -# called/used by that function will be listed. - -REFERENCES_RELATION = NO - -# If the REFERENCES_LINK_SOURCE tag is set to YES (the default) -# and SOURCE_BROWSER tag is set to YES, then the hyperlinks from -# functions in REFERENCES_RELATION and REFERENCED_BY_RELATION lists will -# link to the source code. -# Otherwise they will link to the documentation. - -REFERENCES_LINK_SOURCE = YES - -# If the USE_HTAGS tag is set to YES then the references to source code -# will point to the HTML generated by the htags(1) tool instead of doxygen -# built-in source browser. The htags tool is part of GNU's global source -# tagging system (see http://www.gnu.org/software/global/global.html). You -# will need version 4.8.6 or higher. - -USE_HTAGS = NO - -# If the VERBATIM_HEADERS tag is set to YES (the default) then Doxygen -# will generate a verbatim copy of the header file for each class for -# which an include is specified. Set to NO to disable this. - -VERBATIM_HEADERS = YES - -#--------------------------------------------------------------------------- -# configuration options related to the alphabetical class index -#--------------------------------------------------------------------------- - -# If the ALPHABETICAL_INDEX tag is set to YES, an alphabetical index -# of all compounds will be generated. Enable this if the project -# contains a lot of classes, structs, unions or interfaces. - -ALPHABETICAL_INDEX = YES - -# If the alphabetical index is enabled (see ALPHABETICAL_INDEX) then -# the COLS_IN_ALPHA_INDEX tag can be used to specify the number of columns -# in which this list will be split (can be a number in the range [1..20]) - -COLS_IN_ALPHA_INDEX = 5 - -# In case all classes in a project start with a common prefix, all -# classes will be put under the same header in the alphabetical index. -# The IGNORE_PREFIX tag can be used to specify one or more prefixes that -# should be ignored while generating the index headers. - -IGNORE_PREFIX = - -#--------------------------------------------------------------------------- -# configuration options related to the HTML output -#--------------------------------------------------------------------------- - -# If the GENERATE_HTML tag is set to YES (the default) Doxygen will -# generate HTML output. - -GENERATE_HTML = YES - -# The HTML_OUTPUT tag is used to specify where the HTML docs will be put. -# If a relative path is entered the value of OUTPUT_DIRECTORY will be -# put in front of it. If left blank `html' will be used as the default path. - -HTML_OUTPUT = html - -# The HTML_FILE_EXTENSION tag can be used to specify the file extension for -# each generated HTML page (for example: .htm,.php,.asp). If it is left blank -# doxygen will generate files with .html extension. - -HTML_FILE_EXTENSION = .html - -# The HTML_HEADER tag can be used to specify a personal HTML header for -# each generated HTML page. If it is left blank doxygen will generate a -# standard header. Note that when using a custom header you are responsible -# for the proper inclusion of any scripts and style sheets that doxygen -# needs, which is dependent on the configuration options used. -# It is advised to generate a default header using "doxygen -w html -# header.html footer.html stylesheet.css YourConfigFile" and then modify -# that header. Note that the header is subject to change so you typically -# have to redo this when upgrading to a newer version of doxygen or when -# changing the value of configuration settings such as GENERATE_TREEVIEW! - -HTML_HEADER = - -# The HTML_FOOTER tag can be used to specify a personal HTML footer for -# each generated HTML page. If it is left blank doxygen will generate a -# standard footer. - -HTML_FOOTER = - -# The HTML_STYLESHEET tag can be used to specify a user-defined cascading -# style sheet that is used by each HTML page. It can be used to -# fine-tune the look of the HTML output. If the tag is left blank doxygen -# will generate a default style sheet. Note that doxygen will try to copy -# the style sheet file to the HTML output directory, so don't put your own -# style sheet in the HTML output directory as well, or it will be erased! - -HTML_STYLESHEET = - -# The HTML_EXTRA_FILES tag can be used to specify one or more extra images or -# other source files which should be copied to the HTML output directory. Note -# that these files will be copied to the base HTML output directory. Use the -# $relpath$ marker in the HTML_HEADER and/or HTML_FOOTER files to load these -# files. In the HTML_STYLESHEET file, use the file name only. Also note that -# the files will be copied as-is; there are no commands or markers available. - -HTML_EXTRA_FILES = - -# The HTML_COLORSTYLE_HUE tag controls the color of the HTML output. -# Doxygen will adjust the colors in the style sheet and background images -# according to this color. Hue is specified as an angle on a colorwheel, -# see http://en.wikipedia.org/wiki/Hue for more information. -# For instance the value 0 represents red, 60 is yellow, 120 is green, -# 180 is cyan, 240 is blue, 300 purple, and 360 is red again. -# The allowed range is 0 to 359. - -HTML_COLORSTYLE_HUE = 220 - -# The HTML_COLORSTYLE_SAT tag controls the purity (or saturation) of -# the colors in the HTML output. For a value of 0 the output will use -# grayscales only. A value of 255 will produce the most vivid colors. - -HTML_COLORSTYLE_SAT = 100 - -# The HTML_COLORSTYLE_GAMMA tag controls the gamma correction applied to -# the luminance component of the colors in the HTML output. Values below -# 100 gradually make the output lighter, whereas values above 100 make -# the output darker. The value divided by 100 is the actual gamma applied, -# so 80 represents a gamma of 0.8, The value 220 represents a gamma of 2.2, -# and 100 does not change the gamma. - -HTML_COLORSTYLE_GAMMA = 80 - -# If the HTML_TIMESTAMP tag is set to YES then the footer of each generated HTML -# page will contain the date and time when the page was generated. Setting -# this to NO can help when comparing the output of multiple runs. - -HTML_TIMESTAMP = YES - -# If the HTML_ALIGN_MEMBERS tag is set to YES, the members of classes, -# files or namespaces will be aligned in HTML using tables. If set to -# NO a bullet list will be used. - -HTML_ALIGN_MEMBERS = YES - -# If the HTML_DYNAMIC_SECTIONS tag is set to YES then the generated HTML -# documentation will contain sections that can be hidden and shown after the -# page has loaded. For this to work a browser that supports -# JavaScript and DHTML is required (for instance Mozilla 1.0+, Firefox -# Netscape 6.0+, Internet explorer 5.0+, Konqueror, or Safari). - -HTML_DYNAMIC_SECTIONS = NO - -# If the GENERATE_DOCSET tag is set to YES, additional index files -# will be generated that can be used as input for Apple's Xcode 3 -# integrated development environment, introduced with OSX 10.5 (Leopard). -# To create a documentation set, doxygen will generate a Makefile in the -# HTML output directory. Running make will produce the docset in that -# directory and running "make install" will install the docset in -# ~/Library/Developer/Shared/Documentation/DocSets so that Xcode will find -# it at startup. -# See http://developer.apple.com/tools/creatingdocsetswithdoxygen.html -# for more information. - -GENERATE_DOCSET = NO - -# When GENERATE_DOCSET tag is set to YES, this tag determines the name of the -# feed. A documentation feed provides an umbrella under which multiple -# documentation sets from a single provider (such as a company or product suite) -# can be grouped. - -DOCSET_FEEDNAME = "Doxygen generated docs" - -# When GENERATE_DOCSET tag is set to YES, this tag specifies a string that -# should uniquely identify the documentation set bundle. This should be a -# reverse domain-name style string, e.g. com.mycompany.MyDocSet. Doxygen -# will append .docset to the name. - -DOCSET_BUNDLE_ID = org.doxygen.Project - -# When GENERATE_PUBLISHER_ID tag specifies a string that should uniquely identify -# the documentation publisher. This should be a reverse domain-name style -# string, e.g. com.mycompany.MyDocSet.documentation. - -DOCSET_PUBLISHER_ID = org.doxygen.Publisher - -# The GENERATE_PUBLISHER_NAME tag identifies the documentation publisher. - -DOCSET_PUBLISHER_NAME = Publisher - -# If the GENERATE_HTMLHELP tag is set to YES, additional index files -# will be generated that can be used as input for tools like the -# Microsoft HTML help workshop to generate a compiled HTML help file (.chm) -# of the generated HTML documentation. - -GENERATE_HTMLHELP = NO - -# If the GENERATE_HTMLHELP tag is set to YES, the CHM_FILE tag can -# be used to specify the file name of the resulting .chm file. You -# can add a path in front of the file if the result should not be -# written to the html output directory. - -CHM_FILE = - -# If the GENERATE_HTMLHELP tag is set to YES, the HHC_LOCATION tag can -# be used to specify the location (absolute path including file name) of -# the HTML help compiler (hhc.exe). If non-empty doxygen will try to run -# the HTML help compiler on the generated index.hhp. - -HHC_LOCATION = - -# If the GENERATE_HTMLHELP tag is set to YES, the GENERATE_CHI flag -# controls if a separate .chi index file is generated (YES) or that -# it should be included in the master .chm file (NO). - -GENERATE_CHI = NO - -# If the GENERATE_HTMLHELP tag is set to YES, the CHM_INDEX_ENCODING -# is used to encode HtmlHelp index (hhk), content (hhc) and project file -# content. - -CHM_INDEX_ENCODING = - -# If the GENERATE_HTMLHELP tag is set to YES, the BINARY_TOC flag -# controls whether a binary table of contents is generated (YES) or a -# normal table of contents (NO) in the .chm file. - -BINARY_TOC = NO - -# The TOC_EXPAND flag can be set to YES to add extra items for group members -# to the contents of the HTML help documentation and to the tree view. - -TOC_EXPAND = NO - -# If the GENERATE_QHP tag is set to YES and both QHP_NAMESPACE and -# QHP_VIRTUAL_FOLDER are set, an additional index file will be generated -# that can be used as input for Qt's qhelpgenerator to generate a -# Qt Compressed Help (.qch) of the generated HTML documentation. - -GENERATE_QHP = NO - -# If the QHG_LOCATION tag is specified, the QCH_FILE tag can -# be used to specify the file name of the resulting .qch file. -# The path specified is relative to the HTML output folder. - -QCH_FILE = - -# The QHP_NAMESPACE tag specifies the namespace to use when generating -# Qt Help Project output. For more information please see -# http://doc.trolltech.com/qthelpproject.html#namespace - -QHP_NAMESPACE = org.doxygen.Project - -# The QHP_VIRTUAL_FOLDER tag specifies the namespace to use when generating -# Qt Help Project output. For more information please see -# http://doc.trolltech.com/qthelpproject.html#virtual-folders - -QHP_VIRTUAL_FOLDER = doc - -# If QHP_CUST_FILTER_NAME is set, it specifies the name of a custom filter to -# add. For more information please see -# http://doc.trolltech.com/qthelpproject.html#custom-filters - -QHP_CUST_FILTER_NAME = - -# The QHP_CUST_FILT_ATTRS tag specifies the list of the attributes of the -# custom filter to add. For more information please see -# -# Qt Help Project / Custom Filters. - -QHP_CUST_FILTER_ATTRS = - -# The QHP_SECT_FILTER_ATTRS tag specifies the list of the attributes this -# project's -# filter section matches. -# -# Qt Help Project / Filter Attributes. - -QHP_SECT_FILTER_ATTRS = - -# If the GENERATE_QHP tag is set to YES, the QHG_LOCATION tag can -# be used to specify the location of Qt's qhelpgenerator. -# If non-empty doxygen will try to run qhelpgenerator on the generated -# .qhp file. - -QHG_LOCATION = - -# If the GENERATE_ECLIPSEHELP tag is set to YES, additional index files -# will be generated, which together with the HTML files, form an Eclipse help -# plugin. To install this plugin and make it available under the help contents -# menu in Eclipse, the contents of the directory containing the HTML and XML -# files needs to be copied into the plugins directory of eclipse. The name of -# the directory within the plugins directory should be the same as -# the ECLIPSE_DOC_ID value. After copying Eclipse needs to be restarted before -# the help appears. - -GENERATE_ECLIPSEHELP = NO - -# A unique identifier for the eclipse help plugin. When installing the plugin -# the directory name containing the HTML and XML files should also have -# this name. - -ECLIPSE_DOC_ID = org.doxygen.Project - -# The DISABLE_INDEX tag can be used to turn on/off the condensed index (tabs) -# at top of each HTML page. The value NO (the default) enables the index and -# the value YES disables it. Since the tabs have the same information as the -# navigation tree you can set this option to NO if you already set -# GENERATE_TREEVIEW to YES. - -DISABLE_INDEX = NO - -# The GENERATE_TREEVIEW tag is used to specify whether a tree-like index -# structure should be generated to display hierarchical information. -# If the tag value is set to YES, a side panel will be generated -# containing a tree-like index structure (just like the one that -# is generated for HTML Help). For this to work a browser that supports -# JavaScript, DHTML, CSS and frames is required (i.e. any modern browser). -# Windows users are probably better off using the HTML help feature. -# Since the tree basically has the same information as the tab index you -# could consider to set DISABLE_INDEX to NO when enabling this option. - -GENERATE_TREEVIEW = NO - -# The ENUM_VALUES_PER_LINE tag can be used to set the number of enum values -# (range [0,1..20]) that doxygen will group on one line in the generated HTML -# documentation. Note that a value of 0 will completely suppress the enum -# values from appearing in the overview section. - -ENUM_VALUES_PER_LINE = 4 - -# By enabling USE_INLINE_TREES, doxygen will generate the Groups, Directories, -# and Class Hierarchy pages using a tree view instead of an ordered list. - -USE_INLINE_TREES = NO - -# If the treeview is enabled (see GENERATE_TREEVIEW) then this tag can be -# used to set the initial width (in pixels) of the frame in which the tree -# is shown. - -TREEVIEW_WIDTH = 250 - -# When the EXT_LINKS_IN_WINDOW option is set to YES doxygen will open -# links to external symbols imported via tag files in a separate window. - -EXT_LINKS_IN_WINDOW = NO - -# Use this tag to change the font size of Latex formulas included -# as images in the HTML documentation. The default is 10. Note that -# when you change the font size after a successful doxygen run you need -# to manually remove any form_*.png images from the HTML output directory -# to force them to be regenerated. - -FORMULA_FONTSIZE = 10 - -# Use the FORMULA_TRANPARENT tag to determine whether or not the images -# generated for formulas are transparent PNGs. Transparent PNGs are -# not supported properly for IE 6.0, but are supported on all modern browsers. -# Note that when changing this option you need to delete any form_*.png files -# in the HTML output before the changes have effect. - -FORMULA_TRANSPARENT = YES - -# Enable the USE_MATHJAX option to render LaTeX formulas using MathJax -# (see http://www.mathjax.org) which uses client side Javascript for the -# rendering instead of using prerendered bitmaps. Use this if you do not -# have LaTeX installed or if you want to formulas look prettier in the HTML -# output. When enabled you also need to install MathJax separately and -# configure the path to it using the MATHJAX_RELPATH option. - -USE_MATHJAX = NO - -# When MathJax is enabled you need to specify the location relative to the -# HTML output directory using the MATHJAX_RELPATH option. The destination -# directory should contain the MathJax.js script. For instance, if the mathjax -# directory is located at the same level as the HTML output directory, then -# MATHJAX_RELPATH should be ../mathjax. The default value points to the -# mathjax.org site, so you can quickly see the result without installing -# MathJax, but it is strongly recommended to install a local copy of MathJax -# before deployment. - -MATHJAX_RELPATH = http://www.mathjax.org/mathjax - -# The MATHJAX_EXTENSIONS tag can be used to specify one or MathJax extension -# names that should be enabled during MathJax rendering. - -MATHJAX_EXTENSIONS = - -# When the SEARCHENGINE tag is enabled doxygen will generate a search box -# for the HTML output. The underlying search engine uses javascript -# and DHTML and should work on any modern browser. Note that when using -# HTML help (GENERATE_HTMLHELP), Qt help (GENERATE_QHP), or docsets -# (GENERATE_DOCSET) there is already a search function so this one should -# typically be disabled. For large projects the javascript based search engine -# can be slow, then enabling SERVER_BASED_SEARCH may provide a better solution. - -SEARCHENGINE = YES - -# When the SERVER_BASED_SEARCH tag is enabled the search engine will be -# implemented using a PHP enabled web server instead of at the web client -# using Javascript. Doxygen will generate the search PHP script and index -# file to put on the web server. The advantage of the server -# based approach is that it scales better to large projects and allows -# full text search. The disadvantages are that it is more difficult to setup -# and does not have live searching capabilities. - -SERVER_BASED_SEARCH = NO - -#--------------------------------------------------------------------------- -# configuration options related to the LaTeX output -#--------------------------------------------------------------------------- - -# If the GENERATE_LATEX tag is set to YES (the default) Doxygen will -# generate Latex output. - -GENERATE_LATEX = NO - -# The LATEX_OUTPUT tag is used to specify where the LaTeX docs will be put. -# If a relative path is entered the value of OUTPUT_DIRECTORY will be -# put in front of it. If left blank `latex' will be used as the default path. - -LATEX_OUTPUT = latex - -# The LATEX_CMD_NAME tag can be used to specify the LaTeX command name to be -# invoked. If left blank `latex' will be used as the default command name. -# Note that when enabling USE_PDFLATEX this option is only used for -# generating bitmaps for formulas in the HTML output, but not in the -# Makefile that is written to the output directory. - -LATEX_CMD_NAME = latex - -# The MAKEINDEX_CMD_NAME tag can be used to specify the command name to -# generate index for LaTeX. If left blank `makeindex' will be used as the -# default command name. - -MAKEINDEX_CMD_NAME = makeindex - -# If the COMPACT_LATEX tag is set to YES Doxygen generates more compact -# LaTeX documents. This may be useful for small projects and may help to -# save some trees in general. - -COMPACT_LATEX = NO - -# The PAPER_TYPE tag can be used to set the paper type that is used -# by the printer. Possible values are: a4, letter, legal and -# executive. If left blank a4wide will be used. - -PAPER_TYPE = a4 - -# The EXTRA_PACKAGES tag can be to specify one or more names of LaTeX -# packages that should be included in the LaTeX output. - -EXTRA_PACKAGES = - -# The LATEX_HEADER tag can be used to specify a personal LaTeX header for -# the generated latex document. The header should contain everything until -# the first chapter. If it is left blank doxygen will generate a -# standard header. Notice: only use this tag if you know what you are doing! - -LATEX_HEADER = - -# The LATEX_FOOTER tag can be used to specify a personal LaTeX footer for -# the generated latex document. The footer should contain everything after -# the last chapter. If it is left blank doxygen will generate a -# standard footer. Notice: only use this tag if you know what you are doing! - -LATEX_FOOTER = - -# If the PDF_HYPERLINKS tag is set to YES, the LaTeX that is generated -# is prepared for conversion to pdf (using ps2pdf). The pdf file will -# contain links (just like the HTML output) instead of page references -# This makes the output suitable for online browsing using a pdf viewer. - -PDF_HYPERLINKS = YES - -# If the USE_PDFLATEX tag is set to YES, pdflatex will be used instead of -# plain latex in the generated Makefile. Set this option to YES to get a -# higher quality PDF documentation. - -USE_PDFLATEX = YES - -# If the LATEX_BATCHMODE tag is set to YES, doxygen will add the \\batchmode. -# command to the generated LaTeX files. This will instruct LaTeX to keep -# running if errors occur, instead of asking the user for help. -# This option is also used when generating formulas in HTML. - -LATEX_BATCHMODE = NO - -# If LATEX_HIDE_INDICES is set to YES then doxygen will not -# include the index chapters (such as File Index, Compound Index, etc.) -# in the output. - -LATEX_HIDE_INDICES = NO - -# If LATEX_SOURCE_CODE is set to YES then doxygen will include -# source code with syntax highlighting in the LaTeX output. -# Note that which sources are shown also depends on other settings -# such as SOURCE_BROWSER. - -LATEX_SOURCE_CODE = NO - -# The LATEX_BIB_STYLE tag can be used to specify the style to use for the -# bibliography, e.g. plainnat, or ieeetr. The default style is "plain". See -# http://en.wikipedia.org/wiki/BibTeX for more info. - -LATEX_BIB_STYLE = plain - -#--------------------------------------------------------------------------- -# configuration options related to the RTF output -#--------------------------------------------------------------------------- - -# If the GENERATE_RTF tag is set to YES Doxygen will generate RTF output -# The RTF output is optimized for Word 97 and may not look very pretty with -# other RTF readers or editors. - -GENERATE_RTF = NO - -# The RTF_OUTPUT tag is used to specify where the RTF docs will be put. -# If a relative path is entered the value of OUTPUT_DIRECTORY will be -# put in front of it. If left blank `rtf' will be used as the default path. - -RTF_OUTPUT = rtf - -# If the COMPACT_RTF tag is set to YES Doxygen generates more compact -# RTF documents. This may be useful for small projects and may help to -# save some trees in general. - -COMPACT_RTF = NO - -# If the RTF_HYPERLINKS tag is set to YES, the RTF that is generated -# will contain hyperlink fields. The RTF file will -# contain links (just like the HTML output) instead of page references. -# This makes the output suitable for online browsing using WORD or other -# programs which support those fields. -# Note: wordpad (write) and others do not support links. - -RTF_HYPERLINKS = NO - -# Load style sheet definitions from file. Syntax is similar to doxygen's -# config file, i.e. a series of assignments. You only have to provide -# replacements, missing definitions are set to their default value. - -RTF_STYLESHEET_FILE = - -# Set optional variables used in the generation of an rtf document. -# Syntax is similar to doxygen's config file. - -RTF_EXTENSIONS_FILE = - -#--------------------------------------------------------------------------- -# configuration options related to the man page output -#--------------------------------------------------------------------------- - -# If the GENERATE_MAN tag is set to YES (the default) Doxygen will -# generate man pages - -GENERATE_MAN = NO - -# The MAN_OUTPUT tag is used to specify where the man pages will be put. -# If a relative path is entered the value of OUTPUT_DIRECTORY will be -# put in front of it. If left blank `man' will be used as the default path. - -MAN_OUTPUT = man - -# The MAN_EXTENSION tag determines the extension that is added to -# the generated man pages (default is the subroutine's section .3) - -MAN_EXTENSION = .3 - -# If the MAN_LINKS tag is set to YES and Doxygen generates man output, -# then it will generate one additional man file for each entity -# documented in the real man page(s). These additional files -# only source the real man page, but without them the man command -# would be unable to find the correct page. The default is NO. - -MAN_LINKS = NO - -#--------------------------------------------------------------------------- -# configuration options related to the XML output -#--------------------------------------------------------------------------- - -# If the GENERATE_XML tag is set to YES Doxygen will -# generate an XML file that captures the structure of -# the code including all documentation. - -GENERATE_XML = NO - -# The XML_OUTPUT tag is used to specify where the XML pages will be put. -# If a relative path is entered the value of OUTPUT_DIRECTORY will be -# put in front of it. If left blank `xml' will be used as the default path. - -XML_OUTPUT = xml - -# The XML_SCHEMA tag can be used to specify an XML schema, -# which can be used by a validating XML parser to check the -# syntax of the XML files. - -XML_SCHEMA = - -# The XML_DTD tag can be used to specify an XML DTD, -# which can be used by a validating XML parser to check the -# syntax of the XML files. - -XML_DTD = - -# If the XML_PROGRAMLISTING tag is set to YES Doxygen will -# dump the program listings (including syntax highlighting -# and cross-referencing information) to the XML output. Note that -# enabling this will significantly increase the size of the XML output. - -XML_PROGRAMLISTING = YES - -#--------------------------------------------------------------------------- -# configuration options for the AutoGen Definitions output -#--------------------------------------------------------------------------- - -# If the GENERATE_AUTOGEN_DEF tag is set to YES Doxygen will -# generate an AutoGen Definitions (see autogen.sf.net) file -# that captures the structure of the code including all -# documentation. Note that this feature is still experimental -# and incomplete at the moment. - -GENERATE_AUTOGEN_DEF = NO - -#--------------------------------------------------------------------------- -# configuration options related to the Perl module output -#--------------------------------------------------------------------------- - -# If the GENERATE_PERLMOD tag is set to YES Doxygen will -# generate a Perl module file that captures the structure of -# the code including all documentation. Note that this -# feature is still experimental and incomplete at the -# moment. - -GENERATE_PERLMOD = NO - -# If the PERLMOD_LATEX tag is set to YES Doxygen will generate -# the necessary Makefile rules, Perl scripts and LaTeX code to be able -# to generate PDF and DVI output from the Perl module output. - -PERLMOD_LATEX = NO - -# If the PERLMOD_PRETTY tag is set to YES the Perl module output will be -# nicely formatted so it can be parsed by a human reader. -# This is useful -# if you want to understand what is going on. -# On the other hand, if this -# tag is set to NO the size of the Perl module output will be much smaller -# and Perl will parse it just the same. - -PERLMOD_PRETTY = YES - -# The names of the make variables in the generated doxyrules.make file -# are prefixed with the string contained in PERLMOD_MAKEVAR_PREFIX. -# This is useful so different doxyrules.make files included by the same -# Makefile don't overwrite each other's variables. - -PERLMOD_MAKEVAR_PREFIX = - -#--------------------------------------------------------------------------- -# Configuration options related to the preprocessor -#--------------------------------------------------------------------------- - -# If the ENABLE_PREPROCESSING tag is set to YES (the default) Doxygen will -# evaluate all C-preprocessor directives found in the sources and include -# files. - -ENABLE_PREPROCESSING = YES - -# If the MACRO_EXPANSION tag is set to YES Doxygen will expand all macro -# names in the source code. If set to NO (the default) only conditional -# compilation will be performed. Macro expansion can be done in a controlled -# way by setting EXPAND_ONLY_PREDEF to YES. - -MACRO_EXPANSION = NO - -# If the EXPAND_ONLY_PREDEF and MACRO_EXPANSION tags are both set to YES -# then the macro expansion is limited to the macros specified with the -# PREDEFINED and EXPAND_AS_DEFINED tags. - -EXPAND_ONLY_PREDEF = NO - -# If the SEARCH_INCLUDES tag is set to YES (the default) the includes files -# pointed to by INCLUDE_PATH will be searched when a #include is found. - -SEARCH_INCLUDES = YES - -# The INCLUDE_PATH tag can be used to specify one or more directories that -# contain include files that are not input files but should be processed by -# the preprocessor. - -INCLUDE_PATH = - -# You can use the INCLUDE_FILE_PATTERNS tag to specify one or more wildcard -# patterns (like *.h and *.hpp) to filter out the header-files in the -# directories. If left blank, the patterns specified with FILE_PATTERNS will -# be used. - -INCLUDE_FILE_PATTERNS = - -# The PREDEFINED tag can be used to specify one or more macro names that -# are defined before the preprocessor is started (similar to the -D option of -# gcc). The argument of the tag is a list of macros of the form: name -# or name=definition (no spaces). If the definition and the = are -# omitted =1 is assumed. To prevent a macro definition from being -# undefined via #undef or recursively expanded use the := operator -# instead of the = operator. - -PREDEFINED = - -# If the MACRO_EXPANSION and EXPAND_ONLY_PREDEF tags are set to YES then -# this tag can be used to specify a list of macro names that should be expanded. -# The macro definition that is found in the sources will be used. -# Use the PREDEFINED tag if you want to use a different macro definition that -# overrules the definition found in the source code. - -EXPAND_AS_DEFINED = - -# If the SKIP_FUNCTION_MACROS tag is set to YES (the default) then -# doxygen's preprocessor will remove all references to function-like macros -# that are alone on a line, have an all uppercase name, and do not end with a -# semicolon, because these will confuse the parser if not removed. - -SKIP_FUNCTION_MACROS = YES - -#--------------------------------------------------------------------------- -# Configuration::additions related to external references -#--------------------------------------------------------------------------- - -# The TAGFILES option can be used to specify one or more tagfiles. -# Optionally an initial location of the external documentation -# can be added for each tagfile. The format of a tag file without -# this location is as follows: -# -# TAGFILES = file1 file2 ... -# Adding location for the tag files is done as follows: -# -# TAGFILES = file1=loc1 "file2 = loc2" ... -# where "loc1" and "loc2" can be relative or absolute paths or -# URLs. If a location is present for each tag, the installdox tool -# does not have to be run to correct the links. -# Note that each tag file must have a unique name -# (where the name does NOT include the path) -# If a tag file is not located in the directory in which doxygen -# is run, you must also specify the path to the tagfile here. - -TAGFILES = - -# When a file name is specified after GENERATE_TAGFILE, doxygen will create -# a tag file that is based on the input files it reads. - -GENERATE_TAGFILE = - -# If the ALLEXTERNALS tag is set to YES all external classes will be listed -# in the class index. If set to NO only the inherited external classes -# will be listed. - -ALLEXTERNALS = NO - -# If the EXTERNAL_GROUPS tag is set to YES all external groups will be listed -# in the modules index. If set to NO, only the current project's groups will -# be listed. - -EXTERNAL_GROUPS = YES - -# The PERL_PATH should be the absolute path and name of the perl script -# interpreter (i.e. the result of `which perl'). - -PERL_PATH = /usr/bin/perl - -#--------------------------------------------------------------------------- -# Configuration options related to the dot tool -#--------------------------------------------------------------------------- - -# If the CLASS_DIAGRAMS tag is set to YES (the default) Doxygen will -# generate a inheritance diagram (in HTML, RTF and LaTeX) for classes with base -# or super classes. Setting the tag to NO turns the diagrams off. Note that -# this option also works with HAVE_DOT disabled, but it is recommended to -# install and use dot, since it yields more powerful graphs. - -CLASS_DIAGRAMS = YES - -# You can define message sequence charts within doxygen comments using the \msc -# command. Doxygen will then run the mscgen tool (see -# http://www.mcternan.me.uk/mscgen/) to produce the chart and insert it in the -# documentation. The MSCGEN_PATH tag allows you to specify the directory where -# the mscgen tool resides. If left empty the tool is assumed to be found in the -# default search path. - -MSCGEN_PATH = - -# If set to YES, the inheritance and collaboration graphs will hide -# inheritance and usage relations if the target is undocumented -# or is not a class. - -HIDE_UNDOC_RELATIONS = YES - -# If you set the HAVE_DOT tag to YES then doxygen will assume the dot tool is -# available from the path. This tool is part of Graphviz, a graph visualization -# toolkit from AT&T and Lucent Bell Labs. The other options in this section -# have no effect if this option is set to NO (the default) - -HAVE_DOT = NO - -# The DOT_NUM_THREADS specifies the number of dot invocations doxygen is -# allowed to run in parallel. When set to 0 (the default) doxygen will -# base this on the number of processors available in the system. You can set it -# explicitly to a value larger than 0 to get control over the balance -# between CPU load and processing speed. - -DOT_NUM_THREADS = 0 - -# By default doxygen will use the Helvetica font for all dot files that -# doxygen generates. When you want a differently looking font you can specify -# the font name using DOT_FONTNAME. You need to make sure dot is able to find -# the font, which can be done by putting it in a standard location or by setting -# the DOTFONTPATH environment variable or by setting DOT_FONTPATH to the -# directory containing the font. - -DOT_FONTNAME = Helvetica - -# The DOT_FONTSIZE tag can be used to set the size of the font of dot graphs. -# The default size is 10pt. - -DOT_FONTSIZE = 10 - -# By default doxygen will tell dot to use the Helvetica font. -# If you specify a different font using DOT_FONTNAME you can use DOT_FONTPATH to -# set the path where dot can find it. - -DOT_FONTPATH = - -# If the CLASS_GRAPH and HAVE_DOT tags are set to YES then doxygen -# will generate a graph for each documented class showing the direct and -# indirect inheritance relations. Setting this tag to YES will force the -# CLASS_DIAGRAMS tag to NO. - -CLASS_GRAPH = YES - -# If the COLLABORATION_GRAPH and HAVE_DOT tags are set to YES then doxygen -# will generate a graph for each documented class showing the direct and -# indirect implementation dependencies (inheritance, containment, and -# class references variables) of the class with other documented classes. - -COLLABORATION_GRAPH = YES - -# If the GROUP_GRAPHS and HAVE_DOT tags are set to YES then doxygen -# will generate a graph for groups, showing the direct groups dependencies - -GROUP_GRAPHS = YES - -# If the UML_LOOK tag is set to YES doxygen will generate inheritance and -# collaboration diagrams in a style similar to the OMG's Unified Modeling -# Language. - -UML_LOOK = NO - -# If set to YES, the inheritance and collaboration graphs will show the -# relations between templates and their instances. - -TEMPLATE_RELATIONS = NO - -# If the ENABLE_PREPROCESSING, SEARCH_INCLUDES, INCLUDE_GRAPH, and HAVE_DOT -# tags are set to YES then doxygen will generate a graph for each documented -# file showing the direct and indirect include dependencies of the file with -# other documented files. - -INCLUDE_GRAPH = YES - -# If the ENABLE_PREPROCESSING, SEARCH_INCLUDES, INCLUDED_BY_GRAPH, and -# HAVE_DOT tags are set to YES then doxygen will generate a graph for each -# documented header file showing the documented files that directly or -# indirectly include this file. - -INCLUDED_BY_GRAPH = YES - -# If the CALL_GRAPH and HAVE_DOT options are set to YES then -# doxygen will generate a call dependency graph for every global function -# or class method. Note that enabling this option will significantly increase -# the time of a run. So in most cases it will be better to enable call graphs -# for selected functions only using the \callgraph command. - -CALL_GRAPH = NO - -# If the CALLER_GRAPH and HAVE_DOT tags are set to YES then -# doxygen will generate a caller dependency graph for every global function -# or class method. Note that enabling this option will significantly increase -# the time of a run. So in most cases it will be better to enable caller -# graphs for selected functions only using the \callergraph command. - -CALLER_GRAPH = NO - -# If the GRAPHICAL_HIERARCHY and HAVE_DOT tags are set to YES then doxygen -# will generate a graphical hierarchy of all classes instead of a textual one. - -GRAPHICAL_HIERARCHY = YES - -# If the DIRECTORY_GRAPH, SHOW_DIRECTORIES and HAVE_DOT tags are set to YES -# then doxygen will show the dependencies a directory has on other directories -# in a graphical way. The dependency relations are determined by the #include -# relations between the files in the directories. - -DIRECTORY_GRAPH = YES - -# The DOT_IMAGE_FORMAT tag can be used to set the image format of the images -# generated by dot. Possible values are svg, png, jpg, or gif. -# If left blank png will be used. If you choose svg you need to set -# HTML_FILE_EXTENSION to xhtml in order to make the SVG files -# visible in IE 9+ (other browsers do not have this requirement). - -DOT_IMAGE_FORMAT = png - -# If DOT_IMAGE_FORMAT is set to svg, then this option can be set to YES to -# enable generation of interactive SVG images that allow zooming and panning. -# Note that this requires a modern browser other than Internet Explorer. -# Tested and working are Firefox, Chrome, Safari, and Opera. For IE 9+ you -# need to set HTML_FILE_EXTENSION to xhtml in order to make the SVG files -# visible. Older versions of IE do not have SVG support. - -INTERACTIVE_SVG = NO - -# The tag DOT_PATH can be used to specify the path where the dot tool can be -# found. If left blank, it is assumed the dot tool can be found in the path. - -DOT_PATH = - -# The DOTFILE_DIRS tag can be used to specify one or more directories that -# contain dot files that are included in the documentation (see the -# \dotfile command). - -DOTFILE_DIRS = - -# The MSCFILE_DIRS tag can be used to specify one or more directories that -# contain msc files that are included in the documentation (see the -# \mscfile command). - -MSCFILE_DIRS = - -# The DOT_GRAPH_MAX_NODES tag can be used to set the maximum number of -# nodes that will be shown in the graph. If the number of nodes in a graph -# becomes larger than this value, doxygen will truncate the graph, which is -# visualized by representing a node as a red box. Note that doxygen if the -# number of direct children of the root node in a graph is already larger than -# DOT_GRAPH_MAX_NODES then the graph will not be shown at all. Also note -# that the size of a graph can be further restricted by MAX_DOT_GRAPH_DEPTH. - -DOT_GRAPH_MAX_NODES = 50 - -# The MAX_DOT_GRAPH_DEPTH tag can be used to set the maximum depth of the -# graphs generated by dot. A depth value of 3 means that only nodes reachable -# from the root by following a path via at most 3 edges will be shown. Nodes -# that lay further from the root node will be omitted. Note that setting this -# option to 1 or 2 may greatly reduce the computation time needed for large -# code bases. Also note that the size of a graph can be further restricted by -# DOT_GRAPH_MAX_NODES. Using a depth of 0 means no depth restriction. - -MAX_DOT_GRAPH_DEPTH = 0 - -# Set the DOT_TRANSPARENT tag to YES to generate images with a transparent -# background. This is disabled by default, because dot on Windows does not -# seem to support this out of the box. Warning: Depending on the platform used, -# enabling this option may lead to badly anti-aliased labels on the edges of -# a graph (i.e. they become hard to read). - -DOT_TRANSPARENT = NO - -# Set the DOT_MULTI_TARGETS tag to YES allow dot to generate multiple output -# files in one run (i.e. multiple -o and -T options on the command line). This -# makes dot run faster, but since only newer versions of dot (>1.8.10) -# support this, this feature is disabled by default. - -DOT_MULTI_TARGETS = NO - -# If the GENERATE_LEGEND tag is set to YES (the default) Doxygen will -# generate a legend page explaining the meaning of the various boxes and -# arrows in the dot generated graphs. - -GENERATE_LEGEND = YES - -# If the DOT_CLEANUP tag is set to YES (the default) Doxygen will -# remove the intermediate dot files that are used to generate -# the various graphs. - -DOT_CLEANUP = YES diff --git a/vra/doc/Doxygen.h b/vra/doc/Doxygen.h deleted file mode 100644 index 94546ab81..000000000 --- a/vra/doc/Doxygen.h +++ /dev/null @@ -1,31 +0,0 @@ -// This file contains no code inside - -/** - * @file Doxygen.h - * @brief Doxygen documentation (common part) - */ - -/** - * @mainpage - * This is an automatically generated API documentation for the value-range - * analyzer. It is built upon Code Listener. - * - * @remark - * - * - an entry point for the analysis: - * - clEasyRun() in vra.cc - * - * - main class representing the analysis: - * - ValueAnalysis - * - * - additional analyses: - * - GlobAnalysis - analyze global variables which may be modified - * - LoopFinder - computes the trip count of loops - * - * - supplementary classes: - * - Number - a unified representation of integral and floating-point numbers - * - Range - a sequence of intervals - * - MemoryPlace - a unified representation of memory places, such as variables - * - OperandToMemoryPlace - conversion of instruction operands to MemoryPlace - * - Utility - various utilities - */ diff --git a/vra/doc/Makefile b/vra/doc/Makefile deleted file mode 100644 index 1609a1116..000000000 --- a/vra/doc/Makefile +++ /dev/null @@ -1,10 +0,0 @@ -# Doxygen command -DOXYGEN = doxygen - -# Create program documentation -all: - $(DOXYGEN) Doxyfile - -# Cleaning -clean: - rm -rf ./html/* diff --git a/vra/tests-overall/.gitignore b/vra/tests-overall/.gitignore deleted file mode 100644 index f47cb2045..000000000 --- a/vra/tests-overall/.gitignore +++ /dev/null @@ -1 +0,0 @@ -*.out diff --git a/vra/tests-overall/Makefile b/vra/tests-overall/Makefile deleted file mode 100644 index 7400f12fe..000000000 --- a/vra/tests-overall/Makefile +++ /dev/null @@ -1,3 +0,0 @@ -# Cleaning -clean: - rm -f *.out diff --git a/vra/tests-overall/test-0001.c b/vra/tests-overall/test-0001.c deleted file mode 100644 index f69b01cc9..000000000 --- a/vra/tests-overall/test-0001.c +++ /dev/null @@ -1,23 +0,0 @@ -/** -* @file test-0001.c -* -* @brief Assignment to the simple variable. -*/ - -int main(int argc, const char *argv[]) { - - signed char a = -1; - unsigned char b = 2; - short c = -3; - unsigned short d = 4; - int e = -5; - unsigned f = 6; - long g = -7; - unsigned long h = 8; - float i = -9.15; - double j = 1.35; - long double k = 4896.7; - - return 0; -} - diff --git a/vra/tests-overall/test-0001.c.ref b/vra/tests-overall/test-0001.c.ref deleted file mode 100644 index 06dc64e8f..000000000 --- a/vra/tests-overall/test-0001.c.ref +++ /dev/null @@ -1,38 +0,0 @@ ----------- Function main() ---------- -Block L1[IN] at lines from 9 to 21: -Block L1[OUT]: - a = { <-1, -1> } - b = { <2, 2> } - c = { <-3, -3> } - d = { <4, 4> } - e = { <-5, -5> } - f = { <6, 6> } - g = { <-7, -7> } - h = { <8, 8> } - i = { <-9.15, -9.15> } - j = { <1.35, 1.35> } - k = { <4896.7, 4896.7> } -Block L2[IN] at lines from 21 to 22: - a = { <-1, -1> } - b = { <2, 2> } - c = { <-3, -3> } - d = { <4, 4> } - e = { <-5, -5> } - f = { <6, 6> } - g = { <-7, -7> } - h = { <8, 8> } - i = { <-9.15, -9.15> } - j = { <1.35, 1.35> } - k = { <4896.7, 4896.7> } -Block L2[OUT]: - a = { <-1, -1> } - b = { <2, 2> } - c = { <-3, -3> } - d = { <4, 4> } - e = { <-5, -5> } - f = { <6, 6> } - g = { <-7, -7> } - h = { <8, 8> } - i = { <-9.15, -9.15> } - j = { <1.35, 1.35> } - k = { <4896.7, 4896.7> } diff --git a/vra/tests-overall/test-0002.c b/vra/tests-overall/test-0002.c deleted file mode 100644 index 7b247342c..000000000 --- a/vra/tests-overall/test-0002.c +++ /dev/null @@ -1,15 +0,0 @@ -/** -* @file test-0002.c -* -* @brief Assignment to the simple variable (demostration of overflow). -*/ - -int main(int argc, const char *argv[]) { - - unsigned char a; - unsigned b = 256; - a = b; - - return 0; -} - diff --git a/vra/tests-overall/test-0002.c.ref b/vra/tests-overall/test-0002.c.ref deleted file mode 100644 index 7afc7e637..000000000 --- a/vra/tests-overall/test-0002.c.ref +++ /dev/null @@ -1,11 +0,0 @@ ----------- Function main() ---------- -Block L1[IN] at lines from 10 to 13: -Block L1[OUT]: - a = { <0, 0> } - b = { <256, 256> } -Block L2[IN] at lines from 13 to 14: - a = { <0, 0> } - b = { <256, 256> } -Block L2[OUT]: - a = { <0, 0> } - b = { <256, 256> } diff --git a/vra/tests-overall/test-0003.c b/vra/tests-overall/test-0003.c deleted file mode 100644 index 89c8e9931..000000000 --- a/vra/tests-overall/test-0003.c +++ /dev/null @@ -1,15 +0,0 @@ -/** -* @file test-0003.c -* -* @brief Assignment of unitialized variable. -*/ - -int main(int argc, const char *argv[]) { - - unsigned char a; - unsigned b; - a = b; - - return 0; -} - diff --git a/vra/tests-overall/test-0003.c.ref b/vra/tests-overall/test-0003.c.ref deleted file mode 100644 index bc33c3ae6..000000000 --- a/vra/tests-overall/test-0003.c.ref +++ /dev/null @@ -1,11 +0,0 @@ ----------- Function main() ---------- -Block L1[IN] at lines from 11 to 13: -Block L1[OUT]: - a = { <0, 255> } - b = { <0, 4294967295> } -Block L2[IN] at lines from 13 to 14: - a = { <0, 255> } - b = { <0, 4294967295> } -Block L2[OUT]: - a = { <0, 255> } - b = { <0, 4294967295> } diff --git a/vra/tests-overall/test-0004.c b/vra/tests-overall/test-0004.c deleted file mode 100644 index f854032b0..000000000 --- a/vra/tests-overall/test-0004.c +++ /dev/null @@ -1,25 +0,0 @@ -/** -* @file test-0004.c -* -* @brief Assignment of structure one by one item. -*/ - -int main(int argc, const char *argv[]) { - - struct { - int a; - float b; - double c; - } x, y; - - x.a = 2; - x.b = 4.0; - x.c = 8.45; - - y.a = x.a; - y.b = x.b; - y.c = x.c; - - return 0; -} - diff --git a/vra/tests-overall/test-0004.c.ref b/vra/tests-overall/test-0004.c.ref deleted file mode 100644 index c33cd745f..000000000 --- a/vra/tests-overall/test-0004.c.ref +++ /dev/null @@ -1,23 +0,0 @@ ----------- Function main() ---------- -Block L1[IN] at lines from 15 to 23: -Block L1[OUT]: - x.a = { <2, 2> } - x.b = { <4, 4> } - x.c = { <8.45, 8.45> } - y.a = { <2, 2> } - y.b = { <4, 4> } - y.c = { <8.45, 8.45> } -Block L2[IN] at lines from 23 to 24: - x.a = { <2, 2> } - x.b = { <4, 4> } - x.c = { <8.45, 8.45> } - y.a = { <2, 2> } - y.b = { <4, 4> } - y.c = { <8.45, 8.45> } -Block L2[OUT]: - x.a = { <2, 2> } - x.b = { <4, 4> } - x.c = { <8.45, 8.45> } - y.a = { <2, 2> } - y.b = { <4, 4> } - y.c = { <8.45, 8.45> } diff --git a/vra/tests-overall/test-0005.c b/vra/tests-overall/test-0005.c deleted file mode 100644 index 25e47f8a2..000000000 --- a/vra/tests-overall/test-0005.c +++ /dev/null @@ -1,23 +0,0 @@ -/** -* @file test-0005.c -* -* @brief Assignment of structure to structure. -*/ - -int main(int argc, const char *argv[]) { - - struct { - int a; - float b; - double c; - } x, y; - - x.a = 2; - x.b = 4.0; - x.c = 8.45; - - y = x; - - return 0; -} - diff --git a/vra/tests-overall/test-0005.c.ref b/vra/tests-overall/test-0005.c.ref deleted file mode 100644 index 1e89a9a7e..000000000 --- a/vra/tests-overall/test-0005.c.ref +++ /dev/null @@ -1,23 +0,0 @@ ----------- Function main() ---------- -Block L1[IN] at lines from 15 to 21: -Block L1[OUT]: - x.a = { <2, 2> } - x.b = { <4, 4> } - x.c = { <8.45, 8.45> } - y.a = { <2, 2> } - y.b = { <4, 4> } - y.c = { <8.45, 8.45> } -Block L2[IN] at lines from 21 to 22: - x.a = { <2, 2> } - x.b = { <4, 4> } - x.c = { <8.45, 8.45> } - y.a = { <2, 2> } - y.b = { <4, 4> } - y.c = { <8.45, 8.45> } -Block L2[OUT]: - x.a = { <2, 2> } - x.b = { <4, 4> } - x.c = { <8.45, 8.45> } - y.a = { <2, 2> } - y.b = { <4, 4> } - y.c = { <8.45, 8.45> } diff --git a/vra/tests-overall/test-0006.c b/vra/tests-overall/test-0006.c deleted file mode 100644 index b82f4379f..000000000 --- a/vra/tests-overall/test-0006.c +++ /dev/null @@ -1,19 +0,0 @@ -/** -* @file test-0006.c -* -* @brief Assignment of uninitialized structure to structure. -*/ - -int main(int argc, const char *argv[]) { - - struct { - int a; - float b; - double c; - } x, y; - - y = x; - - return 0; -} - diff --git a/vra/tests-overall/test-0006.c.ref b/vra/tests-overall/test-0006.c.ref deleted file mode 100644 index 8e2aa60d2..000000000 --- a/vra/tests-overall/test-0006.c.ref +++ /dev/null @@ -1,23 +0,0 @@ ----------- Function main() ---------- -Block L1[IN] at lines from 15 to 17: -Block L1[OUT]: - x.a = { <-2147483648, 2147483647> } - x.b = { , <-inf, inf> } - x.c = { , <-inf, inf> } - y.a = { <-2147483648, 2147483647> } - y.b = { , <-inf, inf> } - y.c = { , <-inf, inf> } -Block L2[IN] at lines from 17 to 18: - x.a = { <-2147483648, 2147483647> } - x.b = { , <-inf, inf> } - x.c = { , <-inf, inf> } - y.a = { <-2147483648, 2147483647> } - y.b = { , <-inf, inf> } - y.c = { , <-inf, inf> } -Block L2[OUT]: - x.a = { <-2147483648, 2147483647> } - x.b = { , <-inf, inf> } - x.c = { , <-inf, inf> } - y.a = { <-2147483648, 2147483647> } - y.b = { , <-inf, inf> } - y.c = { , <-inf, inf> } diff --git a/vra/tests-overall/test-0007.c b/vra/tests-overall/test-0007.c deleted file mode 100644 index 0320213d8..000000000 --- a/vra/tests-overall/test-0007.c +++ /dev/null @@ -1,23 +0,0 @@ -/** -* @file test-0007.c -* -* @brief Assignment of initialized structure to structure one by one item. -*/ - -int main(int argc, const char *argv[]) { - - struct my_struct{ - int a; - float b; - double c; - } x; - - struct my_struct y = {.a = 1, .b = -78.9, .c = 7.9}; - - x.a = y.a; - x.b = y.b; - x.c = y.c; - - return 0; -} - diff --git a/vra/tests-overall/test-0007.c.ref b/vra/tests-overall/test-0007.c.ref deleted file mode 100644 index 441c5b76c..000000000 --- a/vra/tests-overall/test-0007.c.ref +++ /dev/null @@ -1,23 +0,0 @@ ----------- Function main() ---------- -Block L1[IN] at lines from 15 to 21: -Block L1[OUT]: - x.a = { <1, 1> } - x.b = { <-78.9, -78.9> } - x.c = { <7.9, 7.9> } - y.a = { <1, 1> } - y.b = { <-78.9, -78.9> } - y.c = { <7.9, 7.9> } -Block L2[IN] at lines from 21 to 22: - x.a = { <1, 1> } - x.b = { <-78.9, -78.9> } - x.c = { <7.9, 7.9> } - y.a = { <1, 1> } - y.b = { <-78.9, -78.9> } - y.c = { <7.9, 7.9> } -Block L2[OUT]: - x.a = { <1, 1> } - x.b = { <-78.9, -78.9> } - x.c = { <7.9, 7.9> } - y.a = { <1, 1> } - y.b = { <-78.9, -78.9> } - y.c = { <7.9, 7.9> } diff --git a/vra/tests-overall/test-0008.c b/vra/tests-overall/test-0008.c deleted file mode 100644 index 5e711e1be..000000000 --- a/vra/tests-overall/test-0008.c +++ /dev/null @@ -1,20 +0,0 @@ -/** -* @file test-0008.c -* -* @brief Assignment of initialized structure to structure. -*/ - -int main(int argc, const char *argv[]) { - - struct my_struct{ - int a; - float b; - double c; - } x; - - struct my_struct y = {.a = 1, .b = -78.9, .c = 7.9}; - x = y; - - return 0; -} - diff --git a/vra/tests-overall/test-0008.c.ref b/vra/tests-overall/test-0008.c.ref deleted file mode 100644 index f3266dbfb..000000000 --- a/vra/tests-overall/test-0008.c.ref +++ /dev/null @@ -1,23 +0,0 @@ ----------- Function main() ---------- -Block L1[IN] at lines from 15 to 18: -Block L1[OUT]: - x.a = { <1, 1> } - x.b = { <-78.9, -78.9> } - x.c = { <7.9, 7.9> } - y.a = { <1, 1> } - y.b = { <-78.9, -78.9> } - y.c = { <7.9, 7.9> } -Block L2[IN] at lines from 18 to 19: - x.a = { <1, 1> } - x.b = { <-78.9, -78.9> } - x.c = { <7.9, 7.9> } - y.a = { <1, 1> } - y.b = { <-78.9, -78.9> } - y.c = { <7.9, 7.9> } -Block L2[OUT]: - x.a = { <1, 1> } - x.b = { <-78.9, -78.9> } - x.c = { <7.9, 7.9> } - y.a = { <1, 1> } - y.b = { <-78.9, -78.9> } - y.c = { <7.9, 7.9> } diff --git a/vra/tests-overall/test-0009.c b/vra/tests-overall/test-0009.c deleted file mode 100644 index c5fa5af72..000000000 --- a/vra/tests-overall/test-0009.c +++ /dev/null @@ -1,45 +0,0 @@ -/** -* @file test-0009.c -* -* @brief Assignment of structure composed of other structure to structure one by one item. -*/ - -int main(int argc, const char *argv[]) { - - struct my_struct{ - int a; - float b; - int c; - struct { - int e; - float f; - double g; - struct { - float i; - } h; - int j; - } d; - } x, y; - - x.a = 1; - x.b = 1.3; - x.c = 12; - x.d.e = 100; - x.d.f = 1.45; - x.d.g = 45.85; - x.d.h.i = 148963; - x.d.j = 1578; - - y.a = x.a; - y.b = x.b; - y.c = x.c; - y.d.e = x.d.e; - y.d.f = x.d.f; - y.d.g = x.d.g; - y.d.h.i = x.d.h.i; - y.d.j = x.d.j; - - return 0; -} - - diff --git a/vra/tests-overall/test-0009.c.ref b/vra/tests-overall/test-0009.c.ref deleted file mode 100644 index e7d201267..000000000 --- a/vra/tests-overall/test-0009.c.ref +++ /dev/null @@ -1,53 +0,0 @@ ----------- Function main() ---------- -Block L1[IN] at lines from 24 to 42: -Block L1[OUT]: - x.a = { <1, 1> } - x.b = { <1.3, 1.3> } - x.c = { <12, 12> } - x.d.e = { <100, 100> } - x.d.f = { <1.45, 1.45> } - x.d.g = { <45.85, 45.85> } - x.d.h.i = { <148963, 148963> } - x.d.j = { <1578, 1578> } - y.a = { <1, 1> } - y.b = { <1.3, 1.3> } - y.c = { <12, 12> } - y.d.e = { <100, 100> } - y.d.f = { <1.45, 1.45> } - y.d.g = { <45.85, 45.85> } - y.d.h.i = { <148963, 148963> } - y.d.j = { <1578, 1578> } -Block L2[IN] at lines from 42 to 43: - x.a = { <1, 1> } - x.b = { <1.3, 1.3> } - x.c = { <12, 12> } - x.d.e = { <100, 100> } - x.d.f = { <1.45, 1.45> } - x.d.g = { <45.85, 45.85> } - x.d.h.i = { <148963, 148963> } - x.d.j = { <1578, 1578> } - y.a = { <1, 1> } - y.b = { <1.3, 1.3> } - y.c = { <12, 12> } - y.d.e = { <100, 100> } - y.d.f = { <1.45, 1.45> } - y.d.g = { <45.85, 45.85> } - y.d.h.i = { <148963, 148963> } - y.d.j = { <1578, 1578> } -Block L2[OUT]: - x.a = { <1, 1> } - x.b = { <1.3, 1.3> } - x.c = { <12, 12> } - x.d.e = { <100, 100> } - x.d.f = { <1.45, 1.45> } - x.d.g = { <45.85, 45.85> } - x.d.h.i = { <148963, 148963> } - x.d.j = { <1578, 1578> } - y.a = { <1, 1> } - y.b = { <1.3, 1.3> } - y.c = { <12, 12> } - y.d.e = { <100, 100> } - y.d.f = { <1.45, 1.45> } - y.d.g = { <45.85, 45.85> } - y.d.h.i = { <148963, 148963> } - y.d.j = { <1578, 1578> } diff --git a/vra/tests-overall/test-0010.c b/vra/tests-overall/test-0010.c deleted file mode 100644 index efb7d9045..000000000 --- a/vra/tests-overall/test-0010.c +++ /dev/null @@ -1,36 +0,0 @@ -/** -* @file test-0010.c -* -* @brief Assignment of structure composed of other structure to structure. -*/ - -int main(int argc, const char *argv[]) { - - struct my_struct{ - int a; - float b; - int c; - struct { - int e; - float f; - double g; - struct { - float i; - } h; - int j; - } d; - } x, y; - - x.a = 1; - x.b = 1.3; - x.c = 12; - x.d.e = 100; - x.d.f = 1.45; - x.d.g = 45.85; - x.d.h.i = 148963; - x.d.j = 1578; - - y = x; - - return 0; -} diff --git a/vra/tests-overall/test-0010.c.ref b/vra/tests-overall/test-0010.c.ref deleted file mode 100644 index eae8c5378..000000000 --- a/vra/tests-overall/test-0010.c.ref +++ /dev/null @@ -1,53 +0,0 @@ ----------- Function main() ---------- -Block L1[IN] at lines from 24 to 35: -Block L1[OUT]: - x.a = { <1, 1> } - x.b = { <1.3, 1.3> } - x.c = { <12, 12> } - x.d.e = { <100, 100> } - x.d.f = { <1.45, 1.45> } - x.d.g = { <45.85, 45.85> } - x.d.h.i = { <148963, 148963> } - x.d.j = { <1578, 1578> } - y.a = { <1, 1> } - y.b = { <1.3, 1.3> } - y.c = { <12, 12> } - y.d.e = { <100, 100> } - y.d.f = { <1.45, 1.45> } - y.d.g = { <45.85, 45.85> } - y.d.h.i = { <148963, 148963> } - y.d.j = { <1578, 1578> } -Block L2[IN] at lines from 35 to 36: - x.a = { <1, 1> } - x.b = { <1.3, 1.3> } - x.c = { <12, 12> } - x.d.e = { <100, 100> } - x.d.f = { <1.45, 1.45> } - x.d.g = { <45.85, 45.85> } - x.d.h.i = { <148963, 148963> } - x.d.j = { <1578, 1578> } - y.a = { <1, 1> } - y.b = { <1.3, 1.3> } - y.c = { <12, 12> } - y.d.e = { <100, 100> } - y.d.f = { <1.45, 1.45> } - y.d.g = { <45.85, 45.85> } - y.d.h.i = { <148963, 148963> } - y.d.j = { <1578, 1578> } -Block L2[OUT]: - x.a = { <1, 1> } - x.b = { <1.3, 1.3> } - x.c = { <12, 12> } - x.d.e = { <100, 100> } - x.d.f = { <1.45, 1.45> } - x.d.g = { <45.85, 45.85> } - x.d.h.i = { <148963, 148963> } - x.d.j = { <1578, 1578> } - y.a = { <1, 1> } - y.b = { <1.3, 1.3> } - y.c = { <12, 12> } - y.d.e = { <100, 100> } - y.d.f = { <1.45, 1.45> } - y.d.g = { <45.85, 45.85> } - y.d.h.i = { <148963, 148963> } - y.d.j = { <1578, 1578> } diff --git a/vra/tests-overall/test-0011.c b/vra/tests-overall/test-0011.c deleted file mode 100644 index e6323f04b..000000000 --- a/vra/tests-overall/test-0011.c +++ /dev/null @@ -1,31 +0,0 @@ -/** -* @file test-0011.c -* -* @brief Assignment of initialized structure composed of other structure to structure. -*/ - -int main(int argc, const char *argv[]) { - - struct my_struct{ - int a; - float b; - int c; - struct { - int e; - float f; - double g; - struct { - float i; - } h; - int j; - } d; - } y; - - struct my_struct x = { .a = 1, .b = 1.3, .c = 12, .d.e = 100, .d.f = 1.45, - .d.g = 45.85, .d.h.i = 148963, .d.j = 1578}; - - y = x; - - return 0; -} - diff --git a/vra/tests-overall/test-0011.c.ref b/vra/tests-overall/test-0011.c.ref deleted file mode 100644 index d210ad4e1..000000000 --- a/vra/tests-overall/test-0011.c.ref +++ /dev/null @@ -1,53 +0,0 @@ ----------- Function main() ---------- -Block L1[IN] at lines from 24 to 29: -Block L1[OUT]: - x.a = { <1, 1> } - x.b = { <1.3, 1.3> } - x.c = { <12, 12> } - x.d.e = { <100, 100> } - x.d.f = { <1.45, 1.45> } - x.d.g = { <45.85, 45.85> } - x.d.h.i = { <148963, 148963> } - x.d.j = { <1578, 1578> } - y.a = { <1, 1> } - y.b = { <1.3, 1.3> } - y.c = { <12, 12> } - y.d.e = { <100, 100> } - y.d.f = { <1.45, 1.45> } - y.d.g = { <45.85, 45.85> } - y.d.h.i = { <148963, 148963> } - y.d.j = { <1578, 1578> } -Block L2[IN] at lines from 29 to 30: - x.a = { <1, 1> } - x.b = { <1.3, 1.3> } - x.c = { <12, 12> } - x.d.e = { <100, 100> } - x.d.f = { <1.45, 1.45> } - x.d.g = { <45.85, 45.85> } - x.d.h.i = { <148963, 148963> } - x.d.j = { <1578, 1578> } - y.a = { <1, 1> } - y.b = { <1.3, 1.3> } - y.c = { <12, 12> } - y.d.e = { <100, 100> } - y.d.f = { <1.45, 1.45> } - y.d.g = { <45.85, 45.85> } - y.d.h.i = { <148963, 148963> } - y.d.j = { <1578, 1578> } -Block L2[OUT]: - x.a = { <1, 1> } - x.b = { <1.3, 1.3> } - x.c = { <12, 12> } - x.d.e = { <100, 100> } - x.d.f = { <1.45, 1.45> } - x.d.g = { <45.85, 45.85> } - x.d.h.i = { <148963, 148963> } - x.d.j = { <1578, 1578> } - y.a = { <1, 1> } - y.b = { <1.3, 1.3> } - y.c = { <12, 12> } - y.d.e = { <100, 100> } - y.d.f = { <1.45, 1.45> } - y.d.g = { <45.85, 45.85> } - y.d.h.i = { <148963, 148963> } - y.d.j = { <1578, 1578> } diff --git a/vra/tests-overall/test-0012.c b/vra/tests-overall/test-0012.c deleted file mode 100644 index 7a2c967ab..000000000 --- a/vra/tests-overall/test-0012.c +++ /dev/null @@ -1,29 +0,0 @@ -/** -* @file test-0011.c -* -* @brief Assignment of uninitialized structure composed of other structure to structure. -*/ - -int main(int argc, const char *argv[]) { - - struct my_struct{ - int a; - float b; - int c; - struct { - int e; - float f; - double g; - struct { - float i; - } h; - int j; - } d; - } x, y; - - y = x; - - return 0; -} - - diff --git a/vra/tests-overall/test-0012.c.ref b/vra/tests-overall/test-0012.c.ref deleted file mode 100644 index ee4137b79..000000000 --- a/vra/tests-overall/test-0012.c.ref +++ /dev/null @@ -1,53 +0,0 @@ ----------- Function main() ---------- -Block L1[IN] at lines from 24 to 26: -Block L1[OUT]: - x.a = { <-2147483648, 2147483647> } - x.b = { , <-inf, inf> } - x.c = { <-2147483648, 2147483647> } - x.d.e = { <-2147483648, 2147483647> } - x.d.f = { , <-inf, inf> } - x.d.g = { , <-inf, inf> } - x.d.h.i = { , <-inf, inf> } - x.d.j = { <-2147483648, 2147483647> } - y.a = { <-2147483648, 2147483647> } - y.b = { , <-inf, inf> } - y.c = { <-2147483648, 2147483647> } - y.d.e = { <-2147483648, 2147483647> } - y.d.f = { , <-inf, inf> } - y.d.g = { , <-inf, inf> } - y.d.h.i = { , <-inf, inf> } - y.d.j = { <-2147483648, 2147483647> } -Block L2[IN] at lines from 26 to 27: - x.a = { <-2147483648, 2147483647> } - x.b = { , <-inf, inf> } - x.c = { <-2147483648, 2147483647> } - x.d.e = { <-2147483648, 2147483647> } - x.d.f = { , <-inf, inf> } - x.d.g = { , <-inf, inf> } - x.d.h.i = { , <-inf, inf> } - x.d.j = { <-2147483648, 2147483647> } - y.a = { <-2147483648, 2147483647> } - y.b = { , <-inf, inf> } - y.c = { <-2147483648, 2147483647> } - y.d.e = { <-2147483648, 2147483647> } - y.d.f = { , <-inf, inf> } - y.d.g = { , <-inf, inf> } - y.d.h.i = { , <-inf, inf> } - y.d.j = { <-2147483648, 2147483647> } -Block L2[OUT]: - x.a = { <-2147483648, 2147483647> } - x.b = { , <-inf, inf> } - x.c = { <-2147483648, 2147483647> } - x.d.e = { <-2147483648, 2147483647> } - x.d.f = { , <-inf, inf> } - x.d.g = { , <-inf, inf> } - x.d.h.i = { , <-inf, inf> } - x.d.j = { <-2147483648, 2147483647> } - y.a = { <-2147483648, 2147483647> } - y.b = { , <-inf, inf> } - y.c = { <-2147483648, 2147483647> } - y.d.e = { <-2147483648, 2147483647> } - y.d.f = { , <-inf, inf> } - y.d.g = { , <-inf, inf> } - y.d.h.i = { , <-inf, inf> } - y.d.j = { <-2147483648, 2147483647> } diff --git a/vra/tests-overall/test-0013.c b/vra/tests-overall/test-0013.c deleted file mode 100644 index cc86963db..000000000 --- a/vra/tests-overall/test-0013.c +++ /dev/null @@ -1,14 +0,0 @@ -/** -* @file test-0013.c -* -* @brief Initialized 1D array. -*/ - -int main(int argc, const char *argv[]) { - int a[10] = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9}; - - double b[10] = {0, 0.1, 0.2, 0.3, 0.4, 5.0, 5.1, 5.2, 8, 9}; - - return 0; -} - diff --git a/vra/tests-overall/test-0013.c.ref b/vra/tests-overall/test-0013.c.ref deleted file mode 100644 index 6453356f7..000000000 --- a/vra/tests-overall/test-0013.c.ref +++ /dev/null @@ -1,11 +0,0 @@ ----------- Function main() ---------- -Block L1[IN] at lines from 8 to 12: -Block L1[OUT]: - a[] = { <0, 9> } - b[] = { <0, 0.4>, <5, 5.2>, <8, 8>, <9, 9> } -Block L2[IN] at lines from 12 to 13: - a[] = { <0, 9> } - b[] = { <0, 0.4>, <5, 5.2>, <8, 8>, <9, 9> } -Block L2[OUT]: - a[] = { <0, 9> } - b[] = { <0, 0.4>, <5, 5.2>, <8, 8>, <9, 9> } diff --git a/vra/tests-overall/test-0014.c b/vra/tests-overall/test-0014.c deleted file mode 100644 index 97f6dec9d..000000000 --- a/vra/tests-overall/test-0014.c +++ /dev/null @@ -1,25 +0,0 @@ -/** -* @file test-0014.c -* -* @brief Filled 1D array. Element of an array assigned to a simple variable. -*/ - -int main(int argc, const char *argv[]) { - double a[10]; - - a[0] = 0; - a[1] = 0.1; - a[2] = 0.2; - a[3] = 0.3; - a[4] = 0.4; - a[5] = 5.0; - a[6] = 5.1; - a[7] = 5.2; - a[8] = 8; - a[9] = 9; - - double b = a[0]; - - return 0; -} - diff --git a/vra/tests-overall/test-0014.c.ref b/vra/tests-overall/test-0014.c.ref deleted file mode 100644 index e9a4b8b4d..000000000 --- a/vra/tests-overall/test-0014.c.ref +++ /dev/null @@ -1,11 +0,0 @@ ----------- Function main() ---------- -Block L1[IN] at lines from 10 to 23: -Block L1[OUT]: - a[] = { <0, 0.4>, <5, 5.2>, <8, 8>, <9, 9> } - b = { <0, 0.4>, <5, 5.2>, <8, 8>, <9, 9> } -Block L2[IN] at lines from 23 to 24: - a[] = { <0, 0.4>, <5, 5.2>, <8, 8>, <9, 9> } - b = { <0, 0.4>, <5, 5.2>, <8, 8>, <9, 9> } -Block L2[OUT]: - a[] = { <0, 0.4>, <5, 5.2>, <8, 8>, <9, 9> } - b = { <0, 0.4>, <5, 5.2>, <8, 8>, <9, 9> } diff --git a/vra/tests-overall/test-0015.c b/vra/tests-overall/test-0015.c deleted file mode 100644 index eab46f0b5..000000000 --- a/vra/tests-overall/test-0015.c +++ /dev/null @@ -1,14 +0,0 @@ -/** -* @file test-0015.c -* -* @brief Unitialized 1D array. Element of an array assigned to a simple variable. -*/ - -int main(int argc, const char *argv[]) { - double a[10]; - int b = a[0]; - - return 0; -} - - diff --git a/vra/tests-overall/test-0015.c.ref b/vra/tests-overall/test-0015.c.ref deleted file mode 100644 index f3599eb1a..000000000 --- a/vra/tests-overall/test-0015.c.ref +++ /dev/null @@ -1,11 +0,0 @@ ----------- Function main() ---------- -Block L1[IN] at lines from 9 to 11: -Block L1[OUT]: - a[] = { , <-inf, inf> } - b = { <-2147483648, 2147483647> } -Block L2[IN] at lines from 11 to 12: - a[] = { , <-inf, inf> } - b = { <-2147483648, 2147483647> } -Block L2[OUT]: - a[] = { , <-inf, inf> } - b = { <-2147483648, 2147483647> } diff --git a/vra/tests-overall/test-0016.c b/vra/tests-overall/test-0016.c deleted file mode 100644 index f177844d3..000000000 --- a/vra/tests-overall/test-0016.c +++ /dev/null @@ -1,14 +0,0 @@ -/** -* @file test-0016.c -* -* @brief Initialized 2D array. -*/ - -int main(int argc, const char *argv[]) { - int a[3][2] = { {0, 1}, {2, 3}, {4, 5} }; - - double b[3][2] = { {0, 0.1}, {0.2, 0.3}, {0.4, 5.0} }; - - return 0; -} - diff --git a/vra/tests-overall/test-0016.c.ref b/vra/tests-overall/test-0016.c.ref deleted file mode 100644 index 7f40b7073..000000000 --- a/vra/tests-overall/test-0016.c.ref +++ /dev/null @@ -1,11 +0,0 @@ ----------- Function main() ---------- -Block L1[IN] at lines from 8 to 12: -Block L1[OUT]: - a[][] = { <0, 5> } - b[][] = { <0, 0.4>, <5, 5> } -Block L2[IN] at lines from 12 to 13: - a[][] = { <0, 5> } - b[][] = { <0, 0.4>, <5, 5> } -Block L2[OUT]: - a[][] = { <0, 5> } - b[][] = { <0, 0.4>, <5, 5> } diff --git a/vra/tests-overall/test-0017.c b/vra/tests-overall/test-0017.c deleted file mode 100644 index 9aad86dd9..000000000 --- a/vra/tests-overall/test-0017.c +++ /dev/null @@ -1,19 +0,0 @@ -/** -* @file test-0017.c -* -* @brief Filled 2D array. Element of an array assigned to a simple variable. -*/ - -int main(int argc, const char *argv[]) { - double a[2][2]; - - a[0][0] = 0; - a[0][1] = 0.1; - a[1][0] = 0.2; - a[1][1] = 0.3; - - int b = a[0][1]; - - return 0; -} - diff --git a/vra/tests-overall/test-0017.c.ref b/vra/tests-overall/test-0017.c.ref deleted file mode 100644 index e9e2a611b..000000000 --- a/vra/tests-overall/test-0017.c.ref +++ /dev/null @@ -1,11 +0,0 @@ ----------- Function main() ---------- -Block L1[IN] at lines from 10 to 17: -Block L1[OUT]: - a[][] = { <0, 0.3> } - b = { <0, 0> } -Block L2[IN] at lines from 17 to 18: - a[][] = { <0, 0.3> } - b = { <0, 0> } -Block L2[OUT]: - a[][] = { <0, 0.3> } - b = { <0, 0> } diff --git a/vra/tests-overall/test-0018.c b/vra/tests-overall/test-0018.c deleted file mode 100644 index 3df399334..000000000 --- a/vra/tests-overall/test-0018.c +++ /dev/null @@ -1,14 +0,0 @@ -/** -* @file test-0018.c -* -* @brief Unitialized 2D array. Element of an array assigned to a simple variable. -*/ - -int main(int argc, const char *argv[]) { - int a[10][10]; - double b = a[0][9]; - - return 0; -} - - diff --git a/vra/tests-overall/test-0018.c.ref b/vra/tests-overall/test-0018.c.ref deleted file mode 100644 index c03049b65..000000000 --- a/vra/tests-overall/test-0018.c.ref +++ /dev/null @@ -1,11 +0,0 @@ ----------- Function main() ---------- -Block L1[IN] at lines from 9 to 11: -Block L1[OUT]: - a[][] = { <-2147483648, 2147483647> } - b = { <-2.14748e+09, 2.14748e+09> } -Block L2[IN] at lines from 11 to 12: - a[][] = { <-2147483648, 2147483647> } - b = { <-2.14748e+09, 2.14748e+09> } -Block L2[OUT]: - a[][] = { <-2147483648, 2147483647> } - b = { <-2.14748e+09, 2.14748e+09> } diff --git a/vra/tests-overall/test-0019.c b/vra/tests-overall/test-0019.c deleted file mode 100644 index 109ca5f07..000000000 --- a/vra/tests-overall/test-0019.c +++ /dev/null @@ -1,17 +0,0 @@ -/** -* @file test-0019.c -* -* @brief Initialized 1D array that contains a structure. -*/ - -int main(int argc, const char *argv[]) { - struct my_struct { - int a; - double b; - }; - - struct my_struct array[2] = { {1, 1.35}, {2, 2.35}}; - - return 0; -} - diff --git a/vra/tests-overall/test-0019.c.ref b/vra/tests-overall/test-0019.c.ref deleted file mode 100644 index f45ee8c7f..000000000 --- a/vra/tests-overall/test-0019.c.ref +++ /dev/null @@ -1,11 +0,0 @@ ----------- Function main() ---------- -Block L1[IN] at lines from 13 to 15: -Block L1[OUT]: - array[].a = { <1, 2> } - array[].b = { <1.35, 1.35>, <2.35, 2.35> } -Block L2[IN] at lines from 15 to 16: - array[].a = { <1, 2> } - array[].b = { <1.35, 1.35>, <2.35, 2.35> } -Block L2[OUT]: - array[].a = { <1, 2> } - array[].b = { <1.35, 1.35>, <2.35, 2.35> } diff --git a/vra/tests-overall/test-0020.c b/vra/tests-overall/test-0020.c deleted file mode 100644 index 61dee9bd8..000000000 --- a/vra/tests-overall/test-0020.c +++ /dev/null @@ -1,21 +0,0 @@ -/** -* @file test-0020.c -* -* @brief Uninitialized 1D array that contains a structure. -*/ - -int main(int argc, const char *argv[]) { - struct my_struct { - int a; - double b; - }; - - struct my_struct array[2]; - - int x = array[0].a + array[1].a; - double y = array[0].b + array[1].b; - - return 0; -} - - diff --git a/vra/tests-overall/test-0020.c.ref b/vra/tests-overall/test-0020.c.ref deleted file mode 100644 index acd6cd789..000000000 --- a/vra/tests-overall/test-0020.c.ref +++ /dev/null @@ -1,17 +0,0 @@ ----------- Function main() ---------- -Block L1[IN] at lines from 15 to 18: -Block L1[OUT]: - array[].a = { <-2147483648, 2147483647> } - array[].b = { , <-inf, inf> } - x = { <-2147483648, 2147483647> } - y = { , <-inf, inf> } -Block L2[IN] at lines from 18 to 19: - array[].a = { <-2147483648, 2147483647> } - array[].b = { , <-inf, inf> } - x = { <-2147483648, 2147483647> } - y = { , <-inf, inf> } -Block L2[OUT]: - array[].a = { <-2147483648, 2147483647> } - array[].b = { , <-inf, inf> } - x = { <-2147483648, 2147483647> } - y = { , <-inf, inf> } diff --git a/vra/tests-overall/test-0021.c b/vra/tests-overall/test-0021.c deleted file mode 100644 index 0238cee76..000000000 --- a/vra/tests-overall/test-0021.c +++ /dev/null @@ -1,22 +0,0 @@ -/** -* @file test-0021.c -* -* @brief Filled 1D array that contains a structure. -*/ - -int main(int argc, const char *argv[]) { - struct my_struct { - int a; - double b; - }; - - struct my_struct array[2]; - - array[0].a = 1; - array[0].b = 3.5; - array[1].a = 2; - array[1].b = 5.5; - - return 0; -} - diff --git a/vra/tests-overall/test-0021.c.ref b/vra/tests-overall/test-0021.c.ref deleted file mode 100644 index 2b3288714..000000000 --- a/vra/tests-overall/test-0021.c.ref +++ /dev/null @@ -1,11 +0,0 @@ ----------- Function main() ---------- -Block L1[IN] at lines from 15 to 20: -Block L1[OUT]: - array[].a = { <1, 2> } - array[].b = { <3.5, 3.5>, <5.5, 5.5> } -Block L2[IN] at lines from 20 to 21: - array[].a = { <1, 2> } - array[].b = { <3.5, 3.5>, <5.5, 5.5> } -Block L2[OUT]: - array[].a = { <1, 2> } - array[].b = { <3.5, 3.5>, <5.5, 5.5> } diff --git a/vra/tests-overall/test-0022.c b/vra/tests-overall/test-0022.c deleted file mode 100644 index 749995588..000000000 --- a/vra/tests-overall/test-0022.c +++ /dev/null @@ -1,17 +0,0 @@ -/** -* @file test-0022.c -* -* @brief Initialized 1D array that contains a structure which contains 1D array. -*/ - -int main(int argc, const char *argv[]) { - struct my_struct { - int a; - double b[2]; - }; - - struct my_struct array[2] = { {1, {3.5, 3.6} }, {2, {4.5, 4.6}} }; - - return 0; -} - diff --git a/vra/tests-overall/test-0022.c.ref b/vra/tests-overall/test-0022.c.ref deleted file mode 100644 index 3a30282d3..000000000 --- a/vra/tests-overall/test-0022.c.ref +++ /dev/null @@ -1,11 +0,0 @@ ----------- Function main() ---------- -Block L1[IN] at lines from 13 to 15: -Block L1[OUT]: - array[].a = { <1, 2> } - array[].b[] = { <3.5, 3.6>, <4.5, 4.6> } -Block L2[IN] at lines from 15 to 16: - array[].a = { <1, 2> } - array[].b[] = { <3.5, 3.6>, <4.5, 4.6> } -Block L2[OUT]: - array[].a = { <1, 2> } - array[].b[] = { <3.5, 3.6>, <4.5, 4.6> } diff --git a/vra/tests-overall/test-0023.c b/vra/tests-overall/test-0023.c deleted file mode 100644 index 8df5a1aa1..000000000 --- a/vra/tests-overall/test-0023.c +++ /dev/null @@ -1,20 +0,0 @@ -/** -* @file test-0023.c -* -* @brief Uninitialized 1D array that contains a structure which contains 1D array. -*/ - -int main(int argc, const char *argv[]) { - struct my_struct { - int a; - double b[2]; - }; - - struct my_struct array[2]; - - int a = array[0].a; - double b = array[1].b[0]; - - return 0; -} - diff --git a/vra/tests-overall/test-0023.c.ref b/vra/tests-overall/test-0023.c.ref deleted file mode 100644 index eec7c481e..000000000 --- a/vra/tests-overall/test-0023.c.ref +++ /dev/null @@ -1,17 +0,0 @@ ----------- Function main() ---------- -Block L1[IN] at lines from 15 to 18: -Block L1[OUT]: - a = { <-2147483648, 2147483647> } - array[].a = { <-2147483648, 2147483647> } - array[].b[] = { , <-inf, inf> } - b = { , <-inf, inf> } -Block L2[IN] at lines from 18 to 19: - a = { <-2147483648, 2147483647> } - array[].a = { <-2147483648, 2147483647> } - array[].b[] = { , <-inf, inf> } - b = { , <-inf, inf> } -Block L2[OUT]: - a = { <-2147483648, 2147483647> } - array[].a = { <-2147483648, 2147483647> } - array[].b[] = { , <-inf, inf> } - b = { , <-inf, inf> } diff --git a/vra/tests-overall/test-0024.c b/vra/tests-overall/test-0024.c deleted file mode 100644 index 42ac78669..000000000 --- a/vra/tests-overall/test-0024.c +++ /dev/null @@ -1,25 +0,0 @@ -/** -* @file test-0024.c -* -* @brief Filled 1D array that contains a structure which contains 1D array. -*/ - -int main(int argc, const char *argv[]) { - struct my_struct { - int a; - double b[2]; - }; - - struct my_struct array[2]; - - array[0].a = 1; - array[0].b[0] = 3.5; - array[0].b[1] = 3.6; - - array[1].a = 2; - array[1].b[0] = 4.5; - array[1].b[1] = 4.6; - - return 0; -} - diff --git a/vra/tests-overall/test-0024.c.ref b/vra/tests-overall/test-0024.c.ref deleted file mode 100644 index 9b030420d..000000000 --- a/vra/tests-overall/test-0024.c.ref +++ /dev/null @@ -1,11 +0,0 @@ ----------- Function main() ---------- -Block L1[IN] at lines from 15 to 23: -Block L1[OUT]: - array[].a = { <1, 2> } - array[].b[] = { <3.5, 3.6>, <4.5, 4.6> } -Block L2[IN] at lines from 23 to 24: - array[].a = { <1, 2> } - array[].b[] = { <3.5, 3.6>, <4.5, 4.6> } -Block L2[OUT]: - array[].a = { <1, 2> } - array[].b[] = { <3.5, 3.6>, <4.5, 4.6> } diff --git a/vra/tests-overall/test-0025.c b/vra/tests-overall/test-0025.c deleted file mode 100644 index 8e6b8152d..000000000 --- a/vra/tests-overall/test-0025.c +++ /dev/null @@ -1,24 +0,0 @@ -/** -* @file test-0025.c -* -* @brief Initialized 1D array that contains a structure which contains 1D array that contains -* a structure. -*/ - -int main(int argc, const char *argv[]) { - struct nested_struct { - int c; - signed char d; - }; - - struct my_struct { - int a; - struct nested_struct b[2]; - }; - - struct my_struct array[2] = { {1, {{4, 1}, {6, -1}}}, - {2, {{8, 3}, {9, -7}}} }; - - return 0; -} - diff --git a/vra/tests-overall/test-0025.c.ref b/vra/tests-overall/test-0025.c.ref deleted file mode 100644 index bbe5ab30d..000000000 --- a/vra/tests-overall/test-0025.c.ref +++ /dev/null @@ -1,14 +0,0 @@ ----------- Function main() ---------- -Block L1[IN] at lines from 19 to 22: -Block L1[OUT]: - array[].a = { <1, 2> } - array[].b[].c = { <4, 4>, <6, 6>, <8, 9> } - array[].b[].d = { <-7, -7>, <-1, -1>, <1, 1>, <3, 3> } -Block L2[IN] at lines from 22 to 23: - array[].a = { <1, 2> } - array[].b[].c = { <4, 4>, <6, 6>, <8, 9> } - array[].b[].d = { <-7, -7>, <-1, -1>, <1, 1>, <3, 3> } -Block L2[OUT]: - array[].a = { <1, 2> } - array[].b[].c = { <4, 4>, <6, 6>, <8, 9> } - array[].b[].d = { <-7, -7>, <-1, -1>, <1, 1>, <3, 3> } diff --git a/vra/tests-overall/test-0026.c b/vra/tests-overall/test-0026.c deleted file mode 100644 index a772a00be..000000000 --- a/vra/tests-overall/test-0026.c +++ /dev/null @@ -1,27 +0,0 @@ -/** -* @file test-0026.c -* -* @brief Uninitialized 1D array that contains a structure which contains 1D array that contains -* a structure. -*/ - -int main(int argc, const char *argv[]) { - struct nested_struct { - int c; - signed char d; - }; - - struct my_struct { - int a; - struct nested_struct b[2]; - }; - - struct my_struct array[2]; - - int a = array[0].a; - int c = array[0].b[0].c; - signed char d = array[1].b[1].d; - - return 0; -} - diff --git a/vra/tests-overall/test-0026.c.ref b/vra/tests-overall/test-0026.c.ref deleted file mode 100644 index ef6999389..000000000 --- a/vra/tests-overall/test-0026.c.ref +++ /dev/null @@ -1,23 +0,0 @@ ----------- Function main() ---------- -Block L1[IN] at lines from 21 to 25: -Block L1[OUT]: - a = { <-2147483648, 2147483647> } - array[].a = { <-2147483648, 2147483647> } - array[].b[].c = { <-2147483648, 2147483647> } - array[].b[].d = { <-128, 127> } - c = { <-2147483648, 2147483647> } - d = { <-128, 127> } -Block L2[IN] at lines from 25 to 26: - a = { <-2147483648, 2147483647> } - array[].a = { <-2147483648, 2147483647> } - array[].b[].c = { <-2147483648, 2147483647> } - array[].b[].d = { <-128, 127> } - c = { <-2147483648, 2147483647> } - d = { <-128, 127> } -Block L2[OUT]: - a = { <-2147483648, 2147483647> } - array[].a = { <-2147483648, 2147483647> } - array[].b[].c = { <-2147483648, 2147483647> } - array[].b[].d = { <-128, 127> } - c = { <-2147483648, 2147483647> } - d = { <-128, 127> } diff --git a/vra/tests-overall/test-0027.c b/vra/tests-overall/test-0027.c deleted file mode 100644 index 11bb79ce8..000000000 --- a/vra/tests-overall/test-0027.c +++ /dev/null @@ -1,35 +0,0 @@ -/** -* @file test-0027.c -* -* @brief Filled 1D array that contains a structure which contains 1D array that contains -* a structure. -*/ - -int main(int argc, const char *argv[]) { - struct nested_struct { - int c; - signed char d; - }; - - struct my_struct { - int a; - struct nested_struct b[2]; - }; - - struct my_struct array[2]; - - array[0].a = 14; - array[0].b[0].c = 20; - array[0].b[1].c = 21; - array[0].b[0].d = 126; - array[0].b[1].d = 127; - - array[1].a = 15; - array[1].b[0].c = 23; - array[1].b[1].c = 24; - array[1].b[0].d = 100; - array[1].b[1].d = 99; - - return 0; -} - diff --git a/vra/tests-overall/test-0027.c.ref b/vra/tests-overall/test-0027.c.ref deleted file mode 100644 index b148ecef0..000000000 --- a/vra/tests-overall/test-0027.c.ref +++ /dev/null @@ -1,14 +0,0 @@ ----------- Function main() ---------- -Block L1[IN] at lines from 21 to 33: -Block L1[OUT]: - array[].a = { <14, 15> } - array[].b[].c = { <20, 21>, <23, 24> } - array[].b[].d = { <99, 100>, <126, 127> } -Block L2[IN] at lines from 33 to 34: - array[].a = { <14, 15> } - array[].b[].c = { <20, 21>, <23, 24> } - array[].b[].d = { <99, 100>, <126, 127> } -Block L2[OUT]: - array[].a = { <14, 15> } - array[].b[].c = { <20, 21>, <23, 24> } - array[].b[].d = { <99, 100>, <126, 127> } diff --git a/vra/tests-overall/test-0028.c b/vra/tests-overall/test-0028.c deleted file mode 100644 index 403fd53c4..000000000 --- a/vra/tests-overall/test-0028.c +++ /dev/null @@ -1,18 +0,0 @@ -/** -* @file test-0028.c -* -* @brief Initialized 1D array that contains a structure which contains 2D array. -*/ - -int main(int argc, const char *argv[]) { - struct my_struct { - int a; - double b[2][2]; - }; - - struct my_struct array[2] = { {1, { {3.5, 3.6}, {3.7, 3.8}}}, - {2, { {4.5, 4.6}, {18.9, 18.95}}} }; - - return 0; -} - diff --git a/vra/tests-overall/test-0028.c.ref b/vra/tests-overall/test-0028.c.ref deleted file mode 100644 index 0e2ac8ef0..000000000 --- a/vra/tests-overall/test-0028.c.ref +++ /dev/null @@ -1,11 +0,0 @@ ----------- Function main() ---------- -Block L1[IN] at lines from 13 to 16: -Block L1[OUT]: - array[].a = { <1, 2> } - array[].b[][] = { <3.5, 3.8>, <4.5, 4.6>, <18.9, 18.95> } -Block L2[IN] at lines from 16 to 17: - array[].a = { <1, 2> } - array[].b[][] = { <3.5, 3.8>, <4.5, 4.6>, <18.9, 18.95> } -Block L2[OUT]: - array[].a = { <1, 2> } - array[].b[][] = { <3.5, 3.8>, <4.5, 4.6>, <18.9, 18.95> } diff --git a/vra/tests-overall/test-0029.c b/vra/tests-overall/test-0029.c deleted file mode 100644 index a2e2a83b4..000000000 --- a/vra/tests-overall/test-0029.c +++ /dev/null @@ -1,21 +0,0 @@ -/** -* @file test-0029.c -* -* @brief Uninitialized 1D array that contains a structure which contains 2D array. -*/ - -int main(int argc, const char *argv[]) { - struct my_struct { - int a; - double b[2][2]; - }; - - struct my_struct array[2]; - - int a = array[0].a + array[1].a; - int b1 = array[0].b[0][0] + array[0].b[0][1] + array[0].b[0][0] + array[0].b[0][1]; - int b2 = array[1].b[0][0] + array[1].b[0][1] + array[1].b[0][0] + array[1].b[0][1]; - - return 0; -} - diff --git a/vra/tests-overall/test-0029.c.ref b/vra/tests-overall/test-0029.c.ref deleted file mode 100644 index e853ac8a4..000000000 --- a/vra/tests-overall/test-0029.c.ref +++ /dev/null @@ -1,20 +0,0 @@ ----------- Function main() ---------- -Block L1[IN] at lines from 15 to 19: -Block L1[OUT]: - a = { <-2147483648, 2147483647> } - array[].a = { <-2147483648, 2147483647> } - array[].b[][] = { , <-inf, inf> } - b1 = { <-2147483648, 2147483647> } - b2 = { <-2147483648, 2147483647> } -Block L2[IN] at lines from 19 to 20: - a = { <-2147483648, 2147483647> } - array[].a = { <-2147483648, 2147483647> } - array[].b[][] = { , <-inf, inf> } - b1 = { <-2147483648, 2147483647> } - b2 = { <-2147483648, 2147483647> } -Block L2[OUT]: - a = { <-2147483648, 2147483647> } - array[].a = { <-2147483648, 2147483647> } - array[].b[][] = { , <-inf, inf> } - b1 = { <-2147483648, 2147483647> } - b2 = { <-2147483648, 2147483647> } diff --git a/vra/tests-overall/test-0030.c b/vra/tests-overall/test-0030.c deleted file mode 100644 index 7299248ad..000000000 --- a/vra/tests-overall/test-0030.c +++ /dev/null @@ -1,29 +0,0 @@ -/** -* @file test-0030.c -* -* @brief Filled 1D array that contains a structure which contains 2D array. -*/ - -int main(int argc, const char *argv[]) { - struct my_struct { - int a; - double b[2][2]; - }; - - struct my_struct array[2]; - - array[0].a = 1; - array[0].b[0][0] = 3.5; - array[0].b[0][1] = 3.6; - array[0].b[0][0] = 3.7; - array[0].b[0][1] = 3.8; - - array[1].a = 2; - array[1].b[0][0] = 4.5; - array[1].b[0][1] = 4.6; - array[1].b[0][0] = 18.9; - array[1].b[0][1] = 18.95; - - return 0; -} - diff --git a/vra/tests-overall/test-0030.c.ref b/vra/tests-overall/test-0030.c.ref deleted file mode 100644 index 7d68dc560..000000000 --- a/vra/tests-overall/test-0030.c.ref +++ /dev/null @@ -1,11 +0,0 @@ ----------- Function main() ---------- -Block L1[IN] at lines from 15 to 27: -Block L1[OUT]: - array[].a = { <1, 2> } - array[].b[][] = { <3.5, 3.8>, <4.5, 4.6>, <18.9, 18.95> } -Block L2[IN] at lines from 27 to 28: - array[].a = { <1, 2> } - array[].b[][] = { <3.5, 3.8>, <4.5, 4.6>, <18.9, 18.95> } -Block L2[OUT]: - array[].a = { <1, 2> } - array[].b[][] = { <3.5, 3.8>, <4.5, 4.6>, <18.9, 18.95> } diff --git a/vra/tests-overall/test-0031.c b/vra/tests-overall/test-0031.c deleted file mode 100644 index dbbb58d5b..000000000 --- a/vra/tests-overall/test-0031.c +++ /dev/null @@ -1,24 +0,0 @@ -/** -* @file test-0031.c -* -* @brief Initialized 1D array that contains a structure which contains 2D array that contains -* a structure. -*/ - -int main(int argc, const char *argv[]) { - struct nested_struct { - double c; - }; - - - struct my_struct { - int a; - struct nested_struct b[2][2]; - }; - - struct my_struct array[2] = { {1, { { {3.5} , {3.6}}, {{3.7}, {3.8}}}}, - {2, { {{4.5}, {4.6}}, {{18.9}, {18.95}}}} }; - - return 0; -} - diff --git a/vra/tests-overall/test-0031.c.ref b/vra/tests-overall/test-0031.c.ref deleted file mode 100644 index 648127385..000000000 --- a/vra/tests-overall/test-0031.c.ref +++ /dev/null @@ -1,11 +0,0 @@ ----------- Function main() ---------- -Block L1[IN] at lines from 19 to 22: -Block L1[OUT]: - array[].a = { <1, 2> } - array[].b[][].c = { <3.5, 3.8>, <4.5, 4.6>, <18.9, 18.95> } -Block L2[IN] at lines from 22 to 23: - array[].a = { <1, 2> } - array[].b[][].c = { <3.5, 3.8>, <4.5, 4.6>, <18.9, 18.95> } -Block L2[OUT]: - array[].a = { <1, 2> } - array[].b[][].c = { <3.5, 3.8>, <4.5, 4.6>, <18.9, 18.95> } diff --git a/vra/tests-overall/test-0032.c b/vra/tests-overall/test-0032.c deleted file mode 100644 index 02d2e94b9..000000000 --- a/vra/tests-overall/test-0032.c +++ /dev/null @@ -1,35 +0,0 @@ -/** -* @file test-0032.c -* -* @brief Uninitialized 1D array that contains a structure which contains 2D array that contains -* a structure. -*/ - -int main(int argc, const char *argv[]) { - struct nested_struct { - double c; - }; - - - struct my_struct { - int a; - struct nested_struct b[2][2]; - }; - - struct my_struct array[2]; - - int a = array[0].a; - double c = array[0].b[0][0].c; - c = array[0].b[0][1].c; - c = array[0].b[1][0].c; - c = array[0].b[1][1].c; - - a = array[0].a; - c = array[0].b[0][0].c; - c = array[0].b[0][1].c; - c = array[0].b[1][0].c; - c = array[0].b[1][1].c; - - return 0; -} - diff --git a/vra/tests-overall/test-0032.c.ref b/vra/tests-overall/test-0032.c.ref deleted file mode 100644 index ef9d54a1e..000000000 --- a/vra/tests-overall/test-0032.c.ref +++ /dev/null @@ -1,17 +0,0 @@ ----------- Function main() ---------- -Block L1[IN] at lines from 21 to 33: -Block L1[OUT]: - a = { <-2147483648, 2147483647> } - array[].a = { <-2147483648, 2147483647> } - array[].b[][].c = { , <-inf, inf> } - c = { , <-inf, inf> } -Block L2[IN] at lines from 33 to 34: - a = { <-2147483648, 2147483647> } - array[].a = { <-2147483648, 2147483647> } - array[].b[][].c = { , <-inf, inf> } - c = { , <-inf, inf> } -Block L2[OUT]: - a = { <-2147483648, 2147483647> } - array[].a = { <-2147483648, 2147483647> } - array[].b[][].c = { , <-inf, inf> } - c = { , <-inf, inf> } diff --git a/vra/tests-overall/test-0033.c b/vra/tests-overall/test-0033.c deleted file mode 100644 index db691e945..000000000 --- a/vra/tests-overall/test-0033.c +++ /dev/null @@ -1,34 +0,0 @@ -/** -* @file test-0033.c -* -* @brief Filled 1D array that contains a structure which contains 2D array that contains -* a structure. -*/ - -int main(int argc, const char *argv[]) { - struct nested_struct { - double c; - }; - - struct my_struct { - int a; - struct nested_struct b[2][2]; - }; - - struct my_struct array[2]; - - array[0].a = 1; - array[0].b[0][0].c = 3.5; - array[0].b[0][1].c = 3.6; - array[0].b[1][0].c = 3.7; - array[0].b[1][1].c = 3.8; - - array[1].a = 2; - array[1].b[0][0].c = 4.5; - array[1].b[0][1].c = 4.6; - array[1].b[1][0].c = 18.9; - array[1].b[1][1].c = 18.95; - - return 0; -} - diff --git a/vra/tests-overall/test-0033.c.ref b/vra/tests-overall/test-0033.c.ref deleted file mode 100644 index c2a029c9e..000000000 --- a/vra/tests-overall/test-0033.c.ref +++ /dev/null @@ -1,11 +0,0 @@ ----------- Function main() ---------- -Block L1[IN] at lines from 20 to 32: -Block L1[OUT]: - array[].a = { <1, 2> } - array[].b[][].c = { <3.5, 3.8>, <4.5, 4.6>, <18.9, 18.95> } -Block L2[IN] at lines from 32 to 33: - array[].a = { <1, 2> } - array[].b[][].c = { <3.5, 3.8>, <4.5, 4.6>, <18.9, 18.95> } -Block L2[OUT]: - array[].a = { <1, 2> } - array[].b[][].c = { <3.5, 3.8>, <4.5, 4.6>, <18.9, 18.95> } diff --git a/vra/tests-overall/test-0034.c b/vra/tests-overall/test-0034.c deleted file mode 100644 index a8a81f265..000000000 --- a/vra/tests-overall/test-0034.c +++ /dev/null @@ -1,46 +0,0 @@ -/** -* @file test-0034.c -* -* @brief Filled 2D array that contains a structure which contains 2D array that contains -* a structure. -*/ - -int main(int argc, const char *argv[]) { - struct nested_struct { - double c; - }; - - struct my_struct { - int a; - struct nested_struct b[2][2]; - }; - - struct my_struct array[2][2]; - - array[0][0].a = 1; - array[0][0].b[0][0].c = 3.5; - array[0][0].b[0][1].c = 3.6; - array[0][0].b[1][0].c = 3.7; - array[0][0].b[1][1].c = 3.8; - - array[0][1].a = 1; - array[0][1].b[0][0].c = 3.5; - array[0][1].b[0][1].c = 3.6; - array[0][1].b[1][0].c = 3.7; - array[0][1].b[1][1].c = 3.8; - - array[1][0].a = 2; - array[1][0].b[0][0].c = 4.5; - array[1][0].b[0][1].c = 4.6; - array[1][0].b[1][0].c = 18.9; - array[1][0].b[1][1].c = 18.95; - - array[1][1].a = 2; - array[1][1].b[0][0].c = 4.5; - array[1][1].b[0][1].c = 4.6; - array[1][1].b[1][0].c = 18.9; - array[1][1].b[1][1].c = 18.95; - - return 0; -} - diff --git a/vra/tests-overall/test-0034.c.ref b/vra/tests-overall/test-0034.c.ref deleted file mode 100644 index aee0a8fd7..000000000 --- a/vra/tests-overall/test-0034.c.ref +++ /dev/null @@ -1,11 +0,0 @@ ----------- Function main() ---------- -Block L1[IN] at lines from 20 to 44: -Block L1[OUT]: - array[][].a = { <1, 2> } - array[][].b[][].c = { <3.5, 3.8>, <4.5, 4.6>, <18.9, 18.95> } -Block L2[IN] at lines from 44 to 45: - array[][].a = { <1, 2> } - array[][].b[][].c = { <3.5, 3.8>, <4.5, 4.6>, <18.9, 18.95> } -Block L2[OUT]: - array[][].a = { <1, 2> } - array[][].b[][].c = { <3.5, 3.8>, <4.5, 4.6>, <18.9, 18.95> } diff --git a/vra/tests-overall/test-0035.c b/vra/tests-overall/test-0035.c deleted file mode 100644 index 5c56d1466..000000000 --- a/vra/tests-overall/test-0035.c +++ /dev/null @@ -1,33 +0,0 @@ -/** -* @file test-0035.c -* -* @brief Complicated structure. -*/ - -int main(int argc, const char *argv[]) { - struct my_struct{ - int a; - float b; - int c; - struct { - int e; - float f; - double g; - struct { - float i[10]; - } h; - int j; - } d; - } y; - - struct my_struct x = { .a = 1, .b = 1.3, .c = 12, .d.e = 100, .d.f = 1.45, - .d.g = 45.85, .d.h.i = {0,1,2,3,4,5,6,7,8,9}, .d.j = 1578}; - - y = x; - x.d.h.i[0] = 20; - x.d.h.i[1] = 30; - x.d.e = 10; - - return 0; -} - diff --git a/vra/tests-overall/test-0035.c.ref b/vra/tests-overall/test-0035.c.ref deleted file mode 100644 index 4f298365f..000000000 --- a/vra/tests-overall/test-0035.c.ref +++ /dev/null @@ -1,53 +0,0 @@ ----------- Function main() ---------- -Block L1[IN] at lines from 23 to 31: -Block L1[OUT]: - x.a = { <1, 1> } - x.b = { <1.3, 1.3> } - x.c = { <12, 12> } - x.d.e = { <10, 10> } - x.d.f = { <1.45, 1.45> } - x.d.g = { <45.85, 45.85> } - x.d.h.i[] = { <0, 0>, <1, 1>, <2, 2>, <3, 3>, <4, 4>, <5, 5>, <6, 6>, <7, 7>, <8, 8>, <9, 9>, <20, 20>, <30, 30> } - x.d.j = { <1578, 1578> } - y.a = { <1, 1> } - y.b = { <1.3, 1.3> } - y.c = { <12, 12> } - y.d.e = { <100, 100> } - y.d.f = { <1.45, 1.45> } - y.d.g = { <45.85, 45.85> } - y.d.h.i[] = { <0, 0>, <1, 1>, <2, 2>, <3, 3>, <4, 4>, <5, 5>, <6, 6>, <7, 7>, <8, 8>, <9, 9> } - y.d.j = { <1578, 1578> } -Block L2[IN] at lines from 31 to 32: - x.a = { <1, 1> } - x.b = { <1.3, 1.3> } - x.c = { <12, 12> } - x.d.e = { <10, 10> } - x.d.f = { <1.45, 1.45> } - x.d.g = { <45.85, 45.85> } - x.d.h.i[] = { <0, 0>, <1, 1>, <2, 2>, <3, 3>, <4, 4>, <5, 5>, <6, 6>, <7, 7>, <8, 8>, <9, 9>, <20, 20>, <30, 30> } - x.d.j = { <1578, 1578> } - y.a = { <1, 1> } - y.b = { <1.3, 1.3> } - y.c = { <12, 12> } - y.d.e = { <100, 100> } - y.d.f = { <1.45, 1.45> } - y.d.g = { <45.85, 45.85> } - y.d.h.i[] = { <0, 0>, <1, 1>, <2, 2>, <3, 3>, <4, 4>, <5, 5>, <6, 6>, <7, 7>, <8, 8>, <9, 9> } - y.d.j = { <1578, 1578> } -Block L2[OUT]: - x.a = { <1, 1> } - x.b = { <1.3, 1.3> } - x.c = { <12, 12> } - x.d.e = { <10, 10> } - x.d.f = { <1.45, 1.45> } - x.d.g = { <45.85, 45.85> } - x.d.h.i[] = { <0, 0>, <1, 1>, <2, 2>, <3, 3>, <4, 4>, <5, 5>, <6, 6>, <7, 7>, <8, 8>, <9, 9>, <20, 20>, <30, 30> } - x.d.j = { <1578, 1578> } - y.a = { <1, 1> } - y.b = { <1.3, 1.3> } - y.c = { <12, 12> } - y.d.e = { <100, 100> } - y.d.f = { <1.45, 1.45> } - y.d.g = { <45.85, 45.85> } - y.d.h.i[] = { <0, 0>, <1, 1>, <2, 2>, <3, 3>, <4, 4>, <5, 5>, <6, 6>, <7, 7>, <8, 8>, <9, 9> } - y.d.j = { <1578, 1578> } diff --git a/vra/tests-overall/test-0036.c b/vra/tests-overall/test-0036.c deleted file mode 100644 index 59006beaf..000000000 --- a/vra/tests-overall/test-0036.c +++ /dev/null @@ -1,23 +0,0 @@ -/** -* @file test-0036.c -* -* @brief Assignment to array. -*/ - -int main(int argc, const char *argv[]) { - - int a[10]; - a[0] = 0; - a[1] = 1; - a[2] = 2; - a[3] = 3; - a[4] = 4; - a[5] = 5; - a[6] = 6; - a[7] = 7; - a[8] = 8; - a[9] = 9; - - return 0; -} - diff --git a/vra/tests-overall/test-0036.c.ref b/vra/tests-overall/test-0036.c.ref deleted file mode 100644 index c23b4bc16..000000000 --- a/vra/tests-overall/test-0036.c.ref +++ /dev/null @@ -1,8 +0,0 @@ ----------- Function main() ---------- -Block L1[IN] at lines from 10 to 21: -Block L1[OUT]: - a[] = { <0, 9> } -Block L2[IN] at lines from 21 to 22: - a[] = { <0, 9> } -Block L2[OUT]: - a[] = { <0, 9> } diff --git a/vra/tests-overall/test-0037.c b/vra/tests-overall/test-0037.c deleted file mode 100644 index ce3c1bdc3..000000000 --- a/vra/tests-overall/test-0037.c +++ /dev/null @@ -1,14 +0,0 @@ -/** -* @file test-0037.c -* -* @brief Assignment to simple variable. -*/ - -int main(int argc, const char *argv[]) { - - int a = 0; - a = 1; - - return 0; -} - diff --git a/vra/tests-overall/test-0037.c.ref b/vra/tests-overall/test-0037.c.ref deleted file mode 100644 index aa770c33a..000000000 --- a/vra/tests-overall/test-0037.c.ref +++ /dev/null @@ -1,8 +0,0 @@ ----------- Function main() ---------- -Block L1[IN] at lines from 9 to 12: -Block L1[OUT]: - a = { <1, 1> } -Block L2[IN] at lines from 12 to 13: - a = { <1, 1> } -Block L2[OUT]: - a = { <1, 1> } diff --git a/vra/tests-overall/test-0038.c b/vra/tests-overall/test-0038.c deleted file mode 100644 index a258f3c02..000000000 --- a/vra/tests-overall/test-0038.c +++ /dev/null @@ -1,76 +0,0 @@ -/** -* @file test-0038.c -* -* @brief Plus of the constatnts/variables. -*/ - -#include -#include - -int main(int argc, const char *argv[]) { - // Plus of constatnts. - int a = 4 + 5; - - // Plus of a variable and constant. - int b = a + 1; - - // Plus of variables. - int c = a + b; - - // Overflows. - int d = INT_MAX + 1; - unsigned e = UINT_MAX + 1; - unsigned char f = 255 + 255; - - // Special float values; - float nan = NAN; - float inf = INFINITY; - - // INF + INF = INF - float g = inf + inf; - - // INF + (-INF) = -NAN - float h = inf + -inf; - - // INF + NAN = NAN - float i = inf + nan; - - // INF + number = INF - float j = inf + 10; - - // -INF + INF = -NAN - float k = -inf + inf; - - // -INF + (-INF) = -INF - float l = -inf + -inf; - - // -INF + NAN = NAN - float m = -inf + -nan; - - // -INF + number = -INF - float n = -inf + 158; - - // NAN + INF = NAN - float o = nan + inf; - - // NAN + (-INF) = NAN - float p = nan + -inf; - - // NAN + NAN = NAN - float q = nan + nan; - - // NAN + number = NAN - float r = nan + 14789; - - // number + INF = INF - float s = 1589 + inf; - - // number + (-INF) = -INF - float t = 148997 + -inf; - - // number + NAN = NAN - float u = 148997 + nan; - - return 0; -} - diff --git a/vra/tests-overall/test-0038.c.ref b/vra/tests-overall/test-0038.c.ref deleted file mode 100644 index c92aaf27e..000000000 --- a/vra/tests-overall/test-0038.c.ref +++ /dev/null @@ -1,74 +0,0 @@ ----------- Function main() ---------- -Block L1[IN] at lines from 12 to 74: -Block L1[OUT]: - a = { <9, 9> } - b = { <10, 10> } - c = { <19, 19> } - d = { <-2147483648, -2147483648> } - e = { <0, 0> } - f = { <254, 254> } - g = { } - h = { <-nan, -nan> } - i = { } - inf = { } - j = { } - k = { <-nan, -nan> } - l = { <-inf, -inf> } - m = { } - n = { <-inf, -inf> } - nan = { } - o = { } - p = { } - q = { } - r = { } - s = { } - t = { <-inf, -inf> } - u = { } -Block L2[IN] at lines from 74 to 75: - a = { <9, 9> } - b = { <10, 10> } - c = { <19, 19> } - d = { <-2147483648, -2147483648> } - e = { <0, 0> } - f = { <254, 254> } - g = { } - h = { <-nan, -nan> } - i = { } - inf = { } - j = { } - k = { <-nan, -nan> } - l = { <-inf, -inf> } - m = { } - n = { <-inf, -inf> } - nan = { } - o = { } - p = { } - q = { } - r = { } - s = { } - t = { <-inf, -inf> } - u = { } -Block L2[OUT]: - a = { <9, 9> } - b = { <10, 10> } - c = { <19, 19> } - d = { <-2147483648, -2147483648> } - e = { <0, 0> } - f = { <254, 254> } - g = { } - h = { <-nan, -nan> } - i = { } - inf = { } - j = { } - k = { <-nan, -nan> } - l = { <-inf, -inf> } - m = { } - n = { <-inf, -inf> } - nan = { } - o = { } - p = { } - q = { } - r = { } - s = { } - t = { <-inf, -inf> } - u = { } diff --git a/vra/tests-overall/test-0039.c b/vra/tests-overall/test-0039.c deleted file mode 100644 index 5d7f8647d..000000000 --- a/vra/tests-overall/test-0039.c +++ /dev/null @@ -1,77 +0,0 @@ -/** -* @file test-0039.c -* -* @brief Minus of the constatnts/variables. -*/ - -#include -#include - -int main(int argc, const char *argv[]) { - // Minux of constatnts. - int a = 4 - 5; - - // Minus of a variable and constant. - int b = a - 1; - - // Minus of variables. - int c = a - b; - - // Overflows. - int d = INT_MIN - 1; - unsigned e = 0 - 1; - unsigned char f = 255 - 256; - - // Special float values; - float nan = NAN; - float inf = INFINITY; - - // INF - INF = NAN - float g = inf - inf; - - // INF - (-INF) = INF - float h = inf - (-inf); - - // INF - NAN = NAN - float i = inf - nan; - - // INF - number = INF - float j = inf - 10; - - // -INF - INF = -INF - float k = -inf - inf; - - // -INF - (-INF) = NAN - float l = -inf - -inf; - - // -INF - NAN = NAN - float m = -inf - -nan; - - // -INF - number = -INF - float n = -inf - 158; - - // NAN - INF = NAN - float o = nan - inf; - - // NAN - (-INF) = NAN - float p = nan - -inf; - - // NAN - NAN = NAN - float q = nan - nan; - - // NAN - number = NAN - float r = nan - 14789; - - // number - INF = -INF - float s = 1589 - inf; - - // number - (-INF) = INF - float t = 148997 - -inf; - - // number - NAN = NAN - float u = 148997 - nan; - - return 0; -} - - diff --git a/vra/tests-overall/test-0039.c.ref b/vra/tests-overall/test-0039.c.ref deleted file mode 100644 index 1aa11c78b..000000000 --- a/vra/tests-overall/test-0039.c.ref +++ /dev/null @@ -1,74 +0,0 @@ ----------- Function main() ---------- -Block L1[IN] at lines from 12 to 74: -Block L1[OUT]: - a = { <-1, -1> } - b = { <-2, -2> } - c = { <1, 1> } - d = { <2147483647, 2147483647> } - e = { <4294967295, 4294967295> } - f = { <255, 255> } - g = { <-nan, -nan> } - h = { } - i = { } - inf = { } - j = { } - k = { <-inf, -inf> } - l = { <-nan, -nan> } - m = { } - n = { <-inf, -inf> } - nan = { } - o = { } - p = { } - q = { } - r = { } - s = { <-inf, -inf> } - t = { } - u = { } -Block L2[IN] at lines from 74 to 75: - a = { <-1, -1> } - b = { <-2, -2> } - c = { <1, 1> } - d = { <2147483647, 2147483647> } - e = { <4294967295, 4294967295> } - f = { <255, 255> } - g = { <-nan, -nan> } - h = { } - i = { } - inf = { } - j = { } - k = { <-inf, -inf> } - l = { <-nan, -nan> } - m = { } - n = { <-inf, -inf> } - nan = { } - o = { } - p = { } - q = { } - r = { } - s = { <-inf, -inf> } - t = { } - u = { } -Block L2[OUT]: - a = { <-1, -1> } - b = { <-2, -2> } - c = { <1, 1> } - d = { <2147483647, 2147483647> } - e = { <4294967295, 4294967295> } - f = { <255, 255> } - g = { <-nan, -nan> } - h = { } - i = { } - inf = { } - j = { } - k = { <-inf, -inf> } - l = { <-nan, -nan> } - m = { } - n = { <-inf, -inf> } - nan = { } - o = { } - p = { } - q = { } - r = { } - s = { <-inf, -inf> } - t = { } - u = { } diff --git a/vra/tests-overall/test-0040.c b/vra/tests-overall/test-0040.c deleted file mode 100644 index 824c96755..000000000 --- a/vra/tests-overall/test-0040.c +++ /dev/null @@ -1,76 +0,0 @@ -/** -* @file test-0040.c -* -* @brief Multiplication of the constatnts/variables. -*/ - -#include -#include - -int main(int argc, const char *argv[]) { - // Minux of constatnts. - int a = 4 * 5; - - // Minus of a variable and constant. - int b = a * 10; - - // Minus of variables. - int c = a * b; - - // Overflows. - int d = INT_MAX * 2; - unsigned e = UINT_MAX * 2; - unsigned char f = 255 * 255; - - // Special float values; - float nan = NAN; - float inf = INFINITY; - - // INF * INF = INF - float g = inf * inf; - - // INF * (-INF) = -INF - float h = inf * (-inf); - - // INF * NAN = NAN - float i = inf * nan; - - // INF * number = INF - float j = inf * 10; - - // -INF * INF = -INF - float k = -inf * inf; - - // -INF * (-INF) = INF - float l = -inf * -inf; - - // -INF * NAN = NAN - float m = -inf * -nan; - - // -INF * number = -INF - float n = -inf * 158; - - // NAN * INF = NAN - float o = nan * inf; - - // NAN * (-INF) = NAN - float p = nan * -inf; - - // NAN * NAN = NAN - float q = nan * nan; - - // NAN * number = NAN - float r = nan * 14789; - - // number * INF = INF - float s = 1589 * inf; - - // number * (-INF) = -INF - float t = 148997 * -inf; - - // number * NAN = NAN - float u = 148997 * nan; - - return 0; -} - diff --git a/vra/tests-overall/test-0040.c.ref b/vra/tests-overall/test-0040.c.ref deleted file mode 100644 index 4258d19df..000000000 --- a/vra/tests-overall/test-0040.c.ref +++ /dev/null @@ -1,74 +0,0 @@ ----------- Function main() ---------- -Block L1[IN] at lines from 12 to 74: -Block L1[OUT]: - a = { <20, 20> } - b = { <200, 200> } - c = { <4000, 4000> } - d = { <-2, -2> } - e = { <4294967294, 4294967294> } - f = { <1, 1> } - g = { } - h = { <-inf, -inf> } - i = { } - inf = { } - j = { } - k = { <-inf, -inf> } - l = { } - m = { } - n = { <-inf, -inf> } - nan = { } - o = { } - p = { } - q = { } - r = { } - s = { } - t = { <-inf, -inf> } - u = { } -Block L2[IN] at lines from 74 to 75: - a = { <20, 20> } - b = { <200, 200> } - c = { <4000, 4000> } - d = { <-2, -2> } - e = { <4294967294, 4294967294> } - f = { <1, 1> } - g = { } - h = { <-inf, -inf> } - i = { } - inf = { } - j = { } - k = { <-inf, -inf> } - l = { } - m = { } - n = { <-inf, -inf> } - nan = { } - o = { } - p = { } - q = { } - r = { } - s = { } - t = { <-inf, -inf> } - u = { } -Block L2[OUT]: - a = { <20, 20> } - b = { <200, 200> } - c = { <4000, 4000> } - d = { <-2, -2> } - e = { <4294967294, 4294967294> } - f = { <1, 1> } - g = { } - h = { <-inf, -inf> } - i = { } - inf = { } - j = { } - k = { <-inf, -inf> } - l = { } - m = { } - n = { <-inf, -inf> } - nan = { } - o = { } - p = { } - q = { } - r = { } - s = { } - t = { <-inf, -inf> } - u = { } diff --git a/vra/tests-overall/test-0041.c b/vra/tests-overall/test-0041.c deleted file mode 100644 index 0ea9a593e..000000000 --- a/vra/tests-overall/test-0041.c +++ /dev/null @@ -1,41 +0,0 @@ -/** -* @file test-0041.c -* -* @brief Comparisons: ==, !=, >, <, >=, <=. -*/ - -#include - -int main(int argc, const char *argv[]) { - int x = 12; - float y = 13.0; - - // < - bool a = x < y; - bool b = y < x; - - // > - bool c = x > y; - bool d = y > x; - bool e = x > x; - - // >= - bool f = y >= x; - bool g = x >= y; - bool h = y >= y; - - // <= - bool i = x <= y; - bool j = y <= x; - bool k = x <= x; - - // == - bool l = x == x; - bool m = x == y; - - // != - bool n = x != x; - bool o = x != y; - - return 0; -} diff --git a/vra/tests-overall/test-0041.c.ref b/vra/tests-overall/test-0041.c.ref deleted file mode 100644 index 6141b3990..000000000 --- a/vra/tests-overall/test-0041.c.ref +++ /dev/null @@ -1,56 +0,0 @@ ----------- Function main() ---------- -Block L1[IN] at lines from 10 to 40: -Block L1[OUT]: - a = { <1, 1> } - b = { <0, 0> } - c = { <0, 0> } - d = { <1, 1> } - e = { <0, 0> } - f = { <1, 1> } - g = { <0, 0> } - h = { <1, 1> } - i = { <1, 1> } - j = { <0, 0> } - k = { <1, 1> } - l = { <1, 1> } - m = { <0, 0> } - n = { <0, 0> } - o = { <1, 1> } - x = { <12, 12> } - y = { <13, 13> } -Block L2[IN] at lines from 40 to 41: - a = { <1, 1> } - b = { <0, 0> } - c = { <0, 0> } - d = { <1, 1> } - e = { <0, 0> } - f = { <1, 1> } - g = { <0, 0> } - h = { <1, 1> } - i = { <1, 1> } - j = { <0, 0> } - k = { <1, 1> } - l = { <1, 1> } - m = { <0, 0> } - n = { <0, 0> } - o = { <1, 1> } - x = { <12, 12> } - y = { <13, 13> } -Block L2[OUT]: - a = { <1, 1> } - b = { <0, 0> } - c = { <0, 0> } - d = { <1, 1> } - e = { <0, 0> } - f = { <1, 1> } - g = { <0, 0> } - h = { <1, 1> } - i = { <1, 1> } - j = { <0, 0> } - k = { <1, 1> } - l = { <1, 1> } - m = { <0, 0> } - n = { <0, 0> } - o = { <1, 1> } - x = { <12, 12> } - y = { <13, 13> } diff --git a/vra/tests-overall/test-0042.c b/vra/tests-overall/test-0042.c deleted file mode 100644 index 39bd12ea4..000000000 --- a/vra/tests-overall/test-0042.c +++ /dev/null @@ -1,30 +0,0 @@ -/** -* @file test-0042.c -* -* @brief Logical and/or/xor/not. -*/ - -#include - -int main(int argc, const char *argv[]) { - int x = 12; - float y = 0.0; - - // && - bool a = x && x; - bool b = x && y; - bool c = y && x; - bool d = y && y; - - // || - bool e = x || x; - bool f = x || y; - bool g = y || x; - bool h = y || y; - - // ! - bool i = !x; - bool j = !y; - - return 0; -} diff --git a/vra/tests-overall/test-0042.c.ref b/vra/tests-overall/test-0042.c.ref deleted file mode 100644 index 280b0aa50..000000000 --- a/vra/tests-overall/test-0042.c.ref +++ /dev/null @@ -1,457 +0,0 @@ ----------- Function main() ---------- -Block L1[IN] at lines from 10 to 14: -Block L1[OUT]: - x = { <12, 12> } - y = { <0, 0> } -Block L2[IN] at lines from 14 to 14: - x = { <12, 12> } - y = { <0, 0> } -Block L2[OUT]: - x = { <12, 12> } - y = { <0, 0> } -Block L3[IN] at lines from 14 to 14: - x = { <12, 12> } - y = { <0, 0> } -Block L3[OUT]: - x = { <12, 12> } - y = { <0, 0> } -Block L4[IN] at lines from 14 to 14: - x = { <12, 12> } - y = { <0, 0> } -Block L4[OUT]: - x = { <12, 12> } - y = { <0, 0> } -Block L5[IN] at lines from 14 to 15: - x = { <12, 12> } - y = { <0, 0> } -Block L5[OUT]: - a = { <0, 1> } - x = { <12, 12> } - y = { <0, 0> } -Block L6[IN] at lines from 15 to 15: - a = { <0, 1> } - x = { <12, 12> } - y = { <0, 0> } -Block L6[OUT]: - a = { <0, 1> } - x = { <12, 12> } - y = { <0, 0> } -Block L7[IN] at lines from 15 to 15: - a = { <0, 1> } - x = { <12, 12> } - y = { <0, 0> } -Block L7[OUT]: - a = { <0, 1> } - x = { <12, 12> } - y = { <0, 0> } -Block L8[IN] at lines from 15 to 15: - a = { <0, 1> } - x = { <12, 12> } - y = { <0, 0> } -Block L8[OUT]: - a = { <0, 1> } - x = { <12, 12> } - y = { <0, 0> } -Block L9[IN] at lines from 15 to 16: - a = { <0, 1> } - x = { <12, 12> } - y = { <0, 0> } -Block L9[OUT]: - a = { <0, 1> } - b = { <0, 1> } - x = { <12, 12> } - y = { <0, 0> } -Block L10[IN] at lines from 16 to 16: - a = { <0, 1> } - b = { <0, 1> } - x = { <12, 12> } - y = { <0, 0> } -Block L10[OUT]: - a = { <0, 1> } - b = { <0, 1> } - x = { <12, 12> } - y = { <0, 0> } -Block L11[IN] at lines from 16 to 16: - a = { <0, 1> } - b = { <0, 1> } - x = { <12, 12> } - y = { <0, 0> } -Block L11[OUT]: - a = { <0, 1> } - b = { <0, 1> } - x = { <12, 12> } - y = { <0, 0> } -Block L12[IN] at lines from 16 to 16: - a = { <0, 1> } - b = { <0, 1> } - x = { <12, 12> } - y = { <0, 0> } -Block L12[OUT]: - a = { <0, 1> } - b = { <0, 1> } - x = { <12, 12> } - y = { <0, 0> } -Block L13[IN] at lines from 16 to 17: - a = { <0, 1> } - b = { <0, 1> } - x = { <12, 12> } - y = { <0, 0> } -Block L13[OUT]: - a = { <0, 1> } - b = { <0, 1> } - c = { <0, 1> } - x = { <12, 12> } - y = { <0, 0> } -Block L14[IN] at lines from 17 to 17: - a = { <0, 1> } - b = { <0, 1> } - c = { <0, 1> } - x = { <12, 12> } - y = { <0, 0> } -Block L14[OUT]: - a = { <0, 1> } - b = { <0, 1> } - c = { <0, 1> } - x = { <12, 12> } - y = { <0, 0> } -Block L15[IN] at lines from 17 to 17: - a = { <0, 1> } - b = { <0, 1> } - c = { <0, 1> } - x = { <12, 12> } - y = { <0, 0> } -Block L15[OUT]: - a = { <0, 1> } - b = { <0, 1> } - c = { <0, 1> } - x = { <12, 12> } - y = { <0, 0> } -Block L16[IN] at lines from 17 to 17: - a = { <0, 1> } - b = { <0, 1> } - c = { <0, 1> } - x = { <12, 12> } - y = { <0, 0> } -Block L16[OUT]: - a = { <0, 1> } - b = { <0, 1> } - c = { <0, 1> } - x = { <12, 12> } - y = { <0, 0> } -Block L17[IN] at lines from 17 to 20: - a = { <0, 1> } - b = { <0, 1> } - c = { <0, 1> } - x = { <12, 12> } - y = { <0, 0> } -Block L17[OUT]: - a = { <0, 1> } - b = { <0, 1> } - c = { <0, 1> } - d = { <0, 1> } - x = { <12, 12> } - y = { <0, 0> } -Block L18[IN] at lines from 20 to 20: - a = { <0, 1> } - b = { <0, 1> } - c = { <0, 1> } - d = { <0, 1> } - x = { <12, 12> } - y = { <0, 0> } -Block L18[OUT]: - a = { <0, 1> } - b = { <0, 1> } - c = { <0, 1> } - d = { <0, 1> } - x = { <12, 12> } - y = { <0, 0> } -Block L19[IN] at lines from 20 to 20: - a = { <0, 1> } - b = { <0, 1> } - c = { <0, 1> } - d = { <0, 1> } - x = { <12, 12> } - y = { <0, 0> } -Block L19[OUT]: - a = { <0, 1> } - b = { <0, 1> } - c = { <0, 1> } - d = { <0, 1> } - x = { <12, 12> } - y = { <0, 0> } -Block L20[IN] at lines from 20 to 20: - a = { <0, 1> } - b = { <0, 1> } - c = { <0, 1> } - d = { <0, 1> } - x = { <12, 12> } - y = { <0, 0> } -Block L20[OUT]: - a = { <0, 1> } - b = { <0, 1> } - c = { <0, 1> } - d = { <0, 1> } - x = { <12, 12> } - y = { <0, 0> } -Block L21[IN] at lines from 20 to 21: - a = { <0, 1> } - b = { <0, 1> } - c = { <0, 1> } - d = { <0, 1> } - x = { <12, 12> } - y = { <0, 0> } -Block L21[OUT]: - a = { <0, 1> } - b = { <0, 1> } - c = { <0, 1> } - d = { <0, 1> } - e = { <0, 1> } - x = { <12, 12> } - y = { <0, 0> } -Block L22[IN] at lines from 21 to 21: - a = { <0, 1> } - b = { <0, 1> } - c = { <0, 1> } - d = { <0, 1> } - e = { <0, 1> } - x = { <12, 12> } - y = { <0, 0> } -Block L22[OUT]: - a = { <0, 1> } - b = { <0, 1> } - c = { <0, 1> } - d = { <0, 1> } - e = { <0, 1> } - x = { <12, 12> } - y = { <0, 0> } -Block L23[IN] at lines from 21 to 21: - a = { <0, 1> } - b = { <0, 1> } - c = { <0, 1> } - d = { <0, 1> } - e = { <0, 1> } - x = { <12, 12> } - y = { <0, 0> } -Block L23[OUT]: - a = { <0, 1> } - b = { <0, 1> } - c = { <0, 1> } - d = { <0, 1> } - e = { <0, 1> } - x = { <12, 12> } - y = { <0, 0> } -Block L24[IN] at lines from 21 to 21: - a = { <0, 1> } - b = { <0, 1> } - c = { <0, 1> } - d = { <0, 1> } - e = { <0, 1> } - x = { <12, 12> } - y = { <0, 0> } -Block L24[OUT]: - a = { <0, 1> } - b = { <0, 1> } - c = { <0, 1> } - d = { <0, 1> } - e = { <0, 1> } - x = { <12, 12> } - y = { <0, 0> } -Block L25[IN] at lines from 21 to 22: - a = { <0, 1> } - b = { <0, 1> } - c = { <0, 1> } - d = { <0, 1> } - e = { <0, 1> } - x = { <12, 12> } - y = { <0, 0> } -Block L25[OUT]: - a = { <0, 1> } - b = { <0, 1> } - c = { <0, 1> } - d = { <0, 1> } - e = { <0, 1> } - f = { <0, 1> } - x = { <12, 12> } - y = { <0, 0> } -Block L26[IN] at lines from 22 to 22: - a = { <0, 1> } - b = { <0, 1> } - c = { <0, 1> } - d = { <0, 1> } - e = { <0, 1> } - f = { <0, 1> } - x = { <12, 12> } - y = { <0, 0> } -Block L26[OUT]: - a = { <0, 1> } - b = { <0, 1> } - c = { <0, 1> } - d = { <0, 1> } - e = { <0, 1> } - f = { <0, 1> } - x = { <12, 12> } - y = { <0, 0> } -Block L27[IN] at lines from 22 to 22: - a = { <0, 1> } - b = { <0, 1> } - c = { <0, 1> } - d = { <0, 1> } - e = { <0, 1> } - f = { <0, 1> } - x = { <12, 12> } - y = { <0, 0> } -Block L27[OUT]: - a = { <0, 1> } - b = { <0, 1> } - c = { <0, 1> } - d = { <0, 1> } - e = { <0, 1> } - f = { <0, 1> } - x = { <12, 12> } - y = { <0, 0> } -Block L28[IN] at lines from 22 to 22: - a = { <0, 1> } - b = { <0, 1> } - c = { <0, 1> } - d = { <0, 1> } - e = { <0, 1> } - f = { <0, 1> } - x = { <12, 12> } - y = { <0, 0> } -Block L28[OUT]: - a = { <0, 1> } - b = { <0, 1> } - c = { <0, 1> } - d = { <0, 1> } - e = { <0, 1> } - f = { <0, 1> } - x = { <12, 12> } - y = { <0, 0> } -Block L29[IN] at lines from 22 to 23: - a = { <0, 1> } - b = { <0, 1> } - c = { <0, 1> } - d = { <0, 1> } - e = { <0, 1> } - f = { <0, 1> } - x = { <12, 12> } - y = { <0, 0> } -Block L29[OUT]: - a = { <0, 1> } - b = { <0, 1> } - c = { <0, 1> } - d = { <0, 1> } - e = { <0, 1> } - f = { <0, 1> } - g = { <0, 1> } - x = { <12, 12> } - y = { <0, 0> } -Block L30[IN] at lines from 23 to 23: - a = { <0, 1> } - b = { <0, 1> } - c = { <0, 1> } - d = { <0, 1> } - e = { <0, 1> } - f = { <0, 1> } - g = { <0, 1> } - x = { <12, 12> } - y = { <0, 0> } -Block L30[OUT]: - a = { <0, 1> } - b = { <0, 1> } - c = { <0, 1> } - d = { <0, 1> } - e = { <0, 1> } - f = { <0, 1> } - g = { <0, 1> } - x = { <12, 12> } - y = { <0, 0> } -Block L31[IN] at lines from 23 to 23: - a = { <0, 1> } - b = { <0, 1> } - c = { <0, 1> } - d = { <0, 1> } - e = { <0, 1> } - f = { <0, 1> } - g = { <0, 1> } - x = { <12, 12> } - y = { <0, 0> } -Block L31[OUT]: - a = { <0, 1> } - b = { <0, 1> } - c = { <0, 1> } - d = { <0, 1> } - e = { <0, 1> } - f = { <0, 1> } - g = { <0, 1> } - x = { <12, 12> } - y = { <0, 0> } -Block L32[IN] at lines from 23 to 23: - a = { <0, 1> } - b = { <0, 1> } - c = { <0, 1> } - d = { <0, 1> } - e = { <0, 1> } - f = { <0, 1> } - g = { <0, 1> } - x = { <12, 12> } - y = { <0, 0> } -Block L32[OUT]: - a = { <0, 1> } - b = { <0, 1> } - c = { <0, 1> } - d = { <0, 1> } - e = { <0, 1> } - f = { <0, 1> } - g = { <0, 1> } - x = { <12, 12> } - y = { <0, 0> } -Block L33[IN] at lines from 23 to 29: - a = { <0, 1> } - b = { <0, 1> } - c = { <0, 1> } - d = { <0, 1> } - e = { <0, 1> } - f = { <0, 1> } - g = { <0, 1> } - x = { <12, 12> } - y = { <0, 0> } -Block L33[OUT]: - a = { <0, 1> } - b = { <0, 1> } - c = { <0, 1> } - d = { <0, 1> } - e = { <0, 1> } - f = { <0, 1> } - g = { <0, 1> } - h = { <0, 1> } - i = { <0, 0> } - j = { <1, 1> } - x = { <12, 12> } - y = { <0, 0> } -Block L34[IN] at lines from 29 to 30: - a = { <0, 1> } - b = { <0, 1> } - c = { <0, 1> } - d = { <0, 1> } - e = { <0, 1> } - f = { <0, 1> } - g = { <0, 1> } - h = { <0, 1> } - i = { <0, 0> } - j = { <1, 1> } - x = { <12, 12> } - y = { <0, 0> } -Block L34[OUT]: - a = { <0, 1> } - b = { <0, 1> } - c = { <0, 1> } - d = { <0, 1> } - e = { <0, 1> } - f = { <0, 1> } - g = { <0, 1> } - h = { <0, 1> } - i = { <0, 0> } - j = { <1, 1> } - x = { <12, 12> } - y = { <0, 0> } diff --git a/vra/tests-overall/test-0043.c b/vra/tests-overall/test-0043.c deleted file mode 100644 index f3ad13f94..000000000 --- a/vra/tests-overall/test-0043.c +++ /dev/null @@ -1,33 +0,0 @@ -/** -* @file test-0043.c -* -* @brief Bit not/and/or/xor/left shift/right shif/left rotate/right rotate. -*/ - -int main(int argc, const char *argv[]) { - // Bit not. - unsigned a = 0; - unsigned b = ~a; - - // Bit and. - unsigned c = a & b; - - // Bit or. - unsigned d = a | b; - - // Bit xor. - unsigned e = 0b00110011 ^ 0b11001100; - - // Left shift. - unsigned f = 100 << 2; - - // Right shift. - unsigned g = 100 >> 2; - - // Left rotate. - unsigned char h = 0b00001111; - unsigned i = (h << 4) + (h >> 4); - - return 0; -} - diff --git a/vra/tests-overall/test-0043.c.ref b/vra/tests-overall/test-0043.c.ref deleted file mode 100644 index a337dd354..000000000 --- a/vra/tests-overall/test-0043.c.ref +++ /dev/null @@ -1,32 +0,0 @@ ----------- Function main() ---------- -Block L1[IN] at lines from 9 to 31: -Block L1[OUT]: - a = { <0, 0> } - b = { <4294967295, 4294967295> } - c = { <0, 0> } - d = { <4294967295, 4294967295> } - e = { <255, 255> } - f = { <400, 400> } - g = { <25, 25> } - h = { <15, 15> } - i = { <240, 240> } -Block L2[IN] at lines from 31 to 32: - a = { <0, 0> } - b = { <4294967295, 4294967295> } - c = { <0, 0> } - d = { <4294967295, 4294967295> } - e = { <255, 255> } - f = { <400, 400> } - g = { <25, 25> } - h = { <15, 15> } - i = { <240, 240> } -Block L2[OUT]: - a = { <0, 0> } - b = { <4294967295, 4294967295> } - c = { <0, 0> } - d = { <4294967295, 4294967295> } - e = { <255, 255> } - f = { <400, 400> } - g = { <25, 25> } - h = { <15, 15> } - i = { <240, 240> } diff --git a/vra/tests-overall/test-0044.c b/vra/tests-overall/test-0044.c deleted file mode 100644 index d558a05c2..000000000 --- a/vra/tests-overall/test-0044.c +++ /dev/null @@ -1,30 +0,0 @@ -/** -* @file test-0044.c -* -* @brief Unary-/abs/float/min/max. -*/ - -#include - -int main(int argc, const char *argv[]) { - // Unary minus. - int a = 25; - int b = -a; - - // Absolute value. - int c = abs(a); - int d = abs(b); - - // Float. - float e = d; - - // Min. - int f = (a < b) ? a : b; - - // Max. - int g = (a > b) ? a : b; - - return 0; -} - - diff --git a/vra/tests-overall/test-0044.c.ref b/vra/tests-overall/test-0044.c.ref deleted file mode 100644 index 4e37e5b17..000000000 --- a/vra/tests-overall/test-0044.c.ref +++ /dev/null @@ -1,26 +0,0 @@ ----------- Function main() ---------- -Block L1[IN] at lines from 11 to 27: -Block L1[OUT]: - a = { <25, 25> } - b = { <-25, -25> } - c = { <25, 25> } - d = { <25, 25> } - e = { <25, 25> } - f = { <-25, -25> } - g = { <25, 25> } -Block L2[IN] at lines from 27 to 28: - a = { <25, 25> } - b = { <-25, -25> } - c = { <25, 25> } - d = { <25, 25> } - e = { <25, 25> } - f = { <-25, -25> } - g = { <25, 25> } -Block L2[OUT]: - a = { <25, 25> } - b = { <-25, -25> } - c = { <25, 25> } - d = { <25, 25> } - e = { <25, 25> } - f = { <-25, -25> } - g = { <25, 25> } diff --git a/vra/tests-overall/test-0045.c b/vra/tests-overall/test-0045.c deleted file mode 100644 index dbbe0f5a2..000000000 --- a/vra/tests-overall/test-0045.c +++ /dev/null @@ -1,36 +0,0 @@ -/** -* @file test-0045.c -* -* @brief trunc_mod/trunc_div/exact_div/rdiv -*/ - -#include - -int main(int argc, const char *argv[]) { - // Trunc div. - unsigned char a = 10 / 0; // Undefined behaviour. - int b = INT_MIN / -1; // Undefined behaviour. - int c = -10; - int d = 3; - int e = c / d; - unsigned f = 10; - unsigned g = 3; - unsigned h = f / g; - unsigned char i = 10; - signed char j = -3; - int k = i / j; - - // Exact div. - int l = -10; - int m = 2; - int n = l / m; - unsigned o = 10; - unsigned p = 2; - unsigned r = o / p; - unsigned char s = 10; - signed char t = -2; - int u = s / t; - - return 0; -} - diff --git a/vra/tests-overall/test-0045.c.ref b/vra/tests-overall/test-0045.c.ref deleted file mode 100644 index 5ba7c6f09..000000000 --- a/vra/tests-overall/test-0045.c.ref +++ /dev/null @@ -1,65 +0,0 @@ ----------- Function main() ---------- -Block L1[IN] at lines from 11 to 34: -Block L1[OUT]: - a = { <0, 255> } - b = { <-2147483648, -2147483648> } - c = { <-10, -10> } - d = { <3, 3> } - e = { <-3, -3> } - f = { <10, 10> } - g = { <3, 3> } - h = { <3, 3> } - i = { <10, 10> } - j = { <-3, -3> } - k = { <-3, -3> } - l = { <-10, -10> } - m = { <2, 2> } - n = { <-5, -5> } - o = { <10, 10> } - p = { <2, 2> } - r = { <5, 5> } - s = { <10, 10> } - t = { <-2, -2> } - u = { <-5, -5> } -Block L2[IN] at lines from 34 to 35: - a = { <0, 255> } - b = { <-2147483648, -2147483648> } - c = { <-10, -10> } - d = { <3, 3> } - e = { <-3, -3> } - f = { <10, 10> } - g = { <3, 3> } - h = { <3, 3> } - i = { <10, 10> } - j = { <-3, -3> } - k = { <-3, -3> } - l = { <-10, -10> } - m = { <2, 2> } - n = { <-5, -5> } - o = { <10, 10> } - p = { <2, 2> } - r = { <5, 5> } - s = { <10, 10> } - t = { <-2, -2> } - u = { <-5, -5> } -Block L2[OUT]: - a = { <0, 255> } - b = { <-2147483648, -2147483648> } - c = { <-10, -10> } - d = { <3, 3> } - e = { <-3, -3> } - f = { <10, 10> } - g = { <3, 3> } - h = { <3, 3> } - i = { <10, 10> } - j = { <-3, -3> } - k = { <-3, -3> } - l = { <-10, -10> } - m = { <2, 2> } - n = { <-5, -5> } - o = { <10, 10> } - p = { <2, 2> } - r = { <5, 5> } - s = { <10, 10> } - t = { <-2, -2> } - u = { <-5, -5> } diff --git a/vra/tests-overall/test-0046.c b/vra/tests-overall/test-0046.c deleted file mode 100644 index 13c3f4f85..000000000 --- a/vra/tests-overall/test-0046.c +++ /dev/null @@ -1,18 +0,0 @@ -/** -* @file test-0046.c -* -* @brief Simple loop. -*/ - -int main(int argc, const char *argv[]) { - int buffer[10]; - int i = 0; - - while (i < 10) { - buffer[i] = i; - ++i; - } - - return 0; -} - diff --git a/vra/tests-overall/test-0046.c.ref b/vra/tests-overall/test-0046.c.ref deleted file mode 100644 index b3b615058..000000000 --- a/vra/tests-overall/test-0046.c.ref +++ /dev/null @@ -1,28 +0,0 @@ ----------- Function main() ---------- -Block L1[IN] at lines from 9 to 9: -Block L1[OUT]: - i = { <0, 0> } -Block L2[IN] at lines from 11 to 11: - buffer[] = { <0, 9> } - i = { <0, 10> } -Block L2[OUT]: - buffer[] = { <0, 9> } - i = { <0, 10> } -Block L3[IN] at lines from 12 to 13: - buffer[] = { <0, 8> } - i = { <0, 9> } -Block L3[OUT]: - buffer[] = { <0, 9> } - i = { <1, 10> } -Block L4[IN] at lines from 16 to 16: - buffer[] = { <0, 9> } - i = { <0, 10> } -Block L4[OUT]: - buffer[] = { <0, 9> } - i = { <0, 10> } -Block L5[IN] at lines from 16 to 17: - buffer[] = { <0, 9> } - i = { <0, 10> } -Block L5[OUT]: - buffer[] = { <0, 9> } - i = { <0, 10> } diff --git a/vra/tests-overall/test-0047.c b/vra/tests-overall/test-0047.c deleted file mode 100644 index 7b410e15b..000000000 --- a/vra/tests-overall/test-0047.c +++ /dev/null @@ -1,17 +0,0 @@ -/** -* @file test-0047.c -* -* @brief Simple loop. -*/ - -int main(int argc, const char *argv[]) { - int buffer[10]; - int i = 0; - - while (i < 10) { - buffer[i] = i; - } - - return 0; -} - diff --git a/vra/tests-overall/test-0047.c.ref b/vra/tests-overall/test-0047.c.ref deleted file mode 100644 index 6cb0aef79..000000000 --- a/vra/tests-overall/test-0047.c.ref +++ /dev/null @@ -1,28 +0,0 @@ ----------- Function main() ---------- -Block L1[IN] at lines from 9 to 9: -Block L1[OUT]: - i = { <0, 0> } -Block L2[IN] at lines from 11 to 11: - buffer[] = { <0, 0> } - i = { <0, 0> } -Block L2[OUT]: - buffer[] = { <0, 0> } - i = { <0, 0> } -Block L3[IN] at lines from 12 to 12: - buffer[] = { <0, 0> } - i = { <0, 0> } -Block L3[OUT]: - buffer[] = { <0, 0> } - i = { <0, 0> } -Block L4[IN] at lines from 15 to 15: - buffer[] = { <0, 0> } - i = { <0, 0> } -Block L4[OUT]: - buffer[] = { <0, 0> } - i = { <0, 0> } -Block L5[IN] at lines from 15 to 16: - buffer[] = { <0, 0> } - i = { <0, 0> } -Block L5[OUT]: - buffer[] = { <0, 0> } - i = { <0, 0> } diff --git a/vra/tests-overall/test-0048.c b/vra/tests-overall/test-0048.c deleted file mode 100644 index 75b614be3..000000000 --- a/vra/tests-overall/test-0048.c +++ /dev/null @@ -1,20 +0,0 @@ -/** -* @file test-0048.c -* -* @brief Simple loop. -*/ - -int main(int argc, const char *argv[]) { - int buffer[10]; - int i = 0; - int a = 0; - - while (i < 10) { - buffer[i] = i; - ++i; - ++a; - } - - return 0; -} - diff --git a/vra/tests-overall/test-0048.c.ref b/vra/tests-overall/test-0048.c.ref deleted file mode 100644 index f1f6e1b5f..000000000 --- a/vra/tests-overall/test-0048.c.ref +++ /dev/null @@ -1,37 +0,0 @@ ----------- Function main() ---------- -Block L1[IN] at lines from 9 to 10: -Block L1[OUT]: - a = { <0, 0> } - i = { <0, 0> } -Block L2[IN] at lines from 12 to 12: - a = { <0, 10> } - buffer[] = { <0, 9> } - i = { <0, 10> } -Block L2[OUT]: - a = { <0, 10> } - buffer[] = { <0, 9> } - i = { <0, 10> } -Block L3[IN] at lines from 13 to 15: - a = { <0, 9> } - buffer[] = { <0, 8> } - i = { <0, 9> } -Block L3[OUT]: - a = { <1, 10> } - buffer[] = { <0, 9> } - i = { <1, 10> } -Block L4[IN] at lines from 18 to 18: - a = { <0, 10> } - buffer[] = { <0, 9> } - i = { <0, 10> } -Block L4[OUT]: - a = { <0, 10> } - buffer[] = { <0, 9> } - i = { <0, 10> } -Block L5[IN] at lines from 18 to 19: - a = { <0, 10> } - buffer[] = { <0, 9> } - i = { <0, 10> } -Block L5[OUT]: - a = { <0, 10> } - buffer[] = { <0, 9> } - i = { <0, 10> } diff --git a/vra/tests-overall/test-0049.c b/vra/tests-overall/test-0049.c deleted file mode 100644 index 867069d3c..000000000 --- a/vra/tests-overall/test-0049.c +++ /dev/null @@ -1,21 +0,0 @@ -/** -* @file test-0049.c -* -* @brief Simple loop. -*/ - -int main(int argc, const char *argv[]) { - int buffer[10]; - int i = 0; - int a = 0; - - while (i < 10) { - buffer[i] = i; - ++i; - a = a + 2; - } - - return 0; -} - - diff --git a/vra/tests-overall/test-0049.c.ref b/vra/tests-overall/test-0049.c.ref deleted file mode 100644 index 3f3a175c9..000000000 --- a/vra/tests-overall/test-0049.c.ref +++ /dev/null @@ -1,37 +0,0 @@ ----------- Function main() ---------- -Block L1[IN] at lines from 9 to 10: -Block L1[OUT]: - a = { <0, 0> } - i = { <0, 0> } -Block L2[IN] at lines from 12 to 12: - a = { <0, 0>, <2, 2>, <4, 4>, <6, 6>, <8, 8>, <10, 10>, <12, 12>, <14, 14>, <16, 16>, <18, 18>, <20, 20> } - buffer[] = { <0, 9> } - i = { <0, 10> } -Block L2[OUT]: - a = { <0, 0>, <2, 2>, <4, 4>, <6, 6>, <8, 8>, <10, 10>, <12, 12>, <14, 14>, <16, 16>, <18, 18>, <20, 20> } - buffer[] = { <0, 9> } - i = { <0, 10> } -Block L3[IN] at lines from 13 to 15: - a = { <0, 0>, <2, 2>, <4, 4>, <6, 6>, <8, 8>, <10, 10>, <12, 12>, <14, 14>, <16, 16>, <18, 18> } - buffer[] = { <0, 8> } - i = { <0, 9> } -Block L3[OUT]: - a = { <2, 2>, <4, 4>, <6, 6>, <8, 8>, <10, 10>, <12, 12>, <14, 14>, <16, 16>, <18, 18>, <20, 20> } - buffer[] = { <0, 9> } - i = { <1, 10> } -Block L4[IN] at lines from 18 to 18: - a = { <0, 0>, <2, 2>, <4, 4>, <6, 6>, <8, 8>, <10, 10>, <12, 12>, <14, 14>, <16, 16>, <18, 18>, <20, 20> } - buffer[] = { <0, 9> } - i = { <0, 10> } -Block L4[OUT]: - a = { <0, 0>, <2, 2>, <4, 4>, <6, 6>, <8, 8>, <10, 10>, <12, 12>, <14, 14>, <16, 16>, <18, 18>, <20, 20> } - buffer[] = { <0, 9> } - i = { <0, 10> } -Block L5[IN] at lines from 18 to 19: - a = { <0, 0>, <2, 2>, <4, 4>, <6, 6>, <8, 8>, <10, 10>, <12, 12>, <14, 14>, <16, 16>, <18, 18>, <20, 20> } - buffer[] = { <0, 9> } - i = { <0, 10> } -Block L5[OUT]: - a = { <0, 0>, <2, 2>, <4, 4>, <6, 6>, <8, 8>, <10, 10>, <12, 12>, <14, 14>, <16, 16>, <18, 18>, <20, 20> } - buffer[] = { <0, 9> } - i = { <0, 10> } diff --git a/vra/tests-overall/test-0050.c b/vra/tests-overall/test-0050.c deleted file mode 100644 index b7cfb842f..000000000 --- a/vra/tests-overall/test-0050.c +++ /dev/null @@ -1,16 +0,0 @@ -/** -* @file test-0050.c -* -* @brief Simple loop. -*/ - -int main(int argc, const char *argv[]) { - char i = 1; - - while (i) { - ++i; - } - - return 0; -} - diff --git a/vra/tests-overall/test-0050.c.ref b/vra/tests-overall/test-0050.c.ref deleted file mode 100644 index 3fc9fe615..000000000 --- a/vra/tests-overall/test-0050.c.ref +++ /dev/null @@ -1,20 +0,0 @@ ----------- Function main() ---------- -Block L1[IN] at lines from 8 to 8: -Block L1[OUT]: - i = { <1, 1> } -Block L2[IN] at lines from 10 to 10: - i = { <-128, 127> } -Block L2[OUT]: - i = { <-128, 127> } -Block L3[IN] at lines from 11 to 11: - i = { <-128, 127> } -Block L3[OUT]: - i = { <-128, 127> } -Block L4[IN] at lines from 14 to 14: - i = { <-128, 127> } -Block L4[OUT]: - i = { <-128, 127> } -Block L5[IN] at lines from 14 to 15: - i = { <-128, 127> } -Block L5[OUT]: - i = { <-128, 127> } diff --git a/vra/tests-overall/test-0051.c b/vra/tests-overall/test-0051.c deleted file mode 100644 index cb3a12a5f..000000000 --- a/vra/tests-overall/test-0051.c +++ /dev/null @@ -1,15 +0,0 @@ -/** -* @file test-0051.c -* -* @brief Simple loop: Infinite loop. -*/ - -int main(int argc, const char *argv[]) { - int i = 1; - - while (i) { - } - - return 0; -} - diff --git a/vra/tests-overall/test-0051.c.ref b/vra/tests-overall/test-0051.c.ref deleted file mode 100644 index c259abe42..000000000 --- a/vra/tests-overall/test-0051.c.ref +++ /dev/null @@ -1,16 +0,0 @@ ----------- Function main() ---------- -Block L1[IN] at lines from 8 to 8: -Block L1[OUT]: - i = { <1, 1> } -Block L2[IN] at lines from 10 to 10: - i = { <1, 1> } -Block L2[OUT]: - i = { <1, 1> } -Block L3[IN] at lines from 13 to 13: - i = { <1, 1> } -Block L3[OUT]: - i = { <1, 1> } -Block L4[IN] at lines from 13 to 14: - i = { <1, 1> } -Block L4[OUT]: - i = { <1, 1> } diff --git a/vra/tests-overall/test-0052.c b/vra/tests-overall/test-0052.c deleted file mode 100644 index 831709dd8..000000000 --- a/vra/tests-overall/test-0052.c +++ /dev/null @@ -1,22 +0,0 @@ -/** -* @file test-0052.c -* -* @brief Simple loop: Infinite loop. -*/ - -int main(int argc, const char *argv[]) { - signed char i = 0; - int a = 0; - - while (i < 10) { - if (argc) { - ++a; - } else { - --a; - } - ++i; - } - - return 0; -} - diff --git a/vra/tests-overall/test-0052.c.ref b/vra/tests-overall/test-0052.c.ref deleted file mode 100644 index 46aa845e1..000000000 --- a/vra/tests-overall/test-0052.c.ref +++ /dev/null @@ -1,61 +0,0 @@ ----------- Function main() ---------- -Block L1[IN] at lines from 8 to 9: -Block L1[OUT]: - a = { <0, 0> } - i = { <0, 0> } -Block L2[IN] at lines from 11 to 11: - a = { <-10, 10> } - argc = { <-2147483648, 2147483647> } - i = { <0, 10> } -Block L2[OUT]: - a = { <-10, 10> } - argc = { <-2147483648, 2147483647> } - i = { <0, 10> } -Block L3[IN] at lines from 12 to 12: - a = { <-9, 9> } - argc = { <-2147483648, 2147483647> } - i = { <0, 9> } -Block L3[OUT]: - a = { <-9, 9> } - argc = { <-2147483648, 2147483647> } - i = { <0, 9> } -Block L4[IN] at lines from 13 to 13: - a = { <-9, 9> } - argc = { <-2147483648, 2147483647> } - i = { <0, 9> } -Block L4[OUT]: - a = { <-8, 10> } - argc = { <-2147483648, 2147483647> } - i = { <0, 9> } -Block L5[IN] at lines from 15 to 15: - a = { <-9, 9> } - argc = { <0, 0> } - i = { <0, 9> } -Block L5[OUT]: - a = { <-10, 8> } - argc = { <0, 0> } - i = { <0, 9> } -Block L6[IN] at lines from 17 to 17: - a = { <-10, 10> } - argc = { <-2147483648, 2147483647> } - i = { <0, 9> } -Block L6[OUT]: - a = { <-10, 10> } - argc = { <-2147483648, 2147483647> } - i = { <1, 10> } -Block L7[IN] at lines from 20 to 20: - a = { <-10, 10> } - argc = { <-2147483648, 2147483647> } - i = { <0, 10> } -Block L7[OUT]: - a = { <-10, 10> } - argc = { <-2147483648, 2147483647> } - i = { <0, 10> } -Block L8[IN] at lines from 20 to 21: - a = { <-10, 10> } - argc = { <-2147483648, 2147483647> } - i = { <0, 10> } -Block L8[OUT]: - a = { <-10, 10> } - argc = { <-2147483648, 2147483647> } - i = { <0, 10> } diff --git a/vra/tests-overall/test-0053.c b/vra/tests-overall/test-0053.c deleted file mode 100644 index 1b900f1bb..000000000 --- a/vra/tests-overall/test-0053.c +++ /dev/null @@ -1,21 +0,0 @@ -/** -* @file test-0053.c -* -* @brief Simple loop. -*/ - -int main(int argc, const char *argv[]) { - - char i, a; - a = i = 0; - int c = 1; - - while (i < 10) { - a = a + 2; - ++i; - c = c * 2; - } - - return 0; -} - diff --git a/vra/tests-overall/test-0053.c.ref b/vra/tests-overall/test-0053.c.ref deleted file mode 100644 index 09cfc1d6c..000000000 --- a/vra/tests-overall/test-0053.c.ref +++ /dev/null @@ -1,38 +0,0 @@ ----------- Function main() ---------- -Block L1[IN] at lines from 10 to 11: -Block L1[OUT]: - a = { <0, 0> } - c = { <1, 1> } - i = { <0, 0> } -Block L2[IN] at lines from 13 to 13: - a = { <0, 0>, <2, 2>, <4, 4>, <6, 6>, <8, 8>, <10, 10>, <12, 12>, <14, 14>, <16, 16>, <18, 18>, <20, 20> } - c = { <1, 1024> } - i = { <0, 10> } -Block L2[OUT]: - a = { <0, 0>, <2, 2>, <4, 4>, <6, 6>, <8, 8>, <10, 10>, <12, 12>, <14, 14>, <16, 16>, <18, 18>, <20, 20> } - c = { <1, 1024> } - i = { <0, 10> } -Block L3[IN] at lines from 14 to 16: - a = { <0, 0>, <2, 2>, <4, 4>, <6, 6>, <8, 8>, <10, 10>, <12, 12>, <14, 14>, <16, 16>, <18, 18> } - c = { <1, 512> } - i = { <0, 9> } -Block L3[OUT]: - a = { <2, 2>, <4, 4>, <6, 6>, <8, 8>, <10, 10>, <12, 12>, <14, 14>, <16, 16>, <18, 18>, <20, 20> } - c = { <2, 1024> } - i = { <1, 10> } -Block L4[IN] at lines from 19 to 19: - a = { <0, 0>, <2, 2>, <4, 4>, <6, 6>, <8, 8>, <10, 10>, <12, 12>, <14, 14>, <16, 16>, <18, 18>, <20, 20> } - c = { <1, 1024> } - i = { <0, 10> } -Block L4[OUT]: - a = { <0, 0>, <2, 2>, <4, 4>, <6, 6>, <8, 8>, <10, 10>, <12, 12>, <14, 14>, <16, 16>, <18, 18>, <20, 20> } - c = { <1, 1024> } - i = { <0, 10> } -Block L5[IN] at lines from 19 to 20: - a = { <0, 0>, <2, 2>, <4, 4>, <6, 6>, <8, 8>, <10, 10>, <12, 12>, <14, 14>, <16, 16>, <18, 18>, <20, 20> } - c = { <1, 1024> } - i = { <0, 10> } -Block L5[OUT]: - a = { <0, 0>, <2, 2>, <4, 4>, <6, 6>, <8, 8>, <10, 10>, <12, 12>, <14, 14>, <16, 16>, <18, 18>, <20, 20> } - c = { <1, 1024> } - i = { <0, 10> } diff --git a/vra/tests-overall/test-0054.c b/vra/tests-overall/test-0054.c deleted file mode 100644 index 9ff141945..000000000 --- a/vra/tests-overall/test-0054.c +++ /dev/null @@ -1,17 +0,0 @@ -/** -* @file test-0054.c -* -* @brief Simple loop: Uninitialized loop variable. -*/ - -int main(int argc, const char *argv[]) { - - int i; - while (i < 10) { - ++i; - } - - return 0; -} - - diff --git a/vra/tests-overall/test-0054.c.ref b/vra/tests-overall/test-0054.c.ref deleted file mode 100644 index 99ab5b9da..000000000 --- a/vra/tests-overall/test-0054.c.ref +++ /dev/null @@ -1,19 +0,0 @@ ----------- Function main() ---------- -Block L1[IN] at lines from 10 to 10: -Block L1[OUT]: -Block L2[IN] at lines from 10 to 10: - i = { <-2147483647, 10> } -Block L2[OUT]: - i = { <-2147483647, 10> } -Block L3[IN] at lines from 11 to 11: - i = { <-2147483648, 9> } -Block L3[OUT]: - i = { <-2147483647, 10> } -Block L4[IN] at lines from 14 to 14: - i = { <10, 2147483647> } -Block L4[OUT]: - i = { <10, 2147483647> } -Block L5[IN] at lines from 14 to 15: - i = { <10, 2147483647> } -Block L5[OUT]: - i = { <10, 2147483647> } diff --git a/vra/tests-overall/test-0055.c b/vra/tests-overall/test-0055.c deleted file mode 100644 index c7ffe1472..000000000 --- a/vra/tests-overall/test-0055.c +++ /dev/null @@ -1,18 +0,0 @@ -/** -* @file test-0055.c -* -* @brief Buffer overflow. -*/ - -int main(int argc, const char *argv[]) { - int buffer[10]; - - int i = 0; - while (i <= 10) { - buffer[i] = 9999; - ++i; - } - - return 0; -} - diff --git a/vra/tests-overall/test-0055.c.ref b/vra/tests-overall/test-0055.c.ref deleted file mode 100644 index 3e3c71c33..000000000 --- a/vra/tests-overall/test-0055.c.ref +++ /dev/null @@ -1,28 +0,0 @@ ----------- Function main() ---------- -Block L1[IN] at lines from 10 to 10: -Block L1[OUT]: - i = { <0, 0> } -Block L2[IN] at lines from 11 to 11: - buffer[] = { <9999, 9999> } - i = { <0, 11> } -Block L2[OUT]: - buffer[] = { <9999, 9999> } - i = { <0, 11> } -Block L3[IN] at lines from 12 to 13: - buffer[] = { <9999, 9999> } - i = { <0, 10> } -Block L3[OUT]: - buffer[] = { <9999, 9999> } - i = { <1, 11> } -Block L4[IN] at lines from 16 to 16: - buffer[] = { <9999, 9999> } - i = { <0, 11> } -Block L4[OUT]: - buffer[] = { <9999, 9999> } - i = { <0, 11> } -Block L5[IN] at lines from 16 to 17: - buffer[] = { <9999, 9999> } - i = { <0, 11> } -Block L5[OUT]: - buffer[] = { <9999, 9999> } - i = { <0, 11> } diff --git a/vra/tests-overall/test-0056.c b/vra/tests-overall/test-0056.c deleted file mode 100644 index 7b5888db7..000000000 --- a/vra/tests-overall/test-0056.c +++ /dev/null @@ -1,18 +0,0 @@ -/** -* @file test-0056.c -* -* @brief Factorial computation. -*/ - -int main(int argc, const char *argv[]) { - int i; - int fact[6]; - - fact[0] = 1; - for (i = 1; i < 6; ++i){ - fact[i] = fact[i-1] * i; - } - - return 0; -} - diff --git a/vra/tests-overall/test-0056.c.ref b/vra/tests-overall/test-0056.c.ref deleted file mode 100644 index ba5f94f4f..000000000 --- a/vra/tests-overall/test-0056.c.ref +++ /dev/null @@ -1,29 +0,0 @@ ----------- Function main() ---------- -Block L1[IN] at lines from 11 to 12: -Block L1[OUT]: - fact[] = { <1, 1> } - i = { <1, 1> } -Block L2[IN] at lines from 12 to 12: - fact[] = { <1, 120> } - i = { <1, 6> } -Block L2[OUT]: - fact[] = { <1, 120> } - i = { <1, 6> } -Block L3[IN] at lines from 12 to 13: - fact[] = { <1, 24> } - i = { <1, 5> } -Block L3[OUT]: - fact[] = { <1, 120> } - i = { <2, 6> } -Block L4[IN] at lines from 16 to 16: - fact[] = { <1, 120> } - i = { <1, 6> } -Block L4[OUT]: - fact[] = { <1, 120> } - i = { <1, 6> } -Block L5[IN] at lines from 16 to 17: - fact[] = { <1, 120> } - i = { <1, 6> } -Block L5[OUT]: - fact[] = { <1, 120> } - i = { <1, 6> } diff --git a/vra/tests-overall/test-0057.c b/vra/tests-overall/test-0057.c deleted file mode 100644 index 24ab96e7f..000000000 --- a/vra/tests-overall/test-0057.c +++ /dev/null @@ -1,22 +0,0 @@ -/** -* @file test-0057.c -* -* @brief Fibonacci computation. -*/ - -int main(int argc, const char *argv[]) { - int i; // The index of fibonacci number. - int current; // The value of the (i)th fibonacci number. - int next; // The value of the (i+1)th fibonacci number. - int twoaway; // The value of the (i+2)th fibonacci number. - - next = current = 1; - for (i = 0; i < 10; i++) { - twoaway = current+next; - current = next; - next = twoaway; - } - - return 0; -} - diff --git a/vra/tests-overall/test-0057.c.ref b/vra/tests-overall/test-0057.c.ref deleted file mode 100644 index 0c324a819..000000000 --- a/vra/tests-overall/test-0057.c.ref +++ /dev/null @@ -1,46 +0,0 @@ ----------- Function main() ---------- -Block L1[IN] at lines from 13 to 14: -Block L1[OUT]: - current = { <1, 1> } - i = { <0, 0> } - next = { <1, 1> } -Block L2[IN] at lines from 14 to 14: - current = { <1, 89> } - i = { <0, 10> } - next = { <1, 144> } - twoaway = { <2, 144> } -Block L2[OUT]: - current = { <1, 89> } - i = { <0, 10> } - next = { <1, 144> } - twoaway = { <2, 144> } -Block L3[IN] at lines from 14 to 15: - current = { <1, 55> } - i = { <0, 9> } - next = { <1, 89> } - twoaway = { <2, 89> } -Block L3[OUT]: - current = { <1, 89> } - i = { <1, 10> } - next = { <2, 144> } - twoaway = { <2, 144> } -Block L4[IN] at lines from 20 to 20: - current = { <1, 89> } - i = { <0, 10> } - next = { <1, 144> } - twoaway = { <2, 144> } -Block L4[OUT]: - current = { <1, 89> } - i = { <0, 10> } - next = { <1, 144> } - twoaway = { <2, 144> } -Block L5[IN] at lines from 20 to 21: - current = { <1, 89> } - i = { <0, 10> } - next = { <1, 144> } - twoaway = { <2, 144> } -Block L5[OUT]: - current = { <1, 89> } - i = { <0, 10> } - next = { <1, 144> } - twoaway = { <2, 144> } diff --git a/vra/tests-overall/test-0058.c b/vra/tests-overall/test-0058.c deleted file mode 100644 index 2cdb3faa5..000000000 --- a/vra/tests-overall/test-0058.c +++ /dev/null @@ -1,21 +0,0 @@ -/** -* @file test-0058.c -* -* @brief Fibonacci computation II. -*/ - -#define N 10 - -int main(int argc, const char *argv[]) { - int fibonacci[N]; - fibonacci[0] = fibonacci[1] = 1; - - int i; - for (i = 2; i < 10; i++) { - fibonacci[i] = fibonacci[i-1] + fibonacci[i-2]; - } - - return 0; -} - - diff --git a/vra/tests-overall/test-0058.c.ref b/vra/tests-overall/test-0058.c.ref deleted file mode 100644 index 4b0558365..000000000 --- a/vra/tests-overall/test-0058.c.ref +++ /dev/null @@ -1,29 +0,0 @@ ----------- Function main() ---------- -Block L1[IN] at lines from 11 to 14: -Block L1[OUT]: - fibonacci[] = { <1, 1> } - i = { <2, 2> } -Block L2[IN] at lines from 14 to 14: - fibonacci[] = { <1, 256> } - i = { <2, 10> } -Block L2[OUT]: - fibonacci[] = { <1, 256> } - i = { <2, 10> } -Block L3[IN] at lines from 14 to 15: - fibonacci[] = { <1, 128> } - i = { <2, 9> } -Block L3[OUT]: - fibonacci[] = { <1, 256> } - i = { <3, 10> } -Block L4[IN] at lines from 18 to 18: - fibonacci[] = { <1, 256> } - i = { <2, 10> } -Block L4[OUT]: - fibonacci[] = { <1, 256> } - i = { <2, 10> } -Block L5[IN] at lines from 18 to 19: - fibonacci[] = { <1, 256> } - i = { <2, 10> } -Block L5[OUT]: - fibonacci[] = { <1, 256> } - i = { <2, 10> } diff --git a/vra/tests-overall/test-0059.c b/vra/tests-overall/test-0059.c deleted file mode 100644 index 41e85904f..000000000 --- a/vra/tests-overall/test-0059.c +++ /dev/null @@ -1,19 +0,0 @@ -/** -* @file test-0059.c -* -* @brief Power of two. -*/ - -#define N 5 - -int main(void) { - int i; - int value = 1; - - for (i = 0; i < N; i++) { - value = 2 * value; - } - - return 0; -} - diff --git a/vra/tests-overall/test-0059.c.ref b/vra/tests-overall/test-0059.c.ref deleted file mode 100644 index 87b2c31af..000000000 --- a/vra/tests-overall/test-0059.c.ref +++ /dev/null @@ -1,29 +0,0 @@ ----------- Function main() ---------- -Block L1[IN] at lines from 11 to 13: -Block L1[OUT]: - i = { <0, 0> } - value = { <1, 1> } -Block L2[IN] at lines from 13 to 13: - i = { <0, 5> } - value = { <1, 32> } -Block L2[OUT]: - i = { <0, 5> } - value = { <1, 32> } -Block L3[IN] at lines from 13 to 14: - i = { <0, 4> } - value = { <1, 16> } -Block L3[OUT]: - i = { <1, 5> } - value = { <2, 32> } -Block L4[IN] at lines from 17 to 17: - i = { <0, 5> } - value = { <1, 32> } -Block L4[OUT]: - i = { <0, 5> } - value = { <1, 32> } -Block L5[IN] at lines from 17 to 18: - i = { <0, 5> } - value = { <1, 32> } -Block L5[OUT]: - i = { <0, 5> } - value = { <1, 32> } diff --git a/vra/tests-overall/test-0060.c b/vra/tests-overall/test-0060.c deleted file mode 100644 index 614029889..000000000 --- a/vra/tests-overall/test-0060.c +++ /dev/null @@ -1,21 +0,0 @@ -/** -* @file test-0060.c -* -* @brief Adding of all numbers stored in an array. -*/ - -#define N 10 - -int main(void) { - int array[N] = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10}; - int sum = 0; - int i = 0; - - while (i < N) { - sum = sum + array[i]; - ++i; - } - - return 0; -} - diff --git a/vra/tests-overall/test-0060.c.ref b/vra/tests-overall/test-0060.c.ref deleted file mode 100644 index c9f89eb39..000000000 --- a/vra/tests-overall/test-0060.c.ref +++ /dev/null @@ -1,38 +0,0 @@ ----------- Function main() ---------- -Block L1[IN] at lines from 10 to 12: -Block L1[OUT]: - array[] = { <1, 10> } - i = { <0, 0> } - sum = { <0, 0> } -Block L2[IN] at lines from 14 to 14: - array[] = { <1, 10> } - i = { <0, 10> } - sum = { <0, 100> } -Block L2[OUT]: - array[] = { <1, 10> } - i = { <0, 10> } - sum = { <0, 100> } -Block L3[IN] at lines from 15 to 16: - array[] = { <1, 10> } - i = { <0, 9> } - sum = { <0, 90> } -Block L3[OUT]: - array[] = { <1, 10> } - i = { <1, 10> } - sum = { <1, 100> } -Block L4[IN] at lines from 19 to 19: - array[] = { <1, 10> } - i = { <0, 10> } - sum = { <0, 100> } -Block L4[OUT]: - array[] = { <1, 10> } - i = { <0, 10> } - sum = { <0, 100> } -Block L5[IN] at lines from 19 to 20: - array[] = { <1, 10> } - i = { <0, 10> } - sum = { <0, 100> } -Block L5[OUT]: - array[] = { <1, 10> } - i = { <0, 10> } - sum = { <0, 100> } diff --git a/vra/tests-overall/test-0061.c b/vra/tests-overall/test-0061.c deleted file mode 100644 index b513959da..000000000 --- a/vra/tests-overall/test-0061.c +++ /dev/null @@ -1,16 +0,0 @@ -/** -* @file test-0061.c -* -* @brief Simple loop. -*/ - -int main(int argc, const char *argv[]) { - long i = 1; - - while (i) { - ++i; - } - - return 0; -} - diff --git a/vra/tests-overall/test-0061.c.ref b/vra/tests-overall/test-0061.c.ref deleted file mode 100644 index 3e886583d..000000000 --- a/vra/tests-overall/test-0061.c.ref +++ /dev/null @@ -1,20 +0,0 @@ ----------- Function main() ---------- -Block L1[IN] at lines from 8 to 8: -Block L1[OUT]: - i = { <1, 1> } -Block L2[IN] at lines from 10 to 10: - i = { <1, 9223372036854775807> } -Block L2[OUT]: - i = { <-1, 9223372036854775807> } -Block L3[IN] at lines from 11 to 11: - i = { <1, 9034220852505214974> } -Block L3[OUT]: - i = { <1, 9223372036854775807> } -Block L4[IN] at lines from 14 to 14: - i = { <0, 1000> } -Block L4[OUT]: - i = { <-1, 2000> } -Block L5[IN] at lines from 14 to 15: - i = { <-1, 2000> } -Block L5[OUT]: - i = { <-2, 4000> } diff --git a/vra/tests-overall/test-0062.c b/vra/tests-overall/test-0062.c deleted file mode 100644 index 55ca745c9..000000000 --- a/vra/tests-overall/test-0062.c +++ /dev/null @@ -1,22 +0,0 @@ -/** -* @file test-0062.c -* -* @brief Nested if-else statement. -*/ - -int main(int argc, const char *argv[]) { - int i = 10; - - if (argc < 100) { - i = i + argc; - if (i > 50) { - printf("i = %d", i); - } else { - i = 50; - } - } else { - i = 40; - } - - return 0; -} diff --git a/vra/tests-overall/test-0062.c.ref b/vra/tests-overall/test-0062.c.ref deleted file mode 100644 index 21f404a52..000000000 --- a/vra/tests-overall/test-0062.c.ref +++ /dev/null @@ -1,47 +0,0 @@ ----------- Function main() ---------- -Block L1[IN] at lines from 8 to 10: -Block L1[OUT]: - argc = { <-2147483648, 2147483647> } - i = { <10, 10> } -Block L2[IN] at lines from 11 to 12: - argc = { <-2147483648, 99> } - i = { <10, 10> } -Block L2[OUT]: - argc = { <-2147483648, 99> } - i = { <-2147483638, 109> } -Block L3[IN] at lines from 18 to 18: - argc = { <100, 2147483647> } - i = { <10, 10> } -Block L3[OUT]: - argc = { <100, 2147483647> } - i = { <40, 40> } -Block L4[IN] at lines from 13 to 13: - argc = { <-2147483648, 99> } - i = { <51, 109> } -Block L4[OUT]: - argc = { <-2147483648, 99> } - i = { <51, 109> } -Block L5[IN] at lines from 15 to 15: - argc = { <-2147483648, 99> } - i = { <-2147483638, 50> } -Block L5[OUT]: - argc = { <-2147483648, 99> } - i = { <50, 50> } -Block L6[IN] at lines from 21 to 21: - argc = { <-2147483648, 99> } - i = { <50, 109> } -Block L6[OUT]: - argc = { <-2147483648, 99> } - i = { <50, 109> } -Block L7[IN] at lines from 21 to 21: - argc = { <-2147483648, 2147483647> } - i = { <40, 40>, <50, 109> } -Block L7[OUT]: - argc = { <-2147483648, 2147483647> } - i = { <40, 40>, <50, 109> } -Block L8[IN] at lines from 21 to 22: - argc = { <-2147483648, 2147483647> } - i = { <40, 40>, <50, 109> } -Block L8[OUT]: - argc = { <-2147483648, 2147483647> } - i = { <40, 40>, <50, 109> } diff --git a/vra/tests-overall/test-0063.c b/vra/tests-overall/test-0063.c deleted file mode 100644 index ec6cc3096..000000000 --- a/vra/tests-overall/test-0063.c +++ /dev/null @@ -1,17 +0,0 @@ -/** -* @file test-0063.c -* -* @brief Factorial with double type. -*/ - -int main(int argc, const char *argv[]) { - int i; - double fact[6]; - - fact[0] = 1.0; - for (i = 1; i < 6; ++i){ - fact[i] = fact[i-1] * i; - } - - return 0; -} diff --git a/vra/tests-overall/test-0063.c.ref b/vra/tests-overall/test-0063.c.ref deleted file mode 100644 index ba5f94f4f..000000000 --- a/vra/tests-overall/test-0063.c.ref +++ /dev/null @@ -1,29 +0,0 @@ ----------- Function main() ---------- -Block L1[IN] at lines from 11 to 12: -Block L1[OUT]: - fact[] = { <1, 1> } - i = { <1, 1> } -Block L2[IN] at lines from 12 to 12: - fact[] = { <1, 120> } - i = { <1, 6> } -Block L2[OUT]: - fact[] = { <1, 120> } - i = { <1, 6> } -Block L3[IN] at lines from 12 to 13: - fact[] = { <1, 24> } - i = { <1, 5> } -Block L3[OUT]: - fact[] = { <1, 120> } - i = { <2, 6> } -Block L4[IN] at lines from 16 to 16: - fact[] = { <1, 120> } - i = { <1, 6> } -Block L4[OUT]: - fact[] = { <1, 120> } - i = { <1, 6> } -Block L5[IN] at lines from 16 to 17: - fact[] = { <1, 120> } - i = { <1, 6> } -Block L5[OUT]: - fact[] = { <1, 120> } - i = { <1, 6> } diff --git a/vra/tests-overall/test-0064.c b/vra/tests-overall/test-0064.c deleted file mode 100644 index 911f91cc7..000000000 --- a/vra/tests-overall/test-0064.c +++ /dev/null @@ -1,13 +0,0 @@ -/** -* @file test-0064.c -* -* @brief Infinite loop with double type. -*/ - -int main(int argc, const char *argv[]) { - long double f = 1; - while (f) { - } - - return 0; -} diff --git a/vra/tests-overall/test-0064.c.ref b/vra/tests-overall/test-0064.c.ref deleted file mode 100644 index 5701d1162..000000000 --- a/vra/tests-overall/test-0064.c.ref +++ /dev/null @@ -1,16 +0,0 @@ ----------- Function main() ---------- -Block L1[IN] at lines from 8 to 8: -Block L1[OUT]: - f = { <1, 1> } -Block L2[IN] at lines from 9 to 9: - f = { <1, 1> } -Block L2[OUT]: - f = { <1, 1> } -Block L3[IN] at lines from 12 to 12: - f = { <1, 1> } -Block L3[OUT]: - f = { <1, 1> } -Block L4[IN] at lines from 12 to 13: - f = { <1, 1> } -Block L4[OUT]: - f = { <1, 1> } diff --git a/vra/tests-overall/test-0065.c b/vra/tests-overall/test-0065.c deleted file mode 100644 index adf269615..000000000 --- a/vra/tests-overall/test-0065.c +++ /dev/null @@ -1,24 +0,0 @@ -/** -* @file test-0065.c -* -* @brief Nestes structures. -*/ - -int main(int argc, const char *argv[]) { - struct MyStruct { - int a; - int b; - }; - - struct MyStruct var = { 1, 2 }; - - struct MyStruct x[2][2] = { {var, var}, {var, var}}; - - struct { - struct MyStruct x[2][2]; - } q; - - q.x[0][0] = x[1][1]; - - return 0; -} diff --git a/vra/tests-overall/test-0065.c.ref b/vra/tests-overall/test-0065.c.ref deleted file mode 100644 index 24e642a25..000000000 --- a/vra/tests-overall/test-0065.c.ref +++ /dev/null @@ -1,23 +0,0 @@ ----------- Function main() ---------- -Block L1[IN] at lines from 13 to 23: -Block L1[OUT]: - q.x[][].a = { <1, 1> } - q.x[][].b = { <2, 2> } - var.a = { <1, 1> } - var.b = { <2, 2> } - x[][].a = { <1, 1> } - x[][].b = { <2, 2> } -Block L2[IN] at lines from 23 to 24: - q.x[][].a = { <1, 1> } - q.x[][].b = { <2, 2> } - var.a = { <1, 1> } - var.b = { <2, 2> } - x[][].a = { <1, 1> } - x[][].b = { <2, 2> } -Block L2[OUT]: - q.x[][].a = { <1, 1> } - q.x[][].b = { <2, 2> } - var.a = { <1, 1> } - var.b = { <2, 2> } - x[][].a = { <1, 1> } - x[][].b = { <2, 2> } diff --git a/vra/tests-overall/test-0066.c b/vra/tests-overall/test-0066.c deleted file mode 100644 index 8907ad6b7..000000000 --- a/vra/tests-overall/test-0066.c +++ /dev/null @@ -1,44 +0,0 @@ -/** -* @file test-0066.c -* -* @brief Using structures and enumeration. -*/ - -#define NumOfEmployees 2 -#define MinSalary 5000 - -int main(int argc, const char *argv[]) { - enum Color { - RED = 0, - GREEN, - BLUE, - YELLOW - }; - - struct PersonalInfo { - int id; - double weight; - double height; - int age; - enum Color favouriteColor; - int iq; - int salary; - }; - - struct PersonalInfo Pat = {1234 , 80, 175, 35, YELLOW, 100, 0}; - struct PersonalInfo Mat = {1235, 82, 174, 34, RED, 99, 0}; - - struct PersonalInfo employees[NumOfEmployees] = { Pat, Mat }; - - int i; - for (i = 0; i < NumOfEmployees; ++i) { - if (employees[i].iq > 130) { - employees[i].salary = 30000; - } else { - employees[i].salary = MinSalary; - } - } - - return 0; -} - diff --git a/vra/tests-overall/test-0066.c.ref b/vra/tests-overall/test-0066.c.ref deleted file mode 100644 index 88b5e160f..000000000 --- a/vra/tests-overall/test-0066.c.ref +++ /dev/null @@ -1,347 +0,0 @@ ----------- Function main() ---------- -Block L1[IN] at lines from 28 to 34: -Block L1[OUT]: - Mat.age = { <34, 34> } - Mat.favouriteColor = { <0, 0> } - Mat.height = { <174, 174> } - Mat.id = { <1235, 1235> } - Mat.iq = { <99, 99> } - Mat.salary = { <0, 0> } - Mat.weight = { <82, 82> } - Pat.age = { <35, 35> } - Pat.favouriteColor = { <3, 3> } - Pat.height = { <175, 175> } - Pat.id = { <1234, 1234> } - Pat.iq = { <100, 100> } - Pat.salary = { <0, 0> } - Pat.weight = { <80, 80> } - employees[].age = { <34, 35> } - employees[].favouriteColor = { <0, 0>, <3, 3> } - employees[].height = { <174, 174>, <175, 175> } - employees[].id = { <1234, 1235> } - employees[].iq = { <99, 100> } - employees[].salary = { <0, 0> } - employees[].weight = { <80, 80>, <82, 82> } - i = { <0, 0> } -Block L2[IN] at lines from 34 to 34: - Mat.age = { <34, 34> } - Mat.favouriteColor = { <0, 0> } - Mat.height = { <174, 174> } - Mat.id = { <1235, 1235> } - Mat.iq = { <99, 99> } - Mat.salary = { <0, 0> } - Mat.weight = { <82, 82> } - Pat.age = { <35, 35> } - Pat.favouriteColor = { <3, 3> } - Pat.height = { <175, 175> } - Pat.id = { <1234, 1234> } - Pat.iq = { <100, 100> } - Pat.salary = { <0, 0> } - Pat.weight = { <80, 80> } - employees[].age = { <34, 35> } - employees[].favouriteColor = { <0, 0>, <3, 3> } - employees[].height = { <174, 174>, <175, 175> } - employees[].id = { <1234, 1235> } - employees[].iq = { <99, 100> } - employees[].salary = { <0, 0>, <5000, 5000>, <30000, 30000> } - employees[].weight = { <80, 80>, <82, 82> } - i = { <0, 2> } -Block L2[OUT]: - Mat.age = { <34, 34> } - Mat.favouriteColor = { <0, 0> } - Mat.height = { <174, 174> } - Mat.id = { <1235, 1235> } - Mat.iq = { <99, 99> } - Mat.salary = { <0, 0> } - Mat.weight = { <82, 82> } - Pat.age = { <35, 35> } - Pat.favouriteColor = { <3, 3> } - Pat.height = { <175, 175> } - Pat.id = { <1234, 1234> } - Pat.iq = { <100, 100> } - Pat.salary = { <0, 0> } - Pat.weight = { <80, 80> } - employees[].age = { <34, 35> } - employees[].favouriteColor = { <0, 0>, <3, 3> } - employees[].height = { <174, 174>, <175, 175> } - employees[].id = { <1234, 1235> } - employees[].iq = { <99, 100> } - employees[].salary = { <0, 0>, <5000, 5000>, <30000, 30000> } - employees[].weight = { <80, 80>, <82, 82> } - i = { <0, 2> } -Block L3[IN] at lines from 35 to 35: - Mat.age = { <34, 34> } - Mat.favouriteColor = { <0, 0> } - Mat.height = { <174, 174> } - Mat.id = { <1235, 1235> } - Mat.iq = { <99, 99> } - Mat.salary = { <0, 0> } - Mat.weight = { <82, 82> } - Pat.age = { <35, 35> } - Pat.favouriteColor = { <3, 3> } - Pat.height = { <175, 175> } - Pat.id = { <1234, 1234> } - Pat.iq = { <100, 100> } - Pat.salary = { <0, 0> } - Pat.weight = { <80, 80> } - employees[].age = { <34, 35> } - employees[].favouriteColor = { <0, 0>, <3, 3> } - employees[].height = { <174, 174>, <175, 175> } - employees[].id = { <1234, 1235> } - employees[].iq = { <99, 100> } - employees[].salary = { <0, 0>, <5000, 5000>, <30000, 30000> } - employees[].weight = { <80, 80>, <82, 82> } - i = { <0, 1> } -Block L3[OUT]: - Mat.age = { <34, 34> } - Mat.favouriteColor = { <0, 0> } - Mat.height = { <174, 174> } - Mat.id = { <1235, 1235> } - Mat.iq = { <99, 99> } - Mat.salary = { <0, 0> } - Mat.weight = { <82, 82> } - Pat.age = { <35, 35> } - Pat.favouriteColor = { <3, 3> } - Pat.height = { <175, 175> } - Pat.id = { <1234, 1234> } - Pat.iq = { <100, 100> } - Pat.salary = { <0, 0> } - Pat.weight = { <80, 80> } - employees[].age = { <34, 35> } - employees[].favouriteColor = { <0, 0>, <3, 3> } - employees[].height = { <174, 174>, <175, 175> } - employees[].id = { <1234, 1235> } - employees[].iq = { <99, 100> } - employees[].salary = { <0, 0>, <5000, 5000>, <30000, 30000> } - employees[].weight = { <80, 80>, <82, 82> } - i = { <0, 1> } -Block L4[IN] at lines from 36 to 36: - Mat.age = { <34, 34> } - Mat.favouriteColor = { <0, 0> } - Mat.height = { <174, 174> } - Mat.id = { <1235, 1235> } - Mat.iq = { <99, 99> } - Mat.salary = { <0, 0> } - Mat.weight = { <82, 82> } - Pat.age = { <35, 35> } - Pat.favouriteColor = { <3, 3> } - Pat.height = { <175, 175> } - Pat.id = { <1234, 1234> } - Pat.iq = { <100, 100> } - Pat.salary = { <0, 0> } - Pat.weight = { <80, 80> } - employees[].age = { <34, 35> } - employees[].favouriteColor = { <0, 0>, <3, 3> } - employees[].height = { <174, 174>, <175, 175> } - employees[].id = { <1234, 1235> } - employees[].iq = { <99, 100> } - employees[].salary = { <0, 0>, <5000, 5000>, <30000, 30000> } - employees[].weight = { <80, 80>, <82, 82> } - i = { <0, 1> } -Block L4[OUT]: - Mat.age = { <34, 34> } - Mat.favouriteColor = { <0, 0> } - Mat.height = { <174, 174> } - Mat.id = { <1235, 1235> } - Mat.iq = { <99, 99> } - Mat.salary = { <0, 0> } - Mat.weight = { <82, 82> } - Pat.age = { <35, 35> } - Pat.favouriteColor = { <3, 3> } - Pat.height = { <175, 175> } - Pat.id = { <1234, 1234> } - Pat.iq = { <100, 100> } - Pat.salary = { <0, 0> } - Pat.weight = { <80, 80> } - employees[].age = { <34, 35> } - employees[].favouriteColor = { <0, 0>, <3, 3> } - employees[].height = { <174, 174>, <175, 175> } - employees[].id = { <1234, 1235> } - employees[].iq = { <99, 100> } - employees[].salary = { <0, 0>, <5000, 5000>, <30000, 30000> } - employees[].weight = { <80, 80>, <82, 82> } - i = { <0, 1> } -Block L5[IN] at lines from 38 to 38: - Mat.age = { <34, 34> } - Mat.favouriteColor = { <0, 0> } - Mat.height = { <174, 174> } - Mat.id = { <1235, 1235> } - Mat.iq = { <99, 99> } - Mat.salary = { <0, 0> } - Mat.weight = { <82, 82> } - Pat.age = { <35, 35> } - Pat.favouriteColor = { <3, 3> } - Pat.height = { <175, 175> } - Pat.id = { <1234, 1234> } - Pat.iq = { <100, 100> } - Pat.salary = { <0, 0> } - Pat.weight = { <80, 80> } - employees[].age = { <34, 35> } - employees[].favouriteColor = { <0, 0>, <3, 3> } - employees[].height = { <174, 174>, <175, 175> } - employees[].id = { <1234, 1235> } - employees[].iq = { <99, 100> } - employees[].salary = { <0, 0>, <5000, 5000>, <30000, 30000> } - employees[].weight = { <80, 80>, <82, 82> } - i = { <0, 1> } -Block L5[OUT]: - Mat.age = { <34, 34> } - Mat.favouriteColor = { <0, 0> } - Mat.height = { <174, 174> } - Mat.id = { <1235, 1235> } - Mat.iq = { <99, 99> } - Mat.salary = { <0, 0> } - Mat.weight = { <82, 82> } - Pat.age = { <35, 35> } - Pat.favouriteColor = { <3, 3> } - Pat.height = { <175, 175> } - Pat.id = { <1234, 1234> } - Pat.iq = { <100, 100> } - Pat.salary = { <0, 0> } - Pat.weight = { <80, 80> } - employees[].age = { <34, 35> } - employees[].favouriteColor = { <0, 0>, <3, 3> } - employees[].height = { <174, 174>, <175, 175> } - employees[].id = { <1234, 1235> } - employees[].iq = { <99, 100> } - employees[].salary = { <0, 0>, <5000, 5000>, <30000, 30000> } - employees[].weight = { <80, 80>, <82, 82> } - i = { <0, 1> } -Block L6[IN] at lines from 34 to 34: - Mat.age = { <34, 34> } - Mat.favouriteColor = { <0, 0> } - Mat.height = { <174, 174> } - Mat.id = { <1235, 1235> } - Mat.iq = { <99, 99> } - Mat.salary = { <0, 0> } - Mat.weight = { <82, 82> } - Pat.age = { <35, 35> } - Pat.favouriteColor = { <3, 3> } - Pat.height = { <175, 175> } - Pat.id = { <1234, 1234> } - Pat.iq = { <100, 100> } - Pat.salary = { <0, 0> } - Pat.weight = { <80, 80> } - employees[].age = { <34, 35> } - employees[].favouriteColor = { <0, 0>, <3, 3> } - employees[].height = { <174, 174>, <175, 175> } - employees[].id = { <1234, 1235> } - employees[].iq = { <99, 100> } - employees[].salary = { <0, 0>, <5000, 5000>, <30000, 30000> } - employees[].weight = { <80, 80>, <82, 82> } - i = { <0, 1> } -Block L6[OUT]: - Mat.age = { <34, 34> } - Mat.favouriteColor = { <0, 0> } - Mat.height = { <174, 174> } - Mat.id = { <1235, 1235> } - Mat.iq = { <99, 99> } - Mat.salary = { <0, 0> } - Mat.weight = { <82, 82> } - Pat.age = { <35, 35> } - Pat.favouriteColor = { <3, 3> } - Pat.height = { <175, 175> } - Pat.id = { <1234, 1234> } - Pat.iq = { <100, 100> } - Pat.salary = { <0, 0> } - Pat.weight = { <80, 80> } - employees[].age = { <34, 35> } - employees[].favouriteColor = { <0, 0>, <3, 3> } - employees[].height = { <174, 174>, <175, 175> } - employees[].id = { <1234, 1235> } - employees[].iq = { <99, 100> } - employees[].salary = { <0, 0>, <5000, 5000>, <30000, 30000> } - employees[].weight = { <80, 80>, <82, 82> } - i = { <1, 2> } -Block L7[IN] at lines from 42 to 42: - Mat.age = { <34, 34> } - Mat.favouriteColor = { <0, 0> } - Mat.height = { <174, 174> } - Mat.id = { <1235, 1235> } - Mat.iq = { <99, 99> } - Mat.salary = { <0, 0> } - Mat.weight = { <82, 82> } - Pat.age = { <35, 35> } - Pat.favouriteColor = { <3, 3> } - Pat.height = { <175, 175> } - Pat.id = { <1234, 1234> } - Pat.iq = { <100, 100> } - Pat.salary = { <0, 0> } - Pat.weight = { <80, 80> } - employees[].age = { <34, 35> } - employees[].favouriteColor = { <0, 0>, <3, 3> } - employees[].height = { <174, 174>, <175, 175> } - employees[].id = { <1234, 1235> } - employees[].iq = { <99, 100> } - employees[].salary = { <0, 0>, <5000, 5000>, <30000, 30000> } - employees[].weight = { <80, 80>, <82, 82> } - i = { <0, 2> } -Block L7[OUT]: - Mat.age = { <34, 34> } - Mat.favouriteColor = { <0, 0> } - Mat.height = { <174, 174> } - Mat.id = { <1235, 1235> } - Mat.iq = { <99, 99> } - Mat.salary = { <0, 0> } - Mat.weight = { <82, 82> } - Pat.age = { <35, 35> } - Pat.favouriteColor = { <3, 3> } - Pat.height = { <175, 175> } - Pat.id = { <1234, 1234> } - Pat.iq = { <100, 100> } - Pat.salary = { <0, 0> } - Pat.weight = { <80, 80> } - employees[].age = { <34, 35> } - employees[].favouriteColor = { <0, 0>, <3, 3> } - employees[].height = { <174, 174>, <175, 175> } - employees[].id = { <1234, 1235> } - employees[].iq = { <99, 100> } - employees[].salary = { <0, 0>, <5000, 5000>, <30000, 30000> } - employees[].weight = { <80, 80>, <82, 82> } - i = { <0, 2> } -Block L8[IN] at lines from 42 to 43: - Mat.age = { <34, 34> } - Mat.favouriteColor = { <0, 0> } - Mat.height = { <174, 174> } - Mat.id = { <1235, 1235> } - Mat.iq = { <99, 99> } - Mat.salary = { <0, 0> } - Mat.weight = { <82, 82> } - Pat.age = { <35, 35> } - Pat.favouriteColor = { <3, 3> } - Pat.height = { <175, 175> } - Pat.id = { <1234, 1234> } - Pat.iq = { <100, 100> } - Pat.salary = { <0, 0> } - Pat.weight = { <80, 80> } - employees[].age = { <34, 35> } - employees[].favouriteColor = { <0, 0>, <3, 3> } - employees[].height = { <174, 174>, <175, 175> } - employees[].id = { <1234, 1235> } - employees[].iq = { <99, 100> } - employees[].salary = { <0, 0>, <5000, 5000>, <30000, 30000> } - employees[].weight = { <80, 80>, <82, 82> } - i = { <0, 2> } -Block L8[OUT]: - Mat.age = { <34, 34> } - Mat.favouriteColor = { <0, 0> } - Mat.height = { <174, 174> } - Mat.id = { <1235, 1235> } - Mat.iq = { <99, 99> } - Mat.salary = { <0, 0> } - Mat.weight = { <82, 82> } - Pat.age = { <35, 35> } - Pat.favouriteColor = { <3, 3> } - Pat.height = { <175, 175> } - Pat.id = { <1234, 1234> } - Pat.iq = { <100, 100> } - Pat.salary = { <0, 0> } - Pat.weight = { <80, 80> } - employees[].age = { <34, 35> } - employees[].favouriteColor = { <0, 0>, <3, 3> } - employees[].height = { <174, 174>, <175, 175> } - employees[].id = { <1234, 1235> } - employees[].iq = { <99, 100> } - employees[].salary = { <0, 0>, <5000, 5000>, <30000, 30000> } - employees[].weight = { <80, 80>, <82, 82> } - i = { <0, 2> } diff --git a/vra/tests-overall/test-0067.c b/vra/tests-overall/test-0067.c deleted file mode 100644 index 56d726ac1..000000000 --- a/vra/tests-overall/test-0067.c +++ /dev/null @@ -1,23 +0,0 @@ -/** -* @file test-0067.c -* -* @brief Using global variables. -*/ - -struct Info { - float weight; - float height; - int age; -}; - -struct Info donaldDuck = {20.3, 50.1, 100}; -struct Info mickeyMouse = {40.5, 78.4, 120}; - -int main(int argc, const char *argv[]) { - struct Info donalDuck2 = donaldDuck; - struct Info mickeyMouse2 = mickeyMouse; - mickeyMouse.height = 65.4; - - return 0; -} - diff --git a/vra/tests-overall/test-0067.c.ref b/vra/tests-overall/test-0067.c.ref deleted file mode 100644 index 081eb4f6d..000000000 --- a/vra/tests-overall/test-0067.c.ref +++ /dev/null @@ -1,44 +0,0 @@ ----------- Function main() ---------- -Block L1[IN] at lines from 17 to 21: - donaldDuck.age = { <100, 100> } - donaldDuck.height = { <50.1, 50.1> } - donaldDuck.weight = { <20.3, 20.3> } -Block L1[OUT]: - donalDuck2.age = { <100, 100> } - donalDuck2.height = { <50.1, 50.1> } - donalDuck2.weight = { <20.3, 20.3> } - donaldDuck.age = { <100, 100> } - donaldDuck.height = { <50.1, 50.1> } - donaldDuck.weight = { <20.3, 20.3> } - mickeyMouse.age = { <-2147483648, 2147483647> } - mickeyMouse.height = { <65.4, 65.4> } - mickeyMouse.weight = { , <-inf, inf> } - mickeyMouse2.age = { <-2147483648, 2147483647> } - mickeyMouse2.height = { , <-inf, inf> } - mickeyMouse2.weight = { , <-inf, inf> } -Block L2[IN] at lines from 21 to 22: - donalDuck2.age = { <100, 100> } - donalDuck2.height = { <50.1, 50.1> } - donalDuck2.weight = { <20.3, 20.3> } - donaldDuck.age = { <100, 100> } - donaldDuck.height = { <50.1, 50.1> } - donaldDuck.weight = { <20.3, 20.3> } - mickeyMouse.age = { <-2147483648, 2147483647> } - mickeyMouse.height = { <65.4, 65.4> } - mickeyMouse.weight = { , <-inf, inf> } - mickeyMouse2.age = { <-2147483648, 2147483647> } - mickeyMouse2.height = { , <-inf, inf> } - mickeyMouse2.weight = { , <-inf, inf> } -Block L2[OUT]: - donalDuck2.age = { <100, 100> } - donalDuck2.height = { <50.1, 50.1> } - donalDuck2.weight = { <20.3, 20.3> } - donaldDuck.age = { <100, 100> } - donaldDuck.height = { <50.1, 50.1> } - donaldDuck.weight = { <20.3, 20.3> } - mickeyMouse.age = { <-2147483648, 2147483647> } - mickeyMouse.height = { <65.4, 65.4> } - mickeyMouse.weight = { , <-inf, inf> } - mickeyMouse2.age = { <-2147483648, 2147483647> } - mickeyMouse2.height = { , <-inf, inf> } - mickeyMouse2.weight = { , <-inf, inf> } diff --git a/vra/tests-overall/test-0068.c b/vra/tests-overall/test-0068.c deleted file mode 100644 index ba47668c7..000000000 --- a/vra/tests-overall/test-0068.c +++ /dev/null @@ -1,16 +0,0 @@ -/** -* @file test-0068.c -* -* @brief Using global variables. -*/ - -int globVar = 10; -float modifGlobVar = 20; - -int main(int argc, const char *argv[]) { - int i = globVar; - float f = modifGlobVar; - modifGlobVar *= 2; - - return 0; -} diff --git a/vra/tests-overall/test-0068.c.ref b/vra/tests-overall/test-0068.c.ref deleted file mode 100644 index 52e45cc5d..000000000 --- a/vra/tests-overall/test-0068.c.ref +++ /dev/null @@ -1,18 +0,0 @@ ----------- Function main() ---------- -Block L1[IN] at lines from 11 to 15: - globVar = { <10, 10> } -Block L1[OUT]: - f = { , <-inf, inf> } - globVar = { <10, 10> } - i = { <10, 10> } - modifGlobVar = { , <-inf, inf> } -Block L2[IN] at lines from 15 to 16: - f = { , <-inf, inf> } - globVar = { <10, 10> } - i = { <10, 10> } - modifGlobVar = { , <-inf, inf> } -Block L2[OUT]: - f = { , <-inf, inf> } - globVar = { <10, 10> } - i = { <10, 10> } - modifGlobVar = { , <-inf, inf> } diff --git a/vra/tests-overall/test-0069.c b/vra/tests-overall/test-0069.c deleted file mode 100644 index 5a05fb7af..000000000 --- a/vra/tests-overall/test-0069.c +++ /dev/null @@ -1,28 +0,0 @@ -/** -* @file test-0069.c -* -* @brief Using global variables. -*/ - -#define N 2 - -int modif[N] = {0, 1}; -int nonModif[N] = {2, 3}; - -int main(int argc, const char *argv[]) { - - int arrModif[N]; - int i; - for (i = 0; i < N; ++i) { - arrModif[i] = modif[i]; - } - - int arrNonModif[N]; - for (i = 0; i < N; ++i) { - arrNonModif[i] = nonModif[i]; - } - - modif[0] = 5; - - return 0; -} diff --git a/vra/tests-overall/test-0069.c.ref b/vra/tests-overall/test-0069.c.ref deleted file mode 100644 index 2fc20ad87..000000000 --- a/vra/tests-overall/test-0069.c.ref +++ /dev/null @@ -1,84 +0,0 @@ ----------- Function main() ---------- -Block L1[IN] at lines from 16 to 16: - nonModif[] = { <2, 3> } -Block L1[OUT]: - i = { <0, 0> } - nonModif[] = { <2, 3> } -Block L2[IN] at lines from 16 to 16: - arrModif[] = { <-2147483648, 2147483647> } - i = { <0, 2> } - modif[] = { <-2147483648, 2147483647> } - nonModif[] = { <2, 3> } -Block L2[OUT]: - arrModif[] = { <-2147483648, 2147483647> } - i = { <0, 2> } - modif[] = { <-2147483648, 2147483647> } - nonModif[] = { <2, 3> } -Block L3[IN] at lines from 16 to 17: - arrModif[] = { <-2147483648, 2147483647> } - i = { <0, 1> } - modif[] = { <-2147483648, 2147483647> } - nonModif[] = { <2, 3> } -Block L3[OUT]: - arrModif[] = { <-2147483648, 2147483647> } - i = { <1, 2> } - modif[] = { <-2147483648, 2147483647> } - nonModif[] = { <2, 3> } -Block L4[IN] at lines from 21 to 21: - arrModif[] = { <-2147483648, 2147483647> } - i = { <0, 2> } - modif[] = { <-2147483648, 2147483647> } - nonModif[] = { <2, 3> } -Block L4[OUT]: - arrModif[] = { <-2147483648, 2147483647> } - i = { <0, 0> } - modif[] = { <-2147483648, 2147483647> } - nonModif[] = { <2, 3> } -Block L5[IN] at lines from 21 to 21: - arrModif[] = { <-2147483648, 2147483647> } - arrNonModif[] = { <2, 3> } - i = { <0, 2> } - modif[] = { <-2147483648, 2147483647> } - nonModif[] = { <2, 3> } -Block L5[OUT]: - arrModif[] = { <-2147483648, 2147483647> } - arrNonModif[] = { <2, 3> } - i = { <0, 2> } - modif[] = { <-2147483648, 2147483647> } - nonModif[] = { <2, 3> } -Block L6[IN] at lines from 21 to 22: - arrModif[] = { <-2147483648, 2147483647> } - arrNonModif[] = { <2, 3> } - i = { <0, 1> } - modif[] = { <-2147483648, 2147483647> } - nonModif[] = { <2, 3> } -Block L6[OUT]: - arrModif[] = { <-2147483648, 2147483647> } - arrNonModif[] = { <2, 3> } - i = { <1, 2> } - modif[] = { <-2147483648, 2147483647> } - nonModif[] = { <2, 3> } -Block L7[IN] at lines from 25 to 27: - arrModif[] = { <-2147483648, 2147483647> } - arrNonModif[] = { <2, 3> } - i = { <0, 2> } - modif[] = { <-2147483648, 2147483647> } - nonModif[] = { <2, 3> } -Block L7[OUT]: - arrModif[] = { <-2147483648, 2147483647> } - arrNonModif[] = { <2, 3> } - i = { <0, 2> } - modif[] = { <-2147483648, 2147483647> } - nonModif[] = { <2, 3> } -Block L8[IN] at lines from 27 to 28: - arrModif[] = { <-2147483648, 2147483647> } - arrNonModif[] = { <2, 3> } - i = { <0, 2> } - modif[] = { <-2147483648, 2147483647> } - nonModif[] = { <2, 3> } -Block L8[OUT]: - arrModif[] = { <-2147483648, 2147483647> } - arrNonModif[] = { <2, 3> } - i = { <0, 2> } - modif[] = { <-2147483648, 2147483647> } - nonModif[] = { <2, 3> } diff --git a/vra/tests-overall/test-0070.c b/vra/tests-overall/test-0070.c deleted file mode 100644 index 6ab980f04..000000000 --- a/vra/tests-overall/test-0070.c +++ /dev/null @@ -1,16 +0,0 @@ -/** -* @file test-0070.c -* -* @brief Using global variables. -*/ - -int intGlobVar; -float floatGlobVar; - -int main(int argc, const char *argv[]) { - int i = intGlobVar; - int f = floatGlobVar; - - return 0; -} - diff --git a/vra/tests-overall/test-0070.c.ref b/vra/tests-overall/test-0070.c.ref deleted file mode 100644 index f72bd54a9..000000000 --- a/vra/tests-overall/test-0070.c.ref +++ /dev/null @@ -1,17 +0,0 @@ ----------- Function main() ---------- -Block L1[IN] at lines from 11 to 14: -Block L1[OUT]: - f = { <-2147483648, 2147483647> } - floatGlobVar = { , <-inf, inf> } - i = { <-2147483648, 2147483647> } - intGlobVar = { <-2147483648, 2147483647> } -Block L2[IN] at lines from 14 to 15: - f = { <-2147483648, 2147483647> } - floatGlobVar = { , <-inf, inf> } - i = { <-2147483648, 2147483647> } - intGlobVar = { <-2147483648, 2147483647> } -Block L2[OUT]: - f = { <-2147483648, 2147483647> } - floatGlobVar = { , <-inf, inf> } - i = { <-2147483648, 2147483647> } - intGlobVar = { <-2147483648, 2147483647> } diff --git a/vra/tests-overall/test-0071.c b/vra/tests-overall/test-0071.c deleted file mode 100644 index ab64f1d43..000000000 --- a/vra/tests-overall/test-0071.c +++ /dev/null @@ -1,23 +0,0 @@ -/** -* @file test-0071.c -* -* @brief Nested if-else statement with double type. -*/ - -int main(int argc, const char *argv[]) { - long double f = 10; - - if (argc < 100) { - f = f + argc; - if (f > 50.125) { - printf("f = %Lf", f); - } else { - f = 50.125; - } - } else { - f = 40.225; - } - - return 0; -} - diff --git a/vra/tests-overall/test-0071.c.ref b/vra/tests-overall/test-0071.c.ref deleted file mode 100644 index 4f26ba4b3..000000000 --- a/vra/tests-overall/test-0071.c.ref +++ /dev/null @@ -1,47 +0,0 @@ ----------- Function main() ---------- -Block L1[IN] at lines from 8 to 10: -Block L1[OUT]: - argc = { <-2147483648, 2147483647> } - f = { <10, 10> } -Block L2[IN] at lines from 11 to 12: - argc = { <-2147483648, 99> } - f = { <10, 10> } -Block L2[OUT]: - argc = { <-2147483648, 99> } - f = { <-2.14748e+09, 109> } -Block L3[IN] at lines from 18 to 18: - argc = { <100, 2147483647> } - f = { <10, 10> } -Block L3[OUT]: - argc = { <100, 2147483647> } - f = { <40.225, 40.225> } -Block L4[IN] at lines from 13 to 13: - argc = { <-2147483648, 99> } - f = { <50.125, 109> } -Block L4[OUT]: - argc = { <-2147483648, 99> } - f = { <50.125, 109> } -Block L5[IN] at lines from 15 to 15: - argc = { <-2147483648, 99> } - f = { <-2.14748e+09, 50.125> } -Block L5[OUT]: - argc = { <-2147483648, 99> } - f = { <50.125, 50.125> } -Block L6[IN] at lines from 21 to 21: - argc = { <-2147483648, 99> } - f = { <50.125, 109> } -Block L6[OUT]: - argc = { <-2147483648, 99> } - f = { <50.125, 109> } -Block L7[IN] at lines from 21 to 21: - argc = { <-2147483648, 2147483647> } - f = { <40.225, 40.225>, <50.125, 109> } -Block L7[OUT]: - argc = { <-2147483648, 2147483647> } - f = { <40.225, 40.225>, <50.125, 109> } -Block L8[IN] at lines from 21 to 22: - argc = { <-2147483648, 2147483647> } - f = { <40.225, 40.225>, <50.125, 109> } -Block L8[OUT]: - argc = { <-2147483648, 2147483647> } - f = { <40.225, 40.225>, <50.125, 109> } diff --git a/vra/tests-overall/test-0072.c b/vra/tests-overall/test-0072.c deleted file mode 100644 index ce16a6c61..000000000 --- a/vra/tests-overall/test-0072.c +++ /dev/null @@ -1,27 +0,0 @@ -/** -* @file test-0071.c -* -* @brief More functions. -*/ - -#include -#include - -bool isMax(signed char c); - -int main(int argc, const char *argv[]) { - int c = isMax(CHAR_MAX); - return 0; -} - -bool isMax(signed char c) -{ - bool a; - if (c == CHAR_MAX) { - a = true; - } else { - a = false; - } - - return a; -} diff --git a/vra/tests-overall/test-0072.c.ref b/vra/tests-overall/test-0072.c.ref deleted file mode 100644 index 686e5d1af..000000000 --- a/vra/tests-overall/test-0072.c.ref +++ /dev/null @@ -1,34 +0,0 @@ ----------- Function main() ---------- -Block L1[IN] at lines from 13 to 14: -Block L1[OUT]: - c = { <0, 1> } -Block L2[IN] at lines from 14 to 15: - c = { <0, 1> } -Block L2[OUT]: - c = { <0, 1> } ----------- Function isMax() ---------- -Block L3[IN] at lines from 20 to 20: -Block L3[OUT]: - c = { <-128, 127> } -Block L4[IN] at lines from 21 to 21: - c = { <127, 127> } -Block L4[OUT]: - a = { <1, 1> } - c = { <127, 127> } -Block L5[IN] at lines from 23 to 23: - c = { <-128, 127> } -Block L5[OUT]: - a = { <0, 0> } - c = { <-128, 127> } -Block L6[IN] at lines from 26 to 26: - a = { <0, 1> } - c = { <-128, 127> } -Block L6[OUT]: - a = { <0, 1> } - c = { <-128, 127> } -Block L7[IN] at lines from 26 to 27: - a = { <0, 1> } - c = { <-128, 127> } -Block L7[OUT]: - a = { <0, 1> } - c = { <-128, 127> } diff --git a/vra/tests-overall/test-0073.c b/vra/tests-overall/test-0073.c deleted file mode 100644 index 06ae8ded8..000000000 --- a/vra/tests-overall/test-0073.c +++ /dev/null @@ -1,19 +0,0 @@ -/** -* @file test-0073.c -* -* @brief Structures and arrays. -*/ - -int main() { - struct Int { - int i; - } a; - - struct Int c[1] = {0}; - - int d[1] = {1}; - int f = 1; - int e[1] = {f}; - - return 0; -} diff --git a/vra/tests-overall/test-0073.c.ref b/vra/tests-overall/test-0073.c.ref deleted file mode 100644 index 8a0258404..000000000 --- a/vra/tests-overall/test-0073.c.ref +++ /dev/null @@ -1,17 +0,0 @@ ----------- Function main() ---------- -Block L1[IN] at lines from 12 to 18: -Block L1[OUT]: - c[].i = { <0, 0> } - d[] = { <1, 1> } - e[] = { <1, 1> } - f = { <1, 1> } -Block L2[IN] at lines from 18 to 19: - c[].i = { <0, 0> } - d[] = { <1, 1> } - e[] = { <1, 1> } - f = { <1, 1> } -Block L2[OUT]: - c[].i = { <0, 0> } - d[] = { <1, 1> } - e[] = { <1, 1> } - f = { <1, 1> } diff --git a/vra/tests-overall/test-0074.c b/vra/tests-overall/test-0074.c deleted file mode 100644 index c58c22a57..000000000 --- a/vra/tests-overall/test-0074.c +++ /dev/null @@ -1,19 +0,0 @@ -/** -* @file test-0074.c -* -* @brief Structures and arrays. -*/ - -int main(int argc, const char *argv[]) { - struct s1{ - int a; - } c; - - struct s2{ - struct s1 b[2]; - } d; - - d.b[0] = c; - - return 0; -} diff --git a/vra/tests-overall/test-0074.c.ref b/vra/tests-overall/test-0074.c.ref deleted file mode 100644 index 5fb2fb864..000000000 --- a/vra/tests-overall/test-0074.c.ref +++ /dev/null @@ -1,11 +0,0 @@ ----------- Function main() ---------- -Block L1[IN] at lines from 16 to 18: -Block L1[OUT]: - c.a = { <-2147483648, 2147483647> } - d.b[].a = { <-2147483648, 2147483647> } -Block L2[IN] at lines from 18 to 19: - c.a = { <-2147483648, 2147483647> } - d.b[].a = { <-2147483648, 2147483647> } -Block L2[OUT]: - c.a = { <-2147483648, 2147483647> } - d.b[].a = { <-2147483648, 2147483647> } diff --git a/vra/tests-overall/test-0075.c b/vra/tests-overall/test-0075.c deleted file mode 100644 index 23a121ab6..000000000 --- a/vra/tests-overall/test-0075.c +++ /dev/null @@ -1,22 +0,0 @@ -/** -* @file test-0075.c -* -* @brief Motivation program from the master thesis with buffer overflow. -*/ - -#include - -int main(int argc, const char *argv[]) -{ - int importantData = 1; - int buffer[10]; - - int i; - for (i = 0; i <= 10; i++) { - buffer[i] = 9999; - } - - printf("importantData = %d\n", importantData); - - return 0; -} diff --git a/vra/tests-overall/test-0075.c.ref b/vra/tests-overall/test-0075.c.ref deleted file mode 100644 index 3a47fbb2c..000000000 --- a/vra/tests-overall/test-0075.c.ref +++ /dev/null @@ -1,37 +0,0 @@ ----------- Function main() ---------- -Block L1[IN] at lines from 11 to 15: -Block L1[OUT]: - i = { <0, 0> } - importantData = { <1, 1> } -Block L2[IN] at lines from 15 to 15: - buffer[] = { <9999, 9999> } - i = { <0, 11> } - importantData = { <1, 1> } -Block L2[OUT]: - buffer[] = { <9999, 9999> } - i = { <0, 11> } - importantData = { <1, 1> } -Block L3[IN] at lines from 15 to 16: - buffer[] = { <9999, 9999> } - i = { <0, 10> } - importantData = { <1, 1> } -Block L3[OUT]: - buffer[] = { <9999, 9999> } - i = { <1, 11> } - importantData = { <1, 1> } -Block L4[IN] at lines from 19 to 21: - buffer[] = { <9999, 9999> } - i = { <0, 11> } - importantData = { <1, 1> } -Block L4[OUT]: - buffer[] = { <9999, 9999> } - i = { <0, 11> } - importantData = { <1, 1> } -Block L5[IN] at lines from 21 to 22: - buffer[] = { <9999, 9999> } - i = { <0, 11> } - importantData = { <1, 1> } -Block L5[OUT]: - buffer[] = { <9999, 9999> } - i = { <0, 11> } - importantData = { <1, 1> } diff --git a/vra/tests-overall/test-0076.c b/vra/tests-overall/test-0076.c deleted file mode 100644 index 87ecee2c5..000000000 --- a/vra/tests-overall/test-0076.c +++ /dev/null @@ -1,27 +0,0 @@ -/** -* @file test-0076.c -* -* @brief Prints a table for Fahrenheit to Celsius from 0F to 300F. -* From http://nob.cs.ucdavis.edu/classes/ecs030-2002-02/handouts/samprog.html -*/ - -#define LOWER 0 -#define UPPER 300 -#define STEP 20 - -#include - -int main(int argc, const char *argv[]) { - int fahr; - int celsius; - - fahr = 0; - while(fahr <= UPPER){ - celsius = 5 * (fahr - 32) / 9; - printf("%d\t%d\n", fahr, celsius); - fahr += STEP; - } - - return 0; -} - diff --git a/vra/tests-overall/test-0076.c.ref b/vra/tests-overall/test-0076.c.ref deleted file mode 100644 index cd4c35b3e..000000000 --- a/vra/tests-overall/test-0076.c.ref +++ /dev/null @@ -1,28 +0,0 @@ ----------- Function main() ---------- -Block L1[IN] at lines from 18 to 18: -Block L1[OUT]: - fahr = { <0, 0> } -Block L2[IN] at lines from 19 to 19: - celsius = { <-17, 148> } - fahr = { <0, 320> } -Block L2[OUT]: - celsius = { <-17, 148> } - fahr = { <0, 320> } -Block L3[IN] at lines from 20 to 22: - celsius = { <-17, -17>, <-6, -6>, <4, 4>, <15, 15>, <26, 26>, <37, 37>, <48, 48>, <60, 60>, <71, 71>, <82, 82>, <93, 93>, <104, 104>, <115, 115>, <126, 126>, <137, 137> } - fahr = { <0, 300> } -Block L3[OUT]: - celsius = { <-17, -17>, <0, 0>, <148, 148> } - fahr = { <20, 320> } -Block L4[IN] at lines from 25 to 25: - celsius = { <-17, 148> } - fahr = { <0, 320> } -Block L4[OUT]: - celsius = { <-17, 148> } - fahr = { <0, 320> } -Block L5[IN] at lines from 25 to 26: - celsius = { <-17, 148> } - fahr = { <0, 320> } -Block L5[OUT]: - celsius = { <-17, 148> } - fahr = { <0, 320> } diff --git a/vra/tests-overall/test-0077.c b/vra/tests-overall/test-0077.c deleted file mode 100644 index 8b1e00dcf..000000000 --- a/vra/tests-overall/test-0077.c +++ /dev/null @@ -1,18 +0,0 @@ -/** -* @file test-0077.c -* -* @brief Computes the area of the circle. -*/ - - #include - -int main(int argc, const char *argv[]) { - float r = 1; - float area; - - area = 3.14 * r * r; - - printf("Area of circle is: %f",area); - - return 0; -} diff --git a/vra/tests-overall/test-0077.c.ref b/vra/tests-overall/test-0077.c.ref deleted file mode 100644 index 223048247..000000000 --- a/vra/tests-overall/test-0077.c.ref +++ /dev/null @@ -1,11 +0,0 @@ ----------- Function main() ---------- -Block L1[IN] at lines from 10 to 17: -Block L1[OUT]: - area = { <3.14, 3.14> } - r = { <1, 1> } -Block L2[IN] at lines from 17 to 18: - area = { <3.14, 3.14> } - r = { <1, 1> } -Block L2[OUT]: - area = { <3.14, 3.14> } - r = { <1, 1> } diff --git a/vra/tests-overall/test-0078.c b/vra/tests-overall/test-0078.c deleted file mode 100644 index 5d9f09634..000000000 --- a/vra/tests-overall/test-0078.c +++ /dev/null @@ -1,24 +0,0 @@ -/** -* @file test-0078.c -* -* @brief Prints the multiplication table. -*/ - -#include - -#define NUM 10 - -int main(int argc, const char *argv[]) { - int i, j; - int mult; - - for(i = 1; i <= NUM; i++){ - for(j = 1; j<= NUM; j++) { - mult = i * j; - printf("%d * %d = %d ", i, j, i*j); - } - printf("\n"); - } - - return 0; -} diff --git a/vra/tests-overall/test-0078.c.ref b/vra/tests-overall/test-0078.c.ref deleted file mode 100644 index 0a0a10e11..000000000 --- a/vra/tests-overall/test-0078.c.ref +++ /dev/null @@ -1,60 +0,0 @@ ----------- Function main() ---------- -Block L1[IN] at lines from 15 to 15: -Block L1[OUT]: - i = { <1, 1> } -Block L2[IN] at lines from 15 to 15: - i = { <1, 11> } - j = { <1, 11> } - mult = { <1, 100> } -Block L2[OUT]: - i = { <1, 11> } - j = { <1, 11> } - mult = { <1, 100> } -Block L3[IN] at lines from 16 to 16: - i = { <1, 10> } - j = { <1, 11> } - mult = { <1, 100> } -Block L3[OUT]: - i = { <1, 10> } - j = { <1, 1> } - mult = { <1, 100> } -Block L4[IN] at lines from 16 to 16: - i = { <1, 10> } - j = { <1, 11> } - mult = { <1, 100> } -Block L4[OUT]: - i = { <1, 10> } - j = { <1, 11> } - mult = { <1, 100> } -Block L5[IN] at lines from 16 to 17: - i = { <1, 10> } - j = { <1, 10> } - mult = { <1, 100> } -Block L5[OUT]: - i = { <1, 10> } - j = { <2, 11> } - mult = { <1, 100> } -Block L6[IN] at lines from 15 to 20: - i = { <1, 10> } - j = { <1, 11> } - mult = { <1, 100> } -Block L6[OUT]: - i = { <2, 11> } - j = { <1, 11> } - mult = { <1, 100> } -Block L7[IN] at lines from 23 to 23: - i = { <1, 11> } - j = { <1, 11> } - mult = { <1, 100> } -Block L7[OUT]: - i = { <1, 11> } - j = { <1, 11> } - mult = { <1, 100> } -Block L8[IN] at lines from 23 to 24: - i = { <1, 11> } - j = { <1, 11> } - mult = { <1, 100> } -Block L8[OUT]: - i = { <1, 11> } - j = { <1, 11> } - mult = { <1, 100> } diff --git a/vra/tests-overall/test-0079.c b/vra/tests-overall/test-0079.c deleted file mode 100644 index c2781dc65..000000000 --- a/vra/tests-overall/test-0079.c +++ /dev/null @@ -1,28 +0,0 @@ -/** -* @file test-0079.c -* -* @brief Converts lower case letter to upper case one. -*/ - -#include - -#define NUM 10 - -int main(){ - char str[NUM] = {'a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j'}; - char strNew[NUM]; - int i; - - printf("The string is: %s",str); - - for(i = 0; i < NUM; i++) { - if ( str[i] >= 97 && str[i] <= 122) { - strNew[i]= str[i] - 32; - } - } - - printf("\nThe string in uppercase is: %s",str); - - return 0; -} - diff --git a/vra/tests-overall/test-0079.c.ref b/vra/tests-overall/test-0079.c.ref deleted file mode 100644 index 308d78563..000000000 --- a/vra/tests-overall/test-0079.c.ref +++ /dev/null @@ -1,61 +0,0 @@ ----------- Function main() ---------- -Block L1[IN] at lines from 12 to 18: -Block L1[OUT]: - i = { <0, 0> } - str[] = { <97, 106> } -Block L2[IN] at lines from 18 to 18: - i = { <0, 10> } - strNew[] = { <65, 74> } - str[] = { <97, 106> } -Block L2[OUT]: - i = { <0, 10> } - strNew[] = { <65, 74> } - str[] = { <97, 106> } -Block L3[IN] at lines from 19 to 19: - i = { <0, 9> } - strNew[] = { <65, 74> } - str[] = { <97, 106> } -Block L3[OUT]: - i = { <0, 9> } - strNew[] = { <65, 74> } - str[] = { <97, 106> } -Block L4[IN] at lines from 19 to 19: - i = { <0, 9> } - strNew[] = { <65, 74> } - str[] = { <97, 106> } -Block L4[OUT]: - i = { <0, 9> } - strNew[] = { <65, 74> } - str[] = { <97, 106> } -Block L5[IN] at lines from 18 to 18: - i = { <0, 9> } - strNew[] = { <65, 74> } - str[] = { <97, 106> } -Block L5[OUT]: - i = { <1, 10> } - strNew[] = { <65, 74> } - str[] = { <97, 106> } -Block L6[IN] at lines from 20 to 20: - i = { <0, 9> } - strNew[] = { <65, 74> } - str[] = { <97, 106> } -Block L6[OUT]: - i = { <0, 9> } - strNew[] = { <65, 74> } - str[] = { <97, 106> } -Block L7[IN] at lines from 24 to 26: - i = { <0, 10> } - strNew[] = { <65, 74> } - str[] = { <97, 106> } -Block L7[OUT]: - i = { <0, 10> } - strNew[] = { <65, 74> } - str[] = { <97, 106> } -Block L8[IN] at lines from 26 to 27: - i = { <0, 10> } - strNew[] = { <65, 74> } - str[] = { <97, 106> } -Block L8[OUT]: - i = { <0, 10> } - strNew[] = { <65, 74> } - str[] = { <97, 106> } diff --git a/vra/tests-overall/test-0080.c b/vra/tests-overall/test-0080.c deleted file mode 100644 index bab626cf3..000000000 --- a/vra/tests-overall/test-0080.c +++ /dev/null @@ -1,29 +0,0 @@ -/** -* @file test-0080.c -* -* @brief Converts upper case letter to lower case one. -*/ - -#include - -#define NUM 10 - -int main(){ - char str[NUM] = {'A', 'B', 'C', 'D', 'E', 'F', 'G', 'H', 'I', 'J'}; - char strNew[NUM]; - int i; - - printf("The string is: %s",str); - - for(i = 0; i < NUM; i++) { - if ( str[i] >= 65 && str[i] <= 90) { - strNew[i]= str[i] + 32; - } - } - - printf("\nThe string in uppercase is: %s",str); - - return 0; -} - - diff --git a/vra/tests-overall/test-0080.c.ref b/vra/tests-overall/test-0080.c.ref deleted file mode 100644 index 2daf68d73..000000000 --- a/vra/tests-overall/test-0080.c.ref +++ /dev/null @@ -1,61 +0,0 @@ ----------- Function main() ---------- -Block L1[IN] at lines from 12 to 18: -Block L1[OUT]: - i = { <0, 0> } - str[] = { <65, 74> } -Block L2[IN] at lines from 18 to 18: - i = { <0, 10> } - strNew[] = { <97, 106> } - str[] = { <65, 74> } -Block L2[OUT]: - i = { <0, 10> } - strNew[] = { <97, 106> } - str[] = { <65, 74> } -Block L3[IN] at lines from 19 to 19: - i = { <0, 9> } - strNew[] = { <97, 106> } - str[] = { <65, 74> } -Block L3[OUT]: - i = { <0, 9> } - strNew[] = { <97, 106> } - str[] = { <65, 74> } -Block L4[IN] at lines from 19 to 19: - i = { <0, 9> } - strNew[] = { <97, 106> } - str[] = { <65, 74> } -Block L4[OUT]: - i = { <0, 9> } - strNew[] = { <97, 106> } - str[] = { <65, 74> } -Block L5[IN] at lines from 18 to 18: - i = { <0, 9> } - strNew[] = { <97, 106> } - str[] = { <65, 74> } -Block L5[OUT]: - i = { <1, 10> } - strNew[] = { <97, 106> } - str[] = { <65, 74> } -Block L6[IN] at lines from 20 to 20: - i = { <0, 9> } - strNew[] = { <97, 106> } - str[] = { <65, 74> } -Block L6[OUT]: - i = { <0, 9> } - strNew[] = { <97, 106> } - str[] = { <65, 74> } -Block L7[IN] at lines from 24 to 26: - i = { <0, 10> } - strNew[] = { <97, 106> } - str[] = { <65, 74> } -Block L7[OUT]: - i = { <0, 10> } - strNew[] = { <97, 106> } - str[] = { <65, 74> } -Block L8[IN] at lines from 26 to 27: - i = { <0, 10> } - strNew[] = { <97, 106> } - str[] = { <65, 74> } -Block L8[OUT]: - i = { <0, 10> } - strNew[] = { <97, 106> } - str[] = { <65, 74> } diff --git a/vra/tests-overall/test-0081.c b/vra/tests-overall/test-0081.c deleted file mode 100644 index 43943a7da..000000000 --- a/vra/tests-overall/test-0081.c +++ /dev/null @@ -1,24 +0,0 @@ -/** -* @file test-0081.c -* -* @brief Finds the minimum element of the array. -*/ - -#include - -#define NUM 10 - -int main(int argc, const char *argv[]) { - int array[NUM] = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9}; - - int i; - int min = array[0]; - for (i = 1; i < NUM; ++i) { - if (array[i] < min) { - min = array[i]; - } - } - - return 0; -} - diff --git a/vra/tests-overall/test-0081.c.ref b/vra/tests-overall/test-0081.c.ref deleted file mode 100644 index 5f9162ee5..000000000 --- a/vra/tests-overall/test-0081.c.ref +++ /dev/null @@ -1,54 +0,0 @@ ----------- Function main() ---------- -Block L1[IN] at lines from 12 to 16: -Block L1[OUT]: - array[] = { <0, 9> } - i = { <1, 1> } - min = { <0, 9> } -Block L2[IN] at lines from 16 to 16: - array[] = { <0, 9> } - i = { <1, 10> } - min = { <0, 9> } -Block L2[OUT]: - array[] = { <0, 9> } - i = { <1, 10> } - min = { <0, 9> } -Block L3[IN] at lines from 17 to 17: - array[] = { <0, 9> } - i = { <1, 9> } - min = { <0, 9> } -Block L3[OUT]: - array[] = { <0, 9> } - i = { <1, 9> } - min = { <0, 9> } -Block L4[IN] at lines from 18 to 18: - array[] = { <0, 9> } - i = { <1, 9> } - min = { <1, 9> } -Block L4[OUT]: - array[] = { <0, 9> } - i = { <1, 9> } - min = { <0, 9> } -Block L5[IN] at lines from 16 to 16: - array[] = { <0, 9> } - i = { <1, 9> } - min = { <0, 9> } -Block L5[OUT]: - array[] = { <0, 9> } - i = { <2, 10> } - min = { <0, 9> } -Block L6[IN] at lines from 22 to 22: - array[] = { <0, 9> } - i = { <1, 10> } - min = { <0, 9> } -Block L6[OUT]: - array[] = { <0, 9> } - i = { <1, 10> } - min = { <0, 9> } -Block L7[IN] at lines from 22 to 23: - array[] = { <0, 9> } - i = { <1, 10> } - min = { <0, 9> } -Block L7[OUT]: - array[] = { <0, 9> } - i = { <1, 10> } - min = { <0, 9> } diff --git a/vra/tests-overall/test-0082.c b/vra/tests-overall/test-0082.c deleted file mode 100644 index b7df3e70e..000000000 --- a/vra/tests-overall/test-0082.c +++ /dev/null @@ -1,23 +0,0 @@ -/** -* @file test-0082.c -* -* @brief Power of two for an array. -*/ - -#include -#include - -#define NUM 10 - -int main(){ - int array[NUM] = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9}; - int result[NUM]; - - int i; - for (i = 0; i < NUM; ++i) { - int j = array[i]; - result[i] = j * j; - } - - return 0; -} diff --git a/vra/tests-overall/test-0082.c.ref b/vra/tests-overall/test-0082.c.ref deleted file mode 100644 index 36497ab22..000000000 --- a/vra/tests-overall/test-0082.c.ref +++ /dev/null @@ -1,45 +0,0 @@ ----------- Function main() ---------- -Block L1[IN] at lines from 13 to 17: -Block L1[OUT]: - array[] = { <0, 9> } - i = { <0, 0> } -Block L2[IN] at lines from 17 to 17: - array[] = { <0, 9> } - i = { <0, 10> } - j = { <0, 9> } - result[] = { <0, 81> } -Block L2[OUT]: - array[] = { <0, 9> } - i = { <0, 10> } - j = { <0, 9> } - result[] = { <0, 81> } -Block L3[IN] at lines from 17 to 18: - array[] = { <0, 9> } - i = { <0, 9> } - j = { <0, 9> } - result[] = { <0, 81> } -Block L3[OUT]: - array[] = { <0, 9> } - i = { <1, 10> } - j = { <0, 9> } - result[] = { <0, 81> } -Block L4[IN] at lines from 22 to 22: - array[] = { <0, 9> } - i = { <0, 10> } - j = { <0, 9> } - result[] = { <0, 81> } -Block L4[OUT]: - array[] = { <0, 9> } - i = { <0, 10> } - j = { <0, 9> } - result[] = { <0, 81> } -Block L5[IN] at lines from 22 to 23: - array[] = { <0, 9> } - i = { <0, 10> } - j = { <0, 9> } - result[] = { <0, 81> } -Block L5[OUT]: - array[] = { <0, 9> } - i = { <0, 10> } - j = { <0, 9> } - result[] = { <0, 81> } diff --git a/vra/tests-overall/tests-config.sh b/vra/tests-overall/tests-config.sh deleted file mode 120000 index 34557d66d..000000000 --- a/vra/tests-overall/tests-config.sh +++ /dev/null @@ -1 +0,0 @@ -../../vra_build/tests-config.sh \ No newline at end of file diff --git a/vra/tests-overall/tests-config.sh.in b/vra/tests-overall/tests-config.sh.in deleted file mode 100644 index 684ca6fdd..000000000 --- a/vra/tests-overall/tests-config.sh.in +++ /dev/null @@ -1,24 +0,0 @@ -# shellcheck shell=sh -# -# Encoding: utf-8 -# Author: Daniela Duricekova, xduric00@stud.fit.vutbr.cz -# Date: 2013-04-13 -# -# A configuration file for the tests. -# - -# Path to the tests (without ending '/'). -TESTS_PATH="./" - -# Take $GCC_HOST from CMakeLists.txt -GCC_HOST='@GCC_HOST@' - -# Command that runs the analysis. The tests are run by using -# `$ANALYSIS_CMD $TEST_FILE`. -ANALYSIS_CMD="$GCC_HOST -fplugin=../../vra_build/libvra.so" - -# Regular expression describing test files (format is that of `find`). -TEST_REGEXP="test-[0-9]*.c" - -# Number of columns after which the status message (OK/FAIL) should be emitted. -INDENT=20 diff --git a/vra/tests-overall/tests-gen-ref-outputs.sh b/vra/tests-overall/tests-gen-ref-outputs.sh deleted file mode 100755 index 214536c68..000000000 --- a/vra/tests-overall/tests-gen-ref-outputs.sh +++ /dev/null @@ -1,49 +0,0 @@ -#!/bin/bash -# -# Encoding: utf-8 -# Author: Daniela Duricekova, xduric00@stud.fit.vutbr.cz -# Date: 2013-04-13 -# -# Generates reference test outputs. -# - -. tests-config.sh -. tests-utils.sh - -# Number of tests. -num_of_tests=0 - -# Run the analyzer on all existing tests and generate the reference outputs. -echo "Generating the reference outputs for tests in '$TESTS_PATH'..." -echo "" -for test_file in $(find "$TESTS_PATH" -name "$TEST_REGEXP" | sort); do - # Generate and emit the test's name. - test_name=`basename ${test_file##$TESTS_PATH}` - echo_colored "$test_name" "yellow" - - # Generate the reference file name. - ref_file="$test_file"".ref" - - # Run the analyzer to obtain the reference output. - $ANALYSIS_CMD $test_file 2> /dev/null > $ref_file - if [ ! -e "$ref_file" ]; then - # There was an error during the analysis. - emit_indent $test_name - echo_colored "[ERROR] (no output)" "red" - echo "" - continue - fi - - emit_indent $test_name - echo_colored "[OK]" "green" - - num_of_tests=`expr $num_of_tests + 1` - - echo "" -done -echo "" - -# Emit statistics. -echo "Generated reference outputs for $num_of_tests tests." - -exit 0 diff --git a/vra/tests-overall/tests-run.sh b/vra/tests-overall/tests-run.sh deleted file mode 100755 index 177aecd9e..000000000 --- a/vra/tests-overall/tests-run.sh +++ /dev/null @@ -1,64 +0,0 @@ -#!/bin/bash -# -# Encoding: utf-8 -# Author: Daniela Duricekova, xduric00@stud.fit.vutbr.cz -# Date: 2013-04-13 -# -# Runs the tests. -# - -. tests-config.sh -. tests-utils.sh - -# Remove all .out files before we start testing. -find "$TESTS_PATH" -name "*.out.*" -exec rm -f {} \; - -# Number of passed tests. -num_of_passed=0 - -# Number of failed tests. -num_of_failed=0 - -# Run the analyzer on all existing tests to obtain outputs, which will be then -# compared to the reference outputs. -echo "Running the analyzer on tests in '$TESTS_PATH'..." -echo "" -for test_file in $(find "$TESTS_PATH" -name "$TEST_REGEXP" | sort); do - # Generate and emit the test's name. - test_name=`basename ${test_file##$TESTS_PATH}` - echo_colored "$test_name" "yellow" - - # Generate the reference and output file names. - ref_file="$test_file"".ref" - out_file="$test_file"".out" - - # Run the analyzer to obtain the output. - $ANALYSIS_CMD $test_file 2> /dev/null > $out_file - if [ ! -e "$out_file" ]; then - # There was an error during the analysis, so skip the comparison to the - # reference output. - emit_indent $test_name - echo_colored "[ERROR] (no output)" "red" - echo "" - continue - fi - - # Check whether the obtained output matches the reference output. - evaluate_result "$out_file" "$ref_file" "$test_name" - if [ $? -eq 0 ]; then - num_of_passed=`expr $num_of_passed + 1` - else - num_of_failed=`expr $num_of_failed + 1` - fi - - echo "" -done -echo "" - -# Emit statistics. -total=`expr $num_of_passed + $num_of_failed` -echo " Passed: $num_of_passed/$total" -echo " Failed: $num_of_failed/$total" -echo "" - -exit 0 diff --git a/vra/tests-overall/tests-utils.sh b/vra/tests-overall/tests-utils.sh deleted file mode 100644 index df2320ece..000000000 --- a/vra/tests-overall/tests-utils.sh +++ /dev/null @@ -1,108 +0,0 @@ -# shellcheck shell=bash -# -# Encoding: utf-8 -# Author: Daniela Duricekova, xduric00@stud.fit.vutbr.cz -# Date: 2013-04-13 -# -# Utilits for the tests. -# - -. tests-config.sh - -## -## Emits a proper number of spaces so a status message can be emitted after it. -## -## 1 string argument is needed: -## $1 test name -## -## If $1 is empty, no spaces are emitted. -emit_indent() { - # Check the number of arguments. - if [ "$#" != "1" ]; then - return - fi - - # Is the test name empty? - if [ -z "$1" ]; then - return - fi - - test_name_len=`expr length $1` - spaces=$(echo "$INDENT-$test_name_len" | bc) - for i in `seq 1 $spaces`; do - echo -n " " - done -} - -## -## Performs a diff of the two given files emits the result on standard output. -## -## 4 string arguments are needed: -## $1 first file (out) -## $2 second file (ref) -## $3 test name -## -## Returns 0 if the diff is empty, 1 otherwise. -## -evaluate_result() { - # Check the number of arguments. - if [ "$#" != "3" ]; then - return 1 - fi - - emit_indent $3 - - # Check that the files we're diffing exist. - if [ ! -e "$1" ]; then - echo_colored "[ERROR] .out file does not exist" "red" - return 1 - fi - if [ ! -e "$2" ]; then - echo_colored "[ERROR] .ref file does not exist" "red" - return 1 - fi - - diff=`diff "$1" "$2"` - if [ -z "$diff" ]; then - echo_colored "[OK]" "green" - return 0 - else - echo_colored "[FAIL]" "red" - echo "" - echo "$diff" | sed 's/^/ /' - return 1 - fi -} - -## -## Emits a colored version of the given message to the standard output. -## -## -## 2 string argument are needed: -## $1 message to be colored -## $2 color (red, green, yellow) -## -## If the color is unknown, this function emits just $1. No new line is -## appended. -## -echo_colored() { - # Check the number of arguments. - if [ "$#" != "2" ]; then - return - fi - - case $2 in - "red") - printf "\033[22;31m$1\033[0m" - ;; - "green") - printf "\033[22;32m$1\033[0m" - ;; - "yellow") - printf "\033[01;33m$1\033[0m" - ;; - *) - printf "$1\n" - ;; - esac -} diff --git a/vra/tests-unit/.gitignore b/vra/tests-unit/.gitignore deleted file mode 100644 index 9c4aa2262..000000000 --- a/vra/tests-unit/.gitignore +++ /dev/null @@ -1,6 +0,0 @@ -/MemoryPlaceTest -/NumberTest -/OperandToMemoryPlaceTest -/RangeTest -/UtilityTest -/gtest/libgtest.a diff --git a/vra/tests-unit/Makefile b/vra/tests-unit/Makefile deleted file mode 100644 index 1cd819d37..000000000 --- a/vra/tests-unit/Makefile +++ /dev/null @@ -1,32 +0,0 @@ -.PHONY: all clean - -CXX ?= g++ -CXXFLAGS ?= -O0 -g -std=c++98 -pedantic -W -Wall -Wextra \ - -Wno-variadic-macros -Wno-long-long \ - -I../ -I../../include/ \ - -pthread -lgmpxx -lgmp - -all: NumberTest RangeTest MemoryPlaceTest OperandToMemoryPlaceTest UtilityTest - -gtest/libgtest.a: - make -C gtest - -NumberTest: NumberTest.cc ../Number.cc gtest/libgtest.a - $(CXX) NumberTest.cc ../Number.cc gtest/libgtest.a -o $@ $(CXXFLAGS) - -RangeTest: RangeTest.cc ../Range.cc ../Number.cc gtest/libgtest.a - $(CXX) RangeTest.cc ../Range.cc ../Number.cc gtest/libgtest.a -o $@ $(CXXFLAGS) - -MemoryPlaceTest: MemoryPlaceTest.cc ../MemoryPlace.cc gtest/libgtest.a - $(CXX) MemoryPlaceTest.cc ../MemoryPlace.cc gtest/libgtest.a -o $@ $(CXXFLAGS) - -OperandToMemoryPlaceTest: OperandToMemoryPlaceTest.cc ../OperandToMemoryPlace.cc gtest/libgtest.a - $(CXX) OperandToMemoryPlaceTest.cc ../OperandToMemoryPlace.cc \ - ../MemoryPlace.cc gtest/libgtest.a -o $@ $(CXXFLAGS) - -UtilityTest: UtilityTest.cc ../Utility.cc ../Number.cc ../Range.cc gtest/libgtest.a - $(CXX) UtilityTest.cc ../Utility.cc ../Number.cc ../Range.cc gtest/libgtest.a -o $@ $(CXXFLAGS) - -clean: - make -C gtest clean - rm -f *.o *Test diff --git a/vra/tests-unit/MemoryPlaceTest.cc b/vra/tests-unit/MemoryPlaceTest.cc deleted file mode 100644 index b0f1e51de..000000000 --- a/vra/tests-unit/MemoryPlaceTest.cc +++ /dev/null @@ -1,147 +0,0 @@ -/** -* @author Daniela Ďuričeková, xduric00@stud.fit.vutbr.cz -* @file MemoryPlaceTest.cc -* @brief Test class for class MemoryPlace. -* @date 2012 -*/ - -#include "MemoryPlace.h" -#include "gtest/gtest.h" - -using namespace std; - -class MemoryPlaceTest : public ::testing::Test { - protected: - MemoryPlaceTest() { - } - - virtual ~MemoryPlaceTest() { - } - - virtual void SetUp() { - } - - virtual void TearDown() { - } - -}; - -//////////////////////////////////////////////////////////////////////////////// -// variable as a memory place -//////////////////////////////////////////////////////////////////////////////// - -TEST_F(MemoryPlaceTest, -ArtificialVariableTest) -{ - MemoryPlace m("var", true); - EXPECT_EQ("var", m.asString()); - EXPECT_TRUE(m.isArtificial()); -} - -TEST_F(MemoryPlaceTest, -VariableTest) -{ - MemoryPlace m("var", false); - EXPECT_EQ("var", m.asString()); - EXPECT_FALSE(m.isArtificial()); -} - -//////////////////////////////////////////////////////////////////////////////// -// item of a structure as a memory place -//////////////////////////////////////////////////////////////////////////////// - -TEST_F(MemoryPlaceTest, -ArtificialStructItemTest) -{ - MemoryPlace m("structure.item", true); - EXPECT_EQ("structure.item", m.asString()); - EXPECT_TRUE(m.isArtificial()); -} - -TEST_F(MemoryPlaceTest, -StructItemTest) -{ - MemoryPlace m("structure.item", false); - EXPECT_EQ("structure.item", m.asString()); - EXPECT_FALSE(m.isArtificial()); -} - -//////////////////////////////////////////////////////////////////////////////// -// item of an union as a memory place -//////////////////////////////////////////////////////////////////////////////// - -TEST_F(MemoryPlaceTest, -ArtificialUnionItemTest) -{ - MemoryPlace m("union.item", true); - EXPECT_EQ("union.item", m.asString()); - EXPECT_TRUE(m.isArtificial()); -} - -TEST_F(MemoryPlaceTest, -UnionItemTest) -{ - MemoryPlace m("union.item", false); - EXPECT_EQ("union.item", m.asString()); - EXPECT_FALSE(m.isArtificial()); -} - -//////////////////////////////////////////////////////////////////////////////// -// element of an array as a memory place -//////////////////////////////////////////////////////////////////////////////// - -TEST_F(MemoryPlaceTest, -ArtificialArrayElementTest) -{ - MemoryPlace m("array[0]", true); - EXPECT_EQ("array[0]", m.asString()); - EXPECT_TRUE(m.isArtificial()); -} - -TEST_F(MemoryPlaceTest, -ArrayElementTest) -{ - MemoryPlace m("array[0]", false); - EXPECT_EQ("array[0]", m.asString()); - EXPECT_FALSE(m.isArtificial()); -} - -//////////////////////////////////////////////////////////////////////////////// -// representsElementOfArray -//////////////////////////////////////////////////////////////////////////////// - -TEST_F(MemoryPlaceTest, -RepresentsElementOfArrayOfElementOfArrayWorksCorrectly) -{ - MemoryPlace m("array[]", false); - EXPECT_TRUE(m.representsElementOfArray()); -} - -TEST_F(MemoryPlaceTest, -RepresentsElementOfArrayOfElementOfArrayNestedInStructureWorksCorrectly) -{ - MemoryPlace m("struct.array[].item", false); - EXPECT_TRUE(m.representsElementOfArray()); -} - -TEST_F(MemoryPlaceTest, -RepresentsElementOfArrayOfVariableWorksCorrectly) -{ - MemoryPlace m("var", false); - EXPECT_FALSE(m.representsElementOfArray()); -} - -TEST_F(MemoryPlaceTest, -RepresentsElementOfArrayOfStructureItemWorksCorrectly) -{ - MemoryPlace m("struct.var", false); - EXPECT_FALSE(m.representsElementOfArray()); -} - - -int main(int argc, char *argv[]) -{ - ::testing::InitGoogleTest(&argc, argv); - return RUN_ALL_TESTS(); -} - diff --git a/vra/tests-unit/NumberTest.cc b/vra/tests-unit/NumberTest.cc deleted file mode 100644 index b8e0f641f..000000000 --- a/vra/tests-unit/NumberTest.cc +++ /dev/null @@ -1,2962 +0,0 @@ -/** -* @author Daniela Ďuričeková, xduric00@stud.fit.vutbr.cz -* @file NumberTest.cc -* @brief Test class for class Number. -* @date 2012 -*/ - -#include -#include -#include -#include -#include -#include -#include -#include "Number.h" -#include "gtest/gtest.h" - -using namespace std; - -// Minimal values -template T vmin() { return numeric_limits::min(); } -template <> float vmin() { return -numeric_limits::max(); } -template <> double vmin() { return -numeric_limits::max(); } -template <> long double vmin() { return -numeric_limits::max(); } - -// Maximal values -template T vmax() { return numeric_limits::max(); } - -// Number (int or float) -typedef Number N; - -// Int -template -Number I(T val) { return Number(val, sizeof(T), vmin() != 0); } - -// Float -template -Number F(T val) { return Number(val, sizeof(T)); } - -class NumberTest : public ::testing::Test -{ - protected: - NumberTest() {} - - virtual ~NumberTest() {} - - virtual void SetUp() {} - - virtual void TearDown() {} -}; - -//////////////////////////////////////////////////////////////////////////////// -// assign() -//////////////////////////////////////////////////////////////////////////////// - -TEST_F(NumberTest, -AssignOfIntIntoIntOfSameTypeResultsIntoCorrectNumber) -{ - EXPECT_EQ(I(1), - I(0).assign(I(1))); - EXPECT_EQ(I(1), - I(0).assign(I(1))); - EXPECT_EQ(I(1), - I(0).assign(I(1))); - EXPECT_EQ(I(1), - I(0).assign(I(1))); - EXPECT_EQ(I(1), - I(0).assign(I(1))); - EXPECT_EQ(I(1), - I(0).assign(I(1))); - - EXPECT_EQ(I(vmin()), - I(0).assign(I(vmin()))); - EXPECT_EQ(I(vmax()), - I(0).assign(I(vmax()))); -} - -TEST_F(NumberTest, -AssignOfIntIntoIntOfDifferentTypeResultsIntoCorrectNumber) -{ - EXPECT_EQ(I(vmin()), - I(0).assign(I(vmin()))); - EXPECT_EQ(I(vmin()), - I(0).assign(I(vmin()))); - EXPECT_EQ(I(-1), - I(0).assign(I(-1))); - EXPECT_EQ(I(0), - I(0).assign(I(0))); - EXPECT_EQ(I(1), - I(0).assign(I(1))); - EXPECT_EQ(I(vmax()), - I(0).assign(I(vmax()))); - EXPECT_EQ(I(vmax()), - I(0).assign(I(vmax()))); -} - -TEST_F(NumberTest, -AssignOfSignedIntoIntoUnsignedIntResultsIntoCorrectNumber) -{ - EXPECT_EQ(I(-1), - I(0).assign(I(-1))); -} - -TEST_F(NumberTest, -AssignOfFloatIntoFloatOfSameTypeResultsIntoCorrectNumber) -{ - EXPECT_EQ(F(1e30f), - F(0).assign(F(1e30f))); - EXPECT_EQ(F(1e100), - F(0).assign(F(1e100))); - EXPECT_EQ(F(1e400L), - F(0).assign(F(1e400L))); - - EXPECT_EQ(F(INFINITY), - F(0).assign(F(1e50))); - EXPECT_EQ(F(INFINITY), - F(0).assign(F(1e400L))); - - EXPECT_EQ(F(-INFINITY), - F(0).assign(F(-INFINITY))); - EXPECT_EQ(F(INFINITY), - F(0).assign(F(INFINITY))); - EXPECT_TRUE(F(0).assign(F(NAN)).isNotNumber()); - - EXPECT_EQ(F(-INFINITY), - F(0).assign(F(-INFINITY))); - EXPECT_EQ(F(INFINITY), - F(0).assign(F(INFINITY))); - EXPECT_TRUE(F(0).assign(F(NAN)).isNotNumber()); - - EXPECT_EQ(F(-INFINITY), - F(0).assign(F(-INFINITY))); - EXPECT_EQ(F(INFINITY), - F(0).assign(F(INFINITY))); - EXPECT_TRUE(F(0).assign(F(NAN)).isNotNumber()); -} - -TEST_F(NumberTest, -AssignOfFloatIntoFloatOfDifferentTypeResultsIntoCorrectNumber) -{ - EXPECT_EQ(F(-INFINITY), - F(0).assign(F(-INFINITY))); - EXPECT_EQ(F(-INFINITY), - F(0).assign(F(-1e200))); - EXPECT_EQ(F(-INFINITY), - F(0).assign(F(-1e40))); - EXPECT_EQ(F(-1e20), - F(0).assign(F(-1e20))); - EXPECT_EQ(F(0.0), - F(0).assign(F(0.0))); - EXPECT_EQ(F(1e20), - F(0).assign(F(1e20))); - EXPECT_EQ(F(INFINITY), - F(0).assign(F(1e40))); - EXPECT_EQ(F(INFINITY), - F(0).assign(F(1e200))); - EXPECT_EQ(F(INFINITY), - F(0).assign(F(INFINITY))); - EXPECT_TRUE(F(0).assign(F(NAN)).isNotNumber()); - - EXPECT_EQ(F(-INFINITY), - F(0).assign(F(-INFINITY))); - EXPECT_EQ(F(-INFINITY), - F(0).assign(F(-1e400L))); - EXPECT_EQ(F(-1e200), - F(0).assign(F(-1e200L))); - EXPECT_EQ(F(0.0), - F(0).assign(F(0.0))); - EXPECT_EQ(F(1e200), - F(0).assign(F(1e200L))); - EXPECT_EQ(F(INFINITY), - F(0).assign(F(1e400L))); - EXPECT_EQ(F(INFINITY), - F(0).assign(F(INFINITY))); - EXPECT_TRUE(F(0).assign(F(NAN)).isNotNumber()); -} - -TEST_F(NumberTest, -AssignOfFloatIntoIntResultsIntoCorrectNumber) -{ - // All floating-point numbers outside the range get - // converted to INT_MIN (see the comment in Number::assign()). - EXPECT_EQ(I(vmin()), - I(0).assign(F(-INFINITY))); - EXPECT_EQ(I(vmin()), - I(0).assign(F(vmin()))); - EXPECT_EQ(I(vmin()), - I(0).assign(F(-1e20))); - EXPECT_EQ(I(-10), - I(0).assign(F(-10.4))); - EXPECT_EQ(I(0), - I(0).assign(F(0.0))); - EXPECT_EQ(I(10), - I(0).assign(F(10.4))); - EXPECT_EQ(I(vmin()), - I(0).assign(F(1e20))); - EXPECT_EQ(I(vmin()), - I(0).assign(F(vmax()))); - EXPECT_EQ(I(vmin()), - I(0).assign(F(INFINITY))); - EXPECT_EQ(I(vmin()), - I(0).assign(F(NAN))); -} - -TEST_F(NumberTest, -AssignOfIntIntoFloatResultsIntoCorrectNumber) -{ - // static_cast<> is used to suppress a warning - EXPECT_EQ(F(0.0), - I(0).assign(F(0))); -} - -//////////////////////////////////////////////////////////////////////////////// -// isIntegral() -//////////////////////////////////////////////////////////////////////////////// - -TEST_F(NumberTest, -IntegralNumberIsIntegral) -{ - EXPECT_TRUE(I(0).isIntegral()); - EXPECT_TRUE(I(0).isIntegral()); - EXPECT_TRUE(I(0).isIntegral()); - EXPECT_TRUE(I(0).isIntegral()); - EXPECT_TRUE(I(0).isIntegral()); - EXPECT_TRUE(I(0).isIntegral()); - EXPECT_TRUE(I(0).isIntegral()); - EXPECT_TRUE(I(0).isIntegral()); -} - -TEST_F(NumberTest, -FloatingPointNumberIsNotIntegral) -{ - EXPECT_FALSE(F(0).isIntegral()); - EXPECT_FALSE(F(0).isIntegral()); - EXPECT_FALSE(F(0).isIntegral()); -} - -//////////////////////////////////////////////////////////////////////////////// -// isFloatingPoint() -//////////////////////////////////////////////////////////////////////////////// - -TEST_F(NumberTest, -IntegralNumberIsNotFloatingPoint) -{ - EXPECT_FALSE(I(0).isFloatingPoint()); - EXPECT_FALSE(I(0).isFloatingPoint()); - EXPECT_FALSE(I(0).isFloatingPoint()); - EXPECT_FALSE(I(0).isFloatingPoint()); - EXPECT_FALSE(I(0).isFloatingPoint()); - EXPECT_FALSE(I(0).isFloatingPoint()); - EXPECT_FALSE(I(0).isFloatingPoint()); - EXPECT_FALSE(I(0).isFloatingPoint()); -} - -TEST_F(NumberTest, -FloatingPointNumberIsFloatingPoint) -{ - EXPECT_TRUE(F(0).isFloatingPoint()); - EXPECT_TRUE(F(0).isFloatingPoint()); - EXPECT_TRUE(F(0).isFloatingPoint()); -} - -//////////////////////////////////////////////////////////////////////////////// -// isSigned() -//////////////////////////////////////////////////////////////////////////////// - -TEST_F(NumberTest, -SignedIntegralNumberIsSigned) -{ - EXPECT_TRUE(I(0).isSigned()); - EXPECT_TRUE(I(0).isSigned()); - EXPECT_TRUE(I(0).isSigned()); - EXPECT_TRUE(I(0).isSigned()); -} - -TEST_F(NumberTest, -UnsignedIntegralNumberIsNotSigned) -{ - EXPECT_FALSE(I(0).isSigned()); - EXPECT_FALSE(I(0).isSigned()); - EXPECT_FALSE(I(0).isSigned()); - EXPECT_FALSE(I(0).isSigned()); -} - -TEST_F(NumberTest, -FloatingPointNumberIsNotSigned) -{ - EXPECT_FALSE(F(0).isSigned()); - EXPECT_FALSE(F(0).isSigned()); - EXPECT_FALSE(F(0).isSigned()); -} - -//////////////////////////////////////////////////////////////////////////////// -// isUnsigned() -//////////////////////////////////////////////////////////////////////////////// - -TEST_F(NumberTest, -UnsignedIntegralNumberIsUnsigned) -{ - EXPECT_TRUE(I(0).isUnsigned()); - EXPECT_TRUE(I(0).isUnsigned()); - EXPECT_TRUE(I(0).isUnsigned()); - EXPECT_TRUE(I(0).isUnsigned()); -} - -TEST_F(NumberTest, -SignedIntegralNumberIsNotUnsigned) -{ - EXPECT_FALSE(I(0).isUnsigned()); - EXPECT_FALSE(I(0).isUnsigned()); - EXPECT_FALSE(I(0).isUnsigned()); - EXPECT_FALSE(I(0).isUnsigned()); -} - -TEST_F(NumberTest, -FloatingPointNumberIsNotUnsigned) -{ - EXPECT_FALSE(F(0).isUnsigned()); - EXPECT_FALSE(F(0).isUnsigned()); - EXPECT_FALSE(F(0).isUnsigned()); -} - -//////////////////////////////////////////////////////////////////////////////// -// isInf() -//////////////////////////////////////////////////////////////////////////////// - -TEST_F(NumberTest, -FloatingPointInfinityIsInfinity) -{ - EXPECT_TRUE(F(INFINITY).isInf()); - EXPECT_TRUE(F(-INFINITY).isInf()); - EXPECT_TRUE(F(INFINITY).isInf()); - EXPECT_TRUE(F(-INFINITY).isInf()); - EXPECT_TRUE(F(INFINITY).isInf()); - EXPECT_TRUE(F(-INFINITY).isInf()); -} - -TEST_F(NumberTest, -NonInfinityFloatingPointIsNotInfinity) -{ - EXPECT_FALSE(F(NAN).isInf()); - EXPECT_FALSE(F(vmin()).isInf()); - EXPECT_FALSE(F(vmax()).isInf()); -} - -TEST_F(NumberTest, -IntegralNumberIsNotInfinity) -{ - EXPECT_FALSE(I(vmin()).isInf()); - EXPECT_FALSE(I(vmax()).isInf()); - EXPECT_FALSE(I(vmin()).isInf()); - EXPECT_FALSE(I(vmax()).isInf()); -} - -//////////////////////////////////////////////////////////////////////////////// -// isNegativeInf() -//////////////////////////////////////////////////////////////////////////////// - -TEST_F(NumberTest, -NegativeFloatingPointInfinityIsNegativeInfinity) -{ - EXPECT_TRUE(F(-INFINITY).isNegativeInf()); - EXPECT_TRUE(F(-INFINITY).isNegativeInf()); - EXPECT_TRUE(F(-INFINITY).isNegativeInf()); -} - -TEST_F(NumberTest, -PositiveFloatingPointInfinityIsNotNegativeInfinity) -{ - EXPECT_FALSE(F(INFINITY).isNegativeInf()); - EXPECT_FALSE(F(INFINITY).isNegativeInf()); - EXPECT_FALSE(F(INFINITY).isNegativeInf()); -} - -TEST_F(NumberTest, -NonInfinityFloatingPointIsNotNegativeInfinity) -{ - EXPECT_FALSE(F(NAN).isNegativeInf()); - EXPECT_FALSE(F(vmin()).isNegativeInf()); - EXPECT_FALSE(F(vmax()).isNegativeInf()); -} - -TEST_F(NumberTest, -IntegralNumberIsNotNegativeInfinity) -{ - EXPECT_FALSE(I(vmin()).isNegativeInf()); - EXPECT_FALSE(I(vmax()).isNegativeInf()); - EXPECT_FALSE(I(vmin()).isNegativeInf()); - EXPECT_FALSE(I(vmax()).isNegativeInf()); -} - -//////////////////////////////////////////////////////////////////////////////// -// isPositiveInf() -//////////////////////////////////////////////////////////////////////////////// - -TEST_F(NumberTest, -PositiveFloatingPointInfinityIsPositiveInfinity) -{ - EXPECT_TRUE(F(INFINITY).isPositiveInf()); - EXPECT_TRUE(F(INFINITY).isPositiveInf()); - EXPECT_TRUE(F(INFINITY).isPositiveInf()); -} - -TEST_F(NumberTest, -NegativeFloatingPointInfinityIsNotPositiveInfinity) -{ - EXPECT_FALSE(F(-INFINITY).isPositiveInf()); - EXPECT_FALSE(F(-INFINITY).isPositiveInf()); - EXPECT_FALSE(F(-INFINITY).isPositiveInf()); -} - -TEST_F(NumberTest, -NonInfinityFloatingPointIsNotPositiveInfinity) -{ - EXPECT_FALSE(F(NAN).isPositiveInf()); - EXPECT_FALSE(F(vmin()).isPositiveInf()); - EXPECT_FALSE(F(vmax()).isPositiveInf()); -} - -TEST_F(NumberTest, -IntegralNumberIsNotPositiveInfinity) -{ - EXPECT_FALSE(I(vmin()).isPositiveInf()); - EXPECT_FALSE(I(vmax()).isPositiveInf()); - EXPECT_FALSE(I(vmin()).isPositiveInf()); - EXPECT_FALSE(I(vmax()).isPositiveInf()); -} - -//////////////////////////////////////////////////////////////////////////////// -// isNotNumber() -//////////////////////////////////////////////////////////////////////////////// - -TEST_F(NumberTest, -NANIsNotNumber) -{ - EXPECT_TRUE(F(NAN).isNotNumber()); - EXPECT_TRUE(F(-NAN).isNotNumber()); - EXPECT_TRUE(F(NAN).isNotNumber()); - EXPECT_TRUE(F(-NAN).isNotNumber()); - EXPECT_TRUE(F(NAN).isNotNumber()); - EXPECT_TRUE(F(-NAN).isNotNumber()); -} - -TEST_F(NumberTest, -NonNANNumberIsNotNotNumber) -{ - EXPECT_FALSE(F(-INFINITY).isNotNumber()); - EXPECT_FALSE(F(-INFINITY).isNotNumber()); - EXPECT_FALSE(F(-INFINITY).isNotNumber()); - EXPECT_FALSE(I(vmin()).isNotNumber()); - EXPECT_FALSE(I(vmax()).isNotNumber()); - EXPECT_FALSE(I(vmin()).isNotNumber()); - EXPECT_FALSE(I(vmax()).isNotNumber()); -} - -//////////////////////////////////////////////////////////////////////////////// -// isNumber() -//////////////////////////////////////////////////////////////////////////////// - -TEST_F(NumberTest, -IsNumberWorksCorrectly) -{ - EXPECT_TRUE((Number(1, sizeof(char), true)).isNumber()); - EXPECT_TRUE((Number(1, sizeof(float))).isNumber()); - EXPECT_FALSE(Number(INFINITY, sizeof(double)).isNumber()); - EXPECT_FALSE(Number(-INFINITY, sizeof(double)).isNumber()); - EXPECT_FALSE(Number(NAN, sizeof(double)).isNumber()); -} - -//////////////////////////////////////////////////////////////////////////////// -// isMin() -//////////////////////////////////////////////////////////////////////////////// - -TEST_F(NumberTest, -MinimalNumberIsMin) -{ - EXPECT_TRUE(I(vmin()).isMin()); - EXPECT_TRUE(I(vmin()).isMin()); - EXPECT_TRUE(I(vmin()).isMin()); - EXPECT_TRUE(I(vmin()).isMin()); - EXPECT_TRUE(I(vmin()).isMin()); - EXPECT_TRUE(I(vmin()).isMin()); - EXPECT_TRUE(I(vmin()).isMin()); - EXPECT_TRUE(I(vmin()).isMin()); - EXPECT_TRUE(F(vmin()).isMin()); - EXPECT_TRUE(F(vmin()).isMin()); - EXPECT_TRUE(F(vmin()).isMin()); -} - -TEST_F(NumberTest, -NotMinimalNumberIsNotMin) -{ - EXPECT_FALSE(I(-127).isMin()); - EXPECT_FALSE(I(1).isMin()); - EXPECT_FALSE(I(0).isMin()); - EXPECT_FALSE(I(vmax()).isMin()); - EXPECT_FALSE(F(0.0).isMin()); - EXPECT_FALSE(F(-NAN).isMin()); - EXPECT_FALSE(F(-INFINITY).isMin()); -} - -//////////////////////////////////////////////////////////////////////////////// -// isMax() -//////////////////////////////////////////////////////////////////////////////// - -TEST_F(NumberTest, -MaximalNumberIsMax) -{ - EXPECT_TRUE(I(vmax()).isMax()); - EXPECT_TRUE(I(vmax()).isMax()); - EXPECT_TRUE(I(vmax()).isMax()); - EXPECT_TRUE(I(vmax()).isMax()); - EXPECT_TRUE(I(vmax()).isMax()); - EXPECT_TRUE(I(vmax()).isMax()); - EXPECT_TRUE(I(vmax()).isMax()); - EXPECT_TRUE(I(vmax()).isMax()); - EXPECT_TRUE(F(vmax()).isMax()); - EXPECT_TRUE(F(vmax()).isMax()); - EXPECT_TRUE(F(vmax()).isMax()); -} - -TEST_F(NumberTest, -NotMaximalNumberIsNotMax) -{ - EXPECT_FALSE(I(126).isMax()); - EXPECT_FALSE(I(1).isMax()); - EXPECT_FALSE(I(vmin()).isMax()); - EXPECT_FALSE(I(0).isMax()); - EXPECT_FALSE(F(0.0).isMax()); - EXPECT_FALSE(F(NAN).isMax()); - EXPECT_FALSE(F(INFINITY).isMax()); -} - -//////////////////////////////////////////////////////////////////////////////// -// getEpsilon() -//////////////////////////////////////////////////////////////////////////////// - -TEST_F(NumberTest, -GetLowestFloatingPointReturnsCorrectValue) -{ - EXPECT_EQ(I(1), I(0).getEpsilon()); - EXPECT_EQ(I(1), I(0).getEpsilon()); - EXPECT_EQ(I(1), I(0).getEpsilon()); - - EXPECT_EQ(F(std::numeric_limits::min()), - F(0).getEpsilon()); - EXPECT_EQ(F(std::numeric_limits::min()), - F(0).getEpsilon()); - EXPECT_EQ(F(std::numeric_limits::min()), - F(0).getEpsilon()); -} - -//////////////////////////////////////////////////////////////////////////////// -// getMin() -//////////////////////////////////////////////////////////////////////////////// - -TEST_F(NumberTest, -GetMinReturnsCorrectlyMinValue) -{ - EXPECT_EQ(I(vmin()), I(0).getMin()); - EXPECT_EQ(I(vmin()), I(0).getMin()); - EXPECT_EQ(I(vmin()), I(0).getMin()); - EXPECT_EQ(I(vmin()), I(0).getMin()); - EXPECT_EQ(F(vmin()), F(0).getMin()); - EXPECT_EQ(F(vmin()), F(0).getMin()); - EXPECT_EQ(F(vmin()), - F(0).getMin()); -} - -//////////////////////////////////////////////////////////////////////////////// -// getMax() -//////////////////////////////////////////////////////////////////////////////// - -TEST_F(NumberTest, -GetMaxReturnsCorrectlyMaxValue) -{ - EXPECT_EQ(I(vmax()), I(0).getMax()); - EXPECT_EQ(I(vmax()), I(0).getMax()); - EXPECT_EQ(I(vmax()), I(0).getMax()); - EXPECT_EQ(I(vmax()), I(0).getMax()); - EXPECT_EQ(F(vmax()), F(0).getMax()); - EXPECT_EQ(F(vmax()), F(0).getMax()); - EXPECT_EQ(F(vmax()), - F(0).getMax()); -} - -//////////////////////////////////////////////////////////////////////////////// -// getNan() -//////////////////////////////////////////////////////////////////////////////// - -TEST_F(NumberTest, -GetNanOfIntegralNumberReturnsNanCorrectly) -{ - EXPECT_DEATH((I(vmax())).getNan(), ".*isFloatingPoint().*"); -} - -TEST_F(NumberTest, -GetNanOfFloatingPointNumberReturnsNanCorrectly) -{ - EXPECT_TRUE(((F(vmax())).getNan()).isNotNumber()); -} - -//////////////////////////////////////////////////////////////////////////////// -// getPositiveInf() -//////////////////////////////////////////////////////////////////////////////// - -TEST_F(NumberTest, -GetPositiveInfOfIntegralNumberReturnsPositiveInfCorrectly) -{ - EXPECT_DEATH((I(vmin())).getPositiveInf(), ".*isFloatingPoint().*"); -} - -TEST_F(NumberTest, -GetPositiveInfOfFloatingPointNumberReturnsPositiveInfCorrectly) -{ - EXPECT_EQ(F(INFINITY), (F(vmin())).getPositiveInf()); -} - -//////////////////////////////////////////////////////////////////////////////// -// getNegativeInf() -//////////////////////////////////////////////////////////////////////////////// - -TEST_F(NumberTest, -GetNegativeInfOfIntegralNumberReturnsNegativeInfCorrectly) -{ - EXPECT_DEATH((I(vmax())).getNegativeInf(), ".*isFloatingPoint().*"); -} - -TEST_F(NumberTest, -GetNegativeInfOfFloatingPointNumberReturnsNegativeInfCorrectly) -{ - EXPECT_EQ(F(-INFINITY), (F(vmin())).getNegativeInf()); -} - -//////////////////////////////////////////////////////////////////////////////// -// getInt() -//////////////////////////////////////////////////////////////////////////////// - -TEST_F(NumberTest, -GetIntOfIntegralNumberWorksCorrectly) -{ - EXPECT_EQ(mpz_class(vmin()), (I(vmin())).getInt()); -} - -TEST_F(NumberTest, -GetIntOfFloatingPointNumberWorksCorrectly) -{ - EXPECT_DEATH((F(vmin())).getInt(), ".*isIntegral().*"); -} - -//////////////////////////////////////////////////////////////////////////////// -// getFloat() -//////////////////////////////////////////////////////////////////////////////// -TEST_F(NumberTest, -GetFloatOfIntegralNumberWorksCorrectly) -{ - EXPECT_DEATH((I(vmin())).getFloat(), ".*isFloatingPoint().*"); -} - -TEST_F(NumberTest, -GetFloatOfFloatingPointNumberWorksCorrectly) -{ - EXPECT_EQ(vmin(), (F(vmin())).getFloat()); -} - -//////////////////////////////////////////////////////////////////////////////// -// getBitWidth() -//////////////////////////////////////////////////////////////////////////////// - -TEST_F(NumberTest, -GetBitWidthWorksCorrectly) -{ - EXPECT_EQ(sizeof(char), (Number(1, sizeof(char), true)).getBitWidth()); - EXPECT_EQ(sizeof(short), (Number(1, sizeof(short), false)).getBitWidth()); - EXPECT_EQ(sizeof(int), (Number(1, sizeof(int), true)).getBitWidth()); - EXPECT_EQ(sizeof(long), (Number(1, sizeof(long), false)).getBitWidth()); - - EXPECT_EQ(sizeof(float), (Number(1.0, sizeof(float))).getBitWidth()); - EXPECT_EQ(sizeof(double), (Number(1.0, sizeof(double))).getBitWidth()); - EXPECT_EQ(sizeof(long double), (Number(1.0, sizeof(long double))).getBitWidth()); -} - -//////////////////////////////////////////////////////////////////////////////// -// getNumOfBits() -//////////////////////////////////////////////////////////////////////////////// - -TEST_F(NumberTest, -GetNumOfBitsWorksCorrectly) -{ - EXPECT_EQ(sizeof(char) * CHAR_BIT, (Number(1, sizeof(char), true)).getNumOfBits()); - EXPECT_EQ(sizeof(short) * CHAR_BIT, (Number(1, sizeof(short), false)).getNumOfBits()); - EXPECT_EQ(sizeof(int) * CHAR_BIT, (Number(1, sizeof(int), true)).getNumOfBits()); - EXPECT_EQ(sizeof(long) * CHAR_BIT, (Number(1, sizeof(long), false)).getNumOfBits()); - - EXPECT_EQ(sizeof(float) * CHAR_BIT, (Number(1.0, sizeof(float))).getNumOfBits()); - EXPECT_EQ(sizeof(double) * CHAR_BIT, (Number(1.0, sizeof(double))).getNumOfBits()); - EXPECT_EQ(sizeof(long double) * CHAR_BIT, (Number(1.0, sizeof(long double))).getNumOfBits()); -} - -//////////////////////////////////////////////////////////////////////////////// -// getSign() -//////////////////////////////////////////////////////////////////////////////// - -TEST_F(NumberTest, -GetSignOfIntegralNumberWorksCorrectly) -{ - EXPECT_TRUE((Number(1, sizeof(char), true)).getSign()); - EXPECT_FALSE((Number(1, sizeof(short), false)).getSign()); - EXPECT_TRUE((Number(1, sizeof(int), true)).getSign()); - EXPECT_FALSE((Number(1, sizeof(long), false)).getSign()); - - EXPECT_DEATH((Number(1.0, sizeof(float))).getSign(), ".*isIntegral().*"); - EXPECT_DEATH((Number(1.0, sizeof(double))).getSign(), ".*isIntegral().*"); - EXPECT_DEATH((Number(1.0, sizeof(long double))).getSign(), ".*isIntegral().*"); -} - -//////////////////////////////////////////////////////////////////////////////// -// floatToInt() -//////////////////////////////////////////////////////////////////////////////// - -TEST_F(NumberTest, -FloatToIntConversionWorksCorrectly) -{ - EXPECT_EQ(mpz_class(1), Number::floatToInt(1.35)); - EXPECT_EQ(mpz_class(1), Number::floatToInt(1.99)); - // TODO: append test for inf, -inf, nan, too large float - // EXPECT_EQ(mpz_class(?), Number::floatToInt(INFINITY)); - // EXPECT_EQ(mpz_class(?), Number::floatToInt(-INFINITY)); - // EXPECT_EQ(mpz_class(?), Number::floatToInt(NAN)); - // EXPECT_EQ(mpz_class(?), Number::floatToInt(F(vmax()))); -} - -//////////////////////////////////////////////////////////////////////////////// -// ==, != -//////////////////////////////////////////////////////////////////////////////// - -TEST_F(NumberTest, -IntsWithSameValueAndBitWidthAndSignessAreEqual) -{ - EXPECT_EQ(I(vmin()), - I(vmin())); - EXPECT_EQ(I(-1), I(-1)); - EXPECT_EQ(I(1), I(1)); - EXPECT_EQ(I(vmax()), I(vmax())); -} - -TEST_F(NumberTest, -IntsWithSameValueAndBitWidthButDifferentSignessAreEqual) -{ - EXPECT_EQ(I(0), I(0)); - EXPECT_EQ(I(1), I(1)); - EXPECT_EQ(I(2), I(2)); - EXPECT_EQ(I(-1), I(vmax())); - EXPECT_EQ(I(vmax()), I(vmax())); -} - -TEST_F(NumberTest, -IntsWithSameValueAndSignessButDifferentBitWidthAreEqual) -{ - EXPECT_EQ(I(vmin()), - I(vmin())); - EXPECT_EQ(I(-1), I(-1)); - EXPECT_EQ(I(1), I(1)); -} - -TEST_F(NumberTest, -IntsWithSameValueButDifferentBitWidthAndSignessAreEqual) -{ - EXPECT_EQ(I(0), I(0)); - EXPECT_EQ(I(1), I(1)); - EXPECT_EQ(I(vmax()), I(vmax())); -} - -TEST_F(NumberTest, -IntsWithDifferentValueAreNotEqual) -{ - EXPECT_NE(I(-10), I(-9)); - EXPECT_NE(I(-1), I(1)); - EXPECT_NE(I(vmin()), I(vmax())); - EXPECT_NE(I(10), I(0)); -} - -TEST_F(NumberTest, -FloatsWithSameValueAndBitWidthAreEqual) -{ - EXPECT_EQ(F(-1), F(-1)); - EXPECT_EQ(F(-INFINITY), F(-INFINITY)); - EXPECT_EQ(F(INFINITY), F(INFINITY)); - - EXPECT_EQ(F(0), F(0)); - EXPECT_EQ(F(-INFINITY), F(-INFINITY)); - EXPECT_EQ(F(INFINITY), F(INFINITY)); - - EXPECT_EQ(F(1), F(1)); - EXPECT_EQ(F(-INFINITY), F(-INFINITY)); - EXPECT_EQ(F(INFINITY), F(INFINITY)); -} - -TEST_F(NumberTest, -FloatsWithSameValueButDifferentBitWidthAreEqual) -{ - EXPECT_EQ(F(-1), F(-1)); - EXPECT_EQ(F(-INFINITY), F(-INFINITY)); - EXPECT_EQ(F(INFINITY), F(INFINITY)); - - EXPECT_EQ(F(0), F(0)); - EXPECT_EQ(F(-INFINITY), F(-INFINITY)); - EXPECT_EQ(F(INFINITY), F(INFINITY)); - - EXPECT_EQ(F(1), F(1)); - EXPECT_EQ(F(-INFINITY), F(-INFINITY)); - EXPECT_EQ(F(INFINITY), F(INFINITY)); -} - -TEST_F(NumberTest, -FloatsWithDifferentValueAreNotEqual) -{ - EXPECT_NE(F(-10.6), F(0)); - EXPECT_NE(F(vmin()), F(-INFINITY)); - EXPECT_NE(F(vmax()), F(INFINITY)); - - EXPECT_NE(F(20.678), F(-45)); - EXPECT_NE(F(vmin()), F(-INFINITY)); - EXPECT_NE(F(vmax()), F(INFINITY)); - - EXPECT_NE(F(-14.125), F(14.125)); - EXPECT_NE(F(vmin()), F(-INFINITY)); - EXPECT_NE(F(vmax()), F(INFINITY)); -} - -TEST_F(NumberTest, -NanIsNotEqualToAnythingElse) -{ - EXPECT_NE(F(NAN), F(vmin())); - EXPECT_NE(F(NAN), F(vmax())); - EXPECT_NE(F(NAN), F(NAN)); - EXPECT_NE(F(NAN), F(-INFINITY)); - EXPECT_NE(F(NAN), F(INFINITY)); - - EXPECT_NE(F(NAN), F(vmin())); - EXPECT_NE(F(NAN), F(vmax())); - EXPECT_NE(F(NAN), F(NAN)); - EXPECT_NE(F(NAN), F(-INFINITY)); - EXPECT_NE(F(NAN), F(INFINITY)); - - EXPECT_NE(F(NAN), F(vmin())); - EXPECT_NE(F(NAN), F(vmax())); - EXPECT_NE(F(NAN), F(NAN)); - EXPECT_NE(F(NAN), F(-INFINITY)); - EXPECT_NE(F(NAN), F(INFINITY)); -} - -//////////////////////////////////////////////////////////////////////////////// -// promotion -//////////////////////////////////////////////////////////////////////////////// - -// We use unary minus and getMax() to test the promotion. - -TEST_F(NumberTest, -CharIsPromotedToInt) -{ - EXPECT_EQ(I(vmax()), (-I(0)).getMax()); - EXPECT_EQ(I(vmax()), (-I(0)).getMax()); -} - -TEST_F(NumberTest, -ShortIsPromotedToIntIfItIsOfLowerBitWidthThanInt) -{ - if (sizeof(short) < sizeof(int)) { - EXPECT_EQ(I(vmax()), (-I(0)).getMax()); - EXPECT_EQ(I(vmax()), (-I(0)).getMax()); - } else { - EXPECT_EQ(I(vmax()), (-I(0)).getMax()); - EXPECT_EQ(I(vmax()), - (-I(0)).getMax()); - } -} - -TEST_F(NumberTest, -IntDoesNotGetPromotedToAnythingElse) -{ - EXPECT_EQ(I(vmax()), (-I(0)).getMax()); - EXPECT_EQ(I(vmax()), - (-I(0)).getMax()); -} - -TEST_F(NumberTest, -LongDoesNotGetPromotedToAnythingElse) -{ - EXPECT_EQ(I(vmax()), (-I(0)).getMax()); - EXPECT_EQ(I(vmax()), - (-I(0)).getMax()); -} - -TEST_F(NumberTest, -FloatsDoNotGetPromotedToAnything) -{ - EXPECT_EQ(F(vmax()), (-F(0)).getMax()); - EXPECT_EQ(F(vmax()), (-F(0)).getMax()); - EXPECT_EQ(F(vmax()), - (-F(0)).getMax()); -} - -//////////////////////////////////////////////////////////////////////////////// -// extension -//////////////////////////////////////////////////////////////////////////////// - -TEST_F(NumberTest, -CharOpCharResultsIntoSignedInt) -{ - EXPECT_EQ(I(vmax()), - (I(0) + I(0)).getMax()); - - EXPECT_EQ(I(vmax()), - (I(0) + I(0)).getMax()); -} - -TEST_F(NumberTest, -SignedShortOpSignedShortResultsIntoSignedInt) -{ - EXPECT_EQ(I(vmax()), - (I(0) + I(0)).getMax()); -} - -TEST_F(NumberTest, -UnsignedShortOpUnsignedShortResultsInEitherIntOrUnsignedInt) -{ - Number n((I(0) + I(0)).getMax()); - if (sizeof(short) < sizeof(int)) { - EXPECT_EQ(I(vmax()), n); - } else { - EXPECT_EQ(I(vmax()), n); - } -} - -TEST_F(NumberTest, -SignedIntOpUnsignedIntResultsIntoUnsignedInt) -{ - EXPECT_EQ(I(vmax()), - (I(0) + I(0)).getMax()); -} - -TEST_F(NumberTest, -SignedIntOpSignedIntResultsIntoSignedInt) -{ - EXPECT_EQ(I(vmax()), - (I(0) + I(0)).getMax()); -} - -TEST_F(NumberTest, -UnsignedIntOpUnsignedIntResultsIntoUnsignedInt) -{ - EXPECT_EQ(I(vmax()), - (I(0) + I(0)).getMax()); -} - -TEST_F(NumberTest, -SignedIntOpSignedLongResultsIntoLong) -{ - EXPECT_EQ(I(vmax()), - (I(0) + I(0)).getMax()); -} - -TEST_F(NumberTest, -UnsignedIntOpSignedLongResultsIntoEitherSignedOrUnsignedLong) -{ - Number n((I(0) + I(0)).getMax()); - if (sizeof(int) < sizeof(long)) { - EXPECT_EQ(I(vmax()), n); - } else { - EXPECT_EQ(I(vmax()), n); - } -} - -TEST_F(NumberTest, -SignedLongOpSignedLongResultsIntoSignedLong) -{ - EXPECT_EQ(I(vmax()), - (I(0) + I(0)).getMax()); -} - -TEST_F(NumberTest, -SignedLongOpUnsignedLongResultsIntoUnsignedLong) -{ - EXPECT_EQ(I(vmax()), - (I(0) + I(0)).getMax()); -} - -TEST_F(NumberTest, -UnsignedLongOpUnsignedLongResultsIntoUnsignedLong) -{ - EXPECT_EQ(I(vmax()), - (I(0) + I(0)).getMax()); -} - -TEST_F(NumberTest, -IntOpFloatResultsIntoFloat) -{ - EXPECT_EQ(F(vmax()), - (I(0) + F(0)).getMax()); - - EXPECT_EQ(F(vmax()), - (I(0) + F(0)).getMax()); -} - -TEST_F(NumberTest, -IntOpDoubleResultsIntoDouble) -{ - EXPECT_EQ(F(vmax()), - (I(0) + F(0)).getMax()); - - EXPECT_EQ(F(vmax()), - (I(0) + F(0)).getMax()); -} - -TEST_F(NumberTest, -IntOpLongDoubleResultsIntoLongDouble) -{ - EXPECT_EQ(F(vmax()), - (I(0) + F(0)).getMax()); - - EXPECT_EQ(F(vmax()), - (I(0) + F(0)).getMax()); -} - -TEST_F(NumberTest, -FloatOpFloatResultsIntoFloat) -{ - EXPECT_EQ(F(vmax()), - (F(0) + F(0)).getMax()); -} - -TEST_F(NumberTest, -FloatOpDoubleResultsIntoDouble) -{ - EXPECT_EQ(F(vmax()), - (F(0) + F(0)).getMax()); -} - -TEST_F(NumberTest, -FloatOpLongDoubleResultsIntoLongDouble) -{ - EXPECT_EQ(F(vmax()), - (F(0) + F(0)).getMax()); -} - -TEST_F(NumberTest, -DoubleOpDoubleResultsIntoDouble) -{ - EXPECT_EQ(F(vmax()), - (F(0) + F(0)).getMax()); -} - -TEST_F(NumberTest, -DoubleOpLongDoubleResultsIntoLongDouble) -{ - EXPECT_EQ(F(vmax()), - (F(0) + F(0)).getMax()); -} - -TEST_F(NumberTest, -LongDoubleOpLongDoubleResultsIntoLongDouble) -{ - EXPECT_EQ(F(vmax()), - (F(0) + F(0)).getMax()); -} - -//////////////////////////////////////////////////////////////////////////////// -// - (unary) -//////////////////////////////////////////////////////////////////////////////// - -TEST_F(NumberTest, -NegatedZeroIsZero) -{ - EXPECT_EQ(I(0), -I(0)); - EXPECT_EQ(I(0), -I(0)); - EXPECT_EQ(I(0), -I(0)); - EXPECT_EQ(I(0), -I(0)); - EXPECT_EQ(F(0), -F(0)); - EXPECT_EQ(F(0), -F(0)); - EXPECT_EQ(F(0), -F(0)); -} - -TEST_F(NumberTest, -NegatedSignedIntGetsCorrectlyNegated) -{ - EXPECT_EQ(I(-1), -I(1)); - EXPECT_EQ(I(-1), -I(1)); - EXPECT_EQ(I(-1), -I(1)); - EXPECT_EQ(I(-1), -I(1)); - - EXPECT_EQ(I(-vmax()), - -I(vmax())); - EXPECT_EQ(I(-vmax()), -I(vmax())); - EXPECT_EQ(I(-vmax()), -I(vmax())); - EXPECT_EQ(I(-vmax()), -I(vmax())); -} - -TEST_F(NumberTest, -NegatedUnsignedIntIsStillUnsigned) -{ - // We do not test char and short because they are promoted to int. - - EXPECT_EQ(I(vmax()), -I(1)); - EXPECT_EQ(I(vmax()), -I(1)); - - EXPECT_EQ(I(vmin()), -I(vmin())); -} - -TEST_F(NumberTest, -NegatedMinimalSignedIntIsStillMinimalSignedInt) -{ - // We do not test char and short because they are promoted to int. - - EXPECT_EQ(I(vmin()), -I(vmin())); - EXPECT_EQ(I(vmin()), -I(vmin())); -} - -TEST_F(NumberTest, -NegatedFloatGetsCorrectlyNegated) -{ - EXPECT_EQ(F(-1), -F(1)); - EXPECT_EQ(F(1), -F(-1)); - EXPECT_EQ(F(-INFINITY), -F(INFINITY)); - EXPECT_EQ(F(INFINITY), -F(-INFINITY)); - - EXPECT_EQ(F(-1), -F(1)); - EXPECT_EQ(F(1), -F(-1)); - EXPECT_EQ(F(-INFINITY), -F(INFINITY)); - EXPECT_EQ(F(INFINITY), -F(-INFINITY)); - - EXPECT_EQ(F(-1), -F(1)); - EXPECT_EQ(F(1), -F(-1)); - EXPECT_EQ(F(-INFINITY), -F(INFINITY)); - EXPECT_EQ(F(INFINITY), -F(-INFINITY)); -} - -TEST_F(NumberTest, -NegatedNanIsStilNan) -{ - // Since NAN differs from everything (even from another NAN), we have to - // test this by checking that the result differs from any "reasonable" - // number (there is no time to check all non-NAN numbers). - - EXPECT_NE(F(-NAN), -F(NAN)); - EXPECT_NE(F(NAN), -F(-NAN)); - EXPECT_NE(F(INFINITY), -F(NAN)); - EXPECT_NE(F(-INFINITY), -F(NAN)); - EXPECT_NE(F(0), -F(NAN)); - - EXPECT_NE(F(-NAN), -F(NAN)); - EXPECT_NE(F(NAN), -F(-NAN)); - EXPECT_NE(F(INFINITY), -F(NAN)); - EXPECT_NE(F(-INFINITY), -F(NAN)); - EXPECT_NE(F(0), -F(NAN)); - - EXPECT_NE(F(-NAN), -F(NAN)); - EXPECT_NE(F(NAN), -F(-NAN)); - EXPECT_NE(F(INFINITY), -F(NAN)); - EXPECT_NE(F(-INFINITY), -F(NAN)); - EXPECT_NE(F(0), -F(NAN)); -} - -//////////////////////////////////////////////////////////////////////////////// -// < -//////////////////////////////////////////////////////////////////////////////// - -TEST_F(NumberTest, -LesserSignedIntIsLessThanGreaterSignedInt) -{ - EXPECT_LT(I(vmin()), I(0)); - EXPECT_LT(I(-100), I(-40)); - EXPECT_LT(I(-1), I(1)); - EXPECT_LT(I(4567), I(vmax())); -} - -TEST_F(NumberTest, -UnsignedIntOneIsLessThanNegativeSignedIntOne) -{ - EXPECT_LT(I(1), I(-1)); -} - -TEST_F(NumberTest, -LesserFloatIsLessThanGreaterFloat) -{ - EXPECT_LT(F(-INFINITY), F(vmin())); - EXPECT_LT(F(vmin()), F(-4356.58)); - EXPECT_LT(F(-12), F(0)); - EXPECT_LT(F(10.0), F(12.0)); - EXPECT_LT(F(456.89), F(10e10)); - EXPECT_LT(F(21e10), F(vmax())); - EXPECT_LT(F(vmax()), F(INFINITY)); -} - -TEST_F(NumberTest, -NanIsNotLessThanAnyOtherFloat) -{ - EXPECT_FALSE(F(NAN) < F(-INFINITY)); - EXPECT_FALSE(F(NAN) < F(-45.7)); - EXPECT_FALSE(F(NAN) < F(0)); - EXPECT_FALSE(F(NAN) < F(10e10)); - EXPECT_FALSE(F(NAN) < F(INFINITY)); - EXPECT_FALSE(F(NAN) < F(NAN)); -} - -//////////////////////////////////////////////////////////////////////////////// -// <= -//////////////////////////////////////////////////////////////////////////////// - -TEST_F(NumberTest, -LesserSignedIntIsLessOrEqualToGreaterSignedInt) -{ - EXPECT_LE(I(vmin()), I(0)); - EXPECT_LE(I(-100), I(-40)); - EXPECT_LE(I(-1), I(1)); - EXPECT_LE(I(4567), I(vmax())); -} - -TEST_F(NumberTest, -UnsignedIntOneIsLessThanOrEqualToNegativeSignedIntOne) -{ - EXPECT_LE(I(1), I(-1)); -} - -TEST_F(NumberTest, -LesserFloatIsLessThanOrEqualToGreaterFloat) -{ - EXPECT_LE(F(-INFINITY), F(vmin())); - EXPECT_LE(F(vmin()), F(-4356.58)); - EXPECT_LE(F(-12), F(0)); - EXPECT_LE(F(10.0), F(12.0)); - EXPECT_LE(F(456.89), F(10e10)); - EXPECT_LE(F(21e10), F(vmax())); - EXPECT_LE(F(vmax()), F(INFINITY)); -} - -TEST_F(NumberTest, -NanIsNotLessThanOrEqualToAnyOtherFloat) -{ - EXPECT_FALSE(F(NAN) < F(-INFINITY)); - EXPECT_FALSE(F(NAN) < F(-45.7)); - EXPECT_FALSE(F(NAN) < F(0)); - EXPECT_FALSE(F(NAN) < F(10e10)); - EXPECT_FALSE(F(NAN) < F(INFINITY)); - EXPECT_FALSE(F(NAN) < F(NAN)); -} - -TEST_F(NumberTest, -NumberIsLessThanOrEqualToTheSameNumber) -{ - EXPECT_LE(I(vmin()), I(vmin())); - EXPECT_LE(I(0), I(0)); - EXPECT_LE(I(vmax()), I(vmax())); - - EXPECT_LE(F(vmin()), F(vmin())); - EXPECT_LE(F(0), F(0)); - EXPECT_LE(F(vmax()), F(vmax())); -} - -//////////////////////////////////////////////////////////////////////////////// -// > -//////////////////////////////////////////////////////////////////////////////// - -TEST_F(NumberTest, -GreaterSignedIntIsGreaterThanLesserSignedInt) -{ - EXPECT_GT(I(0), I(vmin())); - EXPECT_GT(I(-40), I(-100)); - EXPECT_GT(I(1), I(-1)); - EXPECT_GT(I(vmax()), I(4567)); -} - -TEST_F(NumberTest, -NegativeSignedIntOneIsGreaterThanUnsignedIntOne) -{ - EXPECT_GT(I(-1), I(1)); -} - -TEST_F(NumberTest, -GreaterFloatIsGreaterThanLesserFloat) -{ - EXPECT_GT(F(vmin()), F(-INFINITY)); - EXPECT_GT(F(-4356.58), F(vmin())); - EXPECT_GT(F(0), F(-12)); - EXPECT_GT(F(12.0), F(10.0)); - EXPECT_GT(F(10e10), F(456.89)); - EXPECT_GT(F(vmax()), F(21e10)); - EXPECT_GT(F(INFINITY), F(vmax())); -} - -TEST_F(NumberTest, -NanIsNotGreaterThanAnyOtherFloat) -{ - EXPECT_FALSE(F(NAN) > F(-INFINITY)); - EXPECT_FALSE(F(NAN) > F(-45.7)); - EXPECT_FALSE(F(NAN) > F(0)); - EXPECT_FALSE(F(NAN) > F(10e10)); - EXPECT_FALSE(F(NAN) > F(INFINITY)); - EXPECT_FALSE(F(NAN) > F(NAN)); -} - -//////////////////////////////////////////////////////////////////////////////// -// >= -//////////////////////////////////////////////////////////////////////////////// - -TEST_F(NumberTest, -GreaterSignedIntIsGreaterOrEqualToLesserSignedInt) -{ - EXPECT_GE(I(0), I(vmin())); - EXPECT_GE(I(-40), I(-100)); - EXPECT_GE(I(1), I(-1)); - EXPECT_GE(I(vmax()), I(4567)); -} - -TEST_F(NumberTest, -NegativeSignedIntOneIsGreaterOrEqualToUnsignedIntOne) -{ - EXPECT_GE(I(-1), I(1)); -} - -TEST_F(NumberTest, -GreaterFloatIsGreaterOrEqualToGreaterFloat) -{ - EXPECT_GE(F(vmin()), F(-INFINITY)); - EXPECT_GE(F(-4356.58), F(vmin())); - EXPECT_GE(F(0), F(-12)); - EXPECT_GE(F(12.0), F(10.0)); - EXPECT_GE(F(10e10), F(456.89)); - EXPECT_GE(F(vmax()), F(21e10)); - EXPECT_GE(F(INFINITY), F(vmax())); -} - -TEST_F(NumberTest, -NanIsNotGreaterOrEqualToAnyOtherFloat) -{ - EXPECT_FALSE(F(NAN) >= F(-INFINITY)); - EXPECT_FALSE(F(NAN) >= F(-45.7)); - EXPECT_FALSE(F(NAN) >= F(0)); - EXPECT_FALSE(F(NAN) >= F(10e10)); - EXPECT_FALSE(F(NAN) >= F(INFINITY)); - EXPECT_FALSE(F(NAN) >= F(NAN)); -} - -TEST_F(NumberTest, -NumberIsGreaterOrEqualToTheSameNumber) -{ - EXPECT_GE(I(vmin()), I(vmin())); - EXPECT_GE(I(0), I(0)); - EXPECT_GE(I(vmax()), I(vmax())); - - EXPECT_GE(F(vmin()), F(vmin())); - EXPECT_GE(F(0), F(0)); - EXPECT_GE(F(vmax()), F(vmax())); -} - -//////////////////////////////////////////////////////////////////////////////// -// + (binary) -//////////////////////////////////////////////////////////////////////////////// - -TEST_F(NumberTest, -AdditionOfTwoNonLimitNumbersOfTheSameTypeIsCorrect) -{ - EXPECT_EQ(I(-200), I(-100) + I(-100)); - EXPECT_EQ(I(10), I(0) + I(10)); - EXPECT_EQ(I(13568), I(5678) + I(7890)); - - EXPECT_EQ(F(-56.1 + -23.3), F(-56.1) + F(-23.3)); - EXPECT_EQ(F(0), F(0) + F(0)); -} - -TEST_F(NumberTest, -AdditionOfTwoSignedIntsWorksCorrectlyWhenOverflowOccurs) -{ - EXPECT_EQ(I(vmin()), I(vmax()) + I(1)); - EXPECT_EQ(I(-2), I(vmax()) + I(vmax())); -} - -TEST_F(NumberTest, -AdditionOfTwoUnsignedIntsWorksCorrectlyWhenOverflowOccurs) -{ - EXPECT_EQ(I(0), I(vmax()) + I(1)); - EXPECT_EQ(I(vmax() - 1), - I(vmax()) + I(vmax())); -} - -TEST_F(NumberTest, -AdditionOfFloatsWorksCorrectlyWhenAddingLimitNumbers) -{ - // INF + INF = INF - EXPECT_EQ(F(INFINITY), F(INFINITY) + F(INFINITY)); - // INF + (-INF) = -NAN - EXPECT_TRUE((F(INFINITY) + F(-INFINITY)).isNotNumber()); - // INF + NAN = NAN - EXPECT_TRUE((F(INFINITY) + F(NAN)).isNotNumber()); - // INF + number = INF - EXPECT_EQ(F(INFINITY), F(INFINITY) + F(1e30)); - // -INF + INF = -NAN - EXPECT_TRUE((F(-INFINITY) + F(INFINITY)).isNotNumber()); - // -INF + (-INF) = -INF - EXPECT_EQ(F(-INFINITY), F(-INFINITY) + F(-INFINITY)); - // -INF + NAN = NAN - EXPECT_TRUE((F(-INFINITY) + F(NAN)).isNotNumber()); - // -INF + number = -INF - EXPECT_EQ(F(-INFINITY), F(-INFINITY) + F(1e30)); - // NAN + INF = NAN - EXPECT_TRUE((F(NAN) + F(INFINITY)).isNotNumber()); - // NAN + (-INF) = NAN - EXPECT_TRUE((F(NAN) + F(-INFINITY)).isNotNumber()); - // NAN + NAN = NAN - EXPECT_TRUE((F(NAN) + F(NAN)).isNotNumber()); - // NAN + number = NAN - EXPECT_TRUE((F(NAN) + F(1e30)).isNotNumber()); - // number + INF = INF - EXPECT_EQ(F(INFINITY), F(1e30) + F(INFINITY)); - // number + (-INF) = -INF - EXPECT_EQ(F(-INFINITY), F(1e30) + F(-INFINITY)); - // number + NAN = NAN - EXPECT_TRUE((F(1e30) + F(NAN)).isNotNumber()); -} - -//////////////////////////////////////////////////////////////////////////////// -// - (binary) -//////////////////////////////////////////////////////////////////////////////// - -TEST_F(NumberTest, -SubtractionOfTwoNonLimitNumbersOfTheSameTypeIsCorrect) -{ - EXPECT_EQ(I(-200), I(-100) - I(100)); - EXPECT_EQ(I(-10), I(0) - I(10)); - EXPECT_EQ(I(5233), I(5689) - I(456)); - - EXPECT_EQ(F(vmax() - 1.0), F(vmax()) - F(1.0)); - - EXPECT_EQ(F(-56.4 - 23.5), F(-56.4) - F(23.5)); - EXPECT_EQ(F(0), F(0) - F(0)); -} - -TEST_F(NumberTest, -SubtractionOfTwoSignedIntsWorksCorrectlyWhenUnderflowOccurs) -{ - EXPECT_EQ(I(vmax()), I(vmin()) - I(1)); - EXPECT_EQ(I(vmin() - vmax()), - I(vmin()) - I(vmax())); -} - -TEST_F(NumberTest, -SubtractionOfTwoUnsignedIntsWorksCorrectlyWhenUnderflowOccurs) -{ - EXPECT_EQ(I(vmax()), I(0) - I(1)); - EXPECT_EQ(I(1), I(0) - I(vmax())); -} - -TEST_F(NumberTest, -SubtractionOfFloatsWorksCorrectlyWhenSubtractingLimitNumbers) -{ - // INF - INF = -NAN - EXPECT_TRUE((F(INFINITY) - F(INFINITY)).isNotNumber()); - // INF - (-INF) = INF - EXPECT_EQ(F(INFINITY), F(INFINITY) - F(-INFINITY)); - // INF - NAN = NAN - EXPECT_TRUE((F(INFINITY) - F(NAN)).isNotNumber()); - // INF - number = INF - EXPECT_EQ(F(INFINITY), F(INFINITY) - F(1e30)); - // -INF - INF = -INF - EXPECT_EQ(F(-INFINITY), F(-INFINITY) - F(INFINITY)); - // -INF - (-INF) = -NAN - EXPECT_TRUE((F(-INFINITY), - F(-INFINITY) - F(-INFINITY)).isNotNumber()); - // -INF - NAN = NAN - EXPECT_TRUE((F(-INFINITY) - F(NAN)).isNotNumber()); - // -INF - number = -INF - EXPECT_EQ(F(-INFINITY), F(-INFINITY) - F(1e30)); - // NAN - INF = NAN - EXPECT_TRUE((F(NAN) - F(INFINITY)).isNotNumber()); - // NAN - (-INF) = NAN - EXPECT_TRUE((F(NAN) - F(-INFINITY)).isNotNumber()); - // NAN - NAN = NAN - EXPECT_TRUE((F(NAN) - F(NAN)).isNotNumber()); - // NAN - number = NAN - EXPECT_TRUE((F(NAN) - F(1e30)).isNotNumber()); - // number - INF = -INF - EXPECT_EQ(F(-INFINITY), F(1e30) - F(INFINITY)); - // number - (-INF) = INF - EXPECT_EQ(F(INFINITY), F(1e30) - F(-INFINITY)); - // number - NAN = NAN - EXPECT_TRUE((F(1e30) - F(NAN)).isNotNumber()); -} - -//////////////////////////////////////////////////////////////////////////////// -// * -//////////////////////////////////////////////////////////////////////////////// - -TEST_F(NumberTest, -MultiplicationOfTwoNonLimitNumbersOfTheSameTypeIsCorrect) -{ - EXPECT_EQ(I(10000), I(-100) * I(-100)); - EXPECT_EQ(I(0), I(0) * I(10)); - EXPECT_EQ(I(44799420), I(5678) * I(7890)); - - EXPECT_EQ(F(-56.0 * -23.0), F(-56.0) * F(-23.0)); - EXPECT_EQ(F(0), F(0) * F(0)); -} - -TEST_F(NumberTest, -MultiplicationOfTwoSignedIntsWorksCorrectlyWhenOverflowOccurs) -{ - EXPECT_EQ(I(-2), I(vmax()) * I(2)); - EXPECT_EQ(I(1), I(vmax()) * I(vmax())); -} - -TEST_F(NumberTest, -MultiplicationOfTwoUnsignedIntsWorksCorrectlyWhenOverflowOccurs) -{ - EXPECT_EQ(I(vmax() - 1), - I(vmax()) * I(2)); - EXPECT_EQ(I(1), - I(vmax()) * I(vmax())); -} - -TEST_F(NumberTest, -MultiplicationOfUnsignedIntAndFloatWorksCorrectly) -{ - EXPECT_EQ(F(vmin() * vmax()), - I(vmin()) * F(vmax())); -} - -TEST_F(NumberTest, -MultiplicationOfFloatsWorksCorrectlyMultiplyingLimitNumbers) -{ - // INF * INF = INF - EXPECT_EQ(F(INFINITY), F(INFINITY) * F(INFINITY)); - // INF * (-INF) = -INF - EXPECT_EQ(F(-INFINITY), F(INFINITY) * F(-INFINITY)); - // INF * NAN = NAN - EXPECT_TRUE((F(INFINITY) * F(NAN)).isNotNumber()); - // INF * number = INF - EXPECT_EQ(F(INFINITY), F(INFINITY) * F(1e30)); - // -INF * INF = -INF - EXPECT_EQ(F(-INFINITY), F(-INFINITY) * F(INFINITY)); - // -INF * (-INF) = INF - EXPECT_EQ(F(INFINITY), F(-INFINITY) * F(-INFINITY)); - // -INF * NAN = NAN - EXPECT_TRUE((F(-INFINITY) * F(NAN)).isNotNumber()); - // -INF * number = -INF - EXPECT_EQ(F(-INFINITY), F(-INFINITY) * F(1e30)); - // NAN * INF = NAN - EXPECT_TRUE((F(NAN) * F(INFINITY)).isNotNumber()); - // NAN * (-INF) = NAN - EXPECT_TRUE((F(NAN) * F(-INFINITY)).isNotNumber()); - // NAN * NAN = NAN - EXPECT_TRUE((F(NAN) * F(NAN)).isNotNumber()); - // NAN * number = NAN - EXPECT_TRUE((F(NAN) * F(1e30)).isNotNumber()); - // number * INF = INF - EXPECT_EQ(F(INFINITY), F(1e30) * F(INFINITY)); - // number * (-INF) = -INF - EXPECT_EQ(F(-INFINITY), F(1e30) * F(-INFINITY)); - // number * NAN = NAN - EXPECT_TRUE((F(1e30) * F(NAN)).isNotNumber()); -} - -//////////////////////////////////////////////////////////////////////////////// -// rdiv -//////////////////////////////////////////////////////////////////////////////// - -TEST_F(NumberTest, -RealDivisionOfTwoFloatsWithTheSameTypeWorksCorrect) -{ - EXPECT_EQ(F(-10.0f / -2.0f), rdiv(F(-10.0), F(-2.0))); - EXPECT_EQ(F(0.0f), rdiv(F(0), F(-1))); - EXPECT_EQ(F(-5.45f / 0.0f), rdiv(F(-5.45), F(0.0))); - - EXPECT_EQ(F(-10.0 / -2.0), rdiv(F(-10.0), F(-2.0))); - EXPECT_EQ(F(0.0), rdiv(F(0), F(-1))); - EXPECT_EQ(F(-5.45 / 0.0), rdiv(F(-5.45), F(0.0))); - - EXPECT_EQ(F(-10.0L / -2.0L), - rdiv(F(-10.0), F(-2.0))); - EXPECT_EQ(F(0.0L), rdiv(F(0), F(-1))); - EXPECT_EQ(F(-5.45L / 0.0L), - rdiv(F(-5.45), F(0.0))); -} - -TEST_F(NumberTest, -RealDivisionOfTwoFloatsWithTheDifferentTypesWorksCorrect) -{ - EXPECT_EQ(F(-10.0f / -2.0), rdiv(F(-10.0), F(-2.0))); - EXPECT_EQ(F(0.0f / -1L), rdiv(F(0), F(-1))); - - EXPECT_EQ(F(-10.0 / -2.0f), rdiv(F(-10.0), F(-2.0))); - EXPECT_EQ(F(0.0), rdiv(F(0), F(-1))); - - EXPECT_EQ(F(0.0L / -1.0f), rdiv(F(0), F(-1.0))); - EXPECT_EQ(F(-5.0L / 0.0), rdiv(F(-5), F(0.0))); -} - -TEST_F(NumberTest, -RealDivisionOfSpecialFloatsWorksCorrectly) -{ - // INF / INF = -NAN - EXPECT_TRUE(rdiv(F(INFINITY), F(INFINITY)).isNotNumber()); - // INF / (-INF) = -NAN - EXPECT_TRUE(rdiv(F(INFINITY), F(-INFINITY)).isNotNumber()); - // INF / NAN = NAN - EXPECT_TRUE(rdiv(F(INFINITY), F(NAN)).isNotNumber()); - // INF / number = INF - EXPECT_EQ(F(INFINITY), rdiv(F(INFINITY), F(1e30))); - // -INF / INF = -NAN - EXPECT_TRUE(rdiv(F(-INFINITY), F(INFINITY)).isNotNumber()); - // -INF / (-INF) = -NAN - EXPECT_TRUE(rdiv(F(-INFINITY), F(-INFINITY)).isNotNumber()); - // -INF / NAN = NAN - EXPECT_TRUE(rdiv(F(-INFINITY), F(NAN)).isNotNumber()); - // -INF / number = -INF - EXPECT_EQ(F(-INFINITY), rdiv(F(-INFINITY), F(1e30))); - // NAN / INF = NAN - EXPECT_TRUE(rdiv(F(NAN), F(INFINITY)).isNotNumber()); - // NAN / (-INF) = NAN - EXPECT_TRUE(rdiv(F(NAN), F(-INFINITY)).isNotNumber()); - // NAN / NAN = NAN - EXPECT_TRUE(rdiv(F(NAN), F(NAN)).isNotNumber()); - // NAN / number = NAN - EXPECT_TRUE(rdiv(F(NAN), F(1e30)).isNotNumber()); - // number / INF = 0 - EXPECT_EQ(F(0), rdiv(F(1e30), F(INFINITY))); - // number / (-INF) = -0 - EXPECT_EQ(F(0), rdiv(F(1e30), F(-INFINITY))); - // number / NAN = NAN - EXPECT_TRUE(rdiv(F(1e30), F(NAN)).isNotNumber()); - // +number / 0 = INF - EXPECT_EQ(F(INFINITY), rdiv(F(10.0), F(0.0))); - // -number / 0 = -INF - EXPECT_EQ(F(-INFINITY), rdiv(F(-10.0), F(0.0))); - // +number / -0 = -INF - EXPECT_EQ(F(-INFINITY), rdiv(F(10.0), F(-0.0))); - // -number / -0 = INF - EXPECT_EQ(F(INFINITY), rdiv(F(-10.0), F(-0.0))); - // 0 / 0 = NAN - EXPECT_TRUE(rdiv(F(NAN), F(0.0)).isNotNumber()); -} - -//////////////////////////////////////////////////////////////////////////////// -// exact_div -//////////////////////////////////////////////////////////////////////////////// - -TEST_F(NumberTest, -ExactDivisionOfIntsWithTheSameTypeWorksCorrectly) -{ - EXPECT_EQ(I(100 / -10), exact_div(I(100), I(-10))); - EXPECT_EQ(I(0 / 10), exact_div(I(0), I(10))); - EXPECT_EQ(I(127 / -127), exact_div(I(127), I(-127))); - EXPECT_EQ(I(100 / 10), exact_div(I(100), I(10))); - EXPECT_EQ(I(10 / 2), exact_div(I(10), I(2))); - EXPECT_EQ(I(1), exact_div(I(255), I(255))); - - EXPECT_EQ(I(1000 / -10), exact_div(I(1000), I(-10))); - EXPECT_EQ(I(0 / 130), exact_div(I(0), I(130))); - EXPECT_EQ(I(15678 / -15678), exact_div(I(15678), I(-15678))); - - if (sizeof(short) < sizeof(int)) { - EXPECT_EQ(I(100 / 50), - exact_div(I(100), I(50))); - } else if (sizeof(short) == sizeof(int)) { - EXPECT_EQ(I(100 / 2), - exact_div(I(100), I(2))); - } - - EXPECT_EQ(I(100 / -10), exact_div(I(100), I(-10))); - EXPECT_EQ(I(0 / 10), exact_div(I(0), I(10))); - EXPECT_EQ(I(15678 / -15678), exact_div(I(15678), I(-15678))); - EXPECT_EQ(I(100 / 10), exact_div(I(100), I(10))); - EXPECT_EQ(I(10 / 2), exact_div(I(10), I(2))); - EXPECT_EQ(I(1), exact_div(I(7890), I(7890))); - - EXPECT_EQ(I(1000 / -10), exact_div(I(1000), I(-10))); - EXPECT_EQ(I(0 / 1), exact_div(I(0), I(1))); - EXPECT_EQ(I(vmax() / -vmax()), - exact_div(I(vmax()), I(-vmax()))); - EXPECT_EQ(I(vmax() / vmax()), - exact_div(I(vmax()), - I(vmax()))); - EXPECT_EQ(I(5000 / 2), - exact_div(I(5000), I(2))); - EXPECT_EQ(I(1), - exact_div(I(7890), I(7890))); - - // Note: INT_MIN / -1 is not tested because its behaviour is undefined. - // EXPECT_EQ(I(vmin() / -1), exact_div(I(vmin()), I(-1))); -} - -TEST_F(NumberTest, -ExactDivisionOfIntsWithTheDifferentTypesWorksCorrectly) -{ - EXPECT_EQ(I(-4), exact_div(I(-20), I(5))); - EXPECT_EQ(I(-61), exact_div(I(-122), I(2))); - EXPECT_EQ(I((unsigned)-28 / 2), - exact_div(I(-28), I(2))); - EXPECT_EQ(I(32), exact_div(I(32), I(1))); - EXPECT_EQ(I(10), exact_div(I(780), I(78))); -} - -TEST_F(NumberTest, -ExactDivisionOfFloatsWorksCorrectly) -{ - EXPECT_DEATH(exact_div(F(78.0), F(2.0)), - ".*op1.isIntegral().*op2.isIntegral().*"); - EXPECT_DEATH(exact_div(F(78.0), F(2)), - ".*op1.isIntegral().*op2.isIntegral().*"); - EXPECT_DEATH(exact_div(F(158), F(2.0)), - ".*op1.isIntegral().*op2.isIntegral().*"); -} - -//////////////////////////////////////////////////////////////////////////////// -// trunc_div -//////////////////////////////////////////////////////////////////////////////// - -TEST_F(NumberTest, -TruncDivisionOfIntsWithTheSameTypeWorksCorrectly) -{ - EXPECT_EQ(I(101 / -10), trunc_div(I(101), I(-10))); - EXPECT_EQ(I(1 / 10), trunc_div(I(1), I(10))); - EXPECT_EQ(I(127 / -127), trunc_div(I(127), I(-127))); - EXPECT_EQ(I(100 / 11), trunc_div(I(100), I(11))); - EXPECT_EQ(I(10 / 3), trunc_div(I(10), I(3))); - EXPECT_EQ(I(254 / 255), - trunc_div(I(254), I(255))); - - EXPECT_EQ(I(1000 / -11), trunc_div(I(1000), I(-11))); - EXPECT_EQ(I(1 / 130), trunc_div(I(1), I(130))); - EXPECT_EQ(I(15678 / -15678), trunc_div(I(15678), I(-15678))); - - if (sizeof(short) < sizeof(int)) { - EXPECT_EQ(I(101 / 10), - trunc_div(I(101), I(10))); - } else if (sizeof(short) == sizeof(int)) { - EXPECT_EQ(I(101 / 10), - trunc_div(I(101), I(10))); - } - - EXPECT_EQ(I(100 / -11), trunc_div(I(100), I(-11))); - EXPECT_EQ(I(0 / 10), trunc_div(I(0), I(10))); - EXPECT_EQ(I(15678 / -1), trunc_div(I(15678), I(-1))); - EXPECT_EQ(I(100 / 12), trunc_div(I(100), I(12))); - EXPECT_EQ(I(10 / 25), trunc_div(I(10), I(25))); - EXPECT_EQ(I(7890 / 7), trunc_div(I(7890), I(7))); - - EXPECT_EQ(I(1000 / -11), trunc_div(I(1000), I(-11))); - EXPECT_EQ(I(12 / 7), trunc_div(I(12), I(7))); - EXPECT_EQ(I(5000 / 6), - trunc_div(I(5000), I(6))); - - // Note: INT_MIN / -1 is not tested because its behaviour is undefined. - // EXPECT_EQ(I(vmin() / -1), trunc_div(I(vmin()), I(-1))); -} - -TEST_F(NumberTest, -TruncDivisionOfIntsWithTheDifferentTypesWorksCorrectly) -{ - EXPECT_EQ(I(-21 / 5), trunc_div(I(-21), I(5))); - EXPECT_EQ(I(-50 / 10), trunc_div(I(-50), I(10))); - EXPECT_EQ(I(-121 / 2), trunc_div(I(-121), I(2))); - EXPECT_EQ(I((unsigned)-29 / 2), - trunc_div(I(-29), I(2))); - EXPECT_EQ(I(32), - trunc_div(I(32), I(1))); - EXPECT_EQ(I(781 / 78), trunc_div(I(781), I(78))); -} - -TEST_F(NumberTest, -TruncDivisionOfFloatsWorksCorrectly) -{ - EXPECT_DEATH(trunc_div(F(78.0), F(2.0)), - ".*op1.isIntegral().*op2.isIntegral().*"); - EXPECT_DEATH(trunc_div(F(78.0), F(2)), - ".*op1.isIntegral().*op2.isIntegral().*"); - EXPECT_DEATH(trunc_div(F(158), F(2.0)), - ".*op1.isIntegral().*op2.isIntegral().*"); -} - -//////////////////////////////////////////////////////////////////////////////// -// trunc_mod -//////////////////////////////////////////////////////////////////////////////// - -TEST_F(NumberTest, -TruncModuloOfIntsWithTheSameTypeWorksCorrectly) -{ - EXPECT_EQ(I(101 % -10), trunc_mod(I(101), I(-10))); - EXPECT_EQ(I(1 % 10), trunc_mod(I(1), I(10))); - EXPECT_EQ(I(127 % -127), trunc_mod(I(127), I(-127))); - EXPECT_EQ(I(100 % 11), trunc_mod(I(100), I(11))); - EXPECT_EQ(I(10 % 3), trunc_mod(I(10), I(3))); - EXPECT_EQ(I(25 % 26), trunc_mod(I(25), I(26))); - - EXPECT_EQ(I(1000 % -11), trunc_mod(I(1000), I(-11))); - EXPECT_EQ(I(1 % 130), trunc_mod(I(1), I(130))); - EXPECT_EQ(I(15678 % -15678), trunc_mod(I(15678), I(-15678))); - - if (sizeof(short) < sizeof(int)) { - EXPECT_EQ(I(101 % 10), - trunc_mod(I(101), I(10))); - } else if (sizeof(short) == sizeof(int)) { - EXPECT_EQ(I(101 % 10), - trunc_mod(I(101), I(10))); - } - - EXPECT_EQ(I(-5 % -4), trunc_mod(I(-5), I(-4))); - EXPECT_EQ(I(100 % -11), trunc_mod(I(100), I(-11))); - EXPECT_EQ(I(0 % 10), trunc_mod(I(0), I(10))); - EXPECT_EQ(I(15678 % -1), trunc_mod(I(15678), I(-1))); - EXPECT_EQ(I(100 % 12), trunc_mod(I(100), I(12))); - EXPECT_EQ(I(10 % 25), trunc_mod(I(10), I(25))); - EXPECT_EQ(I(7890 % 7), trunc_mod(I(7890), I(7))); - - EXPECT_EQ(I(-1000 % -11), trunc_mod(I(-1000), I(-11))); - EXPECT_EQ(I(-12 % 7), trunc_mod(I(-12), I(7))); - EXPECT_EQ(I(5000 % 6), - trunc_mod(I(5000), I(6))); -} - -TEST_F(NumberTest, -TruncModuloOfIntsWithTheDifferentTypesWorksCorrectly) -{ - EXPECT_EQ(I(-21 % 5), trunc_mod(I(-21), I(5))); - EXPECT_EQ(I(-50 % 10), trunc_mod(I(-50), I(10))); - EXPECT_EQ(I(-121 % 2), trunc_mod(I(-121), I(2))); - EXPECT_EQ(I((unsigned)-29 % 2), - trunc_mod(I(-29), I(2))); - EXPECT_EQ(I(32 % 1), - trunc_mod(I(32), I(1))); - EXPECT_EQ(I(781 % 78), trunc_mod(I(781), I(78))); -} - -TEST_F(NumberTest, -TruncModuloOfFloatsWorksCorrectly) -{ - EXPECT_DEATH(trunc_mod(F(78.0), F(2.0)), - ".*op1.isIntegral().*op2.isIntegral().*"); - EXPECT_DEATH(trunc_mod(F(78.0), F(2)), - ".*op1.isIntegral().*op2.isIntegral().*"); - EXPECT_DEATH(trunc_mod(F(158), F(2.0)), - ".*op1.isIntegral().*op2.isIntegral().*"); -} - -//////////////////////////////////////////////////////////////////////////////// -// logicalNot() -//////////////////////////////////////////////////////////////////////////////// - -TEST_F(NumberTest, -LogicalNotOfIntWorksCorrectly) -{ - EXPECT_EQ(!0, logicalNot(I(0))); - EXPECT_TRUE(!1 == logicalNot(I(1))); - EXPECT_EQ(!vmin(), logicalNot(I(vmin()))); - EXPECT_EQ(!vmax(), logicalNot(I(vmax()))); -} - -TEST_F(NumberTest, -LogicalNotOfFloatWorksCorrectly) -{ - EXPECT_EQ(!0.00, logicalNot(F(0.00))); - EXPECT_TRUE(!1.35 == logicalNot(F(1.35))); - EXPECT_EQ(!vmin(), logicalNot(F(vmin()))); - EXPECT_EQ(!vmax(), logicalNot(F(vmax()))); -} - -TEST_F(NumberTest, -LogicalNotOfAllTypesWorksCorrectly) -{ - // Integral types. - EXPECT_TRUE(!(unsigned char)0 == logicalNot(I(0))); - EXPECT_TRUE(!(signed char)1 == logicalNot(I(1))); - EXPECT_TRUE(!(unsigned short)0 == logicalNot(I(0))); - EXPECT_TRUE(!(signed short)10 == logicalNot(I(10))); - EXPECT_TRUE(!(unsigned int)0 == logicalNot(I(0))); - EXPECT_TRUE(!(signed int)(-12) == logicalNot(I(-12))); - EXPECT_TRUE(!(unsigned long)0 == logicalNot(I(0))); - EXPECT_TRUE(!(signed long)(-5) == logicalNot(I(-5))); - - // Floating-point types. - EXPECT_TRUE(!0.0f == logicalNot(F(0.0f))); - EXPECT_TRUE(!1.25 == logicalNot(F(1.25))); - EXPECT_TRUE(!1.35L == logicalNot(F(1.35L))); -} - -TEST_F(NumberTest, -LogicalNotOfSpecialFloatWorksCorrectly) -{ - EXPECT_TRUE(!(NAN) == logicalNot(F(NAN))); - EXPECT_TRUE(!INFINITY == logicalNot(F(INFINITY))); - EXPECT_TRUE(!(-INFINITY) == logicalNot(F(-INFINITY))); -} - -//////////////////////////////////////////////////////////////////////////////// -// logicalAnd() -//////////////////////////////////////////////////////////////////////////////// - -TEST_F(NumberTest, -IntLogicalAndIntWorksCorrectly) -{ - EXPECT_TRUE((0 && 0) == logicalAnd(I(0), I(0))); - EXPECT_TRUE((0 && 1) == logicalAnd(I(0), I(1))); - EXPECT_TRUE((1 && 0) == logicalAnd(I(1), I(0))); - EXPECT_TRUE((1 && 1) == logicalAnd(I(1), I(1))); -} - -TEST_F(NumberTest, -IntLogicalAndFloatWorksCorrectly) -{ - EXPECT_TRUE((0 && 0.0) == logicalAnd(I(0), F(0.0))); - EXPECT_TRUE((0 && 1.38) == logicalAnd(I(0), F(1.38))); - EXPECT_TRUE((10 && 0.0) == logicalAnd(I(10), F(0.0))); - EXPECT_TRUE((11 && 4.35) == logicalAnd(I(11), F(4.35))); -} - -TEST_F(NumberTest, -FloatLogicalAndIntWorksCorrectly) -{ - EXPECT_TRUE((0.0 && 0) == logicalAnd(F(0.0), I(0))); - EXPECT_TRUE((0.0 && 12) == logicalAnd(F(0.0), I(12))); - EXPECT_TRUE((125.89 && 0) == logicalAnd(F(125.89), I(0))); - EXPECT_TRUE((125.89 && 125) == logicalAnd(F(125.89), I(125))); -} - -TEST_F(NumberTest, -FloatLogicalAndFloatWorksCorrectly) -{ - EXPECT_TRUE((0.0 && 0.0) == logicalAnd(F(0.0), F(0.0))); - EXPECT_TRUE((0.0 && 12.35) == logicalAnd(F(0.0), F(12.35))); - EXPECT_TRUE((258.458 && 0.0) == logicalAnd(F(258.458), F(0.0))); - EXPECT_TRUE((18.4 && 458.2) == logicalAnd(F(18.4), F(458.2))); -} - -TEST_F(NumberTest, -UnsignedCharLogicalAndAllTypesWorksCorrectly) -{ - EXPECT_TRUE(((unsigned char)0 && (unsigned char)0) == - logicalAnd(I(0), I(0))); - EXPECT_TRUE(((unsigned char)0 && (signed char)-1) == - logicalAnd(I(0), I(-1))); - EXPECT_TRUE(((unsigned char)1 && (unsigned short)0) == - logicalAnd(I(1), I(0))); - EXPECT_TRUE(((unsigned char)1 && (signed short)1) == - logicalAnd(I(1), I(1))); - EXPECT_TRUE(((unsigned char)0 && (unsigned int)0) == - logicalAnd(I(0), I(0))); - EXPECT_TRUE(((unsigned char)1 && (signed int)-100) == - logicalAnd(I(1), I(-100))); - EXPECT_TRUE(((unsigned char)10 && (unsigned long)0) == - logicalAnd(I(10), I(0))); - EXPECT_TRUE(((unsigned char)0 && (signed long)0) == - logicalAnd(I(0), I(0))); -} - -TEST_F(NumberTest, -SignedCharLogicalAndAllTypesWorksCorrectly) -{ - EXPECT_TRUE(((signed char)0 && (unsigned char)0) == - logicalAnd(I(0), I(0))); - EXPECT_TRUE(((signed char)0 && (signed char)-1) == - logicalAnd(I(0), I(-1))); - EXPECT_TRUE(((signed char)1 && (unsigned short)0) == - logicalAnd(I(1), I(0))); - EXPECT_TRUE(((signed char)1 && (signed short)1) == - logicalAnd(I(1), I(1))); - EXPECT_TRUE(((signed char)0 && (unsigned int)0) == - logicalAnd(I(0), I(0))); - EXPECT_TRUE(((signed char)1 && (signed int)-100) == - logicalAnd(I(1), I(-100))); - EXPECT_TRUE(((signed char)10 && (unsigned long)0) == - logicalAnd(I(10), I(0))); - EXPECT_TRUE(((signed char)0 && (signed long)0) == - logicalAnd(I(0), I(0))); -} - -TEST_F(NumberTest, -UnsignedShortLogicalAndAllTypesWorksCorrectly) -{ - EXPECT_TRUE(((unsigned short)0 && (unsigned char)0) == - logicalAnd(I(0), I(0))); - EXPECT_TRUE(((unsigned short)0 && (signed char)-1) == - logicalAnd(I(0), I(-1))); - EXPECT_TRUE(((unsigned short)1 && (unsigned short)0) == - logicalAnd(I(1), I(0))); - EXPECT_TRUE(((unsigned short)1 && (signed short)1) == - logicalAnd(I(1), I(1))); - EXPECT_TRUE(((unsigned short)0 && (unsigned int)0) == - logicalAnd(I(0), I(0))); - EXPECT_TRUE(((unsigned short)1 && (signed int)-100) == - logicalAnd(I(1), I(-100))); - EXPECT_TRUE(((unsigned short)10 && (unsigned long)0) == - logicalAnd(I(10), I(0))); - EXPECT_TRUE(((unsigned short)0 && (signed long)0) == - logicalAnd(I(0), I(0))); -} - -TEST_F(NumberTest, -SignedShortLogicalAndAllTypesWorksCorrectly) -{ - EXPECT_TRUE(((signed short)0 && (unsigned char)0) == - logicalAnd(I(0), I(0))); - EXPECT_TRUE(((signed short)0 && (signed char)-1) == - logicalAnd(I(0), I(-1))); - EXPECT_TRUE(((signed short)1 && (unsigned short)0) == - logicalAnd(I(1), I(0))); - EXPECT_TRUE(((signed short)1 && (signed short)1) == - logicalAnd(I(1), I(1))); - EXPECT_TRUE(((signed short)0 && (unsigned int)0) == - logicalAnd(I(0), I(0))); - EXPECT_TRUE(((signed short)1 && (signed int)-100) == - logicalAnd(I(1), I(-100))); - EXPECT_TRUE(((signed short)10 && (unsigned long)0) == - logicalAnd(I(10), I(0))); - EXPECT_TRUE(((signed short)0 && (signed long)0) == - logicalAnd(I(0), I(0))); -} - -TEST_F(NumberTest, -UnsignedIntLogicalAndAllTypesWorksCorrectly) -{ - EXPECT_TRUE(((unsigned int)0 && (unsigned char)0) == - logicalAnd(I(0), I(0))); - EXPECT_TRUE(((unsigned int)0 && (signed char)-1) == - logicalAnd(I(0), I(-1))); - EXPECT_TRUE(((unsigned int)1 && (unsigned short)0) == - logicalAnd(I(1), I(0))); - EXPECT_TRUE(((unsigned int)1 && (signed short)1) == - logicalAnd(I(1), I(1))); - EXPECT_TRUE(((unsigned int)0 && (unsigned int)0) == - logicalAnd(I(0), I(0))); - EXPECT_TRUE(((unsigned int)1 && (signed int)-100) == - logicalAnd(I(1), I(-100))); - EXPECT_TRUE(((unsigned int)10 && (unsigned long)0) == - logicalAnd(I(10), I(0))); - EXPECT_TRUE(((unsigned int)0 && (signed long)0) == - logicalAnd(I(0), I(0))); -} - -TEST_F(NumberTest, -SignedIntLogicalAndAllTypesWorksCorrectly) -{ - EXPECT_TRUE(((signed int)0 && (unsigned char)0) == - logicalAnd(I(0), I(0))); - EXPECT_TRUE(((signed int)0 && (signed char)-1) == - logicalAnd(I(0), I(-1))); - EXPECT_TRUE(((signed int)1 && (unsigned short)0) == - logicalAnd(I(1), I(0))); - EXPECT_TRUE(((signed int)1 && (signed short)1) == - logicalAnd(I(1), I(1))); - EXPECT_TRUE(((signed int)0 && (unsigned int)0) == - logicalAnd(I(0), I(0))); - EXPECT_TRUE(((signed int)1 && (signed int)-100) == - logicalAnd(I(1), I(-100))); - EXPECT_TRUE(((signed int)10 && (unsigned long)0) == - logicalAnd(I(10), I(0))); - EXPECT_TRUE(((signed int)0 && (signed long)0) == - logicalAnd(I(0), I(0))); -} - -TEST_F(NumberTest, -UnsignedLongLogicalAndAllTypesWorksCorrectly) -{ - EXPECT_TRUE(((unsigned long)0 && (unsigned char)0) == - logicalAnd(I(0), I(0))); - EXPECT_TRUE(((unsigned long)0 && (signed char)-1) == - logicalAnd(I(0), I(-1))); - EXPECT_TRUE(((unsigned long)1 && (unsigned short)0) == - logicalAnd(I(1), I(0))); - EXPECT_TRUE(((unsigned long)1 && (signed short)1) == - logicalAnd(I(1), I(1))); - EXPECT_TRUE(((unsigned long)0 && (unsigned int)0) == - logicalAnd(I(0), I(0))); - EXPECT_TRUE(((unsigned long)1 && (signed int)-100) == - logicalAnd(I(1), I(-100))); - EXPECT_TRUE(((unsigned long)10 && (unsigned long)0) == - logicalAnd(I(10), I(0))); - EXPECT_TRUE(((unsigned long)0 && (signed long)0) == - logicalAnd(I(0), I(0))); -} - -TEST_F(NumberTest, -SignedLongLogicalAndAllTypesWorksCorrectly) -{ - EXPECT_TRUE(((signed long)0 && (unsigned char)0) == - logicalAnd(I(0), I(0))); - EXPECT_TRUE(((signed long)0 && (signed char)-1) == - logicalAnd(I(0), I(-1))); - EXPECT_TRUE(((signed long)1 && (unsigned short)0) == - logicalAnd(I(1), I(0))); - EXPECT_TRUE(((signed long)1 && (signed short)1) == - logicalAnd(I(1), I(1))); - EXPECT_TRUE(((signed long)0 && (unsigned int)0) == - logicalAnd(I(0), I(0))); - EXPECT_TRUE(((signed long)1 && (signed int)-100) == - logicalAnd(I(1), I(-100))); - EXPECT_TRUE(((signed long)10 && (unsigned long)0) == - logicalAnd(I(10), I(0))); - EXPECT_TRUE(((signed long)0 && (signed long)0) == - logicalAnd(I(0), I(0))); -} - -TEST_F(NumberTest, -AllIntTypesLogicalAndAllFloatTypesWorksCorrectly) -{ - EXPECT_TRUE(((unsigned char)0 && 0.0f) == - logicalAnd(I(0), F(0.0f))); - EXPECT_TRUE(((unsigned char)1 && 1.3) == - logicalAnd(I(1), F(1.3))); - EXPECT_TRUE(((unsigned char)2 && 1.8L) == - logicalAnd(I(2), F(1.8L))); - EXPECT_TRUE(((signed char)0 && 0.0f) == - logicalAnd(I(0), F(0.0f))); - EXPECT_TRUE(((signed char)-1 && 1.3) == - logicalAnd(I(-1), F(1.3))); - EXPECT_TRUE(((signed char)-2 && 1.8L) == - logicalAnd(I(-2), F(1.8L))); - EXPECT_TRUE(((unsigned short)0 && 0.0f) == - logicalAnd(I(0), F(0.0f))); - EXPECT_TRUE(((unsigned short)1 && 1.3) == - logicalAnd(I(1), F(1.3))); - EXPECT_TRUE(((unsigned short)2 && 1.8L) == - logicalAnd(I(2), F(1.8L))); - EXPECT_TRUE(((signed short)0 && 0.0f) == - logicalAnd(I(0), F(0.0f))); - EXPECT_TRUE(((signed short)0 && 1.0) == - logicalAnd(I(0), F(1.0))); - EXPECT_TRUE(((signed short)2 && 1.8L) == - logicalAnd(I(2), F(1.8L))); - EXPECT_TRUE(((unsigned int)0 && 0.0f) == - logicalAnd(I(0), F(0.0f))); - EXPECT_TRUE(((unsigned int)1 && 1.3) == - logicalAnd(I(1), F(1.3))); - EXPECT_TRUE(((unsigned int)2 && 1.8L) == - logicalAnd(I(2), F(1.8L))); - EXPECT_TRUE(((signed int)0 && 0.0f) == - logicalAnd(I(0), F(0.0f))); - EXPECT_TRUE(((signed int)0 && 1.0) == - logicalAnd(I(0), F(1.0))); - EXPECT_TRUE(((signed int)2 && 1.8L) == - logicalAnd(I(2), F(1.8L))); - EXPECT_TRUE(((unsigned long)0 && 0.0f) == - logicalAnd(I(0), F(0.0f))); - EXPECT_TRUE(((unsigned long)1 && 0.0) == - logicalAnd(I(1), F(0.0))); - EXPECT_TRUE(((unsigned long)2 && 1.8L) == - logicalAnd(I(2), F(1.8L))); - EXPECT_TRUE(((signed long)0 && 0.0f) == - logicalAnd(I(0), F(0.0f))); - EXPECT_TRUE(((signed long)0 && 1.0) == - logicalAnd(I(0), F(1.0))); - EXPECT_TRUE(((signed long)2 && 1.8L) == - logicalAnd(I(2), F(1.8L))); -} - -TEST_F(NumberTest, -AllFloatTypesLogicalAndAllFloatTypesWorksCorrectly) -{ - EXPECT_TRUE((0.0f && 0.0f) == logicalAnd(F(0.0f), F(0.0f))); - EXPECT_TRUE((0.0f && 1.0) == logicalAnd(F(0.0f), F(1.0))); - EXPECT_TRUE((0.0f && 0.0L) == logicalAnd(F(0.0f), F(0.0L))); - EXPECT_TRUE((1.0 && 0.0f) == logicalAnd(F(1.0), F(0.0f))); - EXPECT_TRUE((1.0 && 1.0) == logicalAnd(F(1.0), F(1.0))); - EXPECT_TRUE((1.0 && 0.0L) == logicalAnd(F(1.0), F(0.0L))); - EXPECT_TRUE((0.5L && 1.5f) == logicalAnd(F(0.5L), F(1.5f))); - EXPECT_TRUE((1.8L && 1.4) == logicalAnd(F(1.8L), F(1.4))); - EXPECT_TRUE((2.1L && 0.3L) == logicalAnd(F(2.1L), - F(0.3L))); -} - -TEST_F(NumberTest, -SpecialFloatLogicalAndSpecialFloatWorksCorrectly) -{ - // NAN && NAN - EXPECT_TRUE((NAN && NAN) == - logicalAnd(F(NAN), F(NAN))); - // NAN && INF - EXPECT_TRUE((NAN && INFINITY) == - logicalAnd(F(NAN), F(INFINITY))); - // NAN && -INF - EXPECT_TRUE((NAN && -INFINITY) == - logicalAnd(F(NAN), F(-INFINITY))); - // INF && NAN - EXPECT_TRUE((INFINITY && NAN) == - logicalAnd(F(INFINITY), F(NAN))); - // INF && INF - EXPECT_TRUE((INFINITY && INFINITY) == - logicalAnd(F(INFINITY), F(INFINITY))); - // INF && -INF - EXPECT_TRUE((INFINITY && -INFINITY) == - logicalAnd(F(INFINITY), F(-INFINITY))); - // -INF && NAN - EXPECT_TRUE((-INFINITY && NAN) == - logicalAnd(F(-INFINITY), F(NAN))); - // -INF && INF - EXPECT_TRUE((-INFINITY && INFINITY) == - logicalAnd(F(-INFINITY), F(INFINITY))); - // -INF && -INF - EXPECT_TRUE((-INFINITY && -INFINITY) == - logicalAnd(F(-INFINITY), F(-INFINITY))); -} - -//////////////////////////////////////////////////////////////////////////////// -// logicalOr() -//////////////////////////////////////////////////////////////////////////////// - -TEST_F(NumberTest, -IntLogicalOrIntWorksCorrectly) -{ - EXPECT_TRUE((0 || 0) == logicalOr(I(0), I(0))); - EXPECT_TRUE((0 || 1) == logicalOr(I(0), I(1))); - EXPECT_TRUE((1 || 0) == logicalOr(I(1), I(0))); - EXPECT_TRUE((1 || 1) == logicalOr(I(1), I(1))); -} - -TEST_F(NumberTest, -IntLogicalOrFloatWorksCorrectly) -{ - EXPECT_TRUE((0 || 0.0) == logicalOr(I(0), F(0.0))); - EXPECT_TRUE((0 || 1.38) == logicalOr(I(0), F(1.38))); - EXPECT_TRUE((10 || 0.0) == logicalOr(I(10), F(0.0))); - EXPECT_TRUE((11 || 4.35) == logicalOr(I(11), F(4.35))); -} - -TEST_F(NumberTest, -FloatLogicalOrIntWorksCorrectly) -{ - EXPECT_TRUE((0.0 || 0) == logicalOr(F(0.0), I(0))); - EXPECT_TRUE((0.0 || 12) == logicalOr(F(0.0), I(12))); - EXPECT_TRUE((125.89 || 0) == logicalOr(F(125.89), I(0))); - EXPECT_TRUE((125.89 || 125) == logicalOr(F(125.89), I(125))); -} - -TEST_F(NumberTest, -FloatLogicalOrFloatWorksCorrectly) -{ - EXPECT_TRUE((0.0 || 0.0) == logicalOr(F(0.0), F(0.0))); - EXPECT_TRUE((0.0 || 12.35) == logicalOr(F(0.0), F(12.35))); - EXPECT_TRUE((258.458 || 0.0) == logicalOr(F(258.458), F(0.0))); - EXPECT_TRUE((18.4 || 458.2) == logicalOr(F(18.4), F(458.2))); -} - -TEST_F(NumberTest, -SpecialFloatLogicalOrSpecialFloatWorksCorrectly) -{ - // NAN || NAN - EXPECT_TRUE((NAN || NAN) == - logicalOr(F(NAN), F(NAN))); - // NAN || INF - EXPECT_TRUE((NAN || INFINITY) == - logicalOr(F(NAN), F(INFINITY))); - // NAN || -INF - EXPECT_TRUE((NAN || -INFINITY) == - logicalOr(F(NAN), F(-INFINITY))); - // INF || NAN - EXPECT_TRUE((INFINITY || NAN) == - logicalOr(F(INFINITY), F(NAN))); - // INF || INF - EXPECT_TRUE((INFINITY || INFINITY) == - logicalOr(F(INFINITY), F(INFINITY))); - // INF || -INF - EXPECT_TRUE((INFINITY || -INFINITY) == - logicalOr(F(INFINITY), F(-INFINITY))); - // -INF || NAN - EXPECT_TRUE((-INFINITY || NAN) == - logicalOr(F(-INFINITY), F(NAN))); - // -INF || INF - EXPECT_TRUE((-INFINITY || INFINITY) == - logicalOr(F(-INFINITY), F(INFINITY))); - // -INF || -INF - EXPECT_TRUE((-INFINITY || -INFINITY) == - logicalOr(F(-INFINITY), F(-INFINITY))); -} - -//////////////////////////////////////////////////////////////////////////////// -// logicalXor() -//////////////////////////////////////////////////////////////////////////////// - -TEST_F(NumberTest, -IntLogicalXorIntWorksCorrectly) -{ - EXPECT_TRUE(false == logicalXor(I(0), I(0))); - EXPECT_TRUE(true == logicalXor(I(0), I(1))); - EXPECT_TRUE(true == logicalXor(I(1), I(0))); - EXPECT_TRUE(false == logicalXor(I(1), I(1))); -} - -TEST_F(NumberTest, -IntLogicalXorFloatWorksCorrectly) -{ - EXPECT_TRUE(false == logicalXor(I(0), F(0.0))); - EXPECT_TRUE(true == logicalXor(I(0), F(1.38))); - EXPECT_TRUE(true == logicalXor(I(10), F(0.0))); - EXPECT_TRUE(false == logicalXor(I(11), F(4.35))); -} - -TEST_F(NumberTest, -FloatLogicalXorIntWorksCorrectly) -{ - EXPECT_TRUE(false == logicalXor(F(0.0), I(0))); - EXPECT_TRUE(true == logicalXor(F(0.0), I(12))); - EXPECT_TRUE(true == logicalXor(F(125.89), I(0))); - EXPECT_TRUE(false == logicalXor(F(125.89), I(125))); -} - -TEST_F(NumberTest, -FloatLogicalXorFloatWorksCorrectly) -{ - EXPECT_TRUE(false == logicalXor(F(0.0), F(0.0))); - EXPECT_TRUE(true == logicalXor(F(0.0), F(12.35))); - EXPECT_TRUE(true == logicalXor(F(258.458), F(0.0))); - EXPECT_TRUE(false == logicalXor(F(18.4), F(458.2))); -} - -TEST_F(NumberTest, -SpecialFloatLogicalXorSpecialFloatWorksCorrectly) -{ - // NAN xor NAN - EXPECT_TRUE(false == logicalXor(F(NAN), F(NAN))); - // NAN xor INF - EXPECT_TRUE(false == logicalXor(F(NAN), F(INFINITY))); - // NAN xor -INF - EXPECT_TRUE(false == logicalXor(F(NAN), F(-INFINITY))); - // INF xor NAN - EXPECT_TRUE(false == logicalXor(F(INFINITY), F(NAN))); - // INF xor INF - EXPECT_TRUE(false == logicalXor(F(INFINITY), F(INFINITY))); - // INF xor -INF - EXPECT_TRUE(false == logicalXor(F(INFINITY), F(-INFINITY))); - // -INF xor NAN - EXPECT_TRUE(false == logicalXor(F(-INFINITY), F(NAN))); - // -INF xor INF - EXPECT_TRUE(false == logicalXor(F(-INFINITY), F(INFINITY))); - // -INF xor -INF - EXPECT_TRUE(false ==logicalXor(F(-INFINITY), F(-INFINITY))); -} - -//////////////////////////////////////////////////////////////////////////////// -// bitNot() -//////////////////////////////////////////////////////////////////////////////// - -TEST_F(NumberTest, -BitNotOfIntWorksCorrectly) -{ - unsigned char a = 0; int b = ~a; - EXPECT_EQ(I(b), bitNot(I(a))); - EXPECT_EQ(I(~0), bitNot(I(0))); - EXPECT_EQ(I(~vmin()), bitNot(I(vmin()))); - EXPECT_EQ(I(~vmax()), bitNot(I(vmax()))); - EXPECT_EQ(I(~12569), bitNot(I(12569))); - EXPECT_EQ(I(~(-12569)), bitNot(I(-12569))); -} - -TEST_F(NumberTest, -BitNotOfFloatWorksCorrectly) -{ - EXPECT_DEATH(bitNot(F(1.35)), ".*op.isIntegral().*"); - EXPECT_DEATH(bitNot(F(NAN)), ".*op.isIntegral().*"); - EXPECT_DEATH(bitNot(F(INFINITY)), ".*op.isIntegral().*"); - EXPECT_DEATH(bitNot(F(-INFINITY)), ".*op.isIntegral().*"); -} - -//////////////////////////////////////////////////////////////////////////////// -// bitAnd() -//////////////////////////////////////////////////////////////////////////////// - -TEST_F(NumberTest, -IntBitAndIntWorksCorrectly) -{ - EXPECT_TRUE(I(0 & 0) == bitAnd(I(0), I(0))); - EXPECT_TRUE(I(0 & 1) == bitAnd(I(0), I(1))); - EXPECT_TRUE(I(1 & 0) == bitAnd(I(1), I(0))); - EXPECT_TRUE(I(1 & 1) == bitAnd(I(1), I(1))); -} - -TEST_F(NumberTest, -IntBitAndFloatWorksCorrectly) -{ - EXPECT_DEATH(bitAnd(I(0), F(0.0)), - ".*op1.isIntegral().*op2.isIntegral().*"); - EXPECT_DEATH(bitAnd(I(vmin()), F(0.0)), - ".*op1.isIntegral().*op2.isIntegral().*"); - EXPECT_DEATH(bitAnd(I(0), F(vmax())), - ".*op1.isIntegral().*op2.isIntegral().*"); - EXPECT_DEATH(bitAnd(I(4), F(1.789)), - ".*op1.isIntegral().*op2.isIntegral().*"); -} - -TEST_F(NumberTest, -FloatBitAndIntWorksCorrectly) -{ - EXPECT_DEATH(bitAnd(F(0.0), I(0)), - ".*op1.isIntegral().*op2.isIntegral().*"); - EXPECT_DEATH(bitAnd(F(vmin()), I(0)), - ".*op1.isIntegral().*op2.isIntegral().*"); - EXPECT_DEATH(bitAnd(F(0.0), I(vmax())), - ".*op1.isIntegral().*op2.isIntegral().*"); - EXPECT_DEATH(bitAnd(F(4.536), I(1789)), - ".*op1.isIntegral().*op2.isIntegral().*"); -} - -TEST_F(NumberTest, -FloatBitAndFloatWorksCorrectly) -{ - EXPECT_DEATH(bitAnd(F(0.0), F(0.0)), - ".*op1.isIntegral().*op2.isIntegral().*"); - EXPECT_DEATH(bitAnd(F(vmin()), F(0.0)), - ".*op1.isIntegral().*op2.isIntegral().*"); - EXPECT_DEATH(bitAnd(F(0.0), F(vmax())), - ".*op1.isIntegral().*op2.isIntegral().*"); - EXPECT_DEATH(bitAnd(F(4.536), F(1.789)), - ".*op1.isIntegral().*op2.isIntegral().*"); -} - -TEST_F(NumberTest, -SpecialFloatBitAndSpecialFloatWorksCorrectly) -{ - // NAN & NAN - EXPECT_DEATH(bitAnd(F(NAN), F(NAN)), - ".*op1.isIntegral().*op2.isIntegral().*"); - // NAN & INF - EXPECT_DEATH(bitAnd(F(NAN), F(INFINITY)), - ".*op1.isIntegral().*op2.isIntegral().*"); - // NAN & -INF - EXPECT_DEATH(bitAnd(F(NAN), F(-INFINITY)), - ".*op1.isIntegral().*op2.isIntegral().*"); - // INF & NAN - EXPECT_DEATH(bitAnd(F(INFINITY), F(NAN)), - ".*op1.isIntegral().*op2.isIntegral().*"); - // INF & INF - EXPECT_DEATH(bitAnd(F(INFINITY), F(INFINITY)), - ".*op1.isIntegral().*op2.isIntegral().*"); - // INF & -INF - EXPECT_DEATH(bitAnd(F(INFINITY), F(-INFINITY)), - ".*op1.isIntegral().*op2.isIntegral().*"); - // -INF & NAN - EXPECT_DEATH(bitAnd(F(-INFINITY), F(NAN)), - ".*op1.isIntegral().*op2.isIntegral().*"); - // -INF & INF - EXPECT_DEATH(bitAnd(F(-INFINITY), F(INFINITY)), - ".*op1.isIntegral().*op2.isIntegral().*"); - // -INF & -INF - EXPECT_DEATH(bitAnd(F(-INFINITY), F(-INFINITY)), - ".*op1.isIntegral().*op2.isIntegral().*"); -} - -//////////////////////////////////////////////////////////////////////////////// -// bitOr() -//////////////////////////////////////////////////////////////////////////////// - -TEST_F(NumberTest, -IntBitOrIntWorksCorrectly) -{ - EXPECT_TRUE(I(0 | 0) == bitOr(I(0), I(0))); - EXPECT_TRUE(I(0 | 1) == bitOr(I(0), I(1))); - EXPECT_TRUE(I(1 | 0) == bitOr(I(1), I(0))); - EXPECT_TRUE(I(1 | 1) == bitOr(I(1), I(1))); -} - -TEST_F(NumberTest, -IntBitOrFloatWorksCorrectly) -{ - EXPECT_DEATH(bitOr(I(0), F(0.0)), - ".*op1.isIntegral().*op2.isIntegral().*"); - EXPECT_DEATH(bitOr(I(vmin()), F(0.0)), - ".*op1.isIntegral().*op2.isIntegral().*"); - EXPECT_DEATH(bitOr(I(0), F(vmax())), - ".*op1.isIntegral().*op2.isIntegral().*"); - EXPECT_DEATH(bitOr(I(4), F(1.789)), - ".*op1.isIntegral().*op2.isIntegral().*"); -} - -TEST_F(NumberTest, -FloatBitOrIntWorksCorrectly) -{ - EXPECT_DEATH(bitOr(F(0.0), I(0)), - ".*op1.isIntegral().*op2.isIntegral().*"); - EXPECT_DEATH(bitOr(F(vmin()), I(0)), - ".*op1.isIntegral().*op2.isIntegral().*"); - EXPECT_DEATH(bitOr(F(0.0), I(vmax())), - ".*op1.isIntegral().*op2.isIntegral().*"); - EXPECT_DEATH(bitOr(F(4.536), I(1789)), - ".*op1.isIntegral().*op2.isIntegral().*"); -} - -TEST_F(NumberTest, -FloatBitOrFloatWorksCorrectly) -{ - EXPECT_DEATH(bitOr(F(0.0), F(0.0)), - ".*op1.isIntegral().*op2.isIntegral().*"); - EXPECT_DEATH(bitOr(F(vmin()), F(0.0)), - ".*op1.isIntegral().*op2.isIntegral().*"); - EXPECT_DEATH(bitOr(F(0.0), F(vmax())), - ".*op1.isIntegral().*op2.isIntegral().*"); - EXPECT_DEATH(bitOr(F(4.536), F(1.789)), - ".*op1.isIntegral().*op2.isIntegral().*"); -} - -TEST_F(NumberTest, -SpecialFloatBitOrSpecialFloatWorksCorrectly) -{ - // NAN & NAN - EXPECT_DEATH(bitOr(F(NAN), F(NAN)), - ".*op1.isIntegral().*op2.isIntegral().*"); - // NAN & INF - EXPECT_DEATH(bitOr(F(NAN), F(INFINITY)), - ".*op1.isIntegral().*op2.isIntegral().*"); - // NAN & -INF - EXPECT_DEATH(bitOr(F(NAN), F(-INFINITY)), - ".*op1.isIntegral().*op2.isIntegral().*"); - // INF & NAN - EXPECT_DEATH(bitOr(F(INFINITY), F(NAN)), - ".*op1.isIntegral().*op2.isIntegral().*"); - // INF & INF - EXPECT_DEATH(bitOr(F(INFINITY), F(INFINITY)), - ".*op1.isIntegral().*op2.isIntegral().*"); - // INF & -INF - EXPECT_DEATH(bitOr(F(INFINITY), F(-INFINITY)), - ".*op1.isIntegral().*op2.isIntegral().*"); - // -INF & NAN - EXPECT_DEATH(bitOr(F(-INFINITY), F(NAN)), - ".*op1.isIntegral().*op2.isIntegral().*"); - // -INF & INF - EXPECT_DEATH(bitOr(F(-INFINITY), F(INFINITY)), - ".*op1.isIntegral().*op2.isIntegral().*"); - // -INF & -INF - EXPECT_DEATH(bitOr(F(-INFINITY), F(-INFINITY)), - ".*op1.isIntegral().*op2.isIntegral().*"); -} - -//////////////////////////////////////////////////////////////////////////////// -// bitXor() -//////////////////////////////////////////////////////////////////////////////// - -TEST_F(NumberTest, -IntBitXorIntWorksCorrectly) -{ - EXPECT_TRUE(I(0) == bitXor(I(0), I(0))); - EXPECT_TRUE(I(1) == bitXor(I(0), I(1))); - EXPECT_TRUE(I(1) == bitXor(I(1), I(0))); - EXPECT_TRUE(I(0) == bitXor(I(1), I(1))); -} - -TEST_F(NumberTest, -IntBitXorFloatWorksCorrectly) -{ - EXPECT_DEATH(bitXor(I(0), F(0.0)), - ".*op1.isIntegral().*op2.isIntegral().*"); - EXPECT_DEATH(bitXor(I(vmin()), F(0.0)), - ".*op1.isIntegral().*op2.isIntegral().*"); - EXPECT_DEATH(bitXor(I(0), F(vmax())), - ".*op1.isIntegral().*op2.isIntegral().*"); - EXPECT_DEATH(bitXor(I(4), F(1.789)), - ".*op1.isIntegral().*op2.isIntegral().*"); -} - -TEST_F(NumberTest, -FloatBitXorIntWorksCorrectly) -{ - EXPECT_DEATH(bitXor(F(0.0), I(0)), - ".*op1.isIntegral().*op2.isIntegral().*"); - EXPECT_DEATH(bitXor(F(vmin()), I(0)), - ".*op1.isIntegral().*op2.isIntegral().*"); - EXPECT_DEATH(bitXor(F(0.0), I(vmax())), - ".*op1.isIntegral().*op2.isIntegral().*"); - EXPECT_DEATH(bitXor(F(4.536), I(1789)), - ".*op1.isIntegral().*op2.isIntegral().*"); -} - -TEST_F(NumberTest, -FloatBitXorFloatWorksCorrectly) -{ - EXPECT_DEATH(bitXor(F(0.0), F(0.0)), - ".*op1.isIntegral().*op2.isIntegral().*"); - EXPECT_DEATH(bitXor(F(vmin()), F(0.0)), - ".*op1.isIntegral().*op2.isIntegral().*"); - EXPECT_DEATH(bitXor(F(0.0), F(vmax())), - ".*op1.isIntegral().*op2.isIntegral().*"); - EXPECT_DEATH(bitXor(F(4.536), F(1.789)), - ".*op1.isIntegral().*op2.isIntegral().*"); -} - -TEST_F(NumberTest, -SpecialFloatBitXorSpecialFloatWorksCorrectly) -{ - // NAN & NAN - EXPECT_DEATH(bitXor(F(NAN), F(NAN)), - ".*op1.isIntegral().*op2.isIntegral().*"); - // NAN & INF - EXPECT_DEATH(bitXor(F(NAN), F(INFINITY)), - ".*op1.isIntegral().*op2.isIntegral().*"); - // NAN & -INF - EXPECT_DEATH(bitXor(F(NAN), F(-INFINITY)), - ".*op1.isIntegral().*op2.isIntegral().*"); - // INF & NAN - EXPECT_DEATH(bitXor(F(INFINITY), F(NAN)), - ".*op1.isIntegral().*op2.isIntegral().*"); - // INF & INF - EXPECT_DEATH(bitXor(F(INFINITY), F(INFINITY)), - ".*op1.isIntegral().*op2.isIntegral().*"); - // INF & -INF - EXPECT_DEATH(bitXor(F(INFINITY), F(-INFINITY)), - ".*op1.isIntegral().*op2.isIntegral().*"); - // -INF & NAN - EXPECT_DEATH(bitXor(F(-INFINITY), F(NAN)), - ".*op1.isIntegral().*op2.isIntegral().*"); - // -INF & INF - EXPECT_DEATH(bitXor(F(-INFINITY), F(INFINITY)), - ".*op1.isIntegral().*op2.isIntegral().*"); - // -INF & -INF - EXPECT_DEATH(bitXor(F(-INFINITY), F(-INFINITY)), - ".*op1.isIntegral().*op2.isIntegral().*"); -} - -//////////////////////////////////////////////////////////////////////////////// -// bitLeftShift() -//////////////////////////////////////////////////////////////////////////////// - -TEST_F(NumberTest, -IntBitLeftShiftIntWorksCorrectly) -{ - // Check correctness if at least one operand is zero. - EXPECT_EQ(I(0 << 0), bitLeftShift(I(0), I(0))); - EXPECT_EQ(I(110 << 0), - bitLeftShift(I(110), I(0))); - EXPECT_EQ(I(0 << 2), bitLeftShift(I(0), I(2))); - - // Check correctness if both operands are non-negative numbers. - EXPECT_EQ(I(1589 << 1), bitLeftShift(I(1589), I(1))); - EXPECT_EQ(I(148 << 2), bitLeftShift(I(148), I(2))); - EXPECT_EQ(I(1589 << 3), bitLeftShift(I(1589), I(3))); - EXPECT_EQ(I(148 << 2), - bitLeftShift(I(148), I(2))); - EXPECT_EQ(I(1589 << 3), - bitLeftShift(I(1589), I(3))); - - // Check correctness if the first operand is negative and the second one is - // positive. - EXPECT_EQ(I(-1589 << 1), bitLeftShift(I(-1589), I(1))); - EXPECT_EQ(I(-148 << 2), bitLeftShift(I(-148), I(2))); - EXPECT_EQ(I(-1589 << 3), bitLeftShift(I(-1589), I(3))); - - EXPECT_EQ(I(-148 << 2), bitLeftShift(I(-148), I(2))); - EXPECT_EQ(I(-1589 << 3), - bitLeftShift(I(-1589), I(3))); - - // Check correctness if second operand is negative. - EXPECT_DEATH(bitLeftShift(I(-148), I(-2)), ".*op2.intValue >= 0.*"); - EXPECT_DEATH(bitLeftShift(I(148), I(-2)), ".*op2.intValue >= 0.*"); - - // Check correctness if the second operand specifies greater bit width that the - // first one uses. - EXPECT_DEATH(bitLeftShift(I(148), I(100)), - ".*op1.bitWidth.*op2.intValue.*"); -} - -TEST_F(NumberTest, -IntBitLeftShiftFloatWorksCorrectly) -{ - EXPECT_DEATH(bitLeftShift(I(0), F(0.0)), - ".*op1.isIntegral().*op2.isIntegral().*"); - EXPECT_DEATH(bitLeftShift(I(vmin()), F(0.0)), - ".*op1.isIntegral().*op2.isIntegral().*"); - EXPECT_DEATH(bitLeftShift(I(0), F(vmax())), - ".*op1.isIntegral().*op2.isIntegral().*"); - EXPECT_DEATH(bitLeftShift(I(4), F(1.789)), - ".*op1.isIntegral().*op2.isIntegral().*"); -} - -TEST_F(NumberTest, -FloatBitLeftShiftIntWorksCorrectly) -{ - EXPECT_DEATH(bitLeftShift(F(0.0), I(0)), - ".*op1.isIntegral().*op2.isIntegral().*"); - EXPECT_DEATH(bitLeftShift(F(vmin()), I(0)), - ".*op1.isIntegral().*op2.isIntegral().*"); - EXPECT_DEATH(bitLeftShift(F(0.0), I(vmax())), - ".*op1.isIntegral().*op2.isIntegral().*"); - EXPECT_DEATH(bitLeftShift(F(4.536), I(1789)), - ".*op1.isIntegral().*op2.isIntegral().*"); -} - -TEST_F(NumberTest, -FloatBitLeftShiftFloatWorksCorrectly) -{ - EXPECT_DEATH(bitLeftShift(F(0.0), F(0.0)), - ".*op1.isIntegral().*op2.isIntegral().*"); - EXPECT_DEATH(bitLeftShift(F(vmin()), F(0.0)), - ".*op1.isIntegral().*op2.isIntegral().*"); - EXPECT_DEATH(bitLeftShift(F(0.0), F(vmax())), - ".*op1.isIntegral().*op2.isIntegral().*"); - EXPECT_DEATH(bitLeftShift(F(4.536), F(1.789)), - ".*op1.isIntegral().*op2.isIntegral().*"); -} - -TEST_F(NumberTest, -SpecialFloatBitLeftShiftSpecialFloatWorksCorrectly) -{ - // NAN & NAN - EXPECT_DEATH(bitLeftShift(F(NAN), F(NAN)), - ".*op1.isIntegral().*op2.isIntegral().*"); - // NAN & INF - EXPECT_DEATH(bitLeftShift(F(NAN), F(INFINITY)), - ".*op1.isIntegral().*op2.isIntegral().*"); - // NAN & -INF - EXPECT_DEATH(bitLeftShift(F(NAN), F(-INFINITY)), - ".*op1.isIntegral().*op2.isIntegral().*"); - // INF & NAN - EXPECT_DEATH(bitLeftShift(F(INFINITY), F(NAN)), - ".*op1.isIntegral().*op2.isIntegral().*"); - // INF & INF - EXPECT_DEATH(bitLeftShift(F(INFINITY), F(INFINITY)), - ".*op1.isIntegral().*op2.isIntegral().*"); - // INF & -INF - EXPECT_DEATH(bitLeftShift(F(INFINITY), F(-INFINITY)), - ".*op1.isIntegral().*op2.isIntegral().*"); - // -INF & NAN - EXPECT_DEATH(bitLeftShift(F(-INFINITY), F(NAN)), - ".*op1.isIntegral().*op2.isIntegral().*"); - // -INF & INF - EXPECT_DEATH(bitLeftShift(F(-INFINITY), F(INFINITY)), - ".*op1.isIntegral().*op2.isIntegral().*"); - // -INF & -INF - EXPECT_DEATH(bitLeftShift(F(-INFINITY), F(-INFINITY)), - ".*op1.isIntegral().*op2.isIntegral().*"); -} - -//////////////////////////////////////////////////////////////////////////////// -// bitRightShift() -//////////////////////////////////////////////////////////////////////////////// - -TEST_F(NumberTest, -IntBitRightShiftIntWorksCorrectly) -{ - // Check correctness if at least one operand is zero. - EXPECT_EQ(I(0 >> 0), bitRightShift(I(0), I(0))); - EXPECT_EQ(I(110 >> 0), - bitRightShift(I(110), I(0))); - EXPECT_EQ(I(0 >> 2), bitRightShift(I(0), I(2))); - - // Check correctness if both operands are non-negative numbers. - EXPECT_EQ(I(1589 >> 1), bitRightShift(I(1589), I(1))); - EXPECT_EQ(I(148 >> 2), bitRightShift(I(148), I(2))); - EXPECT_EQ(I(1589 >> 3), bitRightShift(I(1589), I(3))); - EXPECT_EQ(I(148 >> 2), - bitRightShift(I(148), I(2))); - EXPECT_EQ(I(1589 >> 3), - bitRightShift(I(1589), I(3))); - - // Check correctness if the first operand is negative and the second one is - // positive. - EXPECT_EQ(I(-1589 >> 1), bitRightShift(I(-1589), I(1))); - EXPECT_EQ(I(-148 >> 2), bitRightShift(I(-148), I(2))); - EXPECT_EQ(I(-1589 >> 3), bitRightShift(I(-1589), I(3))); - - EXPECT_EQ(I(-148 >> 2), bitRightShift(I(-148), I(2))); - EXPECT_EQ(I(-1589 >> 3), - bitRightShift(I(-1589), I(3))); - - // Check correctness if second operand is negative. - EXPECT_DEATH(bitRightShift(I(-148), I(-2)), ".*op2.intValue >= 0.*"); - EXPECT_DEATH(bitRightShift(I(148), I(-2)), ".*op2.intValue >= 0.*"); - - // Check correctness if the second operand specifies greater bit width that the - // first one uses. - EXPECT_DEATH(bitRightShift(I(148), I(100)), - ".*op1.bitWidth.*op2.intValue.*"); -} - -//////////////////////////////////////////////////////////////////////////////// -// abs() -//////////////////////////////////////////////////////////////////////////////// - -TEST_F(NumberTest, -AbsOfSignedIntWorksCorrectly) -{ - // Signed char. - EXPECT_EQ(I(abs(-1)), abs(I(-1))); - EXPECT_EQ(I(abs(1)), abs(I(1))); - EXPECT_EQ(I(128), abs(I(vmin()))); - EXPECT_EQ(I(abs(vmax())), - abs(I(vmax()))); - - // Signed short. - EXPECT_EQ(I(abs(-11)), abs(I(-11))); - EXPECT_EQ(I(abs(110)), abs(I(110))); - EXPECT_EQ(I(abs(vmin())), abs(I(vmin()))); - EXPECT_EQ(I(abs(vmax())), abs(I(vmax()))); - - // Signed int. - EXPECT_EQ(I(abs(-1435)), abs(I(-1435))); - EXPECT_EQ(I(abs(11025)), abs(I(11025))); - EXPECT_EQ(I(abs(vmin())), abs(I(vmin()))); - EXPECT_EQ(I(abs(vmax())), abs(I(vmax()))); - - // Signed long. - EXPECT_EQ(I(labs(-143589)), abs(I(-143589))); - EXPECT_EQ(I(labs(711025)), abs(I(711025))); - EXPECT_EQ(I(labs(vmin()+1)), abs(I(vmin()+1))); - EXPECT_EQ(I(labs(vmax())), abs(I(vmax()))); - EXPECT_EQ(I(labs(vmin())), abs(I(vmin()))); -} - -TEST_F(NumberTest, -AbsOfUnsignedIntegralWorksCorrectly) -{ - EXPECT_DEATH(abs(I(3)), ".*isIntegral().*isSigned().*"); -} - -TEST_F(NumberTest, -AbsOfFloatWorksCorrectly) -{ - EXPECT_DEATH(abs(F(-1.33)), ".*isIntegral().*isSigned().*"); -} - -//////////////////////////////////////////////////////////////////////////////// -// intToFloat() -//////////////////////////////////////////////////////////////////////////////// - -TEST_F(NumberTest, -IntToFloatOfInt) -{ - // Char. - EXPECT_EQ(F(-120.0), intToFloat(I(-120))); - EXPECT_EQ(F(120.0), intToFloat(I(120))); - // Short. - EXPECT_EQ(F(vmin()), - intToFloat(I(vmin()))); - EXPECT_EQ(F(vmax()), - intToFloat(I(vmax()))); - // Int. - EXPECT_EQ(F(-126589.0), intToFloat(I(-126589))); - EXPECT_EQ(F(20589.0), intToFloat(I(20589))); - // Long. - EXPECT_EQ(F(-12658958.0), intToFloat(I(-12658958))); - EXPECT_EQ(F(620589789.0), intToFloat(I(620589789))); -} - -TEST_F(NumberTest, -IntToFloatOfFloat) -{ - EXPECT_DEATH(bitNot(F(vmin())), ".*op.isIntegral().*"); - EXPECT_DEATH(bitNot(F(vmax())), ".*op.isIntegral().*"); - EXPECT_DEATH(bitNot(F(1.35)), ".*op.isIntegral().*"); -} - -TEST_F(NumberTest, -IntToFloatOfSpecialFloat) -{ - EXPECT_DEATH(bitNot(F(NAN)), ".*op.isIntegral().*"); - EXPECT_DEATH(bitNot(F(INFINITY)), ".*op.isIntegral().*"); - EXPECT_DEATH(bitNot(F(-INFINITY)), ".*op.isIntegral().*"); -} - -//////////////////////////////////////////////////////////////////////////////// -// min() -//////////////////////////////////////////////////////////////////////////////// - -TEST_F(NumberTest, -MinOfTwoSignedIntsWorksCorrectly) -{ - // Minimum of operands of the same type. - EXPECT_EQ(I(-125), min(I(-125), I(-1))); - EXPECT_EQ(I(-12), min(I(-12), I(9))); - EXPECT_EQ(I(-1223697), min(I(-12), I(-1223697))); - EXPECT_EQ(I(vmin()), - min(I(vmax()), I(vmin()))); -} - -TEST_F(NumberTest, -MinOfTwoUnsignedIntsWorksCorrectly) -{ - // Minimum of operands of the same type. - EXPECT_EQ(I(12), - min(I(12), I(16))); - EXPECT_EQ(I(9), - min(I(259), I(9))); - EXPECT_EQ(I(1223697), - min(I(25888888), I(1223697))); - EXPECT_EQ(I(vmin()), - min(I(vmax()), - I(vmin()))); -} - -TEST_F(NumberTest, -MinOfFloatsWorksCorrectly) -{ - EXPECT_EQ(F(-1.35), min(F(-1.35), F(-1.01))); - EXPECT_EQ(F(-12.58), min(F(-12.58), F(9.8))); - EXPECT_EQ(F(-122.58), - min(F(-12.589), F(-122.58))); -} - -TEST_F(NumberTest, -MinOfSpecialFloatsWorksCorrectly) -{ - EXPECT_EQ(F(-INFINITY), min(F(-INFINITY), F(-INFINITY))); - EXPECT_EQ(F(-INFINITY), min(F(-INFINITY), F(-1.35))); - EXPECT_EQ(F(-INFINITY), min(F(-INFINITY), F(INFINITY))); - - EXPECT_EQ(F(-INFINITY), min(F(INFINITY), F(-INFINITY))); - EXPECT_EQ(F(-1.35), min(F(INFINITY), F(-1.35))); - EXPECT_EQ(F(INFINITY), min(F(INFINITY), F(INFINITY))); -} - -//////////////////////////////////////////////////////////////////////////////// -// max() -//////////////////////////////////////////////////////////////////////////////// - -TEST_F(NumberTest, -MaxOfTwoSignedIntsWorksCorrectly) -{ - // Maximum of operands of the same type. - EXPECT_EQ(I(-1), max(I(-125), I(-1))); - EXPECT_EQ(I(9), max(I(-12), I(9))); - EXPECT_EQ(I(-12), max(I(-12), I(-1223697))); - EXPECT_EQ(I(vmax()), - max(I(vmax()), I(vmin()))); -} - -TEST_F(NumberTest, -MaxOfTwoUnsignedIntsWorksCorrectly) -{ - // Maximum of operands of the same type. - EXPECT_EQ(I(16), - max(I(12), I(16))); - EXPECT_EQ(I(259), - max(I(259), I(9))); - EXPECT_EQ(I(25888888), - max(I(25888888), I(1223697))); - EXPECT_EQ(I(vmax()), - max(I(vmax()), - I(vmin()))); -} - -TEST_F(NumberTest, -MaxOfFloatsWorksCorrectly) -{ - EXPECT_EQ(F(-1.01), max(F(-1.35), F(-1.01))); - EXPECT_EQ(F(9.8), max(F(-12.58), F(9.8))); - EXPECT_EQ(F(-12.589), - max(F(-12.589), F(-122.58))); -} - -TEST_F(NumberTest, -MaxOfSpecialFloatsWorksCorrectly) -{ - EXPECT_EQ(F(-INFINITY), max(F(-INFINITY), F(-INFINITY))); - EXPECT_EQ(F(-1.35), max(F(-INFINITY), F(-1.35))); - EXPECT_EQ(F(INFINITY), max(F(-INFINITY), F(INFINITY))); - - EXPECT_EQ(F(INFINITY), max(F(INFINITY), F(-INFINITY))); - EXPECT_EQ(F(INFINITY), max(F(INFINITY), F(-1.35))); - EXPECT_EQ(F(INFINITY), max(F(INFINITY), F(INFINITY))); -} - -//////////////////////////////////////////////////////////////////////////////// -// main() -//////////////////////////////////////////////////////////////////////////////// -int main(int argc, char *argv[]) -{ - ::testing::InitGoogleTest(&argc, argv); - return RUN_ALL_TESTS(); -} diff --git a/vra/tests-unit/OperandToMemoryPlaceTest.cc b/vra/tests-unit/OperandToMemoryPlaceTest.cc deleted file mode 100644 index c69c26195..000000000 --- a/vra/tests-unit/OperandToMemoryPlaceTest.cc +++ /dev/null @@ -1,913 +0,0 @@ -/** -* @author Daniela Ďuričeková, xduric00@stud.fit.vutbr.cz -* @file OperandToMemoryPlaceTest.cc -* @brief Test class for class OperandToMemoryPlace. -* @date 2012 -*/ - -#include "OperandToMemoryPlace.h" -#include "gtest/gtest.h" - -using namespace std; - -class OperandToMemoryPlaceTest : public ::testing::Test { - protected: - OperandToMemoryPlaceTest() { - } - - virtual ~OperandToMemoryPlaceTest() { - } - - virtual void SetUp() { - OperandToMemoryPlace::init(); - } - - virtual void TearDown() { - } - -}; - -//////////////////////////////////////////////////////////////////////////////// -// conversion of variables -//////////////////////////////////////////////////////////////////////////////// - -TEST_F(OperandToMemoryPlaceTest, -PreconditionViolated) -{ - struct cl_operand op1; - op1.code = CL_OPERAND_VOID; - ASSERT_DEATH(OperandToMemoryPlace::convert(&op1), - "operand->code == CL_OPERAND_VAR"); - - struct cl_operand op2; - op2.code = CL_OPERAND_CST; - ASSERT_DEATH(OperandToMemoryPlace::convert(&op2), - "operand->code == CL_OPERAND_VAR"); -} - -TEST_F(OperandToMemoryPlaceTest, -VariableIsConvertedToMemoryPlace) -{ - struct cl_operand op1; - op1.code = CL_OPERAND_VAR; - op1.accessor = NULL; - op1.data.var = new struct cl_var; - op1.data.var->uid = 2569; - op1.data.var->name = "variable_a"; - op1.data.var->artificial = false; - op1.type = new struct cl_type; - op1.type->item_cnt = 0; - - MemoryPlace *mp = OperandToMemoryPlace::convert(&op1); - ASSERT_EQ("variable_a", mp->asString()); - ASSERT_FALSE(mp->isArtificial()); - - delete op1.type; - delete op1.data.var; -} - -TEST_F(OperandToMemoryPlaceTest, -TwoIdenticalVariablesAreConvertedToTheSameMemoryPlace) -{ - struct cl_operand op1; - op1.code = CL_OPERAND_VAR; - op1.accessor = NULL; - op1.data.var = new struct cl_var; - op1.data.var->uid = 2569; - op1.data.var->name = "variable_a"; - op1.data.var->artificial = false; - op1.type = new struct cl_type; - op1.type->item_cnt = 0; - - struct cl_operand op2; - op2.code = CL_OPERAND_VAR; - op2.accessor = NULL; - op2.data.var = new struct cl_var; - op2.data.var->uid = 2569; - op2.data.var->name = "variable_a"; - op2.data.var->artificial = false; - op2.type = new struct cl_type; - op2.type->item_cnt = 0; - - MemoryPlace *mp1 = OperandToMemoryPlace::convert(&op1); - MemoryPlace *mp2 = OperandToMemoryPlace::convert(&op2); - ASSERT_EQ(mp1, mp2); - - delete op1.type; - delete op2.type; - delete op1.data.var; - delete op2.data.var; -} - -TEST_F(OperandToMemoryPlaceTest, -TwoNonIdenticalVariablesAreNotConvertedToTheSameMemoryPlace) -{ - struct cl_operand op1; - op1.code = CL_OPERAND_VAR; - op1.accessor = NULL; - op1.data.var = new struct cl_var; - op1.data.var->uid = 2569; - op1.data.var->name = "variable_a"; - op1.data.var->artificial = false; - - struct cl_operand op2; - op2.code = CL_OPERAND_VAR; - op2.accessor = NULL; - op2.data.var = new struct cl_var; - op2.data.var->uid = 2579; - op2.data.var->name = "variable_a"; - op2.data.var->artificial = false; - - MemoryPlace *mp1 = OperandToMemoryPlace::convert(&op1); - MemoryPlace *mp2 = OperandToMemoryPlace::convert(&op2); - ASSERT_NE(mp1, mp2); - - delete op1.data.var; - delete op2.data.var; -} - -//////////////////////////////////////////////////////////////////////////////// -// conversion of an item of a structure -//////////////////////////////////////////////////////////////////////////////// - -TEST_F(OperandToMemoryPlaceTest, -TwoIdenticalStructItemsAreConvertedToTheSameMemoryPlace) -{ - // struct { - // struct { - // struct { - // int d; - // } c; - // } b; - // } a; - - // a.b.c.d - struct cl_operand op1; - op1.code = CL_OPERAND_VAR; - op1.data.var = new struct cl_var; - op1.data.var->uid = 2569; - op1.data.var->name = "a"; - op1.data.var->artificial = false; - op1.type = new struct cl_type; - op1.type->item_cnt = 0; - op1.type->code = CL_TYPE_STRUCT; - op1.type->items = new struct cl_type_item[1]; - op1.accessor = new struct cl_accessor; - op1.accessor->code = CL_ACCESSOR_ITEM; - op1.accessor->data.item.id = 0; - op1.accessor->type = new struct cl_type; - op1.accessor->type->item_cnt = 1; - op1.accessor->type->code = CL_TYPE_STRUCT; - op1.accessor->type->items = new struct cl_type_item[1]; - op1.accessor->type->items[0].name = "b"; - op1.accessor->next = new struct cl_accessor; - op1.accessor->next->code = CL_ACCESSOR_ITEM; - op1.accessor->next->data.item.id = 0; - op1.accessor->next->type = new struct cl_type; - op1.accessor->next->type->item_cnt = 1; - op1.accessor->next->type->code = CL_TYPE_STRUCT; - op1.accessor->next->type->items = new struct cl_type_item[1]; - op1.accessor->next->type->items[0].name = "c"; - op1.accessor->next->next = new struct cl_accessor; - op1.accessor->next->next->code = CL_ACCESSOR_ITEM; - op1.accessor->next->next->data.item.id = 0; - op1.accessor->next->next->type = new struct cl_type; - op1.accessor->next->next->type->item_cnt = 1; - op1.accessor->next->next->type->code = CL_TYPE_STRUCT; - op1.accessor->next->next->type->items = new struct cl_type_item[1]; - op1.accessor->next->next->type->items[0].name = "d"; - op1.accessor->next->next->next = NULL; - - MemoryPlace *mp1 = OperandToMemoryPlace::convert(&op1); - ASSERT_EQ("a.b.c.d", mp1->asString()); - ASSERT_FALSE(mp1->isArtificial()); - - delete [] op1.accessor->next->next->type->items; - delete op1.accessor->next->next->type; - delete op1.accessor->next->next; - delete [] op1.accessor->next->type->items; - delete op1.accessor->next->type; - delete op1.accessor->next; - delete [] op1.accessor->type->items; - delete op1.accessor->type; - delete op1.accessor; - delete [] op1.type->items; - delete op1.type; - delete op1.data.var; - - struct cl_operand op2; - op2.code = CL_OPERAND_VAR; - op2.data.var = new struct cl_var; - op2.data.var->uid = 2569; - op2.data.var->name = "a"; - op2.data.var->artificial = false; - op2.type = new struct cl_type; - op2.type->item_cnt = 0; - op2.type->code = CL_TYPE_STRUCT; - op2.type->items = new struct cl_type_item[1]; - op2.accessor = new struct cl_accessor; - op2.accessor->code = CL_ACCESSOR_ITEM; - op2.accessor->data.item.id = 0; - op2.accessor->type = new struct cl_type; - op2.accessor->type->item_cnt = 1; - op2.accessor->type->code = CL_TYPE_STRUCT; - op2.accessor->type->items = new struct cl_type_item[1]; - op2.accessor->type->items[0].name = "b"; - op2.accessor->next = new struct cl_accessor; - op2.accessor->next->code = CL_ACCESSOR_ITEM; - op2.accessor->next->data.item.id = 0; - op2.accessor->next->type = new struct cl_type; - op2.accessor->next->type->item_cnt = 1; - op2.accessor->next->type->code = CL_TYPE_STRUCT; - op2.accessor->next->type->items = new struct cl_type_item[1]; - op2.accessor->next->type->items[0].name = "c"; - op2.accessor->next->next = new struct cl_accessor; - op2.accessor->next->next->code = CL_ACCESSOR_ITEM; - op2.accessor->next->next->data.item.id = 0; - op2.accessor->next->next->type = new struct cl_type; - op2.accessor->next->next->type->item_cnt = 1; - op2.accessor->next->next->type->code = CL_TYPE_STRUCT; - op2.accessor->next->next->type->items = new struct cl_type_item[1]; - op2.accessor->next->next->type->items[0].name = "d"; - op2.accessor->next->next->next = NULL; - - MemoryPlace *mp2 = OperandToMemoryPlace::convert(&op2); - ASSERT_EQ("a.b.c.d", mp2->asString()); - ASSERT_FALSE(mp2->isArtificial()); - - EXPECT_EQ(mp1, mp2); - - delete [] op2.accessor->next->next->type->items; - delete op2.accessor->next->next->type; - delete op2.accessor->next->next; - delete [] op2.accessor->next->type->items; - delete op2.accessor->next->type; - delete op2.accessor->next; - delete [] op2.accessor->type->items; - delete op2.accessor->type; - delete op2.accessor; - delete [] op2.type->items; - delete op2.type; - delete op2.data.var; - -} - -TEST_F(OperandToMemoryPlaceTest, -TwoNonIdenticalStructItemsAreNotConvertedToTheSameMemoryPlace) -{ - // struct { - // struct { - // int i; - // float x; - // } b; - // int q; - // } a; - - // a.b.x - struct cl_operand op1; - op1.code = CL_OPERAND_VAR; - op1.data.var = new struct cl_var; - op1.data.var->uid = 2569; - op1.data.var->name = "a"; - op1.data.var->artificial = false; - op1.type = new struct cl_type; - op1.type->items = new struct cl_type_item[2]; - op1.accessor = new struct cl_accessor; - op1.accessor->code = CL_ACCESSOR_ITEM; - op1.accessor->data.item.id = 0; - op1.accessor->type = new struct cl_type; - op1.accessor->type->items = new struct cl_type_item[2]; - op1.accessor->type->items[0].name = "b"; - op1.accessor->type->items[1].name = "q"; - op1.accessor->next = new struct cl_accessor; - op1.accessor->next->code = CL_ACCESSOR_ITEM; - op1.accessor->next->data.item.id = 1; - op1.accessor->next->type = new struct cl_type; - op1.accessor->next->type->items = new struct cl_type_item[2]; - op1.accessor->next->type->items[0].name = "i"; - op1.accessor->next->type->items[1].name = "x"; - op1.accessor->next->next = NULL; - - MemoryPlace *mp1 = OperandToMemoryPlace::convert(&op1); - ASSERT_EQ("a.b.x", mp1->asString()); - ASSERT_FALSE(mp1->isArtificial()); - - delete [] op1.accessor->next->type->items; - delete op1.accessor->next->type; - delete op1.accessor->next; - delete [] op1.accessor->type->items; - delete op1.accessor->type; - delete op1.accessor; - delete [] op1.type->items; - delete op1.type; - delete op1.data.var; - - // a.b.i - struct cl_operand op2; - op2.code = CL_OPERAND_VAR; - op2.data.var = new struct cl_var; - op2.data.var->uid = 2569; - op2.data.var->name = "a"; - op2.data.var->artificial = false; - op2.type = new struct cl_type; - op2.type->items = new struct cl_type_item[2]; - op2.accessor = new struct cl_accessor; - op2.accessor->code = CL_ACCESSOR_ITEM; - op2.accessor->data.item.id = 0; - op2.accessor->type = new struct cl_type; - op2.accessor->type->items = new struct cl_type_item[2]; - op2.accessor->type->items[0].name = "b"; - op2.accessor->type->items[1].name = "q"; - op2.accessor->next = new struct cl_accessor; - op2.accessor->next->code = CL_ACCESSOR_ITEM; - op2.accessor->next->data.item.id = 0; - op2.accessor->next->type = new struct cl_type; - op2.accessor->next->type->items = new struct cl_type_item[2]; - op2.accessor->next->type->items[0].name = "i"; - op2.accessor->next->type->items[1].name = "x"; - op2.accessor->next->next = NULL; - - MemoryPlace *mp2 = OperandToMemoryPlace::convert(&op2); - ASSERT_EQ("a.b.i", mp2->asString()); - ASSERT_FALSE(mp2->isArtificial()); - - delete [] op2.accessor->next->type->items; - delete op2.accessor->next->type; - delete op2.accessor->next; - delete [] op2.accessor->type->items; - delete op2.accessor->type; - delete op2.accessor; - delete [] op2.type->items; - delete op2.type; - delete op2.data.var; - - ASSERT_NE(mp1, mp2); -} - -//////////////////////////////////////////////////////////////////////////////// -// conversion of an element of an array -//////////////////////////////////////////////////////////////////////////////// - -TEST_F(OperandToMemoryPlaceTest, -ArrayElementIsConvertedToMemoryPlace) -{ - struct cl_operand op1; - op1.code = CL_OPERAND_VAR; - op1.data.var = new struct cl_var; - op1.data.var->uid = 2569; - op1.data.var->name = "a"; - op1.data.var->artificial = false; - op1.accessor = new struct cl_accessor; - op1.accessor->type = new struct cl_type; - op1.accessor->type->code = CL_TYPE_ARRAY; - op1.accessor->code = CL_ACCESSOR_DEREF_ARRAY; - op1.accessor->next = new struct cl_accessor; - op1.accessor->next->code = CL_ACCESSOR_DEREF_ARRAY; - op1.accessor->next->type = new struct cl_type; - op1.accessor->next->type->code = CL_TYPE_ARRAY; - op1.accessor->next->next = NULL; - - MemoryPlace *mp1 = OperandToMemoryPlace::convert(&op1); - ASSERT_EQ("a[][]", mp1->asString()); - ASSERT_FALSE(mp1->isArtificial()); - - delete op1.accessor->next->type; - delete op1.accessor->next; - delete op1.accessor->type; - delete op1.accessor; - delete op1.data.var; -} - -TEST_F(OperandToMemoryPlaceTest, -ArrayElementsFromTheSameArrayAreConvertedToTheSameMemoryPlace) -{ - struct cl_operand op1; - op1.code = CL_OPERAND_VAR; - op1.data.var = new struct cl_var; - op1.data.var->uid = 2569; - op1.data.var->name = "a"; - op1.data.var->artificial = false; - op1.accessor = new struct cl_accessor; - op1.accessor->type = new struct cl_type; - op1.accessor->type->code = CL_TYPE_ARRAY; - op1.accessor->code = CL_ACCESSOR_DEREF_ARRAY; - op1.accessor->next = NULL; - - MemoryPlace *mp1 = OperandToMemoryPlace::convert(&op1); - ASSERT_EQ("a[]", mp1->asString()); - ASSERT_FALSE(mp1->isArtificial()); - - struct cl_operand op2; - op2.code = CL_OPERAND_VAR; - op2.data.var = new struct cl_var; - op2.data.var->uid = 2569; - op2.data.var->name = "a"; - op2.data.var->artificial = false; - op2.accessor = new struct cl_accessor; - op2.accessor->type = new struct cl_type; - op2.accessor->type->code = CL_TYPE_ARRAY; - op2.accessor->code = CL_ACCESSOR_DEREF_ARRAY; - op2.accessor->next = NULL; - - MemoryPlace *mp2 = OperandToMemoryPlace::convert(&op2); - ASSERT_EQ("a[]", mp2->asString()); - ASSERT_FALSE(mp2->isArtificial()); - - delete op1.accessor->type; - delete op1.accessor; - delete op1.data.var; - delete op2.accessor->type; - delete op2.accessor; - delete op2.data.var; - - ASSERT_EQ(mp1, mp2); -} - -TEST_F(OperandToMemoryPlaceTest, -ArrayElementsFromDifferentArrayAreNotConvertedToTheSameMemoryPlace) -{ - struct cl_operand op1; - op1.code = CL_OPERAND_VAR; - op1.data.var = new struct cl_var; - op1.data.var->uid = 2569; - op1.data.var->name = "a"; - op1.data.var->artificial = false; - op1.accessor = new struct cl_accessor; - op1.accessor->type = new struct cl_type; - op1.accessor->type->code = CL_TYPE_ARRAY; - op1.accessor->code = CL_ACCESSOR_DEREF_ARRAY; - op1.accessor->next = NULL; - - MemoryPlace *mp1 = OperandToMemoryPlace::convert(&op1); - ASSERT_EQ("a[]", mp1->asString()); - ASSERT_FALSE(mp1->isArtificial()); - - struct cl_operand op2; - op2.code = CL_OPERAND_VAR; - op2.data.var = new struct cl_var; - op2.data.var->uid = 2579; - op2.data.var->name = "a"; - op2.data.var->artificial = false; - op2.accessor = new struct cl_accessor; - op2.accessor->type = new struct cl_type; - op2.accessor->type->code = CL_TYPE_ARRAY; - op2.accessor->code = CL_ACCESSOR_DEREF_ARRAY; - op2.accessor->next = NULL; - - MemoryPlace *mp2 = OperandToMemoryPlace::convert(&op2); - ASSERT_EQ("a[]", mp2->asString()); - ASSERT_FALSE(mp2->isArtificial()); - - delete op1.accessor->type; - delete op1.accessor; - delete op1.data.var; - delete op2.accessor->type; - delete op2.accessor; - delete op2.data.var; - - ASSERT_NE(mp1, mp2); -} - -//////////////////////////////////////////////////////////////////////////////// -// conversion of mixed structure and arrays -//////////////////////////////////////////////////////////////////////////////// - -TEST_F(OperandToMemoryPlaceTest, -ConversionOfStructureWithArrayWorksCorrectly) -{ - // struct str { - // int b[10]; - // } a; - // a.b[0] = 5; - - struct cl_operand op1; - op1.code = CL_OPERAND_VAR; - op1.data.var = new struct cl_var; - op1.data.var->uid = 2569; - op1.data.var->name = "a"; - op1.data.var->artificial = false; - op1.type = new struct cl_type; - op1.accessor = new struct cl_accessor; - op1.accessor->code = CL_ACCESSOR_ITEM; - op1.accessor->data.item.id = 0; - op1.accessor->type = new struct cl_type; - op1.accessor->type->items = new struct cl_type_item[1]; - op1.accessor->type->items[0].name = "b"; - op1.accessor->next = new struct cl_accessor; - op1.accessor->next->code = CL_ACCESSOR_DEREF_ARRAY; - op1.accessor->next->next = NULL; - - MemoryPlace *mp1 = OperandToMemoryPlace::convert(&op1); - ASSERT_EQ("a.b[]", mp1->asString()); - ASSERT_FALSE(mp1->isArtificial()); - - delete op1.accessor->next; - delete [] op1.accessor->type->items; - delete op1.accessor->type; - delete op1.accessor; - delete op1.type; - delete op1.data.var; -} - -TEST_F(OperandToMemoryPlaceTest, -ConversionOfArrayOfStructuresWorksCorrectly) -{ - // struct s { - // float a; - // int b; - // }; - // struct s c[10]; - // c[0].b = 0; - - struct cl_operand op1; - op1.code = CL_OPERAND_VAR; - op1.data.var = new struct cl_var; - op1.data.var->uid = 2569; - op1.data.var->name = "c"; - op1.data.var->artificial = false; - op1.type = new struct cl_type; - op1.accessor = new struct cl_accessor; - op1.accessor->code = CL_ACCESSOR_DEREF_ARRAY; - op1.accessor->next = new struct cl_accessor; - op1.accessor->next->code = CL_ACCESSOR_ITEM; - op1.accessor->next->data.item.id = 1; - op1.accessor->next->type = new struct cl_type; - op1.accessor->next->type->items = new struct cl_type_item[2]; - op1.accessor->next->type->items[0].name = "a"; - op1.accessor->next->type->items[1].name = "b"; - op1.accessor->next->next = NULL; - - MemoryPlace *mp1 = OperandToMemoryPlace::convert(&op1); - ASSERT_EQ("c[].b", mp1->asString()); - ASSERT_FALSE(mp1->isArtificial()); - - delete [] op1.accessor->next->type->items; - delete op1.accessor->next->type; - delete op1.accessor->next; - delete op1.accessor; - delete op1.type; - delete op1.data.var; -} - -TEST_F(OperandToMemoryPlaceTest, -ConversionOfArrayOfStructuresInWhichArrayOfStructuresIsWorksCorrectly) -{ - // struct a { - // int b; - // double q; - // }; - // struct c { - // struct a d[10]; - // }; - // struct c e[10]; - // - // e[5].d[8].q = 0.0 - - struct cl_operand op1; - op1.code = CL_OPERAND_VAR; - op1.data.var = new struct cl_var; - op1.data.var->uid = 2569; - op1.data.var->name = "e"; - op1.data.var->artificial = false; - op1.type = new struct cl_type; - op1.accessor = new struct cl_accessor; - op1.accessor->code = CL_ACCESSOR_DEREF_ARRAY; - op1.accessor->next = new struct cl_accessor; - op1.accessor->next->code = CL_ACCESSOR_ITEM; - op1.accessor->next->data.item.id = 0; - op1.accessor->next->type = new struct cl_type; - op1.accessor->next->type->items = new struct cl_type_item[1]; - op1.accessor->next->type->items[0].name = "d"; - op1.accessor->next->next = new struct cl_accessor; - op1.accessor->next->next->code = CL_ACCESSOR_DEREF_ARRAY; - op1.accessor->next->next->next = new struct cl_accessor; - op1.accessor->next->next->next->code = CL_ACCESSOR_ITEM; - op1.accessor->next->next->next->data.item.id = 1; - op1.accessor->next->next->next->type = new struct cl_type; - op1.accessor->next->next->next->type->items = new struct cl_type_item[2]; - op1.accessor->next->next->next->type->items[0].name = "b"; - op1.accessor->next->next->next->type->items[1].name = "q"; - op1.accessor->next->next->next->next = NULL; - - MemoryPlace *mp1 = OperandToMemoryPlace::convert(&op1); - ASSERT_EQ("e[].d[].q", mp1->asString()); - ASSERT_FALSE(mp1->isArtificial()); - - op1.accessor->next->next->next->data.item.id = 0; - MemoryPlace *mp2 = OperandToMemoryPlace::convert(&op1); - ASSERT_EQ("e[].d[].b", mp2->asString()); - ASSERT_FALSE(mp2->isArtificial()); - - ASSERT_NE(mp1, mp2); - - delete [] op1.accessor->next->next->next->type->items; - delete op1.accessor->next->next->next->type; - delete op1.accessor->next->next->next; - delete op1.accessor->next->next; - delete [] op1.accessor->next->type->items; - delete op1.accessor->next->type; - delete op1.accessor->next; - delete op1.accessor; - delete op1.type; - delete op1.data.var; -} - -TEST_F(OperandToMemoryPlaceTest, -ConversionOfArrayOfStructuresInWhichStructureWithArrayIsWorksCorrectly) -{ - // struct a { - // int b[10]; - // }; - // struct c { - // float q; - // struct a d; - // }; - // struct c e[10]; - // - // e[0].d.b[0] = 0; - - struct cl_operand op1; - op1.code = CL_OPERAND_VAR; - op1.data.var = new struct cl_var; - op1.data.var->uid = 2569; - op1.data.var->name = "e"; - op1.data.var->artificial = false; - op1.type = new struct cl_type; - op1.accessor = new struct cl_accessor; - op1.accessor->code = CL_ACCESSOR_DEREF_ARRAY; - op1.accessor->next = new struct cl_accessor; - op1.accessor->next->code = CL_ACCESSOR_ITEM; - op1.accessor->next->data.item.id = 1; - op1.accessor->next->type = new struct cl_type; - op1.accessor->next->type->items = new struct cl_type_item[2]; - op1.accessor->next->type->items[0].name = "q"; - op1.accessor->next->type->items[1].name = "d"; - op1.accessor->next->next = new struct cl_accessor; - op1.accessor->next->next->code = CL_ACCESSOR_ITEM; - op1.accessor->next->next->data.item.id = 0; - op1.accessor->next->next->type = new struct cl_type; - op1.accessor->next->next->type->items = new struct cl_type_item[1]; - op1.accessor->next->next->type->items[0].name = "b"; - op1.accessor->next->next->next = new struct cl_accessor; - op1.accessor->next->next->next->code = CL_ACCESSOR_DEREF_ARRAY; - op1.accessor->next->next->next->next = NULL; - - MemoryPlace *mp1 = OperandToMemoryPlace::convert(&op1); - ASSERT_EQ("e[].d.b[]", mp1->asString()); - ASSERT_FALSE(mp1->isArtificial()); - - delete op1.accessor->next->next->next; - delete [] op1.accessor->next->next->type->items; - delete op1.accessor->next->next->type; - delete op1.accessor->next->next; - delete [] op1.accessor->next->type->items; - delete op1.accessor->next->type; - delete op1.accessor->next; - delete op1.accessor; - delete op1.type; - delete op1.data.var; -} - -TEST_F(OperandToMemoryPlaceTest, -ConversionOfStructureWithArrayOfStructuresWorksCorrectly) -{ - // struct a { - // int b; - // }; - // struct c { - // struct a d[10]; - // } e; - // - // e.d[0].b = 0; - - struct cl_operand op1; - op1.code = CL_OPERAND_VAR; - op1.data.var = new struct cl_var; - op1.data.var->uid = 2569; - op1.data.var->name = "e"; - op1.data.var->artificial = false; - op1.type = new struct cl_type; - op1.accessor = new struct cl_accessor; - op1.accessor->code = CL_ACCESSOR_ITEM; - op1.accessor->data.item.id = 0; - op1.accessor->type = new struct cl_type; - op1.accessor->type->items = new struct cl_type_item[1]; - op1.accessor->type->items[0].name = "d"; - op1.accessor->next = new struct cl_accessor; - op1.accessor->next->code = CL_ACCESSOR_DEREF_ARRAY; - op1.accessor->next->next = new struct cl_accessor; - op1.accessor->next->next->code = CL_ACCESSOR_ITEM; - op1.accessor->next->next->data.item.id = 0; - op1.accessor->next->next->type = new struct cl_type; - op1.accessor->next->next->type->items = new struct cl_type_item[1]; - op1.accessor->next->next->type->items[0].name = "b"; - op1.accessor->next->next->next = NULL; - - MemoryPlace *mp1 = OperandToMemoryPlace::convert(&op1); - ASSERT_EQ("e.d[].b", mp1->asString()); - ASSERT_FALSE(mp1->isArtificial()); - - delete [] op1.accessor->next->next->type->items; - delete op1.accessor->next->next->type; - delete op1.accessor->next->next; - delete op1.accessor->next; - delete [] op1.accessor->type->items; - delete op1.accessor->type; - delete op1.accessor; - delete op1.type; - delete op1.data.var; -} - -TEST_F(OperandToMemoryPlaceTest, -ConversionOfStructureWithArrayOfStructureWithArrayWorksCorrectly) -{ - // struct a { - // int b[10]; - // }; - // struct c { - // struct a d[10]; - // } e; - // - // e.d[0].b[0] = 0; - - struct cl_operand op1; - op1.code = CL_OPERAND_VAR; - op1.data.var = new struct cl_var; - op1.data.var->uid = 2569; - op1.data.var->name = "e"; - op1.data.var->artificial = false; - op1.type = new struct cl_type; - op1.accessor = new struct cl_accessor; - op1.accessor->code = CL_ACCESSOR_ITEM; - op1.accessor->data.item.id = 0; - op1.accessor->type = new struct cl_type; - op1.accessor->type->items = new struct cl_type_item[1]; - op1.accessor->type->items[0].name = "d"; - op1.accessor->next = new struct cl_accessor; - op1.accessor->next->code = CL_ACCESSOR_DEREF_ARRAY; - op1.accessor->next->next = new struct cl_accessor; - op1.accessor->next->next->code = CL_ACCESSOR_ITEM; - op1.accessor->next->next->data.item.id = 0; - op1.accessor->next->next->type = new struct cl_type; - op1.accessor->next->next->type->items = new struct cl_type_item[1]; - op1.accessor->next->next->type->items[0].name = "b"; - op1.accessor->next->next->next = new struct cl_accessor; - op1.accessor->next->next->next->code = CL_ACCESSOR_DEREF_ARRAY; - op1.accessor->next->next->next->next = NULL; - - MemoryPlace *mp1 = OperandToMemoryPlace::convert(&op1); - ASSERT_EQ("e.d[].b[]", mp1->asString()); - ASSERT_FALSE(mp1->isArtificial()); - - delete op1.accessor->next->next->next; - delete [] op1.accessor->next->next->type->items; - delete op1.accessor->next->next->type; - delete op1.accessor->next->next; - delete op1.accessor->next; - delete [] op1.accessor->type->items; - delete op1.accessor->type; - delete op1.accessor; - delete op1.type; - delete op1.data.var; -} - -TEST_F(OperandToMemoryPlaceTest, -ConversionOfStructuresWithSpecifiedIndexesWorksCorrectly) -{ - // struct s { - // float a; - // struct { - // int c; - // float d; - // } b; - // } a; - - struct cl_operand op1; - op1.code = CL_OPERAND_VAR; - op1.data.var = new struct cl_var; - op1.data.var->uid = 2569; - op1.data.var->name = "a"; - op1.data.var->artificial = false; - op1.type = new struct cl_type; - op1.type->code = CL_TYPE_STRUCT; - op1.accessor = NULL; - op1.type->items = new struct cl_type_item[2]; - struct cl_type *tmp1 = new struct cl_type; - tmp1->code = CL_TYPE_REAL; - op1.type->items[0].type = tmp1; - op1.type->items[0].name = "a"; - struct cl_type *tmp2 = new struct cl_type; - tmp2->code = CL_TYPE_STRUCT; - tmp2->items = new struct cl_type_item[2]; - op1.type->items[1].type = tmp2; - op1.type->items[1].name = "b"; - struct cl_type *tmp3 = new struct cl_type; - tmp3->code = CL_TYPE_INT; - op1.type->items[1].type->items[0].type = tmp3; - op1.type->items[1].type->items[0].name = "c"; - struct cl_type *tmp4 = new struct cl_type; - tmp4->code = CL_TYPE_REAL; - op1.type->items[1].type->items[1].type = tmp4; - op1.type->items[1].type->items[1].name = "d"; - - std::deque indexes; - indexes.push_back(0); - MemoryPlace *mp1 = OperandToMemoryPlace::convert(&op1, indexes); - ASSERT_EQ("a.a", mp1->asString()); - ASSERT_FALSE(mp1->isArtificial()); - - indexes.clear(); - indexes.push_back(1); - indexes.push_back(0); - MemoryPlace *mp2 = OperandToMemoryPlace::convert(&op1, indexes); - ASSERT_EQ("a.b.c", mp2->asString()); - ASSERT_FALSE(mp2->isArtificial()); - - indexes.clear(); - indexes.push_back(1); - indexes.push_back(1); - MemoryPlace *mp3 = OperandToMemoryPlace::convert(&op1, indexes); - ASSERT_EQ("a.b.d", mp3->asString()); - ASSERT_FALSE(mp3->isArtificial()); - - delete tmp4; - delete tmp3; - delete [] tmp2->items; - delete tmp2; - delete tmp1; - delete [] op1.type->items; - delete op1.type; - delete op1.data.var; -} - -TEST_F(OperandToMemoryPlaceTest, -ConversionOfStructuresWithArrayWithSpecifiedIndexesWorksCorrectly) -{ - // struct t { - // int e; - // double f; - // } - // struct { - // struct t a[10]; - // } q; - - struct cl_operand op1; - op1.data.var = new struct cl_var; - op1.data.var->uid = 1709; - op1.data.var->name = "q"; - op1.data.var->artificial = false; - op1.code = CL_OPERAND_VAR; - op1.accessor = NULL; - op1.type = new struct cl_type; - op1.type->code = CL_TYPE_STRUCT; - op1.type->items = new struct cl_type_item[1]; - struct cl_type *tmp1 = new struct cl_type; - tmp1->code = CL_TYPE_ARRAY; - tmp1->items = new struct cl_type_item[1]; - op1.type->items[0].type = tmp1; - op1.type->items[0].name = "a"; - struct cl_type *tmp2 = new struct cl_type; - tmp2->code = CL_TYPE_STRUCT; - tmp2->items = new struct cl_type_item[2]; - tmp2->items[0].name = "e"; - tmp2->items[1].name = "f"; - struct cl_type *tmp3 = new struct cl_type; - struct cl_type *tmp4 = new struct cl_type; - tmp3->code = CL_TYPE_INT; - tmp4->code = CL_TYPE_REAL; - tmp2->items[0].type = tmp3; - tmp2->items[1].type = tmp4; - op1.type->items[0].type->items[0].type = tmp2; - - std::deque indexes; - indexes.push_back(0); - indexes.push_back(0); - indexes.push_back(0); - MemoryPlace *mp1 = OperandToMemoryPlace::convert(&op1, indexes); - ASSERT_EQ("q.a[].e", mp1->asString()); - ASSERT_FALSE(mp1->isArtificial()); - - indexes.clear(); - indexes.push_back(0); - indexes.push_back(0); - indexes.push_back(1); - MemoryPlace *mp2 = OperandToMemoryPlace::convert(&op1, indexes); - ASSERT_EQ("q.a[].f", mp2->asString()); - ASSERT_FALSE(mp2->isArtificial()); - - delete tmp4; - delete tmp3; - delete [] tmp2->items; - delete tmp2; - delete tmp1; - delete [] op1.type->items; - delete op1.type; - delete op1.data.var; -} - -int main(int argc, char *argv[]) -{ - ::testing::InitGoogleTest(&argc, argv); - return RUN_ALL_TESTS(); -} - diff --git a/vra/tests-unit/RangeTest.cc b/vra/tests-unit/RangeTest.cc deleted file mode 100644 index c76ce0415..000000000 --- a/vra/tests-unit/RangeTest.cc +++ /dev/null @@ -1,6724 +0,0 @@ -/** -* @author Daniela Ďuričeková, xduric00@stud.fit.vutbr.cz -* @file RangeTest.cc -* @brief Test class for class Range. -* @date 2012 -*/ - -#include -#include -#include "Range.h" -#include "Number.h" -#include "gtest/gtest.h" - -using namespace std; -typedef Range::Interval Interval; - -// Minimal values. -template T vmin() { return numeric_limits::min(); } -template <> float vmin() { return -numeric_limits::max(); } -template <> double vmin() { return -numeric_limits::max(); } -template <> long double vmin() { return -numeric_limits::max(); } - -// Maximal values. -template T vmax() { return numeric_limits::max(); } - -// Number (int or float). -typedef Number N; - - // Int -template -Number I(T val) { return Number(val, sizeof(T), vmin() != 0); } - -// Float -template -Number F(T val) { return Number(val, sizeof(T)); } - -class RangeTest : public ::testing::Test { - protected: - RangeTest() { - } - - virtual ~RangeTest() { - } - - virtual void SetUp() { - } - - virtual void TearDown() { - } - -}; - -//////////////////////////////////////////////////////////////////////////////// -// normalize() -//////////////////////////////////////////////////////////////////////////////// - -TEST_F(RangeTest, -IntervalsAreTransformedIfLowerBoundIsGreaterThanUpperBound) -{ - EXPECT_EQ(Range(Interval(I(vmin()), I(4)), - Interval(I(9), I(vmax()))), - Range(Interval(I(9), I(4)))); - - EXPECT_EQ(Range(Interval(F(vmin()), F(4.9)), - Interval(F(89.5), F(vmax()))), - Range(Interval(F(89.5), F(4.9)))); - - EXPECT_EQ(Range(Interval(I(vmin()), I(4)), - Interval(I(6), I(7)), - Interval(I(9), I(vmax()))), - Range(Interval(I(9), I(4)), - Interval(I(6), I(7)))); - - EXPECT_EQ(Range(Interval(F(vmin()), F(4.9)), - Interval(F(12.5), F(14.3)), - Interval(F(89.5), F(vmax()))), - Range(Interval(F(89.5), F(4.9)), - Interval(F(12.5), F(14.3)))); - - EXPECT_EQ(Range(Interval(I(vmin()), I(4)), - Interval(I(6), I(7)), - Interval(I(12), I(14)), - Interval(I(19), I(vmax()))), - Range(Interval(I(19), I(4)), - Interval(I(6), I(7)), - Interval(I(12), I(14)))); - - EXPECT_EQ(Range(Interval(F(vmin()), F(4)), - Interval(F(6), F(7)), - Interval(F(12), F(14)), - Interval(F(19), F(vmax()))), - Range(Interval(F(19), F(4)), - Interval(F(6), F(7)), - Interval(F(12), F(14)))); -} - -TEST_F(RangeTest, -IntervalsAreSortedCorrectly) -{ - EXPECT_EQ(Range(Interval(I(vmin()), I(9)), - Interval(I(89), I(vmax()))), - Range(Interval(I(89), I(vmax())), - Interval(I(vmin()), I(9)))); - - EXPECT_EQ(Range(Interval(I(4), I(9)), - Interval(I(21), I(23)), - Interval(I(34), I(38))), - Range(Interval(I(34), I(38)), - Interval(I(21), I(23)), - Interval(I(4), I(9)))); - - EXPECT_EQ(Range(Interval(I(1), I(2)), - Interval(I(4), I(5)), - Interval(I(8), I(10)), - Interval(I(15), I(16))), - Range(Interval(I(15), I(16)), - Interval(I(1), I(2)), - Interval(I(8), I(10)), - Interval(I(4), I(5)))); - - EXPECT_EQ(Range(Interval(F(vmin()), F(9.35)), - Interval(F(18.9), F(vmax()))), - Range(Interval(F(18.9), F(vmax())), - Interval(F(vmin()), F(9.35)))); - - EXPECT_EQ(Range(Interval(F(vmin()), F(9.5)), - Interval(F(23.7), F(23.9)), - Interval(F(34.5), F(38.1))), - Range(Interval(F(34.5), F(38.1)), - Interval(F(23.7), F(23.9)), - Interval(F(vmin()), F(9.5)))); - - EXPECT_EQ(Range(Interval(F(1.2), F(2.2)), - Interval(F(4.5), F(5.5)), - Interval(F(8.9), F(10.2)), - Interval(F(15.4), F(vmax()))), - Range(Interval(F(15.4), F(vmax())), - Interval(F(1.2), F(2.2)), - Interval(F(8.9), F(10.2)), - Interval(F(4.5), F(5.5)))); - -} - -TEST_F(RangeTest, -SameIntervalsAreJoinedCorrectly) -{ - EXPECT_EQ(Range(Interval(I(1), I(28))), - Range(Interval(I(1), I(28)), - Interval(I(1), I(28)), - Interval(I(1), I(28)), - Interval(I(1), I(28)))); - - EXPECT_EQ(Range(Interval(F(1), F(28))), - Range(Interval(F(1), F(28)), - Interval(F(1), F(28)), - Interval(F(1), F(28)), - Interval(F(1), F(28)))); -} - -TEST_F(RangeTest, -NestedIntervalsAreJoinedCorrectly) -{ - EXPECT_EQ(Range(Interval(I(vmin()), I(28))), - Range(Interval(I(6), I(23)), - Interval(I(5), I(19)), - Interval(I(2), I(20)), - Interval(I(vmin()), I(28)))); - - EXPECT_EQ(Range(Interval(I(vmin()), I(5)), - Interval(I(9), I(vmax()))), - Range(Interval(I(9), I(4)), - Interval(I(10), I(5)), - Interval(I(2), I(4)), - Interval(I(58), I(60)))); - - EXPECT_EQ(Range(Interval(F(vmin()), F(28.5))), - Range(Interval(F(6.5), F(23.5)), - Interval(F(5.1), F(19.8)), - Interval(F(2.3), F(20.7)), - Interval(F(vmin()), F(28.5)))); - - EXPECT_EQ(Range(Interval(F(vmin()), F(5.5)), - Interval(F(9.7), F(vmax())), - Interval(F(7.1), F(7.3))), - Range(Interval(F(9.7), F(4.5)), - Interval(F(10.9), F(5.5)), - Interval(F(2.4), F(4.8)), - Interval(F(7.1), F(7.3)))); -} - -TEST_F(RangeTest, -OverlappingIntervalsAreJoinedCorrectly) -{ - EXPECT_EQ(Range(Interval(I(vmin()), I(vmax()))), - Range(Interval(I(36), I(52)), - Interval(I(7), I(40)), - Interval(I(3), I(10)), - Interval(I(50), I(5)))); -} - -TEST_F(RangeTest, -NestedAndOverlappingIntervalsAreJoinedCorrectly) -{ - EXPECT_EQ(Range(Interval(F(vmin()), F(8956.23))), - Range(Interval(F(4327.3), F(4350.5)), - Interval(F(4326.8), F(8956.23)), - Interval(F(4256.98), F(7896.36)), - Interval(F(vmin()), F(4356.85)))); -} - -TEST_F(RangeTest, -NeigbouringIntervalsAreJoinedCorrectly) -{ - EXPECT_EQ(Range(Interval(I(1), I(10))), - Range(Interval(I(8), I(10)), - Interval(I(1), I(8)))); - - EXPECT_EQ(Range(Interval(I(1), I(10))), - Range(Interval(I(1), I(7)), - Interval(I(8), I(10)))); - - EXPECT_EQ(Range(Interval(F(1.0), F(10.5))), - Range(Interval(F(8.5), F(10.5)), - Interval(F(1.0), F(8.5)))); - - EXPECT_EQ(Range(Interval(F(1.1), F(10.8))), - Range(Interval(F(1.1), F(8.4)), - Interval(F(8.5), F(10.8)))); - - EXPECT_EQ(Range(Interval(I(vmin()), I(vmax()))), - Range(Interval(I(9), I(4)), - Interval(I(5), I(8)))); -} - -TEST_F(RangeTest, -NotNeighbouringIntervalsAreNotJoined) -{ - EXPECT_EQ(Range(Interval(I(1), I(6)), - Interval(I(8), I(10))), - Range(Interval(I(8), I(10)), - Interval(I(1), I(6)))); - - EXPECT_EQ(Range(Interval(F(1.1), F(8.3)), - Interval(F(8.5), F(10.8))), - Range(Interval(F(1.1), F(8.3)), - Interval(F(8.5), F(10.8)))); -} - -TEST_F(RangeTest, -OnlyOneNanInRangeIsKept) -{ - Range r = Range(Interval(F(NAN), F(NAN)), - Interval(F(-NAN), F(-NAN)), - Interval(F(NAN), F(-NAN)), - Interval(F(-NAN), F(NAN))); - EXPECT_EQ(size_t(1), r.size()); -} - -//////////////////////////////////////////////////////////////////////////////// -// containsNan() -//////////////////////////////////////////////////////////////////////////////// - -TEST_F(RangeTest, -ContainsNanOfEmptyRangeWorksCorrectly) -{ - Range r; - EXPECT_DEATH(r.containsNan(), ".!empty().*"); -} - -TEST_F(RangeTest, -ContainsNanOfRangeThatContainsNanWorksCorrectly) -{ - Range r1 = Range(Interval(F(NAN), F(NAN)), - Interval(F(-NAN), F(-NAN)), - Interval(F(NAN), F(-NAN)), - Interval(F(-NAN), F(NAN))); - EXPECT_TRUE(r1.containsNan()); - - Range r2 = Range(Interval(F(INFINITY), F(INFINITY)), - Interval(F(NAN), F(NAN))); - EXPECT_TRUE(r2.containsNan()); -} - -TEST_F(RangeTest, -ContainsNanOfRangeThatDoesNotContainNanWorksCorrectly) -{ - Range r1 = Range(Interval(I(vmin()), I(4)), - Interval(I(6), I(7)), - Interval(I(12), I(14)), - Interval(I(19), I(vmax()))); - EXPECT_FALSE(r1.containsNan()); - - Range r2 = Range(Interval(F(1.2), F(2.2)), - Interval(F(4.5), F(5.5)), - Interval(F(8.9), F(10.2)), - Interval(F(15.4), F(vmax()))); - EXPECT_FALSE(r2.containsNan()); - - Range r3 = Range(Interval(F(INFINITY), F(INFINITY)), - Interval(F(-INFINITY), F(-INFINITY))); - EXPECT_FALSE(r3.containsNan()); -} - -//////////////////////////////////////////////////////////////////////////////// -// containsPositiveInf() -//////////////////////////////////////////////////////////////////////////////// - -TEST_F(RangeTest, -ContainsPositiveInfOfEmptyRangeWorksCorrectly) -{ - Range r; - EXPECT_DEATH(r.containsPositiveInf(), ".!empty().*"); -} - -TEST_F(RangeTest, -ContainsPositiveInfOfRangeThatContainsPositiveInfWorksCorrectly) -{ - Range r1 = Range(Interval(F(NAN), F(NAN)), - Interval(F(-NAN), F(-NAN)), - Interval(F(NAN), F(-NAN)), - Interval(F(INFINITY), F(INFINITY))); - EXPECT_TRUE(r1.containsPositiveInf()); - - Range r2 = Range(Interval(F(INFINITY), F(INFINITY)), - Interval(F(NAN), F(NAN))); - EXPECT_TRUE(r2.containsPositiveInf()); - - Range r3 = Range(Interval(F(-43.369), F(INFINITY)), - Interval(F(NAN), F(NAN))); - EXPECT_TRUE(r3.containsPositiveInf()); - - Range r4 = Range(Interval(F(-INFINITY), F(INFINITY)), - Interval(F(NAN), F(NAN))); - EXPECT_TRUE(r4.containsPositiveInf()); -} - -TEST_F(RangeTest, -ContainsPositiveInfOfRangeThatDoesNotContainPositiveInfWorksCorrectly) -{ - Range r1 = Range(Interval(I(vmin()), I(4)), - Interval(I(6), I(7)), - Interval(I(12), I(14)), - Interval(I(19), I(vmax()))); - EXPECT_FALSE(r1.containsPositiveInf()); - - Range r2 = Range(Interval(F(1.2), F(2.2)), - Interval(F(4.5), F(5.5)), - Interval(F(8.9), F(10.2)), - Interval(F(15.4), F(vmax()))); - EXPECT_FALSE(r2.containsPositiveInf()); - - Range r3 = Range(Interval(F(NAN), F(NAN)), - Interval(F(-INFINITY), F(-INFINITY))); - EXPECT_FALSE(r3.containsPositiveInf()); -} - -//////////////////////////////////////////////////////////////////////////////// -// containsNegativeInf() -//////////////////////////////////////////////////////////////////////////////// - -TEST_F(RangeTest, -ContainsNegativeInfOfEmptyRangeWorksCorrectly) -{ - Range r; - EXPECT_DEATH(r.containsNegativeInf(), ".!empty().*"); -} - -TEST_F(RangeTest, -ContainsNegativeInfOfRangeThatContainsNegativeInfWorksCorrectly) -{ - Range r1 = Range(Interval(F(NAN), F(NAN)), - Interval(F(-NAN), F(-NAN)), - Interval(F(NAN), F(-NAN)), - Interval(F(-INFINITY), F(-INFINITY))); - EXPECT_TRUE(r1.containsNegativeInf()); - - Range r2 = Range(Interval(F(-INFINITY), F(-INFINITY)), - Interval(F(NAN), F(NAN))); - EXPECT_TRUE(r2.containsNegativeInf()); - - Range r3 = Range(Interval(F(-INFINITY), F(INFINITY)), - Interval(F(NAN), F(NAN))); - EXPECT_TRUE(r3.containsNegativeInf()); - - Range r4 = Range(Interval(F(-INFINITY), F(4.8)), - Interval(F(NAN), F(NAN))); - EXPECT_TRUE(r4.containsNegativeInf()); - - Range r5 = Range(Interval(F(-INFINITY), F(-INFINITY))); - EXPECT_TRUE(r5.containsNegativeInf()); -} - -TEST_F(RangeTest, -ContainsNegativeInfOfRangeThatDoesNotContainNegativeInfWorksCorrectly) -{ - Range r1 = Range(Interval(I(vmin()), I(4)), - Interval(I(6), I(7)), - Interval(I(12), I(14)), - Interval(I(19), I(vmax()))); - EXPECT_FALSE(r1.containsNegativeInf()); - - Range r2 = Range(Interval(F(1.2), F(2.2)), - Interval(F(4.5), F(5.5)), - Interval(F(8.9), F(10.2)), - Interval(F(15.4), F(vmax()))); - EXPECT_FALSE(r2.containsNegativeInf()); - - Range r3 = Range(Interval(F(NAN), F(NAN)), - Interval(F(INFINITY), F(INFINITY))); - EXPECT_FALSE(r3.containsNegativeInf()); -} - -//////////////////////////////////////////////////////////////////////////////// -// containsTrue() -//////////////////////////////////////////////////////////////////////////////// - -TEST_F(RangeTest, -ContainsTrueOfEmptyRangeWorksCorrectly) -{ - Range r; - EXPECT_DEATH(r.containsTrue(), ".!empty().*"); -} - -TEST_F(RangeTest, -ContainsTrueOfRangeThatContainsTrueWorksCorrectly) -{ - Range r1 = Range(Interval(I(-10), I(10))); - EXPECT_TRUE(r1.containsTrue()); - Range r2 = Range(Interval(I(-10), I(0))); - EXPECT_TRUE(r2.containsTrue()); - Range r3 = Range(Interval(I(0), I(10))); - EXPECT_TRUE(r3.containsTrue()); - Range r4 = Range(Interval(I(10), I(50))); - EXPECT_TRUE(r4.containsTrue()); - - Range r5 = Range(Interval(F(INFINITY), F(INFINITY))); - EXPECT_TRUE(r5.containsTrue()); - Range r6 = Range(Interval(F(-INFINITY), F(-INFINITY))); - EXPECT_TRUE(r6.containsTrue()); - Range r7 = Range(Interval(F(NAN), F(NAN))); - EXPECT_TRUE(r7.containsTrue()); -} - -TEST_F(RangeTest, -ContainsTrueOfRangeThatDoesNotContainTrueWorksCorrectly) -{ - Range r1 = Range(Interval(I(0), I(0))); - EXPECT_FALSE(r1.containsTrue()); - Range r2 = Range(Interval(F(0.0), F(0.0))); - EXPECT_FALSE(r2.containsTrue()); -} - -//////////////////////////////////////////////////////////////////////////////// -// containsFalse() -//////////////////////////////////////////////////////////////////////////////// - -TEST_F(RangeTest, -ContainsFalseOfEmptyRangeWorksCorrectly) -{ - Range r; - EXPECT_DEATH(r.containsFalse(), ".!empty().*"); -} - -TEST_F(RangeTest, -ContainsFalseOfRangeThatContainsFalseWorksCorrectly) -{ - Range r1 = Range(Interval(I(0), I(0))); - EXPECT_TRUE(r1.containsFalse()); - Range r2 = Range(Interval(F(0.0), F(0.0))); - EXPECT_TRUE(r2.containsFalse()); - Range r3 = Range(Interval(I(-10), I(10))); - EXPECT_TRUE(r3.containsFalse()); - Range r4 = Range(Interval(I(-10), I(0))); - EXPECT_TRUE(r4.containsFalse()); - Range r5 = Range(Interval(I(0), I(10))); - EXPECT_TRUE(r5.containsFalse()); -} - -TEST_F(RangeTest, -ContainsFalseOfRangeThatDoesNotContainFalseWorksCorrectly) -{ - Range r1 = Range(Interval(I(10), I(50))); - EXPECT_FALSE(r1.containsFalse()); - Range r2 = Range(Interval(F(vmin()), F(-0.1)), - Interval(F(0.1), F(vmax()))); - EXPECT_FALSE(r2.containsFalse()); - - Range r3 = Range(Interval(F(INFINITY), F(INFINITY))); - EXPECT_FALSE(r3.containsFalse()); - Range r4 = Range(Interval(F(-INFINITY), F(-INFINITY))); - EXPECT_FALSE(r4.containsFalse()); - Range r5 = Range(Interval(F(NAN), F(NAN))); - EXPECT_FALSE(r5.containsFalse()); -} - -//////////////////////////////////////////////////////////////////////////////// -// containsZero() -//////////////////////////////////////////////////////////////////////////////// - -TEST_F(RangeTest, -ContainsZeroOfEmptyRangeWorksCorrectly) -{ - Range r; - EXPECT_DEATH(r.containsZero(), ".!empty().*"); -} - -TEST_F(RangeTest, -ContainsZeroOfRangeThatContainsZeroWorksCorrectly) -{ - Range r1 = Range(Interval(I(0), I(0))); - EXPECT_TRUE(r1.containsZero()); - Range r2 = Range(Interval(F(0.0), F(0.0))); - EXPECT_TRUE(r2.containsZero()); - Range r3 = Range(Interval(I(-10), I(10))); - EXPECT_TRUE(r3.containsZero()); - Range r4 = Range(Interval(I(-10), I(0))); - EXPECT_TRUE(r4.containsZero()); - Range r5 = Range(Interval(I(0), I(10))); - EXPECT_TRUE(r5.containsZero()); -} - -TEST_F(RangeTest, -ContainsZeroOfRangeThatDoesNotContainZeroWorksCorrectly) -{ - Range r1 = Range(Interval(I(10), I(50))); - EXPECT_FALSE(r1.containsZero()); - Range r2 = Range(Interval(F(vmin()), F(-0.1)), - Interval(F(0.1), F(vmax()))); - EXPECT_FALSE(r2.containsZero()); - - Range r3 = Range(Interval(F(INFINITY), F(INFINITY))); - EXPECT_FALSE(r3.containsZero()); - Range r4 = Range(Interval(F(-INFINITY), F(-INFINITY))); - EXPECT_FALSE(r4.containsZero()); - Range r5 = Range(Interval(F(NAN), F(NAN))); - EXPECT_FALSE(r5.containsZero()); -} - -//////////////////////////////////////////////////////////////////////////////// -// logicalNot() -//////////////////////////////////////////////////////////////////////////////// - -TEST_F(RangeTest, -LogicalNotOfIntsWorksCorrectly) -{ - EXPECT_EQ(Range(Interval(I(0), I(1))), - logicalNot(Range(Interval(I(-10), I(10))))); - EXPECT_EQ(Range(Interval(I(1), I(1))), - logicalNot(Range(Interval(I(0), I(0))))); - EXPECT_EQ(Range(Interval(I(0), I(0))), - logicalNot(Range(Interval(I(1), I(1))))); -} - -TEST_F(RangeTest, -LogicalNotOfFloatsWorksCorrectly) -{ - EXPECT_EQ(Range(Interval(I(0), I(1))), - logicalNot(Range(Interval(F(-13.58), F(10))))); - EXPECT_EQ(Range(Interval(I(1), I(1))), - logicalNot(Range(Interval(F(0.0), F(0.0))))); - EXPECT_EQ(Range(Interval(I(0), I(0))), - logicalNot(Range(Interval(F(547.5), F(588.8))))); -} - -TEST_F(RangeTest, -LogicalNotOfSpecialFloatsWorksCorrectly) -{ - EXPECT_EQ(Range(Interval(I(0), I(0))), - logicalNot(Range(Interval(F(INFINITY), F(INFINITY))))); - EXPECT_EQ(Range(Interval(I(0), F(0))), - logicalNot(Range(Interval(F(-INFINITY), F(-INFINITY))))); - EXPECT_EQ(Range(Interval(I(0), F(0))), - logicalNot(Range(Interval(F(NAN), F(NAN))))); -} - -//////////////////////////////////////////////////////////////////////////////// -// logicalAnd() -//////////////////////////////////////////////////////////////////////////////// - -TEST_F(RangeTest, -LogicalAndOfIntsWorksCorrectly) -{ - // [0,1] && [0,1] = [0,1] - EXPECT_EQ(Range(Interval(I(0), I(1))), - logicalAnd(Range(Interval(I(-10), I(10))), - Range(Interval(I(0), I(589))))); - // [0,1] && [0] = [0] - EXPECT_EQ(Range(Interval(I(0), I(0))), - logicalAnd(Range(Interval(I(-10), I(10))), - Range(Interval(I(0), I(0))))); - // [0,1] && [1] = [0,1] - EXPECT_EQ(Range(Interval(I(0), I(1))), - logicalAnd(Range(Interval(I(-10), I(10))), - Range(Interval(I(1), I(180))))); - // [0] && [0,1] = [0] - EXPECT_EQ(Range(Interval(I(0), I(0))), - logicalAnd(Range(Interval(I(0), I(0))), - Range(Interval(I(-15), I(180))))); - // [0] && [0] = [0] - EXPECT_EQ(Range(Interval(I(0), I(0))), - logicalAnd(Range(Interval(I(0), I(0))), - Range(Interval(I(0), I(0))))); - // [0] && [1] = [0] - EXPECT_EQ(Range(Interval(I(0), I(0))), - logicalAnd(Range(Interval(I(0), I(0))), - Range(Interval(I(10), I(10))))); - // [1] && [0,1] = [0,1] - EXPECT_EQ(Range(Interval(I(0), I(1))), - logicalAnd(Range(Interval(I(15), I(258))), - Range(Interval(I(-15), I(180))))); - // [1] && [0] = [0] - EXPECT_EQ(Range(Interval(I(0), I(0))), - logicalAnd(Range(Interval(I(15), I(15))), - Range(Interval(I(0), I(0))))); - // [1] && [1] = [1] - EXPECT_EQ(Range(Interval(I(1), I(1))), - logicalAnd(Range(Interval(I(1), I(1))), - Range(Interval(I(10), I(10))))); -} - -TEST_F(RangeTest, -LogicalAndOfIntAndFloatWorksCorrectly) -{ - // [0,1] && [0,1] = [0,1] - EXPECT_EQ(Range(Interval(I(0), I(1))), - logicalAnd(Range(Interval(I(-10), I(10))), - Range(Interval(F(0.0), F(58.9))))); - // [0,1] && [0] = [0] - EXPECT_EQ(Range(Interval(I(0), I(0))), - logicalAnd(Range(Interval(I(-10), I(10))), - Range(Interval(F(0.0), F(0.0))))); - // [0,1] && [1] = [0,1] - EXPECT_EQ(Range(Interval(I(0), I(1))), - logicalAnd(Range(Interval(I(-10), I(10))), - Range(Interval(F(1.58), F(18.0))))); - // [0] && [0,1] = [0] - EXPECT_EQ(Range(Interval(I(0), I(0))), - logicalAnd(Range(Interval(I(0), I(0))), - Range(Interval(F(-15.36), F(18.3))))); - // [0] && [0] = [0] - EXPECT_EQ(Range(Interval(I(0), I(0))), - logicalAnd(Range(Interval(I(0), I(0))), - Range(Interval(F(0.0), F(0.0))))); - // [0] && [1] = [0] - EXPECT_EQ(Range(Interval(I(0), I(0))), - logicalAnd(Range(Interval(I(0), I(0))), - Range(Interval(F(10.5), F(10.8))))); - // [1] && [0,1] = [0,1] - EXPECT_EQ(Range(Interval(I(0), I(1))), - logicalAnd(Range(Interval(I(15), I(258))), - Range(Interval(F(-15.4), F(18.7))))); - // [1] && [0] = [0] - EXPECT_EQ(Range(Interval(I(0), I(0))), - logicalAnd(Range(Interval(I(15), I(15))), - Range(Interval(F(0.0), F(0.0))))); - // [1] && [1] = [1] - EXPECT_EQ(Range(Interval(I(1), I(1))), - logicalAnd(Range(Interval(I(1), I(1))), - Range(Interval(F(1.5), F(10))))); - -} - -TEST_F(RangeTest, -LogicalAndOfFloatAndIntWorksCorrectly) -{ - // [1] && [0,1] = [0,1] - EXPECT_EQ(Range(Interval(I(0), I(1))), - logicalAnd(Range(Interval(F(15.4), F(25.8))), - Range(Interval(I(-15), I(18))))); -} - -TEST_F(RangeTest, -LogicalAndOfFloatsWorksCorrectly) -{ - // [0,1] && [0,1] = [0,1] - EXPECT_EQ(Range(Interval(I(0), I(1))), - logicalAnd(Range(Interval(F(-10), F(10))), - Range(Interval(F(0.0), F(58.9))))); -} - -TEST_F(RangeTest, -LogicalAndOfSpecialFloatsWorksCorrectly) -{ - // [NAN, NAN] && [NAN, NAN] = [1,1] - EXPECT_EQ(Range(Interval(I(1), I(1))), - logicalAnd(Range(Interval(F(NAN), F(NAN))), - Range(Interval(F(NAN), F(NAN))))); - // [NAN, NAN] && [-INF, -INF] = [1,1] - EXPECT_EQ(Range(Interval(I(1), I(1))), - logicalAnd(Range(Interval(F(NAN), F(NAN))), - Range(Interval(F(-INFINITY), F(-INFINITY))))); - // [NAN, NAN] && [INF, INF] = [1,1] - EXPECT_EQ(Range(Interval(I(1), I(1))), - logicalAnd(Range(Interval(F(NAN), F(NAN))), - Range(Interval(F(INFINITY), F(INFINITY))))); - // [NAN, NAN] && [-INF, INF] = [0,1] - EXPECT_EQ(Range(Interval(I(0), I(1))), - logicalAnd(Range(Interval(F(NAN), F(NAN))), - Range(Interval(F(-INFINITY), F(INFINITY))))); - // [INF, INF] && [NAN, NAN] = [1,1] - EXPECT_EQ(Range(Interval(I(1), I(1))), - logicalAnd(Range(Interval(F(INFINITY), F(INFINITY))), - Range(Interval(F(NAN), F(NAN))))); - // [INF, INF] && [-INF, -INF] = [1,1] - EXPECT_EQ(Range(Interval(I(1), I(1))), - logicalAnd(Range(Interval(F(INFINITY), F(INFINITY))), - Range(Interval(F(-INFINITY), F(-INFINITY))))); - // [INF, INF] && [INF, INF] = [1,1] - EXPECT_EQ(Range(Interval(I(1), I(1))), - logicalAnd(Range(Interval(F(INFINITY), F(INFINITY))), - Range(Interval(F(INFINITY), F(INFINITY))))); - // [INF, INF] && [-INF, INF] = [0,1] - EXPECT_EQ(Range(Interval(I(0), I(1))), - logicalAnd(Range(Interval(F(INFINITY), F(INFINITY))), - Range(Interval(F(-INFINITY), F(INFINITY))))); - // [-INF, -INF] && [NAN, NAN] = [1,1] - EXPECT_EQ(Range(Interval(I(1), I(1))), - logicalAnd(Range(Interval(F(-INFINITY), F(-INFINITY))), - Range(Interval(F(NAN), F(NAN))))); - // [-INF, -INF] && [-INF, -INF] = [1,1] - EXPECT_EQ(Range(Interval(I(1), I(1))), - logicalAnd(Range(Interval(F(-INFINITY), F(-INFINITY))), - Range(Interval(F(-INFINITY), F(-INFINITY))))); - // [-INF, -INF] && [INF, INF] = [1,1] - EXPECT_EQ(Range(Interval(I(1), I(1))), - logicalAnd(Range(Interval(F(-INFINITY), F(-INFINITY))), - Range(Interval(F(INFINITY), F(INFINITY))))); - // [-INF, -INF] && [-INF, INF] = [0,1] - EXPECT_EQ(Range(Interval(I(0), I(1))), - logicalAnd(Range(Interval(F(-INFINITY), F(-INFINITY))), - Range(Interval(F(-INFINITY), F(INFINITY))))); - // [-INF, INF] && [NAN, NAN] = [0,1] - EXPECT_EQ(Range(Interval(I(0), I(1))), - logicalAnd(Range(Interval(F(-INFINITY), F(INFINITY))), - Range(Interval(F(NAN), F(NAN))))); - // [-INF, INF] && [-INF, -INF] = [0,1] - EXPECT_EQ(Range(Interval(I(0), I(1))), - logicalAnd(Range(Interval(F(-INFINITY), F(INFINITY))), - Range(Interval(F(-INFINITY), F(-INFINITY))))); - // [-INF, INF] && [INF, INF] = [0,1] - EXPECT_EQ(Range(Interval(I(0), I(1))), - logicalAnd(Range(Interval(F(-INFINITY), F(INFINITY))), - Range(Interval(F(INFINITY), F(INFINITY))))); - // [-INF, INF] && [-INF, INF] = [0,1] - EXPECT_EQ(Range(Interval(I(0), I(1))), - logicalAnd(Range(Interval(F(-INFINITY), F(INFINITY))), - Range(Interval(F(-INFINITY), F(INFINITY))))); -} - -//////////////////////////////////////////////////////////////////////////////// -// logicalOr() -//////////////////////////////////////////////////////////////////////////////// - -TEST_F(RangeTest, -LogicalOrOfIntsWorksCorrectly) -{ - // [0,1] || [0,1] = [0,1] - EXPECT_EQ(Range(Interval(I(0), I(1))), - logicalOr(Range(Interval(I(-10), I(10))), - Range(Interval(I(0), I(589))))); - // [0,1] || [0] = [0,1] - EXPECT_EQ(Range(Interval(I(0), I(1))), - logicalOr(Range(Interval(I(-10), I(10))), - Range(Interval(I(0), I(0))))); - // [0,1] || [1] = [1] - EXPECT_EQ(Range(Interval(I(1), I(1))), - logicalOr(Range(Interval(I(-10), I(10))), - Range(Interval(I(1), I(180))))); - // [0] || [0,1] = [0,1] - EXPECT_EQ(Range(Interval(I(0), I(1))), - logicalOr(Range(Interval(I(0), I(0))), - Range(Interval(I(-15), I(180))))); - // [0] || [0] = [0] - EXPECT_EQ(Range(Interval(I(0), I(0))), - logicalOr(Range(Interval(I(0), I(0))), - Range(Interval(I(0), I(0))))); - // [0] || [1] = [1] - EXPECT_EQ(Range(Interval(I(1), I(1))), - logicalOr(Range(Interval(I(0), I(0))), - Range(Interval(I(10), I(10))))); - // [1] || [0,1] = [1] - EXPECT_EQ(Range(Interval(I(1), I(1))), - logicalOr(Range(Interval(I(15), I(258))), - Range(Interval(I(-15), I(180))))); - // [1] || [0] = [1] - EXPECT_EQ(Range(Interval(I(1), I(1))), - logicalOr(Range(Interval(I(15), I(15))), - Range(Interval(I(0), I(0))))); - // [1] || [1] = [1] - EXPECT_EQ(Range(Interval(I(1), I(1))), - logicalOr(Range(Interval(I(1), I(1))), - Range(Interval(I(10), I(10))))); -} - -TEST_F(RangeTest, -LogicalOrOfIntAndFloatWorksCorrectly) -{ - // [0,1] || [0,1] = [0,1] - EXPECT_EQ(Range(Interval(I(0), I(1))), - logicalOr(Range(Interval(I(-10), I(10))), - Range(Interval(F(0.0), F(5.89))))); - // [0,1] || [0] = [0,1] - EXPECT_EQ(Range(Interval(I(0), I(1))), - logicalOr(Range(Interval(I(-10), I(10))), - Range(Interval(F(0.0), F(0.0))))); - // [0,1] || [1] = [1] - EXPECT_EQ(Range(Interval(I(1), I(1))), - logicalOr(Range(Interval(I(-10), I(10))), - Range(Interval(F(19.5), F(180.2))))); - // [0] || [0,1] = [0,1] - EXPECT_EQ(Range(Interval(I(0), I(1))), - logicalOr(Range(Interval(I(0), I(0))), - Range(Interval(F(-15.7), F(18.0))))); - // [0] || [0] = [0] - EXPECT_EQ(Range(Interval(I(0), I(0))), - logicalOr(Range(Interval(I(0), I(0))), - Range(Interval(F(0.0), F(0.0))))); - // [0] || [1] = [1] - EXPECT_EQ(Range(Interval(I(1), I(1))), - logicalOr(Range(Interval(I(0), I(0))), - Range(Interval(F(10.5), F(10.8))))); - // [1] || [0,1] = [1] - EXPECT_EQ(Range(Interval(I(1), I(1))), - logicalOr(Range(Interval(I(15), I(258))), - Range(Interval(F(-15.8), F(18.9))))); - // [1] || [0] = [1] - EXPECT_EQ(Range(Interval(I(1), I(1))), - logicalOr(Range(Interval(I(15), I(15))), - Range(Interval(F(0.0), F(0.0))))); - // [1] || [1] = [1] - EXPECT_EQ(Range(Interval(I(1), I(1))), - logicalOr(Range(Interval(I(1), I(1))), - Range(Interval(F(10.5), F(10.8))))); -} - -TEST_F(RangeTest, -LogicalOrOfFloatAndIntWorksCorrectly) -{ - // [0] || [0,1] = [0,1] - EXPECT_EQ(Range(Interval(I(0), I(1))), - logicalOr(Range(Interval(F(0.0), F(0.0))), - Range(Interval(I(-15), I(18))))); -} - -TEST_F(RangeTest, -LogicalOrOfFloatsWorksCorrectly) -{ - // [1] || [0,1] = [1] - EXPECT_EQ(Range(Interval(I(1), I(1))), - logicalOr(Range(Interval(F(15), F(258))), - Range(Interval(F(-15.8), F(18.9))))); -} - -TEST_F(RangeTest, -LogicalOrOfSpecialFloatsWorksCorrectly) -{ - // [NAN, NAN] || [NAN, NAN] = [1,1] - EXPECT_EQ(Range(Interval(I(1), I(1))), - logicalOr(Range(Interval(F(NAN), F(NAN))), - Range(Interval(F(NAN), F(NAN))))); - // [NAN, NAN] || [-INF, -INF] = [1,1] - EXPECT_EQ(Range(Interval(I(1), I(1))), - logicalOr(Range(Interval(F(NAN), F(NAN))), - Range(Interval(F(-INFINITY), F(-INFINITY))))); - // [NAN, NAN] || [INF, INF] = [1,1] - EXPECT_EQ(Range(Interval(I(1), I(1))), - logicalOr(Range(Interval(F(NAN), F(NAN))), - Range(Interval(F(INFINITY), F(INFINITY))))); - // [NAN, NAN] || [-INF, INF] = [1,1] - EXPECT_EQ(Range(Interval(I(1), I(1))), - logicalOr(Range(Interval(F(NAN), F(NAN))), - Range(Interval(F(-INFINITY), F(INFINITY))))); - // [INF, INF] || [NAN, NAN] = [1,1] - EXPECT_EQ(Range(Interval(I(1), I(1))), - logicalOr(Range(Interval(F(INFINITY), F(INFINITY))), - Range(Interval(F(NAN), F(NAN))))); - // [INF, INF] || [-INF, -INF] = [1,1] - EXPECT_EQ(Range(Interval(I(1), I(1))), - logicalOr(Range(Interval(F(INFINITY), F(INFINITY))), - Range(Interval(F(-INFINITY), F(-INFINITY))))); - // [INF, INF] || [INF, INF] = [1,1] - EXPECT_EQ(Range(Interval(I(1), I(1))), - logicalOr(Range(Interval(F(INFINITY), F(INFINITY))), - Range(Interval(F(INFINITY), F(INFINITY))))); - // [INF, INF] || [-INF, INF] = [1,1] - EXPECT_EQ(Range(Interval(I(1), I(1))), - logicalOr(Range(Interval(F(INFINITY), F(INFINITY))), - Range(Interval(F(-INFINITY), F(INFINITY))))); - // [-INF, -INF] || [NAN, NAN] = [1,1] - EXPECT_EQ(Range(Interval(I(1), I(1))), - logicalOr(Range(Interval(F(-INFINITY), F(-INFINITY))), - Range(Interval(F(NAN), F(NAN))))); - // [-INF, -INF] || [-INF, -INF] = [1,1] - EXPECT_EQ(Range(Interval(I(1), I(1))), - logicalOr(Range(Interval(F(-INFINITY), F(-INFINITY))), - Range(Interval(F(-INFINITY), F(-INFINITY))))); - // [-INF, -INF] || [INF, INF] = [1,1] - EXPECT_EQ(Range(Interval(I(1), I(1))), - logicalOr(Range(Interval(F(-INFINITY), F(-INFINITY))), - Range(Interval(F(INFINITY), F(INFINITY))))); - // [-INF, -INF] || [-INF, INF] = [1,1] - EXPECT_EQ(Range(Interval(I(1), I(1))), - logicalOr(Range(Interval(F(-INFINITY), F(-INFINITY))), - Range(Interval(F(-INFINITY), F(INFINITY))))); - // [-INF, INF] || [NAN, NAN] = [1,1] - EXPECT_EQ(Range(Interval(I(1), I(1))), - logicalOr(Range(Interval(F(-INFINITY), F(INFINITY))), - Range(Interval(F(NAN), F(NAN))))); - // [-INF, INF] || [-INF, -INF] = [1,1] - EXPECT_EQ(Range(Interval(I(1), I(1))), - logicalOr(Range(Interval(F(-INFINITY), F(INFINITY))), - Range(Interval(F(-INFINITY), F(-INFINITY))))); - // [-INF, INF] || [INF, INF] = [1,1] - EXPECT_EQ(Range(Interval(I(1), I(1))), - logicalOr(Range(Interval(F(-INFINITY), F(INFINITY))), - Range(Interval(F(INFINITY), F(INFINITY))))); - // [-INF, INF] || [-INF, INF] = [0,1] - EXPECT_EQ(Range(Interval(I(0), I(1))), - logicalOr(Range(Interval(F(-INFINITY), F(INFINITY))), - Range(Interval(F(-INFINITY), F(INFINITY))))); -} - -//////////////////////////////////////////////////////////////////////////////// -// logicalXor() -//////////////////////////////////////////////////////////////////////////////// - -TEST_F(RangeTest, -LogicalXorOfIntsWorksCorrectly) -{ - // [0,1] xor [0,1] = [0,1] - EXPECT_EQ(Range(Interval(I(0), I(1))), - logicalXor(Range(Interval(I(-10), I(10))), - Range(Interval(I(0), I(589))))); - // [0,1] xor [0] = [0,1] - EXPECT_EQ(Range(Interval(I(0), I(1))), - logicalXor(Range(Interval(I(-10), I(10))), - Range(Interval(I(0), I(0))))); - // [0,1] xor [1] = [0,1] - EXPECT_EQ(Range(Interval(I(0), I(1))), - logicalXor(Range(Interval(I(-10), I(10))), - Range(Interval(I(1), I(180))))); - // [0] xor [0,1] = [0,1] - EXPECT_EQ(Range(Interval(I(0), I(1))), - logicalXor(Range(Interval(I(0), I(0))), - Range(Interval(I(-15), I(180))))); - // [0] xor [0] = [0] - EXPECT_EQ(Range(Interval(I(0), I(0))), - logicalXor(Range(Interval(I(0), I(0))), - Range(Interval(I(0), I(0))))); - // [0] xor [1] = [1] - EXPECT_EQ(Range(Interval(I(1), I(1))), - logicalXor(Range(Interval(I(0), I(0))), - Range(Interval(I(10), I(10))))); - // [1] xor [0,1] = [0,1] - EXPECT_EQ(Range(Interval(I(0), I(1))), - logicalXor(Range(Interval(I(15), I(258))), - Range(Interval(I(-15), I(180))))); - // [1] xor [0] = [1] - EXPECT_EQ(Range(Interval(I(1), I(1))), - logicalXor(Range(Interval(I(15), I(15))), - Range(Interval(I(0), I(0))))); - // [1] xor [1] = [0] - EXPECT_EQ(Range(Interval(I(0), I(0))), - logicalXor(Range(Interval(I(1), I(1))), - Range(Interval(I(10), I(10))))); -} - -TEST_F(RangeTest, -LogicalXorOfIntAndFloatWorksCorrectly) -{ - // [0,1] xor [0,1] = [0,1] - EXPECT_EQ(Range(Interval(I(0), I(1))), - logicalXor(Range(Interval(I(-10), I(10))), - Range(Interval(F(0.0), F(5.89))))); - // [0,1] xor [0] = [0,1] - EXPECT_EQ(Range(Interval(I(0), I(1))), - logicalXor(Range(Interval(I(-10), I(10))), - Range(Interval(F(0.0), F(0.0))))); - // [0,1] xor [1] = [0,1] - EXPECT_EQ(Range(Interval(I(0), I(1))), - logicalXor(Range(Interval(I(-10), I(10))), - Range(Interval(F(1.9), F(18.0))))); - // [0] xor [0,1] = [0,1] - EXPECT_EQ(Range(Interval(I(0), I(1))), - logicalXor(Range(Interval(I(0), I(0))), - Range(Interval(F(-1.5), F(1.80))))); - // [0] xor [0] = [0] - EXPECT_EQ(Range(Interval(I(0), I(0))), - logicalXor(Range(Interval(I(0), I(0))), - Range(Interval(F(0.0), F(0.0))))); - // [0] xor [1] = [1] - EXPECT_EQ(Range(Interval(I(1), I(1))), - logicalXor(Range(Interval(I(0), I(0))), - Range(Interval(F(10.0), F(10.5))))); - // [1] xor [0,1] = [0,1] - EXPECT_EQ(Range(Interval(I(0), I(1))), - logicalXor(Range(Interval(I(15), I(258))), - Range(Interval(F(-15.8), F(18.0))))); - // [1] xor [0] = [1] - EXPECT_EQ(Range(Interval(I(1), I(1))), - logicalXor(Range(Interval(I(15), I(15))), - Range(Interval(F(0.0), F(0.0))))); - // [1] xor [1] = [0] - EXPECT_EQ(Range(Interval(I(0), I(0))), - logicalXor(Range(Interval(I(1), I(1))), - Range(Interval(F(10.8), F(10.99))))); -} - -TEST_F(RangeTest, -LogicalXorOfFloatAndIntWorksCorrectly) -{ - // [0,1] xor [0,1] = [0,1] - EXPECT_EQ(Range(Interval(I(0), I(1))), - logicalXor(Range(Interval(F(-10.5), F(10.8))), - Range(Interval(I(0), I(589))))); -} - -TEST_F(RangeTest, -LogicalXorOfFloatsWorksCorrectly) -{ - // [0,1] xor [1] = [0,1] - EXPECT_EQ(Range(Interval(I(0), I(1))), - logicalXor(Range(Interval(F(-10), F(10))), - Range(Interval(F(1.9), F(18.0))))); -} - -TEST_F(RangeTest, -LogicalXorOfSpecialFloatsWorksCorrectly) -{ - // [NAN, NAN] xor [NAN, NAN] = [0,0] - EXPECT_EQ(Range(Interval(I(0), I(0))), - logicalXor(Range(Interval(F(NAN), F(NAN))), - Range(Interval(F(NAN), F(NAN))))); - // [NAN, NAN] xor [-INF, -INF] = [0,0] - EXPECT_EQ(Range(Interval(I(0), I(0))), - logicalXor(Range(Interval(F(NAN), F(NAN))), - Range(Interval(F(-INFINITY), F(-INFINITY))))); - // [NAN, NAN] xor [INF, INF] = [0,0] - EXPECT_EQ(Range(Interval(I(0), I(0))), - logicalXor(Range(Interval(F(NAN), F(NAN))), - Range(Interval(F(INFINITY), F(INFINITY))))); - // [NAN, NAN] xor [-INF, INF] = [0,1] - EXPECT_EQ(Range(Interval(I(0), I(1))), - logicalXor(Range(Interval(F(NAN), F(NAN))), - Range(Interval(F(-INFINITY), F(INFINITY))))); - // [INF, INF] xor [NAN, NAN] = [0,0] - EXPECT_EQ(Range(Interval(I(0), I(0))), - logicalXor(Range(Interval(F(INFINITY), F(INFINITY))), - Range(Interval(F(NAN), F(NAN))))); - // [INF, INF] xor [-INF, -INF] = [0,0] - EXPECT_EQ(Range(Interval(I(0), I(0))), - logicalXor(Range(Interval(F(INFINITY), F(INFINITY))), - Range(Interval(F(-INFINITY), F(-INFINITY))))); - // [INF, INF] xor [INF, INF] = [0,0] - EXPECT_EQ(Range(Interval(I(0), I(0))), - logicalXor(Range(Interval(F(INFINITY), F(INFINITY))), - Range(Interval(F(INFINITY), F(INFINITY))))); - // [INF, INF] xor [-INF, INF] = [0,1] - EXPECT_EQ(Range(Interval(I(0), I(1))), - logicalXor(Range(Interval(F(INFINITY), F(INFINITY))), - Range(Interval(F(-INFINITY), F(INFINITY))))); - // [-INF, -INF] xor [NAN, NAN] = [0,0] - EXPECT_EQ(Range(Interval(I(0), I(0))), - logicalXor(Range(Interval(F(-INFINITY), F(-INFINITY))), - Range(Interval(F(NAN), F(NAN))))); - // [-INF, -INF] xor [-INF, -INF] = [0,0] - EXPECT_EQ(Range(Interval(I(0), I(0))), - logicalXor(Range(Interval(F(-INFINITY), F(-INFINITY))), - Range(Interval(F(-INFINITY), F(-INFINITY))))); - // [-INF, -INF] xor [INF, INF] = [0,0] - EXPECT_EQ(Range(Interval(I(0), I(0))), - logicalXor(Range(Interval(F(-INFINITY), F(-INFINITY))), - Range(Interval(F(INFINITY), F(INFINITY))))); - // [-INF, -INF] xor [-INF, INF] = [0,1] - EXPECT_EQ(Range(Interval(I(0), I(1))), - logicalXor(Range(Interval(F(-INFINITY), F(-INFINITY))), - Range(Interval(F(-INFINITY), F(INFINITY))))); - // [-INF, INF] xor [NAN, NAN] = [0,1] - EXPECT_EQ(Range(Interval(I(0), I(1))), - logicalXor(Range(Interval(F(-INFINITY), F(INFINITY))), - Range(Interval(F(NAN), F(NAN))))); - // [-INF, INF] xor [-INF, -INF] = [0,1] - EXPECT_EQ(Range(Interval(I(0), I(1))), - logicalXor(Range(Interval(F(-INFINITY), F(INFINITY))), - Range(Interval(F(-INFINITY), F(-INFINITY))))); - // [-INF, INF] xor [INF, INF] = [0,1] - EXPECT_EQ(Range(Interval(I(0), I(1))), - logicalXor(Range(Interval(F(-INFINITY), F(INFINITY))), - Range(Interval(F(INFINITY), F(INFINITY))))); - // [-INF, INF] xor [-INF, INF] = [0,1] - EXPECT_EQ(Range(Interval(I(0), I(1))), - logicalXor(Range(Interval(F(-INFINITY), F(INFINITY))), - Range(Interval(F(-INFINITY), F(INFINITY))))); -} - -//////////////////////////////////////////////////////////////////////////////// -// ==, != -//////////////////////////////////////////////////////////////////////////////// - -TEST_F(RangeTest, -EmptyRangesAreEqual) -{ - EXPECT_EQ(Range(), Range()); -} - -TEST_F(RangeTest, -TwoRangesContainingSamePointAreEqual) -{ - EXPECT_EQ(Range(I(vmin())), Range(I(vmin()))); - EXPECT_EQ(Range(F(1789.35)), Range(F(1789.35))); - EXPECT_EQ(Range(I(4589)), - Range(Interval(I(4589), I(4589)))); - EXPECT_EQ(Range(F(4589.5689)), - Range(Interval(F(4589.5689), F(4589.5689)))); -} - -TEST_F(RangeTest, -TwoRangesContainingDifferentPointAreNotEqual) -{ - EXPECT_NE(Range(I(vmin())), Range(I(vmax()))); - EXPECT_NE(Range(F(1.35)), Range(F(1789.35))); - EXPECT_NE(Range(I(4589)), - Range(Interval(I(5889), I(5889)))); - EXPECT_NE(Range(F(4589.5689)), - Range(Interval(F(4587.5689), F(4587.5689)))); -} - -TEST_F(RangeTest, -TwoRangesContainingSameIntervalAreEqual) -{ - EXPECT_EQ(Range(Interval(I(vmin()), I(98))), - Range(Interval(I(vmin()), I(98)))); - EXPECT_EQ(Range(Interval(F(436.5), F(9887.8))), - Range(Interval(F(436.5), F(9887.8)))); -} - -TEST_F(RangeTest, -TwoRangesContainingDifferentIntervalAreNotEqual) -{ - EXPECT_NE(Range(Interval(I(vmin()), I(97))), - Range(Interval(I(vmin()), I(vmax())))); - EXPECT_NE(Range(Interval(F(4.5), F(9.8))), - Range(Interval(F(4.49), F(9.8)))); -} - -TEST_F(RangeTest, -TwoRangesContainingTwoSameIntervalsAreEqual) -{ - EXPECT_EQ(Range(Interval(I(vmin()), I(9)), - Interval(I(11), I(13))), - Range(Interval(I(vmin()), I(9)), - Interval(I(11), I(13)))); - - EXPECT_EQ(Range(Interval(F(4.5), F(5.8)), - Interval(F(10.0), F(vmax()))), - Range(Interval(F(4.5), F(5.8)), - Interval(F(10.0), F(vmax())))); -} - -TEST_F(RangeTest, -TwoRangesContainingTwoDifferentIntervalsAreNotEqual) -{ - EXPECT_NE(Range(Interval(I(4), I(9)), - Interval(I(11), I(13))), - Range(Interval(I(4), I(9)), - Interval(I(11), I(vmax())))); - - EXPECT_NE(Range(Interval(F(4.5), F(5.8)), - Interval(F(11.0), F(12.5))), - Range(Interval(F(vmin()), F(5.8)), - Interval(F(11.0), F(12.5)))); -} - -TEST_F(RangeTest, -TwoRangesContainingThreeSameIntervalsAreEqual) -{ - EXPECT_EQ(Range(Interval(I(4), I(9)), - Interval(I(15), I(17)), - Interval(I(19), I(25))), - Range(Interval(I(4), I(9)), - Interval(I(15), I(17)), - Interval(I(19), I(25)))); - - EXPECT_EQ(Range(Interval(F(4.5), F(6.8)), - Interval(F(8.5), F(9.8)), - Interval(F(15.3), F(15.9))), - Range(Interval(F(4.5), F(6.8)), - Interval(F(8.5), F(9.8)), - Interval(F(15.3), F(15.9)))); -} - -TEST_F(RangeTest, -TwoRangesContainingThreeDifferentIntervalsAreNotEqual) -{ - EXPECT_NE(Range(Interval(I(4), I(9)), - Interval(I(15), I(17)), - Interval(I(19), I(25))), - Range(Interval(I(4), I(9)), - Interval(I(15), I(17)), - Interval(I(19), I(24)))); - - EXPECT_NE(Range(Interval(F(4.5), F(6.8)), - Interval(F(8.5), F(9.8)), - Interval(F(15.3), F(15.9))), - Range(Interval(F(4.5), F(6.8)), - Interval(F(8.5), F(9.8)), - Interval(F(15.3), F(15.85)))); -} - -TEST_F(RangeTest, -TwoRangesContainingFourSameIntervalsAreEqual) -{ - EXPECT_EQ(Range(Interval(I(4), I(9)), - Interval(I(15), I(17)), - Interval(I(19), I(25)), - Interval(I(29), I(35))), - Range(Interval(I(4), I(9)), - Interval(I(15), I(17)), - Interval(I(19), I(25)), - Interval(I(29), I(35)))); - - EXPECT_EQ(Range(Interval(F(4.5), F(6.8)), - Interval(F(8.5), F(9.8)), - Interval(F(15.3), F(15.9)), - Interval(F(21.3), F(25.9))), - Range(Interval(F(4.5), F(6.8)), - Interval(F(8.5), F(9.8)), - Interval(F(15.3), F(15.9)), - Interval(F(21.3), F(25.9)))); -} - -TEST_F(RangeTest, -TwoRangesContainingFourDifferentIntervalsAreNotEqual) -{ - EXPECT_NE(Range(Interval(I(4), I(9)), - Interval(I(15), I(17)), - Interval(I(19), I(25)), - Interval(I(29), I(35))), - Range(Interval(I(4), I(9)), - Interval(I(15), I(17)), - Interval(I(19), I(25)), - Interval(I(29), I(vmax())))); - - EXPECT_NE(Range(Interval(F(4.5), F(6.8)), - Interval(F(8.5), F(9.8)), - Interval(F(15.3), F(15.9)), - Interval(F(21.3), F(25.9))), - Range(Interval(F(4.5), F(6.8)), - Interval(F(8.5), F(9.8)), - Interval(F(15.3), F(15.9)), - Interval(F(21.2), F(25.9)))); -} - -//////////////////////////////////////////////////////////////////////////////// -// logicalEq() -//////////////////////////////////////////////////////////////////////////////// - -TEST_F(RangeTest, -LogicalEqOfAtLeastOneEmptyRangeWorksCorrectly) -{ - EXPECT_DEATH(logicalEq(Range(), Range()), ".*r1.empty().*!r2.empty().*"); - EXPECT_DEATH(logicalEq(Range(), Range(Interval(I(0), I(10)))), - ".*r1.empty().*!r2.empty().*"); - EXPECT_DEATH(logicalEq(Range(Interval(I(-145), I(18))), Range()), - ".*r1.empty().*!r2.empty().*"); - EXPECT_DEATH(logicalEq(Range(), Range(Interval(F(1.1), F(1.35)))), - ".*r1.empty().*!r2.empty().*"); - EXPECT_DEATH(logicalEq(Range(Interval(F(-14.5), F(1.8))), Range()), - ".*r1.empty().*!r2.empty().*"); -} - -TEST_F(RangeTest, -LogicalEqOfTwoEqualRangesWorksCorrectly) -{ - EXPECT_TRUE(Range(I(1)) == logicalEq(Range(I(89)), Range(I(89)))); - EXPECT_TRUE(Range(I(1)) == - logicalEq(Range(F(14.5)), Range(F(14.5)))); - - EXPECT_TRUE(Range(Interval(I(0), I(1))) == - logicalEq(Range(Interval(I(4), I(6))), - Range(Interval(I(4), I(6))))); - EXPECT_TRUE(Range(Interval(I(0), I(1))) == - logicalEq(Range(Interval(F(4.5), F(6.8)), - Interval(F(8.5), F(9.8)), - Interval(F(15.3), F(15.9)), - Interval(F(21.3), F(25.9))), - Range(Interval(F(4.5), F(6.8)), - Interval(F(8.5), F(9.8)), - Interval(F(15.3), F(15.9)), - Interval(F(21.3), F(25.9))))); -} - -TEST_F(RangeTest, -LogicalEqOfTwoNonEqualRangesWorksCorrectly) -{ - EXPECT_TRUE(Range(I(0)) == - logicalEq(Range(Interval(I(-89), I(-89))), - Range(Interval(I(90), I(90))))); - EXPECT_TRUE(Range(I(0)) == - logicalEq(Range(Interval(I(89), I(95))), - Range(Interval(I(96), I(98))))); - EXPECT_TRUE(Range(I(0)) == - logicalEq(Range(Interval(I(12), I(15))), - Range(Interval(I(-14), I(0))))); - EXPECT_TRUE(Range(I(0)) == - logicalEq(Range(Interval(F(14.5), F(15))), - Range(Interval(F(16), F(18.9))))); - EXPECT_TRUE(Range(I(0)) == - logicalEq(Range(Interval(I(12.3), I(15.7))), - Range(Interval(I(-14.8), I(-0.8))))); -} - -TEST_F(RangeTest, -LogicalEqOfTwoNeighbouringRangesWorksCorretly) -{ - EXPECT_TRUE(Range(Interval(I(0), I(1))) == - logicalEq(Range(Interval(I(89), I(95))), - Range(Interval(I(95), I(98))))); - EXPECT_TRUE(Range(Interval(I(0), I(1))) == - logicalEq(Range(Interval(I(12), I(15))), - Range(Interval(I(-14), I(12))))); - EXPECT_TRUE(Range(Interval(I(0), I(1))) == - logicalEq(Range(Interval(F(14.5), F(15))), - Range(Interval(F(15), F(18.9))))); - EXPECT_TRUE(Range(Interval(I(0), I(1))) == - logicalEq(Range(Interval(I(12.3), I(15.7))), - Range(Interval(I(-14.8), I(12.3))))); -} - -TEST_F(RangeTest, -LogicalEqOfTwoOverlappingRangesWorksCorrectly) -{ - EXPECT_TRUE(Range(Interval(I(0), I(1))) == - logicalEq(Range(Interval(I(89), I(95))), - Range(Interval(I(93), I(98))))); - EXPECT_TRUE(Range(Interval(I(0), I(1))) == - logicalEq(Range(Interval(I(12), I(15))), - Range(Interval(I(-14), I(13))))); - EXPECT_TRUE(Range(Interval(I(0), I(1))) == - logicalEq(Range(Interval(F(10.5), F(15))), - Range(Interval(F(12.8), F(18.9))))); - EXPECT_TRUE(Range(Interval(I(0), I(1))) == - logicalEq(Range(Interval(I(0.35), I(15.7))), - Range(Interval(I(-14.8), I(12.3))))); -} - -TEST_F(RangeTest, -LogicalEqOfTwoNestingRangesWorksCorrectly) -{ - EXPECT_TRUE(Range(Interval(I(0), I(1))) == - logicalEq(Range(Interval(I(89), I(100))), - Range(Interval(I(93), I(98))))); - EXPECT_TRUE(Range(Interval(I(0), I(1))) == - logicalEq(Range(Interval(I(12), I(15))), - Range(Interval(I(-14), I(23))))); - EXPECT_TRUE(Range(Interval(I(0), I(1))) == - logicalEq(Range(Interval(F(10.5), F(35.8))), - Range(Interval(F(12.8), F(18.9))))); - EXPECT_TRUE(Range(Interval(I(0), I(1))) == - logicalEq(Range(Interval(I(0.35), I(15.7))), - Range(Interval(I(-14.8), I(28.3))))); -} - -TEST_F(RangeTest, -LogicalEqOfTwoSpecialRangesWorksCorrectly) -{ - EXPECT_TRUE(Range(Interval(I(0), I(0))) == - logicalEq(Range(Interval(F(NAN), F(NAN))), - Range(Interval(F(NAN), F(NAN))))); - EXPECT_TRUE(Range(Interval(I(0), I(0))) == - logicalEq(Range(Interval(F(NAN), F(NAN)), - Interval(F(1.3), F(4.8))), - Range(Interval(F(NAN), F(NAN))))); - EXPECT_TRUE(Range(Interval(I(0), I(0))) == - logicalEq(Range(Interval(F(NAN), F(NAN))), - Range(Interval(F(NAN), F(NAN)), - Interval(F(1.3), F(4.8))))); - EXPECT_TRUE(Range(Interval(I(0), I(1))) == - logicalEq(Range(Interval(F(NAN), F(NAN)), - Interval(F(1.3), F(4.8))), - Range(Interval(F(NAN), F(NAN)), - Interval(F(1.3), F(4.8))))); - EXPECT_TRUE(Range(Interval(I(0), I(1))) == - logicalEq(Range(Interval(F(NAN), F(NAN)), - Interval(F(1.3), F(4.8)), - Interval(F(14.3), F(19.5)), - Interval(F(59.8), F(99.9))), - Range(Interval(F(NAN), F(NAN)), - Interval(F(1.3), F(4.8))))); - EXPECT_TRUE(Range(Interval(I(1), I(1))) == - logicalEq(Range(Interval(F(INFINITY), F(INFINITY))), - Range(Interval(F(INFINITY), F(INFINITY))))); - EXPECT_TRUE(Range(Interval(I(1), I(1))) == - logicalEq(Range(Interval(F(-INFINITY), F(-INFINITY))), - Range(Interval(F(-INFINITY), F(-INFINITY))))); - EXPECT_TRUE(Range(Interval(I(0), I(0))) == - logicalEq(Range(Interval(F(-INFINITY), F(-INFINITY))), - Range(Interval(F(INFINITY), F(INFINITY))))); - EXPECT_TRUE(Range(Interval(I(0), I(1))) == - logicalEq(Range(Interval(F(-INFINITY), F(INFINITY))), - Range(Interval(F(-INFINITY), F(INFINITY))))); - EXPECT_TRUE(Range(Interval(I(0), I(1))) == - logicalEq(Range(Interval(F(NAN), F(NAN)), - Interval(F(-INFINITY), F(4.8)), - Interval(F(14.3), F(19.5)), - Interval(F(59.8), F(INFINITY))), - Range(Interval(F(NAN), F(NAN)), - Interval(F(1.3), F(4.8))))); -} - -//////////////////////////////////////////////////////////////////////////////// -// logicalNeq() -//////////////////////////////////////////////////////////////////////////////// - -TEST_F(RangeTest, -LogicalNeqOfAtLeastOneEmptyRangeWorksCorrectly) -{ - EXPECT_DEATH(logicalNeq(Range(), Range()), ".*r1.empty().*!r2.empty().*"); - EXPECT_DEATH(logicalNeq(Range(), Range(Interval(I(0), I(10)))), - ".*r1.empty().*!r2.empty().*"); - EXPECT_DEATH(logicalNeq(Range(Interval(I(-145), I(18))), Range()), - ".*r1.empty().*!r2.empty().*"); - EXPECT_DEATH(logicalNeq(Range(), Range(Interval(F(1.1), F(1.35)))), - ".*r1.empty().*!r2.empty().*"); - EXPECT_DEATH(logicalNeq(Range(Interval(F(-14.5), F(1.8))), Range()), - ".*r1.empty().*!r2.empty().*"); -} - -TEST_F(RangeTest, -LogicalNeqOfTwoEqualRangesWorksCorrectly) -{ - EXPECT_TRUE(Range(I(0)) == logicalNeq(Range(I(89)), Range(I(89)))); - EXPECT_TRUE(Range(I(0)) == - logicalNeq(Range(F(14.5)), Range(F(14.5)))); - - EXPECT_TRUE(Range(Interval(I(0), I(1))) == - logicalNeq(Range(Interval(I(4), I(6))), - Range(Interval(I(4), I(6))))); - EXPECT_TRUE(Range(Interval(I(0), I(1))) == - logicalNeq(Range(Interval(F(4.5), F(6.8)), - Interval(F(8.5), F(9.8)), - Interval(F(15.3), F(15.9)), - Interval(F(21.3), F(25.9))), - Range(Interval(F(4.5), F(6.8)), - Interval(F(8.5), F(9.8)), - Interval(F(15.3), F(15.9)), - Interval(F(21.3), F(25.9))))); -} - -TEST_F(RangeTest, -LogicalNeqOfTwoNonEqualRangesWorksCorrectly) -{ - EXPECT_TRUE(Range(I(1)) == - logicalNeq(Range(Interval(I(89), I(95))), - Range(Interval(I(96), I(98))))); - EXPECT_TRUE(Range(I(1)) == - logicalNeq(Range(Interval(I(12), I(15))), - Range(Interval(I(-14), I(0))))); - EXPECT_TRUE(Range(I(1)) == - logicalNeq(Range(Interval(F(14.5), F(15))), - Range(Interval(F(16), F(18.9))))); - EXPECT_TRUE(Range(I(1)) == - logicalNeq(Range(Interval(I(12.3), I(15.7))), - Range(Interval(I(-14.8), I(-0.8))))); -} - -TEST_F(RangeTest, -LogicalNeqOfTwoNeighbouringRangesWorksCorretly) -{ - EXPECT_TRUE(Range(Interval(I(0), I(1))) == - logicalNeq(Range(Interval(I(89), I(95))), - Range(Interval(I(95), I(98))))); - EXPECT_TRUE(Range(Interval(I(0), I(1))) == - logicalNeq(Range(Interval(I(12), I(15))), - Range(Interval(I(-14), I(12))))); - EXPECT_TRUE(Range(Interval(I(0), I(1))) == - logicalNeq(Range(Interval(F(14.5), F(15))), - Range(Interval(F(15), F(18.9))))); - EXPECT_TRUE(Range(Interval(I(0), I(1))) == - logicalNeq(Range(Interval(I(12.3), I(15.7))), - Range(Interval(I(-14.8), I(12.3))))); -} - -TEST_F(RangeTest, -LogicalNeqOfTwoOverlappingRangesWorksCorrectly) -{ - EXPECT_TRUE(Range(Interval(I(0), I(1))) == - logicalNeq(Range(Interval(I(89), I(95))), - Range(Interval(I(93), I(98))))); - EXPECT_TRUE(Range(Interval(I(0), I(1))) == - logicalNeq(Range(Interval(I(12), I(15))), - Range(Interval(I(-14), I(13))))); - EXPECT_TRUE(Range(Interval(I(0), I(1))) == - logicalNeq(Range(Interval(F(10.5), F(15))), - Range(Interval(F(12.8), F(18.9))))); - EXPECT_TRUE(Range(Interval(I(0), I(1))) == - logicalNeq(Range(Interval(I(0.35), I(15.7))), - Range(Interval(I(-14.8), I(12.3))))); -} - -TEST_F(RangeTest, -LogicalNeqOfTwoNestingRangesWorksCorrectly) -{ - EXPECT_TRUE(Range(Interval(I(0), I(1))) == - logicalNeq(Range(Interval(I(89), I(100))), - Range(Interval(I(93), I(98))))); - EXPECT_TRUE(Range(Interval(I(0), I(1))) == - logicalNeq(Range(Interval(I(12), I(15))), - Range(Interval(I(-14), I(23))))); - EXPECT_TRUE(Range(Interval(I(0), I(1))) == - logicalNeq(Range(Interval(F(10.5), F(35.8))), - Range(Interval(F(12.8), F(18.9))))); - EXPECT_TRUE(Range(Interval(I(0), I(1))) == - logicalNeq(Range(Interval(I(0.35), I(15.7))), - Range(Interval(I(-14.8), I(28.3))))); -} - -TEST_F(RangeTest, -LogicalNeqOfTwoSpecialRangesWorksCorrectly) -{ - EXPECT_TRUE(Range(Interval(I(1), I(1))) == - logicalNeq(Range(Interval(F(NAN), F(NAN))), - Range(Interval(F(NAN), F(NAN))))); - EXPECT_TRUE(Range(Interval(I(1), I(1))) == - logicalNeq(Range(Interval(F(NAN), F(NAN)), - Interval(F(1.3), F(4.8))), - Range(Interval(F(NAN), F(NAN))))); - EXPECT_TRUE(Range(Interval(I(1), I(1))) == - logicalNeq(Range(Interval(F(NAN), F(NAN))), - Range(Interval(F(NAN), F(NAN)), - Interval(F(1.3), F(4.8))))); - EXPECT_TRUE(Range(Interval(I(0), I(1))) == - logicalNeq(Range(Interval(F(NAN), F(NAN)), - Interval(F(1.3), F(4.8))), - Range(Interval(F(NAN), F(NAN)), - Interval(F(1.3), F(4.8))))); - EXPECT_TRUE(Range(Interval(I(0), I(1))) == - logicalNeq(Range(Interval(F(NAN), F(NAN)), - Interval(F(1.3), F(4.8)), - Interval(F(14.3), F(19.5)), - Interval(F(59.8), F(99.9))), - Range(Interval(F(NAN), F(NAN)), - Interval(F(1.3), F(4.8))))); - EXPECT_TRUE(Range(Interval(I(0), I(0))) == - logicalNeq(Range(Interval(F(INFINITY), - F(INFINITY))), - Range(Interval(F(INFINITY), - F(INFINITY))))); - EXPECT_TRUE(Range(Interval(I(0), I(0))) == - logicalNeq(Range(Interval(F(-INFINITY), - F(-INFINITY))), - Range(Interval(F(-INFINITY), - F(-INFINITY))))); - EXPECT_TRUE(Range(Interval(I(1), I(1))) == - logicalNeq(Range(Interval(F(-INFINITY), - F(-INFINITY))), - Range(Interval(F(INFINITY), - F(INFINITY))))); - EXPECT_TRUE(Range(Interval(I(0), I(1))) == - logicalNeq(Range(Interval(F(-INFINITY), - F(INFINITY))), - Range(Interval(F(-INFINITY), - F(INFINITY))))); - EXPECT_TRUE(Range(Interval(I(0), I(1))) == - logicalNeq(Range(Interval(F(NAN), F(NAN)), - Interval(F(-INFINITY), F(4.8)), - Interval(F(14.3), F(19.5)), - Interval(F(59.8), F(INFINITY))), - Range(Interval(F(NAN), F(NAN)), - Interval(F(1.3), F(4.8))))); -} - -//////////////////////////////////////////////////////////////////////////////// -// logicalLt() -//////////////////////////////////////////////////////////////////////////////// - -TEST_F(RangeTest, -LogicalLtOfAtLeastOneEmptyRangeWorksCorrectly) -{ - EXPECT_DEATH(logicalLt(Range(), Range()), ".*r1.empty().*!r2.empty().*"); - EXPECT_DEATH(logicalLt(Range(), Range(Interval(I(0), I(10)))), - ".*r1.empty().*!r2.empty().*"); - EXPECT_DEATH(logicalLt(Range(Interval(I(-145), I(18))), Range()), - ".*r1.empty().*!r2.empty().*"); - EXPECT_DEATH(logicalLt(Range(), Range(Interval(F(1.1), F(1.35)))), - ".*r1.empty().*!r2.empty().*"); - EXPECT_DEATH(logicalLt(Range(Interval(F(-14.5), F(1.8))), Range()), - ".*r1.empty().*!r2.empty().*"); -} - -TEST_F(RangeTest, -LogicalLtOfTwoEqualRangesWorksCorrectly) -{ - EXPECT_TRUE(Range(I(0)) == logicalLt(Range(I(89)), Range(I(89)))); - EXPECT_TRUE(Range(I(0)) == - logicalLt(Range(F(14.5)), Range(F(14.5)))); - - EXPECT_TRUE(Range(Interval(I(0), I(1))) == - logicalLt(Range(Interval(I(4), I(6))), - Range(Interval(I(4), I(6))))); - EXPECT_TRUE(Range(Interval(I(0), I(1))) == - logicalLt(Range(Interval(F(4.5), F(6.8)), - Interval(F(8.5), F(9.8)), - Interval(F(15.3), F(15.9)), - Interval(F(21.3), F(25.9))), - Range(Interval(F(4.5), F(6.8)), - Interval(F(8.5), F(9.8)), - Interval(F(15.3), F(15.9)), - Interval(F(21.3), F(25.9))))); -} - -TEST_F(RangeTest, -LogicalLtOfTwoNonEqualRangesWorksCorrectly) -{ - EXPECT_TRUE(Range(I(1)) == - logicalLt(Range(Interval(I(89), I(95))), - Range(Interval(I(96), I(98))))); - EXPECT_TRUE(Range(I(0)) == - logicalLt(Range(Interval(I(12), I(15))), - Range(Interval(I(-14), I(0))))); - EXPECT_TRUE(Range(I(1)) == - logicalLt(Range(Interval(F(14.5), F(15))), - Range(Interval(F(16), F(18.9))))); - EXPECT_TRUE(Range(I(0)) == - logicalLt(Range(Interval(I(12.3), I(15.7))), - Range(Interval(I(-14.8), I(-0.8))))); -} - -TEST_F(RangeTest, -LogicalLtOfTwoNeighbouringRangesWorksCorretly) -{ - EXPECT_TRUE(Range(Interval(I(0), I(1))) == - logicalLt(Range(Interval(I(89), I(95))), - Range(Interval(I(95), I(98))))); - EXPECT_TRUE(Range(Interval(I(0), I(0))) == - logicalLt(Range(Interval(I(12), I(15))), - Range(Interval(I(-14), I(12))))); - EXPECT_TRUE(Range(Interval(I(0), I(1))) == - logicalLt(Range(Interval(F(14.5), F(15))), - Range(Interval(F(15), F(18.9))))); - EXPECT_TRUE(Range(Interval(I(0), I(0))) == - logicalLt(Range(Interval(I(12.3), I(15.7))), - Range(Interval(I(-14.8), I(12.3))))); -} - -TEST_F(RangeTest, -LogicalLtOfTwoOverlappingRangesWorksCorrectly) -{ - EXPECT_TRUE(Range(Interval(I(0), I(1))) == - logicalLt(Range(Interval(I(89), I(95))), - Range(Interval(I(93), I(98))))); - EXPECT_TRUE(Range(Interval(I(0), I(1))) == - logicalLt(Range(Interval(I(12), I(15))), - Range(Interval(I(-14), I(13))))); - EXPECT_TRUE(Range(Interval(I(0), I(1))) == - logicalLt(Range(Interval(F(10.5), F(15))), - Range(Interval(F(12.8), F(18.9))))); - EXPECT_TRUE(Range(Interval(I(0), I(1))) == - logicalLt(Range(Interval(I(0.35), I(15.7))), - Range(Interval(I(-14.8), I(12.3))))); -} - -TEST_F(RangeTest, -LogicalLtOfTwoNestingRangesWorksCorrectly) -{ - EXPECT_TRUE(Range(Interval(I(0), I(1))) == - logicalLt(Range(Interval(I(89), I(100))), - Range(Interval(I(93), I(98))))); - EXPECT_TRUE(Range(Interval(I(0), I(1))) == - logicalLt(Range(Interval(I(12), I(15))), - Range(Interval(I(-14), I(23))))); - EXPECT_TRUE(Range(Interval(I(0), I(1))) == - logicalLt(Range(Interval(F(10.5), F(35.8))), - Range(Interval(F(12.8), F(18.9))))); - EXPECT_TRUE(Range(Interval(I(0), I(1))) == - logicalLt(Range(Interval(I(0.35), I(15.7))), - Range(Interval(I(-14.8), I(28.3))))); -} - -TEST_F(RangeTest, -LogicalLtOfTwoSpecialRangesWorksCorrectly) -{ - EXPECT_TRUE(Range(Interval(I(0), I(0))) == - logicalLt(Range(Interval(F(NAN), F(NAN))), - Range(Interval(F(NAN), F(NAN))))); - EXPECT_TRUE(Range(Interval(I(0), I(0))) == - logicalLt(Range(Interval(F(NAN), F(NAN)), - Interval(F(1.3), F(4.8))), - Range(Interval(F(NAN), F(NAN))))); - EXPECT_TRUE(Range(Interval(I(0), I(0))) == - logicalLt(Range(Interval(F(NAN), F(NAN))), - Range(Interval(F(NAN), F(NAN)), - Interval(F(1.3), F(4.8))))); - EXPECT_TRUE(Range(Interval(I(0), I(1))) == - logicalLt(Range(Interval(F(NAN), F(NAN)), - Interval(F(1.3), F(4.8))), - Range(Interval(F(NAN), F(NAN)), - Interval(F(1.3), F(4.8))))); - EXPECT_TRUE(Range(Interval(I(0), I(1))) == - logicalLt(Range(Interval(F(NAN), F(NAN)), - Interval(F(1.3), F(4.8)), - Interval(F(14.3), F(19.5)), - Interval(F(59.8), F(99.9))), - Range(Interval(F(NAN), F(NAN)), - Interval(F(1.3), F(4.8))))); - EXPECT_TRUE(Range(Interval(I(0), I(0))) == - logicalLt(Range(Interval(F(INFINITY), F(INFINITY))), - Range(Interval(F(INFINITY), F(INFINITY))))); - EXPECT_TRUE(Range(Interval(I(0), I(0))) == - logicalLt(Range(Interval(F(-INFINITY), F(-INFINITY))), - Range(Interval(F(-INFINITY), F(-INFINITY))))); - EXPECT_TRUE(Range(Interval(I(1), I(1))) == - logicalLt(Range(Interval(F(-INFINITY), F(-INFINITY))), - Range(Interval(F(INFINITY), F(INFINITY))))); - EXPECT_TRUE(Range(Interval(I(0), I(1))) == - logicalLt(Range(Interval(F(-INFINITY), F(INFINITY))), - Range(Interval(F(-INFINITY), F(INFINITY))))); - EXPECT_TRUE(Range(Interval(I(0), I(1))) == - logicalLt(Range(Interval(F(NAN), F(NAN)), - Interval(F(-INFINITY), F(4.8)), - Interval(F(14.3), F(19.5)), - Interval(F(59.8), F(INFINITY))), - Range(Interval(F(NAN), F(NAN)), - Interval(F(1.3), F(4.8))))); -} - -//////////////////////////////////////////////////////////////////////////////// -// logicalGt() -//////////////////////////////////////////////////////////////////////////////// - -TEST_F(RangeTest, -LogicalGtOfAtLeastOneEmptyRangeWorksCorrectly) -{ - EXPECT_DEATH(logicalGt(Range(), Range()), ".*r1.empty().*!r2.empty().*"); - EXPECT_DEATH(logicalGt(Range(), Range(Interval(I(0), I(10)))), - ".*r1.empty().*!r2.empty().*"); - EXPECT_DEATH(logicalGt(Range(Interval(I(-145), I(18))), Range()), - ".*r1.empty().*!r2.empty().*"); - EXPECT_DEATH(logicalGt(Range(), Range(Interval(F(1.1), F(1.35)))), - ".*r1.empty().*!r2.empty().*"); - EXPECT_DEATH(logicalGt(Range(Interval(F(-14.5), F(1.8))), Range()), - ".*r1.empty().*!r2.empty().*"); -} - -TEST_F(RangeTest, -LogicalGtOfTwoEqualRangesWorksCorrectly) -{ - EXPECT_TRUE(Range(I(0)) == logicalGt(Range(I(89)), Range(I(89)))); - EXPECT_TRUE(Range(I(0)) == - logicalGt(Range(F(14.5)), Range(F(14.5)))); - - EXPECT_TRUE(Range(Interval(I(0), I(1))) == - logicalGt(Range(Interval(I(4), I(6))), - Range(Interval(I(4), I(6))))); - EXPECT_TRUE(Range(Interval(I(0), I(1))) == - logicalGt(Range(Interval(F(4.5), F(6.8)), - Interval(F(8.5), F(9.8)), - Interval(F(15.3), F(15.9)), - Interval(F(21.3), F(25.9))), - Range(Interval(F(4.5), F(6.8)), - Interval(F(8.5), F(9.8)), - Interval(F(15.3), F(15.9)), - Interval(F(21.3), F(25.9))))); -} - -TEST_F(RangeTest, -LogicalGtOfTwoNonEqualRangesWorksCorrectly) -{ - EXPECT_TRUE(Range(I(0)) == - logicalGt(Range(Interval(I(89), I(95))), - Range(Interval(I(96), I(98))))); - EXPECT_TRUE(Range(I(1)) == - logicalGt(Range(Interval(I(12), I(15))), - Range(Interval(I(-14), I(0))))); - EXPECT_TRUE(Range(I(0)) == - logicalGt(Range(Interval(F(14.5), F(15))), - Range(Interval(F(16), F(18.9))))); - EXPECT_TRUE(Range(I(1)) == - logicalGt(Range(Interval(I(12.3), I(15.7))), - Range(Interval(I(-14.8), I(-0.8))))); -} - -TEST_F(RangeTest, -LogicalGtOfTwoNeighbouringRangesWorksCorretly) -{ - EXPECT_TRUE(Range(Interval(I(0), I(0))) == - logicalGt(Range(Interval(I(89), I(95))), - Range(Interval(I(95), I(98))))); - EXPECT_TRUE(Range(Interval(I(0), I(1))) == - logicalGt(Range(Interval(I(12), I(15))), - Range(Interval(I(-14), I(12))))); - EXPECT_TRUE(Range(Interval(I(0), I(0))) == - logicalGt(Range(Interval(F(14.5), F(15))), - Range(Interval(F(15), F(18.9))))); - EXPECT_TRUE(Range(Interval(I(0), I(1))) == - logicalGt(Range(Interval(I(12.3), I(15.7))), - Range(Interval(I(-14.8), I(12.3))))); -} - -TEST_F(RangeTest, -LogicalGtOfTwoOverlappingRangesWorksCorrectly) -{ - EXPECT_TRUE(Range(Interval(I(0), I(1))) == - logicalGt(Range(Interval(I(89), I(95))), - Range(Interval(I(93), I(98))))); - EXPECT_TRUE(Range(Interval(I(0), I(1))) == - logicalGt(Range(Interval(I(12), I(15))), - Range(Interval(I(-14), I(13))))); - EXPECT_TRUE(Range(Interval(I(0), I(1))) == - logicalGt(Range(Interval(F(10.5), F(15))), - Range(Interval(F(12.8), F(18.9))))); - EXPECT_TRUE(Range(Interval(I(0), I(1))) == - logicalGt(Range(Interval(I(0.35), I(15.7))), - Range(Interval(I(-14.8), I(12.3))))); -} - -TEST_F(RangeTest, -LogicalGtOfTwoNestingRangesWorksCorrectly) -{ - EXPECT_TRUE(Range(Interval(I(0), I(1))) == - logicalGt(Range(Interval(I(89), I(100))), - Range(Interval(I(93), I(98))))); - EXPECT_TRUE(Range(Interval(I(0), I(1))) == - logicalGt(Range(Interval(I(12), I(15))), - Range(Interval(I(-14), I(23))))); - EXPECT_TRUE(Range(Interval(I(0), I(1))) == - logicalGt(Range(Interval(F(10.5), F(35.8))), - Range(Interval(F(12.8), F(18.9))))); - EXPECT_TRUE(Range(Interval(I(0), I(1))) == - logicalGt(Range(Interval(I(0.35), I(15.7))), - Range(Interval(I(-14.8), I(28.3))))); -} - -TEST_F(RangeTest, -LogicalGtOfTwoSpecialRangesWorksCorrectly) -{ - EXPECT_TRUE(Range(Interval(I(0), I(0))) == - logicalGt(Range(Interval(F(NAN), F(NAN))), - Range(Interval(F(NAN), F(NAN))))); - EXPECT_TRUE(Range(Interval(I(0), I(0))) == - logicalGt(Range(Interval(F(NAN), F(NAN)), - Interval(F(1.3), F(4.8))), - Range(Interval(F(NAN), F(NAN))))); - EXPECT_TRUE(Range(Interval(I(0), I(0))) == - logicalGt(Range(Interval(F(NAN), F(NAN))), - Range(Interval(F(NAN), F(NAN)), - Interval(F(1.3), F(4.8))))); - EXPECT_TRUE(Range(Interval(I(0), I(1))) == - logicalGt(Range(Interval(F(NAN), F(NAN)), - Interval(F(1.3), F(4.8))), - Range(Interval(F(NAN), F(NAN)), - Interval(F(1.3), F(4.8))))); - EXPECT_TRUE(Range(Interval(I(0), I(1))) == - logicalGt(Range(Interval(F(NAN), F(NAN)), - Interval(F(1.3), F(4.8)), - Interval(F(14.3), F(19.5)), - Interval(F(59.8), F(99.9))), - Range(Interval(F(NAN), F(NAN)), - Interval(F(1.3), F(4.8))))); - EXPECT_TRUE(Range(Interval(I(0), I(0))) == - logicalGt(Range(Interval(F(INFINITY), F(INFINITY))), - Range(Interval(F(INFINITY), F(INFINITY))))); - EXPECT_TRUE(Range(Interval(I(0), I(0))) == - logicalGt(Range(Interval(F(-INFINITY), F(-INFINITY))), - Range(Interval(F(-INFINITY), F(-INFINITY))))); - EXPECT_TRUE(Range(Interval(I(0), I(0))) == - logicalGt(Range(Interval(F(-INFINITY), F(-INFINITY))), - Range(Interval(F(INFINITY), F(INFINITY))))); - EXPECT_TRUE(Range(Interval(I(0), I(1))) == - logicalGt(Range(Interval(F(-INFINITY), F(INFINITY))), - Range(Interval(F(-INFINITY), F(INFINITY))))); - EXPECT_TRUE(Range(Interval(I(0), I(1))) == - logicalGt(Range(Interval(F(NAN), F(NAN)), - Interval(F(-INFINITY), F(4.8)), - Interval(F(14.3), F(19.5)), - Interval(F(59.8), F(INFINITY))), - Range(Interval(F(NAN), F(NAN)), - Interval(F(1.3), F(4.8))))); -} - -//////////////////////////////////////////////////////////////////////////////// -// logicalLtEq() -//////////////////////////////////////////////////////////////////////////////// - -TEST_F(RangeTest, -LogicalLtEqOfNonSpecialRangesWorksCorrectly) -{ - EXPECT_DEATH(logicalLtEq(Range(), Range()), ".*r1.empty().*!r2.empty().*"); - EXPECT_TRUE(Range(I(0)) == - logicalLtEq(Range(Interval(F(18), F(28.9))), - Range(Interval(F(16), F(17))))); - EXPECT_TRUE(Range(I(1)) == - logicalLtEq(Range(Interval(F(14.5), F(16))), - Range(Interval(F(16), F(18.9))))); - EXPECT_TRUE(Range(Interval(I(0), I(1))) == - logicalLtEq(Range(Interval(F(14.5), F(17))), - Range(Interval(F(16), F(18.9))))); - EXPECT_TRUE(Range(Interval(I(0), I(1))) == - logicalLtEq(Range(Interval(F(10.5), F(15))), - Range(Interval(F(12.8), F(18.9))))); - EXPECT_TRUE(Range(Interval(I(0), I(1))) == - logicalLtEq(Range(Interval(F(10.5), F(35.8))), - Range(Interval(F(12.8), F(18.9))))); -} - -TEST_F(RangeTest, -LogicalLtEqOfSpecialRangesWorksCorrectly) -{ - EXPECT_TRUE(Range(Interval(I(0), I(0))) == - logicalLtEq(Range(Interval(F(NAN), F(NAN))), - Range(Interval(F(NAN), F(NAN))))); - EXPECT_TRUE(Range(Interval(I(0), I(0))) == - logicalLtEq(Range(Interval(F(NAN), F(NAN)), - Interval(F(1.3), F(4.8))), - Range(Interval(F(NAN), F(NAN))))); - EXPECT_TRUE(Range(Interval(I(0), I(0))) == - logicalLtEq(Range(Interval(F(NAN), F(NAN))), - Range(Interval(F(NAN), F(NAN)), - Interval(F(1.3), F(4.8))))); - EXPECT_TRUE(Range(Interval(I(0), I(1))) == - logicalLtEq(Range(Interval(F(NAN), F(NAN)), - Interval(F(1.3), F(4.8))), - Range(Interval(F(NAN), F(NAN)), - Interval(F(1.3), F(4.8))))); - EXPECT_TRUE(Range(Interval(I(0), I(1))) == - logicalLtEq(Range(Interval(F(NAN), F(NAN)), - Interval(F(1.3), F(4.8)), - Interval(F(14.3), F(19.5)), - Interval(F(59.8), F(99.9))), - Range(Interval(F(NAN), F(NAN)), - Interval(F(1.3), F(4.8))))); - EXPECT_TRUE(Range(Interval(I(1), I(1))) == - logicalLtEq(Range(Interval(F(INFINITY), - F(INFINITY))), - Range(Interval(F(INFINITY), - F(INFINITY))))); - EXPECT_TRUE(Range(Interval(I(1), I(1))) == - logicalLtEq(Range(Interval(F(-INFINITY), - F(-INFINITY))), - Range(Interval(F(-INFINITY), - F(-INFINITY))))); - EXPECT_TRUE(Range(Interval(I(1), I(1))) == - logicalLtEq(Range(Interval(F(-INFINITY), - F(-INFINITY))), - Range(Interval(F(INFINITY), - F(INFINITY))))); - EXPECT_TRUE(Range(Interval(I(0), I(1))) == - logicalLtEq(Range(Interval(F(-INFINITY), - F(INFINITY))), - Range(Interval(F(-INFINITY), - F(INFINITY))))); - EXPECT_TRUE(Range(Interval(I(0), I(1))) == - logicalLtEq(Range(Interval(F(NAN), F(NAN)), - Interval(F(-INFINITY), F(4.8)), - Interval(F(14.3), F(19.5)), - Interval(F(59.8), F(INFINITY))), - Range(Interval(F(NAN), F(NAN)), - Interval(F(1.3), F(4.8))))); -} - -//////////////////////////////////////////////////////////////////////////////// -// logicalGtEq() -//////////////////////////////////////////////////////////////////////////////// - -TEST_F(RangeTest, -LogicalGtEqOfNonSpecialRangesWorksCorrectly) -{ - EXPECT_DEATH(logicalGtEq(Range(), Range()), ".*r1.empty().*!r2.empty().*"); - EXPECT_TRUE(Range(I(1)) == - logicalGtEq(Range(Interval(F(18), F(28.9))), - Range(Interval(F(16), F(17))))); - EXPECT_TRUE(Range(I(0)) == - logicalGtEq(Range(Interval(F(18), F(28.9))), - Range(Interval(F(30), F(37.5))))); - EXPECT_TRUE(Range(Interval(I(0), I(1))) == - logicalGtEq(Range(Interval(F(14.5), F(16))), - Range(Interval(F(16), F(18.9))))); - EXPECT_TRUE(Range(Interval(I(0), I(1))) == - logicalGtEq(Range(Interval(F(14.5), F(17))), - Range(Interval(F(16), F(18.9))))); - EXPECT_TRUE(Range(Interval(I(0), I(1))) == - logicalGtEq(Range(Interval(F(10.5), F(15))), - Range(Interval(F(12.8), F(18.9))))); - EXPECT_TRUE(Range(Interval(I(0), I(1))) == - logicalGtEq(Range(Interval(F(10.5), F(35.8))), - Range(Interval(F(12.8), F(18.9))))); -} - -TEST_F(RangeTest, -LogicalGtEqOfSpecialRangesWorksCorrectly) -{ - EXPECT_TRUE(Range(Interval(I(0), I(0))) == - logicalGtEq(Range(Interval(F(NAN), F(NAN))), - Range(Interval(F(NAN), F(NAN))))); - EXPECT_TRUE(Range(Interval(I(0), I(0))) == - logicalGtEq(Range(Interval(F(NAN), F(NAN)), - Interval(F(1.3), F(4.8))), - Range(Interval(F(NAN), F(NAN))))); - EXPECT_TRUE(Range(Interval(I(0), I(0))) == - logicalGtEq(Range(Interval(F(NAN), F(NAN))), - Range(Interval(F(NAN), F(NAN)), - Interval(F(1.3), F(4.8))))); - EXPECT_TRUE(Range(Interval(I(0), I(1))) == - logicalGtEq(Range(Interval(F(NAN), F(NAN)), - Interval(F(1.3), F(4.8))), - Range(Interval(F(NAN), F(NAN)), - Interval(F(1.3), F(4.8))))); - EXPECT_TRUE(Range(Interval(I(0), I(1))) == - logicalGtEq(Range(Interval(F(NAN), F(NAN)), - Interval(F(1.3), F(4.8)), - Interval(F(14.3), F(19.5)), - Interval(F(59.8), F(99.9))), - Range(Interval(F(NAN), F(NAN)), - Interval(F(1.3), F(4.8))))); - EXPECT_TRUE(Range(Interval(I(1), I(1))) == - logicalGtEq(Range(Interval(F(INFINITY), - F(INFINITY))), - Range(Interval(F(INFINITY), - F(INFINITY))))); - EXPECT_TRUE(Range(Interval(I(1), I(1))) == - logicalGtEq(Range(Interval(F(-INFINITY), - F(-INFINITY))), - Range(Interval(F(-INFINITY), - F(-INFINITY))))); - EXPECT_TRUE(Range(Interval(I(0), I(0))) == - logicalGtEq(Range(Interval(F(-INFINITY), - F(-INFINITY))), - Range(Interval(F(INFINITY), - F(INFINITY))))); - EXPECT_TRUE(Range(Interval(I(0), I(1))) == - logicalGtEq(Range(Interval(F(-INFINITY), - F(INFINITY))), - Range(Interval(F(-INFINITY), - F(INFINITY))))); - EXPECT_TRUE(Range(Interval(I(0), I(1))) == - logicalGtEq(Range(Interval(F(NAN), F(NAN)), - Interval(F(-INFINITY), F(4.8)), - Interval(F(14.3), F(19.5)), - Interval(F(59.8), F(INFINITY))), - Range(Interval(F(NAN), F(NAN)), - Interval(F(1.3), F(4.8))))); -} - -//////////////////////////////////////////////////////////////////////////////// -// isIntegral() -//////////////////////////////////////////////////////////////////////////////// - -TEST_F(RangeTest, -IsIntegralOfEmptyRangeWorksCorrectly) -{ - EXPECT_DEATH((Range()).isIntegral(), ".*!empty().*"); -} - -TEST_F(RangeTest, -IsIntegralOfIntegralRangeWorksCorrectly) -{ - EXPECT_TRUE((Range(I(15))).isIntegral()); - EXPECT_TRUE((Range(Interval(I(-125), I(58)))).isIntegral()); -} - -TEST_F(RangeTest, -IsIntegralOfFloatingPointRangeWorksCorrectly) -{ - EXPECT_FALSE((Range(F(15.58))).isIntegral()); - EXPECT_FALSE((Range(Interval(F(-12.5), I(5.8)))).isIntegral()); -} - - -//////////////////////////////////////////////////////////////////////////////// -// isFloatingPoint() -//////////////////////////////////////////////////////////////////////////////// - -TEST_F(RangeTest, -IsFloatingPointOfEmptyRangeWorksCorrectly) -{ - EXPECT_DEATH((Range()).isFloatingPoint(), ".*!empty().*"); -} - -TEST_F(RangeTest, -IsFloatingPointOfIntegralRangeWorksCorrectly) -{ - EXPECT_FALSE((Range(I(15))).isFloatingPoint()); - EXPECT_FALSE((Range(Interval(I(-125), I(58)))).isFloatingPoint()); -} - -TEST_F(RangeTest, -IsFloatingPointOfFloatingPointRangeWorksCorrectly) -{ - EXPECT_TRUE((Range(F(15.58))).isFloatingPoint()); - EXPECT_TRUE((Range(Interval(F(2.5), I(5)))).isFloatingPoint()); -} - -//////////////////////////////////////////////////////////////////////////////// -// isSigned() -//////////////////////////////////////////////////////////////////////////////// - -TEST_F(RangeTest, -IsSignedOfEmptyRangeWorksCorrectly) -{ - EXPECT_DEATH((Range()).isSigned(), ".*!empty().*"); -} - -TEST_F(RangeTest, -IsSignedOfIntegralRangeWorksCorrectly) -{ - EXPECT_TRUE((Range(I(15))).isSigned()); - EXPECT_TRUE((Range(Interval(I(-125), I(58)))).isSigned()); - EXPECT_FALSE((Range(I(15))).isSigned()); - EXPECT_FALSE((Range(Interval(I(2), I(58)))).isSigned()); -} - -TEST_F(RangeTest, -IsSignedOfFloatingPointRangeWorksCorrectly) -{ - EXPECT_FALSE((Range(F(15.58))).isSigned()); - EXPECT_FALSE((Range(Interval(F(2.5), I(5)))).isSigned()); -} - -//////////////////////////////////////////////////////////////////////////////// -// isUnsigned() -//////////////////////////////////////////////////////////////////////////////// - -TEST_F(RangeTest, -IsUnsignedOfEmptyRangeWorksCorrectly) -{ - EXPECT_DEATH((Range()).isUnsigned(), ".*!empty().*"); -} - -TEST_F(RangeTest, -IsUnsignedOfIntegralRangeWorksCorrectly) -{ - EXPECT_FALSE((Range(I(15))).isUnsigned()); - EXPECT_FALSE((Range(Interval(I(-125), I(58)))).isUnsigned()); - EXPECT_TRUE((Range(I(15))).isUnsigned()); - EXPECT_TRUE((Range(Interval(I(2), I(58)))).isUnsigned()); -} - -TEST_F(RangeTest, -IsUnsignedOfFloatingPointRangeWorksCorrectly) -{ - EXPECT_FALSE((Range(F(15.58))).isUnsigned()); - EXPECT_FALSE((Range(Interval(F(2.5), I(5)))).isUnsigned()); -} - -//////////////////////////////////////////////////////////////////////////////// -// hasSameTypeAs() -//////////////////////////////////////////////////////////////////////////////// - -TEST_F(RangeTest, -HasSameTypeAsOfSameTypeRangesWorksCorrectly) -{ - EXPECT_TRUE((Range(I(1))).hasSameTypeAs(Range(I(1)))); - EXPECT_TRUE((Range(I(1))).hasSameTypeAs(Range(I(1)))); - EXPECT_TRUE((Range(F(1))).hasSameTypeAs(Range(F(1)))); -} - -TEST_F(RangeTest, -HasSameTypeAsOfDifferentTypeRangesWorkscCorrectly) -{ - EXPECT_FALSE((Range(I(1))).hasSameTypeAs(Range(I(1)))); - EXPECT_FALSE((Range(I(1))).hasSameTypeAs(Range(I(1)))); - EXPECT_FALSE((Range(I(1))).hasSameTypeAs(Range(F(1)))); -} - -TEST_F(RangeTest, -HasSameTypeAsOfEmptyRangesWorksCorretly) -{ - EXPECT_DEATH((Range()).hasSameTypeAs(Range()),".*!empty().*!r.empty().*"); - EXPECT_DEATH((Range()).hasSameTypeAs(Range(I(0))), - ".*!empty().*!r.empty().*"); - EXPECT_DEATH((Range(F(3.6))).hasSameTypeAs(Range()), - ".*!empty().*!r.empty().*"); -} - -//////////////////////////////////////////////////////////////////////////////// -// containsOnlySingleNumber() -//////////////////////////////////////////////////////////////////////////////// - -TEST_F(RangeTest, -RangesWithSingleNumberContainsOnlySingleNumber) -{ - EXPECT_TRUE(Range(I(1)).containsOnlySingleNumber()); - EXPECT_TRUE(Range(F(4.5)).containsOnlySingleNumber()); -} - -TEST_F(RangeTest, -RangesWithMoreNumbersDoNotContainOnlySingleNumber) -{ - EXPECT_FALSE(Range(Interval(I(1), I(2))).containsOnlySingleNumber()); - EXPECT_FALSE(Range(Interval(F(4.5), I(6.7))).containsOnlySingleNumber()); -} - -//////////////////////////////////////////////////////////////////////////////// -// containsIntegralMin() -//////////////////////////////////////////////////////////////////////////////// - -TEST_F(RangeTest, -ContainsIntegralMinRangeContainsIntegralMin) -{ - EXPECT_TRUE(Range(I(vmin())).containsIntegralMin()); - EXPECT_TRUE(Range(Interval(I(vmin()), I(0))).containsIntegralMin()); - - EXPECT_TRUE(Range(I(vmin())).containsIntegralMin()); - EXPECT_TRUE(Range(Interval(I(vmin()), I(0))).containsIntegralMin()); - - EXPECT_TRUE(Range(I(vmin())).containsIntegralMin()); - EXPECT_TRUE(Range(Interval(I(vmin()), I(10))).containsIntegralMin()); -} - -TEST_F(RangeTest, -ContainsIntegralMinRangeDoesNotContainIntegralMin) -{ - EXPECT_FALSE(Range(I(vmin() + 1)).containsIntegralMin()); - EXPECT_FALSE(Range(Interval(I(vmin() + 1), I(-1))).containsIntegralMin()); - - EXPECT_FALSE(Range(F(vmin())).containsIntegralMin()); - EXPECT_FALSE(Range(F(-INFINITY)).containsIntegralMin()); -} - -//////////////////////////////////////////////////////////////////////////////// -// containsIntegralMinusOne() -//////////////////////////////////////////////////////////////////////////////// - -TEST_F(RangeTest, -ContainsIntegralMinusOneRangeContainsIntegralMinusOne) -{ - EXPECT_TRUE(Range(I(-1)).containsIntegralMinusOne()); - EXPECT_TRUE(Range(Interval(I(-5), I(-1))).containsIntegralMinusOne()); - EXPECT_TRUE(Range(Interval(I(-5), I(0))).containsIntegralMinusOne()); - EXPECT_TRUE(Range(Interval(I(-1), I(1))).containsIntegralMinusOne()); - - EXPECT_TRUE(Range(I(-1)).containsIntegralMinusOne()); - - EXPECT_TRUE(Range(I(-1)).containsIntegralMinusOne()); - EXPECT_TRUE(Range(Interval(I(-5), I(-1))).containsIntegralMinusOne()); - EXPECT_TRUE(Range(Interval(I(-5), I(0))).containsIntegralMinusOne()); - EXPECT_TRUE(Range(Interval(I(-1), I(1))).containsIntegralMinusOne()); -} - -TEST_F(RangeTest, -ContainsIntegralMinusOneRangeDoesNotContainIntegralMinusOne) -{ - EXPECT_FALSE(Range(I(-2)).containsIntegralMinusOne()); - EXPECT_FALSE(Range(I(0)).containsIntegralMinusOne()); - EXPECT_FALSE(Range(Interval(I(0), I(5))).containsIntegralMinusOne()); - - EXPECT_FALSE(Range(F(-1.0)).containsIntegralMinusOne()); - EXPECT_FALSE(Range(Interval(F(-5.0), F(5.0))).containsIntegralMinusOne()); -} - -//////////////////////////////////////////////////////////////////////////////// -// getMax() -//////////////////////////////////////////////////////////////////////////////// - -TEST_F(RangeTest, -GetMaxOfEmptyRange) -{ - EXPECT_DEATH((Range()).getMax(),".*!empty().*"); -} - -TEST_F(RangeTest, -GetMaxOfIntRange) -{ - EXPECT_EQ(I(130), - (Range(Interval(I(-125), I(-120)), - Interval(I(12), I(130)))).getMax()); -} - -TEST_F(RangeTest, -GetMaxOfFloatRange) -{ - EXPECT_EQ(F(1.30), - (Range(Interval(F(-12.5), F(-1.20)), - Interval(F(0.12), F(1.30)))).getMax()); -} - -TEST_F(RangeTest, -GetMaxOfSpecialFloatRange) -{ - EXPECT_EQ(F(INFINITY), - (Range(Interval(F(-INFINITY), F(-INFINITY)), - Interval(F(INFINITY), F(INFINITY)))).getMax()); - EXPECT_EQ(F(INFINITY), - (Range(Interval(F(NAN), F(NAN)), - Interval(F(INFINITY), F(INFINITY)))).getMax()); - EXPECT_EQ(F(-INFINITY), - (Range(Interval(F(NAN), F(NAN)), - Interval(F(-INFINITY), F(-INFINITY)))).getMax()); -} - -//////////////////////////////////////////////////////////////////////////////// -// getMin() -//////////////////////////////////////////////////////////////////////////////// - -TEST_F(RangeTest, -GetMinOfEmptyRange) -{ - EXPECT_DEATH((Range()).getMin(),".*!empty().*"); -} - -TEST_F(RangeTest, -GetMinOfIntRange) -{ - EXPECT_EQ(I(-125), - (Range(Interval(I(-125), I(-120)), - Interval(I(12), I(130)))).getMin()); -} - -TEST_F(RangeTest, -GetMinOfFloatRange) -{ - EXPECT_EQ(F(-12.5), - (Range(Interval(F(-12.5), F(-1.20)), - Interval(F(0.12), F(1.30)))).getMin()); -} - -TEST_F(RangeTest, -GetMinOfSpecialFloatRange) -{ - EXPECT_EQ(F(-INFINITY), - (Range(Interval(F(-INFINITY), F(-INFINITY)), - Interval(F(INFINITY), F(INFINITY)))).getMin()); - EXPECT_EQ(F(INFINITY), - (Range(Interval(F(NAN), F(NAN)), - Interval(F(INFINITY), F(INFINITY)))).getMin()); - EXPECT_EQ(F(-INFINITY), - (Range(Interval(F(NAN), F(NAN)), - Interval(F(-INFINITY), F(-INFINITY)))).getMin()); -} - -//////////////////////////////////////////////////////////////////////////////// -// intToFloat() -//////////////////////////////////////////////////////////////////////////////// - -TEST_F(RangeTest, -IntToFloatOfEmptyRangeWorksCorrectly) -{ - EXPECT_DEATH(intToFloat(Range()), ".*!r.empty().*"); -} - -TEST_F(RangeTest, -IntToFloatOfIntegralRangeWorksCorrectly) -{ - EXPECT_EQ(Range(F(15.0)), intToFloat(Range(I(15)))); - EXPECT_EQ(Range(Interval(F(15.0), F(18.0))), - intToFloat(Range(Interval(I(15), I(18))))); -} - -TEST_F(RangeTest, -IntToFloatOfFloatingPointRangeWorksCorrectly) -{ - EXPECT_DEATH(intToFloat(Range(F(15))), ".*r.isIntegral().*"); - EXPECT_DEATH(intToFloat(Range(Interval(F(15), F(18)))), - ".*r.isIntegral().*"); -} - -//////////////////////////////////////////////////////////////////////////////// -// getMaxRange() -//////////////////////////////////////////////////////////////////////////////// - -TEST_F(RangeTest, -GetMaxRangeOfIntegralNumber) -{ - EXPECT_EQ(Range(Interval(I(vmin()), - I(vmax()))), - Range::getMaxRange(I(15))); - - EXPECT_EQ(Range(Interval(I(vmin()), I(vmax()))), - Range::getMaxRange(I(258))); -} - -TEST_F(RangeTest, -GetMaxRangeOfFloatingPointNumber) -{ - Range r = Range::getMaxRange(F(159.369)); - EXPECT_TRUE(r[0].first.isNotNumber()); - EXPECT_TRUE(r[0].second.isNotNumber()); - EXPECT_TRUE(r[1].first.isNegativeInf()); - EXPECT_TRUE(r[1].second.isPositiveInf()); - - Range r1 = Range::getMaxRange(F(INFINITY)); - EXPECT_TRUE(r1[0].first.isNotNumber()); - EXPECT_TRUE(r1[0].second.isNotNumber()); - EXPECT_TRUE(r1[1].first.isNegativeInf()); - EXPECT_TRUE(r1[1].second.isPositiveInf()); - - Range r2 = Range::getMaxRange(F(NAN)); - EXPECT_TRUE(r2[0].first.isNotNumber()); - EXPECT_TRUE(r2[0].second.isNotNumber()); - EXPECT_TRUE(r2[1].first.isNegativeInf()); - EXPECT_TRUE(r2[1].second.isPositiveInf()); -} - -//////////////////////////////////////////////////////////////////////////////// -// assign() -//////////////////////////////////////////////////////////////////////////////// - -TEST_F(RangeTest, -AssignmentOfUnsinedRangeToUnsignedRangeWorksCorrectly) -{ - // Assignment to the same type. - EXPECT_EQ(Range(Interval(I(0), I(2))), - (Range(Interval(I(15), I(15)))).assign(Range(Interval(I(0), I(2))))); - - // Assignment of the smaller type to the bigger one. - EXPECT_EQ(Range(Interval(I(0), I(2))), - (Range(Interval(I(15), I(15)))).assign(Range(Interval(I(0), I(2))))); - - // Assignment of the bigger type to the smaller one. - EXPECT_EQ(Range(Interval(I(0), I(2))), - (Range(Interval(I(15), I(15)))).assign(Range(Interval(I(0), I(2))))); - - EXPECT_EQ(Range(Interval(I(0), I(2))), - (Range(Interval(I(15), I(15)))).assign(Range(Interval(I(256), I(258))))); - - EXPECT_EQ(Range(Interval(I(0), I(255))), - (Range(Interval(I(15), I(15)))).assign(Range(Interval(I(256), I(513))))); - - EXPECT_EQ(Range(Interval(I(0), I(255))), - (Range(Interval(I(15), I(15)))).assign(Range(Interval(I(256), I(512))))); - - EXPECT_EQ(Range(Interval(I(0), I(255))), - (Range(Interval(I(15), I(15)))).assign(Range(Interval(I(256), I(511))))); - - EXPECT_EQ(Range(Interval(I(0), I(254))), - (Range(Interval(I(15), I(15)))).assign(Range(Interval(I(256), I(510))))); - - EXPECT_EQ(Range(Interval(I(0), I(0)), - Interval(I(2), I(255))), - (Range(Interval(I(15), I(15)))).assign(Range(Interval(I(258), I(512))))); - - EXPECT_EQ(Range(Interval(I(0), I(1)), - Interval(I(14), I(255))), - (Range(Interval(I(15), I(15)))).assign(Range(Interval(I(270), I(513))))); -} - -TEST_F(RangeTest, -AssignmentOfSignedRangeToSignedRangeWorksCorrectly) -{ - // Assignment to the same type. - EXPECT_EQ(Range(Interval(I(0), I(2))), - (Range(Interval(I(15), I(15)))).assign(Range(Interval(I(0), I(2))))); - - // Assignment of the smaller type to the bigger one. - EXPECT_EQ(Range(Interval(I(0), I(2))), - (Range(Interval(I(15), I(15)))).assign(Range(Interval(I(0), I(2))))); - - // Assignment of the bigger type to the smaller one. - EXPECT_EQ(Range(Interval(I(126), I(127))), - (Range(Interval(I(15), I(15)))).assign(Range(Interval(I(-130), I(-129))))); - - EXPECT_EQ(Range(Interval(I(106), I(126))), - (Range(Interval(I(15), I(15)))).assign(Range(Interval(I(-150), I(-130))))); - - EXPECT_EQ(Range(Interval(I(-128), I(-128)), - Interval(I(92), I(127))), - (Range(Interval(I(15), I(15)))).assign(Range(Interval(I(-164), I(-128))))); - - EXPECT_EQ(Range(Interval(I(-128), I(-100)), - Interval(I(126), I(127))), - (Range(Interval(I(15), I(15)))).assign(Range(Interval(I(-130), I(-100))))); - - EXPECT_EQ(Range(Interval(I(0), I(127)), - Interval(I(-128), I(-128))), - (Range(Interval(I(15), I(15)))).assign(Range(Interval(I(-256), I(-128))))); - - EXPECT_EQ(Range(Interval(I(-1), I(127)), - Interval(I(-128), I(-128))), - (Range(Interval(I(15), I(15)))).assign(Range(Interval(I(-257), I(-128))))); - - EXPECT_EQ(Range(Interval(I(-2), I(127)), - Interval(I(-128), I(-128))), - (Range(Interval(I(15), I(15)))).assign(Range(Interval(I(-258), I(-128))))); - - EXPECT_EQ(Range(Interval(I(-127), I(-126))), - (Range(Interval(I(15), I(15)))).assign(Range(Interval(I(129), I(130))))); - - EXPECT_EQ(Range(Interval(I(-126), I(-106))), - (Range(Interval(I(15), I(15)))).assign(Range(Interval(I(130), I(150))))); - - EXPECT_EQ(Range(Interval(I(-128), I(-92))), - (Range(Interval(I(15), I(15)))).assign(Range(Interval(I(128), I(164))))); - - EXPECT_EQ(Range(Interval(I(100), I(127)), - Interval(I(-128), I(-126))), - (Range(Interval(I(15), I(15)))).assign(Range(Interval(I(100), I(130))))); - - EXPECT_EQ(Range(Interval(I(-128), I(0))), - (Range(Interval(I(15), I(15)))).assign(Range(Interval(I(128), I(256))))); - - EXPECT_EQ(Range(Interval(I(-128), I(1))), - (Range(Interval(I(15), I(15)))).assign(Range(Interval(I(128), I(257))))); - - EXPECT_EQ(Range(Interval(I(-128), I(2))), - (Range(Interval(I(15), I(15)))).assign(Range(Interval(I(128), I(258))))); - - EXPECT_EQ(Range(Interval(I(-128), I(127))), - (Range(Interval(I(15), I(15)))).assign(Range(Interval(I(-513), I(-257))))); - - EXPECT_EQ(Range(Interval(I(-128), I(127))), - (Range(Interval(I(15), I(15)))).assign(Range(Interval(I(257), I(514))))); - - EXPECT_EQ(Range(Interval(I(-128), I(127))), - (Range(Interval(I(15), I(15)))).assign(Range(Interval(I(-513), I(-258))))); - - EXPECT_EQ(Range(Interval(I(-128), I(127))), - (Range(Interval(I(15), I(15)))).assign(Range(Interval(I(257), I(512))))); - - EXPECT_EQ(Range(Interval(I(-128), I(-1)), - Interval(I(1), I(127))), - (Range(Interval(I(15), I(15)))).assign(Range(Interval(I(257), I(511))))); -} - -TEST_F(RangeTest, -AssignmentOfSignedRangeToUnsignedRangeWorksCorrectly) -{ - // Assignment of the smaller type to the bigger one. - EXPECT_EQ(Range(Interval(I(0), I(2))), - (Range(Interval(I(15), I(15)))).assign(Range(Interval(I(0), I(2))))); - - // Assignment of the bigger type to the smaller one. - EXPECT_EQ(Range(Interval(I(0), I(255))), - (Range(Interval(I(15), I(15)))).assign(Range(Interval(I(-128), I(127))))); - - EXPECT_EQ(Range(Interval(I(0), I(255))), - (Range(Interval(I(15), I(15)))).assign(Range(Interval(I(-512), I(0))))); - - EXPECT_EQ(Range(Interval(I(0), I(0)), - Interval(I(128), I(255))), - (Range(Interval(I(15), I(15)))).assign(Range(Interval(I(-128), I(0))))); - - EXPECT_EQ(Range(Interval(I(0), I(52)), - Interval(I(203), I(255))), - (Range(Interval(I(15), I(15)))).assign(Range(Interval(I(-53), I(52))))); - - EXPECT_EQ(Range(Interval(I(0), I(255))), - (Range(Interval(I(15), I(15)))).assign(Range(Interval(I(250), I(512))))); - - EXPECT_EQ(Range(Interval(I(0), I(2))), - (Range(Interval(I(15), I(15)))).assign(Range(Interval(I(256), I(258))))); - - EXPECT_EQ(Range(Interval(I(0), I(255))), - (Range(Interval(I(15), I(15)))).assign(Range(Interval(I(-512), I(250))))); - - EXPECT_EQ(Range(Interval(I(0), I(1)), - Interval(I(255), I(255))), - (Range(Interval(I(15), I(15)))).assign(Range(Interval(I(-1), I(1))))); - - EXPECT_EQ(Range(Interval(I(0), I(255))), - (Range(Interval(I(15), I(15)))).assign(Range(Interval(I(-128), I(128))))); - - EXPECT_EQ(Range(Interval(I(0), I(127)), - Interval(I(129), I(255))), - (Range(Interval(I(15), I(15)))).assign(Range(Interval(I(-127), I(127))))); -} - -TEST_F(RangeTest, -AssignmentOfUnsignedRangeToSignedRangeWorksCorrectly) -{ - // Assignment of the smaller type to the bigger one. - EXPECT_EQ(Range(Interval(I(0), I(2))), - (Range(Interval(I(15), I(15)))).assign(Range(Interval(I(0), I(2))))); - - // Assignment of the bigger type to the smaller one. - EXPECT_EQ(Range(Interval(I(126), I(127))), - (Range(Interval(I(15), I(15)))).assign(Range(Interval(I(126), I(127))))); - - EXPECT_EQ(Range(Interval(I(-128), I(-127)), - Interval(I(126), I(127))), - (Range(Interval(I(15), I(15)))).assign(Range(Interval(I(126), I(129))))); - - EXPECT_EQ(Range(Interval(I(-128), I(-126)), - Interval(I(127), I(127))), - (Range(Interval(I(15), I(15)))).assign(Range(Interval(I(127), I(130))))); - - EXPECT_EQ(Range(Interval(I(-128), I(-106))), - (Range(Interval(I(15), I(15)))).assign(Range(Interval(I(128), I(150))))); - - EXPECT_EQ(Range(Interval(I(-6), I(-1))), - (Range(Interval(I(15), I(15)))).assign(Range(Interval(I(250), I(255))))); - - EXPECT_EQ(Range(Interval(I(-1), I(34))), - (Range(Interval(I(15), I(15)))).assign(Range(Interval(I(255), I(290))))); - - EXPECT_EQ(Range(Interval(I(0), I(18))), - (Range(Interval(I(15), I(15)))).assign(Range(Interval(I(512), I(530))))); - - EXPECT_EQ(Range(Interval(I(0), I(2))), - (Range(Interval(I(15), I(15)))).assign(Range(Interval(I(256), I(258))))); - - EXPECT_EQ(Range(Interval(I(-128), I(127))), - (Range(Interval(I(15), I(15)))).assign(Range(Interval(I(256), I(512))))); - - EXPECT_EQ(Range(Interval(I(-128), I(0)), - Interval(I(2), I(127))), - (Range(Interval(I(15), I(15)))).assign(Range(Interval(I(258), I(512))))); - - EXPECT_EQ(Range(Interval(I(-128), I(127))), - (Range(Interval(I(15), I(15)))).assign(Range(Interval(I(256), I(513))))); - - EXPECT_EQ(Range(Interval(I(-128), I(127))), - (Range(Interval(I(15), I(15)))).assign(Range(Interval(I(258), I(513))))); - - EXPECT_EQ(Range(Interval(I(-128), I(1)), - Interval(I(14), I(127))), - (Range(Interval(I(15), I(15)))).assign(Range(Interval(I(270), I(513))))); -} - -TEST_F(RangeTest, -AssignmentOfFloatingPointRangeToFloatingPointRangeWorksCorrectly) -{ - // Assignment to the same type. - EXPECT_EQ(Range(Interval(F(0.5), F(2.8))), - (Range(Interval(F(1.5), F(1.5)))).assign(Range(Interval(F(0.5), F(2.8))))); - - // Assignment of the smaller type to the bigger one. - EXPECT_EQ(Range(Interval(F(0), F(2))), - (Range(Interval(F(15), F(15)))).assign(Range(Interval(F(0), F(2))))); - - EXPECT_EQ(Range(Interval(F(-INFINITY), F(INFINITY))), - (Range(Interval(F(1), F(1)))).assign(Range(Interval(F(vmin()), F(vmax()))))); - - EXPECT_EQ(Range(Interval(F(-INFINITY), F(-INFINITY))), - (Range(Interval(F(1), F(1)))).assign(Range(Interval(F(vmin()), F(vmin()))))); - - EXPECT_EQ(Range(Interval(F(-INFINITY), F(vmin()))), - (Range(Interval(F(1), F(1)))).assign(Range(Interval(F(vmin()), F(vmin()-1))))); - - EXPECT_EQ(Range(Interval(F(-INFINITY), F(-153.69))), - (Range(Interval(F(1), F(1)))).assign(Range(Interval(F(vmin()), F(-153.69))))); - - EXPECT_EQ(Range(Interval(F(-153.69), F(153.69))), - (Range(Interval(F(1), F(1)))).assign(Range(Interval(F(-153.69), F(153.69))))); - - EXPECT_EQ(Range(Interval(F(-153.69), F(INFINITY))), - (Range(Interval(F(1), F(1)))).assign(Range(Interval(F(-153.69), F(vmax()))))); - - EXPECT_EQ(Range(Interval(F(INFINITY), F(INFINITY))), - (Range(Interval(F(1), F(1)))).assign(Range(Interval(F(vmax()), F(vmax()))))); -} - -TEST_F(RangeTest, -AssignmentOfFloatingPointRangeToSignedRangeWorksCorrectly) -{ - EXPECT_EQ(Range(Interval(I(-128), I(127))), - (Range(Interval(I(1), I(1)))).assign(Range(Interval(F(vmax()), F(vmax()))))); - - EXPECT_EQ(Range(Interval(I(-128), I(127))), - (Range(Interval(I(1), I(1)))).assign(Range(Interval(F(vmin()), F(vmin()))))); - - EXPECT_EQ(Range(Interval(I(-128), I(127))), - (Range(Interval(I(1), I(1)))).assign(Range(Interval(F(vmin()), F(vmax()))))); - - EXPECT_EQ(Range(Interval(I(-128), I(127))), - (Range(Interval(I(1), I(1)))).assign(Range(Interval(F(-INFINITY), F(-INFINITY))))); - - EXPECT_EQ(Range(Interval(I(-128), I(127))), - (Range(Interval(I(1), I(1)))).assign(Range(Interval(F(INFINITY), F(INFINITY))))); - - EXPECT_EQ(Range(Interval(I(-128), I(127))), - (Range(Interval(I(1), I(1)))).assign(Range(Interval(F(-INFINITY), F(INFINITY))))); - - EXPECT_EQ(Range(Interval(I(-128), I(127))), - (Range(Interval(I(1), I(1)))).assign(Range(Interval(F(-190), F(-129))))); - - EXPECT_EQ(Range(Interval(I(-128), I(127))), - (Range(Interval(I(1), I(1)))).assign(Range(Interval(F(0), F(256))))); - - EXPECT_EQ(Range(Interval(I(-128), I(127))), - (Range(Interval(I(1), I(1)))).assign(Range(Interval(F(-128), F(127))))); - - EXPECT_EQ(Range(Interval(I(-1), I(12))), - (Range(Interval(I(1), I(1)))).assign(Range(Interval(F(-1), F(12))))); - - EXPECT_EQ(Range(Interval(I(-128), I(127))), - (Range(Interval(I(1), I(1)))).assign(Range(Interval(F(NAN), F(NAN))))); -} - -TEST_F(RangeTest, -AssignmentOfFloatingPointRangeToUnsignedRangeWorksCorrectly) -{ - EXPECT_EQ(Range(Interval(I(0), I(255))), - (Range(Interval(I(1), I(1)))).assign(Range(Interval(F(vmax()), F(vmax()))))); - - EXPECT_EQ(Range(Interval(I(0), I(255))), - (Range(Interval(I(1), I(1)))).assign(Range(Interval(F(vmin()), F(vmin()))))); - - EXPECT_EQ(Range(Interval(I(0), I(255))), - (Range(Interval(I(1), I(1)))).assign(Range(Interval(F(vmin()), F(vmax()))))); - - EXPECT_EQ(Range(Interval(I(0), I(255))), - (Range(Interval(I(1), I(1)))).assign(Range(Interval(F(-INFINITY), F(-INFINITY))))); - - EXPECT_EQ(Range(Interval(I(0), I(255))), - (Range(Interval(I(1), I(1)))).assign(Range(Interval(F(INFINITY), F(INFINITY))))); - - EXPECT_EQ(Range(Interval(I(0), I(255))), - (Range(Interval(I(1), I(1)))).assign(Range(Interval(F(-INFINITY), F(INFINITY))))); - - EXPECT_EQ(Range(Interval(I(0), I(255))), - (Range(Interval(I(1), I(1)))).assign(Range(Interval(F(-190), F(-129))))); - - EXPECT_EQ(Range(Interval(I(0), I(255))), - (Range(Interval(I(1), I(1)))).assign(Range(Interval(F(0), F(256))))); - - EXPECT_EQ(Range(Interval(I(0), I(255))), - (Range(Interval(I(1), I(1)))).assign(Range(Interval(F(-128), F(127))))); - - EXPECT_EQ(Range(Interval(I(0), I(12))), - (Range(Interval(I(1), I(1)))).assign(Range(Interval(F(0), F(12))))); - - EXPECT_EQ(Range(Interval(I(0), I(255))), - (Range(Interval(I(1), I(1)))).assign(Range(Interval(F(NAN), F(NAN))))); -} - -TEST_F(RangeTest, -AssignmentOfUnsignedRangeToFloatingPointRangeWorksCorrectly) -{ - EXPECT_EQ(Range(Interval(F(48), F(55)), - Interval(F(89), F(100)), - Interval(F(103), F(108))), - (Range(Interval(F(1), F(1)))).assign(Range( - Interval(I(48), I(55)), - Interval(I(89), I(100)), - Interval(I(103), I(108))))); -} - -TEST_F(RangeTest, -AssignmentOfSignedRangeToFloatingPointRangeWorksCorrectly) -{ - EXPECT_EQ(Range(Interval(F(-48), F(55)), - Interval(F(89), F(100)), - Interval(F(103), F(vmax()))), - (Range(Interval(F(1), F(1)))).assign(Range( - Interval(I(-48), I(55)), - Interval(I(89), I(100)), - Interval(I(103), I(vmax()))))); -} - -TEST_F(RangeTest, -AssignmentBetweenEmptyRangesWorksCorrectly) -{ - EXPECT_DEATH((Range()).assign(Range()), ".*!empty().*!r.empty().*"); - - EXPECT_DEATH((Range(I(10))).assign(Range()), ".*!empty().*!r.empty().*"); - - EXPECT_DEATH((Range()).assign(Range(Interval(F(vmax()), - F(vmax())))), ".*!empty().*!r.empty().*"); -} - -//////////////////////////////////////////////////////////////////////////////// -// expand() -//////////////////////////////////////////////////////////////////////////////// - -TEST_F(RangeTest, -ExpandForSignedIntegralIntRangesWorksCorrectly) -{ - // (0, 0) -> (-1, 1) - EXPECT_EQ(Range(Interval(I(-1), I(1))), - Range(I(0)).expand()); - - // (1, 2) -> (-1, 4) - EXPECT_EQ(Range(Interval(I(-1), I(4))), - Range(Interval(I(1), I(2))).expand()); - - // (4, 8) -> (2, 16) - EXPECT_EQ(Range(Interval(I(2), I(16))), - Range(Interval(I(4), I(8))).expand()); - - // (-8, -4) -> (-16, -2) - EXPECT_EQ(Range(Interval(I(-16), I(-2))), - Range(Interval(I(-8), I(-4))).expand()); - - // (-63, 63) -> (-126, 126) - EXPECT_EQ(Range(Interval(I(-126), I(126))), - Range(Interval(I(-63), I(63))).expand()); - - // (-65, 65) -> (-130, 130) - EXPECT_EQ(Range(Interval(I(-130), I(130))), - Range(Interval(I(-65), I(65))).expand()); - - // (-2, 4000) -> (-4, 8000) - EXPECT_EQ(Range(Interval(I(-4), I(8000))), - Range(Interval(I(-2), I(4000))).expand()); - - // (MAX, MAX) -> (MAX / 2, MAX) - EXPECT_EQ(Range(Interval(I(vmax() / 2), - I(vmax()))), - Range(Interval(I(vmax()), - I(vmax()))).expand()); - - // (-5, -4) + (4, 8) -> (-10, -2) + (2, 16) - EXPECT_EQ(Range(Interval(I(-10), I(-2)), - Interval(I(2), I(16))), - Range(Interval(I(-5), I(-4)), - Interval(I(4), I(8))).expand()); -} - -TEST_F(RangeTest, -ExpandForUnsignedIntegralRangesWorksCorrectly) -{ - // (0, 0) -> (0, 1) - EXPECT_EQ(Range(Interval(I(0), I(1))), - Range(I(0)).expand()); - - // (1, 2) -> (0, 4) - EXPECT_EQ(Range(Interval(I(0), I(4))), - Range(Interval(I(1), I(2))).expand()); - - // (0, 4000) -> (0, 8000) - EXPECT_EQ(Range(Interval(I(0), I(8000))), - Range(Interval(I(0), I(4000))).expand()); - - // (MAX, MAX) -> (MAX / 2, MAX) - EXPECT_EQ(Range(Interval(I(vmax() / 2), - I(vmax()))), - Range(Interval(I(vmax()), - I(vmax()))).expand()); -} - -TEST_F(RangeTest, -ExpandForSignedIntegralCharRangesWorksCorrectly) -{ - // (0, 64) -> (-1, 127) - EXPECT_EQ(Range(Interval(I(-1), I(127))), - Range(Interval(I(0), I(64))).expand()); - - // (-63, 63) -> (-126, 126) - EXPECT_EQ(Range(Interval(I(-126), I(126))), - Range(Interval(I(-63), I(63))).expand()); - - // (-64, 64) -> (-128, 127) - EXPECT_EQ(Range(Interval(I(-128), I(127))), - Range(Interval(I(-64), I(64))).expand()); - - // (-65, 65) -> (-128, 127) - EXPECT_EQ(Range(Interval(I(-128), I(127))), - Range(Interval(I(-65), I(65))).expand()); -} - -TEST_F(RangeTest, -ExpandForFloatingPointsWorksCorrectly) -{ - // Currently, expand() for floating-point ranges returns the maximal range. - EXPECT_EQ(Range(Interval(F(NAN), F(NAN)), - Interval(F(-INFINITY), F(INFINITY))), - Range(F(1)).expand()); -} - -//////////////////////////////////////////////////////////////////////////////// -// mergeIntervals() -//////////////////////////////////////////////////////////////////////////////// - -TEST_F(RangeTest, -MergeIntervalsOnRangeWithSingleIntervalDoesNotChangeTheInterval) -{ - // (-1, 5) -> (-1, 5) - EXPECT_EQ(Range(Interval(I(-1), I(5))), - Range(Interval(I(-1), I(5))).mergeIntervals()); - // (-INF, INF) -> (-INF, INF) - EXPECT_EQ(Range(Interval(F(-INFINITY), F(INFINITY))), - Range(Interval(F(-INFINITY), F(INFINITY))).mergeIntervals()); - // (NAN, NAN) -> (NAN, NAN) - EXPECT_EQ(Range(Interval(F(NAN), F(NAN))), - Range(Interval(F(NAN), F(NAN))).mergeIntervals()); -} - -TEST_F(RangeTest, -MergeIntervalsOnIntegralRangesWorksCorrectlyWhenThereAreMoreIntervals) -{ - // (-1, 5)(10, 20) -> (-1, 20) - EXPECT_EQ(Range(Interval(I(-1), I(20))), - Range(Interval(I(-1), I(5)), - Interval(I(10), I(20))).mergeIntervals()); - // (INT_MIN, INT_MAX)(-1, 5)(10, 20)(INT_MAX, INT_MAX) -> (-1, 20) - EXPECT_EQ(Range(Interval(I(vmin()), I(vmax()))), - Range(Interval(I(vmin()), I(vmin())), - Interval(I(-1), I(5)), - Interval(I(10), I(20)), - Interval(I(vmax()), I(vmax()))).mergeIntervals()); -} - -TEST_F(RangeTest, -MergeIntervalsOnFloatingPointRangesWorksCorrectlyWhenThereAreMoreIntervalsButNoNAN) -{ - // (-5.0, -1.0)(6.7, 8.7)(10.0, INFINITY) -> (-5.0, INFINITY) - EXPECT_EQ(Range(Interval(F(-5.0), F(INFINITY))), - Range(Interval(F(-5.0), F(-1.0)), - Interval(F(6.7), F(8.7)), - Interval(F(10.0), F(INFINITY))).mergeIntervals()); -} - -TEST_F(RangeTest, -MergeIntervalsOnFloatingPointRangesWorksCorrectlyWhenThereAreMoreIntervalsAndNAN) -{ - // (NAN, NAN)(-5.0, -1.0)(6.7, 8.7)(10.0, INFINITY) -> (NAN, NAN)(-5.0, INFINITY) - EXPECT_EQ(Range(Interval(F(NAN), F(NAN)), - Interval(F(-5.0), F(INFINITY))), - Range(Interval(F(NAN), F(NAN)), - Interval(F(-5.0), F(-1.0)), - Interval(F(6.7), F(8.7)), - Interval(F(10.0), F(INFINITY))).mergeIntervals()); -} - -//////////////////////////////////////////////////////////////////////////////// -// - (unary) -//////////////////////////////////////////////////////////////////////////////// - -TEST_F(RangeTest, -UnaryMinusOfSignedIntWorksCorrectly) -{ - EXPECT_EQ(Range(I(-vmin())), -Range(I(vmin()))); - EXPECT_EQ(Range(I(vmin())), -Range(I(vmin()))); - EXPECT_EQ(Range(I(-vmax())), -Range(I(vmax()))); - EXPECT_EQ(Range(I(0)), -Range(I(0))); - - EXPECT_EQ(Range(Interval(I(-10), I(100))), - -Range(Interval(I(-100), I(10)))); - - EXPECT_EQ(Range(Interval(I(vmin()), I(vmin())), - Interval(I(-5), I(-(vmin() + 1)))), - -Range(Interval(I(vmin()), I(5)))); -} - -TEST_F(RangeTest, -UnaryMinusOfUnsignedIntWorksCorrectly) -{ - EXPECT_EQ(Range(I(-vmin())), - -Range(I(vmin()))); - EXPECT_EQ(Range(I(vmin())), - -Range(I(vmin()))); - EXPECT_EQ(Range(I(-vmax())), - -Range(I(vmax()))); - EXPECT_EQ(Range(I(0)), -Range(I(0))); - - unsigned maxUn = vmax(); - EXPECT_EQ(Range(Interval(I(maxUn + 1 - 100), I(maxUn))), - -Range(Interval(I(1), I(100)))); - - EXPECT_EQ(Range(Interval(I(vmin()), - I(vmin())), - Interval(I(maxUn + 1 - 10), - I(maxUn + 1))), - -Range(Interval(I(vmin()), I(10)))); -} - -TEST_F(RangeTest, -UnaryMinusOfFloatWorksCorrectly) -{ - EXPECT_EQ(Range(F(vmin())), -Range(F(vmax()))); - EXPECT_EQ(Range(F(vmax())), -Range(F(vmin()))); - - EXPECT_EQ(Range(F(INFINITY)), -Range(F(-INFINITY))); - EXPECT_EQ(Range(F(-INFINITY)), -Range(F(INFINITY))); - - Range r = -Range(F(NAN)); - EXPECT_EQ(true, (r.begin()->first).isNotNumber()); - - EXPECT_EQ(Range(F(0)), -Range(F(0))); - EXPECT_EQ(Range(F(-1789.35)), -Range(F(1789.35))); - EXPECT_EQ(Range(F(1789.35)), -Range(F(-1789.35))); - - EXPECT_EQ(Range(Interval(F(-1789.58), F(-1432)), - Interval(F(-1300), F(1200))), - -Range(Interval(F(1432), F(1789.58)), - Interval(F(-1200), F(1300)))); -} - -TEST_F(RangeTest, -UnaryMinusOfEmptyRangeWorksCorrectly) -{ - EXPECT_DEATH(-Range(), ".*!r.empty().*"); -} - -//////////////////////////////////////////////////////////////////////////////// -// + (binary) -//////////////////////////////////////////////////////////////////////////////// - -TEST_F(RangeTest, -BinaryPlusOfSignedIntAndSignedIntWorksCorrectly) -{ - EXPECT_EQ(Range(Interval(I(vmin()), I(vmin())), - Interval(I(11), I(vmax()))), - Range(Interval(I(10), I(vmax()))) - + Range(Interval(I(1), I(1)))); - - EXPECT_EQ(Range(Interval(I(6), I(210))), - Range(Interval(I(10), I(200))) - + Range(Interval(I(-4), I(10)))); - - EXPECT_EQ(Range(Interval(I(vmin()), I(210)), - Interval(I(vmax()), I(vmax()))), - Range(Interval(I(vmin()), I(200))) - + Range(Interval(I(-1), I(10)))); -} - -TEST_F(RangeTest, -BinaryPlusOfSignedIntAndUnsignedIntWorksCorrectly) -{ - EXPECT_EQ(Range(Interval(I(vmin() + vmax()), - I(-5 + vmax()))), - Range(Interval(I(vmin()), I(-5))) - + Range(Interval(I(vmax()), - I(vmax())))); - - EXPECT_EQ(Range(Interval(I(vmin() + vmax() + 1), - I(-5 + vmax() + 1))), - Range(Interval(I(vmin()), I(-5))) - + Range(Interval(I(0), - I(0)))); - - EXPECT_EQ(Range(Interval(I(vmin() + vmax() + 1), - I(vmax() + 1))), - Range(Interval(I(vmin()), I(0))) - + Range(Interval(I(0), - I(0)))); -} - -TEST_F(RangeTest, -BinaryPlusOfSignedIntAndFloatWorksCorrectly) -{ - EXPECT_EQ(Range(Interval(F(11), F(vmax() + 1.0))), - Range(Interval(I(10), I(vmax()))) - + Range(Interval(F(1), F(1)))); - - EXPECT_EQ(Range(Interval(F(1 + 5.0), F(1 + vmax()))), - Range(Interval(I(1), I(1))) - + Range(Interval(F(5.0), F(vmax())))); - - EXPECT_EQ(Range(Interval(F(vmin() - 105.35), - F(vmax() + 105.35))), - Range(Interval(I(vmin()), I(vmax()))) - + Range(Interval(F(-105.35), F(105.35)))); -} - -TEST_F(RangeTest, -BinaryPlusOfUnsignedIntAndSignedIntWorksCorrectly) -{ - EXPECT_EQ(Range(Interval(I(vmin()), - I(vmax()))), - Range(Interval(I(vmin()), - I(vmax()))) - + Range(Interval(I(-1), I(-1)))); - - EXPECT_EQ(Range(Interval(I(vmin()), I(4535+100)), - Interval(I(vmax() - 1), - I(vmax()))), - Range(Interval(I(8), I(4535))) - + Range(Interval(I(-10), I(100)))); -} - -TEST_F(RangeTest, -BinaryPlusOfUnsignedIntAndUnsignedIntWorksCorrectly) -{ - EXPECT_EQ(Range(Interval(I(0), I(0)), - Interval(I(11), I(vmax()))), - Range(Interval(I(10), I(vmax()))) - + Range(Interval(I(1), I(1)))); - - EXPECT_EQ(Range(Interval(I(11), I(17)), - Interval(I(21), I(27)), - Interval(I(101), I(127))), - Range(Interval(I(10), I(15)), - Interval(I(20), I(25)), - Interval(I(100), I(125))) - + Range(Interval(I(1), I(1)), - Interval(I(2), I(2)))); - - EXPECT_EQ(Range(Interval(I(9), I(vmax() - 1))), - Range(Interval(I(10), I(vmax()))) - + Range(Interval(I(vmax()), - I(vmax())))); -} - -TEST_F(RangeTest, -BinaryPlusOfUnsignedIntAndFloatWorksCorrectly) -{ - EXPECT_EQ(Range(Interval(F(vmin() + vmin()), - F(vmax() + vmax()))), - Range(Interval(I(vmin()), - I(vmax()))) - + Range(Interval(F(vmin()), - F(vmax())))); - - EXPECT_EQ(Range(Interval(F(vmin() - 1.0), - F(vmax() - 1.0))), - Range(Interval(I(vmin()), - I(vmax()))) - + Range(Interval(F(-1.0), - F(-1.0)))); - - EXPECT_EQ(Range(Interval(F(25 - 27.35), F(1438 + 128.0))), - Range(Interval(I(25), I(1438))) - + Range(Interval(F(-27.35), F(128.0)))); -} - -TEST_F(RangeTest, -BinaryPlusOfFloatAndSignedIntWorksCorrectly) -{ - EXPECT_EQ(Range(Interval(F(vmin() - 1265.78), - F(vmax() + 128.35))), - Range(Interval(F(vmin()), - F(vmax()))) - + Range(Interval(I(-1265.78), I(128.35)))); -} - -TEST_F(RangeTest, -BinaryPlusOfFloatAndUnsignedIntWorksCorrectly) -{ - EXPECT_EQ(Range(Interval(F(-12589.6 + 437), - F(12583.78 + 589))), - Range(Interval(F(-12589.6), F(12583.78))) - + Range(Interval(I(437), I(589)))); - -} - -TEST_F(RangeTest, -BinaryPlusOfFloatAndFloatWorksCorrectly) -{ - EXPECT_EQ(Range(F(-INFINITY)), - Range(F(vmin())) + Range(F(-1e308))); - - EXPECT_EQ(Range(F(INFINITY)), - Range(F(vmax())) + Range(F(1e308))); - - EXPECT_EQ(Range(F(-INFINITY)), - Range(F(vmin())) + Range(F(-1e300))); - - EXPECT_EQ(Range(F(INFINITY)), - Range(F(vmax())) + Range(F(1e300))); - - EXPECT_EQ(Range(Interval(F(7.8 + 14.35), F(7898.0 + 14587.8))), - Range(Interval(F(14.35), F(14587.8))) - + Range(Interval(F(7.8), F(7898.0)))); -} - -TEST_F(RangeTest, -BinaryPlusOfSpecialFloatsWorksCorrectly) -{ - // (INF, INF) + (INF, INF) = (INF, INF) - EXPECT_EQ(Range(Interval(F(INFINITY), F(INFINITY))), - Range(Interval(F(INFINITY), F(INFINITY))) - + Range(Interval(F(INFINITY), F(INFINITY)))); - - // (INF, INF) + (-INF, -INF) = (NAN, NAN) - Range r1 = Range(Interval(F(INFINITY), F(INFINITY))) - + Range(Interval(F(-INFINITY), F(-INFINITY))); - EXPECT_EQ(size_t(1), r1.size()); - EXPECT_EQ(true, (r1[0].first).isNotNumber()); - EXPECT_EQ(true, (r1[0].second).isNotNumber()); - - // (INF, INF) + (-INF, 5) = (NAN, NAN) U (INF, INF) - Range r2 = Range(Interval(F(INFINITY), F(INFINITY))) - + Range(Interval(F(-INFINITY), F(5))); - EXPECT_EQ(size_t(2), r2.size()); - EXPECT_EQ(true, (r2[0].first).isNotNumber()); - EXPECT_EQ(true, (r2[0].second).isNotNumber()); - EXPECT_EQ(true, (r2[1].first).isPositiveInf()); - EXPECT_EQ(true, (r2[1].second).isPositiveInf()); - - // (INF, INF) + (-INF, INF) = (NAN, NAN) U (INF, INF) - Range r3 = Range(Interval(F(INFINITY), F(INFINITY))) - + Range(Interval(F(-INFINITY), F(INFINITY))); - EXPECT_EQ(size_t(2), r3.size()); - EXPECT_EQ(true, (r3[0].first).isNotNumber()); - EXPECT_EQ(true, (r3[0].second).isNotNumber()); - EXPECT_EQ(true, (r3[1].first).isPositiveInf()); - EXPECT_EQ(true, (r3[1].second).isPositiveInf()); - - // (INF, INF) + (NAN, NAN) = (NAN, NAN) - Range r4 = Range(Interval(F(INFINITY), F(INFINITY))) - + Range(Interval(F(NAN), F(NAN))); - EXPECT_EQ(size_t(1), r4.size()); - EXPECT_EQ(true, (r4[0].first).isNotNumber()); - EXPECT_EQ(true, (r4[0].second).isNotNumber()); - - // (INF, INF) + (x, y) = (INF, INF) - EXPECT_EQ(Range(Interval(F(INFINITY), F(INFINITY))), - Range(Interval(F(INFINITY), F(INFINITY))) - + Range(Interval(F(5.0), F(8.0)))); - - // (INF, INF) + (x, INF) = (INF, INF) - EXPECT_EQ(Range(Interval(F(INFINITY), F(INFINITY))), - Range(Interval(F(INFINITY), F(INFINITY))) - + Range(Interval(F(1.35), F(INFINITY)))); - - // (-INF, -INF) + (INF, INF) = (NAN, NAN) - Range r5 = Range(Interval(F(-INFINITY), F(-INFINITY))) - + Range(Interval(F(INFINITY), F(INFINITY))); - EXPECT_EQ(size_t(1), r5.size()); - EXPECT_EQ(true, (r5[0].first).isNotNumber()); - EXPECT_EQ(true, (r5[0].second).isNotNumber()); - - // (-INF, -INF) + (-INF, -INF) = (-INF, -INF) - EXPECT_EQ(Range(Interval(F(-INFINITY), F(-INFINITY))), - Range(Interval(F(-INFINITY), F(-INFINITY))) - + Range(Interval(F(-INFINITY), F(-INFINITY)))); - - // (-INF, -INF) + (-INF, 5) = (-INF, -INF) - EXPECT_EQ(Range(Interval(F(-INFINITY), F(-INFINITY))), - Range(Interval(F(-INFINITY), F(5))) - + Range(Interval(F(-INFINITY), F(-INFINITY)))); - - // (-INF, -INF) + (-INF, INF) = (-INF, -INF) U (NAN, NAN) - Range r6 = Range(Interval(F(-INFINITY), F(-INFINITY))) - + Range(Interval(F(-INFINITY), F(INFINITY))); - EXPECT_EQ(size_t(2), r6.size()); - EXPECT_EQ(true, (r6[0].first).isNotNumber()); - EXPECT_EQ(true, (r6[0].second).isNotNumber()); - EXPECT_EQ(true, (r6[1].first).isNegativeInf()); - EXPECT_EQ(true, (r6[1].second).isNegativeInf()); - - // (-INF, -INF) + (NAN, NAN) = (NAN, NAN) - Range r7 = Range(Interval(F(-INFINITY), F(-INFINITY))) - + Range(Interval(F(NAN), F(NAN))); - EXPECT_EQ(size_t(1), r7.size()); - EXPECT_EQ(true, (r7[0].first).isNotNumber()); - EXPECT_EQ(true, (r7[0].second).isNotNumber()); - - // (-INF, -INF) + (1, 5) = (-INF, -INF) - EXPECT_EQ(Range(Interval(F(-INFINITY), F(-INFINITY))), - Range(Interval(F(1), F(5))) - + Range(Interval(F(-INFINITY), F(-INFINITY)))); - - // (-INF, -INF) + (1, INF) = (NAN, NAN) U (-INF, -INF) - Range r8 = Range(Interval(F(-INFINITY), F(-INFINITY))) - + Range(Interval(F(1.0), F(INFINITY))); - EXPECT_EQ(size_t(2), r8.size()); - EXPECT_EQ(true, (r8[0].first).isNotNumber()); - EXPECT_EQ(true, (r8[0].second).isNotNumber()); - EXPECT_EQ(true, (r8[1].first).isNegativeInf()); - EXPECT_EQ(true, (r8[1].second).isNegativeInf()); - - // (-INF, 5) + (INF, INF) = (NAN, NAN) U (INF, INF) - Range r9 = Range(Interval(F(-INFINITY), F(5))) - + Range(Interval(F(INFINITY), F(INFINITY))); - EXPECT_EQ(size_t(2), r9.size()); - EXPECT_EQ(true, (r9[0].first).isNotNumber()); - EXPECT_EQ(true, (r9[0].second).isNotNumber()); - EXPECT_EQ(true, (r9[1].first).isPositiveInf()); - EXPECT_EQ(true, (r9[1].second).isPositiveInf()); - - // (-INF, 5) + (-INF, -INF) = (-INF, -INF) - EXPECT_EQ(Range(Interval(F(-INFINITY), F(-INFINITY))), - Range(Interval(F(-INFINITY), F(5))) - + Range(Interval(F(-INFINITY), F(-INFINITY)))); - - // (-INF, 5) + (-INF, 5) = (-INF, 10) - EXPECT_EQ(Range(Interval(F(-INFINITY), F(10))), - Range(Interval(F(-INFINITY), F(5))) - + Range(Interval(F(-INFINITY), F(5)))); - - // (-INF, 5) + (-INF, INF) = (NAN, NAN) U (-INF, INF) - Range r10 = Range(Interval(F(-INFINITY), F(5))) - + Range(Interval(F(-INFINITY), F(INFINITY))); - EXPECT_EQ(size_t(2), r10.size()); - EXPECT_EQ(true, (r10[0].first).isNotNumber()); - EXPECT_EQ(true, (r10[0].second).isNotNumber()); - EXPECT_EQ(true, (r10[1].first).isNegativeInf()); - EXPECT_EQ(true, (r10[1].second).isPositiveInf()); - - // (-INF, 5) + (NAN, NAN) = (NAN, NAN) - Range r11 = Range(Interval(F(-INFINITY), F(5))) - + Range(Interval(F(NAN), F(NAN))); - EXPECT_EQ(size_t(1), r11.size()); - EXPECT_EQ(true, (r11[0].first).isNotNumber()); - EXPECT_EQ(true, (r11[0].second).isNotNumber()); - - // (-INF, 5) + (5, 8) = (-INF, 5+8) - EXPECT_EQ(Range(Interval(F(-INFINITY), F(5+8))), - Range(Interval(F(-INFINITY), F(5))) - + Range(Interval(F(5), F(8)))); - - // (-INF, 5) + (10, INF) = (NAN, NAN) U (-INF, INF) - Range r = Range(Interval(F(-INFINITY), F(5))) - + Range(Interval(F(10), F(INFINITY))); - EXPECT_EQ(size_t(2), r.size()); - EXPECT_EQ(true, (r[0].first).isNotNumber()); - EXPECT_EQ(true, (r[0].second).isNotNumber()); - EXPECT_EQ(true, (r[1].first).isNegativeInf()); - EXPECT_EQ(true, (r[1].second).isPositiveInf()); - - // (-INF, INF) + (INF, INF) = (NAN, NAN) U (INF, INF) - Range r13 = Range(Interval(F(-INFINITY), F(INFINITY))) - + Range(Interval(F(INFINITY), F(INFINITY))); - EXPECT_EQ(size_t(2), r13.size()); - EXPECT_EQ(true, (r13[0].first).isNotNumber()); - EXPECT_EQ(true, (r13[0].second).isNotNumber()); - EXPECT_EQ(true, (r13[1].first).isPositiveInf()); - EXPECT_EQ(true, (r13[1].second).isPositiveInf()); - - // (-INF, INF) + (-INF, -INF) = (NAN, NAN) U (-INF, -INF) - Range r14 = Range(Interval(F(-INFINITY), F(INFINITY))) - + Range(Interval(F(-INFINITY), F(-INFINITY))); - EXPECT_EQ(size_t(2), r14.size()); - EXPECT_EQ(true, (r14[0].first).isNotNumber()); - EXPECT_EQ(true, (r14[0].second).isNotNumber()); - EXPECT_EQ(true, (r14[1].first).isNegativeInf()); - EXPECT_EQ(true, (r14[1].second).isNegativeInf()); - - // (-INF, INF) + (-INF, 5) = (NAN, NAN) U (-INF, INF) - Range r15 = Range(Interval(F(-INFINITY), F(INFINITY))) - + Range(Interval(F(-INFINITY), F(5))); - EXPECT_EQ(size_t(2), r15.size()); - EXPECT_EQ(true, (r15[0].first).isNotNumber()); - EXPECT_EQ(true, (r15[0].second).isNotNumber()); - EXPECT_EQ(true, (r15[1].first).isNegativeInf()); - EXPECT_EQ(true, (r15[1].second).isPositiveInf()); - - // (-INF, INF) + (-INF, INF) = (NAN, NAN) U (-INF, INF) - Range r16 = Range(Interval(F(-INFINITY), F(INFINITY))) - + Range(Interval(F(-INFINITY), F(INFINITY))); - EXPECT_EQ(size_t(2), r16.size()); - EXPECT_EQ(true, (r16[0].first).isNotNumber()); - EXPECT_EQ(true, (r16[0].second).isNotNumber()); - EXPECT_EQ(true, (r16[1].first).isNegativeInf()); - EXPECT_EQ(true, (r16[1].second).isPositiveInf()); - - // (-INF, INF) + (NAN, NAN) = (NAN, NAN) - Range r17 = Range(Interval(F(-INFINITY), F(INFINITY))) - + Range(Interval(F(NAN), F(NAN))); - EXPECT_EQ(size_t(1), r17.size()); - EXPECT_EQ(true, (r17[0].first).isNotNumber()); - EXPECT_EQ(true, (r17[0].second).isNotNumber()); - - // (-INF, INF) + (5, 8) = (-INF, INF) - EXPECT_EQ(Range(Interval(F(-INFINITY), F(INFINITY))), - Range(Interval(F(-INFINITY), F(INFINITY))) - + Range(Interval(F(5), F(8)))); - - // (-INF, INF) + (5, INF) = (NAN, NAN) U (-INF, INF) - Range r18 = Range(Interval(F(-INFINITY), F(INFINITY))) - + Range(Interval(F(5), F(INFINITY))); - EXPECT_EQ(size_t(2), r18.size()); - EXPECT_EQ(true, (r18[0].first).isNotNumber()); - EXPECT_EQ(true, (r18[0].second).isNotNumber()); - EXPECT_EQ(true, (r18[1].first).isNegativeInf()); - EXPECT_EQ(true, (r18[1].second).isPositiveInf()); - - // (NAN, NAN) + (INF, INF) = (NAN, NAN) - Range r19 = Range(Interval(F(NAN), F(NAN))) - + Range(Interval(F(INFINITY), F(INFINITY))); - EXPECT_EQ(size_t(1), r19.size()); - EXPECT_EQ(true, (r19[0].first).isNotNumber()); - EXPECT_EQ(true, (r19[0].second).isNotNumber()); - - // (NAN, NAN) + (-INF, -INF) = (NAN, NAN) - Range r20 = Range(Interval(F(NAN), F(NAN))) - + Range(Interval(F(-INFINITY), F(-INFINITY))); - EXPECT_EQ(size_t(1), r20.size()); - EXPECT_EQ(true, (r20[0].first).isNotNumber()); - EXPECT_EQ(true, (r20[0].second).isNotNumber()); - - // (NAN, NAN) + (-INF, 5) = (NAN, NAN) - Range r21 = Range(Interval(F(NAN), F(NAN))) - + Range(Interval(F(-INFINITY), F(5))); - EXPECT_EQ(size_t(1), r21.size()); - EXPECT_EQ(true, (r21[0].first).isNotNumber()); - EXPECT_EQ(true, (r21[0].second).isNotNumber()); - - // (NAN, NAN) + (-INF, INF) = (NAN, NAN) - Range r22 = Range(Interval(F(NAN), F(NAN))) - + Range(Interval(F(-INFINITY), F(INFINITY))); - EXPECT_EQ(size_t(1), r22.size()); - EXPECT_EQ(true, (r22[0].first).isNotNumber()); - EXPECT_EQ(true, (r22[0].second).isNotNumber()); - - // (NAN, NAN) + (NAN, NAN) = (NAN, NAN) - Range r23 = Range(Interval(F(NAN), F(NAN))) - + Range(Interval(F(NAN), F(NAN))); - EXPECT_EQ(size_t(1), r23.size()); - EXPECT_EQ(true, (r23[0].first).isNotNumber()); - EXPECT_EQ(true, (r23[0].second).isNotNumber()); - - // (NAN, NAN) + (5, 8) = (NAN, NAN) - Range r24 = Range(Interval(F(NAN), F(NAN))) - + Range(Interval(F(5), F(8))); - EXPECT_EQ(size_t(1), r24.size()); - EXPECT_EQ(true, (r24[0].first).isNotNumber()); - EXPECT_EQ(true, (r24[0].second).isNotNumber()); - - // (NAN, NAN) + (5, INF) = (NAN, NAN) - Range r25 = Range(Interval(F(NAN), F(NAN))) - + Range(Interval(F(5), F(INFINITY))); - EXPECT_EQ(size_t(1), r25.size()); - EXPECT_EQ(true, (r25[0].first).isNotNumber()); - EXPECT_EQ(true, (r25[0].second).isNotNumber()); - - // (5, 8) + (INF, INF) = (INF, INF) - EXPECT_EQ(Range(Interval(F(INFINITY), F(INFINITY))), - Range(Interval(F(5), F(8))) - + Range(Interval(F(INFINITY), F(INFINITY)))); - - // (5, 8) + (-INF, -INF) = (-INF, -INF) - EXPECT_EQ(Range(Interval(F(-INFINITY), F(-INFINITY))), - Range(Interval(F(5), F(8))) - + Range(Interval(F(-INFINITY), F(-INFINITY)))); - - // (5, 8) + (-INF, 5) = (-INF, 13) - EXPECT_EQ(Range(Interval(F(-INFINITY), F(13))), - Range(Interval(F(5), F(8))) - + Range(Interval(F(-INFINITY), F(5)))); - - // (5, 8) + (-INF, INF) = (-INF, INF) - EXPECT_EQ(Range(Interval(F(-INFINITY), F(INFINITY))), - Range(Interval(F(5), F(8))) - + Range(Interval(F(-INFINITY), F(INFINITY)))); - - // (5, 8) + (NAN, NAN) = (NAN, NAN) - Range r26 = Range(Interval(F(5), F(8))) - + Range(Interval(F(NAN), F(NAN))); - EXPECT_EQ(size_t(1), r26.size()); - EXPECT_EQ(true, (r26[0].first).isNotNumber()); - EXPECT_EQ(true, (r26[0].second).isNotNumber()); - - // (5, 8) + (10, 20) = (15, 28) - EXPECT_EQ(Range(Interval(F(15), F(28))), - Range(Interval(F(5), F(8))) - + Range(Interval(F(10), F(20)))); - - // (5, 8) + (10, INF) = (15, INF) - EXPECT_EQ(Range(Interval(F(15), F(INFINITY))), - Range(Interval(F(5), F(8))) - + Range(Interval(F(10), F(INFINITY)))); - - // (5, INF) + (INF, INF) = (INF, INF) - EXPECT_EQ(Range(Interval(F(INFINITY), F(INFINITY))), - Range(Interval(F(5), F(INFINITY))) - + Range(Interval(F(INFINITY), F(INFINITY)))); - - // (5, INF) + (-INF, -INF) = (NAN, NAN) U (-INF, -INF) - Range r27 = Range(Interval(F(5), F(INFINITY))) - + Range(Interval(F(-INFINITY), F(-INFINITY))); - EXPECT_EQ(size_t(2), r27.size()); - EXPECT_EQ(true, (r27[0].first).isNotNumber()); - EXPECT_EQ(true, (r27[0].second).isNotNumber()); - EXPECT_EQ(true, (r27[1].first).isNegativeInf()); - EXPECT_EQ(true, (r27[1].second).isNegativeInf()); - - // (5, INF) + (-INF, 5) = (NAN, NAN) U (-INF, INF) - Range r28 = Range(Interval(F(5), F(INFINITY))) - + Range(Interval(F(-INFINITY), F(5))); - EXPECT_EQ(size_t(2), r28.size()); - EXPECT_EQ(true, (r28[0].first).isNotNumber()); - EXPECT_EQ(true, (r28[0].second).isNotNumber()); - EXPECT_EQ(true, (r28[1].first).isNegativeInf()); - EXPECT_EQ(true, (r28[1].second).isPositiveInf()); - - // (5, INF) + (-INF, INF) = (NAN, NAN) U (-INF, INF) - Range r29 = Range(Interval(F(5), F(INFINITY))) - + Range(Interval(F(-INFINITY), F(INFINITY))); - EXPECT_EQ(size_t(2), r29.size()); - EXPECT_EQ(true, (r29[0].first).isNotNumber()); - EXPECT_EQ(true, (r29[0].second).isNotNumber()); - EXPECT_EQ(true, (r29[1].first).isNegativeInf()); - EXPECT_EQ(true, (r29[1].second).isPositiveInf()); - - // (5, INF) + (NAN, NAN) = (NAN, NAN) - Range r30 = Range(Interval(F(5), F(INFINITY))) - + Range(Interval(F(NAN), F(NAN))); - EXPECT_EQ(size_t(1), r30.size()); - EXPECT_EQ(true, (r30[0].first).isNotNumber()); - EXPECT_EQ(true, (r30[0].second).isNotNumber()); - - // (5, INF) + (10, 20) = (15, INFINITY) - EXPECT_EQ(Range(Interval(F(15), F(INFINITY))), - Range(Interval(F(5), F(INFINITY))) - + Range(Interval(F(10), F(20)))); - - // (5, INF) + (10, INFINITY) = (15, INFINITY) - EXPECT_EQ(Range(Interval(F(15), F(INFINITY))), - Range(Interval(F(5), F(INFINITY))) - + Range(Interval(F(10), F(INFINITY)))); -} - -TEST_F(RangeTest, -BinaryPlusOfEmptyRangesWorksCorrectly) -{ - EXPECT_DEATH(Range() + Range(), ".*!r1.empty().*!r2.empty().*"); - EXPECT_DEATH(Range(I(15)) + Range(), ".*!r1.empty().*!r2.empty().*"); - EXPECT_DEATH(Range() + Range(F(1.5)), ".*!r1.empty().*!r2.empty().*"); -} - - -//////////////////////////////////////////////////////////////////////////////// -// - (binary) -//////////////////////////////////////////////////////////////////////////////// - -TEST_F(RangeTest, -BinaryMinusOfSignedIntAndSignedIntWorksCorrectly) -{ - EXPECT_EQ(Range(Interval(I(vmin()), I(148)), - Interval(I(vmax()), I(vmax()))), - Range(Interval(I(vmin()), I(149))) - - Range(Interval(I(1), I(1)))); - - EXPECT_EQ(Range(Interval(I(0), I(204))), - Range(Interval(I(10), I(200))) - - Range(Interval(I(-4), I(10)))); - - EXPECT_EQ(Range(Interval(I(vmin()), I(199)), - Interval(I(vmax()-9), I(vmax()))), - Range(Interval(I(vmin()), I(200))) - - Range(Interval(I(1), I(10)))); -} - -TEST_F(RangeTest, -BinaryMinusOfSignedIntAndUnsignedIntWorksCorrectly) -{ - EXPECT_EQ(Range(Interval(I(vmin() + 2 + vmax()), - I(-5 + vmax() + 2))), - Range(Interval(I(vmin()), I(-5))) - - Range(Interval(I(vmax()), - I(vmax())))); - - EXPECT_EQ(Range(Interval(I(vmin() + vmax() + 1), - I(-5 + vmax() + 1))), - Range(Interval(I(vmin()), I(-5))) - - Range(Interval(I(0), - I(0)))); - - EXPECT_EQ(Range(Interval(I(vmin() + vmax() + 1), - I(0))), - Range(Interval(I(vmin()), I(0))) - - Range(Interval(I(0), - I(0)))); -} - -TEST_F(RangeTest, -BinaryMinusOfSignedIntAndFloatWorksCorrectly) -{ - EXPECT_EQ(Range(Interval(F(9), F(vmax() - 1.0))), - Range(Interval(I(10), I(vmax()))) - - Range(Interval(F(1), F(1)))); - - EXPECT_EQ(Range(Interval(F(vmin()), - F(-4))), - Range(Interval(I(1), I(1))) - - Range(Interval(F(5.0), F(vmax())))); - - EXPECT_EQ(Range(Interval(F(vmin() + 105.35), - F(vmax() - 105.35))), - Range(Interval(I(vmin()), I(vmax()))) - - Range(Interval(F(-105.35), F(105.35)))); -} - -TEST_F(RangeTest, -BinaryMinusOfUnsignedIntAndSignedIntWorksCorrectly) -{ - EXPECT_EQ(Range(Interval(I(vmin()), - I(vmax()))), - Range(Interval(I(vmin()), - I(vmax()))) - - Range(Interval(I(1), I(1)))); - - EXPECT_EQ(Range(Interval(I(vmin()), - I(4535+100)), - Interval(I(vmax() - 1), - I(vmax()))), - Range(Interval(I(8), I(4535))) - - Range(Interval(I(-100), I(10)))); -} - -TEST_F(RangeTest, -BinaryMinusOfUnsignedIntAndUnsignedIntWorksCorrectly) -{ - EXPECT_EQ(Range(Interval(I(0), I(0)), - Interval(I(11), I(vmax()))), - Range(Interval(I(10), I(vmax()))) - - Range(Interval(I(-1), I(-1)))); - - EXPECT_EQ(Range(Interval(I(8), I(14)), - Interval(I(18), I(24)), - Interval(I(98), I(124))), - Range(Interval(I(10), I(15)), - Interval(I(20), I(25)), - Interval(I(100), I(125))) - - Range(Interval(I(1), I(1)), - Interval(I(2), I(2)))); -} - -TEST_F(RangeTest, -BinaryMinusOfUnsignedIntAndFloatWorksCorrectly) -{ - EXPECT_EQ(Range(Interval(F(vmin() - vmax()), - F(vmax() - vmin()))), - Range(Interval(I(vmin()), - I(vmax()))) - - Range(Interval(F(vmin()), - F(vmax())))); - - EXPECT_EQ(Range(Interval(F(vmin() - 1.0), - F(vmax() - 1.0))), - Range(Interval(I(vmin()), - I(vmax()))) - - Range(Interval(F(1.0), - F(1.0)))); - - EXPECT_EQ(Range(Interval(F(25 - 128.0), F(1438 + 27.35))), - Range(Interval(I(25), I(1438))) - - Range(Interval(F(-27.35), F(128.0)))); -} - -TEST_F(RangeTest, -BinaryMinusOfFloatAndSignedIntWorksCorrectly) -{ - EXPECT_EQ(Range(Interval(F(vmin() - 128.35), - F(vmax() + 1265.78))), - Range(Interval(F(vmin()), - F(vmax()))) - - Range(Interval(I(-1265.78), I(128.35)))); -} - -TEST_F(RangeTest, -BinaryMinusOfFloatAndUnsignedIntWorksCorrectly) -{ - EXPECT_EQ(Range(Interval(F(-12589.6 - 589), - F(12583.78 - 437))), - Range(Interval(F(-12589.6), F(12583.78))) - - Range(Interval(I(437), I(589)))); -} - -TEST_F(RangeTest, -BinaryMinusOfFloatAndFloatWorksCorrectly) -{ - EXPECT_EQ(Range(F(-INFINITY)), - Range(F(vmin())) - Range(F(1e308))); - - EXPECT_EQ(Range(F(INFINITY)), - Range(F(vmax())) - Range(F(-1e308))); - - EXPECT_EQ(Range(F(-INFINITY)), - Range(F(vmin())) - Range(F(1e300))); - - EXPECT_EQ(Range(F(INFINITY)), - Range(F(vmax())) - Range(F(-1e300))); - - EXPECT_EQ(Range(Interval(F(14.35 - 7898.0), - F(14587.8 - 7.8))), - Range(Interval(F(14.35), F(14587.8))) - - Range(Interval(F(7.8), F(7898.0)))); -} - -TEST_F(RangeTest, -BinaryMinusOfSpecialFloatsWorksCorrectly) -{ - // (INF, INF) - (INF, INF) = (NAN, NAN) - Range r1 = Range(Interval(F(INFINITY), F(INFINITY))) - - Range(Interval(F(INFINITY), F(INFINITY))); - EXPECT_EQ(size_t(1), r1.size()); - EXPECT_EQ(true, (r1[0].first).isNotNumber()); - EXPECT_EQ(true, (r1[0].second).isNotNumber()); - - // (INF, INF) - (-INF, -INF) = (INF, INF) - EXPECT_EQ(Range(Interval(F(INFINITY), F(INFINITY))), - Range(Interval(F(INFINITY), F(INFINITY))) - - Range(Interval(F(-INFINITY), F(-INFINITY)))); - - // (INF, INF) - (-INF, 5) = (INF, INF) - EXPECT_EQ(Range(Interval(F(INFINITY), F(INFINITY))), - Range(Interval(F(INFINITY), F(INFINITY))) - - Range(Interval(F(-INFINITY), F(5)))); - - // (INF, INF) - (-INF, INF) = (NAN, NAN) U (INF, INF) - Range r2 = Range(Interval(F(INFINITY), F(INFINITY))) - - Range(Interval(F(-INFINITY), F(INFINITY))); - EXPECT_EQ(size_t(2), r2.size()); - EXPECT_EQ(true, (r2[0].first).isNotNumber()); - EXPECT_EQ(true, (r2[0].second).isNotNumber()); - EXPECT_EQ(true, (r2[1].first).isPositiveInf()); - EXPECT_EQ(true, (r2[1].second).isPositiveInf()); - - // (INF, INF) - (NAN, NAN) = (NAN, NAN) - Range r3 = Range(Interval(F(INFINITY), F(INFINITY))) - - Range(Interval(F(NAN), F(NAN))); - EXPECT_EQ(size_t(1), r3.size()); - EXPECT_EQ(true, (r3[0].first).isNotNumber()); - EXPECT_EQ(true, (r3[0].second).isNotNumber()); - - // (INF, INF) - (x, y) = (INF, INF) - EXPECT_EQ(Range(Interval(F(INFINITY), F(INFINITY))), - Range(Interval(F(INFINITY), F(INFINITY))) - - Range(Interval(F(5), F(10)))); - - // (INF, INF) - (x, INF) = (NAN, NAN) U (INF, INF) - Range r4 = Range(Interval(F(INFINITY), F(INFINITY))) - - Range(Interval(F(5), F(INFINITY))); - EXPECT_EQ(size_t(2), r4.size()); - EXPECT_EQ(true, (r4[0].first).isNotNumber()); - EXPECT_EQ(true, (r4[0].second).isNotNumber()); - EXPECT_EQ(true, (r4[1].first).isPositiveInf()); - EXPECT_EQ(true, (r4[1].second).isPositiveInf()); - - // (-INF, -INF) - (INF, INF) = (-INF, -INF) - EXPECT_EQ(Range(Interval(F(-INFINITY), F(-INFINITY))), - Range(Interval(F(-INFINITY), F(-INFINITY))) - - Range(Interval(F(INFINITY), F(INFINITY)))); - - // (-INF, -INF) - (-INF, -INF) = (NAN, NAN) - Range r5 = Range(Interval(F(-INFINITY), F(-INFINITY))) - - Range(Interval(F(-INFINITY), F(-INFINITY))); - EXPECT_EQ(size_t(1), r5.size()); - EXPECT_EQ(true, (r5[0].first).isNotNumber()); - EXPECT_EQ(true, (r5[0].second).isNotNumber()); - - // (-INF, -INF) - (-INF, 5) = (NAN,NAN) U (-INF, -INF) - Range r6 = Range(Interval(F(-INFINITY), F(-INFINITY))) - - Range(Interval(F(-INFINITY), F(5))); - EXPECT_EQ(size_t(2), r6.size()); - EXPECT_EQ(true, (r6[0].first).isNotNumber()); - EXPECT_EQ(true, (r6[0].second).isNotNumber()); - EXPECT_EQ(true, (r6[1].first).isNegativeInf()); - EXPECT_EQ(true, (r6[1].second).isNegativeInf()); - - // (-INF, -INF) - (-INF, INF) = (NAN, NAN) U (-INF, -INF) - Range r7 = Range(Interval(F(-INFINITY), F(-INFINITY))) - - Range(Interval(F(-INFINITY), F(INFINITY))); - EXPECT_EQ(size_t(2), r7.size()); - EXPECT_EQ(true, (r7[0].first).isNotNumber()); - EXPECT_EQ(true, (r7[0].second).isNotNumber()); - EXPECT_EQ(true, (r7[1].first).isNegativeInf()); - EXPECT_EQ(true, (r7[1].second).isNegativeInf()); - - // (-INF, -INF) - (NAN, NAN) = (NAN, NAN) - Range r8 = Range(Interval(F(-INFINITY), F(-INFINITY))) - - Range(Interval(F(NAN), F(NAN))); - EXPECT_EQ(size_t(1), r8.size()); - EXPECT_EQ(true, (r8[0].first).isNotNumber()); - EXPECT_EQ(true, (r8[0].second).isNotNumber()); - - // (-INF, -INF) - (1, 5) = (-INF, -INF) - EXPECT_EQ(Range(Interval(F(-INFINITY), F(-INFINITY))), - Range(Interval(F(-INFINITY), F(-INFINITY))) - - Range(Interval(F(1), F(5)))); - - // (-INF, -INF) - (1, INF) = (-INF, -INF) - EXPECT_EQ(Range(Interval(F(-INFINITY), F(-INFINITY))), - Range(Interval(F(-INFINITY), F(-INFINITY))) - - Range(Interval(F(1), F(INFINITY)))); - - // (-INF, 5) - (INF, INF) = (-INF, -INF) - EXPECT_EQ(Range(Interval(F(-INFINITY), F(-INFINITY))), - Range(Interval(F(-INFINITY), F(5))) - - Range(Interval(F(INFINITY), F(INFINITY)))); - - // (-INF, 5) - (-INF, -INF) = (NAN, NAN) - Range r9 = Range(Interval(F(-INFINITY), F(5))) - - Range(Interval(F(-INFINITY), F(-INFINITY))); - EXPECT_EQ(size_t(2), r9.size()); - EXPECT_EQ(true, (r9[0].first).isNotNumber()); - EXPECT_EQ(true, (r9[0].second).isNotNumber()); - EXPECT_EQ(true, (r9[1].first).isPositiveInf()); - EXPECT_EQ(true, (r9[1].second).isPositiveInf()); - - // (-INF, 5) - (-INF, 5) = (NAN, NAN) U (-INF, INF) - Range r10 = Range(Interval(F(-INFINITY), F(5))) - - Range(Interval(F(-INFINITY), F(5))); - EXPECT_EQ(size_t(2), r10.size()); - EXPECT_EQ(true, (r10[0].first).isNotNumber()); - EXPECT_EQ(true, (r10[0].second).isNotNumber()); - EXPECT_EQ(true, (r10[1].first).isNegativeInf()); - EXPECT_EQ(true, (r10[1].second).isPositiveInf()); - - // (-INF, 5) - (-INF, INF) = (NAN, NAN) U (-INF, INF) - Range r11 = Range(Interval(F(-INFINITY), F(5))) - - Range(Interval(F(-INFINITY), F(INFINITY))); - EXPECT_EQ(size_t(2), r11.size()); - EXPECT_EQ(true, (r11[0].first).isNotNumber()); - EXPECT_EQ(true, (r11[0].second).isNotNumber()); - EXPECT_EQ(true, (r11[1].first).isNegativeInf()); - EXPECT_EQ(true, (r11[1].second).isPositiveInf()); - - // (-INF, 5) - (NAN, NAN) = (NAN, NAN) - Range r12 = Range(Interval(F(-INFINITY), F(5))) - - Range(Interval(F(NAN), F(NAN))); - EXPECT_EQ(size_t(1), r12.size()); - EXPECT_EQ(true, (r12[0].first).isNotNumber()); - EXPECT_EQ(true, (r12[0].second).isNotNumber()); - - // (-INF, 5) - (10, 20) = (-INF, 5-10) - EXPECT_EQ(Range(Interval(F(-INFINITY), F(5-10))), - Range(Interval(F(-INFINITY), F(5))) - - Range(Interval(F(10), F(20)))); - - // (-INF, 5) - (10, INF) = (-INF, 5-10) - EXPECT_EQ(Range(Interval(F(-INFINITY), F(5-10))), - Range(Interval(F(-INFINITY), F(5))) - - Range(Interval(F(10), F(INFINITY)))); - - // (-INF, INF) - (INF, INF) = (NAN, NAN) U (-INF, -INF) - Range r13 = Range(Interval(F(-INFINITY), F(INFINITY))) - - Range(Interval(F(INFINITY), F(INFINITY))); - EXPECT_EQ(size_t(2), r13.size()); - EXPECT_EQ(true, (r13[0].first).isNotNumber()); - EXPECT_EQ(true, (r13[0].second).isNotNumber()); - EXPECT_EQ(true, (r13[1].first).isNegativeInf()); - EXPECT_EQ(true, (r13[1].second).isNegativeInf()); - - // (-INF, INF) - (-INF, -INF) = (NAN, NAN) U (INF, INF) - Range r14 = Range(Interval(F(-INFINITY), F(INFINITY))) - - Range(Interval(F(-INFINITY), F(-INFINITY))); - EXPECT_EQ(size_t(2), r14.size()); - EXPECT_EQ(true, (r14[0].first).isNotNumber()); - EXPECT_EQ(true, (r14[0].second).isNotNumber()); - EXPECT_EQ(true, (r14[1].first).isPositiveInf()); - EXPECT_EQ(true, (r14[1].second).isPositiveInf()); - - // (-INF, INF) - (-INF, 5) = (NAN, NAN) U (-INF, INF) - Range r15 = Range(Interval(F(-INFINITY), F(INFINITY))) - - Range(Interval(F(-INFINITY), F(5))); - EXPECT_EQ(size_t(2), r15.size()); - EXPECT_EQ(true, (r15[0].first).isNotNumber()); - EXPECT_EQ(true, (r15[0].second).isNotNumber()); - EXPECT_EQ(true, (r15[1].first).isNegativeInf()); - EXPECT_EQ(true, (r15[1].second).isPositiveInf()); - - // (-INF, INF) - (-INF, INF) = (NAN, NAN) U (-INF, INF) - Range r16 = Range(Interval(F(-INFINITY), F(INFINITY))) - - Range(Interval(F(-INFINITY), F(INFINITY))); - EXPECT_EQ(size_t(2), r16.size()); - EXPECT_EQ(true, (r16[0].first).isNotNumber()); - EXPECT_EQ(true, (r16[0].second).isNotNumber()); - EXPECT_EQ(true, (r16[1].first).isNegativeInf()); - EXPECT_EQ(true, (r16[1].second).isPositiveInf()); - - // (-INF, INF) - (NAN, NAN) = (NAN, NAN) - Range r17 = Range(Interval(F(-INFINITY), F(INFINITY))) - - Range(Interval(F(NAN), F(NAN))); - EXPECT_EQ(size_t(1), r17.size()); - EXPECT_EQ(true, (r17[0].first).isNotNumber()); - EXPECT_EQ(true, (r17[0].second).isNotNumber()); - - // (-INF, INF) - (5, 8) = (-INF, INF) - EXPECT_EQ(Range(Interval(F(-INFINITY), F(INFINITY))), - Range(Interval(F(-INFINITY), F(INFINITY))) - - Range(Interval(F(5), F(8)))); - - // (-INF, INF) - (5, INF) = (NAN, NAN) U (-INF, INF) - Range r18 = Range(Interval(F(-INFINITY), F(INFINITY))) - - Range(Interval(F(5), F(INFINITY))); - EXPECT_EQ(size_t(2), r18.size()); - EXPECT_EQ(true, (r18[0].first).isNotNumber()); - EXPECT_EQ(true, (r18[0].second).isNotNumber()); - EXPECT_EQ(true, (r18[1].first).isNegativeInf()); - EXPECT_EQ(true, (r18[1].second).isPositiveInf()); - - // (NAN, NAN) - (INF, INF) = (NAN, NAN) - Range r19 = Range(Interval(F(NAN), F(NAN))) - - Range(Interval(F(INFINITY), F(INFINITY))); - EXPECT_EQ(size_t(1), r19.size()); - EXPECT_EQ(true, (r19[0].first).isNotNumber()); - EXPECT_EQ(true, (r19[0].second).isNotNumber()); - - // (NAN, NAN) - (-INF, -INF) = (NAN, NAN) - Range r20 = Range(Interval(F(NAN), F(NAN))) - - Range(Interval(F(-INFINITY), F(-INFINITY))); - EXPECT_EQ(size_t(1), r20.size()); - EXPECT_EQ(true, (r20[0].first).isNotNumber()); - EXPECT_EQ(true, (r20[0].second).isNotNumber()); - - // (NAN, NAN) - (-INF, 5) = (NAN, NAN) - Range r21 = Range(Interval(F(NAN), F(NAN))) - - Range(Interval(F(-INFINITY), F(5))); - EXPECT_EQ(size_t(1), r21.size()); - EXPECT_EQ(true, (r21[0].first).isNotNumber()); - EXPECT_EQ(true, (r21[0].second).isNotNumber()); - - // (NAN, NAN) - (-INF, INF) = (NAN, NAN) - Range r22 = Range(Interval(F(NAN), F(NAN))) - - Range(Interval(F(-INFINITY), F(INFINITY))); - EXPECT_EQ(size_t(1), r22.size()); - EXPECT_EQ(true, (r22[0].first).isNotNumber()); - EXPECT_EQ(true, (r22[0].second).isNotNumber()); - - // (NAN, NAN) - (NAN, NAN) = (NAN, NAN) - Range r23 = Range(Interval(F(NAN), F(NAN))) - - Range(Interval(F(NAN), F(NAN))); - EXPECT_EQ(size_t(1), r23.size()); - EXPECT_EQ(true, (r23[0].first).isNotNumber()); - EXPECT_EQ(true, (r23[0].second).isNotNumber()); - - // (NAN, NAN) - (5, 8) = (NAN, NAN) - Range r24 = Range(Interval(F(NAN), F(NAN))) - - Range(Interval(F(5), F(8))); - EXPECT_EQ(size_t(1), r24.size()); - EXPECT_EQ(true, (r24[0].first).isNotNumber()); - EXPECT_EQ(true, (r24[0].second).isNotNumber()); - - // (NAN, NAN) - (5, INF) = (NAN, NAN) - Range r25 = Range(Interval(F(NAN), F(NAN))) - - Range(Interval(F(5), F(INFINITY))); - EXPECT_EQ(size_t(1), r25.size()); - EXPECT_EQ(true, (r25[0].first).isNotNumber()); - EXPECT_EQ(true, (r25[0].second).isNotNumber()); - - // (5, 8) - (INF, INF) = (-INF, -INF) - EXPECT_EQ(Range(Interval(F(-INFINITY), F(-INFINITY))), - Range(Interval(F(5), F(8))) - - Range(Interval(F(INFINITY), F(INFINITY)))); - - // (5, 8) - (-INF, -INF) = (INF, INF) - EXPECT_EQ(Range(Interval(F(INFINITY), F(INFINITY))), - Range(Interval(F(5), F(8))) - - Range(Interval(F(-INFINITY), F(-INFINITY)))); - - // (5, 8) - (-INF, 10) = (5-10, INF) - EXPECT_EQ(Range(Interval(F(5-10), F(INFINITY))), - Range(Interval(F(5), F(8))) - - Range(Interval(F(-INFINITY), F(10)))); - - // (5, 8) - (-INF, INF) = (-INF, INF) - EXPECT_EQ(Range(Interval(F(-INFINITY), F(INFINITY))), - Range(Interval(F(5), F(8))) - - Range(Interval(F(-INFINITY), F(INFINITY)))); - - // (5, 8) - (NAN, NAN) = (NAN, NAN) - Range r26 = Range(Interval(F(5), F(8))) - - Range(Interval(F(NAN), F(NAN))); - EXPECT_EQ(size_t(1), r26.size()); - EXPECT_EQ(true, (r26[0].first).isNotNumber()); - EXPECT_EQ(true, (r26[0].second).isNotNumber()); - - // (5, 8) - (10, 20) = (-15, -2) - EXPECT_EQ(Range(Interval(F(5-20), F(8-10))), - Range(Interval(F(5), F(8))) - - Range(Interval(F(10), F(20)))); - - // (5, 8) - (10, INF) = (-INF, -2) - EXPECT_EQ(Range(Interval(F(-INFINITY), F(8-10))), - Range(Interval(F(5), F(8))) - - Range(Interval(F(10), F(INFINITY)))); - - // (5, INF) - (INF, INF) = (NAN, NAN) U (-INF, -INF) - Range r27 = Range(Interval(F(5), F(INFINITY))) - - Range(Interval(F(INFINITY), F(INFINITY))); - EXPECT_EQ(size_t(2), r27.size()); - EXPECT_EQ(true, (r27[0].first).isNotNumber()); - EXPECT_EQ(true, (r27[0].second).isNotNumber()); - EXPECT_EQ(true, (r27[1].first).isNegativeInf()); - EXPECT_EQ(true, (r27[1].second).isNegativeInf()); - - // (5, INF) - (-INF, -INF) = (INF, INF) - EXPECT_EQ(Range(Interval(F(INFINITY), F(INFINITY))), - Range(Interval(F(5), F(INFINITY))) - - Range(Interval(F(-INFINITY), F(-INFINITY)))); - - // (5, INF) - (-INF, 10) = (5 - 10, INF) - EXPECT_EQ(Range(Interval(F(5-10), F(INFINITY))), - Range(Interval(F(5), F(INFINITY))) - - Range(Interval(F(-INFINITY), F(10)))); - - // (5, INF) - (-INF, INF) = (NAN, NAN) U (-INF, INF) - Range r28 = Range(Interval(F(5), F(INFINITY))) - - Range(Interval(F(-INFINITY), F(INFINITY))); - EXPECT_EQ(size_t(2), r28.size()); - EXPECT_EQ(true, (r28[0].first).isNotNumber()); - EXPECT_EQ(true, (r28[0].second).isNotNumber()); - EXPECT_EQ(true, (r28[1].first).isNegativeInf()); - EXPECT_EQ(true, (r28[1].second).isPositiveInf()); - - // (5, INF) - (NAN, NAN) = (NAN, NAN) - Range r29 = Range(Interval(F(5), F(INFINITY))) - - Range(Interval(F(NAN), F(NAN))); - EXPECT_EQ(size_t(1), r29.size()); - EXPECT_EQ(true, (r29[0].first).isNotNumber()); - EXPECT_EQ(true, (r29[0].second).isNotNumber()); - - // (5, INF) - (10, 20) = (5-20, INF) - EXPECT_EQ(Range(Interval(F(5-20), F(INFINITY))), - Range(Interval(F(5), F(INFINITY))) - - Range(Interval(F(10), F(20)))); - - // (5, INF) - (10, INF) = (NAN, NAN) U (-INF, INF) - Range r30 = Range(Interval(F(5), F(INFINITY))) - - Range(Interval(F(10), F(INFINITY))); - EXPECT_EQ(size_t(2), r30.size()); - EXPECT_EQ(true, (r30[0].first).isNotNumber()); - EXPECT_EQ(true, (r30[0].second).isNotNumber()); - EXPECT_EQ(true, (r30[1].first).isNegativeInf()); - EXPECT_EQ(true, (r30[1].second).isPositiveInf()); -} - -TEST_F(RangeTest, -BinaryMinusOfEmptyRangesWorksCorrectly) -{ - EXPECT_DEATH(Range() - Range(), ".*!r1.empty().*!r2.empty().*"); - EXPECT_DEATH(Range(I(15)) - Range(), ".*!r1.empty().*!r2.empty().*"); - EXPECT_DEATH(Range() - Range(F(1.5)), ".*!r1.empty().*!r2.empty().*"); -} - -//////////////////////////////////////////////////////////////////////////////// -// * (binary) -//////////////////////////////////////////////////////////////////////////////// - -TEST_F(RangeTest, -MultiplicationOfSignedIntAndSignedIntWorksCorrectly) -{ - EXPECT_EQ(Range(Interval(I(vmin()), I(-2)), - Interval(I(20), I(vmax()))), - Range(Interval(I(10), I(vmax()))) - * Range(Interval(I(2), I(2)))); - - EXPECT_EQ(Range(Interval(I(-800), I(2000))), - Range(Interval(I(10), I(200))) - * Range(Interval(I(-4), I(10)))); - - EXPECT_EQ(Range(Interval(I(vmin()), I(vmax()))), - Range(Interval(I(vmin()), I(200))) - * Range(Interval(I(-1), I(10)))); - - EXPECT_EQ(Range(Interval(I(vmin()), I(vmin())), - Interval(I(-200), I(vmax()))), - Range(Interval(I(vmin()), I(200))) - * Range(Interval(I(-1), I(-1)))); - - EXPECT_EQ(Range(Interval(I(vmin()), I((vmax() / 2 + 5) * 2)), - Interval(I((vmax() / 2 - 5) * 2), I(vmax()))), - Range(Interval(I(vmax() / 2 - 5), I(vmax() / 2 + 5))) - * Range(Interval(I(2), I(2)))); -} - -TEST_F(RangeTest, -MultiplicationOfSignedIntAndUnsignedIntWorksCorrectly) -{ - EXPECT_EQ(Range(Interval(I(0), I(vmax()))), - Range(Interval(I(vmin()), I(-5))) - * Range(Interval(I(vmax()), - I(vmax())))); - - EXPECT_EQ(Range(Interval(I(0), I(0))), - Range(Interval(I(vmin()), I(-5))) - * Range(Interval(I(0), - I(0)))); - - EXPECT_EQ(Range(Interval(I(0), I(0))), - Range(Interval(I(vmin()), I(0))) - * Range(Interval(I(0), I(0)))); -} - -TEST_F(RangeTest, -MultiplicationOfSignedIntAndFloatWorksCorrectly) -{ - EXPECT_EQ(Range(Interval(F(10), F(vmax() * 1.0))), - Range(Interval(I(10), I(vmax()))) - * Range(Interval(F(1), F(1)))); - - EXPECT_EQ(Range(Interval(F(1 * 5.0), F(1 * vmax()))), - Range(Interval(I(1), I(1))) - * Range(Interval(F(5.0), F(vmax())))); - - EXPECT_EQ(Range(Interval(F(vmin() * 105.35), - F(vmax() * 105.35))), - Range(Interval(I(vmin()), I(vmax()))) - * Range(Interval(F(-105.35), F(105.35)))); -} - -TEST_F(RangeTest, -MultiplicationOfUnsignedIntAndSignedIntWorksCorrectly) -{ - EXPECT_EQ(Range(Interval(I(vmin()), - I(vmax()))), - Range(Interval(I(vmin()), - I(vmax()))) - * Range(Interval(I(-1), I(-1)))); - - EXPECT_EQ(Range(Interval(I(vmin()), I(4535*100)), - Interval(I(unsigned(-45350)), - I(vmax()))), - Range(Interval(I(8), I(4535))) - * Range(Interval(I(-10), I(100)))); -} - -TEST_F(RangeTest, -MultiplicationOfUnsignedIntAndUnsignedIntWorksCorrectly) -{ - EXPECT_EQ(Range(Interval(I(10), I(vmax()))), - Range(Interval(I(10), I(vmax()))) - * Range(Interval(I(1), I(1)))); - - EXPECT_EQ(Range(Interval(I(20), I(30)), - Interval(I(40), I(50)), - Interval(I(200), I(250))), - Range(Interval(I(10), I(15)), - Interval(I(20), I(25)), - Interval(I(100), I(125))) - * Range(Interval(I(2), I(2)))); - - EXPECT_EQ(Range(Interval(I(0), I(vmax()))), - Range(Interval(I(10), I(vmax()))) - * Range(Interval(I(vmax()), - I(vmax())))); -} - -TEST_F(RangeTest, -MultiplicationOfUnsignedIntAndFloatWorksCorrectly) -{ - EXPECT_EQ(Range(Interval(F(vmax() * vmin()), - F(vmax() * vmax()))), - Range(Interval(I(vmin()), - I(vmax()))) - * Range(Interval(F(vmin()), - F(vmax())))); - - EXPECT_EQ(Range(Interval(F(vmax() * (-1.0)), - F(vmin() * (-1.0)))), - Range(Interval(I(vmin()), - I(vmax()))) - * Range(Interval(F(-1.0), F(-1.0)))); - - EXPECT_EQ(Range(Interval(F(1438 * (-27.35)), F(1438 * 128.0))), - Range(Interval(I(25), I(1438))) - * Range(Interval(F(-27.35), F(128.0)))); -} - -TEST_F(RangeTest, -MultiplicationOfFloatAndSignedIntWorksCorrectly) -{ - EXPECT_EQ(Range(Interval(F(vmin() * 128.35), - F(vmax() * 128.35))), - Range(Interval(F(vmin()), - F(vmax()))) - * Range(Interval(I(-1265.78), I(128.35)))); -} - -TEST_F(RangeTest, -MultiplicationOfFloatAndUnsignedIntWorksCorrectly) -{ - EXPECT_EQ(Range(Interval(F(-12589.6 * 589), - F(12583.78 * 589))), - Range(Interval(F(-12589.6), F(12583.78))) - * Range(Interval(I(437), I(589)))); -} - -TEST_F(RangeTest, -MultiplicationOfFloatAndFloatWorksCorrectly) -{ - EXPECT_EQ(Range(F(INFINITY)), - Range(F(vmin())) * Range(F(-1e308))); - - EXPECT_EQ(Range(F(INFINITY)), - Range(F(vmax())) * Range(F(1e308))); - - EXPECT_EQ(Range(F(INFINITY)), - Range(F(vmin())) * Range(F(-1e300))); - - EXPECT_EQ(Range(F(INFINITY)), - Range(F(vmax())) * Range(F(1e300))); - - EXPECT_EQ(Range(F(-INFINITY)), - Range(F(vmin())) * Range(F(1e300))); - - EXPECT_EQ(Range(F(-INFINITY)), - Range(F(vmax())) * Range(F(-1e300))); - - EXPECT_EQ(Range(Interval(F(7.8 * 14.35), F(7898.0 * 14587.8))), - Range(Interval(F(14.35), F(14587.8))) - * Range(Interval(F(7.8), F(7898.0)))); - - EXPECT_EQ(Range(Interval(F(-50), F(0))), - Range(Interval(F(2), F(5))) - * Range(Interval(F(-10), F(0)))); - - EXPECT_EQ(Range(Interval(F(-50), F(50))), - Range(Interval(F(2), F(5))) - * Range(Interval(F(-10), F(10)))); - - EXPECT_EQ(Range(Interval(F(-40), F(-6))), - Range(Interval(F(2), F(5))) - * Range(Interval(F(-8), F(-3)))); - - EXPECT_EQ(Range(Interval(F(-50), F(50))), - Range(Interval(F(-10), F(10))) - * Range(Interval(F(2), F(5)))); - - EXPECT_EQ(Range(Interval(F(-100), F(80))), - Range(Interval(F(-5), F(4))) - * Range(Interval(F(-10), F(20)))); - - EXPECT_EQ(Range(Interval(F(-200), F(400))), - Range(Interval(F(-5), F(20))) - * Range(Interval(F(-10), F(20)))); - - EXPECT_EQ(Range(Interval(F(-50), F(50))), - Range(Interval(F(-5), F(5))) - * Range(Interval(F(-10), F(-1)))); - - EXPECT_EQ(Range(Interval(F(-505), F(-10))), - Range(Interval(F(-5), F(-1))) - * Range(Interval(F(10), F(101)))); - - EXPECT_EQ(Range(Interval(F(-50), F(50))), - Range(Interval(F(-10), F(-1))) - * Range(Interval(F(-5), F(5)))); - - EXPECT_EQ(Range(Interval(F(-40), F(40))), - Range(Interval(F(-8), F(-3))) - * Range(Interval(F(-5), F(5)))); -} - -TEST_F(RangeTest, -MultiplicationOfSpecialFloatsWorksCorrectly) -{ - // (INF, INF) * (INF, INF) = (INF, INF) - EXPECT_EQ(Range(Interval(F(INFINITY), F(INFINITY))), - Range(Interval(F(INFINITY), F(INFINITY))) - * Range(Interval(F(INFINITY), F(INFINITY)))); - - // (INF, INF) * (-INF, -INF) = (-INF, -INF) - EXPECT_EQ(Range(Interval(F(-INFINITY), F(-INFINITY))), - Range(Interval(F(INFINITY), F(INFINITY))) - * Range(Interval(F(-INFINITY), F(-INFINITY)))); - - // (INF, INF) * (-INF, 5) = (NAN, NAN) U (-INF, -INF) U (INF, INF) - EXPECT_EQ(Range(Interval(F(NAN), F(NAN)), - Interval(F(-INFINITY), F(-INFINITY)), - Interval(F(INFINITY), F(INFINITY))), - Range(Interval(F(INFINITY), F(INFINITY))) - * Range(Interval(F(-INFINITY), F(5)))); - - // (INF, INF) * (-INF, INF) = (NAN, NAN) U (-INF, -INF) U (INF, INF) - EXPECT_EQ(Range(Interval(F(NAN), F(NAN)), - Interval(F(-INFINITY), F(-INFINITY)), - Interval(F(INFINITY), F(INFINITY))), - Range(Interval(F(INFINITY), F(INFINITY))) - * Range(Interval(F(-INFINITY), F(INFINITY)))); - - // (INF, INF) * (NAN, NAN) = (NAN, NAN) - Range r1 = Range(Interval(F(INFINITY), F(INFINITY))) - * Range(Interval(F(NAN), F(NAN))); - EXPECT_EQ(size_t(1), r1.size()); - EXPECT_EQ(true, (r1[0].first).isNotNumber()); - EXPECT_EQ(true, (r1[0].second).isNotNumber()); - - // (INF, INF) * (x, y) = (INF, INF), there is no zero in (x, y) - EXPECT_EQ(Range(Interval(F(INFINITY), F(INFINITY))), - Range(Interval(F(INFINITY), F(INFINITY))) - * Range(Interval(F(5.0), F(8.0)))); - - // (INF, INF) * (x, y) = (NAN, NAN) U (INF, INF), there is zero in (x, y) - EXPECT_EQ(Range(Interval(F(NAN), F(NAN)), - Interval(F(INFINITY), F(INFINITY))), - Range(Interval(F(INFINITY), F(INFINITY))) - * Range(Interval(F(-5.0), F(8.0)))); - - // (INF, INF) * (x, INF) = (INF, INF), there is no zero in (x, INF) - EXPECT_EQ(Range(Interval(F(INFINITY), F(INFINITY))), - Range(Interval(F(INFINITY), F(INFINITY))) - * Range(Interval(F(1.35), F(INFINITY)))); - - // (INF, INF) * (x, INF) = (NAN, NAN) U (INF, INF), there is zero in (x, INF) - EXPECT_EQ(Range(Interval(F(NAN), F(NAN)), - Interval(F(INFINITY), F(INFINITY))), - Range(Interval(F(INFINITY), F(INFINITY))) - * Range(Interval(F(-1.35), F(INFINITY)))); - - // (-INF, -INF) * (INF, INF) = (-INF, -INF) - EXPECT_EQ(Range(Interval(F(-INFINITY), F(-INFINITY))), - Range(Interval(F(-INFINITY), F(-INFINITY))) - * Range(Interval(F(INFINITY), F(INFINITY)))); - - // (-INF, -INF) * (-INF, -INF) = (INF, INF) - EXPECT_EQ(Range(Interval(F(INFINITY), F(INFINITY))), - Range(Interval(F(-INFINITY), F(-INFINITY))) - * Range(Interval(F(-INFINITY), F(-INFINITY)))); - - // (-INF, -INF) * (-INF, 5) = (NAN, NAN) U (-INF, -INF) U (INF, INF) - EXPECT_EQ(Range(Interval(F(NAN), F(NAN)), - Interval(F(-INFINITY), F(-INFINITY)), - Interval(F(INFINITY), F(INFINITY))), - Range(Interval(F(-INFINITY), F(-INFINITY))) - * Range(Interval(F(-INFINITY), F(5)))); - - // (-INF, -INF) * (-INF, INF) = (NAN, NAN) U (-INF, -INF) U (INF, INF) - EXPECT_EQ(Range(Interval(F(NAN), F(NAN)), - Interval(F(-INFINITY), F(-INFINITY)), - Interval(F(INFINITY), F(INFINITY))), - Range(Interval(F(-INFINITY), F(-INFINITY))) - * Range(Interval(F(-INFINITY), F(INFINITY)))); - - // (-INF, -INF) * (NAN, NAN) = (NAN, NAN) - Range r2 = Range(Interval(F(-INFINITY), F(-INFINITY))) - * Range(Interval(F(NAN), F(NAN))); - EXPECT_EQ(size_t(1), r2.size()); - EXPECT_EQ(true, (r2[0].first).isNotNumber()); - EXPECT_EQ(true, (r2[0].second).isNotNumber()); - - // (-INF, -INF) * (1, 5) = (-INF, -INF) - EXPECT_EQ(Range(Interval(F(-INFINITY), F(-INFINITY))), - Range(Interval(F(-INFINITY), F(-INFINITY))) - * Range(Interval(F(1), F(5)))); - - // (-INF, -INF) * (1, INF) = (-INF, -INF) - EXPECT_EQ(Range(Interval(F(-INFINITY), F(-INFINITY))), - Range(Interval(F(-INFINITY), F(-INFINITY))) - * Range(Interval(F(1), F(INFINITY)))); - - // (-INF, 5) * (INF, INF) = (NAN, NAN) U (-INF, -INF) U (INF, INF) - EXPECT_EQ(Range(Interval(F(NAN), F(NAN)), - Interval(F(-INFINITY), F(-INFINITY)), - Interval(F(INFINITY), F(INFINITY))), - Range(Interval(F(-INFINITY), F(5))) - * Range(Interval(F(INFINITY), F(INFINITY)))); - - // (-INF, 5) * (-INF, -INF) = (NAN, NAN) U (-INF, -INF) U (INF, INF) - EXPECT_EQ(Range(Interval(F(NAN), F(NAN)), - Interval(F(-INFINITY), F(-INFINITY)), - Interval(F(INFINITY), F(INFINITY))), - Range(Interval(F(-INFINITY), F(5))) - * Range(Interval(F(-INFINITY), F(-INFINITY)))); - - // (-INF, 5) * (-INF, 5) = (NAN, NAN) U (-INF, INF) - EXPECT_EQ(Range(Interval(F(NAN), F(NAN)), - Interval(F(-INFINITY), F(INFINITY))), - Range(Interval(F(-INFINITY), F(5))) - * Range(Interval(F(-INFINITY), F(5)))); - - // (-INF, 5) * (-INF, INF) = (NAN, NAN) U (-INF, INF) - EXPECT_EQ(Range(Interval(F(NAN), F(NAN)), - Interval(F(-INFINITY), F(INFINITY))), - Range(Interval(F(-INFINITY), F(5))) - * Range(Interval(F(-INFINITY), F(INFINITY)))); - - // (-INF, 5) * (NAN, NAN) = (NAN, NAN) - Range r3 = Range(Interval(F(-INFINITY), F(5))) - * Range(Interval(F(NAN), F(NAN))); - EXPECT_EQ(size_t(1), r3.size()); - EXPECT_EQ(true, (r3[0].first).isNotNumber()); - EXPECT_EQ(true, (r3[0].second).isNotNumber()); - - // (-INF, 5) * (5, 8) = (-INF, 5*8) - EXPECT_EQ(Range(Interval(F(-INFINITY), F(40))), - Range(Interval(F(-INFINITY), F(5))) - * Range(Interval(F(5), F(8)))); - - // (-INF, 5) * (10, INF) = (NAN, NAN) U (-INF, INF) - EXPECT_EQ(Range(Interval(F(NAN), F(NAN)), - Interval(F(-INFINITY), F(INFINITY))), - Range(Interval(F(-INFINITY), F(5))) - * Range(Interval(F(10), F(INFINITY)))); - - // (-INF, INF) * (INF, INF) = (NAN, NAN) U (-INF, -INF) U (INF, INF) - EXPECT_EQ(Range(Interval(F(NAN), F(NAN)), - Interval(F(-INFINITY), F(-INFINITY)), - Interval(F(INFINITY), F(INFINITY))), - Range(Interval(F(-INFINITY), F(INFINITY))) - * Range(Interval(F(INFINITY), F(INFINITY)))); - - // (-INF, INF) * (-INF, -INF) = (NAN, NAN) U (-INF, -INF) U (INF, INF) - EXPECT_EQ(Range(Interval(F(NAN), F(NAN)), - Interval(F(-INFINITY), F(-INFINITY)), - Interval(F(INFINITY), F(INFINITY))), - Range(Interval(F(-INFINITY), F(INFINITY))) - * Range(Interval(F(-INFINITY), F(-INFINITY)))); - - // (-INF, INF) * (-INF, 5) = (NAN, NAN) U (-INF, INF) - EXPECT_EQ(Range(Interval(F(NAN), F(NAN)), - Interval(F(-INFINITY), F(INFINITY))), - Range(Interval(F(-INFINITY), F(INFINITY))) - * Range(Interval(F(-INFINITY), F(5)))); - - // (-INF, INF) * (-INF, INF) = (NAN, NAN) U (-INF, INF) - EXPECT_EQ(Range(Interval(F(NAN), F(NAN)), - Interval(F(-INFINITY), F(INFINITY))), - Range(Interval(F(-INFINITY), F(INFINITY))) - * Range(Interval(F(-INFINITY), F(INFINITY)))); - - // (-INF, INF) * (NAN, NAN) = (NAN, NAN) - Range r4 = Range(Interval(F(-INFINITY), F(INFINITY))) - * Range(Interval(F(NAN), F(NAN))); - EXPECT_EQ(size_t(1), r4.size()); - EXPECT_EQ(true, (r4[0].first).isNotNumber()); - EXPECT_EQ(true, (r4[0].second).isNotNumber()); - - // (-INF, INF) * (5, 8) = (-INF, INF) - EXPECT_EQ(Range(Interval(F(-INFINITY), F(INFINITY))), - Range(Interval(F(-INFINITY), F(INFINITY))) - * Range(Interval(F(5), F(8)))); - - // (-INF, INF) * (5, INF) = (NAN, NAN) U (-INF, INF) - EXPECT_EQ(Range(Interval(F(NAN), F(NAN)), - Interval(F(-INFINITY), F(INFINITY))), - Range(Interval(F(-INFINITY), F(INFINITY))) - * Range(Interval(F(5), F(INFINITY)))); - - // (NAN, NAN) * (INF, INF) = (NAN, NAN) - Range r5 = Range(Interval(F(NAN), F(NAN))) - * Range(Interval(F(INFINITY), F(INFINITY))); - EXPECT_EQ(size_t(1), r5.size()); - EXPECT_EQ(true, (r5[0].first).isNotNumber()); - EXPECT_EQ(true, (r5[0].second).isNotNumber()); - - // (NAN, NAN) * (-INF, -INF) = (NAN, NAN) - Range r6 = Range(Interval(F(NAN), F(NAN))) - * Range(Interval(F(-INFINITY), F(-INFINITY))); - EXPECT_EQ(size_t(1), r6.size()); - EXPECT_EQ(true, (r6[0].first).isNotNumber()); - EXPECT_EQ(true, (r6[0].second).isNotNumber()); - - // (NAN, NAN) * (-INF, 5) = (NAN, NAN) - Range r7 = Range(Interval(F(NAN), F(NAN))) - * Range(Interval(F(-INFINITY), F(5))); - EXPECT_EQ(size_t(1), r7.size()); - EXPECT_EQ(true, (r7[0].first).isNotNumber()); - EXPECT_EQ(true, (r7[0].second).isNotNumber()); - - // (NAN, NAN) * (-INF, INF) = (NAN, NAN) - Range r8 = Range(Interval(F(NAN), F(NAN))) - * Range(Interval(F(-INFINITY), F(INFINITY))); - EXPECT_EQ(size_t(1), r8.size()); - EXPECT_EQ(true, (r8[0].first).isNotNumber()); - EXPECT_EQ(true, (r8[0].second).isNotNumber()); - - // (NAN, NAN) * (NAN, NAN) = (NAN, NAN) - Range r9 = Range(Interval(F(NAN), F(NAN))) - * Range(Interval(F(NAN), F(NAN))); - EXPECT_EQ(size_t(1), r9.size()); - EXPECT_EQ(true, (r9[0].first).isNotNumber()); - EXPECT_EQ(true, (r9[0].second).isNotNumber()); - - // (NAN, NAN) * (5, 8) = (NAN, NAN) - Range r10 = Range(Interval(F(NAN), F(NAN))) - * Range(Interval(F(5), F(8))); - EXPECT_EQ(size_t(1), r10.size()); - EXPECT_EQ(true, (r10[0].first).isNotNumber()); - EXPECT_EQ(true, (r10[0].second).isNotNumber()); - - // (NAN, NAN) * (5, INF) = (NAN, NAN) - Range r11 = Range(Interval(F(NAN), F(NAN))) - * Range(Interval(F(5), F(INFINITY))); - EXPECT_EQ(size_t(1), r11.size()); - EXPECT_EQ(true, (r11[0].first).isNotNumber()); - EXPECT_EQ(true, (r11[0].second).isNotNumber()); - - // (5, 8) * (INF, INF) = (INF, INF) - EXPECT_EQ(Range(Interval(F(INFINITY), F(INFINITY))), - Range(Interval(F(5), F(8))) - * Range(Interval(F(INFINITY), F(INFINITY)))); - - // (5, 8) * (-INF, -INF) = (-INF, -INF) - EXPECT_EQ(Range(Interval(F(-INFINITY), F(-INFINITY))), - Range(Interval(F(5), F(8))) - * Range(Interval(F(-INFINITY), F(-INFINITY)))); - - // (5, 8) * (-INF, 5) = (-INF, 40) - EXPECT_EQ(Range(Interval(F(-INFINITY), F(40))), - Range(Interval(F(5), F(8))) - * Range(Interval(F(-INFINITY), F(5)))); - - // (5, 8) * (-INF, INF) = (-INF, INF) - EXPECT_EQ(Range(Interval(F(-INFINITY), F(INFINITY))), - Range(Interval(F(5), F(8))) - * Range(Interval(F(-INFINITY), F(INFINITY)))); - - // (5, 8) * (NAN, NAN) = (NAN, NAN) - Range r12 = Range(Interval(F(5), F(8))) - * Range(Interval(F(NAN), F(NAN))); - EXPECT_EQ(size_t(1), r12.size()); - EXPECT_EQ(true, (r12[0].first).isNotNumber()); - EXPECT_EQ(true, (r12[0].second).isNotNumber()); - - // (5, 8) * (10, 20) = (50, 160) - EXPECT_EQ(Range(Interval(F(50), F(160))), - Range(Interval(F(5), F(8))) - * Range(Interval(F(10), F(20)))); - - // (5, 8) * (10, INF) = (50, INF) - EXPECT_EQ(Range(Interval(F(50), F(INFINITY))), - Range(Interval(F(5), F(8))) - * Range(Interval(F(10), F(INFINITY)))); - - // (5, INF) * (INF, INF) = (INF, INF) - EXPECT_EQ(Range(Interval(F(INFINITY), F(INFINITY))), - Range(Interval(F(5), F(INFINITY))) - * Range(Interval(F(INFINITY), F(INFINITY)))); - - // (5, INF) * (-INF, -INF) = (-INF, -INF) - EXPECT_EQ(Range(Interval(F(-INFINITY), F(-INFINITY))), - Range(Interval(F(5), F(INFINITY))) - * Range(Interval(F(-INFINITY), F(-INFINITY)))); - - // (5, INF) * (-INF, 5) = (NAN, NAN) U (-INF, INF) - EXPECT_EQ(Range(Interval(F(NAN), F(NAN)), - Interval(F(-INFINITY), F(INFINITY))), - Range(Interval(F(5), F(INFINITY))) - * Range(Interval(F(-INFINITY), F(5)))); - - // (5, INF) * (-INF, INF) = (NAN, NAN) U (-INF, INF) - EXPECT_EQ(Range(Interval(F(NAN), F(NAN)), - Interval(F(-INFINITY), F(INFINITY))), - Range(Interval(F(5), F(INFINITY))) - * Range(Interval(F(-INFINITY), F(INFINITY)))); - - // (5, INF) * (NAN, NAN) = (NAN, NAN) - Range r13 = Range(Interval(F(5), F(INFINITY))) - * Range(Interval(F(NAN), F(NAN))); - EXPECT_EQ(size_t(1), r13.size()); - EXPECT_EQ(true, (r13[0].first).isNotNumber()); - EXPECT_EQ(true, (r13[0].second).isNotNumber()); - - // (5, INF) * (10, 20) = (50, INF) - EXPECT_EQ(Range(Interval(F(50), F(INFINITY))), - Range(Interval(F(5), F(INFINITY))) - * Range(Interval(F(10), F(20)))); - - // (5, INF) * (10, INF) = (50, INF) - EXPECT_EQ(Range(Interval(F(50), F(INFINITY))), - Range(Interval(F(5), F(INFINITY))) - * Range(Interval(F(10), F(INFINITY)))); -} - -TEST_F(RangeTest, -MultiplicationOfEmptyRangesWorksCorrectly) -{ - EXPECT_DEATH(Range() * Range(), ".*!r1.empty().*!r2.empty().*"); - EXPECT_DEATH(Range(I(15)) * Range(), ".*!r1.empty().*!r2.empty().*"); - EXPECT_DEATH(Range() * Range(F(1.5)), ".*!r1.empty().*!r2.empty().*"); -} - -//////////////////////////////////////////////////////////////////////////////// -// rdiv() -//////////////////////////////////////////////////////////////////////////////// - -TEST_F(RangeTest, -RDivReturnsCorrectResult) -{ - // (0.0, 0.0) / (0.0, 0.0) - EXPECT_EQ(Range(Interval(F(NAN), F(NAN))), - rdiv(Range(Interval(F(0.0), F(0.0))), - Range(Interval(F(0.0), F(0.0))))); - - // (0.0, 0.0) / (1.0, 1.0) - EXPECT_EQ(Range(Interval(F(0.0), F(0.0))), - rdiv(Range(Interval(F(0.0), F(0.0))), - Range(Interval(F(1.0), F(1.0))))); - - // (1.0, 1.0) / (0.0, 0.0) - EXPECT_EQ(Range(Interval(F(INFINITY), F(INFINITY))), - rdiv(Range(Interval(F(1.0), F(1.0))), - Range(Interval(F(0.0), F(0.0))))); - - // (-1.0, -1.0) / (0.0, 0.0) - EXPECT_EQ(Range(Interval(F(-INFINITY), F(-INFINITY))), - rdiv(Range(Interval(F(-1.0), F(-1.0))), - Range(Interval(F(0.0), F(0.0))))); - - // (1.0, 5.0) / (2.0, 3.0) - EXPECT_EQ(Range(Interval(F(1.0 / 3.0), F(1.0 / 2.0)), - Interval(F(5.0 / 3.0), F(5.0 / 2.0))), - rdiv(Range(Interval(F(1.0), F(5.0))), - Range(Interval(F(2.0), F(3.0))))); - - // (INF, INF) / (INF, INF) - EXPECT_EQ(Range(Interval(F(NAN), F(NAN))), - rdiv(Range(Interval(F(INFINITY), F(INFINITY))), - Range(Interval(F(INFINITY), F(INFINITY))))); -} - -//////////////////////////////////////////////////////////////////////////////// -// exact_div() -//////////////////////////////////////////////////////////////////////////////// - -TEST_F(RangeTest, -ExactDivDivisionByZeroResultsIntoOverApproximation) -{ - // x / 0 -> undefined behaviour in C - EXPECT_EQ(Range(Interval(I(vmin()), I(vmax()))), - exact_div(Range(Interval(I(1), I(5))), Range(I(0)))); - EXPECT_EQ(Range(Interval(I(vmin()), I(vmax()))), - exact_div(Range(Interval(I(1), I(5))), - Range(Interval(I(-5), I(5))))); -} - -TEST_F(RangeTest, -ExactDivDivisionIntMinByMinusOneResultsIntoOverApproximation) -{ - // INT_MIN / -1 -> undefined behaviour in C - EXPECT_EQ(Range(Interval(I(vmin()), I(vmax()))), - exact_div(Range(Interval(I(vmin()), I(vmin()))), - Range(Interval(I(-1), I(-1))))); -} - -TEST_F(RangeTest, -ExactDivWorksCorrectlyWhenDividingSignedIntWithSignedInt) -{ - // (4, 6) / (2, 3) - EXPECT_EQ(Range(Interval(I(1), I(3))), - exact_div(Range(Interval(I(4), I(6))), - Range(Interval(I(2), I(3))))); - // (4, 6) / (-3, -2) - EXPECT_EQ(Range(Interval(I(-3), I(-1))), - exact_div(Range(Interval(I(4), I(6))), - Range(Interval(I(-3), I(-2))))); - // (-2, -1) / (1, 3) - EXPECT_EQ(Range(Interval(I(-2), I(0))), - exact_div(Range(Interval(I(-2), I(-1))), - Range(Interval(I(1), I(3))))); - // (-2, -1) / (-3, -1) - EXPECT_EQ(Range(Interval(I(0), I(2))), - exact_div(Range(Interval(I(-2), I(-1))), - Range(Interval(I(-3), I(-1))))); - // (0, 3) / (1, 4) - EXPECT_EQ(Range(Interval(I(0), I(3))), - exact_div(Range(Interval(I(0), I(3))), - Range(Interval(I(1), I(4))))); - // (-2, 3) / (1, 4) - EXPECT_EQ(Range(Interval(I(-2), I(3))), - exact_div(Range(Interval(I(-2), I(3))), - Range(Interval(I(1), I(4))))); - // (INT_MIN, INT_MIN) / (1, 1) - EXPECT_EQ(Range(Interval(I(vmin()), I(vmin()))), - exact_div(Range(Interval(I(vmin()), I(vmin()))), - Range(Interval(I(1), I(1))))); - // (-2, -1)(4, 6) / (-3, -1)(1, 3) - EXPECT_EQ(Range(Interval(I(-6), I(6))), - exact_div(Range(Interval(I(-2), I(-1)), Interval(I(4), I(6))), - Range(Interval(I(-3), I(-1)), Interval(I(1), I(3))))); -} - -TEST_F(RangeTest, -ExactDivWorksCorrectlyWhenDividingUnsignedIntWithUnsignedInt) -{ - // (4, 6) / (2, 3) - EXPECT_EQ(Range(Interval(I(1), I(3))), - exact_div(Range(Interval(I(4), I(6))), - Range(Interval(I(2), I(3))))); - // (0, 3) / (1, 4) - EXPECT_EQ(Range(Interval(I(0), I(3))), - exact_div(Range(Interval(I(0), I(3))), - Range(Interval(I(1), I(4))))); -} - -TEST_F(RangeTest, -ExactDivWorksCorrectlyWhenDividingSignedIntWithUnsignedInt) -{ - // (-1, -1) / (1, 4) - EXPECT_EQ(Range(Interval(I(vmax() / 4), I(vmax()))), - exact_div(Range(Interval(I(-1), I(-1))), - Range(Interval(I(1), I(4))))); -} - -//////////////////////////////////////////////////////////////////////////////// -// trunc_div() -//////////////////////////////////////////////////////////////////////////////// - -TEST_F(RangeTest, -TruncDivDivisionByZeroResultsIntoOverApproximation) -{ - // x / 0 -> undefined behaviour in C - EXPECT_EQ(Range(Interval(I(vmin()), I(vmax()))), - trunc_div(Range(Interval(I(1), I(5))), Range(I(0)))); - EXPECT_EQ(Range(Interval(I(vmin()), I(vmax()))), - trunc_div(Range(Interval(I(1), I(5))), - Range(Interval(I(-5), I(5))))); -} - -TEST_F(RangeTest, -TruncDivDivisionIntMinByMinusOneResultsIntoOverApproximation) -{ - // INT_MIN / -1 -> undefined behaviour in C - EXPECT_EQ(Range(Interval(I(vmin()), I(vmax()))), - trunc_div(Range(Interval(I(vmin()), I(vmin()))), - Range(Interval(I(-1), I(-1))))); -} - -TEST_F(RangeTest, -TruncDivWorksCorrectlyWhenDividingSignedIntWithSignedInt) -{ - // (4, 6) / (2, 3) - EXPECT_EQ(Range(Interval(I(1), I(3))), - trunc_div(Range(Interval(I(4), I(6))), - Range(Interval(I(2), I(3))))); - // (4, 6) / (-3, -2) - EXPECT_EQ(Range(Interval(I(-3), I(-1))), - trunc_div(Range(Interval(I(4), I(6))), - Range(Interval(I(-3), I(-2))))); - // (-2, -1) / (1, 3) - EXPECT_EQ(Range(Interval(I(-2), I(0))), - trunc_div(Range(Interval(I(-2), I(-1))), - Range(Interval(I(1), I(3))))); - // (-2, -1) / (-3, -1) - EXPECT_EQ(Range(Interval(I(0), I(2))), - trunc_div(Range(Interval(I(-2), I(-1))), - Range(Interval(I(-3), I(-1))))); - // (0, 3) / (1, 4) - EXPECT_EQ(Range(Interval(I(0), I(3))), - trunc_div(Range(Interval(I(0), I(3))), - Range(Interval(I(1), I(4))))); - // (-2, 3) / (1, 4) - EXPECT_EQ(Range(Interval(I(-2), I(3))), - trunc_div(Range(Interval(I(-2), I(3))), - Range(Interval(I(1), I(4))))); - // (INT_MIN, INT_MIN) / (1, 1) - EXPECT_EQ(Range(Interval(I(vmin()), I(vmin()))), - trunc_div(Range(Interval(I(vmin()), I(vmin()))), - Range(Interval(I(1), I(1))))); - // (-2, -1)(4, 6) / (-3, -1)(1, 3) - EXPECT_EQ(Range(Interval(I(-6), I(6))), - trunc_div(Range(Interval(I(-2), I(-1)), Interval(I(4), I(6))), - Range(Interval(I(-3), I(-1)), Interval(I(1), I(3))))); -} - -TEST_F(RangeTest, -TruncDivWorksCorrectlyWhenDividingUnsignedIntWithUnsignedInt) -{ - // (4, 6) / (2, 3) - EXPECT_EQ(Range(Interval(I(1), I(3))), - trunc_div(Range(Interval(I(4), I(6))), - Range(Interval(I(2), I(3))))); - // (0, 3) / (1, 4) - EXPECT_EQ(Range(Interval(I(0), I(3))), - trunc_div(Range(Interval(I(0), I(3))), - Range(Interval(I(1), I(4))))); -} - -TEST_F(RangeTest, -TruncDivWorksCorrectlyWhenDividingSignedIntWithUnsignedInt) -{ - // (-1, -1) / (1, 4) - EXPECT_EQ(Range(Interval(I(vmax() / 4), I(vmax()))), - trunc_div(Range(Interval(I(-1), I(-1))), - Range(Interval(I(1), I(4))))); -} - -//////////////////////////////////////////////////////////////////////////////// -// trunc_mod() -//////////////////////////////////////////////////////////////////////////////// - -TEST_F(RangeTest, -TruncModModuloByZeroResultsIntoOverApproximation) -{ - // x % 0 -> undefined behaviour in C - EXPECT_EQ(Range(Interval(I(vmin()), I(vmax()))), - trunc_mod(Range(Interval(I(1), I(5))), Range(I(0)))); - EXPECT_EQ(Range(Interval(I(vmin()), I(vmax()))), - trunc_mod(Range(Interval(I(1), I(5))), - Range(Interval(I(-5), I(5))))); -} - -TEST_F(RangeTest, -TruncModModuloIntMinByMinusOneResultsIntoOverApproximation) -{ - // INT_MIN % -1 -> undefined behaviour in C - EXPECT_EQ(Range(Interval(I(vmin()), I(vmax()))), - trunc_mod(Range(Interval(I(vmin()), I(vmin()))), - Range(Interval(I(-1), I(-1))))); -} - -TEST_F(RangeTest, -TruncModWorksCorrectlyWhenModuloSignedIntWithSignedInt) -{ - // (-5, -5) / (-5, -1) - // - // Precise result: (-3, 0) - EXPECT_EQ(Range(Interval(I(-5), I(0))), - trunc_mod(Range(Interval(I(-5), I(-5))), - Range(Interval(I(-5), I(-1))))); - - // (-10, -8)(-3, 2) / (1, 5) - // - // Precise result: (-4, 2) - EXPECT_EQ(Range(Interval(I(-10), I(2))), - trunc_mod(Range(Interval(I(-10), I(-8)), - Interval(I(-3), I(2))), - Range(Interval(I(1), I(5))))); - - // (INT_MIN, INT_MAX) / (1, 1) - // - // Precise result: (0, 0) - EXPECT_EQ(Range(Interval(I(vmin()), I(vmax()))), - trunc_mod(Range(Interval(I(vmin()), I(vmax()))), - Range(Interval(I(1), I(1))))); -} - -TEST_F(RangeTest, -TruncModWorksCorrectlyWhenModuloUnsignedIntWithUnsignedInt) -{ - // (5, 5) / (1, 5) - // - // Precise result: (0, 3) - EXPECT_EQ(Range(Interval(I(0), I(5))), - trunc_mod(Range(Interval(I(5), I(5))), - Range(Interval(I(1), I(5))))); -} - -TEST_F(RangeTest, -TruncModWorksCorrectlyWhenModuloSignedIntWithUnsignedInt) -{ - // (-2, -1) % (1, 4) - // - // Precise result: (0, 3) - EXPECT_EQ(Range(Interval(I(0), I(vmax()))), - trunc_mod(Range(Interval(I(-2), I(-1))), - Range(Interval(I(1), I(4))))); -} - -//////////////////////////////////////////////////////////////////////////////// -// bitNot() -//////////////////////////////////////////////////////////////////////////////// - -TEST_F(RangeTest, -BitNotReturnsCorrectResultWhenRangeContainsSingleNumber) -{ - EXPECT_EQ(Range(I(-2)), - bitNot(Range(I(1)))); - EXPECT_EQ(Range(I(-2)), - bitNot(Range(I(1)))); - EXPECT_EQ(Range(I(vmax() - 1)), - bitNot(Range(I(1)))); -} - -TEST_F(RangeTest, -BitNotReturnsOverApproximationWhenRangeContainsMoreThanSingleNumber) -{ - EXPECT_EQ(Range(Interval(I(vmin()), I(vmax()))), - bitNot(Range(Interval(I(1), I(10))))); - EXPECT_EQ(Range(Interval(I(vmin()), I(vmax()))), - bitNot(Range(Interval(I(1), I(10))))); -} - -//////////////////////////////////////////////////////////////////////////////// -// bitAnd() -//////////////////////////////////////////////////////////////////////////////// - -TEST_F(RangeTest, -BitAndReturnsCorrectResultWhenBothRangesContainSingleNumber) -{ - EXPECT_EQ(Range(I(1)), - bitAnd(Range(I(1)), Range(I(3)))); - EXPECT_EQ(Range(I(3)), - bitAnd(Range(I(7)), Range(I(3)))); -} - -TEST_F(RangeTest, -BitAndReturnsOverApproximationWhenRangeContainsMoreThanSingleNumber) -{ - EXPECT_EQ(Range(Interval(I(vmin()), I(vmax()))), - bitAnd(Range(Interval(I(1), I(10))), - Range(Interval(I(1), I(10))))); -} - -//////////////////////////////////////////////////////////////////////////////// -// Bit Or -//////////////////////////////////////////////////////////////////////////////// - -TEST_F(RangeTest, -BitOrReturnsCorrectResultWhenBothRangesContainSingleNumber) -{ - EXPECT_EQ(Range(I(3)), - bitOr(Range(I(1)), Range(I(2)))); - EXPECT_EQ(Range(I(7)), - bitOr(Range(I(7)), Range(I(3)))); -} - -TEST_F(RangeTest, -BitOrReturnsOverApproximationWhenRangeContainsMoreThanSingleNumber) -{ - EXPECT_EQ(Range(Interval(I(vmin()), I(vmax()))), - bitOr(Range(Interval(I(1), I(10))), - Range(Interval(I(1), I(10))))); -} - -//////////////////////////////////////////////////////////////////////////////// -// bitXor() -//////////////////////////////////////////////////////////////////////////////// - -TEST_F(RangeTest, -BitXorReturnsCorrectResultWhenBothRangesContainSingleNumber) -{ - EXPECT_EQ(Range(I(3)), - bitXor(Range(I(1)), Range(I(2)))); - EXPECT_EQ(Range(I(4)), - bitXor(Range(I(7)), Range(I(3)))); -} - -TEST_F(RangeTest, -BitXorReturnsOverApproximationWhenRangeContainsMoreThanSingleNumber) -{ - EXPECT_EQ(Range(Interval(I(vmin()), I(vmax()))), - bitXor(Range(Interval(I(1), I(10))), - Range(Interval(I(1), I(10))))); -} - -//////////////////////////////////////////////////////////////////////////////// -// bitLeftShift() -//////////////////////////////////////////////////////////////////////////////// - -TEST_F(RangeTest, -BitLeftShiftReturnsCorrectResultWhenBothRangesContainSingleNumber) -{ - EXPECT_EQ(Range(I(4)), - bitLeftShift(Range(I(2)), Range(I(1)))); - EXPECT_EQ(Range(I(16)), - bitLeftShift(Range(I(2)), Range(I(3)))); -} - -TEST_F(RangeTest, -BitLeftShiftReturnsOverApproximationWhenRangeContainsMoreThanSingleNumber) -{ - EXPECT_EQ(Range(Interval(I(vmin()), I(vmax()))), - bitLeftShift(Range(Interval(I(1), I(10))), - Range(Interval(I(1), I(10))))); -} - -TEST_F(RangeTest, -BitLeftShiftReturnsOverApproximationWhenRhsIsMoreThanBitWidthOfLhs) -{ - // If we are shifting more bits than the bit width of the left hand side, - // like in `a << 33`, where `a` is a 32b integer, the result is undefined. - // Therefore, we have to over approximate. - EXPECT_EQ(Range(Interval(I(vmin()), I(vmax()))), - bitLeftShift(Range(I(1)), Range(I(sizeof(int) * 8 + 1)))); -} - -//////////////////////////////////////////////////////////////////////////////// -// bitRightShift() -//////////////////////////////////////////////////////////////////////////////// - -TEST_F(RangeTest, -BitRightShiftReturnsCorrectResultWhenBothRangesContainSingleNumber) -{ - EXPECT_EQ(Range(I(8)), - bitRightShift(Range(I(16)), Range(I(1)))); - EXPECT_EQ(Range(I(2)), - bitRightShift(Range(I(4)), Range(I(1)))); -} - -TEST_F(RangeTest, -BitRightShiftReturnsOverApproximationWhenRangeContainsMoreThanSingleNumber) -{ - EXPECT_EQ(Range(Interval(I(vmin()), I(vmax()))), - bitRightShift(Range(Interval(I(1), I(10))), - Range(Interval(I(1), I(10))))); -} - -TEST_F(RangeTest, -BitRightShiftReturnsOverApproximationWhenRhsIsMoreThanBitWidthOfLhs) -{ - // If we are shifting more bits than the bit width of the left hand side, - // like in `a >> 33`, where `a` is a 32b integer, the result is undefined. - // Therefore, we have to over approximate. - EXPECT_EQ(Range(Interval(I(vmin()), I(vmax()))), - bitRightShift(Range(I(1)), Range(I(sizeof(int) * 8 + 1)))); -} - -//////////////////////////////////////////////////////////////////////////////// -// overApproximateUnaryOp() -//////////////////////////////////////////////////////////////////////////////// - -TEST_F(RangeTest, -OverApproximationOfUnaryBitOpWorksCorrectly) -{ - EXPECT_EQ(sizeof(int), - overApproximateUnaryOp(Range(I(1)))[0].first.getBitWidth()); -} - -//////////////////////////////////////////////////////////////////////////////// -// overApproximateBinaryOp() -//////////////////////////////////////////////////////////////////////////////// - -TEST_F(RangeTest, -OverApproximationOfBinaryBitOpWorksCorrectly) -{ - EXPECT_EQ(sizeof(int), - overApproximateBinaryOp(Range(I(1)), - Range(I(1)))[0].first.getBitWidth()); -} - -//////////////////////////////////////////////////////////////////////////////// -// abs() -//////////////////////////////////////////////////////////////////////////////// - -TEST_F(RangeTest, -AbsOfSignedIntegralRangeWorksCorrectly) -{ - EXPECT_EQ(Range(I(vmin())), abs(Range(I(vmin())))); - EXPECT_EQ(Range(Interval(I(5), I(8))), - abs(Range(Interval(I(-8), I(-5))))); - EXPECT_EQ(Range(Interval(I(8), I(15))), - abs(Range(Interval(I(8), I(15))))); - EXPECT_EQ(Range(Interval(I(vmin()), I(vmin())), - Interval(I(0), I(150)), - Interval(I(450), I(600)), - Interval(I(vmax()-9), I(vmax()))), - abs(Range(Interval(I(vmin()), I(vmin() + 10)), - Interval(I(-150), I(1)), - Interval(I(450), I(600))))); - EXPECT_EQ(Range(Interval(I(0), I(15))), - abs(Range(Interval(I(-10), I(15))))); -} - -TEST_F(RangeTest, -AbsOfEmptyRangeWorksCorrectly) -{ - EXPECT_DEATH(abs(Range()), ".*!r.empty().*"); -} - -TEST_F(RangeTest, -AbsOfUnsignedIntegralRangeWorksCorrectly) -{ - EXPECT_DEATH(abs(Range(I(6))), ".*r.isIntegral().*r.isSigned().*"); -} - -TEST_F(RangeTest, -AbsOfFloatingPointRangeWorksCorrectly) -{ - EXPECT_DEATH(abs(Range(F(-3.6))), ".*r.isIntegral().*r.isSigned().*"); -} - -//////////////////////////////////////////////////////////////////////////////// -// min() -//////////////////////////////////////////////////////////////////////////////// - -TEST_F(RangeTest, -MinOfSignedIntAndSignedIntWorksCorrectly) -{ - EXPECT_EQ(Range(Interval(I(0), I(5))), - min(Range(Interval(I(0), I(5))), - Range(Interval(I(10), I(15))))); - EXPECT_EQ(Range(Interval(I(0), I(5))), - min(Range(Interval(I(0), I(5))), - Range(Interval(I(0), I(5))))); - EXPECT_EQ(Range(Interval(I(0), I(5))), - min(Range(Interval(I(0), I(5))), - Range(Interval(I(4), I(8))))); - EXPECT_EQ(Range(Interval(I(0), I(5))), - min(Range(Interval(I(10), I(15))), - Range(Interval(I(0), I(5))))); - EXPECT_EQ(Range(Interval(I(0), I(4))), - min(Range(Interval(I(0), I(5))), - Range(Interval(I(1), I(4))))); - EXPECT_EQ(Range(Interval(I(0), I(4))), - min(Range(Interval(I(1), I(4))), - Range(Interval(I(0), I(5))))); - EXPECT_EQ(Range(Interval(I(0), I(5))), - min(Range(Interval(I(4), I(8))), - Range(Interval(I(0), I(5))))); -} - -TEST_F(RangeTest, -MinOfSignedIntAndUnsignedIntWorksCorrectly) -{ - EXPECT_EQ(Range(Interval(I(0), I(0)), - Interval(I(5), I(10))), - min(Range(Interval(I(-1), I(0))), - Range(Interval(I(5), I(10))))); -} - -TEST_F(RangeTest, -MinOfSignedIntAndFloatWorksCorrectly) -{ - EXPECT_EQ(Range(Interval(F(-4), F(2.8))), - min(Range(Interval(I(-4), I(25))), - Range(Interval(F(-3.2), F(2.8))))); -} - -TEST_F(RangeTest, -MinOfUnsignedIntAndSignedIntWorksCorrectly) -{ - EXPECT_EQ(Range(Interval(I(0), I(5)), - Interval(I(vmax() - 10), - I(vmax() - 1))), - min(Range(Interval(I(vmax() - 10), - I(vmax() - 1))), - Range(Interval(I(-5), I(5))))); -} - -TEST_F(RangeTest, -MinOfUnsignedIntAndUnsignedIntWorksCorrectly) -{ - EXPECT_EQ(Range(Interval(I(0), I(10)), - Interval(I(15), I(50))), - min(Range(Interval(I(0), I(10)), - Interval(I(20), I(30)), - Interval(I(40), I(50))), - Range(Interval(I(15), I(25)), - Interval(I(28), I(42)), - Interval(I(60), I(70))))); -} - -TEST_F(RangeTest, -MinOfUnsignedIntAndFloatWorksCorrectly) -{ - EXPECT_EQ(Range(Interval(F(1), F(4)), - Interval(F(8.9), F(9.3)), - Interval(F(10), F(40)), - Interval(F(49.8), F(58.3))), - min(Range(Interval(I(1), I(4)), - Interval(I(10), I(40)), - Interval(I(100), I(400))), - Range(Interval(F(8.9), F(9.3)), - Interval(F(49.8), F(58.3))))); -} - -TEST_F(RangeTest, -MinOfFloatAndSignedIntWorksCorrectly) -{ - EXPECT_EQ(Range(Interval(F(-4.2), F(1.0))), - min(Range(Interval(F(-4.2), F(28.9))), - Range(Interval(I(-1), I(1))))); -} - -TEST_F(RangeTest, -MinOfFloatAndUnsignedIntWorksCorrectly) -{ - EXPECT_EQ(Range(Interval(F(8.9), F(9.3)), - Interval(F(12), F(50))), - min(Range(Interval(F(8.9), F(9.3)), - Interval(F(49.8), F(58.3))), - Range(Interval(I(12), I(50))))); -} - -TEST_F(RangeTest, -MinOfFloatAndFloatWorksCorrectly) -{ - EXPECT_EQ(Range(Interval(F(-45.3), F(1.0)), - Interval(F(1.5), F(4.2)), - Interval(F(4.8), F(5.9))), - min(Range(Interval(F(-45.3), F(1.0)), - Interval(F(2.0), F(3.3)), - Interval(F(4.8), F(5.9))), - Range(Interval(F(1.5), F(2.5)), - Interval(F(2.8), F(4.2)), - Interval(F(6.0), F(7.0))))); -} - -TEST_F(RangeTest, -MinOfSpecialFloatsWorksCorrectly) -{ - EXPECT_EQ(Range(Interval(F(-INFINITY), F(-INFINITY))), - min(Range(Interval(F(INFINITY), F(INFINITY))), - Range(Interval(F(-INFINITY), F(-INFINITY))))); - EXPECT_EQ(Range(Interval(F(-INFINITY), F(-INFINITY))), - min(Range(Interval(F(-INFINITY), F(-INFINITY))), - Range(Interval(F(INFINITY), F(INFINITY))))); - EXPECT_EQ(Range(Interval(F(-INFINITY), F(5.8))), - min(Range(Interval(F(-INFINITY), F(INFINITY))), - Range(Interval(F(-4.3), F(5.8))))); -} - -TEST_F(RangeTest, -MinOfEmptyRangesWorksCorrectly) -{ - EXPECT_DEATH(min(Range(), Range()), ".*!r1.empty().*!r2.empty().*"); -} - -//////////////////////////////////////////////////////////////////////////////// -// max() -//////////////////////////////////////////////////////////////////////////////// - -TEST_F(RangeTest, -MaxOfSignedIntAndSignedIntWorksCorrectly) -{ - EXPECT_EQ(Range(Interval(I(10), I(15))), - max(Range(Interval(I(0), I(5))), - Range(Interval(I(10), I(15))))); - EXPECT_EQ(Range(Interval(I(0), I(5))), - max(Range(Interval(I(0), I(5))), - Range(Interval(I(0), I(5))))); - EXPECT_EQ(Range(Interval(I(4), I(8))), - max(Range(Interval(I(0), I(5))), - Range(Interval(I(4), I(8))))); - EXPECT_EQ(Range(Interval(I(10), I(15))), - max(Range(Interval(I(10), I(15))), - Range(Interval(I(0), I(5))))); - EXPECT_EQ(Range(Interval(I(1), I(5))), - max(Range(Interval(I(0), I(5))), - Range(Interval(I(1), I(4))))); - EXPECT_EQ(Range(Interval(I(1), I(5))), - max(Range(Interval(I(1), I(4))), - Range(Interval(I(0), I(5))))); - EXPECT_EQ(Range(Interval(I(4), I(8))), - max(Range(Interval(I(4), I(8))), - Range(Interval(I(0), I(5))))); -} - -TEST_F(RangeTest, -MaxOfSignedIntAndUnsignedIntWorksCorrectly) -{ - EXPECT_EQ(Range(Interval(I(vmax()), - I(vmax())), - Interval(I(5), I(10))), - max(Range(Interval(I(-1), I(0))), - Range(Interval(I(5), I(10))))); -} - -TEST_F(RangeTest, -MaxOfSignedIntAndFloatWorksCorrectly) -{ - EXPECT_EQ(Range(Interval(F(-3.2), F(25))), - max(Range(Interval(I(-4), I(25))), - Range(Interval(F(-3.2), F(2.8))))); -} - -TEST_F(RangeTest, -MaxOfUnsignedIntAndSignedIntWorksCorrectly) -{ - EXPECT_EQ(Range(Interval(I(vmax() - 10), - I(vmax()))), - max(Range(Interval(I(vmax() - 10), - I(vmax() - 1))), - Range(Interval(I(-5), I(5))))); -} - -TEST_F(RangeTest, -MaxOfUnsignedIntAndUnsignedIntWorksCorrectly) -{ - EXPECT_EQ(Range(Interval(I(60), I(70)), - Interval(I(15), I(50))), - max(Range(Interval(I(0), I(10)), - Interval(I(20), I(30)), - Interval(I(40), I(50))), - Range(Interval(I(15), I(25)), - Interval(I(28), I(42)), - Interval(I(60), I(70))))); -} - -TEST_F(RangeTest, -MaxOfUnsignedIntAndFloatWorksCorrectly) -{ - EXPECT_EQ(Range(Interval(F(100), F(400)), - Interval(F(8.9), F(9.3)), - Interval(F(10), F(40)), - Interval(F(49.8), F(58.3))), - max(Range(Interval(I(1), I(4)), - Interval(I(10), I(40)), - Interval(I(100), I(400))), - Range(Interval(F(8.9), F(9.3)), - Interval(F(49.8), F(58.3))))); -} - -TEST_F(RangeTest, -MaxOfFloatAndSignedIntWorksCorrectly) -{ - EXPECT_EQ(Range(Interval(F(-1), F(28.9))), - max(Range(Interval(F(-4.2), F(28.9))), - Range(Interval(I(-1), I(1))))); -} - -TEST_F(RangeTest, -MaxOfFloatAndUnsignedIntWorksCorrectly) -{ - EXPECT_EQ(Range(Interval(F(49.8), F(58.3)), - Interval(F(12), F(50))), - max(Range(Interval(F(8.9), F(9.3)), - Interval(F(49.8), F(58.3))), - Range(Interval(I(12), I(50))))); -} - -TEST_F(RangeTest, -MaxOfFloatAndFloatWorksCorrectly) -{ - EXPECT_EQ(Range(Interval(F(1.5), F(4.2)), - Interval(F(4.8), F(7.0))), - max(Range(Interval(F(-45.3), F(1.0)), - Interval(F(2.0), F(3.3)), - Interval(F(4.8), F(5.9))), - Range(Interval(F(1.5), F(2.5)), - Interval(F(2.8), F(4.2)), - Interval(F(6.0), F(7.0))))); -} - -TEST_F(RangeTest, -MaxOfSpecialFloatsWorksCorrectly) -{ - EXPECT_EQ(Range(Interval(F(INFINITY), F(INFINITY))), - max(Range(Interval(F(INFINITY), F(INFINITY))), - Range(Interval(F(-INFINITY), F(-INFINITY))))); - EXPECT_EQ(Range(Interval(F(INFINITY), F(INFINITY))), - max(Range(Interval(F(-INFINITY), F(-INFINITY))), - Range(Interval(F(INFINITY), F(INFINITY))))); - EXPECT_EQ(Range(Interval(F(-4.3), F(INFINITY))), - max(Range(Interval(F(-INFINITY), F(INFINITY))), - Range(Interval(F(-4.3), F(5.8))))); -} - -TEST_F(RangeTest, -MaxOfEmptyRangesWorksCorrectly) -{ - EXPECT_DEATH(max(Range(), Range()), ".*!r1.empty().*!r2.empty().*"); -} - -//////////////////////////////////////////////////////////////////////////////// -// unite() -//////////////////////////////////////////////////////////////////////////////// - -TEST_F(RangeTest, -UniteOfSignedCharAndSignedCharWorksCorrectly) -{ - EXPECT_EQ(Range(), - unite(Range(), Range())); - - EXPECT_EQ(Range(Number(vmin(), sizeof(char), true)), - unite(Range(Number(vmin(), sizeof(char), true)), - Range())); - - EXPECT_EQ(Range(Number(vmax(), sizeof(char), true)), - unite(Range(), - Range(Number(vmax(), sizeof(char), true)))); - - EXPECT_EQ(Range(Interval(I(-120), I(-1)), - Interval(I(120), I(125))), - unite(Range(Interval(I(-120), I(-1))), - Range(Interval(I(120), I(125))))); - - EXPECT_EQ(Range(Interval(I(-120), I(-115)), - Interval(I(-100), I(-70)), - Interval(I(-60), I(-50)), - Interval(I(20), I(30))), - unite(Range(Interval(I(-120), I(-118)), - Interval(I(-100), I(-80)), - Interval(I(-60), I(-50))), - Range(Interval(I(-117), I(-115)), - Interval(I(-90), I(-70)), - Interval(I(-58), I(-56)), - Interval(I(20), I(30))))); -} - -TEST_F(RangeTest, -UniteOfUnsignedCharAndUnsignedCharWorksCorrectly) -{ - EXPECT_EQ(Range(Number(vmin(), sizeof(char), false)), - unite(Range(Number(vmin(), sizeof(char), false)), - Range())); - - EXPECT_EQ(Range(Number(vmax(), sizeof(char), false)), - unite(Range(), - Range(Number(vmax(), sizeof(char), false)))); - - EXPECT_EQ(Range(Interval(I(0), I(2)), - Interval(I(120), I(125))), - unite(Range(Interval(I(0), I(2))), - Range(Interval(I(120), I(125))))); - - EXPECT_EQ(Range(Interval(I(0), I(8)), - Interval(I(10), I(30)), - Interval(I(80), I(90)), - Interval(I(200), I(255))), - unite(Range(Interval(I(0), I(5)), - Interval(I(10), I(20)), - Interval(I(80), I(90))), - Range(Interval(I(6), I(8)), - Interval(I(15), I(30)), - Interval(I(85), I(86)), - Interval(I(200), I(255))))); -} - -TEST_F(RangeTest, -UniteOfSignedShortAndSignedShortWorksCorrectly) -{ - EXPECT_EQ(Range(Number(vmin(), sizeof(short), true)), - unite(Range(Number(vmin(), sizeof(short), true)), - Range())); - - EXPECT_EQ(Range(Number(vmax(), sizeof(short), true)), - unite(Range(), - Range(Number(vmax(), sizeof(short), true)))); - - EXPECT_EQ(Range(Interval(I(-120), I(-1)), - Interval(I(120), I(125))), - unite(Range(Interval(I(-120), I(-1))), - Range(Interval(I(120), I(125))))); - - EXPECT_EQ(Range(Interval(I(-1200), I(-1150)), - Interval(I(-100), I(-70)), - Interval(I(60), I(70)), - Interval(I(20), I(30))), - unite(Range(Interval(I(-1200), I(-1180)), - Interval(I(-100), I(-80)), - Interval(I(60), I(70))), - Range(Interval(I(-1179), I(-1150)), - Interval(I(-90), I(-70)), - Interval(I(68), I(69)), - Interval(I(20), I(30))))); -} - -TEST_F(RangeTest, -UniteOfUnsignedShortAndUnsignedShortWorksCorrectly) -{ - EXPECT_EQ(Range(Number(vmin(), sizeof(short), false)), - unite(Range(Number(vmin(), sizeof(short), false)), - Range())); - - EXPECT_EQ(Range(Number(vmax(), sizeof(short), false)), - unite(Range(), - Range(Number(vmax(), sizeof(short), false)))); - - EXPECT_EQ(Range(Interval(I(0), I(2)), - Interval(I(120), I(125))), - unite(Range(Interval(I(0), I(2))), - Range(Interval(I(120), - I(125))))); - - EXPECT_EQ(Range(Interval(I(0), I(8)), - Interval(I(10), I(30)), - Interval(I(80), I(90)), - Interval(I(200), - I(vmax()))), - unite(Range(Interval(I(0), I(5)), - Interval(I(10), I(20)), - Interval(I(80), I(90))), - Range(Interval(I(6), I(8)), - Interval(I(15), I(30)), - Interval(I(85), I(86)), - Interval(I(200), - I(vmax()))))); -} - -TEST_F(RangeTest, -UniteOfSignedIntAndSignedIntWorksCorrectly) -{ - EXPECT_EQ(Range(Number(vmin(), sizeof(int), true)), - unite(Range(Number(vmin(), sizeof(int), true)), - Range())); - - EXPECT_EQ(Range(Number(vmax(), sizeof(int), true)), - unite(Range(), - Range(Number(vmax(), sizeof(int), true)))); - - EXPECT_EQ(Range(Interval(I(-120), I(-1)), - Interval(I(120), I(125))), - unite(Range(Interval(I(-120), I(-1))), - Range(Interval(I(120), I(125))))); - - EXPECT_EQ(Range(Interval(I(-1200), I(-1150)), - Interval(I(-100), I(-70)), - Interval(I(60), I(70)), - Interval(I(20), I(30))), - unite(Range(Interval(I(-1200), I(-1180)), - Interval(I(-100), I(-80)), - Interval(I(60), I(70))), - Range(Interval(I(-1179), I(-1150)), - Interval(I(-90), I(-70)), - Interval(I(68), I(69)), - Interval(I(20), I(30))))); -} - -TEST_F(RangeTest, -UniteOfUnsignedIntAndUnsignedIntWorksCorrectly) -{ - EXPECT_EQ(Range(Number(vmin(), sizeof(int), false)), - unite(Range(Number(vmin(), sizeof(int), false)), - Range())); - - EXPECT_EQ(Range(Number(vmax(), sizeof(int), false)), - unite(Range(), - Range(Number(vmax(), sizeof(int), false)))); - - EXPECT_EQ(Range(Interval(I(0), I(2)), - Interval(I(120), I(125))), - unite(Range(Interval(I(0), I(2))), - Range(Interval(I(120), - I(125))))); - - EXPECT_EQ(Range(Interval(I(0), I(8)), - Interval(I(10), I(30)), - Interval(I(80), I(90)), - Interval(I(200), - I(vmax()))), - unite(Range(Interval(I(0), I(5)), - Interval(I(10), I(20)), - Interval(I(80), I(90))), - Range(Interval(I(6), I(8)), - Interval(I(15), I(30)), - Interval(I(85), I(86)), - Interval(I(200), - I(vmax()))))); -} - -TEST_F(RangeTest, -UniteOfSignedLongAndSignedLongWorksCorrectly) -{ - EXPECT_EQ(Range(Number(vmin(), sizeof(long), true)), - unite(Range(Number(vmin(), sizeof(long), true)), - Range())); - - EXPECT_EQ(Range(Number(vmax(), sizeof(long), true)), - unite(Range(), - Range(Number(vmax(), sizeof(long), true)))); - - EXPECT_EQ(Range(Interval(I(-120), I(-1)), - Interval(I(120), I(125))), - unite(Range(Interval(I(-120), I(-1))), - Range(Interval(I(120), I(125))))); - - EXPECT_EQ(Range(Interval(I(-1200), I(-1150)), - Interval(I(-100), I(-70)), - Interval(I(60), I(70)), - Interval(I(20), I(30))), - unite(Range(Interval(I(-1200), I(-1180)), - Interval(I(-100), I(-80)), - Interval(I(60), I(70))), - Range(Interval(I(-1179), I(-1150)), - Interval(I(-90), I(-70)), - Interval(I(68), I(69)), - Interval(I(20), I(30))))); -} - -TEST_F(RangeTest, -UniteOfUnsignedLongAndUnsignedLongWorksCorrectly) -{ - EXPECT_EQ(Range(Number(vmin(), sizeof(long), true)), - unite(Range(Number(vmin(), sizeof(long), true)), - Range())); - - EXPECT_EQ(Range(Number(vmax(), sizeof(long), true)), - unite(Range(), - Range(Number(vmax(), sizeof(long), true)))); - - EXPECT_EQ(Range(Interval(I(-120), I(-1)), - Interval(I(120), I(125))), - unite(Range(Interval(I(-120), I(-1))), - Range(Interval(I(120), I(125))))); - - EXPECT_EQ(Range(Interval(I(-1200), I(-1150)), - Interval(I(-100), I(-70)), - Interval(I(60), I(70)), - Interval(I(20), I(30))), - unite(Range(Interval(I(-1200), - I(-1180)), - Interval(I(-100), I(-80)), - Interval(I(60), I(70))), - Range(Interval(I(-1179), - I(-1150)), - Interval(I(-90), I(-70)), - Interval(I(68), I(69)), - Interval(I(20), I(30))))); -} - -TEST_F(RangeTest, -UniteOfFloatAndFloatWorksCorrectly) -{ - EXPECT_EQ(Range(Number(vmin(), sizeof(float))), - unite(Range(Number(vmin(), sizeof(float))), - Range())); - - EXPECT_EQ(Range(Number(vmax(), sizeof(float))), - unite(Range(), - Range(Number(vmax(), sizeof(float))))); - - EXPECT_EQ(Range(Interval(F(-120.33), F(-1.35)), - Interval(F(120.36), F(125.67))), - unite(Range(Interval(F(-120.33), F(-1.35))), - Range(Interval(F(120.36), F(125.67))))); - - EXPECT_EQ(Range(Interval(F(-1200.35), F(-1150.43)), - Interval(F(-100.23), F(-70.5)), - Interval(F(60.36), F(70.95)), - Interval(F(20.8), F(30.4))), - unite(Range(Interval(F(-1200.35),F(-1180.0)), - Interval(F(-100.23), F(-80.58)), - Interval(F(60.36), F(70.95))), - Range(Interval(F(-1179.9), F(-1150.43)), - Interval(F(-90.45), F(-70.5)), - Interval(F(68.3), F(69.0)), - Interval(F(20.8), F(30.4))))); -} - -TEST_F(RangeTest, -UniteOfDoubleAndDoubleWorksCorrectly) -{ - EXPECT_EQ(Range(Number(vmin(), sizeof(double))), - unite(Range(Number(vmin(), sizeof(double))), - Range())); - - EXPECT_EQ(Range(Number(vmax(), sizeof(double))), - unite(Range(), - Range(Number(vmax(), sizeof(double))))); - - EXPECT_EQ(Range(Interval(F(-120.33), F(-1.35)), - Interval(F(120.36), F(125.67))), - unite(Range(Interval(F(-120.33), F(-1.35))), - Range(Interval(F(120.36), F(125.67))))); - - EXPECT_EQ(Range(Interval(F(-1200.35), F(-1150.43)), - Interval(F(-100.23), F(-70.5)), - Interval(F(60.36), F(70.95)), - Interval(F(20.8), F(30.4))), - unite(Range(Interval(F(-1200.35),F(-1180.0)), - Interval(F(-100.23), F(-80.58)), - Interval(F(60.36), F(70.95))), - Range(Interval(F(-1179.9), F(-1150.43)), - Interval(F(-90.45), F(-70.5)), - Interval(F(68.3), F(69.0)), - Interval(F(20.8), F(30.4))))); -} - -TEST_F(RangeTest, -UniteOfLongDoubleAndLongDoubleWorksCorrectly) -{ - EXPECT_EQ(Range(Number(vmin(), sizeof(long double))), - unite(Range(Number(vmin(), sizeof(long double))), - Range())); - - EXPECT_EQ(Range(Number(vmax(), sizeof(long double))), - unite(Range(), - Range(Number(vmax(), sizeof(long double))))); - - EXPECT_EQ(Range(Interval(F(-120.33), F(-1.35)), - Interval(F(120.36), F(125.67))), - unite(Range(Interval(F(-120.33), F(-1.35))), - Range(Interval(F(120.36), F(125.67))))); - - EXPECT_EQ(Range(Interval(F(-1200.35), F(-1150.43)), - Interval(F(-100.23), F(-70.5)), - Interval(F(60.36), F(70.95)), - Interval(F(20.8), F(30.4))), - unite(Range(Interval(F(-1200.35),F(-1180.0)), - Interval(F(-100.23), F(-80.58)), - Interval(F(60.36), F(70.95))), - Range(Interval(F(-1179.9), F(-1150.43)), - Interval(F(-90.45), F(-70.5)), - Interval(F(68.3), F(69.0)), - Interval(F(20.8), F(30.4))))); -} - -//////////////////////////////////////////////////////////////////////////////// -// intersection() -//////////////////////////////////////////////////////////////////////////////// - -TEST_F(RangeTest, -IntersectOfSignedIntRangeAndSignedIntRangeWorksCorrectly) -{ - EXPECT_EQ(Range(), - intersect(Range(Interval(I(15), I(20))), - Range(Interval(I(115), I(220))))); - EXPECT_EQ(Range(), - intersect(Range(Interval(I(-220), I(-115))), - Range(Interval(I(-20), I(-15))))); - EXPECT_EQ(Range(), - intersect(Range(), - Range(Interval(I(115), I(220))))); - EXPECT_EQ(Range(), - intersect(Range(Interval(I(-20), I(-15))), - Range())); - - EXPECT_EQ(Range(Interval(I(22), I(25))), - intersect(Range(Interval(I(15), I(25))), - Range(Interval(I(22), I(220))))); - - EXPECT_EQ(Range(Interval(I(-25), I(-22))), - intersect(Range(Interval(I(-220), I(-22))), - Range(Interval(I(-25), I(-15))))); - - EXPECT_EQ(Range(Interval(I(20), I(20))), - intersect(Range(Interval(I(15), I(20))), - Range(Interval(I(20), I(220))))); - - EXPECT_EQ(Range(Interval(I(-20), I(-20))), - intersect(Range(Interval(I(-220), I(-20))), - Range(Interval(I(-20), I(-15))))); - - EXPECT_EQ(Range(Interval(I(15), I(20))), - intersect(Range(Interval(I(15), I(20))), - Range(Interval(I(10), I(vmax()))))); - - EXPECT_EQ(Range(Interval(I(-20), I(-15))), - intersect(Range(Interval(I(vmin()), I(-10))), - Range(Interval(I(-20), I(-15))))); - - EXPECT_EQ(Range(Interval(I(15), I(16)), - Interval(I(18), I(20)), - Interval(I(25), I(27))), - intersect(Range(Interval(I(10), I(16)), - Interval(I(18), I(20)), - Interval(I(25), I(30))), - Range(Interval(I(15), I(27))))); - - EXPECT_EQ(Range(Interval(I(-16), I(-15)), - Interval(I(-20), I(-18)), - Interval(I(-27), I(-25))), - intersect(Range(Interval(I(-27), I(-15))), - Range(Interval(I(-16), I(-10)), - Interval(I(-20), I(-18)), - Interval(I(-30), I(-25))))); -} - -TEST_F(RangeTest, -IntersectOfUnsignedIntRangeAndUnsignedIntRangeWorksCorrectly) -{ - EXPECT_EQ(Range(), - intersect(Range(Interval(I(vmin()), - I(20))), - Range(Interval(I(115), I(220))))); - EXPECT_EQ(Range(), - intersect(Range(Interval(I(115), - I(vmax()))), - Range(Interval(I(15), I(20))))); - EXPECT_EQ(Range(), - intersect(Range(), - Range(Interval(I(115), I(220))))); - EXPECT_EQ(Range(), - intersect(Range(Interval(I(15), I(20))), - Range())); - - EXPECT_EQ(Range(Interval(I(22), I(25))), - intersect(Range(Interval(I(15), I(25))), - Range(Interval(I(22), I(220))))); - - EXPECT_EQ(Range(Interval(I(22), I(25))), - intersect(Range(Interval(I(22), I(220))), - Range(Interval(I(15), I(25))))); - - EXPECT_EQ(Range(Interval(I(20), I(20))), - intersect(Range(Interval(I(15), I(20))), - Range(Interval(I(20), I(220))))); - - EXPECT_EQ(Range(Interval(I(20), I(20))), - intersect(Range(Interval(I(20), I(220))), - Range(Interval(I(15), I(20))))); - - EXPECT_EQ(Range(Interval(I(15), I(20))), - intersect(Range(Interval(I(15), I(20))), - Range(Interval(I(10), - I(vmax()))))); - - EXPECT_EQ(Range(Interval(I(15), I(20))), - intersect(Range(Interval(I(10), - I(vmax()))), - Range(Interval(I(15), I(20))))); - - EXPECT_EQ(Range(Interval(I(15), I(16)), - Interval(I(18), I(20)), - Interval(I(25), I(27))), - intersect(Range(Interval(I(10), I(16)), - Interval(I(18), I(20)), - Interval(I(25), I(30))), - Range(Interval(I(15), I(27))))); - - EXPECT_EQ(Range(Interval(I(15), I(16)), - Interval(I(18), I(20)), - Interval(I(25), I(27))), - intersect(Range(Interval(I(15), I(27))), - Range(Interval(I(10), I(16)), - Interval(I(18), I(20)), - Interval(I(25), I(30))))); -} - -TEST_F(RangeTest, -IntersectOfFloatRangeAndFloatRangeWorksCorrectly) -{ - EXPECT_EQ(Range(), - intersect(Range(Interval(F(vmin()), - F(28.69))), - Range(Interval(F(115.28), F(2204.57))))); - EXPECT_EQ(Range(), - intersect(Range(Interval(F(115.35), - F(vmax()))), - Range(Interval(F(15.68), F(23.97))))); - EXPECT_EQ(Range(), - intersect(Range(), - Range(Interval(F(115.43), F(220.58))))); - EXPECT_EQ(Range(), - intersect(Range(Interval(F(16.89), F(23.87))), - Range())); - - EXPECT_EQ(Range(Interval(F(22.78), F(25.78))), - intersect(Range(Interval(F(15.83), F(25.78))), - Range(Interval(F(22.78), F(220.83))))); - - EXPECT_EQ(Range(Interval(F(22.48), F(25.48))), - intersect(Range(Interval(F(22.48), F(220.48))), - Range(Interval(F(15.48), F(25.48))))); - - EXPECT_EQ(Range(Interval(F(20.589), F(20.589))), - intersect(Range(Interval(F(15.78), F(20.589))), - Range(Interval(F(20.589), F(220.35))))); - - EXPECT_EQ(Range(Interval(F(20.698), F(20.698))), - intersect(Range(Interval(F(20.698), F(220.7))), - Range(Interval(F(15.038), F(20.698))))); - - EXPECT_EQ(Range(Interval(F(15.35), F(20.68))), - intersect(Range(Interval(F(15.35), F(20.68))), - Range(Interval(F(10.25), - F(vmax()))))); - - EXPECT_EQ(Range(Interval(F(15.789), F(20.789))), - intersect(Range(Interval(F(10.36), - F(vmax()))), - Range(Interval(F(15.789), F(20.789))))); - - EXPECT_EQ(Range(Interval(F(15.58), F(16.35)), - Interval(F(18.68), F(20.34)), - Interval(F(25.78), F(27.33))), - intersect(Range(Interval(F(10.56), F(16.35)), - Interval(F(18.68), F(20.34)), - Interval(F(25.78), F(30.33))), - Range(Interval(F(15.58), F(27.33))))); - - EXPECT_EQ(Range(Interval(F(15.58), F(16.35)), - Interval(F(18.68), F(20.34)), - Interval(F(25.78), F(27.33))), - intersect(Range(Interval(F(15.58), F(27.33))), - Range(Interval(F(10.56), F(16.35)), - Interval(F(18.68), F(20.34)), - Interval(F(25.78), F(30.34))))); - - EXPECT_EQ(Range(), - intersect(Range(Interval(F(25.83), F(25.99))), - Range(Interval(F(22.78), F(25.82))))); -} - - -TEST_F(RangeTest, -IntersectOfSpecialFloatRangeAndSpecialFloatRangeWorksCorrectly) -{ - // (NAN, NAN) \cap (NAN, NAN) = \emptyset - EXPECT_EQ(Range(), intersect(Range(F(NAN)), Range(F(NAN)))); - - // (INF, INF) \cap (INF, INF) = (INF, INF) - EXPECT_EQ(Range(F(INFINITY)), - intersect(Range(F(INFINITY)), Range(F(INFINITY)))); - - // (-INF, -INF) \cap (-INF, -INF) = (-INF, -INF) - EXPECT_EQ(Range(F(-INFINITY)), - intersect(Range(F(-INFINITY)), Range(F(-INFINITY)))); - - // (-INF, INF) \cap (-INF, INF) = (-INF, INF) - EXPECT_EQ(Range(Interval(F(-INFINITY), F(INFINITY))), - intersect(Range(Interval(F(-INFINITY), F(INFINITY))), - Range(Interval(F(-INFINITY), F(INFINITY))))); - - // (-INF, INF) \cap (INF, INF) = (INF, INF) - EXPECT_EQ(Range(Interval(F(INFINITY), F(INFINITY))), - intersect(Range(Interval(F(-INFINITY), F(INFINITY))), - Range(Interval(F(INFINITY), F(INFINITY))))); - - // (-INF, INF) \cap (-INF, -INF) = (-INF, -INF) - EXPECT_EQ(Range(Interval(F(-INFINITY), F(-INFINITY))), - intersect(Range(Interval(F(-INFINITY), F(INFINITY))), - Range(Interval(F(-INFINITY), F(-INFINITY))))); -} - -TEST_F(RangeTest, -IntersectOfRangesOfDifferentTypesWorksCorretly) -{ - EXPECT_DEATH(intersect(Range(I(0)), Range(F(0.0))), - ".*r1.hasSameTypeAs\\(r2\\).*"); - EXPECT_DEATH(intersect(Range(I(0)), Range(I(0))), - ".*r1.hasSameTypeAs\\(r2\\).*"); - EXPECT_DEATH(intersect(Range(I(0)), Range(I(0))), - ".*r1.hasSameTypeAs\\(r2\\).*"); -} - -TEST_F(RangeTest, -IntersectOfEmptyRangesWorksCorrectly) -{ - EXPECT_EQ(Range(), intersect(Range(), Range())); - EXPECT_EQ(Range(), intersect(Range(I(0.0)), Range())); - EXPECT_EQ(Range(), intersect(Range(), Range(F(0.0)))); -} - -//////////////////////////////////////////////////////////////////////////////// -// computeRangeForEq() -//////////////////////////////////////////////////////////////////////////////// - -TEST_F(RangeTest, -ComputeRangeForEqOfSignedAndSignedRangeWorksCorrectly) -{ - EXPECT_EQ(Range(Interval(I(-3), I(3))), - computeRangeForEq(Range(Interval(I(-10), I(10))), - Range(Interval(I(-3), I(3))))); -} - -TEST_F(RangeTest, -ComputeRangeForEqOfSignedAndUnsignedRangeWorksCorrectly) -{ - EXPECT_EQ(Range(Range(Interval(I(1), I(5)))), - computeRangeForEq(Range(Interval(I(-1), I(0))), - Range(Interval(I(1), I(5))))); - EXPECT_EQ(Range(Range(Interval(I(-1), I(-1)))), - computeRangeForEq(Range(Interval(I(-1), I(0))), - Range(Interval(I(vmax()), - I(vmax()))))); - EXPECT_EQ(Range(Range(Interval(I(-2), I(0)))), - computeRangeForEq(Range(Interval(I(-2), I(0))), - Range(Interval(I(vmin()), - I(vmax()))))); - EXPECT_EQ(Range(Range(Interval(I(-5), I(20)))), - computeRangeForEq(Range(Interval(I(-5), I(20))), - Range(Interval(I(vmin()), - I(vmax()))))); - EXPECT_EQ(Range(Range(Interval(I(10), I(10)))), - computeRangeForEq(Range(Interval(I(-1), I(10))), - Range(Interval(I(10), - I(20))))); - EXPECT_EQ(Range(Range(Interval(I(-10), I(-2)))), - computeRangeForEq(Range(Interval(I(-10), I(-2))), - Range(Interval(I(vmax()-100), - I(vmax()))))); -} - -TEST_F(RangeTest, -ComputeRangeForEqOfSignedAndFloatRangeWorksCorrectly) -{ - EXPECT_EQ(Range(Interval(I(39), I(40))), - computeRangeForEq(Range(Interval(I(-100), I(-50)), - Interval(I(-40), I(40)), - Interval(I(50), I(75))), - Range(Interval(F(39.5), F(47.8)), - Interval(F(vmax() - 3.5), - F(vmax() - 1.8))))); -} - -TEST_F(RangeTest, -ComputeRangeForEqOfUnsignedAndSignedRangeWorksCorrectly) -{ - EXPECT_EQ(Range(Range(Interval(I(0), I(0)), - Interval(I(vmax()), I(vmax())))), - computeRangeForEq(Range(Interval(I(1), I(5))), - Range(Interval(I(-1), I(0))))); - EXPECT_EQ(Range(Range(Interval(I(vmax()), - I(vmax())))), - computeRangeForEq(Range(Interval(I(vmax()), - I(vmax()))), - Range(Interval(I(-1), I(0))))); - EXPECT_EQ(Range(Range(Interval(I(0), I(0)), - Interval(I(vmax() - 1), - I(vmax())))), - computeRangeForEq(Range(Interval(I(vmin()), - I(vmax()))), - Range(Interval(I(-2), I(0))))); - EXPECT_EQ(Range(Range(Interval(I(0), I(20)), - Interval(I(vmax() - 4), - I(vmax())))), - computeRangeForEq(Range(Interval(I(vmin()), - I(vmax()))), - Range(Interval(I(-5), I(20))))); - EXPECT_EQ(Range(Range(Interval(I(10), I(10)))), - computeRangeForEq(Range(Interval(I(10), - I(20))), - Range(Interval(I(-1), I(10))))); - EXPECT_EQ(Range(Range(Interval(I(vmax() - 9), - I(vmax() - 1)))), - computeRangeForEq(Range(Interval(I(vmax()-100), - I(vmax()))), - Range(Interval(I(-10), I(-2))))); - -} - -TEST_F(RangeTest, -ComputeRangeForEqOfUnsignedAndUnsignedRangeWorksCorrectly) -{ - EXPECT_EQ(Range(Interval(I(7), I(10))), - computeRangeForEq(Range(Interval(I(0), I(10))), - Range(Interval(I(7), I(18))))); -} - -TEST_F(RangeTest, -ComputeRangeForEqOfUnsignedAndFloatRangeWorksCorrectly) -{ - EXPECT_EQ(Range(Interval(I(7), I(9))), - computeRangeForEq(Range(Interval(I(0), I(10))), - Range(Interval(F(7), F(9))))); -} - -TEST_F(RangeTest, -ComputeRangeForEqOfFloatAndSignedRangeWorksCorrectly) -{ - EXPECT_EQ(Range(Interval(F(39.5), F(40.0))), - computeRangeForEq(Range(Interval(F(39.5), F(47.8)), - Interval(F(vmax() - 3.5), - F(vmax() - 1.8))), - Range(Interval(I(-100), I(-50)), - Interval(I(-40), I(40)), - Interval(I(50), I(75))))); -} - -TEST_F(RangeTest, -ComputeRangeForEqOfFloatAndUnsignedRangeWorksCorrectly) -{ - EXPECT_EQ(Range(Interval(F(39.5), F(47.8))), - computeRangeForEq(Range(Interval(F(39.5), F(47.8)), - Interval(F(vmax() - 3.5), - F(vmax() - 1.8))), - Range(Interval(I(20), I(50)), - Interval(I(89), I(140)), - Interval(I(150), I(175))))); -} - -TEST_F(RangeTest, -ComputeRangeForEqOfFloatdAndFloatRangeWorksCorrectly) -{ - EXPECT_EQ(Range(Interval(F(15.58), F(25.9))), - computeRangeForEq(Range(Interval(F(15.58), F(183.9))), - Range(Interval(F(-25.6), F(25.9))))); -} - -TEST_F(RangeTest, -ComputeRangeForEqOfSpecialFloatAndSpecialFloatRangeWorksCorrectly) -{ - EXPECT_EQ(Range(Interval(F(INFINITY), F(INFINITY))), - computeRangeForEq(Range(Interval(F(INFINITY), - F(INFINITY))), - Range(Interval(F(INFINITY), - F(INFINITY))))); - - EXPECT_EQ(Range(Interval(F(-INFINITY), F(-INFINITY))), - computeRangeForEq(Range(Interval(F(-INFINITY), - F(-INFINITY))), - Range(Interval(F(-INFINITY), - F(-INFINITY))))); - - EXPECT_EQ(Range(Interval(F(-INFINITY), F(-INFINITY))), - computeRangeForEq(Range(Interval(F(-INFINITY), - F(INFINITY))), - Range(Interval(F(-INFINITY), - F(-INFINITY))))); - - EXPECT_EQ(Range(Interval(F(INFINITY), F(INFINITY))), - computeRangeForEq(Range(Interval(F(-INFINITY), - F(-INFINITY))), - Range(Interval(F(INFINITY), - F(INFINITY))))); - - EXPECT_EQ(Range(Interval(F(-INFINITY), F(-INFINITY))), - computeRangeForEq(Range(Interval(F(INFINITY), - F(INFINITY))), - Range(Interval(F(-INFINITY), - F(-INFINITY))))); - - EXPECT_EQ(Range(Interval(F(-INFINITY), F(-INFINITY))), - computeRangeForEq(Range(Interval(F(NAN), - F(NAN))), - Range(Interval(F(-INFINITY), - F(-INFINITY))))); - - EXPECT_EQ(Range(Interval(F(NAN), F(NAN))), - computeRangeForEq(Range(Interval(F(INFINITY), - F(INFINITY))), - Range(Interval(F(NAN), - F(NAN))))); -} - -TEST_F(RangeTest, -ComputeRangeForEqOfEmptyRangesWorksCorrectly) -{ - EXPECT_DEATH(computeRangeForEq(Range(), Range()), - ".*!r1.empty().*!r2.empty()"); - EXPECT_DEATH(computeRangeForEq(Range(F(1)), Range()), - ".*!r1.empty().*!r2.empty()"); - EXPECT_DEATH(computeRangeForEq(Range(), Range(I(1))), - ".*!r1.empty().*!r2.empty()"); -} - -//////////////////////////////////////////////////////////////////////////////// -// computeRangeForNeq() -//////////////////////////////////////////////////////////////////////////////// - -TEST_F(RangeTest, -ComputeRangeForNeqOfCorrectRangesWorksCorrectly) -{ - EXPECT_EQ(Range(Interval(I(1), I(4))), - computeRangeForNeq(Range(Interval(I(1), I(4))), - Range(Interval(F(3), F(6))))); - - EXPECT_EQ(Range(Interval(F(3), F(6))), - computeRangeForNeq(Range(Interval(F(3), F(6))), - Range(Interval(I(1), I(4))))); -} - -TEST_F(RangeTest, -ComputeRangeForNeqOfEmptyRangesWorksCorrectly) -{ - EXPECT_DEATH(computeRangeForNeq(Range(), Range()), - ".*!r1.empty().*!r2.empty().*"); - EXPECT_DEATH(computeRangeForNeq(Range(F(1)), Range()), - ".*!r1.empty().*!r2.empty().*"); - EXPECT_DEATH(computeRangeForNeq(Range(), Range(F(2))), - ".*!r1.empty().*!r2.empty().*"); -} - -//////////////////////////////////////////////////////////////////////////////// -// computeRangeForLtEq() -//////////////////////////////////////////////////////////////////////////////// - -TEST_F(RangeTest, -ComputeRangeForLtEqOfSignedAndSignedRangeWorksCorrectly) -{ - EXPECT_EQ(Range(Interval(I(vmin()), I(10))), - computeRangeForLtEq(Range(I(15)), - Range(I(10)))); - EXPECT_EQ(Range(Interval(I(1), I(10)), - Interval(I(100), I(120))), - computeRangeForLtEq(Range(Interval(I(1), I(10)), - Interval(I(100), I(120))), - Range(Interval(I(100), I(125))))); - EXPECT_EQ(Range(Interval(I(1), I(10)), - Interval(I(99), I(115))), - computeRangeForLtEq(Range(Interval(I(1), I(10)), - Interval(I(99), I(120))), - Range(Interval(I(100), I(115))))); -} - -TEST_F(RangeTest, -ComputeRangeForLtEqOfSignedAndUnsignedRangeWorksCorrectly) -{ - EXPECT_EQ(Range(Interval(I(0), I(10)), - Interval(I(99), I(115))), - computeRangeForLtEq(Range(Interval(I(-1), I(10)), - Interval(I(99), I(120))), - Range(Interval(I(100), I(115))))); - EXPECT_EQ(Range(Interval(I(-1), I(10)), - Interval(I(99), I(120))), - computeRangeForLtEq(Range(Interval(I(-1), - I(10)), - Interval(I(99), - I(120))), - Range(Interval(I(100), - I(254))))); -} - -TEST_F(RangeTest, -ComputeRangeForLtEqOfSignedAndFloatRangeWorksCorrectly) -{ - EXPECT_EQ(Range(Interval(I(vmin()), I(15))), - computeRangeForLtEq(Range(Interval(I(16),I(25))), - Range(Interval(F(10.25), F(15.69))))); - EXPECT_EQ(Range(Interval(I(1), I(10)), - Interval(I(99), I(99))), - computeRangeForLtEq(Range(Interval(I(1), I(10)), - Interval(I(99), I(120))), - Range(Interval(F(-1.35), F(99))))); -} - -TEST_F(RangeTest, -ComputeRangeForLtEqOfUnsignedAndSignedRangeWorksCorrectly) -{ - EXPECT_EQ(Range(Interval(I(0), I(vmax()))), - computeRangeForLtEq(Range(Interval(I(1), - I(10)), - Interval(I(25), - I(250))), - Range(Interval(I(-10), - I(-1))))); -} - -TEST_F(RangeTest, -ComputeRangeForLtEqOfUnsignedAndUnsignedRangeWorksCorrectly) -{ - EXPECT_EQ(Range(Interval(I(16), I(19))), - computeRangeForLtEq(Range(Interval(I(16),I(25))), - Range(Interval(I(10), I(19))))); -} - -TEST_F(RangeTest, -ComputeRangeForLtEqOfUnsignedAndFloatRangeWorksCorrectly) -{ - EXPECT_EQ(Range(Interval(I(16), I(19))), - computeRangeForLtEq(Range(Interval(I(16),I(25))), - Range(Interval(F(10.25), F(19.6))))); -} - -TEST_F(RangeTest, -ComputeRangeForLtEqOfFloatAndSignedRangeWorksCorrectly) -{ - EXPECT_EQ(Range(Interval(F(1.1), F(9.87)), - Interval(F(10.5), F(11.0))), - computeRangeForLtEq(Range(Interval(F(1.1), F(9.87)), - Interval(F(10.5), F(12.8))), - Range(Interval(I(-10), I(11))))); -} - -TEST_F(RangeTest, -ComputeRangeForLtEqOfFloatAndUnsignedRangeWorksCorrectly) -{ - EXPECT_EQ(Range(Interval(F(-INFINITY), F(1))), - computeRangeForLtEq(Range(Interval(F(1.1), F(9.87)), - Interval(F(10.5), F(12.8))), - Range(Interval(I(0), - I(1))))); -} - -TEST_F(RangeTest, -ComputeRangeForLtEqOfFloatdAndFloatRangeWorksCorrectly) -{ - EXPECT_EQ(Range(Interval(F(1.1), F(9.87)), - Interval(F(10.5), F(10.5))), - computeRangeForLtEq(Range(Interval(F(1.1), F(9.87)), - Interval(F(10.5), F(12.8))), - Range(Interval(F(6.8), - F(10.5))))); -} - -TEST_F(RangeTest, -ComputeRangeForLtEqOfSpecialFloatAndSpecialFloatRangeWorksCorrectly) -{ - EXPECT_EQ(Range(Interval(F(-INFINITY), F(-INFINITY))), - computeRangeForLtEq(Range(Interval(F(NAN), F(NAN)), - Interval(F(-INFINITY), - F(-INFINITY))), - Range(Interval(F(INFINITY), - F(INFINITY))))); - EXPECT_EQ(Range(Interval(F(NAN), F(NAN))), - computeRangeForLtEq(Range(Interval(F(NAN), F(NAN))), - Range(Interval(F(INFINITY), - F(INFINITY))))); - EXPECT_EQ(Range(Interval(F(-INFINITY), F(-INFINITY))), - computeRangeForLtEq(Range(Interval(F(NAN), F(NAN))), - Range(Interval(F(-INFINITY), - F(-INFINITY))))); - EXPECT_EQ(Range(Interval(F(-INFINITY), F(-INFINITY))), - computeRangeForLtEq(Range(Interval(F(-INFINITY), - F(-INFINITY))), - Range(Interval(F(INFINITY), - F(INFINITY))))); - EXPECT_EQ(Range(Interval(F(-INFINITY), F(-INFINITY))), - computeRangeForLtEq(Range(Interval(F(INFINITY), - F(INFINITY))), - Range(Interval(F(-INFINITY), - F(-INFINITY))))); - EXPECT_EQ(Range(Interval(F(NAN), F(NAN))), - computeRangeForLtEq(Range(Interval(F(INFINITY), - F(INFINITY))), - Range(Interval(F(NAN), - F(NAN))))); -} - -TEST_F(RangeTest, -ComputeRangeForLtEqOfEmptyRangesWorksCorrectly) -{ - EXPECT_DEATH(computeRangeForLtEq(Range(), Range()), - ".*!r1.empty().*!r2.empty().*"); - EXPECT_DEATH(computeRangeForLtEq(Range(F(1)), Range()), - ".*!r1.empty().*!r2.empty().*"); - EXPECT_DEATH(computeRangeForLtEq(Range(), Range(F(2))), - ".*!r1.empty().*!r2.empty().*"); -} - -//////////////////////////////////////////////////////////////////////////////// -// computeRangeForLt() -//////////////////////////////////////////////////////////////////////////////// - -TEST_F(RangeTest, -ComputeRangeForLtOfSignedAndSignedRangeWorksCorrectly) -{ - EXPECT_EQ(Range(Interval(I(vmin()), I(9))), - computeRangeForLt(Range(I(15)), - Range(I(10)))); - EXPECT_EQ(Range(Interval(I(1), I(10)), - Interval(I(100), I(120))), - computeRangeForLt(Range(Interval(I(1), I(10)), - Interval(I(100), I(120))), - Range(Interval(I(100), I(125))))); - EXPECT_EQ(Range(Interval(I(1), I(10)), - Interval(I(99), I(114))), - computeRangeForLt(Range(Interval(I(1), I(10)), - Interval(I(99), I(120))), - Range(Interval(I(100), I(115))))); - EXPECT_EQ(Range(Interval(I(1), I(9))), - computeRangeForLt(Range(Interval(I(1), I(10))), - Range(Interval(I(10), I(10))))); - EXPECT_EQ(Range(Interval(I(1), I(10))), - computeRangeForLt(Range(Interval(I(1), I(10))), - Range(Interval(I(10), I(20))))); - EXPECT_EQ(Range(Interval(I(1), I(9))), - computeRangeForLt(Range(Interval(I(1), I(10))), - Range(Interval(I(5), I(10))))); - EXPECT_EQ(Range(Interval(I(1), I(8))), - computeRangeForLt(Range(Interval(I(1), I(10))), - Range(Interval(I(5), I(9))))); -} - -TEST_F(RangeTest, -ComputeRangeForLtOfSignedAndUnsignedRangeWorksCorrectly) -{ - EXPECT_EQ(Range(Interval(I(0), I(10)), - Interval(I(99), I(114))), - computeRangeForLt(Range(Interval(I(-1), I(10)), - Interval(I(99), I(120))), - Range(Interval(I(100), I(115))))); - EXPECT_EQ(Range(Interval(I(-1), I(10)), - Interval(I(99), I(120))), - computeRangeForLt(Range(Interval(I(-1), - I(10)), - Interval(I(99), - I(120))), - Range(Interval(I(100), - I(254))))); -} - -TEST_F(RangeTest, -ComputeRangeForLtOfSignedAndFloatRangeWorksCorrectly) -{ - EXPECT_EQ(Range(Interval(I(vmin()), I(14))), - computeRangeForLt(Range(Interval(I(16),I(25))), - Range(Interval(F(10.25), F(15.69))))); - EXPECT_EQ(Range(Interval(I(1), I(10))), - computeRangeForLt(Range(Interval(I(1), I(10)), - Interval(I(99), I(120))), - Range(Interval(F(-1.35), F(99))))); -} - -TEST_F(RangeTest, -ComputeRangeForLtOfUnsignedAndSignedRangeWorksCorrectly) -{ - EXPECT_EQ(Range(Interval(I(0), I(vmax() - 1))), - computeRangeForLt(Range(Interval(I(1), - I(10)), - Interval(I(25), - I(250))), - Range(Interval(I(-10), - I(-1))))); -} - -TEST_F(RangeTest, -ComputeRangeForLtOfUnsignedAndUnsignedRangeWorksCorrectly) -{ - EXPECT_EQ(Range(Interval(I(16), I(18))), - computeRangeForLt(Range(Interval(I(16),I(25))), - Range(Interval(I(10), I(19))))); -} - -TEST_F(RangeTest, -ComputeRangeForLtOfUnsignedAndFloatRangeWorksCorrectly) -{ - EXPECT_EQ(Range(Interval(I(16), I(19))), - computeRangeForLt(Range(Interval(I(16),I(25))), - Range(Interval(F(10.25), F(19.6))))); -} - -TEST_F(RangeTest, -ComputeRangeForLtOfFloatAndSignedRangeWorksCorrectly) -{ - EXPECT_EQ(Range(Interval(F(1.1), F(9.87)), - Interval(F(10.5), F(11.0))), - computeRangeForLt(Range(Interval(F(1.1), F(9.87)), - Interval(F(10.5), F(12.8))), - Range(Interval(I(-10), I(11))))); -} - -TEST_F(RangeTest, -ComputeRangeForLtOfFloatAndUnsignedRangeWorksCorrectly) -{ - EXPECT_EQ(Range(Interval(F(-INFINITY), F(1))), - computeRangeForLt(Range(Interval(F(1.1), F(9.87)), - Interval(F(10.5), F(12.8))), - Range(Interval(I(0), - I(1))))); -} - -TEST_F(RangeTest, -ComputeRangeForLtOfFloatdAndFloatRangeWorksCorrectly) -{ - EXPECT_EQ(Range(Interval(F(1.1), F(9.87))), - computeRangeForLt(Range(Interval(F(1.1), F(9.87)), - Interval(F(10.5), F(12.8))), - Range(Interval(F(6.8), - F(10.5))))); -} - -TEST_F(RangeTest, -ComputeRangeForLtOfSpecialFloatAndSpecialFloatRangeWorksCorrectly) -{ - EXPECT_EQ(Range(Interval(F(-INFINITY), F(-INFINITY))), - computeRangeForLt(Range(Interval(F(NAN), F(NAN)), - Interval(F(-INFINITY), - F(-INFINITY))), - Range(Interval(F(INFINITY), - F(INFINITY))))); - EXPECT_EQ(Range(Interval(F(NAN), F(NAN))), - computeRangeForLt(Range(Interval(F(NAN), F(NAN))), - Range(Interval(F(INFINITY), - F(INFINITY))))); - EXPECT_EQ(Range(Interval(F(NAN), F(NAN))), - computeRangeForLt(Range(Interval(F(NAN), F(NAN))), - Range(Interval(F(-INFINITY), - F(-INFINITY))))); - EXPECT_EQ(Range(Interval(F(-INFINITY), F(-INFINITY))), - computeRangeForLt(Range(Interval(F(-INFINITY), - F(-INFINITY))), - Range(Interval(F(INFINITY), - F(INFINITY))))); - EXPECT_EQ(Range(Interval(F(-INFINITY), F(-INFINITY))), - computeRangeForLt(Range(Interval(F(INFINITY), - F(INFINITY))), - Range(Interval(F(-INFINITY), - F(-INFINITY))))); - EXPECT_EQ(Range(Interval(F(NAN), F(NAN))), - computeRangeForLt(Range(Interval(F(INFINITY), - F(INFINITY))), - Range(Interval(F(NAN), - F(NAN))))); -} - -TEST_F(RangeTest, -ComputeRangeForLtOfEmptyRangesWorksCorrectly) -{ - EXPECT_DEATH(computeRangeForLt(Range(), Range()), - ".*!r1.empty().*!r2.empty().*"); - EXPECT_DEATH(computeRangeForLt(Range(F(1)), Range()), - ".*!r1.empty().*!r2.empty().*"); - EXPECT_DEATH(computeRangeForLt(Range(), Range(F(2))), - ".*!r1.empty().*!r2.empty().*"); -} - -//////////////////////////////////////////////////////////////////////////////// -// computeRangeForGtEq() -//////////////////////////////////////////////////////////////////////////////// - -TEST_F(RangeTest, -ComputeRangeForGtEqOfSignedAndSignedRangeWorksCorrectly) -{ - EXPECT_EQ(Range(Interval(I(15), I(vmax()))), - computeRangeForGtEq(Range(I(10)), - Range(I(15)))); - EXPECT_EQ(Range(Interval(I(100), I(125))), - computeRangeForGtEq(Range(Interval(I(100), I(125))), - Range(Interval(I(1), I(10)), - Interval(I(100), I(120))))); - EXPECT_EQ(Range(Interval(I(1), I(115))), - computeRangeForGtEq(Range(Interval(I(-10), I(115))), - Range(Interval(I(1), I(10)), - Interval(I(99), I(120))))); - EXPECT_EQ(Range(Interval(I(9), I(vmax()))), - computeRangeForGtEq(Range(Interval(I(0), I(0))), - Range(Interval(I(9), I(9))))); -} - -TEST_F(RangeTest, -ComputeRangeForGtEqOfSignedAndUnsignedRangeWorksCorrectly) -{ - EXPECT_EQ(Range(Interval(I(-1), I(-1)), - Interval(I(100), I(120))), - computeRangeForGtEq(Range(Interval(I(-1), I(10)), - Interval(I(99), I(120))), - Range(Interval(I(100), I(115))))); - - EXPECT_EQ(Range(Interval(I(100), I(120))), - computeRangeForGtEq(Range(Interval(I(-1), - I(10)), - Interval(I(99), - I(120))), - Range(Interval(I(100), - I(255))))); -} - -TEST_F(RangeTest, -ComputeRangeForGtEqOfSignedAndFloatRangeWorksCorrectly) -{ - EXPECT_EQ(Range(Interval(I(16), I(25))), - computeRangeForGtEq(Range(Interval(I(16),I(25))), - Range(Interval(F(10.25), F(15.69))))); - EXPECT_EQ(Range(Interval(I(1), I(10)), - Interval(I(99), I(120))), - computeRangeForGtEq(Range(Interval(I(1), I(10)), - Interval(I(99), I(120))), - Range(Interval(F(-1.35), F(99))))); -} - -TEST_F(RangeTest, -ComputeRangeForGtEqOfUnsignedAndSignedRangeWorksCorrectly) -{ - EXPECT_EQ(Range(Interval(I(1), I(10)), - Interval(I(25), I(250))), - computeRangeForGtEq(Range(Interval(I(1), - I(10)), - Interval(I(25), - I(250))), - Range(Interval(I(-10), - I(-1))))); -} - -TEST_F(RangeTest, -ComputeRangeForGtEqOfUnsignedAndUnsignedRangeWorksCorrectly) -{ - EXPECT_EQ(Range(Interval(I(30), I(vmax()))), - computeRangeForGtEq(Range(Interval(I(16),I(25))), - Range(Interval(I(30), I(39))))); -} - -TEST_F(RangeTest, -ComputeRangeForGtEqOfUnsignedAndFloatRangeWorksCorrectly) -{ - EXPECT_EQ(Range(Interval(I(10), I(25))), - computeRangeForGtEq(Range(Interval(I(9),I(25))), - Range(Interval(F(10.25), F(19.6))))); -} - -TEST_F(RangeTest, -ComputeRangeForGtEqOfFloatAndSignedRangeWorksCorrectly) -{ - EXPECT_EQ(Range(Interval(F(1.1), F(9.87)), - Interval(F(10.5), F(12.8))), - computeRangeForGtEq(Range(Interval(F(1.1), F(9.87)), - Interval(F(10.5), F(12.8))), - Range(Interval(I(-10), I(11))))); -} - -TEST_F(RangeTest, -ComputeRangeForGtEqOfFloatAndUnsignedRangeWorksCorrectly) -{ - EXPECT_EQ(Range(Interval(F(4.0), F(9.87)), - Interval(F(10.5), F(12.8))), - computeRangeForGtEq(Range(Interval(F(1.1), F(9.87)), - Interval(F(10.5), F(12.8))), - Range(Interval(I(4), - I(10))))); -} - -TEST_F(RangeTest, -ComputeRangeForGtEqOfFloatdAndFloatRangeWorksCorrectly) -{ - EXPECT_EQ(Range(Interval(F(6.8), F(9.87)), - Interval(F(10.5), F(12.8))), - computeRangeForGtEq(Range(Interval(F(1.1), F(9.87)), - Interval(F(10.5), F(12.8))), - Range(Interval(F(6.8), - F(10.5))))); -} - -TEST_F(RangeTest, -ComputeRangeForGtEqOfSpecialFloatAndSpecialFloatRangeWorksCorrectly) -{ - EXPECT_EQ(Range(Interval(F(INFINITY), F(INFINITY))), - computeRangeForGtEq(Range(Interval(F(NAN), F(NAN)), - Interval(F(-INFINITY), - F(-INFINITY))), - Range(Interval(F(INFINITY), - F(INFINITY))))); - EXPECT_EQ(Range(Interval(F(INFINITY), F(INFINITY))), - computeRangeForGtEq(Range(Interval(F(NAN), F(NAN))), - Range(Interval(F(INFINITY), - F(INFINITY))))); - EXPECT_EQ(Range(Interval(F(NAN), F(NAN))), - computeRangeForGtEq(Range(Interval(F(NAN), F(NAN))), - Range(Interval(F(-INFINITY), - F(-INFINITY))))); - EXPECT_EQ(Range(Interval(F(INFINITY),F(INFINITY))), - computeRangeForGtEq(Range(Interval(F(-INFINITY), - F(-INFINITY))), - Range(Interval(F(INFINITY), - F(INFINITY))))); - EXPECT_EQ(Range(Interval(F(-INFINITY), F(INFINITY))), - computeRangeForGtEq(Range(Interval(F(-INFINITY), - F(INFINITY))), - Range(Interval(F(-INFINITY), - F(-INFINITY))))); - EXPECT_EQ(Range(Interval(F(NAN), F(NAN))), - computeRangeForGtEq(Range(Interval(F(INFINITY), - F(INFINITY))), - Range(Interval(F(NAN), - F(NAN))))); -} - -TEST_F(RangeTest, -ComputeRangeForGtEqOfEmptyRangesWorksCorrectly) -{ - EXPECT_DEATH(computeRangeForGtEq(Range(), Range()), - ".*!r1.empty().*!r2.empty().*"); - EXPECT_DEATH(computeRangeForGtEq(Range(F(1)), Range()), - ".*!r1.empty().*!r2.empty().*"); - EXPECT_DEATH(computeRangeForGtEq(Range(), Range(F(2))), - ".*!r1.empty().*!r2.empty().*"); -} - -//////////////////////////////////////////////////////////////////////////////// -// computeRangeForGt() -//////////////////////////////////////////////////////////////////////////////// - -TEST_F(RangeTest, -ComputeRangeForGtOfSignedAndSignedRangeWorksCorrectly) -{ - EXPECT_EQ(Range(Interval(I(16), I(vmax()))), - computeRangeForGt(Range(I(10)), - Range(I(15)))); - EXPECT_EQ(Range(Interval(I(100), I(125))), - computeRangeForGt(Range(Interval(I(100), I(125))), - Range(Interval(I(1), I(10)), - Interval(I(100), I(120))))); - EXPECT_EQ(Range(Interval(I(101), I(125))), - computeRangeForGt(Range(Interval(I(100), I(125))), - Range(Interval(I(100), I(120))))); - EXPECT_EQ(Range(Interval(I(2), I(115))), - computeRangeForGt(Range(Interval(I(-10), I(115))), - Range(Interval(I(1), I(10)), - Interval(I(99), I(120))))); - EXPECT_EQ(Range(Interval(I(10), I(vmax()))), - computeRangeForGt(Range(Interval(I(0), I(0))), - Range(Interval(I(9), I(9))))); -} - -TEST_F(RangeTest, -ComputeRangeForGtOfSignedAndUnsignedRangeWorksCorrectly) -{ - EXPECT_EQ(Range(Interval(I(-1), I(-1)), - Interval(I(101), I(120))), - computeRangeForGt(Range(Interval(I(-1), I(10)), - Interval(I(99), I(120))), - Range(Interval(I(100), I(115))))); - - EXPECT_EQ(Range(Interval(I(101), I(120))), - computeRangeForGt(Range(Interval(I(-1), - I(10)), - Interval(I(99), - I(120))), - Range(Interval(I(100), - I(255))))); -} - -TEST_F(RangeTest, -ComputeRangeForGtOfSignedAndFloatRangeWorksCorrectly) -{ - EXPECT_EQ(Range(Interval(I(16), I(25))), - computeRangeForGt(Range(Interval(I(16),I(25))), - Range(Interval(F(10.25), F(15.69))))); - EXPECT_EQ(Range(Interval(I(1), I(10)), - Interval(I(99), I(120))), - computeRangeForGt(Range(Interval(I(1), I(10)), - Interval(I(99), I(120))), - Range(Interval(F(-1.35), F(99))))); -} - -TEST_F(RangeTest, -ComputeRangeForGtOfUnsignedAndSignedRangeWorksCorrectly) -{ - EXPECT_EQ(Range(Interval(I(1), I(10)), - Interval(I(25), I(250))), - computeRangeForGt(Range(Interval(I(1), - I(10)), - Interval(I(25), - I(250))), - Range(Interval(I(-10), - I(-1))))); -} - -TEST_F(RangeTest, -ComputeRangeForGtOfUnsignedAndUnsignedRangeWorksCorrectly) -{ - EXPECT_EQ(Range(Interval(I(31), I(vmax()))), - computeRangeForGt(Range(Interval(I(16),I(25))), - Range(Interval(I(30), I(39))))); -} - -TEST_F(RangeTest, -ComputeRangeForGtOfUnsignedAndFloatRangeWorksCorrectly) -{ - EXPECT_EQ(Range(Interval(I(10), I(25))), - computeRangeForGt(Range(Interval(I(9),I(25))), - Range(Interval(F(10.25), F(19.6))))); -} - -TEST_F(RangeTest, -ComputeRangeForGtOfFloatAndSignedRangeWorksCorrectly) -{ - EXPECT_EQ(Range(Interval(F(1.1), F(9.87)), - Interval(F(10.5), F(12.8))), - computeRangeForGt(Range(Interval(F(1.1), F(9.87)), - Interval(F(10.5), F(12.8))), - Range(Interval(I(-10), I(11))))); -} - -TEST_F(RangeTest, -ComputeRangeForGtOfFloatAndUnsignedRangeWorksCorrectly) -{ - EXPECT_EQ(Range(Interval(F(4.0), F(9.87)), - Interval(F(10.5), F(12.8))), - computeRangeForGt(Range(Interval(F(1.1), F(9.87)), - Interval(F(10.5), F(12.8))), - Range(Interval(I(4), - I(10))))); -} - -TEST_F(RangeTest, -ComputeRangeForGtOfFloatdAndFloatRangeWorksCorrectly) -{ - EXPECT_EQ(Range(Interval(F(6.8), F(9.87)), - Interval(F(10.5), F(12.8))), - computeRangeForGt(Range(Interval(F(1.1), F(9.87)), - Interval(F(10.5), F(12.8))), - Range(Interval(F(6.8), - F(10.5))))); -} - -TEST_F(RangeTest, -ComputeRangeForGtOfSpecialFloatAndSpecialFloatRangeWorksCorrectly) -{ - EXPECT_EQ(Range(Interval(F(INFINITY), F(INFINITY))), - computeRangeForGt(Range(Interval(F(NAN), F(NAN)), - Interval(F(-INFINITY), - F(-INFINITY))), - Range(Interval(F(INFINITY), - F(INFINITY))))); - EXPECT_EQ(Range(Interval(F(NAN), F(NAN))), - computeRangeForGt(Range(Interval(F(NAN), F(NAN))), - Range(Interval(F(INFINITY), - F(INFINITY))))); - EXPECT_EQ(Range(Interval(F(NAN), F(NAN))), - computeRangeForGt(Range(Interval(F(NAN), F(NAN))), - Range(Interval(F(-INFINITY), - F(-INFINITY))))); - EXPECT_EQ(Range(Interval(F(INFINITY), F(INFINITY))), - computeRangeForGt(Range(Interval(F(-INFINITY), - F(-INFINITY))), - Range(Interval(F(INFINITY), - F(INFINITY))))); - EXPECT_EQ(Range(Interval(F(INFINITY), F(INFINITY))), - computeRangeForGt(Range(Interval(F(INFINITY), - F(INFINITY))), - Range(Interval(F(-INFINITY), - F(-INFINITY))))); - EXPECT_EQ(Range(Interval(F(NAN), F(NAN))), - computeRangeForGt(Range(Interval(F(INFINITY), - F(INFINITY))), - Range(Interval(F(NAN), - F(NAN))))); -} - -TEST_F(RangeTest, -ComputeRangeForGtOfEmptyRangesWorksCorrectly) -{ - EXPECT_DEATH(computeRangeForGt(Range(), Range()), - ".*!r1.empty().*!r2.empty().*"); - EXPECT_DEATH(computeRangeForGt(Range(F(1)), Range()), - ".*!r1.empty().*!r2.empty().*"); - EXPECT_DEATH(computeRangeForGt(Range(), Range(F(2))), - ".*!r1.empty().*!r2.empty().*"); -} - -int main(int argc, char *argv[]) -{ - ::testing::InitGoogleTest(&argc, argv); - return RUN_ALL_TESTS(); -} diff --git a/vra/tests-unit/UtilityTest.cc b/vra/tests-unit/UtilityTest.cc deleted file mode 100644 index 588600839..000000000 --- a/vra/tests-unit/UtilityTest.cc +++ /dev/null @@ -1,390 +0,0 @@ -/** -* @author Daniela Ďuričeková, xduric00@stud.fit.vutbr.cz -* @file UtilityTest.cc -* @brief Test class for class Utility. -* @date 2012 -*/ - -#include "Utility.h" -#include "gtest/gtest.h" - -using namespace std; - -class UtilityTest : public ::testing::Test { - protected: - UtilityTest() { - } - - virtual ~UtilityTest() { - } - - virtual void SetUp() { - } - - virtual void TearDown() { - } - -}; - -//////////////////////////////////////////////////////////////////////////////// -// convertOperandToNumber() -//////////////////////////////////////////////////////////////////////////////// - -TEST_F(UtilityTest, -PreconditionViolated) -{ - struct cl_operand op1; - op1.code = CL_OPERAND_VOID; - EXPECT_DEATH(Utility::convertOperandToNumber(&op1), - ".*operand->code == CL_OPERAND_VAR.*operand->code == CL_OPERAND_CST.*"); -} - -TEST_F(UtilityTest, -SignedCharOperandIsConvertedToNumber) -{ - struct cl_operand op1; - op1.code = CL_OPERAND_CST; - op1.data.cst.code = CL_TYPE_INT; - op1.data.cst.data.cst_int.value = -1; - op1.type = new struct cl_type; - op1.type->size = sizeof(char); - op1.type->is_unsigned = false; - - EXPECT_EQ(Number(-1, sizeof(char), true), - Utility::convertOperandToNumber(&op1)); - - delete op1.type; -} - -TEST_F(UtilityTest, -UnsignedCharOperandIsConvertedToNumber) -{ - struct cl_operand op1; - op1.code = CL_OPERAND_CST; - op1.data.cst.code = CL_TYPE_INT; - op1.data.cst.data.cst_int.value = 100; - op1.type = new struct cl_type; - op1.type->size = sizeof(char); - op1.type->is_unsigned = true; - - EXPECT_EQ(Number(100, sizeof(char), false), - Utility::convertOperandToNumber(&op1)); - - delete op1.type; -} - -TEST_F(UtilityTest, -SignedShortOperandIsConvertedToNumber) -{ - struct cl_operand op1; - op1.code = CL_OPERAND_CST; - op1.data.cst.code = CL_TYPE_INT; - op1.data.cst.data.cst_int.value = -100; - op1.type = new struct cl_type; - op1.type->size = sizeof(short); - op1.type->is_unsigned = false; - - EXPECT_EQ(Number(-100, sizeof(short), true), - Utility::convertOperandToNumber(&op1)); - - delete op1.type; -} - -TEST_F(UtilityTest, -UnsignedShortOperandIsConvertedToNumber) -{ - struct cl_operand op1; - op1.code = CL_OPERAND_CST; - op1.data.cst.code = CL_TYPE_INT; - op1.data.cst.data.cst_int.value = 125; - op1.type = new struct cl_type; - op1.type->size = sizeof(short); - op1.type->is_unsigned = true; - - EXPECT_EQ(Number(125, sizeof(short), false), - Utility::convertOperandToNumber(&op1)); - - delete op1.type; -} - -TEST_F(UtilityTest, -SignedIntOperandIsConvertedToNumber) -{ - struct cl_operand op1; - op1.code = CL_OPERAND_CST; - op1.data.cst.code = CL_TYPE_INT; - op1.data.cst.data.cst_int.value = -123456; - op1.type = new struct cl_type; - op1.type->size = sizeof(int); - op1.type->is_unsigned = false; - - EXPECT_EQ(Number(-123456, sizeof(int), true), - Utility::convertOperandToNumber(&op1)); - - delete op1.type; -} - -TEST_F(UtilityTest, -UnsignedIntOperandIsConvertedToNumber) -{ - struct cl_operand op1; - op1.code = CL_OPERAND_CST; - op1.data.cst.code = CL_TYPE_INT; - op1.data.cst.data.cst_int.value = 1234567; - op1.type = new struct cl_type; - op1.type->size = sizeof(int); - op1.type->is_unsigned = true; - - EXPECT_EQ(Number(1234567, sizeof(int), false), - Utility::convertOperandToNumber(&op1)); - - delete op1.type; -} - -TEST_F(UtilityTest, -SignedLongOperandIsConvertedToNumber) -{ - struct cl_operand op1; - op1.code = CL_OPERAND_CST; - op1.data.cst.code = CL_TYPE_INT; - op1.data.cst.data.cst_int.value = -123456; - op1.type = new struct cl_type; - op1.type->size = sizeof(long); - op1.type->is_unsigned = false; - - EXPECT_EQ(Number(-123456, sizeof(long), true), - Utility::convertOperandToNumber(&op1)); - - delete op1.type; -} - -TEST_F(UtilityTest, -UnsignedLongOperandIsConvertedToNumber) -{ - struct cl_operand op1; - op1.code = CL_OPERAND_CST; - op1.data.cst.code = CL_TYPE_INT; - op1.data.cst.data.cst_int.value = 1234567; - op1.type = new struct cl_type; - op1.type->size = sizeof(long); - op1.type->is_unsigned = true; - - EXPECT_EQ(Number(1234567, sizeof(long), false), - Utility::convertOperandToNumber(&op1)); - - delete op1.type; -} - -TEST_F(UtilityTest, -FloatOperandIsConvertedToNumber) -{ - struct cl_operand op1; - op1.code = CL_OPERAND_CST; - op1.data.cst.code = CL_TYPE_REAL; - op1.data.cst.data.cst_real.value = 1.35; - op1.type = new struct cl_type; - op1.type->size = sizeof(float); - - EXPECT_EQ(Number(1.35, sizeof(float)), - Utility::convertOperandToNumber(&op1)); - - delete op1.type; -} - -TEST_F(UtilityTest, -DoubleOperandIsConvertedToNumber) -{ - struct cl_operand op1; - op1.code = CL_OPERAND_CST; - op1.data.cst.code = CL_TYPE_REAL; - op1.data.cst.data.cst_real.value = 1.3507; - op1.type = new struct cl_type; - op1.type->size = sizeof(double); - - EXPECT_EQ(Number(1.3507, sizeof(double)), - Utility::convertOperandToNumber(&op1)); - - delete op1.type; -} - -TEST_F(UtilityTest, -LongDoubleOperandIsConvertedToNumber) -{ - struct cl_operand op1; - op1.code = CL_OPERAND_CST; - op1.data.cst.code = CL_TYPE_REAL; - op1.data.cst.data.cst_real.value = 1.35789; - op1.type = new struct cl_type; - op1.type->size = sizeof(long double); - - EXPECT_EQ(Number(1.35789, sizeof(long double)), - Utility::convertOperandToNumber(&op1)); - - delete op1.type; -} - -TEST_F(UtilityTest, -VariableOperandIsConvertedToNumber) -{ - struct cl_operand op1; - op1.code = CL_OPERAND_VAR; - op1.type = new struct cl_type; - op1.type->size = sizeof(long double); - op1.type->code = CL_TYPE_REAL; - - EXPECT_EQ(Number(0, sizeof(long double)), - Utility::convertOperandToNumber(&op1)); - - delete op1.type; -} - -TEST_F(UtilityTest, -UnsupportedOperandConvertedToNumberReturnsError) -{ - struct cl_operand op1; - op1.code = CL_OPERAND_CST; - op1.data.cst.code = CL_TYPE_VOID; - - EXPECT_DEATH(Utility::convertOperandToNumber(&op1), "Unsupported!"); -} - -//////////////////////////////////////////////////////////////////////////////// -// getMaxRange() -//////////////////////////////////////////////////////////////////////////////// - -TEST_F(UtilityTest, -GetMaxRangeOfSignedIntegralNumberWorksCorrectly) -{ - struct cl_operand op1; - op1.code = CL_OPERAND_VAR; - op1.type = new struct cl_type; - op1.type->code = CL_TYPE_INT; - op1.type->size = sizeof(int); - op1.type->is_unsigned = false; - - EXPECT_EQ(Range::getMaxRange(Number(1, sizeof(int), true)), - Utility::getMaxRange(op1)); - delete op1.type; -} - -TEST_F(UtilityTest, -GetMaxRangeOfUnsignedIntegralNumberWorksCorrectly) -{ - struct cl_operand op1; - op1.code = CL_OPERAND_VAR; - op1.type = new struct cl_type; - op1.type->code = CL_TYPE_INT; - op1.type->size = sizeof(int); - op1.type->is_unsigned = true; - - EXPECT_EQ(Range::getMaxRange(Number(1, sizeof(int), false)), - Utility::getMaxRange(op1)); - delete op1.type; -} - -TEST_F(UtilityTest, -GetMaxRangeOfFloatingPointNumberWorksCorrecly) -{ - struct cl_operand op1; - op1.code = CL_OPERAND_VAR; - op1.type = new struct cl_type; - op1.type->code = CL_TYPE_REAL; - op1.type->size = sizeof(double); - - EXPECT_EQ(Range::getMaxRange(Number(1.0, sizeof(double))), - Utility::getMaxRange(op1)); - delete op1.type; -} - -TEST_F(UtilityTest, -GetMaxRangeOfUnsupportedOperandWorksCorrectly) -{ - struct cl_operand op1; - op1.code = CL_OPERAND_VAR; - op1.type = new struct cl_type; - op1.type->code = CL_TYPE_VOID; - - EXPECT_DEATH(Utility::getMaxRange(op1), "Unsupported!"); - delete op1.type; -} - -TEST_F(UtilityTest, -GetMaxRangeWhenPreconditionViolatedWorksCorrectly) -{ - struct cl_operand op1; - op1.code = CL_OPERAND_CST; - EXPECT_DEATH(Utility::getMaxRange(op1), ".*operand.code == CL_OPERAND_VAR.*"); -} - -TEST_F(UtilityTest, -GetMaxRangeWithSpecifiedIndexesForNestedStructureWorksCorrecly) -{ - // struct t { - // int e; - // double f; - // } - // struct { - // struct t a[10]; - // } q; - - struct cl_operand op1; - op1.data.var = new struct cl_var; - op1.data.var->uid = 1709; - op1.data.var->name = "q"; - op1.data.var->artificial = false; - op1.code = CL_OPERAND_VAR; - op1.type = new struct cl_type; - op1.type->code = CL_TYPE_STRUCT; - op1.type->items = new struct cl_type_item[1]; - struct cl_type *tmp1 = new struct cl_type; - tmp1->code = CL_TYPE_ARRAY; - tmp1->items = new struct cl_type_item[1]; - op1.type->items[0].type = tmp1; - op1.type->items[0].name = "a"; - struct cl_type *tmp2 = new struct cl_type; - tmp2->code = CL_TYPE_STRUCT; - tmp2->items = new struct cl_type_item[2]; - tmp2->items[0].name = "e"; - tmp2->items[1].name = "f"; - struct cl_type *tmp3 = new struct cl_type; - struct cl_type *tmp4 = new struct cl_type; - tmp3->code = CL_TYPE_INT; - tmp3->size = sizeof(int); - tmp3->is_unsigned = false; - tmp4->code = CL_TYPE_REAL; - tmp4->size = sizeof(double); - tmp2->items[0].type = tmp3; - tmp2->items[1].type = tmp4; - op1.type->items[0].type->items[0].type = tmp2; - - std::deque indexes; - indexes.push_back(0); - indexes.push_back(0); - indexes.push_back(0); - EXPECT_EQ(Range::getMaxRange(Number(1, sizeof(int), true)), - Utility::getMaxRange(op1, indexes)); - - indexes.clear(); - indexes.push_back(0); - indexes.push_back(0); - indexes.push_back(1); - EXPECT_EQ(Range::getMaxRange(Number(1, sizeof(double))), - Utility::getMaxRange(op1, indexes)); - - delete tmp4; - delete tmp3; - delete [] tmp2->items; - delete tmp2; - delete tmp1; - delete [] op1.type->items; - delete op1.type; - delete op1.data.var; - -} - -int main(int argc, char *argv[]) -{ - ::testing::InitGoogleTest(&argc, argv); - return RUN_ALL_TESTS(); -} - diff --git a/vra/tests-unit/gtest/Makefile b/vra/tests-unit/gtest/Makefile deleted file mode 100644 index c73194b51..000000000 --- a/vra/tests-unit/gtest/Makefile +++ /dev/null @@ -1,5 +0,0 @@ -all: gtest-all.cc gtest.h - g++ -c -pthread -o libgtest.a gtest-all.cc -I.. - -clean: - rm -f libgtest.a diff --git a/vra/tests-unit/gtest/gtest-all.cc b/vra/tests-unit/gtest/gtest-all.cc deleted file mode 100644 index 77fa29ef4..000000000 --- a/vra/tests-unit/gtest/gtest-all.cc +++ /dev/null @@ -1,9118 +0,0 @@ -// Copyright 2008, 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. -// -// Author: mheule@google.com (Markus Heule) -// -// Google C++ Testing Framework (Google Test) -// -// Sometimes it's desirable to build Google Test by compiling a single file. -// This file serves this purpose. - -// This line ensures that gtest.h can be compiled on its own, even -// when it's fused. -#include "gtest/gtest.h" - -// The following lines pull in the real gtest *.cc files. -// Copyright 2005, 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. -// -// Author: wan@google.com (Zhanyong Wan) -// -// The Google C++ Testing Framework (Google Test) - -// Copyright 2007, 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. -// -// Author: wan@google.com (Zhanyong Wan) -// -// Utilities for testing Google Test itself and code that uses Google Test -// (e.g. frameworks built on top of Google Test). - -#ifndef GTEST_INCLUDE_GTEST_GTEST_SPI_H_ -#define GTEST_INCLUDE_GTEST_GTEST_SPI_H_ - - -namespace testing { - -// This helper class can be used to mock out Google Test failure reporting -// so that we can test Google Test or code that builds on Google Test. -// -// An object of this class appends a TestPartResult object to the -// TestPartResultArray object given in the constructor whenever a Google Test -// failure is reported. It can either intercept only failures that are -// generated in the same thread that created this object or it can intercept -// all generated failures. The scope of this mock object can be controlled with -// the second argument to the two arguments constructor. -class GTEST_API_ ScopedFakeTestPartResultReporter - : public TestPartResultReporterInterface { - public: - // The two possible mocking modes of this object. - enum InterceptMode { - INTERCEPT_ONLY_CURRENT_THREAD, // Intercepts only thread local failures. - INTERCEPT_ALL_THREADS // Intercepts all failures. - }; - - // The c'tor sets this object as the test part result reporter used - // by Google Test. The 'result' parameter specifies where to report the - // results. This reporter will only catch failures generated in the current - // thread. DEPRECATED - explicit ScopedFakeTestPartResultReporter(TestPartResultArray* result); - - // Same as above, but you can choose the interception scope of this object. - ScopedFakeTestPartResultReporter(InterceptMode intercept_mode, - TestPartResultArray* result); - - // The d'tor restores the previous test part result reporter. - virtual ~ScopedFakeTestPartResultReporter(); - - // Appends the TestPartResult object to the TestPartResultArray - // received in the constructor. - // - // This method is from the TestPartResultReporterInterface - // interface. - virtual void ReportTestPartResult(const TestPartResult& result); - private: - void Init(); - - const InterceptMode intercept_mode_; - TestPartResultReporterInterface* old_reporter_; - TestPartResultArray* const result_; - - GTEST_DISALLOW_COPY_AND_ASSIGN_(ScopedFakeTestPartResultReporter); -}; - -namespace internal { - -// A helper class for implementing EXPECT_FATAL_FAILURE() and -// EXPECT_NONFATAL_FAILURE(). Its destructor verifies that the given -// TestPartResultArray contains exactly one failure that has the given -// type and contains the given substring. If that's not the case, a -// non-fatal failure will be generated. -class GTEST_API_ SingleFailureChecker { - public: - // The constructor remembers the arguments. - SingleFailureChecker(const TestPartResultArray* results, - TestPartResult::Type type, - const string& substr); - ~SingleFailureChecker(); - private: - const TestPartResultArray* const results_; - const TestPartResult::Type type_; - const string substr_; - - GTEST_DISALLOW_COPY_AND_ASSIGN_(SingleFailureChecker); -}; - -} // namespace internal - -} // namespace testing - -// A set of macros for testing Google Test assertions or code that's expected -// to generate Google Test fatal failures. It verifies that the given -// statement will cause exactly one fatal Google Test failure with 'substr' -// being part of the failure message. -// -// There are two different versions of this macro. EXPECT_FATAL_FAILURE only -// affects and considers failures generated in the current thread and -// EXPECT_FATAL_FAILURE_ON_ALL_THREADS does the same but for all threads. -// -// The verification of the assertion is done correctly even when the statement -// throws an exception or aborts the current function. -// -// Known restrictions: -// - 'statement' cannot reference local non-static variables or -// non-static members of the current object. -// - 'statement' cannot return a value. -// - You cannot stream a failure message to this macro. -// -// Note that even though the implementations of the following two -// macros are much alike, we cannot refactor them to use a common -// helper macro, due to some peculiarity in how the preprocessor -// works. The AcceptsMacroThatExpandsToUnprotectedComma test in -// gtest_unittest.cc will fail to compile if we do that. -#define EXPECT_FATAL_FAILURE(statement, substr) \ - do { \ - class GTestExpectFatalFailureHelper {\ - public:\ - static void Execute() { statement; }\ - };\ - ::testing::TestPartResultArray gtest_failures;\ - ::testing::internal::SingleFailureChecker gtest_checker(\ - >est_failures, ::testing::TestPartResult::kFatalFailure, (substr));\ - {\ - ::testing::ScopedFakeTestPartResultReporter gtest_reporter(\ - ::testing::ScopedFakeTestPartResultReporter:: \ - INTERCEPT_ONLY_CURRENT_THREAD, >est_failures);\ - GTestExpectFatalFailureHelper::Execute();\ - }\ - } while (::testing::internal::AlwaysFalse()) - -#define EXPECT_FATAL_FAILURE_ON_ALL_THREADS(statement, substr) \ - do { \ - class GTestExpectFatalFailureHelper {\ - public:\ - static void Execute() { statement; }\ - };\ - ::testing::TestPartResultArray gtest_failures;\ - ::testing::internal::SingleFailureChecker gtest_checker(\ - >est_failures, ::testing::TestPartResult::kFatalFailure, (substr));\ - {\ - ::testing::ScopedFakeTestPartResultReporter gtest_reporter(\ - ::testing::ScopedFakeTestPartResultReporter:: \ - INTERCEPT_ALL_THREADS, >est_failures);\ - GTestExpectFatalFailureHelper::Execute();\ - }\ - } while (::testing::internal::AlwaysFalse()) - -// A macro for testing Google Test assertions or code that's expected to -// generate Google Test non-fatal failures. It asserts that the given -// statement will cause exactly one non-fatal Google Test failure with 'substr' -// being part of the failure message. -// -// There are two different versions of this macro. EXPECT_NONFATAL_FAILURE only -// affects and considers failures generated in the current thread and -// EXPECT_NONFATAL_FAILURE_ON_ALL_THREADS does the same but for all threads. -// -// 'statement' is allowed to reference local variables and members of -// the current object. -// -// The verification of the assertion is done correctly even when the statement -// throws an exception or aborts the current function. -// -// Known restrictions: -// - You cannot stream a failure message to this macro. -// -// Note that even though the implementations of the following two -// macros are much alike, we cannot refactor them to use a common -// helper macro, due to some peculiarity in how the preprocessor -// works. If we do that, the code won't compile when the user gives -// EXPECT_NONFATAL_FAILURE() a statement that contains a macro that -// expands to code containing an unprotected comma. The -// AcceptsMacroThatExpandsToUnprotectedComma test in gtest_unittest.cc -// catches that. -// -// For the same reason, we have to write -// if (::testing::internal::AlwaysTrue()) { statement; } -// instead of -// GTEST_SUPPRESS_UNREACHABLE_CODE_WARNING_BELOW_(statement) -// to avoid an MSVC warning on unreachable code. -#define EXPECT_NONFATAL_FAILURE(statement, substr) \ - do {\ - ::testing::TestPartResultArray gtest_failures;\ - ::testing::internal::SingleFailureChecker gtest_checker(\ - >est_failures, ::testing::TestPartResult::kNonFatalFailure, \ - (substr));\ - {\ - ::testing::ScopedFakeTestPartResultReporter gtest_reporter(\ - ::testing::ScopedFakeTestPartResultReporter:: \ - INTERCEPT_ONLY_CURRENT_THREAD, >est_failures);\ - if (::testing::internal::AlwaysTrue()) { statement; }\ - }\ - } while (::testing::internal::AlwaysFalse()) - -#define EXPECT_NONFATAL_FAILURE_ON_ALL_THREADS(statement, substr) \ - do {\ - ::testing::TestPartResultArray gtest_failures;\ - ::testing::internal::SingleFailureChecker gtest_checker(\ - >est_failures, ::testing::TestPartResult::kNonFatalFailure, \ - (substr));\ - {\ - ::testing::ScopedFakeTestPartResultReporter gtest_reporter(\ - ::testing::ScopedFakeTestPartResultReporter::INTERCEPT_ALL_THREADS,\ - >est_failures);\ - if (::testing::internal::AlwaysTrue()) { statement; }\ - }\ - } while (::testing::internal::AlwaysFalse()) - -#endif // GTEST_INCLUDE_GTEST_GTEST_SPI_H_ - -#include -#include -#include -#include -#include -#include -#include - -#include -#include // NOLINT -#include -#include - -#if GTEST_OS_LINUX - -// TODO(kenton@google.com): Use autoconf to detect availability of -// gettimeofday(). -# define GTEST_HAS_GETTIMEOFDAY_ 1 - -# include // NOLINT -# include // NOLINT -# include // NOLINT -// Declares vsnprintf(). This header is not available on Windows. -# include // NOLINT -# include // NOLINT -# include // NOLINT -# include // NOLINT -# include - -#elif GTEST_OS_SYMBIAN -# define GTEST_HAS_GETTIMEOFDAY_ 1 -# include // NOLINT - -#elif GTEST_OS_ZOS -# define GTEST_HAS_GETTIMEOFDAY_ 1 -# include // NOLINT - -// On z/OS we additionally need strings.h for strcasecmp. -# include // NOLINT - -#elif GTEST_OS_WINDOWS_MOBILE // We are on Windows CE. - -# include // NOLINT - -#elif GTEST_OS_WINDOWS // We are on Windows proper. - -# include // NOLINT -# include // NOLINT -# include // NOLINT -# include // NOLINT - -# if GTEST_OS_WINDOWS_MINGW -// MinGW has gettimeofday() but not _ftime64(). -// TODO(kenton@google.com): Use autoconf to detect availability of -// gettimeofday(). -// TODO(kenton@google.com): There are other ways to get the time on -// Windows, like GetTickCount() or GetSystemTimeAsFileTime(). MinGW -// supports these. consider using them instead. -# define GTEST_HAS_GETTIMEOFDAY_ 1 -# include // NOLINT -# endif // GTEST_OS_WINDOWS_MINGW - -// cpplint thinks that the header is already included, so we want to -// silence it. -# include // NOLINT - -#else - -// Assume other platforms have gettimeofday(). -// TODO(kenton@google.com): Use autoconf to detect availability of -// gettimeofday(). -# define GTEST_HAS_GETTIMEOFDAY_ 1 - -// cpplint thinks that the header is already included, so we want to -// silence it. -# include // NOLINT -# include // NOLINT - -#endif // GTEST_OS_LINUX - -#if GTEST_HAS_EXCEPTIONS -# include -#endif - -#if GTEST_CAN_STREAM_RESULTS_ -# include // NOLINT -# include // NOLINT -#endif - -// Indicates that this translation unit is part of Google Test's -// implementation. It must come before gtest-internal-inl.h is -// included, or there will be a compiler error. This trick is to -// prevent a user from accidentally including gtest-internal-inl.h in -// his code. -#define GTEST_IMPLEMENTATION_ 1 -// Copyright 2005, 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. - -// Utility functions and classes used by the Google C++ testing framework. -// -// Author: wan@google.com (Zhanyong Wan) -// -// This file contains purely Google Test's internal implementation. Please -// DO NOT #INCLUDE IT IN A USER PROGRAM. - -#ifndef GTEST_SRC_GTEST_INTERNAL_INL_H_ -#define GTEST_SRC_GTEST_INTERNAL_INL_H_ - -// GTEST_IMPLEMENTATION_ is defined to 1 iff the current translation unit is -// part of Google Test's implementation; otherwise it's undefined. -#if !GTEST_IMPLEMENTATION_ -// A user is trying to include this from his code - just say no. -# error "gtest-internal-inl.h is part of Google Test's internal implementation." -# error "It must not be included except by Google Test itself." -#endif // GTEST_IMPLEMENTATION_ - -#ifndef _WIN32_WCE -# include -#endif // !_WIN32_WCE -#include -#include // For strtoll/_strtoul64/malloc/free. -#include // For memmove. - -#include -#include -#include - - -#if GTEST_OS_WINDOWS -# include // NOLINT -#endif // GTEST_OS_WINDOWS - - -namespace testing { - -// Declares the flags. -// -// We don't want the users to modify this flag in the code, but want -// Google Test's own unit tests to be able to access it. Therefore we -// declare it here as opposed to in gtest.h. -GTEST_DECLARE_bool_(death_test_use_fork); - -namespace internal { - -// The value of GetTestTypeId() as seen from within the Google Test -// library. This is solely for testing GetTestTypeId(). -GTEST_API_ extern const TypeId kTestTypeIdInGoogleTest; - -// Names of the flags (needed for parsing Google Test flags). -const char kAlsoRunDisabledTestsFlag[] = "also_run_disabled_tests"; -const char kBreakOnFailureFlag[] = "break_on_failure"; -const char kCatchExceptionsFlag[] = "catch_exceptions"; -const char kColorFlag[] = "color"; -const char kFilterFlag[] = "filter"; -const char kListTestsFlag[] = "list_tests"; -const char kOutputFlag[] = "output"; -const char kPrintTimeFlag[] = "print_time"; -const char kRandomSeedFlag[] = "random_seed"; -const char kRepeatFlag[] = "repeat"; -const char kShuffleFlag[] = "shuffle"; -const char kStackTraceDepthFlag[] = "stack_trace_depth"; -const char kStreamResultToFlag[] = "stream_result_to"; -const char kThrowOnFailureFlag[] = "throw_on_failure"; - -// A valid random seed must be in [1, kMaxRandomSeed]. -const int kMaxRandomSeed = 99999; - -// g_help_flag is true iff the --help flag or an equivalent form is -// specified on the command line. -GTEST_API_ extern bool g_help_flag; - -// Returns the current time in milliseconds. -GTEST_API_ TimeInMillis GetTimeInMillis(); - -// Returns true iff Google Test should use colors in the output. -GTEST_API_ bool ShouldUseColor(bool stdout_is_tty); - -// Formats the given time in milliseconds as seconds. -GTEST_API_ std::string FormatTimeInMillisAsSeconds(TimeInMillis ms); - -// Parses a string for an Int32 flag, in the form of "--flag=value". -// -// On success, stores the value of the flag in *value, and returns -// true. On failure, returns false without changing *value. -GTEST_API_ bool ParseInt32Flag( - const char* str, const char* flag, Int32* value); - -// Returns a random seed in range [1, kMaxRandomSeed] based on the -// given --gtest_random_seed flag value. -inline int GetRandomSeedFromFlag(Int32 random_seed_flag) { - const unsigned int raw_seed = (random_seed_flag == 0) ? - static_cast(GetTimeInMillis()) : - static_cast(random_seed_flag); - - // Normalizes the actual seed to range [1, kMaxRandomSeed] such that - // it's easy to type. - const int normalized_seed = - static_cast((raw_seed - 1U) % - static_cast(kMaxRandomSeed)) + 1; - return normalized_seed; -} - -// Returns the first valid random seed after 'seed'. The behavior is -// undefined if 'seed' is invalid. The seed after kMaxRandomSeed is -// considered to be 1. -inline int GetNextRandomSeed(int seed) { - GTEST_CHECK_(1 <= seed && seed <= kMaxRandomSeed) - << "Invalid random seed " << seed << " - must be in [1, " - << kMaxRandomSeed << "]."; - const int next_seed = seed + 1; - return (next_seed > kMaxRandomSeed) ? 1 : next_seed; -} - -// This class saves the values of all Google Test flags in its c'tor, and -// restores them in its d'tor. -class GTestFlagSaver { - public: - // The c'tor. - GTestFlagSaver() { - also_run_disabled_tests_ = GTEST_FLAG(also_run_disabled_tests); - break_on_failure_ = GTEST_FLAG(break_on_failure); - catch_exceptions_ = GTEST_FLAG(catch_exceptions); - color_ = GTEST_FLAG(color); - death_test_style_ = GTEST_FLAG(death_test_style); - death_test_use_fork_ = GTEST_FLAG(death_test_use_fork); - filter_ = GTEST_FLAG(filter); - internal_run_death_test_ = GTEST_FLAG(internal_run_death_test); - list_tests_ = GTEST_FLAG(list_tests); - output_ = GTEST_FLAG(output); - print_time_ = GTEST_FLAG(print_time); - random_seed_ = GTEST_FLAG(random_seed); - repeat_ = GTEST_FLAG(repeat); - shuffle_ = GTEST_FLAG(shuffle); - stack_trace_depth_ = GTEST_FLAG(stack_trace_depth); - stream_result_to_ = GTEST_FLAG(stream_result_to); - throw_on_failure_ = GTEST_FLAG(throw_on_failure); - } - - // The d'tor is not virtual. DO NOT INHERIT FROM THIS CLASS. - ~GTestFlagSaver() { - GTEST_FLAG(also_run_disabled_tests) = also_run_disabled_tests_; - GTEST_FLAG(break_on_failure) = break_on_failure_; - GTEST_FLAG(catch_exceptions) = catch_exceptions_; - GTEST_FLAG(color) = color_; - GTEST_FLAG(death_test_style) = death_test_style_; - GTEST_FLAG(death_test_use_fork) = death_test_use_fork_; - GTEST_FLAG(filter) = filter_; - GTEST_FLAG(internal_run_death_test) = internal_run_death_test_; - GTEST_FLAG(list_tests) = list_tests_; - GTEST_FLAG(output) = output_; - GTEST_FLAG(print_time) = print_time_; - GTEST_FLAG(random_seed) = random_seed_; - GTEST_FLAG(repeat) = repeat_; - GTEST_FLAG(shuffle) = shuffle_; - GTEST_FLAG(stack_trace_depth) = stack_trace_depth_; - GTEST_FLAG(stream_result_to) = stream_result_to_; - GTEST_FLAG(throw_on_failure) = throw_on_failure_; - } - private: - // Fields for saving the original values of flags. - bool also_run_disabled_tests_; - bool break_on_failure_; - bool catch_exceptions_; - String color_; - String death_test_style_; - bool death_test_use_fork_; - String filter_; - String internal_run_death_test_; - bool list_tests_; - String output_; - bool print_time_; - bool pretty_; - internal::Int32 random_seed_; - internal::Int32 repeat_; - bool shuffle_; - internal::Int32 stack_trace_depth_; - String stream_result_to_; - bool throw_on_failure_; -} GTEST_ATTRIBUTE_UNUSED_; - -// Converts a Unicode code point to a narrow string in UTF-8 encoding. -// code_point parameter is of type UInt32 because wchar_t may not be -// wide enough to contain a code point. -// The output buffer str must containt at least 32 characters. -// The function returns the address of the output buffer. -// If the code_point is not a valid Unicode code point -// (i.e. outside of Unicode range U+0 to U+10FFFF) it will be output -// as '(Invalid Unicode 0xXXXXXXXX)'. -GTEST_API_ char* CodePointToUtf8(UInt32 code_point, char* str); - -// Converts a wide string to a narrow string in UTF-8 encoding. -// The wide string is assumed to have the following encoding: -// UTF-16 if sizeof(wchar_t) == 2 (on Windows, Cygwin, Symbian OS) -// UTF-32 if sizeof(wchar_t) == 4 (on Linux) -// Parameter str points to a null-terminated wide string. -// Parameter num_chars may additionally limit the number -// of wchar_t characters processed. -1 is used when the entire string -// should be processed. -// If the string contains code points that are not valid Unicode code points -// (i.e. outside of Unicode range U+0 to U+10FFFF) they will be output -// as '(Invalid Unicode 0xXXXXXXXX)'. If the string is in UTF16 encoding -// and contains invalid UTF-16 surrogate pairs, values in those pairs -// will be encoded as individual Unicode characters from Basic Normal Plane. -GTEST_API_ String WideStringToUtf8(const wchar_t* str, int num_chars); - -// Reads the GTEST_SHARD_STATUS_FILE environment variable, and creates the file -// if the variable is present. If a file already exists at this location, this -// function will write over it. If the variable is present, but the file cannot -// be created, prints an error and exits. -void WriteToShardStatusFileIfNeeded(); - -// Checks whether sharding is enabled by examining the relevant -// environment variable values. If the variables are present, -// but inconsistent (e.g., shard_index >= total_shards), prints -// an error and exits. If in_subprocess_for_death_test, sharding is -// disabled because it must only be applied to the original test -// process. Otherwise, we could filter out death tests we intended to execute. -GTEST_API_ bool ShouldShard(const char* total_shards_str, - const char* shard_index_str, - bool in_subprocess_for_death_test); - -// Parses the environment variable var as an Int32. If it is unset, -// returns default_val. If it is not an Int32, prints an error and -// and aborts. -GTEST_API_ Int32 Int32FromEnvOrDie(const char* env_var, Int32 default_val); - -// Given the total number of shards, the shard index, and the test id, -// returns true iff the test should be run on this shard. The test id is -// some arbitrary but unique non-negative integer assigned to each test -// method. Assumes that 0 <= shard_index < total_shards. -GTEST_API_ bool ShouldRunTestOnShard( - int total_shards, int shard_index, int test_id); - -// STL container utilities. - -// Returns the number of elements in the given container that satisfy -// the given predicate. -template -inline int CountIf(const Container& c, Predicate predicate) { - // Implemented as an explicit loop since std::count_if() in libCstd on - // Solaris has a non-standard signature. - int count = 0; - for (typename Container::const_iterator it = c.begin(); it != c.end(); ++it) { - if (predicate(*it)) - ++count; - } - return count; -} - -// Applies a function/functor to each element in the container. -template -void ForEach(const Container& c, Functor functor) { - std::for_each(c.begin(), c.end(), functor); -} - -// Returns the i-th element of the vector, or default_value if i is not -// in range [0, v.size()). -template -inline E GetElementOr(const std::vector& v, int i, E default_value) { - return (i < 0 || i >= static_cast(v.size())) ? default_value : v[i]; -} - -// Performs an in-place shuffle of a range of the vector's elements. -// 'begin' and 'end' are element indices as an STL-style range; -// i.e. [begin, end) are shuffled, where 'end' == size() means to -// shuffle to the end of the vector. -template -void ShuffleRange(internal::Random* random, int begin, int end, - std::vector* v) { - const int size = static_cast(v->size()); - GTEST_CHECK_(0 <= begin && begin <= size) - << "Invalid shuffle range start " << begin << ": must be in range [0, " - << size << "]."; - GTEST_CHECK_(begin <= end && end <= size) - << "Invalid shuffle range finish " << end << ": must be in range [" - << begin << ", " << size << "]."; - - // Fisher-Yates shuffle, from - // http://en.wikipedia.org/wiki/Fisher-Yates_shuffle - for (int range_width = end - begin; range_width >= 2; range_width--) { - const int last_in_range = begin + range_width - 1; - const int selected = begin + random->Generate(range_width); - std::swap((*v)[selected], (*v)[last_in_range]); - } -} - -// Performs an in-place shuffle of the vector's elements. -template -inline void Shuffle(internal::Random* random, std::vector* v) { - ShuffleRange(random, 0, static_cast(v->size()), v); -} - -// A function for deleting an object. Handy for being used as a -// functor. -template -static void Delete(T* x) { - delete x; -} - -// A predicate that checks the key of a TestProperty against a known key. -// -// TestPropertyKeyIs is copyable. -class TestPropertyKeyIs { - public: - // Constructor. - // - // TestPropertyKeyIs has NO default constructor. - explicit TestPropertyKeyIs(const char* key) - : key_(key) {} - - // Returns true iff the test name of test property matches on key_. - bool operator()(const TestProperty& test_property) const { - return String(test_property.key()).Compare(key_) == 0; - } - - private: - String key_; -}; - -// Class UnitTestOptions. -// -// This class contains functions for processing options the user -// specifies when running the tests. It has only static members. -// -// In most cases, the user can specify an option using either an -// environment variable or a command line flag. E.g. you can set the -// test filter using either GTEST_FILTER or --gtest_filter. If both -// the variable and the flag are present, the latter overrides the -// former. -class GTEST_API_ UnitTestOptions { - public: - // Functions for processing the gtest_output flag. - - // Returns the output format, or "" for normal printed output. - static String GetOutputFormat(); - - // Returns the absolute path of the requested output file, or the - // default (test_detail.xml in the original working directory) if - // none was explicitly specified. - static String GetAbsolutePathToOutputFile(); - - // Functions for processing the gtest_filter flag. - - // Returns true iff the wildcard pattern matches the string. The - // first ':' or '\0' character in pattern marks the end of it. - // - // This recursive algorithm isn't very efficient, but is clear and - // works well enough for matching test names, which are short. - static bool PatternMatchesString(const char *pattern, const char *str); - - // Returns true iff the user-specified filter matches the test case - // name and the test name. - static bool FilterMatchesTest(const String &test_case_name, - const String &test_name); - -#if GTEST_OS_WINDOWS - // Function for supporting the gtest_catch_exception flag. - - // Returns EXCEPTION_EXECUTE_HANDLER if Google Test should handle the - // given SEH exception, or EXCEPTION_CONTINUE_SEARCH otherwise. - // This function is useful as an __except condition. - static int GTestShouldProcessSEH(DWORD exception_code); -#endif // GTEST_OS_WINDOWS - - // Returns true if "name" matches the ':' separated list of glob-style - // filters in "filter". - static bool MatchesFilter(const String& name, const char* filter); -}; - -// Returns the current application's name, removing directory path if that -// is present. Used by UnitTestOptions::GetOutputFile. -GTEST_API_ FilePath GetCurrentExecutableName(); - -// The role interface for getting the OS stack trace as a string. -class OsStackTraceGetterInterface { - public: - OsStackTraceGetterInterface() {} - virtual ~OsStackTraceGetterInterface() {} - - // Returns the current OS stack trace as a String. Parameters: - // - // max_depth - the maximum number of stack frames to be included - // in the trace. - // skip_count - the number of top frames to be skipped; doesn't count - // against max_depth. - virtual String CurrentStackTrace(int max_depth, int skip_count) = 0; - - // UponLeavingGTest() should be called immediately before Google Test calls - // user code. It saves some information about the current stack that - // CurrentStackTrace() will use to find and hide Google Test stack frames. - virtual void UponLeavingGTest() = 0; - - private: - GTEST_DISALLOW_COPY_AND_ASSIGN_(OsStackTraceGetterInterface); -}; - -// A working implementation of the OsStackTraceGetterInterface interface. -class OsStackTraceGetter : public OsStackTraceGetterInterface { - public: - OsStackTraceGetter() : caller_frame_(NULL) {} - virtual String CurrentStackTrace(int max_depth, int skip_count); - virtual void UponLeavingGTest(); - - // This string is inserted in place of stack frames that are part of - // Google Test's implementation. - static const char* const kElidedFramesMarker; - - private: - Mutex mutex_; // protects all internal state - - // We save the stack frame below the frame that calls user code. - // We do this because the address of the frame immediately below - // the user code changes between the call to UponLeavingGTest() - // and any calls to CurrentStackTrace() from within the user code. - void* caller_frame_; - - GTEST_DISALLOW_COPY_AND_ASSIGN_(OsStackTraceGetter); -}; - -// Information about a Google Test trace point. -struct TraceInfo { - const char* file; - int line; - String message; -}; - -// This is the default global test part result reporter used in UnitTestImpl. -// This class should only be used by UnitTestImpl. -class DefaultGlobalTestPartResultReporter - : public TestPartResultReporterInterface { - public: - explicit DefaultGlobalTestPartResultReporter(UnitTestImpl* unit_test); - // Implements the TestPartResultReporterInterface. Reports the test part - // result in the current test. - virtual void ReportTestPartResult(const TestPartResult& result); - - private: - UnitTestImpl* const unit_test_; - - GTEST_DISALLOW_COPY_AND_ASSIGN_(DefaultGlobalTestPartResultReporter); -}; - -// This is the default per thread test part result reporter used in -// UnitTestImpl. This class should only be used by UnitTestImpl. -class DefaultPerThreadTestPartResultReporter - : public TestPartResultReporterInterface { - public: - explicit DefaultPerThreadTestPartResultReporter(UnitTestImpl* unit_test); - // Implements the TestPartResultReporterInterface. The implementation just - // delegates to the current global test part result reporter of *unit_test_. - virtual void ReportTestPartResult(const TestPartResult& result); - - private: - UnitTestImpl* const unit_test_; - - GTEST_DISALLOW_COPY_AND_ASSIGN_(DefaultPerThreadTestPartResultReporter); -}; - -// The private implementation of the UnitTest class. We don't protect -// the methods under a mutex, as this class is not accessible by a -// user and the UnitTest class that delegates work to this class does -// proper locking. -class GTEST_API_ UnitTestImpl { - public: - explicit UnitTestImpl(UnitTest* parent); - virtual ~UnitTestImpl(); - - // There are two different ways to register your own TestPartResultReporter. - // You can register your own repoter to listen either only for test results - // from the current thread or for results from all threads. - // By default, each per-thread test result repoter just passes a new - // TestPartResult to the global test result reporter, which registers the - // test part result for the currently running test. - - // Returns the global test part result reporter. - TestPartResultReporterInterface* GetGlobalTestPartResultReporter(); - - // Sets the global test part result reporter. - void SetGlobalTestPartResultReporter( - TestPartResultReporterInterface* reporter); - - // Returns the test part result reporter for the current thread. - TestPartResultReporterInterface* GetTestPartResultReporterForCurrentThread(); - - // Sets the test part result reporter for the current thread. - void SetTestPartResultReporterForCurrentThread( - TestPartResultReporterInterface* reporter); - - // Gets the number of successful test cases. - int successful_test_case_count() const; - - // Gets the number of failed test cases. - int failed_test_case_count() const; - - // Gets the number of all test cases. - int total_test_case_count() const; - - // Gets the number of all test cases that contain at least one test - // that should run. - int test_case_to_run_count() const; - - // Gets the number of successful tests. - int successful_test_count() const; - - // Gets the number of failed tests. - int failed_test_count() const; - - // Gets the number of disabled tests. - int disabled_test_count() const; - - // Gets the number of all tests. - int total_test_count() const; - - // Gets the number of tests that should run. - int test_to_run_count() const; - - // Gets the elapsed time, in milliseconds. - TimeInMillis elapsed_time() const { return elapsed_time_; } - - // Returns true iff the unit test passed (i.e. all test cases passed). - bool Passed() const { return !Failed(); } - - // Returns true iff the unit test failed (i.e. some test case failed - // or something outside of all tests failed). - bool Failed() const { - return failed_test_case_count() > 0 || ad_hoc_test_result()->Failed(); - } - - // Gets the i-th test case among all the test cases. i can range from 0 to - // total_test_case_count() - 1. If i is not in that range, returns NULL. - const TestCase* GetTestCase(int i) const { - const int index = GetElementOr(test_case_indices_, i, -1); - return index < 0 ? NULL : test_cases_[i]; - } - - // Gets the i-th test case among all the test cases. i can range from 0 to - // total_test_case_count() - 1. If i is not in that range, returns NULL. - TestCase* GetMutableTestCase(int i) { - const int index = GetElementOr(test_case_indices_, i, -1); - return index < 0 ? NULL : test_cases_[index]; - } - - // Provides access to the event listener list. - TestEventListeners* listeners() { return &listeners_; } - - // Returns the TestResult for the test that's currently running, or - // the TestResult for the ad hoc test if no test is running. - TestResult* current_test_result(); - - // Returns the TestResult for the ad hoc test. - const TestResult* ad_hoc_test_result() const { return &ad_hoc_test_result_; } - - // Sets the OS stack trace getter. - // - // Does nothing if the input and the current OS stack trace getter - // are the same; otherwise, deletes the old getter and makes the - // input the current getter. - void set_os_stack_trace_getter(OsStackTraceGetterInterface* getter); - - // Returns the current OS stack trace getter if it is not NULL; - // otherwise, creates an OsStackTraceGetter, makes it the current - // getter, and returns it. - OsStackTraceGetterInterface* os_stack_trace_getter(); - - // Returns the current OS stack trace as a String. - // - // The maximum number of stack frames to be included is specified by - // the gtest_stack_trace_depth flag. The skip_count parameter - // specifies the number of top frames to be skipped, which doesn't - // count against the number of frames to be included. - // - // For example, if Foo() calls Bar(), which in turn calls - // CurrentOsStackTraceExceptTop(1), Foo() will be included in the - // trace but Bar() and CurrentOsStackTraceExceptTop() won't. - String CurrentOsStackTraceExceptTop(int skip_count); - - // Finds and returns a TestCase with the given name. If one doesn't - // exist, creates one and returns it. - // - // Arguments: - // - // test_case_name: name of the test case - // type_param: the name of the test's type parameter, or NULL if - // this is not a typed or a type-parameterized test. - // set_up_tc: pointer to the function that sets up the test case - // tear_down_tc: pointer to the function that tears down the test case - TestCase* GetTestCase(const char* test_case_name, - const char* type_param, - Test::SetUpTestCaseFunc set_up_tc, - Test::TearDownTestCaseFunc tear_down_tc); - - // Adds a TestInfo to the unit test. - // - // Arguments: - // - // set_up_tc: pointer to the function that sets up the test case - // tear_down_tc: pointer to the function that tears down the test case - // test_info: the TestInfo object - void AddTestInfo(Test::SetUpTestCaseFunc set_up_tc, - Test::TearDownTestCaseFunc tear_down_tc, - TestInfo* test_info) { - // In order to support thread-safe death tests, we need to - // remember the original working directory when the test program - // was first invoked. We cannot do this in RUN_ALL_TESTS(), as - // the user may have changed the current directory before calling - // RUN_ALL_TESTS(). Therefore we capture the current directory in - // AddTestInfo(), which is called to register a TEST or TEST_F - // before main() is reached. - if (original_working_dir_.IsEmpty()) { - original_working_dir_.Set(FilePath::GetCurrentDir()); - GTEST_CHECK_(!original_working_dir_.IsEmpty()) - << "Failed to get the current working directory."; - } - - GetTestCase(test_info->test_case_name(), - test_info->type_param(), - set_up_tc, - tear_down_tc)->AddTestInfo(test_info); - } - -#if GTEST_HAS_PARAM_TEST - // Returns ParameterizedTestCaseRegistry object used to keep track of - // value-parameterized tests and instantiate and register them. - internal::ParameterizedTestCaseRegistry& parameterized_test_registry() { - return parameterized_test_registry_; - } -#endif // GTEST_HAS_PARAM_TEST - - // Sets the TestCase object for the test that's currently running. - void set_current_test_case(TestCase* a_current_test_case) { - current_test_case_ = a_current_test_case; - } - - // Sets the TestInfo object for the test that's currently running. If - // current_test_info is NULL, the assertion results will be stored in - // ad_hoc_test_result_. - void set_current_test_info(TestInfo* a_current_test_info) { - current_test_info_ = a_current_test_info; - } - - // Registers all parameterized tests defined using TEST_P and - // INSTANTIATE_TEST_CASE_P, creating regular tests for each test/parameter - // combination. This method can be called more then once; it has guards - // protecting from registering the tests more then once. If - // value-parameterized tests are disabled, RegisterParameterizedTests is - // present but does nothing. - void RegisterParameterizedTests(); - - // Runs all tests in this UnitTest object, prints the result, and - // returns true if all tests are successful. If any exception is - // thrown during a test, this test is considered to be failed, but - // the rest of the tests will still be run. - bool RunAllTests(); - - // Clears the results of all tests, except the ad hoc tests. - void ClearNonAdHocTestResult() { - ForEach(test_cases_, TestCase::ClearTestCaseResult); - } - - // Clears the results of ad-hoc test assertions. - void ClearAdHocTestResult() { - ad_hoc_test_result_.Clear(); - } - - enum ReactionToSharding { - HONOR_SHARDING_PROTOCOL, - IGNORE_SHARDING_PROTOCOL - }; - - // Matches the full name of each test against the user-specified - // filter to decide whether the test should run, then records the - // result in each TestCase and TestInfo object. - // If shard_tests == HONOR_SHARDING_PROTOCOL, further filters tests - // based on sharding variables in the environment. - // Returns the number of tests that should run. - int FilterTests(ReactionToSharding shard_tests); - - // Prints the names of the tests matching the user-specified filter flag. - void ListTestsMatchingFilter(); - - const TestCase* current_test_case() const { return current_test_case_; } - TestInfo* current_test_info() { return current_test_info_; } - const TestInfo* current_test_info() const { return current_test_info_; } - - // Returns the vector of environments that need to be set-up/torn-down - // before/after the tests are run. - std::vector& environments() { return environments_; } - - // Getters for the per-thread Google Test trace stack. - std::vector& gtest_trace_stack() { - return *(gtest_trace_stack_.pointer()); - } - const std::vector& gtest_trace_stack() const { - return gtest_trace_stack_.get(); - } - -#if GTEST_HAS_DEATH_TEST - void InitDeathTestSubprocessControlInfo() { - internal_run_death_test_flag_.reset(ParseInternalRunDeathTestFlag()); - } - // Returns a pointer to the parsed --gtest_internal_run_death_test - // flag, or NULL if that flag was not specified. - // This information is useful only in a death test child process. - // Must not be called before a call to InitGoogleTest. - const InternalRunDeathTestFlag* internal_run_death_test_flag() const { - return internal_run_death_test_flag_.get(); - } - - // Returns a pointer to the current death test factory. - internal::DeathTestFactory* death_test_factory() { - return death_test_factory_.get(); - } - - void SuppressTestEventsIfInSubprocess(); - - friend class ReplaceDeathTestFactory; -#endif // GTEST_HAS_DEATH_TEST - - // Initializes the event listener performing XML output as specified by - // UnitTestOptions. Must not be called before InitGoogleTest. - void ConfigureXmlOutput(); - -#if GTEST_CAN_STREAM_RESULTS_ - // Initializes the event listener for streaming test results to a socket. - // Must not be called before InitGoogleTest. - void ConfigureStreamingOutput(); -#endif - - // Performs initialization dependent upon flag values obtained in - // ParseGoogleTestFlagsOnly. Is called from InitGoogleTest after the call to - // ParseGoogleTestFlagsOnly. In case a user neglects to call InitGoogleTest - // this function is also called from RunAllTests. Since this function can be - // called more than once, it has to be idempotent. - void PostFlagParsingInit(); - - // Gets the random seed used at the start of the current test iteration. - int random_seed() const { return random_seed_; } - - // Gets the random number generator. - internal::Random* random() { return &random_; } - - // Shuffles all test cases, and the tests within each test case, - // making sure that death tests are still run first. - void ShuffleTests(); - - // Restores the test cases and tests to their order before the first shuffle. - void UnshuffleTests(); - - // Returns the value of GTEST_FLAG(catch_exceptions) at the moment - // UnitTest::Run() starts. - bool catch_exceptions() const { return catch_exceptions_; } - - private: - friend class ::testing::UnitTest; - - // Used by UnitTest::Run() to capture the state of - // GTEST_FLAG(catch_exceptions) at the moment it starts. - void set_catch_exceptions(bool value) { catch_exceptions_ = value; } - - // The UnitTest object that owns this implementation object. - UnitTest* const parent_; - - // The working directory when the first TEST() or TEST_F() was - // executed. - internal::FilePath original_working_dir_; - - // The default test part result reporters. - DefaultGlobalTestPartResultReporter default_global_test_part_result_reporter_; - DefaultPerThreadTestPartResultReporter - default_per_thread_test_part_result_reporter_; - - // Points to (but doesn't own) the global test part result reporter. - TestPartResultReporterInterface* global_test_part_result_repoter_; - - // Protects read and write access to global_test_part_result_reporter_. - internal::Mutex global_test_part_result_reporter_mutex_; - - // Points to (but doesn't own) the per-thread test part result reporter. - internal::ThreadLocal - per_thread_test_part_result_reporter_; - - // The vector of environments that need to be set-up/torn-down - // before/after the tests are run. - std::vector environments_; - - // The vector of TestCases in their original order. It owns the - // elements in the vector. - std::vector test_cases_; - - // Provides a level of indirection for the test case list to allow - // easy shuffling and restoring the test case order. The i-th - // element of this vector is the index of the i-th test case in the - // shuffled order. - std::vector test_case_indices_; - -#if GTEST_HAS_PARAM_TEST - // ParameterizedTestRegistry object used to register value-parameterized - // tests. - internal::ParameterizedTestCaseRegistry parameterized_test_registry_; - - // Indicates whether RegisterParameterizedTests() has been called already. - bool parameterized_tests_registered_; -#endif // GTEST_HAS_PARAM_TEST - - // Index of the last death test case registered. Initially -1. - int last_death_test_case_; - - // This points to the TestCase for the currently running test. It - // changes as Google Test goes through one test case after another. - // When no test is running, this is set to NULL and Google Test - // stores assertion results in ad_hoc_test_result_. Initially NULL. - TestCase* current_test_case_; - - // This points to the TestInfo for the currently running test. It - // changes as Google Test goes through one test after another. When - // no test is running, this is set to NULL and Google Test stores - // assertion results in ad_hoc_test_result_. Initially NULL. - TestInfo* current_test_info_; - - // Normally, a user only writes assertions inside a TEST or TEST_F, - // or inside a function called by a TEST or TEST_F. Since Google - // Test keeps track of which test is current running, it can - // associate such an assertion with the test it belongs to. - // - // If an assertion is encountered when no TEST or TEST_F is running, - // Google Test attributes the assertion result to an imaginary "ad hoc" - // test, and records the result in ad_hoc_test_result_. - TestResult ad_hoc_test_result_; - - // The list of event listeners that can be used to track events inside - // Google Test. - TestEventListeners listeners_; - - // The OS stack trace getter. Will be deleted when the UnitTest - // object is destructed. By default, an OsStackTraceGetter is used, - // but the user can set this field to use a custom getter if that is - // desired. - OsStackTraceGetterInterface* os_stack_trace_getter_; - - // True iff PostFlagParsingInit() has been called. - bool post_flag_parse_init_performed_; - - // The random number seed used at the beginning of the test run. - int random_seed_; - - // Our random number generator. - internal::Random random_; - - // How long the test took to run, in milliseconds. - TimeInMillis elapsed_time_; - -#if GTEST_HAS_DEATH_TEST - // The decomposed components of the gtest_internal_run_death_test flag, - // parsed when RUN_ALL_TESTS is called. - internal::scoped_ptr internal_run_death_test_flag_; - internal::scoped_ptr death_test_factory_; -#endif // GTEST_HAS_DEATH_TEST - - // A per-thread stack of traces created by the SCOPED_TRACE() macro. - internal::ThreadLocal > gtest_trace_stack_; - - // The value of GTEST_FLAG(catch_exceptions) at the moment RunAllTests() - // starts. - bool catch_exceptions_; - - GTEST_DISALLOW_COPY_AND_ASSIGN_(UnitTestImpl); -}; // class UnitTestImpl - -// Convenience function for accessing the global UnitTest -// implementation object. -inline UnitTestImpl* GetUnitTestImpl() { - return UnitTest::GetInstance()->impl(); -} - -#if GTEST_USES_SIMPLE_RE - -// Internal helper functions for implementing the simple regular -// expression matcher. -GTEST_API_ bool IsInSet(char ch, const char* str); -GTEST_API_ bool IsAsciiDigit(char ch); -GTEST_API_ bool IsAsciiPunct(char ch); -GTEST_API_ bool IsRepeat(char ch); -GTEST_API_ bool IsAsciiWhiteSpace(char ch); -GTEST_API_ bool IsAsciiWordChar(char ch); -GTEST_API_ bool IsValidEscape(char ch); -GTEST_API_ bool AtomMatchesChar(bool escaped, char pattern, char ch); -GTEST_API_ bool ValidateRegex(const char* regex); -GTEST_API_ bool MatchRegexAtHead(const char* regex, const char* str); -GTEST_API_ bool MatchRepetitionAndRegexAtHead( - bool escaped, char ch, char repeat, const char* regex, const char* str); -GTEST_API_ bool MatchRegexAnywhere(const char* regex, const char* str); - -#endif // GTEST_USES_SIMPLE_RE - -// Parses the command line for Google Test flags, without initializing -// other parts of Google Test. -GTEST_API_ void ParseGoogleTestFlagsOnly(int* argc, char** argv); -GTEST_API_ void ParseGoogleTestFlagsOnly(int* argc, wchar_t** argv); - -#if GTEST_HAS_DEATH_TEST - -// Returns the message describing the last system error, regardless of the -// platform. -GTEST_API_ String GetLastErrnoDescription(); - -# if GTEST_OS_WINDOWS -// Provides leak-safe Windows kernel handle ownership. -class AutoHandle { - public: - AutoHandle() : handle_(INVALID_HANDLE_VALUE) {} - explicit AutoHandle(HANDLE handle) : handle_(handle) {} - - ~AutoHandle() { Reset(); } - - HANDLE Get() const { return handle_; } - void Reset() { Reset(INVALID_HANDLE_VALUE); } - void Reset(HANDLE handle) { - if (handle != handle_) { - if (handle_ != INVALID_HANDLE_VALUE) - ::CloseHandle(handle_); - handle_ = handle; - } - } - - private: - HANDLE handle_; - - GTEST_DISALLOW_COPY_AND_ASSIGN_(AutoHandle); -}; -# endif // GTEST_OS_WINDOWS - -// Attempts to parse a string into a positive integer pointed to by the -// number parameter. Returns true if that is possible. -// GTEST_HAS_DEATH_TEST implies that we have ::std::string, so we can use -// it here. -template -bool ParseNaturalNumber(const ::std::string& str, Integer* number) { - // Fail fast if the given string does not begin with a digit; - // this bypasses strtoXXX's "optional leading whitespace and plus - // or minus sign" semantics, which are undesirable here. - if (str.empty() || !IsDigit(str[0])) { - return false; - } - errno = 0; - - char* end; - // BiggestConvertible is the largest integer type that system-provided - // string-to-number conversion routines can return. - -# if GTEST_OS_WINDOWS && !defined(__GNUC__) - - // MSVC and C++ Builder define __int64 instead of the standard long long. - typedef unsigned __int64 BiggestConvertible; - const BiggestConvertible parsed = _strtoui64(str.c_str(), &end, 10); - -# else - - typedef unsigned long long BiggestConvertible; // NOLINT - const BiggestConvertible parsed = strtoull(str.c_str(), &end, 10); - -# endif // GTEST_OS_WINDOWS && !defined(__GNUC__) - - const bool parse_success = *end == '\0' && errno == 0; - - // TODO(vladl@google.com): Convert this to compile time assertion when it is - // available. - GTEST_CHECK_(sizeof(Integer) <= sizeof(parsed)); - - const Integer result = static_cast(parsed); - if (parse_success && static_cast(result) == parsed) { - *number = result; - return true; - } - return false; -} -#endif // GTEST_HAS_DEATH_TEST - -// TestResult contains some private methods that should be hidden from -// Google Test user but are required for testing. This class allow our tests -// to access them. -// -// This class is supplied only for the purpose of testing Google Test's own -// constructs. Do not use it in user tests, either directly or indirectly. -class TestResultAccessor { - public: - static void RecordProperty(TestResult* test_result, - const TestProperty& property) { - test_result->RecordProperty(property); - } - - static void ClearTestPartResults(TestResult* test_result) { - test_result->ClearTestPartResults(); - } - - static const std::vector& test_part_results( - const TestResult& test_result) { - return test_result.test_part_results(); - } -}; - -} // namespace internal -} // namespace testing - -#endif // GTEST_SRC_GTEST_INTERNAL_INL_H_ -#undef GTEST_IMPLEMENTATION_ - -#if GTEST_OS_WINDOWS -# define vsnprintf _vsnprintf -#endif // GTEST_OS_WINDOWS - -namespace testing { - -using internal::CountIf; -using internal::ForEach; -using internal::GetElementOr; -using internal::Shuffle; - -// Constants. - -// A test whose test case name or test name matches this filter is -// disabled and not run. -static const char kDisableTestFilter[] = "DISABLED_*:*/DISABLED_*"; - -// A test case whose name matches this filter is considered a death -// test case and will be run before test cases whose name doesn't -// match this filter. -static const char kDeathTestCaseFilter[] = "*DeathTest:*DeathTest/*"; - -// A test filter that matches everything. -static const char kUniversalFilter[] = "*"; - -// The default output file for XML output. -static const char kDefaultOutputFile[] = "test_detail.xml"; - -// The environment variable name for the test shard index. -static const char kTestShardIndex[] = "GTEST_SHARD_INDEX"; -// The environment variable name for the total number of test shards. -static const char kTestTotalShards[] = "GTEST_TOTAL_SHARDS"; -// The environment variable name for the test shard status file. -static const char kTestShardStatusFile[] = "GTEST_SHARD_STATUS_FILE"; - -namespace internal { - -// The text used in failure messages to indicate the start of the -// stack trace. -const char kStackTraceMarker[] = "\nStack trace:\n"; - -// g_help_flag is true iff the --help flag or an equivalent form is -// specified on the command line. -bool g_help_flag = false; - -} // namespace internal - -GTEST_DEFINE_bool_( - also_run_disabled_tests, - internal::BoolFromGTestEnv("also_run_disabled_tests", false), - "Run disabled tests too, in addition to the tests normally being run."); - -GTEST_DEFINE_bool_( - break_on_failure, - internal::BoolFromGTestEnv("break_on_failure", false), - "True iff a failed assertion should be a debugger break-point."); - -GTEST_DEFINE_bool_( - catch_exceptions, - internal::BoolFromGTestEnv("catch_exceptions", true), - "True iff " GTEST_NAME_ - " should catch exceptions and treat them as test failures."); - -GTEST_DEFINE_string_( - color, - internal::StringFromGTestEnv("color", "auto"), - "Whether to use colors in the output. Valid values: yes, no, " - "and auto. 'auto' means to use colors if the output is " - "being sent to a terminal and the TERM environment variable " - "is set to xterm, xterm-color, xterm-256color, linux or cygwin."); - -GTEST_DEFINE_string_( - filter, - internal::StringFromGTestEnv("filter", kUniversalFilter), - "A colon-separated list of glob (not regex) patterns " - "for filtering the tests to run, optionally followed by a " - "'-' and a : separated list of negative patterns (tests to " - "exclude). A test is run if it matches one of the positive " - "patterns and does not match any of the negative patterns."); - -GTEST_DEFINE_bool_(list_tests, false, - "List all tests without running them."); - -GTEST_DEFINE_string_( - output, - internal::StringFromGTestEnv("output", ""), - "A format (currently must be \"xml\"), optionally followed " - "by a colon and an output file name or directory. A directory " - "is indicated by a trailing pathname separator. " - "Examples: \"xml:filename.xml\", \"xml::directoryname/\". " - "If a directory is specified, output files will be created " - "within that directory, with file-names based on the test " - "executable's name and, if necessary, made unique by adding " - "digits."); - -GTEST_DEFINE_bool_( - print_time, - internal::BoolFromGTestEnv("print_time", true), - "True iff " GTEST_NAME_ - " should display elapsed time in text output."); - -GTEST_DEFINE_int32_( - random_seed, - internal::Int32FromGTestEnv("random_seed", 0), - "Random number seed to use when shuffling test orders. Must be in range " - "[1, 99999], or 0 to use a seed based on the current time."); - -GTEST_DEFINE_int32_( - repeat, - internal::Int32FromGTestEnv("repeat", 1), - "How many times to repeat each test. Specify a negative number " - "for repeating forever. Useful for shaking out flaky tests."); - -GTEST_DEFINE_bool_( - show_internal_stack_frames, false, - "True iff " GTEST_NAME_ " should include internal stack frames when " - "printing test failure stack traces."); - -GTEST_DEFINE_bool_( - shuffle, - internal::BoolFromGTestEnv("shuffle", false), - "True iff " GTEST_NAME_ - " should randomize tests' order on every run."); - -GTEST_DEFINE_int32_( - stack_trace_depth, - internal::Int32FromGTestEnv("stack_trace_depth", kMaxStackTraceDepth), - "The maximum number of stack frames to print when an " - "assertion fails. The valid range is 0 through 100, inclusive."); - -GTEST_DEFINE_string_( - stream_result_to, - internal::StringFromGTestEnv("stream_result_to", ""), - "This flag specifies the host name and the port number on which to stream " - "test results. Example: \"localhost:555\". The flag is effective only on " - "Linux."); - -GTEST_DEFINE_bool_( - throw_on_failure, - internal::BoolFromGTestEnv("throw_on_failure", false), - "When this flag is specified, a failed assertion will throw an exception " - "if exceptions are enabled or exit the program with a non-zero code " - "otherwise."); - -namespace internal { - -// Generates a random number from [0, range), using a Linear -// Congruential Generator (LCG). Crashes if 'range' is 0 or greater -// than kMaxRange. -UInt32 Random::Generate(UInt32 range) { - // These constants are the same as are used in glibc's rand(3). - state_ = (1103515245U*state_ + 12345U) % kMaxRange; - - GTEST_CHECK_(range > 0) - << "Cannot generate a number in the range [0, 0)."; - GTEST_CHECK_(range <= kMaxRange) - << "Generation of a number in [0, " << range << ") was requested, " - << "but this can only generate numbers in [0, " << kMaxRange << ")."; - - // Converting via modulus introduces a bit of downward bias, but - // it's simple, and a linear congruential generator isn't too good - // to begin with. - return state_ % range; -} - -// GTestIsInitialized() returns true iff the user has initialized -// Google Test. Useful for catching the user mistake of not initializing -// Google Test before calling RUN_ALL_TESTS(). -// -// A user must call testing::InitGoogleTest() to initialize Google -// Test. g_init_gtest_count is set to the number of times -// InitGoogleTest() has been called. We don't protect this variable -// under a mutex as it is only accessed in the main thread. -int g_init_gtest_count = 0; -static bool GTestIsInitialized() { return g_init_gtest_count != 0; } - -// Iterates over a vector of TestCases, keeping a running sum of the -// results of calling a given int-returning method on each. -// Returns the sum. -static int SumOverTestCaseList(const std::vector& case_list, - int (TestCase::*method)() const) { - int sum = 0; - for (size_t i = 0; i < case_list.size(); i++) { - sum += (case_list[i]->*method)(); - } - return sum; -} - -// Returns true iff the test case passed. -static bool TestCasePassed(const TestCase* test_case) { - return test_case->should_run() && test_case->Passed(); -} - -// Returns true iff the test case failed. -static bool TestCaseFailed(const TestCase* test_case) { - return test_case->should_run() && test_case->Failed(); -} - -// Returns true iff test_case contains at least one test that should -// run. -static bool ShouldRunTestCase(const TestCase* test_case) { - return test_case->should_run(); -} - -// AssertHelper constructor. -AssertHelper::AssertHelper(TestPartResult::Type type, - const char* file, - int line, - const char* message) - : data_(new AssertHelperData(type, file, line, message)) { -} - -AssertHelper::~AssertHelper() { - delete data_; -} - -// Message assignment, for assertion streaming support. -void AssertHelper::operator=(const Message& message) const { - UnitTest::GetInstance()-> - AddTestPartResult(data_->type, data_->file, data_->line, - AppendUserMessage(data_->message, message), - UnitTest::GetInstance()->impl() - ->CurrentOsStackTraceExceptTop(1) - // Skips the stack frame for this function itself. - ); // NOLINT -} - -// Mutex for linked pointers. -GTEST_DEFINE_STATIC_MUTEX_(g_linked_ptr_mutex); - -// Application pathname gotten in InitGoogleTest. -String g_executable_path; - -// Returns the current application's name, removing directory path if that -// is present. -FilePath GetCurrentExecutableName() { - FilePath result; - -#if GTEST_OS_WINDOWS - result.Set(FilePath(g_executable_path).RemoveExtension("exe")); -#else - result.Set(FilePath(g_executable_path)); -#endif // GTEST_OS_WINDOWS - - return result.RemoveDirectoryName(); -} - -// Functions for processing the gtest_output flag. - -// Returns the output format, or "" for normal printed output. -String UnitTestOptions::GetOutputFormat() { - const char* const gtest_output_flag = GTEST_FLAG(output).c_str(); - if (gtest_output_flag == NULL) return String(""); - - const char* const colon = strchr(gtest_output_flag, ':'); - return (colon == NULL) ? - String(gtest_output_flag) : - String(gtest_output_flag, colon - gtest_output_flag); -} - -// Returns the name of the requested output file, or the default if none -// was explicitly specified. -String UnitTestOptions::GetAbsolutePathToOutputFile() { - const char* const gtest_output_flag = GTEST_FLAG(output).c_str(); - if (gtest_output_flag == NULL) - return String(""); - - const char* const colon = strchr(gtest_output_flag, ':'); - if (colon == NULL) - return String(internal::FilePath::ConcatPaths( - internal::FilePath( - UnitTest::GetInstance()->original_working_dir()), - internal::FilePath(kDefaultOutputFile)).ToString() ); - - internal::FilePath output_name(colon + 1); - if (!output_name.IsAbsolutePath()) - // TODO(wan@google.com): on Windows \some\path is not an absolute - // path (as its meaning depends on the current drive), yet the - // following logic for turning it into an absolute path is wrong. - // Fix it. - output_name = internal::FilePath::ConcatPaths( - internal::FilePath(UnitTest::GetInstance()->original_working_dir()), - internal::FilePath(colon + 1)); - - if (!output_name.IsDirectory()) - return output_name.ToString(); - - internal::FilePath result(internal::FilePath::GenerateUniqueFileName( - output_name, internal::GetCurrentExecutableName(), - GetOutputFormat().c_str())); - return result.ToString(); -} - -// Returns true iff the wildcard pattern matches the string. The -// first ':' or '\0' character in pattern marks the end of it. -// -// This recursive algorithm isn't very efficient, but is clear and -// works well enough for matching test names, which are short. -bool UnitTestOptions::PatternMatchesString(const char *pattern, - const char *str) { - switch (*pattern) { - case '\0': - case ':': // Either ':' or '\0' marks the end of the pattern. - return *str == '\0'; - case '?': // Matches any single character. - return *str != '\0' && PatternMatchesString(pattern + 1, str + 1); - case '*': // Matches any string (possibly empty) of characters. - return (*str != '\0' && PatternMatchesString(pattern, str + 1)) || - PatternMatchesString(pattern + 1, str); - default: // Non-special character. Matches itself. - return *pattern == *str && - PatternMatchesString(pattern + 1, str + 1); - } -} - -bool UnitTestOptions::MatchesFilter(const String& name, const char* filter) { - const char *cur_pattern = filter; - for (;;) { - if (PatternMatchesString(cur_pattern, name.c_str())) { - return true; - } - - // Finds the next pattern in the filter. - cur_pattern = strchr(cur_pattern, ':'); - - // Returns if no more pattern can be found. - if (cur_pattern == NULL) { - return false; - } - - // Skips the pattern separater (the ':' character). - cur_pattern++; - } -} - -// TODO(keithray): move String function implementations to gtest-string.cc. - -// Returns true iff the user-specified filter matches the test case -// name and the test name. -bool UnitTestOptions::FilterMatchesTest(const String &test_case_name, - const String &test_name) { - const String& full_name = String::Format("%s.%s", - test_case_name.c_str(), - test_name.c_str()); - - // Split --gtest_filter at '-', if there is one, to separate into - // positive filter and negative filter portions - const char* const p = GTEST_FLAG(filter).c_str(); - const char* const dash = strchr(p, '-'); - String positive; - String negative; - if (dash == NULL) { - positive = GTEST_FLAG(filter).c_str(); // Whole string is a positive filter - negative = String(""); - } else { - positive = String(p, dash - p); // Everything up to the dash - negative = String(dash+1); // Everything after the dash - if (positive.empty()) { - // Treat '-test1' as the same as '*-test1' - positive = kUniversalFilter; - } - } - - // A filter is a colon-separated list of patterns. It matches a - // test if any pattern in it matches the test. - return (MatchesFilter(full_name, positive.c_str()) && - !MatchesFilter(full_name, negative.c_str())); -} - -#if GTEST_HAS_SEH -// Returns EXCEPTION_EXECUTE_HANDLER if Google Test should handle the -// given SEH exception, or EXCEPTION_CONTINUE_SEARCH otherwise. -// This function is useful as an __except condition. -int UnitTestOptions::GTestShouldProcessSEH(DWORD exception_code) { - // Google Test should handle a SEH exception if: - // 1. the user wants it to, AND - // 2. this is not a breakpoint exception, AND - // 3. this is not a C++ exception (VC++ implements them via SEH, - // apparently). - // - // SEH exception code for C++ exceptions. - // (see http://support.microsoft.com/kb/185294 for more information). - const DWORD kCxxExceptionCode = 0xe06d7363; - - bool should_handle = true; - - if (!GTEST_FLAG(catch_exceptions)) - should_handle = false; - else if (exception_code == EXCEPTION_BREAKPOINT) - should_handle = false; - else if (exception_code == kCxxExceptionCode) - should_handle = false; - - return should_handle ? EXCEPTION_EXECUTE_HANDLER : EXCEPTION_CONTINUE_SEARCH; -} -#endif // GTEST_HAS_SEH - -} // namespace internal - -// The c'tor sets this object as the test part result reporter used by -// Google Test. The 'result' parameter specifies where to report the -// results. Intercepts only failures from the current thread. -ScopedFakeTestPartResultReporter::ScopedFakeTestPartResultReporter( - TestPartResultArray* result) - : intercept_mode_(INTERCEPT_ONLY_CURRENT_THREAD), - result_(result) { - Init(); -} - -// The c'tor sets this object as the test part result reporter used by -// Google Test. The 'result' parameter specifies where to report the -// results. -ScopedFakeTestPartResultReporter::ScopedFakeTestPartResultReporter( - InterceptMode intercept_mode, TestPartResultArray* result) - : intercept_mode_(intercept_mode), - result_(result) { - Init(); -} - -void ScopedFakeTestPartResultReporter::Init() { - internal::UnitTestImpl* const impl = internal::GetUnitTestImpl(); - if (intercept_mode_ == INTERCEPT_ALL_THREADS) { - old_reporter_ = impl->GetGlobalTestPartResultReporter(); - impl->SetGlobalTestPartResultReporter(this); - } else { - old_reporter_ = impl->GetTestPartResultReporterForCurrentThread(); - impl->SetTestPartResultReporterForCurrentThread(this); - } -} - -// The d'tor restores the test part result reporter used by Google Test -// before. -ScopedFakeTestPartResultReporter::~ScopedFakeTestPartResultReporter() { - internal::UnitTestImpl* const impl = internal::GetUnitTestImpl(); - if (intercept_mode_ == INTERCEPT_ALL_THREADS) { - impl->SetGlobalTestPartResultReporter(old_reporter_); - } else { - impl->SetTestPartResultReporterForCurrentThread(old_reporter_); - } -} - -// Increments the test part result count and remembers the result. -// This method is from the TestPartResultReporterInterface interface. -void ScopedFakeTestPartResultReporter::ReportTestPartResult( - const TestPartResult& result) { - result_->Append(result); -} - -namespace internal { - -// Returns the type ID of ::testing::Test. We should always call this -// instead of GetTypeId< ::testing::Test>() to get the type ID of -// testing::Test. This is to work around a suspected linker bug when -// using Google Test as a framework on Mac OS X. The bug causes -// GetTypeId< ::testing::Test>() to return different values depending -// on whether the call is from the Google Test framework itself or -// from user test code. GetTestTypeId() is guaranteed to always -// return the same value, as it always calls GetTypeId<>() from the -// gtest.cc, which is within the Google Test framework. -TypeId GetTestTypeId() { - return GetTypeId(); -} - -// The value of GetTestTypeId() as seen from within the Google Test -// library. This is solely for testing GetTestTypeId(). -extern const TypeId kTestTypeIdInGoogleTest = GetTestTypeId(); - -// This predicate-formatter checks that 'results' contains a test part -// failure of the given type and that the failure message contains the -// given substring. -AssertionResult HasOneFailure(const char* /* results_expr */, - const char* /* type_expr */, - const char* /* substr_expr */, - const TestPartResultArray& results, - TestPartResult::Type type, - const string& substr) { - const String expected(type == TestPartResult::kFatalFailure ? - "1 fatal failure" : - "1 non-fatal failure"); - Message msg; - if (results.size() != 1) { - msg << "Expected: " << expected << "\n" - << " Actual: " << results.size() << " failures"; - for (int i = 0; i < results.size(); i++) { - msg << "\n" << results.GetTestPartResult(i); - } - return AssertionFailure() << msg; - } - - const TestPartResult& r = results.GetTestPartResult(0); - if (r.type() != type) { - return AssertionFailure() << "Expected: " << expected << "\n" - << " Actual:\n" - << r; - } - - if (strstr(r.message(), substr.c_str()) == NULL) { - return AssertionFailure() << "Expected: " << expected << " containing \"" - << substr << "\"\n" - << " Actual:\n" - << r; - } - - return AssertionSuccess(); -} - -// The constructor of SingleFailureChecker remembers where to look up -// test part results, what type of failure we expect, and what -// substring the failure message should contain. -SingleFailureChecker:: SingleFailureChecker( - const TestPartResultArray* results, - TestPartResult::Type type, - const string& substr) - : results_(results), - type_(type), - substr_(substr) {} - -// The destructor of SingleFailureChecker verifies that the given -// TestPartResultArray contains exactly one failure that has the given -// type and contains the given substring. If that's not the case, a -// non-fatal failure will be generated. -SingleFailureChecker::~SingleFailureChecker() { - EXPECT_PRED_FORMAT3(HasOneFailure, *results_, type_, substr_); -} - -DefaultGlobalTestPartResultReporter::DefaultGlobalTestPartResultReporter( - UnitTestImpl* unit_test) : unit_test_(unit_test) {} - -void DefaultGlobalTestPartResultReporter::ReportTestPartResult( - const TestPartResult& result) { - unit_test_->current_test_result()->AddTestPartResult(result); - unit_test_->listeners()->repeater()->OnTestPartResult(result); -} - -DefaultPerThreadTestPartResultReporter::DefaultPerThreadTestPartResultReporter( - UnitTestImpl* unit_test) : unit_test_(unit_test) {} - -void DefaultPerThreadTestPartResultReporter::ReportTestPartResult( - const TestPartResult& result) { - unit_test_->GetGlobalTestPartResultReporter()->ReportTestPartResult(result); -} - -// Returns the global test part result reporter. -TestPartResultReporterInterface* -UnitTestImpl::GetGlobalTestPartResultReporter() { - internal::MutexLock lock(&global_test_part_result_reporter_mutex_); - return global_test_part_result_repoter_; -} - -// Sets the global test part result reporter. -void UnitTestImpl::SetGlobalTestPartResultReporter( - TestPartResultReporterInterface* reporter) { - internal::MutexLock lock(&global_test_part_result_reporter_mutex_); - global_test_part_result_repoter_ = reporter; -} - -// Returns the test part result reporter for the current thread. -TestPartResultReporterInterface* -UnitTestImpl::GetTestPartResultReporterForCurrentThread() { - return per_thread_test_part_result_reporter_.get(); -} - -// Sets the test part result reporter for the current thread. -void UnitTestImpl::SetTestPartResultReporterForCurrentThread( - TestPartResultReporterInterface* reporter) { - per_thread_test_part_result_reporter_.set(reporter); -} - -// Gets the number of successful test cases. -int UnitTestImpl::successful_test_case_count() const { - return CountIf(test_cases_, TestCasePassed); -} - -// Gets the number of failed test cases. -int UnitTestImpl::failed_test_case_count() const { - return CountIf(test_cases_, TestCaseFailed); -} - -// Gets the number of all test cases. -int UnitTestImpl::total_test_case_count() const { - return static_cast(test_cases_.size()); -} - -// Gets the number of all test cases that contain at least one test -// that should run. -int UnitTestImpl::test_case_to_run_count() const { - return CountIf(test_cases_, ShouldRunTestCase); -} - -// Gets the number of successful tests. -int UnitTestImpl::successful_test_count() const { - return SumOverTestCaseList(test_cases_, &TestCase::successful_test_count); -} - -// Gets the number of failed tests. -int UnitTestImpl::failed_test_count() const { - return SumOverTestCaseList(test_cases_, &TestCase::failed_test_count); -} - -// Gets the number of disabled tests. -int UnitTestImpl::disabled_test_count() const { - return SumOverTestCaseList(test_cases_, &TestCase::disabled_test_count); -} - -// Gets the number of all tests. -int UnitTestImpl::total_test_count() const { - return SumOverTestCaseList(test_cases_, &TestCase::total_test_count); -} - -// Gets the number of tests that should run. -int UnitTestImpl::test_to_run_count() const { - return SumOverTestCaseList(test_cases_, &TestCase::test_to_run_count); -} - -// Returns the current OS stack trace as a String. -// -// The maximum number of stack frames to be included is specified by -// the gtest_stack_trace_depth flag. The skip_count parameter -// specifies the number of top frames to be skipped, which doesn't -// count against the number of frames to be included. -// -// For example, if Foo() calls Bar(), which in turn calls -// CurrentOsStackTraceExceptTop(1), Foo() will be included in the -// trace but Bar() and CurrentOsStackTraceExceptTop() won't. -String UnitTestImpl::CurrentOsStackTraceExceptTop(int skip_count) { - (void)skip_count; - return String(""); -} - -// Returns the current time in milliseconds. -TimeInMillis GetTimeInMillis() { -#if GTEST_OS_WINDOWS_MOBILE || defined(__BORLANDC__) - // Difference between 1970-01-01 and 1601-01-01 in milliseconds. - // http://analogous.blogspot.com/2005/04/epoch.html - const TimeInMillis kJavaEpochToWinFileTimeDelta = - static_cast(116444736UL) * 100000UL; - const DWORD kTenthMicrosInMilliSecond = 10000; - - SYSTEMTIME now_systime; - FILETIME now_filetime; - ULARGE_INTEGER now_int64; - // TODO(kenton@google.com): Shouldn't this just use - // GetSystemTimeAsFileTime()? - GetSystemTime(&now_systime); - if (SystemTimeToFileTime(&now_systime, &now_filetime)) { - now_int64.LowPart = now_filetime.dwLowDateTime; - now_int64.HighPart = now_filetime.dwHighDateTime; - now_int64.QuadPart = (now_int64.QuadPart / kTenthMicrosInMilliSecond) - - kJavaEpochToWinFileTimeDelta; - return now_int64.QuadPart; - } - return 0; -#elif GTEST_OS_WINDOWS && !GTEST_HAS_GETTIMEOFDAY_ - __timeb64 now; - -# ifdef _MSC_VER - - // MSVC 8 deprecates _ftime64(), so we want to suppress warning 4996 - // (deprecated function) there. - // TODO(kenton@google.com): Use GetTickCount()? Or use - // SystemTimeToFileTime() -# pragma warning(push) // Saves the current warning state. -# pragma warning(disable:4996) // Temporarily disables warning 4996. - _ftime64(&now); -# pragma warning(pop) // Restores the warning state. -# else - - _ftime64(&now); - -# endif // _MSC_VER - - return static_cast(now.time) * 1000 + now.millitm; -#elif GTEST_HAS_GETTIMEOFDAY_ - struct timeval now; - gettimeofday(&now, NULL); - return static_cast(now.tv_sec) * 1000 + now.tv_usec / 1000; -#else -# error "Don't know how to get the current time on your system." -#endif -} - -// Utilities - -// class String - -// Returns the input enclosed in double quotes if it's not NULL; -// otherwise returns "(null)". For example, "\"Hello\"" is returned -// for input "Hello". -// -// This is useful for printing a C string in the syntax of a literal. -// -// Known issue: escape sequences are not handled yet. -String String::ShowCStringQuoted(const char* c_str) { - return c_str ? String::Format("\"%s\"", c_str) : String("(null)"); -} - -// Copies at most length characters from str into a newly-allocated -// piece of memory of size length+1. The memory is allocated with new[]. -// A terminating null byte is written to the memory, and a pointer to it -// is returned. If str is NULL, NULL is returned. -static char* CloneString(const char* str, size_t length) { - if (str == NULL) { - return NULL; - } else { - char* const clone = new char[length + 1]; - posix::StrNCpy(clone, str, length); - clone[length] = '\0'; - return clone; - } -} - -// Clones a 0-terminated C string, allocating memory using new. The -// caller is responsible for deleting[] the return value. Returns the -// cloned string, or NULL if the input is NULL. -const char * String::CloneCString(const char* c_str) { - return (c_str == NULL) ? - NULL : CloneString(c_str, strlen(c_str)); -} - -#if GTEST_OS_WINDOWS_MOBILE -// Creates a UTF-16 wide string from the given ANSI string, allocating -// memory using new. The caller is responsible for deleting the return -// value using delete[]. Returns the wide string, or NULL if the -// input is NULL. -LPCWSTR String::AnsiToUtf16(const char* ansi) { - if (!ansi) return NULL; - const int length = strlen(ansi); - const int unicode_length = - MultiByteToWideChar(CP_ACP, 0, ansi, length, - NULL, 0); - WCHAR* unicode = new WCHAR[unicode_length + 1]; - MultiByteToWideChar(CP_ACP, 0, ansi, length, - unicode, unicode_length); - unicode[unicode_length] = 0; - return unicode; -} - -// Creates an ANSI string from the given wide string, allocating -// memory using new. The caller is responsible for deleting the return -// value using delete[]. Returns the ANSI string, or NULL if the -// input is NULL. -const char* String::Utf16ToAnsi(LPCWSTR utf16_str) { - if (!utf16_str) return NULL; - const int ansi_length = - WideCharToMultiByte(CP_ACP, 0, utf16_str, -1, - NULL, 0, NULL, NULL); - char* ansi = new char[ansi_length + 1]; - WideCharToMultiByte(CP_ACP, 0, utf16_str, -1, - ansi, ansi_length, NULL, NULL); - ansi[ansi_length] = 0; - return ansi; -} - -#endif // GTEST_OS_WINDOWS_MOBILE - -// Compares two C strings. Returns true iff they have the same content. -// -// Unlike strcmp(), this function can handle NULL argument(s). A NULL -// C string is considered different to any non-NULL C string, -// including the empty string. -bool String::CStringEquals(const char * lhs, const char * rhs) { - if ( lhs == NULL ) return rhs == NULL; - - if ( rhs == NULL ) return false; - - return strcmp(lhs, rhs) == 0; -} - -#if GTEST_HAS_STD_WSTRING || GTEST_HAS_GLOBAL_WSTRING - -// Converts an array of wide chars to a narrow string using the UTF-8 -// encoding, and streams the result to the given Message object. -static void StreamWideCharsToMessage(const wchar_t* wstr, size_t length, - Message* msg) { - // TODO(wan): consider allowing a testing::String object to - // contain '\0'. This will make it behave more like std::string, - // and will allow ToUtf8String() to return the correct encoding - // for '\0' s.t. we can get rid of the conditional here (and in - // several other places). - for (size_t i = 0; i != length; ) { // NOLINT - if (wstr[i] != L'\0') { - *msg << WideStringToUtf8(wstr + i, static_cast(length - i)); - while (i != length && wstr[i] != L'\0') - i++; - } else { - *msg << '\0'; - i++; - } - } -} - -#endif // GTEST_HAS_STD_WSTRING || GTEST_HAS_GLOBAL_WSTRING - -} // namespace internal - -#if GTEST_HAS_STD_WSTRING -// Converts the given wide string to a narrow string using the UTF-8 -// encoding, and streams the result to this Message object. -Message& Message::operator <<(const ::std::wstring& wstr) { - internal::StreamWideCharsToMessage(wstr.c_str(), wstr.length(), this); - return *this; -} -#endif // GTEST_HAS_STD_WSTRING - -#if GTEST_HAS_GLOBAL_WSTRING -// Converts the given wide string to a narrow string using the UTF-8 -// encoding, and streams the result to this Message object. -Message& Message::operator <<(const ::wstring& wstr) { - internal::StreamWideCharsToMessage(wstr.c_str(), wstr.length(), this); - return *this; -} -#endif // GTEST_HAS_GLOBAL_WSTRING - -// AssertionResult constructors. -// Used in EXPECT_TRUE/FALSE(assertion_result). -AssertionResult::AssertionResult(const AssertionResult& other) - : success_(other.success_), - message_(other.message_.get() != NULL ? - new ::std::string(*other.message_) : - static_cast< ::std::string*>(NULL)) { -} - -// Returns the assertion's negation. Used with EXPECT/ASSERT_FALSE. -AssertionResult AssertionResult::operator!() const { - AssertionResult negation(!success_); - if (message_.get() != NULL) - negation << *message_; - return negation; -} - -// Makes a successful assertion result. -AssertionResult AssertionSuccess() { - return AssertionResult(true); -} - -// Makes a failed assertion result. -AssertionResult AssertionFailure() { - return AssertionResult(false); -} - -// Makes a failed assertion result with the given failure message. -// Deprecated; use AssertionFailure() << message. -AssertionResult AssertionFailure(const Message& message) { - return AssertionFailure() << message; -} - -namespace internal { - -// Constructs and returns the message for an equality assertion -// (e.g. ASSERT_EQ, EXPECT_STREQ, etc) failure. -// -// The first four parameters are the expressions used in the assertion -// and their values, as strings. For example, for ASSERT_EQ(foo, bar) -// where foo is 5 and bar is 6, we have: -// -// expected_expression: "foo" -// actual_expression: "bar" -// expected_value: "5" -// actual_value: "6" -// -// The ignoring_case parameter is true iff the assertion is a -// *_STRCASEEQ*. When it's true, the string " (ignoring case)" will -// be inserted into the message. -AssertionResult EqFailure(const char* expected_expression, - const char* actual_expression, - const String& expected_value, - const String& actual_value, - bool ignoring_case) { - Message msg; - msg << "Value of: " << actual_expression; - if (actual_value != actual_expression) { - msg << "\n Actual: " << actual_value; - } - - msg << "\nExpected: " << expected_expression; - if (ignoring_case) { - msg << " (ignoring case)"; - } - if (expected_value != expected_expression) { - msg << "\nWhich is: " << expected_value; - } - - return AssertionFailure() << msg; -} - -// Constructs a failure message for Boolean assertions such as EXPECT_TRUE. -String GetBoolAssertionFailureMessage(const AssertionResult& assertion_result, - const char* expression_text, - const char* actual_predicate_value, - const char* expected_predicate_value) { - const char* actual_message = assertion_result.message(); - Message msg; - msg << "Value of: " << expression_text - << "\n Actual: " << actual_predicate_value; - if (actual_message[0] != '\0') - msg << " (" << actual_message << ")"; - msg << "\nExpected: " << expected_predicate_value; - return msg.GetString(); -} - -// Helper function for implementing ASSERT_NEAR. -AssertionResult DoubleNearPredFormat(const char* expr1, - const char* expr2, - const char* abs_error_expr, - double val1, - double val2, - double abs_error) { - const double diff = fabs(val1 - val2); - if (diff <= abs_error) return AssertionSuccess(); - - // TODO(wan): do not print the value of an expression if it's - // already a literal. - return AssertionFailure() - << "The difference between " << expr1 << " and " << expr2 - << " is " << diff << ", which exceeds " << abs_error_expr << ", where\n" - << expr1 << " evaluates to " << val1 << ",\n" - << expr2 << " evaluates to " << val2 << ", and\n" - << abs_error_expr << " evaluates to " << abs_error << "."; -} - - -// Helper template for implementing FloatLE() and DoubleLE(). -template -AssertionResult FloatingPointLE(const char* expr1, - const char* expr2, - RawType val1, - RawType val2) { - // Returns success if val1 is less than val2, - if (val1 < val2) { - return AssertionSuccess(); - } - - // or if val1 is almost equal to val2. - const FloatingPoint lhs(val1), rhs(val2); - if (lhs.AlmostEquals(rhs)) { - return AssertionSuccess(); - } - - // Note that the above two checks will both fail if either val1 or - // val2 is NaN, as the IEEE floating-point standard requires that - // any predicate involving a NaN must return false. - - ::std::stringstream val1_ss; - val1_ss << std::setprecision(std::numeric_limits::digits10 + 2) - << val1; - - ::std::stringstream val2_ss; - val2_ss << std::setprecision(std::numeric_limits::digits10 + 2) - << val2; - - return AssertionFailure() - << "Expected: (" << expr1 << ") <= (" << expr2 << ")\n" - << " Actual: " << StringStreamToString(&val1_ss) << " vs " - << StringStreamToString(&val2_ss); -} - -} // namespace internal - -// Asserts that val1 is less than, or almost equal to, val2. Fails -// otherwise. In particular, it fails if either val1 or val2 is NaN. -AssertionResult FloatLE(const char* expr1, const char* expr2, - float val1, float val2) { - return internal::FloatingPointLE(expr1, expr2, val1, val2); -} - -// Asserts that val1 is less than, or almost equal to, val2. Fails -// otherwise. In particular, it fails if either val1 or val2 is NaN. -AssertionResult DoubleLE(const char* expr1, const char* expr2, - double val1, double val2) { - return internal::FloatingPointLE(expr1, expr2, val1, val2); -} - -namespace internal { - -// The helper function for {ASSERT|EXPECT}_EQ with int or enum -// arguments. -AssertionResult CmpHelperEQ(const char* expected_expression, - const char* actual_expression, - BiggestInt expected, - BiggestInt actual) { - if (expected == actual) { - return AssertionSuccess(); - } - - return EqFailure(expected_expression, - actual_expression, - FormatForComparisonFailureMessage(expected, actual), - FormatForComparisonFailureMessage(actual, expected), - false); -} - -// A macro for implementing the helper functions needed to implement -// ASSERT_?? and EXPECT_?? with integer or enum arguments. It is here -// just to avoid copy-and-paste of similar code. -#define GTEST_IMPL_CMP_HELPER_(op_name, op)\ -AssertionResult CmpHelper##op_name(const char* expr1, const char* expr2, \ - BiggestInt val1, BiggestInt val2) {\ - if (val1 op val2) {\ - return AssertionSuccess();\ - } else {\ - return AssertionFailure() \ - << "Expected: (" << expr1 << ") " #op " (" << expr2\ - << "), actual: " << FormatForComparisonFailureMessage(val1, val2)\ - << " vs " << FormatForComparisonFailureMessage(val2, val1);\ - }\ -} - -// Implements the helper function for {ASSERT|EXPECT}_NE with int or -// enum arguments. -GTEST_IMPL_CMP_HELPER_(NE, !=) -// Implements the helper function for {ASSERT|EXPECT}_LE with int or -// enum arguments. -GTEST_IMPL_CMP_HELPER_(LE, <=) -// Implements the helper function for {ASSERT|EXPECT}_LT with int or -// enum arguments. -GTEST_IMPL_CMP_HELPER_(LT, < ) -// Implements the helper function for {ASSERT|EXPECT}_GE with int or -// enum arguments. -GTEST_IMPL_CMP_HELPER_(GE, >=) -// Implements the helper function for {ASSERT|EXPECT}_GT with int or -// enum arguments. -GTEST_IMPL_CMP_HELPER_(GT, > ) - -#undef GTEST_IMPL_CMP_HELPER_ - -// The helper function for {ASSERT|EXPECT}_STREQ. -AssertionResult CmpHelperSTREQ(const char* expected_expression, - const char* actual_expression, - const char* expected, - const char* actual) { - if (String::CStringEquals(expected, actual)) { - return AssertionSuccess(); - } - - return EqFailure(expected_expression, - actual_expression, - String::ShowCStringQuoted(expected), - String::ShowCStringQuoted(actual), - false); -} - -// The helper function for {ASSERT|EXPECT}_STRCASEEQ. -AssertionResult CmpHelperSTRCASEEQ(const char* expected_expression, - const char* actual_expression, - const char* expected, - const char* actual) { - if (String::CaseInsensitiveCStringEquals(expected, actual)) { - return AssertionSuccess(); - } - - return EqFailure(expected_expression, - actual_expression, - String::ShowCStringQuoted(expected), - String::ShowCStringQuoted(actual), - true); -} - -// The helper function for {ASSERT|EXPECT}_STRNE. -AssertionResult CmpHelperSTRNE(const char* s1_expression, - const char* s2_expression, - const char* s1, - const char* s2) { - if (!String::CStringEquals(s1, s2)) { - return AssertionSuccess(); - } else { - return AssertionFailure() << "Expected: (" << s1_expression << ") != (" - << s2_expression << "), actual: \"" - << s1 << "\" vs \"" << s2 << "\""; - } -} - -// The helper function for {ASSERT|EXPECT}_STRCASENE. -AssertionResult CmpHelperSTRCASENE(const char* s1_expression, - const char* s2_expression, - const char* s1, - const char* s2) { - if (!String::CaseInsensitiveCStringEquals(s1, s2)) { - return AssertionSuccess(); - } else { - return AssertionFailure() - << "Expected: (" << s1_expression << ") != (" - << s2_expression << ") (ignoring case), actual: \"" - << s1 << "\" vs \"" << s2 << "\""; - } -} - -} // namespace internal - -namespace { - -// Helper functions for implementing IsSubString() and IsNotSubstring(). - -// This group of overloaded functions return true iff needle is a -// substring of haystack. NULL is considered a substring of itself -// only. - -bool IsSubstringPred(const char* needle, const char* haystack) { - if (needle == NULL || haystack == NULL) - return needle == haystack; - - return strstr(haystack, needle) != NULL; -} - -bool IsSubstringPred(const wchar_t* needle, const wchar_t* haystack) { - if (needle == NULL || haystack == NULL) - return needle == haystack; - - return wcsstr(haystack, needle) != NULL; -} - -// StringType here can be either ::std::string or ::std::wstring. -template -bool IsSubstringPred(const StringType& needle, - const StringType& haystack) { - return haystack.find(needle) != StringType::npos; -} - -// This function implements either IsSubstring() or IsNotSubstring(), -// depending on the value of the expected_to_be_substring parameter. -// StringType here can be const char*, const wchar_t*, ::std::string, -// or ::std::wstring. -template -AssertionResult IsSubstringImpl( - bool expected_to_be_substring, - const char* needle_expr, const char* haystack_expr, - const StringType& needle, const StringType& haystack) { - if (IsSubstringPred(needle, haystack) == expected_to_be_substring) - return AssertionSuccess(); - - const bool is_wide_string = sizeof(needle[0]) > 1; - const char* const begin_string_quote = is_wide_string ? "L\"" : "\""; - return AssertionFailure() - << "Value of: " << needle_expr << "\n" - << " Actual: " << begin_string_quote << needle << "\"\n" - << "Expected: " << (expected_to_be_substring ? "" : "not ") - << "a substring of " << haystack_expr << "\n" - << "Which is: " << begin_string_quote << haystack << "\""; -} - -} // namespace - -// IsSubstring() and IsNotSubstring() check whether needle is a -// substring of haystack (NULL is considered a substring of itself -// only), and return an appropriate error message when they fail. - -AssertionResult IsSubstring( - const char* needle_expr, const char* haystack_expr, - const char* needle, const char* haystack) { - return IsSubstringImpl(true, needle_expr, haystack_expr, needle, haystack); -} - -AssertionResult IsSubstring( - const char* needle_expr, const char* haystack_expr, - const wchar_t* needle, const wchar_t* haystack) { - return IsSubstringImpl(true, needle_expr, haystack_expr, needle, haystack); -} - -AssertionResult IsNotSubstring( - const char* needle_expr, const char* haystack_expr, - const char* needle, const char* haystack) { - return IsSubstringImpl(false, needle_expr, haystack_expr, needle, haystack); -} - -AssertionResult IsNotSubstring( - const char* needle_expr, const char* haystack_expr, - const wchar_t* needle, const wchar_t* haystack) { - return IsSubstringImpl(false, needle_expr, haystack_expr, needle, haystack); -} - -AssertionResult IsSubstring( - const char* needle_expr, const char* haystack_expr, - const ::std::string& needle, const ::std::string& haystack) { - return IsSubstringImpl(true, needle_expr, haystack_expr, needle, haystack); -} - -AssertionResult IsNotSubstring( - const char* needle_expr, const char* haystack_expr, - const ::std::string& needle, const ::std::string& haystack) { - return IsSubstringImpl(false, needle_expr, haystack_expr, needle, haystack); -} - -#if GTEST_HAS_STD_WSTRING -AssertionResult IsSubstring( - const char* needle_expr, const char* haystack_expr, - const ::std::wstring& needle, const ::std::wstring& haystack) { - return IsSubstringImpl(true, needle_expr, haystack_expr, needle, haystack); -} - -AssertionResult IsNotSubstring( - const char* needle_expr, const char* haystack_expr, - const ::std::wstring& needle, const ::std::wstring& haystack) { - return IsSubstringImpl(false, needle_expr, haystack_expr, needle, haystack); -} -#endif // GTEST_HAS_STD_WSTRING - -namespace internal { - -#if GTEST_OS_WINDOWS - -namespace { - -// Helper function for IsHRESULT{SuccessFailure} predicates -AssertionResult HRESULTFailureHelper(const char* expr, - const char* expected, - long hr) { // NOLINT -# if GTEST_OS_WINDOWS_MOBILE - - // Windows CE doesn't support FormatMessage. - const char error_text[] = ""; - -# else - - // Looks up the human-readable system message for the HRESULT code - // and since we're not passing any params to FormatMessage, we don't - // want inserts expanded. - const DWORD kFlags = FORMAT_MESSAGE_FROM_SYSTEM | - FORMAT_MESSAGE_IGNORE_INSERTS; - const DWORD kBufSize = 4096; // String::Format can't exceed this length. - // Gets the system's human readable message string for this HRESULT. - char error_text[kBufSize] = { '\0' }; - DWORD message_length = ::FormatMessageA(kFlags, - 0, // no source, we're asking system - hr, // the error - 0, // no line width restrictions - error_text, // output buffer - kBufSize, // buf size - NULL); // no arguments for inserts - // Trims tailing white space (FormatMessage leaves a trailing cr-lf) - for (; message_length && IsSpace(error_text[message_length - 1]); - --message_length) { - error_text[message_length - 1] = '\0'; - } - -# endif // GTEST_OS_WINDOWS_MOBILE - - const String error_hex(String::Format("0x%08X ", hr)); - return ::testing::AssertionFailure() - << "Expected: " << expr << " " << expected << ".\n" - << " Actual: " << error_hex << error_text << "\n"; -} - -} // namespace - -AssertionResult IsHRESULTSuccess(const char* expr, long hr) { // NOLINT - if (SUCCEEDED(hr)) { - return AssertionSuccess(); - } - return HRESULTFailureHelper(expr, "succeeds", hr); -} - -AssertionResult IsHRESULTFailure(const char* expr, long hr) { // NOLINT - if (FAILED(hr)) { - return AssertionSuccess(); - } - return HRESULTFailureHelper(expr, "fails", hr); -} - -#endif // GTEST_OS_WINDOWS - -// Utility functions for encoding Unicode text (wide strings) in -// UTF-8. - -// A Unicode code-point can have upto 21 bits, and is encoded in UTF-8 -// like this: -// -// Code-point length Encoding -// 0 - 7 bits 0xxxxxxx -// 8 - 11 bits 110xxxxx 10xxxxxx -// 12 - 16 bits 1110xxxx 10xxxxxx 10xxxxxx -// 17 - 21 bits 11110xxx 10xxxxxx 10xxxxxx 10xxxxxx - -// The maximum code-point a one-byte UTF-8 sequence can represent. -const UInt32 kMaxCodePoint1 = (static_cast(1) << 7) - 1; - -// The maximum code-point a two-byte UTF-8 sequence can represent. -const UInt32 kMaxCodePoint2 = (static_cast(1) << (5 + 6)) - 1; - -// The maximum code-point a three-byte UTF-8 sequence can represent. -const UInt32 kMaxCodePoint3 = (static_cast(1) << (4 + 2*6)) - 1; - -// The maximum code-point a four-byte UTF-8 sequence can represent. -const UInt32 kMaxCodePoint4 = (static_cast(1) << (3 + 3*6)) - 1; - -// Chops off the n lowest bits from a bit pattern. Returns the n -// lowest bits. As a side effect, the original bit pattern will be -// shifted to the right by n bits. -inline UInt32 ChopLowBits(UInt32* bits, int n) { - const UInt32 low_bits = *bits & ((static_cast(1) << n) - 1); - *bits >>= n; - return low_bits; -} - -// Converts a Unicode code point to a narrow string in UTF-8 encoding. -// code_point parameter is of type UInt32 because wchar_t may not be -// wide enough to contain a code point. -// The output buffer str must containt at least 32 characters. -// The function returns the address of the output buffer. -// If the code_point is not a valid Unicode code point -// (i.e. outside of Unicode range U+0 to U+10FFFF) it will be output -// as '(Invalid Unicode 0xXXXXXXXX)'. -char* CodePointToUtf8(UInt32 code_point, char* str) { - if (code_point <= kMaxCodePoint1) { - str[1] = '\0'; - str[0] = static_cast(code_point); // 0xxxxxxx - } else if (code_point <= kMaxCodePoint2) { - str[2] = '\0'; - str[1] = static_cast(0x80 | ChopLowBits(&code_point, 6)); // 10xxxxxx - str[0] = static_cast(0xC0 | code_point); // 110xxxxx - } else if (code_point <= kMaxCodePoint3) { - str[3] = '\0'; - str[2] = static_cast(0x80 | ChopLowBits(&code_point, 6)); // 10xxxxxx - str[1] = static_cast(0x80 | ChopLowBits(&code_point, 6)); // 10xxxxxx - str[0] = static_cast(0xE0 | code_point); // 1110xxxx - } else if (code_point <= kMaxCodePoint4) { - str[4] = '\0'; - str[3] = static_cast(0x80 | ChopLowBits(&code_point, 6)); // 10xxxxxx - str[2] = static_cast(0x80 | ChopLowBits(&code_point, 6)); // 10xxxxxx - str[1] = static_cast(0x80 | ChopLowBits(&code_point, 6)); // 10xxxxxx - str[0] = static_cast(0xF0 | code_point); // 11110xxx - } else { - // The longest string String::Format can produce when invoked - // with these parameters is 28 character long (not including - // the terminating nul character). We are asking for 32 character - // buffer just in case. This is also enough for strncpy to - // null-terminate the destination string. - posix::StrNCpy( - str, String::Format("(Invalid Unicode 0x%X)", code_point).c_str(), 32); - str[31] = '\0'; // Makes sure no change in the format to strncpy leaves - // the result unterminated. - } - return str; -} - -// The following two functions only make sense if the the system -// uses UTF-16 for wide string encoding. All supported systems -// with 16 bit wchar_t (Windows, Cygwin, Symbian OS) do use UTF-16. - -// Determines if the arguments constitute UTF-16 surrogate pair -// and thus should be combined into a single Unicode code point -// using CreateCodePointFromUtf16SurrogatePair. -inline bool IsUtf16SurrogatePair(wchar_t first, wchar_t second) { - return sizeof(wchar_t) == 2 && - (first & 0xFC00) == 0xD800 && (second & 0xFC00) == 0xDC00; -} - -// Creates a Unicode code point from UTF16 surrogate pair. -inline UInt32 CreateCodePointFromUtf16SurrogatePair(wchar_t first, - wchar_t second) { - const UInt32 mask = (1 << 10) - 1; - return (sizeof(wchar_t) == 2) ? - (((first & mask) << 10) | (second & mask)) + 0x10000 : - // This function should not be called when the condition is - // false, but we provide a sensible default in case it is. - static_cast(first); -} - -// Converts a wide string to a narrow string in UTF-8 encoding. -// The wide string is assumed to have the following encoding: -// UTF-16 if sizeof(wchar_t) == 2 (on Windows, Cygwin, Symbian OS) -// UTF-32 if sizeof(wchar_t) == 4 (on Linux) -// Parameter str points to a null-terminated wide string. -// Parameter num_chars may additionally limit the number -// of wchar_t characters processed. -1 is used when the entire string -// should be processed. -// If the string contains code points that are not valid Unicode code points -// (i.e. outside of Unicode range U+0 to U+10FFFF) they will be output -// as '(Invalid Unicode 0xXXXXXXXX)'. If the string is in UTF16 encoding -// and contains invalid UTF-16 surrogate pairs, values in those pairs -// will be encoded as individual Unicode characters from Basic Normal Plane. -String WideStringToUtf8(const wchar_t* str, int num_chars) { - if (num_chars == -1) - num_chars = static_cast(wcslen(str)); - - ::std::stringstream stream; - for (int i = 0; i < num_chars; ++i) { - UInt32 unicode_code_point; - - if (str[i] == L'\0') { - break; - } else if (i + 1 < num_chars && IsUtf16SurrogatePair(str[i], str[i + 1])) { - unicode_code_point = CreateCodePointFromUtf16SurrogatePair(str[i], - str[i + 1]); - i++; - } else { - unicode_code_point = static_cast(str[i]); - } - - char buffer[32]; // CodePointToUtf8 requires a buffer this big. - stream << CodePointToUtf8(unicode_code_point, buffer); - } - return StringStreamToString(&stream); -} - -// Converts a wide C string to a String using the UTF-8 encoding. -// NULL will be converted to "(null)". -String String::ShowWideCString(const wchar_t * wide_c_str) { - if (wide_c_str == NULL) return String("(null)"); - - return String(internal::WideStringToUtf8(wide_c_str, -1).c_str()); -} - -// Similar to ShowWideCString(), except that this function encloses -// the converted string in double quotes. -String String::ShowWideCStringQuoted(const wchar_t* wide_c_str) { - if (wide_c_str == NULL) return String("(null)"); - - return String::Format("L\"%s\"", - String::ShowWideCString(wide_c_str).c_str()); -} - -// Compares two wide C strings. Returns true iff they have the same -// content. -// -// Unlike wcscmp(), this function can handle NULL argument(s). A NULL -// C string is considered different to any non-NULL C string, -// including the empty string. -bool String::WideCStringEquals(const wchar_t * lhs, const wchar_t * rhs) { - if (lhs == NULL) return rhs == NULL; - - if (rhs == NULL) return false; - - return wcscmp(lhs, rhs) == 0; -} - -// Helper function for *_STREQ on wide strings. -AssertionResult CmpHelperSTREQ(const char* expected_expression, - const char* actual_expression, - const wchar_t* expected, - const wchar_t* actual) { - if (String::WideCStringEquals(expected, actual)) { - return AssertionSuccess(); - } - - return EqFailure(expected_expression, - actual_expression, - String::ShowWideCStringQuoted(expected), - String::ShowWideCStringQuoted(actual), - false); -} - -// Helper function for *_STRNE on wide strings. -AssertionResult CmpHelperSTRNE(const char* s1_expression, - const char* s2_expression, - const wchar_t* s1, - const wchar_t* s2) { - if (!String::WideCStringEquals(s1, s2)) { - return AssertionSuccess(); - } - - return AssertionFailure() << "Expected: (" << s1_expression << ") != (" - << s2_expression << "), actual: " - << String::ShowWideCStringQuoted(s1) - << " vs " << String::ShowWideCStringQuoted(s2); -} - -// Compares two C strings, ignoring case. Returns true iff they have -// the same content. -// -// Unlike strcasecmp(), this function can handle NULL argument(s). A -// NULL C string is considered different to any non-NULL C string, -// including the empty string. -bool String::CaseInsensitiveCStringEquals(const char * lhs, const char * rhs) { - if (lhs == NULL) - return rhs == NULL; - if (rhs == NULL) - return false; - return posix::StrCaseCmp(lhs, rhs) == 0; -} - - // Compares two wide C strings, ignoring case. Returns true iff they - // have the same content. - // - // Unlike wcscasecmp(), this function can handle NULL argument(s). - // A NULL C string is considered different to any non-NULL wide C string, - // including the empty string. - // NB: The implementations on different platforms slightly differ. - // On windows, this method uses _wcsicmp which compares according to LC_CTYPE - // environment variable. On GNU platform this method uses wcscasecmp - // which compares according to LC_CTYPE category of the current locale. - // On MacOS X, it uses towlower, which also uses LC_CTYPE category of the - // current locale. -bool String::CaseInsensitiveWideCStringEquals(const wchar_t* lhs, - const wchar_t* rhs) { - if (lhs == NULL) return rhs == NULL; - - if (rhs == NULL) return false; - -#if GTEST_OS_WINDOWS - return _wcsicmp(lhs, rhs) == 0; -#elif GTEST_OS_LINUX && !GTEST_OS_LINUX_ANDROID - return wcscasecmp(lhs, rhs) == 0; -#else - // Android, Mac OS X and Cygwin don't define wcscasecmp. - // Other unknown OSes may not define it either. - wint_t left, right; - do { - left = towlower(*lhs++); - right = towlower(*rhs++); - } while (left && left == right); - return left == right; -#endif // OS selector -} - -// Compares this with another String. -// Returns < 0 if this is less than rhs, 0 if this is equal to rhs, or > 0 -// if this is greater than rhs. -int String::Compare(const String & rhs) const { - const char* const lhs_c_str = c_str(); - const char* const rhs_c_str = rhs.c_str(); - - if (lhs_c_str == NULL) { - return rhs_c_str == NULL ? 0 : -1; // NULL < anything except NULL - } else if (rhs_c_str == NULL) { - return 1; - } - - const size_t shorter_str_len = - length() <= rhs.length() ? length() : rhs.length(); - for (size_t i = 0; i != shorter_str_len; i++) { - if (lhs_c_str[i] < rhs_c_str[i]) { - return -1; - } else if (lhs_c_str[i] > rhs_c_str[i]) { - return 1; - } - } - return (length() < rhs.length()) ? -1 : - (length() > rhs.length()) ? 1 : 0; -} - -// Returns true iff this String ends with the given suffix. *Any* -// String is considered to end with a NULL or empty suffix. -bool String::EndsWith(const char* suffix) const { - if (suffix == NULL || CStringEquals(suffix, "")) return true; - - if (c_str() == NULL) return false; - - const size_t this_len = strlen(c_str()); - const size_t suffix_len = strlen(suffix); - return (this_len >= suffix_len) && - CStringEquals(c_str() + this_len - suffix_len, suffix); -} - -// Returns true iff this String ends with the given suffix, ignoring case. -// Any String is considered to end with a NULL or empty suffix. -bool String::EndsWithCaseInsensitive(const char* suffix) const { - if (suffix == NULL || CStringEquals(suffix, "")) return true; - - if (c_str() == NULL) return false; - - const size_t this_len = strlen(c_str()); - const size_t suffix_len = strlen(suffix); - return (this_len >= suffix_len) && - CaseInsensitiveCStringEquals(c_str() + this_len - suffix_len, suffix); -} - -// Formats a list of arguments to a String, using the same format -// spec string as for printf. -// -// We do not use the StringPrintf class as it is not universally -// available. -// -// The result is limited to 4096 characters (including the tailing 0). -// If 4096 characters are not enough to format the input, or if -// there's an error, "" is -// returned. -String String::Format(const char * format, ...) { - va_list args; - va_start(args, format); - - char buffer[4096]; - const int kBufferSize = sizeof(buffer)/sizeof(buffer[0]); - - // MSVC 8 deprecates vsnprintf(), so we want to suppress warning - // 4996 (deprecated function) there. -#ifdef _MSC_VER // We are using MSVC. -# pragma warning(push) // Saves the current warning state. -# pragma warning(disable:4996) // Temporarily disables warning 4996. - - const int size = vsnprintf(buffer, kBufferSize, format, args); - -# pragma warning(pop) // Restores the warning state. -#else // We are not using MSVC. - const int size = vsnprintf(buffer, kBufferSize, format, args); -#endif // _MSC_VER - va_end(args); - - // vsnprintf()'s behavior is not portable. When the buffer is not - // big enough, it returns a negative value in MSVC, and returns the - // needed buffer size on Linux. When there is an output error, it - // always returns a negative value. For simplicity, we lump the two - // error cases together. - if (size < 0 || size >= kBufferSize) { - return String(""); - } else { - return String(buffer, size); - } -} - -// Converts the buffer in a stringstream to a String, converting NUL -// bytes to "\\0" along the way. -String StringStreamToString(::std::stringstream* ss) { - const ::std::string& str = ss->str(); - const char* const start = str.c_str(); - const char* const end = start + str.length(); - - // We need to use a helper stringstream to do this transformation - // because String doesn't support push_back(). - ::std::stringstream helper; - for (const char* ch = start; ch != end; ++ch) { - if (*ch == '\0') { - helper << "\\0"; // Replaces NUL with "\\0"; - } else { - helper.put(*ch); - } - } - - return String(helper.str().c_str()); -} - -// Appends the user-supplied message to the Google-Test-generated message. -String AppendUserMessage(const String& gtest_msg, - const Message& user_msg) { - // Appends the user message if it's non-empty. - const String user_msg_string = user_msg.GetString(); - if (user_msg_string.empty()) { - return gtest_msg; - } - - Message msg; - msg << gtest_msg << "\n" << user_msg_string; - - return msg.GetString(); -} - -} // namespace internal - -// class TestResult - -// Creates an empty TestResult. -TestResult::TestResult() - : death_test_count_(0), - elapsed_time_(0) { -} - -// D'tor. -TestResult::~TestResult() { -} - -// Returns the i-th test part result among all the results. i can -// range from 0 to total_part_count() - 1. If i is not in that range, -// aborts the program. -const TestPartResult& TestResult::GetTestPartResult(int i) const { - if (i < 0 || i >= total_part_count()) - internal::posix::Abort(); - return test_part_results_.at(i); -} - -// Returns the i-th test property. i can range from 0 to -// test_property_count() - 1. If i is not in that range, aborts the -// program. -const TestProperty& TestResult::GetTestProperty(int i) const { - if (i < 0 || i >= test_property_count()) - internal::posix::Abort(); - return test_properties_.at(i); -} - -// Clears the test part results. -void TestResult::ClearTestPartResults() { - test_part_results_.clear(); -} - -// Adds a test part result to the list. -void TestResult::AddTestPartResult(const TestPartResult& test_part_result) { - test_part_results_.push_back(test_part_result); -} - -// Adds a test property to the list. If a property with the same key as the -// supplied property is already represented, the value of this test_property -// replaces the old value for that key. -void TestResult::RecordProperty(const TestProperty& test_property) { - if (!ValidateTestProperty(test_property)) { - return; - } - internal::MutexLock lock(&test_properites_mutex_); - const std::vector::iterator property_with_matching_key = - std::find_if(test_properties_.begin(), test_properties_.end(), - internal::TestPropertyKeyIs(test_property.key())); - if (property_with_matching_key == test_properties_.end()) { - test_properties_.push_back(test_property); - return; - } - property_with_matching_key->SetValue(test_property.value()); -} - -// Adds a failure if the key is a reserved attribute of Google Test -// testcase tags. Returns true if the property is valid. -bool TestResult::ValidateTestProperty(const TestProperty& test_property) { - internal::String key(test_property.key()); - if (key == "name" || key == "status" || key == "time" || key == "classname") { - ADD_FAILURE() - << "Reserved key used in RecordProperty(): " - << key - << " ('name', 'status', 'time', and 'classname' are reserved by " - << GTEST_NAME_ << ")"; - return false; - } - return true; -} - -// Clears the object. -void TestResult::Clear() { - test_part_results_.clear(); - test_properties_.clear(); - death_test_count_ = 0; - elapsed_time_ = 0; -} - -// Returns true iff the test failed. -bool TestResult::Failed() const { - for (int i = 0; i < total_part_count(); ++i) { - if (GetTestPartResult(i).failed()) - return true; - } - return false; -} - -// Returns true iff the test part fatally failed. -static bool TestPartFatallyFailed(const TestPartResult& result) { - return result.fatally_failed(); -} - -// Returns true iff the test fatally failed. -bool TestResult::HasFatalFailure() const { - return CountIf(test_part_results_, TestPartFatallyFailed) > 0; -} - -// Returns true iff the test part non-fatally failed. -static bool TestPartNonfatallyFailed(const TestPartResult& result) { - return result.nonfatally_failed(); -} - -// Returns true iff the test has a non-fatal failure. -bool TestResult::HasNonfatalFailure() const { - return CountIf(test_part_results_, TestPartNonfatallyFailed) > 0; -} - -// Gets the number of all test parts. This is the sum of the number -// of successful test parts and the number of failed test parts. -int TestResult::total_part_count() const { - return static_cast(test_part_results_.size()); -} - -// Returns the number of the test properties. -int TestResult::test_property_count() const { - return static_cast(test_properties_.size()); -} - -// class Test - -// Creates a Test object. - -// The c'tor saves the values of all Google Test flags. -Test::Test() - : gtest_flag_saver_(new internal::GTestFlagSaver) { -} - -// The d'tor restores the values of all Google Test flags. -Test::~Test() { - delete gtest_flag_saver_; -} - -// Sets up the test fixture. -// -// A sub-class may override this. -void Test::SetUp() { -} - -// Tears down the test fixture. -// -// A sub-class may override this. -void Test::TearDown() { -} - -// Allows user supplied key value pairs to be recorded for later output. -void Test::RecordProperty(const char* key, const char* value) { - UnitTest::GetInstance()->RecordPropertyForCurrentTest(key, value); -} - -// Allows user supplied key value pairs to be recorded for later output. -void Test::RecordProperty(const char* key, int value) { - Message value_message; - value_message << value; - RecordProperty(key, value_message.GetString().c_str()); -} - -namespace internal { - -void ReportFailureInUnknownLocation(TestPartResult::Type result_type, - const String& message) { - // This function is a friend of UnitTest and as such has access to - // AddTestPartResult. - UnitTest::GetInstance()->AddTestPartResult( - result_type, - NULL, // No info about the source file where the exception occurred. - -1, // We have no info on which line caused the exception. - message, - String()); // No stack trace, either. -} - -} // namespace internal - -// Google Test requires all tests in the same test case to use the same test -// fixture class. This function checks if the current test has the -// same fixture class as the first test in the current test case. If -// yes, it returns true; otherwise it generates a Google Test failure and -// returns false. -bool Test::HasSameFixtureClass() { - internal::UnitTestImpl* const impl = internal::GetUnitTestImpl(); - const TestCase* const test_case = impl->current_test_case(); - - // Info about the first test in the current test case. - const TestInfo* const first_test_info = test_case->test_info_list()[0]; - const internal::TypeId first_fixture_id = first_test_info->fixture_class_id_; - const char* const first_test_name = first_test_info->name(); - - // Info about the current test. - const TestInfo* const this_test_info = impl->current_test_info(); - const internal::TypeId this_fixture_id = this_test_info->fixture_class_id_; - const char* const this_test_name = this_test_info->name(); - - if (this_fixture_id != first_fixture_id) { - // Is the first test defined using TEST? - const bool first_is_TEST = first_fixture_id == internal::GetTestTypeId(); - // Is this test defined using TEST? - const bool this_is_TEST = this_fixture_id == internal::GetTestTypeId(); - - if (first_is_TEST || this_is_TEST) { - // The user mixed TEST and TEST_F in this test case - we'll tell - // him/her how to fix it. - - // Gets the name of the TEST and the name of the TEST_F. Note - // that first_is_TEST and this_is_TEST cannot both be true, as - // the fixture IDs are different for the two tests. - const char* const TEST_name = - first_is_TEST ? first_test_name : this_test_name; - const char* const TEST_F_name = - first_is_TEST ? this_test_name : first_test_name; - - ADD_FAILURE() - << "All tests in the same test case must use the same test fixture\n" - << "class, so mixing TEST_F and TEST in the same test case is\n" - << "illegal. In test case " << this_test_info->test_case_name() - << ",\n" - << "test " << TEST_F_name << " is defined using TEST_F but\n" - << "test " << TEST_name << " is defined using TEST. You probably\n" - << "want to change the TEST to TEST_F or move it to another test\n" - << "case."; - } else { - // The user defined two fixture classes with the same name in - // two namespaces - we'll tell him/her how to fix it. - ADD_FAILURE() - << "All tests in the same test case must use the same test fixture\n" - << "class. However, in test case " - << this_test_info->test_case_name() << ",\n" - << "you defined test " << first_test_name - << " and test " << this_test_name << "\n" - << "using two different test fixture classes. This can happen if\n" - << "the two classes are from different namespaces or translation\n" - << "units and have the same name. You should probably rename one\n" - << "of the classes to put the tests into different test cases."; - } - return false; - } - - return true; -} - -#if GTEST_HAS_SEH - -// Adds an "exception thrown" fatal failure to the current test. This -// function returns its result via an output parameter pointer because VC++ -// prohibits creation of objects with destructors on stack in functions -// using __try (see error C2712). -static internal::String* FormatSehExceptionMessage(DWORD exception_code, - const char* location) { - Message message; - message << "SEH exception with code 0x" << std::setbase(16) << - exception_code << std::setbase(10) << " thrown in " << location << "."; - - return new internal::String(message.GetString()); -} - -#endif // GTEST_HAS_SEH - -#if GTEST_HAS_EXCEPTIONS - -// Adds an "exception thrown" fatal failure to the current test. -static internal::String FormatCxxExceptionMessage(const char* description, - const char* location) { - Message message; - if (description != NULL) { - message << "C++ exception with description \"" << description << "\""; - } else { - message << "Unknown C++ exception"; - } - message << " thrown in " << location << "."; - - return message.GetString(); -} - -static internal::String PrintTestPartResultToString( - const TestPartResult& test_part_result); - -// A failed Google Test assertion will throw an exception of this type when -// GTEST_FLAG(throw_on_failure) is true (if exceptions are enabled). We -// derive it from std::runtime_error, which is for errors presumably -// detectable only at run time. Since std::runtime_error inherits from -// std::exception, many testing frameworks know how to extract and print the -// message inside it. -class GoogleTestFailureException : public ::std::runtime_error { - public: - explicit GoogleTestFailureException(const TestPartResult& failure) - : ::std::runtime_error(PrintTestPartResultToString(failure).c_str()) {} -}; -#endif // GTEST_HAS_EXCEPTIONS - -namespace internal { -// We put these helper functions in the internal namespace as IBM's xlC -// compiler rejects the code if they were declared static. - -// Runs the given method and handles SEH exceptions it throws, when -// SEH is supported; returns the 0-value for type Result in case of an -// SEH exception. (Microsoft compilers cannot handle SEH and C++ -// exceptions in the same function. Therefore, we provide a separate -// wrapper function for handling SEH exceptions.) -template -Result HandleSehExceptionsInMethodIfSupported( - T* object, Result (T::*method)(), const char* location) { -#if GTEST_HAS_SEH - __try { - return (object->*method)(); - } __except (internal::UnitTestOptions::GTestShouldProcessSEH( // NOLINT - GetExceptionCode())) { - // We create the exception message on the heap because VC++ prohibits - // creation of objects with destructors on stack in functions using __try - // (see error C2712). - internal::String* exception_message = FormatSehExceptionMessage( - GetExceptionCode(), location); - internal::ReportFailureInUnknownLocation(TestPartResult::kFatalFailure, - *exception_message); - delete exception_message; - return static_cast(0); - } -#else - (void)location; - return (object->*method)(); -#endif // GTEST_HAS_SEH -} - -// Runs the given method and catches and reports C++ and/or SEH-style -// exceptions, if they are supported; returns the 0-value for type -// Result in case of an SEH exception. -template -Result HandleExceptionsInMethodIfSupported( - T* object, Result (T::*method)(), const char* location) { - // NOTE: The user code can affect the way in which Google Test handles - // exceptions by setting GTEST_FLAG(catch_exceptions), but only before - // RUN_ALL_TESTS() starts. It is technically possible to check the flag - // after the exception is caught and either report or re-throw the - // exception based on the flag's value: - // - // try { - // // Perform the test method. - // } catch (...) { - // if (GTEST_FLAG(catch_exceptions)) - // // Report the exception as failure. - // else - // throw; // Re-throws the original exception. - // } - // - // However, the purpose of this flag is to allow the program to drop into - // the debugger when the exception is thrown. On most platforms, once the - // control enters the catch block, the exception origin information is - // lost and the debugger will stop the program at the point of the - // re-throw in this function -- instead of at the point of the original - // throw statement in the code under test. For this reason, we perform - // the check early, sacrificing the ability to affect Google Test's - // exception handling in the method where the exception is thrown. - if (internal::GetUnitTestImpl()->catch_exceptions()) { -#if GTEST_HAS_EXCEPTIONS - try { - return HandleSehExceptionsInMethodIfSupported(object, method, location); - } catch (const GoogleTestFailureException&) { // NOLINT - // This exception doesn't originate in code under test. It makes no - // sense to report it as a test failure. - throw; - } catch (const std::exception& e) { // NOLINT - internal::ReportFailureInUnknownLocation( - TestPartResult::kFatalFailure, - FormatCxxExceptionMessage(e.what(), location)); - } catch (...) { // NOLINT - internal::ReportFailureInUnknownLocation( - TestPartResult::kFatalFailure, - FormatCxxExceptionMessage(NULL, location)); - } - return static_cast(0); -#else - return HandleSehExceptionsInMethodIfSupported(object, method, location); -#endif // GTEST_HAS_EXCEPTIONS - } else { - return (object->*method)(); - } -} - -} // namespace internal - -// Runs the test and updates the test result. -void Test::Run() { - if (!HasSameFixtureClass()) return; - - internal::UnitTestImpl* const impl = internal::GetUnitTestImpl(); - impl->os_stack_trace_getter()->UponLeavingGTest(); - internal::HandleExceptionsInMethodIfSupported(this, &Test::SetUp, "SetUp()"); - // We will run the test only if SetUp() was successful. - if (!HasFatalFailure()) { - impl->os_stack_trace_getter()->UponLeavingGTest(); - internal::HandleExceptionsInMethodIfSupported( - this, &Test::TestBody, "the test body"); - } - - // However, we want to clean up as much as possible. Hence we will - // always call TearDown(), even if SetUp() or the test body has - // failed. - impl->os_stack_trace_getter()->UponLeavingGTest(); - internal::HandleExceptionsInMethodIfSupported( - this, &Test::TearDown, "TearDown()"); -} - -// Returns true iff the current test has a fatal failure. -bool Test::HasFatalFailure() { - return internal::GetUnitTestImpl()->current_test_result()->HasFatalFailure(); -} - -// Returns true iff the current test has a non-fatal failure. -bool Test::HasNonfatalFailure() { - return internal::GetUnitTestImpl()->current_test_result()-> - HasNonfatalFailure(); -} - -// class TestInfo - -// Constructs a TestInfo object. It assumes ownership of the test factory -// object. -// TODO(vladl@google.com): Make a_test_case_name and a_name const string&'s -// to signify they cannot be NULLs. -TestInfo::TestInfo(const char* a_test_case_name, - const char* a_name, - const char* a_type_param, - const char* a_value_param, - internal::TypeId fixture_class_id, - internal::TestFactoryBase* factory) - : test_case_name_(a_test_case_name), - name_(a_name), - type_param_(a_type_param ? new std::string(a_type_param) : NULL), - value_param_(a_value_param ? new std::string(a_value_param) : NULL), - fixture_class_id_(fixture_class_id), - should_run_(false), - is_disabled_(false), - matches_filter_(false), - factory_(factory), - result_() {} - -// Destructs a TestInfo object. -TestInfo::~TestInfo() { delete factory_; } - -namespace internal { - -// Creates a new TestInfo object and registers it with Google Test; -// returns the created object. -// -// Arguments: -// -// test_case_name: name of the test case -// name: name of the test -// type_param: the name of the test's type parameter, or NULL if -// this is not a typed or a type-parameterized test. -// value_param: text representation of the test's value parameter, -// or NULL if this is not a value-parameterized test. -// fixture_class_id: ID of the test fixture class -// set_up_tc: pointer to the function that sets up the test case -// tear_down_tc: pointer to the function that tears down the test case -// factory: pointer to the factory that creates a test object. -// The newly created TestInfo instance will assume -// ownership of the factory object. -TestInfo* MakeAndRegisterTestInfo( - const char* test_case_name, const char* name, - const char* type_param, - const char* value_param, - TypeId fixture_class_id, - SetUpTestCaseFunc set_up_tc, - TearDownTestCaseFunc tear_down_tc, - TestFactoryBase* factory) { - TestInfo* const test_info = - new TestInfo(test_case_name, name, type_param, value_param, - fixture_class_id, factory); - GetUnitTestImpl()->AddTestInfo(set_up_tc, tear_down_tc, test_info); - return test_info; -} - -#if GTEST_HAS_PARAM_TEST -void ReportInvalidTestCaseType(const char* test_case_name, - const char* file, int line) { - Message errors; - errors - << "Attempted redefinition of test case " << test_case_name << ".\n" - << "All tests in the same test case must use the same test fixture\n" - << "class. However, in test case " << test_case_name << ", you tried\n" - << "to define a test using a fixture class different from the one\n" - << "used earlier. This can happen if the two fixture classes are\n" - << "from different namespaces and have the same name. You should\n" - << "probably rename one of the classes to put the tests into different\n" - << "test cases."; - - fprintf(stderr, "%s %s", FormatFileLocation(file, line).c_str(), - errors.GetString().c_str()); -} -#endif // GTEST_HAS_PARAM_TEST - -} // namespace internal - -namespace { - -// A predicate that checks the test name of a TestInfo against a known -// value. -// -// This is used for implementation of the TestCase class only. We put -// it in the anonymous namespace to prevent polluting the outer -// namespace. -// -// TestNameIs is copyable. -class TestNameIs { - public: - // Constructor. - // - // TestNameIs has NO default constructor. - explicit TestNameIs(const char* name) - : name_(name) {} - - // Returns true iff the test name of test_info matches name_. - bool operator()(const TestInfo * test_info) const { - return test_info && internal::String(test_info->name()).Compare(name_) == 0; - } - - private: - internal::String name_; -}; - -} // namespace - -namespace internal { - -// This method expands all parameterized tests registered with macros TEST_P -// and INSTANTIATE_TEST_CASE_P into regular tests and registers those. -// This will be done just once during the program runtime. -void UnitTestImpl::RegisterParameterizedTests() { -#if GTEST_HAS_PARAM_TEST - if (!parameterized_tests_registered_) { - parameterized_test_registry_.RegisterTests(); - parameterized_tests_registered_ = true; - } -#endif -} - -} // namespace internal - -// Creates the test object, runs it, records its result, and then -// deletes it. -void TestInfo::Run() { - if (!should_run_) return; - - // Tells UnitTest where to store test result. - internal::UnitTestImpl* const impl = internal::GetUnitTestImpl(); - impl->set_current_test_info(this); - - TestEventListener* repeater = UnitTest::GetInstance()->listeners().repeater(); - - // Notifies the unit test event listeners that a test is about to start. - repeater->OnTestStart(*this); - - const TimeInMillis start = internal::GetTimeInMillis(); - - impl->os_stack_trace_getter()->UponLeavingGTest(); - - // Creates the test object. - Test* const test = internal::HandleExceptionsInMethodIfSupported( - factory_, &internal::TestFactoryBase::CreateTest, - "the test fixture's constructor"); - - // Runs the test only if the test object was created and its - // constructor didn't generate a fatal failure. - if ((test != NULL) && !Test::HasFatalFailure()) { - // This doesn't throw as all user code that can throw are wrapped into - // exception handling code. - test->Run(); - } - - // Deletes the test object. - impl->os_stack_trace_getter()->UponLeavingGTest(); - internal::HandleExceptionsInMethodIfSupported( - test, &Test::DeleteSelf_, "the test fixture's destructor"); - - result_.set_elapsed_time(internal::GetTimeInMillis() - start); - - // Notifies the unit test event listener that a test has just finished. - repeater->OnTestEnd(*this); - - // Tells UnitTest to stop associating assertion results to this - // test. - impl->set_current_test_info(NULL); -} - -// class TestCase - -// Gets the number of successful tests in this test case. -int TestCase::successful_test_count() const { - return CountIf(test_info_list_, TestPassed); -} - -// Gets the number of failed tests in this test case. -int TestCase::failed_test_count() const { - return CountIf(test_info_list_, TestFailed); -} - -int TestCase::disabled_test_count() const { - return CountIf(test_info_list_, TestDisabled); -} - -// Get the number of tests in this test case that should run. -int TestCase::test_to_run_count() const { - return CountIf(test_info_list_, ShouldRunTest); -} - -// Gets the number of all tests. -int TestCase::total_test_count() const { - return static_cast(test_info_list_.size()); -} - -// Creates a TestCase with the given name. -// -// Arguments: -// -// name: name of the test case -// a_type_param: the name of the test case's type parameter, or NULL if -// this is not a typed or a type-parameterized test case. -// set_up_tc: pointer to the function that sets up the test case -// tear_down_tc: pointer to the function that tears down the test case -TestCase::TestCase(const char* a_name, const char* a_type_param, - Test::SetUpTestCaseFunc set_up_tc, - Test::TearDownTestCaseFunc tear_down_tc) - : name_(a_name), - type_param_(a_type_param ? new std::string(a_type_param) : NULL), - set_up_tc_(set_up_tc), - tear_down_tc_(tear_down_tc), - should_run_(false), - elapsed_time_(0) { -} - -// Destructor of TestCase. -TestCase::~TestCase() { - // Deletes every Test in the collection. - ForEach(test_info_list_, internal::Delete); -} - -// Returns the i-th test among all the tests. i can range from 0 to -// total_test_count() - 1. If i is not in that range, returns NULL. -const TestInfo* TestCase::GetTestInfo(int i) const { - const int index = GetElementOr(test_indices_, i, -1); - return index < 0 ? NULL : test_info_list_[index]; -} - -// Returns the i-th test among all the tests. i can range from 0 to -// total_test_count() - 1. If i is not in that range, returns NULL. -TestInfo* TestCase::GetMutableTestInfo(int i) { - const int index = GetElementOr(test_indices_, i, -1); - return index < 0 ? NULL : test_info_list_[index]; -} - -// Adds a test to this test case. Will delete the test upon -// destruction of the TestCase object. -void TestCase::AddTestInfo(TestInfo * test_info) { - test_info_list_.push_back(test_info); - test_indices_.push_back(static_cast(test_indices_.size())); -} - -// Runs every test in this TestCase. -void TestCase::Run() { - if (!should_run_) return; - - internal::UnitTestImpl* const impl = internal::GetUnitTestImpl(); - impl->set_current_test_case(this); - - TestEventListener* repeater = UnitTest::GetInstance()->listeners().repeater(); - - repeater->OnTestCaseStart(*this); - impl->os_stack_trace_getter()->UponLeavingGTest(); - internal::HandleExceptionsInMethodIfSupported( - this, &TestCase::RunSetUpTestCase, "SetUpTestCase()"); - - const internal::TimeInMillis start = internal::GetTimeInMillis(); - for (int i = 0; i < total_test_count(); i++) { - GetMutableTestInfo(i)->Run(); - } - elapsed_time_ = internal::GetTimeInMillis() - start; - - impl->os_stack_trace_getter()->UponLeavingGTest(); - internal::HandleExceptionsInMethodIfSupported( - this, &TestCase::RunTearDownTestCase, "TearDownTestCase()"); - - repeater->OnTestCaseEnd(*this); - impl->set_current_test_case(NULL); -} - -// Clears the results of all tests in this test case. -void TestCase::ClearResult() { - ForEach(test_info_list_, TestInfo::ClearTestResult); -} - -// Shuffles the tests in this test case. -void TestCase::ShuffleTests(internal::Random* random) { - Shuffle(random, &test_indices_); -} - -// Restores the test order to before the first shuffle. -void TestCase::UnshuffleTests() { - for (size_t i = 0; i < test_indices_.size(); i++) { - test_indices_[i] = static_cast(i); - } -} - -// Formats a countable noun. Depending on its quantity, either the -// singular form or the plural form is used. e.g. -// -// FormatCountableNoun(1, "formula", "formuli") returns "1 formula". -// FormatCountableNoun(5, "book", "books") returns "5 books". -static internal::String FormatCountableNoun(int count, - const char * singular_form, - const char * plural_form) { - return internal::String::Format("%d %s", count, - count == 1 ? singular_form : plural_form); -} - -// Formats the count of tests. -static internal::String FormatTestCount(int test_count) { - return FormatCountableNoun(test_count, "test", "tests"); -} - -// Formats the count of test cases. -static internal::String FormatTestCaseCount(int test_case_count) { - return FormatCountableNoun(test_case_count, "test case", "test cases"); -} - -// Converts a TestPartResult::Type enum to human-friendly string -// representation. Both kNonFatalFailure and kFatalFailure are translated -// to "Failure", as the user usually doesn't care about the difference -// between the two when viewing the test result. -static const char * TestPartResultTypeToString(TestPartResult::Type type) { - switch (type) { - case TestPartResult::kSuccess: - return "Success"; - - case TestPartResult::kNonFatalFailure: - case TestPartResult::kFatalFailure: -#ifdef _MSC_VER - return "error: "; -#else - return "Failure\n"; -#endif - default: - return "Unknown result type"; - } -} - -// Prints a TestPartResult to a String. -static internal::String PrintTestPartResultToString( - const TestPartResult& test_part_result) { - return (Message() - << internal::FormatFileLocation(test_part_result.file_name(), - test_part_result.line_number()) - << " " << TestPartResultTypeToString(test_part_result.type()) - << test_part_result.message()).GetString(); -} - -// Prints a TestPartResult. -static void PrintTestPartResult(const TestPartResult& test_part_result) { - const internal::String& result = - PrintTestPartResultToString(test_part_result); - printf("%s\n", result.c_str()); - fflush(stdout); - // If the test program runs in Visual Studio or a debugger, the - // following statements add the test part result message to the Output - // window such that the user can double-click on it to jump to the - // corresponding source code location; otherwise they do nothing. -#if GTEST_OS_WINDOWS && !GTEST_OS_WINDOWS_MOBILE - // We don't call OutputDebugString*() on Windows Mobile, as printing - // to stdout is done by OutputDebugString() there already - we don't - // want the same message printed twice. - ::OutputDebugStringA(result.c_str()); - ::OutputDebugStringA("\n"); -#endif -} - -// class PrettyUnitTestResultPrinter - -namespace internal { - -enum GTestColor { - COLOR_DEFAULT, - COLOR_RED, - COLOR_GREEN, - COLOR_YELLOW -}; - -#if GTEST_OS_WINDOWS && !GTEST_OS_WINDOWS_MOBILE - -// Returns the character attribute for the given color. -WORD GetColorAttribute(GTestColor color) { - switch (color) { - case COLOR_RED: return FOREGROUND_RED; - case COLOR_GREEN: return FOREGROUND_GREEN; - case COLOR_YELLOW: return FOREGROUND_RED | FOREGROUND_GREEN; - default: return 0; - } -} - -#else - -// Returns the ANSI color code for the given color. COLOR_DEFAULT is -// an invalid input. -const char* GetAnsiColorCode(GTestColor color) { - switch (color) { - case COLOR_RED: return "1"; - case COLOR_GREEN: return "2"; - case COLOR_YELLOW: return "3"; - default: return NULL; - }; -} - -#endif // GTEST_OS_WINDOWS && !GTEST_OS_WINDOWS_MOBILE - -// Returns true iff Google Test should use colors in the output. -bool ShouldUseColor(bool stdout_is_tty) { - const char* const gtest_color = GTEST_FLAG(color).c_str(); - - if (String::CaseInsensitiveCStringEquals(gtest_color, "auto")) { -#if GTEST_OS_WINDOWS - // On Windows the TERM variable is usually not set, but the - // console there does support colors. - return stdout_is_tty; -#else - // On non-Windows platforms, we rely on the TERM variable. - const char* const term = posix::GetEnv("TERM"); - const bool term_supports_color = - String::CStringEquals(term, "xterm") || - String::CStringEquals(term, "xterm-color") || - String::CStringEquals(term, "xterm-256color") || - String::CStringEquals(term, "screen") || - String::CStringEquals(term, "linux") || - String::CStringEquals(term, "cygwin"); - return stdout_is_tty && term_supports_color; -#endif // GTEST_OS_WINDOWS - } - - return String::CaseInsensitiveCStringEquals(gtest_color, "yes") || - String::CaseInsensitiveCStringEquals(gtest_color, "true") || - String::CaseInsensitiveCStringEquals(gtest_color, "t") || - String::CStringEquals(gtest_color, "1"); - // We take "yes", "true", "t", and "1" as meaning "yes". If the - // value is neither one of these nor "auto", we treat it as "no" to - // be conservative. -} - -// Helpers for printing colored strings to stdout. Note that on Windows, we -// cannot simply emit special characters and have the terminal change colors. -// This routine must actually emit the characters rather than return a string -// that would be colored when printed, as can be done on Linux. -void ColoredPrintf(GTestColor color, const char* fmt, ...) { - va_list args; - va_start(args, fmt); - -#if GTEST_OS_WINDOWS_MOBILE || GTEST_OS_SYMBIAN || GTEST_OS_ZOS - const bool use_color = false; -#else - static const bool in_color_mode = - ShouldUseColor(posix::IsATTY(posix::FileNo(stdout)) != 0); - const bool use_color = in_color_mode && (color != COLOR_DEFAULT); -#endif // GTEST_OS_WINDOWS_MOBILE || GTEST_OS_SYMBIAN || GTEST_OS_ZOS - // The '!= 0' comparison is necessary to satisfy MSVC 7.1. - - if (!use_color) { - vprintf(fmt, args); - va_end(args); - return; - } - -#if GTEST_OS_WINDOWS && !GTEST_OS_WINDOWS_MOBILE - const HANDLE stdout_handle = GetStdHandle(STD_OUTPUT_HANDLE); - - // Gets the current text color. - CONSOLE_SCREEN_BUFFER_INFO buffer_info; - GetConsoleScreenBufferInfo(stdout_handle, &buffer_info); - const WORD old_color_attrs = buffer_info.wAttributes; - - // We need to flush the stream buffers into the console before each - // SetConsoleTextAttribute call lest it affect the text that is already - // printed but has not yet reached the console. - fflush(stdout); - SetConsoleTextAttribute(stdout_handle, - GetColorAttribute(color) | FOREGROUND_INTENSITY); - vprintf(fmt, args); - - fflush(stdout); - // Restores the text color. - SetConsoleTextAttribute(stdout_handle, old_color_attrs); -#else - printf("\033[0;3%sm", GetAnsiColorCode(color)); - vprintf(fmt, args); - printf("\033[m"); // Resets the terminal to default. -#endif // GTEST_OS_WINDOWS && !GTEST_OS_WINDOWS_MOBILE - va_end(args); -} - -void PrintFullTestCommentIfPresent(const TestInfo& test_info) { - const char* const type_param = test_info.type_param(); - const char* const value_param = test_info.value_param(); - - if (type_param != NULL || value_param != NULL) { - printf(", where "); - if (type_param != NULL) { - printf("TypeParam = %s", type_param); - if (value_param != NULL) - printf(" and "); - } - if (value_param != NULL) { - printf("GetParam() = %s", value_param); - } - } -} - -// This class implements the TestEventListener interface. -// -// Class PrettyUnitTestResultPrinter is copyable. -class PrettyUnitTestResultPrinter : public TestEventListener { - public: - PrettyUnitTestResultPrinter() {} - static void PrintTestName(const char * test_case, const char * test) { - printf("%s.%s", test_case, test); - } - - // The following methods override what's in the TestEventListener class. - virtual void OnTestProgramStart(const UnitTest& /*unit_test*/) {} - virtual void OnTestIterationStart(const UnitTest& unit_test, int iteration); - virtual void OnEnvironmentsSetUpStart(const UnitTest& unit_test); - virtual void OnEnvironmentsSetUpEnd(const UnitTest& /*unit_test*/) {} - virtual void OnTestCaseStart(const TestCase& test_case); - virtual void OnTestStart(const TestInfo& test_info); - virtual void OnTestPartResult(const TestPartResult& result); - virtual void OnTestEnd(const TestInfo& test_info); - virtual void OnTestCaseEnd(const TestCase& test_case); - virtual void OnEnvironmentsTearDownStart(const UnitTest& unit_test); - virtual void OnEnvironmentsTearDownEnd(const UnitTest& /*unit_test*/) {} - virtual void OnTestIterationEnd(const UnitTest& unit_test, int iteration); - virtual void OnTestProgramEnd(const UnitTest& /*unit_test*/) {} - - private: - static void PrintFailedTests(const UnitTest& unit_test); - - internal::String test_case_name_; -}; - - // Fired before each iteration of tests starts. -void PrettyUnitTestResultPrinter::OnTestIterationStart( - const UnitTest& unit_test, int iteration) { - if (GTEST_FLAG(repeat) != 1) - printf("\nRepeating all tests (iteration %d) . . .\n\n", iteration + 1); - - const char* const filter = GTEST_FLAG(filter).c_str(); - - // Prints the filter if it's not *. This reminds the user that some - // tests may be skipped. - if (!internal::String::CStringEquals(filter, kUniversalFilter)) { - ColoredPrintf(COLOR_YELLOW, - "Note: %s filter = %s\n", GTEST_NAME_, filter); - } - - if (internal::ShouldShard(kTestTotalShards, kTestShardIndex, false)) { - const Int32 shard_index = Int32FromEnvOrDie(kTestShardIndex, -1); - ColoredPrintf(COLOR_YELLOW, - "Note: This is test shard %d of %s.\n", - static_cast(shard_index) + 1, - internal::posix::GetEnv(kTestTotalShards)); - } - - if (GTEST_FLAG(shuffle)) { - ColoredPrintf(COLOR_YELLOW, - "Note: Randomizing tests' orders with a seed of %d .\n", - unit_test.random_seed()); - } - - ColoredPrintf(COLOR_GREEN, "[==========] "); - printf("Running %s from %s.\n", - FormatTestCount(unit_test.test_to_run_count()).c_str(), - FormatTestCaseCount(unit_test.test_case_to_run_count()).c_str()); - fflush(stdout); -} - -void PrettyUnitTestResultPrinter::OnEnvironmentsSetUpStart( - const UnitTest& /*unit_test*/) { - ColoredPrintf(COLOR_GREEN, "[----------] "); - printf("Global test environment set-up.\n"); - fflush(stdout); -} - -void PrettyUnitTestResultPrinter::OnTestCaseStart(const TestCase& test_case) { - test_case_name_ = test_case.name(); - const internal::String counts = - FormatCountableNoun(test_case.test_to_run_count(), "test", "tests"); - ColoredPrintf(COLOR_GREEN, "[----------] "); - printf("%s from %s", counts.c_str(), test_case_name_.c_str()); - if (test_case.type_param() == NULL) { - printf("\n"); - } else { - printf(", where TypeParam = %s\n", test_case.type_param()); - } - fflush(stdout); -} - -void PrettyUnitTestResultPrinter::OnTestStart(const TestInfo& test_info) { - ColoredPrintf(COLOR_GREEN, "[ RUN ] "); - PrintTestName(test_case_name_.c_str(), test_info.name()); - printf("\n"); - fflush(stdout); -} - -// Called after an assertion failure. -void PrettyUnitTestResultPrinter::OnTestPartResult( - const TestPartResult& result) { - // If the test part succeeded, we don't need to do anything. - if (result.type() == TestPartResult::kSuccess) - return; - - // Print failure message from the assertion (e.g. expected this and got that). - PrintTestPartResult(result); - fflush(stdout); -} - -void PrettyUnitTestResultPrinter::OnTestEnd(const TestInfo& test_info) { - if (test_info.result()->Passed()) { - ColoredPrintf(COLOR_GREEN, "[ OK ] "); - } else { - ColoredPrintf(COLOR_RED, "[ FAILED ] "); - } - PrintTestName(test_case_name_.c_str(), test_info.name()); - if (test_info.result()->Failed()) - PrintFullTestCommentIfPresent(test_info); - - if (GTEST_FLAG(print_time)) { - printf(" (%s ms)\n", internal::StreamableToString( - test_info.result()->elapsed_time()).c_str()); - } else { - printf("\n"); - } - fflush(stdout); -} - -void PrettyUnitTestResultPrinter::OnTestCaseEnd(const TestCase& test_case) { - if (!GTEST_FLAG(print_time)) return; - - test_case_name_ = test_case.name(); - const internal::String counts = - FormatCountableNoun(test_case.test_to_run_count(), "test", "tests"); - ColoredPrintf(COLOR_GREEN, "[----------] "); - printf("%s from %s (%s ms total)\n\n", - counts.c_str(), test_case_name_.c_str(), - internal::StreamableToString(test_case.elapsed_time()).c_str()); - fflush(stdout); -} - -void PrettyUnitTestResultPrinter::OnEnvironmentsTearDownStart( - const UnitTest& /*unit_test*/) { - ColoredPrintf(COLOR_GREEN, "[----------] "); - printf("Global test environment tear-down\n"); - fflush(stdout); -} - -// Internal helper for printing the list of failed tests. -void PrettyUnitTestResultPrinter::PrintFailedTests(const UnitTest& unit_test) { - const int failed_test_count = unit_test.failed_test_count(); - if (failed_test_count == 0) { - return; - } - - for (int i = 0; i < unit_test.total_test_case_count(); ++i) { - const TestCase& test_case = *unit_test.GetTestCase(i); - if (!test_case.should_run() || (test_case.failed_test_count() == 0)) { - continue; - } - for (int j = 0; j < test_case.total_test_count(); ++j) { - const TestInfo& test_info = *test_case.GetTestInfo(j); - if (!test_info.should_run() || test_info.result()->Passed()) { - continue; - } - ColoredPrintf(COLOR_RED, "[ FAILED ] "); - printf("%s.%s", test_case.name(), test_info.name()); - PrintFullTestCommentIfPresent(test_info); - printf("\n"); - } - } -} - -void PrettyUnitTestResultPrinter::OnTestIterationEnd(const UnitTest& unit_test, - int /*iteration*/) { - ColoredPrintf(COLOR_GREEN, "[==========] "); - printf("%s from %s ran.", - FormatTestCount(unit_test.test_to_run_count()).c_str(), - FormatTestCaseCount(unit_test.test_case_to_run_count()).c_str()); - if (GTEST_FLAG(print_time)) { - printf(" (%s ms total)", - internal::StreamableToString(unit_test.elapsed_time()).c_str()); - } - printf("\n"); - ColoredPrintf(COLOR_GREEN, "[ PASSED ] "); - printf("%s.\n", FormatTestCount(unit_test.successful_test_count()).c_str()); - - int num_failures = unit_test.failed_test_count(); - if (!unit_test.Passed()) { - const int failed_test_count = unit_test.failed_test_count(); - ColoredPrintf(COLOR_RED, "[ FAILED ] "); - printf("%s, listed below:\n", FormatTestCount(failed_test_count).c_str()); - PrintFailedTests(unit_test); - printf("\n%2d FAILED %s\n", num_failures, - num_failures == 1 ? "TEST" : "TESTS"); - } - - int num_disabled = unit_test.disabled_test_count(); - if (num_disabled && !GTEST_FLAG(also_run_disabled_tests)) { - if (!num_failures) { - printf("\n"); // Add a spacer if no FAILURE banner is displayed. - } - ColoredPrintf(COLOR_YELLOW, - " YOU HAVE %d DISABLED %s\n\n", - num_disabled, - num_disabled == 1 ? "TEST" : "TESTS"); - } - // Ensure that Google Test output is printed before, e.g., heapchecker output. - fflush(stdout); -} - -// End PrettyUnitTestResultPrinter - -// class TestEventRepeater -// -// This class forwards events to other event listeners. -class TestEventRepeater : public TestEventListener { - public: - TestEventRepeater() : forwarding_enabled_(true) {} - virtual ~TestEventRepeater(); - void Append(TestEventListener *listener); - TestEventListener* Release(TestEventListener* listener); - - // Controls whether events will be forwarded to listeners_. Set to false - // in death test child processes. - bool forwarding_enabled() const { return forwarding_enabled_; } - void set_forwarding_enabled(bool enable) { forwarding_enabled_ = enable; } - - virtual void OnTestProgramStart(const UnitTest& unit_test); - virtual void OnTestIterationStart(const UnitTest& unit_test, int iteration); - virtual void OnEnvironmentsSetUpStart(const UnitTest& unit_test); - virtual void OnEnvironmentsSetUpEnd(const UnitTest& unit_test); - virtual void OnTestCaseStart(const TestCase& test_case); - virtual void OnTestStart(const TestInfo& test_info); - virtual void OnTestPartResult(const TestPartResult& result); - virtual void OnTestEnd(const TestInfo& test_info); - virtual void OnTestCaseEnd(const TestCase& test_case); - virtual void OnEnvironmentsTearDownStart(const UnitTest& unit_test); - virtual void OnEnvironmentsTearDownEnd(const UnitTest& unit_test); - virtual void OnTestIterationEnd(const UnitTest& unit_test, int iteration); - virtual void OnTestProgramEnd(const UnitTest& unit_test); - - private: - // Controls whether events will be forwarded to listeners_. Set to false - // in death test child processes. - bool forwarding_enabled_; - // The list of listeners that receive events. - std::vector listeners_; - - GTEST_DISALLOW_COPY_AND_ASSIGN_(TestEventRepeater); -}; - -TestEventRepeater::~TestEventRepeater() { - ForEach(listeners_, Delete); -} - -void TestEventRepeater::Append(TestEventListener *listener) { - listeners_.push_back(listener); -} - -// TODO(vladl@google.com): Factor the search functionality into Vector::Find. -TestEventListener* TestEventRepeater::Release(TestEventListener *listener) { - for (size_t i = 0; i < listeners_.size(); ++i) { - if (listeners_[i] == listener) { - listeners_.erase(listeners_.begin() + i); - return listener; - } - } - - return NULL; -} - -// Since most methods are very similar, use macros to reduce boilerplate. -// This defines a member that forwards the call to all listeners. -#define GTEST_REPEATER_METHOD_(Name, Type) \ -void TestEventRepeater::Name(const Type& parameter) { \ - if (forwarding_enabled_) { \ - for (size_t i = 0; i < listeners_.size(); i++) { \ - listeners_[i]->Name(parameter); \ - } \ - } \ -} -// This defines a member that forwards the call to all listeners in reverse -// order. -#define GTEST_REVERSE_REPEATER_METHOD_(Name, Type) \ -void TestEventRepeater::Name(const Type& parameter) { \ - if (forwarding_enabled_) { \ - for (int i = static_cast(listeners_.size()) - 1; i >= 0; i--) { \ - listeners_[i]->Name(parameter); \ - } \ - } \ -} - -GTEST_REPEATER_METHOD_(OnTestProgramStart, UnitTest) -GTEST_REPEATER_METHOD_(OnEnvironmentsSetUpStart, UnitTest) -GTEST_REPEATER_METHOD_(OnTestCaseStart, TestCase) -GTEST_REPEATER_METHOD_(OnTestStart, TestInfo) -GTEST_REPEATER_METHOD_(OnTestPartResult, TestPartResult) -GTEST_REPEATER_METHOD_(OnEnvironmentsTearDownStart, UnitTest) -GTEST_REVERSE_REPEATER_METHOD_(OnEnvironmentsSetUpEnd, UnitTest) -GTEST_REVERSE_REPEATER_METHOD_(OnEnvironmentsTearDownEnd, UnitTest) -GTEST_REVERSE_REPEATER_METHOD_(OnTestEnd, TestInfo) -GTEST_REVERSE_REPEATER_METHOD_(OnTestCaseEnd, TestCase) -GTEST_REVERSE_REPEATER_METHOD_(OnTestProgramEnd, UnitTest) - -#undef GTEST_REPEATER_METHOD_ -#undef GTEST_REVERSE_REPEATER_METHOD_ - -void TestEventRepeater::OnTestIterationStart(const UnitTest& unit_test, - int iteration) { - if (forwarding_enabled_) { - for (size_t i = 0; i < listeners_.size(); i++) { - listeners_[i]->OnTestIterationStart(unit_test, iteration); - } - } -} - -void TestEventRepeater::OnTestIterationEnd(const UnitTest& unit_test, - int iteration) { - if (forwarding_enabled_) { - for (int i = static_cast(listeners_.size()) - 1; i >= 0; i--) { - listeners_[i]->OnTestIterationEnd(unit_test, iteration); - } - } -} - -// End TestEventRepeater - -// This class generates an XML output file. -class XmlUnitTestResultPrinter : public EmptyTestEventListener { - public: - explicit XmlUnitTestResultPrinter(const char* output_file); - - virtual void OnTestIterationEnd(const UnitTest& unit_test, int iteration); - - private: - // Is c a whitespace character that is normalized to a space character - // when it appears in an XML attribute value? - static bool IsNormalizableWhitespace(char c) { - return c == 0x9 || c == 0xA || c == 0xD; - } - - // May c appear in a well-formed XML document? - static bool IsValidXmlCharacter(char c) { - return IsNormalizableWhitespace(c) || c >= 0x20; - } - - // Returns an XML-escaped copy of the input string str. If - // is_attribute is true, the text is meant to appear as an attribute - // value, and normalizable whitespace is preserved by replacing it - // with character references. - static String EscapeXml(const char* str, bool is_attribute); - - // Returns the given string with all characters invalid in XML removed. - static string RemoveInvalidXmlCharacters(const string& str); - - // Convenience wrapper around EscapeXml when str is an attribute value. - static String EscapeXmlAttribute(const char* str) { - return EscapeXml(str, true); - } - - // Convenience wrapper around EscapeXml when str is not an attribute value. - static String EscapeXmlText(const char* str) { return EscapeXml(str, false); } - - // Streams an XML CDATA section, escaping invalid CDATA sequences as needed. - static void OutputXmlCDataSection(::std::ostream* stream, const char* data); - - // Streams an XML representation of a TestInfo object. - static void OutputXmlTestInfo(::std::ostream* stream, - const char* test_case_name, - const TestInfo& test_info); - - // Prints an XML representation of a TestCase object - static void PrintXmlTestCase(FILE* out, const TestCase& test_case); - - // Prints an XML summary of unit_test to output stream out. - static void PrintXmlUnitTest(FILE* out, const UnitTest& unit_test); - - // Produces a string representing the test properties in a result as space - // delimited XML attributes based on the property key="value" pairs. - // When the String is not empty, it includes a space at the beginning, - // to delimit this attribute from prior attributes. - static String TestPropertiesAsXmlAttributes(const TestResult& result); - - // The output file. - const String output_file_; - - GTEST_DISALLOW_COPY_AND_ASSIGN_(XmlUnitTestResultPrinter); -}; - -// Creates a new XmlUnitTestResultPrinter. -XmlUnitTestResultPrinter::XmlUnitTestResultPrinter(const char* output_file) - : output_file_(output_file) { - if (output_file_.c_str() == NULL || output_file_.empty()) { - fprintf(stderr, "XML output file may not be null\n"); - fflush(stderr); - exit(EXIT_FAILURE); - } -} - -// Called after the unit test ends. -void XmlUnitTestResultPrinter::OnTestIterationEnd(const UnitTest& unit_test, - int /*iteration*/) { - FILE* xmlout = NULL; - FilePath output_file(output_file_); - FilePath output_dir(output_file.RemoveFileName()); - - if (output_dir.CreateDirectoriesRecursively()) { - xmlout = posix::FOpen(output_file_.c_str(), "w"); - } - if (xmlout == NULL) { - // TODO(wan): report the reason of the failure. - // - // We don't do it for now as: - // - // 1. There is no urgent need for it. - // 2. It's a bit involved to make the errno variable thread-safe on - // all three operating systems (Linux, Windows, and Mac OS). - // 3. To interpret the meaning of errno in a thread-safe way, - // we need the strerror_r() function, which is not available on - // Windows. - fprintf(stderr, - "Unable to open file \"%s\"\n", - output_file_.c_str()); - fflush(stderr); - exit(EXIT_FAILURE); - } - PrintXmlUnitTest(xmlout, unit_test); - fclose(xmlout); -} - -// Returns an XML-escaped copy of the input string str. If is_attribute -// is true, the text is meant to appear as an attribute value, and -// normalizable whitespace is preserved by replacing it with character -// references. -// -// Invalid XML characters in str, if any, are stripped from the output. -// It is expected that most, if not all, of the text processed by this -// module will consist of ordinary English text. -// If this module is ever modified to produce version 1.1 XML output, -// most invalid characters can be retained using character references. -// TODO(wan): It might be nice to have a minimally invasive, human-readable -// escaping scheme for invalid characters, rather than dropping them. -String XmlUnitTestResultPrinter::EscapeXml(const char* str, bool is_attribute) { - Message m; - - if (str != NULL) { - for (const char* src = str; *src; ++src) { - switch (*src) { - case '<': - m << "<"; - break; - case '>': - m << ">"; - break; - case '&': - m << "&"; - break; - case '\'': - if (is_attribute) - m << "'"; - else - m << '\''; - break; - case '"': - if (is_attribute) - m << """; - else - m << '"'; - break; - default: - if (IsValidXmlCharacter(*src)) { - if (is_attribute && IsNormalizableWhitespace(*src)) - m << String::Format("&#x%02X;", unsigned(*src)); - else - m << *src; - } - break; - } - } - } - - return m.GetString(); -} - -// Returns the given string with all characters invalid in XML removed. -// Currently invalid characters are dropped from the string. An -// alternative is to replace them with certain characters such as . or ?. -string XmlUnitTestResultPrinter::RemoveInvalidXmlCharacters(const string& str) { - string output; - output.reserve(str.size()); - for (string::const_iterator it = str.begin(); it != str.end(); ++it) - if (IsValidXmlCharacter(*it)) - output.push_back(*it); - - return output; -} - -// The following routines generate an XML representation of a UnitTest -// object. -// -// This is how Google Test concepts map to the DTD: -// -// <-- corresponds to a UnitTest object -// <-- corresponds to a TestCase object -// <-- corresponds to a TestInfo object -// ... -// ... -// ... -// <-- individual assertion failures -// -// -// - -// Formats the given time in milliseconds as seconds. -std::string FormatTimeInMillisAsSeconds(TimeInMillis ms) { - ::std::stringstream ss; - ss << ms/1000.0; - return ss.str(); -} - -// Streams an XML CDATA section, escaping invalid CDATA sequences as needed. -void XmlUnitTestResultPrinter::OutputXmlCDataSection(::std::ostream* stream, - const char* data) { - const char* segment = data; - *stream << ""); - if (next_segment != NULL) { - stream->write( - segment, static_cast(next_segment - segment)); - *stream << "]]>]]>"); - } else { - *stream << segment; - break; - } - } - *stream << "]]>"; -} - -// Prints an XML representation of a TestInfo object. -// TODO(wan): There is also value in printing properties with the plain printer. -void XmlUnitTestResultPrinter::OutputXmlTestInfo(::std::ostream* stream, - const char* test_case_name, - const TestInfo& test_info) { - const TestResult& result = *test_info.result(); - *stream << " \n"; - *stream << " "; - const string location = internal::FormatCompilerIndependentFileLocation( - part.file_name(), part.line_number()); - const string message = location + "\n" + part.message(); - OutputXmlCDataSection(stream, - RemoveInvalidXmlCharacters(message).c_str()); - *stream << "\n"; - } - } - - if (failures == 0) - *stream << " />\n"; - else - *stream << " \n"; -} - -// Prints an XML representation of a TestCase object -void XmlUnitTestResultPrinter::PrintXmlTestCase(FILE* out, - const TestCase& test_case) { - fprintf(out, - " \n", - FormatTimeInMillisAsSeconds(test_case.elapsed_time()).c_str()); - for (int i = 0; i < test_case.total_test_count(); ++i) { - ::std::stringstream stream; - OutputXmlTestInfo(&stream, test_case.name(), *test_case.GetTestInfo(i)); - fprintf(out, "%s", StringStreamToString(&stream).c_str()); - } - fprintf(out, " \n"); -} - -// Prints an XML summary of unit_test to output stream out. -void XmlUnitTestResultPrinter::PrintXmlUnitTest(FILE* out, - const UnitTest& unit_test) { - fprintf(out, "\n"); - fprintf(out, - "\n"); - for (int i = 0; i < unit_test.total_test_case_count(); ++i) - PrintXmlTestCase(out, *unit_test.GetTestCase(i)); - fprintf(out, "\n"); -} - -// Produces a string representing the test properties in a result as space -// delimited XML attributes based on the property key="value" pairs. -String XmlUnitTestResultPrinter::TestPropertiesAsXmlAttributes( - const TestResult& result) { - Message attributes; - for (int i = 0; i < result.test_property_count(); ++i) { - const TestProperty& property = result.GetTestProperty(i); - attributes << " " << property.key() << "=" - << "\"" << EscapeXmlAttribute(property.value()) << "\""; - } - return attributes.GetString(); -} - -// End XmlUnitTestResultPrinter - -#if GTEST_CAN_STREAM_RESULTS_ - -// Streams test results to the given port on the given host machine. -class StreamingListener : public EmptyTestEventListener { - public: - // Escapes '=', '&', '%', and '\n' characters in str as "%xx". - static string UrlEncode(const char* str); - - StreamingListener(const string& host, const string& port) - : sockfd_(-1), host_name_(host), port_num_(port) { - MakeConnection(); - Send("gtest_streaming_protocol_version=1.0\n"); - } - - virtual ~StreamingListener() { - if (sockfd_ != -1) - CloseConnection(); - } - - void OnTestProgramStart(const UnitTest& /* unit_test */) { - Send("event=TestProgramStart\n"); - } - - void OnTestProgramEnd(const UnitTest& unit_test) { - // Note that Google Test current only report elapsed time for each - // test iteration, not for the entire test program. - Send(String::Format("event=TestProgramEnd&passed=%d\n", - unit_test.Passed())); - - // Notify the streaming server to stop. - CloseConnection(); - } - - void OnTestIterationStart(const UnitTest& /* unit_test */, int iteration) { - Send(String::Format("event=TestIterationStart&iteration=%d\n", - iteration)); - } - - void OnTestIterationEnd(const UnitTest& unit_test, int /* iteration */) { - Send(String::Format("event=TestIterationEnd&passed=%d&elapsed_time=%sms\n", - unit_test.Passed(), - StreamableToString(unit_test.elapsed_time()).c_str())); - } - - void OnTestCaseStart(const TestCase& test_case) { - Send(String::Format("event=TestCaseStart&name=%s\n", test_case.name())); - } - - void OnTestCaseEnd(const TestCase& test_case) { - Send(String::Format("event=TestCaseEnd&passed=%d&elapsed_time=%sms\n", - test_case.Passed(), - StreamableToString(test_case.elapsed_time()).c_str())); - } - - void OnTestStart(const TestInfo& test_info) { - Send(String::Format("event=TestStart&name=%s\n", test_info.name())); - } - - void OnTestEnd(const TestInfo& test_info) { - Send(String::Format( - "event=TestEnd&passed=%d&elapsed_time=%sms\n", - (test_info.result())->Passed(), - StreamableToString((test_info.result())->elapsed_time()).c_str())); - } - - void OnTestPartResult(const TestPartResult& test_part_result) { - const char* file_name = test_part_result.file_name(); - if (file_name == NULL) - file_name = ""; - Send(String::Format("event=TestPartResult&file=%s&line=%d&message=", - UrlEncode(file_name).c_str(), - test_part_result.line_number())); - Send(UrlEncode(test_part_result.message()) + "\n"); - } - - private: - // Creates a client socket and connects to the server. - void MakeConnection(); - - // Closes the socket. - void CloseConnection() { - GTEST_CHECK_(sockfd_ != -1) - << "CloseConnection() can be called only when there is a connection."; - - close(sockfd_); - sockfd_ = -1; - } - - // Sends a string to the socket. - void Send(const string& message) { - GTEST_CHECK_(sockfd_ != -1) - << "Send() can be called only when there is a connection."; - - const int len = static_cast(message.length()); - if (write(sockfd_, message.c_str(), len) != len) { - GTEST_LOG_(WARNING) - << "stream_result_to: failed to stream to " - << host_name_ << ":" << port_num_; - } - } - - int sockfd_; // socket file descriptor - const string host_name_; - const string port_num_; - - GTEST_DISALLOW_COPY_AND_ASSIGN_(StreamingListener); -}; // class StreamingListener - -// Checks if str contains '=', '&', '%' or '\n' characters. If yes, -// replaces them by "%xx" where xx is their hexadecimal value. For -// example, replaces "=" with "%3D". This algorithm is O(strlen(str)) -// in both time and space -- important as the input str may contain an -// arbitrarily long test failure message and stack trace. -string StreamingListener::UrlEncode(const char* str) { - string result; - result.reserve(strlen(str) + 1); - for (char ch = *str; ch != '\0'; ch = *++str) { - switch (ch) { - case '%': - case '=': - case '&': - case '\n': - result.append(String::Format("%%%02x", static_cast(ch))); - break; - default: - result.push_back(ch); - break; - } - } - return result; -} - -void StreamingListener::MakeConnection() { - GTEST_CHECK_(sockfd_ == -1) - << "MakeConnection() can't be called when there is already a connection."; - - addrinfo hints; - memset(&hints, 0, sizeof(hints)); - hints.ai_family = AF_UNSPEC; // To allow both IPv4 and IPv6 addresses. - hints.ai_socktype = SOCK_STREAM; - addrinfo* servinfo = NULL; - - // Use the getaddrinfo() to get a linked list of IP addresses for - // the given host name. - const int error_num = getaddrinfo( - host_name_.c_str(), port_num_.c_str(), &hints, &servinfo); - if (error_num != 0) { - GTEST_LOG_(WARNING) << "stream_result_to: getaddrinfo() failed: " - << gai_strerror(error_num); - } - - // Loop through all the results and connect to the first we can. - for (addrinfo* cur_addr = servinfo; sockfd_ == -1 && cur_addr != NULL; - cur_addr = cur_addr->ai_next) { - sockfd_ = socket( - cur_addr->ai_family, cur_addr->ai_socktype, cur_addr->ai_protocol); - if (sockfd_ != -1) { - // Connect the client socket to the server socket. - if (connect(sockfd_, cur_addr->ai_addr, cur_addr->ai_addrlen) == -1) { - close(sockfd_); - sockfd_ = -1; - } - } - } - - freeaddrinfo(servinfo); // all done with this structure - - if (sockfd_ == -1) { - GTEST_LOG_(WARNING) << "stream_result_to: failed to connect to " - << host_name_ << ":" << port_num_; - } -} - -// End of class Streaming Listener -#endif // GTEST_CAN_STREAM_RESULTS__ - -// Class ScopedTrace - -// Pushes the given source file location and message onto a per-thread -// trace stack maintained by Google Test. -// L < UnitTest::mutex_ -ScopedTrace::ScopedTrace(const char* file, int line, const Message& message) { - TraceInfo trace; - trace.file = file; - trace.line = line; - trace.message = message.GetString(); - - UnitTest::GetInstance()->PushGTestTrace(trace); -} - -// Pops the info pushed by the c'tor. -// L < UnitTest::mutex_ -ScopedTrace::~ScopedTrace() { - UnitTest::GetInstance()->PopGTestTrace(); -} - - -// class OsStackTraceGetter - -// Returns the current OS stack trace as a String. Parameters: -// -// max_depth - the maximum number of stack frames to be included -// in the trace. -// skip_count - the number of top frames to be skipped; doesn't count -// against max_depth. -// -// L < mutex_ -// We use "L < mutex_" to denote that the function may acquire mutex_. -String OsStackTraceGetter::CurrentStackTrace(int, int) { - return String(""); -} - -// L < mutex_ -void OsStackTraceGetter::UponLeavingGTest() { -} - -const char* const -OsStackTraceGetter::kElidedFramesMarker = - "... " GTEST_NAME_ " internal frames ..."; - -} // namespace internal - -// class TestEventListeners - -TestEventListeners::TestEventListeners() - : repeater_(new internal::TestEventRepeater()), - default_result_printer_(NULL), - default_xml_generator_(NULL) { -} - -TestEventListeners::~TestEventListeners() { delete repeater_; } - -// Returns the standard listener responsible for the default console -// output. Can be removed from the listeners list to shut down default -// console output. Note that removing this object from the listener list -// with Release transfers its ownership to the user. -void TestEventListeners::Append(TestEventListener* listener) { - repeater_->Append(listener); -} - -// Removes the given event listener from the list and returns it. It then -// becomes the caller's responsibility to delete the listener. Returns -// NULL if the listener is not found in the list. -TestEventListener* TestEventListeners::Release(TestEventListener* listener) { - if (listener == default_result_printer_) - default_result_printer_ = NULL; - else if (listener == default_xml_generator_) - default_xml_generator_ = NULL; - return repeater_->Release(listener); -} - -// Returns repeater that broadcasts the TestEventListener events to all -// subscribers. -TestEventListener* TestEventListeners::repeater() { return repeater_; } - -// Sets the default_result_printer attribute to the provided listener. -// The listener is also added to the listener list and previous -// default_result_printer is removed from it and deleted. The listener can -// also be NULL in which case it will not be added to the list. Does -// nothing if the previous and the current listener objects are the same. -void TestEventListeners::SetDefaultResultPrinter(TestEventListener* listener) { - if (default_result_printer_ != listener) { - // It is an error to pass this method a listener that is already in the - // list. - delete Release(default_result_printer_); - default_result_printer_ = listener; - if (listener != NULL) - Append(listener); - } -} - -// Sets the default_xml_generator attribute to the provided listener. The -// listener is also added to the listener list and previous -// default_xml_generator is removed from it and deleted. The listener can -// also be NULL in which case it will not be added to the list. Does -// nothing if the previous and the current listener objects are the same. -void TestEventListeners::SetDefaultXmlGenerator(TestEventListener* listener) { - if (default_xml_generator_ != listener) { - // It is an error to pass this method a listener that is already in the - // list. - delete Release(default_xml_generator_); - default_xml_generator_ = listener; - if (listener != NULL) - Append(listener); - } -} - -// Controls whether events will be forwarded by the repeater to the -// listeners in the list. -bool TestEventListeners::EventForwardingEnabled() const { - return repeater_->forwarding_enabled(); -} - -void TestEventListeners::SuppressEventForwarding() { - repeater_->set_forwarding_enabled(false); -} - -// class UnitTest - -// Gets the singleton UnitTest object. The first time this method is -// called, a UnitTest object is constructed and returned. Consecutive -// calls will return the same object. -// -// We don't protect this under mutex_ as a user is not supposed to -// call this before main() starts, from which point on the return -// value will never change. -UnitTest * UnitTest::GetInstance() { - // When compiled with MSVC 7.1 in optimized mode, destroying the - // UnitTest object upon exiting the program messes up the exit code, - // causing successful tests to appear failed. We have to use a - // different implementation in this case to bypass the compiler bug. - // This implementation makes the compiler happy, at the cost of - // leaking the UnitTest object. - - // CodeGear C++Builder insists on a public destructor for the - // default implementation. Use this implementation to keep good OO - // design with private destructor. - -#if (_MSC_VER == 1310 && !defined(_DEBUG)) || defined(__BORLANDC__) - static UnitTest* const instance = new UnitTest; - return instance; -#else - static UnitTest instance; - return &instance; -#endif // (_MSC_VER == 1310 && !defined(_DEBUG)) || defined(__BORLANDC__) -} - -// Gets the number of successful test cases. -int UnitTest::successful_test_case_count() const { - return impl()->successful_test_case_count(); -} - -// Gets the number of failed test cases. -int UnitTest::failed_test_case_count() const { - return impl()->failed_test_case_count(); -} - -// Gets the number of all test cases. -int UnitTest::total_test_case_count() const { - return impl()->total_test_case_count(); -} - -// Gets the number of all test cases that contain at least one test -// that should run. -int UnitTest::test_case_to_run_count() const { - return impl()->test_case_to_run_count(); -} - -// Gets the number of successful tests. -int UnitTest::successful_test_count() const { - return impl()->successful_test_count(); -} - -// Gets the number of failed tests. -int UnitTest::failed_test_count() const { return impl()->failed_test_count(); } - -// Gets the number of disabled tests. -int UnitTest::disabled_test_count() const { - return impl()->disabled_test_count(); -} - -// Gets the number of all tests. -int UnitTest::total_test_count() const { return impl()->total_test_count(); } - -// Gets the number of tests that should run. -int UnitTest::test_to_run_count() const { return impl()->test_to_run_count(); } - -// Gets the elapsed time, in milliseconds. -internal::TimeInMillis UnitTest::elapsed_time() const { - return impl()->elapsed_time(); -} - -// Returns true iff the unit test passed (i.e. all test cases passed). -bool UnitTest::Passed() const { return impl()->Passed(); } - -// Returns true iff the unit test failed (i.e. some test case failed -// or something outside of all tests failed). -bool UnitTest::Failed() const { return impl()->Failed(); } - -// Gets the i-th test case among all the test cases. i can range from 0 to -// total_test_case_count() - 1. If i is not in that range, returns NULL. -const TestCase* UnitTest::GetTestCase(int i) const { - return impl()->GetTestCase(i); -} - -// Gets the i-th test case among all the test cases. i can range from 0 to -// total_test_case_count() - 1. If i is not in that range, returns NULL. -TestCase* UnitTest::GetMutableTestCase(int i) { - return impl()->GetMutableTestCase(i); -} - -// Returns the list of event listeners that can be used to track events -// inside Google Test. -TestEventListeners& UnitTest::listeners() { - return *impl()->listeners(); -} - -// Registers and returns a global test environment. When a test -// program is run, all global test environments will be set-up in the -// order they were registered. After all tests in the program have -// finished, all global test environments will be torn-down in the -// *reverse* order they were registered. -// -// The UnitTest object takes ownership of the given environment. -// -// We don't protect this under mutex_, as we only support calling it -// from the main thread. -Environment* UnitTest::AddEnvironment(Environment* env) { - if (env == NULL) { - return NULL; - } - - impl_->environments().push_back(env); - return env; -} - -// Adds a TestPartResult to the current TestResult object. All Google Test -// assertion macros (e.g. ASSERT_TRUE, EXPECT_EQ, etc) eventually call -// this to report their results. The user code should use the -// assertion macros instead of calling this directly. -// L < mutex_ -void UnitTest::AddTestPartResult(TestPartResult::Type result_type, - const char* file_name, - int line_number, - const internal::String& message, - const internal::String& os_stack_trace) { - Message msg; - msg << message; - - internal::MutexLock lock(&mutex_); - if (impl_->gtest_trace_stack().size() > 0) { - msg << "\n" << GTEST_NAME_ << " trace:"; - - for (int i = static_cast(impl_->gtest_trace_stack().size()); - i > 0; --i) { - const internal::TraceInfo& trace = impl_->gtest_trace_stack()[i - 1]; - msg << "\n" << internal::FormatFileLocation(trace.file, trace.line) - << " " << trace.message; - } - } - - if (os_stack_trace.c_str() != NULL && !os_stack_trace.empty()) { - msg << internal::kStackTraceMarker << os_stack_trace; - } - - const TestPartResult result = - TestPartResult(result_type, file_name, line_number, - msg.GetString().c_str()); - impl_->GetTestPartResultReporterForCurrentThread()-> - ReportTestPartResult(result); - - if (result_type != TestPartResult::kSuccess) { - // gtest_break_on_failure takes precedence over - // gtest_throw_on_failure. This allows a user to set the latter - // in the code (perhaps in order to use Google Test assertions - // with another testing framework) and specify the former on the - // command line for debugging. - if (GTEST_FLAG(break_on_failure)) { -#if GTEST_OS_WINDOWS - // Using DebugBreak on Windows allows gtest to still break into a debugger - // when a failure happens and both the --gtest_break_on_failure and - // the --gtest_catch_exceptions flags are specified. - DebugBreak(); -#else - // Dereference NULL through a volatile pointer to prevent the compiler - // from removing. We use this rather than abort() or __builtin_trap() for - // portability: Symbian doesn't implement abort() well, and some debuggers - // don't correctly trap abort(). - *static_cast(NULL) = 1; -#endif // GTEST_OS_WINDOWS - } else if (GTEST_FLAG(throw_on_failure)) { -#if GTEST_HAS_EXCEPTIONS - throw GoogleTestFailureException(result); -#else - // We cannot call abort() as it generates a pop-up in debug mode - // that cannot be suppressed in VC 7.1 or below. - exit(1); -#endif - } - } -} - -// Creates and adds a property to the current TestResult. If a property matching -// the supplied value already exists, updates its value instead. -void UnitTest::RecordPropertyForCurrentTest(const char* key, - const char* value) { - const TestProperty test_property(key, value); - impl_->current_test_result()->RecordProperty(test_property); -} - -// Runs all tests in this UnitTest object and prints the result. -// Returns 0 if successful, or 1 otherwise. -// -// We don't protect this under mutex_, as we only support calling it -// from the main thread. -int UnitTest::Run() { - // Captures the value of GTEST_FLAG(catch_exceptions). This value will be - // used for the duration of the program. - impl()->set_catch_exceptions(GTEST_FLAG(catch_exceptions)); - -#if GTEST_HAS_SEH - const bool in_death_test_child_process = - internal::GTEST_FLAG(internal_run_death_test).length() > 0; - - // Either the user wants Google Test to catch exceptions thrown by the - // tests or this is executing in the context of death test child - // process. In either case the user does not want to see pop-up dialogs - // about crashes - they are expected. - if (impl()->catch_exceptions() || in_death_test_child_process) { - -# if !GTEST_OS_WINDOWS_MOBILE - // SetErrorMode doesn't exist on CE. - SetErrorMode(SEM_FAILCRITICALERRORS | SEM_NOALIGNMENTFAULTEXCEPT | - SEM_NOGPFAULTERRORBOX | SEM_NOOPENFILEERRORBOX); -# endif // !GTEST_OS_WINDOWS_MOBILE - -# if (defined(_MSC_VER) || GTEST_OS_WINDOWS_MINGW) && !GTEST_OS_WINDOWS_MOBILE - // Death test children can be terminated with _abort(). On Windows, - // _abort() can show a dialog with a warning message. This forces the - // abort message to go to stderr instead. - _set_error_mode(_OUT_TO_STDERR); -# endif - -# if _MSC_VER >= 1400 && !GTEST_OS_WINDOWS_MOBILE - // In the debug version, Visual Studio pops up a separate dialog - // offering a choice to debug the aborted program. We need to suppress - // this dialog or it will pop up for every EXPECT/ASSERT_DEATH statement - // executed. Google Test will notify the user of any unexpected - // failure via stderr. - // - // VC++ doesn't define _set_abort_behavior() prior to the version 8.0. - // Users of prior VC versions shall suffer the agony and pain of - // clicking through the countless debug dialogs. - // TODO(vladl@google.com): find a way to suppress the abort dialog() in the - // debug mode when compiled with VC 7.1 or lower. - if (!GTEST_FLAG(break_on_failure)) - _set_abort_behavior( - 0x0, // Clear the following flags: - _WRITE_ABORT_MSG | _CALL_REPORTFAULT); // pop-up window, core dump. -# endif - - } -#endif // GTEST_HAS_SEH - - return internal::HandleExceptionsInMethodIfSupported( - impl(), - &internal::UnitTestImpl::RunAllTests, - "auxiliary test code (environments or event listeners)") ? 0 : 1; -} - -// Returns the working directory when the first TEST() or TEST_F() was -// executed. -const char* UnitTest::original_working_dir() const { - return impl_->original_working_dir_.c_str(); -} - -// Returns the TestCase object for the test that's currently running, -// or NULL if no test is running. -// L < mutex_ -const TestCase* UnitTest::current_test_case() const { - internal::MutexLock lock(&mutex_); - return impl_->current_test_case(); -} - -// Returns the TestInfo object for the test that's currently running, -// or NULL if no test is running. -// L < mutex_ -const TestInfo* UnitTest::current_test_info() const { - internal::MutexLock lock(&mutex_); - return impl_->current_test_info(); -} - -// Returns the random seed used at the start of the current test run. -int UnitTest::random_seed() const { return impl_->random_seed(); } - -#if GTEST_HAS_PARAM_TEST -// Returns ParameterizedTestCaseRegistry object used to keep track of -// value-parameterized tests and instantiate and register them. -// L < mutex_ -internal::ParameterizedTestCaseRegistry& - UnitTest::parameterized_test_registry() { - return impl_->parameterized_test_registry(); -} -#endif // GTEST_HAS_PARAM_TEST - -// Creates an empty UnitTest. -UnitTest::UnitTest() { - impl_ = new internal::UnitTestImpl(this); -} - -// Destructor of UnitTest. -UnitTest::~UnitTest() { - delete impl_; -} - -// Pushes a trace defined by SCOPED_TRACE() on to the per-thread -// Google Test trace stack. -// L < mutex_ -void UnitTest::PushGTestTrace(const internal::TraceInfo& trace) { - internal::MutexLock lock(&mutex_); - impl_->gtest_trace_stack().push_back(trace); -} - -// Pops a trace from the per-thread Google Test trace stack. -// L < mutex_ -void UnitTest::PopGTestTrace() { - internal::MutexLock lock(&mutex_); - impl_->gtest_trace_stack().pop_back(); -} - -namespace internal { - -UnitTestImpl::UnitTestImpl(UnitTest* parent) - : parent_(parent), -#ifdef _MSC_VER -# pragma warning(push) // Saves the current warning state. -# pragma warning(disable:4355) // Temporarily disables warning 4355 - // (using this in initializer). - default_global_test_part_result_reporter_(this), - default_per_thread_test_part_result_reporter_(this), -# pragma warning(pop) // Restores the warning state again. -#else - default_global_test_part_result_reporter_(this), - default_per_thread_test_part_result_reporter_(this), -#endif // _MSC_VER - global_test_part_result_repoter_( - &default_global_test_part_result_reporter_), - per_thread_test_part_result_reporter_( - &default_per_thread_test_part_result_reporter_), -#if GTEST_HAS_PARAM_TEST - parameterized_test_registry_(), - parameterized_tests_registered_(false), -#endif // GTEST_HAS_PARAM_TEST - last_death_test_case_(-1), - current_test_case_(NULL), - current_test_info_(NULL), - ad_hoc_test_result_(), - os_stack_trace_getter_(NULL), - post_flag_parse_init_performed_(false), - random_seed_(0), // Will be overridden by the flag before first use. - random_(0), // Will be reseeded before first use. - elapsed_time_(0), -#if GTEST_HAS_DEATH_TEST - internal_run_death_test_flag_(NULL), - death_test_factory_(new DefaultDeathTestFactory), -#endif - // Will be overridden by the flag before first use. - catch_exceptions_(false) { - listeners()->SetDefaultResultPrinter(new PrettyUnitTestResultPrinter); -} - -UnitTestImpl::~UnitTestImpl() { - // Deletes every TestCase. - ForEach(test_cases_, internal::Delete); - - // Deletes every Environment. - ForEach(environments_, internal::Delete); - - delete os_stack_trace_getter_; -} - -#if GTEST_HAS_DEATH_TEST -// Disables event forwarding if the control is currently in a death test -// subprocess. Must not be called before InitGoogleTest. -void UnitTestImpl::SuppressTestEventsIfInSubprocess() { - if (internal_run_death_test_flag_.get() != NULL) - listeners()->SuppressEventForwarding(); -} -#endif // GTEST_HAS_DEATH_TEST - -// Initializes event listeners performing XML output as specified by -// UnitTestOptions. Must not be called before InitGoogleTest. -void UnitTestImpl::ConfigureXmlOutput() { - const String& output_format = UnitTestOptions::GetOutputFormat(); - if (output_format == "xml") { - listeners()->SetDefaultXmlGenerator(new XmlUnitTestResultPrinter( - UnitTestOptions::GetAbsolutePathToOutputFile().c_str())); - } else if (output_format != "") { - printf("WARNING: unrecognized output format \"%s\" ignored.\n", - output_format.c_str()); - fflush(stdout); - } -} - -#if GTEST_CAN_STREAM_RESULTS_ -// Initializes event listeners for streaming test results in String form. -// Must not be called before InitGoogleTest. -void UnitTestImpl::ConfigureStreamingOutput() { - const string& target = GTEST_FLAG(stream_result_to); - if (!target.empty()) { - const size_t pos = target.find(':'); - if (pos != string::npos) { - listeners()->Append(new StreamingListener(target.substr(0, pos), - target.substr(pos+1))); - } else { - printf("WARNING: unrecognized streaming target \"%s\" ignored.\n", - target.c_str()); - fflush(stdout); - } - } -} -#endif // GTEST_CAN_STREAM_RESULTS_ - -// Performs initialization dependent upon flag values obtained in -// ParseGoogleTestFlagsOnly. Is called from InitGoogleTest after the call to -// ParseGoogleTestFlagsOnly. In case a user neglects to call InitGoogleTest -// this function is also called from RunAllTests. Since this function can be -// called more than once, it has to be idempotent. -void UnitTestImpl::PostFlagParsingInit() { - // Ensures that this function does not execute more than once. - if (!post_flag_parse_init_performed_) { - post_flag_parse_init_performed_ = true; - -#if GTEST_HAS_DEATH_TEST - InitDeathTestSubprocessControlInfo(); - SuppressTestEventsIfInSubprocess(); -#endif // GTEST_HAS_DEATH_TEST - - // Registers parameterized tests. This makes parameterized tests - // available to the UnitTest reflection API without running - // RUN_ALL_TESTS. - RegisterParameterizedTests(); - - // Configures listeners for XML output. This makes it possible for users - // to shut down the default XML output before invoking RUN_ALL_TESTS. - ConfigureXmlOutput(); - -#if GTEST_CAN_STREAM_RESULTS_ - // Configures listeners for streaming test results to the specified server. - ConfigureStreamingOutput(); -#endif // GTEST_CAN_STREAM_RESULTS_ - } -} - -// A predicate that checks the name of a TestCase against a known -// value. -// -// This is used for implementation of the UnitTest class only. We put -// it in the anonymous namespace to prevent polluting the outer -// namespace. -// -// TestCaseNameIs is copyable. -class TestCaseNameIs { - public: - // Constructor. - explicit TestCaseNameIs(const String& name) - : name_(name) {} - - // Returns true iff the name of test_case matches name_. - bool operator()(const TestCase* test_case) const { - return test_case != NULL && strcmp(test_case->name(), name_.c_str()) == 0; - } - - private: - String name_; -}; - -// Finds and returns a TestCase with the given name. If one doesn't -// exist, creates one and returns it. It's the CALLER'S -// RESPONSIBILITY to ensure that this function is only called WHEN THE -// TESTS ARE NOT SHUFFLED. -// -// Arguments: -// -// test_case_name: name of the test case -// type_param: the name of the test case's type parameter, or NULL if -// this is not a typed or a type-parameterized test case. -// set_up_tc: pointer to the function that sets up the test case -// tear_down_tc: pointer to the function that tears down the test case -TestCase* UnitTestImpl::GetTestCase(const char* test_case_name, - const char* type_param, - Test::SetUpTestCaseFunc set_up_tc, - Test::TearDownTestCaseFunc tear_down_tc) { - // Can we find a TestCase with the given name? - const std::vector::const_iterator test_case = - std::find_if(test_cases_.begin(), test_cases_.end(), - TestCaseNameIs(test_case_name)); - - if (test_case != test_cases_.end()) - return *test_case; - - // No. Let's create one. - TestCase* const new_test_case = - new TestCase(test_case_name, type_param, set_up_tc, tear_down_tc); - - // Is this a death test case? - if (internal::UnitTestOptions::MatchesFilter(String(test_case_name), - kDeathTestCaseFilter)) { - // Yes. Inserts the test case after the last death test case - // defined so far. This only works when the test cases haven't - // been shuffled. Otherwise we may end up running a death test - // after a non-death test. - ++last_death_test_case_; - test_cases_.insert(test_cases_.begin() + last_death_test_case_, - new_test_case); - } else { - // No. Appends to the end of the list. - test_cases_.push_back(new_test_case); - } - - test_case_indices_.push_back(static_cast(test_case_indices_.size())); - return new_test_case; -} - -// Helpers for setting up / tearing down the given environment. They -// are for use in the ForEach() function. -static void SetUpEnvironment(Environment* env) { env->SetUp(); } -static void TearDownEnvironment(Environment* env) { env->TearDown(); } - -// Runs all tests in this UnitTest object, prints the result, and -// returns true if all tests are successful. If any exception is -// thrown during a test, the test is considered to be failed, but the -// rest of the tests will still be run. -// -// When parameterized tests are enabled, it expands and registers -// parameterized tests first in RegisterParameterizedTests(). -// All other functions called from RunAllTests() may safely assume that -// parameterized tests are ready to be counted and run. -bool UnitTestImpl::RunAllTests() { - // Makes sure InitGoogleTest() was called. - if (!GTestIsInitialized()) { - printf("%s", - "\nThis test program did NOT call ::testing::InitGoogleTest " - "before calling RUN_ALL_TESTS(). Please fix it.\n"); - return false; - } - - // Do not run any test if the --help flag was specified. - if (g_help_flag) - return true; - - // Repeats the call to the post-flag parsing initialization in case the - // user didn't call InitGoogleTest. - PostFlagParsingInit(); - - // Even if sharding is not on, test runners may want to use the - // GTEST_SHARD_STATUS_FILE to query whether the test supports the sharding - // protocol. - internal::WriteToShardStatusFileIfNeeded(); - - // True iff we are in a subprocess for running a thread-safe-style - // death test. - bool in_subprocess_for_death_test = false; - -#if GTEST_HAS_DEATH_TEST - in_subprocess_for_death_test = (internal_run_death_test_flag_.get() != NULL); -#endif // GTEST_HAS_DEATH_TEST - - const bool should_shard = ShouldShard(kTestTotalShards, kTestShardIndex, - in_subprocess_for_death_test); - - // Compares the full test names with the filter to decide which - // tests to run. - const bool has_tests_to_run = FilterTests(should_shard - ? HONOR_SHARDING_PROTOCOL - : IGNORE_SHARDING_PROTOCOL) > 0; - - // Lists the tests and exits if the --gtest_list_tests flag was specified. - if (GTEST_FLAG(list_tests)) { - // This must be called *after* FilterTests() has been called. - ListTestsMatchingFilter(); - return true; - } - - random_seed_ = GTEST_FLAG(shuffle) ? - GetRandomSeedFromFlag(GTEST_FLAG(random_seed)) : 0; - - // True iff at least one test has failed. - bool failed = false; - - TestEventListener* repeater = listeners()->repeater(); - - repeater->OnTestProgramStart(*parent_); - - // How many times to repeat the tests? We don't want to repeat them - // when we are inside the subprocess of a death test. - const int repeat = in_subprocess_for_death_test ? 1 : GTEST_FLAG(repeat); - // Repeats forever if the repeat count is negative. - const bool forever = repeat < 0; - for (int i = 0; forever || i != repeat; i++) { - // We want to preserve failures generated by ad-hoc test - // assertions executed before RUN_ALL_TESTS(). - ClearNonAdHocTestResult(); - - const TimeInMillis start = GetTimeInMillis(); - - // Shuffles test cases and tests if requested. - if (has_tests_to_run && GTEST_FLAG(shuffle)) { - random()->Reseed(random_seed_); - // This should be done before calling OnTestIterationStart(), - // such that a test event listener can see the actual test order - // in the event. - ShuffleTests(); - } - - // Tells the unit test event listeners that the tests are about to start. - repeater->OnTestIterationStart(*parent_, i); - - // Runs each test case if there is at least one test to run. - if (has_tests_to_run) { - // Sets up all environments beforehand. - repeater->OnEnvironmentsSetUpStart(*parent_); - ForEach(environments_, SetUpEnvironment); - repeater->OnEnvironmentsSetUpEnd(*parent_); - - // Runs the tests only if there was no fatal failure during global - // set-up. - if (!Test::HasFatalFailure()) { - for (int test_index = 0; test_index < total_test_case_count(); - test_index++) { - GetMutableTestCase(test_index)->Run(); - } - } - - // Tears down all environments in reverse order afterwards. - repeater->OnEnvironmentsTearDownStart(*parent_); - std::for_each(environments_.rbegin(), environments_.rend(), - TearDownEnvironment); - repeater->OnEnvironmentsTearDownEnd(*parent_); - } - - elapsed_time_ = GetTimeInMillis() - start; - - // Tells the unit test event listener that the tests have just finished. - repeater->OnTestIterationEnd(*parent_, i); - - // Gets the result and clears it. - if (!Passed()) { - failed = true; - } - - // Restores the original test order after the iteration. This - // allows the user to quickly repro a failure that happens in the - // N-th iteration without repeating the first (N - 1) iterations. - // This is not enclosed in "if (GTEST_FLAG(shuffle)) { ... }", in - // case the user somehow changes the value of the flag somewhere - // (it's always safe to unshuffle the tests). - UnshuffleTests(); - - if (GTEST_FLAG(shuffle)) { - // Picks a new random seed for each iteration. - random_seed_ = GetNextRandomSeed(random_seed_); - } - } - - repeater->OnTestProgramEnd(*parent_); - - return !failed; -} - -// Reads the GTEST_SHARD_STATUS_FILE environment variable, and creates the file -// if the variable is present. If a file already exists at this location, this -// function will write over it. If the variable is present, but the file cannot -// be created, prints an error and exits. -void WriteToShardStatusFileIfNeeded() { - const char* const test_shard_file = posix::GetEnv(kTestShardStatusFile); - if (test_shard_file != NULL) { - FILE* const file = posix::FOpen(test_shard_file, "w"); - if (file == NULL) { - ColoredPrintf(COLOR_RED, - "Could not write to the test shard status file \"%s\" " - "specified by the %s environment variable.\n", - test_shard_file, kTestShardStatusFile); - fflush(stdout); - exit(EXIT_FAILURE); - } - fclose(file); - } -} - -// Checks whether sharding is enabled by examining the relevant -// environment variable values. If the variables are present, -// but inconsistent (i.e., shard_index >= total_shards), prints -// an error and exits. If in_subprocess_for_death_test, sharding is -// disabled because it must only be applied to the original test -// process. Otherwise, we could filter out death tests we intended to execute. -bool ShouldShard(const char* total_shards_env, - const char* shard_index_env, - bool in_subprocess_for_death_test) { - if (in_subprocess_for_death_test) { - return false; - } - - const Int32 total_shards = Int32FromEnvOrDie(total_shards_env, -1); - const Int32 shard_index = Int32FromEnvOrDie(shard_index_env, -1); - - if (total_shards == -1 && shard_index == -1) { - return false; - } else if (total_shards == -1 && shard_index != -1) { - const Message msg = Message() - << "Invalid environment variables: you have " - << kTestShardIndex << " = " << shard_index - << ", but have left " << kTestTotalShards << " unset.\n"; - ColoredPrintf(COLOR_RED, msg.GetString().c_str()); - fflush(stdout); - exit(EXIT_FAILURE); - } else if (total_shards != -1 && shard_index == -1) { - const Message msg = Message() - << "Invalid environment variables: you have " - << kTestTotalShards << " = " << total_shards - << ", but have left " << kTestShardIndex << " unset.\n"; - ColoredPrintf(COLOR_RED, msg.GetString().c_str()); - fflush(stdout); - exit(EXIT_FAILURE); - } else if (shard_index < 0 || shard_index >= total_shards) { - const Message msg = Message() - << "Invalid environment variables: we require 0 <= " - << kTestShardIndex << " < " << kTestTotalShards - << ", but you have " << kTestShardIndex << "=" << shard_index - << ", " << kTestTotalShards << "=" << total_shards << ".\n"; - ColoredPrintf(COLOR_RED, msg.GetString().c_str()); - fflush(stdout); - exit(EXIT_FAILURE); - } - - return total_shards > 1; -} - -// Parses the environment variable var as an Int32. If it is unset, -// returns default_val. If it is not an Int32, prints an error -// and aborts. -Int32 Int32FromEnvOrDie(const char* var, Int32 default_val) { - const char* str_val = posix::GetEnv(var); - if (str_val == NULL) { - return default_val; - } - - Int32 result; - if (!ParseInt32(Message() << "The value of environment variable " << var, - str_val, &result)) { - exit(EXIT_FAILURE); - } - return result; -} - -// Given the total number of shards, the shard index, and the test id, -// returns true iff the test should be run on this shard. The test id is -// some arbitrary but unique non-negative integer assigned to each test -// method. Assumes that 0 <= shard_index < total_shards. -bool ShouldRunTestOnShard(int total_shards, int shard_index, int test_id) { - return (test_id % total_shards) == shard_index; -} - -// Compares the name of each test with the user-specified filter to -// decide whether the test should be run, then records the result in -// each TestCase and TestInfo object. -// If shard_tests == true, further filters tests based on sharding -// variables in the environment - see -// http://code.google.com/p/googletest/wiki/GoogleTestAdvancedGuide. -// Returns the number of tests that should run. -int UnitTestImpl::FilterTests(ReactionToSharding shard_tests) { - const Int32 total_shards = shard_tests == HONOR_SHARDING_PROTOCOL ? - Int32FromEnvOrDie(kTestTotalShards, -1) : -1; - const Int32 shard_index = shard_tests == HONOR_SHARDING_PROTOCOL ? - Int32FromEnvOrDie(kTestShardIndex, -1) : -1; - - // num_runnable_tests are the number of tests that will - // run across all shards (i.e., match filter and are not disabled). - // num_selected_tests are the number of tests to be run on - // this shard. - int num_runnable_tests = 0; - int num_selected_tests = 0; - for (size_t i = 0; i < test_cases_.size(); i++) { - TestCase* const test_case = test_cases_[i]; - const String &test_case_name = test_case->name(); - test_case->set_should_run(false); - - for (size_t j = 0; j < test_case->test_info_list().size(); j++) { - TestInfo* const test_info = test_case->test_info_list()[j]; - const String test_name(test_info->name()); - // A test is disabled if test case name or test name matches - // kDisableTestFilter. - const bool is_disabled = - internal::UnitTestOptions::MatchesFilter(test_case_name, - kDisableTestFilter) || - internal::UnitTestOptions::MatchesFilter(test_name, - kDisableTestFilter); - test_info->is_disabled_ = is_disabled; - - const bool matches_filter = - internal::UnitTestOptions::FilterMatchesTest(test_case_name, - test_name); - test_info->matches_filter_ = matches_filter; - - const bool is_runnable = - (GTEST_FLAG(also_run_disabled_tests) || !is_disabled) && - matches_filter; - - const bool is_selected = is_runnable && - (shard_tests == IGNORE_SHARDING_PROTOCOL || - ShouldRunTestOnShard(total_shards, shard_index, - num_runnable_tests)); - - num_runnable_tests += is_runnable; - num_selected_tests += is_selected; - - test_info->should_run_ = is_selected; - test_case->set_should_run(test_case->should_run() || is_selected); - } - } - return num_selected_tests; -} - -// Prints the names of the tests matching the user-specified filter flag. -void UnitTestImpl::ListTestsMatchingFilter() { - for (size_t i = 0; i < test_cases_.size(); i++) { - const TestCase* const test_case = test_cases_[i]; - bool printed_test_case_name = false; - - for (size_t j = 0; j < test_case->test_info_list().size(); j++) { - const TestInfo* const test_info = - test_case->test_info_list()[j]; - if (test_info->matches_filter_) { - if (!printed_test_case_name) { - printed_test_case_name = true; - printf("%s.\n", test_case->name()); - } - printf(" %s\n", test_info->name()); - } - } - } - fflush(stdout); -} - -// Sets the OS stack trace getter. -// -// Does nothing if the input and the current OS stack trace getter are -// the same; otherwise, deletes the old getter and makes the input the -// current getter. -void UnitTestImpl::set_os_stack_trace_getter( - OsStackTraceGetterInterface* getter) { - if (os_stack_trace_getter_ != getter) { - delete os_stack_trace_getter_; - os_stack_trace_getter_ = getter; - } -} - -// Returns the current OS stack trace getter if it is not NULL; -// otherwise, creates an OsStackTraceGetter, makes it the current -// getter, and returns it. -OsStackTraceGetterInterface* UnitTestImpl::os_stack_trace_getter() { - if (os_stack_trace_getter_ == NULL) { - os_stack_trace_getter_ = new OsStackTraceGetter; - } - - return os_stack_trace_getter_; -} - -// Returns the TestResult for the test that's currently running, or -// the TestResult for the ad hoc test if no test is running. -TestResult* UnitTestImpl::current_test_result() { - return current_test_info_ ? - &(current_test_info_->result_) : &ad_hoc_test_result_; -} - -// Shuffles all test cases, and the tests within each test case, -// making sure that death tests are still run first. -void UnitTestImpl::ShuffleTests() { - // Shuffles the death test cases. - ShuffleRange(random(), 0, last_death_test_case_ + 1, &test_case_indices_); - - // Shuffles the non-death test cases. - ShuffleRange(random(), last_death_test_case_ + 1, - static_cast(test_cases_.size()), &test_case_indices_); - - // Shuffles the tests inside each test case. - for (size_t i = 0; i < test_cases_.size(); i++) { - test_cases_[i]->ShuffleTests(random()); - } -} - -// Restores the test cases and tests to their order before the first shuffle. -void UnitTestImpl::UnshuffleTests() { - for (size_t i = 0; i < test_cases_.size(); i++) { - // Unshuffles the tests in each test case. - test_cases_[i]->UnshuffleTests(); - // Resets the index of each test case. - test_case_indices_[i] = static_cast(i); - } -} - -// Returns the current OS stack trace as a String. -// -// The maximum number of stack frames to be included is specified by -// the gtest_stack_trace_depth flag. The skip_count parameter -// specifies the number of top frames to be skipped, which doesn't -// count against the number of frames to be included. -// -// For example, if Foo() calls Bar(), which in turn calls -// GetCurrentOsStackTraceExceptTop(..., 1), Foo() will be included in -// the trace but Bar() and GetCurrentOsStackTraceExceptTop() won't. -String GetCurrentOsStackTraceExceptTop(UnitTest* /*unit_test*/, - int skip_count) { - // We pass skip_count + 1 to skip this wrapper function in addition - // to what the user really wants to skip. - return GetUnitTestImpl()->CurrentOsStackTraceExceptTop(skip_count + 1); -} - -// Used by the GTEST_SUPPRESS_UNREACHABLE_CODE_WARNING_BELOW_ macro to -// suppress unreachable code warnings. -namespace { -class ClassUniqueToAlwaysTrue {}; -} - -bool IsTrue(bool condition) { return condition; } - -bool AlwaysTrue() { -#if GTEST_HAS_EXCEPTIONS - // This condition is always false so AlwaysTrue() never actually throws, - // but it makes the compiler think that it may throw. - if (IsTrue(false)) - throw ClassUniqueToAlwaysTrue(); -#endif // GTEST_HAS_EXCEPTIONS - return true; -} - -// If *pstr starts with the given prefix, modifies *pstr to be right -// past the prefix and returns true; otherwise leaves *pstr unchanged -// and returns false. None of pstr, *pstr, and prefix can be NULL. -bool SkipPrefix(const char* prefix, const char** pstr) { - const size_t prefix_len = strlen(prefix); - if (strncmp(*pstr, prefix, prefix_len) == 0) { - *pstr += prefix_len; - return true; - } - return false; -} - -// Parses a string as a command line flag. The string should have -// the format "--flag=value". When def_optional is true, the "=value" -// part can be omitted. -// -// Returns the value of the flag, or NULL if the parsing failed. -const char* ParseFlagValue(const char* str, - const char* flag, - bool def_optional) { - // str and flag must not be NULL. - if (str == NULL || flag == NULL) return NULL; - - // The flag must start with "--" followed by GTEST_FLAG_PREFIX_. - const String flag_str = String::Format("--%s%s", GTEST_FLAG_PREFIX_, flag); - const size_t flag_len = flag_str.length(); - if (strncmp(str, flag_str.c_str(), flag_len) != 0) return NULL; - - // Skips the flag name. - const char* flag_end = str + flag_len; - - // When def_optional is true, it's OK to not have a "=value" part. - if (def_optional && (flag_end[0] == '\0')) { - return flag_end; - } - - // If def_optional is true and there are more characters after the - // flag name, or if def_optional is false, there must be a '=' after - // the flag name. - if (flag_end[0] != '=') return NULL; - - // Returns the string after "=". - return flag_end + 1; -} - -// Parses a string for a bool flag, in the form of either -// "--flag=value" or "--flag". -// -// In the former case, the value is taken as true as long as it does -// not start with '0', 'f', or 'F'. -// -// In the latter case, the value is taken as true. -// -// On success, stores the value of the flag in *value, and returns -// true. On failure, returns false without changing *value. -bool ParseBoolFlag(const char* str, const char* flag, bool* value) { - // Gets the value of the flag as a string. - const char* const value_str = ParseFlagValue(str, flag, true); - - // Aborts if the parsing failed. - if (value_str == NULL) return false; - - // Converts the string value to a bool. - *value = !(*value_str == '0' || *value_str == 'f' || *value_str == 'F'); - return true; -} - -// Parses a string for an Int32 flag, in the form of -// "--flag=value". -// -// On success, stores the value of the flag in *value, and returns -// true. On failure, returns false without changing *value. -bool ParseInt32Flag(const char* str, const char* flag, Int32* value) { - // Gets the value of the flag as a string. - const char* const value_str = ParseFlagValue(str, flag, false); - - // Aborts if the parsing failed. - if (value_str == NULL) return false; - - // Sets *value to the value of the flag. - return ParseInt32(Message() << "The value of flag --" << flag, - value_str, value); -} - -// Parses a string for a string flag, in the form of -// "--flag=value". -// -// On success, stores the value of the flag in *value, and returns -// true. On failure, returns false without changing *value. -bool ParseStringFlag(const char* str, const char* flag, String* value) { - // Gets the value of the flag as a string. - const char* const value_str = ParseFlagValue(str, flag, false); - - // Aborts if the parsing failed. - if (value_str == NULL) return false; - - // Sets *value to the value of the flag. - *value = value_str; - return true; -} - -// Determines whether a string has a prefix that Google Test uses for its -// flags, i.e., starts with GTEST_FLAG_PREFIX_ or GTEST_FLAG_PREFIX_DASH_. -// If Google Test detects that a command line flag has its prefix but is not -// recognized, it will print its help message. Flags starting with -// GTEST_INTERNAL_PREFIX_ followed by "internal_" are considered Google Test -// internal flags and do not trigger the help message. -static bool HasGoogleTestFlagPrefix(const char* str) { - return (SkipPrefix("--", &str) || - SkipPrefix("-", &str) || - SkipPrefix("/", &str)) && - !SkipPrefix(GTEST_FLAG_PREFIX_ "internal_", &str) && - (SkipPrefix(GTEST_FLAG_PREFIX_, &str) || - SkipPrefix(GTEST_FLAG_PREFIX_DASH_, &str)); -} - -// Prints a string containing code-encoded text. The following escape -// sequences can be used in the string to control the text color: -// -// @@ prints a single '@' character. -// @R changes the color to red. -// @G changes the color to green. -// @Y changes the color to yellow. -// @D changes to the default terminal text color. -// -// TODO(wan@google.com): Write tests for this once we add stdout -// capturing to Google Test. -static void PrintColorEncoded(const char* str) { - GTestColor color = COLOR_DEFAULT; // The current color. - - // Conceptually, we split the string into segments divided by escape - // sequences. Then we print one segment at a time. At the end of - // each iteration, the str pointer advances to the beginning of the - // next segment. - for (;;) { - const char* p = strchr(str, '@'); - if (p == NULL) { - ColoredPrintf(color, "%s", str); - return; - } - - ColoredPrintf(color, "%s", String(str, p - str).c_str()); - - const char ch = p[1]; - str = p + 2; - if (ch == '@') { - ColoredPrintf(color, "@"); - } else if (ch == 'D') { - color = COLOR_DEFAULT; - } else if (ch == 'R') { - color = COLOR_RED; - } else if (ch == 'G') { - color = COLOR_GREEN; - } else if (ch == 'Y') { - color = COLOR_YELLOW; - } else { - --str; - } - } -} - -static const char kColorEncodedHelpMessage[] = -"This program contains tests written using " GTEST_NAME_ ". You can use the\n" -"following command line flags to control its behavior:\n" -"\n" -"Test Selection:\n" -" @G--" GTEST_FLAG_PREFIX_ "list_tests@D\n" -" List the names of all tests instead of running them. The name of\n" -" TEST(Foo, Bar) is \"Foo.Bar\".\n" -" @G--" GTEST_FLAG_PREFIX_ "filter=@YPOSTIVE_PATTERNS" - "[@G-@YNEGATIVE_PATTERNS]@D\n" -" Run only the tests whose name matches one of the positive patterns but\n" -" none of the negative patterns. '?' matches any single character; '*'\n" -" matches any substring; ':' separates two patterns.\n" -" @G--" GTEST_FLAG_PREFIX_ "also_run_disabled_tests@D\n" -" Run all disabled tests too.\n" -"\n" -"Test Execution:\n" -" @G--" GTEST_FLAG_PREFIX_ "repeat=@Y[COUNT]@D\n" -" Run the tests repeatedly; use a negative count to repeat forever.\n" -" @G--" GTEST_FLAG_PREFIX_ "shuffle@D\n" -" Randomize tests' orders on every iteration.\n" -" @G--" GTEST_FLAG_PREFIX_ "random_seed=@Y[NUMBER]@D\n" -" Random number seed to use for shuffling test orders (between 1 and\n" -" 99999, or 0 to use a seed based on the current time).\n" -"\n" -"Test Output:\n" -" @G--" GTEST_FLAG_PREFIX_ "color=@Y(@Gyes@Y|@Gno@Y|@Gauto@Y)@D\n" -" Enable/disable colored output. The default is @Gauto@D.\n" -" -@G-" GTEST_FLAG_PREFIX_ "print_time=0@D\n" -" Don't print the elapsed time of each test.\n" -" @G--" GTEST_FLAG_PREFIX_ "output=xml@Y[@G:@YDIRECTORY_PATH@G" - GTEST_PATH_SEP_ "@Y|@G:@YFILE_PATH]@D\n" -" Generate an XML report in the given directory or with the given file\n" -" name. @YFILE_PATH@D defaults to @Gtest_details.xml@D.\n" -#if GTEST_CAN_STREAM_RESULTS_ -" @G--" GTEST_FLAG_PREFIX_ "stream_result_to=@YHOST@G:@YPORT@D\n" -" Stream test results to the given server.\n" -#endif // GTEST_CAN_STREAM_RESULTS_ -"\n" -"Assertion Behavior:\n" -#if GTEST_HAS_DEATH_TEST && !GTEST_OS_WINDOWS -" @G--" GTEST_FLAG_PREFIX_ "death_test_style=@Y(@Gfast@Y|@Gthreadsafe@Y)@D\n" -" Set the default death test style.\n" -#endif // GTEST_HAS_DEATH_TEST && !GTEST_OS_WINDOWS -" @G--" GTEST_FLAG_PREFIX_ "break_on_failure@D\n" -" Turn assertion failures into debugger break-points.\n" -" @G--" GTEST_FLAG_PREFIX_ "throw_on_failure@D\n" -" Turn assertion failures into C++ exceptions.\n" -" @G--" GTEST_FLAG_PREFIX_ "catch_exceptions=0@D\n" -" Do not report exceptions as test failures. Instead, allow them\n" -" to crash the program or throw a pop-up (on Windows).\n" -"\n" -"Except for @G--" GTEST_FLAG_PREFIX_ "list_tests@D, you can alternatively set " - "the corresponding\n" -"environment variable of a flag (all letters in upper-case). For example, to\n" -"disable colored text output, you can either specify @G--" GTEST_FLAG_PREFIX_ - "color=no@D or set\n" -"the @G" GTEST_FLAG_PREFIX_UPPER_ "COLOR@D environment variable to @Gno@D.\n" -"\n" -"For more information, please read the " GTEST_NAME_ " documentation at\n" -"@G" GTEST_PROJECT_URL_ "@D. If you find a bug in " GTEST_NAME_ "\n" -"(not one in your own code or tests), please report it to\n" -"@G<" GTEST_DEV_EMAIL_ ">@D.\n"; - -// Parses the command line for Google Test flags, without initializing -// other parts of Google Test. The type parameter CharType can be -// instantiated to either char or wchar_t. -template -void ParseGoogleTestFlagsOnlyImpl(int* argc, CharType** argv) { - for (int i = 1; i < *argc; i++) { - const String arg_string = StreamableToString(argv[i]); - const char* const arg = arg_string.c_str(); - - using internal::ParseBoolFlag; - using internal::ParseInt32Flag; - using internal::ParseStringFlag; - - // Do we see a Google Test flag? - if (ParseBoolFlag(arg, kAlsoRunDisabledTestsFlag, - >EST_FLAG(also_run_disabled_tests)) || - ParseBoolFlag(arg, kBreakOnFailureFlag, - >EST_FLAG(break_on_failure)) || - ParseBoolFlag(arg, kCatchExceptionsFlag, - >EST_FLAG(catch_exceptions)) || - ParseStringFlag(arg, kColorFlag, >EST_FLAG(color)) || - ParseStringFlag(arg, kDeathTestStyleFlag, - >EST_FLAG(death_test_style)) || - ParseBoolFlag(arg, kDeathTestUseFork, - >EST_FLAG(death_test_use_fork)) || - ParseStringFlag(arg, kFilterFlag, >EST_FLAG(filter)) || - ParseStringFlag(arg, kInternalRunDeathTestFlag, - >EST_FLAG(internal_run_death_test)) || - ParseBoolFlag(arg, kListTestsFlag, >EST_FLAG(list_tests)) || - ParseStringFlag(arg, kOutputFlag, >EST_FLAG(output)) || - ParseBoolFlag(arg, kPrintTimeFlag, >EST_FLAG(print_time)) || - ParseInt32Flag(arg, kRandomSeedFlag, >EST_FLAG(random_seed)) || - ParseInt32Flag(arg, kRepeatFlag, >EST_FLAG(repeat)) || - ParseBoolFlag(arg, kShuffleFlag, >EST_FLAG(shuffle)) || - ParseInt32Flag(arg, kStackTraceDepthFlag, - >EST_FLAG(stack_trace_depth)) || - ParseStringFlag(arg, kStreamResultToFlag, - >EST_FLAG(stream_result_to)) || - ParseBoolFlag(arg, kThrowOnFailureFlag, - >EST_FLAG(throw_on_failure)) - ) { - // Yes. Shift the remainder of the argv list left by one. Note - // that argv has (*argc + 1) elements, the last one always being - // NULL. The following loop moves the trailing NULL element as - // well. - for (int j = i; j != *argc; j++) { - argv[j] = argv[j + 1]; - } - - // Decrements the argument count. - (*argc)--; - - // We also need to decrement the iterator as we just removed - // an element. - i--; - } else if (arg_string == "--help" || arg_string == "-h" || - arg_string == "-?" || arg_string == "/?" || - HasGoogleTestFlagPrefix(arg)) { - // Both help flag and unrecognized Google Test flags (excluding - // internal ones) trigger help display. - g_help_flag = true; - } - } - - if (g_help_flag) { - // We print the help here instead of in RUN_ALL_TESTS(), as the - // latter may not be called at all if the user is using Google - // Test with another testing framework. - PrintColorEncoded(kColorEncodedHelpMessage); - } -} - -// Parses the command line for Google Test flags, without initializing -// other parts of Google Test. -void ParseGoogleTestFlagsOnly(int* argc, char** argv) { - ParseGoogleTestFlagsOnlyImpl(argc, argv); -} -void ParseGoogleTestFlagsOnly(int* argc, wchar_t** argv) { - ParseGoogleTestFlagsOnlyImpl(argc, argv); -} - -// The internal implementation of InitGoogleTest(). -// -// The type parameter CharType can be instantiated to either char or -// wchar_t. -template -void InitGoogleTestImpl(int* argc, CharType** argv) { - g_init_gtest_count++; - - // We don't want to run the initialization code twice. - if (g_init_gtest_count != 1) return; - - if (*argc <= 0) return; - - internal::g_executable_path = internal::StreamableToString(argv[0]); - -#if GTEST_HAS_DEATH_TEST - - g_argvs.clear(); - for (int i = 0; i != *argc; i++) { - g_argvs.push_back(StreamableToString(argv[i])); - } - -#endif // GTEST_HAS_DEATH_TEST - - ParseGoogleTestFlagsOnly(argc, argv); - GetUnitTestImpl()->PostFlagParsingInit(); -} - -} // namespace internal - -// Initializes Google Test. This must be called before calling -// RUN_ALL_TESTS(). In particular, it parses a command line for the -// flags that Google Test recognizes. Whenever a Google Test flag is -// seen, it is removed from argv, and *argc is decremented. -// -// No value is returned. Instead, the Google Test flag variables are -// updated. -// -// Calling the function for the second time has no user-visible effect. -void InitGoogleTest(int* argc, char** argv) { - internal::InitGoogleTestImpl(argc, argv); -} - -// This overloaded version can be used in Windows programs compiled in -// UNICODE mode. -void InitGoogleTest(int* argc, wchar_t** argv) { - internal::InitGoogleTestImpl(argc, argv); -} - -} // namespace testing -// Copyright 2005, 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. -// -// Author: wan@google.com (Zhanyong Wan), vladl@google.com (Vlad Losev) -// -// This file implements death tests. - - -#if GTEST_HAS_DEATH_TEST - -# if GTEST_OS_MAC -# include -# endif // GTEST_OS_MAC - -# include -# include -# include -# include - -# if GTEST_OS_WINDOWS -# include -# else -# include -# include -# endif // GTEST_OS_WINDOWS - -#endif // GTEST_HAS_DEATH_TEST - - -// Indicates that this translation unit is part of Google Test's -// implementation. It must come before gtest-internal-inl.h is -// included, or there will be a compiler error. This trick is to -// prevent a user from accidentally including gtest-internal-inl.h in -// his code. -#define GTEST_IMPLEMENTATION_ 1 -#undef GTEST_IMPLEMENTATION_ - -namespace testing { - -// Constants. - -// The default death test style. -static const char kDefaultDeathTestStyle[] = "fast"; - -GTEST_DEFINE_string_( - death_test_style, - internal::StringFromGTestEnv("death_test_style", kDefaultDeathTestStyle), - "Indicates how to run a death test in a forked child process: " - "\"threadsafe\" (child process re-executes the test binary " - "from the beginning, running only the specific death test) or " - "\"fast\" (child process runs the death test immediately " - "after forking)."); - -GTEST_DEFINE_bool_( - death_test_use_fork, - internal::BoolFromGTestEnv("death_test_use_fork", false), - "Instructs to use fork()/_exit() instead of clone() in death tests. " - "Ignored and always uses fork() on POSIX systems where clone() is not " - "implemented. Useful when running under valgrind or similar tools if " - "those do not support clone(). Valgrind 3.3.1 will just fail if " - "it sees an unsupported combination of clone() flags. " - "It is not recommended to use this flag w/o valgrind though it will " - "work in 99% of the cases. Once valgrind is fixed, this flag will " - "most likely be removed."); - -namespace internal { -GTEST_DEFINE_string_( - internal_run_death_test, "", - "Indicates the file, line number, temporal index of " - "the single death test to run, and a file descriptor to " - "which a success code may be sent, all separated by " - "colons. This flag is specified if and only if the current " - "process is a sub-process launched for running a thread-safe " - "death test. FOR INTERNAL USE ONLY."); -} // namespace internal - -#if GTEST_HAS_DEATH_TEST - -// ExitedWithCode constructor. -ExitedWithCode::ExitedWithCode(int exit_code) : exit_code_(exit_code) { -} - -// ExitedWithCode function-call operator. -bool ExitedWithCode::operator()(int exit_status) const { -# if GTEST_OS_WINDOWS - - return exit_status == exit_code_; - -# else - - return WIFEXITED(exit_status) && WEXITSTATUS(exit_status) == exit_code_; - -# endif // GTEST_OS_WINDOWS -} - -# if !GTEST_OS_WINDOWS -// KilledBySignal constructor. -KilledBySignal::KilledBySignal(int signum) : signum_(signum) { -} - -// KilledBySignal function-call operator. -bool KilledBySignal::operator()(int exit_status) const { - return WIFSIGNALED(exit_status) && WTERMSIG(exit_status) == signum_; -} -# endif // !GTEST_OS_WINDOWS - -namespace internal { - -// Utilities needed for death tests. - -// Generates a textual description of a given exit code, in the format -// specified by wait(2). -static String ExitSummary(int exit_code) { - Message m; - -# if GTEST_OS_WINDOWS - - m << "Exited with exit status " << exit_code; - -# else - - if (WIFEXITED(exit_code)) { - m << "Exited with exit status " << WEXITSTATUS(exit_code); - } else if (WIFSIGNALED(exit_code)) { - m << "Terminated by signal " << WTERMSIG(exit_code); - } -# ifdef WCOREDUMP - if (WCOREDUMP(exit_code)) { - m << " (core dumped)"; - } -# endif -# endif // GTEST_OS_WINDOWS - - return m.GetString(); -} - -// Returns true if exit_status describes a process that was terminated -// by a signal, or exited normally with a nonzero exit code. -bool ExitedUnsuccessfully(int exit_status) { - return !ExitedWithCode(0)(exit_status); -} - -# if !GTEST_OS_WINDOWS -// Generates a textual failure message when a death test finds more than -// one thread running, or cannot determine the number of threads, prior -// to executing the given statement. It is the responsibility of the -// caller not to pass a thread_count of 1. -static String DeathTestThreadWarning(size_t thread_count) { - Message msg; - // msg << "Death tests use fork(), which is unsafe particularly" - // << " in a threaded context. For this test, " << GTEST_NAME_ << " "; - // if (thread_count == 0) - // msg << "couldn't detect the number of threads."; - // else - // msg << "detected " << thread_count << " threads."; - return msg.GetString(); -} -# endif // !GTEST_OS_WINDOWS - -// Flag characters for reporting a death test that did not die. -static const char kDeathTestLived = 'L'; -static const char kDeathTestReturned = 'R'; -static const char kDeathTestThrew = 'T'; -static const char kDeathTestInternalError = 'I'; - -// An enumeration describing all of the possible ways that a death test can -// conclude. DIED means that the process died while executing the test -// code; LIVED means that process lived beyond the end of the test code; -// RETURNED means that the test statement attempted to execute a return -// statement, which is not allowed; THREW means that the test statement -// returned control by throwing an exception. IN_PROGRESS means the test -// has not yet concluded. -// TODO(vladl@google.com): Unify names and possibly values for -// AbortReason, DeathTestOutcome, and flag characters above. -enum DeathTestOutcome { IN_PROGRESS, DIED, LIVED, RETURNED, THREW }; - -// Routine for aborting the program which is safe to call from an -// exec-style death test child process, in which case the error -// message is propagated back to the parent process. Otherwise, the -// message is simply printed to stderr. In either case, the program -// then exits with status 1. -void DeathTestAbort(const String& message) { - // On a POSIX system, this function may be called from a threadsafe-style - // death test child process, which operates on a very small stack. Use - // the heap for any additional non-minuscule memory requirements. - const InternalRunDeathTestFlag* const flag = - GetUnitTestImpl()->internal_run_death_test_flag(); - if (flag != NULL) { - FILE* parent = posix::FDOpen(flag->write_fd(), "w"); - fputc(kDeathTestInternalError, parent); - fprintf(parent, "%s", message.c_str()); - fflush(parent); - _exit(1); - } else { - fprintf(stderr, "%s", message.c_str()); - fflush(stderr); - posix::Abort(); - } -} - -// A replacement for CHECK that calls DeathTestAbort if the assertion -// fails. -# define GTEST_DEATH_TEST_CHECK_(expression) \ - do { \ - if (!::testing::internal::IsTrue(expression)) { \ - DeathTestAbort(::testing::internal::String::Format( \ - "CHECK failed: File %s, line %d: %s", \ - __FILE__, __LINE__, #expression)); \ - } \ - } while (::testing::internal::AlwaysFalse()) - -// This macro is similar to GTEST_DEATH_TEST_CHECK_, but it is meant for -// evaluating any system call that fulfills two conditions: it must return -// -1 on failure, and set errno to EINTR when it is interrupted and -// should be tried again. The macro expands to a loop that repeatedly -// evaluates the expression as long as it evaluates to -1 and sets -// errno to EINTR. If the expression evaluates to -1 but errno is -// something other than EINTR, DeathTestAbort is called. -# define GTEST_DEATH_TEST_CHECK_SYSCALL_(expression) \ - do { \ - int gtest_retval; \ - do { \ - gtest_retval = (expression); \ - } while (gtest_retval == -1 && errno == EINTR); \ - if (gtest_retval == -1) { \ - DeathTestAbort(::testing::internal::String::Format( \ - "CHECK failed: File %s, line %d: %s != -1", \ - __FILE__, __LINE__, #expression)); \ - } \ - } while (::testing::internal::AlwaysFalse()) - -// Returns the message describing the last system error in errno. -String GetLastErrnoDescription() { - return String(errno == 0 ? "" : posix::StrError(errno)); -} - -// This is called from a death test parent process to read a failure -// message from the death test child process and log it with the FATAL -// severity. On Windows, the message is read from a pipe handle. On other -// platforms, it is read from a file descriptor. -static void FailFromInternalError(int fd) { - Message error; - char buffer[256]; - int num_read; - - do { - while ((num_read = posix::Read(fd, buffer, 255)) > 0) { - buffer[num_read] = '\0'; - error << buffer; - } - } while (num_read == -1 && errno == EINTR); - - if (num_read == 0) { - GTEST_LOG_(FATAL) << error.GetString(); - } else { - const int last_error = errno; - GTEST_LOG_(FATAL) << "Error while reading death test internal: " - << GetLastErrnoDescription() << " [" << last_error << "]"; - } -} - -// Death test constructor. Increments the running death test count -// for the current test. -DeathTest::DeathTest() { - TestInfo* const info = GetUnitTestImpl()->current_test_info(); - if (info == NULL) { - DeathTestAbort("Cannot run a death test outside of a TEST or " - "TEST_F construct"); - } -} - -// Creates and returns a death test by dispatching to the current -// death test factory. -bool DeathTest::Create(const char* statement, const RE* regex, - const char* file, int line, DeathTest** test) { - return GetUnitTestImpl()->death_test_factory()->Create( - statement, regex, file, line, test); -} - -const char* DeathTest::LastMessage() { - return last_death_test_message_.c_str(); -} - -void DeathTest::set_last_death_test_message(const String& message) { - last_death_test_message_ = message; -} - -String DeathTest::last_death_test_message_; - -// Provides cross platform implementation for some death functionality. -class DeathTestImpl : public DeathTest { - protected: - DeathTestImpl(const char* a_statement, const RE* a_regex) - : statement_(a_statement), - regex_(a_regex), - spawned_(false), - status_(-1), - outcome_(IN_PROGRESS), - read_fd_(-1), - write_fd_(-1) {} - - // read_fd_ is expected to be closed and cleared by a derived class. - ~DeathTestImpl() { GTEST_DEATH_TEST_CHECK_(read_fd_ == -1); } - - void Abort(AbortReason reason); - virtual bool Passed(bool status_ok); - - const char* statement() const { return statement_; } - const RE* regex() const { return regex_; } - bool spawned() const { return spawned_; } - void set_spawned(bool is_spawned) { spawned_ = is_spawned; } - int status() const { return status_; } - void set_status(int a_status) { status_ = a_status; } - DeathTestOutcome outcome() const { return outcome_; } - void set_outcome(DeathTestOutcome an_outcome) { outcome_ = an_outcome; } - int read_fd() const { return read_fd_; } - void set_read_fd(int fd) { read_fd_ = fd; } - int write_fd() const { return write_fd_; } - void set_write_fd(int fd) { write_fd_ = fd; } - - // Called in the parent process only. Reads the result code of the death - // test child process via a pipe, interprets it to set the outcome_ - // member, and closes read_fd_. Outputs diagnostics and terminates in - // case of unexpected codes. - void ReadAndInterpretStatusByte(); - - private: - // The textual content of the code this object is testing. This class - // doesn't own this string and should not attempt to delete it. - const char* const statement_; - // The regular expression which test output must match. DeathTestImpl - // doesn't own this object and should not attempt to delete it. - const RE* const regex_; - // True if the death test child process has been successfully spawned. - bool spawned_; - // The exit status of the child process. - int status_; - // How the death test concluded. - DeathTestOutcome outcome_; - // Descriptor to the read end of the pipe to the child process. It is - // always -1 in the child process. The child keeps its write end of the - // pipe in write_fd_. - int read_fd_; - // Descriptor to the child's write end of the pipe to the parent process. - // It is always -1 in the parent process. The parent keeps its end of the - // pipe in read_fd_. - int write_fd_; -}; - -// Called in the parent process only. Reads the result code of the death -// test child process via a pipe, interprets it to set the outcome_ -// member, and closes read_fd_. Outputs diagnostics and terminates in -// case of unexpected codes. -void DeathTestImpl::ReadAndInterpretStatusByte() { - char flag; - int bytes_read; - - // The read() here blocks until data is available (signifying the - // failure of the death test) or until the pipe is closed (signifying - // its success), so it's okay to call this in the parent before - // the child process has exited. - do { - bytes_read = posix::Read(read_fd(), &flag, 1); - } while (bytes_read == -1 && errno == EINTR); - - if (bytes_read == 0) { - set_outcome(DIED); - } else if (bytes_read == 1) { - switch (flag) { - case kDeathTestReturned: - set_outcome(RETURNED); - break; - case kDeathTestThrew: - set_outcome(THREW); - break; - case kDeathTestLived: - set_outcome(LIVED); - break; - case kDeathTestInternalError: - FailFromInternalError(read_fd()); // Does not return. - break; - default: - GTEST_LOG_(FATAL) << "Death test child process reported " - << "unexpected status byte (" - << static_cast(flag) << ")"; - } - } else { - GTEST_LOG_(FATAL) << "Read from death test child process failed: " - << GetLastErrnoDescription(); - } - GTEST_DEATH_TEST_CHECK_SYSCALL_(posix::Close(read_fd())); - set_read_fd(-1); -} - -// Signals that the death test code which should have exited, didn't. -// Should be called only in a death test child process. -// Writes a status byte to the child's status file descriptor, then -// calls _exit(1). -void DeathTestImpl::Abort(AbortReason reason) { - // The parent process considers the death test to be a failure if - // it finds any data in our pipe. So, here we write a single flag byte - // to the pipe, then exit. - const char status_ch = - reason == TEST_DID_NOT_DIE ? kDeathTestLived : - reason == TEST_THREW_EXCEPTION ? kDeathTestThrew : kDeathTestReturned; - - GTEST_DEATH_TEST_CHECK_SYSCALL_(posix::Write(write_fd(), &status_ch, 1)); - // We are leaking the descriptor here because on some platforms (i.e., - // when built as Windows DLL), destructors of global objects will still - // run after calling _exit(). On such systems, write_fd_ will be - // indirectly closed from the destructor of UnitTestImpl, causing double - // close if it is also closed here. On debug configurations, double close - // may assert. As there are no in-process buffers to flush here, we are - // relying on the OS to close the descriptor after the process terminates - // when the destructors are not run. - _exit(1); // Exits w/o any normal exit hooks (we were supposed to crash) -} - -// Returns an indented copy of stderr output for a death test. -// This makes distinguishing death test output lines from regular log lines -// much easier. -static ::std::string FormatDeathTestOutput(const ::std::string& output) { - ::std::string ret; - for (size_t at = 0; ; ) { - const size_t line_end = output.find('\n', at); - ret += "[ DEATH ] "; - if (line_end == ::std::string::npos) { - ret += output.substr(at); - break; - } - ret += output.substr(at, line_end + 1 - at); - at = line_end + 1; - } - return ret; -} - -// Assesses the success or failure of a death test, using both private -// members which have previously been set, and one argument: -// -// Private data members: -// outcome: An enumeration describing how the death test -// concluded: DIED, LIVED, THREW, or RETURNED. The death test -// fails in the latter three cases. -// status: The exit status of the child process. On *nix, it is in the -// in the format specified by wait(2). On Windows, this is the -// value supplied to the ExitProcess() API or a numeric code -// of the exception that terminated the program. -// regex: A regular expression object to be applied to -// the test's captured standard error output; the death test -// fails if it does not match. -// -// Argument: -// status_ok: true if exit_status is acceptable in the context of -// this particular death test, which fails if it is false -// -// Returns true iff all of the above conditions are met. Otherwise, the -// first failing condition, in the order given above, is the one that is -// reported. Also sets the last death test message string. -bool DeathTestImpl::Passed(bool status_ok) { - if (!spawned()) - return false; - - const String error_message = GetCapturedStderr(); - - bool success = false; - Message buffer; - - buffer << "Death test: " << statement() << "\n"; - switch (outcome()) { - case LIVED: - buffer << " Result: failed to die.\n" - << " Error msg:\n" << FormatDeathTestOutput(error_message); - break; - case THREW: - buffer << " Result: threw an exception.\n" - << " Error msg:\n" << FormatDeathTestOutput(error_message); - break; - case RETURNED: - buffer << " Result: illegal return in test statement.\n" - << " Error msg:\n" << FormatDeathTestOutput(error_message); - break; - case DIED: - if (status_ok) { - const bool matched = RE::PartialMatch(error_message.c_str(), *regex()); - if (matched) { - success = true; - } else { - buffer << " Result: died but not with expected error.\n" - << " Expected: " << regex()->pattern() << "\n" - << "Actual msg:\n" << FormatDeathTestOutput(error_message); - } - } else { - buffer << " Result: died but not with expected exit code:\n" - << " " << ExitSummary(status()) << "\n" - << "Actual msg:\n" << FormatDeathTestOutput(error_message); - } - break; - case IN_PROGRESS: - default: - GTEST_LOG_(FATAL) - << "DeathTest::Passed somehow called before conclusion of test"; - } - - DeathTest::set_last_death_test_message(buffer.GetString()); - return success; -} - -# if GTEST_OS_WINDOWS -// WindowsDeathTest implements death tests on Windows. Due to the -// specifics of starting new processes on Windows, death tests there are -// always threadsafe, and Google Test considers the -// --gtest_death_test_style=fast setting to be equivalent to -// --gtest_death_test_style=threadsafe there. -// -// A few implementation notes: Like the Linux version, the Windows -// implementation uses pipes for child-to-parent communication. But due to -// the specifics of pipes on Windows, some extra steps are required: -// -// 1. The parent creates a communication pipe and stores handles to both -// ends of it. -// 2. The parent starts the child and provides it with the information -// necessary to acquire the handle to the write end of the pipe. -// 3. The child acquires the write end of the pipe and signals the parent -// using a Windows event. -// 4. Now the parent can release the write end of the pipe on its side. If -// this is done before step 3, the object's reference count goes down to -// 0 and it is destroyed, preventing the child from acquiring it. The -// parent now has to release it, or read operations on the read end of -// the pipe will not return when the child terminates. -// 5. The parent reads child's output through the pipe (outcome code and -// any possible error messages) from the pipe, and its stderr and then -// determines whether to fail the test. -// -// Note: to distinguish Win32 API calls from the local method and function -// calls, the former are explicitly resolved in the global namespace. -// -class WindowsDeathTest : public DeathTestImpl { - public: - WindowsDeathTest(const char* a_statement, - const RE* a_regex, - const char* file, - int line) - : DeathTestImpl(a_statement, a_regex), file_(file), line_(line) {} - - // All of these virtual functions are inherited from DeathTest. - virtual int Wait(); - virtual TestRole AssumeRole(); - - private: - // The name of the file in which the death test is located. - const char* const file_; - // The line number on which the death test is located. - const int line_; - // Handle to the write end of the pipe to the child process. - AutoHandle write_handle_; - // Child process handle. - AutoHandle child_handle_; - // Event the child process uses to signal the parent that it has - // acquired the handle to the write end of the pipe. After seeing this - // event the parent can release its own handles to make sure its - // ReadFile() calls return when the child terminates. - AutoHandle event_handle_; -}; - -// Waits for the child in a death test to exit, returning its exit -// status, or 0 if no child process exists. As a side effect, sets the -// outcome data member. -int WindowsDeathTest::Wait() { - if (!spawned()) - return 0; - - // Wait until the child either signals that it has acquired the write end - // of the pipe or it dies. - const HANDLE wait_handles[2] = { child_handle_.Get(), event_handle_.Get() }; - switch (::WaitForMultipleObjects(2, - wait_handles, - FALSE, // Waits for any of the handles. - INFINITE)) { - case WAIT_OBJECT_0: - case WAIT_OBJECT_0 + 1: - break; - default: - GTEST_DEATH_TEST_CHECK_(false); // Should not get here. - } - - // The child has acquired the write end of the pipe or exited. - // We release the handle on our side and continue. - write_handle_.Reset(); - event_handle_.Reset(); - - ReadAndInterpretStatusByte(); - - // Waits for the child process to exit if it haven't already. This - // returns immediately if the child has already exited, regardless of - // whether previous calls to WaitForMultipleObjects synchronized on this - // handle or not. - GTEST_DEATH_TEST_CHECK_( - WAIT_OBJECT_0 == ::WaitForSingleObject(child_handle_.Get(), - INFINITE)); - DWORD status_code; - GTEST_DEATH_TEST_CHECK_( - ::GetExitCodeProcess(child_handle_.Get(), &status_code) != FALSE); - child_handle_.Reset(); - set_status(static_cast(status_code)); - return status(); -} - -// The AssumeRole process for a Windows death test. It creates a child -// process with the same executable as the current process to run the -// death test. The child process is given the --gtest_filter and -// --gtest_internal_run_death_test flags such that it knows to run the -// current death test only. -DeathTest::TestRole WindowsDeathTest::AssumeRole() { - const UnitTestImpl* const impl = GetUnitTestImpl(); - const InternalRunDeathTestFlag* const flag = - impl->internal_run_death_test_flag(); - const TestInfo* const info = impl->current_test_info(); - const int death_test_index = info->result()->death_test_count(); - - if (flag != NULL) { - // ParseInternalRunDeathTestFlag() has performed all the necessary - // processing. - set_write_fd(flag->write_fd()); - return EXECUTE_TEST; - } - - // WindowsDeathTest uses an anonymous pipe to communicate results of - // a death test. - SECURITY_ATTRIBUTES handles_are_inheritable = { - sizeof(SECURITY_ATTRIBUTES), NULL, TRUE }; - HANDLE read_handle, write_handle; - GTEST_DEATH_TEST_CHECK_( - ::CreatePipe(&read_handle, &write_handle, &handles_are_inheritable, - 0) // Default buffer size. - != FALSE); - set_read_fd(::_open_osfhandle(reinterpret_cast(read_handle), - O_RDONLY)); - write_handle_.Reset(write_handle); - event_handle_.Reset(::CreateEvent( - &handles_are_inheritable, - TRUE, // The event will automatically reset to non-signaled state. - FALSE, // The initial state is non-signalled. - NULL)); // The even is unnamed. - GTEST_DEATH_TEST_CHECK_(event_handle_.Get() != NULL); - const String filter_flag = String::Format("--%s%s=%s.%s", - GTEST_FLAG_PREFIX_, kFilterFlag, - info->test_case_name(), - info->name()); - const String internal_flag = String::Format( - "--%s%s=%s|%d|%d|%u|%Iu|%Iu", - GTEST_FLAG_PREFIX_, - kInternalRunDeathTestFlag, - file_, line_, - death_test_index, - static_cast(::GetCurrentProcessId()), - // size_t has the same with as pointers on both 32-bit and 64-bit - // Windows platforms. - // See http://msdn.microsoft.com/en-us/library/tcxf1dw6.aspx. - reinterpret_cast(write_handle), - reinterpret_cast(event_handle_.Get())); - - char executable_path[_MAX_PATH + 1]; // NOLINT - GTEST_DEATH_TEST_CHECK_( - _MAX_PATH + 1 != ::GetModuleFileNameA(NULL, - executable_path, - _MAX_PATH)); - - String command_line = String::Format("%s %s \"%s\"", - ::GetCommandLineA(), - filter_flag.c_str(), - internal_flag.c_str()); - - DeathTest::set_last_death_test_message(""); - - CaptureStderr(); - // Flush the log buffers since the log streams are shared with the child. - FlushInfoLog(); - - // The child process will share the standard handles with the parent. - STARTUPINFOA startup_info; - memset(&startup_info, 0, sizeof(STARTUPINFO)); - startup_info.dwFlags = STARTF_USESTDHANDLES; - startup_info.hStdInput = ::GetStdHandle(STD_INPUT_HANDLE); - startup_info.hStdOutput = ::GetStdHandle(STD_OUTPUT_HANDLE); - startup_info.hStdError = ::GetStdHandle(STD_ERROR_HANDLE); - - PROCESS_INFORMATION process_info; - GTEST_DEATH_TEST_CHECK_(::CreateProcessA( - executable_path, - const_cast(command_line.c_str()), - NULL, // Retuned process handle is not inheritable. - NULL, // Retuned thread handle is not inheritable. - TRUE, // Child inherits all inheritable handles (for write_handle_). - 0x0, // Default creation flags. - NULL, // Inherit the parent's environment. - UnitTest::GetInstance()->original_working_dir(), - &startup_info, - &process_info) != FALSE); - child_handle_.Reset(process_info.hProcess); - ::CloseHandle(process_info.hThread); - set_spawned(true); - return OVERSEE_TEST; -} -# else // We are not on Windows. - -// ForkingDeathTest provides implementations for most of the abstract -// methods of the DeathTest interface. Only the AssumeRole method is -// left undefined. -class ForkingDeathTest : public DeathTestImpl { - public: - ForkingDeathTest(const char* statement, const RE* regex); - - // All of these virtual functions are inherited from DeathTest. - virtual int Wait(); - - protected: - void set_child_pid(pid_t child_pid) { child_pid_ = child_pid; } - - private: - // PID of child process during death test; 0 in the child process itself. - pid_t child_pid_; -}; - -// Constructs a ForkingDeathTest. -ForkingDeathTest::ForkingDeathTest(const char* a_statement, const RE* a_regex) - : DeathTestImpl(a_statement, a_regex), - child_pid_(-1) {} - -// Waits for the child in a death test to exit, returning its exit -// status, or 0 if no child process exists. As a side effect, sets the -// outcome data member. -int ForkingDeathTest::Wait() { - if (!spawned()) - return 0; - - ReadAndInterpretStatusByte(); - - int status_value; - GTEST_DEATH_TEST_CHECK_SYSCALL_(waitpid(child_pid_, &status_value, 0)); - set_status(status_value); - return status_value; -} - -// A concrete death test class that forks, then immediately runs the test -// in the child process. -class NoExecDeathTest : public ForkingDeathTest { - public: - NoExecDeathTest(const char* a_statement, const RE* a_regex) : - ForkingDeathTest(a_statement, a_regex) { } - virtual TestRole AssumeRole(); -}; - -// The AssumeRole process for a fork-and-run death test. It implements a -// straightforward fork, with a simple pipe to transmit the status byte. -DeathTest::TestRole NoExecDeathTest::AssumeRole() { - const size_t thread_count = GetThreadCount(); - // if (thread_count != 1) { - // GTEST_LOG_(WARNING) << DeathTestThreadWarning(thread_count); - // } - - int pipe_fd[2]; - GTEST_DEATH_TEST_CHECK_(pipe(pipe_fd) != -1); - - DeathTest::set_last_death_test_message(""); - CaptureStderr(); - // When we fork the process below, the log file buffers are copied, but the - // file descriptors are shared. We flush all log files here so that closing - // the file descriptors in the child process doesn't throw off the - // synchronization between descriptors and buffers in the parent process. - // This is as close to the fork as possible to avoid a race condition in case - // there are multiple threads running before the death test, and another - // thread writes to the log file. - FlushInfoLog(); - - const pid_t child_pid = fork(); - GTEST_DEATH_TEST_CHECK_(child_pid != -1); - set_child_pid(child_pid); - if (child_pid == 0) { - GTEST_DEATH_TEST_CHECK_SYSCALL_(close(pipe_fd[0])); - set_write_fd(pipe_fd[1]); - // Redirects all logging to stderr in the child process to prevent - // concurrent writes to the log files. We capture stderr in the parent - // process and append the child process' output to a log. - LogToStderr(); - // Event forwarding to the listeners of event listener API mush be shut - // down in death test subprocesses. - GetUnitTestImpl()->listeners()->SuppressEventForwarding(); - return EXECUTE_TEST; - } else { - GTEST_DEATH_TEST_CHECK_SYSCALL_(close(pipe_fd[1])); - set_read_fd(pipe_fd[0]); - set_spawned(true); - return OVERSEE_TEST; - } -} - -// A concrete death test class that forks and re-executes the main -// program from the beginning, with command-line flags set that cause -// only this specific death test to be run. -class ExecDeathTest : public ForkingDeathTest { - public: - ExecDeathTest(const char* a_statement, const RE* a_regex, - const char* file, int line) : - ForkingDeathTest(a_statement, a_regex), file_(file), line_(line) { } - virtual TestRole AssumeRole(); - private: - // The name of the file in which the death test is located. - const char* const file_; - // The line number on which the death test is located. - const int line_; -}; - -// Utility class for accumulating command-line arguments. -class Arguments { - public: - Arguments() { - args_.push_back(NULL); - } - - ~Arguments() { - for (std::vector::iterator i = args_.begin(); i != args_.end(); - ++i) { - free(*i); - } - } - void AddArgument(const char* argument) { - args_.insert(args_.end() - 1, posix::StrDup(argument)); - } - - template - void AddArguments(const ::std::vector& arguments) { - for (typename ::std::vector::const_iterator i = arguments.begin(); - i != arguments.end(); - ++i) { - args_.insert(args_.end() - 1, posix::StrDup(i->c_str())); - } - } - char* const* Argv() { - return &args_[0]; - } - private: - std::vector args_; -}; - -// A struct that encompasses the arguments to the child process of a -// threadsafe-style death test process. -struct ExecDeathTestArgs { - char* const* argv; // Command-line arguments for the child's call to exec - int close_fd; // File descriptor to close; the read end of a pipe -}; - -# if GTEST_OS_MAC -inline char** GetEnviron() { - // When Google Test is built as a framework on MacOS X, the environ variable - // is unavailable. Apple's documentation (man environ) recommends using - // _NSGetEnviron() instead. - return *_NSGetEnviron(); -} -# else -// Some POSIX platforms expect you to declare environ. extern "C" makes -// it reside in the global namespace. -extern "C" char** environ; -inline char** GetEnviron() { return environ; } -# endif // GTEST_OS_MAC - -// The main function for a threadsafe-style death test child process. -// This function is called in a clone()-ed process and thus must avoid -// any potentially unsafe operations like malloc or libc functions. -static int ExecDeathTestChildMain(void* child_arg) { - ExecDeathTestArgs* const args = static_cast(child_arg); - GTEST_DEATH_TEST_CHECK_SYSCALL_(close(args->close_fd)); - - // We need to execute the test program in the same environment where - // it was originally invoked. Therefore we change to the original - // working directory first. - const char* const original_dir = - UnitTest::GetInstance()->original_working_dir(); - // We can safely call chdir() as it's a direct system call. - if (chdir(original_dir) != 0) { - DeathTestAbort(String::Format("chdir(\"%s\") failed: %s", - original_dir, - GetLastErrnoDescription().c_str())); - return EXIT_FAILURE; - } - - // We can safely call execve() as it's a direct system call. We - // cannot use execvp() as it's a libc function and thus potentially - // unsafe. Since execve() doesn't search the PATH, the user must - // invoke the test program via a valid path that contains at least - // one path separator. - execve(args->argv[0], args->argv, GetEnviron()); - DeathTestAbort(String::Format("execve(%s, ...) in %s failed: %s", - args->argv[0], - original_dir, - GetLastErrnoDescription().c_str())); - return EXIT_FAILURE; -} - -// Two utility routines that together determine the direction the stack -// grows. -// This could be accomplished more elegantly by a single recursive -// function, but we want to guard against the unlikely possibility of -// a smart compiler optimizing the recursion away. -// -// GTEST_NO_INLINE_ is required to prevent GCC 4.6 from inlining -// StackLowerThanAddress into StackGrowsDown, which then doesn't give -// correct answer. -bool StackLowerThanAddress(const void* ptr) GTEST_NO_INLINE_; -bool StackLowerThanAddress(const void* ptr) { - int dummy; - return &dummy < ptr; -} - -bool StackGrowsDown() { - int dummy; - return StackLowerThanAddress(&dummy); -} - -// A threadsafe implementation of fork(2) for threadsafe-style death tests -// that uses clone(2). It dies with an error message if anything goes -// wrong. -static pid_t ExecDeathTestFork(char* const* argv, int close_fd) { - ExecDeathTestArgs args = { argv, close_fd }; - pid_t child_pid = -1; - -# if GTEST_HAS_CLONE - const bool use_fork = GTEST_FLAG(death_test_use_fork); - - if (!use_fork) { - static const bool stack_grows_down = StackGrowsDown(); - const size_t stack_size = getpagesize(); - // MMAP_ANONYMOUS is not defined on Mac, so we use MAP_ANON instead. - void* const stack = mmap(NULL, stack_size, PROT_READ | PROT_WRITE, - MAP_ANON | MAP_PRIVATE, -1, 0); - GTEST_DEATH_TEST_CHECK_(stack != MAP_FAILED); - void* const stack_top = - static_cast(stack) + (stack_grows_down ? stack_size : 0); - - child_pid = clone(&ExecDeathTestChildMain, stack_top, SIGCHLD, &args); - - GTEST_DEATH_TEST_CHECK_(munmap(stack, stack_size) != -1); - } -# else - const bool use_fork = true; -# endif // GTEST_HAS_CLONE - - if (use_fork && (child_pid = fork()) == 0) { - ExecDeathTestChildMain(&args); - _exit(0); - } - - GTEST_DEATH_TEST_CHECK_(child_pid != -1); - return child_pid; -} - -// The AssumeRole process for a fork-and-exec death test. It re-executes the -// main program from the beginning, setting the --gtest_filter -// and --gtest_internal_run_death_test flags to cause only the current -// death test to be re-run. -DeathTest::TestRole ExecDeathTest::AssumeRole() { - const UnitTestImpl* const impl = GetUnitTestImpl(); - const InternalRunDeathTestFlag* const flag = - impl->internal_run_death_test_flag(); - const TestInfo* const info = impl->current_test_info(); - const int death_test_index = info->result()->death_test_count(); - - if (flag != NULL) { - set_write_fd(flag->write_fd()); - return EXECUTE_TEST; - } - - int pipe_fd[2]; - GTEST_DEATH_TEST_CHECK_(pipe(pipe_fd) != -1); - // Clear the close-on-exec flag on the write end of the pipe, lest - // it be closed when the child process does an exec: - GTEST_DEATH_TEST_CHECK_(fcntl(pipe_fd[1], F_SETFD, 0) != -1); - - const String filter_flag = - String::Format("--%s%s=%s.%s", - GTEST_FLAG_PREFIX_, kFilterFlag, - info->test_case_name(), info->name()); - const String internal_flag = - String::Format("--%s%s=%s|%d|%d|%d", - GTEST_FLAG_PREFIX_, kInternalRunDeathTestFlag, - file_, line_, death_test_index, pipe_fd[1]); - Arguments args; - args.AddArguments(GetArgvs()); - args.AddArgument(filter_flag.c_str()); - args.AddArgument(internal_flag.c_str()); - - DeathTest::set_last_death_test_message(""); - - CaptureStderr(); - // See the comment in NoExecDeathTest::AssumeRole for why the next line - // is necessary. - FlushInfoLog(); - - const pid_t child_pid = ExecDeathTestFork(args.Argv(), pipe_fd[0]); - GTEST_DEATH_TEST_CHECK_SYSCALL_(close(pipe_fd[1])); - set_child_pid(child_pid); - set_read_fd(pipe_fd[0]); - set_spawned(true); - return OVERSEE_TEST; -} - -# endif // !GTEST_OS_WINDOWS - -// Creates a concrete DeathTest-derived class that depends on the -// --gtest_death_test_style flag, and sets the pointer pointed to -// by the "test" argument to its address. If the test should be -// skipped, sets that pointer to NULL. Returns true, unless the -// flag is set to an invalid value. -bool DefaultDeathTestFactory::Create(const char* statement, const RE* regex, - const char* file, int line, - DeathTest** test) { - UnitTestImpl* const impl = GetUnitTestImpl(); - const InternalRunDeathTestFlag* const flag = - impl->internal_run_death_test_flag(); - const int death_test_index = impl->current_test_info() - ->increment_death_test_count(); - - if (flag != NULL) { - if (death_test_index > flag->index()) { - DeathTest::set_last_death_test_message(String::Format( - "Death test count (%d) somehow exceeded expected maximum (%d)", - death_test_index, flag->index())); - return false; - } - - if (!(flag->file() == file && flag->line() == line && - flag->index() == death_test_index)) { - *test = NULL; - return true; - } - } - -# if GTEST_OS_WINDOWS - - if (GTEST_FLAG(death_test_style) == "threadsafe" || - GTEST_FLAG(death_test_style) == "fast") { - *test = new WindowsDeathTest(statement, regex, file, line); - } - -# else - - if (GTEST_FLAG(death_test_style) == "threadsafe") { - *test = new ExecDeathTest(statement, regex, file, line); - } else if (GTEST_FLAG(death_test_style) == "fast") { - *test = new NoExecDeathTest(statement, regex); - } - -# endif // GTEST_OS_WINDOWS - - else { // NOLINT - this is more readable than unbalanced brackets inside #if. - DeathTest::set_last_death_test_message(String::Format( - "Unknown death test style \"%s\" encountered", - GTEST_FLAG(death_test_style).c_str())); - return false; - } - - return true; -} - -// Splits a given string on a given delimiter, populating a given -// vector with the fields. GTEST_HAS_DEATH_TEST implies that we have -// ::std::string, so we can use it here. -static void SplitString(const ::std::string& str, char delimiter, - ::std::vector< ::std::string>* dest) { - ::std::vector< ::std::string> parsed; - ::std::string::size_type pos = 0; - while (::testing::internal::AlwaysTrue()) { - const ::std::string::size_type colon = str.find(delimiter, pos); - if (colon == ::std::string::npos) { - parsed.push_back(str.substr(pos)); - break; - } else { - parsed.push_back(str.substr(pos, colon - pos)); - pos = colon + 1; - } - } - dest->swap(parsed); -} - -# if GTEST_OS_WINDOWS -// Recreates the pipe and event handles from the provided parameters, -// signals the event, and returns a file descriptor wrapped around the pipe -// handle. This function is called in the child process only. -int GetStatusFileDescriptor(unsigned int parent_process_id, - size_t write_handle_as_size_t, - size_t event_handle_as_size_t) { - AutoHandle parent_process_handle(::OpenProcess(PROCESS_DUP_HANDLE, - FALSE, // Non-inheritable. - parent_process_id)); - if (parent_process_handle.Get() == INVALID_HANDLE_VALUE) { - DeathTestAbort(String::Format("Unable to open parent process %u", - parent_process_id)); - } - - // TODO(vladl@google.com): Replace the following check with a - // compile-time assertion when available. - GTEST_CHECK_(sizeof(HANDLE) <= sizeof(size_t)); - - const HANDLE write_handle = - reinterpret_cast(write_handle_as_size_t); - HANDLE dup_write_handle; - - // The newly initialized handle is accessible only in in the parent - // process. To obtain one accessible within the child, we need to use - // DuplicateHandle. - if (!::DuplicateHandle(parent_process_handle.Get(), write_handle, - ::GetCurrentProcess(), &dup_write_handle, - 0x0, // Requested privileges ignored since - // DUPLICATE_SAME_ACCESS is used. - FALSE, // Request non-inheritable handler. - DUPLICATE_SAME_ACCESS)) { - DeathTestAbort(String::Format( - "Unable to duplicate the pipe handle %Iu from the parent process %u", - write_handle_as_size_t, parent_process_id)); - } - - const HANDLE event_handle = reinterpret_cast(event_handle_as_size_t); - HANDLE dup_event_handle; - - if (!::DuplicateHandle(parent_process_handle.Get(), event_handle, - ::GetCurrentProcess(), &dup_event_handle, - 0x0, - FALSE, - DUPLICATE_SAME_ACCESS)) { - DeathTestAbort(String::Format( - "Unable to duplicate the event handle %Iu from the parent process %u", - event_handle_as_size_t, parent_process_id)); - } - - const int write_fd = - ::_open_osfhandle(reinterpret_cast(dup_write_handle), O_APPEND); - if (write_fd == -1) { - DeathTestAbort(String::Format( - "Unable to convert pipe handle %Iu to a file descriptor", - write_handle_as_size_t)); - } - - // Signals the parent that the write end of the pipe has been acquired - // so the parent can release its own write end. - ::SetEvent(dup_event_handle); - - return write_fd; -} -# endif // GTEST_OS_WINDOWS - -// Returns a newly created InternalRunDeathTestFlag object with fields -// initialized from the GTEST_FLAG(internal_run_death_test) flag if -// the flag is specified; otherwise returns NULL. -InternalRunDeathTestFlag* ParseInternalRunDeathTestFlag() { - if (GTEST_FLAG(internal_run_death_test) == "") return NULL; - - // GTEST_HAS_DEATH_TEST implies that we have ::std::string, so we - // can use it here. - int line = -1; - int index = -1; - ::std::vector< ::std::string> fields; - SplitString(GTEST_FLAG(internal_run_death_test).c_str(), '|', &fields); - int write_fd = -1; - -# if GTEST_OS_WINDOWS - - unsigned int parent_process_id = 0; - size_t write_handle_as_size_t = 0; - size_t event_handle_as_size_t = 0; - - if (fields.size() != 6 - || !ParseNaturalNumber(fields[1], &line) - || !ParseNaturalNumber(fields[2], &index) - || !ParseNaturalNumber(fields[3], &parent_process_id) - || !ParseNaturalNumber(fields[4], &write_handle_as_size_t) - || !ParseNaturalNumber(fields[5], &event_handle_as_size_t)) { - DeathTestAbort(String::Format( - "Bad --gtest_internal_run_death_test flag: %s", - GTEST_FLAG(internal_run_death_test).c_str())); - } - write_fd = GetStatusFileDescriptor(parent_process_id, - write_handle_as_size_t, - event_handle_as_size_t); -# else - - if (fields.size() != 4 - || !ParseNaturalNumber(fields[1], &line) - || !ParseNaturalNumber(fields[2], &index) - || !ParseNaturalNumber(fields[3], &write_fd)) { - DeathTestAbort(String::Format( - "Bad --gtest_internal_run_death_test flag: %s", - GTEST_FLAG(internal_run_death_test).c_str())); - } - -# endif // GTEST_OS_WINDOWS - - return new InternalRunDeathTestFlag(fields[0], line, index, write_fd); -} - -} // namespace internal - -#endif // GTEST_HAS_DEATH_TEST - -} // namespace testing -// Copyright 2008, 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: keith.ray@gmail.com (Keith Ray) - - -#include - -#if GTEST_OS_WINDOWS_MOBILE -# include -#elif GTEST_OS_WINDOWS -# include -# include -#elif GTEST_OS_SYMBIAN || GTEST_OS_NACL -// Symbian OpenC and NaCl have PATH_MAX in sys/syslimits.h -# include -#else -# include -# include // Some Linux distributions define PATH_MAX here. -#endif // GTEST_OS_WINDOWS_MOBILE - -#if GTEST_OS_WINDOWS -# define GTEST_PATH_MAX_ _MAX_PATH -#elif defined(PATH_MAX) -# define GTEST_PATH_MAX_ PATH_MAX -#elif defined(_XOPEN_PATH_MAX) -# define GTEST_PATH_MAX_ _XOPEN_PATH_MAX -#else -# define GTEST_PATH_MAX_ _POSIX_PATH_MAX -#endif // GTEST_OS_WINDOWS - - -namespace testing { -namespace internal { - -#if GTEST_OS_WINDOWS -// On Windows, '\\' is the standard path separator, but many tools and the -// Windows API also accept '/' as an alternate path separator. Unless otherwise -// noted, a file path can contain either kind of path separators, or a mixture -// of them. -const char kPathSeparator = '\\'; -const char kAlternatePathSeparator = '/'; -const char kPathSeparatorString[] = "\\"; -const char kAlternatePathSeparatorString[] = "/"; -# if GTEST_OS_WINDOWS_MOBILE -// Windows CE doesn't have a current directory. You should not use -// the current directory in tests on Windows CE, but this at least -// provides a reasonable fallback. -const char kCurrentDirectoryString[] = "\\"; -// Windows CE doesn't define INVALID_FILE_ATTRIBUTES -const DWORD kInvalidFileAttributes = 0xffffffff; -# else -const char kCurrentDirectoryString[] = ".\\"; -# endif // GTEST_OS_WINDOWS_MOBILE -#else -const char kPathSeparator = '/'; -const char kPathSeparatorString[] = "/"; -const char kCurrentDirectoryString[] = "./"; -#endif // GTEST_OS_WINDOWS - -// Returns whether the given character is a valid path separator. -static bool IsPathSeparator(char c) { -#if GTEST_HAS_ALT_PATH_SEP_ - return (c == kPathSeparator) || (c == kAlternatePathSeparator); -#else - return c == kPathSeparator; -#endif -} - -// Returns the current working directory, or "" if unsuccessful. -FilePath FilePath::GetCurrentDir() { -#if GTEST_OS_WINDOWS_MOBILE - // Windows CE doesn't have a current directory, so we just return - // something reasonable. - return FilePath(kCurrentDirectoryString); -#elif GTEST_OS_WINDOWS - char cwd[GTEST_PATH_MAX_ + 1] = { '\0' }; - return FilePath(_getcwd(cwd, sizeof(cwd)) == NULL ? "" : cwd); -#else - char cwd[GTEST_PATH_MAX_ + 1] = { '\0' }; - return FilePath(getcwd(cwd, sizeof(cwd)) == NULL ? "" : cwd); -#endif // GTEST_OS_WINDOWS_MOBILE -} - -// Returns a copy of the FilePath with the case-insensitive extension removed. -// Example: FilePath("dir/file.exe").RemoveExtension("EXE") returns -// FilePath("dir/file"). If a case-insensitive extension is not -// found, returns a copy of the original FilePath. -FilePath FilePath::RemoveExtension(const char* extension) const { - String dot_extension(String::Format(".%s", extension)); - if (pathname_.EndsWithCaseInsensitive(dot_extension.c_str())) { - return FilePath(String(pathname_.c_str(), pathname_.length() - 4)); - } - return *this; -} - -// Returns a pointer to the last occurence of a valid path separator in -// the FilePath. On Windows, for example, both '/' and '\' are valid path -// separators. Returns NULL if no path separator was found. -const char* FilePath::FindLastPathSeparator() const { - const char* const last_sep = strrchr(c_str(), kPathSeparator); -#if GTEST_HAS_ALT_PATH_SEP_ - const char* const last_alt_sep = strrchr(c_str(), kAlternatePathSeparator); - // Comparing two pointers of which only one is NULL is undefined. - if (last_alt_sep != NULL && - (last_sep == NULL || last_alt_sep > last_sep)) { - return last_alt_sep; - } -#endif - return last_sep; -} - -// Returns a copy of the FilePath with the directory part removed. -// Example: FilePath("path/to/file").RemoveDirectoryName() returns -// FilePath("file"). If there is no directory part ("just_a_file"), it returns -// the FilePath unmodified. If there is no file part ("just_a_dir/") it -// returns an empty FilePath (""). -// On Windows platform, '\' is the path separator, otherwise it is '/'. -FilePath FilePath::RemoveDirectoryName() const { - const char* const last_sep = FindLastPathSeparator(); - return last_sep ? FilePath(String(last_sep + 1)) : *this; -} - -// RemoveFileName returns the directory path with the filename removed. -// Example: FilePath("path/to/file").RemoveFileName() returns "path/to/". -// If the FilePath is "a_file" or "/a_file", RemoveFileName returns -// FilePath("./") or, on Windows, FilePath(".\\"). If the filepath does -// not have a file, like "just/a/dir/", it returns the FilePath unmodified. -// On Windows platform, '\' is the path separator, otherwise it is '/'. -FilePath FilePath::RemoveFileName() const { - const char* const last_sep = FindLastPathSeparator(); - String dir; - if (last_sep) { - dir = String(c_str(), last_sep + 1 - c_str()); - } else { - dir = kCurrentDirectoryString; - } - return FilePath(dir); -} - -// Helper functions for naming files in a directory for xml output. - -// Given directory = "dir", base_name = "test", number = 0, -// extension = "xml", returns "dir/test.xml". If number is greater -// than zero (e.g., 12), returns "dir/test_12.xml". -// On Windows platform, uses \ as the separator rather than /. -FilePath FilePath::MakeFileName(const FilePath& directory, - const FilePath& base_name, - int number, - const char* extension) { - String file; - if (number == 0) { - file = String::Format("%s.%s", base_name.c_str(), extension); - } else { - file = String::Format("%s_%d.%s", base_name.c_str(), number, extension); - } - return ConcatPaths(directory, FilePath(file)); -} - -// Given directory = "dir", relative_path = "test.xml", returns "dir/test.xml". -// On Windows, uses \ as the separator rather than /. -FilePath FilePath::ConcatPaths(const FilePath& directory, - const FilePath& relative_path) { - if (directory.IsEmpty()) - return relative_path; - const FilePath dir(directory.RemoveTrailingPathSeparator()); - return FilePath(String::Format("%s%c%s", dir.c_str(), kPathSeparator, - relative_path.c_str())); -} - -// Returns true if pathname describes something findable in the file-system, -// either a file, directory, or whatever. -bool FilePath::FileOrDirectoryExists() const { -#if GTEST_OS_WINDOWS_MOBILE - LPCWSTR unicode = String::AnsiToUtf16(pathname_.c_str()); - const DWORD attributes = GetFileAttributes(unicode); - delete [] unicode; - return attributes != kInvalidFileAttributes; -#else - posix::StatStruct file_stat; - return posix::Stat(pathname_.c_str(), &file_stat) == 0; -#endif // GTEST_OS_WINDOWS_MOBILE -} - -// Returns true if pathname describes a directory in the file-system -// that exists. -bool FilePath::DirectoryExists() const { - bool result = false; -#if GTEST_OS_WINDOWS - // Don't strip off trailing separator if path is a root directory on - // Windows (like "C:\\"). - const FilePath& path(IsRootDirectory() ? *this : - RemoveTrailingPathSeparator()); -#else - const FilePath& path(*this); -#endif - -#if GTEST_OS_WINDOWS_MOBILE - LPCWSTR unicode = String::AnsiToUtf16(path.c_str()); - const DWORD attributes = GetFileAttributes(unicode); - delete [] unicode; - if ((attributes != kInvalidFileAttributes) && - (attributes & FILE_ATTRIBUTE_DIRECTORY)) { - result = true; - } -#else - posix::StatStruct file_stat; - result = posix::Stat(path.c_str(), &file_stat) == 0 && - posix::IsDir(file_stat); -#endif // GTEST_OS_WINDOWS_MOBILE - - return result; -} - -// Returns true if pathname describes a root directory. (Windows has one -// root directory per disk drive.) -bool FilePath::IsRootDirectory() const { -#if GTEST_OS_WINDOWS - // TODO(wan@google.com): on Windows a network share like - // \\server\share can be a root directory, although it cannot be the - // current directory. Handle this properly. - return pathname_.length() == 3 && IsAbsolutePath(); -#else - return pathname_.length() == 1 && IsPathSeparator(pathname_.c_str()[0]); -#endif -} - -// Returns true if pathname describes an absolute path. -bool FilePath::IsAbsolutePath() const { - const char* const name = pathname_.c_str(); -#if GTEST_OS_WINDOWS - return pathname_.length() >= 3 && - ((name[0] >= 'a' && name[0] <= 'z') || - (name[0] >= 'A' && name[0] <= 'Z')) && - name[1] == ':' && - IsPathSeparator(name[2]); -#else - return IsPathSeparator(name[0]); -#endif -} - -// Returns a pathname for a file that does not currently exist. The pathname -// will be directory/base_name.extension or -// directory/base_name_.extension if directory/base_name.extension -// already exists. The number will be incremented until a pathname is found -// that does not already exist. -// Examples: 'dir/foo_test.xml' or 'dir/foo_test_1.xml'. -// There could be a race condition if two or more processes are calling this -// function at the same time -- they could both pick the same filename. -FilePath FilePath::GenerateUniqueFileName(const FilePath& directory, - const FilePath& base_name, - const char* extension) { - FilePath full_pathname; - int number = 0; - do { - full_pathname.Set(MakeFileName(directory, base_name, number++, extension)); - } while (full_pathname.FileOrDirectoryExists()); - return full_pathname; -} - -// Returns true if FilePath ends with a path separator, which indicates that -// it is intended to represent a directory. Returns false otherwise. -// This does NOT check that a directory (or file) actually exists. -bool FilePath::IsDirectory() const { - return !pathname_.empty() && - IsPathSeparator(pathname_.c_str()[pathname_.length() - 1]); -} - -// Create directories so that path exists. Returns true if successful or if -// the directories already exist; returns false if unable to create directories -// for any reason. -bool FilePath::CreateDirectoriesRecursively() const { - if (!this->IsDirectory()) { - return false; - } - - if (pathname_.length() == 0 || this->DirectoryExists()) { - return true; - } - - const FilePath parent(this->RemoveTrailingPathSeparator().RemoveFileName()); - return parent.CreateDirectoriesRecursively() && this->CreateFolder(); -} - -// Create the directory so that path exists. Returns true if successful or -// if the directory already exists; returns false if unable to create the -// directory for any reason, including if the parent directory does not -// exist. Not named "CreateDirectory" because that's a macro on Windows. -bool FilePath::CreateFolder() const { -#if GTEST_OS_WINDOWS_MOBILE - FilePath removed_sep(this->RemoveTrailingPathSeparator()); - LPCWSTR unicode = String::AnsiToUtf16(removed_sep.c_str()); - int result = CreateDirectory(unicode, NULL) ? 0 : -1; - delete [] unicode; -#elif GTEST_OS_WINDOWS - int result = _mkdir(pathname_.c_str()); -#else - int result = mkdir(pathname_.c_str(), 0777); -#endif // GTEST_OS_WINDOWS_MOBILE - - if (result == -1) { - return this->DirectoryExists(); // An error is OK if the directory exists. - } - return true; // No error. -} - -// If input name has a trailing separator character, remove it and return the -// name, otherwise return the name string unmodified. -// On Windows platform, uses \ as the separator, other platforms use /. -FilePath FilePath::RemoveTrailingPathSeparator() const { - return IsDirectory() - ? FilePath(String(pathname_.c_str(), pathname_.length() - 1)) - : *this; -} - -// Removes any redundant separators that might be in the pathname. -// For example, "bar///foo" becomes "bar/foo". Does not eliminate other -// redundancies that might be in a pathname involving "." or "..". -// TODO(wan@google.com): handle Windows network shares (e.g. \\server\share). -void FilePath::Normalize() { - if (pathname_.c_str() == NULL) { - pathname_ = ""; - return; - } - const char* src = pathname_.c_str(); - char* const dest = new char[pathname_.length() + 1]; - char* dest_ptr = dest; - memset(dest_ptr, 0, pathname_.length() + 1); - - while (*src != '\0') { - *dest_ptr = *src; - if (!IsPathSeparator(*src)) { - src++; - } else { -#if GTEST_HAS_ALT_PATH_SEP_ - if (*dest_ptr == kAlternatePathSeparator) { - *dest_ptr = kPathSeparator; - } -#endif - while (IsPathSeparator(*src)) - src++; - } - dest_ptr++; - } - *dest_ptr = '\0'; - pathname_ = dest; - delete[] dest; -} - -} // namespace internal -} // namespace testing -// Copyright 2008, 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. -// -// Author: wan@google.com (Zhanyong Wan) - - -#include -#include -#include -#include - -#if GTEST_OS_WINDOWS_MOBILE -# include // For TerminateProcess() -#elif GTEST_OS_WINDOWS -# include -# include -#else -# include -#endif // GTEST_OS_WINDOWS_MOBILE - -#if GTEST_OS_MAC -# include -# include -# include -#endif // GTEST_OS_MAC - - -// Indicates that this translation unit is part of Google Test's -// implementation. It must come before gtest-internal-inl.h is -// included, or there will be a compiler error. This trick is to -// prevent a user from accidentally including gtest-internal-inl.h in -// his code. -#define GTEST_IMPLEMENTATION_ 1 -#undef GTEST_IMPLEMENTATION_ - -namespace testing { -namespace internal { - -#if defined(_MSC_VER) || defined(__BORLANDC__) -// MSVC and C++Builder do not provide a definition of STDERR_FILENO. -const int kStdOutFileno = 1; -const int kStdErrFileno = 2; -#else -const int kStdOutFileno = STDOUT_FILENO; -const int kStdErrFileno = STDERR_FILENO; -#endif // _MSC_VER - -#if GTEST_OS_MAC - -// Returns the number of threads running in the process, or 0 to indicate that -// we cannot detect it. -size_t GetThreadCount() { - const task_t task = mach_task_self(); - mach_msg_type_number_t thread_count; - thread_act_array_t thread_list; - const kern_return_t status = task_threads(task, &thread_list, &thread_count); - if (status == KERN_SUCCESS) { - // task_threads allocates resources in thread_list and we need to free them - // to avoid leaks. - vm_deallocate(task, - reinterpret_cast(thread_list), - sizeof(thread_t) * thread_count); - return static_cast(thread_count); - } else { - return 0; - } -} - -#else - -size_t GetThreadCount() { - // There's no portable way to detect the number of threads, so we just - // return 0 to indicate that we cannot detect it. - return 0; -} - -#endif // GTEST_OS_MAC - -#if GTEST_USES_POSIX_RE - -// Implements RE. Currently only needed for death tests. - -RE::~RE() { - if (is_valid_) { - // regfree'ing an invalid regex might crash because the content - // of the regex is undefined. Since the regex's are essentially - // the same, one cannot be valid (or invalid) without the other - // being so too. - regfree(&partial_regex_); - regfree(&full_regex_); - } - free(const_cast(pattern_)); -} - -// Returns true iff regular expression re matches the entire str. -bool RE::FullMatch(const char* str, const RE& re) { - if (!re.is_valid_) return false; - - regmatch_t match; - return regexec(&re.full_regex_, str, 1, &match, 0) == 0; -} - -// Returns true iff regular expression re matches a substring of str -// (including str itself). -bool RE::PartialMatch(const char* str, const RE& re) { - if (!re.is_valid_) return false; - - regmatch_t match; - return regexec(&re.partial_regex_, str, 1, &match, 0) == 0; -} - -// Initializes an RE from its string representation. -void RE::Init(const char* regex) { - pattern_ = posix::StrDup(regex); - - // Reserves enough bytes to hold the regular expression used for a - // full match. - const size_t full_regex_len = strlen(regex) + 10; - char* const full_pattern = new char[full_regex_len]; - - snprintf(full_pattern, full_regex_len, "^(%s)$", regex); - is_valid_ = regcomp(&full_regex_, full_pattern, REG_EXTENDED) == 0; - // We want to call regcomp(&partial_regex_, ...) even if the - // previous expression returns false. Otherwise partial_regex_ may - // not be properly initialized can may cause trouble when it's - // freed. - // - // Some implementation of POSIX regex (e.g. on at least some - // versions of Cygwin) doesn't accept the empty string as a valid - // regex. We change it to an equivalent form "()" to be safe. - if (is_valid_) { - const char* const partial_regex = (*regex == '\0') ? "()" : regex; - is_valid_ = regcomp(&partial_regex_, partial_regex, REG_EXTENDED) == 0; - } - EXPECT_TRUE(is_valid_) - << "Regular expression \"" << regex - << "\" is not a valid POSIX Extended regular expression."; - - delete[] full_pattern; -} - -#elif GTEST_USES_SIMPLE_RE - -// Returns true iff ch appears anywhere in str (excluding the -// terminating '\0' character). -bool IsInSet(char ch, const char* str) { - return ch != '\0' && strchr(str, ch) != NULL; -} - -// Returns true iff ch belongs to the given classification. Unlike -// similar functions in , these aren't affected by the -// current locale. -bool IsAsciiDigit(char ch) { return '0' <= ch && ch <= '9'; } -bool IsAsciiPunct(char ch) { - return IsInSet(ch, "^-!\"#$%&'()*+,./:;<=>?@[\\]_`{|}~"); -} -bool IsRepeat(char ch) { return IsInSet(ch, "?*+"); } -bool IsAsciiWhiteSpace(char ch) { return IsInSet(ch, " \f\n\r\t\v"); } -bool IsAsciiWordChar(char ch) { - return ('a' <= ch && ch <= 'z') || ('A' <= ch && ch <= 'Z') || - ('0' <= ch && ch <= '9') || ch == '_'; -} - -// Returns true iff "\\c" is a supported escape sequence. -bool IsValidEscape(char c) { - return (IsAsciiPunct(c) || IsInSet(c, "dDfnrsStvwW")); -} - -// Returns true iff the given atom (specified by escaped and pattern) -// matches ch. The result is undefined if the atom is invalid. -bool AtomMatchesChar(bool escaped, char pattern_char, char ch) { - if (escaped) { // "\\p" where p is pattern_char. - switch (pattern_char) { - case 'd': return IsAsciiDigit(ch); - case 'D': return !IsAsciiDigit(ch); - case 'f': return ch == '\f'; - case 'n': return ch == '\n'; - case 'r': return ch == '\r'; - case 's': return IsAsciiWhiteSpace(ch); - case 'S': return !IsAsciiWhiteSpace(ch); - case 't': return ch == '\t'; - case 'v': return ch == '\v'; - case 'w': return IsAsciiWordChar(ch); - case 'W': return !IsAsciiWordChar(ch); - } - return IsAsciiPunct(pattern_char) && pattern_char == ch; - } - - return (pattern_char == '.' && ch != '\n') || pattern_char == ch; -} - -// Helper function used by ValidateRegex() to format error messages. -String FormatRegexSyntaxError(const char* regex, int index) { - return (Message() << "Syntax error at index " << index - << " in simple regular expression \"" << regex << "\": ").GetString(); -} - -// Generates non-fatal failures and returns false if regex is invalid; -// otherwise returns true. -bool ValidateRegex(const char* regex) { - if (regex == NULL) { - // TODO(wan@google.com): fix the source file location in the - // assertion failures to match where the regex is used in user - // code. - ADD_FAILURE() << "NULL is not a valid simple regular expression."; - return false; - } - - bool is_valid = true; - - // True iff ?, *, or + can follow the previous atom. - bool prev_repeatable = false; - for (int i = 0; regex[i]; i++) { - if (regex[i] == '\\') { // An escape sequence - i++; - if (regex[i] == '\0') { - ADD_FAILURE() << FormatRegexSyntaxError(regex, i - 1) - << "'\\' cannot appear at the end."; - return false; - } - - if (!IsValidEscape(regex[i])) { - ADD_FAILURE() << FormatRegexSyntaxError(regex, i - 1) - << "invalid escape sequence \"\\" << regex[i] << "\"."; - is_valid = false; - } - prev_repeatable = true; - } else { // Not an escape sequence. - const char ch = regex[i]; - - if (ch == '^' && i > 0) { - ADD_FAILURE() << FormatRegexSyntaxError(regex, i) - << "'^' can only appear at the beginning."; - is_valid = false; - } else if (ch == '$' && regex[i + 1] != '\0') { - ADD_FAILURE() << FormatRegexSyntaxError(regex, i) - << "'$' can only appear at the end."; - is_valid = false; - } else if (IsInSet(ch, "()[]{}|")) { - ADD_FAILURE() << FormatRegexSyntaxError(regex, i) - << "'" << ch << "' is unsupported."; - is_valid = false; - } else if (IsRepeat(ch) && !prev_repeatable) { - ADD_FAILURE() << FormatRegexSyntaxError(regex, i) - << "'" << ch << "' can only follow a repeatable token."; - is_valid = false; - } - - prev_repeatable = !IsInSet(ch, "^$?*+"); - } - } - - return is_valid; -} - -// Matches a repeated regex atom followed by a valid simple regular -// expression. The regex atom is defined as c if escaped is false, -// or \c otherwise. repeat is the repetition meta character (?, *, -// or +). The behavior is undefined if str contains too many -// characters to be indexable by size_t, in which case the test will -// probably time out anyway. We are fine with this limitation as -// std::string has it too. -bool MatchRepetitionAndRegexAtHead( - bool escaped, char c, char repeat, const char* regex, - const char* str) { - const size_t min_count = (repeat == '+') ? 1 : 0; - const size_t max_count = (repeat == '?') ? 1 : - static_cast(-1) - 1; - // We cannot call numeric_limits::max() as it conflicts with the - // max() macro on Windows. - - for (size_t i = 0; i <= max_count; ++i) { - // We know that the atom matches each of the first i characters in str. - if (i >= min_count && MatchRegexAtHead(regex, str + i)) { - // We have enough matches at the head, and the tail matches too. - // Since we only care about *whether* the pattern matches str - // (as opposed to *how* it matches), there is no need to find a - // greedy match. - return true; - } - if (str[i] == '\0' || !AtomMatchesChar(escaped, c, str[i])) - return false; - } - return false; -} - -// Returns true iff regex matches a prefix of str. regex must be a -// valid simple regular expression and not start with "^", or the -// result is undefined. -bool MatchRegexAtHead(const char* regex, const char* str) { - if (*regex == '\0') // An empty regex matches a prefix of anything. - return true; - - // "$" only matches the end of a string. Note that regex being - // valid guarantees that there's nothing after "$" in it. - if (*regex == '$') - return *str == '\0'; - - // Is the first thing in regex an escape sequence? - const bool escaped = *regex == '\\'; - if (escaped) - ++regex; - if (IsRepeat(regex[1])) { - // MatchRepetitionAndRegexAtHead() calls MatchRegexAtHead(), so - // here's an indirect recursion. It terminates as the regex gets - // shorter in each recursion. - return MatchRepetitionAndRegexAtHead( - escaped, regex[0], regex[1], regex + 2, str); - } else { - // regex isn't empty, isn't "$", and doesn't start with a - // repetition. We match the first atom of regex with the first - // character of str and recurse. - return (*str != '\0') && AtomMatchesChar(escaped, *regex, *str) && - MatchRegexAtHead(regex + 1, str + 1); - } -} - -// Returns true iff regex matches any substring of str. regex must be -// a valid simple regular expression, or the result is undefined. -// -// The algorithm is recursive, but the recursion depth doesn't exceed -// the regex length, so we won't need to worry about running out of -// stack space normally. In rare cases the time complexity can be -// exponential with respect to the regex length + the string length, -// but usually it's must faster (often close to linear). -bool MatchRegexAnywhere(const char* regex, const char* str) { - if (regex == NULL || str == NULL) - return false; - - if (*regex == '^') - return MatchRegexAtHead(regex + 1, str); - - // A successful match can be anywhere in str. - do { - if (MatchRegexAtHead(regex, str)) - return true; - } while (*str++ != '\0'); - return false; -} - -// Implements the RE class. - -RE::~RE() { - free(const_cast(pattern_)); - free(const_cast(full_pattern_)); -} - -// Returns true iff regular expression re matches the entire str. -bool RE::FullMatch(const char* str, const RE& re) { - return re.is_valid_ && MatchRegexAnywhere(re.full_pattern_, str); -} - -// Returns true iff regular expression re matches a substring of str -// (including str itself). -bool RE::PartialMatch(const char* str, const RE& re) { - return re.is_valid_ && MatchRegexAnywhere(re.pattern_, str); -} - -// Initializes an RE from its string representation. -void RE::Init(const char* regex) { - pattern_ = full_pattern_ = NULL; - if (regex != NULL) { - pattern_ = posix::StrDup(regex); - } - - is_valid_ = ValidateRegex(regex); - if (!is_valid_) { - // No need to calculate the full pattern when the regex is invalid. - return; - } - - const size_t len = strlen(regex); - // Reserves enough bytes to hold the regular expression used for a - // full match: we need space to prepend a '^', append a '$', and - // terminate the string with '\0'. - char* buffer = static_cast(malloc(len + 3)); - full_pattern_ = buffer; - - if (*regex != '^') - *buffer++ = '^'; // Makes sure full_pattern_ starts with '^'. - - // We don't use snprintf or strncpy, as they trigger a warning when - // compiled with VC++ 8.0. - memcpy(buffer, regex, len); - buffer += len; - - if (len == 0 || regex[len - 1] != '$') - *buffer++ = '$'; // Makes sure full_pattern_ ends with '$'. - - *buffer = '\0'; -} - -#endif // GTEST_USES_POSIX_RE - -const char kUnknownFile[] = "unknown file"; - -// Formats a source file path and a line number as they would appear -// in an error message from the compiler used to compile this code. -GTEST_API_ ::std::string FormatFileLocation(const char* file, int line) { - const char* const file_name = file == NULL ? kUnknownFile : file; - - if (line < 0) { - return String::Format("%s:", file_name).c_str(); - } -#ifdef _MSC_VER - return String::Format("%s(%d):", file_name, line).c_str(); -#else - return String::Format("%s:%d:", file_name, line).c_str(); -#endif // _MSC_VER -} - -// Formats a file location for compiler-independent XML output. -// Although this function is not platform dependent, we put it next to -// FormatFileLocation in order to contrast the two functions. -// Note that FormatCompilerIndependentFileLocation() does NOT append colon -// to the file location it produces, unlike FormatFileLocation(). -GTEST_API_ ::std::string FormatCompilerIndependentFileLocation( - const char* file, int line) { - const char* const file_name = file == NULL ? kUnknownFile : file; - - if (line < 0) - return file_name; - else - return String::Format("%s:%d", file_name, line).c_str(); -} - - -GTestLog::GTestLog(GTestLogSeverity severity, const char* file, int line) - : severity_(severity) { - const char* const marker = - severity == GTEST_INFO ? "[ INFO ]" : - severity == GTEST_WARNING ? "[WARNING]" : - severity == GTEST_ERROR ? "[ ERROR ]" : "[ FATAL ]"; - GetStream() << ::std::endl << marker << " " - << FormatFileLocation(file, line).c_str() << ": "; -} - -// Flushes the buffers and, if severity is GTEST_FATAL, aborts the program. -GTestLog::~GTestLog() { - GetStream() << ::std::endl; - if (severity_ == GTEST_FATAL) { - fflush(stderr); - posix::Abort(); - } -} -// Disable Microsoft deprecation warnings for POSIX functions called from -// this class (creat, dup, dup2, and close) -#ifdef _MSC_VER -# pragma warning(push) -# pragma warning(disable: 4996) -#endif // _MSC_VER - -#if GTEST_HAS_STREAM_REDIRECTION - -// Object that captures an output stream (stdout/stderr). -class CapturedStream { - public: - // The ctor redirects the stream to a temporary file. - CapturedStream(int fd) : fd_(fd), uncaptured_fd_(dup(fd)) { - -# if GTEST_OS_WINDOWS - char temp_dir_path[MAX_PATH + 1] = { '\0' }; // NOLINT - char temp_file_path[MAX_PATH + 1] = { '\0' }; // NOLINT - - ::GetTempPathA(sizeof(temp_dir_path), temp_dir_path); - const UINT success = ::GetTempFileNameA(temp_dir_path, - "gtest_redir", - 0, // Generate unique file name. - temp_file_path); - GTEST_CHECK_(success != 0) - << "Unable to create a temporary file in " << temp_dir_path; - const int captured_fd = creat(temp_file_path, _S_IREAD | _S_IWRITE); - GTEST_CHECK_(captured_fd != -1) << "Unable to open temporary file " - << temp_file_path; - filename_ = temp_file_path; -# else - // There's no guarantee that a test has write access to the - // current directory, so we create the temporary file in the /tmp - // directory instead. - char name_template[] = "/tmp/captured_stream.XXXXXX"; - const int captured_fd = mkstemp(name_template); - filename_ = name_template; -# endif // GTEST_OS_WINDOWS - fflush(NULL); - dup2(captured_fd, fd_); - close(captured_fd); - } - - ~CapturedStream() { - remove(filename_.c_str()); - } - - String GetCapturedString() { - if (uncaptured_fd_ != -1) { - // Restores the original stream. - fflush(NULL); - dup2(uncaptured_fd_, fd_); - close(uncaptured_fd_); - uncaptured_fd_ = -1; - } - - FILE* const file = posix::FOpen(filename_.c_str(), "r"); - const String content = ReadEntireFile(file); - posix::FClose(file); - return content; - } - - private: - // Reads the entire content of a file as a String. - static String ReadEntireFile(FILE* file); - - // Returns the size (in bytes) of a file. - static size_t GetFileSize(FILE* file); - - const int fd_; // A stream to capture. - int uncaptured_fd_; - // Name of the temporary file holding the stderr output. - ::std::string filename_; - - GTEST_DISALLOW_COPY_AND_ASSIGN_(CapturedStream); -}; - -// Returns the size (in bytes) of a file. -size_t CapturedStream::GetFileSize(FILE* file) { - fseek(file, 0, SEEK_END); - return static_cast(ftell(file)); -} - -// Reads the entire content of a file as a string. -String CapturedStream::ReadEntireFile(FILE* file) { - const size_t file_size = GetFileSize(file); - char* const buffer = new char[file_size]; - - size_t bytes_last_read = 0; // # of bytes read in the last fread() - size_t bytes_read = 0; // # of bytes read so far - - fseek(file, 0, SEEK_SET); - - // Keeps reading the file until we cannot read further or the - // pre-determined file size is reached. - do { - bytes_last_read = fread(buffer+bytes_read, 1, file_size-bytes_read, file); - bytes_read += bytes_last_read; - } while (bytes_last_read > 0 && bytes_read < file_size); - - const String content(buffer, bytes_read); - delete[] buffer; - - return content; -} - -# ifdef _MSC_VER -# pragma warning(pop) -# endif // _MSC_VER - -static CapturedStream* g_captured_stderr = NULL; -static CapturedStream* g_captured_stdout = NULL; - -// Starts capturing an output stream (stdout/stderr). -void CaptureStream(int fd, const char* stream_name, CapturedStream** stream) { - if (*stream != NULL) { - GTEST_LOG_(FATAL) << "Only one " << stream_name - << " capturer can exist at a time."; - } - *stream = new CapturedStream(fd); -} - -// Stops capturing the output stream and returns the captured string. -String GetCapturedStream(CapturedStream** captured_stream) { - const String content = (*captured_stream)->GetCapturedString(); - - delete *captured_stream; - *captured_stream = NULL; - - return content; -} - -// Starts capturing stdout. -void CaptureStdout() { - CaptureStream(kStdOutFileno, "stdout", &g_captured_stdout); -} - -// Starts capturing stderr. -void CaptureStderr() { - CaptureStream(kStdErrFileno, "stderr", &g_captured_stderr); -} - -// Stops capturing stdout and returns the captured string. -String GetCapturedStdout() { return GetCapturedStream(&g_captured_stdout); } - -// Stops capturing stderr and returns the captured string. -String GetCapturedStderr() { return GetCapturedStream(&g_captured_stderr); } - -#endif // GTEST_HAS_STREAM_REDIRECTION - -#if GTEST_HAS_DEATH_TEST - -// A copy of all command line arguments. Set by InitGoogleTest(). -::std::vector g_argvs; - -// Returns the command line as a vector of strings. -const ::std::vector& GetArgvs() { return g_argvs; } - -#endif // GTEST_HAS_DEATH_TEST - -#if GTEST_OS_WINDOWS_MOBILE -namespace posix { -void Abort() { - DebugBreak(); - TerminateProcess(GetCurrentProcess(), 1); -} -} // namespace posix -#endif // GTEST_OS_WINDOWS_MOBILE - -// Returns the name of the environment variable corresponding to the -// given flag. For example, FlagToEnvVar("foo") will return -// "GTEST_FOO" in the open-source version. -static String FlagToEnvVar(const char* flag) { - const String full_flag = - (Message() << GTEST_FLAG_PREFIX_ << flag).GetString(); - - Message env_var; - for (size_t i = 0; i != full_flag.length(); i++) { - env_var << ToUpper(full_flag.c_str()[i]); - } - - return env_var.GetString(); -} - -// Parses 'str' for a 32-bit signed integer. If successful, writes -// the result to *value and returns true; otherwise leaves *value -// unchanged and returns false. -bool ParseInt32(const Message& src_text, const char* str, Int32* value) { - // Parses the environment variable as a decimal integer. - char* end = NULL; - const long long_value = strtol(str, &end, 10); // NOLINT - - // Has strtol() consumed all characters in the string? - if (*end != '\0') { - // No - an invalid character was encountered. - Message msg; - msg << "WARNING: " << src_text - << " is expected to be a 32-bit integer, but actually" - << " has value \"" << str << "\".\n"; - printf("%s", msg.GetString().c_str()); - fflush(stdout); - return false; - } - - // Is the parsed value in the range of an Int32? - const Int32 result = static_cast(long_value); - if (long_value == LONG_MAX || long_value == LONG_MIN || - // The parsed value overflows as a long. (strtol() returns - // LONG_MAX or LONG_MIN when the input overflows.) - result != long_value - // The parsed value overflows as an Int32. - ) { - Message msg; - msg << "WARNING: " << src_text - << " is expected to be a 32-bit integer, but actually" - << " has value " << str << ", which overflows.\n"; - printf("%s", msg.GetString().c_str()); - fflush(stdout); - return false; - } - - *value = result; - return true; -} - -// Reads and returns the Boolean environment variable corresponding to -// the given flag; if it's not set, returns default_value. -// -// The value is considered true iff it's not "0". -bool BoolFromGTestEnv(const char* flag, bool default_value) { - const String env_var = FlagToEnvVar(flag); - const char* const string_value = posix::GetEnv(env_var.c_str()); - return string_value == NULL ? - default_value : strcmp(string_value, "0") != 0; -} - -// Reads and returns a 32-bit integer stored in the environment -// variable corresponding to the given flag; if it isn't set or -// doesn't represent a valid 32-bit integer, returns default_value. -Int32 Int32FromGTestEnv(const char* flag, Int32 default_value) { - const String env_var = FlagToEnvVar(flag); - const char* const string_value = posix::GetEnv(env_var.c_str()); - if (string_value == NULL) { - // The environment variable is not set. - return default_value; - } - - Int32 result = default_value; - if (!ParseInt32(Message() << "Environment variable " << env_var, - string_value, &result)) { - printf("The default value %s is used.\n", - (Message() << default_value).GetString().c_str()); - fflush(stdout); - return default_value; - } - - return result; -} - -// Reads and returns the string environment variable corresponding to -// the given flag; if it's not set, returns default_value. -const char* StringFromGTestEnv(const char* flag, const char* default_value) { - const String env_var = FlagToEnvVar(flag); - const char* const value = posix::GetEnv(env_var.c_str()); - return value == NULL ? default_value : value; -} - -} // namespace internal -} // namespace testing -// Copyright 2007, 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. -// -// Author: wan@google.com (Zhanyong Wan) - -// Google Test - The Google C++ Testing Framework -// -// This file implements a universal value printer that can print a -// value of any type T: -// -// void ::testing::internal::UniversalPrinter::Print(value, ostream_ptr); -// -// It uses the << operator when possible, and prints the bytes in the -// object otherwise. A user can override its behavior for a class -// type Foo by defining either operator<<(::std::ostream&, const Foo&) -// or void PrintTo(const Foo&, ::std::ostream*) in the namespace that -// defines Foo. - -#include -#include -#include // NOLINT -#include - -namespace testing { - -namespace { - -using ::std::ostream; - -#if GTEST_OS_WINDOWS_MOBILE // Windows CE does not define _snprintf_s. -# define snprintf _snprintf -#elif _MSC_VER >= 1400 // VC 8.0 and later deprecate snprintf and _snprintf. -# define snprintf _snprintf_s -#elif _MSC_VER -# define snprintf _snprintf -#endif // GTEST_OS_WINDOWS_MOBILE - -// Prints a segment of bytes in the given object. -void PrintByteSegmentInObjectTo(const unsigned char* obj_bytes, size_t start, - size_t count, ostream* os) { - char text[5] = ""; - for (size_t i = 0; i != count; i++) { - const size_t j = start + i; - if (i != 0) { - // Organizes the bytes into groups of 2 for easy parsing by - // human. - if ((j % 2) == 0) - *os << ' '; - else - *os << '-'; - } - snprintf(text, sizeof(text), "%02X", obj_bytes[j]); - *os << text; - } -} - -// Prints the bytes in the given value to the given ostream. -void PrintBytesInObjectToImpl(const unsigned char* obj_bytes, size_t count, - ostream* os) { - // Tells the user how big the object is. - *os << count << "-byte object <"; - - const size_t kThreshold = 132; - const size_t kChunkSize = 64; - // If the object size is bigger than kThreshold, we'll have to omit - // some details by printing only the first and the last kChunkSize - // bytes. - // TODO(wan): let the user control the threshold using a flag. - if (count < kThreshold) { - PrintByteSegmentInObjectTo(obj_bytes, 0, count, os); - } else { - PrintByteSegmentInObjectTo(obj_bytes, 0, kChunkSize, os); - *os << " ... "; - // Rounds up to 2-byte boundary. - const size_t resume_pos = (count - kChunkSize + 1)/2*2; - PrintByteSegmentInObjectTo(obj_bytes, resume_pos, count - resume_pos, os); - } - *os << ">"; -} - -} // namespace - -namespace internal2 { - -// Delegates to PrintBytesInObjectToImpl() to print the bytes in the -// given object. The delegation simplifies the implementation, which -// uses the << operator and thus is easier done outside of the -// ::testing::internal namespace, which contains a << operator that -// sometimes conflicts with the one in STL. -void PrintBytesInObjectTo(const unsigned char* obj_bytes, size_t count, - ostream* os) { - PrintBytesInObjectToImpl(obj_bytes, count, os); -} - -} // namespace internal2 - -namespace internal { - -// Depending on the value of a char (or wchar_t), we print it in one -// of three formats: -// - as is if it's a printable ASCII (e.g. 'a', '2', ' '), -// - as a hexidecimal escape sequence (e.g. '\x7F'), or -// - as a special escape sequence (e.g. '\r', '\n'). -enum CharFormat { - kAsIs, - kHexEscape, - kSpecialEscape -}; - -// Returns true if c is a printable ASCII character. We test the -// value of c directly instead of calling isprint(), which is buggy on -// Windows Mobile. -inline bool IsPrintableAscii(wchar_t c) { - return 0x20 <= c && c <= 0x7E; -} - -// Prints a wide or narrow char c as a character literal without the -// quotes, escaping it when necessary; returns how c was formatted. -// The template argument UnsignedChar is the unsigned version of Char, -// which is the type of c. -template -static CharFormat PrintAsCharLiteralTo(Char c, ostream* os) { - switch (static_cast(c)) { - case L'\0': - *os << "\\0"; - break; - case L'\'': - *os << "\\'"; - break; - case L'\\': - *os << "\\\\"; - break; - case L'\a': - *os << "\\a"; - break; - case L'\b': - *os << "\\b"; - break; - case L'\f': - *os << "\\f"; - break; - case L'\n': - *os << "\\n"; - break; - case L'\r': - *os << "\\r"; - break; - case L'\t': - *os << "\\t"; - break; - case L'\v': - *os << "\\v"; - break; - default: - if (IsPrintableAscii(c)) { - *os << static_cast(c); - return kAsIs; - } else { - *os << String::Format("\\x%X", static_cast(c)); - return kHexEscape; - } - } - return kSpecialEscape; -} - -// Prints a char c as if it's part of a string literal, escaping it when -// necessary; returns how c was formatted. -static CharFormat PrintAsWideStringLiteralTo(wchar_t c, ostream* os) { - switch (c) { - case L'\'': - *os << "'"; - return kAsIs; - case L'"': - *os << "\\\""; - return kSpecialEscape; - default: - return PrintAsCharLiteralTo(c, os); - } -} - -// Prints a char c as if it's part of a string literal, escaping it when -// necessary; returns how c was formatted. -static CharFormat PrintAsNarrowStringLiteralTo(char c, ostream* os) { - return PrintAsWideStringLiteralTo(static_cast(c), os); -} - -// Prints a wide or narrow character c and its code. '\0' is printed -// as "'\\0'", other unprintable characters are also properly escaped -// using the standard C++ escape sequence. The template argument -// UnsignedChar is the unsigned version of Char, which is the type of c. -template -void PrintCharAndCodeTo(Char c, ostream* os) { - // First, print c as a literal in the most readable form we can find. - *os << ((sizeof(c) > 1) ? "L'" : "'"); - const CharFormat format = PrintAsCharLiteralTo(c, os); - *os << "'"; - - // To aid user debugging, we also print c's code in decimal, unless - // it's 0 (in which case c was printed as '\\0', making the code - // obvious). - if (c == 0) - return; - *os << " (" << String::Format("%d", c).c_str(); - - // For more convenience, we print c's code again in hexidecimal, - // unless c was already printed in the form '\x##' or the code is in - // [1, 9]. - if (format == kHexEscape || (1 <= c && c <= 9)) { - // Do nothing. - } else { - *os << String::Format(", 0x%X", - static_cast(c)).c_str(); - } - *os << ")"; -} - -void PrintTo(unsigned char c, ::std::ostream* os) { - PrintCharAndCodeTo(c, os); -} -void PrintTo(signed char c, ::std::ostream* os) { - PrintCharAndCodeTo(c, os); -} - -// Prints a wchar_t as a symbol if it is printable or as its internal -// code otherwise and also as its code. L'\0' is printed as "L'\\0'". -void PrintTo(wchar_t wc, ostream* os) { - PrintCharAndCodeTo(wc, os); -} - -// Prints the given array of characters to the ostream. -// The array starts at *begin, the length is len, it may include '\0' characters -// and may not be null-terminated. -static void PrintCharsAsStringTo(const char* begin, size_t len, ostream* os) { - *os << "\""; - bool is_previous_hex = false; - for (size_t index = 0; index < len; ++index) { - const char cur = begin[index]; - if (is_previous_hex && IsXDigit(cur)) { - // Previous character is of '\x..' form and this character can be - // interpreted as another hexadecimal digit in its number. Break string to - // disambiguate. - *os << "\" \""; - } - is_previous_hex = PrintAsNarrowStringLiteralTo(cur, os) == kHexEscape; - } - *os << "\""; -} - -// Prints a (const) char array of 'len' elements, starting at address 'begin'. -void UniversalPrintArray(const char* begin, size_t len, ostream* os) { - PrintCharsAsStringTo(begin, len, os); -} - -// Prints the given array of wide characters to the ostream. -// The array starts at *begin, the length is len, it may include L'\0' -// characters and may not be null-terminated. -static void PrintWideCharsAsStringTo(const wchar_t* begin, size_t len, - ostream* os) { - *os << "L\""; - bool is_previous_hex = false; - for (size_t index = 0; index < len; ++index) { - const wchar_t cur = begin[index]; - if (is_previous_hex && isascii(cur) && IsXDigit(static_cast(cur))) { - // Previous character is of '\x..' form and this character can be - // interpreted as another hexadecimal digit in its number. Break string to - // disambiguate. - *os << "\" L\""; - } - is_previous_hex = PrintAsWideStringLiteralTo(cur, os) == kHexEscape; - } - *os << "\""; -} - -// Prints the given C string to the ostream. -void PrintTo(const char* s, ostream* os) { - if (s == NULL) { - *os << "NULL"; - } else { - *os << ImplicitCast_(s) << " pointing to "; - PrintCharsAsStringTo(s, strlen(s), os); - } -} - -// MSVC compiler can be configured to define whar_t as a typedef -// of unsigned short. Defining an overload for const wchar_t* in that case -// would cause pointers to unsigned shorts be printed as wide strings, -// possibly accessing more memory than intended and causing invalid -// memory accesses. MSVC defines _NATIVE_WCHAR_T_DEFINED symbol when -// wchar_t is implemented as a native type. -#if !defined(_MSC_VER) || defined(_NATIVE_WCHAR_T_DEFINED) -// Prints the given wide C string to the ostream. -void PrintTo(const wchar_t* s, ostream* os) { - if (s == NULL) { - *os << "NULL"; - } else { - *os << ImplicitCast_(s) << " pointing to "; - PrintWideCharsAsStringTo(s, wcslen(s), os); - } -} -#endif // wchar_t is native - -// Prints a ::string object. -#if GTEST_HAS_GLOBAL_STRING -void PrintStringTo(const ::string& s, ostream* os) { - PrintCharsAsStringTo(s.data(), s.size(), os); -} -#endif // GTEST_HAS_GLOBAL_STRING - -void PrintStringTo(const ::std::string& s, ostream* os) { - PrintCharsAsStringTo(s.data(), s.size(), os); -} - -// Prints a ::wstring object. -#if GTEST_HAS_GLOBAL_WSTRING -void PrintWideStringTo(const ::wstring& s, ostream* os) { - PrintWideCharsAsStringTo(s.data(), s.size(), os); -} -#endif // GTEST_HAS_GLOBAL_WSTRING - -#if GTEST_HAS_STD_WSTRING -void PrintWideStringTo(const ::std::wstring& s, ostream* os) { - PrintWideCharsAsStringTo(s.data(), s.size(), os); -} -#endif // GTEST_HAS_STD_WSTRING - -} // namespace internal - -} // namespace testing -// Copyright 2008, 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. -// -// Author: mheule@google.com (Markus Heule) -// -// The Google C++ Testing Framework (Google Test) - - -// Indicates that this translation unit is part of Google Test's -// implementation. It must come before gtest-internal-inl.h is -// included, or there will be a compiler error. This trick is to -// prevent a user from accidentally including gtest-internal-inl.h in -// his code. -#define GTEST_IMPLEMENTATION_ 1 -#undef GTEST_IMPLEMENTATION_ - -namespace testing { - -using internal::GetUnitTestImpl; - -// Gets the summary of the failure message by omitting the stack trace -// in it. -internal::String TestPartResult::ExtractSummary(const char* message) { - const char* const stack_trace = strstr(message, internal::kStackTraceMarker); - return stack_trace == NULL ? internal::String(message) : - internal::String(message, stack_trace - message); -} - -// Prints a TestPartResult object. -std::ostream& operator<<(std::ostream& os, const TestPartResult& result) { - return os - << result.file_name() << ":" << result.line_number() << ": " - << (result.type() == TestPartResult::kSuccess ? "Success" : - result.type() == TestPartResult::kFatalFailure ? "Fatal failure" : - "Non-fatal failure") << ":\n" - << result.message() << std::endl; -} - -// Appends a TestPartResult to the array. -void TestPartResultArray::Append(const TestPartResult& result) { - array_.push_back(result); -} - -// Returns the TestPartResult at the given index (0-based). -const TestPartResult& TestPartResultArray::GetTestPartResult(int index) const { - if (index < 0 || index >= size()) { - printf("\nInvalid index (%d) into TestPartResultArray.\n", index); - internal::posix::Abort(); - } - - return array_[index]; -} - -// Returns the number of TestPartResult objects in the array. -int TestPartResultArray::size() const { - return static_cast(array_.size()); -} - -namespace internal { - -HasNewFatalFailureHelper::HasNewFatalFailureHelper() - : has_new_fatal_failure_(false), - original_reporter_(GetUnitTestImpl()-> - GetTestPartResultReporterForCurrentThread()) { - GetUnitTestImpl()->SetTestPartResultReporterForCurrentThread(this); -} - -HasNewFatalFailureHelper::~HasNewFatalFailureHelper() { - GetUnitTestImpl()->SetTestPartResultReporterForCurrentThread( - original_reporter_); -} - -void HasNewFatalFailureHelper::ReportTestPartResult( - const TestPartResult& result) { - if (result.fatally_failed()) - has_new_fatal_failure_ = true; - original_reporter_->ReportTestPartResult(result); -} - -} // namespace internal - -} // namespace testing -// Copyright 2008 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. -// -// Author: wan@google.com (Zhanyong Wan) - - -namespace testing { -namespace internal { - -#if GTEST_HAS_TYPED_TEST_P - -// Skips to the first non-space char in str. Returns an empty string if str -// contains only whitespace characters. -static const char* SkipSpaces(const char* str) { - while (IsSpace(*str)) - str++; - return str; -} - -// Verifies that registered_tests match the test names in -// defined_test_names_; returns registered_tests if successful, or -// aborts the program otherwise. -const char* TypedTestCasePState::VerifyRegisteredTestNames( - const char* file, int line, const char* registered_tests) { - typedef ::std::set::const_iterator DefinedTestIter; - registered_ = true; - - // Skip initial whitespace in registered_tests since some - // preprocessors prefix stringizied literals with whitespace. - registered_tests = SkipSpaces(registered_tests); - - Message errors; - ::std::set tests; - for (const char* names = registered_tests; names != NULL; - names = SkipComma(names)) { - const String name = GetPrefixUntilComma(names); - if (tests.count(name) != 0) { - errors << "Test " << name << " is listed more than once.\n"; - continue; - } - - bool found = false; - for (DefinedTestIter it = defined_test_names_.begin(); - it != defined_test_names_.end(); - ++it) { - if (name == *it) { - found = true; - break; - } - } - - if (found) { - tests.insert(name); - } else { - errors << "No test named " << name - << " can be found in this test case.\n"; - } - } - - for (DefinedTestIter it = defined_test_names_.begin(); - it != defined_test_names_.end(); - ++it) { - if (tests.count(*it) == 0) { - errors << "You forgot to list test " << *it << ".\n"; - } - } - - const String& errors_str = errors.GetString(); - if (errors_str != "") { - fprintf(stderr, "%s %s", FormatFileLocation(file, line).c_str(), - errors_str.c_str()); - fflush(stderr); - posix::Abort(); - } - - return registered_tests; -} - -#endif // GTEST_HAS_TYPED_TEST_P - -} // namespace internal -} // namespace testing diff --git a/vra/tests-unit/gtest/gtest.h b/vra/tests-unit/gtest/gtest.h deleted file mode 100644 index 3143bd679..000000000 --- a/vra/tests-unit/gtest/gtest.h +++ /dev/null @@ -1,19537 +0,0 @@ -// Copyright 2005, 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. -// -// Author: wan@google.com (Zhanyong Wan) -// -// The Google C++ Testing Framework (Google Test) -// -// This header file defines the public API for Google Test. It should be -// included by any test program that uses Google Test. -// -// IMPORTANT NOTE: Due to limitation of the C++ language, we have to -// leave some internal implementation details in this header file. -// They are clearly marked by comments like this: -// -// // INTERNAL IMPLEMENTATION - DO NOT USE IN A USER PROGRAM. -// -// Such code is NOT meant to be used by a user directly, and is subject -// to CHANGE WITHOUT NOTICE. Therefore DO NOT DEPEND ON IT in a user -// program! -// -// Acknowledgment: Google Test borrowed the idea of automatic test -// registration from Barthelemy Dagenais' (barthelemy@prologique.com) -// easyUnit framework. - -#ifndef GTEST_INCLUDE_GTEST_GTEST_H_ -#define GTEST_INCLUDE_GTEST_GTEST_H_ - -#include -#include - -// Copyright 2005, 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: wan@google.com (Zhanyong Wan), eefacm@gmail.com (Sean Mcafee) -// -// The Google C++ Testing Framework (Google Test) -// -// This header file declares functions and macros used internally by -// Google Test. They are subject to change without notice. - -#ifndef GTEST_INCLUDE_GTEST_INTERNAL_GTEST_INTERNAL_H_ -#define GTEST_INCLUDE_GTEST_INTERNAL_GTEST_INTERNAL_H_ - -// Copyright 2005, 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: wan@google.com (Zhanyong Wan) -// -// Low-level types and utilities for porting Google Test to various -// platforms. They are subject to change without notice. DO NOT USE -// THEM IN USER CODE. - -#ifndef GTEST_INCLUDE_GTEST_INTERNAL_GTEST_PORT_H_ -#define GTEST_INCLUDE_GTEST_INTERNAL_GTEST_PORT_H_ - -// The user can define the following macros in the build script to -// control Google Test's behavior. If the user doesn't define a macro -// in this list, Google Test will define it. -// -// GTEST_HAS_CLONE - Define it to 1/0 to indicate that clone(2) -// is/isn't available. -// GTEST_HAS_EXCEPTIONS - Define it to 1/0 to indicate that exceptions -// are enabled. -// GTEST_HAS_GLOBAL_STRING - Define it to 1/0 to indicate that ::string -// is/isn't available (some systems define -// ::string, which is different to std::string). -// GTEST_HAS_GLOBAL_WSTRING - Define it to 1/0 to indicate that ::string -// is/isn't available (some systems define -// ::wstring, which is different to std::wstring). -// GTEST_HAS_POSIX_RE - Define it to 1/0 to indicate that POSIX regular -// expressions are/aren't available. -// GTEST_HAS_PTHREAD - Define it to 1/0 to indicate that -// is/isn't available. -// GTEST_HAS_RTTI - Define it to 1/0 to indicate that RTTI is/isn't -// enabled. -// GTEST_HAS_STD_WSTRING - Define it to 1/0 to indicate that -// std::wstring does/doesn't work (Google Test can -// be used where std::wstring is unavailable). -// GTEST_HAS_TR1_TUPLE - Define it to 1/0 to indicate tr1::tuple -// is/isn't available. -// GTEST_HAS_SEH - Define it to 1/0 to indicate whether the -// compiler supports Microsoft's "Structured -// Exception Handling". -// GTEST_HAS_STREAM_REDIRECTION -// - Define it to 1/0 to indicate whether the -// platform supports I/O stream redirection using -// dup() and dup2(). -// GTEST_USE_OWN_TR1_TUPLE - Define it to 1/0 to indicate whether Google -// Test's own tr1 tuple implementation should be -// used. Unused when the user sets -// GTEST_HAS_TR1_TUPLE to 0. -// GTEST_LINKED_AS_SHARED_LIBRARY -// - Define to 1 when compiling tests that use -// Google Test as a shared library (known as -// DLL on Windows). -// GTEST_CREATE_SHARED_LIBRARY -// - Define to 1 when compiling Google Test itself -// as a shared library. - -// This header defines the following utilities: -// -// Macros indicating the current platform (defined to 1 if compiled on -// the given platform; otherwise undefined): -// GTEST_OS_AIX - IBM AIX -// GTEST_OS_CYGWIN - Cygwin -// GTEST_OS_HPUX - HP-UX -// GTEST_OS_LINUX - Linux -// GTEST_OS_LINUX_ANDROID - Google Android -// GTEST_OS_MAC - Mac OS X -// GTEST_OS_NACL - Google Native Client (NaCl) -// GTEST_OS_SOLARIS - Sun Solaris -// GTEST_OS_SYMBIAN - Symbian -// GTEST_OS_WINDOWS - Windows (Desktop, MinGW, or Mobile) -// GTEST_OS_WINDOWS_DESKTOP - Windows Desktop -// GTEST_OS_WINDOWS_MINGW - MinGW -// GTEST_OS_WINDOWS_MOBILE - Windows Mobile -// GTEST_OS_ZOS - z/OS -// -// Among the platforms, Cygwin, Linux, Max OS X, and Windows have the -// most stable support. Since core members of the Google Test project -// don't have access to other platforms, support for them may be less -// stable. If you notice any problems on your platform, please notify -// googletestframework@googlegroups.com (patches for fixing them are -// even more welcome!). -// -// Note that it is possible that none of the GTEST_OS_* macros are defined. -// -// Macros indicating available Google Test features (defined to 1 if -// the corresponding feature is supported; otherwise undefined): -// GTEST_HAS_COMBINE - the Combine() function (for value-parameterized -// tests) -// GTEST_HAS_DEATH_TEST - death tests -// GTEST_HAS_PARAM_TEST - value-parameterized tests -// GTEST_HAS_TYPED_TEST - typed tests -// GTEST_HAS_TYPED_TEST_P - type-parameterized tests -// GTEST_USES_POSIX_RE - enhanced POSIX regex is used. Do not confuse with -// GTEST_HAS_POSIX_RE (see above) which users can -// define themselves. -// GTEST_USES_SIMPLE_RE - our own simple regex is used; -// the above two are mutually exclusive. -// GTEST_CAN_COMPARE_NULL - accepts untyped NULL in EXPECT_EQ(). -// -// Macros for basic C++ coding: -// GTEST_AMBIGUOUS_ELSE_BLOCKER_ - for disabling a gcc warning. -// GTEST_ATTRIBUTE_UNUSED_ - declares that a class' instances or a -// variable don't have to be used. -// GTEST_DISALLOW_ASSIGN_ - disables operator=. -// GTEST_DISALLOW_COPY_AND_ASSIGN_ - disables copy ctor and operator=. -// GTEST_MUST_USE_RESULT_ - declares that a function's result must be used. -// -// Synchronization: -// Mutex, MutexLock, ThreadLocal, GetThreadCount() -// - synchronization primitives. -// GTEST_IS_THREADSAFE - defined to 1 to indicate that the above -// synchronization primitives have real implementations -// and Google Test is thread-safe; or 0 otherwise. -// -// Template meta programming: -// is_pointer - as in TR1; needed on Symbian and IBM XL C/C++ only. -// IteratorTraits - partial implementation of std::iterator_traits, which -// is not available in libCstd when compiled with Sun C++. -// -// Smart pointers: -// scoped_ptr - as in TR2. -// -// Regular expressions: -// RE - a simple regular expression class using the POSIX -// Extended Regular Expression syntax on UNIX-like -// platforms, or a reduced regular exception syntax on -// other platforms, including Windows. -// -// Logging: -// GTEST_LOG_() - logs messages at the specified severity level. -// LogToStderr() - directs all log messages to stderr. -// FlushInfoLog() - flushes informational log messages. -// -// Stdout and stderr capturing: -// CaptureStdout() - starts capturing stdout. -// GetCapturedStdout() - stops capturing stdout and returns the captured -// string. -// CaptureStderr() - starts capturing stderr. -// GetCapturedStderr() - stops capturing stderr and returns the captured -// string. -// -// Integer types: -// TypeWithSize - maps an integer to a int type. -// Int32, UInt32, Int64, UInt64, TimeInMillis -// - integers of known sizes. -// BiggestInt - the biggest signed integer type. -// -// Command-line utilities: -// GTEST_FLAG() - references a flag. -// GTEST_DECLARE_*() - declares a flag. -// GTEST_DEFINE_*() - defines a flag. -// GetArgvs() - returns the command line as a vector of strings. -// -// Environment variable utilities: -// GetEnv() - gets the value of an environment variable. -// BoolFromGTestEnv() - parses a bool environment variable. -// Int32FromGTestEnv() - parses an Int32 environment variable. -// StringFromGTestEnv() - parses a string environment variable. - -#include // for isspace, etc -#include // for ptrdiff_t -#include -#include -#include -#ifndef _WIN32_WCE -# include -# include -#endif // !_WIN32_WCE - -#include // NOLINT -#include // NOLINT -#include // NOLINT - -#define GTEST_DEV_EMAIL_ "googletestframework@@googlegroups.com" -#define GTEST_FLAG_PREFIX_ "gtest_" -#define GTEST_FLAG_PREFIX_DASH_ "gtest-" -#define GTEST_FLAG_PREFIX_UPPER_ "GTEST_" -#define GTEST_NAME_ "Google Test" -#define GTEST_PROJECT_URL_ "http://code.google.com/p/googletest/" - -// Determines the version of gcc that is used to compile this. -#ifdef __GNUC__ -// 40302 means version 4.3.2. -# define GTEST_GCC_VER_ \ - (__GNUC__*10000 + __GNUC_MINOR__*100 + __GNUC_PATCHLEVEL__) -#endif // __GNUC__ - -// Determines the platform on which Google Test is compiled. -#ifdef __CYGWIN__ -# define GTEST_OS_CYGWIN 1 -#elif defined __SYMBIAN32__ -# define GTEST_OS_SYMBIAN 1 -#elif defined _WIN32 -# define GTEST_OS_WINDOWS 1 -# ifdef _WIN32_WCE -# define GTEST_OS_WINDOWS_MOBILE 1 -# elif defined(__MINGW__) || defined(__MINGW32__) -# define GTEST_OS_WINDOWS_MINGW 1 -# else -# define GTEST_OS_WINDOWS_DESKTOP 1 -# endif // _WIN32_WCE -#elif defined __APPLE__ -# define GTEST_OS_MAC 1 -#elif defined __linux__ -# define GTEST_OS_LINUX 1 -# ifdef ANDROID -# define GTEST_OS_LINUX_ANDROID 1 -# endif // ANDROID -#elif defined __MVS__ -# define GTEST_OS_ZOS 1 -#elif defined(__sun) && defined(__SVR4) -# define GTEST_OS_SOLARIS 1 -#elif defined(_AIX) -# define GTEST_OS_AIX 1 -#elif defined(__hpux) -# define GTEST_OS_HPUX 1 -#elif defined __native_client__ -# define GTEST_OS_NACL 1 -#endif // __CYGWIN__ - -// Brings in definitions for functions used in the testing::internal::posix -// namespace (read, write, close, chdir, isatty, stat). We do not currently -// use them on Windows Mobile. -#if !GTEST_OS_WINDOWS -// This assumes that non-Windows OSes provide unistd.h. For OSes where this -// is not the case, we need to include headers that provide the functions -// mentioned above. -# include -# if !GTEST_OS_NACL -// TODO(vladl@google.com): Remove this condition when Native Client SDK adds -// strings.h (tracked in -// http://code.google.com/p/nativeclient/issues/detail?id=1175). -# include // Native Client doesn't provide strings.h. -# endif -#elif !GTEST_OS_WINDOWS_MOBILE -# include -# include -#endif - -// Defines this to true iff Google Test can use POSIX regular expressions. -#ifndef GTEST_HAS_POSIX_RE -# define GTEST_HAS_POSIX_RE (!GTEST_OS_WINDOWS) -#endif - -#if GTEST_HAS_POSIX_RE - -// On some platforms, needs someone to define size_t, and -// won't compile otherwise. We can #include it here as we already -// included , which is guaranteed to define size_t through -// . -# include // NOLINT - -# define GTEST_USES_POSIX_RE 1 - -#elif GTEST_OS_WINDOWS - -// is not available on Windows. Use our own simple regex -// implementation instead. -# define GTEST_USES_SIMPLE_RE 1 - -#else - -// may not be available on this platform. Use our own -// simple regex implementation instead. -# define GTEST_USES_SIMPLE_RE 1 - -#endif // GTEST_HAS_POSIX_RE - -#ifndef GTEST_HAS_EXCEPTIONS -// The user didn't tell us whether exceptions are enabled, so we need -// to figure it out. -# if defined(_MSC_VER) || defined(__BORLANDC__) -// MSVC's and C++Builder's implementations of the STL use the _HAS_EXCEPTIONS -// macro to enable exceptions, so we'll do the same. -// Assumes that exceptions are enabled by default. -# ifndef _HAS_EXCEPTIONS -# define _HAS_EXCEPTIONS 1 -# endif // _HAS_EXCEPTIONS -# define GTEST_HAS_EXCEPTIONS _HAS_EXCEPTIONS -# elif defined(__GNUC__) && __EXCEPTIONS -// gcc defines __EXCEPTIONS to 1 iff exceptions are enabled. -# define GTEST_HAS_EXCEPTIONS 1 -# elif defined(__SUNPRO_CC) -// Sun Pro CC supports exceptions. However, there is no compile-time way of -// detecting whether they are enabled or not. Therefore, we assume that -// they are enabled unless the user tells us otherwise. -# define GTEST_HAS_EXCEPTIONS 1 -# elif defined(__IBMCPP__) && __EXCEPTIONS -// xlC defines __EXCEPTIONS to 1 iff exceptions are enabled. -# define GTEST_HAS_EXCEPTIONS 1 -# elif defined(__HP_aCC) -// Exception handling is in effect by default in HP aCC compiler. It has to -// be turned of by +noeh compiler option if desired. -# define GTEST_HAS_EXCEPTIONS 1 -# else -// For other compilers, we assume exceptions are disabled to be -// conservative. -# define GTEST_HAS_EXCEPTIONS 0 -# endif // defined(_MSC_VER) || defined(__BORLANDC__) -#endif // GTEST_HAS_EXCEPTIONS - -#if !defined(GTEST_HAS_STD_STRING) -// Even though we don't use this macro any longer, we keep it in case -// some clients still depend on it. -# define GTEST_HAS_STD_STRING 1 -#elif !GTEST_HAS_STD_STRING -// The user told us that ::std::string isn't available. -# error "Google Test cannot be used where ::std::string isn't available." -#endif // !defined(GTEST_HAS_STD_STRING) - -#ifndef GTEST_HAS_GLOBAL_STRING -// The user didn't tell us whether ::string is available, so we need -// to figure it out. - -# define GTEST_HAS_GLOBAL_STRING 0 - -#endif // GTEST_HAS_GLOBAL_STRING - -#ifndef GTEST_HAS_STD_WSTRING -// The user didn't tell us whether ::std::wstring is available, so we need -// to figure it out. -// TODO(wan@google.com): uses autoconf to detect whether ::std::wstring -// is available. - -// Cygwin 1.7 and below doesn't support ::std::wstring. -// Solaris' libc++ doesn't support it either. Android has -// no support for it at least as recent as Froyo (2.2). -# define GTEST_HAS_STD_WSTRING \ - (!(GTEST_OS_LINUX_ANDROID || GTEST_OS_CYGWIN || GTEST_OS_SOLARIS)) - -#endif // GTEST_HAS_STD_WSTRING - -#ifndef GTEST_HAS_GLOBAL_WSTRING -// The user didn't tell us whether ::wstring is available, so we need -// to figure it out. -# define GTEST_HAS_GLOBAL_WSTRING \ - (GTEST_HAS_STD_WSTRING && GTEST_HAS_GLOBAL_STRING) -#endif // GTEST_HAS_GLOBAL_WSTRING - -// Determines whether RTTI is available. -#ifndef GTEST_HAS_RTTI -// The user didn't tell us whether RTTI is enabled, so we need to -// figure it out. - -# ifdef _MSC_VER - -# ifdef _CPPRTTI // MSVC defines this macro iff RTTI is enabled. -# define GTEST_HAS_RTTI 1 -# else -# define GTEST_HAS_RTTI 0 -# endif - -// Starting with version 4.3.2, gcc defines __GXX_RTTI iff RTTI is enabled. -# elif defined(__GNUC__) && (GTEST_GCC_VER_ >= 40302) - -# ifdef __GXX_RTTI -# define GTEST_HAS_RTTI 1 -# else -# define GTEST_HAS_RTTI 0 -# endif // __GXX_RTTI - -// Starting with version 9.0 IBM Visual Age defines __RTTI_ALL__ to 1 if -// both the typeid and dynamic_cast features are present. -# elif defined(__IBMCPP__) && (__IBMCPP__ >= 900) - -# ifdef __RTTI_ALL__ -# define GTEST_HAS_RTTI 1 -# else -# define GTEST_HAS_RTTI 0 -# endif - -# else - -// For all other compilers, we assume RTTI is enabled. -# define GTEST_HAS_RTTI 1 - -# endif // _MSC_VER - -#endif // GTEST_HAS_RTTI - -// It's this header's responsibility to #include when RTTI -// is enabled. -#if GTEST_HAS_RTTI -# include -#endif - -// Determines whether Google Test can use the pthreads library. -#ifndef GTEST_HAS_PTHREAD -// The user didn't tell us explicitly, so we assume pthreads support is -// available on Linux and Mac. -// -// To disable threading support in Google Test, add -DGTEST_HAS_PTHREAD=0 -// to your compiler flags. -# define GTEST_HAS_PTHREAD (GTEST_OS_LINUX || GTEST_OS_MAC || GTEST_OS_HPUX) -#endif // GTEST_HAS_PTHREAD - -#if GTEST_HAS_PTHREAD -// gtest-port.h guarantees to #include when GTEST_HAS_PTHREAD is -// true. -# include // NOLINT - -// For timespec and nanosleep, used below. -# include // NOLINT -#endif - -// Determines whether Google Test can use tr1/tuple. You can define -// this macro to 0 to prevent Google Test from using tuple (any -// feature depending on tuple with be disabled in this mode). -#ifndef GTEST_HAS_TR1_TUPLE -// The user didn't tell us not to do it, so we assume it's OK. -# define GTEST_HAS_TR1_TUPLE 1 -#endif // GTEST_HAS_TR1_TUPLE - -// Determines whether Google Test's own tr1 tuple implementation -// should be used. -#ifndef GTEST_USE_OWN_TR1_TUPLE -// The user didn't tell us, so we need to figure it out. - -// We use our own TR1 tuple if we aren't sure the user has an -// implementation of it already. At this time, GCC 4.0.0+ and MSVC -// 2010 are the only mainstream compilers that come with a TR1 tuple -// implementation. NVIDIA's CUDA NVCC compiler pretends to be GCC by -// defining __GNUC__ and friends, but cannot compile GCC's tuple -// implementation. MSVC 2008 (9.0) provides TR1 tuple in a 323 MB -// Feature Pack download, which we cannot assume the user has. -# if (defined(__GNUC__) && !defined(__CUDACC__) && (GTEST_GCC_VER_ >= 40000)) \ - || _MSC_VER >= 1600 -# define GTEST_USE_OWN_TR1_TUPLE 0 -# else -# define GTEST_USE_OWN_TR1_TUPLE 1 -# endif - -#endif // GTEST_USE_OWN_TR1_TUPLE - -// To avoid conditional compilation everywhere, we make it -// gtest-port.h's responsibility to #include the header implementing -// tr1/tuple. -#if GTEST_HAS_TR1_TUPLE - -# if GTEST_USE_OWN_TR1_TUPLE -// This file was GENERATED by a script. DO NOT EDIT BY HAND!!! - -// Copyright 2009 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. -// -// Author: wan@google.com (Zhanyong Wan) - -// Implements a subset of TR1 tuple needed by Google Test and Google Mock. - -#ifndef GTEST_INCLUDE_GTEST_INTERNAL_GTEST_TUPLE_H_ -#define GTEST_INCLUDE_GTEST_INTERNAL_GTEST_TUPLE_H_ - -#include // For ::std::pair. - -// The compiler used in Symbian has a bug that prevents us from declaring the -// tuple template as a friend (it complains that tuple is redefined). This -// hack bypasses the bug by declaring the members that should otherwise be -// private as public. -// Sun Studio versions < 12 also have the above bug. -#if defined(__SYMBIAN32__) || (defined(__SUNPRO_CC) && __SUNPRO_CC < 0x590) -# define GTEST_DECLARE_TUPLE_AS_FRIEND_ public: -#else -# define GTEST_DECLARE_TUPLE_AS_FRIEND_ \ - template friend class tuple; \ - private: -#endif - -// GTEST_n_TUPLE_(T) is the type of an n-tuple. -#define GTEST_0_TUPLE_(T) tuple<> -#define GTEST_1_TUPLE_(T) tuple -#define GTEST_2_TUPLE_(T) tuple -#define GTEST_3_TUPLE_(T) tuple -#define GTEST_4_TUPLE_(T) tuple -#define GTEST_5_TUPLE_(T) tuple -#define GTEST_6_TUPLE_(T) tuple -#define GTEST_7_TUPLE_(T) tuple -#define GTEST_8_TUPLE_(T) tuple -#define GTEST_9_TUPLE_(T) tuple -#define GTEST_10_TUPLE_(T) tuple - -// GTEST_n_TYPENAMES_(T) declares a list of n typenames. -#define GTEST_0_TYPENAMES_(T) -#define GTEST_1_TYPENAMES_(T) typename T##0 -#define GTEST_2_TYPENAMES_(T) typename T##0, typename T##1 -#define GTEST_3_TYPENAMES_(T) typename T##0, typename T##1, typename T##2 -#define GTEST_4_TYPENAMES_(T) typename T##0, typename T##1, typename T##2, \ - typename T##3 -#define GTEST_5_TYPENAMES_(T) typename T##0, typename T##1, typename T##2, \ - typename T##3, typename T##4 -#define GTEST_6_TYPENAMES_(T) typename T##0, typename T##1, typename T##2, \ - typename T##3, typename T##4, typename T##5 -#define GTEST_7_TYPENAMES_(T) typename T##0, typename T##1, typename T##2, \ - typename T##3, typename T##4, typename T##5, typename T##6 -#define GTEST_8_TYPENAMES_(T) typename T##0, typename T##1, typename T##2, \ - typename T##3, typename T##4, typename T##5, typename T##6, typename T##7 -#define GTEST_9_TYPENAMES_(T) typename T##0, typename T##1, typename T##2, \ - typename T##3, typename T##4, typename T##5, typename T##6, \ - typename T##7, typename T##8 -#define GTEST_10_TYPENAMES_(T) typename T##0, typename T##1, typename T##2, \ - typename T##3, typename T##4, typename T##5, typename T##6, \ - typename T##7, typename T##8, typename T##9 - -// In theory, defining stuff in the ::std namespace is undefined -// behavior. We can do this as we are playing the role of a standard -// library vendor. -namespace std { -namespace tr1 { - -template -class tuple; - -// Anything in namespace gtest_internal is Google Test's INTERNAL -// IMPLEMENTATION DETAIL and MUST NOT BE USED DIRECTLY in user code. -namespace gtest_internal { - -// ByRef::type is T if T is a reference; otherwise it's const T&. -template -struct ByRef { typedef const T& type; }; // NOLINT -template -struct ByRef { typedef T& type; }; // NOLINT - -// A handy wrapper for ByRef. -#define GTEST_BY_REF_(T) typename ::std::tr1::gtest_internal::ByRef::type - -// AddRef::type is T if T is a reference; otherwise it's T&. This -// is the same as tr1::add_reference::type. -template -struct AddRef { typedef T& type; }; // NOLINT -template -struct AddRef { typedef T& type; }; // NOLINT - -// A handy wrapper for AddRef. -#define GTEST_ADD_REF_(T) typename ::std::tr1::gtest_internal::AddRef::type - -// A helper for implementing get(). -template class Get; - -// A helper for implementing tuple_element. kIndexValid is true -// iff k < the number of fields in tuple type T. -template -struct TupleElement; - -template -struct TupleElement { typedef T0 type; }; - -template -struct TupleElement { typedef T1 type; }; - -template -struct TupleElement { typedef T2 type; }; - -template -struct TupleElement { typedef T3 type; }; - -template -struct TupleElement { typedef T4 type; }; - -template -struct TupleElement { typedef T5 type; }; - -template -struct TupleElement { typedef T6 type; }; - -template -struct TupleElement { typedef T7 type; }; - -template -struct TupleElement { typedef T8 type; }; - -template -struct TupleElement { typedef T9 type; }; - -} // namespace gtest_internal - -template <> -class tuple<> { - public: - tuple() {} - tuple(const tuple& /* t */) {} - tuple& operator=(const tuple& /* t */) { return *this; } -}; - -template -class GTEST_1_TUPLE_(T) { - public: - template friend class gtest_internal::Get; - - tuple() : f0_() {} - - explicit tuple(GTEST_BY_REF_(T0) f0) : f0_(f0) {} - - tuple(const tuple& t) : f0_(t.f0_) {} - - template - tuple(const GTEST_1_TUPLE_(U)& t) : f0_(t.f0_) {} - - tuple& operator=(const tuple& t) { return CopyFrom(t); } - - template - tuple& operator=(const GTEST_1_TUPLE_(U)& t) { - return CopyFrom(t); - } - - GTEST_DECLARE_TUPLE_AS_FRIEND_ - - template - tuple& CopyFrom(const GTEST_1_TUPLE_(U)& t) { - f0_ = t.f0_; - return *this; - } - - T0 f0_; -}; - -template -class GTEST_2_TUPLE_(T) { - public: - template friend class gtest_internal::Get; - - tuple() : f0_(), f1_() {} - - explicit tuple(GTEST_BY_REF_(T0) f0, GTEST_BY_REF_(T1) f1) : f0_(f0), - f1_(f1) {} - - tuple(const tuple& t) : f0_(t.f0_), f1_(t.f1_) {} - - template - tuple(const GTEST_2_TUPLE_(U)& t) : f0_(t.f0_), f1_(t.f1_) {} - template - tuple(const ::std::pair& p) : f0_(p.first), f1_(p.second) {} - - tuple& operator=(const tuple& t) { return CopyFrom(t); } - - template - tuple& operator=(const GTEST_2_TUPLE_(U)& t) { - return CopyFrom(t); - } - template - tuple& operator=(const ::std::pair& p) { - f0_ = p.first; - f1_ = p.second; - return *this; - } - - GTEST_DECLARE_TUPLE_AS_FRIEND_ - - template - tuple& CopyFrom(const GTEST_2_TUPLE_(U)& t) { - f0_ = t.f0_; - f1_ = t.f1_; - return *this; - } - - T0 f0_; - T1 f1_; -}; - -template -class GTEST_3_TUPLE_(T) { - public: - template friend class gtest_internal::Get; - - tuple() : f0_(), f1_(), f2_() {} - - explicit tuple(GTEST_BY_REF_(T0) f0, GTEST_BY_REF_(T1) f1, - GTEST_BY_REF_(T2) f2) : f0_(f0), f1_(f1), f2_(f2) {} - - tuple(const tuple& t) : f0_(t.f0_), f1_(t.f1_), f2_(t.f2_) {} - - template - tuple(const GTEST_3_TUPLE_(U)& t) : f0_(t.f0_), f1_(t.f1_), f2_(t.f2_) {} - - tuple& operator=(const tuple& t) { return CopyFrom(t); } - - template - tuple& operator=(const GTEST_3_TUPLE_(U)& t) { - return CopyFrom(t); - } - - GTEST_DECLARE_TUPLE_AS_FRIEND_ - - template - tuple& CopyFrom(const GTEST_3_TUPLE_(U)& t) { - f0_ = t.f0_; - f1_ = t.f1_; - f2_ = t.f2_; - return *this; - } - - T0 f0_; - T1 f1_; - T2 f2_; -}; - -template -class GTEST_4_TUPLE_(T) { - public: - template friend class gtest_internal::Get; - - tuple() : f0_(), f1_(), f2_(), f3_() {} - - explicit tuple(GTEST_BY_REF_(T0) f0, GTEST_BY_REF_(T1) f1, - GTEST_BY_REF_(T2) f2, GTEST_BY_REF_(T3) f3) : f0_(f0), f1_(f1), f2_(f2), - f3_(f3) {} - - tuple(const tuple& t) : f0_(t.f0_), f1_(t.f1_), f2_(t.f2_), f3_(t.f3_) {} - - template - tuple(const GTEST_4_TUPLE_(U)& t) : f0_(t.f0_), f1_(t.f1_), f2_(t.f2_), - f3_(t.f3_) {} - - tuple& operator=(const tuple& t) { return CopyFrom(t); } - - template - tuple& operator=(const GTEST_4_TUPLE_(U)& t) { - return CopyFrom(t); - } - - GTEST_DECLARE_TUPLE_AS_FRIEND_ - - template - tuple& CopyFrom(const GTEST_4_TUPLE_(U)& t) { - f0_ = t.f0_; - f1_ = t.f1_; - f2_ = t.f2_; - f3_ = t.f3_; - return *this; - } - - T0 f0_; - T1 f1_; - T2 f2_; - T3 f3_; -}; - -template -class GTEST_5_TUPLE_(T) { - public: - template friend class gtest_internal::Get; - - tuple() : f0_(), f1_(), f2_(), f3_(), f4_() {} - - explicit tuple(GTEST_BY_REF_(T0) f0, GTEST_BY_REF_(T1) f1, - GTEST_BY_REF_(T2) f2, GTEST_BY_REF_(T3) f3, - GTEST_BY_REF_(T4) f4) : f0_(f0), f1_(f1), f2_(f2), f3_(f3), f4_(f4) {} - - tuple(const tuple& t) : f0_(t.f0_), f1_(t.f1_), f2_(t.f2_), f3_(t.f3_), - f4_(t.f4_) {} - - template - tuple(const GTEST_5_TUPLE_(U)& t) : f0_(t.f0_), f1_(t.f1_), f2_(t.f2_), - f3_(t.f3_), f4_(t.f4_) {} - - tuple& operator=(const tuple& t) { return CopyFrom(t); } - - template - tuple& operator=(const GTEST_5_TUPLE_(U)& t) { - return CopyFrom(t); - } - - GTEST_DECLARE_TUPLE_AS_FRIEND_ - - template - tuple& CopyFrom(const GTEST_5_TUPLE_(U)& t) { - f0_ = t.f0_; - f1_ = t.f1_; - f2_ = t.f2_; - f3_ = t.f3_; - f4_ = t.f4_; - return *this; - } - - T0 f0_; - T1 f1_; - T2 f2_; - T3 f3_; - T4 f4_; -}; - -template -class GTEST_6_TUPLE_(T) { - public: - template friend class gtest_internal::Get; - - tuple() : f0_(), f1_(), f2_(), f3_(), f4_(), f5_() {} - - explicit tuple(GTEST_BY_REF_(T0) f0, GTEST_BY_REF_(T1) f1, - GTEST_BY_REF_(T2) f2, GTEST_BY_REF_(T3) f3, GTEST_BY_REF_(T4) f4, - GTEST_BY_REF_(T5) f5) : f0_(f0), f1_(f1), f2_(f2), f3_(f3), f4_(f4), - f5_(f5) {} - - tuple(const tuple& t) : f0_(t.f0_), f1_(t.f1_), f2_(t.f2_), f3_(t.f3_), - f4_(t.f4_), f5_(t.f5_) {} - - template - tuple(const GTEST_6_TUPLE_(U)& t) : f0_(t.f0_), f1_(t.f1_), f2_(t.f2_), - f3_(t.f3_), f4_(t.f4_), f5_(t.f5_) {} - - tuple& operator=(const tuple& t) { return CopyFrom(t); } - - template - tuple& operator=(const GTEST_6_TUPLE_(U)& t) { - return CopyFrom(t); - } - - GTEST_DECLARE_TUPLE_AS_FRIEND_ - - template - tuple& CopyFrom(const GTEST_6_TUPLE_(U)& t) { - f0_ = t.f0_; - f1_ = t.f1_; - f2_ = t.f2_; - f3_ = t.f3_; - f4_ = t.f4_; - f5_ = t.f5_; - return *this; - } - - T0 f0_; - T1 f1_; - T2 f2_; - T3 f3_; - T4 f4_; - T5 f5_; -}; - -template -class GTEST_7_TUPLE_(T) { - public: - template friend class gtest_internal::Get; - - tuple() : f0_(), f1_(), f2_(), f3_(), f4_(), f5_(), f6_() {} - - explicit tuple(GTEST_BY_REF_(T0) f0, GTEST_BY_REF_(T1) f1, - GTEST_BY_REF_(T2) f2, GTEST_BY_REF_(T3) f3, GTEST_BY_REF_(T4) f4, - GTEST_BY_REF_(T5) f5, GTEST_BY_REF_(T6) f6) : f0_(f0), f1_(f1), f2_(f2), - f3_(f3), f4_(f4), f5_(f5), f6_(f6) {} - - tuple(const tuple& t) : f0_(t.f0_), f1_(t.f1_), f2_(t.f2_), f3_(t.f3_), - f4_(t.f4_), f5_(t.f5_), f6_(t.f6_) {} - - template - tuple(const GTEST_7_TUPLE_(U)& t) : f0_(t.f0_), f1_(t.f1_), f2_(t.f2_), - f3_(t.f3_), f4_(t.f4_), f5_(t.f5_), f6_(t.f6_) {} - - tuple& operator=(const tuple& t) { return CopyFrom(t); } - - template - tuple& operator=(const GTEST_7_TUPLE_(U)& t) { - return CopyFrom(t); - } - - GTEST_DECLARE_TUPLE_AS_FRIEND_ - - template - tuple& CopyFrom(const GTEST_7_TUPLE_(U)& t) { - f0_ = t.f0_; - f1_ = t.f1_; - f2_ = t.f2_; - f3_ = t.f3_; - f4_ = t.f4_; - f5_ = t.f5_; - f6_ = t.f6_; - return *this; - } - - T0 f0_; - T1 f1_; - T2 f2_; - T3 f3_; - T4 f4_; - T5 f5_; - T6 f6_; -}; - -template -class GTEST_8_TUPLE_(T) { - public: - template friend class gtest_internal::Get; - - tuple() : f0_(), f1_(), f2_(), f3_(), f4_(), f5_(), f6_(), f7_() {} - - explicit tuple(GTEST_BY_REF_(T0) f0, GTEST_BY_REF_(T1) f1, - GTEST_BY_REF_(T2) f2, GTEST_BY_REF_(T3) f3, GTEST_BY_REF_(T4) f4, - GTEST_BY_REF_(T5) f5, GTEST_BY_REF_(T6) f6, - GTEST_BY_REF_(T7) f7) : f0_(f0), f1_(f1), f2_(f2), f3_(f3), f4_(f4), - f5_(f5), f6_(f6), f7_(f7) {} - - tuple(const tuple& t) : f0_(t.f0_), f1_(t.f1_), f2_(t.f2_), f3_(t.f3_), - f4_(t.f4_), f5_(t.f5_), f6_(t.f6_), f7_(t.f7_) {} - - template - tuple(const GTEST_8_TUPLE_(U)& t) : f0_(t.f0_), f1_(t.f1_), f2_(t.f2_), - f3_(t.f3_), f4_(t.f4_), f5_(t.f5_), f6_(t.f6_), f7_(t.f7_) {} - - tuple& operator=(const tuple& t) { return CopyFrom(t); } - - template - tuple& operator=(const GTEST_8_TUPLE_(U)& t) { - return CopyFrom(t); - } - - GTEST_DECLARE_TUPLE_AS_FRIEND_ - - template - tuple& CopyFrom(const GTEST_8_TUPLE_(U)& t) { - f0_ = t.f0_; - f1_ = t.f1_; - f2_ = t.f2_; - f3_ = t.f3_; - f4_ = t.f4_; - f5_ = t.f5_; - f6_ = t.f6_; - f7_ = t.f7_; - return *this; - } - - T0 f0_; - T1 f1_; - T2 f2_; - T3 f3_; - T4 f4_; - T5 f5_; - T6 f6_; - T7 f7_; -}; - -template -class GTEST_9_TUPLE_(T) { - public: - template friend class gtest_internal::Get; - - tuple() : f0_(), f1_(), f2_(), f3_(), f4_(), f5_(), f6_(), f7_(), f8_() {} - - explicit tuple(GTEST_BY_REF_(T0) f0, GTEST_BY_REF_(T1) f1, - GTEST_BY_REF_(T2) f2, GTEST_BY_REF_(T3) f3, GTEST_BY_REF_(T4) f4, - GTEST_BY_REF_(T5) f5, GTEST_BY_REF_(T6) f6, GTEST_BY_REF_(T7) f7, - GTEST_BY_REF_(T8) f8) : f0_(f0), f1_(f1), f2_(f2), f3_(f3), f4_(f4), - f5_(f5), f6_(f6), f7_(f7), f8_(f8) {} - - tuple(const tuple& t) : f0_(t.f0_), f1_(t.f1_), f2_(t.f2_), f3_(t.f3_), - f4_(t.f4_), f5_(t.f5_), f6_(t.f6_), f7_(t.f7_), f8_(t.f8_) {} - - template - tuple(const GTEST_9_TUPLE_(U)& t) : f0_(t.f0_), f1_(t.f1_), f2_(t.f2_), - f3_(t.f3_), f4_(t.f4_), f5_(t.f5_), f6_(t.f6_), f7_(t.f7_), f8_(t.f8_) {} - - tuple& operator=(const tuple& t) { return CopyFrom(t); } - - template - tuple& operator=(const GTEST_9_TUPLE_(U)& t) { - return CopyFrom(t); - } - - GTEST_DECLARE_TUPLE_AS_FRIEND_ - - template - tuple& CopyFrom(const GTEST_9_TUPLE_(U)& t) { - f0_ = t.f0_; - f1_ = t.f1_; - f2_ = t.f2_; - f3_ = t.f3_; - f4_ = t.f4_; - f5_ = t.f5_; - f6_ = t.f6_; - f7_ = t.f7_; - f8_ = t.f8_; - return *this; - } - - T0 f0_; - T1 f1_; - T2 f2_; - T3 f3_; - T4 f4_; - T5 f5_; - T6 f6_; - T7 f7_; - T8 f8_; -}; - -template -class tuple { - public: - template friend class gtest_internal::Get; - - tuple() : f0_(), f1_(), f2_(), f3_(), f4_(), f5_(), f6_(), f7_(), f8_(), - f9_() {} - - explicit tuple(GTEST_BY_REF_(T0) f0, GTEST_BY_REF_(T1) f1, - GTEST_BY_REF_(T2) f2, GTEST_BY_REF_(T3) f3, GTEST_BY_REF_(T4) f4, - GTEST_BY_REF_(T5) f5, GTEST_BY_REF_(T6) f6, GTEST_BY_REF_(T7) f7, - GTEST_BY_REF_(T8) f8, GTEST_BY_REF_(T9) f9) : f0_(f0), f1_(f1), f2_(f2), - f3_(f3), f4_(f4), f5_(f5), f6_(f6), f7_(f7), f8_(f8), f9_(f9) {} - - tuple(const tuple& t) : f0_(t.f0_), f1_(t.f1_), f2_(t.f2_), f3_(t.f3_), - f4_(t.f4_), f5_(t.f5_), f6_(t.f6_), f7_(t.f7_), f8_(t.f8_), f9_(t.f9_) {} - - template - tuple(const GTEST_10_TUPLE_(U)& t) : f0_(t.f0_), f1_(t.f1_), f2_(t.f2_), - f3_(t.f3_), f4_(t.f4_), f5_(t.f5_), f6_(t.f6_), f7_(t.f7_), f8_(t.f8_), - f9_(t.f9_) {} - - tuple& operator=(const tuple& t) { return CopyFrom(t); } - - template - tuple& operator=(const GTEST_10_TUPLE_(U)& t) { - return CopyFrom(t); - } - - GTEST_DECLARE_TUPLE_AS_FRIEND_ - - template - tuple& CopyFrom(const GTEST_10_TUPLE_(U)& t) { - f0_ = t.f0_; - f1_ = t.f1_; - f2_ = t.f2_; - f3_ = t.f3_; - f4_ = t.f4_; - f5_ = t.f5_; - f6_ = t.f6_; - f7_ = t.f7_; - f8_ = t.f8_; - f9_ = t.f9_; - return *this; - } - - T0 f0_; - T1 f1_; - T2 f2_; - T3 f3_; - T4 f4_; - T5 f5_; - T6 f6_; - T7 f7_; - T8 f8_; - T9 f9_; -}; - -// 6.1.3.2 Tuple creation functions. - -// Known limitations: we don't support passing an -// std::tr1::reference_wrapper to make_tuple(). And we don't -// implement tie(). - -inline tuple<> make_tuple() { return tuple<>(); } - -template -inline GTEST_1_TUPLE_(T) make_tuple(const T0& f0) { - return GTEST_1_TUPLE_(T)(f0); -} - -template -inline GTEST_2_TUPLE_(T) make_tuple(const T0& f0, const T1& f1) { - return GTEST_2_TUPLE_(T)(f0, f1); -} - -template -inline GTEST_3_TUPLE_(T) make_tuple(const T0& f0, const T1& f1, const T2& f2) { - return GTEST_3_TUPLE_(T)(f0, f1, f2); -} - -template -inline GTEST_4_TUPLE_(T) make_tuple(const T0& f0, const T1& f1, const T2& f2, - const T3& f3) { - return GTEST_4_TUPLE_(T)(f0, f1, f2, f3); -} - -template -inline GTEST_5_TUPLE_(T) make_tuple(const T0& f0, const T1& f1, const T2& f2, - const T3& f3, const T4& f4) { - return GTEST_5_TUPLE_(T)(f0, f1, f2, f3, f4); -} - -template -inline GTEST_6_TUPLE_(T) make_tuple(const T0& f0, const T1& f1, const T2& f2, - const T3& f3, const T4& f4, const T5& f5) { - return GTEST_6_TUPLE_(T)(f0, f1, f2, f3, f4, f5); -} - -template -inline GTEST_7_TUPLE_(T) make_tuple(const T0& f0, const T1& f1, const T2& f2, - const T3& f3, const T4& f4, const T5& f5, const T6& f6) { - return GTEST_7_TUPLE_(T)(f0, f1, f2, f3, f4, f5, f6); -} - -template -inline GTEST_8_TUPLE_(T) make_tuple(const T0& f0, const T1& f1, const T2& f2, - const T3& f3, const T4& f4, const T5& f5, const T6& f6, const T7& f7) { - return GTEST_8_TUPLE_(T)(f0, f1, f2, f3, f4, f5, f6, f7); -} - -template -inline GTEST_9_TUPLE_(T) make_tuple(const T0& f0, const T1& f1, const T2& f2, - const T3& f3, const T4& f4, const T5& f5, const T6& f6, const T7& f7, - const T8& f8) { - return GTEST_9_TUPLE_(T)(f0, f1, f2, f3, f4, f5, f6, f7, f8); -} - -template -inline GTEST_10_TUPLE_(T) make_tuple(const T0& f0, const T1& f1, const T2& f2, - const T3& f3, const T4& f4, const T5& f5, const T6& f6, const T7& f7, - const T8& f8, const T9& f9) { - return GTEST_10_TUPLE_(T)(f0, f1, f2, f3, f4, f5, f6, f7, f8, f9); -} - -// 6.1.3.3 Tuple helper classes. - -template struct tuple_size; - -template -struct tuple_size { static const int value = 0; }; - -template -struct tuple_size { static const int value = 1; }; - -template -struct tuple_size { static const int value = 2; }; - -template -struct tuple_size { static const int value = 3; }; - -template -struct tuple_size { static const int value = 4; }; - -template -struct tuple_size { static const int value = 5; }; - -template -struct tuple_size { static const int value = 6; }; - -template -struct tuple_size { static const int value = 7; }; - -template -struct tuple_size { static const int value = 8; }; - -template -struct tuple_size { static const int value = 9; }; - -template -struct tuple_size { static const int value = 10; }; - -template -struct tuple_element { - typedef typename gtest_internal::TupleElement< - k < (tuple_size::value), k, Tuple>::type type; -}; - -#define GTEST_TUPLE_ELEMENT_(k, Tuple) typename tuple_element::type - -// 6.1.3.4 Element access. - -namespace gtest_internal { - -template <> -class Get<0> { - public: - template - static GTEST_ADD_REF_(GTEST_TUPLE_ELEMENT_(0, Tuple)) - Field(Tuple& t) { return t.f0_; } // NOLINT - - template - static GTEST_BY_REF_(GTEST_TUPLE_ELEMENT_(0, Tuple)) - ConstField(const Tuple& t) { return t.f0_; } -}; - -template <> -class Get<1> { - public: - template - static GTEST_ADD_REF_(GTEST_TUPLE_ELEMENT_(1, Tuple)) - Field(Tuple& t) { return t.f1_; } // NOLINT - - template - static GTEST_BY_REF_(GTEST_TUPLE_ELEMENT_(1, Tuple)) - ConstField(const Tuple& t) { return t.f1_; } -}; - -template <> -class Get<2> { - public: - template - static GTEST_ADD_REF_(GTEST_TUPLE_ELEMENT_(2, Tuple)) - Field(Tuple& t) { return t.f2_; } // NOLINT - - template - static GTEST_BY_REF_(GTEST_TUPLE_ELEMENT_(2, Tuple)) - ConstField(const Tuple& t) { return t.f2_; } -}; - -template <> -class Get<3> { - public: - template - static GTEST_ADD_REF_(GTEST_TUPLE_ELEMENT_(3, Tuple)) - Field(Tuple& t) { return t.f3_; } // NOLINT - - template - static GTEST_BY_REF_(GTEST_TUPLE_ELEMENT_(3, Tuple)) - ConstField(const Tuple& t) { return t.f3_; } -}; - -template <> -class Get<4> { - public: - template - static GTEST_ADD_REF_(GTEST_TUPLE_ELEMENT_(4, Tuple)) - Field(Tuple& t) { return t.f4_; } // NOLINT - - template - static GTEST_BY_REF_(GTEST_TUPLE_ELEMENT_(4, Tuple)) - ConstField(const Tuple& t) { return t.f4_; } -}; - -template <> -class Get<5> { - public: - template - static GTEST_ADD_REF_(GTEST_TUPLE_ELEMENT_(5, Tuple)) - Field(Tuple& t) { return t.f5_; } // NOLINT - - template - static GTEST_BY_REF_(GTEST_TUPLE_ELEMENT_(5, Tuple)) - ConstField(const Tuple& t) { return t.f5_; } -}; - -template <> -class Get<6> { - public: - template - static GTEST_ADD_REF_(GTEST_TUPLE_ELEMENT_(6, Tuple)) - Field(Tuple& t) { return t.f6_; } // NOLINT - - template - static GTEST_BY_REF_(GTEST_TUPLE_ELEMENT_(6, Tuple)) - ConstField(const Tuple& t) { return t.f6_; } -}; - -template <> -class Get<7> { - public: - template - static GTEST_ADD_REF_(GTEST_TUPLE_ELEMENT_(7, Tuple)) - Field(Tuple& t) { return t.f7_; } // NOLINT - - template - static GTEST_BY_REF_(GTEST_TUPLE_ELEMENT_(7, Tuple)) - ConstField(const Tuple& t) { return t.f7_; } -}; - -template <> -class Get<8> { - public: - template - static GTEST_ADD_REF_(GTEST_TUPLE_ELEMENT_(8, Tuple)) - Field(Tuple& t) { return t.f8_; } // NOLINT - - template - static GTEST_BY_REF_(GTEST_TUPLE_ELEMENT_(8, Tuple)) - ConstField(const Tuple& t) { return t.f8_; } -}; - -template <> -class Get<9> { - public: - template - static GTEST_ADD_REF_(GTEST_TUPLE_ELEMENT_(9, Tuple)) - Field(Tuple& t) { return t.f9_; } // NOLINT - - template - static GTEST_BY_REF_(GTEST_TUPLE_ELEMENT_(9, Tuple)) - ConstField(const Tuple& t) { return t.f9_; } -}; - -} // namespace gtest_internal - -template -GTEST_ADD_REF_(GTEST_TUPLE_ELEMENT_(k, GTEST_10_TUPLE_(T))) -get(GTEST_10_TUPLE_(T)& t) { - return gtest_internal::Get::Field(t); -} - -template -GTEST_BY_REF_(GTEST_TUPLE_ELEMENT_(k, GTEST_10_TUPLE_(T))) -get(const GTEST_10_TUPLE_(T)& t) { - return gtest_internal::Get::ConstField(t); -} - -// 6.1.3.5 Relational operators - -// We only implement == and !=, as we don't have a need for the rest yet. - -namespace gtest_internal { - -// SameSizeTuplePrefixComparator::Eq(t1, t2) returns true if the -// first k fields of t1 equals the first k fields of t2. -// SameSizeTuplePrefixComparator(k1, k2) would be a compiler error if -// k1 != k2. -template -struct SameSizeTuplePrefixComparator; - -template <> -struct SameSizeTuplePrefixComparator<0, 0> { - template - static bool Eq(const Tuple1& /* t1 */, const Tuple2& /* t2 */) { - return true; - } -}; - -template -struct SameSizeTuplePrefixComparator { - template - static bool Eq(const Tuple1& t1, const Tuple2& t2) { - return SameSizeTuplePrefixComparator::Eq(t1, t2) && - ::std::tr1::get(t1) == ::std::tr1::get(t2); - } -}; - -} // namespace gtest_internal - -template -inline bool operator==(const GTEST_10_TUPLE_(T)& t, - const GTEST_10_TUPLE_(U)& u) { - return gtest_internal::SameSizeTuplePrefixComparator< - tuple_size::value, - tuple_size::value>::Eq(t, u); -} - -template -inline bool operator!=(const GTEST_10_TUPLE_(T)& t, - const GTEST_10_TUPLE_(U)& u) { return !(t == u); } - -// 6.1.4 Pairs. -// Unimplemented. - -} // namespace tr1 -} // namespace std - -#undef GTEST_0_TUPLE_ -#undef GTEST_1_TUPLE_ -#undef GTEST_2_TUPLE_ -#undef GTEST_3_TUPLE_ -#undef GTEST_4_TUPLE_ -#undef GTEST_5_TUPLE_ -#undef GTEST_6_TUPLE_ -#undef GTEST_7_TUPLE_ -#undef GTEST_8_TUPLE_ -#undef GTEST_9_TUPLE_ -#undef GTEST_10_TUPLE_ - -#undef GTEST_0_TYPENAMES_ -#undef GTEST_1_TYPENAMES_ -#undef GTEST_2_TYPENAMES_ -#undef GTEST_3_TYPENAMES_ -#undef GTEST_4_TYPENAMES_ -#undef GTEST_5_TYPENAMES_ -#undef GTEST_6_TYPENAMES_ -#undef GTEST_7_TYPENAMES_ -#undef GTEST_8_TYPENAMES_ -#undef GTEST_9_TYPENAMES_ -#undef GTEST_10_TYPENAMES_ - -#undef GTEST_DECLARE_TUPLE_AS_FRIEND_ -#undef GTEST_BY_REF_ -#undef GTEST_ADD_REF_ -#undef GTEST_TUPLE_ELEMENT_ - -#endif // GTEST_INCLUDE_GTEST_INTERNAL_GTEST_TUPLE_H_ -# elif GTEST_OS_SYMBIAN - -// On Symbian, BOOST_HAS_TR1_TUPLE causes Boost's TR1 tuple library to -// use STLport's tuple implementation, which unfortunately doesn't -// work as the copy of STLport distributed with Symbian is incomplete. -// By making sure BOOST_HAS_TR1_TUPLE is undefined, we force Boost to -// use its own tuple implementation. -# ifdef BOOST_HAS_TR1_TUPLE -# undef BOOST_HAS_TR1_TUPLE -# endif // BOOST_HAS_TR1_TUPLE - -// This prevents , which defines -// BOOST_HAS_TR1_TUPLE, from being #included by Boost's . -# define BOOST_TR1_DETAIL_CONFIG_HPP_INCLUDED -# include - -# elif defined(__GNUC__) && (GTEST_GCC_VER_ >= 40000) -// GCC 4.0+ implements tr1/tuple in the header. This does -// not conform to the TR1 spec, which requires the header to be . - -# if !GTEST_HAS_RTTI && GTEST_GCC_VER_ < 40302 -// Until version 4.3.2, gcc has a bug that causes , -// which is #included by , to not compile when RTTI is -// disabled. _TR1_FUNCTIONAL is the header guard for -// . Hence the following #define is a hack to prevent -// from being included. -# define _TR1_FUNCTIONAL 1 -# include -# undef _TR1_FUNCTIONAL // Allows the user to #include - // if he chooses to. -# else -# include // NOLINT -# endif // !GTEST_HAS_RTTI && GTEST_GCC_VER_ < 40302 - -# else -// If the compiler is not GCC 4.0+, we assume the user is using a -// spec-conforming TR1 implementation. -# include // NOLINT -# endif // GTEST_USE_OWN_TR1_TUPLE - -#endif // GTEST_HAS_TR1_TUPLE - -// Determines whether clone(2) is supported. -// Usually it will only be available on Linux, excluding -// Linux on the Itanium architecture. -// Also see http://linux.die.net/man/2/clone. -#ifndef GTEST_HAS_CLONE -// The user didn't tell us, so we need to figure it out. - -# if GTEST_OS_LINUX && !defined(__ia64__) -# define GTEST_HAS_CLONE 1 -# else -# define GTEST_HAS_CLONE 0 -# endif // GTEST_OS_LINUX && !defined(__ia64__) - -#endif // GTEST_HAS_CLONE - -// Determines whether to support stream redirection. This is used to test -// output correctness and to implement death tests. -#ifndef GTEST_HAS_STREAM_REDIRECTION -// By default, we assume that stream redirection is supported on all -// platforms except known mobile ones. -# if GTEST_OS_WINDOWS_MOBILE || GTEST_OS_SYMBIAN -# define GTEST_HAS_STREAM_REDIRECTION 0 -# else -# define GTEST_HAS_STREAM_REDIRECTION 1 -# endif // !GTEST_OS_WINDOWS_MOBILE && !GTEST_OS_SYMBIAN -#endif // GTEST_HAS_STREAM_REDIRECTION - -// Determines whether to support death tests. -// Google Test does not support death tests for VC 7.1 and earlier as -// abort() in a VC 7.1 application compiled as GUI in debug config -// pops up a dialog window that cannot be suppressed programmatically. -#if (GTEST_OS_LINUX || GTEST_OS_MAC || GTEST_OS_CYGWIN || GTEST_OS_SOLARIS || \ - (GTEST_OS_WINDOWS_DESKTOP && _MSC_VER >= 1400) || \ - GTEST_OS_WINDOWS_MINGW || GTEST_OS_AIX || GTEST_OS_HPUX) -# define GTEST_HAS_DEATH_TEST 1 -# include // NOLINT -#endif - -// We don't support MSVC 7.1 with exceptions disabled now. Therefore -// all the compilers we care about are adequate for supporting -// value-parameterized tests. -#define GTEST_HAS_PARAM_TEST 1 - -// Determines whether to support type-driven tests. - -// Typed tests need and variadic macros, which GCC, VC++ 8.0, -// Sun Pro CC, IBM Visual Age, and HP aCC support. -#if defined(__GNUC__) || (_MSC_VER >= 1400) || defined(__SUNPRO_CC) || \ - defined(__IBMCPP__) || defined(__HP_aCC) -# define GTEST_HAS_TYPED_TEST 1 -# define GTEST_HAS_TYPED_TEST_P 1 -#endif - -// Determines whether to support Combine(). This only makes sense when -// value-parameterized tests are enabled. The implementation doesn't -// work on Sun Studio since it doesn't understand templated conversion -// operators. -#if GTEST_HAS_PARAM_TEST && GTEST_HAS_TR1_TUPLE && !defined(__SUNPRO_CC) -# define GTEST_HAS_COMBINE 1 -#endif - -// Determines whether the system compiler uses UTF-16 for encoding wide strings. -#define GTEST_WIDE_STRING_USES_UTF16_ \ - (GTEST_OS_WINDOWS || GTEST_OS_CYGWIN || GTEST_OS_SYMBIAN || GTEST_OS_AIX) - -// Determines whether test results can be streamed to a socket. -#if GTEST_OS_LINUX -# define GTEST_CAN_STREAM_RESULTS_ 1 -#endif - -// Defines some utility macros. - -// The GNU compiler emits a warning if nested "if" statements are followed by -// an "else" statement and braces are not used to explicitly disambiguate the -// "else" binding. This leads to problems with code like: -// -// if (gate) -// ASSERT_*(condition) << "Some message"; -// -// The "switch (0) case 0:" idiom is used to suppress this. -#ifdef __INTEL_COMPILER -# define GTEST_AMBIGUOUS_ELSE_BLOCKER_ -#else -# define GTEST_AMBIGUOUS_ELSE_BLOCKER_ switch (0) case 0: default: // NOLINT -#endif - -// Use this annotation at the end of a struct/class definition to -// prevent the compiler from optimizing away instances that are never -// used. This is useful when all interesting logic happens inside the -// c'tor and / or d'tor. Example: -// -// struct Foo { -// Foo() { ... } -// } GTEST_ATTRIBUTE_UNUSED_; -// -// Also use it after a variable or parameter declaration to tell the -// compiler the variable/parameter does not have to be used. -#if defined(__GNUC__) && !defined(COMPILER_ICC) -# define GTEST_ATTRIBUTE_UNUSED_ __attribute__ ((unused)) -#else -# define GTEST_ATTRIBUTE_UNUSED_ -#endif - -// A macro to disallow operator= -// This should be used in the private: declarations for a class. -#define GTEST_DISALLOW_ASSIGN_(type)\ - void operator=(type const &) - -// A macro to disallow copy constructor and operator= -// This should be used in the private: declarations for a class. -#define GTEST_DISALLOW_COPY_AND_ASSIGN_(type)\ - type(type const &);\ - GTEST_DISALLOW_ASSIGN_(type) - -// Tell the compiler to warn about unused return values for functions declared -// with this macro. The macro should be used on function declarations -// following the argument list: -// -// Sprocket* AllocateSprocket() GTEST_MUST_USE_RESULT_; -#if defined(__GNUC__) && (GTEST_GCC_VER_ >= 30400) && !defined(COMPILER_ICC) -# define GTEST_MUST_USE_RESULT_ __attribute__ ((warn_unused_result)) -#else -# define GTEST_MUST_USE_RESULT_ -#endif // __GNUC__ && (GTEST_GCC_VER_ >= 30400) && !COMPILER_ICC - -// Determine whether the compiler supports Microsoft's Structured Exception -// Handling. This is supported by several Windows compilers but generally -// does not exist on any other system. -#ifndef GTEST_HAS_SEH -// The user didn't tell us, so we need to figure it out. - -# if defined(_MSC_VER) || defined(__BORLANDC__) -// These two compilers are known to support SEH. -# define GTEST_HAS_SEH 1 -# else -// Assume no SEH. -# define GTEST_HAS_SEH 0 -# endif - -#endif // GTEST_HAS_SEH - -#ifdef _MSC_VER - -# if GTEST_LINKED_AS_SHARED_LIBRARY -# define GTEST_API_ __declspec(dllimport) -# elif GTEST_CREATE_SHARED_LIBRARY -# define GTEST_API_ __declspec(dllexport) -# endif - -#endif // _MSC_VER - -#ifndef GTEST_API_ -# define GTEST_API_ -#endif - -#ifdef __GNUC__ -// Ask the compiler to never inline a given function. -# define GTEST_NO_INLINE_ __attribute__((noinline)) -#else -# define GTEST_NO_INLINE_ -#endif - -namespace testing { - -class Message; - -namespace internal { - -class String; - -// The GTEST_COMPILE_ASSERT_ macro can be used to verify that a compile time -// expression is true. For example, you could use it to verify the -// size of a static array: -// -// GTEST_COMPILE_ASSERT_(ARRAYSIZE(content_type_names) == CONTENT_NUM_TYPES, -// content_type_names_incorrect_size); -// -// or to make sure a struct is smaller than a certain size: -// -// GTEST_COMPILE_ASSERT_(sizeof(foo) < 128, foo_too_large); -// -// The second argument to the macro is the name of the variable. If -// the expression is false, most compilers will issue a warning/error -// containing the name of the variable. - -template -struct CompileAssert { -}; - -#define GTEST_COMPILE_ASSERT_(expr, msg) \ - typedef ::testing::internal::CompileAssert<(bool(expr))> \ - msg[bool(expr) ? 1 : -1] - -// Implementation details of GTEST_COMPILE_ASSERT_: -// -// - GTEST_COMPILE_ASSERT_ works by defining an array type that has -1 -// elements (and thus is invalid) when the expression is false. -// -// - The simpler definition -// -// #define GTEST_COMPILE_ASSERT_(expr, msg) typedef char msg[(expr) ? 1 : -1] -// -// does not work, as gcc supports variable-length arrays whose sizes -// are determined at run-time (this is gcc's extension and not part -// of the C++ standard). As a result, gcc fails to reject the -// following code with the simple definition: -// -// int foo; -// GTEST_COMPILE_ASSERT_(foo, msg); // not supposed to compile as foo is -// // not a compile-time constant. -// -// - By using the type CompileAssert<(bool(expr))>, we ensures that -// expr is a compile-time constant. (Template arguments must be -// determined at compile-time.) -// -// - The outter parentheses in CompileAssert<(bool(expr))> are necessary -// to work around a bug in gcc 3.4.4 and 4.0.1. If we had written -// -// CompileAssert -// -// instead, these compilers will refuse to compile -// -// GTEST_COMPILE_ASSERT_(5 > 0, some_message); -// -// (They seem to think the ">" in "5 > 0" marks the end of the -// template argument list.) -// -// - The array size is (bool(expr) ? 1 : -1), instead of simply -// -// ((expr) ? 1 : -1). -// -// This is to avoid running into a bug in MS VC 7.1, which -// causes ((0.0) ? 1 : -1) to incorrectly evaluate to 1. - -// StaticAssertTypeEqHelper is used by StaticAssertTypeEq defined in gtest.h. -// -// This template is declared, but intentionally undefined. -template -struct StaticAssertTypeEqHelper; - -template -struct StaticAssertTypeEqHelper {}; - -#if GTEST_HAS_GLOBAL_STRING -typedef ::string string; -#else -typedef ::std::string string; -#endif // GTEST_HAS_GLOBAL_STRING - -#if GTEST_HAS_GLOBAL_WSTRING -typedef ::wstring wstring; -#elif GTEST_HAS_STD_WSTRING -typedef ::std::wstring wstring; -#endif // GTEST_HAS_GLOBAL_WSTRING - -// A helper for suppressing warnings on constant condition. It just -// returns 'condition'. -GTEST_API_ bool IsTrue(bool condition); - -// Defines scoped_ptr. - -// This implementation of scoped_ptr is PARTIAL - it only contains -// enough stuff to satisfy Google Test's need. -template -class scoped_ptr { - public: - typedef T element_type; - - explicit scoped_ptr(T* p = NULL) : ptr_(p) {} - ~scoped_ptr() { reset(); } - - T& operator*() const { return *ptr_; } - T* operator->() const { return ptr_; } - T* get() const { return ptr_; } - - T* release() { - T* const ptr = ptr_; - ptr_ = NULL; - return ptr; - } - - void reset(T* p = NULL) { - if (p != ptr_) { - if (IsTrue(sizeof(T) > 0)) { // Makes sure T is a complete type. - delete ptr_; - } - ptr_ = p; - } - } - private: - T* ptr_; - - GTEST_DISALLOW_COPY_AND_ASSIGN_(scoped_ptr); -}; - -// Defines RE. - -// A simple C++ wrapper for . It uses the POSIX Extended -// Regular Expression syntax. -class GTEST_API_ RE { - public: - // A copy constructor is required by the Standard to initialize object - // references from r-values. - RE(const RE& other) { Init(other.pattern()); } - - // Constructs an RE from a string. - RE(const ::std::string& regex) { Init(regex.c_str()); } // NOLINT - -#if GTEST_HAS_GLOBAL_STRING - - RE(const ::string& regex) { Init(regex.c_str()); } // NOLINT - -#endif // GTEST_HAS_GLOBAL_STRING - - RE(const char* regex) { Init(regex); } // NOLINT - ~RE(); - - // Returns the string representation of the regex. - const char* pattern() const { return pattern_; } - - // FullMatch(str, re) returns true iff regular expression re matches - // the entire str. - // PartialMatch(str, re) returns true iff regular expression re - // matches a substring of str (including str itself). - // - // TODO(wan@google.com): make FullMatch() and PartialMatch() work - // when str contains NUL characters. - static bool FullMatch(const ::std::string& str, const RE& re) { - return FullMatch(str.c_str(), re); - } - static bool PartialMatch(const ::std::string& str, const RE& re) { - return PartialMatch(str.c_str(), re); - } - -#if GTEST_HAS_GLOBAL_STRING - - static bool FullMatch(const ::string& str, const RE& re) { - return FullMatch(str.c_str(), re); - } - static bool PartialMatch(const ::string& str, const RE& re) { - return PartialMatch(str.c_str(), re); - } - -#endif // GTEST_HAS_GLOBAL_STRING - - static bool FullMatch(const char* str, const RE& re); - static bool PartialMatch(const char* str, const RE& re); - - private: - void Init(const char* regex); - - // We use a const char* instead of a string, as Google Test may be used - // where string is not available. We also do not use Google Test's own - // String type here, in order to simplify dependencies between the - // files. - const char* pattern_; - bool is_valid_; - -#if GTEST_USES_POSIX_RE - - regex_t full_regex_; // For FullMatch(). - regex_t partial_regex_; // For PartialMatch(). - -#else // GTEST_USES_SIMPLE_RE - - const char* full_pattern_; // For FullMatch(); - -#endif - - GTEST_DISALLOW_ASSIGN_(RE); -}; - -// Formats a source file path and a line number as they would appear -// in an error message from the compiler used to compile this code. -GTEST_API_ ::std::string FormatFileLocation(const char* file, int line); - -// Formats a file location for compiler-independent XML output. -// Although this function is not platform dependent, we put it next to -// FormatFileLocation in order to contrast the two functions. -GTEST_API_ ::std::string FormatCompilerIndependentFileLocation(const char* file, - int line); - -// Defines logging utilities: -// GTEST_LOG_(severity) - logs messages at the specified severity level. The -// message itself is streamed into the macro. -// LogToStderr() - directs all log messages to stderr. -// FlushInfoLog() - flushes informational log messages. - -enum GTestLogSeverity { - GTEST_INFO, - GTEST_WARNING, - GTEST_ERROR, - GTEST_FATAL -}; - -// Formats log entry severity, provides a stream object for streaming the -// log message, and terminates the message with a newline when going out of -// scope. -class GTEST_API_ GTestLog { - public: - GTestLog(GTestLogSeverity severity, const char* file, int line); - - // Flushes the buffers and, if severity is GTEST_FATAL, aborts the program. - ~GTestLog(); - - ::std::ostream& GetStream() { return ::std::cerr; } - - private: - const GTestLogSeverity severity_; - - GTEST_DISALLOW_COPY_AND_ASSIGN_(GTestLog); -}; - -#define GTEST_LOG_(severity) \ - ::testing::internal::GTestLog(::testing::internal::GTEST_##severity, \ - __FILE__, __LINE__).GetStream() - -inline void LogToStderr() {} -inline void FlushInfoLog() { fflush(NULL); } - -// INTERNAL IMPLEMENTATION - DO NOT USE. -// -// GTEST_CHECK_ is an all-mode assert. It aborts the program if the condition -// is not satisfied. -// Synopsys: -// GTEST_CHECK_(boolean_condition); -// or -// GTEST_CHECK_(boolean_condition) << "Additional message"; -// -// This checks the condition and if the condition is not satisfied -// it prints message about the condition violation, including the -// condition itself, plus additional message streamed into it, if any, -// and then it aborts the program. It aborts the program irrespective of -// whether it is built in the debug mode or not. -#define GTEST_CHECK_(condition) \ - GTEST_AMBIGUOUS_ELSE_BLOCKER_ \ - if (::testing::internal::IsTrue(condition)) \ - ; \ - else \ - GTEST_LOG_(FATAL) << "Condition " #condition " failed. " - -// An all-mode assert to verify that the given POSIX-style function -// call returns 0 (indicating success). Known limitation: this -// doesn't expand to a balanced 'if' statement, so enclose the macro -// in {} if you need to use it as the only statement in an 'if' -// branch. -#define GTEST_CHECK_POSIX_SUCCESS_(posix_call) \ - if (const int gtest_error = (posix_call)) \ - GTEST_LOG_(FATAL) << #posix_call << "failed with error " \ - << gtest_error - -// INTERNAL IMPLEMENTATION - DO NOT USE IN USER CODE. -// -// Use ImplicitCast_ as a safe version of static_cast for upcasting in -// the type hierarchy (e.g. casting a Foo* to a SuperclassOfFoo* or a -// const Foo*). When you use ImplicitCast_, the compiler checks that -// the cast is safe. Such explicit ImplicitCast_s are necessary in -// surprisingly many situations where C++ demands an exact type match -// instead of an argument type convertable to a target type. -// -// The syntax for using ImplicitCast_ is the same as for static_cast: -// -// ImplicitCast_(expr) -// -// ImplicitCast_ would have been part of the C++ standard library, -// but the proposal was submitted too late. It will probably make -// its way into the language in the future. -// -// This relatively ugly name is intentional. It prevents clashes with -// similar functions users may have (e.g., implicit_cast). The internal -// namespace alone is not enough because the function can be found by ADL. -template -inline To ImplicitCast_(To x) { return x; } - -// When you upcast (that is, cast a pointer from type Foo to type -// SuperclassOfFoo), it's fine to use ImplicitCast_<>, since upcasts -// always succeed. When you downcast (that is, cast a pointer from -// type Foo to type SubclassOfFoo), static_cast<> isn't safe, because -// how do you know the pointer is really of type SubclassOfFoo? It -// could be a bare Foo, or of type DifferentSubclassOfFoo. Thus, -// when you downcast, you should use this macro. In debug mode, we -// use dynamic_cast<> to double-check the downcast is legal (we die -// if it's not). In normal mode, we do the efficient static_cast<> -// instead. Thus, it's important to test in debug mode to make sure -// the cast is legal! -// This is the only place in the code we should use dynamic_cast<>. -// In particular, you SHOULDN'T be using dynamic_cast<> in order to -// do RTTI (eg code like this: -// if (dynamic_cast(foo)) HandleASubclass1Object(foo); -// if (dynamic_cast(foo)) HandleASubclass2Object(foo); -// You should design the code some other way not to need this. -// -// This relatively ugly name is intentional. It prevents clashes with -// similar functions users may have (e.g., down_cast). The internal -// namespace alone is not enough because the function can be found by ADL. -template // use like this: DownCast_(foo); -inline To DownCast_(From* f) { // so we only accept pointers - // Ensures that To is a sub-type of From *. This test is here only - // for compile-time type checking, and has no overhead in an - // optimized build at run-time, as it will be optimized away - // completely. - if (false) { - const To to = NULL; - ::testing::internal::ImplicitCast_(to); - } - -#if GTEST_HAS_RTTI - // RTTI: debug mode only! - GTEST_CHECK_(f == NULL || dynamic_cast(f) != NULL); -#endif - return static_cast(f); -} - -// Downcasts the pointer of type Base to Derived. -// Derived must be a subclass of Base. The parameter MUST -// point to a class of type Derived, not any subclass of it. -// When RTTI is available, the function performs a runtime -// check to enforce this. -template -Derived* CheckedDowncastToActualType(Base* base) { -#if GTEST_HAS_RTTI - GTEST_CHECK_(typeid(*base) == typeid(Derived)); - return dynamic_cast(base); // NOLINT -#else - return static_cast(base); // Poor man's downcast. -#endif -} - -#if GTEST_HAS_STREAM_REDIRECTION - -// Defines the stderr capturer: -// CaptureStdout - starts capturing stdout. -// GetCapturedStdout - stops capturing stdout and returns the captured string. -// CaptureStderr - starts capturing stderr. -// GetCapturedStderr - stops capturing stderr and returns the captured string. -// -GTEST_API_ void CaptureStdout(); -GTEST_API_ String GetCapturedStdout(); -GTEST_API_ void CaptureStderr(); -GTEST_API_ String GetCapturedStderr(); - -#endif // GTEST_HAS_STREAM_REDIRECTION - - -#if GTEST_HAS_DEATH_TEST - -// A copy of all command line arguments. Set by InitGoogleTest(). -extern ::std::vector g_argvs; - -// GTEST_HAS_DEATH_TEST implies we have ::std::string. -const ::std::vector& GetArgvs(); - -#endif // GTEST_HAS_DEATH_TEST - -// Defines synchronization primitives. - -#if GTEST_HAS_PTHREAD - -// Sleeps for (roughly) n milli-seconds. This function is only for -// testing Google Test's own constructs. Don't use it in user tests, -// either directly or indirectly. -inline void SleepMilliseconds(int n) { - const timespec time = { - 0, // 0 seconds. - n * 1000L * 1000L, // And n ms. - }; - nanosleep(&time, NULL); -} - -// Allows a controller thread to pause execution of newly created -// threads until notified. Instances of this class must be created -// and destroyed in the controller thread. -// -// This class is only for testing Google Test's own constructs. Do not -// use it in user tests, either directly or indirectly. -class Notification { - public: - Notification() : notified_(false) {} - - // Notifies all threads created with this notification to start. Must - // be called from the controller thread. - void Notify() { notified_ = true; } - - // Blocks until the controller thread notifies. Must be called from a test - // thread. - void WaitForNotification() { - while(!notified_) { - SleepMilliseconds(10); - } - } - - private: - volatile bool notified_; - - GTEST_DISALLOW_COPY_AND_ASSIGN_(Notification); -}; - -// As a C-function, ThreadFuncWithCLinkage cannot be templated itself. -// Consequently, it cannot select a correct instantiation of ThreadWithParam -// in order to call its Run(). Introducing ThreadWithParamBase as a -// non-templated base class for ThreadWithParam allows us to bypass this -// problem. -class ThreadWithParamBase { - public: - virtual ~ThreadWithParamBase() {} - virtual void Run() = 0; -}; - -// pthread_create() accepts a pointer to a function type with the C linkage. -// According to the Standard (7.5/1), function types with different linkages -// are different even if they are otherwise identical. Some compilers (for -// example, SunStudio) treat them as different types. Since class methods -// cannot be defined with C-linkage we need to define a free C-function to -// pass into pthread_create(). -extern "C" inline void* ThreadFuncWithCLinkage(void* thread) { - static_cast(thread)->Run(); - return NULL; -} - -// Helper class for testing Google Test's multi-threading constructs. -// To use it, write: -// -// void ThreadFunc(int param) { /* Do things with param */ } -// Notification thread_can_start; -// ... -// // The thread_can_start parameter is optional; you can supply NULL. -// ThreadWithParam thread(&ThreadFunc, 5, &thread_can_start); -// thread_can_start.Notify(); -// -// These classes are only for testing Google Test's own constructs. Do -// not use them in user tests, either directly or indirectly. -template -class ThreadWithParam : public ThreadWithParamBase { - public: - typedef void (*UserThreadFunc)(T); - - ThreadWithParam( - UserThreadFunc func, T param, Notification* thread_can_start) - : func_(func), - param_(param), - thread_can_start_(thread_can_start), - finished_(false) { - ThreadWithParamBase* const base = this; - // The thread can be created only after all fields except thread_ - // have been initialized. - GTEST_CHECK_POSIX_SUCCESS_( - pthread_create(&thread_, 0, &ThreadFuncWithCLinkage, base)); - } - ~ThreadWithParam() { Join(); } - - void Join() { - if (!finished_) { - GTEST_CHECK_POSIX_SUCCESS_(pthread_join(thread_, 0)); - finished_ = true; - } - } - - virtual void Run() { - if (thread_can_start_ != NULL) - thread_can_start_->WaitForNotification(); - func_(param_); - } - - private: - const UserThreadFunc func_; // User-supplied thread function. - const T param_; // User-supplied parameter to the thread function. - // When non-NULL, used to block execution until the controller thread - // notifies. - Notification* const thread_can_start_; - bool finished_; // true iff we know that the thread function has finished. - pthread_t thread_; // The native thread object. - - GTEST_DISALLOW_COPY_AND_ASSIGN_(ThreadWithParam); -}; - -// MutexBase and Mutex implement mutex on pthreads-based platforms. They -// are used in conjunction with class MutexLock: -// -// Mutex mutex; -// ... -// MutexLock lock(&mutex); // Acquires the mutex and releases it at the end -// // of the current scope. -// -// MutexBase implements behavior for both statically and dynamically -// allocated mutexes. Do not use MutexBase directly. Instead, write -// the following to define a static mutex: -// -// GTEST_DEFINE_STATIC_MUTEX_(g_some_mutex); -// -// You can forward declare a static mutex like this: -// -// GTEST_DECLARE_STATIC_MUTEX_(g_some_mutex); -// -// To create a dynamic mutex, just define an object of type Mutex. -class MutexBase { - public: - // Acquires this mutex. - void Lock() { - GTEST_CHECK_POSIX_SUCCESS_(pthread_mutex_lock(&mutex_)); - owner_ = pthread_self(); - } - - // Releases this mutex. - void Unlock() { - // We don't protect writing to owner_ here, as it's the caller's - // responsibility to ensure that the current thread holds the - // mutex when this is called. - owner_ = 0; - GTEST_CHECK_POSIX_SUCCESS_(pthread_mutex_unlock(&mutex_)); - } - - // Does nothing if the current thread holds the mutex. Otherwise, crashes - // with high probability. - void AssertHeld() const { - GTEST_CHECK_(owner_ == pthread_self()) - << "The current thread is not holding the mutex @" << this; - } - - // A static mutex may be used before main() is entered. It may even - // be used before the dynamic initialization stage. Therefore we - // must be able to initialize a static mutex object at link time. - // This means MutexBase has to be a POD and its member variables - // have to be public. - public: - pthread_mutex_t mutex_; // The underlying pthread mutex. - pthread_t owner_; // The thread holding the mutex; 0 means no one holds it. -}; - -// Forward-declares a static mutex. -# define GTEST_DECLARE_STATIC_MUTEX_(mutex) \ - extern ::testing::internal::MutexBase mutex - -// Defines and statically (i.e. at link time) initializes a static mutex. -# define GTEST_DEFINE_STATIC_MUTEX_(mutex) \ - ::testing::internal::MutexBase mutex = { PTHREAD_MUTEX_INITIALIZER, 0 } - -// The Mutex class can only be used for mutexes created at runtime. It -// shares its API with MutexBase otherwise. -class Mutex : public MutexBase { - public: - Mutex() { - GTEST_CHECK_POSIX_SUCCESS_(pthread_mutex_init(&mutex_, NULL)); - owner_ = 0; - } - ~Mutex() { - GTEST_CHECK_POSIX_SUCCESS_(pthread_mutex_destroy(&mutex_)); - } - - private: - GTEST_DISALLOW_COPY_AND_ASSIGN_(Mutex); -}; - -// We cannot name this class MutexLock as the ctor declaration would -// conflict with a macro named MutexLock, which is defined on some -// platforms. Hence the typedef trick below. -class GTestMutexLock { - public: - explicit GTestMutexLock(MutexBase* mutex) - : mutex_(mutex) { mutex_->Lock(); } - - ~GTestMutexLock() { mutex_->Unlock(); } - - private: - MutexBase* const mutex_; - - GTEST_DISALLOW_COPY_AND_ASSIGN_(GTestMutexLock); -}; - -typedef GTestMutexLock MutexLock; - -// Helpers for ThreadLocal. - -// pthread_key_create() requires DeleteThreadLocalValue() to have -// C-linkage. Therefore it cannot be templatized to access -// ThreadLocal. Hence the need for class -// ThreadLocalValueHolderBase. -class ThreadLocalValueHolderBase { - public: - virtual ~ThreadLocalValueHolderBase() {} -}; - -// Called by pthread to delete thread-local data stored by -// pthread_setspecific(). -extern "C" inline void DeleteThreadLocalValue(void* value_holder) { - delete static_cast(value_holder); -} - -// Implements thread-local storage on pthreads-based systems. -// -// // Thread 1 -// ThreadLocal tl(100); // 100 is the default value for each thread. -// -// // Thread 2 -// tl.set(150); // Changes the value for thread 2 only. -// EXPECT_EQ(150, tl.get()); -// -// // Thread 1 -// EXPECT_EQ(100, tl.get()); // In thread 1, tl has the original value. -// tl.set(200); -// EXPECT_EQ(200, tl.get()); -// -// The template type argument T must have a public copy constructor. -// In addition, the default ThreadLocal constructor requires T to have -// a public default constructor. -// -// An object managed for a thread by a ThreadLocal instance is deleted -// when the thread exits. Or, if the ThreadLocal instance dies in -// that thread, when the ThreadLocal dies. It's the user's -// responsibility to ensure that all other threads using a ThreadLocal -// have exited when it dies, or the per-thread objects for those -// threads will not be deleted. -// -// Google Test only uses global ThreadLocal objects. That means they -// will die after main() has returned. Therefore, no per-thread -// object managed by Google Test will be leaked as long as all threads -// using Google Test have exited when main() returns. -template -class ThreadLocal { - public: - ThreadLocal() : key_(CreateKey()), - default_() {} - explicit ThreadLocal(const T& value) : key_(CreateKey()), - default_(value) {} - - ~ThreadLocal() { - // Destroys the managed object for the current thread, if any. - DeleteThreadLocalValue(pthread_getspecific(key_)); - - // Releases resources associated with the key. This will *not* - // delete managed objects for other threads. - GTEST_CHECK_POSIX_SUCCESS_(pthread_key_delete(key_)); - } - - T* pointer() { return GetOrCreateValue(); } - const T* pointer() const { return GetOrCreateValue(); } - const T& get() const { return *pointer(); } - void set(const T& value) { *pointer() = value; } - - private: - // Holds a value of type T. - class ValueHolder : public ThreadLocalValueHolderBase { - public: - explicit ValueHolder(const T& value) : value_(value) {} - - T* pointer() { return &value_; } - - private: - T value_; - GTEST_DISALLOW_COPY_AND_ASSIGN_(ValueHolder); - }; - - static pthread_key_t CreateKey() { - pthread_key_t key; - // When a thread exits, DeleteThreadLocalValue() will be called on - // the object managed for that thread. - GTEST_CHECK_POSIX_SUCCESS_( - pthread_key_create(&key, &DeleteThreadLocalValue)); - return key; - } - - T* GetOrCreateValue() const { - ThreadLocalValueHolderBase* const holder = - static_cast(pthread_getspecific(key_)); - if (holder != NULL) { - return CheckedDowncastToActualType(holder)->pointer(); - } - - ValueHolder* const new_holder = new ValueHolder(default_); - ThreadLocalValueHolderBase* const holder_base = new_holder; - GTEST_CHECK_POSIX_SUCCESS_(pthread_setspecific(key_, holder_base)); - return new_holder->pointer(); - } - - // A key pthreads uses for looking up per-thread values. - const pthread_key_t key_; - const T default_; // The default value for each thread. - - GTEST_DISALLOW_COPY_AND_ASSIGN_(ThreadLocal); -}; - -# define GTEST_IS_THREADSAFE 1 - -#else // GTEST_HAS_PTHREAD - -// A dummy implementation of synchronization primitives (mutex, lock, -// and thread-local variable). Necessary for compiling Google Test where -// mutex is not supported - using Google Test in multiple threads is not -// supported on such platforms. - -class Mutex { - public: - Mutex() {} - void AssertHeld() const {} -}; - -# define GTEST_DECLARE_STATIC_MUTEX_(mutex) \ - extern ::testing::internal::Mutex mutex - -# define GTEST_DEFINE_STATIC_MUTEX_(mutex) ::testing::internal::Mutex mutex - -class GTestMutexLock { - public: - explicit GTestMutexLock(Mutex*) {} // NOLINT -}; - -typedef GTestMutexLock MutexLock; - -template -class ThreadLocal { - public: - ThreadLocal() : value_() {} - explicit ThreadLocal(const T& value) : value_(value) {} - T* pointer() { return &value_; } - const T* pointer() const { return &value_; } - const T& get() const { return value_; } - void set(const T& value) { value_ = value; } - private: - T value_; -}; - -// The above synchronization primitives have dummy implementations. -// Therefore Google Test is not thread-safe. -# define GTEST_IS_THREADSAFE 0 - -#endif // GTEST_HAS_PTHREAD - -// Returns the number of threads running in the process, or 0 to indicate that -// we cannot detect it. -GTEST_API_ size_t GetThreadCount(); - -// Passing non-POD classes through ellipsis (...) crashes the ARM -// compiler and generates a warning in Sun Studio. The Nokia Symbian -// and the IBM XL C/C++ compiler try to instantiate a copy constructor -// for objects passed through ellipsis (...), failing for uncopyable -// objects. We define this to ensure that only POD is passed through -// ellipsis on these systems. -#if defined(__SYMBIAN32__) || defined(__IBMCPP__) || defined(__SUNPRO_CC) -// We lose support for NULL detection where the compiler doesn't like -// passing non-POD classes through ellipsis (...). -# define GTEST_ELLIPSIS_NEEDS_POD_ 1 -#else -# define GTEST_CAN_COMPARE_NULL 1 -#endif - -// The Nokia Symbian and IBM XL C/C++ compilers cannot decide between -// const T& and const T* in a function template. These compilers -// _can_ decide between class template specializations for T and T*, -// so a tr1::type_traits-like is_pointer works. -#if defined(__SYMBIAN32__) || defined(__IBMCPP__) -# define GTEST_NEEDS_IS_POINTER_ 1 -#endif - -template -struct bool_constant { - typedef bool_constant type; - static const bool value = bool_value; -}; -template const bool bool_constant::value; - -typedef bool_constant false_type; -typedef bool_constant true_type; - -template -struct is_pointer : public false_type {}; - -template -struct is_pointer : public true_type {}; - -template -struct IteratorTraits { - typedef typename Iterator::value_type value_type; -}; - -template -struct IteratorTraits { - typedef T value_type; -}; - -template -struct IteratorTraits { - typedef T value_type; -}; - -#if GTEST_OS_WINDOWS -# define GTEST_PATH_SEP_ "\\" -# define GTEST_HAS_ALT_PATH_SEP_ 1 -// The biggest signed integer type the compiler supports. -typedef __int64 BiggestInt; -#else -# define GTEST_PATH_SEP_ "/" -# define GTEST_HAS_ALT_PATH_SEP_ 0 -typedef long long BiggestInt; // NOLINT -#endif // GTEST_OS_WINDOWS - -// Utilities for char. - -// isspace(int ch) and friends accept an unsigned char or EOF. char -// may be signed, depending on the compiler (or compiler flags). -// Therefore we need to cast a char to unsigned char before calling -// isspace(), etc. - -inline bool IsAlpha(char ch) { - return isalpha(static_cast(ch)) != 0; -} -inline bool IsAlNum(char ch) { - return isalnum(static_cast(ch)) != 0; -} -inline bool IsDigit(char ch) { - return isdigit(static_cast(ch)) != 0; -} -inline bool IsLower(char ch) { - return islower(static_cast(ch)) != 0; -} -inline bool IsSpace(char ch) { - return isspace(static_cast(ch)) != 0; -} -inline bool IsUpper(char ch) { - return isupper(static_cast(ch)) != 0; -} -inline bool IsXDigit(char ch) { - return isxdigit(static_cast(ch)) != 0; -} - -inline char ToLower(char ch) { - return static_cast(tolower(static_cast(ch))); -} -inline char ToUpper(char ch) { - return static_cast(toupper(static_cast(ch))); -} - -// The testing::internal::posix namespace holds wrappers for common -// POSIX functions. These wrappers hide the differences between -// Windows/MSVC and POSIX systems. Since some compilers define these -// standard functions as macros, the wrapper cannot have the same name -// as the wrapped function. - -namespace posix { - -// Functions with a different name on Windows. - -#if GTEST_OS_WINDOWS - -typedef struct _stat StatStruct; - -# ifdef __BORLANDC__ -inline int IsATTY(int fd) { return isatty(fd); } -inline int StrCaseCmp(const char* s1, const char* s2) { - return stricmp(s1, s2); -} -inline char* StrDup(const char* src) { return strdup(src); } -# else // !__BORLANDC__ -# if GTEST_OS_WINDOWS_MOBILE -inline int IsATTY(int /* fd */) { return 0; } -# else -inline int IsATTY(int fd) { return _isatty(fd); } -# endif // GTEST_OS_WINDOWS_MOBILE -inline int StrCaseCmp(const char* s1, const char* s2) { - return _stricmp(s1, s2); -} -inline char* StrDup(const char* src) { return _strdup(src); } -# endif // __BORLANDC__ - -# if GTEST_OS_WINDOWS_MOBILE -inline int FileNo(FILE* file) { return reinterpret_cast(_fileno(file)); } -// Stat(), RmDir(), and IsDir() are not needed on Windows CE at this -// time and thus not defined there. -# else -inline int FileNo(FILE* file) { return _fileno(file); } -inline int Stat(const char* path, StatStruct* buf) { return _stat(path, buf); } -inline int RmDir(const char* dir) { return _rmdir(dir); } -inline bool IsDir(const StatStruct& st) { - return (_S_IFDIR & st.st_mode) != 0; -} -# endif // GTEST_OS_WINDOWS_MOBILE - -#else - -typedef struct stat StatStruct; - -inline int FileNo(FILE* file) { return fileno(file); } -inline int IsATTY(int fd) { return isatty(fd); } -inline int Stat(const char* path, StatStruct* buf) { return stat(path, buf); } -inline int StrCaseCmp(const char* s1, const char* s2) { - return strcasecmp(s1, s2); -} -inline char* StrDup(const char* src) { return strdup(src); } -inline int RmDir(const char* dir) { return rmdir(dir); } -inline bool IsDir(const StatStruct& st) { return S_ISDIR(st.st_mode); } - -#endif // GTEST_OS_WINDOWS - -// Functions deprecated by MSVC 8.0. - -#ifdef _MSC_VER -// Temporarily disable warning 4996 (deprecated function). -# pragma warning(push) -# pragma warning(disable:4996) -#endif - -inline const char* StrNCpy(char* dest, const char* src, size_t n) { - return strncpy(dest, src, n); -} - -// ChDir(), FReopen(), FDOpen(), Read(), Write(), Close(), and -// StrError() aren't needed on Windows CE at this time and thus not -// defined there. - -#if !GTEST_OS_WINDOWS_MOBILE -inline int ChDir(const char* dir) { return chdir(dir); } -#endif -inline FILE* FOpen(const char* path, const char* mode) { - return fopen(path, mode); -} -#if !GTEST_OS_WINDOWS_MOBILE -inline FILE *FReopen(const char* path, const char* mode, FILE* stream) { - return freopen(path, mode, stream); -} -inline FILE* FDOpen(int fd, const char* mode) { return fdopen(fd, mode); } -#endif -inline int FClose(FILE* fp) { return fclose(fp); } -#if !GTEST_OS_WINDOWS_MOBILE -inline int Read(int fd, void* buf, unsigned int count) { - return static_cast(read(fd, buf, count)); -} -inline int Write(int fd, const void* buf, unsigned int count) { - return static_cast(write(fd, buf, count)); -} -inline int Close(int fd) { return close(fd); } -inline const char* StrError(int errnum) { return strerror(errnum); } -#endif -inline const char* GetEnv(const char* name) { -#if GTEST_OS_WINDOWS_MOBILE - // We are on Windows CE, which has no environment variables. - return NULL; -#elif defined(__BORLANDC__) || defined(__SunOS_5_8) || defined(__SunOS_5_9) - // Environment variables which we programmatically clear will be set to the - // empty string rather than unset (NULL). Handle that case. - const char* const env = getenv(name); - return (env != NULL && env[0] != '\0') ? env : NULL; -#else - return getenv(name); -#endif -} - -#ifdef _MSC_VER -# pragma warning(pop) // Restores the warning state. -#endif - -#if GTEST_OS_WINDOWS_MOBILE -// Windows CE has no C library. The abort() function is used in -// several places in Google Test. This implementation provides a reasonable -// imitation of standard behaviour. -void Abort(); -#else -inline void Abort() { abort(); } -#endif // GTEST_OS_WINDOWS_MOBILE - -} // namespace posix - -// The maximum number a BiggestInt can represent. This definition -// works no matter BiggestInt is represented in one's complement or -// two's complement. -// -// We cannot rely on numeric_limits in STL, as __int64 and long long -// are not part of standard C++ and numeric_limits doesn't need to be -// defined for them. -const BiggestInt kMaxBiggestInt = - ~(static_cast(1) << (8*sizeof(BiggestInt) - 1)); - -// This template class serves as a compile-time function from size to -// type. It maps a size in bytes to a primitive type with that -// size. e.g. -// -// TypeWithSize<4>::UInt -// -// is typedef-ed to be unsigned int (unsigned integer made up of 4 -// bytes). -// -// Such functionality should belong to STL, but I cannot find it -// there. -// -// Google Test uses this class in the implementation of floating-point -// comparison. -// -// For now it only handles UInt (unsigned int) as that's all Google Test -// needs. Other types can be easily added in the future if need -// arises. -template -class TypeWithSize { - public: - // This prevents the user from using TypeWithSize with incorrect - // values of N. - typedef void UInt; -}; - -// The specialization for size 4. -template <> -class TypeWithSize<4> { - public: - // unsigned int has size 4 in both gcc and MSVC. - // - // As base/basictypes.h doesn't compile on Windows, we cannot use - // uint32, uint64, and etc here. - typedef int Int; - typedef unsigned int UInt; -}; - -// The specialization for size 8. -template <> -class TypeWithSize<8> { - public: - -#if GTEST_OS_WINDOWS - typedef __int64 Int; - typedef unsigned __int64 UInt; -#else - typedef long long Int; // NOLINT - typedef unsigned long long UInt; // NOLINT -#endif // GTEST_OS_WINDOWS -}; - -// Integer types of known sizes. -typedef TypeWithSize<4>::Int Int32; -typedef TypeWithSize<4>::UInt UInt32; -typedef TypeWithSize<8>::Int Int64; -typedef TypeWithSize<8>::UInt UInt64; -typedef TypeWithSize<8>::Int TimeInMillis; // Represents time in milliseconds. - -// Utilities for command line flags and environment variables. - -// Macro for referencing flags. -#define GTEST_FLAG(name) FLAGS_gtest_##name - -// Macros for declaring flags. -#define GTEST_DECLARE_bool_(name) GTEST_API_ extern bool GTEST_FLAG(name) -#define GTEST_DECLARE_int32_(name) \ - GTEST_API_ extern ::testing::internal::Int32 GTEST_FLAG(name) -#define GTEST_DECLARE_string_(name) \ - GTEST_API_ extern ::testing::internal::String GTEST_FLAG(name) - -// Macros for defining flags. -#define GTEST_DEFINE_bool_(name, default_val, doc) \ - GTEST_API_ bool GTEST_FLAG(name) = (default_val) -#define GTEST_DEFINE_int32_(name, default_val, doc) \ - GTEST_API_ ::testing::internal::Int32 GTEST_FLAG(name) = (default_val) -#define GTEST_DEFINE_string_(name, default_val, doc) \ - GTEST_API_ ::testing::internal::String GTEST_FLAG(name) = (default_val) - -// Parses 'str' for a 32-bit signed integer. If successful, writes the result -// to *value and returns true; otherwise leaves *value unchanged and returns -// false. -// TODO(chandlerc): Find a better way to refactor flag and environment parsing -// out of both gtest-port.cc and gtest.cc to avoid exporting this utility -// function. -bool ParseInt32(const Message& src_text, const char* str, Int32* value); - -// Parses a bool/Int32/string from the environment variable -// corresponding to the given Google Test flag. -bool BoolFromGTestEnv(const char* flag, bool default_val); -GTEST_API_ Int32 Int32FromGTestEnv(const char* flag, Int32 default_val); -const char* StringFromGTestEnv(const char* flag, const char* default_val); - -} // namespace internal -} // namespace testing - -#endif // GTEST_INCLUDE_GTEST_INTERNAL_GTEST_PORT_H_ - -#if GTEST_OS_LINUX -# include -# include -# include -# include -#endif // GTEST_OS_LINUX - -#include -#include -#include -#include -#include - -// Copyright 2005, 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: wan@google.com (Zhanyong Wan), eefacm@gmail.com (Sean Mcafee) -// -// The Google C++ Testing Framework (Google Test) -// -// This header file declares the String class and functions used internally by -// Google Test. They are subject to change without notice. They should not used -// by code external to Google Test. -// -// This header file is #included by . -// It should not be #included by other files. - -#ifndef GTEST_INCLUDE_GTEST_INTERNAL_GTEST_STRING_H_ -#define GTEST_INCLUDE_GTEST_INTERNAL_GTEST_STRING_H_ - -#ifdef __BORLANDC__ -// string.h is not guaranteed to provide strcpy on C++ Builder. -# include -#endif - -#include - -#include - -namespace testing { -namespace internal { - -// String - a UTF-8 string class. -// -// For historic reasons, we don't use std::string. -// -// TODO(wan@google.com): replace this class with std::string or -// implement it in terms of the latter. -// -// Note that String can represent both NULL and the empty string, -// while std::string cannot represent NULL. -// -// NULL and the empty string are considered different. NULL is less -// than anything (including the empty string) except itself. -// -// This class only provides minimum functionality necessary for -// implementing Google Test. We do not intend to implement a full-fledged -// string class here. -// -// Since the purpose of this class is to provide a substitute for -// std::string on platforms where it cannot be used, we define a copy -// constructor and assignment operators such that we don't need -// conditional compilation in a lot of places. -// -// In order to make the representation efficient, the d'tor of String -// is not virtual. Therefore DO NOT INHERIT FROM String. -class GTEST_API_ String { - public: - // Static utility methods - - // Returns the input enclosed in double quotes if it's not NULL; - // otherwise returns "(null)". For example, "\"Hello\"" is returned - // for input "Hello". - // - // This is useful for printing a C string in the syntax of a literal. - // - // Known issue: escape sequences are not handled yet. - static String ShowCStringQuoted(const char* c_str); - - // Clones a 0-terminated C string, allocating memory using new. The - // caller is responsible for deleting the return value using - // delete[]. Returns the cloned string, or NULL if the input is - // NULL. - // - // This is different from strdup() in string.h, which allocates - // memory using malloc(). - static const char* CloneCString(const char* c_str); - -#if GTEST_OS_WINDOWS_MOBILE - // Windows CE does not have the 'ANSI' versions of Win32 APIs. To be - // able to pass strings to Win32 APIs on CE we need to convert them - // to 'Unicode', UTF-16. - - // Creates a UTF-16 wide string from the given ANSI string, allocating - // memory using new. The caller is responsible for deleting the return - // value using delete[]. Returns the wide string, or NULL if the - // input is NULL. - // - // The wide string is created using the ANSI codepage (CP_ACP) to - // match the behaviour of the ANSI versions of Win32 calls and the - // C runtime. - static LPCWSTR AnsiToUtf16(const char* c_str); - - // Creates an ANSI string from the given wide string, allocating - // memory using new. The caller is responsible for deleting the return - // value using delete[]. Returns the ANSI string, or NULL if the - // input is NULL. - // - // The returned string is created using the ANSI codepage (CP_ACP) to - // match the behaviour of the ANSI versions of Win32 calls and the - // C runtime. - static const char* Utf16ToAnsi(LPCWSTR utf16_str); -#endif - - // Compares two C strings. Returns true iff they have the same content. - // - // Unlike strcmp(), this function can handle NULL argument(s). A - // NULL C string is considered different to any non-NULL C string, - // including the empty string. - static bool CStringEquals(const char* lhs, const char* rhs); - - // Converts a wide C string to a String using the UTF-8 encoding. - // NULL will be converted to "(null)". If an error occurred during - // the conversion, "(failed to convert from wide string)" is - // returned. - static String ShowWideCString(const wchar_t* wide_c_str); - - // Similar to ShowWideCString(), except that this function encloses - // the converted string in double quotes. - static String ShowWideCStringQuoted(const wchar_t* wide_c_str); - - // Compares two wide C strings. Returns true iff they have the same - // content. - // - // Unlike wcscmp(), this function can handle NULL argument(s). A - // NULL C string is considered different to any non-NULL C string, - // including the empty string. - static bool WideCStringEquals(const wchar_t* lhs, const wchar_t* rhs); - - // Compares two C strings, ignoring case. Returns true iff they - // have the same content. - // - // Unlike strcasecmp(), this function can handle NULL argument(s). - // A NULL C string is considered different to any non-NULL C string, - // including the empty string. - static bool CaseInsensitiveCStringEquals(const char* lhs, - const char* rhs); - - // Compares two wide C strings, ignoring case. Returns true iff they - // have the same content. - // - // Unlike wcscasecmp(), this function can handle NULL argument(s). - // A NULL C string is considered different to any non-NULL wide C string, - // including the empty string. - // NB: The implementations on different platforms slightly differ. - // On windows, this method uses _wcsicmp which compares according to LC_CTYPE - // environment variable. On GNU platform this method uses wcscasecmp - // which compares according to LC_CTYPE category of the current locale. - // On MacOS X, it uses towlower, which also uses LC_CTYPE category of the - // current locale. - static bool CaseInsensitiveWideCStringEquals(const wchar_t* lhs, - const wchar_t* rhs); - - // Formats a list of arguments to a String, using the same format - // spec string as for printf. - // - // We do not use the StringPrintf class as it is not universally - // available. - // - // The result is limited to 4096 characters (including the tailing - // 0). If 4096 characters are not enough to format the input, - // "" is returned. - static String Format(const char* format, ...); - - // C'tors - - // The default c'tor constructs a NULL string. - String() : c_str_(NULL), length_(0) {} - - // Constructs a String by cloning a 0-terminated C string. - String(const char* a_c_str) { // NOLINT - if (a_c_str == NULL) { - c_str_ = NULL; - length_ = 0; - } else { - ConstructNonNull(a_c_str, strlen(a_c_str)); - } - } - - // Constructs a String by copying a given number of chars from a - // buffer. E.g. String("hello", 3) creates the string "hel", - // String("a\0bcd", 4) creates "a\0bc", String(NULL, 0) creates "", - // and String(NULL, 1) results in access violation. - String(const char* buffer, size_t a_length) { - ConstructNonNull(buffer, a_length); - } - - // The copy c'tor creates a new copy of the string. The two - // String objects do not share content. - String(const String& str) : c_str_(NULL), length_(0) { *this = str; } - - // D'tor. String is intended to be a final class, so the d'tor - // doesn't need to be virtual. - ~String() { delete[] c_str_; } - - // Allows a String to be implicitly converted to an ::std::string or - // ::string, and vice versa. Converting a String containing a NULL - // pointer to ::std::string or ::string is undefined behavior. - // Converting a ::std::string or ::string containing an embedded NUL - // character to a String will result in the prefix up to the first - // NUL character. - String(const ::std::string& str) { - ConstructNonNull(str.c_str(), str.length()); - } - - operator ::std::string() const { return ::std::string(c_str(), length()); } - -#if GTEST_HAS_GLOBAL_STRING - String(const ::string& str) { - ConstructNonNull(str.c_str(), str.length()); - } - - operator ::string() const { return ::string(c_str(), length()); } -#endif // GTEST_HAS_GLOBAL_STRING - - // Returns true iff this is an empty string (i.e. ""). - bool empty() const { return (c_str() != NULL) && (length() == 0); } - - // Compares this with another String. - // Returns < 0 if this is less than rhs, 0 if this is equal to rhs, or > 0 - // if this is greater than rhs. - int Compare(const String& rhs) const; - - // Returns true iff this String equals the given C string. A NULL - // string and a non-NULL string are considered not equal. - bool operator==(const char* a_c_str) const { return Compare(a_c_str) == 0; } - - // Returns true iff this String is less than the given String. A - // NULL string is considered less than "". - bool operator<(const String& rhs) const { return Compare(rhs) < 0; } - - // Returns true iff this String doesn't equal the given C string. A NULL - // string and a non-NULL string are considered not equal. - bool operator!=(const char* a_c_str) const { return !(*this == a_c_str); } - - // Returns true iff this String ends with the given suffix. *Any* - // String is considered to end with a NULL or empty suffix. - bool EndsWith(const char* suffix) const; - - // Returns true iff this String ends with the given suffix, not considering - // case. Any String is considered to end with a NULL or empty suffix. - bool EndsWithCaseInsensitive(const char* suffix) const; - - // Returns the length of the encapsulated string, or 0 if the - // string is NULL. - size_t length() const { return length_; } - - // Gets the 0-terminated C string this String object represents. - // The String object still owns the string. Therefore the caller - // should NOT delete the return value. - const char* c_str() const { return c_str_; } - - // Assigns a C string to this object. Self-assignment works. - const String& operator=(const char* a_c_str) { - return *this = String(a_c_str); - } - - // Assigns a String object to this object. Self-assignment works. - const String& operator=(const String& rhs) { - if (this != &rhs) { - delete[] c_str_; - if (rhs.c_str() == NULL) { - c_str_ = NULL; - length_ = 0; - } else { - ConstructNonNull(rhs.c_str(), rhs.length()); - } - } - - return *this; - } - - private: - // Constructs a non-NULL String from the given content. This - // function can only be called when c_str_ has not been allocated. - // ConstructNonNull(NULL, 0) results in an empty string (""). - // ConstructNonNull(NULL, non_zero) is undefined behavior. - void ConstructNonNull(const char* buffer, size_t a_length) { - char* const str = new char[a_length + 1]; - memcpy(str, buffer, a_length); - str[a_length] = '\0'; - c_str_ = str; - length_ = a_length; - } - - const char* c_str_; - size_t length_; -}; // class String - -// Streams a String to an ostream. Each '\0' character in the String -// is replaced with "\\0". -inline ::std::ostream& operator<<(::std::ostream& os, const String& str) { - if (str.c_str() == NULL) { - os << "(null)"; - } else { - const char* const c_str = str.c_str(); - for (size_t i = 0; i != str.length(); i++) { - if (c_str[i] == '\0') { - os << "\\0"; - } else { - os << c_str[i]; - } - } - } - return os; -} - -// Gets the content of the stringstream's buffer as a String. Each '\0' -// character in the buffer is replaced with "\\0". -GTEST_API_ String StringStreamToString(::std::stringstream* stream); - -// Converts a streamable value to a String. A NULL pointer is -// converted to "(null)". When the input value is a ::string, -// ::std::string, ::wstring, or ::std::wstring object, each NUL -// character in it is replaced with "\\0". - -// Declared here but defined in gtest.h, so that it has access -// to the definition of the Message class, required by the ARM -// compiler. -template -String StreamableToString(const T& streamable); - -} // namespace internal -} // namespace testing - -#endif // GTEST_INCLUDE_GTEST_INTERNAL_GTEST_STRING_H_ -// Copyright 2008, 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. -// -// Author: keith.ray@gmail.com (Keith Ray) -// -// Google Test filepath utilities -// -// This header file declares classes and functions used internally by -// Google Test. They are subject to change without notice. -// -// This file is #included in . -// Do not include this header file separately! - -#ifndef GTEST_INCLUDE_GTEST_INTERNAL_GTEST_FILEPATH_H_ -#define GTEST_INCLUDE_GTEST_INTERNAL_GTEST_FILEPATH_H_ - - -namespace testing { -namespace internal { - -// FilePath - a class for file and directory pathname manipulation which -// handles platform-specific conventions (like the pathname separator). -// Used for helper functions for naming files in a directory for xml output. -// Except for Set methods, all methods are const or static, which provides an -// "immutable value object" -- useful for peace of mind. -// A FilePath with a value ending in a path separator ("like/this/") represents -// a directory, otherwise it is assumed to represent a file. In either case, -// it may or may not represent an actual file or directory in the file system. -// Names are NOT checked for syntax correctness -- no checking for illegal -// characters, malformed paths, etc. - -class GTEST_API_ FilePath { - public: - FilePath() : pathname_("") { } - FilePath(const FilePath& rhs) : pathname_(rhs.pathname_) { } - - explicit FilePath(const char* pathname) : pathname_(pathname) { - Normalize(); - } - - explicit FilePath(const String& pathname) : pathname_(pathname) { - Normalize(); - } - - FilePath& operator=(const FilePath& rhs) { - Set(rhs); - return *this; - } - - void Set(const FilePath& rhs) { - pathname_ = rhs.pathname_; - } - - String ToString() const { return pathname_; } - const char* c_str() const { return pathname_.c_str(); } - - // Returns the current working directory, or "" if unsuccessful. - static FilePath GetCurrentDir(); - - // Given directory = "dir", base_name = "test", number = 0, - // extension = "xml", returns "dir/test.xml". If number is greater - // than zero (e.g., 12), returns "dir/test_12.xml". - // On Windows platform, uses \ as the separator rather than /. - static FilePath MakeFileName(const FilePath& directory, - const FilePath& base_name, - int number, - const char* extension); - - // Given directory = "dir", relative_path = "test.xml", - // returns "dir/test.xml". - // On Windows, uses \ as the separator rather than /. - static FilePath ConcatPaths(const FilePath& directory, - const FilePath& relative_path); - - // Returns a pathname for a file that does not currently exist. The pathname - // will be directory/base_name.extension or - // directory/base_name_.extension if directory/base_name.extension - // already exists. The number will be incremented until a pathname is found - // that does not already exist. - // Examples: 'dir/foo_test.xml' or 'dir/foo_test_1.xml'. - // There could be a race condition if two or more processes are calling this - // function at the same time -- they could both pick the same filename. - static FilePath GenerateUniqueFileName(const FilePath& directory, - const FilePath& base_name, - const char* extension); - - // Returns true iff the path is NULL or "". - bool IsEmpty() const { return c_str() == NULL || *c_str() == '\0'; } - - // If input name has a trailing separator character, removes it and returns - // the name, otherwise return the name string unmodified. - // On Windows platform, uses \ as the separator, other platforms use /. - FilePath RemoveTrailingPathSeparator() const; - - // Returns a copy of the FilePath with the directory part removed. - // Example: FilePath("path/to/file").RemoveDirectoryName() returns - // FilePath("file"). If there is no directory part ("just_a_file"), it returns - // the FilePath unmodified. If there is no file part ("just_a_dir/") it - // returns an empty FilePath (""). - // On Windows platform, '\' is the path separator, otherwise it is '/'. - FilePath RemoveDirectoryName() const; - - // RemoveFileName returns the directory path with the filename removed. - // Example: FilePath("path/to/file").RemoveFileName() returns "path/to/". - // If the FilePath is "a_file" or "/a_file", RemoveFileName returns - // FilePath("./") or, on Windows, FilePath(".\\"). If the filepath does - // not have a file, like "just/a/dir/", it returns the FilePath unmodified. - // On Windows platform, '\' is the path separator, otherwise it is '/'. - FilePath RemoveFileName() const; - - // Returns a copy of the FilePath with the case-insensitive extension removed. - // Example: FilePath("dir/file.exe").RemoveExtension("EXE") returns - // FilePath("dir/file"). If a case-insensitive extension is not - // found, returns a copy of the original FilePath. - FilePath RemoveExtension(const char* extension) const; - - // Creates directories so that path exists. Returns true if successful or if - // the directories already exist; returns false if unable to create - // directories for any reason. Will also return false if the FilePath does - // not represent a directory (that is, it doesn't end with a path separator). - bool CreateDirectoriesRecursively() const; - - // Create the directory so that path exists. Returns true if successful or - // if the directory already exists; returns false if unable to create the - // directory for any reason, including if the parent directory does not - // exist. Not named "CreateDirectory" because that's a macro on Windows. - bool CreateFolder() const; - - // Returns true if FilePath describes something in the file-system, - // either a file, directory, or whatever, and that something exists. - bool FileOrDirectoryExists() const; - - // Returns true if pathname describes a directory in the file-system - // that exists. - bool DirectoryExists() const; - - // Returns true if FilePath ends with a path separator, which indicates that - // it is intended to represent a directory. Returns false otherwise. - // This does NOT check that a directory (or file) actually exists. - bool IsDirectory() const; - - // Returns true if pathname describes a root directory. (Windows has one - // root directory per disk drive.) - bool IsRootDirectory() const; - - // Returns true if pathname describes an absolute path. - bool IsAbsolutePath() const; - - private: - // Replaces multiple consecutive separators with a single separator. - // For example, "bar///foo" becomes "bar/foo". Does not eliminate other - // redundancies that might be in a pathname involving "." or "..". - // - // A pathname with multiple consecutive separators may occur either through - // user error or as a result of some scripts or APIs that generate a pathname - // with a trailing separator. On other platforms the same API or script - // may NOT generate a pathname with a trailing "/". Then elsewhere that - // pathname may have another "/" and pathname components added to it, - // without checking for the separator already being there. - // The script language and operating system may allow paths like "foo//bar" - // but some of the functions in FilePath will not handle that correctly. In - // particular, RemoveTrailingPathSeparator() only removes one separator, and - // it is called in CreateDirectoriesRecursively() assuming that it will change - // a pathname from directory syntax (trailing separator) to filename syntax. - // - // On Windows this method also replaces the alternate path separator '/' with - // the primary path separator '\\', so that for example "bar\\/\\foo" becomes - // "bar\\foo". - - void Normalize(); - - // Returns a pointer to the last occurence of a valid path separator in - // the FilePath. On Windows, for example, both '/' and '\' are valid path - // separators. Returns NULL if no path separator was found. - const char* FindLastPathSeparator() const; - - String pathname_; -}; // class FilePath - -} // namespace internal -} // namespace testing - -#endif // GTEST_INCLUDE_GTEST_INTERNAL_GTEST_FILEPATH_H_ -// This file was GENERATED by command: -// pump.py gtest-type-util.h.pump -// DO NOT EDIT BY HAND!!! - -// Copyright 2008 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. -// -// Author: wan@google.com (Zhanyong Wan) - -// Type utilities needed for implementing typed and type-parameterized -// tests. This file is generated by a SCRIPT. DO NOT EDIT BY HAND! -// -// Currently we support at most 50 types in a list, and at most 50 -// type-parameterized tests in one type-parameterized test case. -// Please contact googletestframework@googlegroups.com if you need -// more. - -#ifndef GTEST_INCLUDE_GTEST_INTERNAL_GTEST_TYPE_UTIL_H_ -#define GTEST_INCLUDE_GTEST_INTERNAL_GTEST_TYPE_UTIL_H_ - - -// #ifdef __GNUC__ is too general here. It is possible to use gcc without using -// libstdc++ (which is where cxxabi.h comes from). -# ifdef __GLIBCXX__ -# include -# elif defined(__HP_aCC) -# include -# endif // __GLIBCXX__ - -namespace testing { -namespace internal { - -// GetTypeName() returns a human-readable name of type T. -// NB: This function is also used in Google Mock, so don't move it inside of -// the typed-test-only section below. -template -String GetTypeName() { -# if GTEST_HAS_RTTI - - const char* const name = typeid(T).name(); -# if defined(__GLIBCXX__) || defined(__HP_aCC) - int status = 0; - // gcc's implementation of typeid(T).name() mangles the type name, - // so we have to demangle it. -# ifdef __GLIBCXX__ - using abi::__cxa_demangle; -# endif // __GLIBCXX__ - char* const readable_name = __cxa_demangle(name, 0, 0, &status); - const String name_str(status == 0 ? readable_name : name); - free(readable_name); - return name_str; -# else - return name; -# endif // __GLIBCXX__ || __HP_aCC - -# else - - return ""; - -# endif // GTEST_HAS_RTTI -} - -#if GTEST_HAS_TYPED_TEST || GTEST_HAS_TYPED_TEST_P - -// AssertyTypeEq::type is defined iff T1 and T2 are the same -// type. This can be used as a compile-time assertion to ensure that -// two types are equal. - -template -struct AssertTypeEq; - -template -struct AssertTypeEq { - typedef bool type; -}; - -// A unique type used as the default value for the arguments of class -// template Types. This allows us to simulate variadic templates -// (e.g. Types, Type, and etc), which C++ doesn't -// support directly. -struct None {}; - -// The following family of struct and struct templates are used to -// represent type lists. In particular, TypesN -// represents a type list with N types (T1, T2, ..., and TN) in it. -// Except for Types0, every struct in the family has two member types: -// Head for the first type in the list, and Tail for the rest of the -// list. - -// The empty type list. -struct Types0 {}; - -// Type lists of length 1, 2, 3, and so on. - -template -struct Types1 { - typedef T1 Head; - typedef Types0 Tail; -}; -template -struct Types2 { - typedef T1 Head; - typedef Types1 Tail; -}; - -template -struct Types3 { - typedef T1 Head; - typedef Types2 Tail; -}; - -template -struct Types4 { - typedef T1 Head; - typedef Types3 Tail; -}; - -template -struct Types5 { - typedef T1 Head; - typedef Types4 Tail; -}; - -template -struct Types6 { - typedef T1 Head; - typedef Types5 Tail; -}; - -template -struct Types7 { - typedef T1 Head; - typedef Types6 Tail; -}; - -template -struct Types8 { - typedef T1 Head; - typedef Types7 Tail; -}; - -template -struct Types9 { - typedef T1 Head; - typedef Types8 Tail; -}; - -template -struct Types10 { - typedef T1 Head; - typedef Types9 Tail; -}; - -template -struct Types11 { - typedef T1 Head; - typedef Types10 Tail; -}; - -template -struct Types12 { - typedef T1 Head; - typedef Types11 Tail; -}; - -template -struct Types13 { - typedef T1 Head; - typedef Types12 Tail; -}; - -template -struct Types14 { - typedef T1 Head; - typedef Types13 Tail; -}; - -template -struct Types15 { - typedef T1 Head; - typedef Types14 Tail; -}; - -template -struct Types16 { - typedef T1 Head; - typedef Types15 Tail; -}; - -template -struct Types17 { - typedef T1 Head; - typedef Types16 Tail; -}; - -template -struct Types18 { - typedef T1 Head; - typedef Types17 Tail; -}; - -template -struct Types19 { - typedef T1 Head; - typedef Types18 Tail; -}; - -template -struct Types20 { - typedef T1 Head; - typedef Types19 Tail; -}; - -template -struct Types21 { - typedef T1 Head; - typedef Types20 Tail; -}; - -template -struct Types22 { - typedef T1 Head; - typedef Types21 Tail; -}; - -template -struct Types23 { - typedef T1 Head; - typedef Types22 Tail; -}; - -template -struct Types24 { - typedef T1 Head; - typedef Types23 Tail; -}; - -template -struct Types25 { - typedef T1 Head; - typedef Types24 Tail; -}; - -template -struct Types26 { - typedef T1 Head; - typedef Types25 Tail; -}; - -template -struct Types27 { - typedef T1 Head; - typedef Types26 Tail; -}; - -template -struct Types28 { - typedef T1 Head; - typedef Types27 Tail; -}; - -template -struct Types29 { - typedef T1 Head; - typedef Types28 Tail; -}; - -template -struct Types30 { - typedef T1 Head; - typedef Types29 Tail; -}; - -template -struct Types31 { - typedef T1 Head; - typedef Types30 Tail; -}; - -template -struct Types32 { - typedef T1 Head; - typedef Types31 Tail; -}; - -template -struct Types33 { - typedef T1 Head; - typedef Types32 Tail; -}; - -template -struct Types34 { - typedef T1 Head; - typedef Types33 Tail; -}; - -template -struct Types35 { - typedef T1 Head; - typedef Types34 Tail; -}; - -template -struct Types36 { - typedef T1 Head; - typedef Types35 Tail; -}; - -template -struct Types37 { - typedef T1 Head; - typedef Types36 Tail; -}; - -template -struct Types38 { - typedef T1 Head; - typedef Types37 Tail; -}; - -template -struct Types39 { - typedef T1 Head; - typedef Types38 Tail; -}; - -template -struct Types40 { - typedef T1 Head; - typedef Types39 Tail; -}; - -template -struct Types41 { - typedef T1 Head; - typedef Types40 Tail; -}; - -template -struct Types42 { - typedef T1 Head; - typedef Types41 Tail; -}; - -template -struct Types43 { - typedef T1 Head; - typedef Types42 Tail; -}; - -template -struct Types44 { - typedef T1 Head; - typedef Types43 Tail; -}; - -template -struct Types45 { - typedef T1 Head; - typedef Types44 Tail; -}; - -template -struct Types46 { - typedef T1 Head; - typedef Types45 Tail; -}; - -template -struct Types47 { - typedef T1 Head; - typedef Types46 Tail; -}; - -template -struct Types48 { - typedef T1 Head; - typedef Types47 Tail; -}; - -template -struct Types49 { - typedef T1 Head; - typedef Types48 Tail; -}; - -template -struct Types50 { - typedef T1 Head; - typedef Types49 Tail; -}; - - -} // namespace internal - -// We don't want to require the users to write TypesN<...> directly, -// as that would require them to count the length. Types<...> is much -// easier to write, but generates horrible messages when there is a -// compiler error, as gcc insists on printing out each template -// argument, even if it has the default value (this means Types -// will appear as Types in the compiler -// errors). -// -// Our solution is to combine the best part of the two approaches: a -// user would write Types, and Google Test will translate -// that to TypesN internally to make error messages -// readable. The translation is done by the 'type' member of the -// Types template. -template -struct Types { - typedef internal::Types50 type; -}; - -template <> -struct Types { - typedef internal::Types0 type; -}; -template -struct Types { - typedef internal::Types1 type; -}; -template -struct Types { - typedef internal::Types2 type; -}; -template -struct Types { - typedef internal::Types3 type; -}; -template -struct Types { - typedef internal::Types4 type; -}; -template -struct Types { - typedef internal::Types5 type; -}; -template -struct Types { - typedef internal::Types6 type; -}; -template -struct Types { - typedef internal::Types7 type; -}; -template -struct Types { - typedef internal::Types8 type; -}; -template -struct Types { - typedef internal::Types9 type; -}; -template -struct Types { - typedef internal::Types10 type; -}; -template -struct Types { - typedef internal::Types11 type; -}; -template -struct Types { - typedef internal::Types12 type; -}; -template -struct Types { - typedef internal::Types13 type; -}; -template -struct Types { - typedef internal::Types14 type; -}; -template -struct Types { - typedef internal::Types15 type; -}; -template -struct Types { - typedef internal::Types16 type; -}; -template -struct Types { - typedef internal::Types17 type; -}; -template -struct Types { - typedef internal::Types18 type; -}; -template -struct Types { - typedef internal::Types19 type; -}; -template -struct Types { - typedef internal::Types20 type; -}; -template -struct Types { - typedef internal::Types21 type; -}; -template -struct Types { - typedef internal::Types22 type; -}; -template -struct Types { - typedef internal::Types23 type; -}; -template -struct Types { - typedef internal::Types24 type; -}; -template -struct Types { - typedef internal::Types25 type; -}; -template -struct Types { - typedef internal::Types26 type; -}; -template -struct Types { - typedef internal::Types27 type; -}; -template -struct Types { - typedef internal::Types28 type; -}; -template -struct Types { - typedef internal::Types29 type; -}; -template -struct Types { - typedef internal::Types30 type; -}; -template -struct Types { - typedef internal::Types31 type; -}; -template -struct Types { - typedef internal::Types32 type; -}; -template -struct Types { - typedef internal::Types33 type; -}; -template -struct Types { - typedef internal::Types34 type; -}; -template -struct Types { - typedef internal::Types35 type; -}; -template -struct Types { - typedef internal::Types36 type; -}; -template -struct Types { - typedef internal::Types37 type; -}; -template -struct Types { - typedef internal::Types38 type; -}; -template -struct Types { - typedef internal::Types39 type; -}; -template -struct Types { - typedef internal::Types40 type; -}; -template -struct Types { - typedef internal::Types41 type; -}; -template -struct Types { - typedef internal::Types42 type; -}; -template -struct Types { - typedef internal::Types43 type; -}; -template -struct Types { - typedef internal::Types44 type; -}; -template -struct Types { - typedef internal::Types45 type; -}; -template -struct Types { - typedef internal::Types46 type; -}; -template -struct Types { - typedef internal::Types47 type; -}; -template -struct Types { - typedef internal::Types48 type; -}; -template -struct Types { - typedef internal::Types49 type; -}; - -namespace internal { - -# define GTEST_TEMPLATE_ template class - -// The template "selector" struct TemplateSel is used to -// represent Tmpl, which must be a class template with one type -// parameter, as a type. TemplateSel::Bind::type is defined -// as the type Tmpl. This allows us to actually instantiate the -// template "selected" by TemplateSel. -// -// This trick is necessary for simulating typedef for class templates, -// which C++ doesn't support directly. -template -struct TemplateSel { - template - struct Bind { - typedef Tmpl type; - }; -}; - -# define GTEST_BIND_(TmplSel, T) \ - TmplSel::template Bind::type - -// A unique struct template used as the default value for the -// arguments of class template Templates. This allows us to simulate -// variadic templates (e.g. Templates, Templates, -// and etc), which C++ doesn't support directly. -template -struct NoneT {}; - -// The following family of struct and struct templates are used to -// represent template lists. In particular, TemplatesN represents a list of N templates (T1, T2, ..., and TN). Except -// for Templates0, every struct in the family has two member types: -// Head for the selector of the first template in the list, and Tail -// for the rest of the list. - -// The empty template list. -struct Templates0 {}; - -// Template lists of length 1, 2, 3, and so on. - -template -struct Templates1 { - typedef TemplateSel Head; - typedef Templates0 Tail; -}; -template -struct Templates2 { - typedef TemplateSel Head; - typedef Templates1 Tail; -}; - -template -struct Templates3 { - typedef TemplateSel Head; - typedef Templates2 Tail; -}; - -template -struct Templates4 { - typedef TemplateSel Head; - typedef Templates3 Tail; -}; - -template -struct Templates5 { - typedef TemplateSel Head; - typedef Templates4 Tail; -}; - -template -struct Templates6 { - typedef TemplateSel Head; - typedef Templates5 Tail; -}; - -template -struct Templates7 { - typedef TemplateSel Head; - typedef Templates6 Tail; -}; - -template -struct Templates8 { - typedef TemplateSel Head; - typedef Templates7 Tail; -}; - -template -struct Templates9 { - typedef TemplateSel Head; - typedef Templates8 Tail; -}; - -template -struct Templates10 { - typedef TemplateSel Head; - typedef Templates9 Tail; -}; - -template -struct Templates11 { - typedef TemplateSel Head; - typedef Templates10 Tail; -}; - -template -struct Templates12 { - typedef TemplateSel Head; - typedef Templates11 Tail; -}; - -template -struct Templates13 { - typedef TemplateSel Head; - typedef Templates12 Tail; -}; - -template -struct Templates14 { - typedef TemplateSel Head; - typedef Templates13 Tail; -}; - -template -struct Templates15 { - typedef TemplateSel Head; - typedef Templates14 Tail; -}; - -template -struct Templates16 { - typedef TemplateSel Head; - typedef Templates15 Tail; -}; - -template -struct Templates17 { - typedef TemplateSel Head; - typedef Templates16 Tail; -}; - -template -struct Templates18 { - typedef TemplateSel Head; - typedef Templates17 Tail; -}; - -template -struct Templates19 { - typedef TemplateSel Head; - typedef Templates18 Tail; -}; - -template -struct Templates20 { - typedef TemplateSel Head; - typedef Templates19 Tail; -}; - -template -struct Templates21 { - typedef TemplateSel Head; - typedef Templates20 Tail; -}; - -template -struct Templates22 { - typedef TemplateSel Head; - typedef Templates21 Tail; -}; - -template -struct Templates23 { - typedef TemplateSel Head; - typedef Templates22 Tail; -}; - -template -struct Templates24 { - typedef TemplateSel Head; - typedef Templates23 Tail; -}; - -template -struct Templates25 { - typedef TemplateSel Head; - typedef Templates24 Tail; -}; - -template -struct Templates26 { - typedef TemplateSel Head; - typedef Templates25 Tail; -}; - -template -struct Templates27 { - typedef TemplateSel Head; - typedef Templates26 Tail; -}; - -template -struct Templates28 { - typedef TemplateSel Head; - typedef Templates27 Tail; -}; - -template -struct Templates29 { - typedef TemplateSel Head; - typedef Templates28 Tail; -}; - -template -struct Templates30 { - typedef TemplateSel Head; - typedef Templates29 Tail; -}; - -template -struct Templates31 { - typedef TemplateSel Head; - typedef Templates30 Tail; -}; - -template -struct Templates32 { - typedef TemplateSel Head; - typedef Templates31 Tail; -}; - -template -struct Templates33 { - typedef TemplateSel Head; - typedef Templates32 Tail; -}; - -template -struct Templates34 { - typedef TemplateSel Head; - typedef Templates33 Tail; -}; - -template -struct Templates35 { - typedef TemplateSel Head; - typedef Templates34 Tail; -}; - -template -struct Templates36 { - typedef TemplateSel Head; - typedef Templates35 Tail; -}; - -template -struct Templates37 { - typedef TemplateSel Head; - typedef Templates36 Tail; -}; - -template -struct Templates38 { - typedef TemplateSel Head; - typedef Templates37 Tail; -}; - -template -struct Templates39 { - typedef TemplateSel Head; - typedef Templates38 Tail; -}; - -template -struct Templates40 { - typedef TemplateSel Head; - typedef Templates39 Tail; -}; - -template -struct Templates41 { - typedef TemplateSel Head; - typedef Templates40 Tail; -}; - -template -struct Templates42 { - typedef TemplateSel Head; - typedef Templates41 Tail; -}; - -template -struct Templates43 { - typedef TemplateSel Head; - typedef Templates42 Tail; -}; - -template -struct Templates44 { - typedef TemplateSel Head; - typedef Templates43 Tail; -}; - -template -struct Templates45 { - typedef TemplateSel Head; - typedef Templates44 Tail; -}; - -template -struct Templates46 { - typedef TemplateSel Head; - typedef Templates45 Tail; -}; - -template -struct Templates47 { - typedef TemplateSel Head; - typedef Templates46 Tail; -}; - -template -struct Templates48 { - typedef TemplateSel Head; - typedef Templates47 Tail; -}; - -template -struct Templates49 { - typedef TemplateSel Head; - typedef Templates48 Tail; -}; - -template -struct Templates50 { - typedef TemplateSel Head; - typedef Templates49 Tail; -}; - - -// We don't want to require the users to write TemplatesN<...> directly, -// as that would require them to count the length. Templates<...> is much -// easier to write, but generates horrible messages when there is a -// compiler error, as gcc insists on printing out each template -// argument, even if it has the default value (this means Templates -// will appear as Templates in the compiler -// errors). -// -// Our solution is to combine the best part of the two approaches: a -// user would write Templates, and Google Test will translate -// that to TemplatesN internally to make error messages -// readable. The translation is done by the 'type' member of the -// Templates template. -template -struct Templates { - typedef Templates50 type; -}; - -template <> -struct Templates { - typedef Templates0 type; -}; -template -struct Templates { - typedef Templates1 type; -}; -template -struct Templates { - typedef Templates2 type; -}; -template -struct Templates { - typedef Templates3 type; -}; -template -struct Templates { - typedef Templates4 type; -}; -template -struct Templates { - typedef Templates5 type; -}; -template -struct Templates { - typedef Templates6 type; -}; -template -struct Templates { - typedef Templates7 type; -}; -template -struct Templates { - typedef Templates8 type; -}; -template -struct Templates { - typedef Templates9 type; -}; -template -struct Templates { - typedef Templates10 type; -}; -template -struct Templates { - typedef Templates11 type; -}; -template -struct Templates { - typedef Templates12 type; -}; -template -struct Templates { - typedef Templates13 type; -}; -template -struct Templates { - typedef Templates14 type; -}; -template -struct Templates { - typedef Templates15 type; -}; -template -struct Templates { - typedef Templates16 type; -}; -template -struct Templates { - typedef Templates17 type; -}; -template -struct Templates { - typedef Templates18 type; -}; -template -struct Templates { - typedef Templates19 type; -}; -template -struct Templates { - typedef Templates20 type; -}; -template -struct Templates { - typedef Templates21 type; -}; -template -struct Templates { - typedef Templates22 type; -}; -template -struct Templates { - typedef Templates23 type; -}; -template -struct Templates { - typedef Templates24 type; -}; -template -struct Templates { - typedef Templates25 type; -}; -template -struct Templates { - typedef Templates26 type; -}; -template -struct Templates { - typedef Templates27 type; -}; -template -struct Templates { - typedef Templates28 type; -}; -template -struct Templates { - typedef Templates29 type; -}; -template -struct Templates { - typedef Templates30 type; -}; -template -struct Templates { - typedef Templates31 type; -}; -template -struct Templates { - typedef Templates32 type; -}; -template -struct Templates { - typedef Templates33 type; -}; -template -struct Templates { - typedef Templates34 type; -}; -template -struct Templates { - typedef Templates35 type; -}; -template -struct Templates { - typedef Templates36 type; -}; -template -struct Templates { - typedef Templates37 type; -}; -template -struct Templates { - typedef Templates38 type; -}; -template -struct Templates { - typedef Templates39 type; -}; -template -struct Templates { - typedef Templates40 type; -}; -template -struct Templates { - typedef Templates41 type; -}; -template -struct Templates { - typedef Templates42 type; -}; -template -struct Templates { - typedef Templates43 type; -}; -template -struct Templates { - typedef Templates44 type; -}; -template -struct Templates { - typedef Templates45 type; -}; -template -struct Templates { - typedef Templates46 type; -}; -template -struct Templates { - typedef Templates47 type; -}; -template -struct Templates { - typedef Templates48 type; -}; -template -struct Templates { - typedef Templates49 type; -}; - -// The TypeList template makes it possible to use either a single type -// or a Types<...> list in TYPED_TEST_CASE() and -// INSTANTIATE_TYPED_TEST_CASE_P(). - -template -struct TypeList { typedef Types1 type; }; - -template -struct TypeList > { - typedef typename Types::type type; -}; - -#endif // GTEST_HAS_TYPED_TEST || GTEST_HAS_TYPED_TEST_P - -} // namespace internal -} // namespace testing - -#endif // GTEST_INCLUDE_GTEST_INTERNAL_GTEST_TYPE_UTIL_H_ - -// Due to C++ preprocessor weirdness, we need double indirection to -// concatenate two tokens when one of them is __LINE__. Writing -// -// foo ## __LINE__ -// -// will result in the token foo__LINE__, instead of foo followed by -// the current line number. For more details, see -// http://www.parashift.com/c++-faq-lite/misc-technical-issues.html#faq-39.6 -#define GTEST_CONCAT_TOKEN_(foo, bar) GTEST_CONCAT_TOKEN_IMPL_(foo, bar) -#define GTEST_CONCAT_TOKEN_IMPL_(foo, bar) foo ## bar - -// Google Test defines the testing::Message class to allow construction of -// test messages via the << operator. The idea is that anything -// streamable to std::ostream can be streamed to a testing::Message. -// This allows a user to use his own types in Google Test assertions by -// overloading the << operator. -// -// util/gtl/stl_logging-inl.h overloads << for STL containers. These -// overloads cannot be defined in the std namespace, as that will be -// undefined behavior. Therefore, they are defined in the global -// namespace instead. -// -// C++'s symbol lookup rule (i.e. Koenig lookup) says that these -// overloads are visible in either the std namespace or the global -// namespace, but not other namespaces, including the testing -// namespace which Google Test's Message class is in. -// -// To allow STL containers (and other types that has a << operator -// defined in the global namespace) to be used in Google Test assertions, -// testing::Message must access the custom << operator from the global -// namespace. Hence this helper function. -// -// Note: Jeffrey Yasskin suggested an alternative fix by "using -// ::operator<<;" in the definition of Message's operator<<. That fix -// doesn't require a helper function, but unfortunately doesn't -// compile with MSVC. -template -inline void GTestStreamToHelper(std::ostream* os, const T& val) { - *os << val; -} - -class ProtocolMessage; -namespace proto2 { class Message; } - -namespace testing { - -// Forward declarations. - -class AssertionResult; // Result of an assertion. -class Message; // Represents a failure message. -class Test; // Represents a test. -class TestInfo; // Information about a test. -class TestPartResult; // Result of a test part. -class UnitTest; // A collection of test cases. - -template -::std::string PrintToString(const T& value); - -namespace internal { - -struct TraceInfo; // Information about a trace point. -class ScopedTrace; // Implements scoped trace. -class TestInfoImpl; // Opaque implementation of TestInfo -class UnitTestImpl; // Opaque implementation of UnitTest - -// How many times InitGoogleTest() has been called. -extern int g_init_gtest_count; - -// The text used in failure messages to indicate the start of the -// stack trace. -GTEST_API_ extern const char kStackTraceMarker[]; - -// A secret type that Google Test users don't know about. It has no -// definition on purpose. Therefore it's impossible to create a -// Secret object, which is what we want. -class Secret; - -// Two overloaded helpers for checking at compile time whether an -// expression is a null pointer literal (i.e. NULL or any 0-valued -// compile-time integral constant). Their return values have -// different sizes, so we can use sizeof() to test which version is -// picked by the compiler. These helpers have no implementations, as -// we only need their signatures. -// -// Given IsNullLiteralHelper(x), the compiler will pick the first -// version if x can be implicitly converted to Secret*, and pick the -// second version otherwise. Since Secret is a secret and incomplete -// type, the only expression a user can write that has type Secret* is -// a null pointer literal. Therefore, we know that x is a null -// pointer literal if and only if the first version is picked by the -// compiler. -char IsNullLiteralHelper(Secret* p); -char (&IsNullLiteralHelper(...))[2]; // NOLINT - -// A compile-time bool constant that is true if and only if x is a -// null pointer literal (i.e. NULL or any 0-valued compile-time -// integral constant). -#ifdef GTEST_ELLIPSIS_NEEDS_POD_ -// We lose support for NULL detection where the compiler doesn't like -// passing non-POD classes through ellipsis (...). -# define GTEST_IS_NULL_LITERAL_(x) false -#else -# define GTEST_IS_NULL_LITERAL_(x) \ - (sizeof(::testing::internal::IsNullLiteralHelper(x)) == 1) -#endif // GTEST_ELLIPSIS_NEEDS_POD_ - -// Appends the user-supplied message to the Google-Test-generated message. -GTEST_API_ String AppendUserMessage(const String& gtest_msg, - const Message& user_msg); - -// A helper class for creating scoped traces in user programs. -class GTEST_API_ ScopedTrace { - public: - // The c'tor pushes the given source file location and message onto - // a trace stack maintained by Google Test. - ScopedTrace(const char* file, int line, const Message& message); - - // The d'tor pops the info pushed by the c'tor. - // - // Note that the d'tor is not virtual in order to be efficient. - // Don't inherit from ScopedTrace! - ~ScopedTrace(); - - private: - GTEST_DISALLOW_COPY_AND_ASSIGN_(ScopedTrace); -} GTEST_ATTRIBUTE_UNUSED_; // A ScopedTrace object does its job in its - // c'tor and d'tor. Therefore it doesn't - // need to be used otherwise. - -// Converts a streamable value to a String. A NULL pointer is -// converted to "(null)". When the input value is a ::string, -// ::std::string, ::wstring, or ::std::wstring object, each NUL -// character in it is replaced with "\\0". -// Declared here but defined in gtest.h, so that it has access -// to the definition of the Message class, required by the ARM -// compiler. -template -String StreamableToString(const T& streamable); - -// The Symbian compiler has a bug that prevents it from selecting the -// correct overload of FormatForComparisonFailureMessage (see below) -// unless we pass the first argument by reference. If we do that, -// however, Visual Age C++ 10.1 generates a compiler error. Therefore -// we only apply the work-around for Symbian. -#if defined(__SYMBIAN32__) -# define GTEST_CREF_WORKAROUND_ const& -#else -# define GTEST_CREF_WORKAROUND_ -#endif - -// When this operand is a const char* or char*, if the other operand -// is a ::std::string or ::string, we print this operand as a C string -// rather than a pointer (we do the same for wide strings); otherwise -// we print it as a pointer to be safe. - -// This internal macro is used to avoid duplicated code. -#define GTEST_FORMAT_IMPL_(operand2_type, operand1_printer)\ -inline String FormatForComparisonFailureMessage(\ - operand2_type::value_type* GTEST_CREF_WORKAROUND_ str, \ - const operand2_type& /*operand2*/) {\ - return operand1_printer(str);\ -}\ -inline String FormatForComparisonFailureMessage(\ - const operand2_type::value_type* GTEST_CREF_WORKAROUND_ str, \ - const operand2_type& /*operand2*/) {\ - return operand1_printer(str);\ -} - -GTEST_FORMAT_IMPL_(::std::string, String::ShowCStringQuoted) -#if GTEST_HAS_STD_WSTRING -GTEST_FORMAT_IMPL_(::std::wstring, String::ShowWideCStringQuoted) -#endif // GTEST_HAS_STD_WSTRING - -#if GTEST_HAS_GLOBAL_STRING -GTEST_FORMAT_IMPL_(::string, String::ShowCStringQuoted) -#endif // GTEST_HAS_GLOBAL_STRING -#if GTEST_HAS_GLOBAL_WSTRING -GTEST_FORMAT_IMPL_(::wstring, String::ShowWideCStringQuoted) -#endif // GTEST_HAS_GLOBAL_WSTRING - -#undef GTEST_FORMAT_IMPL_ - -// The next four overloads handle the case where the operand being -// printed is a char/wchar_t pointer and the other operand is not a -// string/wstring object. In such cases, we just print the operand as -// a pointer to be safe. -#define GTEST_FORMAT_CHAR_PTR_IMPL_(CharType) \ - template \ - String FormatForComparisonFailureMessage(CharType* GTEST_CREF_WORKAROUND_ p, \ - const T&) { \ - return PrintToString(static_cast(p)); \ - } - -GTEST_FORMAT_CHAR_PTR_IMPL_(char) -GTEST_FORMAT_CHAR_PTR_IMPL_(const char) -GTEST_FORMAT_CHAR_PTR_IMPL_(wchar_t) -GTEST_FORMAT_CHAR_PTR_IMPL_(const wchar_t) - -#undef GTEST_FORMAT_CHAR_PTR_IMPL_ - -// Constructs and returns the message for an equality assertion -// (e.g. ASSERT_EQ, EXPECT_STREQ, etc) failure. -// -// The first four parameters are the expressions used in the assertion -// and their values, as strings. For example, for ASSERT_EQ(foo, bar) -// where foo is 5 and bar is 6, we have: -// -// expected_expression: "foo" -// actual_expression: "bar" -// expected_value: "5" -// actual_value: "6" -// -// The ignoring_case parameter is true iff the assertion is a -// *_STRCASEEQ*. When it's true, the string " (ignoring case)" will -// be inserted into the message. -GTEST_API_ AssertionResult EqFailure(const char* expected_expression, - const char* actual_expression, - const String& expected_value, - const String& actual_value, - bool ignoring_case); - -// Constructs a failure message for Boolean assertions such as EXPECT_TRUE. -GTEST_API_ String GetBoolAssertionFailureMessage( - const AssertionResult& assertion_result, - const char* expression_text, - const char* actual_predicate_value, - const char* expected_predicate_value); - -// This template class represents an IEEE floating-point number -// (either single-precision or double-precision, depending on the -// template parameters). -// -// The purpose of this class is to do more sophisticated number -// comparison. (Due to round-off error, etc, it's very unlikely that -// two floating-points will be equal exactly. Hence a naive -// comparison by the == operation often doesn't work.) -// -// Format of IEEE floating-point: -// -// The most-significant bit being the leftmost, an IEEE -// floating-point looks like -// -// sign_bit exponent_bits fraction_bits -// -// Here, sign_bit is a single bit that designates the sign of the -// number. -// -// For float, there are 8 exponent bits and 23 fraction bits. -// -// For double, there are 11 exponent bits and 52 fraction bits. -// -// More details can be found at -// http://en.wikipedia.org/wiki/IEEE_floating-point_standard. -// -// Template parameter: -// -// RawType: the raw floating-point type (either float or double) -template -class FloatingPoint { - public: - // Defines the unsigned integer type that has the same size as the - // floating point number. - typedef typename TypeWithSize::UInt Bits; - - // Constants. - - // # of bits in a number. - static const size_t kBitCount = 8*sizeof(RawType); - - // # of fraction bits in a number. - static const size_t kFractionBitCount = - std::numeric_limits::digits - 1; - - // # of exponent bits in a number. - static const size_t kExponentBitCount = kBitCount - 1 - kFractionBitCount; - - // The mask for the sign bit. - static const Bits kSignBitMask = static_cast(1) << (kBitCount - 1); - - // The mask for the fraction bits. - static const Bits kFractionBitMask = - ~static_cast(0) >> (kExponentBitCount + 1); - - // The mask for the exponent bits. - static const Bits kExponentBitMask = ~(kSignBitMask | kFractionBitMask); - - // How many ULP's (Units in the Last Place) we want to tolerate when - // comparing two numbers. The larger the value, the more error we - // allow. A 0 value means that two numbers must be exactly the same - // to be considered equal. - // - // The maximum error of a single floating-point operation is 0.5 - // units in the last place. On Intel CPU's, all floating-point - // calculations are done with 80-bit precision, while double has 64 - // bits. Therefore, 4 should be enough for ordinary use. - // - // See the following article for more details on ULP: - // http://www.cygnus-software.com/papers/comparingfloats/comparingfloats.htm. - static const size_t kMaxUlps = 4; - - // Constructs a FloatingPoint from a raw floating-point number. - // - // On an Intel CPU, passing a non-normalized NAN (Not a Number) - // around may change its bits, although the new value is guaranteed - // to be also a NAN. Therefore, don't expect this constructor to - // preserve the bits in x when x is a NAN. - explicit FloatingPoint(const RawType& x) { u_.value_ = x; } - - // Static methods - - // Reinterprets a bit pattern as a floating-point number. - // - // This function is needed to test the AlmostEquals() method. - static RawType ReinterpretBits(const Bits bits) { - FloatingPoint fp(0); - fp.u_.bits_ = bits; - return fp.u_.value_; - } - - // Returns the floating-point number that represent positive infinity. - static RawType Infinity() { - return ReinterpretBits(kExponentBitMask); - } - - // Non-static methods - - // Returns the bits that represents this number. - const Bits &bits() const { return u_.bits_; } - - // Returns the exponent bits of this number. - Bits exponent_bits() const { return kExponentBitMask & u_.bits_; } - - // Returns the fraction bits of this number. - Bits fraction_bits() const { return kFractionBitMask & u_.bits_; } - - // Returns the sign bit of this number. - Bits sign_bit() const { return kSignBitMask & u_.bits_; } - - // Returns true iff this is NAN (not a number). - bool is_nan() const { - // It's a NAN if the exponent bits are all ones and the fraction - // bits are not entirely zeros. - return (exponent_bits() == kExponentBitMask) && (fraction_bits() != 0); - } - - // Returns true iff this number is at most kMaxUlps ULP's away from - // rhs. In particular, this function: - // - // - returns false if either number is (or both are) NAN. - // - treats really large numbers as almost equal to infinity. - // - thinks +0.0 and -0.0 are 0 DLP's apart. - bool AlmostEquals(const FloatingPoint& rhs) const { - // The IEEE standard says that any comparison operation involving - // a NAN must return false. - if (is_nan() || rhs.is_nan()) return false; - - return DistanceBetweenSignAndMagnitudeNumbers(u_.bits_, rhs.u_.bits_) - <= kMaxUlps; - } - - private: - // The data type used to store the actual floating-point number. - union FloatingPointUnion { - RawType value_; // The raw floating-point number. - Bits bits_; // The bits that represent the number. - }; - - // Converts an integer from the sign-and-magnitude representation to - // the biased representation. More precisely, let N be 2 to the - // power of (kBitCount - 1), an integer x is represented by the - // unsigned number x + N. - // - // For instance, - // - // -N + 1 (the most negative number representable using - // sign-and-magnitude) is represented by 1; - // 0 is represented by N; and - // N - 1 (the biggest number representable using - // sign-and-magnitude) is represented by 2N - 1. - // - // Read http://en.wikipedia.org/wiki/Signed_number_representations - // for more details on signed number representations. - static Bits SignAndMagnitudeToBiased(const Bits &sam) { - if (kSignBitMask & sam) { - // sam represents a negative number. - return ~sam + 1; - } else { - // sam represents a positive number. - return kSignBitMask | sam; - } - } - - // Given two numbers in the sign-and-magnitude representation, - // returns the distance between them as an unsigned number. - static Bits DistanceBetweenSignAndMagnitudeNumbers(const Bits &sam1, - const Bits &sam2) { - const Bits biased1 = SignAndMagnitudeToBiased(sam1); - const Bits biased2 = SignAndMagnitudeToBiased(sam2); - return (biased1 >= biased2) ? (biased1 - biased2) : (biased2 - biased1); - } - - FloatingPointUnion u_; -}; - -// Typedefs the instances of the FloatingPoint template class that we -// care to use. -typedef FloatingPoint Float; -typedef FloatingPoint Double; - -// In order to catch the mistake of putting tests that use different -// test fixture classes in the same test case, we need to assign -// unique IDs to fixture classes and compare them. The TypeId type is -// used to hold such IDs. The user should treat TypeId as an opaque -// type: the only operation allowed on TypeId values is to compare -// them for equality using the == operator. -typedef const void* TypeId; - -template -class TypeIdHelper { - public: - // dummy_ must not have a const type. Otherwise an overly eager - // compiler (e.g. MSVC 7.1 & 8.0) may try to merge - // TypeIdHelper::dummy_ for different Ts as an "optimization". - static bool dummy_; -}; - -template -bool TypeIdHelper::dummy_ = false; - -// GetTypeId() returns the ID of type T. Different values will be -// returned for different types. Calling the function twice with the -// same type argument is guaranteed to return the same ID. -template -TypeId GetTypeId() { - // The compiler is required to allocate a different - // TypeIdHelper::dummy_ variable for each T used to instantiate - // the template. Therefore, the address of dummy_ is guaranteed to - // be unique. - return &(TypeIdHelper::dummy_); -} - -// Returns the type ID of ::testing::Test. Always call this instead -// of GetTypeId< ::testing::Test>() to get the type ID of -// ::testing::Test, as the latter may give the wrong result due to a -// suspected linker bug when compiling Google Test as a Mac OS X -// framework. -GTEST_API_ TypeId GetTestTypeId(); - -// Defines the abstract factory interface that creates instances -// of a Test object. -class TestFactoryBase { - public: - virtual ~TestFactoryBase() {} - - // Creates a test instance to run. The instance is both created and destroyed - // within TestInfoImpl::Run() - virtual Test* CreateTest() = 0; - - protected: - TestFactoryBase() {} - - private: - GTEST_DISALLOW_COPY_AND_ASSIGN_(TestFactoryBase); -}; - -// This class provides implementation of TeastFactoryBase interface. -// It is used in TEST and TEST_F macros. -template -class TestFactoryImpl : public TestFactoryBase { - public: - virtual Test* CreateTest() { return new TestClass; } -}; - -#if GTEST_OS_WINDOWS - -// Predicate-formatters for implementing the HRESULT checking macros -// {ASSERT|EXPECT}_HRESULT_{SUCCEEDED|FAILED} -// We pass a long instead of HRESULT to avoid causing an -// include dependency for the HRESULT type. -GTEST_API_ AssertionResult IsHRESULTSuccess(const char* expr, - long hr); // NOLINT -GTEST_API_ AssertionResult IsHRESULTFailure(const char* expr, - long hr); // NOLINT - -#endif // GTEST_OS_WINDOWS - -// Types of SetUpTestCase() and TearDownTestCase() functions. -typedef void (*SetUpTestCaseFunc)(); -typedef void (*TearDownTestCaseFunc)(); - -// Creates a new TestInfo object and registers it with Google Test; -// returns the created object. -// -// Arguments: -// -// test_case_name: name of the test case -// name: name of the test -// type_param the name of the test's type parameter, or NULL if -// this is not a typed or a type-parameterized test. -// value_param text representation of the test's value parameter, -// or NULL if this is not a type-parameterized test. -// fixture_class_id: ID of the test fixture class -// set_up_tc: pointer to the function that sets up the test case -// tear_down_tc: pointer to the function that tears down the test case -// factory: pointer to the factory that creates a test object. -// The newly created TestInfo instance will assume -// ownership of the factory object. -GTEST_API_ TestInfo* MakeAndRegisterTestInfo( - const char* test_case_name, const char* name, - const char* type_param, - const char* value_param, - TypeId fixture_class_id, - SetUpTestCaseFunc set_up_tc, - TearDownTestCaseFunc tear_down_tc, - TestFactoryBase* factory); - -// If *pstr starts with the given prefix, modifies *pstr to be right -// past the prefix and returns true; otherwise leaves *pstr unchanged -// and returns false. None of pstr, *pstr, and prefix can be NULL. -GTEST_API_ bool SkipPrefix(const char* prefix, const char** pstr); - -#if GTEST_HAS_TYPED_TEST || GTEST_HAS_TYPED_TEST_P - -// State of the definition of a type-parameterized test case. -class GTEST_API_ TypedTestCasePState { - public: - TypedTestCasePState() : registered_(false) {} - - // Adds the given test name to defined_test_names_ and return true - // if the test case hasn't been registered; otherwise aborts the - // program. - bool AddTestName(const char* file, int line, const char* case_name, - const char* test_name) { - if (registered_) { - fprintf(stderr, "%s Test %s must be defined before " - "REGISTER_TYPED_TEST_CASE_P(%s, ...).\n", - FormatFileLocation(file, line).c_str(), test_name, case_name); - fflush(stderr); - posix::Abort(); - } - defined_test_names_.insert(test_name); - return true; - } - - // Verifies that registered_tests match the test names in - // defined_test_names_; returns registered_tests if successful, or - // aborts the program otherwise. - const char* VerifyRegisteredTestNames( - const char* file, int line, const char* registered_tests); - - private: - bool registered_; - ::std::set defined_test_names_; -}; - -// Skips to the first non-space char after the first comma in 'str'; -// returns NULL if no comma is found in 'str'. -inline const char* SkipComma(const char* str) { - const char* comma = strchr(str, ','); - if (comma == NULL) { - return NULL; - } - while (IsSpace(*(++comma))) {} - return comma; -} - -// Returns the prefix of 'str' before the first comma in it; returns -// the entire string if it contains no comma. -inline String GetPrefixUntilComma(const char* str) { - const char* comma = strchr(str, ','); - return comma == NULL ? String(str) : String(str, comma - str); -} - -// TypeParameterizedTest::Register() -// registers a list of type-parameterized tests with Google Test. The -// return value is insignificant - we just need to return something -// such that we can call this function in a namespace scope. -// -// Implementation note: The GTEST_TEMPLATE_ macro declares a template -// template parameter. It's defined in gtest-type-util.h. -template -class TypeParameterizedTest { - public: - // 'index' is the index of the test in the type list 'Types' - // specified in INSTANTIATE_TYPED_TEST_CASE_P(Prefix, TestCase, - // Types). Valid values for 'index' are [0, N - 1] where N is the - // length of Types. - static bool Register(const char* prefix, const char* case_name, - const char* test_names, int index) { - typedef typename Types::Head Type; - typedef Fixture FixtureClass; - typedef typename GTEST_BIND_(TestSel, Type) TestClass; - - // First, registers the first type-parameterized test in the type - // list. - MakeAndRegisterTestInfo( - String::Format("%s%s%s/%d", prefix, prefix[0] == '\0' ? "" : "/", - case_name, index).c_str(), - GetPrefixUntilComma(test_names).c_str(), - GetTypeName().c_str(), - NULL, // No value parameter. - GetTypeId(), - TestClass::SetUpTestCase, - TestClass::TearDownTestCase, - new TestFactoryImpl); - - // Next, recurses (at compile time) with the tail of the type list. - return TypeParameterizedTest - ::Register(prefix, case_name, test_names, index + 1); - } -}; - -// The base case for the compile time recursion. -template -class TypeParameterizedTest { - public: - static bool Register(const char* /*prefix*/, const char* /*case_name*/, - const char* /*test_names*/, int /*index*/) { - return true; - } -}; - -// TypeParameterizedTestCase::Register() -// registers *all combinations* of 'Tests' and 'Types' with Google -// Test. The return value is insignificant - we just need to return -// something such that we can call this function in a namespace scope. -template -class TypeParameterizedTestCase { - public: - static bool Register(const char* prefix, const char* case_name, - const char* test_names) { - typedef typename Tests::Head Head; - - // First, register the first test in 'Test' for each type in 'Types'. - TypeParameterizedTest::Register( - prefix, case_name, test_names, 0); - - // Next, recurses (at compile time) with the tail of the test list. - return TypeParameterizedTestCase - ::Register(prefix, case_name, SkipComma(test_names)); - } -}; - -// The base case for the compile time recursion. -template -class TypeParameterizedTestCase { - public: - static bool Register(const char* /*prefix*/, const char* /*case_name*/, - const char* /*test_names*/) { - return true; - } -}; - -#endif // GTEST_HAS_TYPED_TEST || GTEST_HAS_TYPED_TEST_P - -// Returns the current OS stack trace as a String. -// -// The maximum number of stack frames to be included is specified by -// the gtest_stack_trace_depth flag. The skip_count parameter -// specifies the number of top frames to be skipped, which doesn't -// count against the number of frames to be included. -// -// For example, if Foo() calls Bar(), which in turn calls -// GetCurrentOsStackTraceExceptTop(..., 1), Foo() will be included in -// the trace but Bar() and GetCurrentOsStackTraceExceptTop() won't. -GTEST_API_ String GetCurrentOsStackTraceExceptTop(UnitTest* unit_test, - int skip_count); - -// Helpers for suppressing warnings on unreachable code or constant -// condition. - -// Always returns true. -GTEST_API_ bool AlwaysTrue(); - -// Always returns false. -inline bool AlwaysFalse() { return !AlwaysTrue(); } - -// Helper for suppressing false warning from Clang on a const char* -// variable declared in a conditional expression always being NULL in -// the else branch. -struct GTEST_API_ ConstCharPtr { - ConstCharPtr(const char* str) : value(str) {} - operator bool() const { return true; } - const char* value; -}; - -// A simple Linear Congruential Generator for generating random -// numbers with a uniform distribution. Unlike rand() and srand(), it -// doesn't use global state (and therefore can't interfere with user -// code). Unlike rand_r(), it's portable. An LCG isn't very random, -// but it's good enough for our purposes. -class GTEST_API_ Random { - public: - static const UInt32 kMaxRange = 1u << 31; - - explicit Random(UInt32 seed) : state_(seed) {} - - void Reseed(UInt32 seed) { state_ = seed; } - - // Generates a random number from [0, range). Crashes if 'range' is - // 0 or greater than kMaxRange. - UInt32 Generate(UInt32 range); - - private: - UInt32 state_; - GTEST_DISALLOW_COPY_AND_ASSIGN_(Random); -}; - -// Defining a variable of type CompileAssertTypesEqual will cause a -// compiler error iff T1 and T2 are different types. -template -struct CompileAssertTypesEqual; - -template -struct CompileAssertTypesEqual { -}; - -// Removes the reference from a type if it is a reference type, -// otherwise leaves it unchanged. This is the same as -// tr1::remove_reference, which is not widely available yet. -template -struct RemoveReference { typedef T type; }; // NOLINT -template -struct RemoveReference { typedef T type; }; // NOLINT - -// A handy wrapper around RemoveReference that works when the argument -// T depends on template parameters. -#define GTEST_REMOVE_REFERENCE_(T) \ - typename ::testing::internal::RemoveReference::type - -// Removes const from a type if it is a const type, otherwise leaves -// it unchanged. This is the same as tr1::remove_const, which is not -// widely available yet. -template -struct RemoveConst { typedef T type; }; // NOLINT -template -struct RemoveConst { typedef T type; }; // NOLINT - -// MSVC 8.0, Sun C++, and IBM XL C++ have a bug which causes the above -// definition to fail to remove the const in 'const int[3]' and 'const -// char[3][4]'. The following specialization works around the bug. -// However, it causes trouble with GCC and thus needs to be -// conditionally compiled. -#if defined(_MSC_VER) || defined(__SUNPRO_CC) || defined(__IBMCPP__) -template -struct RemoveConst { - typedef typename RemoveConst::type type[N]; -}; -#endif - -// A handy wrapper around RemoveConst that works when the argument -// T depends on template parameters. -#define GTEST_REMOVE_CONST_(T) \ - typename ::testing::internal::RemoveConst::type - -// Turns const U&, U&, const U, and U all into U. -#define GTEST_REMOVE_REFERENCE_AND_CONST_(T) \ - GTEST_REMOVE_CONST_(GTEST_REMOVE_REFERENCE_(T)) - -// Adds reference to a type if it is not a reference type, -// otherwise leaves it unchanged. This is the same as -// tr1::add_reference, which is not widely available yet. -template -struct AddReference { typedef T& type; }; // NOLINT -template -struct AddReference { typedef T& type; }; // NOLINT - -// A handy wrapper around AddReference that works when the argument T -// depends on template parameters. -#define GTEST_ADD_REFERENCE_(T) \ - typename ::testing::internal::AddReference::type - -// Adds a reference to const on top of T as necessary. For example, -// it transforms -// -// char ==> const char& -// const char ==> const char& -// char& ==> const char& -// const char& ==> const char& -// -// The argument T must depend on some template parameters. -#define GTEST_REFERENCE_TO_CONST_(T) \ - GTEST_ADD_REFERENCE_(const GTEST_REMOVE_REFERENCE_(T)) - -// ImplicitlyConvertible::value is a compile-time bool -// constant that's true iff type From can be implicitly converted to -// type To. -template -class ImplicitlyConvertible { - private: - // We need the following helper functions only for their types. - // They have no implementations. - - // MakeFrom() is an expression whose type is From. We cannot simply - // use From(), as the type From may not have a public default - // constructor. - static From MakeFrom(); - - // These two functions are overloaded. Given an expression - // Helper(x), the compiler will pick the first version if x can be - // implicitly converted to type To; otherwise it will pick the - // second version. - // - // The first version returns a value of size 1, and the second - // version returns a value of size 2. Therefore, by checking the - // size of Helper(x), which can be done at compile time, we can tell - // which version of Helper() is used, and hence whether x can be - // implicitly converted to type To. - static char Helper(To); - static char (&Helper(...))[2]; // NOLINT - - // We have to put the 'public' section after the 'private' section, - // or MSVC refuses to compile the code. - public: - // MSVC warns about implicitly converting from double to int for - // possible loss of data, so we need to temporarily disable the - // warning. -#ifdef _MSC_VER -# pragma warning(push) // Saves the current warning state. -# pragma warning(disable:4244) // Temporarily disables warning 4244. - - static const bool value = - sizeof(Helper(ImplicitlyConvertible::MakeFrom())) == 1; -# pragma warning(pop) // Restores the warning state. -#elif defined(__BORLANDC__) - // C++Builder cannot use member overload resolution during template - // instantiation. The simplest workaround is to use its C++0x type traits - // functions (C++Builder 2009 and above only). - static const bool value = __is_convertible(From, To); -#else - static const bool value = - sizeof(Helper(ImplicitlyConvertible::MakeFrom())) == 1; -#endif // _MSV_VER -}; -template -const bool ImplicitlyConvertible::value; - -// IsAProtocolMessage::value is a compile-time bool constant that's -// true iff T is type ProtocolMessage, proto2::Message, or a subclass -// of those. -template -struct IsAProtocolMessage - : public bool_constant< - ImplicitlyConvertible::value || - ImplicitlyConvertible::value> { -}; - -// When the compiler sees expression IsContainerTest(0), if C is an -// STL-style container class, the first overload of IsContainerTest -// will be viable (since both C::iterator* and C::const_iterator* are -// valid types and NULL can be implicitly converted to them). It will -// be picked over the second overload as 'int' is a perfect match for -// the type of argument 0. If C::iterator or C::const_iterator is not -// a valid type, the first overload is not viable, and the second -// overload will be picked. Therefore, we can determine whether C is -// a container class by checking the type of IsContainerTest(0). -// The value of the expression is insignificant. -// -// Note that we look for both C::iterator and C::const_iterator. The -// reason is that C++ injects the name of a class as a member of the -// class itself (e.g. you can refer to class iterator as either -// 'iterator' or 'iterator::iterator'). If we look for C::iterator -// only, for example, we would mistakenly think that a class named -// iterator is an STL container. -// -// Also note that the simpler approach of overloading -// IsContainerTest(typename C::const_iterator*) and -// IsContainerTest(...) doesn't work with Visual Age C++ and Sun C++. -typedef int IsContainer; -template -IsContainer IsContainerTest(int /* dummy */, - typename C::iterator* /* it */ = NULL, - typename C::const_iterator* /* const_it */ = NULL) { - return 0; -} - -typedef char IsNotContainer; -template -IsNotContainer IsContainerTest(long /* dummy */) { return '\0'; } - -// EnableIf::type is void when 'Cond' is true, and -// undefined when 'Cond' is false. To use SFINAE to make a function -// overload only apply when a particular expression is true, add -// "typename EnableIf::type* = 0" as the last parameter. -template struct EnableIf; -template<> struct EnableIf { typedef void type; }; // NOLINT - -// Utilities for native arrays. - -// ArrayEq() compares two k-dimensional native arrays using the -// elements' operator==, where k can be any integer >= 0. When k is -// 0, ArrayEq() degenerates into comparing a single pair of values. - -template -bool ArrayEq(const T* lhs, size_t size, const U* rhs); - -// This generic version is used when k is 0. -template -inline bool ArrayEq(const T& lhs, const U& rhs) { return lhs == rhs; } - -// This overload is used when k >= 1. -template -inline bool ArrayEq(const T(&lhs)[N], const U(&rhs)[N]) { - return internal::ArrayEq(lhs, N, rhs); -} - -// This helper reduces code bloat. If we instead put its logic inside -// the previous ArrayEq() function, arrays with different sizes would -// lead to different copies of the template code. -template -bool ArrayEq(const T* lhs, size_t size, const U* rhs) { - for (size_t i = 0; i != size; i++) { - if (!internal::ArrayEq(lhs[i], rhs[i])) - return false; - } - return true; -} - -// Finds the first element in the iterator range [begin, end) that -// equals elem. Element may be a native array type itself. -template -Iter ArrayAwareFind(Iter begin, Iter end, const Element& elem) { - for (Iter it = begin; it != end; ++it) { - if (internal::ArrayEq(*it, elem)) - return it; - } - return end; -} - -// CopyArray() copies a k-dimensional native array using the elements' -// operator=, where k can be any integer >= 0. When k is 0, -// CopyArray() degenerates into copying a single value. - -template -void CopyArray(const T* from, size_t size, U* to); - -// This generic version is used when k is 0. -template -inline void CopyArray(const T& from, U* to) { *to = from; } - -// This overload is used when k >= 1. -template -inline void CopyArray(const T(&from)[N], U(*to)[N]) { - internal::CopyArray(from, N, *to); -} - -// This helper reduces code bloat. If we instead put its logic inside -// the previous CopyArray() function, arrays with different sizes -// would lead to different copies of the template code. -template -void CopyArray(const T* from, size_t size, U* to) { - for (size_t i = 0; i != size; i++) { - internal::CopyArray(from[i], to + i); - } -} - -// The relation between an NativeArray object (see below) and the -// native array it represents. -enum RelationToSource { - kReference, // The NativeArray references the native array. - kCopy // The NativeArray makes a copy of the native array and - // owns the copy. -}; - -// Adapts a native array to a read-only STL-style container. Instead -// of the complete STL container concept, this adaptor only implements -// members useful for Google Mock's container matchers. New members -// should be added as needed. To simplify the implementation, we only -// support Element being a raw type (i.e. having no top-level const or -// reference modifier). It's the client's responsibility to satisfy -// this requirement. Element can be an array type itself (hence -// multi-dimensional arrays are supported). -template -class NativeArray { - public: - // STL-style container typedefs. - typedef Element value_type; - typedef Element* iterator; - typedef const Element* const_iterator; - - // Constructs from a native array. - NativeArray(const Element* array, size_t count, RelationToSource relation) { - Init(array, count, relation); - } - - // Copy constructor. - NativeArray(const NativeArray& rhs) { - Init(rhs.array_, rhs.size_, rhs.relation_to_source_); - } - - ~NativeArray() { - // Ensures that the user doesn't instantiate NativeArray with a - // const or reference type. - static_cast(StaticAssertTypeEqHelper()); - if (relation_to_source_ == kCopy) - delete[] array_; - } - - // STL-style container methods. - size_t size() const { return size_; } - const_iterator begin() const { return array_; } - const_iterator end() const { return array_ + size_; } - bool operator==(const NativeArray& rhs) const { - return size() == rhs.size() && - ArrayEq(begin(), size(), rhs.begin()); - } - - private: - // Initializes this object; makes a copy of the input array if - // 'relation' is kCopy. - void Init(const Element* array, size_t a_size, RelationToSource relation) { - if (relation == kReference) { - array_ = array; - } else { - Element* const copy = new Element[a_size]; - CopyArray(array, a_size, copy); - array_ = copy; - } - size_ = a_size; - relation_to_source_ = relation; - } - - const Element* array_; - size_t size_; - RelationToSource relation_to_source_; - - GTEST_DISALLOW_ASSIGN_(NativeArray); -}; - -} // namespace internal -} // namespace testing - -#define GTEST_MESSAGE_AT_(file, line, message, result_type) \ - ::testing::internal::AssertHelper(result_type, file, line, message) \ - = ::testing::Message() - -#define GTEST_MESSAGE_(message, result_type) \ - GTEST_MESSAGE_AT_(__FILE__, __LINE__, message, result_type) - -#define GTEST_FATAL_FAILURE_(message) \ - return GTEST_MESSAGE_(message, ::testing::TestPartResult::kFatalFailure) - -#define GTEST_NONFATAL_FAILURE_(message) \ - GTEST_MESSAGE_(message, ::testing::TestPartResult::kNonFatalFailure) - -#define GTEST_SUCCESS_(message) \ - GTEST_MESSAGE_(message, ::testing::TestPartResult::kSuccess) - -// Suppresses MSVC warnings 4072 (unreachable code) for the code following -// statement if it returns or throws (or doesn't return or throw in some -// situations). -#define GTEST_SUPPRESS_UNREACHABLE_CODE_WARNING_BELOW_(statement) \ - if (::testing::internal::AlwaysTrue()) { statement; } - -#define GTEST_TEST_THROW_(statement, expected_exception, fail) \ - GTEST_AMBIGUOUS_ELSE_BLOCKER_ \ - if (::testing::internal::ConstCharPtr gtest_msg = "") { \ - bool gtest_caught_expected = false; \ - try { \ - GTEST_SUPPRESS_UNREACHABLE_CODE_WARNING_BELOW_(statement); \ - } \ - catch (expected_exception const&) { \ - gtest_caught_expected = true; \ - } \ - catch (...) { \ - gtest_msg.value = \ - "Expected: " #statement " throws an exception of type " \ - #expected_exception ".\n Actual: it throws a different type."; \ - goto GTEST_CONCAT_TOKEN_(gtest_label_testthrow_, __LINE__); \ - } \ - if (!gtest_caught_expected) { \ - gtest_msg.value = \ - "Expected: " #statement " throws an exception of type " \ - #expected_exception ".\n Actual: it throws nothing."; \ - goto GTEST_CONCAT_TOKEN_(gtest_label_testthrow_, __LINE__); \ - } \ - } else \ - GTEST_CONCAT_TOKEN_(gtest_label_testthrow_, __LINE__): \ - fail(gtest_msg.value) - -#define GTEST_TEST_NO_THROW_(statement, fail) \ - GTEST_AMBIGUOUS_ELSE_BLOCKER_ \ - if (::testing::internal::AlwaysTrue()) { \ - try { \ - GTEST_SUPPRESS_UNREACHABLE_CODE_WARNING_BELOW_(statement); \ - } \ - catch (...) { \ - goto GTEST_CONCAT_TOKEN_(gtest_label_testnothrow_, __LINE__); \ - } \ - } else \ - GTEST_CONCAT_TOKEN_(gtest_label_testnothrow_, __LINE__): \ - fail("Expected: " #statement " doesn't throw an exception.\n" \ - " Actual: it throws.") - -#define GTEST_TEST_ANY_THROW_(statement, fail) \ - GTEST_AMBIGUOUS_ELSE_BLOCKER_ \ - if (::testing::internal::AlwaysTrue()) { \ - bool gtest_caught_any = false; \ - try { \ - GTEST_SUPPRESS_UNREACHABLE_CODE_WARNING_BELOW_(statement); \ - } \ - catch (...) { \ - gtest_caught_any = true; \ - } \ - if (!gtest_caught_any) { \ - goto GTEST_CONCAT_TOKEN_(gtest_label_testanythrow_, __LINE__); \ - } \ - } else \ - GTEST_CONCAT_TOKEN_(gtest_label_testanythrow_, __LINE__): \ - fail("Expected: " #statement " throws an exception.\n" \ - " Actual: it doesn't.") - - -// Implements Boolean test assertions such as EXPECT_TRUE. expression can be -// either a boolean expression or an AssertionResult. text is a textual -// represenation of expression as it was passed into the EXPECT_TRUE. -#define GTEST_TEST_BOOLEAN_(expression, text, actual, expected, fail) \ - GTEST_AMBIGUOUS_ELSE_BLOCKER_ \ - if (const ::testing::AssertionResult gtest_ar_ = \ - ::testing::AssertionResult(expression)) \ - ; \ - else \ - fail(::testing::internal::GetBoolAssertionFailureMessage(\ - gtest_ar_, text, #actual, #expected).c_str()) - -#define GTEST_TEST_NO_FATAL_FAILURE_(statement, fail) \ - GTEST_AMBIGUOUS_ELSE_BLOCKER_ \ - if (::testing::internal::AlwaysTrue()) { \ - ::testing::internal::HasNewFatalFailureHelper gtest_fatal_failure_checker; \ - GTEST_SUPPRESS_UNREACHABLE_CODE_WARNING_BELOW_(statement); \ - if (gtest_fatal_failure_checker.has_new_fatal_failure()) { \ - goto GTEST_CONCAT_TOKEN_(gtest_label_testnofatal_, __LINE__); \ - } \ - } else \ - GTEST_CONCAT_TOKEN_(gtest_label_testnofatal_, __LINE__): \ - fail("Expected: " #statement " doesn't generate new fatal " \ - "failures in the current thread.\n" \ - " Actual: it does.") - -// Expands to the name of the class that implements the given test. -#define GTEST_TEST_CLASS_NAME_(test_case_name, test_name) \ - test_case_name##_##test_name##_Test - -// Helper macro for defining tests. -#define GTEST_TEST_(test_case_name, test_name, parent_class, parent_id)\ -class GTEST_TEST_CLASS_NAME_(test_case_name, test_name) : public parent_class {\ - public:\ - GTEST_TEST_CLASS_NAME_(test_case_name, test_name)() {}\ - private:\ - virtual void TestBody();\ - static ::testing::TestInfo* const test_info_ GTEST_ATTRIBUTE_UNUSED_;\ - GTEST_DISALLOW_COPY_AND_ASSIGN_(\ - GTEST_TEST_CLASS_NAME_(test_case_name, test_name));\ -};\ -\ -::testing::TestInfo* const GTEST_TEST_CLASS_NAME_(test_case_name, test_name)\ - ::test_info_ =\ - ::testing::internal::MakeAndRegisterTestInfo(\ - #test_case_name, #test_name, NULL, NULL, \ - (parent_id), \ - parent_class::SetUpTestCase, \ - parent_class::TearDownTestCase, \ - new ::testing::internal::TestFactoryImpl<\ - GTEST_TEST_CLASS_NAME_(test_case_name, test_name)>);\ -void GTEST_TEST_CLASS_NAME_(test_case_name, test_name)::TestBody() - -#endif // GTEST_INCLUDE_GTEST_INTERNAL_GTEST_INTERNAL_H_ -// Copyright 2005, 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. -// -// Author: wan@google.com (Zhanyong Wan) -// -// The Google C++ Testing Framework (Google Test) -// -// This header file defines the public API for death tests. It is -// #included by gtest.h so a user doesn't need to include this -// directly. - -#ifndef GTEST_INCLUDE_GTEST_GTEST_DEATH_TEST_H_ -#define GTEST_INCLUDE_GTEST_GTEST_DEATH_TEST_H_ - -// Copyright 2005, 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: wan@google.com (Zhanyong Wan), eefacm@gmail.com (Sean Mcafee) -// -// The Google C++ Testing Framework (Google Test) -// -// This header file defines internal utilities needed for implementing -// death tests. They are subject to change without notice. - -#ifndef GTEST_INCLUDE_GTEST_INTERNAL_GTEST_DEATH_TEST_INTERNAL_H_ -#define GTEST_INCLUDE_GTEST_INTERNAL_GTEST_DEATH_TEST_INTERNAL_H_ - - -#include - -namespace testing { -namespace internal { - -GTEST_DECLARE_string_(internal_run_death_test); - -// Names of the flags (needed for parsing Google Test flags). -const char kDeathTestStyleFlag[] = "death_test_style"; -const char kDeathTestUseFork[] = "death_test_use_fork"; -const char kInternalRunDeathTestFlag[] = "internal_run_death_test"; - -#if GTEST_HAS_DEATH_TEST - -// DeathTest is a class that hides much of the complexity of the -// GTEST_DEATH_TEST_ macro. It is abstract; its static Create method -// returns a concrete class that depends on the prevailing death test -// style, as defined by the --gtest_death_test_style and/or -// --gtest_internal_run_death_test flags. - -// In describing the results of death tests, these terms are used with -// the corresponding definitions: -// -// exit status: The integer exit information in the format specified -// by wait(2) -// exit code: The integer code passed to exit(3), _exit(2), or -// returned from main() -class GTEST_API_ DeathTest { - public: - // Create returns false if there was an error determining the - // appropriate action to take for the current death test; for example, - // if the gtest_death_test_style flag is set to an invalid value. - // The LastMessage method will return a more detailed message in that - // case. Otherwise, the DeathTest pointer pointed to by the "test" - // argument is set. If the death test should be skipped, the pointer - // is set to NULL; otherwise, it is set to the address of a new concrete - // DeathTest object that controls the execution of the current test. - static bool Create(const char* statement, const RE* regex, - const char* file, int line, DeathTest** test); - DeathTest(); - virtual ~DeathTest() { } - - // A helper class that aborts a death test when it's deleted. - class ReturnSentinel { - public: - explicit ReturnSentinel(DeathTest* test) : test_(test) { } - ~ReturnSentinel() { test_->Abort(TEST_ENCOUNTERED_RETURN_STATEMENT); } - private: - DeathTest* const test_; - GTEST_DISALLOW_COPY_AND_ASSIGN_(ReturnSentinel); - } GTEST_ATTRIBUTE_UNUSED_; - - // An enumeration of possible roles that may be taken when a death - // test is encountered. EXECUTE means that the death test logic should - // be executed immediately. OVERSEE means that the program should prepare - // the appropriate environment for a child process to execute the death - // test, then wait for it to complete. - enum TestRole { OVERSEE_TEST, EXECUTE_TEST }; - - // An enumeration of the three reasons that a test might be aborted. - enum AbortReason { - TEST_ENCOUNTERED_RETURN_STATEMENT, - TEST_THREW_EXCEPTION, - TEST_DID_NOT_DIE - }; - - // Assumes one of the above roles. - virtual TestRole AssumeRole() = 0; - - // Waits for the death test to finish and returns its status. - virtual int Wait() = 0; - - // Returns true if the death test passed; that is, the test process - // exited during the test, its exit status matches a user-supplied - // predicate, and its stderr output matches a user-supplied regular - // expression. - // The user-supplied predicate may be a macro expression rather - // than a function pointer or functor, or else Wait and Passed could - // be combined. - virtual bool Passed(bool exit_status_ok) = 0; - - // Signals that the death test did not die as expected. - virtual void Abort(AbortReason reason) = 0; - - // Returns a human-readable outcome message regarding the outcome of - // the last death test. - static const char* LastMessage(); - - static void set_last_death_test_message(const String& message); - - private: - // A string containing a description of the outcome of the last death test. - static String last_death_test_message_; - - GTEST_DISALLOW_COPY_AND_ASSIGN_(DeathTest); -}; - -// Factory interface for death tests. May be mocked out for testing. -class DeathTestFactory { - public: - virtual ~DeathTestFactory() { } - virtual bool Create(const char* statement, const RE* regex, - const char* file, int line, DeathTest** test) = 0; -}; - -// A concrete DeathTestFactory implementation for normal use. -class DefaultDeathTestFactory : public DeathTestFactory { - public: - virtual bool Create(const char* statement, const RE* regex, - const char* file, int line, DeathTest** test); -}; - -// Returns true if exit_status describes a process that was terminated -// by a signal, or exited normally with a nonzero exit code. -GTEST_API_ bool ExitedUnsuccessfully(int exit_status); - -// Traps C++ exceptions escaping statement and reports them as test -// failures. Note that trapping SEH exceptions is not implemented here. -# if GTEST_HAS_EXCEPTIONS -# define GTEST_EXECUTE_DEATH_TEST_STATEMENT_(statement, death_test) \ - try { \ - GTEST_SUPPRESS_UNREACHABLE_CODE_WARNING_BELOW_(statement); \ - } catch (const ::std::exception& gtest_exception) { \ - fprintf(\ - stderr, \ - "\n%s: Caught std::exception-derived exception escaping the " \ - "death test statement. Exception message: %s\n", \ - ::testing::internal::FormatFileLocation(__FILE__, __LINE__).c_str(), \ - gtest_exception.what()); \ - fflush(stderr); \ - death_test->Abort(::testing::internal::DeathTest::TEST_THREW_EXCEPTION); \ - } catch (...) { \ - death_test->Abort(::testing::internal::DeathTest::TEST_THREW_EXCEPTION); \ - } - -# else -# define GTEST_EXECUTE_DEATH_TEST_STATEMENT_(statement, death_test) \ - GTEST_SUPPRESS_UNREACHABLE_CODE_WARNING_BELOW_(statement) - -# endif - -// This macro is for implementing ASSERT_DEATH*, EXPECT_DEATH*, -// ASSERT_EXIT*, and EXPECT_EXIT*. -# define GTEST_DEATH_TEST_(statement, predicate, regex, fail) \ - GTEST_AMBIGUOUS_ELSE_BLOCKER_ \ - if (::testing::internal::AlwaysTrue()) { \ - const ::testing::internal::RE& gtest_regex = (regex); \ - ::testing::internal::DeathTest* gtest_dt; \ - if (!::testing::internal::DeathTest::Create(#statement, >est_regex, \ - __FILE__, __LINE__, >est_dt)) { \ - goto GTEST_CONCAT_TOKEN_(gtest_label_, __LINE__); \ - } \ - if (gtest_dt != NULL) { \ - ::testing::internal::scoped_ptr< ::testing::internal::DeathTest> \ - gtest_dt_ptr(gtest_dt); \ - switch (gtest_dt->AssumeRole()) { \ - case ::testing::internal::DeathTest::OVERSEE_TEST: \ - if (!gtest_dt->Passed(predicate(gtest_dt->Wait()))) { \ - goto GTEST_CONCAT_TOKEN_(gtest_label_, __LINE__); \ - } \ - break; \ - case ::testing::internal::DeathTest::EXECUTE_TEST: { \ - ::testing::internal::DeathTest::ReturnSentinel \ - gtest_sentinel(gtest_dt); \ - GTEST_EXECUTE_DEATH_TEST_STATEMENT_(statement, gtest_dt); \ - gtest_dt->Abort(::testing::internal::DeathTest::TEST_DID_NOT_DIE); \ - break; \ - } \ - default: \ - break; \ - } \ - } \ - } else \ - GTEST_CONCAT_TOKEN_(gtest_label_, __LINE__): \ - fail(::testing::internal::DeathTest::LastMessage()) -// The symbol "fail" here expands to something into which a message -// can be streamed. - -// A class representing the parsed contents of the -// --gtest_internal_run_death_test flag, as it existed when -// RUN_ALL_TESTS was called. -class InternalRunDeathTestFlag { - public: - InternalRunDeathTestFlag(const String& a_file, - int a_line, - int an_index, - int a_write_fd) - : file_(a_file), line_(a_line), index_(an_index), - write_fd_(a_write_fd) {} - - ~InternalRunDeathTestFlag() { - if (write_fd_ >= 0) - posix::Close(write_fd_); - } - - String file() const { return file_; } - int line() const { return line_; } - int index() const { return index_; } - int write_fd() const { return write_fd_; } - - private: - String file_; - int line_; - int index_; - int write_fd_; - - GTEST_DISALLOW_COPY_AND_ASSIGN_(InternalRunDeathTestFlag); -}; - -// Returns a newly created InternalRunDeathTestFlag object with fields -// initialized from the GTEST_FLAG(internal_run_death_test) flag if -// the flag is specified; otherwise returns NULL. -InternalRunDeathTestFlag* ParseInternalRunDeathTestFlag(); - -#else // GTEST_HAS_DEATH_TEST - -// This macro is used for implementing macros such as -// EXPECT_DEATH_IF_SUPPORTED and ASSERT_DEATH_IF_SUPPORTED on systems where -// death tests are not supported. Those macros must compile on such systems -// iff EXPECT_DEATH and ASSERT_DEATH compile with the same parameters on -// systems that support death tests. This allows one to write such a macro -// on a system that does not support death tests and be sure that it will -// compile on a death-test supporting system. -// -// Parameters: -// statement - A statement that a macro such as EXPECT_DEATH would test -// for program termination. This macro has to make sure this -// statement is compiled but not executed, to ensure that -// EXPECT_DEATH_IF_SUPPORTED compiles with a certain -// parameter iff EXPECT_DEATH compiles with it. -// regex - A regex that a macro such as EXPECT_DEATH would use to test -// the output of statement. This parameter has to be -// compiled but not evaluated by this macro, to ensure that -// this macro only accepts expressions that a macro such as -// EXPECT_DEATH would accept. -// terminator - Must be an empty statement for EXPECT_DEATH_IF_SUPPORTED -// and a return statement for ASSERT_DEATH_IF_SUPPORTED. -// This ensures that ASSERT_DEATH_IF_SUPPORTED will not -// compile inside functions where ASSERT_DEATH doesn't -// compile. -// -// The branch that has an always false condition is used to ensure that -// statement and regex are compiled (and thus syntactically correct) but -// never executed. The unreachable code macro protects the terminator -// statement from generating an 'unreachable code' warning in case -// statement unconditionally returns or throws. The Message constructor at -// the end allows the syntax of streaming additional messages into the -// macro, for compilational compatibility with EXPECT_DEATH/ASSERT_DEATH. -# define GTEST_UNSUPPORTED_DEATH_TEST_(statement, regex, terminator) \ - GTEST_AMBIGUOUS_ELSE_BLOCKER_ \ - if (::testing::internal::AlwaysTrue()) { \ - GTEST_LOG_(WARNING) \ - << "Death tests are not supported on this platform.\n" \ - << "Statement '" #statement "' cannot be verified."; \ - } else if (::testing::internal::AlwaysFalse()) { \ - ::testing::internal::RE::PartialMatch(".*", (regex)); \ - GTEST_SUPPRESS_UNREACHABLE_CODE_WARNING_BELOW_(statement); \ - terminator; \ - } else \ - ::testing::Message() - -#endif // GTEST_HAS_DEATH_TEST - -} // namespace internal -} // namespace testing - -#endif // GTEST_INCLUDE_GTEST_INTERNAL_GTEST_DEATH_TEST_INTERNAL_H_ - -namespace testing { - -// This flag controls the style of death tests. Valid values are "threadsafe", -// meaning that the death test child process will re-execute the test binary -// from the start, running only a single death test, or "fast", -// meaning that the child process will execute the test logic immediately -// after forking. -GTEST_DECLARE_string_(death_test_style); - -#if GTEST_HAS_DEATH_TEST - -// The following macros are useful for writing death tests. - -// Here's what happens when an ASSERT_DEATH* or EXPECT_DEATH* is -// executed: -// -// 1. It generates a warning if there is more than one active -// thread. This is because it's safe to fork() or clone() only -// when there is a single thread. -// -// 2. The parent process clone()s a sub-process and runs the death -// test in it; the sub-process exits with code 0 at the end of the -// death test, if it hasn't exited already. -// -// 3. The parent process waits for the sub-process to terminate. -// -// 4. The parent process checks the exit code and error message of -// the sub-process. -// -// Examples: -// -// ASSERT_DEATH(server.SendMessage(56, "Hello"), "Invalid port number"); -// for (int i = 0; i < 5; i++) { -// EXPECT_DEATH(server.ProcessRequest(i), -// "Invalid request .* in ProcessRequest()") -// << "Failed to die on request " << i); -// } -// -// ASSERT_EXIT(server.ExitNow(), ::testing::ExitedWithCode(0), "Exiting"); -// -// bool KilledBySIGHUP(int exit_code) { -// return WIFSIGNALED(exit_code) && WTERMSIG(exit_code) == SIGHUP; -// } -// -// ASSERT_EXIT(client.HangUpServer(), KilledBySIGHUP, "Hanging up!"); -// -// On the regular expressions used in death tests: -// -// On POSIX-compliant systems (*nix), we use the library, -// which uses the POSIX extended regex syntax. -// -// On other platforms (e.g. Windows), we only support a simple regex -// syntax implemented as part of Google Test. This limited -// implementation should be enough most of the time when writing -// death tests; though it lacks many features you can find in PCRE -// or POSIX extended regex syntax. For example, we don't support -// union ("x|y"), grouping ("(xy)"), brackets ("[xy]"), and -// repetition count ("x{5,7}"), among others. -// -// Below is the syntax that we do support. We chose it to be a -// subset of both PCRE and POSIX extended regex, so it's easy to -// learn wherever you come from. In the following: 'A' denotes a -// literal character, period (.), or a single \\ escape sequence; -// 'x' and 'y' denote regular expressions; 'm' and 'n' are for -// natural numbers. -// -// c matches any literal character c -// \\d matches any decimal digit -// \\D matches any character that's not a decimal digit -// \\f matches \f -// \\n matches \n -// \\r matches \r -// \\s matches any ASCII whitespace, including \n -// \\S matches any character that's not a whitespace -// \\t matches \t -// \\v matches \v -// \\w matches any letter, _, or decimal digit -// \\W matches any character that \\w doesn't match -// \\c matches any literal character c, which must be a punctuation -// . matches any single character except \n -// A? matches 0 or 1 occurrences of A -// A* matches 0 or many occurrences of A -// A+ matches 1 or many occurrences of A -// ^ matches the beginning of a string (not that of each line) -// $ matches the end of a string (not that of each line) -// xy matches x followed by y -// -// If you accidentally use PCRE or POSIX extended regex features -// not implemented by us, you will get a run-time failure. In that -// case, please try to rewrite your regular expression within the -// above syntax. -// -// This implementation is *not* meant to be as highly tuned or robust -// as a compiled regex library, but should perform well enough for a -// death test, which already incurs significant overhead by launching -// a child process. -// -// Known caveats: -// -// A "threadsafe" style death test obtains the path to the test -// program from argv[0] and re-executes it in the sub-process. For -// simplicity, the current implementation doesn't search the PATH -// when launching the sub-process. This means that the user must -// invoke the test program via a path that contains at least one -// path separator (e.g. path/to/foo_test and -// /absolute/path/to/bar_test are fine, but foo_test is not). This -// is rarely a problem as people usually don't put the test binary -// directory in PATH. -// -// TODO(wan@google.com): make thread-safe death tests search the PATH. - -// Asserts that a given statement causes the program to exit, with an -// integer exit status that satisfies predicate, and emitting error output -// that matches regex. -# define ASSERT_EXIT(statement, predicate, regex) \ - GTEST_DEATH_TEST_(statement, predicate, regex, GTEST_FATAL_FAILURE_) - -// Like ASSERT_EXIT, but continues on to successive tests in the -// test case, if any: -# define EXPECT_EXIT(statement, predicate, regex) \ - GTEST_DEATH_TEST_(statement, predicate, regex, GTEST_NONFATAL_FAILURE_) - -// Asserts that a given statement causes the program to exit, either by -// explicitly exiting with a nonzero exit code or being killed by a -// signal, and emitting error output that matches regex. -# define ASSERT_DEATH(statement, regex) \ - ASSERT_EXIT(statement, ::testing::internal::ExitedUnsuccessfully, regex) - -// Like ASSERT_DEATH, but continues on to successive tests in the -// test case, if any: -# define EXPECT_DEATH(statement, regex) \ - EXPECT_EXIT(statement, ::testing::internal::ExitedUnsuccessfully, regex) - -// Two predicate classes that can be used in {ASSERT,EXPECT}_EXIT*: - -// Tests that an exit code describes a normal exit with a given exit code. -class GTEST_API_ ExitedWithCode { - public: - explicit ExitedWithCode(int exit_code); - bool operator()(int exit_status) const; - private: - // No implementation - assignment is unsupported. - void operator=(const ExitedWithCode& other); - - const int exit_code_; -}; - -# if !GTEST_OS_WINDOWS -// Tests that an exit code describes an exit due to termination by a -// given signal. -class GTEST_API_ KilledBySignal { - public: - explicit KilledBySignal(int signum); - bool operator()(int exit_status) const; - private: - const int signum_; -}; -# endif // !GTEST_OS_WINDOWS - -// EXPECT_DEBUG_DEATH asserts that the given statements die in debug mode. -// The death testing framework causes this to have interesting semantics, -// since the sideeffects of the call are only visible in opt mode, and not -// in debug mode. -// -// In practice, this can be used to test functions that utilize the -// LOG(DFATAL) macro using the following style: -// -// int DieInDebugOr12(int* sideeffect) { -// if (sideeffect) { -// *sideeffect = 12; -// } -// LOG(DFATAL) << "death"; -// return 12; -// } -// -// TEST(TestCase, TestDieOr12WorksInDgbAndOpt) { -// int sideeffect = 0; -// // Only asserts in dbg. -// EXPECT_DEBUG_DEATH(DieInDebugOr12(&sideeffect), "death"); -// -// #ifdef NDEBUG -// // opt-mode has sideeffect visible. -// EXPECT_EQ(12, sideeffect); -// #else -// // dbg-mode no visible sideeffect. -// EXPECT_EQ(0, sideeffect); -// #endif -// } -// -// This will assert that DieInDebugReturn12InOpt() crashes in debug -// mode, usually due to a DCHECK or LOG(DFATAL), but returns the -// appropriate fallback value (12 in this case) in opt mode. If you -// need to test that a function has appropriate side-effects in opt -// mode, include assertions against the side-effects. A general -// pattern for this is: -// -// EXPECT_DEBUG_DEATH({ -// // Side-effects here will have an effect after this statement in -// // opt mode, but none in debug mode. -// EXPECT_EQ(12, DieInDebugOr12(&sideeffect)); -// }, "death"); -// -# ifdef NDEBUG - -# define EXPECT_DEBUG_DEATH(statement, regex) \ - do { statement; } while (::testing::internal::AlwaysFalse()) - -# define ASSERT_DEBUG_DEATH(statement, regex) \ - do { statement; } while (::testing::internal::AlwaysFalse()) - -# else - -# define EXPECT_DEBUG_DEATH(statement, regex) \ - EXPECT_DEATH(statement, regex) - -# define ASSERT_DEBUG_DEATH(statement, regex) \ - ASSERT_DEATH(statement, regex) - -# endif // NDEBUG for EXPECT_DEBUG_DEATH -#endif // GTEST_HAS_DEATH_TEST - -// EXPECT_DEATH_IF_SUPPORTED(statement, regex) and -// ASSERT_DEATH_IF_SUPPORTED(statement, regex) expand to real death tests if -// death tests are supported; otherwise they just issue a warning. This is -// useful when you are combining death test assertions with normal test -// assertions in one test. -#if GTEST_HAS_DEATH_TEST -# define EXPECT_DEATH_IF_SUPPORTED(statement, regex) \ - EXPECT_DEATH(statement, regex) -# define ASSERT_DEATH_IF_SUPPORTED(statement, regex) \ - ASSERT_DEATH(statement, regex) -#else -# define EXPECT_DEATH_IF_SUPPORTED(statement, regex) \ - GTEST_UNSUPPORTED_DEATH_TEST_(statement, regex, ) -# define ASSERT_DEATH_IF_SUPPORTED(statement, regex) \ - GTEST_UNSUPPORTED_DEATH_TEST_(statement, regex, return) -#endif - -} // namespace testing - -#endif // GTEST_INCLUDE_GTEST_GTEST_DEATH_TEST_H_ -// Copyright 2005, 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. -// -// Author: wan@google.com (Zhanyong Wan) -// -// The Google C++ Testing Framework (Google Test) -// -// This header file defines the Message class. -// -// IMPORTANT NOTE: Due to limitation of the C++ language, we have to -// leave some internal implementation details in this header file. -// They are clearly marked by comments like this: -// -// // INTERNAL IMPLEMENTATION - DO NOT USE IN A USER PROGRAM. -// -// Such code is NOT meant to be used by a user directly, and is subject -// to CHANGE WITHOUT NOTICE. Therefore DO NOT DEPEND ON IT in a user -// program! - -#ifndef GTEST_INCLUDE_GTEST_GTEST_MESSAGE_H_ -#define GTEST_INCLUDE_GTEST_GTEST_MESSAGE_H_ - -#include - - -namespace testing { - -// The Message class works like an ostream repeater. -// -// Typical usage: -// -// 1. You stream a bunch of values to a Message object. -// It will remember the text in a stringstream. -// 2. Then you stream the Message object to an ostream. -// This causes the text in the Message to be streamed -// to the ostream. -// -// For example; -// -// testing::Message foo; -// foo << 1 << " != " << 2; -// std::cout << foo; -// -// will print "1 != 2". -// -// Message is not intended to be inherited from. In particular, its -// destructor is not virtual. -// -// Note that stringstream behaves differently in gcc and in MSVC. You -// can stream a NULL char pointer to it in the former, but not in the -// latter (it causes an access violation if you do). The Message -// class hides this difference by treating a NULL char pointer as -// "(null)". -class GTEST_API_ Message { - private: - // The type of basic IO manipulators (endl, ends, and flush) for - // narrow streams. - typedef std::ostream& (*BasicNarrowIoManip)(std::ostream&); - - public: - // Constructs an empty Message. - // We allocate the stringstream separately because otherwise each use of - // ASSERT/EXPECT in a procedure adds over 200 bytes to the procedure's - // stack frame leading to huge stack frames in some cases; gcc does not reuse - // the stack space. - Message() : ss_(new ::std::stringstream) { - // By default, we want there to be enough precision when printing - // a double to a Message. - *ss_ << std::setprecision(std::numeric_limits::digits10 + 2); - } - - // Copy constructor. - Message(const Message& msg) : ss_(new ::std::stringstream) { // NOLINT - *ss_ << msg.GetString(); - } - - // Constructs a Message from a C-string. - explicit Message(const char* str) : ss_(new ::std::stringstream) { - *ss_ << str; - } - -#if GTEST_OS_SYMBIAN - // Streams a value (either a pointer or not) to this object. - template - inline Message& operator <<(const T& value) { - StreamHelper(typename internal::is_pointer::type(), value); - return *this; - } -#else - // Streams a non-pointer value to this object. - template - inline Message& operator <<(const T& val) { - ::GTestStreamToHelper(ss_.get(), val); - return *this; - } - - // Streams a pointer value to this object. - // - // This function is an overload of the previous one. When you - // stream a pointer to a Message, this definition will be used as it - // is more specialized. (The C++ Standard, section - // [temp.func.order].) If you stream a non-pointer, then the - // previous definition will be used. - // - // The reason for this overload is that streaming a NULL pointer to - // ostream is undefined behavior. Depending on the compiler, you - // may get "0", "(nil)", "(null)", or an access violation. To - // ensure consistent result across compilers, we always treat NULL - // as "(null)". - template - inline Message& operator <<(T* const& pointer) { // NOLINT - if (pointer == NULL) { - *ss_ << "(null)"; - } else { - ::GTestStreamToHelper(ss_.get(), pointer); - } - return *this; - } -#endif // GTEST_OS_SYMBIAN - - // Since the basic IO manipulators are overloaded for both narrow - // and wide streams, we have to provide this specialized definition - // of operator <<, even though its body is the same as the - // templatized version above. Without this definition, streaming - // endl or other basic IO manipulators to Message will confuse the - // compiler. - Message& operator <<(BasicNarrowIoManip val) { - *ss_ << val; - return *this; - } - - // Instead of 1/0, we want to see true/false for bool values. - Message& operator <<(bool b) { - return *this << (b ? "true" : "false"); - } - - // These two overloads allow streaming a wide C string to a Message - // using the UTF-8 encoding. - Message& operator <<(const wchar_t* wide_c_str) { - return *this << internal::String::ShowWideCString(wide_c_str); - } - Message& operator <<(wchar_t* wide_c_str) { - return *this << internal::String::ShowWideCString(wide_c_str); - } - -#if GTEST_HAS_STD_WSTRING - // Converts the given wide string to a narrow string using the UTF-8 - // encoding, and streams the result to this Message object. - Message& operator <<(const ::std::wstring& wstr); -#endif // GTEST_HAS_STD_WSTRING - -#if GTEST_HAS_GLOBAL_WSTRING - // Converts the given wide string to a narrow string using the UTF-8 - // encoding, and streams the result to this Message object. - Message& operator <<(const ::wstring& wstr); -#endif // GTEST_HAS_GLOBAL_WSTRING - - // Gets the text streamed to this object so far as a String. - // Each '\0' character in the buffer is replaced with "\\0". - // - // INTERNAL IMPLEMENTATION - DO NOT USE IN A USER PROGRAM. - internal::String GetString() const { - return internal::StringStreamToString(ss_.get()); - } - - private: - -#if GTEST_OS_SYMBIAN - // These are needed as the Nokia Symbian Compiler cannot decide between - // const T& and const T* in a function template. The Nokia compiler _can_ - // decide between class template specializations for T and T*, so a - // tr1::type_traits-like is_pointer works, and we can overload on that. - template - inline void StreamHelper(internal::true_type /*dummy*/, T* pointer) { - if (pointer == NULL) { - *ss_ << "(null)"; - } else { - ::GTestStreamToHelper(ss_.get(), pointer); - } - } - template - inline void StreamHelper(internal::false_type /*dummy*/, const T& value) { - ::GTestStreamToHelper(ss_.get(), value); - } -#endif // GTEST_OS_SYMBIAN - - // We'll hold the text streamed to this object here. - const internal::scoped_ptr< ::std::stringstream> ss_; - - // We declare (but don't implement) this to prevent the compiler - // from implementing the assignment operator. - void operator=(const Message&); -}; - -// Streams a Message to an ostream. -inline std::ostream& operator <<(std::ostream& os, const Message& sb) { - return os << sb.GetString(); -} - -} // namespace testing - -#endif // GTEST_INCLUDE_GTEST_GTEST_MESSAGE_H_ -// This file was GENERATED by command: -// pump.py gtest-param-test.h.pump -// DO NOT EDIT BY HAND!!! - -// Copyright 2008, 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: vladl@google.com (Vlad Losev) -// -// Macros and functions for implementing parameterized tests -// in Google C++ Testing Framework (Google Test) -// -// This file is generated by a SCRIPT. DO NOT EDIT BY HAND! -// -#ifndef GTEST_INCLUDE_GTEST_GTEST_PARAM_TEST_H_ -#define GTEST_INCLUDE_GTEST_GTEST_PARAM_TEST_H_ - - -// Value-parameterized tests allow you to test your code with different -// parameters without writing multiple copies of the same test. -// -// Here is how you use value-parameterized tests: - -#if 0 - -// To write value-parameterized tests, first you should define a fixture -// class. It is usually derived from testing::TestWithParam (see below for -// another inheritance scheme that's sometimes useful in more complicated -// class hierarchies), where the type of your parameter values. -// TestWithParam is itself derived from testing::Test. T can be any -// copyable type. If it's a raw pointer, you are responsible for managing the -// lifespan of the pointed values. - -class FooTest : public ::testing::TestWithParam { - // You can implement all the usual class fixture members here. -}; - -// Then, use the TEST_P macro to define as many parameterized tests -// for this fixture as you want. The _P suffix is for "parameterized" -// or "pattern", whichever you prefer to think. - -TEST_P(FooTest, DoesBlah) { - // Inside a test, access the test parameter with the GetParam() method - // of the TestWithParam class: - EXPECT_TRUE(foo.Blah(GetParam())); - ... -} - -TEST_P(FooTest, HasBlahBlah) { - ... -} - -// Finally, you can use INSTANTIATE_TEST_CASE_P to instantiate the test -// case with any set of parameters you want. Google Test defines a number -// of functions for generating test parameters. They return what we call -// (surprise!) parameter generators. Here is a summary of them, which -// are all in the testing namespace: -// -// -// Range(begin, end [, step]) - Yields values {begin, begin+step, -// begin+step+step, ...}. The values do not -// include end. step defaults to 1. -// Values(v1, v2, ..., vN) - Yields values {v1, v2, ..., vN}. -// ValuesIn(container) - Yields values from a C-style array, an STL -// ValuesIn(begin,end) container, or an iterator range [begin, end). -// Bool() - Yields sequence {false, true}. -// Combine(g1, g2, ..., gN) - Yields all combinations (the Cartesian product -// for the math savvy) of the values generated -// by the N generators. -// -// For more details, see comments at the definitions of these functions below -// in this file. -// -// The following statement will instantiate tests from the FooTest test case -// each with parameter values "meeny", "miny", and "moe". - -INSTANTIATE_TEST_CASE_P(InstantiationName, - FooTest, - Values("meeny", "miny", "moe")); - -// To distinguish different instances of the pattern, (yes, you -// can instantiate it more then once) the first argument to the -// INSTANTIATE_TEST_CASE_P macro is a prefix that will be added to the -// actual test case name. Remember to pick unique prefixes for different -// instantiations. The tests from the instantiation above will have -// these names: -// -// * InstantiationName/FooTest.DoesBlah/0 for "meeny" -// * InstantiationName/FooTest.DoesBlah/1 for "miny" -// * InstantiationName/FooTest.DoesBlah/2 for "moe" -// * InstantiationName/FooTest.HasBlahBlah/0 for "meeny" -// * InstantiationName/FooTest.HasBlahBlah/1 for "miny" -// * InstantiationName/FooTest.HasBlahBlah/2 for "moe" -// -// You can use these names in --gtest_filter. -// -// This statement will instantiate all tests from FooTest again, each -// with parameter values "cat" and "dog": - -const char* pets[] = {"cat", "dog"}; -INSTANTIATE_TEST_CASE_P(AnotherInstantiationName, FooTest, ValuesIn(pets)); - -// The tests from the instantiation above will have these names: -// -// * AnotherInstantiationName/FooTest.DoesBlah/0 for "cat" -// * AnotherInstantiationName/FooTest.DoesBlah/1 for "dog" -// * AnotherInstantiationName/FooTest.HasBlahBlah/0 for "cat" -// * AnotherInstantiationName/FooTest.HasBlahBlah/1 for "dog" -// -// Please note that INSTANTIATE_TEST_CASE_P will instantiate all tests -// in the given test case, whether their definitions come before or -// AFTER the INSTANTIATE_TEST_CASE_P statement. -// -// Please also note that generator expressions (including parameters to the -// generators) are evaluated in InitGoogleTest(), after main() has started. -// This allows the user on one hand, to adjust generator parameters in order -// to dynamically determine a set of tests to run and on the other hand, -// give the user a chance to inspect the generated tests with Google Test -// reflection API before RUN_ALL_TESTS() is executed. -// -// You can see samples/sample7_unittest.cc and samples/sample8_unittest.cc -// for more examples. -// -// In the future, we plan to publish the API for defining new parameter -// generators. But for now this interface remains part of the internal -// implementation and is subject to change. -// -// -// A parameterized test fixture must be derived from testing::Test and from -// testing::WithParamInterface, where T is the type of the parameter -// values. Inheriting from TestWithParam satisfies that requirement because -// TestWithParam inherits from both Test and WithParamInterface. In more -// complicated hierarchies, however, it is occasionally useful to inherit -// separately from Test and WithParamInterface. For example: - -class BaseTest : public ::testing::Test { - // You can inherit all the usual members for a non-parameterized test - // fixture here. -}; - -class DerivedTest : public BaseTest, public ::testing::WithParamInterface { - // The usual test fixture members go here too. -}; - -TEST_F(BaseTest, HasFoo) { - // This is an ordinary non-parameterized test. -} - -TEST_P(DerivedTest, DoesBlah) { - // GetParam works just the same here as if you inherit from TestWithParam. - EXPECT_TRUE(foo.Blah(GetParam())); -} - -#endif // 0 - - -#if !GTEST_OS_SYMBIAN -# include -#endif - -// scripts/fuse_gtest.py depends on gtest's own header being #included -// *unconditionally*. Therefore these #includes cannot be moved -// inside #if GTEST_HAS_PARAM_TEST. -// Copyright 2008 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. -// -// Author: vladl@google.com (Vlad Losev) - -// Type and function utilities for implementing parameterized tests. - -#ifndef GTEST_INCLUDE_GTEST_INTERNAL_GTEST_PARAM_UTIL_H_ -#define GTEST_INCLUDE_GTEST_INTERNAL_GTEST_PARAM_UTIL_H_ - -#include -#include -#include - -// scripts/fuse_gtest.py depends on gtest's own header being #included -// *unconditionally*. Therefore these #includes cannot be moved -// inside #if GTEST_HAS_PARAM_TEST. -// 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) -// -// A "smart" pointer type with reference tracking. Every pointer to a -// particular object is kept on a circular linked list. When the last pointer -// to an object is destroyed or reassigned, the object is deleted. -// -// Used properly, this deletes the object when the last reference goes away. -// There are several caveats: -// - Like all reference counting schemes, cycles lead to leaks. -// - Each smart pointer is actually two pointers (8 bytes instead of 4). -// - Every time a pointer is assigned, the entire list of pointers to that -// object is traversed. This class is therefore NOT SUITABLE when there -// will often be more than two or three pointers to a particular object. -// - References are only tracked as long as linked_ptr<> objects are copied. -// If a linked_ptr<> is converted to a raw pointer and back, BAD THINGS -// will happen (double deletion). -// -// A good use of this class is storing object references in STL containers. -// You can safely put linked_ptr<> in a vector<>. -// Other uses may not be as good. -// -// Note: If you use an incomplete type with linked_ptr<>, the class -// *containing* linked_ptr<> must have a constructor and destructor (even -// if they do nothing!). -// -// Bill Gibbons suggested we use something like this. -// -// Thread Safety: -// Unlike other linked_ptr implementations, in this implementation -// a linked_ptr object is thread-safe in the sense that: -// - it's safe to copy linked_ptr objects concurrently, -// - it's safe to copy *from* a linked_ptr and read its underlying -// raw pointer (e.g. via get()) concurrently, and -// - it's safe to write to two linked_ptrs that point to the same -// shared object concurrently. -// TODO(wan@google.com): rename this to safe_linked_ptr to avoid -// confusion with normal linked_ptr. - -#ifndef GTEST_INCLUDE_GTEST_INTERNAL_GTEST_LINKED_PTR_H_ -#define GTEST_INCLUDE_GTEST_INTERNAL_GTEST_LINKED_PTR_H_ - -#include -#include - - -namespace testing { -namespace internal { - -// Protects copying of all linked_ptr objects. -GTEST_API_ GTEST_DECLARE_STATIC_MUTEX_(g_linked_ptr_mutex); - -// This is used internally by all instances of linked_ptr<>. It needs to be -// a non-template class because different types of linked_ptr<> can refer to -// the same object (linked_ptr(obj) vs linked_ptr(obj)). -// So, it needs to be possible for different types of linked_ptr to participate -// in the same circular linked list, so we need a single class type here. -// -// DO NOT USE THIS CLASS DIRECTLY YOURSELF. Use linked_ptr. -class linked_ptr_internal { - public: - // Create a new circle that includes only this instance. - void join_new() { - next_ = this; - } - - // Many linked_ptr operations may change p.link_ for some linked_ptr - // variable p in the same circle as this object. Therefore we need - // to prevent two such operations from occurring concurrently. - // - // Note that different types of linked_ptr objects can coexist in a - // circle (e.g. linked_ptr, linked_ptr, and - // linked_ptr). Therefore we must use a single mutex to - // protect all linked_ptr objects. This can create serious - // contention in production code, but is acceptable in a testing - // framework. - - // Join an existing circle. - // L < g_linked_ptr_mutex - void join(linked_ptr_internal const* ptr) { - MutexLock lock(&g_linked_ptr_mutex); - - linked_ptr_internal const* p = ptr; - while (p->next_ != ptr) p = p->next_; - p->next_ = this; - next_ = ptr; - } - - // Leave whatever circle we're part of. Returns true if we were the - // last member of the circle. Once this is done, you can join() another. - // L < g_linked_ptr_mutex - bool depart() { - MutexLock lock(&g_linked_ptr_mutex); - - if (next_ == this) return true; - linked_ptr_internal const* p = next_; - while (p->next_ != this) p = p->next_; - p->next_ = next_; - return false; - } - - private: - mutable linked_ptr_internal const* next_; -}; - -template -class linked_ptr { - public: - typedef T element_type; - - // Take over ownership of a raw pointer. This should happen as soon as - // possible after the object is created. - explicit linked_ptr(T* ptr = NULL) { capture(ptr); } - ~linked_ptr() { depart(); } - - // Copy an existing linked_ptr<>, adding ourselves to the list of references. - template linked_ptr(linked_ptr const& ptr) { copy(&ptr); } - linked_ptr(linked_ptr const& ptr) { // NOLINT - assert(&ptr != this); - copy(&ptr); - } - - // Assignment releases the old value and acquires the new. - template linked_ptr& operator=(linked_ptr const& ptr) { - depart(); - copy(&ptr); - return *this; - } - - linked_ptr& operator=(linked_ptr const& ptr) { - if (&ptr != this) { - depart(); - copy(&ptr); - } - return *this; - } - - // Smart pointer members. - void reset(T* ptr = NULL) { - depart(); - capture(ptr); - } - T* get() const { return value_; } - T* operator->() const { return value_; } - T& operator*() const { return *value_; } - - bool operator==(T* p) const { return value_ == p; } - bool operator!=(T* p) const { return value_ != p; } - template - bool operator==(linked_ptr const& ptr) const { - return value_ == ptr.get(); - } - template - bool operator!=(linked_ptr const& ptr) const { - return value_ != ptr.get(); - } - - private: - template - friend class linked_ptr; - - T* value_; - linked_ptr_internal link_; - - void depart() { - if (link_.depart()) delete value_; - } - - void capture(T* ptr) { - value_ = ptr; - link_.join_new(); - } - - template void copy(linked_ptr const* ptr) { - value_ = ptr->get(); - if (value_) - link_.join(&ptr->link_); - else - link_.join_new(); - } -}; - -template inline -bool operator==(T* ptr, const linked_ptr& x) { - return ptr == x.get(); -} - -template inline -bool operator!=(T* ptr, const linked_ptr& x) { - return ptr != x.get(); -} - -// A function to convert T* into linked_ptr -// Doing e.g. make_linked_ptr(new FooBarBaz(arg)) is a shorter notation -// for linked_ptr >(new FooBarBaz(arg)) -template -linked_ptr make_linked_ptr(T* ptr) { - return linked_ptr(ptr); -} - -} // namespace internal -} // namespace testing - -#endif // GTEST_INCLUDE_GTEST_INTERNAL_GTEST_LINKED_PTR_H_ -// Copyright 2007, 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. -// -// Author: wan@google.com (Zhanyong Wan) - -// Google Test - The Google C++ Testing Framework -// -// This file implements a universal value printer that can print a -// value of any type T: -// -// void ::testing::internal::UniversalPrinter::Print(value, ostream_ptr); -// -// A user can teach this function how to print a class type T by -// defining either operator<<() or PrintTo() in the namespace that -// defines T. More specifically, the FIRST defined function in the -// following list will be used (assuming T is defined in namespace -// foo): -// -// 1. foo::PrintTo(const T&, ostream*) -// 2. operator<<(ostream&, const T&) defined in either foo or the -// global namespace. -// -// If none of the above is defined, it will print the debug string of -// the value if it is a protocol buffer, or print the raw bytes in the -// value otherwise. -// -// To aid debugging: when T is a reference type, the address of the -// value is also printed; when T is a (const) char pointer, both the -// pointer value and the NUL-terminated string it points to are -// printed. -// -// We also provide some convenient wrappers: -// -// // Prints a value to a string. For a (const or not) char -// // pointer, the NUL-terminated string (but not the pointer) is -// // printed. -// std::string ::testing::PrintToString(const T& value); -// -// // Prints a value tersely: for a reference type, the referenced -// // value (but not the address) is printed; for a (const or not) char -// // pointer, the NUL-terminated string (but not the pointer) is -// // printed. -// void ::testing::internal::UniversalTersePrint(const T& value, ostream*); -// -// // Prints value using the type inferred by the compiler. The difference -// // from UniversalTersePrint() is that this function prints both the -// // pointer and the NUL-terminated string for a (const or not) char pointer. -// void ::testing::internal::UniversalPrint(const T& value, ostream*); -// -// // Prints the fields of a tuple tersely to a string vector, one -// // element for each field. Tuple support must be enabled in -// // gtest-port.h. -// std::vector UniversalTersePrintTupleFieldsToStrings( -// const Tuple& value); -// -// Known limitation: -// -// The print primitives print the elements of an STL-style container -// using the compiler-inferred type of *iter where iter is a -// const_iterator of the container. When const_iterator is an input -// iterator but not a forward iterator, this inferred type may not -// match value_type, and the print output may be incorrect. In -// practice, this is rarely a problem as for most containers -// const_iterator is a forward iterator. We'll fix this if there's an -// actual need for it. Note that this fix cannot rely on value_type -// being defined as many user-defined container types don't have -// value_type. - -#ifndef GTEST_INCLUDE_GTEST_GTEST_PRINTERS_H_ -#define GTEST_INCLUDE_GTEST_GTEST_PRINTERS_H_ - -#include // NOLINT -#include -#include -#include -#include - -namespace testing { - -// Definitions in the 'internal' and 'internal2' name spaces are -// subject to change without notice. DO NOT USE THEM IN USER CODE! -namespace internal2 { - -// Prints the given number of bytes in the given object to the given -// ostream. -GTEST_API_ void PrintBytesInObjectTo(const unsigned char* obj_bytes, - size_t count, - ::std::ostream* os); - -// For selecting which printer to use when a given type has neither << -// nor PrintTo(). -enum TypeKind { - kProtobuf, // a protobuf type - kConvertibleToInteger, // a type implicitly convertible to BiggestInt - // (e.g. a named or unnamed enum type) - kOtherType // anything else -}; - -// TypeWithoutFormatter::PrintValue(value, os) is called -// by the universal printer to print a value of type T when neither -// operator<< nor PrintTo() is defined for T, where kTypeKind is the -// "kind" of T as defined by enum TypeKind. -template -class TypeWithoutFormatter { - public: - // This default version is called when kTypeKind is kOtherType. - static void PrintValue(const T& value, ::std::ostream* os) { - PrintBytesInObjectTo(reinterpret_cast(&value), - sizeof(value), os); - } -}; - -// We print a protobuf using its ShortDebugString() when the string -// doesn't exceed this many characters; otherwise we print it using -// DebugString() for better readability. -const size_t kProtobufOneLinerMaxLength = 50; - -template -class TypeWithoutFormatter { - public: - static void PrintValue(const T& value, ::std::ostream* os) { - const ::testing::internal::string short_str = value.ShortDebugString(); - const ::testing::internal::string pretty_str = - short_str.length() <= kProtobufOneLinerMaxLength ? - short_str : ("\n" + value.DebugString()); - *os << ("<" + pretty_str + ">"); - } -}; - -template -class TypeWithoutFormatter { - public: - // Since T has no << operator or PrintTo() but can be implicitly - // converted to BiggestInt, we print it as a BiggestInt. - // - // Most likely T is an enum type (either named or unnamed), in which - // case printing it as an integer is the desired behavior. In case - // T is not an enum, printing it as an integer is the best we can do - // given that it has no user-defined printer. - static void PrintValue(const T& value, ::std::ostream* os) { - const internal::BiggestInt kBigInt = value; - *os << kBigInt; - } -}; - -// Prints the given value to the given ostream. If the value is a -// protocol message, its debug string is printed; if it's an enum or -// of a type implicitly convertible to BiggestInt, it's printed as an -// integer; otherwise the bytes in the value are printed. This is -// what UniversalPrinter::Print() does when it knows nothing about -// type T and T has neither << operator nor PrintTo(). -// -// A user can override this behavior for a class type Foo by defining -// a << operator in the namespace where Foo is defined. -// -// We put this operator in namespace 'internal2' instead of 'internal' -// to simplify the implementation, as much code in 'internal' needs to -// use << in STL, which would conflict with our own << were it defined -// in 'internal'. -// -// Note that this operator<< takes a generic std::basic_ostream type instead of the more restricted std::ostream. If -// we define it to take an std::ostream instead, we'll get an -// "ambiguous overloads" compiler error when trying to print a type -// Foo that supports streaming to std::basic_ostream, as the compiler cannot tell whether -// operator<<(std::ostream&, const T&) or -// operator<<(std::basic_stream, const Foo&) is more -// specific. -template -::std::basic_ostream& operator<<( - ::std::basic_ostream& os, const T& x) { - TypeWithoutFormatter::value ? kProtobuf : - internal::ImplicitlyConvertible::value ? - kConvertibleToInteger : kOtherType)>::PrintValue(x, &os); - return os; -} - -} // namespace internal2 -} // namespace testing - -// This namespace MUST NOT BE NESTED IN ::testing, or the name look-up -// magic needed for implementing UniversalPrinter won't work. -namespace testing_internal { - -// Used to print a value that is not an STL-style container when the -// user doesn't define PrintTo() for it. -template -void DefaultPrintNonContainerTo(const T& value, ::std::ostream* os) { - // With the following statement, during unqualified name lookup, - // testing::internal2::operator<< appears as if it was declared in - // the nearest enclosing namespace that contains both - // ::testing_internal and ::testing::internal2, i.e. the global - // namespace. For more details, refer to the C++ Standard section - // 7.3.4-1 [namespace.udir]. This allows us to fall back onto - // testing::internal2::operator<< in case T doesn't come with a << - // operator. - // - // We cannot write 'using ::testing::internal2::operator<<;', which - // gcc 3.3 fails to compile due to a compiler bug. - using namespace ::testing::internal2; // NOLINT - - // Assuming T is defined in namespace foo, in the next statement, - // the compiler will consider all of: - // - // 1. foo::operator<< (thanks to Koenig look-up), - // 2. ::operator<< (as the current namespace is enclosed in ::), - // 3. testing::internal2::operator<< (thanks to the using statement above). - // - // The operator<< whose type matches T best will be picked. - // - // We deliberately allow #2 to be a candidate, as sometimes it's - // impossible to define #1 (e.g. when foo is ::std, defining - // anything in it is undefined behavior unless you are a compiler - // vendor.). - *os << value; -} - -} // namespace testing_internal - -namespace testing { -namespace internal { - -// UniversalPrinter::Print(value, ostream_ptr) prints the given -// value to the given ostream. The caller must ensure that -// 'ostream_ptr' is not NULL, or the behavior is undefined. -// -// We define UniversalPrinter as a class template (as opposed to a -// function template), as we need to partially specialize it for -// reference types, which cannot be done with function templates. -template -class UniversalPrinter; - -template -void UniversalPrint(const T& value, ::std::ostream* os); - -// Used to print an STL-style container when the user doesn't define -// a PrintTo() for it. -template -void DefaultPrintTo(IsContainer /* dummy */, - false_type /* is not a pointer */, - const C& container, ::std::ostream* os) { - const size_t kMaxCount = 32; // The maximum number of elements to print. - *os << '{'; - size_t count = 0; - for (typename C::const_iterator it = container.begin(); - it != container.end(); ++it, ++count) { - if (count > 0) { - *os << ','; - if (count == kMaxCount) { // Enough has been printed. - *os << " ..."; - break; - } - } - *os << ' '; - // We cannot call PrintTo(*it, os) here as PrintTo() doesn't - // handle *it being a native array. - internal::UniversalPrint(*it, os); - } - - if (count > 0) { - *os << ' '; - } - *os << '}'; -} - -// Used to print a pointer that is neither a char pointer nor a member -// pointer, when the user doesn't define PrintTo() for it. (A member -// variable pointer or member function pointer doesn't really point to -// a location in the address space. Their representation is -// implementation-defined. Therefore they will be printed as raw -// bytes.) -template -void DefaultPrintTo(IsNotContainer /* dummy */, - true_type /* is a pointer */, - T* p, ::std::ostream* os) { - if (p == NULL) { - *os << "NULL"; - } else { - // C++ doesn't allow casting from a function pointer to any object - // pointer. - // - // IsTrue() silences warnings: "Condition is always true", - // "unreachable code". - if (IsTrue(ImplicitlyConvertible::value)) { - // T is not a function type. We just call << to print p, - // relying on ADL to pick up user-defined << for their pointer - // types, if any. - *os << p; - } else { - // T is a function type, so '*os << p' doesn't do what we want - // (it just prints p as bool). We want to print p as a const - // void*. However, we cannot cast it to const void* directly, - // even using reinterpret_cast, as earlier versions of gcc - // (e.g. 3.4.5) cannot compile the cast when p is a function - // pointer. Casting to UInt64 first solves the problem. - *os << reinterpret_cast( - reinterpret_cast(p)); - } - } -} - -// Used to print a non-container, non-pointer value when the user -// doesn't define PrintTo() for it. -template -void DefaultPrintTo(IsNotContainer /* dummy */, - false_type /* is not a pointer */, - const T& value, ::std::ostream* os) { - ::testing_internal::DefaultPrintNonContainerTo(value, os); -} - -// Prints the given value using the << operator if it has one; -// otherwise prints the bytes in it. This is what -// UniversalPrinter::Print() does when PrintTo() is not specialized -// or overloaded for type T. -// -// A user can override this behavior for a class type Foo by defining -// an overload of PrintTo() in the namespace where Foo is defined. We -// give the user this option as sometimes defining a << operator for -// Foo is not desirable (e.g. the coding style may prevent doing it, -// or there is already a << operator but it doesn't do what the user -// wants). -template -void PrintTo(const T& value, ::std::ostream* os) { - // DefaultPrintTo() is overloaded. The type of its first two - // arguments determine which version will be picked. If T is an - // STL-style container, the version for container will be called; if - // T is a pointer, the pointer version will be called; otherwise the - // generic version will be called. - // - // Note that we check for container types here, prior to we check - // for protocol message types in our operator<<. The rationale is: - // - // For protocol messages, we want to give people a chance to - // override Google Mock's format by defining a PrintTo() or - // operator<<. For STL containers, other formats can be - // incompatible with Google Mock's format for the container - // elements; therefore we check for container types here to ensure - // that our format is used. - // - // The second argument of DefaultPrintTo() is needed to bypass a bug - // in Symbian's C++ compiler that prevents it from picking the right - // overload between: - // - // PrintTo(const T& x, ...); - // PrintTo(T* x, ...); - DefaultPrintTo(IsContainerTest(0), is_pointer(), value, os); -} - -// The following list of PrintTo() overloads tells -// UniversalPrinter::Print() how to print standard types (built-in -// types, strings, plain arrays, and pointers). - -// Overloads for various char types. -GTEST_API_ void PrintTo(unsigned char c, ::std::ostream* os); -GTEST_API_ void PrintTo(signed char c, ::std::ostream* os); -inline void PrintTo(char c, ::std::ostream* os) { - // When printing a plain char, we always treat it as unsigned. This - // way, the output won't be affected by whether the compiler thinks - // char is signed or not. - PrintTo(static_cast(c), os); -} - -// Overloads for other simple built-in types. -inline void PrintTo(bool x, ::std::ostream* os) { - *os << (x ? "true" : "false"); -} - -// Overload for wchar_t type. -// Prints a wchar_t as a symbol if it is printable or as its internal -// code otherwise and also as its decimal code (except for L'\0'). -// The L'\0' char is printed as "L'\\0'". The decimal code is printed -// as signed integer when wchar_t is implemented by the compiler -// as a signed type and is printed as an unsigned integer when wchar_t -// is implemented as an unsigned type. -GTEST_API_ void PrintTo(wchar_t wc, ::std::ostream* os); - -// Overloads for C strings. -GTEST_API_ void PrintTo(const char* s, ::std::ostream* os); -inline void PrintTo(char* s, ::std::ostream* os) { - PrintTo(ImplicitCast_(s), os); -} - -// signed/unsigned char is often used for representing binary data, so -// we print pointers to it as void* to be safe. -inline void PrintTo(const signed char* s, ::std::ostream* os) { - PrintTo(ImplicitCast_(s), os); -} -inline void PrintTo(signed char* s, ::std::ostream* os) { - PrintTo(ImplicitCast_(s), os); -} -inline void PrintTo(const unsigned char* s, ::std::ostream* os) { - PrintTo(ImplicitCast_(s), os); -} -inline void PrintTo(unsigned char* s, ::std::ostream* os) { - PrintTo(ImplicitCast_(s), os); -} - -// MSVC can be configured to define wchar_t as a typedef of unsigned -// short. It defines _NATIVE_WCHAR_T_DEFINED when wchar_t is a native -// type. When wchar_t is a typedef, defining an overload for const -// wchar_t* would cause unsigned short* be printed as a wide string, -// possibly causing invalid memory accesses. -#if !defined(_MSC_VER) || defined(_NATIVE_WCHAR_T_DEFINED) -// Overloads for wide C strings -GTEST_API_ void PrintTo(const wchar_t* s, ::std::ostream* os); -inline void PrintTo(wchar_t* s, ::std::ostream* os) { - PrintTo(ImplicitCast_(s), os); -} -#endif - -// Overload for C arrays. Multi-dimensional arrays are printed -// properly. - -// Prints the given number of elements in an array, without printing -// the curly braces. -template -void PrintRawArrayTo(const T a[], size_t count, ::std::ostream* os) { - UniversalPrint(a[0], os); - for (size_t i = 1; i != count; i++) { - *os << ", "; - UniversalPrint(a[i], os); - } -} - -// Overloads for ::string and ::std::string. -#if GTEST_HAS_GLOBAL_STRING -GTEST_API_ void PrintStringTo(const ::string&s, ::std::ostream* os); -inline void PrintTo(const ::string& s, ::std::ostream* os) { - PrintStringTo(s, os); -} -#endif // GTEST_HAS_GLOBAL_STRING - -GTEST_API_ void PrintStringTo(const ::std::string&s, ::std::ostream* os); -inline void PrintTo(const ::std::string& s, ::std::ostream* os) { - PrintStringTo(s, os); -} - -// Overloads for ::wstring and ::std::wstring. -#if GTEST_HAS_GLOBAL_WSTRING -GTEST_API_ void PrintWideStringTo(const ::wstring&s, ::std::ostream* os); -inline void PrintTo(const ::wstring& s, ::std::ostream* os) { - PrintWideStringTo(s, os); -} -#endif // GTEST_HAS_GLOBAL_WSTRING - -#if GTEST_HAS_STD_WSTRING -GTEST_API_ void PrintWideStringTo(const ::std::wstring&s, ::std::ostream* os); -inline void PrintTo(const ::std::wstring& s, ::std::ostream* os) { - PrintWideStringTo(s, os); -} -#endif // GTEST_HAS_STD_WSTRING - -#if GTEST_HAS_TR1_TUPLE -// Overload for ::std::tr1::tuple. Needed for printing function arguments, -// which are packed as tuples. - -// Helper function for printing a tuple. T must be instantiated with -// a tuple type. -template -void PrintTupleTo(const T& t, ::std::ostream* os); - -// Overloaded PrintTo() for tuples of various arities. We support -// tuples of up-to 10 fields. The following implementation works -// regardless of whether tr1::tuple is implemented using the -// non-standard variadic template feature or not. - -inline void PrintTo(const ::std::tr1::tuple<>& t, ::std::ostream* os) { - PrintTupleTo(t, os); -} - -template -void PrintTo(const ::std::tr1::tuple& t, ::std::ostream* os) { - PrintTupleTo(t, os); -} - -template -void PrintTo(const ::std::tr1::tuple& t, ::std::ostream* os) { - PrintTupleTo(t, os); -} - -template -void PrintTo(const ::std::tr1::tuple& t, ::std::ostream* os) { - PrintTupleTo(t, os); -} - -template -void PrintTo(const ::std::tr1::tuple& t, ::std::ostream* os) { - PrintTupleTo(t, os); -} - -template -void PrintTo(const ::std::tr1::tuple& t, - ::std::ostream* os) { - PrintTupleTo(t, os); -} - -template -void PrintTo(const ::std::tr1::tuple& t, - ::std::ostream* os) { - PrintTupleTo(t, os); -} - -template -void PrintTo(const ::std::tr1::tuple& t, - ::std::ostream* os) { - PrintTupleTo(t, os); -} - -template -void PrintTo(const ::std::tr1::tuple& t, - ::std::ostream* os) { - PrintTupleTo(t, os); -} - -template -void PrintTo(const ::std::tr1::tuple& t, - ::std::ostream* os) { - PrintTupleTo(t, os); -} - -template -void PrintTo( - const ::std::tr1::tuple& t, - ::std::ostream* os) { - PrintTupleTo(t, os); -} -#endif // GTEST_HAS_TR1_TUPLE - -// Overload for std::pair. -template -void PrintTo(const ::std::pair& value, ::std::ostream* os) { - *os << '('; - // We cannot use UniversalPrint(value.first, os) here, as T1 may be - // a reference type. The same for printing value.second. - UniversalPrinter::Print(value.first, os); - *os << ", "; - UniversalPrinter::Print(value.second, os); - *os << ')'; -} - -// Implements printing a non-reference type T by letting the compiler -// pick the right overload of PrintTo() for T. -template -class UniversalPrinter { - public: - // MSVC warns about adding const to a function type, so we want to - // disable the warning. -#ifdef _MSC_VER -# pragma warning(push) // Saves the current warning state. -# pragma warning(disable:4180) // Temporarily disables warning 4180. -#endif // _MSC_VER - - // Note: we deliberately don't call this PrintTo(), as that name - // conflicts with ::testing::internal::PrintTo in the body of the - // function. - static void Print(const T& value, ::std::ostream* os) { - // By default, ::testing::internal::PrintTo() is used for printing - // the value. - // - // Thanks to Koenig look-up, if T is a class and has its own - // PrintTo() function defined in its namespace, that function will - // be visible here. Since it is more specific than the generic ones - // in ::testing::internal, it will be picked by the compiler in the - // following statement - exactly what we want. - PrintTo(value, os); - } - -#ifdef _MSC_VER -# pragma warning(pop) // Restores the warning state. -#endif // _MSC_VER -}; - -// UniversalPrintArray(begin, len, os) prints an array of 'len' -// elements, starting at address 'begin'. -template -void UniversalPrintArray(const T* begin, size_t len, ::std::ostream* os) { - if (len == 0) { - *os << "{}"; - } else { - *os << "{ "; - const size_t kThreshold = 18; - const size_t kChunkSize = 8; - // If the array has more than kThreshold elements, we'll have to - // omit some details by printing only the first and the last - // kChunkSize elements. - // TODO(wan@google.com): let the user control the threshold using a flag. - if (len <= kThreshold) { - PrintRawArrayTo(begin, len, os); - } else { - PrintRawArrayTo(begin, kChunkSize, os); - *os << ", ..., "; - PrintRawArrayTo(begin + len - kChunkSize, kChunkSize, os); - } - *os << " }"; - } -} -// This overload prints a (const) char array compactly. -GTEST_API_ void UniversalPrintArray(const char* begin, - size_t len, - ::std::ostream* os); - -// Implements printing an array type T[N]. -template -class UniversalPrinter { - public: - // Prints the given array, omitting some elements when there are too - // many. - static void Print(const T (&a)[N], ::std::ostream* os) { - UniversalPrintArray(a, N, os); - } -}; - -// Implements printing a reference type T&. -template -class UniversalPrinter { - public: - // MSVC warns about adding const to a function type, so we want to - // disable the warning. -#ifdef _MSC_VER -# pragma warning(push) // Saves the current warning state. -# pragma warning(disable:4180) // Temporarily disables warning 4180. -#endif // _MSC_VER - - static void Print(const T& value, ::std::ostream* os) { - // Prints the address of the value. We use reinterpret_cast here - // as static_cast doesn't compile when T is a function type. - *os << "@" << reinterpret_cast(&value) << " "; - - // Then prints the value itself. - UniversalPrint(value, os); - } - -#ifdef _MSC_VER -# pragma warning(pop) // Restores the warning state. -#endif // _MSC_VER -}; - -// Prints a value tersely: for a reference type, the referenced value -// (but not the address) is printed; for a (const) char pointer, the -// NUL-terminated string (but not the pointer) is printed. -template -void UniversalTersePrint(const T& value, ::std::ostream* os) { - UniversalPrint(value, os); -} -inline void UniversalTersePrint(const char* str, ::std::ostream* os) { - if (str == NULL) { - *os << "NULL"; - } else { - UniversalPrint(string(str), os); - } -} -inline void UniversalTersePrint(char* str, ::std::ostream* os) { - UniversalTersePrint(static_cast(str), os); -} - -// Prints a value using the type inferred by the compiler. The -// difference between this and UniversalTersePrint() is that for a -// (const) char pointer, this prints both the pointer and the -// NUL-terminated string. -template -void UniversalPrint(const T& value, ::std::ostream* os) { - UniversalPrinter::Print(value, os); -} - -#if GTEST_HAS_TR1_TUPLE -typedef ::std::vector Strings; - -// This helper template allows PrintTo() for tuples and -// UniversalTersePrintTupleFieldsToStrings() to be defined by -// induction on the number of tuple fields. The idea is that -// TuplePrefixPrinter::PrintPrefixTo(t, os) prints the first N -// fields in tuple t, and can be defined in terms of -// TuplePrefixPrinter. - -// The inductive case. -template -struct TuplePrefixPrinter { - // Prints the first N fields of a tuple. - template - static void PrintPrefixTo(const Tuple& t, ::std::ostream* os) { - TuplePrefixPrinter::PrintPrefixTo(t, os); - *os << ", "; - UniversalPrinter::type> - ::Print(::std::tr1::get(t), os); - } - - // Tersely prints the first N fields of a tuple to a string vector, - // one element for each field. - template - static void TersePrintPrefixToStrings(const Tuple& t, Strings* strings) { - TuplePrefixPrinter::TersePrintPrefixToStrings(t, strings); - ::std::stringstream ss; - UniversalTersePrint(::std::tr1::get(t), &ss); - strings->push_back(ss.str()); - } -}; - -// Base cases. -template <> -struct TuplePrefixPrinter<0> { - template - static void PrintPrefixTo(const Tuple&, ::std::ostream*) {} - - template - static void TersePrintPrefixToStrings(const Tuple&, Strings*) {} -}; -// We have to specialize the entire TuplePrefixPrinter<> class -// template here, even though the definition of -// TersePrintPrefixToStrings() is the same as the generic version, as -// Embarcadero (formerly CodeGear, formerly Borland) C++ doesn't -// support specializing a method template of a class template. -template <> -struct TuplePrefixPrinter<1> { - template - static void PrintPrefixTo(const Tuple& t, ::std::ostream* os) { - UniversalPrinter::type>:: - Print(::std::tr1::get<0>(t), os); - } - - template - static void TersePrintPrefixToStrings(const Tuple& t, Strings* strings) { - ::std::stringstream ss; - UniversalTersePrint(::std::tr1::get<0>(t), &ss); - strings->push_back(ss.str()); - } -}; - -// Helper function for printing a tuple. T must be instantiated with -// a tuple type. -template -void PrintTupleTo(const T& t, ::std::ostream* os) { - *os << "("; - TuplePrefixPrinter< ::std::tr1::tuple_size::value>:: - PrintPrefixTo(t, os); - *os << ")"; -} - -// Prints the fields of a tuple tersely to a string vector, one -// element for each field. See the comment before -// UniversalTersePrint() for how we define "tersely". -template -Strings UniversalTersePrintTupleFieldsToStrings(const Tuple& value) { - Strings result; - TuplePrefixPrinter< ::std::tr1::tuple_size::value>:: - TersePrintPrefixToStrings(value, &result); - return result; -} -#endif // GTEST_HAS_TR1_TUPLE - -} // namespace internal - -template -::std::string PrintToString(const T& value) { - ::std::stringstream ss; - internal::UniversalTersePrint(value, &ss); - return ss.str(); -} - -} // namespace testing - -#endif // GTEST_INCLUDE_GTEST_GTEST_PRINTERS_H_ - -#if GTEST_HAS_PARAM_TEST - -namespace testing { -namespace internal { - -// INTERNAL IMPLEMENTATION - DO NOT USE IN USER CODE. -// -// Outputs a message explaining invalid registration of different -// fixture class for the same test case. This may happen when -// TEST_P macro is used to define two tests with the same name -// but in different namespaces. -GTEST_API_ void ReportInvalidTestCaseType(const char* test_case_name, - const char* file, int line); - -template class ParamGeneratorInterface; -template class ParamGenerator; - -// Interface for iterating over elements provided by an implementation -// of ParamGeneratorInterface. -template -class ParamIteratorInterface { - public: - virtual ~ParamIteratorInterface() {} - // A pointer to the base generator instance. - // Used only for the purposes of iterator comparison - // to make sure that two iterators belong to the same generator. - virtual const ParamGeneratorInterface* BaseGenerator() const = 0; - // Advances iterator to point to the next element - // provided by the generator. The caller is responsible - // for not calling Advance() on an iterator equal to - // BaseGenerator()->End(). - virtual void Advance() = 0; - // Clones the iterator object. Used for implementing copy semantics - // of ParamIterator. - virtual ParamIteratorInterface* Clone() const = 0; - // Dereferences the current iterator and provides (read-only) access - // to the pointed value. It is the caller's responsibility not to call - // Current() on an iterator equal to BaseGenerator()->End(). - // Used for implementing ParamGenerator::operator*(). - virtual const T* Current() const = 0; - // Determines whether the given iterator and other point to the same - // element in the sequence generated by the generator. - // Used for implementing ParamGenerator::operator==(). - virtual bool Equals(const ParamIteratorInterface& other) const = 0; -}; - -// Class iterating over elements provided by an implementation of -// ParamGeneratorInterface. It wraps ParamIteratorInterface -// and implements the const forward iterator concept. -template -class ParamIterator { - public: - typedef T value_type; - typedef const T& reference; - typedef ptrdiff_t difference_type; - - // ParamIterator assumes ownership of the impl_ pointer. - ParamIterator(const ParamIterator& other) : impl_(other.impl_->Clone()) {} - ParamIterator& operator=(const ParamIterator& other) { - if (this != &other) - impl_.reset(other.impl_->Clone()); - return *this; - } - - const T& operator*() const { return *impl_->Current(); } - const T* operator->() const { return impl_->Current(); } - // Prefix version of operator++. - ParamIterator& operator++() { - impl_->Advance(); - return *this; - } - // Postfix version of operator++. - ParamIterator operator++(int /*unused*/) { - ParamIteratorInterface* clone = impl_->Clone(); - impl_->Advance(); - return ParamIterator(clone); - } - bool operator==(const ParamIterator& other) const { - return impl_.get() == other.impl_.get() || impl_->Equals(*other.impl_); - } - bool operator!=(const ParamIterator& other) const { - return !(*this == other); - } - - private: - friend class ParamGenerator; - explicit ParamIterator(ParamIteratorInterface* impl) : impl_(impl) {} - scoped_ptr > impl_; -}; - -// ParamGeneratorInterface is the binary interface to access generators -// defined in other translation units. -template -class ParamGeneratorInterface { - public: - typedef T ParamType; - - virtual ~ParamGeneratorInterface() {} - - // Generator interface definition - virtual ParamIteratorInterface* Begin() const = 0; - virtual ParamIteratorInterface* End() const = 0; -}; - -// Wraps ParamGeneratorInterface and provides general generator syntax -// compatible with the STL Container concept. -// This class implements copy initialization semantics and the contained -// ParamGeneratorInterface instance is shared among all copies -// of the original object. This is possible because that instance is immutable. -template -class ParamGenerator { - public: - typedef ParamIterator iterator; - - explicit ParamGenerator(ParamGeneratorInterface* impl) : impl_(impl) {} - ParamGenerator(const ParamGenerator& other) : impl_(other.impl_) {} - - ParamGenerator& operator=(const ParamGenerator& other) { - impl_ = other.impl_; - return *this; - } - - iterator begin() const { return iterator(impl_->Begin()); } - iterator end() const { return iterator(impl_->End()); } - - private: - linked_ptr > impl_; -}; - -// Generates values from a range of two comparable values. Can be used to -// generate sequences of user-defined types that implement operator+() and -// operator<(). -// This class is used in the Range() function. -template -class RangeGenerator : public ParamGeneratorInterface { - public: - RangeGenerator(T begin, T end, IncrementT step) - : begin_(begin), end_(end), - step_(step), end_index_(CalculateEndIndex(begin, end, step)) {} - virtual ~RangeGenerator() {} - - virtual ParamIteratorInterface* Begin() const { - return new Iterator(this, begin_, 0, step_); - } - virtual ParamIteratorInterface* End() const { - return new Iterator(this, end_, end_index_, step_); - } - - private: - class Iterator : public ParamIteratorInterface { - public: - Iterator(const ParamGeneratorInterface* base, T value, int index, - IncrementT step) - : base_(base), value_(value), index_(index), step_(step) {} - virtual ~Iterator() {} - - virtual const ParamGeneratorInterface* BaseGenerator() const { - return base_; - } - virtual void Advance() { - value_ = value_ + step_; - index_++; - } - virtual ParamIteratorInterface* Clone() const { - return new Iterator(*this); - } - virtual const T* Current() const { return &value_; } - virtual bool Equals(const ParamIteratorInterface& other) const { - // Having the same base generator guarantees that the other - // iterator is of the same type and we can downcast. - GTEST_CHECK_(BaseGenerator() == other.BaseGenerator()) - << "The program attempted to compare iterators " - << "from different generators." << std::endl; - const int other_index = - CheckedDowncastToActualType(&other)->index_; - return index_ == other_index; - } - - private: - Iterator(const Iterator& other) - : ParamIteratorInterface(), - base_(other.base_), value_(other.value_), index_(other.index_), - step_(other.step_) {} - - // No implementation - assignment is unsupported. - void operator=(const Iterator& other); - - const ParamGeneratorInterface* const base_; - T value_; - int index_; - const IncrementT step_; - }; // class RangeGenerator::Iterator - - static int CalculateEndIndex(const T& begin, - const T& end, - const IncrementT& step) { - int end_index = 0; - for (T i = begin; i < end; i = i + step) - end_index++; - return end_index; - } - - // No implementation - assignment is unsupported. - void operator=(const RangeGenerator& other); - - const T begin_; - const T end_; - const IncrementT step_; - // The index for the end() iterator. All the elements in the generated - // sequence are indexed (0-based) to aid iterator comparison. - const int end_index_; -}; // class RangeGenerator - - -// Generates values from a pair of STL-style iterators. Used in the -// ValuesIn() function. The elements are copied from the source range -// since the source can be located on the stack, and the generator -// is likely to persist beyond that stack frame. -template -class ValuesInIteratorRangeGenerator : public ParamGeneratorInterface { - public: - template - ValuesInIteratorRangeGenerator(ForwardIterator begin, ForwardIterator end) - : container_(begin, end) {} - virtual ~ValuesInIteratorRangeGenerator() {} - - virtual ParamIteratorInterface* Begin() const { - return new Iterator(this, container_.begin()); - } - virtual ParamIteratorInterface* End() const { - return new Iterator(this, container_.end()); - } - - private: - typedef typename ::std::vector ContainerType; - - class Iterator : public ParamIteratorInterface { - public: - Iterator(const ParamGeneratorInterface* base, - typename ContainerType::const_iterator iterator) - : base_(base), iterator_(iterator) {} - virtual ~Iterator() {} - - virtual const ParamGeneratorInterface* BaseGenerator() const { - return base_; - } - virtual void Advance() { - ++iterator_; - value_.reset(); - } - virtual ParamIteratorInterface* Clone() const { - return new Iterator(*this); - } - // We need to use cached value referenced by iterator_ because *iterator_ - // can return a temporary object (and of type other then T), so just - // having "return &*iterator_;" doesn't work. - // value_ is updated here and not in Advance() because Advance() - // can advance iterator_ beyond the end of the range, and we cannot - // detect that fact. The client code, on the other hand, is - // responsible for not calling Current() on an out-of-range iterator. - virtual const T* Current() const { - if (value_.get() == NULL) - value_.reset(new T(*iterator_)); - return value_.get(); - } - virtual bool Equals(const ParamIteratorInterface& other) const { - // Having the same base generator guarantees that the other - // iterator is of the same type and we can downcast. - GTEST_CHECK_(BaseGenerator() == other.BaseGenerator()) - << "The program attempted to compare iterators " - << "from different generators." << std::endl; - return iterator_ == - CheckedDowncastToActualType(&other)->iterator_; - } - - private: - Iterator(const Iterator& other) - // The explicit constructor call suppresses a false warning - // emitted by gcc when supplied with the -Wextra option. - : ParamIteratorInterface(), - base_(other.base_), - iterator_(other.iterator_) {} - - const ParamGeneratorInterface* const base_; - typename ContainerType::const_iterator iterator_; - // A cached value of *iterator_. We keep it here to allow access by - // pointer in the wrapping iterator's operator->(). - // value_ needs to be mutable to be accessed in Current(). - // Use of scoped_ptr helps manage cached value's lifetime, - // which is bound by the lifespan of the iterator itself. - mutable scoped_ptr value_; - }; // class ValuesInIteratorRangeGenerator::Iterator - - // No implementation - assignment is unsupported. - void operator=(const ValuesInIteratorRangeGenerator& other); - - const ContainerType container_; -}; // class ValuesInIteratorRangeGenerator - -// INTERNAL IMPLEMENTATION - DO NOT USE IN USER CODE. -// -// Stores a parameter value and later creates tests parameterized with that -// value. -template -class ParameterizedTestFactory : public TestFactoryBase { - public: - typedef typename TestClass::ParamType ParamType; - explicit ParameterizedTestFactory(ParamType parameter) : - parameter_(parameter) {} - virtual Test* CreateTest() { - TestClass::SetParam(¶meter_); - return new TestClass(); - } - - private: - const ParamType parameter_; - - GTEST_DISALLOW_COPY_AND_ASSIGN_(ParameterizedTestFactory); -}; - -// INTERNAL IMPLEMENTATION - DO NOT USE IN USER CODE. -// -// TestMetaFactoryBase is a base class for meta-factories that create -// test factories for passing into MakeAndRegisterTestInfo function. -template -class TestMetaFactoryBase { - public: - virtual ~TestMetaFactoryBase() {} - - virtual TestFactoryBase* CreateTestFactory(ParamType parameter) = 0; -}; - -// INTERNAL IMPLEMENTATION - DO NOT USE IN USER CODE. -// -// TestMetaFactory creates test factories for passing into -// MakeAndRegisterTestInfo function. Since MakeAndRegisterTestInfo receives -// ownership of test factory pointer, same factory object cannot be passed -// into that method twice. But ParameterizedTestCaseInfo is going to call -// it for each Test/Parameter value combination. Thus it needs meta factory -// creator class. -template -class TestMetaFactory - : public TestMetaFactoryBase { - public: - typedef typename TestCase::ParamType ParamType; - - TestMetaFactory() {} - - virtual TestFactoryBase* CreateTestFactory(ParamType parameter) { - return new ParameterizedTestFactory(parameter); - } - - private: - GTEST_DISALLOW_COPY_AND_ASSIGN_(TestMetaFactory); -}; - -// INTERNAL IMPLEMENTATION - DO NOT USE IN USER CODE. -// -// ParameterizedTestCaseInfoBase is a generic interface -// to ParameterizedTestCaseInfo classes. ParameterizedTestCaseInfoBase -// accumulates test information provided by TEST_P macro invocations -// and generators provided by INSTANTIATE_TEST_CASE_P macro invocations -// and uses that information to register all resulting test instances -// in RegisterTests method. The ParameterizeTestCaseRegistry class holds -// a collection of pointers to the ParameterizedTestCaseInfo objects -// and calls RegisterTests() on each of them when asked. -class ParameterizedTestCaseInfoBase { - public: - virtual ~ParameterizedTestCaseInfoBase() {} - - // Base part of test case name for display purposes. - virtual const string& GetTestCaseName() const = 0; - // Test case id to verify identity. - virtual TypeId GetTestCaseTypeId() const = 0; - // UnitTest class invokes this method to register tests in this - // test case right before running them in RUN_ALL_TESTS macro. - // This method should not be called more then once on any single - // instance of a ParameterizedTestCaseInfoBase derived class. - virtual void RegisterTests() = 0; - - protected: - ParameterizedTestCaseInfoBase() {} - - private: - GTEST_DISALLOW_COPY_AND_ASSIGN_(ParameterizedTestCaseInfoBase); -}; - -// INTERNAL IMPLEMENTATION - DO NOT USE IN USER CODE. -// -// ParameterizedTestCaseInfo accumulates tests obtained from TEST_P -// macro invocations for a particular test case and generators -// obtained from INSTANTIATE_TEST_CASE_P macro invocations for that -// test case. It registers tests with all values generated by all -// generators when asked. -template -class ParameterizedTestCaseInfo : public ParameterizedTestCaseInfoBase { - public: - // ParamType and GeneratorCreationFunc are private types but are required - // for declarations of public methods AddTestPattern() and - // AddTestCaseInstantiation(). - typedef typename TestCase::ParamType ParamType; - // A function that returns an instance of appropriate generator type. - typedef ParamGenerator(GeneratorCreationFunc)(); - - explicit ParameterizedTestCaseInfo(const char* name) - : test_case_name_(name) {} - - // Test case base name for display purposes. - virtual const string& GetTestCaseName() const { return test_case_name_; } - // Test case id to verify identity. - virtual TypeId GetTestCaseTypeId() const { return GetTypeId(); } - // TEST_P macro uses AddTestPattern() to record information - // about a single test in a LocalTestInfo structure. - // test_case_name is the base name of the test case (without invocation - // prefix). test_base_name is the name of an individual test without - // parameter index. For the test SequenceA/FooTest.DoBar/1 FooTest is - // test case base name and DoBar is test base name. - void AddTestPattern(const char* test_case_name, - const char* test_base_name, - TestMetaFactoryBase* meta_factory) { - tests_.push_back(linked_ptr(new TestInfo(test_case_name, - test_base_name, - meta_factory))); - } - // INSTANTIATE_TEST_CASE_P macro uses AddGenerator() to record information - // about a generator. - int AddTestCaseInstantiation(const string& instantiation_name, - GeneratorCreationFunc* func, - const char* /* file */, - int /* line */) { - instantiations_.push_back(::std::make_pair(instantiation_name, func)); - return 0; // Return value used only to run this method in namespace scope. - } - // UnitTest class invokes this method to register tests in this test case - // test cases right before running tests in RUN_ALL_TESTS macro. - // This method should not be called more then once on any single - // instance of a ParameterizedTestCaseInfoBase derived class. - // UnitTest has a guard to prevent from calling this method more then once. - virtual void RegisterTests() { - for (typename TestInfoContainer::iterator test_it = tests_.begin(); - test_it != tests_.end(); ++test_it) { - linked_ptr test_info = *test_it; - for (typename InstantiationContainer::iterator gen_it = - instantiations_.begin(); gen_it != instantiations_.end(); - ++gen_it) { - const string& instantiation_name = gen_it->first; - ParamGenerator generator((*gen_it->second)()); - - Message test_case_name_stream; - if ( !instantiation_name.empty() ) - test_case_name_stream << instantiation_name << "/"; - test_case_name_stream << test_info->test_case_base_name; - - int i = 0; - for (typename ParamGenerator::iterator param_it = - generator.begin(); - param_it != generator.end(); ++param_it, ++i) { - Message test_name_stream; - test_name_stream << test_info->test_base_name << "/" << i; - MakeAndRegisterTestInfo( - test_case_name_stream.GetString().c_str(), - test_name_stream.GetString().c_str(), - NULL, // No type parameter. - PrintToString(*param_it).c_str(), - GetTestCaseTypeId(), - TestCase::SetUpTestCase, - TestCase::TearDownTestCase, - test_info->test_meta_factory->CreateTestFactory(*param_it)); - } // for param_it - } // for gen_it - } // for test_it - } // RegisterTests - - private: - // LocalTestInfo structure keeps information about a single test registered - // with TEST_P macro. - struct TestInfo { - TestInfo(const char* a_test_case_base_name, - const char* a_test_base_name, - TestMetaFactoryBase* a_test_meta_factory) : - test_case_base_name(a_test_case_base_name), - test_base_name(a_test_base_name), - test_meta_factory(a_test_meta_factory) {} - - const string test_case_base_name; - const string test_base_name; - const scoped_ptr > test_meta_factory; - }; - typedef ::std::vector > TestInfoContainer; - // Keeps pairs of - // received from INSTANTIATE_TEST_CASE_P macros. - typedef ::std::vector > - InstantiationContainer; - - const string test_case_name_; - TestInfoContainer tests_; - InstantiationContainer instantiations_; - - GTEST_DISALLOW_COPY_AND_ASSIGN_(ParameterizedTestCaseInfo); -}; // class ParameterizedTestCaseInfo - -// INTERNAL IMPLEMENTATION - DO NOT USE IN USER CODE. -// -// ParameterizedTestCaseRegistry contains a map of ParameterizedTestCaseInfoBase -// classes accessed by test case names. TEST_P and INSTANTIATE_TEST_CASE_P -// macros use it to locate their corresponding ParameterizedTestCaseInfo -// descriptors. -class ParameterizedTestCaseRegistry { - public: - ParameterizedTestCaseRegistry() {} - ~ParameterizedTestCaseRegistry() { - for (TestCaseInfoContainer::iterator it = test_case_infos_.begin(); - it != test_case_infos_.end(); ++it) { - delete *it; - } - } - - // Looks up or creates and returns a structure containing information about - // tests and instantiations of a particular test case. - template - ParameterizedTestCaseInfo* GetTestCasePatternHolder( - const char* test_case_name, - const char* file, - int line) { - ParameterizedTestCaseInfo* typed_test_info = NULL; - for (TestCaseInfoContainer::iterator it = test_case_infos_.begin(); - it != test_case_infos_.end(); ++it) { - if ((*it)->GetTestCaseName() == test_case_name) { - if ((*it)->GetTestCaseTypeId() != GetTypeId()) { - // Complain about incorrect usage of Google Test facilities - // and terminate the program since we cannot guaranty correct - // test case setup and tear-down in this case. - ReportInvalidTestCaseType(test_case_name, file, line); - posix::Abort(); - } else { - // At this point we are sure that the object we found is of the same - // type we are looking for, so we downcast it to that type - // without further checks. - typed_test_info = CheckedDowncastToActualType< - ParameterizedTestCaseInfo >(*it); - } - break; - } - } - if (typed_test_info == NULL) { - typed_test_info = new ParameterizedTestCaseInfo(test_case_name); - test_case_infos_.push_back(typed_test_info); - } - return typed_test_info; - } - void RegisterTests() { - for (TestCaseInfoContainer::iterator it = test_case_infos_.begin(); - it != test_case_infos_.end(); ++it) { - (*it)->RegisterTests(); - } - } - - private: - typedef ::std::vector TestCaseInfoContainer; - - TestCaseInfoContainer test_case_infos_; - - GTEST_DISALLOW_COPY_AND_ASSIGN_(ParameterizedTestCaseRegistry); -}; - -} // namespace internal -} // namespace testing - -#endif // GTEST_HAS_PARAM_TEST - -#endif // GTEST_INCLUDE_GTEST_INTERNAL_GTEST_PARAM_UTIL_H_ -// This file was GENERATED by command: -// pump.py gtest-param-util-generated.h.pump -// DO NOT EDIT BY HAND!!! - -// Copyright 2008 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. -// -// Author: vladl@google.com (Vlad Losev) - -// Type and function utilities for implementing parameterized tests. -// This file is generated by a SCRIPT. DO NOT EDIT BY HAND! -// -// Currently Google Test supports at most 50 arguments in Values, -// and at most 10 arguments in Combine. Please contact -// googletestframework@googlegroups.com if you need more. -// Please note that the number of arguments to Combine is limited -// by the maximum arity of the implementation of tr1::tuple which is -// currently set at 10. - -#ifndef GTEST_INCLUDE_GTEST_INTERNAL_GTEST_PARAM_UTIL_GENERATED_H_ -#define GTEST_INCLUDE_GTEST_INTERNAL_GTEST_PARAM_UTIL_GENERATED_H_ - -// scripts/fuse_gtest.py depends on gtest's own header being #included -// *unconditionally*. Therefore these #includes cannot be moved -// inside #if GTEST_HAS_PARAM_TEST. - -#if GTEST_HAS_PARAM_TEST - -namespace testing { - -// Forward declarations of ValuesIn(), which is implemented in -// include/gtest/gtest-param-test.h. -template -internal::ParamGenerator< - typename ::testing::internal::IteratorTraits::value_type> -ValuesIn(ForwardIterator begin, ForwardIterator end); - -template -internal::ParamGenerator ValuesIn(const T (&array)[N]); - -template -internal::ParamGenerator ValuesIn( - const Container& container); - -namespace internal { - -// Used in the Values() function to provide polymorphic capabilities. -template -class ValueArray1 { - public: - explicit ValueArray1(T1 v1) : v1_(v1) {} - - template - operator ParamGenerator() const { return ValuesIn(&v1_, &v1_ + 1); } - - private: - // No implementation - assignment is unsupported. - void operator=(const ValueArray1& other); - - const T1 v1_; -}; - -template -class ValueArray2 { - public: - ValueArray2(T1 v1, T2 v2) : v1_(v1), v2_(v2) {} - - template - operator ParamGenerator() const { - const T array[] = {v1_, v2_}; - return ValuesIn(array); - } - - private: - // No implementation - assignment is unsupported. - void operator=(const ValueArray2& other); - - const T1 v1_; - const T2 v2_; -}; - -template -class ValueArray3 { - public: - ValueArray3(T1 v1, T2 v2, T3 v3) : v1_(v1), v2_(v2), v3_(v3) {} - - template - operator ParamGenerator() const { - const T array[] = {v1_, v2_, v3_}; - return ValuesIn(array); - } - - private: - // No implementation - assignment is unsupported. - void operator=(const ValueArray3& other); - - const T1 v1_; - const T2 v2_; - const T3 v3_; -}; - -template -class ValueArray4 { - public: - ValueArray4(T1 v1, T2 v2, T3 v3, T4 v4) : v1_(v1), v2_(v2), v3_(v3), - v4_(v4) {} - - template - operator ParamGenerator() const { - const T array[] = {v1_, v2_, v3_, v4_}; - return ValuesIn(array); - } - - private: - // No implementation - assignment is unsupported. - void operator=(const ValueArray4& other); - - const T1 v1_; - const T2 v2_; - const T3 v3_; - const T4 v4_; -}; - -template -class ValueArray5 { - public: - ValueArray5(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5) : v1_(v1), v2_(v2), v3_(v3), - v4_(v4), v5_(v5) {} - - template - operator ParamGenerator() const { - const T array[] = {v1_, v2_, v3_, v4_, v5_}; - return ValuesIn(array); - } - - private: - // No implementation - assignment is unsupported. - void operator=(const ValueArray5& other); - - const T1 v1_; - const T2 v2_; - const T3 v3_; - const T4 v4_; - const T5 v5_; -}; - -template -class ValueArray6 { - public: - ValueArray6(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6) : v1_(v1), v2_(v2), - v3_(v3), v4_(v4), v5_(v5), v6_(v6) {} - - template - operator ParamGenerator() const { - const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_}; - return ValuesIn(array); - } - - private: - // No implementation - assignment is unsupported. - void operator=(const ValueArray6& other); - - const T1 v1_; - const T2 v2_; - const T3 v3_; - const T4 v4_; - const T5 v5_; - const T6 v6_; -}; - -template -class ValueArray7 { - public: - ValueArray7(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7) : v1_(v1), - v2_(v2), v3_(v3), v4_(v4), v5_(v5), v6_(v6), v7_(v7) {} - - template - operator ParamGenerator() const { - const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_}; - return ValuesIn(array); - } - - private: - // No implementation - assignment is unsupported. - void operator=(const ValueArray7& other); - - const T1 v1_; - const T2 v2_; - const T3 v3_; - const T4 v4_; - const T5 v5_; - const T6 v6_; - const T7 v7_; -}; - -template -class ValueArray8 { - public: - ValueArray8(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, - T8 v8) : v1_(v1), v2_(v2), v3_(v3), v4_(v4), v5_(v5), v6_(v6), v7_(v7), - v8_(v8) {} - - template - operator ParamGenerator() const { - const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_, v8_}; - return ValuesIn(array); - } - - private: - // No implementation - assignment is unsupported. - void operator=(const ValueArray8& other); - - const T1 v1_; - const T2 v2_; - const T3 v3_; - const T4 v4_; - const T5 v5_; - const T6 v6_; - const T7 v7_; - const T8 v8_; -}; - -template -class ValueArray9 { - public: - ValueArray9(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, - T9 v9) : v1_(v1), v2_(v2), v3_(v3), v4_(v4), v5_(v5), v6_(v6), v7_(v7), - v8_(v8), v9_(v9) {} - - template - operator ParamGenerator() const { - const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_, v8_, v9_}; - return ValuesIn(array); - } - - private: - // No implementation - assignment is unsupported. - void operator=(const ValueArray9& other); - - const T1 v1_; - const T2 v2_; - const T3 v3_; - const T4 v4_; - const T5 v5_; - const T6 v6_; - const T7 v7_; - const T8 v8_; - const T9 v9_; -}; - -template -class ValueArray10 { - public: - ValueArray10(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, - T10 v10) : v1_(v1), v2_(v2), v3_(v3), v4_(v4), v5_(v5), v6_(v6), v7_(v7), - v8_(v8), v9_(v9), v10_(v10) {} - - template - operator ParamGenerator() const { - const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_, v8_, v9_, v10_}; - return ValuesIn(array); - } - - private: - // No implementation - assignment is unsupported. - void operator=(const ValueArray10& other); - - const T1 v1_; - const T2 v2_; - const T3 v3_; - const T4 v4_; - const T5 v5_; - const T6 v6_; - const T7 v7_; - const T8 v8_; - const T9 v9_; - const T10 v10_; -}; - -template -class ValueArray11 { - public: - ValueArray11(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, - T10 v10, T11 v11) : v1_(v1), v2_(v2), v3_(v3), v4_(v4), v5_(v5), v6_(v6), - v7_(v7), v8_(v8), v9_(v9), v10_(v10), v11_(v11) {} - - template - operator ParamGenerator() const { - const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_, v8_, v9_, v10_, v11_}; - return ValuesIn(array); - } - - private: - // No implementation - assignment is unsupported. - void operator=(const ValueArray11& other); - - const T1 v1_; - const T2 v2_; - const T3 v3_; - const T4 v4_; - const T5 v5_; - const T6 v6_; - const T7 v7_; - const T8 v8_; - const T9 v9_; - const T10 v10_; - const T11 v11_; -}; - -template -class ValueArray12 { - public: - ValueArray12(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, - T10 v10, T11 v11, T12 v12) : v1_(v1), v2_(v2), v3_(v3), v4_(v4), v5_(v5), - v6_(v6), v7_(v7), v8_(v8), v9_(v9), v10_(v10), v11_(v11), v12_(v12) {} - - template - operator ParamGenerator() const { - const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_, v8_, v9_, v10_, v11_, - v12_}; - return ValuesIn(array); - } - - private: - // No implementation - assignment is unsupported. - void operator=(const ValueArray12& other); - - const T1 v1_; - const T2 v2_; - const T3 v3_; - const T4 v4_; - const T5 v5_; - const T6 v6_; - const T7 v7_; - const T8 v8_; - const T9 v9_; - const T10 v10_; - const T11 v11_; - const T12 v12_; -}; - -template -class ValueArray13 { - public: - ValueArray13(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, - T10 v10, T11 v11, T12 v12, T13 v13) : v1_(v1), v2_(v2), v3_(v3), v4_(v4), - v5_(v5), v6_(v6), v7_(v7), v8_(v8), v9_(v9), v10_(v10), v11_(v11), - v12_(v12), v13_(v13) {} - - template - operator ParamGenerator() const { - const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_, v8_, v9_, v10_, v11_, - v12_, v13_}; - return ValuesIn(array); - } - - private: - // No implementation - assignment is unsupported. - void operator=(const ValueArray13& other); - - const T1 v1_; - const T2 v2_; - const T3 v3_; - const T4 v4_; - const T5 v5_; - const T6 v6_; - const T7 v7_; - const T8 v8_; - const T9 v9_; - const T10 v10_; - const T11 v11_; - const T12 v12_; - const T13 v13_; -}; - -template -class ValueArray14 { - public: - ValueArray14(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, - T10 v10, T11 v11, T12 v12, T13 v13, T14 v14) : v1_(v1), v2_(v2), v3_(v3), - v4_(v4), v5_(v5), v6_(v6), v7_(v7), v8_(v8), v9_(v9), v10_(v10), - v11_(v11), v12_(v12), v13_(v13), v14_(v14) {} - - template - operator ParamGenerator() const { - const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_, v8_, v9_, v10_, v11_, - v12_, v13_, v14_}; - return ValuesIn(array); - } - - private: - // No implementation - assignment is unsupported. - void operator=(const ValueArray14& other); - - const T1 v1_; - const T2 v2_; - const T3 v3_; - const T4 v4_; - const T5 v5_; - const T6 v6_; - const T7 v7_; - const T8 v8_; - const T9 v9_; - const T10 v10_; - const T11 v11_; - const T12 v12_; - const T13 v13_; - const T14 v14_; -}; - -template -class ValueArray15 { - public: - ValueArray15(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, - T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15) : v1_(v1), v2_(v2), - v3_(v3), v4_(v4), v5_(v5), v6_(v6), v7_(v7), v8_(v8), v9_(v9), v10_(v10), - v11_(v11), v12_(v12), v13_(v13), v14_(v14), v15_(v15) {} - - template - operator ParamGenerator() const { - const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_, v8_, v9_, v10_, v11_, - v12_, v13_, v14_, v15_}; - return ValuesIn(array); - } - - private: - // No implementation - assignment is unsupported. - void operator=(const ValueArray15& other); - - const T1 v1_; - const T2 v2_; - const T3 v3_; - const T4 v4_; - const T5 v5_; - const T6 v6_; - const T7 v7_; - const T8 v8_; - const T9 v9_; - const T10 v10_; - const T11 v11_; - const T12 v12_; - const T13 v13_; - const T14 v14_; - const T15 v15_; -}; - -template -class ValueArray16 { - public: - ValueArray16(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, - T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16) : v1_(v1), - v2_(v2), v3_(v3), v4_(v4), v5_(v5), v6_(v6), v7_(v7), v8_(v8), v9_(v9), - v10_(v10), v11_(v11), v12_(v12), v13_(v13), v14_(v14), v15_(v15), - v16_(v16) {} - - template - operator ParamGenerator() const { - const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_, v8_, v9_, v10_, v11_, - v12_, v13_, v14_, v15_, v16_}; - return ValuesIn(array); - } - - private: - // No implementation - assignment is unsupported. - void operator=(const ValueArray16& other); - - const T1 v1_; - const T2 v2_; - const T3 v3_; - const T4 v4_; - const T5 v5_; - const T6 v6_; - const T7 v7_; - const T8 v8_; - const T9 v9_; - const T10 v10_; - const T11 v11_; - const T12 v12_; - const T13 v13_; - const T14 v14_; - const T15 v15_; - const T16 v16_; -}; - -template -class ValueArray17 { - public: - ValueArray17(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, - T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, - T17 v17) : v1_(v1), v2_(v2), v3_(v3), v4_(v4), v5_(v5), v6_(v6), v7_(v7), - v8_(v8), v9_(v9), v10_(v10), v11_(v11), v12_(v12), v13_(v13), v14_(v14), - v15_(v15), v16_(v16), v17_(v17) {} - - template - operator ParamGenerator() const { - const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_, v8_, v9_, v10_, v11_, - v12_, v13_, v14_, v15_, v16_, v17_}; - return ValuesIn(array); - } - - private: - // No implementation - assignment is unsupported. - void operator=(const ValueArray17& other); - - const T1 v1_; - const T2 v2_; - const T3 v3_; - const T4 v4_; - const T5 v5_; - const T6 v6_; - const T7 v7_; - const T8 v8_; - const T9 v9_; - const T10 v10_; - const T11 v11_; - const T12 v12_; - const T13 v13_; - const T14 v14_; - const T15 v15_; - const T16 v16_; - const T17 v17_; -}; - -template -class ValueArray18 { - public: - ValueArray18(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, - T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, - T18 v18) : v1_(v1), v2_(v2), v3_(v3), v4_(v4), v5_(v5), v6_(v6), v7_(v7), - v8_(v8), v9_(v9), v10_(v10), v11_(v11), v12_(v12), v13_(v13), v14_(v14), - v15_(v15), v16_(v16), v17_(v17), v18_(v18) {} - - template - operator ParamGenerator() const { - const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_, v8_, v9_, v10_, v11_, - v12_, v13_, v14_, v15_, v16_, v17_, v18_}; - return ValuesIn(array); - } - - private: - // No implementation - assignment is unsupported. - void operator=(const ValueArray18& other); - - const T1 v1_; - const T2 v2_; - const T3 v3_; - const T4 v4_; - const T5 v5_; - const T6 v6_; - const T7 v7_; - const T8 v8_; - const T9 v9_; - const T10 v10_; - const T11 v11_; - const T12 v12_; - const T13 v13_; - const T14 v14_; - const T15 v15_; - const T16 v16_; - const T17 v17_; - const T18 v18_; -}; - -template -class ValueArray19 { - public: - ValueArray19(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, - T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, - T18 v18, T19 v19) : v1_(v1), v2_(v2), v3_(v3), v4_(v4), v5_(v5), v6_(v6), - v7_(v7), v8_(v8), v9_(v9), v10_(v10), v11_(v11), v12_(v12), v13_(v13), - v14_(v14), v15_(v15), v16_(v16), v17_(v17), v18_(v18), v19_(v19) {} - - template - operator ParamGenerator() const { - const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_, v8_, v9_, v10_, v11_, - v12_, v13_, v14_, v15_, v16_, v17_, v18_, v19_}; - return ValuesIn(array); - } - - private: - // No implementation - assignment is unsupported. - void operator=(const ValueArray19& other); - - const T1 v1_; - const T2 v2_; - const T3 v3_; - const T4 v4_; - const T5 v5_; - const T6 v6_; - const T7 v7_; - const T8 v8_; - const T9 v9_; - const T10 v10_; - const T11 v11_; - const T12 v12_; - const T13 v13_; - const T14 v14_; - const T15 v15_; - const T16 v16_; - const T17 v17_; - const T18 v18_; - const T19 v19_; -}; - -template -class ValueArray20 { - public: - ValueArray20(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, - T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, - T18 v18, T19 v19, T20 v20) : v1_(v1), v2_(v2), v3_(v3), v4_(v4), v5_(v5), - v6_(v6), v7_(v7), v8_(v8), v9_(v9), v10_(v10), v11_(v11), v12_(v12), - v13_(v13), v14_(v14), v15_(v15), v16_(v16), v17_(v17), v18_(v18), - v19_(v19), v20_(v20) {} - - template - operator ParamGenerator() const { - const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_, v8_, v9_, v10_, v11_, - v12_, v13_, v14_, v15_, v16_, v17_, v18_, v19_, v20_}; - return ValuesIn(array); - } - - private: - // No implementation - assignment is unsupported. - void operator=(const ValueArray20& other); - - const T1 v1_; - const T2 v2_; - const T3 v3_; - const T4 v4_; - const T5 v5_; - const T6 v6_; - const T7 v7_; - const T8 v8_; - const T9 v9_; - const T10 v10_; - const T11 v11_; - const T12 v12_; - const T13 v13_; - const T14 v14_; - const T15 v15_; - const T16 v16_; - const T17 v17_; - const T18 v18_; - const T19 v19_; - const T20 v20_; -}; - -template -class ValueArray21 { - public: - ValueArray21(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, - T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, - T18 v18, T19 v19, T20 v20, T21 v21) : v1_(v1), v2_(v2), v3_(v3), v4_(v4), - v5_(v5), v6_(v6), v7_(v7), v8_(v8), v9_(v9), v10_(v10), v11_(v11), - v12_(v12), v13_(v13), v14_(v14), v15_(v15), v16_(v16), v17_(v17), - v18_(v18), v19_(v19), v20_(v20), v21_(v21) {} - - template - operator ParamGenerator() const { - const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_, v8_, v9_, v10_, v11_, - v12_, v13_, v14_, v15_, v16_, v17_, v18_, v19_, v20_, v21_}; - return ValuesIn(array); - } - - private: - // No implementation - assignment is unsupported. - void operator=(const ValueArray21& other); - - const T1 v1_; - const T2 v2_; - const T3 v3_; - const T4 v4_; - const T5 v5_; - const T6 v6_; - const T7 v7_; - const T8 v8_; - const T9 v9_; - const T10 v10_; - const T11 v11_; - const T12 v12_; - const T13 v13_; - const T14 v14_; - const T15 v15_; - const T16 v16_; - const T17 v17_; - const T18 v18_; - const T19 v19_; - const T20 v20_; - const T21 v21_; -}; - -template -class ValueArray22 { - public: - ValueArray22(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, - T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, - T18 v18, T19 v19, T20 v20, T21 v21, T22 v22) : v1_(v1), v2_(v2), v3_(v3), - v4_(v4), v5_(v5), v6_(v6), v7_(v7), v8_(v8), v9_(v9), v10_(v10), - v11_(v11), v12_(v12), v13_(v13), v14_(v14), v15_(v15), v16_(v16), - v17_(v17), v18_(v18), v19_(v19), v20_(v20), v21_(v21), v22_(v22) {} - - template - operator ParamGenerator() const { - const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_, v8_, v9_, v10_, v11_, - v12_, v13_, v14_, v15_, v16_, v17_, v18_, v19_, v20_, v21_, v22_}; - return ValuesIn(array); - } - - private: - // No implementation - assignment is unsupported. - void operator=(const ValueArray22& other); - - const T1 v1_; - const T2 v2_; - const T3 v3_; - const T4 v4_; - const T5 v5_; - const T6 v6_; - const T7 v7_; - const T8 v8_; - const T9 v9_; - const T10 v10_; - const T11 v11_; - const T12 v12_; - const T13 v13_; - const T14 v14_; - const T15 v15_; - const T16 v16_; - const T17 v17_; - const T18 v18_; - const T19 v19_; - const T20 v20_; - const T21 v21_; - const T22 v22_; -}; - -template -class ValueArray23 { - public: - ValueArray23(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, - T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, - T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23) : v1_(v1), v2_(v2), - v3_(v3), v4_(v4), v5_(v5), v6_(v6), v7_(v7), v8_(v8), v9_(v9), v10_(v10), - v11_(v11), v12_(v12), v13_(v13), v14_(v14), v15_(v15), v16_(v16), - v17_(v17), v18_(v18), v19_(v19), v20_(v20), v21_(v21), v22_(v22), - v23_(v23) {} - - template - operator ParamGenerator() const { - const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_, v8_, v9_, v10_, v11_, - v12_, v13_, v14_, v15_, v16_, v17_, v18_, v19_, v20_, v21_, v22_, - v23_}; - return ValuesIn(array); - } - - private: - // No implementation - assignment is unsupported. - void operator=(const ValueArray23& other); - - const T1 v1_; - const T2 v2_; - const T3 v3_; - const T4 v4_; - const T5 v5_; - const T6 v6_; - const T7 v7_; - const T8 v8_; - const T9 v9_; - const T10 v10_; - const T11 v11_; - const T12 v12_; - const T13 v13_; - const T14 v14_; - const T15 v15_; - const T16 v16_; - const T17 v17_; - const T18 v18_; - const T19 v19_; - const T20 v20_; - const T21 v21_; - const T22 v22_; - const T23 v23_; -}; - -template -class ValueArray24 { - public: - ValueArray24(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, - T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, - T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24) : v1_(v1), - v2_(v2), v3_(v3), v4_(v4), v5_(v5), v6_(v6), v7_(v7), v8_(v8), v9_(v9), - v10_(v10), v11_(v11), v12_(v12), v13_(v13), v14_(v14), v15_(v15), - v16_(v16), v17_(v17), v18_(v18), v19_(v19), v20_(v20), v21_(v21), - v22_(v22), v23_(v23), v24_(v24) {} - - template - operator ParamGenerator() const { - const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_, v8_, v9_, v10_, v11_, - v12_, v13_, v14_, v15_, v16_, v17_, v18_, v19_, v20_, v21_, v22_, v23_, - v24_}; - return ValuesIn(array); - } - - private: - // No implementation - assignment is unsupported. - void operator=(const ValueArray24& other); - - const T1 v1_; - const T2 v2_; - const T3 v3_; - const T4 v4_; - const T5 v5_; - const T6 v6_; - const T7 v7_; - const T8 v8_; - const T9 v9_; - const T10 v10_; - const T11 v11_; - const T12 v12_; - const T13 v13_; - const T14 v14_; - const T15 v15_; - const T16 v16_; - const T17 v17_; - const T18 v18_; - const T19 v19_; - const T20 v20_; - const T21 v21_; - const T22 v22_; - const T23 v23_; - const T24 v24_; -}; - -template -class ValueArray25 { - public: - ValueArray25(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, - T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, - T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, - T25 v25) : v1_(v1), v2_(v2), v3_(v3), v4_(v4), v5_(v5), v6_(v6), v7_(v7), - v8_(v8), v9_(v9), v10_(v10), v11_(v11), v12_(v12), v13_(v13), v14_(v14), - v15_(v15), v16_(v16), v17_(v17), v18_(v18), v19_(v19), v20_(v20), - v21_(v21), v22_(v22), v23_(v23), v24_(v24), v25_(v25) {} - - template - operator ParamGenerator() const { - const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_, v8_, v9_, v10_, v11_, - v12_, v13_, v14_, v15_, v16_, v17_, v18_, v19_, v20_, v21_, v22_, v23_, - v24_, v25_}; - return ValuesIn(array); - } - - private: - // No implementation - assignment is unsupported. - void operator=(const ValueArray25& other); - - const T1 v1_; - const T2 v2_; - const T3 v3_; - const T4 v4_; - const T5 v5_; - const T6 v6_; - const T7 v7_; - const T8 v8_; - const T9 v9_; - const T10 v10_; - const T11 v11_; - const T12 v12_; - const T13 v13_; - const T14 v14_; - const T15 v15_; - const T16 v16_; - const T17 v17_; - const T18 v18_; - const T19 v19_; - const T20 v20_; - const T21 v21_; - const T22 v22_; - const T23 v23_; - const T24 v24_; - const T25 v25_; -}; - -template -class ValueArray26 { - public: - ValueArray26(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, - T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, - T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, - T26 v26) : v1_(v1), v2_(v2), v3_(v3), v4_(v4), v5_(v5), v6_(v6), v7_(v7), - v8_(v8), v9_(v9), v10_(v10), v11_(v11), v12_(v12), v13_(v13), v14_(v14), - v15_(v15), v16_(v16), v17_(v17), v18_(v18), v19_(v19), v20_(v20), - v21_(v21), v22_(v22), v23_(v23), v24_(v24), v25_(v25), v26_(v26) {} - - template - operator ParamGenerator() const { - const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_, v8_, v9_, v10_, v11_, - v12_, v13_, v14_, v15_, v16_, v17_, v18_, v19_, v20_, v21_, v22_, v23_, - v24_, v25_, v26_}; - return ValuesIn(array); - } - - private: - // No implementation - assignment is unsupported. - void operator=(const ValueArray26& other); - - const T1 v1_; - const T2 v2_; - const T3 v3_; - const T4 v4_; - const T5 v5_; - const T6 v6_; - const T7 v7_; - const T8 v8_; - const T9 v9_; - const T10 v10_; - const T11 v11_; - const T12 v12_; - const T13 v13_; - const T14 v14_; - const T15 v15_; - const T16 v16_; - const T17 v17_; - const T18 v18_; - const T19 v19_; - const T20 v20_; - const T21 v21_; - const T22 v22_; - const T23 v23_; - const T24 v24_; - const T25 v25_; - const T26 v26_; -}; - -template -class ValueArray27 { - public: - ValueArray27(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, - T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, - T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, - T26 v26, T27 v27) : v1_(v1), v2_(v2), v3_(v3), v4_(v4), v5_(v5), v6_(v6), - v7_(v7), v8_(v8), v9_(v9), v10_(v10), v11_(v11), v12_(v12), v13_(v13), - v14_(v14), v15_(v15), v16_(v16), v17_(v17), v18_(v18), v19_(v19), - v20_(v20), v21_(v21), v22_(v22), v23_(v23), v24_(v24), v25_(v25), - v26_(v26), v27_(v27) {} - - template - operator ParamGenerator() const { - const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_, v8_, v9_, v10_, v11_, - v12_, v13_, v14_, v15_, v16_, v17_, v18_, v19_, v20_, v21_, v22_, v23_, - v24_, v25_, v26_, v27_}; - return ValuesIn(array); - } - - private: - // No implementation - assignment is unsupported. - void operator=(const ValueArray27& other); - - const T1 v1_; - const T2 v2_; - const T3 v3_; - const T4 v4_; - const T5 v5_; - const T6 v6_; - const T7 v7_; - const T8 v8_; - const T9 v9_; - const T10 v10_; - const T11 v11_; - const T12 v12_; - const T13 v13_; - const T14 v14_; - const T15 v15_; - const T16 v16_; - const T17 v17_; - const T18 v18_; - const T19 v19_; - const T20 v20_; - const T21 v21_; - const T22 v22_; - const T23 v23_; - const T24 v24_; - const T25 v25_; - const T26 v26_; - const T27 v27_; -}; - -template -class ValueArray28 { - public: - ValueArray28(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, - T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, - T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, - T26 v26, T27 v27, T28 v28) : v1_(v1), v2_(v2), v3_(v3), v4_(v4), v5_(v5), - v6_(v6), v7_(v7), v8_(v8), v9_(v9), v10_(v10), v11_(v11), v12_(v12), - v13_(v13), v14_(v14), v15_(v15), v16_(v16), v17_(v17), v18_(v18), - v19_(v19), v20_(v20), v21_(v21), v22_(v22), v23_(v23), v24_(v24), - v25_(v25), v26_(v26), v27_(v27), v28_(v28) {} - - template - operator ParamGenerator() const { - const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_, v8_, v9_, v10_, v11_, - v12_, v13_, v14_, v15_, v16_, v17_, v18_, v19_, v20_, v21_, v22_, v23_, - v24_, v25_, v26_, v27_, v28_}; - return ValuesIn(array); - } - - private: - // No implementation - assignment is unsupported. - void operator=(const ValueArray28& other); - - const T1 v1_; - const T2 v2_; - const T3 v3_; - const T4 v4_; - const T5 v5_; - const T6 v6_; - const T7 v7_; - const T8 v8_; - const T9 v9_; - const T10 v10_; - const T11 v11_; - const T12 v12_; - const T13 v13_; - const T14 v14_; - const T15 v15_; - const T16 v16_; - const T17 v17_; - const T18 v18_; - const T19 v19_; - const T20 v20_; - const T21 v21_; - const T22 v22_; - const T23 v23_; - const T24 v24_; - const T25 v25_; - const T26 v26_; - const T27 v27_; - const T28 v28_; -}; - -template -class ValueArray29 { - public: - ValueArray29(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, - T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, - T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, - T26 v26, T27 v27, T28 v28, T29 v29) : v1_(v1), v2_(v2), v3_(v3), v4_(v4), - v5_(v5), v6_(v6), v7_(v7), v8_(v8), v9_(v9), v10_(v10), v11_(v11), - v12_(v12), v13_(v13), v14_(v14), v15_(v15), v16_(v16), v17_(v17), - v18_(v18), v19_(v19), v20_(v20), v21_(v21), v22_(v22), v23_(v23), - v24_(v24), v25_(v25), v26_(v26), v27_(v27), v28_(v28), v29_(v29) {} - - template - operator ParamGenerator() const { - const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_, v8_, v9_, v10_, v11_, - v12_, v13_, v14_, v15_, v16_, v17_, v18_, v19_, v20_, v21_, v22_, v23_, - v24_, v25_, v26_, v27_, v28_, v29_}; - return ValuesIn(array); - } - - private: - // No implementation - assignment is unsupported. - void operator=(const ValueArray29& other); - - const T1 v1_; - const T2 v2_; - const T3 v3_; - const T4 v4_; - const T5 v5_; - const T6 v6_; - const T7 v7_; - const T8 v8_; - const T9 v9_; - const T10 v10_; - const T11 v11_; - const T12 v12_; - const T13 v13_; - const T14 v14_; - const T15 v15_; - const T16 v16_; - const T17 v17_; - const T18 v18_; - const T19 v19_; - const T20 v20_; - const T21 v21_; - const T22 v22_; - const T23 v23_; - const T24 v24_; - const T25 v25_; - const T26 v26_; - const T27 v27_; - const T28 v28_; - const T29 v29_; -}; - -template -class ValueArray30 { - public: - ValueArray30(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, - T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, - T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, - T26 v26, T27 v27, T28 v28, T29 v29, T30 v30) : v1_(v1), v2_(v2), v3_(v3), - v4_(v4), v5_(v5), v6_(v6), v7_(v7), v8_(v8), v9_(v9), v10_(v10), - v11_(v11), v12_(v12), v13_(v13), v14_(v14), v15_(v15), v16_(v16), - v17_(v17), v18_(v18), v19_(v19), v20_(v20), v21_(v21), v22_(v22), - v23_(v23), v24_(v24), v25_(v25), v26_(v26), v27_(v27), v28_(v28), - v29_(v29), v30_(v30) {} - - template - operator ParamGenerator() const { - const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_, v8_, v9_, v10_, v11_, - v12_, v13_, v14_, v15_, v16_, v17_, v18_, v19_, v20_, v21_, v22_, v23_, - v24_, v25_, v26_, v27_, v28_, v29_, v30_}; - return ValuesIn(array); - } - - private: - // No implementation - assignment is unsupported. - void operator=(const ValueArray30& other); - - const T1 v1_; - const T2 v2_; - const T3 v3_; - const T4 v4_; - const T5 v5_; - const T6 v6_; - const T7 v7_; - const T8 v8_; - const T9 v9_; - const T10 v10_; - const T11 v11_; - const T12 v12_; - const T13 v13_; - const T14 v14_; - const T15 v15_; - const T16 v16_; - const T17 v17_; - const T18 v18_; - const T19 v19_; - const T20 v20_; - const T21 v21_; - const T22 v22_; - const T23 v23_; - const T24 v24_; - const T25 v25_; - const T26 v26_; - const T27 v27_; - const T28 v28_; - const T29 v29_; - const T30 v30_; -}; - -template -class ValueArray31 { - public: - ValueArray31(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, - T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, - T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, - T26 v26, T27 v27, T28 v28, T29 v29, T30 v30, T31 v31) : v1_(v1), v2_(v2), - v3_(v3), v4_(v4), v5_(v5), v6_(v6), v7_(v7), v8_(v8), v9_(v9), v10_(v10), - v11_(v11), v12_(v12), v13_(v13), v14_(v14), v15_(v15), v16_(v16), - v17_(v17), v18_(v18), v19_(v19), v20_(v20), v21_(v21), v22_(v22), - v23_(v23), v24_(v24), v25_(v25), v26_(v26), v27_(v27), v28_(v28), - v29_(v29), v30_(v30), v31_(v31) {} - - template - operator ParamGenerator() const { - const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_, v8_, v9_, v10_, v11_, - v12_, v13_, v14_, v15_, v16_, v17_, v18_, v19_, v20_, v21_, v22_, v23_, - v24_, v25_, v26_, v27_, v28_, v29_, v30_, v31_}; - return ValuesIn(array); - } - - private: - // No implementation - assignment is unsupported. - void operator=(const ValueArray31& other); - - const T1 v1_; - const T2 v2_; - const T3 v3_; - const T4 v4_; - const T5 v5_; - const T6 v6_; - const T7 v7_; - const T8 v8_; - const T9 v9_; - const T10 v10_; - const T11 v11_; - const T12 v12_; - const T13 v13_; - const T14 v14_; - const T15 v15_; - const T16 v16_; - const T17 v17_; - const T18 v18_; - const T19 v19_; - const T20 v20_; - const T21 v21_; - const T22 v22_; - const T23 v23_; - const T24 v24_; - const T25 v25_; - const T26 v26_; - const T27 v27_; - const T28 v28_; - const T29 v29_; - const T30 v30_; - const T31 v31_; -}; - -template -class ValueArray32 { - public: - ValueArray32(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, - T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, - T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, - T26 v26, T27 v27, T28 v28, T29 v29, T30 v30, T31 v31, T32 v32) : v1_(v1), - v2_(v2), v3_(v3), v4_(v4), v5_(v5), v6_(v6), v7_(v7), v8_(v8), v9_(v9), - v10_(v10), v11_(v11), v12_(v12), v13_(v13), v14_(v14), v15_(v15), - v16_(v16), v17_(v17), v18_(v18), v19_(v19), v20_(v20), v21_(v21), - v22_(v22), v23_(v23), v24_(v24), v25_(v25), v26_(v26), v27_(v27), - v28_(v28), v29_(v29), v30_(v30), v31_(v31), v32_(v32) {} - - template - operator ParamGenerator() const { - const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_, v8_, v9_, v10_, v11_, - v12_, v13_, v14_, v15_, v16_, v17_, v18_, v19_, v20_, v21_, v22_, v23_, - v24_, v25_, v26_, v27_, v28_, v29_, v30_, v31_, v32_}; - return ValuesIn(array); - } - - private: - // No implementation - assignment is unsupported. - void operator=(const ValueArray32& other); - - const T1 v1_; - const T2 v2_; - const T3 v3_; - const T4 v4_; - const T5 v5_; - const T6 v6_; - const T7 v7_; - const T8 v8_; - const T9 v9_; - const T10 v10_; - const T11 v11_; - const T12 v12_; - const T13 v13_; - const T14 v14_; - const T15 v15_; - const T16 v16_; - const T17 v17_; - const T18 v18_; - const T19 v19_; - const T20 v20_; - const T21 v21_; - const T22 v22_; - const T23 v23_; - const T24 v24_; - const T25 v25_; - const T26 v26_; - const T27 v27_; - const T28 v28_; - const T29 v29_; - const T30 v30_; - const T31 v31_; - const T32 v32_; -}; - -template -class ValueArray33 { - public: - ValueArray33(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, - T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, - T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, - T26 v26, T27 v27, T28 v28, T29 v29, T30 v30, T31 v31, T32 v32, - T33 v33) : v1_(v1), v2_(v2), v3_(v3), v4_(v4), v5_(v5), v6_(v6), v7_(v7), - v8_(v8), v9_(v9), v10_(v10), v11_(v11), v12_(v12), v13_(v13), v14_(v14), - v15_(v15), v16_(v16), v17_(v17), v18_(v18), v19_(v19), v20_(v20), - v21_(v21), v22_(v22), v23_(v23), v24_(v24), v25_(v25), v26_(v26), - v27_(v27), v28_(v28), v29_(v29), v30_(v30), v31_(v31), v32_(v32), - v33_(v33) {} - - template - operator ParamGenerator() const { - const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_, v8_, v9_, v10_, v11_, - v12_, v13_, v14_, v15_, v16_, v17_, v18_, v19_, v20_, v21_, v22_, v23_, - v24_, v25_, v26_, v27_, v28_, v29_, v30_, v31_, v32_, v33_}; - return ValuesIn(array); - } - - private: - // No implementation - assignment is unsupported. - void operator=(const ValueArray33& other); - - const T1 v1_; - const T2 v2_; - const T3 v3_; - const T4 v4_; - const T5 v5_; - const T6 v6_; - const T7 v7_; - const T8 v8_; - const T9 v9_; - const T10 v10_; - const T11 v11_; - const T12 v12_; - const T13 v13_; - const T14 v14_; - const T15 v15_; - const T16 v16_; - const T17 v17_; - const T18 v18_; - const T19 v19_; - const T20 v20_; - const T21 v21_; - const T22 v22_; - const T23 v23_; - const T24 v24_; - const T25 v25_; - const T26 v26_; - const T27 v27_; - const T28 v28_; - const T29 v29_; - const T30 v30_; - const T31 v31_; - const T32 v32_; - const T33 v33_; -}; - -template -class ValueArray34 { - public: - ValueArray34(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, - T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, - T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, - T26 v26, T27 v27, T28 v28, T29 v29, T30 v30, T31 v31, T32 v32, T33 v33, - T34 v34) : v1_(v1), v2_(v2), v3_(v3), v4_(v4), v5_(v5), v6_(v6), v7_(v7), - v8_(v8), v9_(v9), v10_(v10), v11_(v11), v12_(v12), v13_(v13), v14_(v14), - v15_(v15), v16_(v16), v17_(v17), v18_(v18), v19_(v19), v20_(v20), - v21_(v21), v22_(v22), v23_(v23), v24_(v24), v25_(v25), v26_(v26), - v27_(v27), v28_(v28), v29_(v29), v30_(v30), v31_(v31), v32_(v32), - v33_(v33), v34_(v34) {} - - template - operator ParamGenerator() const { - const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_, v8_, v9_, v10_, v11_, - v12_, v13_, v14_, v15_, v16_, v17_, v18_, v19_, v20_, v21_, v22_, v23_, - v24_, v25_, v26_, v27_, v28_, v29_, v30_, v31_, v32_, v33_, v34_}; - return ValuesIn(array); - } - - private: - // No implementation - assignment is unsupported. - void operator=(const ValueArray34& other); - - const T1 v1_; - const T2 v2_; - const T3 v3_; - const T4 v4_; - const T5 v5_; - const T6 v6_; - const T7 v7_; - const T8 v8_; - const T9 v9_; - const T10 v10_; - const T11 v11_; - const T12 v12_; - const T13 v13_; - const T14 v14_; - const T15 v15_; - const T16 v16_; - const T17 v17_; - const T18 v18_; - const T19 v19_; - const T20 v20_; - const T21 v21_; - const T22 v22_; - const T23 v23_; - const T24 v24_; - const T25 v25_; - const T26 v26_; - const T27 v27_; - const T28 v28_; - const T29 v29_; - const T30 v30_; - const T31 v31_; - const T32 v32_; - const T33 v33_; - const T34 v34_; -}; - -template -class ValueArray35 { - public: - ValueArray35(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, - T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, - T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, - T26 v26, T27 v27, T28 v28, T29 v29, T30 v30, T31 v31, T32 v32, T33 v33, - T34 v34, T35 v35) : v1_(v1), v2_(v2), v3_(v3), v4_(v4), v5_(v5), v6_(v6), - v7_(v7), v8_(v8), v9_(v9), v10_(v10), v11_(v11), v12_(v12), v13_(v13), - v14_(v14), v15_(v15), v16_(v16), v17_(v17), v18_(v18), v19_(v19), - v20_(v20), v21_(v21), v22_(v22), v23_(v23), v24_(v24), v25_(v25), - v26_(v26), v27_(v27), v28_(v28), v29_(v29), v30_(v30), v31_(v31), - v32_(v32), v33_(v33), v34_(v34), v35_(v35) {} - - template - operator ParamGenerator() const { - const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_, v8_, v9_, v10_, v11_, - v12_, v13_, v14_, v15_, v16_, v17_, v18_, v19_, v20_, v21_, v22_, v23_, - v24_, v25_, v26_, v27_, v28_, v29_, v30_, v31_, v32_, v33_, v34_, - v35_}; - return ValuesIn(array); - } - - private: - // No implementation - assignment is unsupported. - void operator=(const ValueArray35& other); - - const T1 v1_; - const T2 v2_; - const T3 v3_; - const T4 v4_; - const T5 v5_; - const T6 v6_; - const T7 v7_; - const T8 v8_; - const T9 v9_; - const T10 v10_; - const T11 v11_; - const T12 v12_; - const T13 v13_; - const T14 v14_; - const T15 v15_; - const T16 v16_; - const T17 v17_; - const T18 v18_; - const T19 v19_; - const T20 v20_; - const T21 v21_; - const T22 v22_; - const T23 v23_; - const T24 v24_; - const T25 v25_; - const T26 v26_; - const T27 v27_; - const T28 v28_; - const T29 v29_; - const T30 v30_; - const T31 v31_; - const T32 v32_; - const T33 v33_; - const T34 v34_; - const T35 v35_; -}; - -template -class ValueArray36 { - public: - ValueArray36(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, - T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, - T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, - T26 v26, T27 v27, T28 v28, T29 v29, T30 v30, T31 v31, T32 v32, T33 v33, - T34 v34, T35 v35, T36 v36) : v1_(v1), v2_(v2), v3_(v3), v4_(v4), v5_(v5), - v6_(v6), v7_(v7), v8_(v8), v9_(v9), v10_(v10), v11_(v11), v12_(v12), - v13_(v13), v14_(v14), v15_(v15), v16_(v16), v17_(v17), v18_(v18), - v19_(v19), v20_(v20), v21_(v21), v22_(v22), v23_(v23), v24_(v24), - v25_(v25), v26_(v26), v27_(v27), v28_(v28), v29_(v29), v30_(v30), - v31_(v31), v32_(v32), v33_(v33), v34_(v34), v35_(v35), v36_(v36) {} - - template - operator ParamGenerator() const { - const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_, v8_, v9_, v10_, v11_, - v12_, v13_, v14_, v15_, v16_, v17_, v18_, v19_, v20_, v21_, v22_, v23_, - v24_, v25_, v26_, v27_, v28_, v29_, v30_, v31_, v32_, v33_, v34_, v35_, - v36_}; - return ValuesIn(array); - } - - private: - // No implementation - assignment is unsupported. - void operator=(const ValueArray36& other); - - const T1 v1_; - const T2 v2_; - const T3 v3_; - const T4 v4_; - const T5 v5_; - const T6 v6_; - const T7 v7_; - const T8 v8_; - const T9 v9_; - const T10 v10_; - const T11 v11_; - const T12 v12_; - const T13 v13_; - const T14 v14_; - const T15 v15_; - const T16 v16_; - const T17 v17_; - const T18 v18_; - const T19 v19_; - const T20 v20_; - const T21 v21_; - const T22 v22_; - const T23 v23_; - const T24 v24_; - const T25 v25_; - const T26 v26_; - const T27 v27_; - const T28 v28_; - const T29 v29_; - const T30 v30_; - const T31 v31_; - const T32 v32_; - const T33 v33_; - const T34 v34_; - const T35 v35_; - const T36 v36_; -}; - -template -class ValueArray37 { - public: - ValueArray37(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, - T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, - T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, - T26 v26, T27 v27, T28 v28, T29 v29, T30 v30, T31 v31, T32 v32, T33 v33, - T34 v34, T35 v35, T36 v36, T37 v37) : v1_(v1), v2_(v2), v3_(v3), v4_(v4), - v5_(v5), v6_(v6), v7_(v7), v8_(v8), v9_(v9), v10_(v10), v11_(v11), - v12_(v12), v13_(v13), v14_(v14), v15_(v15), v16_(v16), v17_(v17), - v18_(v18), v19_(v19), v20_(v20), v21_(v21), v22_(v22), v23_(v23), - v24_(v24), v25_(v25), v26_(v26), v27_(v27), v28_(v28), v29_(v29), - v30_(v30), v31_(v31), v32_(v32), v33_(v33), v34_(v34), v35_(v35), - v36_(v36), v37_(v37) {} - - template - operator ParamGenerator() const { - const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_, v8_, v9_, v10_, v11_, - v12_, v13_, v14_, v15_, v16_, v17_, v18_, v19_, v20_, v21_, v22_, v23_, - v24_, v25_, v26_, v27_, v28_, v29_, v30_, v31_, v32_, v33_, v34_, v35_, - v36_, v37_}; - return ValuesIn(array); - } - - private: - // No implementation - assignment is unsupported. - void operator=(const ValueArray37& other); - - const T1 v1_; - const T2 v2_; - const T3 v3_; - const T4 v4_; - const T5 v5_; - const T6 v6_; - const T7 v7_; - const T8 v8_; - const T9 v9_; - const T10 v10_; - const T11 v11_; - const T12 v12_; - const T13 v13_; - const T14 v14_; - const T15 v15_; - const T16 v16_; - const T17 v17_; - const T18 v18_; - const T19 v19_; - const T20 v20_; - const T21 v21_; - const T22 v22_; - const T23 v23_; - const T24 v24_; - const T25 v25_; - const T26 v26_; - const T27 v27_; - const T28 v28_; - const T29 v29_; - const T30 v30_; - const T31 v31_; - const T32 v32_; - const T33 v33_; - const T34 v34_; - const T35 v35_; - const T36 v36_; - const T37 v37_; -}; - -template -class ValueArray38 { - public: - ValueArray38(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, - T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, - T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, - T26 v26, T27 v27, T28 v28, T29 v29, T30 v30, T31 v31, T32 v32, T33 v33, - T34 v34, T35 v35, T36 v36, T37 v37, T38 v38) : v1_(v1), v2_(v2), v3_(v3), - v4_(v4), v5_(v5), v6_(v6), v7_(v7), v8_(v8), v9_(v9), v10_(v10), - v11_(v11), v12_(v12), v13_(v13), v14_(v14), v15_(v15), v16_(v16), - v17_(v17), v18_(v18), v19_(v19), v20_(v20), v21_(v21), v22_(v22), - v23_(v23), v24_(v24), v25_(v25), v26_(v26), v27_(v27), v28_(v28), - v29_(v29), v30_(v30), v31_(v31), v32_(v32), v33_(v33), v34_(v34), - v35_(v35), v36_(v36), v37_(v37), v38_(v38) {} - - template - operator ParamGenerator() const { - const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_, v8_, v9_, v10_, v11_, - v12_, v13_, v14_, v15_, v16_, v17_, v18_, v19_, v20_, v21_, v22_, v23_, - v24_, v25_, v26_, v27_, v28_, v29_, v30_, v31_, v32_, v33_, v34_, v35_, - v36_, v37_, v38_}; - return ValuesIn(array); - } - - private: - // No implementation - assignment is unsupported. - void operator=(const ValueArray38& other); - - const T1 v1_; - const T2 v2_; - const T3 v3_; - const T4 v4_; - const T5 v5_; - const T6 v6_; - const T7 v7_; - const T8 v8_; - const T9 v9_; - const T10 v10_; - const T11 v11_; - const T12 v12_; - const T13 v13_; - const T14 v14_; - const T15 v15_; - const T16 v16_; - const T17 v17_; - const T18 v18_; - const T19 v19_; - const T20 v20_; - const T21 v21_; - const T22 v22_; - const T23 v23_; - const T24 v24_; - const T25 v25_; - const T26 v26_; - const T27 v27_; - const T28 v28_; - const T29 v29_; - const T30 v30_; - const T31 v31_; - const T32 v32_; - const T33 v33_; - const T34 v34_; - const T35 v35_; - const T36 v36_; - const T37 v37_; - const T38 v38_; -}; - -template -class ValueArray39 { - public: - ValueArray39(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, - T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, - T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, - T26 v26, T27 v27, T28 v28, T29 v29, T30 v30, T31 v31, T32 v32, T33 v33, - T34 v34, T35 v35, T36 v36, T37 v37, T38 v38, T39 v39) : v1_(v1), v2_(v2), - v3_(v3), v4_(v4), v5_(v5), v6_(v6), v7_(v7), v8_(v8), v9_(v9), v10_(v10), - v11_(v11), v12_(v12), v13_(v13), v14_(v14), v15_(v15), v16_(v16), - v17_(v17), v18_(v18), v19_(v19), v20_(v20), v21_(v21), v22_(v22), - v23_(v23), v24_(v24), v25_(v25), v26_(v26), v27_(v27), v28_(v28), - v29_(v29), v30_(v30), v31_(v31), v32_(v32), v33_(v33), v34_(v34), - v35_(v35), v36_(v36), v37_(v37), v38_(v38), v39_(v39) {} - - template - operator ParamGenerator() const { - const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_, v8_, v9_, v10_, v11_, - v12_, v13_, v14_, v15_, v16_, v17_, v18_, v19_, v20_, v21_, v22_, v23_, - v24_, v25_, v26_, v27_, v28_, v29_, v30_, v31_, v32_, v33_, v34_, v35_, - v36_, v37_, v38_, v39_}; - return ValuesIn(array); - } - - private: - // No implementation - assignment is unsupported. - void operator=(const ValueArray39& other); - - const T1 v1_; - const T2 v2_; - const T3 v3_; - const T4 v4_; - const T5 v5_; - const T6 v6_; - const T7 v7_; - const T8 v8_; - const T9 v9_; - const T10 v10_; - const T11 v11_; - const T12 v12_; - const T13 v13_; - const T14 v14_; - const T15 v15_; - const T16 v16_; - const T17 v17_; - const T18 v18_; - const T19 v19_; - const T20 v20_; - const T21 v21_; - const T22 v22_; - const T23 v23_; - const T24 v24_; - const T25 v25_; - const T26 v26_; - const T27 v27_; - const T28 v28_; - const T29 v29_; - const T30 v30_; - const T31 v31_; - const T32 v32_; - const T33 v33_; - const T34 v34_; - const T35 v35_; - const T36 v36_; - const T37 v37_; - const T38 v38_; - const T39 v39_; -}; - -template -class ValueArray40 { - public: - ValueArray40(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, - T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, - T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, - T26 v26, T27 v27, T28 v28, T29 v29, T30 v30, T31 v31, T32 v32, T33 v33, - T34 v34, T35 v35, T36 v36, T37 v37, T38 v38, T39 v39, T40 v40) : v1_(v1), - v2_(v2), v3_(v3), v4_(v4), v5_(v5), v6_(v6), v7_(v7), v8_(v8), v9_(v9), - v10_(v10), v11_(v11), v12_(v12), v13_(v13), v14_(v14), v15_(v15), - v16_(v16), v17_(v17), v18_(v18), v19_(v19), v20_(v20), v21_(v21), - v22_(v22), v23_(v23), v24_(v24), v25_(v25), v26_(v26), v27_(v27), - v28_(v28), v29_(v29), v30_(v30), v31_(v31), v32_(v32), v33_(v33), - v34_(v34), v35_(v35), v36_(v36), v37_(v37), v38_(v38), v39_(v39), - v40_(v40) {} - - template - operator ParamGenerator() const { - const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_, v8_, v9_, v10_, v11_, - v12_, v13_, v14_, v15_, v16_, v17_, v18_, v19_, v20_, v21_, v22_, v23_, - v24_, v25_, v26_, v27_, v28_, v29_, v30_, v31_, v32_, v33_, v34_, v35_, - v36_, v37_, v38_, v39_, v40_}; - return ValuesIn(array); - } - - private: - // No implementation - assignment is unsupported. - void operator=(const ValueArray40& other); - - const T1 v1_; - const T2 v2_; - const T3 v3_; - const T4 v4_; - const T5 v5_; - const T6 v6_; - const T7 v7_; - const T8 v8_; - const T9 v9_; - const T10 v10_; - const T11 v11_; - const T12 v12_; - const T13 v13_; - const T14 v14_; - const T15 v15_; - const T16 v16_; - const T17 v17_; - const T18 v18_; - const T19 v19_; - const T20 v20_; - const T21 v21_; - const T22 v22_; - const T23 v23_; - const T24 v24_; - const T25 v25_; - const T26 v26_; - const T27 v27_; - const T28 v28_; - const T29 v29_; - const T30 v30_; - const T31 v31_; - const T32 v32_; - const T33 v33_; - const T34 v34_; - const T35 v35_; - const T36 v36_; - const T37 v37_; - const T38 v38_; - const T39 v39_; - const T40 v40_; -}; - -template -class ValueArray41 { - public: - ValueArray41(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, - T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, - T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, - T26 v26, T27 v27, T28 v28, T29 v29, T30 v30, T31 v31, T32 v32, T33 v33, - T34 v34, T35 v35, T36 v36, T37 v37, T38 v38, T39 v39, T40 v40, - T41 v41) : v1_(v1), v2_(v2), v3_(v3), v4_(v4), v5_(v5), v6_(v6), v7_(v7), - v8_(v8), v9_(v9), v10_(v10), v11_(v11), v12_(v12), v13_(v13), v14_(v14), - v15_(v15), v16_(v16), v17_(v17), v18_(v18), v19_(v19), v20_(v20), - v21_(v21), v22_(v22), v23_(v23), v24_(v24), v25_(v25), v26_(v26), - v27_(v27), v28_(v28), v29_(v29), v30_(v30), v31_(v31), v32_(v32), - v33_(v33), v34_(v34), v35_(v35), v36_(v36), v37_(v37), v38_(v38), - v39_(v39), v40_(v40), v41_(v41) {} - - template - operator ParamGenerator() const { - const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_, v8_, v9_, v10_, v11_, - v12_, v13_, v14_, v15_, v16_, v17_, v18_, v19_, v20_, v21_, v22_, v23_, - v24_, v25_, v26_, v27_, v28_, v29_, v30_, v31_, v32_, v33_, v34_, v35_, - v36_, v37_, v38_, v39_, v40_, v41_}; - return ValuesIn(array); - } - - private: - // No implementation - assignment is unsupported. - void operator=(const ValueArray41& other); - - const T1 v1_; - const T2 v2_; - const T3 v3_; - const T4 v4_; - const T5 v5_; - const T6 v6_; - const T7 v7_; - const T8 v8_; - const T9 v9_; - const T10 v10_; - const T11 v11_; - const T12 v12_; - const T13 v13_; - const T14 v14_; - const T15 v15_; - const T16 v16_; - const T17 v17_; - const T18 v18_; - const T19 v19_; - const T20 v20_; - const T21 v21_; - const T22 v22_; - const T23 v23_; - const T24 v24_; - const T25 v25_; - const T26 v26_; - const T27 v27_; - const T28 v28_; - const T29 v29_; - const T30 v30_; - const T31 v31_; - const T32 v32_; - const T33 v33_; - const T34 v34_; - const T35 v35_; - const T36 v36_; - const T37 v37_; - const T38 v38_; - const T39 v39_; - const T40 v40_; - const T41 v41_; -}; - -template -class ValueArray42 { - public: - ValueArray42(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, - T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, - T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, - T26 v26, T27 v27, T28 v28, T29 v29, T30 v30, T31 v31, T32 v32, T33 v33, - T34 v34, T35 v35, T36 v36, T37 v37, T38 v38, T39 v39, T40 v40, T41 v41, - T42 v42) : v1_(v1), v2_(v2), v3_(v3), v4_(v4), v5_(v5), v6_(v6), v7_(v7), - v8_(v8), v9_(v9), v10_(v10), v11_(v11), v12_(v12), v13_(v13), v14_(v14), - v15_(v15), v16_(v16), v17_(v17), v18_(v18), v19_(v19), v20_(v20), - v21_(v21), v22_(v22), v23_(v23), v24_(v24), v25_(v25), v26_(v26), - v27_(v27), v28_(v28), v29_(v29), v30_(v30), v31_(v31), v32_(v32), - v33_(v33), v34_(v34), v35_(v35), v36_(v36), v37_(v37), v38_(v38), - v39_(v39), v40_(v40), v41_(v41), v42_(v42) {} - - template - operator ParamGenerator() const { - const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_, v8_, v9_, v10_, v11_, - v12_, v13_, v14_, v15_, v16_, v17_, v18_, v19_, v20_, v21_, v22_, v23_, - v24_, v25_, v26_, v27_, v28_, v29_, v30_, v31_, v32_, v33_, v34_, v35_, - v36_, v37_, v38_, v39_, v40_, v41_, v42_}; - return ValuesIn(array); - } - - private: - // No implementation - assignment is unsupported. - void operator=(const ValueArray42& other); - - const T1 v1_; - const T2 v2_; - const T3 v3_; - const T4 v4_; - const T5 v5_; - const T6 v6_; - const T7 v7_; - const T8 v8_; - const T9 v9_; - const T10 v10_; - const T11 v11_; - const T12 v12_; - const T13 v13_; - const T14 v14_; - const T15 v15_; - const T16 v16_; - const T17 v17_; - const T18 v18_; - const T19 v19_; - const T20 v20_; - const T21 v21_; - const T22 v22_; - const T23 v23_; - const T24 v24_; - const T25 v25_; - const T26 v26_; - const T27 v27_; - const T28 v28_; - const T29 v29_; - const T30 v30_; - const T31 v31_; - const T32 v32_; - const T33 v33_; - const T34 v34_; - const T35 v35_; - const T36 v36_; - const T37 v37_; - const T38 v38_; - const T39 v39_; - const T40 v40_; - const T41 v41_; - const T42 v42_; -}; - -template -class ValueArray43 { - public: - ValueArray43(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, - T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, - T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, - T26 v26, T27 v27, T28 v28, T29 v29, T30 v30, T31 v31, T32 v32, T33 v33, - T34 v34, T35 v35, T36 v36, T37 v37, T38 v38, T39 v39, T40 v40, T41 v41, - T42 v42, T43 v43) : v1_(v1), v2_(v2), v3_(v3), v4_(v4), v5_(v5), v6_(v6), - v7_(v7), v8_(v8), v9_(v9), v10_(v10), v11_(v11), v12_(v12), v13_(v13), - v14_(v14), v15_(v15), v16_(v16), v17_(v17), v18_(v18), v19_(v19), - v20_(v20), v21_(v21), v22_(v22), v23_(v23), v24_(v24), v25_(v25), - v26_(v26), v27_(v27), v28_(v28), v29_(v29), v30_(v30), v31_(v31), - v32_(v32), v33_(v33), v34_(v34), v35_(v35), v36_(v36), v37_(v37), - v38_(v38), v39_(v39), v40_(v40), v41_(v41), v42_(v42), v43_(v43) {} - - template - operator ParamGenerator() const { - const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_, v8_, v9_, v10_, v11_, - v12_, v13_, v14_, v15_, v16_, v17_, v18_, v19_, v20_, v21_, v22_, v23_, - v24_, v25_, v26_, v27_, v28_, v29_, v30_, v31_, v32_, v33_, v34_, v35_, - v36_, v37_, v38_, v39_, v40_, v41_, v42_, v43_}; - return ValuesIn(array); - } - - private: - // No implementation - assignment is unsupported. - void operator=(const ValueArray43& other); - - const T1 v1_; - const T2 v2_; - const T3 v3_; - const T4 v4_; - const T5 v5_; - const T6 v6_; - const T7 v7_; - const T8 v8_; - const T9 v9_; - const T10 v10_; - const T11 v11_; - const T12 v12_; - const T13 v13_; - const T14 v14_; - const T15 v15_; - const T16 v16_; - const T17 v17_; - const T18 v18_; - const T19 v19_; - const T20 v20_; - const T21 v21_; - const T22 v22_; - const T23 v23_; - const T24 v24_; - const T25 v25_; - const T26 v26_; - const T27 v27_; - const T28 v28_; - const T29 v29_; - const T30 v30_; - const T31 v31_; - const T32 v32_; - const T33 v33_; - const T34 v34_; - const T35 v35_; - const T36 v36_; - const T37 v37_; - const T38 v38_; - const T39 v39_; - const T40 v40_; - const T41 v41_; - const T42 v42_; - const T43 v43_; -}; - -template -class ValueArray44 { - public: - ValueArray44(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, - T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, - T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, - T26 v26, T27 v27, T28 v28, T29 v29, T30 v30, T31 v31, T32 v32, T33 v33, - T34 v34, T35 v35, T36 v36, T37 v37, T38 v38, T39 v39, T40 v40, T41 v41, - T42 v42, T43 v43, T44 v44) : v1_(v1), v2_(v2), v3_(v3), v4_(v4), v5_(v5), - v6_(v6), v7_(v7), v8_(v8), v9_(v9), v10_(v10), v11_(v11), v12_(v12), - v13_(v13), v14_(v14), v15_(v15), v16_(v16), v17_(v17), v18_(v18), - v19_(v19), v20_(v20), v21_(v21), v22_(v22), v23_(v23), v24_(v24), - v25_(v25), v26_(v26), v27_(v27), v28_(v28), v29_(v29), v30_(v30), - v31_(v31), v32_(v32), v33_(v33), v34_(v34), v35_(v35), v36_(v36), - v37_(v37), v38_(v38), v39_(v39), v40_(v40), v41_(v41), v42_(v42), - v43_(v43), v44_(v44) {} - - template - operator ParamGenerator() const { - const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_, v8_, v9_, v10_, v11_, - v12_, v13_, v14_, v15_, v16_, v17_, v18_, v19_, v20_, v21_, v22_, v23_, - v24_, v25_, v26_, v27_, v28_, v29_, v30_, v31_, v32_, v33_, v34_, v35_, - v36_, v37_, v38_, v39_, v40_, v41_, v42_, v43_, v44_}; - return ValuesIn(array); - } - - private: - // No implementation - assignment is unsupported. - void operator=(const ValueArray44& other); - - const T1 v1_; - const T2 v2_; - const T3 v3_; - const T4 v4_; - const T5 v5_; - const T6 v6_; - const T7 v7_; - const T8 v8_; - const T9 v9_; - const T10 v10_; - const T11 v11_; - const T12 v12_; - const T13 v13_; - const T14 v14_; - const T15 v15_; - const T16 v16_; - const T17 v17_; - const T18 v18_; - const T19 v19_; - const T20 v20_; - const T21 v21_; - const T22 v22_; - const T23 v23_; - const T24 v24_; - const T25 v25_; - const T26 v26_; - const T27 v27_; - const T28 v28_; - const T29 v29_; - const T30 v30_; - const T31 v31_; - const T32 v32_; - const T33 v33_; - const T34 v34_; - const T35 v35_; - const T36 v36_; - const T37 v37_; - const T38 v38_; - const T39 v39_; - const T40 v40_; - const T41 v41_; - const T42 v42_; - const T43 v43_; - const T44 v44_; -}; - -template -class ValueArray45 { - public: - ValueArray45(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, - T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, - T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, - T26 v26, T27 v27, T28 v28, T29 v29, T30 v30, T31 v31, T32 v32, T33 v33, - T34 v34, T35 v35, T36 v36, T37 v37, T38 v38, T39 v39, T40 v40, T41 v41, - T42 v42, T43 v43, T44 v44, T45 v45) : v1_(v1), v2_(v2), v3_(v3), v4_(v4), - v5_(v5), v6_(v6), v7_(v7), v8_(v8), v9_(v9), v10_(v10), v11_(v11), - v12_(v12), v13_(v13), v14_(v14), v15_(v15), v16_(v16), v17_(v17), - v18_(v18), v19_(v19), v20_(v20), v21_(v21), v22_(v22), v23_(v23), - v24_(v24), v25_(v25), v26_(v26), v27_(v27), v28_(v28), v29_(v29), - v30_(v30), v31_(v31), v32_(v32), v33_(v33), v34_(v34), v35_(v35), - v36_(v36), v37_(v37), v38_(v38), v39_(v39), v40_(v40), v41_(v41), - v42_(v42), v43_(v43), v44_(v44), v45_(v45) {} - - template - operator ParamGenerator() const { - const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_, v8_, v9_, v10_, v11_, - v12_, v13_, v14_, v15_, v16_, v17_, v18_, v19_, v20_, v21_, v22_, v23_, - v24_, v25_, v26_, v27_, v28_, v29_, v30_, v31_, v32_, v33_, v34_, v35_, - v36_, v37_, v38_, v39_, v40_, v41_, v42_, v43_, v44_, v45_}; - return ValuesIn(array); - } - - private: - // No implementation - assignment is unsupported. - void operator=(const ValueArray45& other); - - const T1 v1_; - const T2 v2_; - const T3 v3_; - const T4 v4_; - const T5 v5_; - const T6 v6_; - const T7 v7_; - const T8 v8_; - const T9 v9_; - const T10 v10_; - const T11 v11_; - const T12 v12_; - const T13 v13_; - const T14 v14_; - const T15 v15_; - const T16 v16_; - const T17 v17_; - const T18 v18_; - const T19 v19_; - const T20 v20_; - const T21 v21_; - const T22 v22_; - const T23 v23_; - const T24 v24_; - const T25 v25_; - const T26 v26_; - const T27 v27_; - const T28 v28_; - const T29 v29_; - const T30 v30_; - const T31 v31_; - const T32 v32_; - const T33 v33_; - const T34 v34_; - const T35 v35_; - const T36 v36_; - const T37 v37_; - const T38 v38_; - const T39 v39_; - const T40 v40_; - const T41 v41_; - const T42 v42_; - const T43 v43_; - const T44 v44_; - const T45 v45_; -}; - -template -class ValueArray46 { - public: - ValueArray46(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, - T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, - T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, - T26 v26, T27 v27, T28 v28, T29 v29, T30 v30, T31 v31, T32 v32, T33 v33, - T34 v34, T35 v35, T36 v36, T37 v37, T38 v38, T39 v39, T40 v40, T41 v41, - T42 v42, T43 v43, T44 v44, T45 v45, T46 v46) : v1_(v1), v2_(v2), v3_(v3), - v4_(v4), v5_(v5), v6_(v6), v7_(v7), v8_(v8), v9_(v9), v10_(v10), - v11_(v11), v12_(v12), v13_(v13), v14_(v14), v15_(v15), v16_(v16), - v17_(v17), v18_(v18), v19_(v19), v20_(v20), v21_(v21), v22_(v22), - v23_(v23), v24_(v24), v25_(v25), v26_(v26), v27_(v27), v28_(v28), - v29_(v29), v30_(v30), v31_(v31), v32_(v32), v33_(v33), v34_(v34), - v35_(v35), v36_(v36), v37_(v37), v38_(v38), v39_(v39), v40_(v40), - v41_(v41), v42_(v42), v43_(v43), v44_(v44), v45_(v45), v46_(v46) {} - - template - operator ParamGenerator() const { - const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_, v8_, v9_, v10_, v11_, - v12_, v13_, v14_, v15_, v16_, v17_, v18_, v19_, v20_, v21_, v22_, v23_, - v24_, v25_, v26_, v27_, v28_, v29_, v30_, v31_, v32_, v33_, v34_, v35_, - v36_, v37_, v38_, v39_, v40_, v41_, v42_, v43_, v44_, v45_, v46_}; - return ValuesIn(array); - } - - private: - // No implementation - assignment is unsupported. - void operator=(const ValueArray46& other); - - const T1 v1_; - const T2 v2_; - const T3 v3_; - const T4 v4_; - const T5 v5_; - const T6 v6_; - const T7 v7_; - const T8 v8_; - const T9 v9_; - const T10 v10_; - const T11 v11_; - const T12 v12_; - const T13 v13_; - const T14 v14_; - const T15 v15_; - const T16 v16_; - const T17 v17_; - const T18 v18_; - const T19 v19_; - const T20 v20_; - const T21 v21_; - const T22 v22_; - const T23 v23_; - const T24 v24_; - const T25 v25_; - const T26 v26_; - const T27 v27_; - const T28 v28_; - const T29 v29_; - const T30 v30_; - const T31 v31_; - const T32 v32_; - const T33 v33_; - const T34 v34_; - const T35 v35_; - const T36 v36_; - const T37 v37_; - const T38 v38_; - const T39 v39_; - const T40 v40_; - const T41 v41_; - const T42 v42_; - const T43 v43_; - const T44 v44_; - const T45 v45_; - const T46 v46_; -}; - -template -class ValueArray47 { - public: - ValueArray47(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, - T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, - T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, - T26 v26, T27 v27, T28 v28, T29 v29, T30 v30, T31 v31, T32 v32, T33 v33, - T34 v34, T35 v35, T36 v36, T37 v37, T38 v38, T39 v39, T40 v40, T41 v41, - T42 v42, T43 v43, T44 v44, T45 v45, T46 v46, T47 v47) : v1_(v1), v2_(v2), - v3_(v3), v4_(v4), v5_(v5), v6_(v6), v7_(v7), v8_(v8), v9_(v9), v10_(v10), - v11_(v11), v12_(v12), v13_(v13), v14_(v14), v15_(v15), v16_(v16), - v17_(v17), v18_(v18), v19_(v19), v20_(v20), v21_(v21), v22_(v22), - v23_(v23), v24_(v24), v25_(v25), v26_(v26), v27_(v27), v28_(v28), - v29_(v29), v30_(v30), v31_(v31), v32_(v32), v33_(v33), v34_(v34), - v35_(v35), v36_(v36), v37_(v37), v38_(v38), v39_(v39), v40_(v40), - v41_(v41), v42_(v42), v43_(v43), v44_(v44), v45_(v45), v46_(v46), - v47_(v47) {} - - template - operator ParamGenerator() const { - const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_, v8_, v9_, v10_, v11_, - v12_, v13_, v14_, v15_, v16_, v17_, v18_, v19_, v20_, v21_, v22_, v23_, - v24_, v25_, v26_, v27_, v28_, v29_, v30_, v31_, v32_, v33_, v34_, v35_, - v36_, v37_, v38_, v39_, v40_, v41_, v42_, v43_, v44_, v45_, v46_, - v47_}; - return ValuesIn(array); - } - - private: - // No implementation - assignment is unsupported. - void operator=(const ValueArray47& other); - - const T1 v1_; - const T2 v2_; - const T3 v3_; - const T4 v4_; - const T5 v5_; - const T6 v6_; - const T7 v7_; - const T8 v8_; - const T9 v9_; - const T10 v10_; - const T11 v11_; - const T12 v12_; - const T13 v13_; - const T14 v14_; - const T15 v15_; - const T16 v16_; - const T17 v17_; - const T18 v18_; - const T19 v19_; - const T20 v20_; - const T21 v21_; - const T22 v22_; - const T23 v23_; - const T24 v24_; - const T25 v25_; - const T26 v26_; - const T27 v27_; - const T28 v28_; - const T29 v29_; - const T30 v30_; - const T31 v31_; - const T32 v32_; - const T33 v33_; - const T34 v34_; - const T35 v35_; - const T36 v36_; - const T37 v37_; - const T38 v38_; - const T39 v39_; - const T40 v40_; - const T41 v41_; - const T42 v42_; - const T43 v43_; - const T44 v44_; - const T45 v45_; - const T46 v46_; - const T47 v47_; -}; - -template -class ValueArray48 { - public: - ValueArray48(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, - T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, - T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, - T26 v26, T27 v27, T28 v28, T29 v29, T30 v30, T31 v31, T32 v32, T33 v33, - T34 v34, T35 v35, T36 v36, T37 v37, T38 v38, T39 v39, T40 v40, T41 v41, - T42 v42, T43 v43, T44 v44, T45 v45, T46 v46, T47 v47, T48 v48) : v1_(v1), - v2_(v2), v3_(v3), v4_(v4), v5_(v5), v6_(v6), v7_(v7), v8_(v8), v9_(v9), - v10_(v10), v11_(v11), v12_(v12), v13_(v13), v14_(v14), v15_(v15), - v16_(v16), v17_(v17), v18_(v18), v19_(v19), v20_(v20), v21_(v21), - v22_(v22), v23_(v23), v24_(v24), v25_(v25), v26_(v26), v27_(v27), - v28_(v28), v29_(v29), v30_(v30), v31_(v31), v32_(v32), v33_(v33), - v34_(v34), v35_(v35), v36_(v36), v37_(v37), v38_(v38), v39_(v39), - v40_(v40), v41_(v41), v42_(v42), v43_(v43), v44_(v44), v45_(v45), - v46_(v46), v47_(v47), v48_(v48) {} - - template - operator ParamGenerator() const { - const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_, v8_, v9_, v10_, v11_, - v12_, v13_, v14_, v15_, v16_, v17_, v18_, v19_, v20_, v21_, v22_, v23_, - v24_, v25_, v26_, v27_, v28_, v29_, v30_, v31_, v32_, v33_, v34_, v35_, - v36_, v37_, v38_, v39_, v40_, v41_, v42_, v43_, v44_, v45_, v46_, v47_, - v48_}; - return ValuesIn(array); - } - - private: - // No implementation - assignment is unsupported. - void operator=(const ValueArray48& other); - - const T1 v1_; - const T2 v2_; - const T3 v3_; - const T4 v4_; - const T5 v5_; - const T6 v6_; - const T7 v7_; - const T8 v8_; - const T9 v9_; - const T10 v10_; - const T11 v11_; - const T12 v12_; - const T13 v13_; - const T14 v14_; - const T15 v15_; - const T16 v16_; - const T17 v17_; - const T18 v18_; - const T19 v19_; - const T20 v20_; - const T21 v21_; - const T22 v22_; - const T23 v23_; - const T24 v24_; - const T25 v25_; - const T26 v26_; - const T27 v27_; - const T28 v28_; - const T29 v29_; - const T30 v30_; - const T31 v31_; - const T32 v32_; - const T33 v33_; - const T34 v34_; - const T35 v35_; - const T36 v36_; - const T37 v37_; - const T38 v38_; - const T39 v39_; - const T40 v40_; - const T41 v41_; - const T42 v42_; - const T43 v43_; - const T44 v44_; - const T45 v45_; - const T46 v46_; - const T47 v47_; - const T48 v48_; -}; - -template -class ValueArray49 { - public: - ValueArray49(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, - T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, - T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, - T26 v26, T27 v27, T28 v28, T29 v29, T30 v30, T31 v31, T32 v32, T33 v33, - T34 v34, T35 v35, T36 v36, T37 v37, T38 v38, T39 v39, T40 v40, T41 v41, - T42 v42, T43 v43, T44 v44, T45 v45, T46 v46, T47 v47, T48 v48, - T49 v49) : v1_(v1), v2_(v2), v3_(v3), v4_(v4), v5_(v5), v6_(v6), v7_(v7), - v8_(v8), v9_(v9), v10_(v10), v11_(v11), v12_(v12), v13_(v13), v14_(v14), - v15_(v15), v16_(v16), v17_(v17), v18_(v18), v19_(v19), v20_(v20), - v21_(v21), v22_(v22), v23_(v23), v24_(v24), v25_(v25), v26_(v26), - v27_(v27), v28_(v28), v29_(v29), v30_(v30), v31_(v31), v32_(v32), - v33_(v33), v34_(v34), v35_(v35), v36_(v36), v37_(v37), v38_(v38), - v39_(v39), v40_(v40), v41_(v41), v42_(v42), v43_(v43), v44_(v44), - v45_(v45), v46_(v46), v47_(v47), v48_(v48), v49_(v49) {} - - template - operator ParamGenerator() const { - const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_, v8_, v9_, v10_, v11_, - v12_, v13_, v14_, v15_, v16_, v17_, v18_, v19_, v20_, v21_, v22_, v23_, - v24_, v25_, v26_, v27_, v28_, v29_, v30_, v31_, v32_, v33_, v34_, v35_, - v36_, v37_, v38_, v39_, v40_, v41_, v42_, v43_, v44_, v45_, v46_, v47_, - v48_, v49_}; - return ValuesIn(array); - } - - private: - // No implementation - assignment is unsupported. - void operator=(const ValueArray49& other); - - const T1 v1_; - const T2 v2_; - const T3 v3_; - const T4 v4_; - const T5 v5_; - const T6 v6_; - const T7 v7_; - const T8 v8_; - const T9 v9_; - const T10 v10_; - const T11 v11_; - const T12 v12_; - const T13 v13_; - const T14 v14_; - const T15 v15_; - const T16 v16_; - const T17 v17_; - const T18 v18_; - const T19 v19_; - const T20 v20_; - const T21 v21_; - const T22 v22_; - const T23 v23_; - const T24 v24_; - const T25 v25_; - const T26 v26_; - const T27 v27_; - const T28 v28_; - const T29 v29_; - const T30 v30_; - const T31 v31_; - const T32 v32_; - const T33 v33_; - const T34 v34_; - const T35 v35_; - const T36 v36_; - const T37 v37_; - const T38 v38_; - const T39 v39_; - const T40 v40_; - const T41 v41_; - const T42 v42_; - const T43 v43_; - const T44 v44_; - const T45 v45_; - const T46 v46_; - const T47 v47_; - const T48 v48_; - const T49 v49_; -}; - -template -class ValueArray50 { - public: - ValueArray50(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, - T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, - T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, - T26 v26, T27 v27, T28 v28, T29 v29, T30 v30, T31 v31, T32 v32, T33 v33, - T34 v34, T35 v35, T36 v36, T37 v37, T38 v38, T39 v39, T40 v40, T41 v41, - T42 v42, T43 v43, T44 v44, T45 v45, T46 v46, T47 v47, T48 v48, T49 v49, - T50 v50) : v1_(v1), v2_(v2), v3_(v3), v4_(v4), v5_(v5), v6_(v6), v7_(v7), - v8_(v8), v9_(v9), v10_(v10), v11_(v11), v12_(v12), v13_(v13), v14_(v14), - v15_(v15), v16_(v16), v17_(v17), v18_(v18), v19_(v19), v20_(v20), - v21_(v21), v22_(v22), v23_(v23), v24_(v24), v25_(v25), v26_(v26), - v27_(v27), v28_(v28), v29_(v29), v30_(v30), v31_(v31), v32_(v32), - v33_(v33), v34_(v34), v35_(v35), v36_(v36), v37_(v37), v38_(v38), - v39_(v39), v40_(v40), v41_(v41), v42_(v42), v43_(v43), v44_(v44), - v45_(v45), v46_(v46), v47_(v47), v48_(v48), v49_(v49), v50_(v50) {} - - template - operator ParamGenerator() const { - const T array[] = {v1_, v2_, v3_, v4_, v5_, v6_, v7_, v8_, v9_, v10_, v11_, - v12_, v13_, v14_, v15_, v16_, v17_, v18_, v19_, v20_, v21_, v22_, v23_, - v24_, v25_, v26_, v27_, v28_, v29_, v30_, v31_, v32_, v33_, v34_, v35_, - v36_, v37_, v38_, v39_, v40_, v41_, v42_, v43_, v44_, v45_, v46_, v47_, - v48_, v49_, v50_}; - return ValuesIn(array); - } - - private: - // No implementation - assignment is unsupported. - void operator=(const ValueArray50& other); - - const T1 v1_; - const T2 v2_; - const T3 v3_; - const T4 v4_; - const T5 v5_; - const T6 v6_; - const T7 v7_; - const T8 v8_; - const T9 v9_; - const T10 v10_; - const T11 v11_; - const T12 v12_; - const T13 v13_; - const T14 v14_; - const T15 v15_; - const T16 v16_; - const T17 v17_; - const T18 v18_; - const T19 v19_; - const T20 v20_; - const T21 v21_; - const T22 v22_; - const T23 v23_; - const T24 v24_; - const T25 v25_; - const T26 v26_; - const T27 v27_; - const T28 v28_; - const T29 v29_; - const T30 v30_; - const T31 v31_; - const T32 v32_; - const T33 v33_; - const T34 v34_; - const T35 v35_; - const T36 v36_; - const T37 v37_; - const T38 v38_; - const T39 v39_; - const T40 v40_; - const T41 v41_; - const T42 v42_; - const T43 v43_; - const T44 v44_; - const T45 v45_; - const T46 v46_; - const T47 v47_; - const T48 v48_; - const T49 v49_; - const T50 v50_; -}; - -# if GTEST_HAS_COMBINE -// INTERNAL IMPLEMENTATION - DO NOT USE IN USER CODE. -// -// Generates values from the Cartesian product of values produced -// by the argument generators. -// -template -class CartesianProductGenerator2 - : public ParamGeneratorInterface< ::std::tr1::tuple > { - public: - typedef ::std::tr1::tuple ParamType; - - CartesianProductGenerator2(const ParamGenerator& g1, - const ParamGenerator& g2) - : g1_(g1), g2_(g2) {} - virtual ~CartesianProductGenerator2() {} - - virtual ParamIteratorInterface* Begin() const { - return new Iterator(this, g1_, g1_.begin(), g2_, g2_.begin()); - } - virtual ParamIteratorInterface* End() const { - return new Iterator(this, g1_, g1_.end(), g2_, g2_.end()); - } - - private: - class Iterator : public ParamIteratorInterface { - public: - Iterator(const ParamGeneratorInterface* base, - const ParamGenerator& g1, - const typename ParamGenerator::iterator& current1, - const ParamGenerator& g2, - const typename ParamGenerator::iterator& current2) - : base_(base), - begin1_(g1.begin()), end1_(g1.end()), current1_(current1), - begin2_(g2.begin()), end2_(g2.end()), current2_(current2) { - ComputeCurrentValue(); - } - virtual ~Iterator() {} - - virtual const ParamGeneratorInterface* BaseGenerator() const { - return base_; - } - // Advance should not be called on beyond-of-range iterators - // so no component iterators must be beyond end of range, either. - virtual void Advance() { - assert(!AtEnd()); - ++current2_; - if (current2_ == end2_) { - current2_ = begin2_; - ++current1_; - } - ComputeCurrentValue(); - } - virtual ParamIteratorInterface* Clone() const { - return new Iterator(*this); - } - virtual const ParamType* Current() const { return ¤t_value_; } - virtual bool Equals(const ParamIteratorInterface& other) const { - // Having the same base generator guarantees that the other - // iterator is of the same type and we can downcast. - GTEST_CHECK_(BaseGenerator() == other.BaseGenerator()) - << "The program attempted to compare iterators " - << "from different generators." << std::endl; - const Iterator* typed_other = - CheckedDowncastToActualType(&other); - // We must report iterators equal if they both point beyond their - // respective ranges. That can happen in a variety of fashions, - // so we have to consult AtEnd(). - return (AtEnd() && typed_other->AtEnd()) || - ( - current1_ == typed_other->current1_ && - current2_ == typed_other->current2_); - } - - private: - Iterator(const Iterator& other) - : base_(other.base_), - begin1_(other.begin1_), - end1_(other.end1_), - current1_(other.current1_), - begin2_(other.begin2_), - end2_(other.end2_), - current2_(other.current2_) { - ComputeCurrentValue(); - } - - void ComputeCurrentValue() { - if (!AtEnd()) - current_value_ = ParamType(*current1_, *current2_); - } - bool AtEnd() const { - // We must report iterator past the end of the range when either of the - // component iterators has reached the end of its range. - return - current1_ == end1_ || - current2_ == end2_; - } - - // No implementation - assignment is unsupported. - void operator=(const Iterator& other); - - const ParamGeneratorInterface* const base_; - // begin[i]_ and end[i]_ define the i-th range that Iterator traverses. - // current[i]_ is the actual traversing iterator. - const typename ParamGenerator::iterator begin1_; - const typename ParamGenerator::iterator end1_; - typename ParamGenerator::iterator current1_; - const typename ParamGenerator::iterator begin2_; - const typename ParamGenerator::iterator end2_; - typename ParamGenerator::iterator current2_; - ParamType current_value_; - }; // class CartesianProductGenerator2::Iterator - - // No implementation - assignment is unsupported. - void operator=(const CartesianProductGenerator2& other); - - const ParamGenerator g1_; - const ParamGenerator g2_; -}; // class CartesianProductGenerator2 - - -template -class CartesianProductGenerator3 - : public ParamGeneratorInterface< ::std::tr1::tuple > { - public: - typedef ::std::tr1::tuple ParamType; - - CartesianProductGenerator3(const ParamGenerator& g1, - const ParamGenerator& g2, const ParamGenerator& g3) - : g1_(g1), g2_(g2), g3_(g3) {} - virtual ~CartesianProductGenerator3() {} - - virtual ParamIteratorInterface* Begin() const { - return new Iterator(this, g1_, g1_.begin(), g2_, g2_.begin(), g3_, - g3_.begin()); - } - virtual ParamIteratorInterface* End() const { - return new Iterator(this, g1_, g1_.end(), g2_, g2_.end(), g3_, g3_.end()); - } - - private: - class Iterator : public ParamIteratorInterface { - public: - Iterator(const ParamGeneratorInterface* base, - const ParamGenerator& g1, - const typename ParamGenerator::iterator& current1, - const ParamGenerator& g2, - const typename ParamGenerator::iterator& current2, - const ParamGenerator& g3, - const typename ParamGenerator::iterator& current3) - : base_(base), - begin1_(g1.begin()), end1_(g1.end()), current1_(current1), - begin2_(g2.begin()), end2_(g2.end()), current2_(current2), - begin3_(g3.begin()), end3_(g3.end()), current3_(current3) { - ComputeCurrentValue(); - } - virtual ~Iterator() {} - - virtual const ParamGeneratorInterface* BaseGenerator() const { - return base_; - } - // Advance should not be called on beyond-of-range iterators - // so no component iterators must be beyond end of range, either. - virtual void Advance() { - assert(!AtEnd()); - ++current3_; - if (current3_ == end3_) { - current3_ = begin3_; - ++current2_; - } - if (current2_ == end2_) { - current2_ = begin2_; - ++current1_; - } - ComputeCurrentValue(); - } - virtual ParamIteratorInterface* Clone() const { - return new Iterator(*this); - } - virtual const ParamType* Current() const { return ¤t_value_; } - virtual bool Equals(const ParamIteratorInterface& other) const { - // Having the same base generator guarantees that the other - // iterator is of the same type and we can downcast. - GTEST_CHECK_(BaseGenerator() == other.BaseGenerator()) - << "The program attempted to compare iterators " - << "from different generators." << std::endl; - const Iterator* typed_other = - CheckedDowncastToActualType(&other); - // We must report iterators equal if they both point beyond their - // respective ranges. That can happen in a variety of fashions, - // so we have to consult AtEnd(). - return (AtEnd() && typed_other->AtEnd()) || - ( - current1_ == typed_other->current1_ && - current2_ == typed_other->current2_ && - current3_ == typed_other->current3_); - } - - private: - Iterator(const Iterator& other) - : base_(other.base_), - begin1_(other.begin1_), - end1_(other.end1_), - current1_(other.current1_), - begin2_(other.begin2_), - end2_(other.end2_), - current2_(other.current2_), - begin3_(other.begin3_), - end3_(other.end3_), - current3_(other.current3_) { - ComputeCurrentValue(); - } - - void ComputeCurrentValue() { - if (!AtEnd()) - current_value_ = ParamType(*current1_, *current2_, *current3_); - } - bool AtEnd() const { - // We must report iterator past the end of the range when either of the - // component iterators has reached the end of its range. - return - current1_ == end1_ || - current2_ == end2_ || - current3_ == end3_; - } - - // No implementation - assignment is unsupported. - void operator=(const Iterator& other); - - const ParamGeneratorInterface* const base_; - // begin[i]_ and end[i]_ define the i-th range that Iterator traverses. - // current[i]_ is the actual traversing iterator. - const typename ParamGenerator::iterator begin1_; - const typename ParamGenerator::iterator end1_; - typename ParamGenerator::iterator current1_; - const typename ParamGenerator::iterator begin2_; - const typename ParamGenerator::iterator end2_; - typename ParamGenerator::iterator current2_; - const typename ParamGenerator::iterator begin3_; - const typename ParamGenerator::iterator end3_; - typename ParamGenerator::iterator current3_; - ParamType current_value_; - }; // class CartesianProductGenerator3::Iterator - - // No implementation - assignment is unsupported. - void operator=(const CartesianProductGenerator3& other); - - const ParamGenerator g1_; - const ParamGenerator g2_; - const ParamGenerator g3_; -}; // class CartesianProductGenerator3 - - -template -class CartesianProductGenerator4 - : public ParamGeneratorInterface< ::std::tr1::tuple > { - public: - typedef ::std::tr1::tuple ParamType; - - CartesianProductGenerator4(const ParamGenerator& g1, - const ParamGenerator& g2, const ParamGenerator& g3, - const ParamGenerator& g4) - : g1_(g1), g2_(g2), g3_(g3), g4_(g4) {} - virtual ~CartesianProductGenerator4() {} - - virtual ParamIteratorInterface* Begin() const { - return new Iterator(this, g1_, g1_.begin(), g2_, g2_.begin(), g3_, - g3_.begin(), g4_, g4_.begin()); - } - virtual ParamIteratorInterface* End() const { - return new Iterator(this, g1_, g1_.end(), g2_, g2_.end(), g3_, g3_.end(), - g4_, g4_.end()); - } - - private: - class Iterator : public ParamIteratorInterface { - public: - Iterator(const ParamGeneratorInterface* base, - const ParamGenerator& g1, - const typename ParamGenerator::iterator& current1, - const ParamGenerator& g2, - const typename ParamGenerator::iterator& current2, - const ParamGenerator& g3, - const typename ParamGenerator::iterator& current3, - const ParamGenerator& g4, - const typename ParamGenerator::iterator& current4) - : base_(base), - begin1_(g1.begin()), end1_(g1.end()), current1_(current1), - begin2_(g2.begin()), end2_(g2.end()), current2_(current2), - begin3_(g3.begin()), end3_(g3.end()), current3_(current3), - begin4_(g4.begin()), end4_(g4.end()), current4_(current4) { - ComputeCurrentValue(); - } - virtual ~Iterator() {} - - virtual const ParamGeneratorInterface* BaseGenerator() const { - return base_; - } - // Advance should not be called on beyond-of-range iterators - // so no component iterators must be beyond end of range, either. - virtual void Advance() { - assert(!AtEnd()); - ++current4_; - if (current4_ == end4_) { - current4_ = begin4_; - ++current3_; - } - if (current3_ == end3_) { - current3_ = begin3_; - ++current2_; - } - if (current2_ == end2_) { - current2_ = begin2_; - ++current1_; - } - ComputeCurrentValue(); - } - virtual ParamIteratorInterface* Clone() const { - return new Iterator(*this); - } - virtual const ParamType* Current() const { return ¤t_value_; } - virtual bool Equals(const ParamIteratorInterface& other) const { - // Having the same base generator guarantees that the other - // iterator is of the same type and we can downcast. - GTEST_CHECK_(BaseGenerator() == other.BaseGenerator()) - << "The program attempted to compare iterators " - << "from different generators." << std::endl; - const Iterator* typed_other = - CheckedDowncastToActualType(&other); - // We must report iterators equal if they both point beyond their - // respective ranges. That can happen in a variety of fashions, - // so we have to consult AtEnd(). - return (AtEnd() && typed_other->AtEnd()) || - ( - current1_ == typed_other->current1_ && - current2_ == typed_other->current2_ && - current3_ == typed_other->current3_ && - current4_ == typed_other->current4_); - } - - private: - Iterator(const Iterator& other) - : base_(other.base_), - begin1_(other.begin1_), - end1_(other.end1_), - current1_(other.current1_), - begin2_(other.begin2_), - end2_(other.end2_), - current2_(other.current2_), - begin3_(other.begin3_), - end3_(other.end3_), - current3_(other.current3_), - begin4_(other.begin4_), - end4_(other.end4_), - current4_(other.current4_) { - ComputeCurrentValue(); - } - - void ComputeCurrentValue() { - if (!AtEnd()) - current_value_ = ParamType(*current1_, *current2_, *current3_, - *current4_); - } - bool AtEnd() const { - // We must report iterator past the end of the range when either of the - // component iterators has reached the end of its range. - return - current1_ == end1_ || - current2_ == end2_ || - current3_ == end3_ || - current4_ == end4_; - } - - // No implementation - assignment is unsupported. - void operator=(const Iterator& other); - - const ParamGeneratorInterface* const base_; - // begin[i]_ and end[i]_ define the i-th range that Iterator traverses. - // current[i]_ is the actual traversing iterator. - const typename ParamGenerator::iterator begin1_; - const typename ParamGenerator::iterator end1_; - typename ParamGenerator::iterator current1_; - const typename ParamGenerator::iterator begin2_; - const typename ParamGenerator::iterator end2_; - typename ParamGenerator::iterator current2_; - const typename ParamGenerator::iterator begin3_; - const typename ParamGenerator::iterator end3_; - typename ParamGenerator::iterator current3_; - const typename ParamGenerator::iterator begin4_; - const typename ParamGenerator::iterator end4_; - typename ParamGenerator::iterator current4_; - ParamType current_value_; - }; // class CartesianProductGenerator4::Iterator - - // No implementation - assignment is unsupported. - void operator=(const CartesianProductGenerator4& other); - - const ParamGenerator g1_; - const ParamGenerator g2_; - const ParamGenerator g3_; - const ParamGenerator g4_; -}; // class CartesianProductGenerator4 - - -template -class CartesianProductGenerator5 - : public ParamGeneratorInterface< ::std::tr1::tuple > { - public: - typedef ::std::tr1::tuple ParamType; - - CartesianProductGenerator5(const ParamGenerator& g1, - const ParamGenerator& g2, const ParamGenerator& g3, - const ParamGenerator& g4, const ParamGenerator& g5) - : g1_(g1), g2_(g2), g3_(g3), g4_(g4), g5_(g5) {} - virtual ~CartesianProductGenerator5() {} - - virtual ParamIteratorInterface* Begin() const { - return new Iterator(this, g1_, g1_.begin(), g2_, g2_.begin(), g3_, - g3_.begin(), g4_, g4_.begin(), g5_, g5_.begin()); - } - virtual ParamIteratorInterface* End() const { - return new Iterator(this, g1_, g1_.end(), g2_, g2_.end(), g3_, g3_.end(), - g4_, g4_.end(), g5_, g5_.end()); - } - - private: - class Iterator : public ParamIteratorInterface { - public: - Iterator(const ParamGeneratorInterface* base, - const ParamGenerator& g1, - const typename ParamGenerator::iterator& current1, - const ParamGenerator& g2, - const typename ParamGenerator::iterator& current2, - const ParamGenerator& g3, - const typename ParamGenerator::iterator& current3, - const ParamGenerator& g4, - const typename ParamGenerator::iterator& current4, - const ParamGenerator& g5, - const typename ParamGenerator::iterator& current5) - : base_(base), - begin1_(g1.begin()), end1_(g1.end()), current1_(current1), - begin2_(g2.begin()), end2_(g2.end()), current2_(current2), - begin3_(g3.begin()), end3_(g3.end()), current3_(current3), - begin4_(g4.begin()), end4_(g4.end()), current4_(current4), - begin5_(g5.begin()), end5_(g5.end()), current5_(current5) { - ComputeCurrentValue(); - } - virtual ~Iterator() {} - - virtual const ParamGeneratorInterface* BaseGenerator() const { - return base_; - } - // Advance should not be called on beyond-of-range iterators - // so no component iterators must be beyond end of range, either. - virtual void Advance() { - assert(!AtEnd()); - ++current5_; - if (current5_ == end5_) { - current5_ = begin5_; - ++current4_; - } - if (current4_ == end4_) { - current4_ = begin4_; - ++current3_; - } - if (current3_ == end3_) { - current3_ = begin3_; - ++current2_; - } - if (current2_ == end2_) { - current2_ = begin2_; - ++current1_; - } - ComputeCurrentValue(); - } - virtual ParamIteratorInterface* Clone() const { - return new Iterator(*this); - } - virtual const ParamType* Current() const { return ¤t_value_; } - virtual bool Equals(const ParamIteratorInterface& other) const { - // Having the same base generator guarantees that the other - // iterator is of the same type and we can downcast. - GTEST_CHECK_(BaseGenerator() == other.BaseGenerator()) - << "The program attempted to compare iterators " - << "from different generators." << std::endl; - const Iterator* typed_other = - CheckedDowncastToActualType(&other); - // We must report iterators equal if they both point beyond their - // respective ranges. That can happen in a variety of fashions, - // so we have to consult AtEnd(). - return (AtEnd() && typed_other->AtEnd()) || - ( - current1_ == typed_other->current1_ && - current2_ == typed_other->current2_ && - current3_ == typed_other->current3_ && - current4_ == typed_other->current4_ && - current5_ == typed_other->current5_); - } - - private: - Iterator(const Iterator& other) - : base_(other.base_), - begin1_(other.begin1_), - end1_(other.end1_), - current1_(other.current1_), - begin2_(other.begin2_), - end2_(other.end2_), - current2_(other.current2_), - begin3_(other.begin3_), - end3_(other.end3_), - current3_(other.current3_), - begin4_(other.begin4_), - end4_(other.end4_), - current4_(other.current4_), - begin5_(other.begin5_), - end5_(other.end5_), - current5_(other.current5_) { - ComputeCurrentValue(); - } - - void ComputeCurrentValue() { - if (!AtEnd()) - current_value_ = ParamType(*current1_, *current2_, *current3_, - *current4_, *current5_); - } - bool AtEnd() const { - // We must report iterator past the end of the range when either of the - // component iterators has reached the end of its range. - return - current1_ == end1_ || - current2_ == end2_ || - current3_ == end3_ || - current4_ == end4_ || - current5_ == end5_; - } - - // No implementation - assignment is unsupported. - void operator=(const Iterator& other); - - const ParamGeneratorInterface* const base_; - // begin[i]_ and end[i]_ define the i-th range that Iterator traverses. - // current[i]_ is the actual traversing iterator. - const typename ParamGenerator::iterator begin1_; - const typename ParamGenerator::iterator end1_; - typename ParamGenerator::iterator current1_; - const typename ParamGenerator::iterator begin2_; - const typename ParamGenerator::iterator end2_; - typename ParamGenerator::iterator current2_; - const typename ParamGenerator::iterator begin3_; - const typename ParamGenerator::iterator end3_; - typename ParamGenerator::iterator current3_; - const typename ParamGenerator::iterator begin4_; - const typename ParamGenerator::iterator end4_; - typename ParamGenerator::iterator current4_; - const typename ParamGenerator::iterator begin5_; - const typename ParamGenerator::iterator end5_; - typename ParamGenerator::iterator current5_; - ParamType current_value_; - }; // class CartesianProductGenerator5::Iterator - - // No implementation - assignment is unsupported. - void operator=(const CartesianProductGenerator5& other); - - const ParamGenerator g1_; - const ParamGenerator g2_; - const ParamGenerator g3_; - const ParamGenerator g4_; - const ParamGenerator g5_; -}; // class CartesianProductGenerator5 - - -template -class CartesianProductGenerator6 - : public ParamGeneratorInterface< ::std::tr1::tuple > { - public: - typedef ::std::tr1::tuple ParamType; - - CartesianProductGenerator6(const ParamGenerator& g1, - const ParamGenerator& g2, const ParamGenerator& g3, - const ParamGenerator& g4, const ParamGenerator& g5, - const ParamGenerator& g6) - : g1_(g1), g2_(g2), g3_(g3), g4_(g4), g5_(g5), g6_(g6) {} - virtual ~CartesianProductGenerator6() {} - - virtual ParamIteratorInterface* Begin() const { - return new Iterator(this, g1_, g1_.begin(), g2_, g2_.begin(), g3_, - g3_.begin(), g4_, g4_.begin(), g5_, g5_.begin(), g6_, g6_.begin()); - } - virtual ParamIteratorInterface* End() const { - return new Iterator(this, g1_, g1_.end(), g2_, g2_.end(), g3_, g3_.end(), - g4_, g4_.end(), g5_, g5_.end(), g6_, g6_.end()); - } - - private: - class Iterator : public ParamIteratorInterface { - public: - Iterator(const ParamGeneratorInterface* base, - const ParamGenerator& g1, - const typename ParamGenerator::iterator& current1, - const ParamGenerator& g2, - const typename ParamGenerator::iterator& current2, - const ParamGenerator& g3, - const typename ParamGenerator::iterator& current3, - const ParamGenerator& g4, - const typename ParamGenerator::iterator& current4, - const ParamGenerator& g5, - const typename ParamGenerator::iterator& current5, - const ParamGenerator& g6, - const typename ParamGenerator::iterator& current6) - : base_(base), - begin1_(g1.begin()), end1_(g1.end()), current1_(current1), - begin2_(g2.begin()), end2_(g2.end()), current2_(current2), - begin3_(g3.begin()), end3_(g3.end()), current3_(current3), - begin4_(g4.begin()), end4_(g4.end()), current4_(current4), - begin5_(g5.begin()), end5_(g5.end()), current5_(current5), - begin6_(g6.begin()), end6_(g6.end()), current6_(current6) { - ComputeCurrentValue(); - } - virtual ~Iterator() {} - - virtual const ParamGeneratorInterface* BaseGenerator() const { - return base_; - } - // Advance should not be called on beyond-of-range iterators - // so no component iterators must be beyond end of range, either. - virtual void Advance() { - assert(!AtEnd()); - ++current6_; - if (current6_ == end6_) { - current6_ = begin6_; - ++current5_; - } - if (current5_ == end5_) { - current5_ = begin5_; - ++current4_; - } - if (current4_ == end4_) { - current4_ = begin4_; - ++current3_; - } - if (current3_ == end3_) { - current3_ = begin3_; - ++current2_; - } - if (current2_ == end2_) { - current2_ = begin2_; - ++current1_; - } - ComputeCurrentValue(); - } - virtual ParamIteratorInterface* Clone() const { - return new Iterator(*this); - } - virtual const ParamType* Current() const { return ¤t_value_; } - virtual bool Equals(const ParamIteratorInterface& other) const { - // Having the same base generator guarantees that the other - // iterator is of the same type and we can downcast. - GTEST_CHECK_(BaseGenerator() == other.BaseGenerator()) - << "The program attempted to compare iterators " - << "from different generators." << std::endl; - const Iterator* typed_other = - CheckedDowncastToActualType(&other); - // We must report iterators equal if they both point beyond their - // respective ranges. That can happen in a variety of fashions, - // so we have to consult AtEnd(). - return (AtEnd() && typed_other->AtEnd()) || - ( - current1_ == typed_other->current1_ && - current2_ == typed_other->current2_ && - current3_ == typed_other->current3_ && - current4_ == typed_other->current4_ && - current5_ == typed_other->current5_ && - current6_ == typed_other->current6_); - } - - private: - Iterator(const Iterator& other) - : base_(other.base_), - begin1_(other.begin1_), - end1_(other.end1_), - current1_(other.current1_), - begin2_(other.begin2_), - end2_(other.end2_), - current2_(other.current2_), - begin3_(other.begin3_), - end3_(other.end3_), - current3_(other.current3_), - begin4_(other.begin4_), - end4_(other.end4_), - current4_(other.current4_), - begin5_(other.begin5_), - end5_(other.end5_), - current5_(other.current5_), - begin6_(other.begin6_), - end6_(other.end6_), - current6_(other.current6_) { - ComputeCurrentValue(); - } - - void ComputeCurrentValue() { - if (!AtEnd()) - current_value_ = ParamType(*current1_, *current2_, *current3_, - *current4_, *current5_, *current6_); - } - bool AtEnd() const { - // We must report iterator past the end of the range when either of the - // component iterators has reached the end of its range. - return - current1_ == end1_ || - current2_ == end2_ || - current3_ == end3_ || - current4_ == end4_ || - current5_ == end5_ || - current6_ == end6_; - } - - // No implementation - assignment is unsupported. - void operator=(const Iterator& other); - - const ParamGeneratorInterface* const base_; - // begin[i]_ and end[i]_ define the i-th range that Iterator traverses. - // current[i]_ is the actual traversing iterator. - const typename ParamGenerator::iterator begin1_; - const typename ParamGenerator::iterator end1_; - typename ParamGenerator::iterator current1_; - const typename ParamGenerator::iterator begin2_; - const typename ParamGenerator::iterator end2_; - typename ParamGenerator::iterator current2_; - const typename ParamGenerator::iterator begin3_; - const typename ParamGenerator::iterator end3_; - typename ParamGenerator::iterator current3_; - const typename ParamGenerator::iterator begin4_; - const typename ParamGenerator::iterator end4_; - typename ParamGenerator::iterator current4_; - const typename ParamGenerator::iterator begin5_; - const typename ParamGenerator::iterator end5_; - typename ParamGenerator::iterator current5_; - const typename ParamGenerator::iterator begin6_; - const typename ParamGenerator::iterator end6_; - typename ParamGenerator::iterator current6_; - ParamType current_value_; - }; // class CartesianProductGenerator6::Iterator - - // No implementation - assignment is unsupported. - void operator=(const CartesianProductGenerator6& other); - - const ParamGenerator g1_; - const ParamGenerator g2_; - const ParamGenerator g3_; - const ParamGenerator g4_; - const ParamGenerator g5_; - const ParamGenerator g6_; -}; // class CartesianProductGenerator6 - - -template -class CartesianProductGenerator7 - : public ParamGeneratorInterface< ::std::tr1::tuple > { - public: - typedef ::std::tr1::tuple ParamType; - - CartesianProductGenerator7(const ParamGenerator& g1, - const ParamGenerator& g2, const ParamGenerator& g3, - const ParamGenerator& g4, const ParamGenerator& g5, - const ParamGenerator& g6, const ParamGenerator& g7) - : g1_(g1), g2_(g2), g3_(g3), g4_(g4), g5_(g5), g6_(g6), g7_(g7) {} - virtual ~CartesianProductGenerator7() {} - - virtual ParamIteratorInterface* Begin() const { - return new Iterator(this, g1_, g1_.begin(), g2_, g2_.begin(), g3_, - g3_.begin(), g4_, g4_.begin(), g5_, g5_.begin(), g6_, g6_.begin(), g7_, - g7_.begin()); - } - virtual ParamIteratorInterface* End() const { - return new Iterator(this, g1_, g1_.end(), g2_, g2_.end(), g3_, g3_.end(), - g4_, g4_.end(), g5_, g5_.end(), g6_, g6_.end(), g7_, g7_.end()); - } - - private: - class Iterator : public ParamIteratorInterface { - public: - Iterator(const ParamGeneratorInterface* base, - const ParamGenerator& g1, - const typename ParamGenerator::iterator& current1, - const ParamGenerator& g2, - const typename ParamGenerator::iterator& current2, - const ParamGenerator& g3, - const typename ParamGenerator::iterator& current3, - const ParamGenerator& g4, - const typename ParamGenerator::iterator& current4, - const ParamGenerator& g5, - const typename ParamGenerator::iterator& current5, - const ParamGenerator& g6, - const typename ParamGenerator::iterator& current6, - const ParamGenerator& g7, - const typename ParamGenerator::iterator& current7) - : base_(base), - begin1_(g1.begin()), end1_(g1.end()), current1_(current1), - begin2_(g2.begin()), end2_(g2.end()), current2_(current2), - begin3_(g3.begin()), end3_(g3.end()), current3_(current3), - begin4_(g4.begin()), end4_(g4.end()), current4_(current4), - begin5_(g5.begin()), end5_(g5.end()), current5_(current5), - begin6_(g6.begin()), end6_(g6.end()), current6_(current6), - begin7_(g7.begin()), end7_(g7.end()), current7_(current7) { - ComputeCurrentValue(); - } - virtual ~Iterator() {} - - virtual const ParamGeneratorInterface* BaseGenerator() const { - return base_; - } - // Advance should not be called on beyond-of-range iterators - // so no component iterators must be beyond end of range, either. - virtual void Advance() { - assert(!AtEnd()); - ++current7_; - if (current7_ == end7_) { - current7_ = begin7_; - ++current6_; - } - if (current6_ == end6_) { - current6_ = begin6_; - ++current5_; - } - if (current5_ == end5_) { - current5_ = begin5_; - ++current4_; - } - if (current4_ == end4_) { - current4_ = begin4_; - ++current3_; - } - if (current3_ == end3_) { - current3_ = begin3_; - ++current2_; - } - if (current2_ == end2_) { - current2_ = begin2_; - ++current1_; - } - ComputeCurrentValue(); - } - virtual ParamIteratorInterface* Clone() const { - return new Iterator(*this); - } - virtual const ParamType* Current() const { return ¤t_value_; } - virtual bool Equals(const ParamIteratorInterface& other) const { - // Having the same base generator guarantees that the other - // iterator is of the same type and we can downcast. - GTEST_CHECK_(BaseGenerator() == other.BaseGenerator()) - << "The program attempted to compare iterators " - << "from different generators." << std::endl; - const Iterator* typed_other = - CheckedDowncastToActualType(&other); - // We must report iterators equal if they both point beyond their - // respective ranges. That can happen in a variety of fashions, - // so we have to consult AtEnd(). - return (AtEnd() && typed_other->AtEnd()) || - ( - current1_ == typed_other->current1_ && - current2_ == typed_other->current2_ && - current3_ == typed_other->current3_ && - current4_ == typed_other->current4_ && - current5_ == typed_other->current5_ && - current6_ == typed_other->current6_ && - current7_ == typed_other->current7_); - } - - private: - Iterator(const Iterator& other) - : base_(other.base_), - begin1_(other.begin1_), - end1_(other.end1_), - current1_(other.current1_), - begin2_(other.begin2_), - end2_(other.end2_), - current2_(other.current2_), - begin3_(other.begin3_), - end3_(other.end3_), - current3_(other.current3_), - begin4_(other.begin4_), - end4_(other.end4_), - current4_(other.current4_), - begin5_(other.begin5_), - end5_(other.end5_), - current5_(other.current5_), - begin6_(other.begin6_), - end6_(other.end6_), - current6_(other.current6_), - begin7_(other.begin7_), - end7_(other.end7_), - current7_(other.current7_) { - ComputeCurrentValue(); - } - - void ComputeCurrentValue() { - if (!AtEnd()) - current_value_ = ParamType(*current1_, *current2_, *current3_, - *current4_, *current5_, *current6_, *current7_); - } - bool AtEnd() const { - // We must report iterator past the end of the range when either of the - // component iterators has reached the end of its range. - return - current1_ == end1_ || - current2_ == end2_ || - current3_ == end3_ || - current4_ == end4_ || - current5_ == end5_ || - current6_ == end6_ || - current7_ == end7_; - } - - // No implementation - assignment is unsupported. - void operator=(const Iterator& other); - - const ParamGeneratorInterface* const base_; - // begin[i]_ and end[i]_ define the i-th range that Iterator traverses. - // current[i]_ is the actual traversing iterator. - const typename ParamGenerator::iterator begin1_; - const typename ParamGenerator::iterator end1_; - typename ParamGenerator::iterator current1_; - const typename ParamGenerator::iterator begin2_; - const typename ParamGenerator::iterator end2_; - typename ParamGenerator::iterator current2_; - const typename ParamGenerator::iterator begin3_; - const typename ParamGenerator::iterator end3_; - typename ParamGenerator::iterator current3_; - const typename ParamGenerator::iterator begin4_; - const typename ParamGenerator::iterator end4_; - typename ParamGenerator::iterator current4_; - const typename ParamGenerator::iterator begin5_; - const typename ParamGenerator::iterator end5_; - typename ParamGenerator::iterator current5_; - const typename ParamGenerator::iterator begin6_; - const typename ParamGenerator::iterator end6_; - typename ParamGenerator::iterator current6_; - const typename ParamGenerator::iterator begin7_; - const typename ParamGenerator::iterator end7_; - typename ParamGenerator::iterator current7_; - ParamType current_value_; - }; // class CartesianProductGenerator7::Iterator - - // No implementation - assignment is unsupported. - void operator=(const CartesianProductGenerator7& other); - - const ParamGenerator g1_; - const ParamGenerator g2_; - const ParamGenerator g3_; - const ParamGenerator g4_; - const ParamGenerator g5_; - const ParamGenerator g6_; - const ParamGenerator g7_; -}; // class CartesianProductGenerator7 - - -template -class CartesianProductGenerator8 - : public ParamGeneratorInterface< ::std::tr1::tuple > { - public: - typedef ::std::tr1::tuple ParamType; - - CartesianProductGenerator8(const ParamGenerator& g1, - const ParamGenerator& g2, const ParamGenerator& g3, - const ParamGenerator& g4, const ParamGenerator& g5, - const ParamGenerator& g6, const ParamGenerator& g7, - const ParamGenerator& g8) - : g1_(g1), g2_(g2), g3_(g3), g4_(g4), g5_(g5), g6_(g6), g7_(g7), - g8_(g8) {} - virtual ~CartesianProductGenerator8() {} - - virtual ParamIteratorInterface* Begin() const { - return new Iterator(this, g1_, g1_.begin(), g2_, g2_.begin(), g3_, - g3_.begin(), g4_, g4_.begin(), g5_, g5_.begin(), g6_, g6_.begin(), g7_, - g7_.begin(), g8_, g8_.begin()); - } - virtual ParamIteratorInterface* End() const { - return new Iterator(this, g1_, g1_.end(), g2_, g2_.end(), g3_, g3_.end(), - g4_, g4_.end(), g5_, g5_.end(), g6_, g6_.end(), g7_, g7_.end(), g8_, - g8_.end()); - } - - private: - class Iterator : public ParamIteratorInterface { - public: - Iterator(const ParamGeneratorInterface* base, - const ParamGenerator& g1, - const typename ParamGenerator::iterator& current1, - const ParamGenerator& g2, - const typename ParamGenerator::iterator& current2, - const ParamGenerator& g3, - const typename ParamGenerator::iterator& current3, - const ParamGenerator& g4, - const typename ParamGenerator::iterator& current4, - const ParamGenerator& g5, - const typename ParamGenerator::iterator& current5, - const ParamGenerator& g6, - const typename ParamGenerator::iterator& current6, - const ParamGenerator& g7, - const typename ParamGenerator::iterator& current7, - const ParamGenerator& g8, - const typename ParamGenerator::iterator& current8) - : base_(base), - begin1_(g1.begin()), end1_(g1.end()), current1_(current1), - begin2_(g2.begin()), end2_(g2.end()), current2_(current2), - begin3_(g3.begin()), end3_(g3.end()), current3_(current3), - begin4_(g4.begin()), end4_(g4.end()), current4_(current4), - begin5_(g5.begin()), end5_(g5.end()), current5_(current5), - begin6_(g6.begin()), end6_(g6.end()), current6_(current6), - begin7_(g7.begin()), end7_(g7.end()), current7_(current7), - begin8_(g8.begin()), end8_(g8.end()), current8_(current8) { - ComputeCurrentValue(); - } - virtual ~Iterator() {} - - virtual const ParamGeneratorInterface* BaseGenerator() const { - return base_; - } - // Advance should not be called on beyond-of-range iterators - // so no component iterators must be beyond end of range, either. - virtual void Advance() { - assert(!AtEnd()); - ++current8_; - if (current8_ == end8_) { - current8_ = begin8_; - ++current7_; - } - if (current7_ == end7_) { - current7_ = begin7_; - ++current6_; - } - if (current6_ == end6_) { - current6_ = begin6_; - ++current5_; - } - if (current5_ == end5_) { - current5_ = begin5_; - ++current4_; - } - if (current4_ == end4_) { - current4_ = begin4_; - ++current3_; - } - if (current3_ == end3_) { - current3_ = begin3_; - ++current2_; - } - if (current2_ == end2_) { - current2_ = begin2_; - ++current1_; - } - ComputeCurrentValue(); - } - virtual ParamIteratorInterface* Clone() const { - return new Iterator(*this); - } - virtual const ParamType* Current() const { return ¤t_value_; } - virtual bool Equals(const ParamIteratorInterface& other) const { - // Having the same base generator guarantees that the other - // iterator is of the same type and we can downcast. - GTEST_CHECK_(BaseGenerator() == other.BaseGenerator()) - << "The program attempted to compare iterators " - << "from different generators." << std::endl; - const Iterator* typed_other = - CheckedDowncastToActualType(&other); - // We must report iterators equal if they both point beyond their - // respective ranges. That can happen in a variety of fashions, - // so we have to consult AtEnd(). - return (AtEnd() && typed_other->AtEnd()) || - ( - current1_ == typed_other->current1_ && - current2_ == typed_other->current2_ && - current3_ == typed_other->current3_ && - current4_ == typed_other->current4_ && - current5_ == typed_other->current5_ && - current6_ == typed_other->current6_ && - current7_ == typed_other->current7_ && - current8_ == typed_other->current8_); - } - - private: - Iterator(const Iterator& other) - : base_(other.base_), - begin1_(other.begin1_), - end1_(other.end1_), - current1_(other.current1_), - begin2_(other.begin2_), - end2_(other.end2_), - current2_(other.current2_), - begin3_(other.begin3_), - end3_(other.end3_), - current3_(other.current3_), - begin4_(other.begin4_), - end4_(other.end4_), - current4_(other.current4_), - begin5_(other.begin5_), - end5_(other.end5_), - current5_(other.current5_), - begin6_(other.begin6_), - end6_(other.end6_), - current6_(other.current6_), - begin7_(other.begin7_), - end7_(other.end7_), - current7_(other.current7_), - begin8_(other.begin8_), - end8_(other.end8_), - current8_(other.current8_) { - ComputeCurrentValue(); - } - - void ComputeCurrentValue() { - if (!AtEnd()) - current_value_ = ParamType(*current1_, *current2_, *current3_, - *current4_, *current5_, *current6_, *current7_, *current8_); - } - bool AtEnd() const { - // We must report iterator past the end of the range when either of the - // component iterators has reached the end of its range. - return - current1_ == end1_ || - current2_ == end2_ || - current3_ == end3_ || - current4_ == end4_ || - current5_ == end5_ || - current6_ == end6_ || - current7_ == end7_ || - current8_ == end8_; - } - - // No implementation - assignment is unsupported. - void operator=(const Iterator& other); - - const ParamGeneratorInterface* const base_; - // begin[i]_ and end[i]_ define the i-th range that Iterator traverses. - // current[i]_ is the actual traversing iterator. - const typename ParamGenerator::iterator begin1_; - const typename ParamGenerator::iterator end1_; - typename ParamGenerator::iterator current1_; - const typename ParamGenerator::iterator begin2_; - const typename ParamGenerator::iterator end2_; - typename ParamGenerator::iterator current2_; - const typename ParamGenerator::iterator begin3_; - const typename ParamGenerator::iterator end3_; - typename ParamGenerator::iterator current3_; - const typename ParamGenerator::iterator begin4_; - const typename ParamGenerator::iterator end4_; - typename ParamGenerator::iterator current4_; - const typename ParamGenerator::iterator begin5_; - const typename ParamGenerator::iterator end5_; - typename ParamGenerator::iterator current5_; - const typename ParamGenerator::iterator begin6_; - const typename ParamGenerator::iterator end6_; - typename ParamGenerator::iterator current6_; - const typename ParamGenerator::iterator begin7_; - const typename ParamGenerator::iterator end7_; - typename ParamGenerator::iterator current7_; - const typename ParamGenerator::iterator begin8_; - const typename ParamGenerator::iterator end8_; - typename ParamGenerator::iterator current8_; - ParamType current_value_; - }; // class CartesianProductGenerator8::Iterator - - // No implementation - assignment is unsupported. - void operator=(const CartesianProductGenerator8& other); - - const ParamGenerator g1_; - const ParamGenerator g2_; - const ParamGenerator g3_; - const ParamGenerator g4_; - const ParamGenerator g5_; - const ParamGenerator g6_; - const ParamGenerator g7_; - const ParamGenerator g8_; -}; // class CartesianProductGenerator8 - - -template -class CartesianProductGenerator9 - : public ParamGeneratorInterface< ::std::tr1::tuple > { - public: - typedef ::std::tr1::tuple ParamType; - - CartesianProductGenerator9(const ParamGenerator& g1, - const ParamGenerator& g2, const ParamGenerator& g3, - const ParamGenerator& g4, const ParamGenerator& g5, - const ParamGenerator& g6, const ParamGenerator& g7, - const ParamGenerator& g8, const ParamGenerator& g9) - : g1_(g1), g2_(g2), g3_(g3), g4_(g4), g5_(g5), g6_(g6), g7_(g7), g8_(g8), - g9_(g9) {} - virtual ~CartesianProductGenerator9() {} - - virtual ParamIteratorInterface* Begin() const { - return new Iterator(this, g1_, g1_.begin(), g2_, g2_.begin(), g3_, - g3_.begin(), g4_, g4_.begin(), g5_, g5_.begin(), g6_, g6_.begin(), g7_, - g7_.begin(), g8_, g8_.begin(), g9_, g9_.begin()); - } - virtual ParamIteratorInterface* End() const { - return new Iterator(this, g1_, g1_.end(), g2_, g2_.end(), g3_, g3_.end(), - g4_, g4_.end(), g5_, g5_.end(), g6_, g6_.end(), g7_, g7_.end(), g8_, - g8_.end(), g9_, g9_.end()); - } - - private: - class Iterator : public ParamIteratorInterface { - public: - Iterator(const ParamGeneratorInterface* base, - const ParamGenerator& g1, - const typename ParamGenerator::iterator& current1, - const ParamGenerator& g2, - const typename ParamGenerator::iterator& current2, - const ParamGenerator& g3, - const typename ParamGenerator::iterator& current3, - const ParamGenerator& g4, - const typename ParamGenerator::iterator& current4, - const ParamGenerator& g5, - const typename ParamGenerator::iterator& current5, - const ParamGenerator& g6, - const typename ParamGenerator::iterator& current6, - const ParamGenerator& g7, - const typename ParamGenerator::iterator& current7, - const ParamGenerator& g8, - const typename ParamGenerator::iterator& current8, - const ParamGenerator& g9, - const typename ParamGenerator::iterator& current9) - : base_(base), - begin1_(g1.begin()), end1_(g1.end()), current1_(current1), - begin2_(g2.begin()), end2_(g2.end()), current2_(current2), - begin3_(g3.begin()), end3_(g3.end()), current3_(current3), - begin4_(g4.begin()), end4_(g4.end()), current4_(current4), - begin5_(g5.begin()), end5_(g5.end()), current5_(current5), - begin6_(g6.begin()), end6_(g6.end()), current6_(current6), - begin7_(g7.begin()), end7_(g7.end()), current7_(current7), - begin8_(g8.begin()), end8_(g8.end()), current8_(current8), - begin9_(g9.begin()), end9_(g9.end()), current9_(current9) { - ComputeCurrentValue(); - } - virtual ~Iterator() {} - - virtual const ParamGeneratorInterface* BaseGenerator() const { - return base_; - } - // Advance should not be called on beyond-of-range iterators - // so no component iterators must be beyond end of range, either. - virtual void Advance() { - assert(!AtEnd()); - ++current9_; - if (current9_ == end9_) { - current9_ = begin9_; - ++current8_; - } - if (current8_ == end8_) { - current8_ = begin8_; - ++current7_; - } - if (current7_ == end7_) { - current7_ = begin7_; - ++current6_; - } - if (current6_ == end6_) { - current6_ = begin6_; - ++current5_; - } - if (current5_ == end5_) { - current5_ = begin5_; - ++current4_; - } - if (current4_ == end4_) { - current4_ = begin4_; - ++current3_; - } - if (current3_ == end3_) { - current3_ = begin3_; - ++current2_; - } - if (current2_ == end2_) { - current2_ = begin2_; - ++current1_; - } - ComputeCurrentValue(); - } - virtual ParamIteratorInterface* Clone() const { - return new Iterator(*this); - } - virtual const ParamType* Current() const { return ¤t_value_; } - virtual bool Equals(const ParamIteratorInterface& other) const { - // Having the same base generator guarantees that the other - // iterator is of the same type and we can downcast. - GTEST_CHECK_(BaseGenerator() == other.BaseGenerator()) - << "The program attempted to compare iterators " - << "from different generators." << std::endl; - const Iterator* typed_other = - CheckedDowncastToActualType(&other); - // We must report iterators equal if they both point beyond their - // respective ranges. That can happen in a variety of fashions, - // so we have to consult AtEnd(). - return (AtEnd() && typed_other->AtEnd()) || - ( - current1_ == typed_other->current1_ && - current2_ == typed_other->current2_ && - current3_ == typed_other->current3_ && - current4_ == typed_other->current4_ && - current5_ == typed_other->current5_ && - current6_ == typed_other->current6_ && - current7_ == typed_other->current7_ && - current8_ == typed_other->current8_ && - current9_ == typed_other->current9_); - } - - private: - Iterator(const Iterator& other) - : base_(other.base_), - begin1_(other.begin1_), - end1_(other.end1_), - current1_(other.current1_), - begin2_(other.begin2_), - end2_(other.end2_), - current2_(other.current2_), - begin3_(other.begin3_), - end3_(other.end3_), - current3_(other.current3_), - begin4_(other.begin4_), - end4_(other.end4_), - current4_(other.current4_), - begin5_(other.begin5_), - end5_(other.end5_), - current5_(other.current5_), - begin6_(other.begin6_), - end6_(other.end6_), - current6_(other.current6_), - begin7_(other.begin7_), - end7_(other.end7_), - current7_(other.current7_), - begin8_(other.begin8_), - end8_(other.end8_), - current8_(other.current8_), - begin9_(other.begin9_), - end9_(other.end9_), - current9_(other.current9_) { - ComputeCurrentValue(); - } - - void ComputeCurrentValue() { - if (!AtEnd()) - current_value_ = ParamType(*current1_, *current2_, *current3_, - *current4_, *current5_, *current6_, *current7_, *current8_, - *current9_); - } - bool AtEnd() const { - // We must report iterator past the end of the range when either of the - // component iterators has reached the end of its range. - return - current1_ == end1_ || - current2_ == end2_ || - current3_ == end3_ || - current4_ == end4_ || - current5_ == end5_ || - current6_ == end6_ || - current7_ == end7_ || - current8_ == end8_ || - current9_ == end9_; - } - - // No implementation - assignment is unsupported. - void operator=(const Iterator& other); - - const ParamGeneratorInterface* const base_; - // begin[i]_ and end[i]_ define the i-th range that Iterator traverses. - // current[i]_ is the actual traversing iterator. - const typename ParamGenerator::iterator begin1_; - const typename ParamGenerator::iterator end1_; - typename ParamGenerator::iterator current1_; - const typename ParamGenerator::iterator begin2_; - const typename ParamGenerator::iterator end2_; - typename ParamGenerator::iterator current2_; - const typename ParamGenerator::iterator begin3_; - const typename ParamGenerator::iterator end3_; - typename ParamGenerator::iterator current3_; - const typename ParamGenerator::iterator begin4_; - const typename ParamGenerator::iterator end4_; - typename ParamGenerator::iterator current4_; - const typename ParamGenerator::iterator begin5_; - const typename ParamGenerator::iterator end5_; - typename ParamGenerator::iterator current5_; - const typename ParamGenerator::iterator begin6_; - const typename ParamGenerator::iterator end6_; - typename ParamGenerator::iterator current6_; - const typename ParamGenerator::iterator begin7_; - const typename ParamGenerator::iterator end7_; - typename ParamGenerator::iterator current7_; - const typename ParamGenerator::iterator begin8_; - const typename ParamGenerator::iterator end8_; - typename ParamGenerator::iterator current8_; - const typename ParamGenerator::iterator begin9_; - const typename ParamGenerator::iterator end9_; - typename ParamGenerator::iterator current9_; - ParamType current_value_; - }; // class CartesianProductGenerator9::Iterator - - // No implementation - assignment is unsupported. - void operator=(const CartesianProductGenerator9& other); - - const ParamGenerator g1_; - const ParamGenerator g2_; - const ParamGenerator g3_; - const ParamGenerator g4_; - const ParamGenerator g5_; - const ParamGenerator g6_; - const ParamGenerator g7_; - const ParamGenerator g8_; - const ParamGenerator g9_; -}; // class CartesianProductGenerator9 - - -template -class CartesianProductGenerator10 - : public ParamGeneratorInterface< ::std::tr1::tuple > { - public: - typedef ::std::tr1::tuple ParamType; - - CartesianProductGenerator10(const ParamGenerator& g1, - const ParamGenerator& g2, const ParamGenerator& g3, - const ParamGenerator& g4, const ParamGenerator& g5, - const ParamGenerator& g6, const ParamGenerator& g7, - const ParamGenerator& g8, const ParamGenerator& g9, - const ParamGenerator& g10) - : g1_(g1), g2_(g2), g3_(g3), g4_(g4), g5_(g5), g6_(g6), g7_(g7), g8_(g8), - g9_(g9), g10_(g10) {} - virtual ~CartesianProductGenerator10() {} - - virtual ParamIteratorInterface* Begin() const { - return new Iterator(this, g1_, g1_.begin(), g2_, g2_.begin(), g3_, - g3_.begin(), g4_, g4_.begin(), g5_, g5_.begin(), g6_, g6_.begin(), g7_, - g7_.begin(), g8_, g8_.begin(), g9_, g9_.begin(), g10_, g10_.begin()); - } - virtual ParamIteratorInterface* End() const { - return new Iterator(this, g1_, g1_.end(), g2_, g2_.end(), g3_, g3_.end(), - g4_, g4_.end(), g5_, g5_.end(), g6_, g6_.end(), g7_, g7_.end(), g8_, - g8_.end(), g9_, g9_.end(), g10_, g10_.end()); - } - - private: - class Iterator : public ParamIteratorInterface { - public: - Iterator(const ParamGeneratorInterface* base, - const ParamGenerator& g1, - const typename ParamGenerator::iterator& current1, - const ParamGenerator& g2, - const typename ParamGenerator::iterator& current2, - const ParamGenerator& g3, - const typename ParamGenerator::iterator& current3, - const ParamGenerator& g4, - const typename ParamGenerator::iterator& current4, - const ParamGenerator& g5, - const typename ParamGenerator::iterator& current5, - const ParamGenerator& g6, - const typename ParamGenerator::iterator& current6, - const ParamGenerator& g7, - const typename ParamGenerator::iterator& current7, - const ParamGenerator& g8, - const typename ParamGenerator::iterator& current8, - const ParamGenerator& g9, - const typename ParamGenerator::iterator& current9, - const ParamGenerator& g10, - const typename ParamGenerator::iterator& current10) - : base_(base), - begin1_(g1.begin()), end1_(g1.end()), current1_(current1), - begin2_(g2.begin()), end2_(g2.end()), current2_(current2), - begin3_(g3.begin()), end3_(g3.end()), current3_(current3), - begin4_(g4.begin()), end4_(g4.end()), current4_(current4), - begin5_(g5.begin()), end5_(g5.end()), current5_(current5), - begin6_(g6.begin()), end6_(g6.end()), current6_(current6), - begin7_(g7.begin()), end7_(g7.end()), current7_(current7), - begin8_(g8.begin()), end8_(g8.end()), current8_(current8), - begin9_(g9.begin()), end9_(g9.end()), current9_(current9), - begin10_(g10.begin()), end10_(g10.end()), current10_(current10) { - ComputeCurrentValue(); - } - virtual ~Iterator() {} - - virtual const ParamGeneratorInterface* BaseGenerator() const { - return base_; - } - // Advance should not be called on beyond-of-range iterators - // so no component iterators must be beyond end of range, either. - virtual void Advance() { - assert(!AtEnd()); - ++current10_; - if (current10_ == end10_) { - current10_ = begin10_; - ++current9_; - } - if (current9_ == end9_) { - current9_ = begin9_; - ++current8_; - } - if (current8_ == end8_) { - current8_ = begin8_; - ++current7_; - } - if (current7_ == end7_) { - current7_ = begin7_; - ++current6_; - } - if (current6_ == end6_) { - current6_ = begin6_; - ++current5_; - } - if (current5_ == end5_) { - current5_ = begin5_; - ++current4_; - } - if (current4_ == end4_) { - current4_ = begin4_; - ++current3_; - } - if (current3_ == end3_) { - current3_ = begin3_; - ++current2_; - } - if (current2_ == end2_) { - current2_ = begin2_; - ++current1_; - } - ComputeCurrentValue(); - } - virtual ParamIteratorInterface* Clone() const { - return new Iterator(*this); - } - virtual const ParamType* Current() const { return ¤t_value_; } - virtual bool Equals(const ParamIteratorInterface& other) const { - // Having the same base generator guarantees that the other - // iterator is of the same type and we can downcast. - GTEST_CHECK_(BaseGenerator() == other.BaseGenerator()) - << "The program attempted to compare iterators " - << "from different generators." << std::endl; - const Iterator* typed_other = - CheckedDowncastToActualType(&other); - // We must report iterators equal if they both point beyond their - // respective ranges. That can happen in a variety of fashions, - // so we have to consult AtEnd(). - return (AtEnd() && typed_other->AtEnd()) || - ( - current1_ == typed_other->current1_ && - current2_ == typed_other->current2_ && - current3_ == typed_other->current3_ && - current4_ == typed_other->current4_ && - current5_ == typed_other->current5_ && - current6_ == typed_other->current6_ && - current7_ == typed_other->current7_ && - current8_ == typed_other->current8_ && - current9_ == typed_other->current9_ && - current10_ == typed_other->current10_); - } - - private: - Iterator(const Iterator& other) - : base_(other.base_), - begin1_(other.begin1_), - end1_(other.end1_), - current1_(other.current1_), - begin2_(other.begin2_), - end2_(other.end2_), - current2_(other.current2_), - begin3_(other.begin3_), - end3_(other.end3_), - current3_(other.current3_), - begin4_(other.begin4_), - end4_(other.end4_), - current4_(other.current4_), - begin5_(other.begin5_), - end5_(other.end5_), - current5_(other.current5_), - begin6_(other.begin6_), - end6_(other.end6_), - current6_(other.current6_), - begin7_(other.begin7_), - end7_(other.end7_), - current7_(other.current7_), - begin8_(other.begin8_), - end8_(other.end8_), - current8_(other.current8_), - begin9_(other.begin9_), - end9_(other.end9_), - current9_(other.current9_), - begin10_(other.begin10_), - end10_(other.end10_), - current10_(other.current10_) { - ComputeCurrentValue(); - } - - void ComputeCurrentValue() { - if (!AtEnd()) - current_value_ = ParamType(*current1_, *current2_, *current3_, - *current4_, *current5_, *current6_, *current7_, *current8_, - *current9_, *current10_); - } - bool AtEnd() const { - // We must report iterator past the end of the range when either of the - // component iterators has reached the end of its range. - return - current1_ == end1_ || - current2_ == end2_ || - current3_ == end3_ || - current4_ == end4_ || - current5_ == end5_ || - current6_ == end6_ || - current7_ == end7_ || - current8_ == end8_ || - current9_ == end9_ || - current10_ == end10_; - } - - // No implementation - assignment is unsupported. - void operator=(const Iterator& other); - - const ParamGeneratorInterface* const base_; - // begin[i]_ and end[i]_ define the i-th range that Iterator traverses. - // current[i]_ is the actual traversing iterator. - const typename ParamGenerator::iterator begin1_; - const typename ParamGenerator::iterator end1_; - typename ParamGenerator::iterator current1_; - const typename ParamGenerator::iterator begin2_; - const typename ParamGenerator::iterator end2_; - typename ParamGenerator::iterator current2_; - const typename ParamGenerator::iterator begin3_; - const typename ParamGenerator::iterator end3_; - typename ParamGenerator::iterator current3_; - const typename ParamGenerator::iterator begin4_; - const typename ParamGenerator::iterator end4_; - typename ParamGenerator::iterator current4_; - const typename ParamGenerator::iterator begin5_; - const typename ParamGenerator::iterator end5_; - typename ParamGenerator::iterator current5_; - const typename ParamGenerator::iterator begin6_; - const typename ParamGenerator::iterator end6_; - typename ParamGenerator::iterator current6_; - const typename ParamGenerator::iterator begin7_; - const typename ParamGenerator::iterator end7_; - typename ParamGenerator::iterator current7_; - const typename ParamGenerator::iterator begin8_; - const typename ParamGenerator::iterator end8_; - typename ParamGenerator::iterator current8_; - const typename ParamGenerator::iterator begin9_; - const typename ParamGenerator::iterator end9_; - typename ParamGenerator::iterator current9_; - const typename ParamGenerator::iterator begin10_; - const typename ParamGenerator::iterator end10_; - typename ParamGenerator::iterator current10_; - ParamType current_value_; - }; // class CartesianProductGenerator10::Iterator - - // No implementation - assignment is unsupported. - void operator=(const CartesianProductGenerator10& other); - - const ParamGenerator g1_; - const ParamGenerator g2_; - const ParamGenerator g3_; - const ParamGenerator g4_; - const ParamGenerator g5_; - const ParamGenerator g6_; - const ParamGenerator g7_; - const ParamGenerator g8_; - const ParamGenerator g9_; - const ParamGenerator g10_; -}; // class CartesianProductGenerator10 - - -// INTERNAL IMPLEMENTATION - DO NOT USE IN USER CODE. -// -// Helper classes providing Combine() with polymorphic features. They allow -// casting CartesianProductGeneratorN to ParamGenerator if T is -// convertible to U. -// -template -class CartesianProductHolder2 { - public: -CartesianProductHolder2(const Generator1& g1, const Generator2& g2) - : g1_(g1), g2_(g2) {} - template - operator ParamGenerator< ::std::tr1::tuple >() const { - return ParamGenerator< ::std::tr1::tuple >( - new CartesianProductGenerator2( - static_cast >(g1_), - static_cast >(g2_))); - } - - private: - // No implementation - assignment is unsupported. - void operator=(const CartesianProductHolder2& other); - - const Generator1 g1_; - const Generator2 g2_; -}; // class CartesianProductHolder2 - -template -class CartesianProductHolder3 { - public: -CartesianProductHolder3(const Generator1& g1, const Generator2& g2, - const Generator3& g3) - : g1_(g1), g2_(g2), g3_(g3) {} - template - operator ParamGenerator< ::std::tr1::tuple >() const { - return ParamGenerator< ::std::tr1::tuple >( - new CartesianProductGenerator3( - static_cast >(g1_), - static_cast >(g2_), - static_cast >(g3_))); - } - - private: - // No implementation - assignment is unsupported. - void operator=(const CartesianProductHolder3& other); - - const Generator1 g1_; - const Generator2 g2_; - const Generator3 g3_; -}; // class CartesianProductHolder3 - -template -class CartesianProductHolder4 { - public: -CartesianProductHolder4(const Generator1& g1, const Generator2& g2, - const Generator3& g3, const Generator4& g4) - : g1_(g1), g2_(g2), g3_(g3), g4_(g4) {} - template - operator ParamGenerator< ::std::tr1::tuple >() const { - return ParamGenerator< ::std::tr1::tuple >( - new CartesianProductGenerator4( - static_cast >(g1_), - static_cast >(g2_), - static_cast >(g3_), - static_cast >(g4_))); - } - - private: - // No implementation - assignment is unsupported. - void operator=(const CartesianProductHolder4& other); - - const Generator1 g1_; - const Generator2 g2_; - const Generator3 g3_; - const Generator4 g4_; -}; // class CartesianProductHolder4 - -template -class CartesianProductHolder5 { - public: -CartesianProductHolder5(const Generator1& g1, const Generator2& g2, - const Generator3& g3, const Generator4& g4, const Generator5& g5) - : g1_(g1), g2_(g2), g3_(g3), g4_(g4), g5_(g5) {} - template - operator ParamGenerator< ::std::tr1::tuple >() const { - return ParamGenerator< ::std::tr1::tuple >( - new CartesianProductGenerator5( - static_cast >(g1_), - static_cast >(g2_), - static_cast >(g3_), - static_cast >(g4_), - static_cast >(g5_))); - } - - private: - // No implementation - assignment is unsupported. - void operator=(const CartesianProductHolder5& other); - - const Generator1 g1_; - const Generator2 g2_; - const Generator3 g3_; - const Generator4 g4_; - const Generator5 g5_; -}; // class CartesianProductHolder5 - -template -class CartesianProductHolder6 { - public: -CartesianProductHolder6(const Generator1& g1, const Generator2& g2, - const Generator3& g3, const Generator4& g4, const Generator5& g5, - const Generator6& g6) - : g1_(g1), g2_(g2), g3_(g3), g4_(g4), g5_(g5), g6_(g6) {} - template - operator ParamGenerator< ::std::tr1::tuple >() const { - return ParamGenerator< ::std::tr1::tuple >( - new CartesianProductGenerator6( - static_cast >(g1_), - static_cast >(g2_), - static_cast >(g3_), - static_cast >(g4_), - static_cast >(g5_), - static_cast >(g6_))); - } - - private: - // No implementation - assignment is unsupported. - void operator=(const CartesianProductHolder6& other); - - const Generator1 g1_; - const Generator2 g2_; - const Generator3 g3_; - const Generator4 g4_; - const Generator5 g5_; - const Generator6 g6_; -}; // class CartesianProductHolder6 - -template -class CartesianProductHolder7 { - public: -CartesianProductHolder7(const Generator1& g1, const Generator2& g2, - const Generator3& g3, const Generator4& g4, const Generator5& g5, - const Generator6& g6, const Generator7& g7) - : g1_(g1), g2_(g2), g3_(g3), g4_(g4), g5_(g5), g6_(g6), g7_(g7) {} - template - operator ParamGenerator< ::std::tr1::tuple >() const { - return ParamGenerator< ::std::tr1::tuple >( - new CartesianProductGenerator7( - static_cast >(g1_), - static_cast >(g2_), - static_cast >(g3_), - static_cast >(g4_), - static_cast >(g5_), - static_cast >(g6_), - static_cast >(g7_))); - } - - private: - // No implementation - assignment is unsupported. - void operator=(const CartesianProductHolder7& other); - - const Generator1 g1_; - const Generator2 g2_; - const Generator3 g3_; - const Generator4 g4_; - const Generator5 g5_; - const Generator6 g6_; - const Generator7 g7_; -}; // class CartesianProductHolder7 - -template -class CartesianProductHolder8 { - public: -CartesianProductHolder8(const Generator1& g1, const Generator2& g2, - const Generator3& g3, const Generator4& g4, const Generator5& g5, - const Generator6& g6, const Generator7& g7, const Generator8& g8) - : g1_(g1), g2_(g2), g3_(g3), g4_(g4), g5_(g5), g6_(g6), g7_(g7), - g8_(g8) {} - template - operator ParamGenerator< ::std::tr1::tuple >() const { - return ParamGenerator< ::std::tr1::tuple >( - new CartesianProductGenerator8( - static_cast >(g1_), - static_cast >(g2_), - static_cast >(g3_), - static_cast >(g4_), - static_cast >(g5_), - static_cast >(g6_), - static_cast >(g7_), - static_cast >(g8_))); - } - - private: - // No implementation - assignment is unsupported. - void operator=(const CartesianProductHolder8& other); - - const Generator1 g1_; - const Generator2 g2_; - const Generator3 g3_; - const Generator4 g4_; - const Generator5 g5_; - const Generator6 g6_; - const Generator7 g7_; - const Generator8 g8_; -}; // class CartesianProductHolder8 - -template -class CartesianProductHolder9 { - public: -CartesianProductHolder9(const Generator1& g1, const Generator2& g2, - const Generator3& g3, const Generator4& g4, const Generator5& g5, - const Generator6& g6, const Generator7& g7, const Generator8& g8, - const Generator9& g9) - : g1_(g1), g2_(g2), g3_(g3), g4_(g4), g5_(g5), g6_(g6), g7_(g7), g8_(g8), - g9_(g9) {} - template - operator ParamGenerator< ::std::tr1::tuple >() const { - return ParamGenerator< ::std::tr1::tuple >( - new CartesianProductGenerator9( - static_cast >(g1_), - static_cast >(g2_), - static_cast >(g3_), - static_cast >(g4_), - static_cast >(g5_), - static_cast >(g6_), - static_cast >(g7_), - static_cast >(g8_), - static_cast >(g9_))); - } - - private: - // No implementation - assignment is unsupported. - void operator=(const CartesianProductHolder9& other); - - const Generator1 g1_; - const Generator2 g2_; - const Generator3 g3_; - const Generator4 g4_; - const Generator5 g5_; - const Generator6 g6_; - const Generator7 g7_; - const Generator8 g8_; - const Generator9 g9_; -}; // class CartesianProductHolder9 - -template -class CartesianProductHolder10 { - public: -CartesianProductHolder10(const Generator1& g1, const Generator2& g2, - const Generator3& g3, const Generator4& g4, const Generator5& g5, - const Generator6& g6, const Generator7& g7, const Generator8& g8, - const Generator9& g9, const Generator10& g10) - : g1_(g1), g2_(g2), g3_(g3), g4_(g4), g5_(g5), g6_(g6), g7_(g7), g8_(g8), - g9_(g9), g10_(g10) {} - template - operator ParamGenerator< ::std::tr1::tuple >() const { - return ParamGenerator< ::std::tr1::tuple >( - new CartesianProductGenerator10( - static_cast >(g1_), - static_cast >(g2_), - static_cast >(g3_), - static_cast >(g4_), - static_cast >(g5_), - static_cast >(g6_), - static_cast >(g7_), - static_cast >(g8_), - static_cast >(g9_), - static_cast >(g10_))); - } - - private: - // No implementation - assignment is unsupported. - void operator=(const CartesianProductHolder10& other); - - const Generator1 g1_; - const Generator2 g2_; - const Generator3 g3_; - const Generator4 g4_; - const Generator5 g5_; - const Generator6 g6_; - const Generator7 g7_; - const Generator8 g8_; - const Generator9 g9_; - const Generator10 g10_; -}; // class CartesianProductHolder10 - -# endif // GTEST_HAS_COMBINE - -} // namespace internal -} // namespace testing - -#endif // GTEST_HAS_PARAM_TEST - -#endif // GTEST_INCLUDE_GTEST_INTERNAL_GTEST_PARAM_UTIL_GENERATED_H_ - -#if GTEST_HAS_PARAM_TEST - -namespace testing { - -// Functions producing parameter generators. -// -// Google Test uses these generators to produce parameters for value- -// parameterized tests. When a parameterized test case is instantiated -// with a particular generator, Google Test creates and runs tests -// for each element in the sequence produced by the generator. -// -// In the following sample, tests from test case FooTest are instantiated -// each three times with parameter values 3, 5, and 8: -// -// class FooTest : public TestWithParam { ... }; -// -// TEST_P(FooTest, TestThis) { -// } -// TEST_P(FooTest, TestThat) { -// } -// INSTANTIATE_TEST_CASE_P(TestSequence, FooTest, Values(3, 5, 8)); -// - -// Range() returns generators providing sequences of values in a range. -// -// Synopsis: -// Range(start, end) -// - returns a generator producing a sequence of values {start, start+1, -// start+2, ..., }. -// Range(start, end, step) -// - returns a generator producing a sequence of values {start, start+step, -// start+step+step, ..., }. -// Notes: -// * The generated sequences never include end. For example, Range(1, 5) -// returns a generator producing a sequence {1, 2, 3, 4}. Range(1, 9, 2) -// returns a generator producing {1, 3, 5, 7}. -// * start and end must have the same type. That type may be any integral or -// floating-point type or a user defined type satisfying these conditions: -// * It must be assignable (have operator=() defined). -// * It must have operator+() (operator+(int-compatible type) for -// two-operand version). -// * It must have operator<() defined. -// Elements in the resulting sequences will also have that type. -// * Condition start < end must be satisfied in order for resulting sequences -// to contain any elements. -// -template -internal::ParamGenerator Range(T start, T end, IncrementT step) { - return internal::ParamGenerator( - new internal::RangeGenerator(start, end, step)); -} - -template -internal::ParamGenerator Range(T start, T end) { - return Range(start, end, 1); -} - -// ValuesIn() function allows generation of tests with parameters coming from -// a container. -// -// Synopsis: -// ValuesIn(const T (&array)[N]) -// - returns a generator producing sequences with elements from -// a C-style array. -// ValuesIn(const Container& container) -// - returns a generator producing sequences with elements from -// an STL-style container. -// ValuesIn(Iterator begin, Iterator end) -// - returns a generator producing sequences with elements from -// a range [begin, end) defined by a pair of STL-style iterators. These -// iterators can also be plain C pointers. -// -// Please note that ValuesIn copies the values from the containers -// passed in and keeps them to generate tests in RUN_ALL_TESTS(). -// -// Examples: -// -// This instantiates tests from test case StringTest -// each with C-string values of "foo", "bar", and "baz": -// -// const char* strings[] = {"foo", "bar", "baz"}; -// INSTANTIATE_TEST_CASE_P(StringSequence, SrtingTest, ValuesIn(strings)); -// -// This instantiates tests from test case StlStringTest -// each with STL strings with values "a" and "b": -// -// ::std::vector< ::std::string> GetParameterStrings() { -// ::std::vector< ::std::string> v; -// v.push_back("a"); -// v.push_back("b"); -// return v; -// } -// -// INSTANTIATE_TEST_CASE_P(CharSequence, -// StlStringTest, -// ValuesIn(GetParameterStrings())); -// -// -// This will also instantiate tests from CharTest -// each with parameter values 'a' and 'b': -// -// ::std::list GetParameterChars() { -// ::std::list list; -// list.push_back('a'); -// list.push_back('b'); -// return list; -// } -// ::std::list l = GetParameterChars(); -// INSTANTIATE_TEST_CASE_P(CharSequence2, -// CharTest, -// ValuesIn(l.begin(), l.end())); -// -template -internal::ParamGenerator< - typename ::testing::internal::IteratorTraits::value_type> -ValuesIn(ForwardIterator begin, ForwardIterator end) { - typedef typename ::testing::internal::IteratorTraits - ::value_type ParamType; - return internal::ParamGenerator( - new internal::ValuesInIteratorRangeGenerator(begin, end)); -} - -template -internal::ParamGenerator ValuesIn(const T (&array)[N]) { - return ValuesIn(array, array + N); -} - -template -internal::ParamGenerator ValuesIn( - const Container& container) { - return ValuesIn(container.begin(), container.end()); -} - -// Values() allows generating tests from explicitly specified list of -// parameters. -// -// Synopsis: -// Values(T v1, T v2, ..., T vN) -// - returns a generator producing sequences with elements v1, v2, ..., vN. -// -// For example, this instantiates tests from test case BarTest each -// with values "one", "two", and "three": -// -// INSTANTIATE_TEST_CASE_P(NumSequence, BarTest, Values("one", "two", "three")); -// -// This instantiates tests from test case BazTest each with values 1, 2, 3.5. -// The exact type of values will depend on the type of parameter in BazTest. -// -// INSTANTIATE_TEST_CASE_P(FloatingNumbers, BazTest, Values(1, 2, 3.5)); -// -// Currently, Values() supports from 1 to 50 parameters. -// -template -internal::ValueArray1 Values(T1 v1) { - return internal::ValueArray1(v1); -} - -template -internal::ValueArray2 Values(T1 v1, T2 v2) { - return internal::ValueArray2(v1, v2); -} - -template -internal::ValueArray3 Values(T1 v1, T2 v2, T3 v3) { - return internal::ValueArray3(v1, v2, v3); -} - -template -internal::ValueArray4 Values(T1 v1, T2 v2, T3 v3, T4 v4) { - return internal::ValueArray4(v1, v2, v3, v4); -} - -template -internal::ValueArray5 Values(T1 v1, T2 v2, T3 v3, T4 v4, - T5 v5) { - return internal::ValueArray5(v1, v2, v3, v4, v5); -} - -template -internal::ValueArray6 Values(T1 v1, T2 v2, T3 v3, - T4 v4, T5 v5, T6 v6) { - return internal::ValueArray6(v1, v2, v3, v4, v5, v6); -} - -template -internal::ValueArray7 Values(T1 v1, T2 v2, T3 v3, - T4 v4, T5 v5, T6 v6, T7 v7) { - return internal::ValueArray7(v1, v2, v3, v4, v5, - v6, v7); -} - -template -internal::ValueArray8 Values(T1 v1, T2 v2, - T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8) { - return internal::ValueArray8(v1, v2, v3, v4, - v5, v6, v7, v8); -} - -template -internal::ValueArray9 Values(T1 v1, T2 v2, - T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9) { - return internal::ValueArray9(v1, v2, v3, - v4, v5, v6, v7, v8, v9); -} - -template -internal::ValueArray10 Values(T1 v1, - T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10) { - return internal::ValueArray10(v1, - v2, v3, v4, v5, v6, v7, v8, v9, v10); -} - -template -internal::ValueArray11 Values(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, - T10 v10, T11 v11) { - return internal::ValueArray11(v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11); -} - -template -internal::ValueArray12 Values(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, - T10 v10, T11 v11, T12 v12) { - return internal::ValueArray12(v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12); -} - -template -internal::ValueArray13 Values(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, - T10 v10, T11 v11, T12 v12, T13 v13) { - return internal::ValueArray13(v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13); -} - -template -internal::ValueArray14 Values(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, - T10 v10, T11 v11, T12 v12, T13 v13, T14 v14) { - return internal::ValueArray14(v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, - v14); -} - -template -internal::ValueArray15 Values(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, - T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15) { - return internal::ValueArray15(v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, - v13, v14, v15); -} - -template -internal::ValueArray16 Values(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, - T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, - T16 v16) { - return internal::ValueArray16(v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, - v12, v13, v14, v15, v16); -} - -template -internal::ValueArray17 Values(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, - T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, - T16 v16, T17 v17) { - return internal::ValueArray17(v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, - v11, v12, v13, v14, v15, v16, v17); -} - -template -internal::ValueArray18 Values(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, - T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, - T16 v16, T17 v17, T18 v18) { - return internal::ValueArray18(v1, v2, v3, v4, v5, v6, v7, v8, v9, - v10, v11, v12, v13, v14, v15, v16, v17, v18); -} - -template -internal::ValueArray19 Values(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, - T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, - T15 v15, T16 v16, T17 v17, T18 v18, T19 v19) { - return internal::ValueArray19(v1, v2, v3, v4, v5, v6, v7, v8, - v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19); -} - -template -internal::ValueArray20 Values(T1 v1, T2 v2, T3 v3, T4 v4, - T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, - T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20) { - return internal::ValueArray20(v1, v2, v3, v4, v5, v6, v7, - v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20); -} - -template -internal::ValueArray21 Values(T1 v1, T2 v2, T3 v3, T4 v4, - T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, - T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21) { - return internal::ValueArray21(v1, v2, v3, v4, v5, v6, - v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21); -} - -template -internal::ValueArray22 Values(T1 v1, T2 v2, T3 v3, - T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, - T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, - T21 v21, T22 v22) { - return internal::ValueArray22(v1, v2, v3, v4, - v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, - v20, v21, v22); -} - -template -internal::ValueArray23 Values(T1 v1, T2 v2, - T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, - T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, - T21 v21, T22 v22, T23 v23) { - return internal::ValueArray23(v1, v2, v3, - v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, - v20, v21, v22, v23); -} - -template -internal::ValueArray24 Values(T1 v1, T2 v2, - T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, - T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, - T21 v21, T22 v22, T23 v23, T24 v24) { - return internal::ValueArray24(v1, v2, - v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, - v19, v20, v21, v22, v23, v24); -} - -template -internal::ValueArray25 Values(T1 v1, - T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, - T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, - T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25) { - return internal::ValueArray25(v1, - v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, - v18, v19, v20, v21, v22, v23, v24, v25); -} - -template -internal::ValueArray26 Values(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, - T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, - T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, - T26 v26) { - return internal::ValueArray26(v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, - v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26); -} - -template -internal::ValueArray27 Values(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, - T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, - T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, - T26 v26, T27 v27) { - return internal::ValueArray27(v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, - v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27); -} - -template -internal::ValueArray28 Values(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, - T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, - T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, - T26 v26, T27 v27, T28 v28) { - return internal::ValueArray28(v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, - v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, - v28); -} - -template -internal::ValueArray29 Values(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, - T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, - T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, - T26 v26, T27 v27, T28 v28, T29 v29) { - return internal::ValueArray29(v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, - v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, - v27, v28, v29); -} - -template -internal::ValueArray30 Values(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, - T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, - T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, - T25 v25, T26 v26, T27 v27, T28 v28, T29 v29, T30 v30) { - return internal::ValueArray30(v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, - v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, - v26, v27, v28, v29, v30); -} - -template -internal::ValueArray31 Values(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, - T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, - T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, - T24 v24, T25 v25, T26 v26, T27 v27, T28 v28, T29 v29, T30 v30, T31 v31) { - return internal::ValueArray31(v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, - v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, - v25, v26, v27, v28, v29, v30, v31); -} - -template -internal::ValueArray32 Values(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, - T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, - T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, - T24 v24, T25 v25, T26 v26, T27 v27, T28 v28, T29 v29, T30 v30, T31 v31, - T32 v32) { - return internal::ValueArray32(v1, v2, v3, v4, v5, v6, v7, v8, v9, - v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, - v24, v25, v26, v27, v28, v29, v30, v31, v32); -} - -template -internal::ValueArray33 Values(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, - T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, - T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, - T24 v24, T25 v25, T26 v26, T27 v27, T28 v28, T29 v29, T30 v30, T31 v31, - T32 v32, T33 v33) { - return internal::ValueArray33(v1, v2, v3, v4, v5, v6, v7, v8, - v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, - v24, v25, v26, v27, v28, v29, v30, v31, v32, v33); -} - -template -internal::ValueArray34 Values(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, - T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, - T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, - T23 v23, T24 v24, T25 v25, T26 v26, T27 v27, T28 v28, T29 v29, T30 v30, - T31 v31, T32 v32, T33 v33, T34 v34) { - return internal::ValueArray34(v1, v2, v3, v4, v5, v6, v7, - v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, - v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34); -} - -template -internal::ValueArray35 Values(T1 v1, T2 v2, T3 v3, T4 v4, - T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, - T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, - T22 v22, T23 v23, T24 v24, T25 v25, T26 v26, T27 v27, T28 v28, T29 v29, - T30 v30, T31 v31, T32 v32, T33 v33, T34 v34, T35 v35) { - return internal::ValueArray35(v1, v2, v3, v4, v5, v6, - v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, - v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35); -} - -template -internal::ValueArray36 Values(T1 v1, T2 v2, T3 v3, T4 v4, - T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, - T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, - T22 v22, T23 v23, T24 v24, T25 v25, T26 v26, T27 v27, T28 v28, T29 v29, - T30 v30, T31 v31, T32 v32, T33 v33, T34 v34, T35 v35, T36 v36) { - return internal::ValueArray36(v1, v2, v3, v4, - v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, - v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, - v34, v35, v36); -} - -template -internal::ValueArray37 Values(T1 v1, T2 v2, T3 v3, - T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, - T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, - T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, T26 v26, T27 v27, T28 v28, - T29 v29, T30 v30, T31 v31, T32 v32, T33 v33, T34 v34, T35 v35, T36 v36, - T37 v37) { - return internal::ValueArray37(v1, v2, v3, - v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, - v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, - v34, v35, v36, v37); -} - -template -internal::ValueArray38 Values(T1 v1, T2 v2, - T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, - T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, - T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, T26 v26, T27 v27, T28 v28, - T29 v29, T30 v30, T31 v31, T32 v32, T33 v33, T34 v34, T35 v35, T36 v36, - T37 v37, T38 v38) { - return internal::ValueArray38(v1, v2, - v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, - v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, - v33, v34, v35, v36, v37, v38); -} - -template -internal::ValueArray39 Values(T1 v1, T2 v2, - T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, - T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, - T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, T26 v26, T27 v27, T28 v28, - T29 v29, T30 v30, T31 v31, T32 v32, T33 v33, T34 v34, T35 v35, T36 v36, - T37 v37, T38 v38, T39 v39) { - return internal::ValueArray39(v1, - v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, - v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, - v32, v33, v34, v35, v36, v37, v38, v39); -} - -template -internal::ValueArray40 Values(T1 v1, - T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, - T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, - T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, T26 v26, T27 v27, - T28 v28, T29 v29, T30 v30, T31 v31, T32 v32, T33 v33, T34 v34, T35 v35, - T36 v36, T37 v37, T38 v38, T39 v39, T40 v40) { - return internal::ValueArray40(v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, - v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, - v30, v31, v32, v33, v34, v35, v36, v37, v38, v39, v40); -} - -template -internal::ValueArray41 Values(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, - T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, - T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, - T26 v26, T27 v27, T28 v28, T29 v29, T30 v30, T31 v31, T32 v32, T33 v33, - T34 v34, T35 v35, T36 v36, T37 v37, T38 v38, T39 v39, T40 v40, T41 v41) { - return internal::ValueArray41(v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, - v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, - v29, v30, v31, v32, v33, v34, v35, v36, v37, v38, v39, v40, v41); -} - -template -internal::ValueArray42 Values(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, - T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, - T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, - T26 v26, T27 v27, T28 v28, T29 v29, T30 v30, T31 v31, T32 v32, T33 v33, - T34 v34, T35 v35, T36 v36, T37 v37, T38 v38, T39 v39, T40 v40, T41 v41, - T42 v42) { - return internal::ValueArray42(v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, - v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, - v28, v29, v30, v31, v32, v33, v34, v35, v36, v37, v38, v39, v40, v41, - v42); -} - -template -internal::ValueArray43 Values(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, - T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, - T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, - T26 v26, T27 v27, T28 v28, T29 v29, T30 v30, T31 v31, T32 v32, T33 v33, - T34 v34, T35 v35, T36 v36, T37 v37, T38 v38, T39 v39, T40 v40, T41 v41, - T42 v42, T43 v43) { - return internal::ValueArray43(v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, - v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, - v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37, v38, v39, v40, - v41, v42, v43); -} - -template -internal::ValueArray44 Values(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, - T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, T17 v17, - T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, T25 v25, - T26 v26, T27 v27, T28 v28, T29 v29, T30 v30, T31 v31, T32 v32, T33 v33, - T34 v34, T35 v35, T36 v36, T37 v37, T38 v38, T39 v39, T40 v40, T41 v41, - T42 v42, T43 v43, T44 v44) { - return internal::ValueArray44(v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, - v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, - v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37, v38, v39, - v40, v41, v42, v43, v44); -} - -template -internal::ValueArray45 Values(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, T8 v8, - T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, T16 v16, - T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, T24 v24, - T25 v25, T26 v26, T27 v27, T28 v28, T29 v29, T30 v30, T31 v31, T32 v32, - T33 v33, T34 v34, T35 v35, T36 v36, T37 v37, T38 v38, T39 v39, T40 v40, - T41 v41, T42 v42, T43 v43, T44 v44, T45 v45) { - return internal::ValueArray45(v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, - v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, - v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37, v38, - v39, v40, v41, v42, v43, v44, v45); -} - -template -internal::ValueArray46 Values(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, - T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, - T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, - T24 v24, T25 v25, T26 v26, T27 v27, T28 v28, T29 v29, T30 v30, T31 v31, - T32 v32, T33 v33, T34 v34, T35 v35, T36 v36, T37 v37, T38 v38, T39 v39, - T40 v40, T41 v41, T42 v42, T43 v43, T44 v44, T45 v45, T46 v46) { - return internal::ValueArray46(v1, v2, v3, v4, v5, v6, v7, v8, v9, - v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, - v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37, - v38, v39, v40, v41, v42, v43, v44, v45, v46); -} - -template -internal::ValueArray47 Values(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, T7 v7, - T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, - T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, - T24 v24, T25 v25, T26 v26, T27 v27, T28 v28, T29 v29, T30 v30, T31 v31, - T32 v32, T33 v33, T34 v34, T35 v35, T36 v36, T37 v37, T38 v38, T39 v39, - T40 v40, T41 v41, T42 v42, T43 v43, T44 v44, T45 v45, T46 v46, T47 v47) { - return internal::ValueArray47(v1, v2, v3, v4, v5, v6, v7, v8, - v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, - v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, v37, - v38, v39, v40, v41, v42, v43, v44, v45, v46, v47); -} - -template -internal::ValueArray48 Values(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, T6 v6, - T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, T15 v15, - T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, T23 v23, - T24 v24, T25 v25, T26 v26, T27 v27, T28 v28, T29 v29, T30 v30, T31 v31, - T32 v32, T33 v33, T34 v34, T35 v35, T36 v36, T37 v37, T38 v38, T39 v39, - T40 v40, T41 v41, T42 v42, T43 v43, T44 v44, T45 v45, T46 v46, T47 v47, - T48 v48) { - return internal::ValueArray48(v1, v2, v3, v4, v5, v6, v7, - v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, - v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, v36, - v37, v38, v39, v40, v41, v42, v43, v44, v45, v46, v47, v48); -} - -template -internal::ValueArray49 Values(T1 v1, T2 v2, T3 v3, T4 v4, T5 v5, - T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, T14 v14, - T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, T22 v22, - T23 v23, T24 v24, T25 v25, T26 v26, T27 v27, T28 v28, T29 v29, T30 v30, - T31 v31, T32 v32, T33 v33, T34 v34, T35 v35, T36 v36, T37 v37, T38 v38, - T39 v39, T40 v40, T41 v41, T42 v42, T43 v43, T44 v44, T45 v45, T46 v46, - T47 v47, T48 v48, T49 v49) { - return internal::ValueArray49(v1, v2, v3, v4, v5, v6, - v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, - v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, v34, v35, - v36, v37, v38, v39, v40, v41, v42, v43, v44, v45, v46, v47, v48, v49); -} - -template -internal::ValueArray50 Values(T1 v1, T2 v2, T3 v3, T4 v4, - T5 v5, T6 v6, T7 v7, T8 v8, T9 v9, T10 v10, T11 v11, T12 v12, T13 v13, - T14 v14, T15 v15, T16 v16, T17 v17, T18 v18, T19 v19, T20 v20, T21 v21, - T22 v22, T23 v23, T24 v24, T25 v25, T26 v26, T27 v27, T28 v28, T29 v29, - T30 v30, T31 v31, T32 v32, T33 v33, T34 v34, T35 v35, T36 v36, T37 v37, - T38 v38, T39 v39, T40 v40, T41 v41, T42 v42, T43 v43, T44 v44, T45 v45, - T46 v46, T47 v47, T48 v48, T49 v49, T50 v50) { - return internal::ValueArray50(v1, v2, v3, v4, - v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, - v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v33, - v34, v35, v36, v37, v38, v39, v40, v41, v42, v43, v44, v45, v46, v47, - v48, v49, v50); -} - -// Bool() allows generating tests with parameters in a set of (false, true). -// -// Synopsis: -// Bool() -// - returns a generator producing sequences with elements {false, true}. -// -// It is useful when testing code that depends on Boolean flags. Combinations -// of multiple flags can be tested when several Bool()'s are combined using -// Combine() function. -// -// In the following example all tests in the test case FlagDependentTest -// will be instantiated twice with parameters false and true. -// -// class FlagDependentTest : public testing::TestWithParam { -// virtual void SetUp() { -// external_flag = GetParam(); -// } -// } -// INSTANTIATE_TEST_CASE_P(BoolSequence, FlagDependentTest, Bool()); -// -inline internal::ParamGenerator Bool() { - return Values(false, true); -} - -# if GTEST_HAS_COMBINE -// Combine() allows the user to combine two or more sequences to produce -// values of a Cartesian product of those sequences' elements. -// -// Synopsis: -// Combine(gen1, gen2, ..., genN) -// - returns a generator producing sequences with elements coming from -// the Cartesian product of elements from the sequences generated by -// gen1, gen2, ..., genN. The sequence elements will have a type of -// tuple where T1, T2, ..., TN are the types -// of elements from sequences produces by gen1, gen2, ..., genN. -// -// Combine can have up to 10 arguments. This number is currently limited -// by the maximum number of elements in the tuple implementation used by Google -// Test. -// -// Example: -// -// This will instantiate tests in test case AnimalTest each one with -// the parameter values tuple("cat", BLACK), tuple("cat", WHITE), -// tuple("dog", BLACK), and tuple("dog", WHITE): -// -// enum Color { BLACK, GRAY, WHITE }; -// class AnimalTest -// : public testing::TestWithParam > {...}; -// -// TEST_P(AnimalTest, AnimalLooksNice) {...} -// -// INSTANTIATE_TEST_CASE_P(AnimalVariations, AnimalTest, -// Combine(Values("cat", "dog"), -// Values(BLACK, WHITE))); -// -// This will instantiate tests in FlagDependentTest with all variations of two -// Boolean flags: -// -// class FlagDependentTest -// : public testing::TestWithParam > { -// virtual void SetUp() { -// // Assigns external_flag_1 and external_flag_2 values from the tuple. -// tie(external_flag_1, external_flag_2) = GetParam(); -// } -// }; -// -// TEST_P(FlagDependentTest, TestFeature1) { -// // Test your code using external_flag_1 and external_flag_2 here. -// } -// INSTANTIATE_TEST_CASE_P(TwoBoolSequence, FlagDependentTest, -// Combine(Bool(), Bool())); -// -template -internal::CartesianProductHolder2 Combine( - const Generator1& g1, const Generator2& g2) { - return internal::CartesianProductHolder2( - g1, g2); -} - -template -internal::CartesianProductHolder3 Combine( - const Generator1& g1, const Generator2& g2, const Generator3& g3) { - return internal::CartesianProductHolder3( - g1, g2, g3); -} - -template -internal::CartesianProductHolder4 Combine( - const Generator1& g1, const Generator2& g2, const Generator3& g3, - const Generator4& g4) { - return internal::CartesianProductHolder4( - g1, g2, g3, g4); -} - -template -internal::CartesianProductHolder5 Combine( - const Generator1& g1, const Generator2& g2, const Generator3& g3, - const Generator4& g4, const Generator5& g5) { - return internal::CartesianProductHolder5( - g1, g2, g3, g4, g5); -} - -template -internal::CartesianProductHolder6 Combine( - const Generator1& g1, const Generator2& g2, const Generator3& g3, - const Generator4& g4, const Generator5& g5, const Generator6& g6) { - return internal::CartesianProductHolder6( - g1, g2, g3, g4, g5, g6); -} - -template -internal::CartesianProductHolder7 Combine( - const Generator1& g1, const Generator2& g2, const Generator3& g3, - const Generator4& g4, const Generator5& g5, const Generator6& g6, - const Generator7& g7) { - return internal::CartesianProductHolder7( - g1, g2, g3, g4, g5, g6, g7); -} - -template -internal::CartesianProductHolder8 Combine( - const Generator1& g1, const Generator2& g2, const Generator3& g3, - const Generator4& g4, const Generator5& g5, const Generator6& g6, - const Generator7& g7, const Generator8& g8) { - return internal::CartesianProductHolder8( - g1, g2, g3, g4, g5, g6, g7, g8); -} - -template -internal::CartesianProductHolder9 Combine( - const Generator1& g1, const Generator2& g2, const Generator3& g3, - const Generator4& g4, const Generator5& g5, const Generator6& g6, - const Generator7& g7, const Generator8& g8, const Generator9& g9) { - return internal::CartesianProductHolder9( - g1, g2, g3, g4, g5, g6, g7, g8, g9); -} - -template -internal::CartesianProductHolder10 Combine( - const Generator1& g1, const Generator2& g2, const Generator3& g3, - const Generator4& g4, const Generator5& g5, const Generator6& g6, - const Generator7& g7, const Generator8& g8, const Generator9& g9, - const Generator10& g10) { - return internal::CartesianProductHolder10( - g1, g2, g3, g4, g5, g6, g7, g8, g9, g10); -} -# endif // GTEST_HAS_COMBINE - - - -# define TEST_P(test_case_name, test_name) \ - class GTEST_TEST_CLASS_NAME_(test_case_name, test_name) \ - : public test_case_name { \ - public: \ - GTEST_TEST_CLASS_NAME_(test_case_name, test_name)() {} \ - virtual void TestBody(); \ - private: \ - static int AddToRegistry() { \ - ::testing::UnitTest::GetInstance()->parameterized_test_registry(). \ - GetTestCasePatternHolder(\ - #test_case_name, __FILE__, __LINE__)->AddTestPattern(\ - #test_case_name, \ - #test_name, \ - new ::testing::internal::TestMetaFactory< \ - GTEST_TEST_CLASS_NAME_(test_case_name, test_name)>()); \ - return 0; \ - } \ - static int gtest_registering_dummy_; \ - GTEST_DISALLOW_COPY_AND_ASSIGN_(\ - GTEST_TEST_CLASS_NAME_(test_case_name, test_name)); \ - }; \ - int GTEST_TEST_CLASS_NAME_(test_case_name, \ - test_name)::gtest_registering_dummy_ = \ - GTEST_TEST_CLASS_NAME_(test_case_name, test_name)::AddToRegistry(); \ - void GTEST_TEST_CLASS_NAME_(test_case_name, test_name)::TestBody() - -# define INSTANTIATE_TEST_CASE_P(prefix, test_case_name, generator) \ - ::testing::internal::ParamGenerator \ - gtest_##prefix##test_case_name##_EvalGenerator_() { return generator; } \ - int gtest_##prefix##test_case_name##_dummy_ = \ - ::testing::UnitTest::GetInstance()->parameterized_test_registry(). \ - GetTestCasePatternHolder(\ - #test_case_name, __FILE__, __LINE__)->AddTestCaseInstantiation(\ - #prefix, \ - >est_##prefix##test_case_name##_EvalGenerator_, \ - __FILE__, __LINE__) - -} // namespace testing - -#endif // GTEST_HAS_PARAM_TEST - -#endif // GTEST_INCLUDE_GTEST_GTEST_PARAM_TEST_H_ -// Copyright 2006, 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. -// -// Author: wan@google.com (Zhanyong Wan) -// -// Google C++ Testing Framework definitions useful in production code. - -#ifndef GTEST_INCLUDE_GTEST_GTEST_PROD_H_ -#define GTEST_INCLUDE_GTEST_GTEST_PROD_H_ - -// When you need to test the private or protected members of a class, -// use the FRIEND_TEST macro to declare your tests as friends of the -// class. For example: -// -// class MyClass { -// private: -// void MyMethod(); -// FRIEND_TEST(MyClassTest, MyMethod); -// }; -// -// class MyClassTest : public testing::Test { -// // ... -// }; -// -// TEST_F(MyClassTest, MyMethod) { -// // Can call MyClass::MyMethod() here. -// } - -#define FRIEND_TEST(test_case_name, test_name)\ -friend class test_case_name##_##test_name##_Test - -#endif // GTEST_INCLUDE_GTEST_GTEST_PROD_H_ -// Copyright 2008, 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. -// -// Author: mheule@google.com (Markus Heule) -// - -#ifndef GTEST_INCLUDE_GTEST_GTEST_TEST_PART_H_ -#define GTEST_INCLUDE_GTEST_GTEST_TEST_PART_H_ - -#include -#include - -namespace testing { - -// A copyable object representing the result of a test part (i.e. an -// assertion or an explicit FAIL(), ADD_FAILURE(), or SUCCESS()). -// -// Don't inherit from TestPartResult as its destructor is not virtual. -class GTEST_API_ TestPartResult { - public: - // The possible outcomes of a test part (i.e. an assertion or an - // explicit SUCCEED(), FAIL(), or ADD_FAILURE()). - enum Type { - kSuccess, // Succeeded. - kNonFatalFailure, // Failed but the test can continue. - kFatalFailure // Failed and the test should be terminated. - }; - - // C'tor. TestPartResult does NOT have a default constructor. - // Always use this constructor (with parameters) to create a - // TestPartResult object. - TestPartResult(Type a_type, - const char* a_file_name, - int a_line_number, - const char* a_message) - : type_(a_type), - file_name_(a_file_name), - line_number_(a_line_number), - summary_(ExtractSummary(a_message)), - message_(a_message) { - } - - // Gets the outcome of the test part. - Type type() const { return type_; } - - // Gets the name of the source file where the test part took place, or - // NULL if it's unknown. - const char* file_name() const { return file_name_.c_str(); } - - // Gets the line in the source file where the test part took place, - // or -1 if it's unknown. - int line_number() const { return line_number_; } - - // Gets the summary of the failure message. - const char* summary() const { return summary_.c_str(); } - - // Gets the message associated with the test part. - const char* message() const { return message_.c_str(); } - - // Returns true iff the test part passed. - bool passed() const { return type_ == kSuccess; } - - // Returns true iff the test part failed. - bool failed() const { return type_ != kSuccess; } - - // Returns true iff the test part non-fatally failed. - bool nonfatally_failed() const { return type_ == kNonFatalFailure; } - - // Returns true iff the test part fatally failed. - bool fatally_failed() const { return type_ == kFatalFailure; } - private: - Type type_; - - // Gets the summary of the failure message by omitting the stack - // trace in it. - static internal::String ExtractSummary(const char* message); - - // The name of the source file where the test part took place, or - // NULL if the source file is unknown. - internal::String file_name_; - // The line in the source file where the test part took place, or -1 - // if the line number is unknown. - int line_number_; - internal::String summary_; // The test failure summary. - internal::String message_; // The test failure message. -}; - -// Prints a TestPartResult object. -std::ostream& operator<<(std::ostream& os, const TestPartResult& result); - -// An array of TestPartResult objects. -// -// Don't inherit from TestPartResultArray as its destructor is not -// virtual. -class GTEST_API_ TestPartResultArray { - public: - TestPartResultArray() {} - - // Appends the given TestPartResult to the array. - void Append(const TestPartResult& result); - - // Returns the TestPartResult at the given index (0-based). - const TestPartResult& GetTestPartResult(int index) const; - - // Returns the number of TestPartResult objects in the array. - int size() const; - - private: - std::vector array_; - - GTEST_DISALLOW_COPY_AND_ASSIGN_(TestPartResultArray); -}; - -// This interface knows how to report a test part result. -class TestPartResultReporterInterface { - public: - virtual ~TestPartResultReporterInterface() {} - - virtual void ReportTestPartResult(const TestPartResult& result) = 0; -}; - -namespace internal { - -// This helper class is used by {ASSERT|EXPECT}_NO_FATAL_FAILURE to check if a -// statement generates new fatal failures. To do so it registers itself as the -// current test part result reporter. Besides checking if fatal failures were -// reported, it only delegates the reporting to the former result reporter. -// The original result reporter is restored in the destructor. -// INTERNAL IMPLEMENTATION - DO NOT USE IN A USER PROGRAM. -class GTEST_API_ HasNewFatalFailureHelper - : public TestPartResultReporterInterface { - public: - HasNewFatalFailureHelper(); - virtual ~HasNewFatalFailureHelper(); - virtual void ReportTestPartResult(const TestPartResult& result); - bool has_new_fatal_failure() const { return has_new_fatal_failure_; } - private: - bool has_new_fatal_failure_; - TestPartResultReporterInterface* original_reporter_; - - GTEST_DISALLOW_COPY_AND_ASSIGN_(HasNewFatalFailureHelper); -}; - -} // namespace internal - -} // namespace testing - -#endif // GTEST_INCLUDE_GTEST_GTEST_TEST_PART_H_ -// Copyright 2008 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. -// -// Author: wan@google.com (Zhanyong Wan) - -#ifndef GTEST_INCLUDE_GTEST_GTEST_TYPED_TEST_H_ -#define GTEST_INCLUDE_GTEST_GTEST_TYPED_TEST_H_ - -// This header implements typed tests and type-parameterized tests. - -// Typed (aka type-driven) tests repeat the same test for types in a -// list. You must know which types you want to test with when writing -// typed tests. Here's how you do it: - -#if 0 - -// First, define a fixture class template. It should be parameterized -// by a type. Remember to derive it from testing::Test. -template -class FooTest : public testing::Test { - public: - ... - typedef std::list List; - static T shared_; - T value_; -}; - -// Next, associate a list of types with the test case, which will be -// repeated for each type in the list. The typedef is necessary for -// the macro to parse correctly. -typedef testing::Types MyTypes; -TYPED_TEST_CASE(FooTest, MyTypes); - -// If the type list contains only one type, you can write that type -// directly without Types<...>: -// TYPED_TEST_CASE(FooTest, int); - -// Then, use TYPED_TEST() instead of TEST_F() to define as many typed -// tests for this test case as you want. -TYPED_TEST(FooTest, DoesBlah) { - // Inside a test, refer to TypeParam to get the type parameter. - // Since we are inside a derived class template, C++ requires use to - // visit the members of FooTest via 'this'. - TypeParam n = this->value_; - - // To visit static members of the fixture, add the TestFixture:: - // prefix. - n += TestFixture::shared_; - - // To refer to typedefs in the fixture, add the "typename - // TestFixture::" prefix. - typename TestFixture::List values; - values.push_back(n); - ... -} - -TYPED_TEST(FooTest, HasPropertyA) { ... } - -#endif // 0 - -// Type-parameterized tests are abstract test patterns parameterized -// by a type. Compared with typed tests, type-parameterized tests -// allow you to define the test pattern without knowing what the type -// parameters are. The defined pattern can be instantiated with -// different types any number of times, in any number of translation -// units. -// -// If you are designing an interface or concept, you can define a -// suite of type-parameterized tests to verify properties that any -// valid implementation of the interface/concept should have. Then, -// each implementation can easily instantiate the test suite to verify -// that it conforms to the requirements, without having to write -// similar tests repeatedly. Here's an example: - -#if 0 - -// First, define a fixture class template. It should be parameterized -// by a type. Remember to derive it from testing::Test. -template -class FooTest : public testing::Test { - ... -}; - -// Next, declare that you will define a type-parameterized test case -// (the _P suffix is for "parameterized" or "pattern", whichever you -// prefer): -TYPED_TEST_CASE_P(FooTest); - -// Then, use TYPED_TEST_P() to define as many type-parameterized tests -// for this type-parameterized test case as you want. -TYPED_TEST_P(FooTest, DoesBlah) { - // Inside a test, refer to TypeParam to get the type parameter. - TypeParam n = 0; - ... -} - -TYPED_TEST_P(FooTest, HasPropertyA) { ... } - -// Now the tricky part: you need to register all test patterns before -// you can instantiate them. The first argument of the macro is the -// test case name; the rest are the names of the tests in this test -// case. -REGISTER_TYPED_TEST_CASE_P(FooTest, - DoesBlah, HasPropertyA); - -// Finally, you are free to instantiate the pattern with the types you -// want. If you put the above code in a header file, you can #include -// it in multiple C++ source files and instantiate it multiple times. -// -// To distinguish different instances of the pattern, the first -// argument to the INSTANTIATE_* macro is a prefix that will be added -// to the actual test case name. Remember to pick unique prefixes for -// different instances. -typedef testing::Types MyTypes; -INSTANTIATE_TYPED_TEST_CASE_P(My, FooTest, MyTypes); - -// If the type list contains only one type, you can write that type -// directly without Types<...>: -// INSTANTIATE_TYPED_TEST_CASE_P(My, FooTest, int); - -#endif // 0 - - -// Implements typed tests. - -#if GTEST_HAS_TYPED_TEST - -// INTERNAL IMPLEMENTATION - DO NOT USE IN USER CODE. -// -// Expands to the name of the typedef for the type parameters of the -// given test case. -# define GTEST_TYPE_PARAMS_(TestCaseName) gtest_type_params_##TestCaseName##_ - -// The 'Types' template argument below must have spaces around it -// since some compilers may choke on '>>' when passing a template -// instance (e.g. Types) -# define TYPED_TEST_CASE(CaseName, Types) \ - typedef ::testing::internal::TypeList< Types >::type \ - GTEST_TYPE_PARAMS_(CaseName) - -# define TYPED_TEST(CaseName, TestName) \ - template \ - class GTEST_TEST_CLASS_NAME_(CaseName, TestName) \ - : public CaseName { \ - private: \ - typedef CaseName TestFixture; \ - typedef gtest_TypeParam_ TypeParam; \ - virtual void TestBody(); \ - }; \ - bool gtest_##CaseName##_##TestName##_registered_ GTEST_ATTRIBUTE_UNUSED_ = \ - ::testing::internal::TypeParameterizedTest< \ - CaseName, \ - ::testing::internal::TemplateSel< \ - GTEST_TEST_CLASS_NAME_(CaseName, TestName)>, \ - GTEST_TYPE_PARAMS_(CaseName)>::Register(\ - "", #CaseName, #TestName, 0); \ - template \ - void GTEST_TEST_CLASS_NAME_(CaseName, TestName)::TestBody() - -#endif // GTEST_HAS_TYPED_TEST - -// Implements type-parameterized tests. - -#if GTEST_HAS_TYPED_TEST_P - -// INTERNAL IMPLEMENTATION - DO NOT USE IN USER CODE. -// -// Expands to the namespace name that the type-parameterized tests for -// the given type-parameterized test case are defined in. The exact -// name of the namespace is subject to change without notice. -# define GTEST_CASE_NAMESPACE_(TestCaseName) \ - gtest_case_##TestCaseName##_ - -// INTERNAL IMPLEMENTATION - DO NOT USE IN USER CODE. -// -// Expands to the name of the variable used to remember the names of -// the defined tests in the given test case. -# define GTEST_TYPED_TEST_CASE_P_STATE_(TestCaseName) \ - gtest_typed_test_case_p_state_##TestCaseName##_ - -// INTERNAL IMPLEMENTATION - DO NOT USE IN USER CODE DIRECTLY. -// -// Expands to the name of the variable used to remember the names of -// the registered tests in the given test case. -# define GTEST_REGISTERED_TEST_NAMES_(TestCaseName) \ - gtest_registered_test_names_##TestCaseName##_ - -// The variables defined in the type-parameterized test macros are -// static as typically these macros are used in a .h file that can be -// #included in multiple translation units linked together. -# define TYPED_TEST_CASE_P(CaseName) \ - static ::testing::internal::TypedTestCasePState \ - GTEST_TYPED_TEST_CASE_P_STATE_(CaseName) - -# define TYPED_TEST_P(CaseName, TestName) \ - namespace GTEST_CASE_NAMESPACE_(CaseName) { \ - template \ - class TestName : public CaseName { \ - private: \ - typedef CaseName TestFixture; \ - typedef gtest_TypeParam_ TypeParam; \ - virtual void TestBody(); \ - }; \ - static bool gtest_##TestName##_defined_ GTEST_ATTRIBUTE_UNUSED_ = \ - GTEST_TYPED_TEST_CASE_P_STATE_(CaseName).AddTestName(\ - __FILE__, __LINE__, #CaseName, #TestName); \ - } \ - template \ - void GTEST_CASE_NAMESPACE_(CaseName)::TestName::TestBody() - -# define REGISTER_TYPED_TEST_CASE_P(CaseName, ...) \ - namespace GTEST_CASE_NAMESPACE_(CaseName) { \ - typedef ::testing::internal::Templates<__VA_ARGS__>::type gtest_AllTests_; \ - } \ - static const char* const GTEST_REGISTERED_TEST_NAMES_(CaseName) = \ - GTEST_TYPED_TEST_CASE_P_STATE_(CaseName).VerifyRegisteredTestNames(\ - __FILE__, __LINE__, #__VA_ARGS__) - -// The 'Types' template argument below must have spaces around it -// since some compilers may choke on '>>' when passing a template -// instance (e.g. Types) -# define INSTANTIATE_TYPED_TEST_CASE_P(Prefix, CaseName, Types) \ - bool gtest_##Prefix##_##CaseName GTEST_ATTRIBUTE_UNUSED_ = \ - ::testing::internal::TypeParameterizedTestCase::type>::Register(\ - #Prefix, #CaseName, GTEST_REGISTERED_TEST_NAMES_(CaseName)) - -#endif // GTEST_HAS_TYPED_TEST_P - -#endif // GTEST_INCLUDE_GTEST_GTEST_TYPED_TEST_H_ - -// Depending on the platform, different string classes are available. -// On Linux, in addition to ::std::string, Google also makes use of -// class ::string, which has the same interface as ::std::string, but -// has a different implementation. -// -// The user can define GTEST_HAS_GLOBAL_STRING to 1 to indicate that -// ::string is available AND is a distinct type to ::std::string, or -// define it to 0 to indicate otherwise. -// -// If the user's ::std::string and ::string are the same class due to -// aliasing, he should define GTEST_HAS_GLOBAL_STRING to 0. -// -// If the user doesn't define GTEST_HAS_GLOBAL_STRING, it is defined -// heuristically. - -namespace testing { - -// Declares the flags. - -// This flag temporary enables the disabled tests. -GTEST_DECLARE_bool_(also_run_disabled_tests); - -// This flag brings the debugger on an assertion failure. -GTEST_DECLARE_bool_(break_on_failure); - -// This flag controls whether Google Test catches all test-thrown exceptions -// and logs them as failures. -GTEST_DECLARE_bool_(catch_exceptions); - -// This flag enables using colors in terminal output. Available values are -// "yes" to enable colors, "no" (disable colors), or "auto" (the default) -// to let Google Test decide. -GTEST_DECLARE_string_(color); - -// This flag sets up the filter to select by name using a glob pattern -// the tests to run. If the filter is not given all tests are executed. -GTEST_DECLARE_string_(filter); - -// This flag causes the Google Test to list tests. None of the tests listed -// are actually run if the flag is provided. -GTEST_DECLARE_bool_(list_tests); - -// This flag controls whether Google Test emits a detailed XML report to a file -// in addition to its normal textual output. -GTEST_DECLARE_string_(output); - -// This flags control whether Google Test prints the elapsed time for each -// test. -GTEST_DECLARE_bool_(print_time); - -// This flag specifies the random number seed. -GTEST_DECLARE_int32_(random_seed); - -// This flag sets how many times the tests are repeated. The default value -// is 1. If the value is -1 the tests are repeating forever. -GTEST_DECLARE_int32_(repeat); - -// This flag controls whether Google Test includes Google Test internal -// stack frames in failure stack traces. -GTEST_DECLARE_bool_(show_internal_stack_frames); - -// When this flag is specified, tests' order is randomized on every iteration. -GTEST_DECLARE_bool_(shuffle); - -// This flag specifies the maximum number of stack frames to be -// printed in a failure message. -GTEST_DECLARE_int32_(stack_trace_depth); - -// When this flag is specified, a failed assertion will throw an -// exception if exceptions are enabled, or exit the program with a -// non-zero code otherwise. -GTEST_DECLARE_bool_(throw_on_failure); - -// When this flag is set with a "host:port" string, on supported -// platforms test results are streamed to the specified port on -// the specified host machine. -GTEST_DECLARE_string_(stream_result_to); - -// The upper limit for valid stack trace depths. -const int kMaxStackTraceDepth = 100; - -namespace internal { - -class AssertHelper; -class DefaultGlobalTestPartResultReporter; -class ExecDeathTest; -class NoExecDeathTest; -class FinalSuccessChecker; -class GTestFlagSaver; -class TestResultAccessor; -class TestEventListenersAccessor; -class TestEventRepeater; -class WindowsDeathTest; -class UnitTestImpl* GetUnitTestImpl(); -void ReportFailureInUnknownLocation(TestPartResult::Type result_type, - const String& message); - -// Converts a streamable value to a String. A NULL pointer is -// converted to "(null)". When the input value is a ::string, -// ::std::string, ::wstring, or ::std::wstring object, each NUL -// character in it is replaced with "\\0". -// Declared in gtest-internal.h but defined here, so that it has access -// to the definition of the Message class, required by the ARM -// compiler. -template -String StreamableToString(const T& streamable) { - return (Message() << streamable).GetString(); -} - -} // namespace internal - -// The friend relationship of some of these classes is cyclic. -// If we don't forward declare them the compiler might confuse the classes -// in friendship clauses with same named classes on the scope. -class Test; -class TestCase; -class TestInfo; -class UnitTest; - -// A class for indicating whether an assertion was successful. When -// the assertion wasn't successful, the AssertionResult object -// remembers a non-empty message that describes how it failed. -// -// To create an instance of this class, use one of the factory functions -// (AssertionSuccess() and AssertionFailure()). -// -// This class is useful for two purposes: -// 1. Defining predicate functions to be used with Boolean test assertions -// EXPECT_TRUE/EXPECT_FALSE and their ASSERT_ counterparts -// 2. Defining predicate-format functions to be -// used with predicate assertions (ASSERT_PRED_FORMAT*, etc). -// -// For example, if you define IsEven predicate: -// -// testing::AssertionResult IsEven(int n) { -// if ((n % 2) == 0) -// return testing::AssertionSuccess(); -// else -// return testing::AssertionFailure() << n << " is odd"; -// } -// -// Then the failed expectation EXPECT_TRUE(IsEven(Fib(5))) -// will print the message -// -// Value of: IsEven(Fib(5)) -// Actual: false (5 is odd) -// Expected: true -// -// instead of a more opaque -// -// Value of: IsEven(Fib(5)) -// Actual: false -// Expected: true -// -// in case IsEven is a simple Boolean predicate. -// -// If you expect your predicate to be reused and want to support informative -// messages in EXPECT_FALSE and ASSERT_FALSE (negative assertions show up -// about half as often as positive ones in our tests), supply messages for -// both success and failure cases: -// -// testing::AssertionResult IsEven(int n) { -// if ((n % 2) == 0) -// return testing::AssertionSuccess() << n << " is even"; -// else -// return testing::AssertionFailure() << n << " is odd"; -// } -// -// Then a statement EXPECT_FALSE(IsEven(Fib(6))) will print -// -// Value of: IsEven(Fib(6)) -// Actual: true (8 is even) -// Expected: false -// -// NB: Predicates that support negative Boolean assertions have reduced -// performance in positive ones so be careful not to use them in tests -// that have lots (tens of thousands) of positive Boolean assertions. -// -// To use this class with EXPECT_PRED_FORMAT assertions such as: -// -// // Verifies that Foo() returns an even number. -// EXPECT_PRED_FORMAT1(IsEven, Foo()); -// -// you need to define: -// -// testing::AssertionResult IsEven(const char* expr, int n) { -// if ((n % 2) == 0) -// return testing::AssertionSuccess(); -// else -// return testing::AssertionFailure() -// << "Expected: " << expr << " is even\n Actual: it's " << n; -// } -// -// If Foo() returns 5, you will see the following message: -// -// Expected: Foo() is even -// Actual: it's 5 -// -class GTEST_API_ AssertionResult { - public: - // Copy constructor. - // Used in EXPECT_TRUE/FALSE(assertion_result). - AssertionResult(const AssertionResult& other); - // Used in the EXPECT_TRUE/FALSE(bool_expression). - explicit AssertionResult(bool success) : success_(success) {} - - // Returns true iff the assertion succeeded. - operator bool() const { return success_; } // NOLINT - - // Returns the assertion's negation. Used with EXPECT/ASSERT_FALSE. - AssertionResult operator!() const; - - // Returns the text streamed into this AssertionResult. Test assertions - // use it when they fail (i.e., the predicate's outcome doesn't match the - // assertion's expectation). When nothing has been streamed into the - // object, returns an empty string. - const char* message() const { - return message_.get() != NULL ? message_->c_str() : ""; - } - // TODO(vladl@google.com): Remove this after making sure no clients use it. - // Deprecated; please use message() instead. - const char* failure_message() const { return message(); } - - // Streams a custom failure message into this object. - template AssertionResult& operator<<(const T& value) { - AppendMessage(Message() << value); - return *this; - } - - // Allows streaming basic output manipulators such as endl or flush into - // this object. - AssertionResult& operator<<( - ::std::ostream& (*basic_manipulator)(::std::ostream& stream)) { - AppendMessage(Message() << basic_manipulator); - return *this; - } - - private: - // Appends the contents of message to message_. - void AppendMessage(const Message& a_message) { - if (message_.get() == NULL) - message_.reset(new ::std::string); - message_->append(a_message.GetString().c_str()); - } - - // Stores result of the assertion predicate. - bool success_; - // Stores the message describing the condition in case the expectation - // construct is not satisfied with the predicate's outcome. - // Referenced via a pointer to avoid taking too much stack frame space - // with test assertions. - internal::scoped_ptr< ::std::string> message_; - - GTEST_DISALLOW_ASSIGN_(AssertionResult); -}; - -// Makes a successful assertion result. -GTEST_API_ AssertionResult AssertionSuccess(); - -// Makes a failed assertion result. -GTEST_API_ AssertionResult AssertionFailure(); - -// Makes a failed assertion result with the given failure message. -// Deprecated; use AssertionFailure() << msg. -GTEST_API_ AssertionResult AssertionFailure(const Message& msg); - -// The abstract class that all tests inherit from. -// -// In Google Test, a unit test program contains one or many TestCases, and -// each TestCase contains one or many Tests. -// -// When you define a test using the TEST macro, you don't need to -// explicitly derive from Test - the TEST macro automatically does -// this for you. -// -// The only time you derive from Test is when defining a test fixture -// to be used a TEST_F. For example: -// -// class FooTest : public testing::Test { -// protected: -// virtual void SetUp() { ... } -// virtual void TearDown() { ... } -// ... -// }; -// -// TEST_F(FooTest, Bar) { ... } -// TEST_F(FooTest, Baz) { ... } -// -// Test is not copyable. -class GTEST_API_ Test { - public: - friend class TestInfo; - - // Defines types for pointers to functions that set up and tear down - // a test case. - typedef internal::SetUpTestCaseFunc SetUpTestCaseFunc; - typedef internal::TearDownTestCaseFunc TearDownTestCaseFunc; - - // The d'tor is virtual as we intend to inherit from Test. - virtual ~Test(); - - // Sets up the stuff shared by all tests in this test case. - // - // Google Test will call Foo::SetUpTestCase() before running the first - // test in test case Foo. Hence a sub-class can define its own - // SetUpTestCase() method to shadow the one defined in the super - // class. - static void SetUpTestCase() {} - - // Tears down the stuff shared by all tests in this test case. - // - // Google Test will call Foo::TearDownTestCase() after running the last - // test in test case Foo. Hence a sub-class can define its own - // TearDownTestCase() method to shadow the one defined in the super - // class. - static void TearDownTestCase() {} - - // Returns true iff the current test has a fatal failure. - static bool HasFatalFailure(); - - // Returns true iff the current test has a non-fatal failure. - static bool HasNonfatalFailure(); - - // Returns true iff the current test has a (either fatal or - // non-fatal) failure. - static bool HasFailure() { return HasFatalFailure() || HasNonfatalFailure(); } - - // Logs a property for the current test. Only the last value for a given - // key is remembered. - // These are public static so they can be called from utility functions - // that are not members of the test fixture. - // The arguments are const char* instead strings, as Google Test is used - // on platforms where string doesn't compile. - // - // Note that a driving consideration for these RecordProperty methods - // was to produce xml output suited to the Greenspan charting utility, - // which at present will only chart values that fit in a 32-bit int. It - // is the user's responsibility to restrict their values to 32-bit ints - // if they intend them to be used with Greenspan. - static void RecordProperty(const char* key, const char* value); - static void RecordProperty(const char* key, int value); - - protected: - // Creates a Test object. - Test(); - - // Sets up the test fixture. - virtual void SetUp(); - - // Tears down the test fixture. - virtual void TearDown(); - - private: - // Returns true iff the current test has the same fixture class as - // the first test in the current test case. - static bool HasSameFixtureClass(); - - // Runs the test after the test fixture has been set up. - // - // A sub-class must implement this to define the test logic. - // - // DO NOT OVERRIDE THIS FUNCTION DIRECTLY IN A USER PROGRAM. - // Instead, use the TEST or TEST_F macro. - virtual void TestBody() = 0; - - // Sets up, executes, and tears down the test. - void Run(); - - // Deletes self. We deliberately pick an unusual name for this - // internal method to avoid clashing with names used in user TESTs. - void DeleteSelf_() { delete this; } - - // Uses a GTestFlagSaver to save and restore all Google Test flags. - const internal::GTestFlagSaver* const gtest_flag_saver_; - - // Often a user mis-spells SetUp() as Setup() and spends a long time - // wondering why it is never called by Google Test. The declaration of - // the following method is solely for catching such an error at - // compile time: - // - // - The return type is deliberately chosen to be not void, so it - // will be a conflict if a user declares void Setup() in his test - // fixture. - // - // - This method is private, so it will be another compiler error - // if a user calls it from his test fixture. - // - // DO NOT OVERRIDE THIS FUNCTION. - // - // If you see an error about overriding the following function or - // about it being private, you have mis-spelled SetUp() as Setup(). - struct Setup_should_be_spelled_SetUp {}; - virtual Setup_should_be_spelled_SetUp* Setup() { return NULL; } - - // We disallow copying Tests. - GTEST_DISALLOW_COPY_AND_ASSIGN_(Test); -}; - -typedef internal::TimeInMillis TimeInMillis; - -// A copyable object representing a user specified test property which can be -// output as a key/value string pair. -// -// Don't inherit from TestProperty as its destructor is not virtual. -class TestProperty { - public: - // C'tor. TestProperty does NOT have a default constructor. - // Always use this constructor (with parameters) to create a - // TestProperty object. - TestProperty(const char* a_key, const char* a_value) : - key_(a_key), value_(a_value) { - } - - // Gets the user supplied key. - const char* key() const { - return key_.c_str(); - } - - // Gets the user supplied value. - const char* value() const { - return value_.c_str(); - } - - // Sets a new value, overriding the one supplied in the constructor. - void SetValue(const char* new_value) { - value_ = new_value; - } - - private: - // The key supplied by the user. - internal::String key_; - // The value supplied by the user. - internal::String value_; -}; - -// The result of a single Test. This includes a list of -// TestPartResults, a list of TestProperties, a count of how many -// death tests there are in the Test, and how much time it took to run -// the Test. -// -// TestResult is not copyable. -class GTEST_API_ TestResult { - public: - // Creates an empty TestResult. - TestResult(); - - // D'tor. Do not inherit from TestResult. - ~TestResult(); - - // Gets the number of all test parts. This is the sum of the number - // of successful test parts and the number of failed test parts. - int total_part_count() const; - - // Returns the number of the test properties. - int test_property_count() const; - - // Returns true iff the test passed (i.e. no test part failed). - bool Passed() const { return !Failed(); } - - // Returns true iff the test failed. - bool Failed() const; - - // Returns true iff the test fatally failed. - bool HasFatalFailure() const; - - // Returns true iff the test has a non-fatal failure. - bool HasNonfatalFailure() const; - - // Returns the elapsed time, in milliseconds. - TimeInMillis elapsed_time() const { return elapsed_time_; } - - // Returns the i-th test part result among all the results. i can range - // from 0 to test_property_count() - 1. If i is not in that range, aborts - // the program. - const TestPartResult& GetTestPartResult(int i) const; - - // Returns the i-th test property. i can range from 0 to - // test_property_count() - 1. If i is not in that range, aborts the - // program. - const TestProperty& GetTestProperty(int i) const; - - private: - friend class TestInfo; - friend class UnitTest; - friend class internal::DefaultGlobalTestPartResultReporter; - friend class internal::ExecDeathTest; - friend class internal::TestResultAccessor; - friend class internal::UnitTestImpl; - friend class internal::WindowsDeathTest; - - // Gets the vector of TestPartResults. - const std::vector& test_part_results() const { - return test_part_results_; - } - - // Gets the vector of TestProperties. - const std::vector& test_properties() const { - return test_properties_; - } - - // Sets the elapsed time. - void set_elapsed_time(TimeInMillis elapsed) { elapsed_time_ = elapsed; } - - // Adds a test property to the list. The property is validated and may add - // a non-fatal failure if invalid (e.g., if it conflicts with reserved - // key names). If a property is already recorded for the same key, the - // value will be updated, rather than storing multiple values for the same - // key. - void RecordProperty(const TestProperty& test_property); - - // Adds a failure if the key is a reserved attribute of Google Test - // testcase tags. Returns true if the property is valid. - // TODO(russr): Validate attribute names are legal and human readable. - static bool ValidateTestProperty(const TestProperty& test_property); - - // Adds a test part result to the list. - void AddTestPartResult(const TestPartResult& test_part_result); - - // Returns the death test count. - int death_test_count() const { return death_test_count_; } - - // Increments the death test count, returning the new count. - int increment_death_test_count() { return ++death_test_count_; } - - // Clears the test part results. - void ClearTestPartResults(); - - // Clears the object. - void Clear(); - - // Protects mutable state of the property vector and of owned - // properties, whose values may be updated. - internal::Mutex test_properites_mutex_; - - // The vector of TestPartResults - std::vector test_part_results_; - // The vector of TestProperties - std::vector test_properties_; - // Running count of death tests. - int death_test_count_; - // The elapsed time, in milliseconds. - TimeInMillis elapsed_time_; - - // We disallow copying TestResult. - GTEST_DISALLOW_COPY_AND_ASSIGN_(TestResult); -}; // class TestResult - -// A TestInfo object stores the following information about a test: -// -// Test case name -// Test name -// Whether the test should be run -// A function pointer that creates the test object when invoked -// Test result -// -// The constructor of TestInfo registers itself with the UnitTest -// singleton such that the RUN_ALL_TESTS() macro knows which tests to -// run. -class GTEST_API_ TestInfo { - public: - // Destructs a TestInfo object. This function is not virtual, so - // don't inherit from TestInfo. - ~TestInfo(); - - // Returns the test case name. - const char* test_case_name() const { return test_case_name_.c_str(); } - - // Returns the test name. - const char* name() const { return name_.c_str(); } - - // Returns the name of the parameter type, or NULL if this is not a typed - // or a type-parameterized test. - const char* type_param() const { - if (type_param_.get() != NULL) - return type_param_->c_str(); - return NULL; - } - - // Returns the text representation of the value parameter, or NULL if this - // is not a value-parameterized test. - const char* value_param() const { - if (value_param_.get() != NULL) - return value_param_->c_str(); - return NULL; - } - - // Returns true if this test should run, that is if the test is not disabled - // (or it is disabled but the also_run_disabled_tests flag has been specified) - // and its full name matches the user-specified filter. - // - // Google Test allows the user to filter the tests by their full names. - // The full name of a test Bar in test case Foo is defined as - // "Foo.Bar". Only the tests that match the filter will run. - // - // A filter is a colon-separated list of glob (not regex) patterns, - // optionally followed by a '-' and a colon-separated list of - // negative patterns (tests to exclude). A test is run if it - // matches one of the positive patterns and does not match any of - // the negative patterns. - // - // For example, *A*:Foo.* is a filter that matches any string that - // contains the character 'A' or starts with "Foo.". - bool should_run() const { return should_run_; } - - // Returns the result of the test. - const TestResult* result() const { return &result_; } - - private: - -#if GTEST_HAS_DEATH_TEST - friend class internal::DefaultDeathTestFactory; -#endif // GTEST_HAS_DEATH_TEST - friend class Test; - friend class TestCase; - friend class internal::UnitTestImpl; - friend TestInfo* internal::MakeAndRegisterTestInfo( - const char* test_case_name, const char* name, - const char* type_param, - const char* value_param, - internal::TypeId fixture_class_id, - Test::SetUpTestCaseFunc set_up_tc, - Test::TearDownTestCaseFunc tear_down_tc, - internal::TestFactoryBase* factory); - - // Constructs a TestInfo object. The newly constructed instance assumes - // ownership of the factory object. - TestInfo(const char* test_case_name, const char* name, - const char* a_type_param, - const char* a_value_param, - internal::TypeId fixture_class_id, - internal::TestFactoryBase* factory); - - // Increments the number of death tests encountered in this test so - // far. - int increment_death_test_count() { - return result_.increment_death_test_count(); - } - - // Creates the test object, runs it, records its result, and then - // deletes it. - void Run(); - - static void ClearTestResult(TestInfo* test_info) { - test_info->result_.Clear(); - } - - // These fields are immutable properties of the test. - const std::string test_case_name_; // Test case name - const std::string name_; // Test name - // Name of the parameter type, or NULL if this is not a typed or a - // type-parameterized test. - const internal::scoped_ptr type_param_; - // Text representation of the value parameter, or NULL if this is not a - // value-parameterized test. - const internal::scoped_ptr value_param_; - const internal::TypeId fixture_class_id_; // ID of the test fixture class - bool should_run_; // True iff this test should run - bool is_disabled_; // True iff this test is disabled - bool matches_filter_; // True if this test matches the - // user-specified filter. - internal::TestFactoryBase* const factory_; // The factory that creates - // the test object - - // This field is mutable and needs to be reset before running the - // test for the second time. - TestResult result_; - - GTEST_DISALLOW_COPY_AND_ASSIGN_(TestInfo); -}; - -// A test case, which consists of a vector of TestInfos. -// -// TestCase is not copyable. -class GTEST_API_ TestCase { - public: - // Creates a TestCase with the given name. - // - // TestCase does NOT have a default constructor. Always use this - // constructor to create a TestCase object. - // - // Arguments: - // - // name: name of the test case - // a_type_param: the name of the test's type parameter, or NULL if - // this is not a type-parameterized test. - // set_up_tc: pointer to the function that sets up the test case - // tear_down_tc: pointer to the function that tears down the test case - TestCase(const char* name, const char* a_type_param, - Test::SetUpTestCaseFunc set_up_tc, - Test::TearDownTestCaseFunc tear_down_tc); - - // Destructor of TestCase. - virtual ~TestCase(); - - // Gets the name of the TestCase. - const char* name() const { return name_.c_str(); } - - // Returns the name of the parameter type, or NULL if this is not a - // type-parameterized test case. - const char* type_param() const { - if (type_param_.get() != NULL) - return type_param_->c_str(); - return NULL; - } - - // Returns true if any test in this test case should run. - bool should_run() const { return should_run_; } - - // Gets the number of successful tests in this test case. - int successful_test_count() const; - - // Gets the number of failed tests in this test case. - int failed_test_count() const; - - // Gets the number of disabled tests in this test case. - int disabled_test_count() const; - - // Get the number of tests in this test case that should run. - int test_to_run_count() const; - - // Gets the number of all tests in this test case. - int total_test_count() const; - - // Returns true iff the test case passed. - bool Passed() const { return !Failed(); } - - // Returns true iff the test case failed. - bool Failed() const { return failed_test_count() > 0; } - - // Returns the elapsed time, in milliseconds. - TimeInMillis elapsed_time() const { return elapsed_time_; } - - // Returns the i-th test among all the tests. i can range from 0 to - // total_test_count() - 1. If i is not in that range, returns NULL. - const TestInfo* GetTestInfo(int i) const; - - private: - friend class Test; - friend class internal::UnitTestImpl; - - // Gets the (mutable) vector of TestInfos in this TestCase. - std::vector& test_info_list() { return test_info_list_; } - - // Gets the (immutable) vector of TestInfos in this TestCase. - const std::vector& test_info_list() const { - return test_info_list_; - } - - // Returns the i-th test among all the tests. i can range from 0 to - // total_test_count() - 1. If i is not in that range, returns NULL. - TestInfo* GetMutableTestInfo(int i); - - // Sets the should_run member. - void set_should_run(bool should) { should_run_ = should; } - - // Adds a TestInfo to this test case. Will delete the TestInfo upon - // destruction of the TestCase object. - void AddTestInfo(TestInfo * test_info); - - // Clears the results of all tests in this test case. - void ClearResult(); - - // Clears the results of all tests in the given test case. - static void ClearTestCaseResult(TestCase* test_case) { - test_case->ClearResult(); - } - - // Runs every test in this TestCase. - void Run(); - - // Runs SetUpTestCase() for this TestCase. This wrapper is needed - // for catching exceptions thrown from SetUpTestCase(). - void RunSetUpTestCase() { (*set_up_tc_)(); } - - // Runs TearDownTestCase() for this TestCase. This wrapper is - // needed for catching exceptions thrown from TearDownTestCase(). - void RunTearDownTestCase() { (*tear_down_tc_)(); } - - // Returns true iff test passed. - static bool TestPassed(const TestInfo* test_info) { - return test_info->should_run() && test_info->result()->Passed(); - } - - // Returns true iff test failed. - static bool TestFailed(const TestInfo* test_info) { - return test_info->should_run() && test_info->result()->Failed(); - } - - // Returns true iff test is disabled. - static bool TestDisabled(const TestInfo* test_info) { - return test_info->is_disabled_; - } - - // Returns true if the given test should run. - static bool ShouldRunTest(const TestInfo* test_info) { - return test_info->should_run(); - } - - // Shuffles the tests in this test case. - void ShuffleTests(internal::Random* random); - - // Restores the test order to before the first shuffle. - void UnshuffleTests(); - - // Name of the test case. - internal::String name_; - // Name of the parameter type, or NULL if this is not a typed or a - // type-parameterized test. - const internal::scoped_ptr type_param_; - // The vector of TestInfos in their original order. It owns the - // elements in the vector. - std::vector test_info_list_; - // Provides a level of indirection for the test list to allow easy - // shuffling and restoring the test order. The i-th element in this - // vector is the index of the i-th test in the shuffled test list. - std::vector test_indices_; - // Pointer to the function that sets up the test case. - Test::SetUpTestCaseFunc set_up_tc_; - // Pointer to the function that tears down the test case. - Test::TearDownTestCaseFunc tear_down_tc_; - // True iff any test in this test case should run. - bool should_run_; - // Elapsed time, in milliseconds. - TimeInMillis elapsed_time_; - - // We disallow copying TestCases. - GTEST_DISALLOW_COPY_AND_ASSIGN_(TestCase); -}; - -// An Environment object is capable of setting up and tearing down an -// environment. The user should subclass this to define his own -// environment(s). -// -// An Environment object does the set-up and tear-down in virtual -// methods SetUp() and TearDown() instead of the constructor and the -// destructor, as: -// -// 1. You cannot safely throw from a destructor. This is a problem -// as in some cases Google Test is used where exceptions are enabled, and -// we may want to implement ASSERT_* using exceptions where they are -// available. -// 2. You cannot use ASSERT_* directly in a constructor or -// destructor. -class Environment { - public: - // The d'tor is virtual as we need to subclass Environment. - virtual ~Environment() {} - - // Override this to define how to set up the environment. - virtual void SetUp() {} - - // Override this to define how to tear down the environment. - virtual void TearDown() {} - private: - // If you see an error about overriding the following function or - // about it being private, you have mis-spelled SetUp() as Setup(). - struct Setup_should_be_spelled_SetUp {}; - virtual Setup_should_be_spelled_SetUp* Setup() { return NULL; } -}; - -// The interface for tracing execution of tests. The methods are organized in -// the order the corresponding events are fired. -class TestEventListener { - public: - virtual ~TestEventListener() {} - - // Fired before any test activity starts. - virtual void OnTestProgramStart(const UnitTest& unit_test) = 0; - - // Fired before each iteration of tests starts. There may be more than - // one iteration if GTEST_FLAG(repeat) is set. iteration is the iteration - // index, starting from 0. - virtual void OnTestIterationStart(const UnitTest& unit_test, - int iteration) = 0; - - // Fired before environment set-up for each iteration of tests starts. - virtual void OnEnvironmentsSetUpStart(const UnitTest& unit_test) = 0; - - // Fired after environment set-up for each iteration of tests ends. - virtual void OnEnvironmentsSetUpEnd(const UnitTest& unit_test) = 0; - - // Fired before the test case starts. - virtual void OnTestCaseStart(const TestCase& test_case) = 0; - - // Fired before the test starts. - virtual void OnTestStart(const TestInfo& test_info) = 0; - - // Fired after a failed assertion or a SUCCEED() invocation. - virtual void OnTestPartResult(const TestPartResult& test_part_result) = 0; - - // Fired after the test ends. - virtual void OnTestEnd(const TestInfo& test_info) = 0; - - // Fired after the test case ends. - virtual void OnTestCaseEnd(const TestCase& test_case) = 0; - - // Fired before environment tear-down for each iteration of tests starts. - virtual void OnEnvironmentsTearDownStart(const UnitTest& unit_test) = 0; - - // Fired after environment tear-down for each iteration of tests ends. - virtual void OnEnvironmentsTearDownEnd(const UnitTest& unit_test) = 0; - - // Fired after each iteration of tests finishes. - virtual void OnTestIterationEnd(const UnitTest& unit_test, - int iteration) = 0; - - // Fired after all test activities have ended. - virtual void OnTestProgramEnd(const UnitTest& unit_test) = 0; -}; - -// The convenience class for users who need to override just one or two -// methods and are not concerned that a possible change to a signature of -// the methods they override will not be caught during the build. For -// comments about each method please see the definition of TestEventListener -// above. -class EmptyTestEventListener : public TestEventListener { - public: - virtual void OnTestProgramStart(const UnitTest& /*unit_test*/) {} - virtual void OnTestIterationStart(const UnitTest& /*unit_test*/, - int /*iteration*/) {} - virtual void OnEnvironmentsSetUpStart(const UnitTest& /*unit_test*/) {} - virtual void OnEnvironmentsSetUpEnd(const UnitTest& /*unit_test*/) {} - virtual void OnTestCaseStart(const TestCase& /*test_case*/) {} - virtual void OnTestStart(const TestInfo& /*test_info*/) {} - virtual void OnTestPartResult(const TestPartResult& /*test_part_result*/) {} - virtual void OnTestEnd(const TestInfo& /*test_info*/) {} - virtual void OnTestCaseEnd(const TestCase& /*test_case*/) {} - virtual void OnEnvironmentsTearDownStart(const UnitTest& /*unit_test*/) {} - virtual void OnEnvironmentsTearDownEnd(const UnitTest& /*unit_test*/) {} - virtual void OnTestIterationEnd(const UnitTest& /*unit_test*/, - int /*iteration*/) {} - virtual void OnTestProgramEnd(const UnitTest& /*unit_test*/) {} -}; - -// TestEventListeners lets users add listeners to track events in Google Test. -class GTEST_API_ TestEventListeners { - public: - TestEventListeners(); - ~TestEventListeners(); - - // Appends an event listener to the end of the list. Google Test assumes - // the ownership of the listener (i.e. it will delete the listener when - // the test program finishes). - void Append(TestEventListener* listener); - - // Removes the given event listener from the list and returns it. It then - // becomes the caller's responsibility to delete the listener. Returns - // NULL if the listener is not found in the list. - TestEventListener* Release(TestEventListener* listener); - - // Returns the standard listener responsible for the default console - // output. Can be removed from the listeners list to shut down default - // console output. Note that removing this object from the listener list - // with Release transfers its ownership to the caller and makes this - // function return NULL the next time. - TestEventListener* default_result_printer() const { - return default_result_printer_; - } - - // Returns the standard listener responsible for the default XML output - // controlled by the --gtest_output=xml flag. Can be removed from the - // listeners list by users who want to shut down the default XML output - // controlled by this flag and substitute it with custom one. Note that - // removing this object from the listener list with Release transfers its - // ownership to the caller and makes this function return NULL the next - // time. - TestEventListener* default_xml_generator() const { - return default_xml_generator_; - } - - private: - friend class TestCase; - friend class TestInfo; - friend class internal::DefaultGlobalTestPartResultReporter; - friend class internal::NoExecDeathTest; - friend class internal::TestEventListenersAccessor; - friend class internal::UnitTestImpl; - - // Returns repeater that broadcasts the TestEventListener events to all - // subscribers. - TestEventListener* repeater(); - - // Sets the default_result_printer attribute to the provided listener. - // The listener is also added to the listener list and previous - // default_result_printer is removed from it and deleted. The listener can - // also be NULL in which case it will not be added to the list. Does - // nothing if the previous and the current listener objects are the same. - void SetDefaultResultPrinter(TestEventListener* listener); - - // Sets the default_xml_generator attribute to the provided listener. The - // listener is also added to the listener list and previous - // default_xml_generator is removed from it and deleted. The listener can - // also be NULL in which case it will not be added to the list. Does - // nothing if the previous and the current listener objects are the same. - void SetDefaultXmlGenerator(TestEventListener* listener); - - // Controls whether events will be forwarded by the repeater to the - // listeners in the list. - bool EventForwardingEnabled() const; - void SuppressEventForwarding(); - - // The actual list of listeners. - internal::TestEventRepeater* repeater_; - // Listener responsible for the standard result output. - TestEventListener* default_result_printer_; - // Listener responsible for the creation of the XML output file. - TestEventListener* default_xml_generator_; - - // We disallow copying TestEventListeners. - GTEST_DISALLOW_COPY_AND_ASSIGN_(TestEventListeners); -}; - -// A UnitTest consists of a vector of TestCases. -// -// This is a singleton class. The only instance of UnitTest is -// created when UnitTest::GetInstance() is first called. This -// instance is never deleted. -// -// UnitTest is not copyable. -// -// This class is thread-safe as long as the methods are called -// according to their specification. -class GTEST_API_ UnitTest { - public: - // Gets the singleton UnitTest object. The first time this method - // is called, a UnitTest object is constructed and returned. - // Consecutive calls will return the same object. - static UnitTest* GetInstance(); - - // Runs all tests in this UnitTest object and prints the result. - // Returns 0 if successful, or 1 otherwise. - // - // This method can only be called from the main thread. - // - // INTERNAL IMPLEMENTATION - DO NOT USE IN A USER PROGRAM. - int Run() GTEST_MUST_USE_RESULT_; - - // Returns the working directory when the first TEST() or TEST_F() - // was executed. The UnitTest object owns the string. - const char* original_working_dir() const; - - // Returns the TestCase object for the test that's currently running, - // or NULL if no test is running. - const TestCase* current_test_case() const; - - // Returns the TestInfo object for the test that's currently running, - // or NULL if no test is running. - const TestInfo* current_test_info() const; - - // Returns the random seed used at the start of the current test run. - int random_seed() const; - -#if GTEST_HAS_PARAM_TEST - // Returns the ParameterizedTestCaseRegistry object used to keep track of - // value-parameterized tests and instantiate and register them. - // - // INTERNAL IMPLEMENTATION - DO NOT USE IN A USER PROGRAM. - internal::ParameterizedTestCaseRegistry& parameterized_test_registry(); -#endif // GTEST_HAS_PARAM_TEST - - // Gets the number of successful test cases. - int successful_test_case_count() const; - - // Gets the number of failed test cases. - int failed_test_case_count() const; - - // Gets the number of all test cases. - int total_test_case_count() const; - - // Gets the number of all test cases that contain at least one test - // that should run. - int test_case_to_run_count() const; - - // Gets the number of successful tests. - int successful_test_count() const; - - // Gets the number of failed tests. - int failed_test_count() const; - - // Gets the number of disabled tests. - int disabled_test_count() const; - - // Gets the number of all tests. - int total_test_count() const; - - // Gets the number of tests that should run. - int test_to_run_count() const; - - // Gets the elapsed time, in milliseconds. - TimeInMillis elapsed_time() const; - - // Returns true iff the unit test passed (i.e. all test cases passed). - bool Passed() const; - - // Returns true iff the unit test failed (i.e. some test case failed - // or something outside of all tests failed). - bool Failed() const; - - // Gets the i-th test case among all the test cases. i can range from 0 to - // total_test_case_count() - 1. If i is not in that range, returns NULL. - const TestCase* GetTestCase(int i) const; - - // Returns the list of event listeners that can be used to track events - // inside Google Test. - TestEventListeners& listeners(); - - private: - // Registers and returns a global test environment. When a test - // program is run, all global test environments will be set-up in - // the order they were registered. After all tests in the program - // have finished, all global test environments will be torn-down in - // the *reverse* order they were registered. - // - // The UnitTest object takes ownership of the given environment. - // - // This method can only be called from the main thread. - Environment* AddEnvironment(Environment* env); - - // Adds a TestPartResult to the current TestResult object. All - // Google Test assertion macros (e.g. ASSERT_TRUE, EXPECT_EQ, etc) - // eventually call this to report their results. The user code - // should use the assertion macros instead of calling this directly. - void AddTestPartResult(TestPartResult::Type result_type, - const char* file_name, - int line_number, - const internal::String& message, - const internal::String& os_stack_trace); - - // Adds a TestProperty to the current TestResult object. If the result already - // contains a property with the same key, the value will be updated. - void RecordPropertyForCurrentTest(const char* key, const char* value); - - // Gets the i-th test case among all the test cases. i can range from 0 to - // total_test_case_count() - 1. If i is not in that range, returns NULL. - TestCase* GetMutableTestCase(int i); - - // Accessors for the implementation object. - internal::UnitTestImpl* impl() { return impl_; } - const internal::UnitTestImpl* impl() const { return impl_; } - - // These classes and funcions are friends as they need to access private - // members of UnitTest. - friend class Test; - friend class internal::AssertHelper; - friend class internal::ScopedTrace; - friend Environment* AddGlobalTestEnvironment(Environment* env); - friend internal::UnitTestImpl* internal::GetUnitTestImpl(); - friend void internal::ReportFailureInUnknownLocation( - TestPartResult::Type result_type, - const internal::String& message); - - // Creates an empty UnitTest. - UnitTest(); - - // D'tor - virtual ~UnitTest(); - - // Pushes a trace defined by SCOPED_TRACE() on to the per-thread - // Google Test trace stack. - void PushGTestTrace(const internal::TraceInfo& trace); - - // Pops a trace from the per-thread Google Test trace stack. - void PopGTestTrace(); - - // Protects mutable state in *impl_. This is mutable as some const - // methods need to lock it too. - mutable internal::Mutex mutex_; - - // Opaque implementation object. This field is never changed once - // the object is constructed. We don't mark it as const here, as - // doing so will cause a warning in the constructor of UnitTest. - // Mutable state in *impl_ is protected by mutex_. - internal::UnitTestImpl* impl_; - - // We disallow copying UnitTest. - GTEST_DISALLOW_COPY_AND_ASSIGN_(UnitTest); -}; - -// A convenient wrapper for adding an environment for the test -// program. -// -// You should call this before RUN_ALL_TESTS() is called, probably in -// main(). If you use gtest_main, you need to call this before main() -// starts for it to take effect. For example, you can define a global -// variable like this: -// -// testing::Environment* const foo_env = -// testing::AddGlobalTestEnvironment(new FooEnvironment); -// -// However, we strongly recommend you to write your own main() and -// call AddGlobalTestEnvironment() there, as relying on initialization -// of global variables makes the code harder to read and may cause -// problems when you register multiple environments from different -// translation units and the environments have dependencies among them -// (remember that the compiler doesn't guarantee the order in which -// global variables from different translation units are initialized). -inline Environment* AddGlobalTestEnvironment(Environment* env) { - return UnitTest::GetInstance()->AddEnvironment(env); -} - -// Initializes Google Test. This must be called before calling -// RUN_ALL_TESTS(). In particular, it parses a command line for the -// flags that Google Test recognizes. Whenever a Google Test flag is -// seen, it is removed from argv, and *argc is decremented. -// -// No value is returned. Instead, the Google Test flag variables are -// updated. -// -// Calling the function for the second time has no user-visible effect. -GTEST_API_ void InitGoogleTest(int* argc, char** argv); - -// This overloaded version can be used in Windows programs compiled in -// UNICODE mode. -GTEST_API_ void InitGoogleTest(int* argc, wchar_t** argv); - -namespace internal { - -// Formats a comparison assertion (e.g. ASSERT_EQ, EXPECT_LT, and etc) -// operand to be used in a failure message. The type (but not value) -// of the other operand may affect the format. This allows us to -// print a char* as a raw pointer when it is compared against another -// char*, and print it as a C string when it is compared against an -// std::string object, for example. -// -// The default implementation ignores the type of the other operand. -// Some specialized versions are used to handle formatting wide or -// narrow C strings. -// -// INTERNAL IMPLEMENTATION - DO NOT USE IN A USER PROGRAM. -template -String FormatForComparisonFailureMessage(const T1& value, - const T2& /* other_operand */) { - // C++Builder compiles this incorrectly if the namespace isn't explicitly - // given. - return ::testing::PrintToString(value); -} - -// The helper function for {ASSERT|EXPECT}_EQ. -template -AssertionResult CmpHelperEQ(const char* expected_expression, - const char* actual_expression, - const T1& expected, - const T2& actual) { -#ifdef _MSC_VER -# pragma warning(push) // Saves the current warning state. -# pragma warning(disable:4389) // Temporarily disables warning on - // signed/unsigned mismatch. -#endif - - if (expected == actual) { - return AssertionSuccess(); - } - -#ifdef _MSC_VER -# pragma warning(pop) // Restores the warning state. -#endif - - return EqFailure(expected_expression, - actual_expression, - FormatForComparisonFailureMessage(expected, actual), - FormatForComparisonFailureMessage(actual, expected), - false); -} - -// With this overloaded version, we allow anonymous enums to be used -// in {ASSERT|EXPECT}_EQ when compiled with gcc 4, as anonymous enums -// can be implicitly cast to BiggestInt. -GTEST_API_ AssertionResult CmpHelperEQ(const char* expected_expression, - const char* actual_expression, - BiggestInt expected, - BiggestInt actual); - -// The helper class for {ASSERT|EXPECT}_EQ. The template argument -// lhs_is_null_literal is true iff the first argument to ASSERT_EQ() -// is a null pointer literal. The following default implementation is -// for lhs_is_null_literal being false. -template -class EqHelper { - public: - // This templatized version is for the general case. - template - static AssertionResult Compare(const char* expected_expression, - const char* actual_expression, - const T1& expected, - const T2& actual) { - return CmpHelperEQ(expected_expression, actual_expression, expected, - actual); - } - - // With this overloaded version, we allow anonymous enums to be used - // in {ASSERT|EXPECT}_EQ when compiled with gcc 4, as anonymous - // enums can be implicitly cast to BiggestInt. - // - // Even though its body looks the same as the above version, we - // cannot merge the two, as it will make anonymous enums unhappy. - static AssertionResult Compare(const char* expected_expression, - const char* actual_expression, - BiggestInt expected, - BiggestInt actual) { - return CmpHelperEQ(expected_expression, actual_expression, expected, - actual); - } -}; - -// This specialization is used when the first argument to ASSERT_EQ() -// is a null pointer literal, like NULL, false, or 0. -template <> -class EqHelper { - public: - // We define two overloaded versions of Compare(). The first - // version will be picked when the second argument to ASSERT_EQ() is - // NOT a pointer, e.g. ASSERT_EQ(0, AnIntFunction()) or - // EXPECT_EQ(false, a_bool). - template - static AssertionResult Compare( - const char* expected_expression, - const char* actual_expression, - const T1& expected, - const T2& actual, - // The following line prevents this overload from being considered if T2 - // is not a pointer type. We need this because ASSERT_EQ(NULL, my_ptr) - // expands to Compare("", "", NULL, my_ptr), which requires a conversion - // to match the Secret* in the other overload, which would otherwise make - // this template match better. - typename EnableIf::value>::type* = 0) { - return CmpHelperEQ(expected_expression, actual_expression, expected, - actual); - } - - // This version will be picked when the second argument to ASSERT_EQ() is a - // pointer, e.g. ASSERT_EQ(NULL, a_pointer). - template - static AssertionResult Compare( - const char* expected_expression, - const char* actual_expression, - // We used to have a second template parameter instead of Secret*. That - // template parameter would deduce to 'long', making this a better match - // than the first overload even without the first overload's EnableIf. - // Unfortunately, gcc with -Wconversion-null warns when "passing NULL to - // non-pointer argument" (even a deduced integral argument), so the old - // implementation caused warnings in user code. - Secret* /* expected (NULL) */, - T* actual) { - // We already know that 'expected' is a null pointer. - return CmpHelperEQ(expected_expression, actual_expression, - static_cast(NULL), actual); - } -}; - -// A macro for implementing the helper functions needed to implement -// ASSERT_?? and EXPECT_??. It is here just to avoid copy-and-paste -// of similar code. -// -// For each templatized helper function, we also define an overloaded -// version for BiggestInt in order to reduce code bloat and allow -// anonymous enums to be used with {ASSERT|EXPECT}_?? when compiled -// with gcc 4. -// -// INTERNAL IMPLEMENTATION - DO NOT USE IN A USER PROGRAM. -#define GTEST_IMPL_CMP_HELPER_(op_name, op)\ -template \ -AssertionResult CmpHelper##op_name(const char* expr1, const char* expr2, \ - const T1& val1, const T2& val2) {\ - if (val1 op val2) {\ - return AssertionSuccess();\ - } else {\ - return AssertionFailure() \ - << "Expected: (" << expr1 << ") " #op " (" << expr2\ - << "), actual: " << FormatForComparisonFailureMessage(val1, val2)\ - << " vs " << FormatForComparisonFailureMessage(val2, val1);\ - }\ -}\ -GTEST_API_ AssertionResult CmpHelper##op_name(\ - const char* expr1, const char* expr2, BiggestInt val1, BiggestInt val2) - -// INTERNAL IMPLEMENTATION - DO NOT USE IN A USER PROGRAM. - -// Implements the helper function for {ASSERT|EXPECT}_NE -GTEST_IMPL_CMP_HELPER_(NE, !=); -// Implements the helper function for {ASSERT|EXPECT}_LE -GTEST_IMPL_CMP_HELPER_(LE, <=); -// Implements the helper function for {ASSERT|EXPECT}_LT -GTEST_IMPL_CMP_HELPER_(LT, < ); -// Implements the helper function for {ASSERT|EXPECT}_GE -GTEST_IMPL_CMP_HELPER_(GE, >=); -// Implements the helper function for {ASSERT|EXPECT}_GT -GTEST_IMPL_CMP_HELPER_(GT, > ); - -#undef GTEST_IMPL_CMP_HELPER_ - -// The helper function for {ASSERT|EXPECT}_STREQ. -// -// INTERNAL IMPLEMENTATION - DO NOT USE IN A USER PROGRAM. -GTEST_API_ AssertionResult CmpHelperSTREQ(const char* expected_expression, - const char* actual_expression, - const char* expected, - const char* actual); - -// The helper function for {ASSERT|EXPECT}_STRCASEEQ. -// -// INTERNAL IMPLEMENTATION - DO NOT USE IN A USER PROGRAM. -GTEST_API_ AssertionResult CmpHelperSTRCASEEQ(const char* expected_expression, - const char* actual_expression, - const char* expected, - const char* actual); - -// The helper function for {ASSERT|EXPECT}_STRNE. -// -// INTERNAL IMPLEMENTATION - DO NOT USE IN A USER PROGRAM. -GTEST_API_ AssertionResult CmpHelperSTRNE(const char* s1_expression, - const char* s2_expression, - const char* s1, - const char* s2); - -// The helper function for {ASSERT|EXPECT}_STRCASENE. -// -// INTERNAL IMPLEMENTATION - DO NOT USE IN A USER PROGRAM. -GTEST_API_ AssertionResult CmpHelperSTRCASENE(const char* s1_expression, - const char* s2_expression, - const char* s1, - const char* s2); - - -// Helper function for *_STREQ on wide strings. -// -// INTERNAL IMPLEMENTATION - DO NOT USE IN A USER PROGRAM. -GTEST_API_ AssertionResult CmpHelperSTREQ(const char* expected_expression, - const char* actual_expression, - const wchar_t* expected, - const wchar_t* actual); - -// Helper function for *_STRNE on wide strings. -// -// INTERNAL IMPLEMENTATION - DO NOT USE IN A USER PROGRAM. -GTEST_API_ AssertionResult CmpHelperSTRNE(const char* s1_expression, - const char* s2_expression, - const wchar_t* s1, - const wchar_t* s2); - -} // namespace internal - -// IsSubstring() and IsNotSubstring() are intended to be used as the -// first argument to {EXPECT,ASSERT}_PRED_FORMAT2(), not by -// themselves. They check whether needle is a substring of haystack -// (NULL is considered a substring of itself only), and return an -// appropriate error message when they fail. -// -// The {needle,haystack}_expr arguments are the stringified -// expressions that generated the two real arguments. -GTEST_API_ AssertionResult IsSubstring( - const char* needle_expr, const char* haystack_expr, - const char* needle, const char* haystack); -GTEST_API_ AssertionResult IsSubstring( - const char* needle_expr, const char* haystack_expr, - const wchar_t* needle, const wchar_t* haystack); -GTEST_API_ AssertionResult IsNotSubstring( - const char* needle_expr, const char* haystack_expr, - const char* needle, const char* haystack); -GTEST_API_ AssertionResult IsNotSubstring( - const char* needle_expr, const char* haystack_expr, - const wchar_t* needle, const wchar_t* haystack); -GTEST_API_ AssertionResult IsSubstring( - const char* needle_expr, const char* haystack_expr, - const ::std::string& needle, const ::std::string& haystack); -GTEST_API_ AssertionResult IsNotSubstring( - const char* needle_expr, const char* haystack_expr, - const ::std::string& needle, const ::std::string& haystack); - -#if GTEST_HAS_STD_WSTRING -GTEST_API_ AssertionResult IsSubstring( - const char* needle_expr, const char* haystack_expr, - const ::std::wstring& needle, const ::std::wstring& haystack); -GTEST_API_ AssertionResult IsNotSubstring( - const char* needle_expr, const char* haystack_expr, - const ::std::wstring& needle, const ::std::wstring& haystack); -#endif // GTEST_HAS_STD_WSTRING - -namespace internal { - -// Helper template function for comparing floating-points. -// -// Template parameter: -// -// RawType: the raw floating-point type (either float or double) -// -// INTERNAL IMPLEMENTATION - DO NOT USE IN A USER PROGRAM. -template -AssertionResult CmpHelperFloatingPointEQ(const char* expected_expression, - const char* actual_expression, - RawType expected, - RawType actual) { - const FloatingPoint lhs(expected), rhs(actual); - - if (lhs.AlmostEquals(rhs)) { - return AssertionSuccess(); - } - - ::std::stringstream expected_ss; - expected_ss << std::setprecision(std::numeric_limits::digits10 + 2) - << expected; - - ::std::stringstream actual_ss; - actual_ss << std::setprecision(std::numeric_limits::digits10 + 2) - << actual; - - return EqFailure(expected_expression, - actual_expression, - StringStreamToString(&expected_ss), - StringStreamToString(&actual_ss), - false); -} - -// Helper function for implementing ASSERT_NEAR. -// -// INTERNAL IMPLEMENTATION - DO NOT USE IN A USER PROGRAM. -GTEST_API_ AssertionResult DoubleNearPredFormat(const char* expr1, - const char* expr2, - const char* abs_error_expr, - double val1, - double val2, - double abs_error); - -// INTERNAL IMPLEMENTATION - DO NOT USE IN USER CODE. -// A class that enables one to stream messages to assertion macros -class GTEST_API_ AssertHelper { - public: - // Constructor. - AssertHelper(TestPartResult::Type type, - const char* file, - int line, - const char* message); - ~AssertHelper(); - - // Message assignment is a semantic trick to enable assertion - // streaming; see the GTEST_MESSAGE_ macro below. - void operator=(const Message& message) const; - - private: - // We put our data in a struct so that the size of the AssertHelper class can - // be as small as possible. This is important because gcc is incapable of - // re-using stack space even for temporary variables, so every EXPECT_EQ - // reserves stack space for another AssertHelper. - struct AssertHelperData { - AssertHelperData(TestPartResult::Type t, - const char* srcfile, - int line_num, - const char* msg) - : type(t), file(srcfile), line(line_num), message(msg) { } - - TestPartResult::Type const type; - const char* const file; - int const line; - String const message; - - private: - GTEST_DISALLOW_COPY_AND_ASSIGN_(AssertHelperData); - }; - - AssertHelperData* const data_; - - GTEST_DISALLOW_COPY_AND_ASSIGN_(AssertHelper); -}; - -} // namespace internal - -#if GTEST_HAS_PARAM_TEST -// The pure interface class that all value-parameterized tests inherit from. -// A value-parameterized class must inherit from both ::testing::Test and -// ::testing::WithParamInterface. In most cases that just means inheriting -// from ::testing::TestWithParam, but more complicated test hierarchies -// may need to inherit from Test and WithParamInterface at different levels. -// -// This interface has support for accessing the test parameter value via -// the GetParam() method. -// -// Use it with one of the parameter generator defining functions, like Range(), -// Values(), ValuesIn(), Bool(), and Combine(). -// -// class FooTest : public ::testing::TestWithParam { -// protected: -// FooTest() { -// // Can use GetParam() here. -// } -// virtual ~FooTest() { -// // Can use GetParam() here. -// } -// virtual void SetUp() { -// // Can use GetParam() here. -// } -// virtual void TearDown { -// // Can use GetParam() here. -// } -// }; -// TEST_P(FooTest, DoesBar) { -// // Can use GetParam() method here. -// Foo foo; -// ASSERT_TRUE(foo.DoesBar(GetParam())); -// } -// INSTANTIATE_TEST_CASE_P(OneToTenRange, FooTest, ::testing::Range(1, 10)); - -template -class WithParamInterface { - public: - typedef T ParamType; - virtual ~WithParamInterface() {} - - // The current parameter value. Is also available in the test fixture's - // constructor. This member function is non-static, even though it only - // references static data, to reduce the opportunity for incorrect uses - // like writing 'WithParamInterface::GetParam()' for a test that - // uses a fixture whose parameter type is int. - const ParamType& GetParam() const { return *parameter_; } - - private: - // Sets parameter value. The caller is responsible for making sure the value - // remains alive and unchanged throughout the current test. - static void SetParam(const ParamType* parameter) { - parameter_ = parameter; - } - - // Static value used for accessing parameter during a test lifetime. - static const ParamType* parameter_; - - // TestClass must be a subclass of WithParamInterface and Test. - template friend class internal::ParameterizedTestFactory; -}; - -template -const T* WithParamInterface::parameter_ = NULL; - -// Most value-parameterized classes can ignore the existence of -// WithParamInterface, and can just inherit from ::testing::TestWithParam. - -template -class TestWithParam : public Test, public WithParamInterface { -}; - -#endif // GTEST_HAS_PARAM_TEST - -// Macros for indicating success/failure in test code. - -// ADD_FAILURE unconditionally adds a failure to the current test. -// SUCCEED generates a success - it doesn't automatically make the -// current test successful, as a test is only successful when it has -// no failure. -// -// EXPECT_* verifies that a certain condition is satisfied. If not, -// it behaves like ADD_FAILURE. In particular: -// -// EXPECT_TRUE verifies that a Boolean condition is true. -// EXPECT_FALSE verifies that a Boolean condition is false. -// -// FAIL and ASSERT_* are similar to ADD_FAILURE and EXPECT_*, except -// that they will also abort the current function on failure. People -// usually want the fail-fast behavior of FAIL and ASSERT_*, but those -// writing data-driven tests often find themselves using ADD_FAILURE -// and EXPECT_* more. -// -// Examples: -// -// EXPECT_TRUE(server.StatusIsOK()); -// ASSERT_FALSE(server.HasPendingRequest(port)) -// << "There are still pending requests " << "on port " << port; - -// Generates a nonfatal failure with a generic message. -#define ADD_FAILURE() GTEST_NONFATAL_FAILURE_("Failed") - -// Generates a nonfatal failure at the given source file location with -// a generic message. -#define ADD_FAILURE_AT(file, line) \ - GTEST_MESSAGE_AT_(file, line, "Failed", \ - ::testing::TestPartResult::kNonFatalFailure) - -// Generates a fatal failure with a generic message. -#define GTEST_FAIL() GTEST_FATAL_FAILURE_("Failed") - -// Define this macro to 1 to omit the definition of FAIL(), which is a -// generic name and clashes with some other libraries. -#if !GTEST_DONT_DEFINE_FAIL -# define FAIL() GTEST_FAIL() -#endif - -// Generates a success with a generic message. -#define GTEST_SUCCEED() GTEST_SUCCESS_("Succeeded") - -// Define this macro to 1 to omit the definition of SUCCEED(), which -// is a generic name and clashes with some other libraries. -#if !GTEST_DONT_DEFINE_SUCCEED -# define SUCCEED() GTEST_SUCCEED() -#endif - -// Macros for testing exceptions. -// -// * {ASSERT|EXPECT}_THROW(statement, expected_exception): -// Tests that the statement throws the expected exception. -// * {ASSERT|EXPECT}_NO_THROW(statement): -// Tests that the statement doesn't throw any exception. -// * {ASSERT|EXPECT}_ANY_THROW(statement): -// Tests that the statement throws an exception. - -#define EXPECT_THROW(statement, expected_exception) \ - GTEST_TEST_THROW_(statement, expected_exception, GTEST_NONFATAL_FAILURE_) -#define EXPECT_NO_THROW(statement) \ - GTEST_TEST_NO_THROW_(statement, GTEST_NONFATAL_FAILURE_) -#define EXPECT_ANY_THROW(statement) \ - GTEST_TEST_ANY_THROW_(statement, GTEST_NONFATAL_FAILURE_) -#define ASSERT_THROW(statement, expected_exception) \ - GTEST_TEST_THROW_(statement, expected_exception, GTEST_FATAL_FAILURE_) -#define ASSERT_NO_THROW(statement) \ - GTEST_TEST_NO_THROW_(statement, GTEST_FATAL_FAILURE_) -#define ASSERT_ANY_THROW(statement) \ - GTEST_TEST_ANY_THROW_(statement, GTEST_FATAL_FAILURE_) - -// Boolean assertions. Condition can be either a Boolean expression or an -// AssertionResult. For more information on how to use AssertionResult with -// these macros see comments on that class. -#define EXPECT_TRUE(condition) \ - GTEST_TEST_BOOLEAN_(condition, #condition, false, true, \ - GTEST_NONFATAL_FAILURE_) -#define EXPECT_FALSE(condition) \ - GTEST_TEST_BOOLEAN_(!(condition), #condition, true, false, \ - GTEST_NONFATAL_FAILURE_) -#define ASSERT_TRUE(condition) \ - GTEST_TEST_BOOLEAN_(condition, #condition, false, true, \ - GTEST_FATAL_FAILURE_) -#define ASSERT_FALSE(condition) \ - GTEST_TEST_BOOLEAN_(!(condition), #condition, true, false, \ - GTEST_FATAL_FAILURE_) - -// Includes the auto-generated header that implements a family of -// generic predicate assertion macros. -// Copyright 2006, 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. - -// This file is AUTOMATICALLY GENERATED on 09/24/2010 by command -// 'gen_gtest_pred_impl.py 5'. DO NOT EDIT BY HAND! -// -// Implements a family of generic predicate assertion macros. - -#ifndef GTEST_INCLUDE_GTEST_GTEST_PRED_IMPL_H_ -#define GTEST_INCLUDE_GTEST_GTEST_PRED_IMPL_H_ - -// Makes sure this header is not included before gtest.h. -#ifndef GTEST_INCLUDE_GTEST_GTEST_H_ -# error Do not include gtest_pred_impl.h directly. Include gtest.h instead. -#endif // GTEST_INCLUDE_GTEST_GTEST_H_ - -// This header implements a family of generic predicate assertion -// macros: -// -// ASSERT_PRED_FORMAT1(pred_format, v1) -// ASSERT_PRED_FORMAT2(pred_format, v1, v2) -// ... -// -// where pred_format is a function or functor that takes n (in the -// case of ASSERT_PRED_FORMATn) values and their source expression -// text, and returns a testing::AssertionResult. See the definition -// of ASSERT_EQ in gtest.h for an example. -// -// If you don't care about formatting, you can use the more -// restrictive version: -// -// ASSERT_PRED1(pred, v1) -// ASSERT_PRED2(pred, v1, v2) -// ... -// -// where pred is an n-ary function or functor that returns bool, -// and the values v1, v2, ..., must support the << operator for -// streaming to std::ostream. -// -// We also define the EXPECT_* variations. -// -// For now we only support predicates whose arity is at most 5. -// Please email googletestframework@googlegroups.com if you need -// support for higher arities. - -// GTEST_ASSERT_ is the basic statement to which all of the assertions -// in this file reduce. Don't use this in your code. - -#define GTEST_ASSERT_(expression, on_failure) \ - GTEST_AMBIGUOUS_ELSE_BLOCKER_ \ - if (const ::testing::AssertionResult gtest_ar = (expression)) \ - ; \ - else \ - on_failure(gtest_ar.failure_message()) - - -// Helper function for implementing {EXPECT|ASSERT}_PRED1. Don't use -// this in your code. -template -AssertionResult AssertPred1Helper(const char* pred_text, - const char* e1, - Pred pred, - const T1& v1) { - if (pred(v1)) return AssertionSuccess(); - - return AssertionFailure() << pred_text << "(" - << e1 << ") evaluates to false, where" - << "\n" << e1 << " evaluates to " << v1; -} - -// Internal macro for implementing {EXPECT|ASSERT}_PRED_FORMAT1. -// Don't use this in your code. -#define GTEST_PRED_FORMAT1_(pred_format, v1, on_failure)\ - GTEST_ASSERT_(pred_format(#v1, v1),\ - on_failure) - -// Internal macro for implementing {EXPECT|ASSERT}_PRED1. Don't use -// this in your code. -#define GTEST_PRED1_(pred, v1, on_failure)\ - GTEST_ASSERT_(::testing::AssertPred1Helper(#pred, \ - #v1, \ - pred, \ - v1), on_failure) - -// Unary predicate assertion macros. -#define EXPECT_PRED_FORMAT1(pred_format, v1) \ - GTEST_PRED_FORMAT1_(pred_format, v1, GTEST_NONFATAL_FAILURE_) -#define EXPECT_PRED1(pred, v1) \ - GTEST_PRED1_(pred, v1, GTEST_NONFATAL_FAILURE_) -#define ASSERT_PRED_FORMAT1(pred_format, v1) \ - GTEST_PRED_FORMAT1_(pred_format, v1, GTEST_FATAL_FAILURE_) -#define ASSERT_PRED1(pred, v1) \ - GTEST_PRED1_(pred, v1, GTEST_FATAL_FAILURE_) - - - -// Helper function for implementing {EXPECT|ASSERT}_PRED2. Don't use -// this in your code. -template -AssertionResult AssertPred2Helper(const char* pred_text, - const char* e1, - const char* e2, - Pred pred, - const T1& v1, - const T2& v2) { - if (pred(v1, v2)) return AssertionSuccess(); - - return AssertionFailure() << pred_text << "(" - << e1 << ", " - << e2 << ") evaluates to false, where" - << "\n" << e1 << " evaluates to " << v1 - << "\n" << e2 << " evaluates to " << v2; -} - -// Internal macro for implementing {EXPECT|ASSERT}_PRED_FORMAT2. -// Don't use this in your code. -#define GTEST_PRED_FORMAT2_(pred_format, v1, v2, on_failure)\ - GTEST_ASSERT_(pred_format(#v1, #v2, v1, v2),\ - on_failure) - -// Internal macro for implementing {EXPECT|ASSERT}_PRED2. Don't use -// this in your code. -#define GTEST_PRED2_(pred, v1, v2, on_failure)\ - GTEST_ASSERT_(::testing::AssertPred2Helper(#pred, \ - #v1, \ - #v2, \ - pred, \ - v1, \ - v2), on_failure) - -// Binary predicate assertion macros. -#define EXPECT_PRED_FORMAT2(pred_format, v1, v2) \ - GTEST_PRED_FORMAT2_(pred_format, v1, v2, GTEST_NONFATAL_FAILURE_) -#define EXPECT_PRED2(pred, v1, v2) \ - GTEST_PRED2_(pred, v1, v2, GTEST_NONFATAL_FAILURE_) -#define ASSERT_PRED_FORMAT2(pred_format, v1, v2) \ - GTEST_PRED_FORMAT2_(pred_format, v1, v2, GTEST_FATAL_FAILURE_) -#define ASSERT_PRED2(pred, v1, v2) \ - GTEST_PRED2_(pred, v1, v2, GTEST_FATAL_FAILURE_) - - - -// Helper function for implementing {EXPECT|ASSERT}_PRED3. Don't use -// this in your code. -template -AssertionResult AssertPred3Helper(const char* pred_text, - const char* e1, - const char* e2, - const char* e3, - Pred pred, - const T1& v1, - const T2& v2, - const T3& v3) { - if (pred(v1, v2, v3)) return AssertionSuccess(); - - return AssertionFailure() << pred_text << "(" - << e1 << ", " - << e2 << ", " - << e3 << ") evaluates to false, where" - << "\n" << e1 << " evaluates to " << v1 - << "\n" << e2 << " evaluates to " << v2 - << "\n" << e3 << " evaluates to " << v3; -} - -// Internal macro for implementing {EXPECT|ASSERT}_PRED_FORMAT3. -// Don't use this in your code. -#define GTEST_PRED_FORMAT3_(pred_format, v1, v2, v3, on_failure)\ - GTEST_ASSERT_(pred_format(#v1, #v2, #v3, v1, v2, v3),\ - on_failure) - -// Internal macro for implementing {EXPECT|ASSERT}_PRED3. Don't use -// this in your code. -#define GTEST_PRED3_(pred, v1, v2, v3, on_failure)\ - GTEST_ASSERT_(::testing::AssertPred3Helper(#pred, \ - #v1, \ - #v2, \ - #v3, \ - pred, \ - v1, \ - v2, \ - v3), on_failure) - -// Ternary predicate assertion macros. -#define EXPECT_PRED_FORMAT3(pred_format, v1, v2, v3) \ - GTEST_PRED_FORMAT3_(pred_format, v1, v2, v3, GTEST_NONFATAL_FAILURE_) -#define EXPECT_PRED3(pred, v1, v2, v3) \ - GTEST_PRED3_(pred, v1, v2, v3, GTEST_NONFATAL_FAILURE_) -#define ASSERT_PRED_FORMAT3(pred_format, v1, v2, v3) \ - GTEST_PRED_FORMAT3_(pred_format, v1, v2, v3, GTEST_FATAL_FAILURE_) -#define ASSERT_PRED3(pred, v1, v2, v3) \ - GTEST_PRED3_(pred, v1, v2, v3, GTEST_FATAL_FAILURE_) - - - -// Helper function for implementing {EXPECT|ASSERT}_PRED4. Don't use -// this in your code. -template -AssertionResult AssertPred4Helper(const char* pred_text, - const char* e1, - const char* e2, - const char* e3, - const char* e4, - Pred pred, - const T1& v1, - const T2& v2, - const T3& v3, - const T4& v4) { - if (pred(v1, v2, v3, v4)) return AssertionSuccess(); - - return AssertionFailure() << pred_text << "(" - << e1 << ", " - << e2 << ", " - << e3 << ", " - << e4 << ") evaluates to false, where" - << "\n" << e1 << " evaluates to " << v1 - << "\n" << e2 << " evaluates to " << v2 - << "\n" << e3 << " evaluates to " << v3 - << "\n" << e4 << " evaluates to " << v4; -} - -// Internal macro for implementing {EXPECT|ASSERT}_PRED_FORMAT4. -// Don't use this in your code. -#define GTEST_PRED_FORMAT4_(pred_format, v1, v2, v3, v4, on_failure)\ - GTEST_ASSERT_(pred_format(#v1, #v2, #v3, #v4, v1, v2, v3, v4),\ - on_failure) - -// Internal macro for implementing {EXPECT|ASSERT}_PRED4. Don't use -// this in your code. -#define GTEST_PRED4_(pred, v1, v2, v3, v4, on_failure)\ - GTEST_ASSERT_(::testing::AssertPred4Helper(#pred, \ - #v1, \ - #v2, \ - #v3, \ - #v4, \ - pred, \ - v1, \ - v2, \ - v3, \ - v4), on_failure) - -// 4-ary predicate assertion macros. -#define EXPECT_PRED_FORMAT4(pred_format, v1, v2, v3, v4) \ - GTEST_PRED_FORMAT4_(pred_format, v1, v2, v3, v4, GTEST_NONFATAL_FAILURE_) -#define EXPECT_PRED4(pred, v1, v2, v3, v4) \ - GTEST_PRED4_(pred, v1, v2, v3, v4, GTEST_NONFATAL_FAILURE_) -#define ASSERT_PRED_FORMAT4(pred_format, v1, v2, v3, v4) \ - GTEST_PRED_FORMAT4_(pred_format, v1, v2, v3, v4, GTEST_FATAL_FAILURE_) -#define ASSERT_PRED4(pred, v1, v2, v3, v4) \ - GTEST_PRED4_(pred, v1, v2, v3, v4, GTEST_FATAL_FAILURE_) - - - -// Helper function for implementing {EXPECT|ASSERT}_PRED5. Don't use -// this in your code. -template -AssertionResult AssertPred5Helper(const char* pred_text, - const char* e1, - const char* e2, - const char* e3, - const char* e4, - const char* e5, - Pred pred, - const T1& v1, - const T2& v2, - const T3& v3, - const T4& v4, - const T5& v5) { - if (pred(v1, v2, v3, v4, v5)) return AssertionSuccess(); - - return AssertionFailure() << pred_text << "(" - << e1 << ", " - << e2 << ", " - << e3 << ", " - << e4 << ", " - << e5 << ") evaluates to false, where" - << "\n" << e1 << " evaluates to " << v1 - << "\n" << e2 << " evaluates to " << v2 - << "\n" << e3 << " evaluates to " << v3 - << "\n" << e4 << " evaluates to " << v4 - << "\n" << e5 << " evaluates to " << v5; -} - -// Internal macro for implementing {EXPECT|ASSERT}_PRED_FORMAT5. -// Don't use this in your code. -#define GTEST_PRED_FORMAT5_(pred_format, v1, v2, v3, v4, v5, on_failure)\ - GTEST_ASSERT_(pred_format(#v1, #v2, #v3, #v4, #v5, v1, v2, v3, v4, v5),\ - on_failure) - -// Internal macro for implementing {EXPECT|ASSERT}_PRED5. Don't use -// this in your code. -#define GTEST_PRED5_(pred, v1, v2, v3, v4, v5, on_failure)\ - GTEST_ASSERT_(::testing::AssertPred5Helper(#pred, \ - #v1, \ - #v2, \ - #v3, \ - #v4, \ - #v5, \ - pred, \ - v1, \ - v2, \ - v3, \ - v4, \ - v5), on_failure) - -// 5-ary predicate assertion macros. -#define EXPECT_PRED_FORMAT5(pred_format, v1, v2, v3, v4, v5) \ - GTEST_PRED_FORMAT5_(pred_format, v1, v2, v3, v4, v5, GTEST_NONFATAL_FAILURE_) -#define EXPECT_PRED5(pred, v1, v2, v3, v4, v5) \ - GTEST_PRED5_(pred, v1, v2, v3, v4, v5, GTEST_NONFATAL_FAILURE_) -#define ASSERT_PRED_FORMAT5(pred_format, v1, v2, v3, v4, v5) \ - GTEST_PRED_FORMAT5_(pred_format, v1, v2, v3, v4, v5, GTEST_FATAL_FAILURE_) -#define ASSERT_PRED5(pred, v1, v2, v3, v4, v5) \ - GTEST_PRED5_(pred, v1, v2, v3, v4, v5, GTEST_FATAL_FAILURE_) - - - -#endif // GTEST_INCLUDE_GTEST_GTEST_PRED_IMPL_H_ - -// Macros for testing equalities and inequalities. -// -// * {ASSERT|EXPECT}_EQ(expected, actual): Tests that expected == actual -// * {ASSERT|EXPECT}_NE(v1, v2): Tests that v1 != v2 -// * {ASSERT|EXPECT}_LT(v1, v2): Tests that v1 < v2 -// * {ASSERT|EXPECT}_LE(v1, v2): Tests that v1 <= v2 -// * {ASSERT|EXPECT}_GT(v1, v2): Tests that v1 > v2 -// * {ASSERT|EXPECT}_GE(v1, v2): Tests that v1 >= v2 -// -// When they are not, Google Test prints both the tested expressions and -// their actual values. The values must be compatible built-in types, -// or you will get a compiler error. By "compatible" we mean that the -// values can be compared by the respective operator. -// -// Note: -// -// 1. It is possible to make a user-defined type work with -// {ASSERT|EXPECT}_??(), but that requires overloading the -// comparison operators and is thus discouraged by the Google C++ -// Usage Guide. Therefore, you are advised to use the -// {ASSERT|EXPECT}_TRUE() macro to assert that two objects are -// equal. -// -// 2. The {ASSERT|EXPECT}_??() macros do pointer comparisons on -// pointers (in particular, C strings). Therefore, if you use it -// with two C strings, you are testing how their locations in memory -// are related, not how their content is related. To compare two C -// strings by content, use {ASSERT|EXPECT}_STR*(). -// -// 3. {ASSERT|EXPECT}_EQ(expected, actual) is preferred to -// {ASSERT|EXPECT}_TRUE(expected == actual), as the former tells you -// what the actual value is when it fails, and similarly for the -// other comparisons. -// -// 4. Do not depend on the order in which {ASSERT|EXPECT}_??() -// evaluate their arguments, which is undefined. -// -// 5. These macros evaluate their arguments exactly once. -// -// Examples: -// -// EXPECT_NE(5, Foo()); -// EXPECT_EQ(NULL, a_pointer); -// ASSERT_LT(i, array_size); -// ASSERT_GT(records.size(), 0) << "There is no record left."; - -#define EXPECT_EQ(expected, actual) \ - EXPECT_PRED_FORMAT2(::testing::internal:: \ - EqHelper::Compare, \ - expected, actual) -#define EXPECT_NE(expected, actual) \ - EXPECT_PRED_FORMAT2(::testing::internal::CmpHelperNE, expected, actual) -#define EXPECT_LE(val1, val2) \ - EXPECT_PRED_FORMAT2(::testing::internal::CmpHelperLE, val1, val2) -#define EXPECT_LT(val1, val2) \ - EXPECT_PRED_FORMAT2(::testing::internal::CmpHelperLT, val1, val2) -#define EXPECT_GE(val1, val2) \ - EXPECT_PRED_FORMAT2(::testing::internal::CmpHelperGE, val1, val2) -#define EXPECT_GT(val1, val2) \ - EXPECT_PRED_FORMAT2(::testing::internal::CmpHelperGT, val1, val2) - -#define GTEST_ASSERT_EQ(expected, actual) \ - ASSERT_PRED_FORMAT2(::testing::internal:: \ - EqHelper::Compare, \ - expected, actual) -#define GTEST_ASSERT_NE(val1, val2) \ - ASSERT_PRED_FORMAT2(::testing::internal::CmpHelperNE, val1, val2) -#define GTEST_ASSERT_LE(val1, val2) \ - ASSERT_PRED_FORMAT2(::testing::internal::CmpHelperLE, val1, val2) -#define GTEST_ASSERT_LT(val1, val2) \ - ASSERT_PRED_FORMAT2(::testing::internal::CmpHelperLT, val1, val2) -#define GTEST_ASSERT_GE(val1, val2) \ - ASSERT_PRED_FORMAT2(::testing::internal::CmpHelperGE, val1, val2) -#define GTEST_ASSERT_GT(val1, val2) \ - ASSERT_PRED_FORMAT2(::testing::internal::CmpHelperGT, val1, val2) - -// Define macro GTEST_DONT_DEFINE_ASSERT_XY to 1 to omit the definition of -// ASSERT_XY(), which clashes with some users' own code. - -#if !GTEST_DONT_DEFINE_ASSERT_EQ -# define ASSERT_EQ(val1, val2) GTEST_ASSERT_EQ(val1, val2) -#endif - -#if !GTEST_DONT_DEFINE_ASSERT_NE -# define ASSERT_NE(val1, val2) GTEST_ASSERT_NE(val1, val2) -#endif - -#if !GTEST_DONT_DEFINE_ASSERT_LE -# define ASSERT_LE(val1, val2) GTEST_ASSERT_LE(val1, val2) -#endif - -#if !GTEST_DONT_DEFINE_ASSERT_LT -# define ASSERT_LT(val1, val2) GTEST_ASSERT_LT(val1, val2) -#endif - -#if !GTEST_DONT_DEFINE_ASSERT_GE -# define ASSERT_GE(val1, val2) GTEST_ASSERT_GE(val1, val2) -#endif - -#if !GTEST_DONT_DEFINE_ASSERT_GT -# define ASSERT_GT(val1, val2) GTEST_ASSERT_GT(val1, val2) -#endif - -// C String Comparisons. All tests treat NULL and any non-NULL string -// as different. Two NULLs are equal. -// -// * {ASSERT|EXPECT}_STREQ(s1, s2): Tests that s1 == s2 -// * {ASSERT|EXPECT}_STRNE(s1, s2): Tests that s1 != s2 -// * {ASSERT|EXPECT}_STRCASEEQ(s1, s2): Tests that s1 == s2, ignoring case -// * {ASSERT|EXPECT}_STRCASENE(s1, s2): Tests that s1 != s2, ignoring case -// -// For wide or narrow string objects, you can use the -// {ASSERT|EXPECT}_??() macros. -// -// Don't depend on the order in which the arguments are evaluated, -// which is undefined. -// -// These macros evaluate their arguments exactly once. - -#define EXPECT_STREQ(expected, actual) \ - EXPECT_PRED_FORMAT2(::testing::internal::CmpHelperSTREQ, expected, actual) -#define EXPECT_STRNE(s1, s2) \ - EXPECT_PRED_FORMAT2(::testing::internal::CmpHelperSTRNE, s1, s2) -#define EXPECT_STRCASEEQ(expected, actual) \ - EXPECT_PRED_FORMAT2(::testing::internal::CmpHelperSTRCASEEQ, expected, actual) -#define EXPECT_STRCASENE(s1, s2)\ - EXPECT_PRED_FORMAT2(::testing::internal::CmpHelperSTRCASENE, s1, s2) - -#define ASSERT_STREQ(expected, actual) \ - ASSERT_PRED_FORMAT2(::testing::internal::CmpHelperSTREQ, expected, actual) -#define ASSERT_STRNE(s1, s2) \ - ASSERT_PRED_FORMAT2(::testing::internal::CmpHelperSTRNE, s1, s2) -#define ASSERT_STRCASEEQ(expected, actual) \ - ASSERT_PRED_FORMAT2(::testing::internal::CmpHelperSTRCASEEQ, expected, actual) -#define ASSERT_STRCASENE(s1, s2)\ - ASSERT_PRED_FORMAT2(::testing::internal::CmpHelperSTRCASENE, s1, s2) - -// Macros for comparing floating-point numbers. -// -// * {ASSERT|EXPECT}_FLOAT_EQ(expected, actual): -// Tests that two float values are almost equal. -// * {ASSERT|EXPECT}_DOUBLE_EQ(expected, actual): -// Tests that two double values are almost equal. -// * {ASSERT|EXPECT}_NEAR(v1, v2, abs_error): -// Tests that v1 and v2 are within the given distance to each other. -// -// Google Test uses ULP-based comparison to automatically pick a default -// error bound that is appropriate for the operands. See the -// FloatingPoint template class in gtest-internal.h if you are -// interested in the implementation details. - -#define EXPECT_FLOAT_EQ(expected, actual)\ - EXPECT_PRED_FORMAT2(::testing::internal::CmpHelperFloatingPointEQ, \ - expected, actual) - -#define EXPECT_DOUBLE_EQ(expected, actual)\ - EXPECT_PRED_FORMAT2(::testing::internal::CmpHelperFloatingPointEQ, \ - expected, actual) - -#define ASSERT_FLOAT_EQ(expected, actual)\ - ASSERT_PRED_FORMAT2(::testing::internal::CmpHelperFloatingPointEQ, \ - expected, actual) - -#define ASSERT_DOUBLE_EQ(expected, actual)\ - ASSERT_PRED_FORMAT2(::testing::internal::CmpHelperFloatingPointEQ, \ - expected, actual) - -#define EXPECT_NEAR(val1, val2, abs_error)\ - EXPECT_PRED_FORMAT3(::testing::internal::DoubleNearPredFormat, \ - val1, val2, abs_error) - -#define ASSERT_NEAR(val1, val2, abs_error)\ - ASSERT_PRED_FORMAT3(::testing::internal::DoubleNearPredFormat, \ - val1, val2, abs_error) - -// These predicate format functions work on floating-point values, and -// can be used in {ASSERT|EXPECT}_PRED_FORMAT2*(), e.g. -// -// EXPECT_PRED_FORMAT2(testing::DoubleLE, Foo(), 5.0); - -// Asserts that val1 is less than, or almost equal to, val2. Fails -// otherwise. In particular, it fails if either val1 or val2 is NaN. -GTEST_API_ AssertionResult FloatLE(const char* expr1, const char* expr2, - float val1, float val2); -GTEST_API_ AssertionResult DoubleLE(const char* expr1, const char* expr2, - double val1, double val2); - - -#if GTEST_OS_WINDOWS - -// Macros that test for HRESULT failure and success, these are only useful -// on Windows, and rely on Windows SDK macros and APIs to compile. -// -// * {ASSERT|EXPECT}_HRESULT_{SUCCEEDED|FAILED}(expr) -// -// When expr unexpectedly fails or succeeds, Google Test prints the -// expected result and the actual result with both a human-readable -// string representation of the error, if available, as well as the -// hex result code. -# define EXPECT_HRESULT_SUCCEEDED(expr) \ - EXPECT_PRED_FORMAT1(::testing::internal::IsHRESULTSuccess, (expr)) - -# define ASSERT_HRESULT_SUCCEEDED(expr) \ - ASSERT_PRED_FORMAT1(::testing::internal::IsHRESULTSuccess, (expr)) - -# define EXPECT_HRESULT_FAILED(expr) \ - EXPECT_PRED_FORMAT1(::testing::internal::IsHRESULTFailure, (expr)) - -# define ASSERT_HRESULT_FAILED(expr) \ - ASSERT_PRED_FORMAT1(::testing::internal::IsHRESULTFailure, (expr)) - -#endif // GTEST_OS_WINDOWS - -// Macros that execute statement and check that it doesn't generate new fatal -// failures in the current thread. -// -// * {ASSERT|EXPECT}_NO_FATAL_FAILURE(statement); -// -// Examples: -// -// EXPECT_NO_FATAL_FAILURE(Process()); -// ASSERT_NO_FATAL_FAILURE(Process()) << "Process() failed"; -// -#define ASSERT_NO_FATAL_FAILURE(statement) \ - GTEST_TEST_NO_FATAL_FAILURE_(statement, GTEST_FATAL_FAILURE_) -#define EXPECT_NO_FATAL_FAILURE(statement) \ - GTEST_TEST_NO_FATAL_FAILURE_(statement, GTEST_NONFATAL_FAILURE_) - -// Causes a trace (including the source file path, the current line -// number, and the given message) to be included in every test failure -// message generated by code in the current scope. The effect is -// undone when the control leaves the current scope. -// -// The message argument can be anything streamable to std::ostream. -// -// In the implementation, we include the current line number as part -// of the dummy variable name, thus allowing multiple SCOPED_TRACE()s -// to appear in the same block - as long as they are on different -// lines. -#define SCOPED_TRACE(message) \ - ::testing::internal::ScopedTrace GTEST_CONCAT_TOKEN_(gtest_trace_, __LINE__)(\ - __FILE__, __LINE__, ::testing::Message() << (message)) - -// Compile-time assertion for type equality. -// StaticAssertTypeEq() compiles iff type1 and type2 are -// the same type. The value it returns is not interesting. -// -// Instead of making StaticAssertTypeEq a class template, we make it a -// function template that invokes a helper class template. This -// prevents a user from misusing StaticAssertTypeEq by -// defining objects of that type. -// -// CAVEAT: -// -// When used inside a method of a class template, -// StaticAssertTypeEq() is effective ONLY IF the method is -// instantiated. For example, given: -// -// template class Foo { -// public: -// void Bar() { testing::StaticAssertTypeEq(); } -// }; -// -// the code: -// -// void Test1() { Foo foo; } -// -// will NOT generate a compiler error, as Foo::Bar() is never -// actually instantiated. Instead, you need: -// -// void Test2() { Foo foo; foo.Bar(); } -// -// to cause a compiler error. -template -bool StaticAssertTypeEq() { - (void)internal::StaticAssertTypeEqHelper(); - return true; -} - -// Defines a test. -// -// The first parameter is the name of the test case, and the second -// parameter is the name of the test within the test case. -// -// The convention is to end the test case name with "Test". For -// example, a test case for the Foo class can be named FooTest. -// -// The user should put his test code between braces after using this -// macro. Example: -// -// TEST(FooTest, InitializesCorrectly) { -// Foo foo; -// EXPECT_TRUE(foo.StatusIsOK()); -// } - -// Note that we call GetTestTypeId() instead of GetTypeId< -// ::testing::Test>() here to get the type ID of testing::Test. This -// is to work around a suspected linker bug when using Google Test as -// a framework on Mac OS X. The bug causes GetTypeId< -// ::testing::Test>() to return different values depending on whether -// the call is from the Google Test framework itself or from user test -// code. GetTestTypeId() is guaranteed to always return the same -// value, as it always calls GetTypeId<>() from the Google Test -// framework. -#define GTEST_TEST(test_case_name, test_name)\ - GTEST_TEST_(test_case_name, test_name, \ - ::testing::Test, ::testing::internal::GetTestTypeId()) - -// Define this macro to 1 to omit the definition of TEST(), which -// is a generic name and clashes with some other libraries. -#if !GTEST_DONT_DEFINE_TEST -# define TEST(test_case_name, test_name) GTEST_TEST(test_case_name, test_name) -#endif - -// Defines a test that uses a test fixture. -// -// The first parameter is the name of the test fixture class, which -// also doubles as the test case name. The second parameter is the -// name of the test within the test case. -// -// A test fixture class must be declared earlier. The user should put -// his test code between braces after using this macro. Example: -// -// class FooTest : public testing::Test { -// protected: -// virtual void SetUp() { b_.AddElement(3); } -// -// Foo a_; -// Foo b_; -// }; -// -// TEST_F(FooTest, InitializesCorrectly) { -// EXPECT_TRUE(a_.StatusIsOK()); -// } -// -// TEST_F(FooTest, ReturnsElementCountCorrectly) { -// EXPECT_EQ(0, a_.size()); -// EXPECT_EQ(1, b_.size()); -// } - -#define TEST_F(test_fixture, test_name)\ - GTEST_TEST_(test_fixture, test_name, test_fixture, \ - ::testing::internal::GetTypeId()) - -// Use this macro in main() to run all tests. It returns 0 if all -// tests are successful, or 1 otherwise. -// -// RUN_ALL_TESTS() should be invoked after the command line has been -// parsed by InitGoogleTest(). - -#define RUN_ALL_TESTS()\ - (::testing::UnitTest::GetInstance()->Run()) - -} // namespace testing - -#endif // GTEST_INCLUDE_GTEST_GTEST_H_ diff --git a/vra/tests-unit/gtest/gtest_main.cc b/vra/tests-unit/gtest/gtest_main.cc deleted file mode 100644 index a09bbe0c6..000000000 --- a/vra/tests-unit/gtest/gtest_main.cc +++ /dev/null @@ -1,39 +0,0 @@ -// Copyright 2006, 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. - -#include - -#include "gtest/gtest.h" - -GTEST_API_ int main(int argc, char **argv) { - std::cout << "Running main() from gtest_main.cc\n"; - - testing::InitGoogleTest(&argc, argv); - return RUN_ALL_TESTS(); -} diff --git a/vra/tests-unit/run-all-unit-tests.sh b/vra/tests-unit/run-all-unit-tests.sh deleted file mode 100755 index 9f8a7ce1c..000000000 --- a/vra/tests-unit/run-all-unit-tests.sh +++ /dev/null @@ -1,21 +0,0 @@ -#!/bin/bash -# -# Encoding: utf-8 -# Author: Daniela Duricekova, xduric00@stud.fit.vutbr.cz -# Date: 2013-04-13 -# -# Runs all the unit tests. -# - -# Make sure that all tests are built. -echo "Building the unit tests..." -make - -# Run them (show only failures). -for test in NumberTest RangeTest MemoryPlaceTest OperandToMemoryPlaceTest UtilityTest; do - echo "" - echo "Running $test..." - ./$test --gtest_color=yes | grep -v "RUN\|OK\|----------\|==========" -done - -exit 0 diff --git a/vra/trap.h b/vra/trap.h deleted file mode 100644 index e31719108..000000000 --- a/vra/trap.h +++ /dev/null @@ -1,69 +0,0 @@ -/* - * Copyright (C) 2013 Daniela Ďuričeková - * - * This file is part of value-range analyzer. - * - * Value-range analyzer is free software: you can redistribute it and/or modify - * it under the terms of the GNU General Public License as published by the Free - * Software Foundation, either version 3 of the License, or any later version. - * - * Value-range analyzer is distributed in the hope that it will be useful, but - * WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or - * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for - * more details. - * - * You should have received a copy of the GNU General Public License along with - * the value-range analyzer. If not, see . - */ - -#include /* needed for TRAP ... fprintf(stderr, ...) */ - -/** - * defined in version.c to avoid rebuild of all modules on git-commit - */ -extern const char *GIT_SHA1; - -#ifdef USE_INT3_AS_BRK -# define _CL_BREAK __asm__("int3") -# define _CL_BREAK_MECH "INT3" -#else -# include -# define _CL_BREAK raise(SIGTRAP) -# define _CL_BREAK_MECH "SIGTRAP" -#endif - -/** - * jump to debugger by default in case anything interesting happens - * @note this behavior may be subject for change in the future - * @note for comfortable source code browsing, it's recommended to tweak your - * editor, in order to highlight CL_TRAP as as keyword, as well as CL_BREAK_IF - */ -#define CL_TRAP do { \ - fprintf(stderr, "%s:%d: killing self by %s [SHA1 %s]\n", \ - __FILE__, __LINE__, _CL_BREAK_MECH, GIT_SHA1); \ - \ - _CL_BREAK; \ -} while (0) - -#ifndef NDEBUG -/** - * conditional variant of CL_TRAP, do nothing as long as cond is not satisfied - * @attention the macro suffer from the same flaw as std::assert - the given - * expression is not evaluated at all unless you're running a debug build - * @note the macro has exactly opposite semantic than std::assert - * @note for comfortable source code browsing, it's recommended to tweak your - * editor, in order to highlight CL_BREAK_IF as as keyword, as well as CL_TRAP - */ -# define CL_BREAK_IF(cond) do { \ - if (!(cond)) \ - break; \ - \ - fprintf(stderr, "%s:%d: conditional breakpoint fired: " \ - "CL_BREAK_IF(%s)\n", __FILE__, __LINE__, #cond); \ - \ - CL_TRAP; \ - } while (0) - -#else /* NDEBUG */ -# define CL_BREAK_IF(cond) do { } while (0) -#endif diff --git a/vra/version.c b/vra/version.c deleted file mode 100644 index f4f04acac..000000000 --- a/vra/version.c +++ /dev/null @@ -1,23 +0,0 @@ -/* - * Copyright (C) 2013 Daniela Ďuričeková - * - * This file is part of value-range analyzer. - * - * Value-range analyzer is free software: you can redistribute it and/or modify - * it under the terms of the GNU General Public License as published by the Free - * Software Foundation, either version 3 of the License, or any later version. - * - * Value-range analyzer is distributed in the hope that it will be useful, but - * WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or - * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for - * more details. - * - * You should have received a copy of the GNU General Public License along with - * the value-range analyzer. If not, see . - */ - -#include "config.h" -#include "version.h" - -// see the comment in config.h for details -const char *vrana_git_sha1 = VRA_GIT_SHA1; diff --git a/vra/vra.cc b/vra/vra.cc deleted file mode 100644 index 1f3a7130b..000000000 --- a/vra/vra.cc +++ /dev/null @@ -1,43 +0,0 @@ -/** -* @author Daniela Ďuričeková, xduric00@stud.fit.vutbr.cz -* @file vra.cc -* @brief Performs value-range analysis. -* @date 2012 -*/ - -#undef NDEBUG // It is necessary for using assertions. - -#include -#include - -#include "ValueAnalysis.h" -#include "LoopFinder.h" -#include "GlobAnalysis.h" - -// required by the gcc plug-in API -extern "C" { - __attribute__ ((__visibility__ ("default"))) int plugin_is_GPL_compatible; -} - -using CodeStorage::Fnc; -using CodeStorage::Storage; - -void clEasyRun(const Storage &stor, const char *) -{ - LoopFinder::computeLoopAnalysis(stor); - // LoopFinder::printLoopAnalysis(std::cout); - - GlobAnalysis::computeGlobAnalysis(stor); - // GlobAnalysis::printGlobAnalysis(std::cout); - - for (const Fnc* pFnc : stor.fncs) { - const Fnc &fnc = *pFnc; - - if (!isDefined(fnc)) - continue; - - ValueAnalysis::computeAnalysisForFnc(fnc); - } - - ValueAnalysis::printRanges(std::cout, stor); -} From abf5359f09da95aa454548447167399011e8ba49 Mon Sep 17 00:00:00 2001 From: Kamil Dudka Date: Fri, 18 Oct 2024 16:48:00 +0200 Subject: [PATCH 2/2] fwnull: remove this plug-in from the Predator repo This plug-in was primarily useful as a demo for Code Listener, which was presented as a generic framework for static analysis and formal verification tools 13 years ago. We do not expect any new tools to be created on top of Code Listener any more. This repository is now used mainly for the Predator tool itself. Closes: https://github.com/kdudka/predator/pull/103 --- .gitignore | 1 - fwnull/.gitignore | 2 - fwnull/CMakeLists.txt | 78 ----- fwnull/Makefile | 56 ---- fwnull/cl_fwnull.cc | 715 ------------------------------------------ fwnull/config.h | 26 -- fwnull/probe.sh | 188 ----------- fwnull/sync.sh | 35 --- fwnull/trap.h | 1 - fwnull/version.c | 24 -- 10 files changed, 1126 deletions(-) delete mode 100644 fwnull/.gitignore delete mode 100644 fwnull/CMakeLists.txt delete mode 100644 fwnull/Makefile delete mode 100644 fwnull/cl_fwnull.cc delete mode 100644 fwnull/config.h delete mode 100755 fwnull/probe.sh delete mode 100644 fwnull/sync.sh delete mode 120000 fwnull/trap.h delete mode 100644 fwnull/version.c diff --git a/.gitignore b/.gitignore index 4207de262..7202a527d 100644 --- a/.gitignore +++ b/.gitignore @@ -1,7 +1,6 @@ .DS_Store /ChangeLog /cl_build/ -/fwnull_build/ /boost_1_56_0.tar.bz2 /boost_1_56_0/ /gcc-[4-7].[0-9].[0-9]/ diff --git a/fwnull/.gitignore b/fwnull/.gitignore deleted file mode 100644 index 3e582b49f..000000000 --- a/fwnull/.gitignore +++ /dev/null @@ -1,2 +0,0 @@ -tags -version.h diff --git a/fwnull/CMakeLists.txt b/fwnull/CMakeLists.txt deleted file mode 100644 index 0bd15e3a7..000000000 --- a/fwnull/CMakeLists.txt +++ /dev/null @@ -1,78 +0,0 @@ -# Copyright (C) 2010 Kamil Dudka -# -# This file is part of predator. -# -# predator is free software: you can redistribute it and/or modify -# it under the terms of the GNU General Public License as published by -# the Free Software Foundation, either version 3 of the License, or -# any later version. -# -# predator is distributed in the hope that it will be useful, -# but WITHOUT ANY WARRANTY; without even the implied warranty of -# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the -# GNU General Public License for more details. -# -# You should have received a copy of the GNU General Public License -# along with predator. If not, see . - -# project metadata -cmake_minimum_required(VERSION 2.6) -project(fwnull C CXX) -enable_testing() - -include("../build-aux/common.cmake") - -option(FWNULL_DEBUG "Set to ON to enable debugging support" OFF) -if(FWNULL_DEBUG) - add_definitions("-O0 -g") -else() - add_definitions("-O3 -DNDEBUG") -endif() - -# libfwnull_core.a -add_library(fwnull_core STATIC - cl_fwnull.cc - version.c) - -# build compiler plug-in (libfwnull.so) -CL_BUILD_COMPILER_PLUGIN(fwnull fwnull_core ../cl_build) - -# make install -install(TARGETS fwnull DESTINATION lib) - -set(cost 1048576) -set(testdir "${fwnull_SOURCE_DIR}/../tests/fwnull-regre") - -macro(test_fwnull tname) - set(cmd "LC_ALL=C CCACHE_DISABLE=1 ${GCC_HOST}") - - # we use the following flag to avoid differences on 32bit vs 64bit archs - # in the error output, which is checked for exact match - set(cmd "${cmd} -m32") - - set(cmd "${cmd} -S ${testdir}/${tname}.c") - set(cmd "${cmd} -fplugin=${fwnull_BINARY_DIR}/libfwnull.so") - set(cmd "${cmd} -fplugin-arg-libfwnull-preserve-ec") - set(cmd "${cmd} 2>&1") - - # filter out messages that are unrelated to our plug-in - set(cmd "${cmd} | grep -E '\\\\[-fplugin=libfwnull.so\\\\]\$|compiler error|undefined symbol'") - set(cmd "${cmd} | sed 's/ \\\\[-fplugin=libfwnull.so\\\\]\$//'") - - # filter out NOTE messages with internal location - set(cmd "${cmd} | grep -v 'note: .*\\\\[internal location\\\\]'") - - # drop absolute paths - set(cmd "${cmd} | sed 's|^[^:]*/||'") - - # ... and finally diff with the expected output - set(cmd "${cmd} | diff -up ${testdir}/${tname}.err -") - set(test_name "${tname}.c") - add_test(${test_name} sh -c "${cmd}") - - SET_TESTS_PROPERTIES(${test_name} PROPERTIES COST ${cost}) - MATH(EXPR cost "${cost} - 1") -endmacro(test_fwnull) - -test_fwnull(fwnull-0001) -test_fwnull(libcurl-rtsp-32bit) diff --git a/fwnull/Makefile b/fwnull/Makefile deleted file mode 100644 index 5806a27bf..000000000 --- a/fwnull/Makefile +++ /dev/null @@ -1,56 +0,0 @@ -# Copyright (C) 2010 Kamil Dudka -# -# This file is part of predator. -# -# predator is free software: you can redistribute it and/or modify -# it under the terms of the GNU General Public License as published by -# the Free Software Foundation, either version 3 of the License, or -# any later version. -# -# predator is distributed in the hope that it will be useful, -# but WITHOUT ANY WARRANTY; without even the implied warranty of -# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the -# GNU General Public License for more details. -# -# You should have received a copy of the GNU General Public License -# along with predator. If not, see . - -CMAKE ?= cmake -CTEST ?= ctest - -.PHONY: all check clean cppcheck distclean distcheck version.h - -all: version.h - $(MAKE) -C ../cl_build # make sure that libcl.a is up2date - mkdir -p ../fwnull_build - cd ../fwnull_build && $(CMAKE) ../fwnull - $(MAKE) -C ../fwnull_build - -check: all - cd ../fwnull_build && $(CTEST) --output-on-failure - -cppcheck: all - cppcheck --enable=style,performance,portability,information,missingInclude \ - --template gcc . - -version.h: - @if test -e ../.git; then \ - printf "#define FWNULL_GIT_SHA1 \"%s\"\n" \ - `git log -1 | head -1 | cut -f2 -d" "` \ - | tee $@.tmp \ - && install -m0644 -C -v $@.tmp $@ \ - && rm -f $@.tmp; \ - fi - -clean: - if test -e ../.git; then rm -f version.h; fi - if test -e ../fwnull_build/Makefile; then \ - $(MAKE) clean -C ../fwnull_build; \ - fi - -distclean: clean - rm -rf ../fwnull_build - -distcheck: distclean - $(MAKE) check CMAKE='cmake -D FWNULL_DEBUG=ON' - $(MAKE) check CMAKE='cmake -D FWNULL_DEBUG=OFF' diff --git a/fwnull/cl_fwnull.cc b/fwnull/cl_fwnull.cc deleted file mode 100644 index f46701d42..000000000 --- a/fwnull/cl_fwnull.cc +++ /dev/null @@ -1,715 +0,0 @@ -/* - * Copyright (C) 2010-2022 Kamil Dudka - * - * This file is part of predator. - * - * predator is free software: you can redistribute it and/or modify - * it under the terms of the GNU General Public License as published by - * the Free Software Foundation, either version 3 of the License, or - * any later version. - * - * predator is distributed in the hope that it will be useful, - * but WITHOUT ANY WARRANTY; without even the implied warranty of - * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the - * GNU General Public License for more details. - * - * You should have received a copy of the GNU General Public License - * along with predator. If not, see . - */ - -#include "config.h" - -#include -#include -#include -#include - -#include -#include -#include - -// required by the gcc plug-in API -extern "C" { - __attribute__ ((__visibility__ ("default"))) int plugin_is_GPL_compatible; -} - -/// variable state enumeration -enum EVarState { - VS_UNDEF, ///< value not assigned yet - VS_UNKNOWN, ///< value has been abstracted out - VS_DEREF, ///< value has been already dereferenced - VS_NULL, ///< NULL value has been assigned - VS_NOT_NULL, ///< not-NULL value has been assigned - VS_NULL_DEDUCED, ///< value is guaranteed to be NULL - VS_NOT_NULL_DEDUCED, ///< value is guaranteed to be not-NULL - VS_MIGHT_BE_NULL, - - VS_FALSE, ///< value is 'false', valid only for booleans - VS_TRUE, ///< value is 'true', valid only for booleans - - VS_NULL_IFF, ///< if true, peer is NULL and vice versa - VS_NOT_NULL_IFF ///< if true, peer is not-NULL and vice versa -}; - -typedef int TVar; -typedef const struct cl_loc *TLoc; -typedef const struct cl_operand TOperand; -typedef const CodeStorage::TOperandList TOperandList; -typedef const CodeStorage::TTargetList TTargetList; -typedef const CodeStorage::Block *TBlock; -typedef const CodeStorage::Insn *TInsn; - -/// state of variable (scope of its validity is basic block) -struct VarState { - EVarState code; ///< current state (valid per current block) - TLoc loc; ///< location where the state became valid - TVar peer; ///< used only for VS_NULL_IFF, VS_NOT_NULL_IFF - - VarState(): - code(VS_UNDEF), - loc(0), - peer(-1) - { - } -}; - -typedef std::map TState; - -/// state of computation at function level -struct Data { - typedef std::queue TSched; - typedef std::set TSchedLookup; - typedef std::map TStateMap; - - TSched todo; ///< block scheduled for processing - TSchedLookup todoLookup; ///< block scheduled for processing - TStateMap stateMap; ///< holds states of all vars per each block - TState localState; ///< holds intermediate state between insns - bool silent; ///< if true, do not print diagnostic messages - - Data(): - silent(true) - { - } -}; - -/** - * @param data state of computation per current function - * @param op either source or destination operand that contains a dereference - * @param loc location info of the current instruction - */ -void handleVarDeref( - Data &data, - TOperand *op, - const TLoc loc) -{ - const TVar uid = varIdFromOperand(op); - VarState &vs = data.localState[uid]; - const EVarState code = vs.code; - switch (code) { - case VS_UNDEF: - case VS_UNKNOWN: - vs.code = VS_DEREF; - vs.loc = loc; - // fall through! - - case VS_NOT_NULL: - case VS_NOT_NULL_DEDUCED: - case VS_DEREF: - return; - - default: - break; - } - - if (data.silent) - return; - - switch (code) { - case VS_NULL: - CL_ERROR_MSG(loc, "dereference of NULL value"); - CL_NOTE_MSG(vs.loc, "the NULL value comes from here"); - return; - - case VS_NULL_DEDUCED: - CL_ERROR_MSG(loc, "dereference of NULL value"); - CL_NOTE_MSG(vs.loc, "the condition seems to be used incorrectly"); - - case VS_MIGHT_BE_NULL: - CL_WARN_MSG(loc, "dereference of a value that might be NULL"); - CL_NOTE_MSG(vs.loc, "the same value was compared with NULL here"); - return; - - default: - CL_BREAK_IF("invalid call of handleVarDeref()"); - } -} - -/** - * scan the given instruction for any dereferences and handle the eventually - * @param data state of computation per current function - * @param insn instruction you want to look into - */ -void handleDerefs(Data &data, const TInsn insn) -{ - // for each operand - for (TOperand &op : insn->operands) { - const struct cl_accessor *ac = op.accessor; - if (!ac || ac->code != CL_ACCESSOR_DEREF || seekRefAccessor(ac)) - // no dereference here - continue; - - CL_BREAK_IF(CL_OPERAND_VAR != op.code); - handleVarDeref(data, &op, &insn->loc); - } -} - -/// returns true for VS_NOT_NULL and VS_NOT_NULL_DEDUCED -inline bool anyNotNull(const EVarState code) -{ - switch (code) { - case VS_NOT_NULL: - case VS_NOT_NULL_DEDUCED: - return true; - - default: - return false; - } -} - -/** - * merge values (used for Y nodes of CFG) - * @param dst destination state (used in read-write mode) - * @param src source state (used in read-only mode) - */ -bool mergeValues(VarState &dst, const VarState &src) -{ - if (VS_UNDEF == src.code || VS_MIGHT_BE_NULL == dst.code) - // nothing to propagate actually - return false; - - if (src.code == dst.code) - // codes match already - return false; - - if (VS_NULL_IFF == src.code || VS_NOT_NULL_IFF == src.code - || VS_NULL_IFF == dst.code || VS_NOT_NULL_IFF == dst.code) - // we use these only block-locally - return false; - - if (VS_UNDEF == dst.code) { - // value not defined in the target block, let's start with the new one - dst = src; - return true; - } - - if ((VS_NULL_DEDUCED == src.code && anyNotNull(dst.code)) - || (anyNotNull(src.code) && VS_NULL_DEDUCED == dst.code)) - // merge NULL and not-NULL alternatives together - { - dst.code = VS_MIGHT_BE_NULL; - return true; - } - - if (VS_UNKNOWN == dst.code) - // no news is good news - return false; - - // let's over-approximate everything else - dst.code = VS_UNKNOWN; - return true; -} - -/** - * process unary instruction - * @param data state of computation per current function - * @param insn instruction you want to process - */ -void handleInsnUnop(Data &data, const TInsn insn) -{ - handleDerefs(data, insn); - - TOperand &dst = insn->operands[0]; - if (CL_OPERAND_VOID == dst.code || dst.accessor) - // we're interested only in direct manipulation of variables here - return; - - // resolve state of the variable - const TVar uid = varIdFromOperand(&dst); - VarState &vs = data.localState[uid]; - - const enum cl_unop_e code = static_cast(insn->subCode); - if (CL_UNOP_ASSIGN != code) { - // we abstract out everything but CL_UNOP_ASSIGN - vs.code = VS_UNKNOWN; - return; - } - - // resolve source operand of the instruction - TOperand &src = insn->operands[1]; - const struct cl_accessor *ac = src.accessor; - - if (seekRefAccessor(ac)) { - // assignment of address of an object implies not-NULL value - vs.code = VS_NOT_NULL; - vs.loc = &insn->loc; - return; - } - - if (ac || CL_TYPE_PTR != src.type->code) { - // we abstract out everything but pointers - vs.code = VS_UNKNOWN; - return; - } - - if (CL_OPERAND_CST == src.code) { - if (CL_TYPE_INT != src.data.cst.code || intCstFromOperand(&src)) { - vs.code = VS_UNKNOWN; - return; - } - - // looks like assignment of NULL to a variable - vs.code = VS_NULL; - vs.loc = &insn->loc; - return; - } - - // single assignment ... let's just propagate the value - const TVar uidSrc = varIdFromOperand(&src); - mergeValues(vs, data.localState[uidSrc]); -} - -/** - * handle comparison of a pointer with NULL - * @param data state of computation per current function - * @param vsDst reference to state of destination variable - * @param src the operand that is not NULL - * @param loc location info of the current instruction - * @param neg if true, we deal with !=; == otherwise - */ -bool handleInsnCmpNull( - Data &data, - VarState &vsDst, - TOperand *src, - const TLoc loc, - bool neg) -{ - if (src->accessor) - // we're interested only in direct manipulation of variables here - return false; - - if (CL_TYPE_PTR != src->type->code) - // we're interested only in pointers comparison here - return false; - - const TVar uidSrc = varIdFromOperand(src); - const VarState &vsSrc = data.localState[uidSrc]; - const EVarState code = vsSrc.code; - switch (code) { - case VS_NULL: - case VS_NULL_DEDUCED: - neg = !neg; - // fall through! - - case VS_NOT_NULL: - case VS_NOT_NULL_DEDUCED: - goto we_know; - - case VS_UNDEF: - case VS_UNKNOWN: - case VS_MIGHT_BE_NULL: - break; - - case VS_DEREF: - if (data.silent) - break; - CL_WARN_MSG(loc, "comparing pointer with NULL"); - CL_NOTE_MSG(vsSrc.loc, "the pointer was already dereferenced here"); - break; - - default: - CL_BREAK_IF("invalid call of handleInsnCmpNull()"); - } - - // now store the relation among the pointer and the result of the comparison - vsDst.code = (neg) - ? VS_NOT_NULL_IFF - : VS_NULL_IFF; - - vsDst.peer = uidSrc; - vsDst.loc = loc; - return true; - -we_know: - // we already know the result of the comparison at this point - vsDst.code = (neg) - ? VS_TRUE - : VS_FALSE; - - vsDst.loc = loc; - return true; -} - -/** - * process binary instruction - * @param data state of computation per current function - * @param insn instruction you want to process - */ -void handleInsnBinop(Data &data, const TInsn insn) -{ - const TOperandList &opList = insn->operands; - -#ifndef NDEBUG - // binary instructions are said to have no dereferences - // (better to check anyway) - for (TOperand &op : opList) { - const struct cl_accessor *ac = op.accessor; - CL_BREAK_IF(ac && ac->code == CL_ACCESSOR_DEREF); - } -#endif - - // resolve operands - TOperand &dst = opList[0]; - CL_BREAK_IF(dst.accessor); - const TVar uidDst = varIdFromOperand(&dst); - VarState &vs = data.localState[uidDst]; - - TOperand &src1 = opList[1]; - TOperand &src2 = opList[2]; - TOperand *src; - - // now check the actual type of the binary instruction - const enum cl_binop_e code = static_cast(insn->subCode); - switch (code) { - case CL_BINOP_EQ: - case CL_BINOP_NE: - // these are the only instruction we're interested in - break; - - default: - goto who_knows; - } - - if (CL_OPERAND_CST != src1.code && CL_OPERAND_CST != src2.code) - // we take only comparison with NULL - goto who_knows; - - if (CL_OPERAND_CST == src1.code) { - if (CL_TYPE_INT != src1.data.cst.code || intCstFromOperand(&src1)) - // not NULL, sorry - goto who_knows; - - src = &src2; - } - else /* if (CL_OPERAND_CST == src2.code) */ { - if (CL_TYPE_INT != src2.data.cst.code || intCstFromOperand(&src2)) - // not NULL, sorry - goto who_knows; - - src = &src1; - } - - if (handleInsnCmpNull(data, vs, src, &insn->loc, (CL_BINOP_NE == code))) - // properly handled pointer comparison with NULL - return; - -who_knows: - vs.code = VS_UNKNOWN; -} - -/** - * process call instruction - * @param data state of computation per current function - * @param insn instruction you want to process - */ -void handleInsnCall(Data &data, const TInsn insn) -{ - TOperand &dst = insn->operands[0]; - if (dst.accessor) - // we're interested only in direct manipulation of variables here - return; - - if (CL_OPERAND_VAR != dst.code) - return; - - // abstract out the return value - const TVar uid = varIdFromOperand(&dst); - VarState &vs = data.localState[uid]; - vs.code = VS_UNKNOWN; -} - -/** - * abstract out any reasoning in case of direct reference of an operand - * @param state state valid per current instruction - * @param opList list of operands to check for direct references - */ -void treatRefAsSideEffect( - TState &state, - TOperandList &opList) -{ - // for each operand - for (TOperand &op : opList) { - if (CL_OPERAND_VAR != op.code) - // not a variable - continue; - - const struct cl_accessor *ac = op.accessor; - if (!ac || ac->code != CL_ACCESSOR_REF) - // not a direct reference - continue; - - // kill any up to now reasoning about the variable - const TVar uid = varIdFromOperand(&op); - state[uid].code = VS_UNKNOWN; - } -} - -/** - * process a nonterminal instruction - * @param data state of computation per current function - * @param insn instruction you want to process - */ -void handleInsnNonterm(Data &data, const TInsn insn) -{ - treatRefAsSideEffect(data.localState, insn->operands); - - const enum cl_insn_e code = insn->code; - switch (code) { - case CL_INSN_UNOP: - handleInsnUnop(data, insn); - return; - - case CL_INSN_BINOP: - handleInsnBinop(data, insn); - return; - - case CL_INSN_CALL: - handleInsnCall(data, insn); - break; - - case CL_INSN_LABEL: - // should be safe to ignore - break; - - default: - CL_BREAK_IF("unhandled insn in handleInsnNonterm()"); - } -} - -/** - * merge states (used for Y nodes of CFG) - * @param data state of computation per current function - * @param state state valid per current instruction - * @param block block that determines the target state that is about to be - * updated - */ -void updateState( - Data &data, - const TState &state, - const TBlock block) -{ - // target state - TState &dstState = data.stateMap[block]; - - // for each variable - bool changed = false; - for (TState::const_reference item : state) { - if (mergeValues(dstState[item.first], item.second)) - changed = true; - } - - if (changed && data.todoLookup.insert(block)./* not already in */second) - data.todo.push(block); -} - -/** - * replace state of the branch-by variable by VS_NULL_DEDUCED or - * VS_NOT_NULL_DEDUCED - * @param state state valid per current instruction - * @param uid CodeStorage uid of the branch-by variable - * @param val true in 'then' branch, false in 'else' branch - */ -void replaceInBranch(TState &state, const TVar uid, bool val) -{ - VarState &vs = state[uid]; - bool isNull; - - const EVarState code = vs.code; - switch (code) { - case VS_NULL_IFF: - isNull = val; - break; - - case VS_NOT_NULL_IFF: - isNull = !val; - break; - - case VS_UNKNOWN: - // giving up - return; - - default: - CL_BREAK_IF("invalid call of replaceInBranch()"); - return; - } - - // kill the pending condition predicate - vs.code = VS_UNDEF; - - // update state of the pointer accordingly - VarState &vsPeer = state[vs.peer]; - vsPeer.loc = vs.loc; - vsPeer.code = (isNull) - ? VS_NULL_DEDUCED - : VS_NOT_NULL_DEDUCED; -} - -/** - * handle a condition for which we don't know the branch-by value - * @param data state of computation per current function - * @param state state valid per current instruction - * @param cond branch-by variable given as operand - * @param targets then/else targets of the condition - */ -void handleInsnCondNondet( - Data &data, - const TState &state, - TOperand &cond, - TTargetList &targets) -{ - // local copies of the state - TState stateThen(state); - TState stateElse(state); - - // reflect the value of branch-by variable (if possible) - const TVar uid = varIdFromOperand(&cond); - replaceInBranch(stateThen, uid, true); - replaceInBranch(stateElse, uid, false); - - // go to both targets and update the state there - updateState(data, stateThen, targets[0]); - updateState(data, stateElse, targets[1]); -} - -/** - * @param data state of computation per current function - * @param insn conditional instruction you want to process - */ -void handleInsnCond( - Data &data, - const TInsn insn) -{ - // resolve branch-by operand - TOperand &cond = insn->operands[0]; - TState &state = data.localState; - const TVar uid = varIdFromOperand(&cond); - const VarState &vs = state[uid]; - - // now check if we know the value - const EVarState code = vs.code; - switch (code) { - case VS_TRUE: - updateState(data, state, insn->targets[0]); - return; - - case VS_FALSE: - updateState(data, state, insn->targets[1]); - return; - - default: - handleInsnCondNondet(data, state, cond, insn->targets); - return; - } -} - -/** - * process a terminal instruction - * @param data state of computation per current function - * @param insn instruction you want to process - */ -void handleInsnTerm( - Data &data, - const TInsn insn) -{ - const enum cl_insn_e code = insn->code; - switch (code) { - case CL_INSN_COND: - handleInsnCond(data, insn); - return; - - case CL_INSN_JMP: - // just update the target state and check if anything has changed - updateState(data, data.localState, insn->targets[0]); - return; - - case CL_INSN_RET: - case CL_INSN_ABORT: - // we're not interested in such instructions here - return; - - default: - CL_BREAK_IF("invalid call of handleInsnTerm()"); - } -} - -void handleBlock(Data &data, const TBlock bb) -{ - // go through the sequence of instructions of the current basic block - data.localState = data.stateMap[bb]; - for (const TInsn insn : *bb) { - if (cl_is_term_insn(insn->code)) - // terminal instruction - handleInsnTerm(data, insn); - - else - // nonterminal instruction - handleInsnNonterm(data, insn); - } -} - -void handleFnc(const CodeStorage::Fnc &fnc) -{ - Data data; - Data::TSched &todo = data.todo; - const CodeStorage::ControlFlow &cfg = fnc.cfg; - - // block-level scheduler - TBlock bb = cfg.entry(); - todo.push(bb); - data.todoLookup.insert(bb); - while (!todo.empty()) { - bb = todo.front(); - todo.pop(); - if (1 != data.todoLookup.erase(bb)) - CL_BREAK_IF("BlockScheduler malfunction"); - - // process one basic block - CL_BREAK_IF(!bb || !bb->size()); - const TInsn insn = bb->front(); - CL_DEBUG_MSG(&insn->loc, "analyzing block " << bb->name() << "..."); - handleBlock(data, bb); - } - - // finally report all errors/warning over the already computed fixed-point - data.silent = false; - for (const TBlock bb : cfg) - handleBlock(data, bb); -} - -// ///////////////////////////////////////////////////////////////////////////// -// see easy.hh for details -void clEasyRun(const CodeStorage::Storage &stor, const char *) -{ - using namespace CodeStorage; - - for (const Fnc *pFnc : stor.callGraph.topOrder) { - const Fnc &fnc = *pFnc; - if (!isDefined(fnc)) - continue; - - const struct cl_loc *loc = locationOf(fnc); - CL_DEBUG_MSG(loc, "analyzing function " << nameOf(fnc) << "()..."); - - handleFnc(fnc); - } -} diff --git a/fwnull/config.h b/fwnull/config.h deleted file mode 100644 index efc5cb8a7..000000000 --- a/fwnull/config.h +++ /dev/null @@ -1,26 +0,0 @@ -/* - * Copyright (C) 2010 Kamil Dudka - * - * This file is part of predator. - * - * predator is free software: you can redistribute it and/or modify - * it under the terms of the GNU General Public License as published by - * the Free Software Foundation, either version 3 of the License, or - * any later version. - * - * predator is distributed in the hope that it will be useful, - * but WITHOUT ANY WARRANTY; without even the implied warranty of - * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the - * GNU General Public License for more details. - * - * You should have received a copy of the GNU General Public License - * along with predator. If not, see . - */ - -/** - * @file config.h - * various compile-time options - */ - -#define GIT_SHA1 fwnull_git_sha1 -#include "trap.h" diff --git a/fwnull/probe.sh b/fwnull/probe.sh deleted file mode 100755 index c7cdb0d0a..000000000 --- a/fwnull/probe.sh +++ /dev/null @@ -1,188 +0,0 @@ -#!/bin/bash -export SELF="$0" - -# basic setup -topdir="`dirname "$(readlink -f "$SELF")"`/.." -export FWNULL_PLUG="$topdir/fwnull_build/libfwnull.so" -export GCC_HOST="$topdir/gcc-install/bin/gcc" - -export LC_ALL=C -export CCACHE_DISABLE=1 -export TIMEOUT="timeout 4" - -CFLAGS="$CFLAGS -S -o /dev/null -O0 -m32" - -export MSG_INTERNAL_ERROR='internal compiler error' -export MSG_LINKING_PROB='linker input file unused because linking not done' -export MSG_OUR_WARNINGS='\[-fplugin=libfwnull.so\]$' -export MSG_SIGNALLED=': note: signalled to die' -export MSG_SOME_ERROR='error: .* has detected some errors' -export MSG_SOME_WARNINGS='warning: .* has reported some warnings' -export MSG_TIME_ELAPSED=': note: clEasyRun\(\) took ' - -# check whether stdout is connected to a terminal -if tty 0>&1 >/dev/null; then - # initialize coloring escape sequences - export R="\033[1;31m" - export G="\033[1;32m" - export Y="\033[1;33m" - export B="\033[1;34m" - export N="\033[0m" -fi - -die() { - printf "%s: %s\n" "$SELF" "$*" >&2 - exit 1 -} - -usage() { - printf "Usage: %s test-00.c [test-01.c [...]]\n" "$SELF" >&2 - exit 1 -} - -test -r "$1" || usage - -# try to run gcc -$TIMEOUT "$GCC_HOST" --version >&2 \ - || die "unable to run gcc: $TIMEOUT $GCC_HOST --version" - -# check the presence of libfwnull.so -test -r "$FWNULL_PLUG" || die "libfwnull.so not found: $FWNULL_PLUG" - -wait_for_pid() { - while test -d /proc/$1; do - sleep .0625 - EC=$? - if test 127 -le $EC; then - exit $EC - fi - done -} - -forward_signal() { - if test -r "$GCC_PID_FILE"; then - GCC_PID="$(<"$1")" - test 0 -lt "$GCC_PID" || return - printf "\nkilling %d by SIG%s ... " "$GCC_PID" "$2" >&2 - kill "-$2" "$GCC_PID" 2>/dev/null - - # wait for the compiler - wait_for_pid "$GCC_PID" - printf "done\n" >&2 - - else - # no gcc running? - printf "\ngot SIG%s while there was no gcc running, time to leave...\n"\ - "$2" >&2 - exit 1 - fi -} - -match() { - grep "$@" >/dev/null - return $? -} - -handle_output() { - # count errors - ERRORS="$(grep ': error: ' "$1" | wc -l)" - if match "$MSG_SOME_ERROR" "$1"; then - ERRORS=$(expr $ERRORS - 1) - fi - - # count warnings - WARNINGS="$(grep ': warning: ' "$1" | wc -l)" - if match "$MSG_SOME_WARNINGS" "$1"; then - WARNINGS=$(expr $WARNINGS - 1) - fi - - if match "$MSG_INTERNAL_ERROR" "$1"; then - printf "${R}internal error${N} " - - elif test 0 -lt $ERRORS; then - printf "${R}%d error(s)${N} " $ERRORS - - elif match "$MSG_SIGNALLED" "$1"; then - printf "${R}signalled to die${N} " - - elif test 0 -lt $WARNINGS; then - OUR_WARNINGS="`grep "$MSG_OUR_WARNINGS" "$1" | grep ': warning: ' \ - | wc -l`" - - if test 0 -eq "$OUR_WARNINGS";then - printf "${B}gcc warnings only${N} " - else - printf "${Y}%d warning(s)${N} " $WARNINGS - fi - - elif test 0 -eq "$2"; then - if echo "$1" | match -E "BUG|unsafe"; then - printf "${R}[seems broken]${N} " - fi - printf "${G}proven safe${N} " - - else - printf "${R}exit code was %d${N} " "$2" - fi - - # print timing information and memory usage if available - if match -E "$MSG_TIME_ELAPSED" "$1"; then - TIME_ELAPSED="`grep -E "$MSG_TIME_ELAPSED" "$1" \ - | sed -r "s|^.*${MSG_TIME_ELAPSED}([0-9.]+ s).*$|\\1|"`" - printf "\t%12s" "$TIME_ELAPSED" - fi -} - -try_one() { - SRC="$1" - BARE_GCC_OUT="$2" - PREDATOR_OUT="$3" - GCC_PID_FILE="$1.pid" - - trap "rm -f '$GCC_PID_FILE'; printf '\n'" RETURN - trap "forward_signal '$GCC_PID_FILE' INT" SIGINT - trap "forward_signal '$GCC_PID_FILE' QUIT; exit 130" SIGQUIT - trap "forward_signal '$GCC_PID_FILE' TERM; exit 142" SIGTERM - - CMD="$TIMEOUT $GCC_HOST $CFLAGS $SRC" - if eval "$CMD" >"$BARE_GCC_OUT" 2>&1; then - if match "$MSG_LINKING_PROB" "$BARE_GCC_OUT"; then - printf "${R}attempt to run linker${N}" - return 1 - fi - - # turn on the plug-in - CMD="$CMD -fplugin=$FWNULL_PLUG" - - # run in background so that we can kill it easily - CMD="$CMD -fplugin-arg-libfwnull-pid-file=$GCC_PID_FILE &" - - # run the job now! - eval "$CMD" > "$PREDATOR_OUT" 2>&1 - - # wait for the subshell - wait $! - STATUS=$? - - if test -r "$GCC_PID_FILE"; then - # wait for the compiler - GCC_PID="$(<"$GCC_PID_FILE")" - wait_for_pid "$GCC_PID" - fi - - handle_output "$PREDATOR_OUT" "$STATUS" - - if test 127 -le $STATUS; then - printf "\n" >&2 - fi - else - printf "${R}compilation failed${N}" - fi -} - -while test -n "$1"; do - short_name="`basename "$(dirname "$1")"`/`basename "$1"`" - printf '%s\t%-48s\t' "`date +'%Y-%m-%d %H:%M:%S'`" "$short_name" - try_one "$1" "$1-bare-gcc.err" "$1-fwnull.err" - shift -done diff --git a/fwnull/sync.sh b/fwnull/sync.sh deleted file mode 100644 index 7bcd7e553..000000000 --- a/fwnull/sync.sh +++ /dev/null @@ -1,35 +0,0 @@ -#!/bin/sh - -# check whether stdout is connected to a terminal -if tty 0>&1 >/dev/null; then - # initialize coloring escape sequences - export R="\033[1;31m" - export G="\033[1;32m" - export Y="\033[1;33m" - export B="\033[1;34m" - export N="\033[0m" -fi - -printf "${R}ATTENTION:${N} This script is not intended to be run !!! -Please do not commit the generated files to prevent a disaster...\n" - -do_sync() { - ./probe.sh $1 - printf "\n${B}Processing the results...${N}\n" >&2 - for i in $1; do - c="$(printf %s "$i" | sed 's|\.c$||')" - raw="${i}-fwnull.err" - err="${c}.err$2" - grep '\[-fplugin=libfwnull\.so\]$' "$raw" \ - | grep -v 'note: .*\[internal location\]' \ - | sed 's| \[-fplugin=libfwnull\.so\]$||' \ - | sed 's|^[^:]*/||' \ - > "$err" - - rm -f "$raw" "${i}-bare-gcc.err" - done - printf "\n\n" >&2 -} - -printf "\n${G}Basic analysis...${N}\n" >&2 -do_sync "$*" diff --git a/fwnull/trap.h b/fwnull/trap.h deleted file mode 120000 index a46d5d278..000000000 --- a/fwnull/trap.h +++ /dev/null @@ -1 +0,0 @@ -../cl/trap.h \ No newline at end of file diff --git a/fwnull/version.c b/fwnull/version.c deleted file mode 100644 index 101025cdb..000000000 --- a/fwnull/version.c +++ /dev/null @@ -1,24 +0,0 @@ -/* - * Copyright (C) 2010 Kamil Dudka - * - * This file is part of predator. - * - * predator is free software: you can redistribute it and/or modify - * it under the terms of the GNU General Public License as published by - * the Free Software Foundation, either version 3 of the License, or - * any later version. - * - * predator is distributed in the hope that it will be useful, - * but WITHOUT ANY WARRANTY; without even the implied warranty of - * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the - * GNU General Public License for more details. - * - * You should have received a copy of the GNU General Public License - * along with predator. If not, see . - */ - -#include "config.h" -#include "version.h" - -// see the comment in config.h for details -const char *fwnull_git_sha1 = FWNULL_GIT_SHA1;