8245610: remove in-tree copy on gtest
Reviewed-by: erikj, ihse
This commit is contained in:
parent
5374383dcd
commit
846fd238fc
@ -495,6 +495,11 @@
|
|||||||
<h2 id="running-tests">Running Tests</h2>
|
<h2 id="running-tests">Running Tests</h2>
|
||||||
<p>Most of the JDK tests are using the <a href="http://openjdk.java.net/jtreg">JTReg</a> test framework. Make sure that your configuration knows where to find your installation of JTReg. If this is not picked up automatically, use the <code>--with-jtreg=<path to jtreg home></code> option to point to the JTReg framework. Note that this option should point to the JTReg home, i.e. the top directory, containing <code>lib/jtreg.jar</code> etc.</p>
|
<p>Most of the JDK tests are using the <a href="http://openjdk.java.net/jtreg">JTReg</a> test framework. Make sure that your configuration knows where to find your installation of JTReg. If this is not picked up automatically, use the <code>--with-jtreg=<path to jtreg home></code> option to point to the JTReg framework. Note that this option should point to the JTReg home, i.e. the top directory, containing <code>lib/jtreg.jar</code> etc.</p>
|
||||||
<p>The <a href="https://wiki.openjdk.java.net/display/Adoption">Adoption Group</a> provides recent builds of jtreg <a href="https://ci.adoptopenjdk.net/view/Dependencies/job/jtreg/lastSuccessfulBuild/artifact">here</a>. Download the latest <code>.tar.gz</code> file, unpack it, and point <code>--with-jtreg</code> to the <code>jtreg</code> directory that you just unpacked.</p>
|
<p>The <a href="https://wiki.openjdk.java.net/display/Adoption">Adoption Group</a> provides recent builds of jtreg <a href="https://ci.adoptopenjdk.net/view/Dependencies/job/jtreg/lastSuccessfulBuild/artifact">here</a>. Download the latest <code>.tar.gz</code> file, unpack it, and point <code>--with-jtreg</code> to the <code>jtreg</code> directory that you just unpacked.</p>
|
||||||
|
<p>Building of Hotspot Gtest suite requires the source code of Google Test framework. The top directory, which contains both <code>googletest</code> and <code>googlemock</code> directories, should be specified via <code>--with-gtest</code>. The supported version of Google Test is 1.8.1, whose source code can be obtained:</p>
|
||||||
|
<ul>
|
||||||
|
<li>by downloading and unpacking the source bundle from <a href="https://github.com/google/googletest/releases/tag/release-1.8.1">here</a></li>
|
||||||
|
<li>or by checking out <code>release-1.8.1</code> tag of <code>googletest</code> project: <code>git clone -b release-1.8.1 https://github.com/google/googletest</code></li>
|
||||||
|
</ul>
|
||||||
<p>To execute the most basic tests (tier 1), use:</p>
|
<p>To execute the most basic tests (tier 1), use:</p>
|
||||||
<pre><code>make run-test-tier1</code></pre>
|
<pre><code>make run-test-tier1</code></pre>
|
||||||
<p>For more details on how to run tests, please see the <a href="testing.html">Testing the JDK</a> document.</p>
|
<p>For more details on how to run tests, please see the <a href="testing.html">Testing the JDK</a> document.</p>
|
||||||
|
@ -829,6 +829,14 @@ https://ci.adoptopenjdk.net/view/Dependencies/job/jtreg/lastSuccessfulBuild/arti
|
|||||||
Download the latest `.tar.gz` file, unpack it, and point `--with-jtreg` to the
|
Download the latest `.tar.gz` file, unpack it, and point `--with-jtreg` to the
|
||||||
`jtreg` directory that you just unpacked.
|
`jtreg` directory that you just unpacked.
|
||||||
|
|
||||||
|
Building of Hotspot Gtest suite requires the source code of Google Test framework.
|
||||||
|
The top directory, which contains both `googletest` and `googlemock`
|
||||||
|
directories, should be specified via `--with-gtest`.
|
||||||
|
The supported version of Google Test is 1.8.1, whose source code can be obtained:
|
||||||
|
|
||||||
|
* by downloading and unpacking the source bundle from [here](https://github.com/google/googletest/releases/tag/release-1.8.1)
|
||||||
|
* or by checking out `release-1.8.1` tag of `googletest` project: `git clone -b release-1.8.1 https://github.com/google/googletest`
|
||||||
|
|
||||||
To execute the most basic tests (tier 1), use:
|
To execute the most basic tests (tier 1), use:
|
||||||
```
|
```
|
||||||
make run-test-tier1
|
make run-test-tier1
|
||||||
|
@ -652,7 +652,7 @@ $(eval $(call SetupTarget, test-image-hotspot-jtreg-graal, \
|
|||||||
DEPS := build-test-hotspot-jtreg-graal, \
|
DEPS := build-test-hotspot-jtreg-graal, \
|
||||||
))
|
))
|
||||||
|
|
||||||
ifeq ($(BUILD_GTEST), true)
|
ifneq ($GTEST_FRAMEWORK_SRC), )
|
||||||
$(eval $(call SetupTarget, test-image-hotspot-gtest, \
|
$(eval $(call SetupTarget, test-image-hotspot-gtest, \
|
||||||
MAKEFILE := hotspot/test/GtestImage, \
|
MAKEFILE := hotspot/test/GtestImage, \
|
||||||
DEPS := hotspot, \
|
DEPS := hotspot, \
|
||||||
@ -1109,7 +1109,7 @@ ifneq ($(JVM_TEST_IMAGE_TARGETS), )
|
|||||||
test-image: $(JVM_TEST_IMAGE_TARGETS)
|
test-image: $(JVM_TEST_IMAGE_TARGETS)
|
||||||
else
|
else
|
||||||
test-image: test-image-hotspot-jtreg-native
|
test-image: test-image-hotspot-jtreg-native
|
||||||
ifeq ($(BUILD_GTEST), true)
|
ifneq ($(GTEST_FRAMEWORK_SRC), )
|
||||||
test-image: test-image-hotspot-gtest
|
test-image: test-image-hotspot-gtest
|
||||||
endif
|
endif
|
||||||
|
|
||||||
|
@ -82,7 +82,6 @@ SHELL := $(BASH) $(BASH_ARGS)
|
|||||||
# Set some reasonable defaults for features
|
# Set some reasonable defaults for features
|
||||||
DEBUG_LEVEL := release
|
DEBUG_LEVEL := release
|
||||||
HOTSPOT_DEBUG_LEVEL := release
|
HOTSPOT_DEBUG_LEVEL := release
|
||||||
BUILD_GTEST := true
|
|
||||||
BUILD_FAILURE_HANDLER := true
|
BUILD_FAILURE_HANDLER := true
|
||||||
|
|
||||||
################################################################################
|
################################################################################
|
||||||
|
@ -91,9 +91,6 @@ DISABLE_WARNING_PREFIX := @BUILD_CC_DISABLE_WARNING_PREFIX@
|
|||||||
# Save speed and disk space by not enabling debug symbols for the buildjdk
|
# Save speed and disk space by not enabling debug symbols for the buildjdk
|
||||||
ENABLE_DEBUG_SYMBOLS := false
|
ENABLE_DEBUG_SYMBOLS := false
|
||||||
|
|
||||||
# Control whether Hotspot builds gtest tests
|
|
||||||
BUILD_GTEST := false
|
|
||||||
|
|
||||||
JVM_VARIANTS := server
|
JVM_VARIANTS := server
|
||||||
JVM_VARIANT_MAIN := server
|
JVM_VARIANT_MAIN := server
|
||||||
JVM_FEATURES_server := cds compiler1 compiler2 g1gc serialgc
|
JVM_FEATURES_server := cds compiler1 compiler2 g1gc serialgc
|
||||||
|
@ -234,7 +234,6 @@ LIB_SETUP_LIBRARIES
|
|||||||
JVM_FEATURES_PARSE_OPTIONS
|
JVM_FEATURES_PARSE_OPTIONS
|
||||||
JVM_FEATURES_SETUP
|
JVM_FEATURES_SETUP
|
||||||
|
|
||||||
HOTSPOT_ENABLE_DISABLE_GTEST
|
|
||||||
HOTSPOT_SETUP_MISC
|
HOTSPOT_SETUP_MISC
|
||||||
|
|
||||||
###############################################################################
|
###############################################################################
|
||||||
|
@ -111,28 +111,6 @@ AC_DEFUN_ONCE([HOTSPOT_SETUP_JVM_VARIANTS],
|
|||||||
AC_SUBST(JVM_VARIANT_MAIN)
|
AC_SUBST(JVM_VARIANT_MAIN)
|
||||||
])
|
])
|
||||||
|
|
||||||
###############################################################################
|
|
||||||
# Check if gtest should be built
|
|
||||||
#
|
|
||||||
AC_DEFUN_ONCE([HOTSPOT_ENABLE_DISABLE_GTEST],
|
|
||||||
[
|
|
||||||
GTEST_AVAILABLE=true
|
|
||||||
|
|
||||||
AC_MSG_CHECKING([if Hotspot gtest test source is present])
|
|
||||||
if test -e "${TOPDIR}/test/hotspot/gtest"; then
|
|
||||||
AC_MSG_RESULT([yes])
|
|
||||||
else
|
|
||||||
AC_MSG_RESULT([no, cannot build gtest])
|
|
||||||
GTEST_AVAILABLE=false
|
|
||||||
fi
|
|
||||||
|
|
||||||
UTIL_ARG_ENABLE(NAME: hotspot-gtest, DEFAULT: auto,
|
|
||||||
RESULT: BUILD_GTEST, AVAILABLE: $GTEST_AVAILABLE,
|
|
||||||
DEFAULT_DESC: [enabled if possible to build],
|
|
||||||
DESC: [enable building of the Hotspot unit tests])
|
|
||||||
AC_SUBST(BUILD_GTEST)
|
|
||||||
])
|
|
||||||
|
|
||||||
###############################################################################
|
###############################################################################
|
||||||
# Misc hotspot setup that does not fit elsewhere.
|
# Misc hotspot setup that does not fit elsewhere.
|
||||||
#
|
#
|
||||||
@ -162,4 +140,7 @@ AC_DEFUN_ONCE([HOTSPOT_SETUP_MISC],
|
|||||||
|
|
||||||
# --with-cpu-port is no longer supported
|
# --with-cpu-port is no longer supported
|
||||||
UTIL_DEPRECATED_ARG_WITH(with-cpu-port)
|
UTIL_DEPRECATED_ARG_WITH(with-cpu-port)
|
||||||
|
|
||||||
|
# in jdk15 hotspot-gtest was replaced with --with-gtest
|
||||||
|
UTIL_DEPRECATED_ARG_ENABLE(hotspot-gtest)
|
||||||
])
|
])
|
||||||
|
@ -1,5 +1,5 @@
|
|||||||
#
|
#
|
||||||
# Copyright (c) 2018, Oracle and/or its affiliates. All rights reserved.
|
# Copyright (c) 2018, 2020, Oracle and/or its affiliates. All rights reserved.
|
||||||
# DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
|
# DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
|
||||||
#
|
#
|
||||||
# This code is free software; you can redistribute it and/or modify it
|
# This code is free software; you can redistribute it and/or modify it
|
||||||
@ -55,6 +55,39 @@ AC_DEFUN_ONCE([LIB_TESTS_SETUP_GRAALUNIT],
|
|||||||
AC_SUBST(GRAALUNIT_LIB)
|
AC_SUBST(GRAALUNIT_LIB)
|
||||||
])
|
])
|
||||||
|
|
||||||
|
###############################################################################
|
||||||
|
#
|
||||||
|
# Setup and check for gtest framework source files
|
||||||
|
#
|
||||||
|
AC_DEFUN_ONCE([LIB_TESTS_SETUP_GTEST],
|
||||||
|
[
|
||||||
|
AC_ARG_WITH(gtest, [AS_HELP_STRING([--with-gtest],
|
||||||
|
[specify prefix directory for the gtest framework])])
|
||||||
|
|
||||||
|
if test "x${with_gtest}" != x; then
|
||||||
|
AC_MSG_CHECKING([for gtest])
|
||||||
|
if test "x${with_gtest}" = xno; then
|
||||||
|
AC_MSG_RESULT([no, disabled])
|
||||||
|
elif test "x${with_gtest}" = xyes; then
|
||||||
|
AC_MSG_RESULT([no, error])
|
||||||
|
AC_MSG_ERROR([--with-gtest must have a value])
|
||||||
|
else
|
||||||
|
if ! test -s "${with_gtest}/googletest/include/gtest/gtest.h"; then
|
||||||
|
AC_MSG_RESULT([no])
|
||||||
|
AC_MSG_ERROR([Can't find 'googletest/include/gtest/gtest.h' under ${with_gtest} given with the --with-gtest option.])
|
||||||
|
elif ! test -s "${with_gtest}/googlemock/include/gmock/gmock.h"; then
|
||||||
|
AC_MSG_RESULT([no])
|
||||||
|
AC_MSG_ERROR([Can't find 'googlemock/include/gmock/gmock.h' under ${with_gtest} given with the --with-gtest option.])
|
||||||
|
else
|
||||||
|
GTEST_FRAMEWORK_SRC=${with_gtest}
|
||||||
|
AC_MSG_RESULT([$GTEST_FRAMEWORK_SRC])
|
||||||
|
fi
|
||||||
|
fi
|
||||||
|
fi
|
||||||
|
|
||||||
|
AC_SUBST(GTEST_FRAMEWORK_SRC)
|
||||||
|
])
|
||||||
|
|
||||||
###############################################################################
|
###############################################################################
|
||||||
#
|
#
|
||||||
# Setup and check the Java Microbenchmark Harness
|
# Setup and check the Java Microbenchmark Harness
|
||||||
|
@ -102,6 +102,7 @@ AC_DEFUN_ONCE([LIB_SETUP_LIBRARIES],
|
|||||||
LIB_SETUP_BUNDLED_LIBS
|
LIB_SETUP_BUNDLED_LIBS
|
||||||
LIB_SETUP_MISC_LIBS
|
LIB_SETUP_MISC_LIBS
|
||||||
LIB_TESTS_SETUP_GRAALUNIT
|
LIB_TESTS_SETUP_GRAALUNIT
|
||||||
|
LIB_TESTS_SETUP_GTEST
|
||||||
|
|
||||||
BASIC_JDKLIB_LIBS=""
|
BASIC_JDKLIB_LIBS=""
|
||||||
if test "x$TOOLCHAIN_TYPE" != xmicrosoft; then
|
if test "x$TOOLCHAIN_TYPE" != xmicrosoft; then
|
||||||
|
@ -292,9 +292,6 @@ JVM_FEATURES_custom := @JVM_FEATURES_custom@
|
|||||||
VALID_JVM_FEATURES := @VALID_JVM_FEATURES@
|
VALID_JVM_FEATURES := @VALID_JVM_FEATURES@
|
||||||
VALID_JVM_VARIANTS := @VALID_JVM_VARIANTS@
|
VALID_JVM_VARIANTS := @VALID_JVM_VARIANTS@
|
||||||
|
|
||||||
# Control whether Hotspot builds gtest tests
|
|
||||||
BUILD_GTEST := @BUILD_GTEST@
|
|
||||||
|
|
||||||
# Allow overriding the default hotspot library path
|
# Allow overriding the default hotspot library path
|
||||||
HOTSPOT_OVERRIDE_LIBPATH := @HOTSPOT_OVERRIDE_LIBPATH@
|
HOTSPOT_OVERRIDE_LIBPATH := @HOTSPOT_OVERRIDE_LIBPATH@
|
||||||
|
|
||||||
@ -392,6 +389,8 @@ JMH_JOPT_SIMPLE_JAR := @JMH_JOPT_SIMPLE_JAR@
|
|||||||
JMH_COMMONS_MATH_JAR := @JMH_COMMONS_MATH_JAR@
|
JMH_COMMONS_MATH_JAR := @JMH_COMMONS_MATH_JAR@
|
||||||
JMH_VERSION := @JMH_VERSION@
|
JMH_VERSION := @JMH_VERSION@
|
||||||
|
|
||||||
|
GTEST_FRAMEWORK_SRC := @GTEST_FRAMEWORK_SRC@
|
||||||
|
|
||||||
# Source file for cacerts
|
# Source file for cacerts
|
||||||
CACERTS_FILE=@CACERTS_FILE@
|
CACERTS_FILE=@CACERTS_FILE@
|
||||||
|
|
||||||
|
@ -404,7 +404,7 @@ var getJibProfilesProfiles = function (input, common, data) {
|
|||||||
"linux-x64": {
|
"linux-x64": {
|
||||||
target_os: "linux",
|
target_os: "linux",
|
||||||
target_cpu: "x64",
|
target_cpu: "x64",
|
||||||
dependencies: ["devkit", "graphviz", "pandoc", "graalunit_lib"],
|
dependencies: ["devkit", "gtest", "graphviz", "pandoc", "graalunit_lib"],
|
||||||
configure_args: concat(common.configure_args_64bit,
|
configure_args: concat(common.configure_args_64bit,
|
||||||
"--enable-full-docs", "--with-zlib=system",
|
"--enable-full-docs", "--with-zlib=system",
|
||||||
(isWsl(input) ? [ "--host=x86_64-unknown-linux-gnu",
|
(isWsl(input) ? [ "--host=x86_64-unknown-linux-gnu",
|
||||||
@ -416,7 +416,7 @@ var getJibProfilesProfiles = function (input, common, data) {
|
|||||||
target_os: "linux",
|
target_os: "linux",
|
||||||
target_cpu: "x86",
|
target_cpu: "x86",
|
||||||
build_cpu: "x64",
|
build_cpu: "x64",
|
||||||
dependencies: ["devkit"],
|
dependencies: ["devkit", "gtest"],
|
||||||
configure_args: concat(common.configure_args_32bit,
|
configure_args: concat(common.configure_args_32bit,
|
||||||
"--with-jvm-variants=minimal,server", "--with-zlib=system"),
|
"--with-jvm-variants=minimal,server", "--with-zlib=system"),
|
||||||
},
|
},
|
||||||
@ -424,7 +424,7 @@ var getJibProfilesProfiles = function (input, common, data) {
|
|||||||
"macosx-x64": {
|
"macosx-x64": {
|
||||||
target_os: "macosx",
|
target_os: "macosx",
|
||||||
target_cpu: "x64",
|
target_cpu: "x64",
|
||||||
dependencies: ["devkit", "pandoc", "graalunit_lib"],
|
dependencies: ["devkit", "gtest", "pandoc", "graalunit_lib"],
|
||||||
configure_args: concat(common.configure_args_64bit, "--with-zlib=system",
|
configure_args: concat(common.configure_args_64bit, "--with-zlib=system",
|
||||||
"--with-macosx-version-max=10.9.0"),
|
"--with-macosx-version-max=10.9.0"),
|
||||||
},
|
},
|
||||||
@ -432,7 +432,7 @@ var getJibProfilesProfiles = function (input, common, data) {
|
|||||||
"windows-x64": {
|
"windows-x64": {
|
||||||
target_os: "windows",
|
target_os: "windows",
|
||||||
target_cpu: "x64",
|
target_cpu: "x64",
|
||||||
dependencies: ["devkit", "pandoc", "graalunit_lib"],
|
dependencies: ["devkit", "gtest", "pandoc", "graalunit_lib"],
|
||||||
configure_args: concat(common.configure_args_64bit),
|
configure_args: concat(common.configure_args_64bit),
|
||||||
},
|
},
|
||||||
|
|
||||||
@ -440,7 +440,7 @@ var getJibProfilesProfiles = function (input, common, data) {
|
|||||||
target_os: "windows",
|
target_os: "windows",
|
||||||
target_cpu: "x86",
|
target_cpu: "x86",
|
||||||
build_cpu: "x64",
|
build_cpu: "x64",
|
||||||
dependencies: ["devkit"],
|
dependencies: ["devkit", "gtest"],
|
||||||
configure_args: concat(common.configure_args_32bit),
|
configure_args: concat(common.configure_args_32bit),
|
||||||
},
|
},
|
||||||
|
|
||||||
@ -448,7 +448,7 @@ var getJibProfilesProfiles = function (input, common, data) {
|
|||||||
target_os: "linux",
|
target_os: "linux",
|
||||||
target_cpu: "aarch64",
|
target_cpu: "aarch64",
|
||||||
build_cpu: "x64",
|
build_cpu: "x64",
|
||||||
dependencies: ["devkit", "build_devkit", "pandoc"],
|
dependencies: ["devkit", "gtest", "build_devkit", "pandoc"],
|
||||||
configure_args: [
|
configure_args: [
|
||||||
"--openjdk-target=aarch64-linux-gnu",
|
"--openjdk-target=aarch64-linux-gnu",
|
||||||
"--disable-jvm-feature-jvmci",
|
"--disable-jvm-feature-jvmci",
|
||||||
@ -461,7 +461,7 @@ var getJibProfilesProfiles = function (input, common, data) {
|
|||||||
target_os: "linux",
|
target_os: "linux",
|
||||||
target_cpu: "arm",
|
target_cpu: "arm",
|
||||||
build_cpu: "x64",
|
build_cpu: "x64",
|
||||||
dependencies: ["devkit", "build_devkit"],
|
dependencies: ["devkit", "gtest", "build_devkit"],
|
||||||
configure_args: [
|
configure_args: [
|
||||||
"--openjdk-target=arm-linux-gnueabihf", "--with-freetype=bundled",
|
"--openjdk-target=arm-linux-gnueabihf", "--with-freetype=bundled",
|
||||||
"--with-abi-profile=arm-vfp-hflt", "--disable-warnings-as-errors"
|
"--with-abi-profile=arm-vfp-hflt", "--disable-warnings-as-errors"
|
||||||
@ -472,7 +472,7 @@ var getJibProfilesProfiles = function (input, common, data) {
|
|||||||
target_os: "linux",
|
target_os: "linux",
|
||||||
target_cpu: "ppc64le",
|
target_cpu: "ppc64le",
|
||||||
build_cpu: "x64",
|
build_cpu: "x64",
|
||||||
dependencies: ["devkit", "build_devkit"],
|
dependencies: ["devkit", "gtest", "build_devkit"],
|
||||||
configure_args: [
|
configure_args: [
|
||||||
"--openjdk-target=ppc64le-linux-gnu", "--with-freetype=bundled",
|
"--openjdk-target=ppc64le-linux-gnu", "--with-freetype=bundled",
|
||||||
"--disable-warnings-as-errors"
|
"--disable-warnings-as-errors"
|
||||||
@ -483,7 +483,7 @@ var getJibProfilesProfiles = function (input, common, data) {
|
|||||||
target_os: "linux",
|
target_os: "linux",
|
||||||
target_cpu: "s390x",
|
target_cpu: "s390x",
|
||||||
build_cpu: "x64",
|
build_cpu: "x64",
|
||||||
dependencies: ["devkit", "build_devkit"],
|
dependencies: ["devkit", "gtest", "build_devkit"],
|
||||||
configure_args: [
|
configure_args: [
|
||||||
"--openjdk-target=s390x-linux-gnu", "--with-freetype=bundled",
|
"--openjdk-target=s390x-linux-gnu", "--with-freetype=bundled",
|
||||||
"--disable-warnings-as-errors"
|
"--disable-warnings-as-errors"
|
||||||
@ -538,7 +538,7 @@ var getJibProfilesProfiles = function (input, common, data) {
|
|||||||
"linux-x64-zero": {
|
"linux-x64-zero": {
|
||||||
target_os: "linux",
|
target_os: "linux",
|
||||||
target_cpu: "x64",
|
target_cpu: "x64",
|
||||||
dependencies: ["devkit"],
|
dependencies: ["devkit", "gtest"],
|
||||||
configure_args: concat(common.configure_args_64bit, [
|
configure_args: concat(common.configure_args_64bit, [
|
||||||
"--with-zlib=system",
|
"--with-zlib=system",
|
||||||
"--with-jvm-variants=zero",
|
"--with-jvm-variants=zero",
|
||||||
@ -550,7 +550,7 @@ var getJibProfilesProfiles = function (input, common, data) {
|
|||||||
target_os: "linux",
|
target_os: "linux",
|
||||||
target_cpu: "x86",
|
target_cpu: "x86",
|
||||||
build_cpu: "x64",
|
build_cpu: "x64",
|
||||||
dependencies: ["devkit"],
|
dependencies: ["devkit", "gtest"],
|
||||||
configure_args: concat(common.configure_args_32bit, [
|
configure_args: concat(common.configure_args_32bit, [
|
||||||
"--with-zlib=system",
|
"--with-zlib=system",
|
||||||
"--with-jvm-variants=zero",
|
"--with-jvm-variants=zero",
|
||||||
@ -573,7 +573,7 @@ var getJibProfilesProfiles = function (input, common, data) {
|
|||||||
"linux-x64-debug-nopch": {
|
"linux-x64-debug-nopch": {
|
||||||
target_os: "linux",
|
target_os: "linux",
|
||||||
target_cpu: "x64",
|
target_cpu: "x64",
|
||||||
dependencies: ["devkit"],
|
dependencies: ["devkit", "gtest"],
|
||||||
configure_args: concat(common.configure_args_64bit,
|
configure_args: concat(common.configure_args_64bit,
|
||||||
"--with-zlib=system", "--disable-precompiled-headers"),
|
"--with-zlib=system", "--disable-precompiled-headers"),
|
||||||
},
|
},
|
||||||
@ -1148,6 +1148,12 @@ var getJibProfilesDependencies = function (input, common) {
|
|||||||
configure_args: "--with-graalunit-lib=" + input.get("graalunit_lib", "install_path"),
|
configure_args: "--with-graalunit-lib=" + input.get("graalunit_lib", "install_path"),
|
||||||
environment_name: "GRAALUNIT_LIB"
|
environment_name: "GRAALUNIT_LIB"
|
||||||
},
|
},
|
||||||
|
|
||||||
|
gtest: {
|
||||||
|
organization: common.organization,
|
||||||
|
ext: "tar.gz",
|
||||||
|
revision: "1.8.1"
|
||||||
|
},
|
||||||
};
|
};
|
||||||
|
|
||||||
return dependencies;
|
return dependencies;
|
||||||
|
@ -27,7 +27,6 @@ $(eval $(call IncludeCustomExtension, hotspot/lib/CompileGtest.gmk))
|
|||||||
|
|
||||||
GTEST_TEST_SRC += $(TOPDIR)/test/hotspot/gtest
|
GTEST_TEST_SRC += $(TOPDIR)/test/hotspot/gtest
|
||||||
GTEST_LAUNCHER_SRC := $(TOPDIR)/test/hotspot/gtest/gtestLauncher.cpp
|
GTEST_LAUNCHER_SRC := $(TOPDIR)/test/hotspot/gtest/gtestLauncher.cpp
|
||||||
GTEST_FRAMEWORK_SRC := $(TOPDIR)/test/fmw/gtest
|
|
||||||
|
|
||||||
# On Windows, there are no internal debug symbols so must set copying to true
|
# On Windows, there are no internal debug symbols so must set copying to true
|
||||||
# to get any at all.
|
# to get any at all.
|
||||||
@ -39,6 +38,36 @@ endif
|
|||||||
|
|
||||||
################################################################################
|
################################################################################
|
||||||
|
|
||||||
|
# Disabling all warnings in gtest source code
|
||||||
|
|
||||||
|
$(eval $(call SetupNativeCompilation, BUILD_GTEST_LIBGTEST, \
|
||||||
|
NAME := gtest, \
|
||||||
|
TYPE := STATIC_LIBRARY, \
|
||||||
|
TOOLCHAIN := TOOLCHAIN_LINK_CXX, \
|
||||||
|
OUTPUT_DIR := $(JVM_OUTPUTDIR)/libgtest, \
|
||||||
|
OBJECT_DIR := $(JVM_OUTPUTDIR)/libgtest/objs, \
|
||||||
|
SRC := \
|
||||||
|
$(GTEST_FRAMEWORK_SRC)/googletest/src \
|
||||||
|
$(GTEST_FRAMEWORK_SRC)/googlemock/src, \
|
||||||
|
INCLUDE_FILES := gtest-all.cc gmock-all.cc, \
|
||||||
|
CFLAGS := $(filter-out $(WARNING_CFLAGS_JVM), $(JVM_CFLAGS)) \
|
||||||
|
-w \
|
||||||
|
-I$(GTEST_FRAMEWORK_SRC)/googletest \
|
||||||
|
-I$(GTEST_FRAMEWORK_SRC)/googletest/include \
|
||||||
|
-I$(GTEST_FRAMEWORK_SRC)/googlemock \
|
||||||
|
-I$(GTEST_FRAMEWORK_SRC)/googlemock/include, \
|
||||||
|
CFLAGS_windows := -EHsc, \
|
||||||
|
CFLAGS_macosx := -DGTEST_OS_MAC=1, \
|
||||||
|
OPTIMIZATION := $(JVM_OPTIMIZATION), \
|
||||||
|
COPY_DEBUG_SYMBOLS := $(GTEST_COPY_DEBUG_SYMBOLS), \
|
||||||
|
ZIP_EXTERNAL_DEBUG_SYMBOLS := false, \
|
||||||
|
STRIP_SYMBOLS := false, \
|
||||||
|
))
|
||||||
|
|
||||||
|
TARGETS += $(BUILD_GTEST_LIBGTEST)
|
||||||
|
|
||||||
|
################################################################################
|
||||||
|
|
||||||
ifeq ($(call isTargetOs, windows), true)
|
ifeq ($(call isTargetOs, windows), true)
|
||||||
GTEST_JVM_MAPFILE := $(JVM_MAPFILE)
|
GTEST_JVM_MAPFILE := $(JVM_MAPFILE)
|
||||||
else
|
else
|
||||||
@ -64,15 +93,10 @@ $(eval $(call SetupNativeCompilation, BUILD_GTEST_LIBJVM, \
|
|||||||
EXCLUDES := $(JVM_EXCLUDES), \
|
EXCLUDES := $(JVM_EXCLUDES), \
|
||||||
EXCLUDE_FILES := gtestLauncher.cpp, \
|
EXCLUDE_FILES := gtestLauncher.cpp, \
|
||||||
EXCLUDE_PATTERNS := $(JVM_EXCLUDE_PATTERNS), \
|
EXCLUDE_PATTERNS := $(JVM_EXCLUDE_PATTERNS), \
|
||||||
EXTRA_FILES := \
|
|
||||||
$(GTEST_FRAMEWORK_SRC)/googletest/src/gtest-all.cc \
|
|
||||||
$(GTEST_FRAMEWORK_SRC)/googlemock/src/gmock-all.cc, \
|
|
||||||
EXTRA_OBJECT_FILES := $(filter-out %/operator_new$(OBJ_SUFFIX), \
|
EXTRA_OBJECT_FILES := $(filter-out %/operator_new$(OBJ_SUFFIX), \
|
||||||
$(BUILD_LIBJVM_ALL_OBJS)), \
|
$(BUILD_LIBJVM_ALL_OBJS)), \
|
||||||
CFLAGS := $(JVM_CFLAGS) \
|
CFLAGS := $(JVM_CFLAGS) \
|
||||||
-I$(GTEST_FRAMEWORK_SRC)/googletest \
|
|
||||||
-I$(GTEST_FRAMEWORK_SRC)/googletest/include \
|
-I$(GTEST_FRAMEWORK_SRC)/googletest/include \
|
||||||
-I$(GTEST_FRAMEWORK_SRC)/googlemock \
|
|
||||||
-I$(GTEST_FRAMEWORK_SRC)/googlemock/include \
|
-I$(GTEST_FRAMEWORK_SRC)/googlemock/include \
|
||||||
$(addprefix -I,$(GTEST_TEST_SRC)), \
|
$(addprefix -I,$(GTEST_TEST_SRC)), \
|
||||||
CFLAGS_windows := -EHsc, \
|
CFLAGS_windows := -EHsc, \
|
||||||
@ -83,7 +107,10 @@ $(eval $(call SetupNativeCompilation, BUILD_GTEST_LIBJVM, \
|
|||||||
undef switch format-nonliteral tautological-undefined-compare \
|
undef switch format-nonliteral tautological-undefined-compare \
|
||||||
self-assign-overloaded, \
|
self-assign-overloaded, \
|
||||||
LDFLAGS := $(JVM_LDFLAGS), \
|
LDFLAGS := $(JVM_LDFLAGS), \
|
||||||
|
LDFLAGS_unix := -L$(JVM_OUTPUTDIR)/libgtest, \
|
||||||
LIBS := $(JVM_LIBS), \
|
LIBS := $(JVM_LIBS), \
|
||||||
|
LIBS_unix := -lgtest, \
|
||||||
|
LIBS_windows := $(JVM_OUTPUTDIR)/libgtest/gtest.lib, \
|
||||||
OPTIMIZATION := $(JVM_OPTIMIZATION), \
|
OPTIMIZATION := $(JVM_OPTIMIZATION), \
|
||||||
MAPFILE := $(GTEST_JVM_MAPFILE), \
|
MAPFILE := $(GTEST_JVM_MAPFILE), \
|
||||||
USE_MAPFILE_FOR_SYMBOLS := true, \
|
USE_MAPFILE_FOR_SYMBOLS := true, \
|
||||||
@ -91,9 +118,11 @@ $(eval $(call SetupNativeCompilation, BUILD_GTEST_LIBJVM, \
|
|||||||
ZIP_EXTERNAL_DEBUG_SYMBOLS := false, \
|
ZIP_EXTERNAL_DEBUG_SYMBOLS := false, \
|
||||||
STRIP_SYMBOLS := false, \
|
STRIP_SYMBOLS := false, \
|
||||||
PRECOMPILED_HEADER := $(JVM_PRECOMPILED_HEADER), \
|
PRECOMPILED_HEADER := $(JVM_PRECOMPILED_HEADER), \
|
||||||
PRECOMPILED_HEADER_EXCLUDE := gtest-all.cc gmock-all.cc gtestMain.cpp, \
|
PRECOMPILED_HEADER_EXCLUDE := gtestMain.cpp, \
|
||||||
))
|
))
|
||||||
|
|
||||||
|
$(BUILD_GTEST_LIBJVM) : $(BUILD_GTEST_LIBGTEST)
|
||||||
|
|
||||||
TARGETS += $(BUILD_GTEST_LIBJVM)
|
TARGETS += $(BUILD_GTEST_LIBJVM)
|
||||||
|
|
||||||
################################################################################
|
################################################################################
|
||||||
|
@ -33,7 +33,7 @@ include HotspotCommon.gmk
|
|||||||
|
|
||||||
include lib/CompileJvm.gmk
|
include lib/CompileJvm.gmk
|
||||||
|
|
||||||
ifeq ($(BUILD_GTEST), true)
|
ifneq ($(GTEST_FRAMEWORK_SRC), )
|
||||||
include lib/CompileGtest.gmk
|
include lib/CompileGtest.gmk
|
||||||
endif
|
endif
|
||||||
|
|
||||||
|
@ -1,126 +0,0 @@
|
|||||||
Changes for 1.7.0:
|
|
||||||
|
|
||||||
* All new improvements in Google Test 1.7.0.
|
|
||||||
* New feature: matchers DoubleNear(), FloatNear(),
|
|
||||||
NanSensitiveDoubleNear(), NanSensitiveFloatNear(),
|
|
||||||
UnorderedElementsAre(), UnorderedElementsAreArray(), WhenSorted(),
|
|
||||||
WhenSortedBy(), IsEmpty(), and SizeIs().
|
|
||||||
* Improvement: Google Mock can now be built as a DLL.
|
|
||||||
* Improvement: when compiled by a C++11 compiler, matchers AllOf()
|
|
||||||
and AnyOf() can accept an arbitrary number of matchers.
|
|
||||||
* Improvement: when compiled by a C++11 compiler, matchers
|
|
||||||
ElementsAreArray() can accept an initializer list.
|
|
||||||
* Improvement: when exceptions are enabled, a mock method with no
|
|
||||||
default action now throws instead crashing the test.
|
|
||||||
* Improvement: added class testing::StringMatchResultListener to aid
|
|
||||||
definition of composite matchers.
|
|
||||||
* Improvement: function return types used in MOCK_METHOD*() macros can
|
|
||||||
now contain unprotected commas.
|
|
||||||
* Improvement (potentially breaking): EXPECT_THAT() and ASSERT_THAT()
|
|
||||||
are now more strict in ensuring that the value type and the matcher
|
|
||||||
type are compatible, catching potential bugs in tests.
|
|
||||||
* Improvement: Pointee() now works on an optional<T>.
|
|
||||||
* Improvement: the ElementsAreArray() matcher can now take a vector or
|
|
||||||
iterator range as input, and makes a copy of its input elements
|
|
||||||
before the conversion to a Matcher.
|
|
||||||
* Improvement: the Google Mock Generator can now generate mocks for
|
|
||||||
some class templates.
|
|
||||||
* Bug fix: mock object destruction triggerred by another mock object's
|
|
||||||
destruction no longer hangs.
|
|
||||||
* Improvement: Google Mock Doctor works better with newer Clang and
|
|
||||||
GCC now.
|
|
||||||
* Compatibility fixes.
|
|
||||||
* Bug/warning fixes.
|
|
||||||
|
|
||||||
Changes for 1.6.0:
|
|
||||||
|
|
||||||
* Compilation is much faster and uses much less memory, especially
|
|
||||||
when the constructor and destructor of a mock class are moved out of
|
|
||||||
the class body.
|
|
||||||
* New matchers: Pointwise(), Each().
|
|
||||||
* New actions: ReturnPointee() and ReturnRefOfCopy().
|
|
||||||
* CMake support.
|
|
||||||
* Project files for Visual Studio 2010.
|
|
||||||
* AllOf() and AnyOf() can handle up-to 10 arguments now.
|
|
||||||
* Google Mock doctor understands Clang error messages now.
|
|
||||||
* SetArgPointee<> now accepts string literals.
|
|
||||||
* gmock_gen.py handles storage specifier macros and template return
|
|
||||||
types now.
|
|
||||||
* Compatibility fixes.
|
|
||||||
* Bug fixes and implementation clean-ups.
|
|
||||||
* Potentially incompatible changes: disables the harmful 'make install'
|
|
||||||
command in autotools.
|
|
||||||
|
|
||||||
Potentially breaking changes:
|
|
||||||
|
|
||||||
* The description string for MATCHER*() changes from Python-style
|
|
||||||
interpolation to an ordinary C++ string expression.
|
|
||||||
* SetArgumentPointee is deprecated in favor of SetArgPointee.
|
|
||||||
* Some non-essential project files for Visual Studio 2005 are removed.
|
|
||||||
|
|
||||||
Changes for 1.5.0:
|
|
||||||
|
|
||||||
* New feature: Google Mock can be safely used in multi-threaded tests
|
|
||||||
on platforms having pthreads.
|
|
||||||
* New feature: function for printing a value of arbitrary type.
|
|
||||||
* New feature: function ExplainMatchResult() for easy definition of
|
|
||||||
composite matchers.
|
|
||||||
* The new matcher API lets user-defined matchers generate custom
|
|
||||||
explanations more directly and efficiently.
|
|
||||||
* Better failure messages all around.
|
|
||||||
* NotNull() and IsNull() now work with smart pointers.
|
|
||||||
* Field() and Property() now work when the matcher argument is a pointer
|
|
||||||
passed by reference.
|
|
||||||
* Regular expression matchers on all platforms.
|
|
||||||
* Added GCC 4.0 support for Google Mock Doctor.
|
|
||||||
* Added gmock_all_test.cc for compiling most Google Mock tests
|
|
||||||
in a single file.
|
|
||||||
* Significantly cleaned up compiler warnings.
|
|
||||||
* Bug fixes, better test coverage, and implementation clean-ups.
|
|
||||||
|
|
||||||
Potentially breaking changes:
|
|
||||||
|
|
||||||
* Custom matchers defined using MatcherInterface or MakePolymorphicMatcher()
|
|
||||||
need to be updated after upgrading to Google Mock 1.5.0; matchers defined
|
|
||||||
using MATCHER or MATCHER_P* aren't affected.
|
|
||||||
* Dropped support for 'make install'.
|
|
||||||
|
|
||||||
Changes for 1.4.0 (we skipped 1.2.* and 1.3.* to match the version of
|
|
||||||
Google Test):
|
|
||||||
|
|
||||||
* Works in more environments: Symbian and minGW, Visual C++ 7.1.
|
|
||||||
* Lighter weight: comes with our own implementation of TR1 tuple (no
|
|
||||||
more dependency on Boost!).
|
|
||||||
* New feature: --gmock_catch_leaked_mocks for detecting leaked mocks.
|
|
||||||
* New feature: ACTION_TEMPLATE for defining templatized actions.
|
|
||||||
* New feature: the .After() clause for specifying expectation order.
|
|
||||||
* New feature: the .With() clause for specifying inter-argument
|
|
||||||
constraints.
|
|
||||||
* New feature: actions ReturnArg<k>(), ReturnNew<T>(...), and
|
|
||||||
DeleteArg<k>().
|
|
||||||
* New feature: matchers Key(), Pair(), Args<...>(), AllArgs(), IsNull(),
|
|
||||||
and Contains().
|
|
||||||
* New feature: utility class MockFunction<F>, useful for checkpoints, etc.
|
|
||||||
* New feature: functions Value(x, m) and SafeMatcherCast<T>(m).
|
|
||||||
* New feature: copying a mock object is rejected at compile time.
|
|
||||||
* New feature: a script for fusing all Google Mock and Google Test
|
|
||||||
source files for easy deployment.
|
|
||||||
* Improved the Google Mock doctor to diagnose more diseases.
|
|
||||||
* Improved the Google Mock generator script.
|
|
||||||
* Compatibility fixes for Mac OS X and gcc.
|
|
||||||
* Bug fixes and implementation clean-ups.
|
|
||||||
|
|
||||||
Changes for 1.1.0:
|
|
||||||
|
|
||||||
* New feature: ability to use Google Mock with any testing framework.
|
|
||||||
* New feature: macros for easily defining new matchers
|
|
||||||
* New feature: macros for easily defining new actions.
|
|
||||||
* New feature: more container matchers.
|
|
||||||
* New feature: actions for accessing function arguments and throwing
|
|
||||||
exceptions.
|
|
||||||
* Improved the Google Mock doctor script for diagnosing compiler errors.
|
|
||||||
* Bug fixes and implementation clean-ups.
|
|
||||||
|
|
||||||
Changes for 1.0.0:
|
|
||||||
|
|
||||||
* Initial Open Source release of Google Mock
|
|
@ -1,40 +0,0 @@
|
|||||||
# This file contains a list of people who've made non-trivial
|
|
||||||
# contribution to the Google C++ Mocking Framework project. People
|
|
||||||
# who commit code to the project are encouraged to add their names
|
|
||||||
# here. Please keep the list sorted by first names.
|
|
||||||
|
|
||||||
Benoit Sigoure <tsuna@google.com>
|
|
||||||
Bogdan Piloca <boo@google.com>
|
|
||||||
Chandler Carruth <chandlerc@google.com>
|
|
||||||
Dave MacLachlan <dmaclach@gmail.com>
|
|
||||||
David Anderson <danderson@google.com>
|
|
||||||
Dean Sturtevant
|
|
||||||
Gene Volovich <gv@cite.com>
|
|
||||||
Hal Burch <gmock@hburch.com>
|
|
||||||
Jeffrey Yasskin <jyasskin@google.com>
|
|
||||||
Jim Keller <jimkeller@google.com>
|
|
||||||
Joe Walnes <joe@truemesh.com>
|
|
||||||
Jon Wray <jwray@google.com>
|
|
||||||
Keir Mierle <mierle@gmail.com>
|
|
||||||
Keith Ray <keith.ray@gmail.com>
|
|
||||||
Kostya Serebryany <kcc@google.com>
|
|
||||||
Lev Makhlis
|
|
||||||
Manuel Klimek <klimek@google.com>
|
|
||||||
Mario Tanev <radix@google.com>
|
|
||||||
Mark Paskin
|
|
||||||
Markus Heule <markus.heule@gmail.com>
|
|
||||||
Matthew Simmons <simmonmt@acm.org>
|
|
||||||
Mike Bland <mbland@google.com>
|
|
||||||
Neal Norwitz <nnorwitz@gmail.com>
|
|
||||||
Nermin Ozkiranartli <nermin@google.com>
|
|
||||||
Owen Carlsen <ocarlsen@google.com>
|
|
||||||
Paneendra Ba <paneendra@google.com>
|
|
||||||
Paul Menage <menage@google.com>
|
|
||||||
Piotr Kaminski <piotrk@google.com>
|
|
||||||
Russ Rufer <russ@pentad.com>
|
|
||||||
Sverre Sundsdal <sundsdal@gmail.com>
|
|
||||||
Takeshi Yoshino <tyoshino@google.com>
|
|
||||||
Vadim Berman <vadimb@google.com>
|
|
||||||
Vlad Losev <vladl@google.com>
|
|
||||||
Wolfgang Klier <wklier@google.com>
|
|
||||||
Zhanyong Wan <wan@google.com>
|
|
@ -1,28 +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.
|
|
@ -1,322 +0,0 @@
|
|||||||
## Google Mock ##
|
|
||||||
|
|
||||||
The Google C++ mocking framework.
|
|
||||||
|
|
||||||
### Overview ###
|
|
||||||
|
|
||||||
Google's framework for writing and using C++ mock classes.
|
|
||||||
It can help you derive better designs of your system and write better tests.
|
|
||||||
|
|
||||||
It is inspired by:
|
|
||||||
|
|
||||||
* [jMock](http://www.jmock.org/),
|
|
||||||
* [EasyMock](http://www.easymock.org/), and
|
|
||||||
* [Hamcrest](http://code.google.com/p/hamcrest/),
|
|
||||||
|
|
||||||
and designed with C++'s specifics in mind.
|
|
||||||
|
|
||||||
Google mock:
|
|
||||||
|
|
||||||
* lets you create mock classes trivially using simple macros.
|
|
||||||
* supports a rich set of matchers and actions.
|
|
||||||
* handles unordered, partially ordered, or completely ordered expectations.
|
|
||||||
* is extensible by users.
|
|
||||||
|
|
||||||
We hope you find it useful!
|
|
||||||
|
|
||||||
### Features ###
|
|
||||||
|
|
||||||
* Provides a declarative syntax for defining mocks.
|
|
||||||
* Can easily define partial (hybrid) mocks, which are a cross of real
|
|
||||||
and mock objects.
|
|
||||||
* Handles functions of arbitrary types and overloaded functions.
|
|
||||||
* Comes with a rich set of matchers for validating function arguments.
|
|
||||||
* Uses an intuitive syntax for controlling the behavior of a mock.
|
|
||||||
* Does automatic verification of expectations (no record-and-replay needed).
|
|
||||||
* Allows arbitrary (partial) ordering constraints on
|
|
||||||
function calls to be expressed,.
|
|
||||||
* Lets an user extend it by defining new matchers and actions.
|
|
||||||
* Does not use exceptions.
|
|
||||||
* Is easy to learn and use.
|
|
||||||
|
|
||||||
Please see the project page above for more information as well as the
|
|
||||||
mailing list for questions, discussions, and development. There is
|
|
||||||
also an IRC channel on OFTC (irc.oftc.net) #gtest available. Please
|
|
||||||
join us!
|
|
||||||
|
|
||||||
Please note that code under [scripts/generator](scripts/generator/) is
|
|
||||||
from [cppclean](http://code.google.com/p/cppclean/) and released under
|
|
||||||
the Apache License, which is different from Google Mock's license.
|
|
||||||
|
|
||||||
## Getting Started ##
|
|
||||||
|
|
||||||
If you are new to the project, we suggest that you read the user
|
|
||||||
documentation in the following order:
|
|
||||||
|
|
||||||
* Learn the [basics](../googletest/docs/primer.md) of
|
|
||||||
Google Test, if you choose to use Google Mock with it (recommended).
|
|
||||||
* Read [Google Mock for Dummies](../googlemock/docs/ForDummies.md).
|
|
||||||
* Read the instructions below on how to build Google Mock.
|
|
||||||
|
|
||||||
You can also watch Zhanyong's [talk](http://www.youtube.com/watch?v=sYpCyLI47rM) on Google Mock's usage and implementation.
|
|
||||||
|
|
||||||
Once you understand the basics, check out the rest of the docs:
|
|
||||||
|
|
||||||
* [CheatSheet](../googlemock/docs/CheatSheet.md) - all the commonly used stuff
|
|
||||||
at a glance.
|
|
||||||
* [CookBook](../googlemock/docs/CookBook.md) - recipes for getting things done,
|
|
||||||
including advanced techniques.
|
|
||||||
|
|
||||||
If you need help, please check the
|
|
||||||
[KnownIssues](docs/KnownIssues.md) and
|
|
||||||
[FrequentlyAskedQuestions](docs/FrequentlyAskedQuestions.md) before
|
|
||||||
posting a question on the
|
|
||||||
[discussion group](http://groups.google.com/group/googlemock).
|
|
||||||
|
|
||||||
|
|
||||||
### Using Google Mock Without Google Test ###
|
|
||||||
|
|
||||||
Google Mock is not a testing framework itself. Instead, it needs a
|
|
||||||
testing framework for writing tests. Google Mock works seamlessly
|
|
||||||
with [Google Test](https://github.com/google/googletest), but
|
|
||||||
you can also use it with [any C++ testing framework](../googlemock/docs/ForDummies.md#using-google-mock-with-any-testing-framework).
|
|
||||||
|
|
||||||
### Requirements for End Users ###
|
|
||||||
|
|
||||||
Google Mock is implemented on top of [Google Test](
|
|
||||||
http://github.com/google/googletest/), and depends on it.
|
|
||||||
You must use the bundled version of Google Test when using Google Mock.
|
|
||||||
|
|
||||||
You can also easily configure Google Mock to work with another testing
|
|
||||||
framework, although it will still need Google Test. Please read
|
|
||||||
["Using_Google_Mock_with_Any_Testing_Framework"](
|
|
||||||
../googlemock/docs/ForDummies.md#using-google-mock-with-any-testing-framework)
|
|
||||||
for instructions.
|
|
||||||
|
|
||||||
Google Mock depends on advanced C++ features and thus requires a more
|
|
||||||
modern compiler. The following are needed to use Google Mock:
|
|
||||||
|
|
||||||
#### Linux Requirements ####
|
|
||||||
|
|
||||||
* GNU-compatible Make or "gmake"
|
|
||||||
* POSIX-standard shell
|
|
||||||
* POSIX(-2) Regular Expressions (regex.h)
|
|
||||||
* C++98-standard-compliant compiler (e.g. GCC 3.4 or newer)
|
|
||||||
|
|
||||||
#### Windows Requirements ####
|
|
||||||
|
|
||||||
* Microsoft Visual C++ 8.0 SP1 or newer
|
|
||||||
|
|
||||||
#### Mac OS X Requirements ####
|
|
||||||
|
|
||||||
* Mac OS X 10.4 Tiger or newer
|
|
||||||
* Developer Tools Installed
|
|
||||||
|
|
||||||
### Requirements for Contributors ###
|
|
||||||
|
|
||||||
We welcome patches. If you plan to contribute a patch, you need to
|
|
||||||
build Google Mock and its tests, which has further requirements:
|
|
||||||
|
|
||||||
* Automake version 1.9 or newer
|
|
||||||
* Autoconf version 2.59 or newer
|
|
||||||
* Libtool / Libtoolize
|
|
||||||
* Python version 2.3 or newer (for running some of the tests and
|
|
||||||
re-generating certain source files from templates)
|
|
||||||
|
|
||||||
### Building Google Mock ###
|
|
||||||
|
|
||||||
#### Using CMake ####
|
|
||||||
|
|
||||||
If you have CMake available, it is recommended that you follow the
|
|
||||||
[build instructions][gtest_cmakebuild]
|
|
||||||
as described for Google Test.
|
|
||||||
|
|
||||||
If are using Google Mock with an
|
|
||||||
existing CMake project, the section
|
|
||||||
[Incorporating Into An Existing CMake Project][gtest_incorpcmake]
|
|
||||||
may be of particular interest.
|
|
||||||
To make it work for Google Mock you will need to change
|
|
||||||
|
|
||||||
target_link_libraries(example gtest_main)
|
|
||||||
|
|
||||||
to
|
|
||||||
|
|
||||||
target_link_libraries(example gmock_main)
|
|
||||||
|
|
||||||
This works because `gmock_main` library is compiled with Google Test.
|
|
||||||
|
|
||||||
#### Preparing to Build (Unix only) ####
|
|
||||||
|
|
||||||
If you are using a Unix system and plan to use the GNU Autotools build
|
|
||||||
system to build Google Mock (described below), you'll need to
|
|
||||||
configure it now.
|
|
||||||
|
|
||||||
To prepare the Autotools build system:
|
|
||||||
|
|
||||||
cd googlemock
|
|
||||||
autoreconf -fvi
|
|
||||||
|
|
||||||
To build Google Mock and your tests that use it, you need to tell your
|
|
||||||
build system where to find its headers and source files. The exact
|
|
||||||
way to do it depends on which build system you use, and is usually
|
|
||||||
straightforward.
|
|
||||||
|
|
||||||
This section shows how you can integrate Google Mock into your
|
|
||||||
existing build system.
|
|
||||||
|
|
||||||
Suppose you put Google Mock in directory `${GMOCK_DIR}` and Google Test
|
|
||||||
in `${GTEST_DIR}` (the latter is `${GMOCK_DIR}/gtest` by default). To
|
|
||||||
build Google Mock, create a library build target (or a project as
|
|
||||||
called by Visual Studio and Xcode) to compile
|
|
||||||
|
|
||||||
${GTEST_DIR}/src/gtest-all.cc and ${GMOCK_DIR}/src/gmock-all.cc
|
|
||||||
|
|
||||||
with
|
|
||||||
|
|
||||||
${GTEST_DIR}/include and ${GMOCK_DIR}/include
|
|
||||||
|
|
||||||
in the system header search path, and
|
|
||||||
|
|
||||||
${GTEST_DIR} and ${GMOCK_DIR}
|
|
||||||
|
|
||||||
in the normal header search path. Assuming a Linux-like system and gcc,
|
|
||||||
something like the following will do:
|
|
||||||
|
|
||||||
g++ -isystem ${GTEST_DIR}/include -I${GTEST_DIR} \
|
|
||||||
-isystem ${GMOCK_DIR}/include -I${GMOCK_DIR} \
|
|
||||||
-pthread -c ${GTEST_DIR}/src/gtest-all.cc
|
|
||||||
g++ -isystem ${GTEST_DIR}/include -I${GTEST_DIR} \
|
|
||||||
-isystem ${GMOCK_DIR}/include -I${GMOCK_DIR} \
|
|
||||||
-pthread -c ${GMOCK_DIR}/src/gmock-all.cc
|
|
||||||
ar -rv libgmock.a gtest-all.o gmock-all.o
|
|
||||||
|
|
||||||
(We need -pthread as Google Test and Google Mock use threads.)
|
|
||||||
|
|
||||||
Next, you should compile your test source file with
|
|
||||||
${GTEST\_DIR}/include and ${GMOCK\_DIR}/include in the header search
|
|
||||||
path, and link it with gmock and any other necessary libraries:
|
|
||||||
|
|
||||||
g++ -isystem ${GTEST_DIR}/include -isystem ${GMOCK_DIR}/include \
|
|
||||||
-pthread path/to/your_test.cc libgmock.a -o your_test
|
|
||||||
|
|
||||||
As an example, the make/ directory contains a Makefile that you can
|
|
||||||
use to build Google Mock on systems where GNU make is available
|
|
||||||
(e.g. Linux, Mac OS X, and Cygwin). It doesn't try to build Google
|
|
||||||
Mock's own tests. Instead, it just builds the Google Mock library and
|
|
||||||
a sample test. You can use it as a starting point for your own build
|
|
||||||
script.
|
|
||||||
|
|
||||||
If the default settings are correct for your environment, the
|
|
||||||
following commands should succeed:
|
|
||||||
|
|
||||||
cd ${GMOCK_DIR}/make
|
|
||||||
make
|
|
||||||
./gmock_test
|
|
||||||
|
|
||||||
If you see errors, try to tweak the contents of
|
|
||||||
[make/Makefile](make/Makefile) to make them go away.
|
|
||||||
|
|
||||||
### Windows ###
|
|
||||||
|
|
||||||
The msvc/2005 directory contains VC++ 2005 projects and the msvc/2010
|
|
||||||
directory contains VC++ 2010 projects for building Google Mock and
|
|
||||||
selected tests.
|
|
||||||
|
|
||||||
Change to the appropriate directory and run "msbuild gmock.sln" to
|
|
||||||
build the library and tests (or open the gmock.sln in the MSVC IDE).
|
|
||||||
If you want to create your own project to use with Google Mock, you'll
|
|
||||||
have to configure it to use the `gmock_config` propety sheet. For that:
|
|
||||||
|
|
||||||
* Open the Property Manager window (View | Other Windows | Property Manager)
|
|
||||||
* Right-click on your project and select "Add Existing Property Sheet..."
|
|
||||||
* Navigate to `gmock_config.vsprops` or `gmock_config.props` and select it.
|
|
||||||
* In Project Properties | Configuration Properties | General | Additional
|
|
||||||
Include Directories, type <path to Google Mock>/include.
|
|
||||||
|
|
||||||
### Tweaking Google Mock ###
|
|
||||||
|
|
||||||
Google Mock can be used in diverse environments. The default
|
|
||||||
configuration may not work (or may not work well) out of the box in
|
|
||||||
some environments. However, you can easily tweak Google Mock by
|
|
||||||
defining control macros on the compiler command line. Generally,
|
|
||||||
these macros are named like `GTEST_XYZ` and you define them to either 1
|
|
||||||
or 0 to enable or disable a certain feature.
|
|
||||||
|
|
||||||
We list the most frequently used macros below. For a complete list,
|
|
||||||
see file [${GTEST\_DIR}/include/gtest/internal/gtest-port.h](
|
|
||||||
../googletest/include/gtest/internal/gtest-port.h).
|
|
||||||
|
|
||||||
### Choosing a TR1 Tuple Library ###
|
|
||||||
|
|
||||||
Google Mock uses the C++ Technical Report 1 (TR1) tuple library
|
|
||||||
heavily. Unfortunately TR1 tuple is not yet widely available with all
|
|
||||||
compilers. The good news is that Google Test 1.4.0+ implements a
|
|
||||||
subset of TR1 tuple that's enough for Google Mock's need. Google Mock
|
|
||||||
will automatically use that implementation when the compiler doesn't
|
|
||||||
provide TR1 tuple.
|
|
||||||
|
|
||||||
Usually you don't need to care about which tuple library Google Test
|
|
||||||
and Google Mock use. However, if your project already uses TR1 tuple,
|
|
||||||
you need to tell Google Test and Google Mock to use the same TR1 tuple
|
|
||||||
library the rest of your project uses, or the two tuple
|
|
||||||
implementations will clash. To do that, add
|
|
||||||
|
|
||||||
-DGTEST_USE_OWN_TR1_TUPLE=0
|
|
||||||
|
|
||||||
to the compiler flags while compiling Google Test, Google Mock, and
|
|
||||||
your tests. If you want to force Google Test and Google Mock to use
|
|
||||||
their own tuple library, just add
|
|
||||||
|
|
||||||
-DGTEST_USE_OWN_TR1_TUPLE=1
|
|
||||||
|
|
||||||
to the compiler flags instead.
|
|
||||||
|
|
||||||
If you want to use Boost's TR1 tuple library with Google Mock, please
|
|
||||||
refer to the Boost website (http://www.boost.org/) for how to obtain
|
|
||||||
it and set it up.
|
|
||||||
|
|
||||||
### As a Shared Library (DLL) ###
|
|
||||||
|
|
||||||
Google Mock is compact, so most users can build and link it as a static
|
|
||||||
library for the simplicity. Google Mock can be used as a DLL, but the
|
|
||||||
same DLL must contain Google Test as well. See
|
|
||||||
[Google Test's README][gtest_readme]
|
|
||||||
for instructions on how to set up necessary compiler settings.
|
|
||||||
|
|
||||||
### Tweaking Google Mock ###
|
|
||||||
|
|
||||||
Most of Google Test's control macros apply to Google Mock as well.
|
|
||||||
Please see [Google Test's README][gtest_readme] for how to tweak them.
|
|
||||||
|
|
||||||
### Upgrading from an Earlier Version ###
|
|
||||||
|
|
||||||
We strive to keep Google Mock releases backward compatible.
|
|
||||||
Sometimes, though, we have to make some breaking changes for the
|
|
||||||
users' long-term benefits. This section describes what you'll need to
|
|
||||||
do if you are upgrading from an earlier version of Google Mock.
|
|
||||||
|
|
||||||
#### Upgrading from 1.1.0 or Earlier ####
|
|
||||||
|
|
||||||
You may need to explicitly enable or disable Google Test's own TR1
|
|
||||||
tuple library. See the instructions in section "[Choosing a TR1 Tuple
|
|
||||||
Library](#choosing-a-tr1-tuple-library)".
|
|
||||||
|
|
||||||
#### Upgrading from 1.4.0 or Earlier ####
|
|
||||||
|
|
||||||
On platforms where the pthread library is available, Google Test and
|
|
||||||
Google Mock use it in order to be thread-safe. For this to work, you
|
|
||||||
may need to tweak your compiler and/or linker flags. Please see the
|
|
||||||
"[Multi-threaded Tests](../googletest/README.md#multi-threaded-tests)" section in file Google Test's README for what you may need to do.
|
|
||||||
|
|
||||||
If you have custom matchers defined using `MatcherInterface` or
|
|
||||||
`MakePolymorphicMatcher()`, you'll need to update their definitions to
|
|
||||||
use the new matcher API (
|
|
||||||
[monomorphic](./docs/CookBook.md#writing-new-monomorphic-matchers),
|
|
||||||
[polymorphic](./docs/CookBook.md#writing-new-polymorphic-matchers)).
|
|
||||||
Matchers defined using `MATCHER()` or `MATCHER_P*()` aren't affected.
|
|
||||||
|
|
||||||
Happy testing!
|
|
||||||
|
|
||||||
[gtest_readme]: ../googletest/README.md "googletest"
|
|
||||||
[gtest_cmakebuild]: ../googletest/README.md#using-cmake "Using CMake"
|
|
||||||
[gtest_incorpcmake]: ../googletest/README.md#incorporating-into-an-existing-cmake-project "Incorporating Into An Existing CMake Project"
|
|
File diff suppressed because it is too large
Load Diff
@ -1,153 +0,0 @@
|
|||||||
// 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.
|
|
||||||
|
|
||||||
|
|
||||||
// Google Mock - a framework for writing C++ mock classes.
|
|
||||||
//
|
|
||||||
// This file implements some commonly used cardinalities. More
|
|
||||||
// cardinalities can be defined by the user implementing the
|
|
||||||
// CardinalityInterface interface if necessary.
|
|
||||||
|
|
||||||
// GOOGLETEST_CM0002 DO NOT DELETE
|
|
||||||
|
|
||||||
#ifndef GMOCK_INCLUDE_GMOCK_GMOCK_CARDINALITIES_H_
|
|
||||||
#define GMOCK_INCLUDE_GMOCK_GMOCK_CARDINALITIES_H_
|
|
||||||
|
|
||||||
#include <limits.h>
|
|
||||||
#include <ostream> // NOLINT
|
|
||||||
#include "gmock/internal/gmock-port.h"
|
|
||||||
#include "gtest/gtest.h"
|
|
||||||
|
|
||||||
GTEST_DISABLE_MSC_WARNINGS_PUSH_(4251 \
|
|
||||||
/* class A needs to have dll-interface to be used by clients of class B */)
|
|
||||||
|
|
||||||
namespace testing {
|
|
||||||
|
|
||||||
// To implement a cardinality Foo, define:
|
|
||||||
// 1. a class FooCardinality that implements the
|
|
||||||
// CardinalityInterface interface, and
|
|
||||||
// 2. a factory function that creates a Cardinality object from a
|
|
||||||
// const FooCardinality*.
|
|
||||||
//
|
|
||||||
// The two-level delegation design follows that of Matcher, providing
|
|
||||||
// consistency for extension developers. It also eases ownership
|
|
||||||
// management as Cardinality objects can now be copied like plain values.
|
|
||||||
|
|
||||||
// The implementation of a cardinality.
|
|
||||||
class CardinalityInterface {
|
|
||||||
public:
|
|
||||||
virtual ~CardinalityInterface() {}
|
|
||||||
|
|
||||||
// Conservative estimate on the lower/upper bound of the number of
|
|
||||||
// calls allowed.
|
|
||||||
virtual int ConservativeLowerBound() const { return 0; }
|
|
||||||
virtual int ConservativeUpperBound() const { return INT_MAX; }
|
|
||||||
|
|
||||||
// Returns true iff call_count calls will satisfy this cardinality.
|
|
||||||
virtual bool IsSatisfiedByCallCount(int call_count) const = 0;
|
|
||||||
|
|
||||||
// Returns true iff call_count calls will saturate this cardinality.
|
|
||||||
virtual bool IsSaturatedByCallCount(int call_count) const = 0;
|
|
||||||
|
|
||||||
// Describes self to an ostream.
|
|
||||||
virtual void DescribeTo(::std::ostream* os) const = 0;
|
|
||||||
};
|
|
||||||
|
|
||||||
// A Cardinality is a copyable and IMMUTABLE (except by assignment)
|
|
||||||
// object that specifies how many times a mock function is expected to
|
|
||||||
// be called. The implementation of Cardinality is just a linked_ptr
|
|
||||||
// to const CardinalityInterface, so copying is fairly cheap.
|
|
||||||
// Don't inherit from Cardinality!
|
|
||||||
class GTEST_API_ Cardinality {
|
|
||||||
public:
|
|
||||||
// Constructs a null cardinality. Needed for storing Cardinality
|
|
||||||
// objects in STL containers.
|
|
||||||
Cardinality() {}
|
|
||||||
|
|
||||||
// Constructs a Cardinality from its implementation.
|
|
||||||
explicit Cardinality(const CardinalityInterface* impl) : impl_(impl) {}
|
|
||||||
|
|
||||||
// Conservative estimate on the lower/upper bound of the number of
|
|
||||||
// calls allowed.
|
|
||||||
int ConservativeLowerBound() const { return impl_->ConservativeLowerBound(); }
|
|
||||||
int ConservativeUpperBound() const { return impl_->ConservativeUpperBound(); }
|
|
||||||
|
|
||||||
// Returns true iff call_count calls will satisfy this cardinality.
|
|
||||||
bool IsSatisfiedByCallCount(int call_count) const {
|
|
||||||
return impl_->IsSatisfiedByCallCount(call_count);
|
|
||||||
}
|
|
||||||
|
|
||||||
// Returns true iff call_count calls will saturate this cardinality.
|
|
||||||
bool IsSaturatedByCallCount(int call_count) const {
|
|
||||||
return impl_->IsSaturatedByCallCount(call_count);
|
|
||||||
}
|
|
||||||
|
|
||||||
// Returns true iff call_count calls will over-saturate this
|
|
||||||
// cardinality, i.e. exceed the maximum number of allowed calls.
|
|
||||||
bool IsOverSaturatedByCallCount(int call_count) const {
|
|
||||||
return impl_->IsSaturatedByCallCount(call_count) &&
|
|
||||||
!impl_->IsSatisfiedByCallCount(call_count);
|
|
||||||
}
|
|
||||||
|
|
||||||
// Describes self to an ostream
|
|
||||||
void DescribeTo(::std::ostream* os) const { impl_->DescribeTo(os); }
|
|
||||||
|
|
||||||
// Describes the given actual call count to an ostream.
|
|
||||||
static void DescribeActualCallCountTo(int actual_call_count,
|
|
||||||
::std::ostream* os);
|
|
||||||
|
|
||||||
private:
|
|
||||||
internal::linked_ptr<const CardinalityInterface> impl_;
|
|
||||||
};
|
|
||||||
|
|
||||||
// Creates a cardinality that allows at least n calls.
|
|
||||||
GTEST_API_ Cardinality AtLeast(int n);
|
|
||||||
|
|
||||||
// Creates a cardinality that allows at most n calls.
|
|
||||||
GTEST_API_ Cardinality AtMost(int n);
|
|
||||||
|
|
||||||
// Creates a cardinality that allows any number of calls.
|
|
||||||
GTEST_API_ Cardinality AnyNumber();
|
|
||||||
|
|
||||||
// Creates a cardinality that allows between min and max calls.
|
|
||||||
GTEST_API_ Cardinality Between(int min, int max);
|
|
||||||
|
|
||||||
// Creates a cardinality that allows exactly n calls.
|
|
||||||
GTEST_API_ Cardinality Exactly(int n);
|
|
||||||
|
|
||||||
// Creates a cardinality from its implementation.
|
|
||||||
inline Cardinality MakeCardinality(const CardinalityInterface* c) {
|
|
||||||
return Cardinality(c);
|
|
||||||
}
|
|
||||||
|
|
||||||
} // namespace testing
|
|
||||||
|
|
||||||
GTEST_DISABLE_MSC_WARNINGS_POP_() // 4251
|
|
||||||
|
|
||||||
#endif // GMOCK_INCLUDE_GMOCK_GMOCK_CARDINALITIES_H_
|
|
File diff suppressed because it is too large
Load Diff
@ -1,833 +0,0 @@
|
|||||||
$$ -*- mode: c++; -*-
|
|
||||||
$$ This is a Pump source file. Please use Pump to convert it to
|
|
||||||
$$ gmock-generated-actions.h.
|
|
||||||
$$
|
|
||||||
$var n = 10 $$ The maximum arity we support.
|
|
||||||
$$}} This meta comment fixes auto-indentation in editors.
|
|
||||||
// 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.
|
|
||||||
|
|
||||||
|
|
||||||
// Google Mock - a framework for writing C++ mock classes.
|
|
||||||
//
|
|
||||||
// This file implements some commonly used variadic actions.
|
|
||||||
|
|
||||||
// GOOGLETEST_CM0002 DO NOT DELETE
|
|
||||||
|
|
||||||
#ifndef GMOCK_INCLUDE_GMOCK_GMOCK_GENERATED_ACTIONS_H_
|
|
||||||
#define GMOCK_INCLUDE_GMOCK_GMOCK_GENERATED_ACTIONS_H_
|
|
||||||
|
|
||||||
#include "gmock/gmock-actions.h"
|
|
||||||
#include "gmock/internal/gmock-port.h"
|
|
||||||
|
|
||||||
namespace testing {
|
|
||||||
namespace internal {
|
|
||||||
|
|
||||||
// InvokeHelper<F> knows how to unpack an N-tuple and invoke an N-ary
|
|
||||||
// function, method, or callback with the unpacked values, where F is
|
|
||||||
// a function type that takes N arguments.
|
|
||||||
template <typename Result, typename ArgumentTuple>
|
|
||||||
class InvokeHelper;
|
|
||||||
|
|
||||||
|
|
||||||
$var max_callback_arity = 5
|
|
||||||
$range i 0..n
|
|
||||||
$for i [[
|
|
||||||
$range j 1..i
|
|
||||||
$var types = [[$for j [[, typename A$j]]]]
|
|
||||||
$var as = [[$for j, [[A$j]]]]
|
|
||||||
$var args = [[$if i==0 [[]] $else [[ args]]]]
|
|
||||||
$var gets = [[$for j, [[get<$(j - 1)>(args)]]]]
|
|
||||||
template <typename R$types>
|
|
||||||
class InvokeHelper<R, ::testing::tuple<$as> > {
|
|
||||||
public:
|
|
||||||
template <typename Function>
|
|
||||||
static R Invoke(Function function, const ::testing::tuple<$as>&$args) {
|
|
||||||
return function($gets);
|
|
||||||
}
|
|
||||||
|
|
||||||
template <class Class, typename MethodPtr>
|
|
||||||
static R InvokeMethod(Class* obj_ptr,
|
|
||||||
MethodPtr method_ptr,
|
|
||||||
const ::testing::tuple<$as>&$args) {
|
|
||||||
return (obj_ptr->*method_ptr)($gets);
|
|
||||||
}
|
|
||||||
|
|
||||||
|
|
||||||
$if i <= max_callback_arity [[
|
|
||||||
template <typename CallbackType>
|
|
||||||
static R InvokeCallback(CallbackType* callback,
|
|
||||||
const ::testing::tuple<$as>&$args) {
|
|
||||||
return callback->Run($gets);
|
|
||||||
}
|
|
||||||
]] $else [[
|
|
||||||
// There is no InvokeCallback() for $i-tuples
|
|
||||||
]]
|
|
||||||
|
|
||||||
};
|
|
||||||
|
|
||||||
|
|
||||||
]]
|
|
||||||
// Implements the Invoke(callback) action.
|
|
||||||
template <typename CallbackType>
|
|
||||||
class InvokeCallbackAction {
|
|
||||||
public:
|
|
||||||
// The c'tor takes ownership of the callback.
|
|
||||||
explicit InvokeCallbackAction(CallbackType* callback)
|
|
||||||
: callback_(callback) {
|
|
||||||
callback->CheckIsRepeatable(); // Makes sure the callback is permanent.
|
|
||||||
}
|
|
||||||
|
|
||||||
// This type conversion operator template allows Invoke(callback) to
|
|
||||||
// be used wherever the callback's type is compatible with that of
|
|
||||||
// the mock function, i.e. if the mock function's arguments can be
|
|
||||||
// implicitly converted to the callback's arguments and the
|
|
||||||
// callback's result can be implicitly converted to the mock
|
|
||||||
// function's result.
|
|
||||||
template <typename Result, typename ArgumentTuple>
|
|
||||||
Result Perform(const ArgumentTuple& args) const {
|
|
||||||
return InvokeHelper<Result, ArgumentTuple>::InvokeCallback(
|
|
||||||
callback_.get(), args);
|
|
||||||
}
|
|
||||||
private:
|
|
||||||
const linked_ptr<CallbackType> callback_;
|
|
||||||
};
|
|
||||||
|
|
||||||
// An INTERNAL macro for extracting the type of a tuple field. It's
|
|
||||||
// subject to change without notice - DO NOT USE IN USER CODE!
|
|
||||||
#define GMOCK_FIELD_(Tuple, N) \
|
|
||||||
typename ::testing::tuple_element<N, Tuple>::type
|
|
||||||
|
|
||||||
$range i 1..n
|
|
||||||
|
|
||||||
// SelectArgs<Result, ArgumentTuple, k1, k2, ..., k_n>::type is the
|
|
||||||
// type of an n-ary function whose i-th (1-based) argument type is the
|
|
||||||
// k{i}-th (0-based) field of ArgumentTuple, which must be a tuple
|
|
||||||
// type, and whose return type is Result. For example,
|
|
||||||
// SelectArgs<int, ::testing::tuple<bool, char, double, long>, 0, 3>::type
|
|
||||||
// is int(bool, long).
|
|
||||||
//
|
|
||||||
// SelectArgs<Result, ArgumentTuple, k1, k2, ..., k_n>::Select(args)
|
|
||||||
// returns the selected fields (k1, k2, ..., k_n) of args as a tuple.
|
|
||||||
// For example,
|
|
||||||
// SelectArgs<int, tuple<bool, char, double>, 2, 0>::Select(
|
|
||||||
// ::testing::make_tuple(true, 'a', 2.5))
|
|
||||||
// returns tuple (2.5, true).
|
|
||||||
//
|
|
||||||
// The numbers in list k1, k2, ..., k_n must be >= 0, where n can be
|
|
||||||
// in the range [0, $n]. Duplicates are allowed and they don't have
|
|
||||||
// to be in an ascending or descending order.
|
|
||||||
|
|
||||||
template <typename Result, typename ArgumentTuple, $for i, [[int k$i]]>
|
|
||||||
class SelectArgs {
|
|
||||||
public:
|
|
||||||
typedef Result type($for i, [[GMOCK_FIELD_(ArgumentTuple, k$i)]]);
|
|
||||||
typedef typename Function<type>::ArgumentTuple SelectedArgs;
|
|
||||||
static SelectedArgs Select(const ArgumentTuple& args) {
|
|
||||||
return SelectedArgs($for i, [[get<k$i>(args)]]);
|
|
||||||
}
|
|
||||||
};
|
|
||||||
|
|
||||||
|
|
||||||
$for i [[
|
|
||||||
$range j 1..n
|
|
||||||
$range j1 1..i-1
|
|
||||||
template <typename Result, typename ArgumentTuple$for j1[[, int k$j1]]>
|
|
||||||
class SelectArgs<Result, ArgumentTuple,
|
|
||||||
$for j, [[$if j <= i-1 [[k$j]] $else [[-1]]]]> {
|
|
||||||
public:
|
|
||||||
typedef Result type($for j1, [[GMOCK_FIELD_(ArgumentTuple, k$j1)]]);
|
|
||||||
typedef typename Function<type>::ArgumentTuple SelectedArgs;
|
|
||||||
static SelectedArgs Select(const ArgumentTuple& [[]]
|
|
||||||
$if i == 1 [[/* args */]] $else [[args]]) {
|
|
||||||
return SelectedArgs($for j1, [[get<k$j1>(args)]]);
|
|
||||||
}
|
|
||||||
};
|
|
||||||
|
|
||||||
|
|
||||||
]]
|
|
||||||
#undef GMOCK_FIELD_
|
|
||||||
|
|
||||||
$var ks = [[$for i, [[k$i]]]]
|
|
||||||
|
|
||||||
// Implements the WithArgs action.
|
|
||||||
template <typename InnerAction, $for i, [[int k$i = -1]]>
|
|
||||||
class WithArgsAction {
|
|
||||||
public:
|
|
||||||
explicit WithArgsAction(const InnerAction& action) : action_(action) {}
|
|
||||||
|
|
||||||
template <typename F>
|
|
||||||
operator Action<F>() const { return MakeAction(new Impl<F>(action_)); }
|
|
||||||
|
|
||||||
private:
|
|
||||||
template <typename F>
|
|
||||||
class Impl : public ActionInterface<F> {
|
|
||||||
public:
|
|
||||||
typedef typename Function<F>::Result Result;
|
|
||||||
typedef typename Function<F>::ArgumentTuple ArgumentTuple;
|
|
||||||
|
|
||||||
explicit Impl(const InnerAction& action) : action_(action) {}
|
|
||||||
|
|
||||||
virtual Result Perform(const ArgumentTuple& args) {
|
|
||||||
return action_.Perform(SelectArgs<Result, ArgumentTuple, $ks>::Select(args));
|
|
||||||
}
|
|
||||||
|
|
||||||
private:
|
|
||||||
typedef typename SelectArgs<Result, ArgumentTuple,
|
|
||||||
$ks>::type InnerFunctionType;
|
|
||||||
|
|
||||||
Action<InnerFunctionType> action_;
|
|
||||||
};
|
|
||||||
|
|
||||||
const InnerAction action_;
|
|
||||||
|
|
||||||
GTEST_DISALLOW_ASSIGN_(WithArgsAction);
|
|
||||||
};
|
|
||||||
|
|
||||||
// A macro from the ACTION* family (defined later in this file)
|
|
||||||
// defines an action that can be used in a mock function. Typically,
|
|
||||||
// these actions only care about a subset of the arguments of the mock
|
|
||||||
// function. For example, if such an action only uses the second
|
|
||||||
// argument, it can be used in any mock function that takes >= 2
|
|
||||||
// arguments where the type of the second argument is compatible.
|
|
||||||
//
|
|
||||||
// Therefore, the action implementation must be prepared to take more
|
|
||||||
// arguments than it needs. The ExcessiveArg type is used to
|
|
||||||
// represent those excessive arguments. In order to keep the compiler
|
|
||||||
// error messages tractable, we define it in the testing namespace
|
|
||||||
// instead of testing::internal. However, this is an INTERNAL TYPE
|
|
||||||
// and subject to change without notice, so a user MUST NOT USE THIS
|
|
||||||
// TYPE DIRECTLY.
|
|
||||||
struct ExcessiveArg {};
|
|
||||||
|
|
||||||
// A helper class needed for implementing the ACTION* macros.
|
|
||||||
template <typename Result, class Impl>
|
|
||||||
class ActionHelper {
|
|
||||||
public:
|
|
||||||
$range i 0..n
|
|
||||||
$for i
|
|
||||||
|
|
||||||
[[
|
|
||||||
$var template = [[$if i==0 [[]] $else [[
|
|
||||||
$range j 0..i-1
|
|
||||||
template <$for j, [[typename A$j]]>
|
|
||||||
]]]]
|
|
||||||
$range j 0..i-1
|
|
||||||
$var As = [[$for j, [[A$j]]]]
|
|
||||||
$var as = [[$for j, [[get<$j>(args)]]]]
|
|
||||||
$range k 1..n-i
|
|
||||||
$var eas = [[$for k, [[ExcessiveArg()]]]]
|
|
||||||
$var arg_list = [[$if (i==0) | (i==n) [[$as$eas]] $else [[$as, $eas]]]]
|
|
||||||
$template
|
|
||||||
static Result Perform(Impl* impl, const ::testing::tuple<$As>& args) {
|
|
||||||
return impl->template gmock_PerformImpl<$As>(args, $arg_list);
|
|
||||||
}
|
|
||||||
|
|
||||||
]]
|
|
||||||
};
|
|
||||||
|
|
||||||
} // namespace internal
|
|
||||||
|
|
||||||
// Various overloads for Invoke().
|
|
||||||
|
|
||||||
// WithArgs<N1, N2, ..., Nk>(an_action) creates an action that passes
|
|
||||||
// the selected arguments of the mock function to an_action and
|
|
||||||
// performs it. It serves as an adaptor between actions with
|
|
||||||
// different argument lists. C++ doesn't support default arguments for
|
|
||||||
// function templates, so we have to overload it.
|
|
||||||
|
|
||||||
$range i 1..n
|
|
||||||
$for i [[
|
|
||||||
$range j 1..i
|
|
||||||
template <$for j [[int k$j, ]]typename InnerAction>
|
|
||||||
inline internal::WithArgsAction<InnerAction$for j [[, k$j]]>
|
|
||||||
WithArgs(const InnerAction& action) {
|
|
||||||
return internal::WithArgsAction<InnerAction$for j [[, k$j]]>(action);
|
|
||||||
}
|
|
||||||
|
|
||||||
|
|
||||||
]]
|
|
||||||
// Creates an action that does actions a1, a2, ..., sequentially in
|
|
||||||
// each invocation.
|
|
||||||
$range i 2..n
|
|
||||||
$for i [[
|
|
||||||
$range j 2..i
|
|
||||||
$var types = [[$for j, [[typename Action$j]]]]
|
|
||||||
$var Aas = [[$for j [[, Action$j a$j]]]]
|
|
||||||
|
|
||||||
template <typename Action1, $types>
|
|
||||||
$range k 1..i-1
|
|
||||||
|
|
||||||
inline $for k [[internal::DoBothAction<Action$k, ]]Action$i$for k [[>]]
|
|
||||||
|
|
||||||
DoAll(Action1 a1$Aas) {
|
|
||||||
$if i==2 [[
|
|
||||||
|
|
||||||
return internal::DoBothAction<Action1, Action2>(a1, a2);
|
|
||||||
]] $else [[
|
|
||||||
$range j2 2..i
|
|
||||||
|
|
||||||
return DoAll(a1, DoAll($for j2, [[a$j2]]));
|
|
||||||
]]
|
|
||||||
|
|
||||||
}
|
|
||||||
|
|
||||||
]]
|
|
||||||
|
|
||||||
} // namespace testing
|
|
||||||
|
|
||||||
// The ACTION* family of macros can be used in a namespace scope to
|
|
||||||
// define custom actions easily. The syntax:
|
|
||||||
//
|
|
||||||
// ACTION(name) { statements; }
|
|
||||||
//
|
|
||||||
// will define an action with the given name that executes the
|
|
||||||
// statements. The value returned by the statements will be used as
|
|
||||||
// the return value of the action. Inside the statements, you can
|
|
||||||
// refer to the K-th (0-based) argument of the mock function by
|
|
||||||
// 'argK', and refer to its type by 'argK_type'. For example:
|
|
||||||
//
|
|
||||||
// ACTION(IncrementArg1) {
|
|
||||||
// arg1_type temp = arg1;
|
|
||||||
// return ++(*temp);
|
|
||||||
// }
|
|
||||||
//
|
|
||||||
// allows you to write
|
|
||||||
//
|
|
||||||
// ...WillOnce(IncrementArg1());
|
|
||||||
//
|
|
||||||
// You can also refer to the entire argument tuple and its type by
|
|
||||||
// 'args' and 'args_type', and refer to the mock function type and its
|
|
||||||
// return type by 'function_type' and 'return_type'.
|
|
||||||
//
|
|
||||||
// Note that you don't need to specify the types of the mock function
|
|
||||||
// arguments. However rest assured that your code is still type-safe:
|
|
||||||
// you'll get a compiler error if *arg1 doesn't support the ++
|
|
||||||
// operator, or if the type of ++(*arg1) isn't compatible with the
|
|
||||||
// mock function's return type, for example.
|
|
||||||
//
|
|
||||||
// Sometimes you'll want to parameterize the action. For that you can use
|
|
||||||
// another macro:
|
|
||||||
//
|
|
||||||
// ACTION_P(name, param_name) { statements; }
|
|
||||||
//
|
|
||||||
// For example:
|
|
||||||
//
|
|
||||||
// ACTION_P(Add, n) { return arg0 + n; }
|
|
||||||
//
|
|
||||||
// will allow you to write:
|
|
||||||
//
|
|
||||||
// ...WillOnce(Add(5));
|
|
||||||
//
|
|
||||||
// Note that you don't need to provide the type of the parameter
|
|
||||||
// either. If you need to reference the type of a parameter named
|
|
||||||
// 'foo', you can write 'foo_type'. For example, in the body of
|
|
||||||
// ACTION_P(Add, n) above, you can write 'n_type' to refer to the type
|
|
||||||
// of 'n'.
|
|
||||||
//
|
|
||||||
// We also provide ACTION_P2, ACTION_P3, ..., up to ACTION_P$n to support
|
|
||||||
// multi-parameter actions.
|
|
||||||
//
|
|
||||||
// For the purpose of typing, you can view
|
|
||||||
//
|
|
||||||
// ACTION_Pk(Foo, p1, ..., pk) { ... }
|
|
||||||
//
|
|
||||||
// as shorthand for
|
|
||||||
//
|
|
||||||
// template <typename p1_type, ..., typename pk_type>
|
|
||||||
// FooActionPk<p1_type, ..., pk_type> Foo(p1_type p1, ..., pk_type pk) { ... }
|
|
||||||
//
|
|
||||||
// In particular, you can provide the template type arguments
|
|
||||||
// explicitly when invoking Foo(), as in Foo<long, bool>(5, false);
|
|
||||||
// although usually you can rely on the compiler to infer the types
|
|
||||||
// for you automatically. You can assign the result of expression
|
|
||||||
// Foo(p1, ..., pk) to a variable of type FooActionPk<p1_type, ...,
|
|
||||||
// pk_type>. This can be useful when composing actions.
|
|
||||||
//
|
|
||||||
// You can also overload actions with different numbers of parameters:
|
|
||||||
//
|
|
||||||
// ACTION_P(Plus, a) { ... }
|
|
||||||
// ACTION_P2(Plus, a, b) { ... }
|
|
||||||
//
|
|
||||||
// While it's tempting to always use the ACTION* macros when defining
|
|
||||||
// a new action, you should also consider implementing ActionInterface
|
|
||||||
// or using MakePolymorphicAction() instead, especially if you need to
|
|
||||||
// use the action a lot. While these approaches require more work,
|
|
||||||
// they give you more control on the types of the mock function
|
|
||||||
// arguments and the action parameters, which in general leads to
|
|
||||||
// better compiler error messages that pay off in the long run. They
|
|
||||||
// also allow overloading actions based on parameter types (as opposed
|
|
||||||
// to just based on the number of parameters).
|
|
||||||
//
|
|
||||||
// CAVEAT:
|
|
||||||
//
|
|
||||||
// ACTION*() can only be used in a namespace scope. The reason is
|
|
||||||
// that C++ doesn't yet allow function-local types to be used to
|
|
||||||
// instantiate templates. The up-coming C++0x standard will fix this.
|
|
||||||
// Once that's done, we'll consider supporting using ACTION*() inside
|
|
||||||
// a function.
|
|
||||||
//
|
|
||||||
// MORE INFORMATION:
|
|
||||||
//
|
|
||||||
// To learn more about using these macros, please search for 'ACTION'
|
|
||||||
// on https://github.com/google/googletest/blob/master/googlemock/docs/CookBook.md
|
|
||||||
|
|
||||||
$range i 0..n
|
|
||||||
$range k 0..n-1
|
|
||||||
|
|
||||||
// An internal macro needed for implementing ACTION*().
|
|
||||||
#define GMOCK_ACTION_ARG_TYPES_AND_NAMES_UNUSED_\
|
|
||||||
const args_type& args GTEST_ATTRIBUTE_UNUSED_
|
|
||||||
$for k [[, \
|
|
||||||
arg$k[[]]_type arg$k GTEST_ATTRIBUTE_UNUSED_]]
|
|
||||||
|
|
||||||
|
|
||||||
// Sometimes you want to give an action explicit template parameters
|
|
||||||
// that cannot be inferred from its value parameters. ACTION() and
|
|
||||||
// ACTION_P*() don't support that. ACTION_TEMPLATE() remedies that
|
|
||||||
// and can be viewed as an extension to ACTION() and ACTION_P*().
|
|
||||||
//
|
|
||||||
// The syntax:
|
|
||||||
//
|
|
||||||
// ACTION_TEMPLATE(ActionName,
|
|
||||||
// HAS_m_TEMPLATE_PARAMS(kind1, name1, ..., kind_m, name_m),
|
|
||||||
// AND_n_VALUE_PARAMS(p1, ..., p_n)) { statements; }
|
|
||||||
//
|
|
||||||
// defines an action template that takes m explicit template
|
|
||||||
// parameters and n value parameters. name_i is the name of the i-th
|
|
||||||
// template parameter, and kind_i specifies whether it's a typename,
|
|
||||||
// an integral constant, or a template. p_i is the name of the i-th
|
|
||||||
// value parameter.
|
|
||||||
//
|
|
||||||
// Example:
|
|
||||||
//
|
|
||||||
// // DuplicateArg<k, T>(output) converts the k-th argument of the mock
|
|
||||||
// // function to type T and copies it to *output.
|
|
||||||
// ACTION_TEMPLATE(DuplicateArg,
|
|
||||||
// HAS_2_TEMPLATE_PARAMS(int, k, typename, T),
|
|
||||||
// AND_1_VALUE_PARAMS(output)) {
|
|
||||||
// *output = T(::testing::get<k>(args));
|
|
||||||
// }
|
|
||||||
// ...
|
|
||||||
// int n;
|
|
||||||
// EXPECT_CALL(mock, Foo(_, _))
|
|
||||||
// .WillOnce(DuplicateArg<1, unsigned char>(&n));
|
|
||||||
//
|
|
||||||
// To create an instance of an action template, write:
|
|
||||||
//
|
|
||||||
// ActionName<t1, ..., t_m>(v1, ..., v_n)
|
|
||||||
//
|
|
||||||
// where the ts are the template arguments and the vs are the value
|
|
||||||
// arguments. The value argument types are inferred by the compiler.
|
|
||||||
// If you want to explicitly specify the value argument types, you can
|
|
||||||
// provide additional template arguments:
|
|
||||||
//
|
|
||||||
// ActionName<t1, ..., t_m, u1, ..., u_k>(v1, ..., v_n)
|
|
||||||
//
|
|
||||||
// where u_i is the desired type of v_i.
|
|
||||||
//
|
|
||||||
// ACTION_TEMPLATE and ACTION/ACTION_P* can be overloaded on the
|
|
||||||
// number of value parameters, but not on the number of template
|
|
||||||
// parameters. Without the restriction, the meaning of the following
|
|
||||||
// is unclear:
|
|
||||||
//
|
|
||||||
// OverloadedAction<int, bool>(x);
|
|
||||||
//
|
|
||||||
// Are we using a single-template-parameter action where 'bool' refers
|
|
||||||
// to the type of x, or are we using a two-template-parameter action
|
|
||||||
// where the compiler is asked to infer the type of x?
|
|
||||||
//
|
|
||||||
// Implementation notes:
|
|
||||||
//
|
|
||||||
// GMOCK_INTERNAL_*_HAS_m_TEMPLATE_PARAMS and
|
|
||||||
// GMOCK_INTERNAL_*_AND_n_VALUE_PARAMS are internal macros for
|
|
||||||
// implementing ACTION_TEMPLATE. The main trick we use is to create
|
|
||||||
// new macro invocations when expanding a macro. For example, we have
|
|
||||||
//
|
|
||||||
// #define ACTION_TEMPLATE(name, template_params, value_params)
|
|
||||||
// ... GMOCK_INTERNAL_DECL_##template_params ...
|
|
||||||
//
|
|
||||||
// which causes ACTION_TEMPLATE(..., HAS_1_TEMPLATE_PARAMS(typename, T), ...)
|
|
||||||
// to expand to
|
|
||||||
//
|
|
||||||
// ... GMOCK_INTERNAL_DECL_HAS_1_TEMPLATE_PARAMS(typename, T) ...
|
|
||||||
//
|
|
||||||
// Since GMOCK_INTERNAL_DECL_HAS_1_TEMPLATE_PARAMS is a macro, the
|
|
||||||
// preprocessor will continue to expand it to
|
|
||||||
//
|
|
||||||
// ... typename T ...
|
|
||||||
//
|
|
||||||
// This technique conforms to the C++ standard and is portable. It
|
|
||||||
// allows us to implement action templates using O(N) code, where N is
|
|
||||||
// the maximum number of template/value parameters supported. Without
|
|
||||||
// using it, we'd have to devote O(N^2) amount of code to implement all
|
|
||||||
// combinations of m and n.
|
|
||||||
|
|
||||||
// Declares the template parameters.
|
|
||||||
|
|
||||||
$range j 1..n
|
|
||||||
$for j [[
|
|
||||||
$range m 0..j-1
|
|
||||||
#define GMOCK_INTERNAL_DECL_HAS_$j[[]]
|
|
||||||
_TEMPLATE_PARAMS($for m, [[kind$m, name$m]]) $for m, [[kind$m name$m]]
|
|
||||||
|
|
||||||
|
|
||||||
]]
|
|
||||||
|
|
||||||
// Lists the template parameters.
|
|
||||||
|
|
||||||
$for j [[
|
|
||||||
$range m 0..j-1
|
|
||||||
#define GMOCK_INTERNAL_LIST_HAS_$j[[]]
|
|
||||||
_TEMPLATE_PARAMS($for m, [[kind$m, name$m]]) $for m, [[name$m]]
|
|
||||||
|
|
||||||
|
|
||||||
]]
|
|
||||||
|
|
||||||
// Declares the types of value parameters.
|
|
||||||
|
|
||||||
$for i [[
|
|
||||||
$range j 0..i-1
|
|
||||||
#define GMOCK_INTERNAL_DECL_TYPE_AND_$i[[]]
|
|
||||||
_VALUE_PARAMS($for j, [[p$j]]) $for j [[, typename p$j##_type]]
|
|
||||||
|
|
||||||
|
|
||||||
]]
|
|
||||||
|
|
||||||
// Initializes the value parameters.
|
|
||||||
|
|
||||||
$for i [[
|
|
||||||
$range j 0..i-1
|
|
||||||
#define GMOCK_INTERNAL_INIT_AND_$i[[]]_VALUE_PARAMS($for j, [[p$j]])\
|
|
||||||
($for j, [[p$j##_type gmock_p$j]])$if i>0 [[ : ]]$for j, [[p$j(::testing::internal::move(gmock_p$j))]]
|
|
||||||
|
|
||||||
|
|
||||||
]]
|
|
||||||
|
|
||||||
// Declares the fields for storing the value parameters.
|
|
||||||
|
|
||||||
$for i [[
|
|
||||||
$range j 0..i-1
|
|
||||||
#define GMOCK_INTERNAL_DEFN_AND_$i[[]]
|
|
||||||
_VALUE_PARAMS($for j, [[p$j]]) $for j [[p$j##_type p$j; ]]
|
|
||||||
|
|
||||||
|
|
||||||
]]
|
|
||||||
|
|
||||||
// Lists the value parameters.
|
|
||||||
|
|
||||||
$for i [[
|
|
||||||
$range j 0..i-1
|
|
||||||
#define GMOCK_INTERNAL_LIST_AND_$i[[]]
|
|
||||||
_VALUE_PARAMS($for j, [[p$j]]) $for j, [[p$j]]
|
|
||||||
|
|
||||||
|
|
||||||
]]
|
|
||||||
|
|
||||||
// Lists the value parameter types.
|
|
||||||
|
|
||||||
$for i [[
|
|
||||||
$range j 0..i-1
|
|
||||||
#define GMOCK_INTERNAL_LIST_TYPE_AND_$i[[]]
|
|
||||||
_VALUE_PARAMS($for j, [[p$j]]) $for j [[, p$j##_type]]
|
|
||||||
|
|
||||||
|
|
||||||
]]
|
|
||||||
|
|
||||||
// Declares the value parameters.
|
|
||||||
|
|
||||||
$for i [[
|
|
||||||
$range j 0..i-1
|
|
||||||
#define GMOCK_INTERNAL_DECL_AND_$i[[]]_VALUE_PARAMS($for j, [[p$j]]) [[]]
|
|
||||||
$for j, [[p$j##_type p$j]]
|
|
||||||
|
|
||||||
|
|
||||||
]]
|
|
||||||
|
|
||||||
// The suffix of the class template implementing the action template.
|
|
||||||
$for i [[
|
|
||||||
|
|
||||||
|
|
||||||
$range j 0..i-1
|
|
||||||
#define GMOCK_INTERNAL_COUNT_AND_$i[[]]_VALUE_PARAMS($for j, [[p$j]]) [[]]
|
|
||||||
$if i==1 [[P]] $elif i>=2 [[P$i]]
|
|
||||||
]]
|
|
||||||
|
|
||||||
|
|
||||||
// The name of the class template implementing the action template.
|
|
||||||
#define GMOCK_ACTION_CLASS_(name, value_params)\
|
|
||||||
GTEST_CONCAT_TOKEN_(name##Action, GMOCK_INTERNAL_COUNT_##value_params)
|
|
||||||
|
|
||||||
$range k 0..n-1
|
|
||||||
|
|
||||||
#define ACTION_TEMPLATE(name, template_params, value_params)\
|
|
||||||
template <GMOCK_INTERNAL_DECL_##template_params\
|
|
||||||
GMOCK_INTERNAL_DECL_TYPE_##value_params>\
|
|
||||||
class GMOCK_ACTION_CLASS_(name, value_params) {\
|
|
||||||
public:\
|
|
||||||
explicit GMOCK_ACTION_CLASS_(name, value_params)\
|
|
||||||
GMOCK_INTERNAL_INIT_##value_params {}\
|
|
||||||
template <typename F>\
|
|
||||||
class gmock_Impl : public ::testing::ActionInterface<F> {\
|
|
||||||
public:\
|
|
||||||
typedef F function_type;\
|
|
||||||
typedef typename ::testing::internal::Function<F>::Result return_type;\
|
|
||||||
typedef typename ::testing::internal::Function<F>::ArgumentTuple\
|
|
||||||
args_type;\
|
|
||||||
explicit gmock_Impl GMOCK_INTERNAL_INIT_##value_params {}\
|
|
||||||
virtual return_type Perform(const args_type& args) {\
|
|
||||||
return ::testing::internal::ActionHelper<return_type, gmock_Impl>::\
|
|
||||||
Perform(this, args);\
|
|
||||||
}\
|
|
||||||
template <$for k, [[typename arg$k[[]]_type]]>\
|
|
||||||
return_type gmock_PerformImpl(const args_type& args[[]]
|
|
||||||
$for k [[, arg$k[[]]_type arg$k]]) const;\
|
|
||||||
GMOCK_INTERNAL_DEFN_##value_params\
|
|
||||||
private:\
|
|
||||||
GTEST_DISALLOW_ASSIGN_(gmock_Impl);\
|
|
||||||
};\
|
|
||||||
template <typename F> operator ::testing::Action<F>() const {\
|
|
||||||
return ::testing::Action<F>(\
|
|
||||||
new gmock_Impl<F>(GMOCK_INTERNAL_LIST_##value_params));\
|
|
||||||
}\
|
|
||||||
GMOCK_INTERNAL_DEFN_##value_params\
|
|
||||||
private:\
|
|
||||||
GTEST_DISALLOW_ASSIGN_(GMOCK_ACTION_CLASS_(name, value_params));\
|
|
||||||
};\
|
|
||||||
template <GMOCK_INTERNAL_DECL_##template_params\
|
|
||||||
GMOCK_INTERNAL_DECL_TYPE_##value_params>\
|
|
||||||
inline GMOCK_ACTION_CLASS_(name, value_params)<\
|
|
||||||
GMOCK_INTERNAL_LIST_##template_params\
|
|
||||||
GMOCK_INTERNAL_LIST_TYPE_##value_params> name(\
|
|
||||||
GMOCK_INTERNAL_DECL_##value_params) {\
|
|
||||||
return GMOCK_ACTION_CLASS_(name, value_params)<\
|
|
||||||
GMOCK_INTERNAL_LIST_##template_params\
|
|
||||||
GMOCK_INTERNAL_LIST_TYPE_##value_params>(\
|
|
||||||
GMOCK_INTERNAL_LIST_##value_params);\
|
|
||||||
}\
|
|
||||||
template <GMOCK_INTERNAL_DECL_##template_params\
|
|
||||||
GMOCK_INTERNAL_DECL_TYPE_##value_params>\
|
|
||||||
template <typename F>\
|
|
||||||
template <typename arg0_type, typename arg1_type, typename arg2_type, \
|
|
||||||
typename arg3_type, typename arg4_type, typename arg5_type, \
|
|
||||||
typename arg6_type, typename arg7_type, typename arg8_type, \
|
|
||||||
typename arg9_type>\
|
|
||||||
typename ::testing::internal::Function<F>::Result\
|
|
||||||
GMOCK_ACTION_CLASS_(name, value_params)<\
|
|
||||||
GMOCK_INTERNAL_LIST_##template_params\
|
|
||||||
GMOCK_INTERNAL_LIST_TYPE_##value_params>::gmock_Impl<F>::\
|
|
||||||
gmock_PerformImpl(\
|
|
||||||
GMOCK_ACTION_ARG_TYPES_AND_NAMES_UNUSED_) const
|
|
||||||
|
|
||||||
$for i
|
|
||||||
|
|
||||||
[[
|
|
||||||
$var template = [[$if i==0 [[]] $else [[
|
|
||||||
$range j 0..i-1
|
|
||||||
|
|
||||||
template <$for j, [[typename p$j##_type]]>\
|
|
||||||
]]]]
|
|
||||||
$var class_name = [[name##Action[[$if i==0 [[]] $elif i==1 [[P]]
|
|
||||||
$else [[P$i]]]]]]
|
|
||||||
$range j 0..i-1
|
|
||||||
$var ctor_param_list = [[$for j, [[p$j##_type gmock_p$j]]]]
|
|
||||||
$var param_types_and_names = [[$for j, [[p$j##_type p$j]]]]
|
|
||||||
$var inits = [[$if i==0 [[]] $else [[ : $for j, [[p$j(::testing::internal::forward<p$j##_type>(gmock_p$j))]]]]]]
|
|
||||||
$var param_field_decls = [[$for j
|
|
||||||
[[
|
|
||||||
|
|
||||||
p$j##_type p$j;\
|
|
||||||
]]]]
|
|
||||||
$var param_field_decls2 = [[$for j
|
|
||||||
[[
|
|
||||||
|
|
||||||
p$j##_type p$j;\
|
|
||||||
]]]]
|
|
||||||
$var params = [[$for j, [[p$j]]]]
|
|
||||||
$var param_types = [[$if i==0 [[]] $else [[<$for j, [[p$j##_type]]>]]]]
|
|
||||||
$var typename_arg_types = [[$for k, [[typename arg$k[[]]_type]]]]
|
|
||||||
$var arg_types_and_names = [[$for k, [[arg$k[[]]_type arg$k]]]]
|
|
||||||
$var macro_name = [[$if i==0 [[ACTION]] $elif i==1 [[ACTION_P]]
|
|
||||||
$else [[ACTION_P$i]]]]
|
|
||||||
|
|
||||||
#define $macro_name(name$for j [[, p$j]])\$template
|
|
||||||
class $class_name {\
|
|
||||||
public:\
|
|
||||||
[[$if i==1 [[explicit ]]]]$class_name($ctor_param_list)$inits {}\
|
|
||||||
template <typename F>\
|
|
||||||
class gmock_Impl : public ::testing::ActionInterface<F> {\
|
|
||||||
public:\
|
|
||||||
typedef F function_type;\
|
|
||||||
typedef typename ::testing::internal::Function<F>::Result return_type;\
|
|
||||||
typedef typename ::testing::internal::Function<F>::ArgumentTuple\
|
|
||||||
args_type;\
|
|
||||||
[[$if i==1 [[explicit ]]]]gmock_Impl($ctor_param_list)$inits {}\
|
|
||||||
virtual return_type Perform(const args_type& args) {\
|
|
||||||
return ::testing::internal::ActionHelper<return_type, gmock_Impl>::\
|
|
||||||
Perform(this, args);\
|
|
||||||
}\
|
|
||||||
template <$typename_arg_types>\
|
|
||||||
return_type gmock_PerformImpl(const args_type& args, [[]]
|
|
||||||
$arg_types_and_names) const;\$param_field_decls
|
|
||||||
private:\
|
|
||||||
GTEST_DISALLOW_ASSIGN_(gmock_Impl);\
|
|
||||||
};\
|
|
||||||
template <typename F> operator ::testing::Action<F>() const {\
|
|
||||||
return ::testing::Action<F>(new gmock_Impl<F>($params));\
|
|
||||||
}\$param_field_decls2
|
|
||||||
private:\
|
|
||||||
GTEST_DISALLOW_ASSIGN_($class_name);\
|
|
||||||
};\$template
|
|
||||||
inline $class_name$param_types name($param_types_and_names) {\
|
|
||||||
return $class_name$param_types($params);\
|
|
||||||
}\$template
|
|
||||||
template <typename F>\
|
|
||||||
template <$typename_arg_types>\
|
|
||||||
typename ::testing::internal::Function<F>::Result\
|
|
||||||
$class_name$param_types::gmock_Impl<F>::gmock_PerformImpl(\
|
|
||||||
GMOCK_ACTION_ARG_TYPES_AND_NAMES_UNUSED_) const
|
|
||||||
]]
|
|
||||||
$$ } // This meta comment fixes auto-indentation in Emacs. It won't
|
|
||||||
$$ // show up in the generated code.
|
|
||||||
|
|
||||||
|
|
||||||
namespace testing {
|
|
||||||
|
|
||||||
|
|
||||||
// The ACTION*() macros trigger warning C4100 (unreferenced formal
|
|
||||||
// parameter) in MSVC with -W4. Unfortunately they cannot be fixed in
|
|
||||||
// the macro definition, as the warnings are generated when the macro
|
|
||||||
// is expanded and macro expansion cannot contain #pragma. Therefore
|
|
||||||
// we suppress them here.
|
|
||||||
#ifdef _MSC_VER
|
|
||||||
# pragma warning(push)
|
|
||||||
# pragma warning(disable:4100)
|
|
||||||
#endif
|
|
||||||
|
|
||||||
// Various overloads for InvokeArgument<N>().
|
|
||||||
//
|
|
||||||
// The InvokeArgument<N>(a1, a2, ..., a_k) action invokes the N-th
|
|
||||||
// (0-based) argument, which must be a k-ary callable, of the mock
|
|
||||||
// function, with arguments a1, a2, ..., a_k.
|
|
||||||
//
|
|
||||||
// Notes:
|
|
||||||
//
|
|
||||||
// 1. The arguments are passed by value by default. If you need to
|
|
||||||
// pass an argument by reference, wrap it inside ByRef(). For
|
|
||||||
// example,
|
|
||||||
//
|
|
||||||
// InvokeArgument<1>(5, string("Hello"), ByRef(foo))
|
|
||||||
//
|
|
||||||
// passes 5 and string("Hello") by value, and passes foo by
|
|
||||||
// reference.
|
|
||||||
//
|
|
||||||
// 2. If the callable takes an argument by reference but ByRef() is
|
|
||||||
// not used, it will receive the reference to a copy of the value,
|
|
||||||
// instead of the original value. For example, when the 0-th
|
|
||||||
// argument of the mock function takes a const string&, the action
|
|
||||||
//
|
|
||||||
// InvokeArgument<0>(string("Hello"))
|
|
||||||
//
|
|
||||||
// makes a copy of the temporary string("Hello") object and passes a
|
|
||||||
// reference of the copy, instead of the original temporary object,
|
|
||||||
// to the callable. This makes it easy for a user to define an
|
|
||||||
// InvokeArgument action from temporary values and have it performed
|
|
||||||
// later.
|
|
||||||
|
|
||||||
namespace internal {
|
|
||||||
namespace invoke_argument {
|
|
||||||
|
|
||||||
// Appears in InvokeArgumentAdl's argument list to help avoid
|
|
||||||
// accidental calls to user functions of the same name.
|
|
||||||
struct AdlTag {};
|
|
||||||
|
|
||||||
// InvokeArgumentAdl - a helper for InvokeArgument.
|
|
||||||
// The basic overloads are provided here for generic functors.
|
|
||||||
// Overloads for other custom-callables are provided in the
|
|
||||||
// internal/custom/callback-actions.h header.
|
|
||||||
|
|
||||||
$range i 0..n
|
|
||||||
$for i
|
|
||||||
[[
|
|
||||||
$range j 1..i
|
|
||||||
|
|
||||||
template <typename R, typename F[[$for j [[, typename A$j]]]]>
|
|
||||||
R InvokeArgumentAdl(AdlTag, F f[[$for j [[, A$j a$j]]]]) {
|
|
||||||
return f([[$for j, [[a$j]]]]);
|
|
||||||
}
|
|
||||||
]]
|
|
||||||
|
|
||||||
} // namespace invoke_argument
|
|
||||||
} // namespace internal
|
|
||||||
|
|
||||||
$range i 0..n
|
|
||||||
$for i [[
|
|
||||||
$range j 0..i-1
|
|
||||||
|
|
||||||
ACTION_TEMPLATE(InvokeArgument,
|
|
||||||
HAS_1_TEMPLATE_PARAMS(int, k),
|
|
||||||
AND_$i[[]]_VALUE_PARAMS($for j, [[p$j]])) {
|
|
||||||
using internal::invoke_argument::InvokeArgumentAdl;
|
|
||||||
return InvokeArgumentAdl<return_type>(
|
|
||||||
internal::invoke_argument::AdlTag(),
|
|
||||||
::testing::get<k>(args)$for j [[, p$j]]);
|
|
||||||
}
|
|
||||||
|
|
||||||
]]
|
|
||||||
|
|
||||||
// Various overloads for ReturnNew<T>().
|
|
||||||
//
|
|
||||||
// The ReturnNew<T>(a1, a2, ..., a_k) action returns a pointer to a new
|
|
||||||
// instance of type T, constructed on the heap with constructor arguments
|
|
||||||
// a1, a2, ..., and a_k. The caller assumes ownership of the returned value.
|
|
||||||
$range i 0..n
|
|
||||||
$for i [[
|
|
||||||
$range j 0..i-1
|
|
||||||
$var ps = [[$for j, [[p$j]]]]
|
|
||||||
|
|
||||||
ACTION_TEMPLATE(ReturnNew,
|
|
||||||
HAS_1_TEMPLATE_PARAMS(typename, T),
|
|
||||||
AND_$i[[]]_VALUE_PARAMS($ps)) {
|
|
||||||
return new T($ps);
|
|
||||||
}
|
|
||||||
|
|
||||||
]]
|
|
||||||
|
|
||||||
#ifdef _MSC_VER
|
|
||||||
# pragma warning(pop)
|
|
||||||
#endif
|
|
||||||
|
|
||||||
} // namespace testing
|
|
||||||
|
|
||||||
// Include any custom callback actions added by the local installation.
|
|
||||||
// We must include this header at the end to make sure it can use the
|
|
||||||
// declarations from this file.
|
|
||||||
#include "gmock/internal/custom/gmock-generated-actions.h"
|
|
||||||
|
|
||||||
#endif // GMOCK_INCLUDE_GMOCK_GMOCK_GENERATED_ACTIONS_H_
|
|
File diff suppressed because it is too large
Load Diff
@ -1,348 +0,0 @@
|
|||||||
$$ -*- mode: c++; -*-
|
|
||||||
$$ This is a Pump source file. Please use Pump to convert
|
|
||||||
$$ it to gmock-generated-function-mockers.h.
|
|
||||||
$$
|
|
||||||
$var n = 10 $$ The maximum arity we support.
|
|
||||||
// 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.
|
|
||||||
|
|
||||||
|
|
||||||
// Google Mock - a framework for writing C++ mock classes.
|
|
||||||
//
|
|
||||||
// This file implements function mockers of various arities.
|
|
||||||
|
|
||||||
// GOOGLETEST_CM0002 DO NOT DELETE
|
|
||||||
|
|
||||||
#ifndef GMOCK_INCLUDE_GMOCK_GMOCK_GENERATED_FUNCTION_MOCKERS_H_
|
|
||||||
#define GMOCK_INCLUDE_GMOCK_GMOCK_GENERATED_FUNCTION_MOCKERS_H_
|
|
||||||
|
|
||||||
#include "gmock/gmock-spec-builders.h"
|
|
||||||
#include "gmock/internal/gmock-internal-utils.h"
|
|
||||||
|
|
||||||
#if GTEST_HAS_STD_FUNCTION_
|
|
||||||
# include <functional>
|
|
||||||
#endif
|
|
||||||
|
|
||||||
namespace testing {
|
|
||||||
namespace internal {
|
|
||||||
|
|
||||||
template <typename F>
|
|
||||||
class FunctionMockerBase;
|
|
||||||
|
|
||||||
// Note: class FunctionMocker really belongs to the ::testing
|
|
||||||
// namespace. However if we define it in ::testing, MSVC will
|
|
||||||
// complain when classes in ::testing::internal declare it as a
|
|
||||||
// friend class template. To workaround this compiler bug, we define
|
|
||||||
// FunctionMocker in ::testing::internal and import it into ::testing.
|
|
||||||
template <typename F>
|
|
||||||
class FunctionMocker;
|
|
||||||
|
|
||||||
|
|
||||||
$range i 0..n
|
|
||||||
$for i [[
|
|
||||||
$range j 1..i
|
|
||||||
$var typename_As = [[$for j [[, typename A$j]]]]
|
|
||||||
$var As = [[$for j, [[A$j]]]]
|
|
||||||
$var as = [[$for j, [[internal::forward<A$j>(a$j)]]]]
|
|
||||||
$var Aas = [[$for j, [[A$j a$j]]]]
|
|
||||||
$var ms = [[$for j, [[m$j]]]]
|
|
||||||
$var matchers = [[$for j, [[const Matcher<A$j>& m$j]]]]
|
|
||||||
template <typename R$typename_As>
|
|
||||||
class FunctionMocker<R($As)> : public
|
|
||||||
internal::FunctionMockerBase<R($As)> {
|
|
||||||
public:
|
|
||||||
typedef R F($As);
|
|
||||||
typedef typename internal::Function<F>::ArgumentTuple ArgumentTuple;
|
|
||||||
|
|
||||||
MockSpec<F> With($matchers) {
|
|
||||||
return MockSpec<F>(this, ::testing::make_tuple($ms));
|
|
||||||
}
|
|
||||||
|
|
||||||
R Invoke($Aas) {
|
|
||||||
// Even though gcc and MSVC don't enforce it, 'this->' is required
|
|
||||||
// by the C++ standard [14.6.4] here, as the base class type is
|
|
||||||
// dependent on the template argument (and thus shouldn't be
|
|
||||||
// looked into when resolving InvokeWith).
|
|
||||||
return this->InvokeWith(ArgumentTuple($as));
|
|
||||||
}
|
|
||||||
};
|
|
||||||
|
|
||||||
|
|
||||||
]]
|
|
||||||
// Removes the given pointer; this is a helper for the expectation setter method
|
|
||||||
// for parameterless matchers.
|
|
||||||
//
|
|
||||||
// We want to make sure that the user cannot set a parameterless expectation on
|
|
||||||
// overloaded methods, including methods which are overloaded on const. Example:
|
|
||||||
//
|
|
||||||
// class MockClass {
|
|
||||||
// MOCK_METHOD0(GetName, string&());
|
|
||||||
// MOCK_CONST_METHOD0(GetName, const string&());
|
|
||||||
// };
|
|
||||||
//
|
|
||||||
// TEST() {
|
|
||||||
// // This should be an error, as it's not clear which overload is expected.
|
|
||||||
// EXPECT_CALL(mock, GetName).WillOnce(ReturnRef(value));
|
|
||||||
// }
|
|
||||||
//
|
|
||||||
// Here are the generated expectation-setter methods:
|
|
||||||
//
|
|
||||||
// class MockClass {
|
|
||||||
// // Overload 1
|
|
||||||
// MockSpec<string&()> gmock_GetName() { ... }
|
|
||||||
// // Overload 2. Declared const so that the compiler will generate an
|
|
||||||
// // error when trying to resolve between this and overload 4 in
|
|
||||||
// // 'gmock_GetName(WithoutMatchers(), nullptr)'.
|
|
||||||
// MockSpec<string&()> gmock_GetName(
|
|
||||||
// const WithoutMatchers&, const Function<string&()>*) const {
|
|
||||||
// // Removes const from this, calls overload 1
|
|
||||||
// return AdjustConstness_(this)->gmock_GetName();
|
|
||||||
// }
|
|
||||||
//
|
|
||||||
// // Overload 3
|
|
||||||
// const string& gmock_GetName() const { ... }
|
|
||||||
// // Overload 4
|
|
||||||
// MockSpec<const string&()> gmock_GetName(
|
|
||||||
// const WithoutMatchers&, const Function<const string&()>*) const {
|
|
||||||
// // Does not remove const, calls overload 3
|
|
||||||
// return AdjustConstness_const(this)->gmock_GetName();
|
|
||||||
// }
|
|
||||||
// }
|
|
||||||
//
|
|
||||||
template <typename MockType>
|
|
||||||
const MockType* AdjustConstness_const(const MockType* mock) {
|
|
||||||
return mock;
|
|
||||||
}
|
|
||||||
|
|
||||||
// Removes const from and returns the given pointer; this is a helper for the
|
|
||||||
// expectation setter method for parameterless matchers.
|
|
||||||
template <typename MockType>
|
|
||||||
MockType* AdjustConstness_(const MockType* mock) {
|
|
||||||
return const_cast<MockType*>(mock);
|
|
||||||
}
|
|
||||||
|
|
||||||
} // namespace internal
|
|
||||||
|
|
||||||
// The style guide prohibits "using" statements in a namespace scope
|
|
||||||
// inside a header file. However, the FunctionMocker class template
|
|
||||||
// is meant to be defined in the ::testing namespace. The following
|
|
||||||
// line is just a trick for working around a bug in MSVC 8.0, which
|
|
||||||
// cannot handle it if we define FunctionMocker in ::testing.
|
|
||||||
using internal::FunctionMocker;
|
|
||||||
|
|
||||||
// GMOCK_RESULT_(tn, F) expands to the result type of function type F.
|
|
||||||
// We define this as a variadic macro in case F contains unprotected
|
|
||||||
// commas (the same reason that we use variadic macros in other places
|
|
||||||
// in this file).
|
|
||||||
// INTERNAL IMPLEMENTATION - DON'T USE IN USER CODE!!!
|
|
||||||
#define GMOCK_RESULT_(tn, ...) \
|
|
||||||
tn ::testing::internal::Function<__VA_ARGS__>::Result
|
|
||||||
|
|
||||||
// The type of argument N of the given function type.
|
|
||||||
// INTERNAL IMPLEMENTATION - DON'T USE IN USER CODE!!!
|
|
||||||
#define GMOCK_ARG_(tn, N, ...) \
|
|
||||||
tn ::testing::internal::Function<__VA_ARGS__>::Argument##N
|
|
||||||
|
|
||||||
// The matcher type for argument N of the given function type.
|
|
||||||
// INTERNAL IMPLEMENTATION - DON'T USE IN USER CODE!!!
|
|
||||||
#define GMOCK_MATCHER_(tn, N, ...) \
|
|
||||||
const ::testing::Matcher<GMOCK_ARG_(tn, N, __VA_ARGS__)>&
|
|
||||||
|
|
||||||
// The variable for mocking the given method.
|
|
||||||
// INTERNAL IMPLEMENTATION - DON'T USE IN USER CODE!!!
|
|
||||||
#define GMOCK_MOCKER_(arity, constness, Method) \
|
|
||||||
GTEST_CONCAT_TOKEN_(gmock##constness##arity##_##Method##_, __LINE__)
|
|
||||||
|
|
||||||
|
|
||||||
$for i [[
|
|
||||||
$range j 1..i
|
|
||||||
$var arg_as = [[$for j, [[GMOCK_ARG_(tn, $j, __VA_ARGS__) gmock_a$j]]]]
|
|
||||||
$var as = [[$for j, \
|
|
||||||
[[::testing::internal::forward<GMOCK_ARG_(tn, $j, __VA_ARGS__)>(gmock_a$j)]]]]
|
|
||||||
$var matcher_arg_as = [[$for j, \
|
|
||||||
[[GMOCK_MATCHER_(tn, $j, __VA_ARGS__) gmock_a$j]]]]
|
|
||||||
$var matcher_as = [[$for j, [[gmock_a$j]]]]
|
|
||||||
$var anything_matchers = [[$for j, \
|
|
||||||
[[::testing::A<GMOCK_ARG_(tn, $j, __VA_ARGS__)>()]]]]
|
|
||||||
// INTERNAL IMPLEMENTATION - DON'T USE IN USER CODE!!!
|
|
||||||
#define GMOCK_METHOD$i[[]]_(tn, constness, ct, Method, ...) \
|
|
||||||
GMOCK_RESULT_(tn, __VA_ARGS__) ct Method( \
|
|
||||||
$arg_as) constness { \
|
|
||||||
GTEST_COMPILE_ASSERT_((::testing::tuple_size< \
|
|
||||||
tn ::testing::internal::Function<__VA_ARGS__>::ArgumentTuple>::value == $i), \
|
|
||||||
this_method_does_not_take_$i[[]]_argument[[$if i != 1 [[s]]]]); \
|
|
||||||
GMOCK_MOCKER_($i, constness, Method).SetOwnerAndName(this, #Method); \
|
|
||||||
return GMOCK_MOCKER_($i, constness, Method).Invoke($as); \
|
|
||||||
} \
|
|
||||||
::testing::MockSpec<__VA_ARGS__> \
|
|
||||||
gmock_##Method($matcher_arg_as) constness { \
|
|
||||||
GMOCK_MOCKER_($i, constness, Method).RegisterOwner(this); \
|
|
||||||
return GMOCK_MOCKER_($i, constness, Method).With($matcher_as); \
|
|
||||||
} \
|
|
||||||
::testing::MockSpec<__VA_ARGS__> gmock_##Method( \
|
|
||||||
const ::testing::internal::WithoutMatchers&, \
|
|
||||||
constness ::testing::internal::Function<__VA_ARGS__>* ) const { \
|
|
||||||
return ::testing::internal::AdjustConstness_##constness(this)-> \
|
|
||||||
gmock_##Method($anything_matchers); \
|
|
||||||
} \
|
|
||||||
mutable ::testing::FunctionMocker<__VA_ARGS__> GMOCK_MOCKER_($i, constness, Method)
|
|
||||||
|
|
||||||
|
|
||||||
]]
|
|
||||||
$for i [[
|
|
||||||
#define MOCK_METHOD$i(m, ...) GMOCK_METHOD$i[[]]_(, , , m, __VA_ARGS__)
|
|
||||||
|
|
||||||
]]
|
|
||||||
|
|
||||||
|
|
||||||
$for i [[
|
|
||||||
#define MOCK_CONST_METHOD$i(m, ...) GMOCK_METHOD$i[[]]_(, const, , m, __VA_ARGS__)
|
|
||||||
|
|
||||||
]]
|
|
||||||
|
|
||||||
|
|
||||||
$for i [[
|
|
||||||
#define MOCK_METHOD$i[[]]_T(m, ...) GMOCK_METHOD$i[[]]_(typename, , , m, __VA_ARGS__)
|
|
||||||
|
|
||||||
]]
|
|
||||||
|
|
||||||
|
|
||||||
$for i [[
|
|
||||||
#define MOCK_CONST_METHOD$i[[]]_T(m, ...) \
|
|
||||||
GMOCK_METHOD$i[[]]_(typename, const, , m, __VA_ARGS__)
|
|
||||||
|
|
||||||
]]
|
|
||||||
|
|
||||||
|
|
||||||
$for i [[
|
|
||||||
#define MOCK_METHOD$i[[]]_WITH_CALLTYPE(ct, m, ...) \
|
|
||||||
GMOCK_METHOD$i[[]]_(, , ct, m, __VA_ARGS__)
|
|
||||||
|
|
||||||
]]
|
|
||||||
|
|
||||||
|
|
||||||
$for i [[
|
|
||||||
#define MOCK_CONST_METHOD$i[[]]_WITH_CALLTYPE(ct, m, ...) \
|
|
||||||
GMOCK_METHOD$i[[]]_(, const, ct, m, __VA_ARGS__)
|
|
||||||
|
|
||||||
]]
|
|
||||||
|
|
||||||
|
|
||||||
$for i [[
|
|
||||||
#define MOCK_METHOD$i[[]]_T_WITH_CALLTYPE(ct, m, ...) \
|
|
||||||
GMOCK_METHOD$i[[]]_(typename, , ct, m, __VA_ARGS__)
|
|
||||||
|
|
||||||
]]
|
|
||||||
|
|
||||||
|
|
||||||
$for i [[
|
|
||||||
#define MOCK_CONST_METHOD$i[[]]_T_WITH_CALLTYPE(ct, m, ...) \
|
|
||||||
GMOCK_METHOD$i[[]]_(typename, const, ct, m, __VA_ARGS__)
|
|
||||||
|
|
||||||
]]
|
|
||||||
|
|
||||||
// A MockFunction<F> class has one mock method whose type is F. It is
|
|
||||||
// useful when you just want your test code to emit some messages and
|
|
||||||
// have Google Mock verify the right messages are sent (and perhaps at
|
|
||||||
// the right times). For example, if you are exercising code:
|
|
||||||
//
|
|
||||||
// Foo(1);
|
|
||||||
// Foo(2);
|
|
||||||
// Foo(3);
|
|
||||||
//
|
|
||||||
// and want to verify that Foo(1) and Foo(3) both invoke
|
|
||||||
// mock.Bar("a"), but Foo(2) doesn't invoke anything, you can write:
|
|
||||||
//
|
|
||||||
// TEST(FooTest, InvokesBarCorrectly) {
|
|
||||||
// MyMock mock;
|
|
||||||
// MockFunction<void(string check_point_name)> check;
|
|
||||||
// {
|
|
||||||
// InSequence s;
|
|
||||||
//
|
|
||||||
// EXPECT_CALL(mock, Bar("a"));
|
|
||||||
// EXPECT_CALL(check, Call("1"));
|
|
||||||
// EXPECT_CALL(check, Call("2"));
|
|
||||||
// EXPECT_CALL(mock, Bar("a"));
|
|
||||||
// }
|
|
||||||
// Foo(1);
|
|
||||||
// check.Call("1");
|
|
||||||
// Foo(2);
|
|
||||||
// check.Call("2");
|
|
||||||
// Foo(3);
|
|
||||||
// }
|
|
||||||
//
|
|
||||||
// The expectation spec says that the first Bar("a") must happen
|
|
||||||
// before check point "1", the second Bar("a") must happen after check
|
|
||||||
// point "2", and nothing should happen between the two check
|
|
||||||
// points. The explicit check points make it easy to tell which
|
|
||||||
// Bar("a") is called by which call to Foo().
|
|
||||||
//
|
|
||||||
// MockFunction<F> can also be used to exercise code that accepts
|
|
||||||
// std::function<F> callbacks. To do so, use AsStdFunction() method
|
|
||||||
// to create std::function proxy forwarding to original object's Call.
|
|
||||||
// Example:
|
|
||||||
//
|
|
||||||
// TEST(FooTest, RunsCallbackWithBarArgument) {
|
|
||||||
// MockFunction<int(string)> callback;
|
|
||||||
// EXPECT_CALL(callback, Call("bar")).WillOnce(Return(1));
|
|
||||||
// Foo(callback.AsStdFunction());
|
|
||||||
// }
|
|
||||||
template <typename F>
|
|
||||||
class MockFunction;
|
|
||||||
|
|
||||||
|
|
||||||
$for i [[
|
|
||||||
$range j 0..i-1
|
|
||||||
$var ArgTypes = [[$for j, [[A$j]]]]
|
|
||||||
$var ArgValues = [[$for j, [[::std::move(a$j)]]]]
|
|
||||||
$var ArgDecls = [[$for j, [[A$j a$j]]]]
|
|
||||||
template <typename R$for j [[, typename A$j]]>
|
|
||||||
class MockFunction<R($ArgTypes)> {
|
|
||||||
public:
|
|
||||||
MockFunction() {}
|
|
||||||
|
|
||||||
MOCK_METHOD$i[[]]_T(Call, R($ArgTypes));
|
|
||||||
|
|
||||||
#if GTEST_HAS_STD_FUNCTION_
|
|
||||||
::std::function<R($ArgTypes)> AsStdFunction() {
|
|
||||||
return [this]($ArgDecls) -> R {
|
|
||||||
return this->Call($ArgValues);
|
|
||||||
};
|
|
||||||
}
|
|
||||||
#endif // GTEST_HAS_STD_FUNCTION_
|
|
||||||
|
|
||||||
private:
|
|
||||||
GTEST_DISALLOW_COPY_AND_ASSIGN_(MockFunction);
|
|
||||||
};
|
|
||||||
|
|
||||||
|
|
||||||
]]
|
|
||||||
} // namespace testing
|
|
||||||
|
|
||||||
#endif // GMOCK_INCLUDE_GMOCK_GMOCK_GENERATED_FUNCTION_MOCKERS_H_
|
|
File diff suppressed because it is too large
Load Diff
@ -1,679 +0,0 @@
|
|||||||
$$ -*- mode: c++; -*-
|
|
||||||
$$ This is a Pump source file. Please use Pump to convert
|
|
||||||
$$ it to gmock-generated-matchers.h.
|
|
||||||
$$
|
|
||||||
$var n = 10 $$ The maximum arity we support.
|
|
||||||
$$ }} This line fixes auto-indentation of the following code in Emacs.
|
|
||||||
// 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.
|
|
||||||
|
|
||||||
// Google Mock - a framework for writing C++ mock classes.
|
|
||||||
//
|
|
||||||
// This file implements some commonly used variadic matchers.
|
|
||||||
|
|
||||||
// GOOGLETEST_CM0002 DO NOT DELETE
|
|
||||||
|
|
||||||
#ifndef GMOCK_INCLUDE_GMOCK_GMOCK_GENERATED_MATCHERS_H_
|
|
||||||
#define GMOCK_INCLUDE_GMOCK_GMOCK_GENERATED_MATCHERS_H_
|
|
||||||
|
|
||||||
#include <iterator>
|
|
||||||
#include <sstream>
|
|
||||||
#include <string>
|
|
||||||
#include <vector>
|
|
||||||
#include "gmock/gmock-matchers.h"
|
|
||||||
|
|
||||||
namespace testing {
|
|
||||||
namespace internal {
|
|
||||||
|
|
||||||
$range i 0..n-1
|
|
||||||
|
|
||||||
// The type of the i-th (0-based) field of Tuple.
|
|
||||||
#define GMOCK_FIELD_TYPE_(Tuple, i) \
|
|
||||||
typename ::testing::tuple_element<i, Tuple>::type
|
|
||||||
|
|
||||||
// TupleFields<Tuple, k0, ..., kn> is for selecting fields from a
|
|
||||||
// tuple of type Tuple. It has two members:
|
|
||||||
//
|
|
||||||
// type: a tuple type whose i-th field is the ki-th field of Tuple.
|
|
||||||
// GetSelectedFields(t): returns fields k0, ..., and kn of t as a tuple.
|
|
||||||
//
|
|
||||||
// For example, in class TupleFields<tuple<bool, char, int>, 2, 0>, we have:
|
|
||||||
//
|
|
||||||
// type is tuple<int, bool>, and
|
|
||||||
// GetSelectedFields(make_tuple(true, 'a', 42)) is (42, true).
|
|
||||||
|
|
||||||
template <class Tuple$for i [[, int k$i = -1]]>
|
|
||||||
class TupleFields;
|
|
||||||
|
|
||||||
// This generic version is used when there are $n selectors.
|
|
||||||
template <class Tuple$for i [[, int k$i]]>
|
|
||||||
class TupleFields {
|
|
||||||
public:
|
|
||||||
typedef ::testing::tuple<$for i, [[GMOCK_FIELD_TYPE_(Tuple, k$i)]]> type;
|
|
||||||
static type GetSelectedFields(const Tuple& t) {
|
|
||||||
return type($for i, [[get<k$i>(t)]]);
|
|
||||||
}
|
|
||||||
};
|
|
||||||
|
|
||||||
// The following specialization is used for 0 ~ $(n-1) selectors.
|
|
||||||
|
|
||||||
$for i [[
|
|
||||||
$$ }}}
|
|
||||||
$range j 0..i-1
|
|
||||||
$range k 0..n-1
|
|
||||||
|
|
||||||
template <class Tuple$for j [[, int k$j]]>
|
|
||||||
class TupleFields<Tuple, $for k, [[$if k < i [[k$k]] $else [[-1]]]]> {
|
|
||||||
public:
|
|
||||||
typedef ::testing::tuple<$for j, [[GMOCK_FIELD_TYPE_(Tuple, k$j)]]> type;
|
|
||||||
static type GetSelectedFields(const Tuple& $if i==0 [[/* t */]] $else [[t]]) {
|
|
||||||
return type($for j, [[get<k$j>(t)]]);
|
|
||||||
}
|
|
||||||
};
|
|
||||||
|
|
||||||
]]
|
|
||||||
|
|
||||||
#undef GMOCK_FIELD_TYPE_
|
|
||||||
|
|
||||||
// Implements the Args() matcher.
|
|
||||||
|
|
||||||
$var ks = [[$for i, [[k$i]]]]
|
|
||||||
template <class ArgsTuple$for i [[, int k$i = -1]]>
|
|
||||||
class ArgsMatcherImpl : public MatcherInterface<ArgsTuple> {
|
|
||||||
public:
|
|
||||||
// ArgsTuple may have top-level const or reference modifiers.
|
|
||||||
typedef GTEST_REMOVE_REFERENCE_AND_CONST_(ArgsTuple) RawArgsTuple;
|
|
||||||
typedef typename internal::TupleFields<RawArgsTuple, $ks>::type SelectedArgs;
|
|
||||||
typedef Matcher<const SelectedArgs&> MonomorphicInnerMatcher;
|
|
||||||
|
|
||||||
template <typename InnerMatcher>
|
|
||||||
explicit ArgsMatcherImpl(const InnerMatcher& inner_matcher)
|
|
||||||
: inner_matcher_(SafeMatcherCast<const SelectedArgs&>(inner_matcher)) {}
|
|
||||||
|
|
||||||
virtual bool MatchAndExplain(ArgsTuple args,
|
|
||||||
MatchResultListener* listener) const {
|
|
||||||
const SelectedArgs& selected_args = GetSelectedArgs(args);
|
|
||||||
if (!listener->IsInterested())
|
|
||||||
return inner_matcher_.Matches(selected_args);
|
|
||||||
|
|
||||||
PrintIndices(listener->stream());
|
|
||||||
*listener << "are " << PrintToString(selected_args);
|
|
||||||
|
|
||||||
StringMatchResultListener inner_listener;
|
|
||||||
const bool match = inner_matcher_.MatchAndExplain(selected_args,
|
|
||||||
&inner_listener);
|
|
||||||
PrintIfNotEmpty(inner_listener.str(), listener->stream());
|
|
||||||
return match;
|
|
||||||
}
|
|
||||||
|
|
||||||
virtual void DescribeTo(::std::ostream* os) const {
|
|
||||||
*os << "are a tuple ";
|
|
||||||
PrintIndices(os);
|
|
||||||
inner_matcher_.DescribeTo(os);
|
|
||||||
}
|
|
||||||
|
|
||||||
virtual void DescribeNegationTo(::std::ostream* os) const {
|
|
||||||
*os << "are a tuple ";
|
|
||||||
PrintIndices(os);
|
|
||||||
inner_matcher_.DescribeNegationTo(os);
|
|
||||||
}
|
|
||||||
|
|
||||||
private:
|
|
||||||
static SelectedArgs GetSelectedArgs(ArgsTuple args) {
|
|
||||||
return TupleFields<RawArgsTuple, $ks>::GetSelectedFields(args);
|
|
||||||
}
|
|
||||||
|
|
||||||
// Prints the indices of the selected fields.
|
|
||||||
static void PrintIndices(::std::ostream* os) {
|
|
||||||
*os << "whose fields (";
|
|
||||||
const int indices[$n] = { $ks };
|
|
||||||
for (int i = 0; i < $n; i++) {
|
|
||||||
if (indices[i] < 0)
|
|
||||||
break;
|
|
||||||
|
|
||||||
if (i >= 1)
|
|
||||||
*os << ", ";
|
|
||||||
|
|
||||||
*os << "#" << indices[i];
|
|
||||||
}
|
|
||||||
*os << ") ";
|
|
||||||
}
|
|
||||||
|
|
||||||
const MonomorphicInnerMatcher inner_matcher_;
|
|
||||||
|
|
||||||
GTEST_DISALLOW_ASSIGN_(ArgsMatcherImpl);
|
|
||||||
};
|
|
||||||
|
|
||||||
template <class InnerMatcher$for i [[, int k$i = -1]]>
|
|
||||||
class ArgsMatcher {
|
|
||||||
public:
|
|
||||||
explicit ArgsMatcher(const InnerMatcher& inner_matcher)
|
|
||||||
: inner_matcher_(inner_matcher) {}
|
|
||||||
|
|
||||||
template <typename ArgsTuple>
|
|
||||||
operator Matcher<ArgsTuple>() const {
|
|
||||||
return MakeMatcher(new ArgsMatcherImpl<ArgsTuple, $ks>(inner_matcher_));
|
|
||||||
}
|
|
||||||
|
|
||||||
private:
|
|
||||||
const InnerMatcher inner_matcher_;
|
|
||||||
|
|
||||||
GTEST_DISALLOW_ASSIGN_(ArgsMatcher);
|
|
||||||
};
|
|
||||||
|
|
||||||
// A set of metafunctions for computing the result type of AllOf.
|
|
||||||
// AllOf(m1, ..., mN) returns
|
|
||||||
// AllOfResultN<decltype(m1), ..., decltype(mN)>::type.
|
|
||||||
|
|
||||||
// Although AllOf isn't defined for one argument, AllOfResult1 is defined
|
|
||||||
// to simplify the implementation.
|
|
||||||
template <typename M1>
|
|
||||||
struct AllOfResult1 {
|
|
||||||
typedef M1 type;
|
|
||||||
};
|
|
||||||
|
|
||||||
$range i 1..n
|
|
||||||
|
|
||||||
$range i 2..n
|
|
||||||
$for i [[
|
|
||||||
$range j 2..i
|
|
||||||
$var m = i/2
|
|
||||||
$range k 1..m
|
|
||||||
$range t m+1..i
|
|
||||||
|
|
||||||
template <typename M1$for j [[, typename M$j]]>
|
|
||||||
struct AllOfResult$i {
|
|
||||||
typedef BothOfMatcher<
|
|
||||||
typename AllOfResult$m<$for k, [[M$k]]>::type,
|
|
||||||
typename AllOfResult$(i-m)<$for t, [[M$t]]>::type
|
|
||||||
> type;
|
|
||||||
};
|
|
||||||
|
|
||||||
]]
|
|
||||||
|
|
||||||
// A set of metafunctions for computing the result type of AnyOf.
|
|
||||||
// AnyOf(m1, ..., mN) returns
|
|
||||||
// AnyOfResultN<decltype(m1), ..., decltype(mN)>::type.
|
|
||||||
|
|
||||||
// Although AnyOf isn't defined for one argument, AnyOfResult1 is defined
|
|
||||||
// to simplify the implementation.
|
|
||||||
template <typename M1>
|
|
||||||
struct AnyOfResult1 {
|
|
||||||
typedef M1 type;
|
|
||||||
};
|
|
||||||
|
|
||||||
$range i 1..n
|
|
||||||
|
|
||||||
$range i 2..n
|
|
||||||
$for i [[
|
|
||||||
$range j 2..i
|
|
||||||
$var m = i/2
|
|
||||||
$range k 1..m
|
|
||||||
$range t m+1..i
|
|
||||||
|
|
||||||
template <typename M1$for j [[, typename M$j]]>
|
|
||||||
struct AnyOfResult$i {
|
|
||||||
typedef EitherOfMatcher<
|
|
||||||
typename AnyOfResult$m<$for k, [[M$k]]>::type,
|
|
||||||
typename AnyOfResult$(i-m)<$for t, [[M$t]]>::type
|
|
||||||
> type;
|
|
||||||
};
|
|
||||||
|
|
||||||
]]
|
|
||||||
|
|
||||||
} // namespace internal
|
|
||||||
|
|
||||||
// Args<N1, N2, ..., Nk>(a_matcher) matches a tuple if the selected
|
|
||||||
// fields of it matches a_matcher. C++ doesn't support default
|
|
||||||
// arguments for function templates, so we have to overload it.
|
|
||||||
|
|
||||||
$range i 0..n
|
|
||||||
$for i [[
|
|
||||||
$range j 1..i
|
|
||||||
template <$for j [[int k$j, ]]typename InnerMatcher>
|
|
||||||
inline internal::ArgsMatcher<InnerMatcher$for j [[, k$j]]>
|
|
||||||
Args(const InnerMatcher& matcher) {
|
|
||||||
return internal::ArgsMatcher<InnerMatcher$for j [[, k$j]]>(matcher);
|
|
||||||
}
|
|
||||||
|
|
||||||
|
|
||||||
]]
|
|
||||||
// ElementsAre(e_1, e_2, ... e_n) matches an STL-style container with
|
|
||||||
// n elements, where the i-th element in the container must
|
|
||||||
// match the i-th argument in the list. Each argument of
|
|
||||||
// ElementsAre() can be either a value or a matcher. We support up to
|
|
||||||
// $n arguments.
|
|
||||||
//
|
|
||||||
// The use of DecayArray in the implementation allows ElementsAre()
|
|
||||||
// to accept string literals, whose type is const char[N], but we
|
|
||||||
// want to treat them as const char*.
|
|
||||||
//
|
|
||||||
// NOTE: Since ElementsAre() cares about the order of the elements, it
|
|
||||||
// must not be used with containers whose elements's order is
|
|
||||||
// undefined (e.g. hash_map).
|
|
||||||
|
|
||||||
$range i 0..n
|
|
||||||
$for i [[
|
|
||||||
|
|
||||||
$range j 1..i
|
|
||||||
|
|
||||||
$if i>0 [[
|
|
||||||
|
|
||||||
template <$for j, [[typename T$j]]>
|
|
||||||
]]
|
|
||||||
|
|
||||||
inline internal::ElementsAreMatcher<
|
|
||||||
::testing::tuple<
|
|
||||||
$for j, [[
|
|
||||||
|
|
||||||
typename internal::DecayArray<T$j[[]]>::type]]> >
|
|
||||||
ElementsAre($for j, [[const T$j& e$j]]) {
|
|
||||||
typedef ::testing::tuple<
|
|
||||||
$for j, [[
|
|
||||||
|
|
||||||
typename internal::DecayArray<T$j[[]]>::type]]> Args;
|
|
||||||
return internal::ElementsAreMatcher<Args>(Args($for j, [[e$j]]));
|
|
||||||
}
|
|
||||||
|
|
||||||
]]
|
|
||||||
|
|
||||||
// UnorderedElementsAre(e_1, e_2, ..., e_n) is an ElementsAre extension
|
|
||||||
// that matches n elements in any order. We support up to n=$n arguments.
|
|
||||||
//
|
|
||||||
// If you have >$n elements, consider UnorderedElementsAreArray() or
|
|
||||||
// UnorderedPointwise() instead.
|
|
||||||
|
|
||||||
$range i 0..n
|
|
||||||
$for i [[
|
|
||||||
|
|
||||||
$range j 1..i
|
|
||||||
|
|
||||||
$if i>0 [[
|
|
||||||
|
|
||||||
template <$for j, [[typename T$j]]>
|
|
||||||
]]
|
|
||||||
|
|
||||||
inline internal::UnorderedElementsAreMatcher<
|
|
||||||
::testing::tuple<
|
|
||||||
$for j, [[
|
|
||||||
|
|
||||||
typename internal::DecayArray<T$j[[]]>::type]]> >
|
|
||||||
UnorderedElementsAre($for j, [[const T$j& e$j]]) {
|
|
||||||
typedef ::testing::tuple<
|
|
||||||
$for j, [[
|
|
||||||
|
|
||||||
typename internal::DecayArray<T$j[[]]>::type]]> Args;
|
|
||||||
return internal::UnorderedElementsAreMatcher<Args>(Args($for j, [[e$j]]));
|
|
||||||
}
|
|
||||||
|
|
||||||
]]
|
|
||||||
|
|
||||||
// AllOf(m1, m2, ..., mk) matches any value that matches all of the given
|
|
||||||
// sub-matchers. AllOf is called fully qualified to prevent ADL from firing.
|
|
||||||
|
|
||||||
$range i 2..n
|
|
||||||
$for i [[
|
|
||||||
$range j 1..i
|
|
||||||
$var m = i/2
|
|
||||||
$range k 1..m
|
|
||||||
$range t m+1..i
|
|
||||||
|
|
||||||
template <$for j, [[typename M$j]]>
|
|
||||||
inline typename internal::AllOfResult$i<$for j, [[M$j]]>::type
|
|
||||||
AllOf($for j, [[M$j m$j]]) {
|
|
||||||
return typename internal::AllOfResult$i<$for j, [[M$j]]>::type(
|
|
||||||
$if m == 1 [[m1]] $else [[::testing::AllOf($for k, [[m$k]])]],
|
|
||||||
$if m+1 == i [[m$i]] $else [[::testing::AllOf($for t, [[m$t]])]]);
|
|
||||||
}
|
|
||||||
|
|
||||||
]]
|
|
||||||
|
|
||||||
// AnyOf(m1, m2, ..., mk) matches any value that matches any of the given
|
|
||||||
// sub-matchers. AnyOf is called fully qualified to prevent ADL from firing.
|
|
||||||
|
|
||||||
$range i 2..n
|
|
||||||
$for i [[
|
|
||||||
$range j 1..i
|
|
||||||
$var m = i/2
|
|
||||||
$range k 1..m
|
|
||||||
$range t m+1..i
|
|
||||||
|
|
||||||
template <$for j, [[typename M$j]]>
|
|
||||||
inline typename internal::AnyOfResult$i<$for j, [[M$j]]>::type
|
|
||||||
AnyOf($for j, [[M$j m$j]]) {
|
|
||||||
return typename internal::AnyOfResult$i<$for j, [[M$j]]>::type(
|
|
||||||
$if m == 1 [[m1]] $else [[::testing::AnyOf($for k, [[m$k]])]],
|
|
||||||
$if m+1 == i [[m$i]] $else [[::testing::AnyOf($for t, [[m$t]])]]);
|
|
||||||
}
|
|
||||||
|
|
||||||
]]
|
|
||||||
|
|
||||||
} // namespace testing
|
|
||||||
$$ } // This Pump meta comment fixes auto-indentation in Emacs. It will not
|
|
||||||
$$ // show up in the generated code.
|
|
||||||
|
|
||||||
|
|
||||||
// The MATCHER* family of macros can be used in a namespace scope to
|
|
||||||
// define custom matchers easily.
|
|
||||||
//
|
|
||||||
// Basic Usage
|
|
||||||
// ===========
|
|
||||||
//
|
|
||||||
// The syntax
|
|
||||||
//
|
|
||||||
// MATCHER(name, description_string) { statements; }
|
|
||||||
//
|
|
||||||
// defines a matcher with the given name that executes the statements,
|
|
||||||
// which must return a bool to indicate if the match succeeds. Inside
|
|
||||||
// the statements, you can refer to the value being matched by 'arg',
|
|
||||||
// and refer to its type by 'arg_type'.
|
|
||||||
//
|
|
||||||
// The description string documents what the matcher does, and is used
|
|
||||||
// to generate the failure message when the match fails. Since a
|
|
||||||
// MATCHER() is usually defined in a header file shared by multiple
|
|
||||||
// C++ source files, we require the description to be a C-string
|
|
||||||
// literal to avoid possible side effects. It can be empty, in which
|
|
||||||
// case we'll use the sequence of words in the matcher name as the
|
|
||||||
// description.
|
|
||||||
//
|
|
||||||
// For example:
|
|
||||||
//
|
|
||||||
// MATCHER(IsEven, "") { return (arg % 2) == 0; }
|
|
||||||
//
|
|
||||||
// allows you to write
|
|
||||||
//
|
|
||||||
// // Expects mock_foo.Bar(n) to be called where n is even.
|
|
||||||
// EXPECT_CALL(mock_foo, Bar(IsEven()));
|
|
||||||
//
|
|
||||||
// or,
|
|
||||||
//
|
|
||||||
// // Verifies that the value of some_expression is even.
|
|
||||||
// EXPECT_THAT(some_expression, IsEven());
|
|
||||||
//
|
|
||||||
// If the above assertion fails, it will print something like:
|
|
||||||
//
|
|
||||||
// Value of: some_expression
|
|
||||||
// Expected: is even
|
|
||||||
// Actual: 7
|
|
||||||
//
|
|
||||||
// where the description "is even" is automatically calculated from the
|
|
||||||
// matcher name IsEven.
|
|
||||||
//
|
|
||||||
// Argument Type
|
|
||||||
// =============
|
|
||||||
//
|
|
||||||
// Note that the type of the value being matched (arg_type) is
|
|
||||||
// determined by the context in which you use the matcher and is
|
|
||||||
// supplied to you by the compiler, so you don't need to worry about
|
|
||||||
// declaring it (nor can you). This allows the matcher to be
|
|
||||||
// polymorphic. For example, IsEven() can be used to match any type
|
|
||||||
// where the value of "(arg % 2) == 0" can be implicitly converted to
|
|
||||||
// a bool. In the "Bar(IsEven())" example above, if method Bar()
|
|
||||||
// takes an int, 'arg_type' will be int; if it takes an unsigned long,
|
|
||||||
// 'arg_type' will be unsigned long; and so on.
|
|
||||||
//
|
|
||||||
// Parameterizing Matchers
|
|
||||||
// =======================
|
|
||||||
//
|
|
||||||
// Sometimes you'll want to parameterize the matcher. For that you
|
|
||||||
// can use another macro:
|
|
||||||
//
|
|
||||||
// MATCHER_P(name, param_name, description_string) { statements; }
|
|
||||||
//
|
|
||||||
// For example:
|
|
||||||
//
|
|
||||||
// MATCHER_P(HasAbsoluteValue, value, "") { return abs(arg) == value; }
|
|
||||||
//
|
|
||||||
// will allow you to write:
|
|
||||||
//
|
|
||||||
// EXPECT_THAT(Blah("a"), HasAbsoluteValue(n));
|
|
||||||
//
|
|
||||||
// which may lead to this message (assuming n is 10):
|
|
||||||
//
|
|
||||||
// Value of: Blah("a")
|
|
||||||
// Expected: has absolute value 10
|
|
||||||
// Actual: -9
|
|
||||||
//
|
|
||||||
// Note that both the matcher description and its parameter are
|
|
||||||
// printed, making the message human-friendly.
|
|
||||||
//
|
|
||||||
// In the matcher definition body, you can write 'foo_type' to
|
|
||||||
// reference the type of a parameter named 'foo'. For example, in the
|
|
||||||
// body of MATCHER_P(HasAbsoluteValue, value) above, you can write
|
|
||||||
// 'value_type' to refer to the type of 'value'.
|
|
||||||
//
|
|
||||||
// We also provide MATCHER_P2, MATCHER_P3, ..., up to MATCHER_P$n to
|
|
||||||
// support multi-parameter matchers.
|
|
||||||
//
|
|
||||||
// Describing Parameterized Matchers
|
|
||||||
// =================================
|
|
||||||
//
|
|
||||||
// The last argument to MATCHER*() is a string-typed expression. The
|
|
||||||
// expression can reference all of the matcher's parameters and a
|
|
||||||
// special bool-typed variable named 'negation'. When 'negation' is
|
|
||||||
// false, the expression should evaluate to the matcher's description;
|
|
||||||
// otherwise it should evaluate to the description of the negation of
|
|
||||||
// the matcher. For example,
|
|
||||||
//
|
|
||||||
// using testing::PrintToString;
|
|
||||||
//
|
|
||||||
// MATCHER_P2(InClosedRange, low, hi,
|
|
||||||
// std::string(negation ? "is not" : "is") + " in range [" +
|
|
||||||
// PrintToString(low) + ", " + PrintToString(hi) + "]") {
|
|
||||||
// return low <= arg && arg <= hi;
|
|
||||||
// }
|
|
||||||
// ...
|
|
||||||
// EXPECT_THAT(3, InClosedRange(4, 6));
|
|
||||||
// EXPECT_THAT(3, Not(InClosedRange(2, 4)));
|
|
||||||
//
|
|
||||||
// would generate two failures that contain the text:
|
|
||||||
//
|
|
||||||
// Expected: is in range [4, 6]
|
|
||||||
// ...
|
|
||||||
// Expected: is not in range [2, 4]
|
|
||||||
//
|
|
||||||
// If you specify "" as the description, the failure message will
|
|
||||||
// contain the sequence of words in the matcher name followed by the
|
|
||||||
// parameter values printed as a tuple. For example,
|
|
||||||
//
|
|
||||||
// MATCHER_P2(InClosedRange, low, hi, "") { ... }
|
|
||||||
// ...
|
|
||||||
// EXPECT_THAT(3, InClosedRange(4, 6));
|
|
||||||
// EXPECT_THAT(3, Not(InClosedRange(2, 4)));
|
|
||||||
//
|
|
||||||
// would generate two failures that contain the text:
|
|
||||||
//
|
|
||||||
// Expected: in closed range (4, 6)
|
|
||||||
// ...
|
|
||||||
// Expected: not (in closed range (2, 4))
|
|
||||||
//
|
|
||||||
// Types of Matcher Parameters
|
|
||||||
// ===========================
|
|
||||||
//
|
|
||||||
// For the purpose of typing, you can view
|
|
||||||
//
|
|
||||||
// MATCHER_Pk(Foo, p1, ..., pk, description_string) { ... }
|
|
||||||
//
|
|
||||||
// as shorthand for
|
|
||||||
//
|
|
||||||
// template <typename p1_type, ..., typename pk_type>
|
|
||||||
// FooMatcherPk<p1_type, ..., pk_type>
|
|
||||||
// Foo(p1_type p1, ..., pk_type pk) { ... }
|
|
||||||
//
|
|
||||||
// When you write Foo(v1, ..., vk), the compiler infers the types of
|
|
||||||
// the parameters v1, ..., and vk for you. If you are not happy with
|
|
||||||
// the result of the type inference, you can specify the types by
|
|
||||||
// explicitly instantiating the template, as in Foo<long, bool>(5,
|
|
||||||
// false). As said earlier, you don't get to (or need to) specify
|
|
||||||
// 'arg_type' as that's determined by the context in which the matcher
|
|
||||||
// is used. You can assign the result of expression Foo(p1, ..., pk)
|
|
||||||
// to a variable of type FooMatcherPk<p1_type, ..., pk_type>. This
|
|
||||||
// can be useful when composing matchers.
|
|
||||||
//
|
|
||||||
// While you can instantiate a matcher template with reference types,
|
|
||||||
// passing the parameters by pointer usually makes your code more
|
|
||||||
// readable. If, however, you still want to pass a parameter by
|
|
||||||
// reference, be aware that in the failure message generated by the
|
|
||||||
// matcher you will see the value of the referenced object but not its
|
|
||||||
// address.
|
|
||||||
//
|
|
||||||
// Explaining Match Results
|
|
||||||
// ========================
|
|
||||||
//
|
|
||||||
// Sometimes the matcher description alone isn't enough to explain why
|
|
||||||
// the match has failed or succeeded. For example, when expecting a
|
|
||||||
// long string, it can be very helpful to also print the diff between
|
|
||||||
// the expected string and the actual one. To achieve that, you can
|
|
||||||
// optionally stream additional information to a special variable
|
|
||||||
// named result_listener, whose type is a pointer to class
|
|
||||||
// MatchResultListener:
|
|
||||||
//
|
|
||||||
// MATCHER_P(EqualsLongString, str, "") {
|
|
||||||
// if (arg == str) return true;
|
|
||||||
//
|
|
||||||
// *result_listener << "the difference: "
|
|
||||||
/// << DiffStrings(str, arg);
|
|
||||||
// return false;
|
|
||||||
// }
|
|
||||||
//
|
|
||||||
// Overloading Matchers
|
|
||||||
// ====================
|
|
||||||
//
|
|
||||||
// You can overload matchers with different numbers of parameters:
|
|
||||||
//
|
|
||||||
// MATCHER_P(Blah, a, description_string1) { ... }
|
|
||||||
// MATCHER_P2(Blah, a, b, description_string2) { ... }
|
|
||||||
//
|
|
||||||
// Caveats
|
|
||||||
// =======
|
|
||||||
//
|
|
||||||
// When defining a new matcher, you should also consider implementing
|
|
||||||
// MatcherInterface or using MakePolymorphicMatcher(). These
|
|
||||||
// approaches require more work than the MATCHER* macros, but also
|
|
||||||
// give you more control on the types of the value being matched and
|
|
||||||
// the matcher parameters, which may leads to better compiler error
|
|
||||||
// messages when the matcher is used wrong. They also allow
|
|
||||||
// overloading matchers based on parameter types (as opposed to just
|
|
||||||
// based on the number of parameters).
|
|
||||||
//
|
|
||||||
// MATCHER*() can only be used in a namespace scope. The reason is
|
|
||||||
// that C++ doesn't yet allow function-local types to be used to
|
|
||||||
// instantiate templates. The up-coming C++0x standard will fix this.
|
|
||||||
// Once that's done, we'll consider supporting using MATCHER*() inside
|
|
||||||
// a function.
|
|
||||||
//
|
|
||||||
// More Information
|
|
||||||
// ================
|
|
||||||
//
|
|
||||||
// To learn more about using these macros, please search for 'MATCHER'
|
|
||||||
// on
|
|
||||||
// https://github.com/google/googletest/blob/master/googlemock/docs/CookBook.md
|
|
||||||
|
|
||||||
$range i 0..n
|
|
||||||
$for i
|
|
||||||
|
|
||||||
[[
|
|
||||||
$var macro_name = [[$if i==0 [[MATCHER]] $elif i==1 [[MATCHER_P]]
|
|
||||||
$else [[MATCHER_P$i]]]]
|
|
||||||
$var class_name = [[name##Matcher[[$if i==0 [[]] $elif i==1 [[P]]
|
|
||||||
$else [[P$i]]]]]]
|
|
||||||
$range j 0..i-1
|
|
||||||
$var template = [[$if i==0 [[]] $else [[
|
|
||||||
|
|
||||||
template <$for j, [[typename p$j##_type]]>\
|
|
||||||
]]]]
|
|
||||||
$var ctor_param_list = [[$for j, [[p$j##_type gmock_p$j]]]]
|
|
||||||
$var impl_ctor_param_list = [[$for j, [[p$j##_type gmock_p$j]]]]
|
|
||||||
$var impl_inits = [[$if i==0 [[]] $else [[ : $for j, [[p$j(::testing::internal::move(gmock_p$j))]]]]]]
|
|
||||||
$var inits = [[$if i==0 [[]] $else [[ : $for j, [[p$j(::testing::internal::move(gmock_p$j))]]]]]]
|
|
||||||
$var params = [[$for j, [[p$j]]]]
|
|
||||||
$var param_types = [[$if i==0 [[]] $else [[<$for j, [[p$j##_type]]>]]]]
|
|
||||||
$var param_types_and_names = [[$for j, [[p$j##_type p$j]]]]
|
|
||||||
$var param_field_decls = [[$for j
|
|
||||||
[[
|
|
||||||
|
|
||||||
p$j##_type const p$j;\
|
|
||||||
]]]]
|
|
||||||
$var param_field_decls2 = [[$for j
|
|
||||||
[[
|
|
||||||
|
|
||||||
p$j##_type const p$j;\
|
|
||||||
]]]]
|
|
||||||
|
|
||||||
#define $macro_name(name$for j [[, p$j]], description)\$template
|
|
||||||
class $class_name {\
|
|
||||||
public:\
|
|
||||||
template <typename arg_type>\
|
|
||||||
class gmock_Impl : public ::testing::MatcherInterface<\
|
|
||||||
GTEST_REFERENCE_TO_CONST_(arg_type)> {\
|
|
||||||
public:\
|
|
||||||
[[$if i==1 [[explicit ]]]]gmock_Impl($impl_ctor_param_list)\
|
|
||||||
$impl_inits {}\
|
|
||||||
virtual bool MatchAndExplain(\
|
|
||||||
GTEST_REFERENCE_TO_CONST_(arg_type) arg,\
|
|
||||||
::testing::MatchResultListener* result_listener) const;\
|
|
||||||
virtual void DescribeTo(::std::ostream* gmock_os) const {\
|
|
||||||
*gmock_os << FormatDescription(false);\
|
|
||||||
}\
|
|
||||||
virtual void DescribeNegationTo(::std::ostream* gmock_os) const {\
|
|
||||||
*gmock_os << FormatDescription(true);\
|
|
||||||
}\$param_field_decls
|
|
||||||
private:\
|
|
||||||
::std::string FormatDescription(bool negation) const {\
|
|
||||||
::std::string gmock_description = (description);\
|
|
||||||
if (!gmock_description.empty()) {\
|
|
||||||
return gmock_description;\
|
|
||||||
}\
|
|
||||||
return ::testing::internal::FormatMatcherDescription(\
|
|
||||||
negation, #name, \
|
|
||||||
::testing::internal::UniversalTersePrintTupleFieldsToStrings(\
|
|
||||||
::testing::tuple<$for j, [[p$j##_type]]>($for j, [[p$j]])));\
|
|
||||||
}\
|
|
||||||
};\
|
|
||||||
template <typename arg_type>\
|
|
||||||
operator ::testing::Matcher<arg_type>() const {\
|
|
||||||
return ::testing::Matcher<arg_type>(\
|
|
||||||
new gmock_Impl<arg_type>($params));\
|
|
||||||
}\
|
|
||||||
[[$if i==1 [[explicit ]]]]$class_name($ctor_param_list)$inits {\
|
|
||||||
}\$param_field_decls2
|
|
||||||
private:\
|
|
||||||
};\$template
|
|
||||||
inline $class_name$param_types name($param_types_and_names) {\
|
|
||||||
return $class_name$param_types($params);\
|
|
||||||
}\$template
|
|
||||||
template <typename arg_type>\
|
|
||||||
bool $class_name$param_types::gmock_Impl<arg_type>::MatchAndExplain(\
|
|
||||||
GTEST_REFERENCE_TO_CONST_(arg_type) arg,\
|
|
||||||
::testing::MatchResultListener* result_listener GTEST_ATTRIBUTE_UNUSED_)\
|
|
||||||
const
|
|
||||||
]]
|
|
||||||
|
|
||||||
|
|
||||||
#endif // GMOCK_INCLUDE_GMOCK_GMOCK_GENERATED_MATCHERS_H_
|
|
@ -1,459 +0,0 @@
|
|||||||
// This file was GENERATED by command:
|
|
||||||
// pump.py gmock-generated-nice-strict.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.
|
|
||||||
|
|
||||||
|
|
||||||
// Implements class templates NiceMock, NaggyMock, and StrictMock.
|
|
||||||
//
|
|
||||||
// Given a mock class MockFoo that is created using Google Mock,
|
|
||||||
// NiceMock<MockFoo> is a subclass of MockFoo that allows
|
|
||||||
// uninteresting calls (i.e. calls to mock methods that have no
|
|
||||||
// EXPECT_CALL specs), NaggyMock<MockFoo> is a subclass of MockFoo
|
|
||||||
// that prints a warning when an uninteresting call occurs, and
|
|
||||||
// StrictMock<MockFoo> is a subclass of MockFoo that treats all
|
|
||||||
// uninteresting calls as errors.
|
|
||||||
//
|
|
||||||
// Currently a mock is naggy by default, so MockFoo and
|
|
||||||
// NaggyMock<MockFoo> behave like the same. However, we will soon
|
|
||||||
// switch the default behavior of mocks to be nice, as that in general
|
|
||||||
// leads to more maintainable tests. When that happens, MockFoo will
|
|
||||||
// stop behaving like NaggyMock<MockFoo> and start behaving like
|
|
||||||
// NiceMock<MockFoo>.
|
|
||||||
//
|
|
||||||
// NiceMock, NaggyMock, and StrictMock "inherit" the constructors of
|
|
||||||
// their respective base class. Therefore you can write
|
|
||||||
// NiceMock<MockFoo>(5, "a") to construct a nice mock where MockFoo
|
|
||||||
// has a constructor that accepts (int, const char*), for example.
|
|
||||||
//
|
|
||||||
// A known limitation is that NiceMock<MockFoo>, NaggyMock<MockFoo>,
|
|
||||||
// and StrictMock<MockFoo> only works for mock methods defined using
|
|
||||||
// the MOCK_METHOD* family of macros DIRECTLY in the MockFoo class.
|
|
||||||
// If a mock method is defined in a base class of MockFoo, the "nice"
|
|
||||||
// or "strict" modifier may not affect it, depending on the compiler.
|
|
||||||
// In particular, nesting NiceMock, NaggyMock, and StrictMock is NOT
|
|
||||||
// supported.
|
|
||||||
|
|
||||||
// GOOGLETEST_CM0002 DO NOT DELETE
|
|
||||||
|
|
||||||
#ifndef GMOCK_INCLUDE_GMOCK_GMOCK_GENERATED_NICE_STRICT_H_
|
|
||||||
#define GMOCK_INCLUDE_GMOCK_GMOCK_GENERATED_NICE_STRICT_H_
|
|
||||||
|
|
||||||
#include "gmock/gmock-spec-builders.h"
|
|
||||||
#include "gmock/internal/gmock-port.h"
|
|
||||||
|
|
||||||
namespace testing {
|
|
||||||
|
|
||||||
template <class MockClass>
|
|
||||||
class NiceMock : public MockClass {
|
|
||||||
public:
|
|
||||||
NiceMock() : MockClass() {
|
|
||||||
::testing::Mock::AllowUninterestingCalls(
|
|
||||||
internal::ImplicitCast_<MockClass*>(this));
|
|
||||||
}
|
|
||||||
|
|
||||||
#if GTEST_LANG_CXX11
|
|
||||||
// Ideally, we would inherit base class's constructors through a using
|
|
||||||
// declaration, which would preserve their visibility. However, many existing
|
|
||||||
// tests rely on the fact that current implementation reexports protected
|
|
||||||
// constructors as public. These tests would need to be cleaned up first.
|
|
||||||
|
|
||||||
// Single argument constructor is special-cased so that it can be
|
|
||||||
// made explicit.
|
|
||||||
template <typename A>
|
|
||||||
explicit NiceMock(A&& arg) : MockClass(std::forward<A>(arg)) {
|
|
||||||
::testing::Mock::AllowUninterestingCalls(
|
|
||||||
internal::ImplicitCast_<MockClass*>(this));
|
|
||||||
}
|
|
||||||
|
|
||||||
template <typename A1, typename A2, typename... An>
|
|
||||||
NiceMock(A1&& arg1, A2&& arg2, An&&... args)
|
|
||||||
: MockClass(std::forward<A1>(arg1), std::forward<A2>(arg2),
|
|
||||||
std::forward<An>(args)...) {
|
|
||||||
::testing::Mock::AllowUninterestingCalls(
|
|
||||||
internal::ImplicitCast_<MockClass*>(this));
|
|
||||||
}
|
|
||||||
#else
|
|
||||||
// C++98 doesn't have variadic templates, so we have to define one
|
|
||||||
// for each arity.
|
|
||||||
template <typename A1>
|
|
||||||
explicit NiceMock(const A1& a1) : MockClass(a1) {
|
|
||||||
::testing::Mock::AllowUninterestingCalls(
|
|
||||||
internal::ImplicitCast_<MockClass*>(this));
|
|
||||||
}
|
|
||||||
template <typename A1, typename A2>
|
|
||||||
NiceMock(const A1& a1, const A2& a2) : MockClass(a1, a2) {
|
|
||||||
::testing::Mock::AllowUninterestingCalls(
|
|
||||||
internal::ImplicitCast_<MockClass*>(this));
|
|
||||||
}
|
|
||||||
|
|
||||||
template <typename A1, typename A2, typename A3>
|
|
||||||
NiceMock(const A1& a1, const A2& a2, const A3& a3) : MockClass(a1, a2, a3) {
|
|
||||||
::testing::Mock::AllowUninterestingCalls(
|
|
||||||
internal::ImplicitCast_<MockClass*>(this));
|
|
||||||
}
|
|
||||||
|
|
||||||
template <typename A1, typename A2, typename A3, typename A4>
|
|
||||||
NiceMock(const A1& a1, const A2& a2, const A3& a3,
|
|
||||||
const A4& a4) : MockClass(a1, a2, a3, a4) {
|
|
||||||
::testing::Mock::AllowUninterestingCalls(
|
|
||||||
internal::ImplicitCast_<MockClass*>(this));
|
|
||||||
}
|
|
||||||
|
|
||||||
template <typename A1, typename A2, typename A3, typename A4, typename A5>
|
|
||||||
NiceMock(const A1& a1, const A2& a2, const A3& a3, const A4& a4,
|
|
||||||
const A5& a5) : MockClass(a1, a2, a3, a4, a5) {
|
|
||||||
::testing::Mock::AllowUninterestingCalls(
|
|
||||||
internal::ImplicitCast_<MockClass*>(this));
|
|
||||||
}
|
|
||||||
|
|
||||||
template <typename A1, typename A2, typename A3, typename A4, typename A5,
|
|
||||||
typename A6>
|
|
||||||
NiceMock(const A1& a1, const A2& a2, const A3& a3, const A4& a4,
|
|
||||||
const A5& a5, const A6& a6) : MockClass(a1, a2, a3, a4, a5, a6) {
|
|
||||||
::testing::Mock::AllowUninterestingCalls(
|
|
||||||
internal::ImplicitCast_<MockClass*>(this));
|
|
||||||
}
|
|
||||||
|
|
||||||
template <typename A1, typename A2, typename A3, typename A4, typename A5,
|
|
||||||
typename A6, typename A7>
|
|
||||||
NiceMock(const A1& a1, const A2& a2, const A3& a3, const A4& a4,
|
|
||||||
const A5& a5, const A6& a6, const A7& a7) : MockClass(a1, a2, a3, a4, a5,
|
|
||||||
a6, a7) {
|
|
||||||
::testing::Mock::AllowUninterestingCalls(
|
|
||||||
internal::ImplicitCast_<MockClass*>(this));
|
|
||||||
}
|
|
||||||
|
|
||||||
template <typename A1, typename A2, typename A3, typename A4, typename A5,
|
|
||||||
typename A6, typename A7, typename A8>
|
|
||||||
NiceMock(const A1& a1, const A2& a2, const A3& a3, const A4& a4,
|
|
||||||
const A5& a5, const A6& a6, const A7& a7, const A8& a8) : MockClass(a1,
|
|
||||||
a2, a3, a4, a5, a6, a7, a8) {
|
|
||||||
::testing::Mock::AllowUninterestingCalls(
|
|
||||||
internal::ImplicitCast_<MockClass*>(this));
|
|
||||||
}
|
|
||||||
|
|
||||||
template <typename A1, typename A2, typename A3, typename A4, typename A5,
|
|
||||||
typename A6, typename A7, typename A8, typename A9>
|
|
||||||
NiceMock(const A1& a1, const A2& a2, const A3& a3, const A4& a4,
|
|
||||||
const A5& a5, const A6& a6, const A7& a7, const A8& a8,
|
|
||||||
const A9& a9) : MockClass(a1, a2, a3, a4, a5, a6, a7, a8, a9) {
|
|
||||||
::testing::Mock::AllowUninterestingCalls(
|
|
||||||
internal::ImplicitCast_<MockClass*>(this));
|
|
||||||
}
|
|
||||||
|
|
||||||
template <typename A1, typename A2, typename A3, typename A4, typename A5,
|
|
||||||
typename A6, typename A7, typename A8, typename A9, typename A10>
|
|
||||||
NiceMock(const A1& a1, const A2& a2, const A3& a3, const A4& a4,
|
|
||||||
const A5& a5, const A6& a6, const A7& a7, const A8& a8, const A9& a9,
|
|
||||||
const A10& a10) : MockClass(a1, a2, a3, a4, a5, a6, a7, a8, a9, a10) {
|
|
||||||
::testing::Mock::AllowUninterestingCalls(
|
|
||||||
internal::ImplicitCast_<MockClass*>(this));
|
|
||||||
}
|
|
||||||
|
|
||||||
#endif // GTEST_LANG_CXX11
|
|
||||||
|
|
||||||
~NiceMock() {
|
|
||||||
::testing::Mock::UnregisterCallReaction(
|
|
||||||
internal::ImplicitCast_<MockClass*>(this));
|
|
||||||
}
|
|
||||||
|
|
||||||
private:
|
|
||||||
GTEST_DISALLOW_COPY_AND_ASSIGN_(NiceMock);
|
|
||||||
};
|
|
||||||
|
|
||||||
template <class MockClass>
|
|
||||||
class NaggyMock : public MockClass {
|
|
||||||
public:
|
|
||||||
NaggyMock() : MockClass() {
|
|
||||||
::testing::Mock::WarnUninterestingCalls(
|
|
||||||
internal::ImplicitCast_<MockClass*>(this));
|
|
||||||
}
|
|
||||||
|
|
||||||
#if GTEST_LANG_CXX11
|
|
||||||
// Ideally, we would inherit base class's constructors through a using
|
|
||||||
// declaration, which would preserve their visibility. However, many existing
|
|
||||||
// tests rely on the fact that current implementation reexports protected
|
|
||||||
// constructors as public. These tests would need to be cleaned up first.
|
|
||||||
|
|
||||||
// Single argument constructor is special-cased so that it can be
|
|
||||||
// made explicit.
|
|
||||||
template <typename A>
|
|
||||||
explicit NaggyMock(A&& arg) : MockClass(std::forward<A>(arg)) {
|
|
||||||
::testing::Mock::WarnUninterestingCalls(
|
|
||||||
internal::ImplicitCast_<MockClass*>(this));
|
|
||||||
}
|
|
||||||
|
|
||||||
template <typename A1, typename A2, typename... An>
|
|
||||||
NaggyMock(A1&& arg1, A2&& arg2, An&&... args)
|
|
||||||
: MockClass(std::forward<A1>(arg1), std::forward<A2>(arg2),
|
|
||||||
std::forward<An>(args)...) {
|
|
||||||
::testing::Mock::WarnUninterestingCalls(
|
|
||||||
internal::ImplicitCast_<MockClass*>(this));
|
|
||||||
}
|
|
||||||
#else
|
|
||||||
// C++98 doesn't have variadic templates, so we have to define one
|
|
||||||
// for each arity.
|
|
||||||
template <typename A1>
|
|
||||||
explicit NaggyMock(const A1& a1) : MockClass(a1) {
|
|
||||||
::testing::Mock::WarnUninterestingCalls(
|
|
||||||
internal::ImplicitCast_<MockClass*>(this));
|
|
||||||
}
|
|
||||||
template <typename A1, typename A2>
|
|
||||||
NaggyMock(const A1& a1, const A2& a2) : MockClass(a1, a2) {
|
|
||||||
::testing::Mock::WarnUninterestingCalls(
|
|
||||||
internal::ImplicitCast_<MockClass*>(this));
|
|
||||||
}
|
|
||||||
|
|
||||||
template <typename A1, typename A2, typename A3>
|
|
||||||
NaggyMock(const A1& a1, const A2& a2, const A3& a3) : MockClass(a1, a2, a3) {
|
|
||||||
::testing::Mock::WarnUninterestingCalls(
|
|
||||||
internal::ImplicitCast_<MockClass*>(this));
|
|
||||||
}
|
|
||||||
|
|
||||||
template <typename A1, typename A2, typename A3, typename A4>
|
|
||||||
NaggyMock(const A1& a1, const A2& a2, const A3& a3,
|
|
||||||
const A4& a4) : MockClass(a1, a2, a3, a4) {
|
|
||||||
::testing::Mock::WarnUninterestingCalls(
|
|
||||||
internal::ImplicitCast_<MockClass*>(this));
|
|
||||||
}
|
|
||||||
|
|
||||||
template <typename A1, typename A2, typename A3, typename A4, typename A5>
|
|
||||||
NaggyMock(const A1& a1, const A2& a2, const A3& a3, const A4& a4,
|
|
||||||
const A5& a5) : MockClass(a1, a2, a3, a4, a5) {
|
|
||||||
::testing::Mock::WarnUninterestingCalls(
|
|
||||||
internal::ImplicitCast_<MockClass*>(this));
|
|
||||||
}
|
|
||||||
|
|
||||||
template <typename A1, typename A2, typename A3, typename A4, typename A5,
|
|
||||||
typename A6>
|
|
||||||
NaggyMock(const A1& a1, const A2& a2, const A3& a3, const A4& a4,
|
|
||||||
const A5& a5, const A6& a6) : MockClass(a1, a2, a3, a4, a5, a6) {
|
|
||||||
::testing::Mock::WarnUninterestingCalls(
|
|
||||||
internal::ImplicitCast_<MockClass*>(this));
|
|
||||||
}
|
|
||||||
|
|
||||||
template <typename A1, typename A2, typename A3, typename A4, typename A5,
|
|
||||||
typename A6, typename A7>
|
|
||||||
NaggyMock(const A1& a1, const A2& a2, const A3& a3, const A4& a4,
|
|
||||||
const A5& a5, const A6& a6, const A7& a7) : MockClass(a1, a2, a3, a4, a5,
|
|
||||||
a6, a7) {
|
|
||||||
::testing::Mock::WarnUninterestingCalls(
|
|
||||||
internal::ImplicitCast_<MockClass*>(this));
|
|
||||||
}
|
|
||||||
|
|
||||||
template <typename A1, typename A2, typename A3, typename A4, typename A5,
|
|
||||||
typename A6, typename A7, typename A8>
|
|
||||||
NaggyMock(const A1& a1, const A2& a2, const A3& a3, const A4& a4,
|
|
||||||
const A5& a5, const A6& a6, const A7& a7, const A8& a8) : MockClass(a1,
|
|
||||||
a2, a3, a4, a5, a6, a7, a8) {
|
|
||||||
::testing::Mock::WarnUninterestingCalls(
|
|
||||||
internal::ImplicitCast_<MockClass*>(this));
|
|
||||||
}
|
|
||||||
|
|
||||||
template <typename A1, typename A2, typename A3, typename A4, typename A5,
|
|
||||||
typename A6, typename A7, typename A8, typename A9>
|
|
||||||
NaggyMock(const A1& a1, const A2& a2, const A3& a3, const A4& a4,
|
|
||||||
const A5& a5, const A6& a6, const A7& a7, const A8& a8,
|
|
||||||
const A9& a9) : MockClass(a1, a2, a3, a4, a5, a6, a7, a8, a9) {
|
|
||||||
::testing::Mock::WarnUninterestingCalls(
|
|
||||||
internal::ImplicitCast_<MockClass*>(this));
|
|
||||||
}
|
|
||||||
|
|
||||||
template <typename A1, typename A2, typename A3, typename A4, typename A5,
|
|
||||||
typename A6, typename A7, typename A8, typename A9, typename A10>
|
|
||||||
NaggyMock(const A1& a1, const A2& a2, const A3& a3, const A4& a4,
|
|
||||||
const A5& a5, const A6& a6, const A7& a7, const A8& a8, const A9& a9,
|
|
||||||
const A10& a10) : MockClass(a1, a2, a3, a4, a5, a6, a7, a8, a9, a10) {
|
|
||||||
::testing::Mock::WarnUninterestingCalls(
|
|
||||||
internal::ImplicitCast_<MockClass*>(this));
|
|
||||||
}
|
|
||||||
|
|
||||||
#endif // GTEST_LANG_CXX11
|
|
||||||
|
|
||||||
~NaggyMock() {
|
|
||||||
::testing::Mock::UnregisterCallReaction(
|
|
||||||
internal::ImplicitCast_<MockClass*>(this));
|
|
||||||
}
|
|
||||||
|
|
||||||
private:
|
|
||||||
GTEST_DISALLOW_COPY_AND_ASSIGN_(NaggyMock);
|
|
||||||
};
|
|
||||||
|
|
||||||
template <class MockClass>
|
|
||||||
class StrictMock : public MockClass {
|
|
||||||
public:
|
|
||||||
StrictMock() : MockClass() {
|
|
||||||
::testing::Mock::FailUninterestingCalls(
|
|
||||||
internal::ImplicitCast_<MockClass*>(this));
|
|
||||||
}
|
|
||||||
|
|
||||||
#if GTEST_LANG_CXX11
|
|
||||||
// Ideally, we would inherit base class's constructors through a using
|
|
||||||
// declaration, which would preserve their visibility. However, many existing
|
|
||||||
// tests rely on the fact that current implementation reexports protected
|
|
||||||
// constructors as public. These tests would need to be cleaned up first.
|
|
||||||
|
|
||||||
// Single argument constructor is special-cased so that it can be
|
|
||||||
// made explicit.
|
|
||||||
template <typename A>
|
|
||||||
explicit StrictMock(A&& arg) : MockClass(std::forward<A>(arg)) {
|
|
||||||
::testing::Mock::FailUninterestingCalls(
|
|
||||||
internal::ImplicitCast_<MockClass*>(this));
|
|
||||||
}
|
|
||||||
|
|
||||||
template <typename A1, typename A2, typename... An>
|
|
||||||
StrictMock(A1&& arg1, A2&& arg2, An&&... args)
|
|
||||||
: MockClass(std::forward<A1>(arg1), std::forward<A2>(arg2),
|
|
||||||
std::forward<An>(args)...) {
|
|
||||||
::testing::Mock::FailUninterestingCalls(
|
|
||||||
internal::ImplicitCast_<MockClass*>(this));
|
|
||||||
}
|
|
||||||
#else
|
|
||||||
// C++98 doesn't have variadic templates, so we have to define one
|
|
||||||
// for each arity.
|
|
||||||
template <typename A1>
|
|
||||||
explicit StrictMock(const A1& a1) : MockClass(a1) {
|
|
||||||
::testing::Mock::FailUninterestingCalls(
|
|
||||||
internal::ImplicitCast_<MockClass*>(this));
|
|
||||||
}
|
|
||||||
template <typename A1, typename A2>
|
|
||||||
StrictMock(const A1& a1, const A2& a2) : MockClass(a1, a2) {
|
|
||||||
::testing::Mock::FailUninterestingCalls(
|
|
||||||
internal::ImplicitCast_<MockClass*>(this));
|
|
||||||
}
|
|
||||||
|
|
||||||
template <typename A1, typename A2, typename A3>
|
|
||||||
StrictMock(const A1& a1, const A2& a2, const A3& a3) : MockClass(a1, a2, a3) {
|
|
||||||
::testing::Mock::FailUninterestingCalls(
|
|
||||||
internal::ImplicitCast_<MockClass*>(this));
|
|
||||||
}
|
|
||||||
|
|
||||||
template <typename A1, typename A2, typename A3, typename A4>
|
|
||||||
StrictMock(const A1& a1, const A2& a2, const A3& a3,
|
|
||||||
const A4& a4) : MockClass(a1, a2, a3, a4) {
|
|
||||||
::testing::Mock::FailUninterestingCalls(
|
|
||||||
internal::ImplicitCast_<MockClass*>(this));
|
|
||||||
}
|
|
||||||
|
|
||||||
template <typename A1, typename A2, typename A3, typename A4, typename A5>
|
|
||||||
StrictMock(const A1& a1, const A2& a2, const A3& a3, const A4& a4,
|
|
||||||
const A5& a5) : MockClass(a1, a2, a3, a4, a5) {
|
|
||||||
::testing::Mock::FailUninterestingCalls(
|
|
||||||
internal::ImplicitCast_<MockClass*>(this));
|
|
||||||
}
|
|
||||||
|
|
||||||
template <typename A1, typename A2, typename A3, typename A4, typename A5,
|
|
||||||
typename A6>
|
|
||||||
StrictMock(const A1& a1, const A2& a2, const A3& a3, const A4& a4,
|
|
||||||
const A5& a5, const A6& a6) : MockClass(a1, a2, a3, a4, a5, a6) {
|
|
||||||
::testing::Mock::FailUninterestingCalls(
|
|
||||||
internal::ImplicitCast_<MockClass*>(this));
|
|
||||||
}
|
|
||||||
|
|
||||||
template <typename A1, typename A2, typename A3, typename A4, typename A5,
|
|
||||||
typename A6, typename A7>
|
|
||||||
StrictMock(const A1& a1, const A2& a2, const A3& a3, const A4& a4,
|
|
||||||
const A5& a5, const A6& a6, const A7& a7) : MockClass(a1, a2, a3, a4, a5,
|
|
||||||
a6, a7) {
|
|
||||||
::testing::Mock::FailUninterestingCalls(
|
|
||||||
internal::ImplicitCast_<MockClass*>(this));
|
|
||||||
}
|
|
||||||
|
|
||||||
template <typename A1, typename A2, typename A3, typename A4, typename A5,
|
|
||||||
typename A6, typename A7, typename A8>
|
|
||||||
StrictMock(const A1& a1, const A2& a2, const A3& a3, const A4& a4,
|
|
||||||
const A5& a5, const A6& a6, const A7& a7, const A8& a8) : MockClass(a1,
|
|
||||||
a2, a3, a4, a5, a6, a7, a8) {
|
|
||||||
::testing::Mock::FailUninterestingCalls(
|
|
||||||
internal::ImplicitCast_<MockClass*>(this));
|
|
||||||
}
|
|
||||||
|
|
||||||
template <typename A1, typename A2, typename A3, typename A4, typename A5,
|
|
||||||
typename A6, typename A7, typename A8, typename A9>
|
|
||||||
StrictMock(const A1& a1, const A2& a2, const A3& a3, const A4& a4,
|
|
||||||
const A5& a5, const A6& a6, const A7& a7, const A8& a8,
|
|
||||||
const A9& a9) : MockClass(a1, a2, a3, a4, a5, a6, a7, a8, a9) {
|
|
||||||
::testing::Mock::FailUninterestingCalls(
|
|
||||||
internal::ImplicitCast_<MockClass*>(this));
|
|
||||||
}
|
|
||||||
|
|
||||||
template <typename A1, typename A2, typename A3, typename A4, typename A5,
|
|
||||||
typename A6, typename A7, typename A8, typename A9, typename A10>
|
|
||||||
StrictMock(const A1& a1, const A2& a2, const A3& a3, const A4& a4,
|
|
||||||
const A5& a5, const A6& a6, const A7& a7, const A8& a8, const A9& a9,
|
|
||||||
const A10& a10) : MockClass(a1, a2, a3, a4, a5, a6, a7, a8, a9, a10) {
|
|
||||||
::testing::Mock::FailUninterestingCalls(
|
|
||||||
internal::ImplicitCast_<MockClass*>(this));
|
|
||||||
}
|
|
||||||
|
|
||||||
#endif // GTEST_LANG_CXX11
|
|
||||||
|
|
||||||
~StrictMock() {
|
|
||||||
::testing::Mock::UnregisterCallReaction(
|
|
||||||
internal::ImplicitCast_<MockClass*>(this));
|
|
||||||
}
|
|
||||||
|
|
||||||
private:
|
|
||||||
GTEST_DISALLOW_COPY_AND_ASSIGN_(StrictMock);
|
|
||||||
};
|
|
||||||
|
|
||||||
// The following specializations catch some (relatively more common)
|
|
||||||
// user errors of nesting nice and strict mocks. They do NOT catch
|
|
||||||
// all possible errors.
|
|
||||||
|
|
||||||
// These specializations are declared but not defined, as NiceMock,
|
|
||||||
// NaggyMock, and StrictMock cannot be nested.
|
|
||||||
|
|
||||||
template <typename MockClass>
|
|
||||||
class NiceMock<NiceMock<MockClass> >;
|
|
||||||
template <typename MockClass>
|
|
||||||
class NiceMock<NaggyMock<MockClass> >;
|
|
||||||
template <typename MockClass>
|
|
||||||
class NiceMock<StrictMock<MockClass> >;
|
|
||||||
|
|
||||||
template <typename MockClass>
|
|
||||||
class NaggyMock<NiceMock<MockClass> >;
|
|
||||||
template <typename MockClass>
|
|
||||||
class NaggyMock<NaggyMock<MockClass> >;
|
|
||||||
template <typename MockClass>
|
|
||||||
class NaggyMock<StrictMock<MockClass> >;
|
|
||||||
|
|
||||||
template <typename MockClass>
|
|
||||||
class StrictMock<NiceMock<MockClass> >;
|
|
||||||
template <typename MockClass>
|
|
||||||
class StrictMock<NaggyMock<MockClass> >;
|
|
||||||
template <typename MockClass>
|
|
||||||
class StrictMock<StrictMock<MockClass> >;
|
|
||||||
|
|
||||||
} // namespace testing
|
|
||||||
|
|
||||||
#endif // GMOCK_INCLUDE_GMOCK_GMOCK_GENERATED_NICE_STRICT_H_
|
|
@ -1,179 +0,0 @@
|
|||||||
$$ -*- mode: c++; -*-
|
|
||||||
$$ This is a Pump source file. Please use Pump to convert
|
|
||||||
$$ it to gmock-generated-nice-strict.h.
|
|
||||||
$$
|
|
||||||
$var n = 10 $$ The maximum arity we support.
|
|
||||||
// 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.
|
|
||||||
|
|
||||||
|
|
||||||
// Implements class templates NiceMock, NaggyMock, and StrictMock.
|
|
||||||
//
|
|
||||||
// Given a mock class MockFoo that is created using Google Mock,
|
|
||||||
// NiceMock<MockFoo> is a subclass of MockFoo that allows
|
|
||||||
// uninteresting calls (i.e. calls to mock methods that have no
|
|
||||||
// EXPECT_CALL specs), NaggyMock<MockFoo> is a subclass of MockFoo
|
|
||||||
// that prints a warning when an uninteresting call occurs, and
|
|
||||||
// StrictMock<MockFoo> is a subclass of MockFoo that treats all
|
|
||||||
// uninteresting calls as errors.
|
|
||||||
//
|
|
||||||
// Currently a mock is naggy by default, so MockFoo and
|
|
||||||
// NaggyMock<MockFoo> behave like the same. However, we will soon
|
|
||||||
// switch the default behavior of mocks to be nice, as that in general
|
|
||||||
// leads to more maintainable tests. When that happens, MockFoo will
|
|
||||||
// stop behaving like NaggyMock<MockFoo> and start behaving like
|
|
||||||
// NiceMock<MockFoo>.
|
|
||||||
//
|
|
||||||
// NiceMock, NaggyMock, and StrictMock "inherit" the constructors of
|
|
||||||
// their respective base class. Therefore you can write
|
|
||||||
// NiceMock<MockFoo>(5, "a") to construct a nice mock where MockFoo
|
|
||||||
// has a constructor that accepts (int, const char*), for example.
|
|
||||||
//
|
|
||||||
// A known limitation is that NiceMock<MockFoo>, NaggyMock<MockFoo>,
|
|
||||||
// and StrictMock<MockFoo> only works for mock methods defined using
|
|
||||||
// the MOCK_METHOD* family of macros DIRECTLY in the MockFoo class.
|
|
||||||
// If a mock method is defined in a base class of MockFoo, the "nice"
|
|
||||||
// or "strict" modifier may not affect it, depending on the compiler.
|
|
||||||
// In particular, nesting NiceMock, NaggyMock, and StrictMock is NOT
|
|
||||||
// supported.
|
|
||||||
|
|
||||||
// GOOGLETEST_CM0002 DO NOT DELETE
|
|
||||||
|
|
||||||
#ifndef GMOCK_INCLUDE_GMOCK_GMOCK_GENERATED_NICE_STRICT_H_
|
|
||||||
#define GMOCK_INCLUDE_GMOCK_GMOCK_GENERATED_NICE_STRICT_H_
|
|
||||||
|
|
||||||
#include "gmock/gmock-spec-builders.h"
|
|
||||||
#include "gmock/internal/gmock-port.h"
|
|
||||||
|
|
||||||
namespace testing {
|
|
||||||
|
|
||||||
$range kind 0..2
|
|
||||||
$for kind [[
|
|
||||||
|
|
||||||
$var clazz=[[$if kind==0 [[NiceMock]]
|
|
||||||
$elif kind==1 [[NaggyMock]]
|
|
||||||
$else [[StrictMock]]]]
|
|
||||||
|
|
||||||
$var method=[[$if kind==0 [[AllowUninterestingCalls]]
|
|
||||||
$elif kind==1 [[WarnUninterestingCalls]]
|
|
||||||
$else [[FailUninterestingCalls]]]]
|
|
||||||
|
|
||||||
template <class MockClass>
|
|
||||||
class $clazz : public MockClass {
|
|
||||||
public:
|
|
||||||
$clazz() : MockClass() {
|
|
||||||
::testing::Mock::$method(
|
|
||||||
internal::ImplicitCast_<MockClass*>(this));
|
|
||||||
}
|
|
||||||
|
|
||||||
#if GTEST_LANG_CXX11
|
|
||||||
// Ideally, we would inherit base class's constructors through a using
|
|
||||||
// declaration, which would preserve their visibility. However, many existing
|
|
||||||
// tests rely on the fact that current implementation reexports protected
|
|
||||||
// constructors as public. These tests would need to be cleaned up first.
|
|
||||||
|
|
||||||
// Single argument constructor is special-cased so that it can be
|
|
||||||
// made explicit.
|
|
||||||
template <typename A>
|
|
||||||
explicit $clazz(A&& arg) : MockClass(std::forward<A>(arg)) {
|
|
||||||
::testing::Mock::$method(
|
|
||||||
internal::ImplicitCast_<MockClass*>(this));
|
|
||||||
}
|
|
||||||
|
|
||||||
template <typename A1, typename A2, typename... An>
|
|
||||||
$clazz(A1&& arg1, A2&& arg2, An&&... args)
|
|
||||||
: MockClass(std::forward<A1>(arg1), std::forward<A2>(arg2),
|
|
||||||
std::forward<An>(args)...) {
|
|
||||||
::testing::Mock::$method(
|
|
||||||
internal::ImplicitCast_<MockClass*>(this));
|
|
||||||
}
|
|
||||||
#else
|
|
||||||
// C++98 doesn't have variadic templates, so we have to define one
|
|
||||||
// for each arity.
|
|
||||||
template <typename A1>
|
|
||||||
explicit $clazz(const A1& a1) : MockClass(a1) {
|
|
||||||
::testing::Mock::$method(
|
|
||||||
internal::ImplicitCast_<MockClass*>(this));
|
|
||||||
}
|
|
||||||
|
|
||||||
$range i 2..n
|
|
||||||
$for i [[
|
|
||||||
$range j 1..i
|
|
||||||
template <$for j, [[typename A$j]]>
|
|
||||||
$clazz($for j, [[const A$j& a$j]]) : MockClass($for j, [[a$j]]) {
|
|
||||||
::testing::Mock::$method(
|
|
||||||
internal::ImplicitCast_<MockClass*>(this));
|
|
||||||
}
|
|
||||||
|
|
||||||
|
|
||||||
]]
|
|
||||||
#endif // GTEST_LANG_CXX11
|
|
||||||
|
|
||||||
~$clazz() {
|
|
||||||
::testing::Mock::UnregisterCallReaction(
|
|
||||||
internal::ImplicitCast_<MockClass*>(this));
|
|
||||||
}
|
|
||||||
|
|
||||||
private:
|
|
||||||
GTEST_DISALLOW_COPY_AND_ASSIGN_($clazz);
|
|
||||||
};
|
|
||||||
|
|
||||||
]]
|
|
||||||
|
|
||||||
// The following specializations catch some (relatively more common)
|
|
||||||
// user errors of nesting nice and strict mocks. They do NOT catch
|
|
||||||
// all possible errors.
|
|
||||||
|
|
||||||
// These specializations are declared but not defined, as NiceMock,
|
|
||||||
// NaggyMock, and StrictMock cannot be nested.
|
|
||||||
|
|
||||||
template <typename MockClass>
|
|
||||||
class NiceMock<NiceMock<MockClass> >;
|
|
||||||
template <typename MockClass>
|
|
||||||
class NiceMock<NaggyMock<MockClass> >;
|
|
||||||
template <typename MockClass>
|
|
||||||
class NiceMock<StrictMock<MockClass> >;
|
|
||||||
|
|
||||||
template <typename MockClass>
|
|
||||||
class NaggyMock<NiceMock<MockClass> >;
|
|
||||||
template <typename MockClass>
|
|
||||||
class NaggyMock<NaggyMock<MockClass> >;
|
|
||||||
template <typename MockClass>
|
|
||||||
class NaggyMock<StrictMock<MockClass> >;
|
|
||||||
|
|
||||||
template <typename MockClass>
|
|
||||||
class StrictMock<NiceMock<MockClass> >;
|
|
||||||
template <typename MockClass>
|
|
||||||
class StrictMock<NaggyMock<MockClass> >;
|
|
||||||
template <typename MockClass>
|
|
||||||
class StrictMock<StrictMock<MockClass> >;
|
|
||||||
|
|
||||||
} // namespace testing
|
|
||||||
|
|
||||||
#endif // GMOCK_INCLUDE_GMOCK_GMOCK_GENERATED_NICE_STRICT_H_
|
|
File diff suppressed because it is too large
Load Diff
@ -1,247 +0,0 @@
|
|||||||
// 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.
|
|
||||||
|
|
||||||
|
|
||||||
// Google Mock - a framework for writing C++ mock classes.
|
|
||||||
//
|
|
||||||
// This file implements some actions that depend on gmock-generated-actions.h.
|
|
||||||
|
|
||||||
// GOOGLETEST_CM0002 DO NOT DELETE
|
|
||||||
|
|
||||||
#ifndef GMOCK_INCLUDE_GMOCK_GMOCK_MORE_ACTIONS_H_
|
|
||||||
#define GMOCK_INCLUDE_GMOCK_GMOCK_MORE_ACTIONS_H_
|
|
||||||
|
|
||||||
#include <algorithm>
|
|
||||||
|
|
||||||
#include "gmock/gmock-generated-actions.h"
|
|
||||||
|
|
||||||
namespace testing {
|
|
||||||
namespace internal {
|
|
||||||
|
|
||||||
// Implements the Invoke(f) action. The template argument
|
|
||||||
// FunctionImpl is the implementation type of f, which can be either a
|
|
||||||
// function pointer or a functor. Invoke(f) can be used as an
|
|
||||||
// Action<F> as long as f's type is compatible with F (i.e. f can be
|
|
||||||
// assigned to a tr1::function<F>).
|
|
||||||
template <typename FunctionImpl>
|
|
||||||
class InvokeAction {
|
|
||||||
public:
|
|
||||||
// The c'tor makes a copy of function_impl (either a function
|
|
||||||
// pointer or a functor).
|
|
||||||
explicit InvokeAction(FunctionImpl function_impl)
|
|
||||||
: function_impl_(function_impl) {}
|
|
||||||
|
|
||||||
template <typename Result, typename ArgumentTuple>
|
|
||||||
Result Perform(const ArgumentTuple& args) {
|
|
||||||
return InvokeHelper<Result, ArgumentTuple>::Invoke(function_impl_, args);
|
|
||||||
}
|
|
||||||
|
|
||||||
private:
|
|
||||||
FunctionImpl function_impl_;
|
|
||||||
|
|
||||||
GTEST_DISALLOW_ASSIGN_(InvokeAction);
|
|
||||||
};
|
|
||||||
|
|
||||||
// Implements the Invoke(object_ptr, &Class::Method) action.
|
|
||||||
template <class Class, typename MethodPtr>
|
|
||||||
class InvokeMethodAction {
|
|
||||||
public:
|
|
||||||
InvokeMethodAction(Class* obj_ptr, MethodPtr method_ptr)
|
|
||||||
: method_ptr_(method_ptr), obj_ptr_(obj_ptr) {}
|
|
||||||
|
|
||||||
template <typename Result, typename ArgumentTuple>
|
|
||||||
Result Perform(const ArgumentTuple& args) const {
|
|
||||||
return InvokeHelper<Result, ArgumentTuple>::InvokeMethod(
|
|
||||||
obj_ptr_, method_ptr_, args);
|
|
||||||
}
|
|
||||||
|
|
||||||
private:
|
|
||||||
// The order of these members matters. Reversing the order can trigger
|
|
||||||
// warning C4121 in MSVC (see
|
|
||||||
// http://computer-programming-forum.com/7-vc.net/6fbc30265f860ad1.htm ).
|
|
||||||
const MethodPtr method_ptr_;
|
|
||||||
Class* const obj_ptr_;
|
|
||||||
|
|
||||||
GTEST_DISALLOW_ASSIGN_(InvokeMethodAction);
|
|
||||||
};
|
|
||||||
|
|
||||||
// An internal replacement for std::copy which mimics its behavior. This is
|
|
||||||
// necessary because Visual Studio deprecates ::std::copy, issuing warning 4996.
|
|
||||||
// However Visual Studio 2010 and later do not honor #pragmas which disable that
|
|
||||||
// warning.
|
|
||||||
template<typename InputIterator, typename OutputIterator>
|
|
||||||
inline OutputIterator CopyElements(InputIterator first,
|
|
||||||
InputIterator last,
|
|
||||||
OutputIterator output) {
|
|
||||||
for (; first != last; ++first, ++output) {
|
|
||||||
*output = *first;
|
|
||||||
}
|
|
||||||
return output;
|
|
||||||
}
|
|
||||||
|
|
||||||
} // namespace internal
|
|
||||||
|
|
||||||
// Various overloads for Invoke().
|
|
||||||
|
|
||||||
// Creates an action that invokes 'function_impl' with the mock
|
|
||||||
// function's arguments.
|
|
||||||
template <typename FunctionImpl>
|
|
||||||
PolymorphicAction<internal::InvokeAction<FunctionImpl> > Invoke(
|
|
||||||
FunctionImpl function_impl) {
|
|
||||||
return MakePolymorphicAction(
|
|
||||||
internal::InvokeAction<FunctionImpl>(function_impl));
|
|
||||||
}
|
|
||||||
|
|
||||||
// Creates an action that invokes the given method on the given object
|
|
||||||
// with the mock function's arguments.
|
|
||||||
template <class Class, typename MethodPtr>
|
|
||||||
PolymorphicAction<internal::InvokeMethodAction<Class, MethodPtr> > Invoke(
|
|
||||||
Class* obj_ptr, MethodPtr method_ptr) {
|
|
||||||
return MakePolymorphicAction(
|
|
||||||
internal::InvokeMethodAction<Class, MethodPtr>(obj_ptr, method_ptr));
|
|
||||||
}
|
|
||||||
|
|
||||||
// WithoutArgs(inner_action) can be used in a mock function with a
|
|
||||||
// non-empty argument list to perform inner_action, which takes no
|
|
||||||
// argument. In other words, it adapts an action accepting no
|
|
||||||
// argument to one that accepts (and ignores) arguments.
|
|
||||||
template <typename InnerAction>
|
|
||||||
inline internal::WithArgsAction<InnerAction>
|
|
||||||
WithoutArgs(const InnerAction& action) {
|
|
||||||
return internal::WithArgsAction<InnerAction>(action);
|
|
||||||
}
|
|
||||||
|
|
||||||
// WithArg<k>(an_action) creates an action that passes the k-th
|
|
||||||
// (0-based) argument of the mock function to an_action and performs
|
|
||||||
// it. It adapts an action accepting one argument to one that accepts
|
|
||||||
// multiple arguments. For convenience, we also provide
|
|
||||||
// WithArgs<k>(an_action) (defined below) as a synonym.
|
|
||||||
template <int k, typename InnerAction>
|
|
||||||
inline internal::WithArgsAction<InnerAction, k>
|
|
||||||
WithArg(const InnerAction& action) {
|
|
||||||
return internal::WithArgsAction<InnerAction, k>(action);
|
|
||||||
}
|
|
||||||
|
|
||||||
// The ACTION*() macros trigger warning C4100 (unreferenced formal
|
|
||||||
// parameter) in MSVC with -W4. Unfortunately they cannot be fixed in
|
|
||||||
// the macro definition, as the warnings are generated when the macro
|
|
||||||
// is expanded and macro expansion cannot contain #pragma. Therefore
|
|
||||||
// we suppress them here.
|
|
||||||
#ifdef _MSC_VER
|
|
||||||
# pragma warning(push)
|
|
||||||
# pragma warning(disable:4100)
|
|
||||||
#endif
|
|
||||||
|
|
||||||
// Action ReturnArg<k>() returns the k-th argument of the mock function.
|
|
||||||
ACTION_TEMPLATE(ReturnArg,
|
|
||||||
HAS_1_TEMPLATE_PARAMS(int, k),
|
|
||||||
AND_0_VALUE_PARAMS()) {
|
|
||||||
return ::testing::get<k>(args);
|
|
||||||
}
|
|
||||||
|
|
||||||
// Action SaveArg<k>(pointer) saves the k-th (0-based) argument of the
|
|
||||||
// mock function to *pointer.
|
|
||||||
ACTION_TEMPLATE(SaveArg,
|
|
||||||
HAS_1_TEMPLATE_PARAMS(int, k),
|
|
||||||
AND_1_VALUE_PARAMS(pointer)) {
|
|
||||||
*pointer = ::testing::get<k>(args);
|
|
||||||
}
|
|
||||||
|
|
||||||
// Action SaveArgPointee<k>(pointer) saves the value pointed to
|
|
||||||
// by the k-th (0-based) argument of the mock function to *pointer.
|
|
||||||
ACTION_TEMPLATE(SaveArgPointee,
|
|
||||||
HAS_1_TEMPLATE_PARAMS(int, k),
|
|
||||||
AND_1_VALUE_PARAMS(pointer)) {
|
|
||||||
*pointer = *::testing::get<k>(args);
|
|
||||||
}
|
|
||||||
|
|
||||||
// Action SetArgReferee<k>(value) assigns 'value' to the variable
|
|
||||||
// referenced by the k-th (0-based) argument of the mock function.
|
|
||||||
ACTION_TEMPLATE(SetArgReferee,
|
|
||||||
HAS_1_TEMPLATE_PARAMS(int, k),
|
|
||||||
AND_1_VALUE_PARAMS(value)) {
|
|
||||||
typedef typename ::testing::tuple_element<k, args_type>::type argk_type;
|
|
||||||
// Ensures that argument #k is a reference. If you get a compiler
|
|
||||||
// error on the next line, you are using SetArgReferee<k>(value) in
|
|
||||||
// a mock function whose k-th (0-based) argument is not a reference.
|
|
||||||
GTEST_COMPILE_ASSERT_(internal::is_reference<argk_type>::value,
|
|
||||||
SetArgReferee_must_be_used_with_a_reference_argument);
|
|
||||||
::testing::get<k>(args) = value;
|
|
||||||
}
|
|
||||||
|
|
||||||
// Action SetArrayArgument<k>(first, last) copies the elements in
|
|
||||||
// source range [first, last) to the array pointed to by the k-th
|
|
||||||
// (0-based) argument, which can be either a pointer or an
|
|
||||||
// iterator. The action does not take ownership of the elements in the
|
|
||||||
// source range.
|
|
||||||
ACTION_TEMPLATE(SetArrayArgument,
|
|
||||||
HAS_1_TEMPLATE_PARAMS(int, k),
|
|
||||||
AND_2_VALUE_PARAMS(first, last)) {
|
|
||||||
// Visual Studio deprecates ::std::copy, so we use our own copy in that case.
|
|
||||||
#ifdef _MSC_VER
|
|
||||||
internal::CopyElements(first, last, ::testing::get<k>(args));
|
|
||||||
#else
|
|
||||||
::std::copy(first, last, ::testing::get<k>(args));
|
|
||||||
#endif
|
|
||||||
}
|
|
||||||
|
|
||||||
// Action DeleteArg<k>() deletes the k-th (0-based) argument of the mock
|
|
||||||
// function.
|
|
||||||
ACTION_TEMPLATE(DeleteArg,
|
|
||||||
HAS_1_TEMPLATE_PARAMS(int, k),
|
|
||||||
AND_0_VALUE_PARAMS()) {
|
|
||||||
delete ::testing::get<k>(args);
|
|
||||||
}
|
|
||||||
|
|
||||||
// This action returns the value pointed to by 'pointer'.
|
|
||||||
ACTION_P(ReturnPointee, pointer) { return *pointer; }
|
|
||||||
|
|
||||||
// Action Throw(exception) can be used in a mock function of any type
|
|
||||||
// to throw the given exception. Any copyable value can be thrown.
|
|
||||||
#if GTEST_HAS_EXCEPTIONS
|
|
||||||
|
|
||||||
// Suppresses the 'unreachable code' warning that VC generates in opt modes.
|
|
||||||
# ifdef _MSC_VER
|
|
||||||
# pragma warning(push) // Saves the current warning state.
|
|
||||||
# pragma warning(disable:4702) // Temporarily disables warning 4702.
|
|
||||||
# endif
|
|
||||||
ACTION_P(Throw, exception) { throw exception; }
|
|
||||||
# ifdef _MSC_VER
|
|
||||||
# pragma warning(pop) // Restores the warning state.
|
|
||||||
# endif
|
|
||||||
|
|
||||||
#endif // GTEST_HAS_EXCEPTIONS
|
|
||||||
|
|
||||||
#ifdef _MSC_VER
|
|
||||||
# pragma warning(pop)
|
|
||||||
#endif
|
|
||||||
|
|
||||||
} // namespace testing
|
|
||||||
|
|
||||||
#endif // GMOCK_INCLUDE_GMOCK_GMOCK_MORE_ACTIONS_H_
|
|
@ -1,92 +0,0 @@
|
|||||||
// Copyright 2013, 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.
|
|
||||||
|
|
||||||
|
|
||||||
// Google Mock - a framework for writing C++ mock classes.
|
|
||||||
//
|
|
||||||
// This file implements some matchers that depend on gmock-generated-matchers.h.
|
|
||||||
//
|
|
||||||
// Note that tests are implemented in gmock-matchers_test.cc rather than
|
|
||||||
// gmock-more-matchers-test.cc.
|
|
||||||
|
|
||||||
// GOOGLETEST_CM0002 DO NOT DELETE
|
|
||||||
|
|
||||||
#ifndef GMOCK_INCLUDE_GMOCK_MORE_MATCHERS_H_
|
|
||||||
#define GMOCK_INCLUDE_GMOCK_MORE_MATCHERS_H_
|
|
||||||
|
|
||||||
#include "gmock/gmock-generated-matchers.h"
|
|
||||||
|
|
||||||
namespace testing {
|
|
||||||
|
|
||||||
// Silence C4100 (unreferenced formal
|
|
||||||
// parameter) for MSVC
|
|
||||||
#ifdef _MSC_VER
|
|
||||||
# pragma warning(push)
|
|
||||||
# pragma warning(disable:4100)
|
|
||||||
#if (_MSC_VER == 1900)
|
|
||||||
// and silence C4800 (C4800: 'int *const ': forcing value
|
|
||||||
// to bool 'true' or 'false') for MSVC 14
|
|
||||||
# pragma warning(disable:4800)
|
|
||||||
#endif
|
|
||||||
#endif
|
|
||||||
|
|
||||||
// Defines a matcher that matches an empty container. The container must
|
|
||||||
// support both size() and empty(), which all STL-like containers provide.
|
|
||||||
MATCHER(IsEmpty, negation ? "isn't empty" : "is empty") {
|
|
||||||
if (arg.empty()) {
|
|
||||||
return true;
|
|
||||||
}
|
|
||||||
*result_listener << "whose size is " << arg.size();
|
|
||||||
return false;
|
|
||||||
}
|
|
||||||
|
|
||||||
// Define a matcher that matches a value that evaluates in boolean
|
|
||||||
// context to true. Useful for types that define "explicit operator
|
|
||||||
// bool" operators and so can't be compared for equality with true
|
|
||||||
// and false.
|
|
||||||
MATCHER(IsTrue, negation ? "is false" : "is true") {
|
|
||||||
return static_cast<bool>(arg);
|
|
||||||
}
|
|
||||||
|
|
||||||
// Define a matcher that matches a value that evaluates in boolean
|
|
||||||
// context to false. Useful for types that define "explicit operator
|
|
||||||
// bool" operators and so can't be compared for equality with true
|
|
||||||
// and false.
|
|
||||||
MATCHER(IsFalse, negation ? "is true" : "is false") {
|
|
||||||
return !static_cast<bool>(arg);
|
|
||||||
}
|
|
||||||
|
|
||||||
#ifdef _MSC_VER
|
|
||||||
# pragma warning(pop)
|
|
||||||
#endif
|
|
||||||
|
|
||||||
|
|
||||||
} // namespace testing
|
|
||||||
|
|
||||||
#endif // GMOCK_INCLUDE_GMOCK_MORE_MATCHERS_H_
|
|
File diff suppressed because it is too large
Load Diff
@ -1,96 +0,0 @@
|
|||||||
// 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.
|
|
||||||
|
|
||||||
|
|
||||||
// Google Mock - a framework for writing C++ mock classes.
|
|
||||||
//
|
|
||||||
// This is the main header file a user should include.
|
|
||||||
|
|
||||||
// GOOGLETEST_CM0002 DO NOT DELETE
|
|
||||||
|
|
||||||
#ifndef GMOCK_INCLUDE_GMOCK_GMOCK_H_
|
|
||||||
#define GMOCK_INCLUDE_GMOCK_GMOCK_H_
|
|
||||||
|
|
||||||
// This file implements the following syntax:
|
|
||||||
//
|
|
||||||
// ON_CALL(mock_object.Method(...))
|
|
||||||
// .With(...) ?
|
|
||||||
// .WillByDefault(...);
|
|
||||||
//
|
|
||||||
// where With() is optional and WillByDefault() must appear exactly
|
|
||||||
// once.
|
|
||||||
//
|
|
||||||
// EXPECT_CALL(mock_object.Method(...))
|
|
||||||
// .With(...) ?
|
|
||||||
// .Times(...) ?
|
|
||||||
// .InSequence(...) *
|
|
||||||
// .WillOnce(...) *
|
|
||||||
// .WillRepeatedly(...) ?
|
|
||||||
// .RetiresOnSaturation() ? ;
|
|
||||||
//
|
|
||||||
// where all clauses are optional and WillOnce() can be repeated.
|
|
||||||
|
|
||||||
#include "gmock/gmock-actions.h"
|
|
||||||
#include "gmock/gmock-cardinalities.h"
|
|
||||||
#include "gmock/gmock-generated-actions.h"
|
|
||||||
#include "gmock/gmock-generated-function-mockers.h"
|
|
||||||
#include "gmock/gmock-generated-matchers.h"
|
|
||||||
#include "gmock/gmock-generated-nice-strict.h"
|
|
||||||
#include "gmock/gmock-matchers.h"
|
|
||||||
#include "gmock/gmock-more-actions.h"
|
|
||||||
#include "gmock/gmock-more-matchers.h"
|
|
||||||
#include "gmock/internal/gmock-internal-utils.h"
|
|
||||||
|
|
||||||
namespace testing {
|
|
||||||
|
|
||||||
// Declares Google Mock flags that we want a user to use programmatically.
|
|
||||||
GMOCK_DECLARE_bool_(catch_leaked_mocks);
|
|
||||||
GMOCK_DECLARE_string_(verbose);
|
|
||||||
GMOCK_DECLARE_int32_(default_mock_behavior);
|
|
||||||
|
|
||||||
// Initializes Google Mock. This must be called before running the
|
|
||||||
// tests. In particular, it parses the command line for the flags
|
|
||||||
// that Google Mock recognizes. Whenever a Google Mock flag is seen,
|
|
||||||
// it is removed from argv, and *argc is decremented.
|
|
||||||
//
|
|
||||||
// No value is returned. Instead, the Google Mock flag variables are
|
|
||||||
// updated.
|
|
||||||
//
|
|
||||||
// Since Google Test is needed for Google Mock to work, this function
|
|
||||||
// also initializes Google Test and parses its flags, if that hasn't
|
|
||||||
// been done.
|
|
||||||
GTEST_API_ void InitGoogleMock(int* argc, char** argv);
|
|
||||||
|
|
||||||
// This overloaded version can be used in Windows programs compiled in
|
|
||||||
// UNICODE mode.
|
|
||||||
GTEST_API_ void InitGoogleMock(int* argc, wchar_t** argv);
|
|
||||||
|
|
||||||
} // namespace testing
|
|
||||||
|
|
||||||
#endif // GMOCK_INCLUDE_GMOCK_GMOCK_H_
|
|
@ -1,16 +0,0 @@
|
|||||||
# Customization Points
|
|
||||||
|
|
||||||
The custom directory is an injection point for custom user configurations.
|
|
||||||
|
|
||||||
## Header `gmock-port.h`
|
|
||||||
|
|
||||||
The following macros can be defined:
|
|
||||||
|
|
||||||
### Flag related macros:
|
|
||||||
|
|
||||||
* `GMOCK_DECLARE_bool_(name)`
|
|
||||||
* `GMOCK_DECLARE_int32_(name)`
|
|
||||||
* `GMOCK_DECLARE_string_(name)`
|
|
||||||
* `GMOCK_DEFINE_bool_(name, default_val, doc)`
|
|
||||||
* `GMOCK_DEFINE_int32_(name, default_val, doc)`
|
|
||||||
* `GMOCK_DEFINE_string_(name, default_val, doc)`
|
|
@ -1,10 +0,0 @@
|
|||||||
// This file was GENERATED by command:
|
|
||||||
// pump.py gmock-generated-actions.h.pump
|
|
||||||
// DO NOT EDIT BY HAND!!!
|
|
||||||
|
|
||||||
// GOOGLETEST_CM0002 DO NOT DELETE
|
|
||||||
|
|
||||||
#ifndef GMOCK_INCLUDE_GMOCK_INTERNAL_CUSTOM_GMOCK_GENERATED_ACTIONS_H_
|
|
||||||
#define GMOCK_INCLUDE_GMOCK_INTERNAL_CUSTOM_GMOCK_GENERATED_ACTIONS_H_
|
|
||||||
|
|
||||||
#endif // GMOCK_INCLUDE_GMOCK_INTERNAL_CUSTOM_GMOCK_GENERATED_ACTIONS_H_
|
|
@ -1,12 +0,0 @@
|
|||||||
$$ -*- mode: c++; -*-
|
|
||||||
$$ This is a Pump source file. Please use Pump to convert
|
|
||||||
$$ it to callback-actions.h.
|
|
||||||
$$
|
|
||||||
$var max_callback_arity = 5
|
|
||||||
$$}} This meta comment fixes auto-indentation in editors.
|
|
||||||
|
|
||||||
// GOOGLETEST_CM0002 DO NOT DELETE
|
|
||||||
#ifndef GMOCK_INCLUDE_GMOCK_INTERNAL_CUSTOM_GMOCK_GENERATED_ACTIONS_H_
|
|
||||||
#define GMOCK_INCLUDE_GMOCK_INTERNAL_CUSTOM_GMOCK_GENERATED_ACTIONS_H_
|
|
||||||
|
|
||||||
#endif // GMOCK_INCLUDE_GMOCK_INTERNAL_CUSTOM_GMOCK_GENERATED_ACTIONS_H_
|
|
@ -1,36 +0,0 @@
|
|||||||
// Copyright 2015, 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.
|
|
||||||
//
|
|
||||||
// Injection point for custom user configurations. See README for details
|
|
||||||
//
|
|
||||||
// GOOGLETEST_CM0002 DO NOT DELETE
|
|
||||||
|
|
||||||
#ifndef GMOCK_INCLUDE_GMOCK_INTERNAL_CUSTOM_GMOCK_MATCHERS_H_
|
|
||||||
#define GMOCK_INCLUDE_GMOCK_INTERNAL_CUSTOM_GMOCK_MATCHERS_H_
|
|
||||||
#endif // GMOCK_INCLUDE_GMOCK_INTERNAL_CUSTOM_GMOCK_MATCHERS_H_
|
|
@ -1,39 +0,0 @@
|
|||||||
// Copyright 2015, 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.
|
|
||||||
//
|
|
||||||
// Injection point for custom user configurations. See README for details
|
|
||||||
//
|
|
||||||
// ** Custom implementation starts here **
|
|
||||||
|
|
||||||
// GOOGLETEST_CM0002 DO NOT DELETE
|
|
||||||
|
|
||||||
#ifndef GMOCK_INCLUDE_GMOCK_INTERNAL_CUSTOM_GMOCK_PORT_H_
|
|
||||||
#define GMOCK_INCLUDE_GMOCK_INTERNAL_CUSTOM_GMOCK_PORT_H_
|
|
||||||
|
|
||||||
#endif // GMOCK_INCLUDE_GMOCK_INTERNAL_CUSTOM_GMOCK_PORT_H_
|
|
@ -1,287 +0,0 @@
|
|||||||
// This file was GENERATED by command:
|
|
||||||
// pump.py gmock-generated-internal-utils.h.pump
|
|
||||||
// DO NOT EDIT BY HAND!!!
|
|
||||||
|
|
||||||
// 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.
|
|
||||||
|
|
||||||
|
|
||||||
// Google Mock - a framework for writing C++ mock classes.
|
|
||||||
//
|
|
||||||
// This file contains template meta-programming utility classes needed
|
|
||||||
// for implementing Google Mock.
|
|
||||||
|
|
||||||
// GOOGLETEST_CM0002 DO NOT DELETE
|
|
||||||
|
|
||||||
#ifndef GMOCK_INCLUDE_GMOCK_INTERNAL_GMOCK_GENERATED_INTERNAL_UTILS_H_
|
|
||||||
#define GMOCK_INCLUDE_GMOCK_INTERNAL_GMOCK_GENERATED_INTERNAL_UTILS_H_
|
|
||||||
|
|
||||||
#include "gmock/internal/gmock-port.h"
|
|
||||||
|
|
||||||
namespace testing {
|
|
||||||
|
|
||||||
template <typename T>
|
|
||||||
class Matcher;
|
|
||||||
|
|
||||||
namespace internal {
|
|
||||||
|
|
||||||
// An IgnoredValue object can be implicitly constructed from ANY value.
|
|
||||||
// This is used in implementing the IgnoreResult(a) action.
|
|
||||||
class IgnoredValue {
|
|
||||||
public:
|
|
||||||
// This constructor template allows any value to be implicitly
|
|
||||||
// converted to IgnoredValue. The object has no data member and
|
|
||||||
// doesn't try to remember anything about the argument. We
|
|
||||||
// deliberately omit the 'explicit' keyword in order to allow the
|
|
||||||
// conversion to be implicit.
|
|
||||||
template <typename T>
|
|
||||||
IgnoredValue(const T& /* ignored */) {} // NOLINT(runtime/explicit)
|
|
||||||
};
|
|
||||||
|
|
||||||
// MatcherTuple<T>::type is a tuple type where each field is a Matcher
|
|
||||||
// for the corresponding field in tuple type T.
|
|
||||||
template <typename Tuple>
|
|
||||||
struct MatcherTuple;
|
|
||||||
|
|
||||||
template <>
|
|
||||||
struct MatcherTuple< ::testing::tuple<> > {
|
|
||||||
typedef ::testing::tuple< > type;
|
|
||||||
};
|
|
||||||
|
|
||||||
template <typename A1>
|
|
||||||
struct MatcherTuple< ::testing::tuple<A1> > {
|
|
||||||
typedef ::testing::tuple<Matcher<A1> > type;
|
|
||||||
};
|
|
||||||
|
|
||||||
template <typename A1, typename A2>
|
|
||||||
struct MatcherTuple< ::testing::tuple<A1, A2> > {
|
|
||||||
typedef ::testing::tuple<Matcher<A1>, Matcher<A2> > type;
|
|
||||||
};
|
|
||||||
|
|
||||||
template <typename A1, typename A2, typename A3>
|
|
||||||
struct MatcherTuple< ::testing::tuple<A1, A2, A3> > {
|
|
||||||
typedef ::testing::tuple<Matcher<A1>, Matcher<A2>, Matcher<A3> > type;
|
|
||||||
};
|
|
||||||
|
|
||||||
template <typename A1, typename A2, typename A3, typename A4>
|
|
||||||
struct MatcherTuple< ::testing::tuple<A1, A2, A3, A4> > {
|
|
||||||
typedef ::testing::tuple<Matcher<A1>, Matcher<A2>, Matcher<A3>, Matcher<A4> >
|
|
||||||
type;
|
|
||||||
};
|
|
||||||
|
|
||||||
template <typename A1, typename A2, typename A3, typename A4, typename A5>
|
|
||||||
struct MatcherTuple< ::testing::tuple<A1, A2, A3, A4, A5> > {
|
|
||||||
typedef ::testing::tuple<Matcher<A1>, Matcher<A2>, Matcher<A3>, Matcher<A4>,
|
|
||||||
Matcher<A5> >
|
|
||||||
type;
|
|
||||||
};
|
|
||||||
|
|
||||||
template <typename A1, typename A2, typename A3, typename A4, typename A5,
|
|
||||||
typename A6>
|
|
||||||
struct MatcherTuple< ::testing::tuple<A1, A2, A3, A4, A5, A6> > {
|
|
||||||
typedef ::testing::tuple<Matcher<A1>, Matcher<A2>, Matcher<A3>, Matcher<A4>,
|
|
||||||
Matcher<A5>, Matcher<A6> >
|
|
||||||
type;
|
|
||||||
};
|
|
||||||
|
|
||||||
template <typename A1, typename A2, typename A3, typename A4, typename A5,
|
|
||||||
typename A6, typename A7>
|
|
||||||
struct MatcherTuple< ::testing::tuple<A1, A2, A3, A4, A5, A6, A7> > {
|
|
||||||
typedef ::testing::tuple<Matcher<A1>, Matcher<A2>, Matcher<A3>, Matcher<A4>,
|
|
||||||
Matcher<A5>, Matcher<A6>, Matcher<A7> >
|
|
||||||
type;
|
|
||||||
};
|
|
||||||
|
|
||||||
template <typename A1, typename A2, typename A3, typename A4, typename A5,
|
|
||||||
typename A6, typename A7, typename A8>
|
|
||||||
struct MatcherTuple< ::testing::tuple<A1, A2, A3, A4, A5, A6, A7, A8> > {
|
|
||||||
typedef ::testing::tuple<Matcher<A1>, Matcher<A2>, Matcher<A3>, Matcher<A4>,
|
|
||||||
Matcher<A5>, Matcher<A6>, Matcher<A7>, Matcher<A8> >
|
|
||||||
type;
|
|
||||||
};
|
|
||||||
|
|
||||||
template <typename A1, typename A2, typename A3, typename A4, typename A5,
|
|
||||||
typename A6, typename A7, typename A8, typename A9>
|
|
||||||
struct MatcherTuple< ::testing::tuple<A1, A2, A3, A4, A5, A6, A7, A8, A9> > {
|
|
||||||
typedef ::testing::tuple<Matcher<A1>, Matcher<A2>, Matcher<A3>, Matcher<A4>,
|
|
||||||
Matcher<A5>, Matcher<A6>, Matcher<A7>, Matcher<A8>,
|
|
||||||
Matcher<A9> >
|
|
||||||
type;
|
|
||||||
};
|
|
||||||
|
|
||||||
template <typename A1, typename A2, typename A3, typename A4, typename A5,
|
|
||||||
typename A6, typename A7, typename A8, typename A9, typename A10>
|
|
||||||
struct MatcherTuple< ::testing::tuple<A1, A2, A3, A4, A5, A6, A7, A8, A9,
|
|
||||||
A10> > {
|
|
||||||
typedef ::testing::tuple<Matcher<A1>, Matcher<A2>, Matcher<A3>, Matcher<A4>,
|
|
||||||
Matcher<A5>, Matcher<A6>, Matcher<A7>, Matcher<A8>,
|
|
||||||
Matcher<A9>, Matcher<A10> >
|
|
||||||
type;
|
|
||||||
};
|
|
||||||
|
|
||||||
// Template struct Function<F>, where F must be a function type, contains
|
|
||||||
// the following typedefs:
|
|
||||||
//
|
|
||||||
// Result: the function's return type.
|
|
||||||
// ArgumentN: the type of the N-th argument, where N starts with 1.
|
|
||||||
// ArgumentTuple: the tuple type consisting of all parameters of F.
|
|
||||||
// ArgumentMatcherTuple: the tuple type consisting of Matchers for all
|
|
||||||
// parameters of F.
|
|
||||||
// MakeResultVoid: the function type obtained by substituting void
|
|
||||||
// for the return type of F.
|
|
||||||
// MakeResultIgnoredValue:
|
|
||||||
// the function type obtained by substituting Something
|
|
||||||
// for the return type of F.
|
|
||||||
template <typename F>
|
|
||||||
struct Function;
|
|
||||||
|
|
||||||
template <typename R>
|
|
||||||
struct Function<R()> {
|
|
||||||
typedef R Result;
|
|
||||||
typedef ::testing::tuple<> ArgumentTuple;
|
|
||||||
typedef typename MatcherTuple<ArgumentTuple>::type ArgumentMatcherTuple;
|
|
||||||
typedef void MakeResultVoid();
|
|
||||||
typedef IgnoredValue MakeResultIgnoredValue();
|
|
||||||
};
|
|
||||||
|
|
||||||
template <typename R, typename A1>
|
|
||||||
struct Function<R(A1)>
|
|
||||||
: Function<R()> {
|
|
||||||
typedef A1 Argument1;
|
|
||||||
typedef ::testing::tuple<A1> ArgumentTuple;
|
|
||||||
typedef typename MatcherTuple<ArgumentTuple>::type ArgumentMatcherTuple;
|
|
||||||
typedef void MakeResultVoid(A1);
|
|
||||||
typedef IgnoredValue MakeResultIgnoredValue(A1);
|
|
||||||
};
|
|
||||||
|
|
||||||
template <typename R, typename A1, typename A2>
|
|
||||||
struct Function<R(A1, A2)>
|
|
||||||
: Function<R(A1)> {
|
|
||||||
typedef A2 Argument2;
|
|
||||||
typedef ::testing::tuple<A1, A2> ArgumentTuple;
|
|
||||||
typedef typename MatcherTuple<ArgumentTuple>::type ArgumentMatcherTuple;
|
|
||||||
typedef void MakeResultVoid(A1, A2);
|
|
||||||
typedef IgnoredValue MakeResultIgnoredValue(A1, A2);
|
|
||||||
};
|
|
||||||
|
|
||||||
template <typename R, typename A1, typename A2, typename A3>
|
|
||||||
struct Function<R(A1, A2, A3)>
|
|
||||||
: Function<R(A1, A2)> {
|
|
||||||
typedef A3 Argument3;
|
|
||||||
typedef ::testing::tuple<A1, A2, A3> ArgumentTuple;
|
|
||||||
typedef typename MatcherTuple<ArgumentTuple>::type ArgumentMatcherTuple;
|
|
||||||
typedef void MakeResultVoid(A1, A2, A3);
|
|
||||||
typedef IgnoredValue MakeResultIgnoredValue(A1, A2, A3);
|
|
||||||
};
|
|
||||||
|
|
||||||
template <typename R, typename A1, typename A2, typename A3, typename A4>
|
|
||||||
struct Function<R(A1, A2, A3, A4)>
|
|
||||||
: Function<R(A1, A2, A3)> {
|
|
||||||
typedef A4 Argument4;
|
|
||||||
typedef ::testing::tuple<A1, A2, A3, A4> ArgumentTuple;
|
|
||||||
typedef typename MatcherTuple<ArgumentTuple>::type ArgumentMatcherTuple;
|
|
||||||
typedef void MakeResultVoid(A1, A2, A3, A4);
|
|
||||||
typedef IgnoredValue MakeResultIgnoredValue(A1, A2, A3, A4);
|
|
||||||
};
|
|
||||||
|
|
||||||
template <typename R, typename A1, typename A2, typename A3, typename A4,
|
|
||||||
typename A5>
|
|
||||||
struct Function<R(A1, A2, A3, A4, A5)>
|
|
||||||
: Function<R(A1, A2, A3, A4)> {
|
|
||||||
typedef A5 Argument5;
|
|
||||||
typedef ::testing::tuple<A1, A2, A3, A4, A5> ArgumentTuple;
|
|
||||||
typedef typename MatcherTuple<ArgumentTuple>::type ArgumentMatcherTuple;
|
|
||||||
typedef void MakeResultVoid(A1, A2, A3, A4, A5);
|
|
||||||
typedef IgnoredValue MakeResultIgnoredValue(A1, A2, A3, A4, A5);
|
|
||||||
};
|
|
||||||
|
|
||||||
template <typename R, typename A1, typename A2, typename A3, typename A4,
|
|
||||||
typename A5, typename A6>
|
|
||||||
struct Function<R(A1, A2, A3, A4, A5, A6)>
|
|
||||||
: Function<R(A1, A2, A3, A4, A5)> {
|
|
||||||
typedef A6 Argument6;
|
|
||||||
typedef ::testing::tuple<A1, A2, A3, A4, A5, A6> ArgumentTuple;
|
|
||||||
typedef typename MatcherTuple<ArgumentTuple>::type ArgumentMatcherTuple;
|
|
||||||
typedef void MakeResultVoid(A1, A2, A3, A4, A5, A6);
|
|
||||||
typedef IgnoredValue MakeResultIgnoredValue(A1, A2, A3, A4, A5, A6);
|
|
||||||
};
|
|
||||||
|
|
||||||
template <typename R, typename A1, typename A2, typename A3, typename A4,
|
|
||||||
typename A5, typename A6, typename A7>
|
|
||||||
struct Function<R(A1, A2, A3, A4, A5, A6, A7)>
|
|
||||||
: Function<R(A1, A2, A3, A4, A5, A6)> {
|
|
||||||
typedef A7 Argument7;
|
|
||||||
typedef ::testing::tuple<A1, A2, A3, A4, A5, A6, A7> ArgumentTuple;
|
|
||||||
typedef typename MatcherTuple<ArgumentTuple>::type ArgumentMatcherTuple;
|
|
||||||
typedef void MakeResultVoid(A1, A2, A3, A4, A5, A6, A7);
|
|
||||||
typedef IgnoredValue MakeResultIgnoredValue(A1, A2, A3, A4, A5, A6, A7);
|
|
||||||
};
|
|
||||||
|
|
||||||
template <typename R, typename A1, typename A2, typename A3, typename A4,
|
|
||||||
typename A5, typename A6, typename A7, typename A8>
|
|
||||||
struct Function<R(A1, A2, A3, A4, A5, A6, A7, A8)>
|
|
||||||
: Function<R(A1, A2, A3, A4, A5, A6, A7)> {
|
|
||||||
typedef A8 Argument8;
|
|
||||||
typedef ::testing::tuple<A1, A2, A3, A4, A5, A6, A7, A8> ArgumentTuple;
|
|
||||||
typedef typename MatcherTuple<ArgumentTuple>::type ArgumentMatcherTuple;
|
|
||||||
typedef void MakeResultVoid(A1, A2, A3, A4, A5, A6, A7, A8);
|
|
||||||
typedef IgnoredValue MakeResultIgnoredValue(A1, A2, A3, A4, A5, A6, A7, A8);
|
|
||||||
};
|
|
||||||
|
|
||||||
template <typename R, typename A1, typename A2, typename A3, typename A4,
|
|
||||||
typename A5, typename A6, typename A7, typename A8, typename A9>
|
|
||||||
struct Function<R(A1, A2, A3, A4, A5, A6, A7, A8, A9)>
|
|
||||||
: Function<R(A1, A2, A3, A4, A5, A6, A7, A8)> {
|
|
||||||
typedef A9 Argument9;
|
|
||||||
typedef ::testing::tuple<A1, A2, A3, A4, A5, A6, A7, A8, A9> ArgumentTuple;
|
|
||||||
typedef typename MatcherTuple<ArgumentTuple>::type ArgumentMatcherTuple;
|
|
||||||
typedef void MakeResultVoid(A1, A2, A3, A4, A5, A6, A7, A8, A9);
|
|
||||||
typedef IgnoredValue MakeResultIgnoredValue(A1, A2, A3, A4, A5, A6, A7, A8,
|
|
||||||
A9);
|
|
||||||
};
|
|
||||||
|
|
||||||
template <typename R, typename A1, typename A2, typename A3, typename A4,
|
|
||||||
typename A5, typename A6, typename A7, typename A8, typename A9,
|
|
||||||
typename A10>
|
|
||||||
struct Function<R(A1, A2, A3, A4, A5, A6, A7, A8, A9, A10)>
|
|
||||||
: Function<R(A1, A2, A3, A4, A5, A6, A7, A8, A9)> {
|
|
||||||
typedef A10 Argument10;
|
|
||||||
typedef ::testing::tuple<A1, A2, A3, A4, A5, A6, A7, A8, A9,
|
|
||||||
A10> ArgumentTuple;
|
|
||||||
typedef typename MatcherTuple<ArgumentTuple>::type ArgumentMatcherTuple;
|
|
||||||
typedef void MakeResultVoid(A1, A2, A3, A4, A5, A6, A7, A8, A9, A10);
|
|
||||||
typedef IgnoredValue MakeResultIgnoredValue(A1, A2, A3, A4, A5, A6, A7, A8,
|
|
||||||
A9, A10);
|
|
||||||
};
|
|
||||||
|
|
||||||
} // namespace internal
|
|
||||||
|
|
||||||
} // namespace testing
|
|
||||||
|
|
||||||
#endif // GMOCK_INCLUDE_GMOCK_INTERNAL_GMOCK_GENERATED_INTERNAL_UTILS_H_
|
|
@ -1,137 +0,0 @@
|
|||||||
$$ -*- mode: c++; -*-
|
|
||||||
$$ This is a Pump source file. Please use Pump to convert it to
|
|
||||||
$$ gmock-generated-function-mockers.h.
|
|
||||||
$$
|
|
||||||
$var n = 10 $$ The maximum arity we support.
|
|
||||||
// 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.
|
|
||||||
|
|
||||||
|
|
||||||
// Google Mock - a framework for writing C++ mock classes.
|
|
||||||
//
|
|
||||||
// This file contains template meta-programming utility classes needed
|
|
||||||
// for implementing Google Mock.
|
|
||||||
|
|
||||||
// GOOGLETEST_CM0002 DO NOT DELETE
|
|
||||||
|
|
||||||
#ifndef GMOCK_INCLUDE_GMOCK_INTERNAL_GMOCK_GENERATED_INTERNAL_UTILS_H_
|
|
||||||
#define GMOCK_INCLUDE_GMOCK_INTERNAL_GMOCK_GENERATED_INTERNAL_UTILS_H_
|
|
||||||
|
|
||||||
#include "gmock/internal/gmock-port.h"
|
|
||||||
|
|
||||||
namespace testing {
|
|
||||||
|
|
||||||
template <typename T>
|
|
||||||
class Matcher;
|
|
||||||
|
|
||||||
namespace internal {
|
|
||||||
|
|
||||||
// An IgnoredValue object can be implicitly constructed from ANY value.
|
|
||||||
// This is used in implementing the IgnoreResult(a) action.
|
|
||||||
class IgnoredValue {
|
|
||||||
public:
|
|
||||||
// This constructor template allows any value to be implicitly
|
|
||||||
// converted to IgnoredValue. The object has no data member and
|
|
||||||
// doesn't try to remember anything about the argument. We
|
|
||||||
// deliberately omit the 'explicit' keyword in order to allow the
|
|
||||||
// conversion to be implicit.
|
|
||||||
template <typename T>
|
|
||||||
IgnoredValue(const T& /* ignored */) {} // NOLINT(runtime/explicit)
|
|
||||||
};
|
|
||||||
|
|
||||||
// MatcherTuple<T>::type is a tuple type where each field is a Matcher
|
|
||||||
// for the corresponding field in tuple type T.
|
|
||||||
template <typename Tuple>
|
|
||||||
struct MatcherTuple;
|
|
||||||
|
|
||||||
|
|
||||||
$range i 0..n
|
|
||||||
$for i [[
|
|
||||||
$range j 1..i
|
|
||||||
$var typename_As = [[$for j, [[typename A$j]]]]
|
|
||||||
$var As = [[$for j, [[A$j]]]]
|
|
||||||
$var matcher_As = [[$for j, [[Matcher<A$j>]]]]
|
|
||||||
template <$typename_As>
|
|
||||||
struct MatcherTuple< ::testing::tuple<$As> > {
|
|
||||||
typedef ::testing::tuple<$matcher_As > type;
|
|
||||||
};
|
|
||||||
|
|
||||||
|
|
||||||
]]
|
|
||||||
// Template struct Function<F>, where F must be a function type, contains
|
|
||||||
// the following typedefs:
|
|
||||||
//
|
|
||||||
// Result: the function's return type.
|
|
||||||
// ArgumentN: the type of the N-th argument, where N starts with 1.
|
|
||||||
// ArgumentTuple: the tuple type consisting of all parameters of F.
|
|
||||||
// ArgumentMatcherTuple: the tuple type consisting of Matchers for all
|
|
||||||
// parameters of F.
|
|
||||||
// MakeResultVoid: the function type obtained by substituting void
|
|
||||||
// for the return type of F.
|
|
||||||
// MakeResultIgnoredValue:
|
|
||||||
// the function type obtained by substituting Something
|
|
||||||
// for the return type of F.
|
|
||||||
template <typename F>
|
|
||||||
struct Function;
|
|
||||||
|
|
||||||
template <typename R>
|
|
||||||
struct Function<R()> {
|
|
||||||
typedef R Result;
|
|
||||||
typedef ::testing::tuple<> ArgumentTuple;
|
|
||||||
typedef typename MatcherTuple<ArgumentTuple>::type ArgumentMatcherTuple;
|
|
||||||
typedef void MakeResultVoid();
|
|
||||||
typedef IgnoredValue MakeResultIgnoredValue();
|
|
||||||
};
|
|
||||||
|
|
||||||
|
|
||||||
$range i 1..n
|
|
||||||
$for i [[
|
|
||||||
$range j 1..i
|
|
||||||
$var typename_As = [[$for j [[, typename A$j]]]]
|
|
||||||
$var As = [[$for j, [[A$j]]]]
|
|
||||||
$var matcher_As = [[$for j, [[Matcher<A$j>]]]]
|
|
||||||
$range k 1..i-1
|
|
||||||
$var prev_As = [[$for k, [[A$k]]]]
|
|
||||||
template <typename R$typename_As>
|
|
||||||
struct Function<R($As)>
|
|
||||||
: Function<R($prev_As)> {
|
|
||||||
typedef A$i Argument$i;
|
|
||||||
typedef ::testing::tuple<$As> ArgumentTuple;
|
|
||||||
typedef typename MatcherTuple<ArgumentTuple>::type ArgumentMatcherTuple;
|
|
||||||
typedef void MakeResultVoid($As);
|
|
||||||
typedef IgnoredValue MakeResultIgnoredValue($As);
|
|
||||||
};
|
|
||||||
|
|
||||||
|
|
||||||
]]
|
|
||||||
} // namespace internal
|
|
||||||
|
|
||||||
} // namespace testing
|
|
||||||
|
|
||||||
#endif // GMOCK_INCLUDE_GMOCK_INTERNAL_GMOCK_GENERATED_INTERNAL_UTILS_H_
|
|
@ -1,575 +0,0 @@
|
|||||||
// 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.
|
|
||||||
|
|
||||||
|
|
||||||
// Google Mock - a framework for writing C++ mock classes.
|
|
||||||
//
|
|
||||||
// This file defines some utilities useful for implementing Google
|
|
||||||
// Mock. They are subject to change without notice, so please DO NOT
|
|
||||||
// USE THEM IN USER CODE.
|
|
||||||
|
|
||||||
// GOOGLETEST_CM0002 DO NOT DELETE
|
|
||||||
|
|
||||||
#ifndef GMOCK_INCLUDE_GMOCK_INTERNAL_GMOCK_INTERNAL_UTILS_H_
|
|
||||||
#define GMOCK_INCLUDE_GMOCK_INTERNAL_GMOCK_INTERNAL_UTILS_H_
|
|
||||||
|
|
||||||
#include <stdio.h>
|
|
||||||
#include <ostream> // NOLINT
|
|
||||||
#include <string>
|
|
||||||
#include "gmock/internal/gmock-generated-internal-utils.h"
|
|
||||||
#include "gmock/internal/gmock-port.h"
|
|
||||||
#include "gtest/gtest.h"
|
|
||||||
|
|
||||||
namespace testing {
|
|
||||||
namespace internal {
|
|
||||||
|
|
||||||
// Silence MSVC C4100 (unreferenced formal parameter) and
|
|
||||||
// C4805('==': unsafe mix of type 'const int' and type 'const bool')
|
|
||||||
#ifdef _MSC_VER
|
|
||||||
# pragma warning(push)
|
|
||||||
# pragma warning(disable:4100)
|
|
||||||
# pragma warning(disable:4805)
|
|
||||||
#endif
|
|
||||||
|
|
||||||
// Joins a vector of strings as if they are fields of a tuple; returns
|
|
||||||
// the joined string.
|
|
||||||
GTEST_API_ std::string JoinAsTuple(const Strings& fields);
|
|
||||||
|
|
||||||
// Converts an identifier name to a space-separated list of lower-case
|
|
||||||
// words. Each maximum substring of the form [A-Za-z][a-z]*|\d+ is
|
|
||||||
// treated as one word. For example, both "FooBar123" and
|
|
||||||
// "foo_bar_123" are converted to "foo bar 123".
|
|
||||||
GTEST_API_ std::string ConvertIdentifierNameToWords(const char* id_name);
|
|
||||||
|
|
||||||
// PointeeOf<Pointer>::type is the type of a value pointed to by a
|
|
||||||
// Pointer, which can be either a smart pointer or a raw pointer. The
|
|
||||||
// following default implementation is for the case where Pointer is a
|
|
||||||
// smart pointer.
|
|
||||||
template <typename Pointer>
|
|
||||||
struct PointeeOf {
|
|
||||||
// Smart pointer classes define type element_type as the type of
|
|
||||||
// their pointees.
|
|
||||||
typedef typename Pointer::element_type type;
|
|
||||||
};
|
|
||||||
// This specialization is for the raw pointer case.
|
|
||||||
template <typename T>
|
|
||||||
struct PointeeOf<T*> { typedef T type; }; // NOLINT
|
|
||||||
|
|
||||||
// GetRawPointer(p) returns the raw pointer underlying p when p is a
|
|
||||||
// smart pointer, or returns p itself when p is already a raw pointer.
|
|
||||||
// The following default implementation is for the smart pointer case.
|
|
||||||
template <typename Pointer>
|
|
||||||
inline const typename Pointer::element_type* GetRawPointer(const Pointer& p) {
|
|
||||||
return p.get();
|
|
||||||
}
|
|
||||||
// This overloaded version is for the raw pointer case.
|
|
||||||
template <typename Element>
|
|
||||||
inline Element* GetRawPointer(Element* p) { return p; }
|
|
||||||
|
|
||||||
// This comparator allows linked_ptr to be stored in sets.
|
|
||||||
template <typename T>
|
|
||||||
struct LinkedPtrLessThan {
|
|
||||||
bool operator()(const ::testing::internal::linked_ptr<T>& lhs,
|
|
||||||
const ::testing::internal::linked_ptr<T>& rhs) const {
|
|
||||||
return lhs.get() < rhs.get();
|
|
||||||
}
|
|
||||||
};
|
|
||||||
|
|
||||||
// Symbian compilation can be done with wchar_t being either a native
|
|
||||||
// type or a typedef. Using Google Mock with OpenC without wchar_t
|
|
||||||
// should require the definition of _STLP_NO_WCHAR_T.
|
|
||||||
//
|
|
||||||
// MSVC treats wchar_t as a native type usually, but treats it as the
|
|
||||||
// same as unsigned short when the compiler option /Zc:wchar_t- is
|
|
||||||
// specified. It defines _NATIVE_WCHAR_T_DEFINED symbol when wchar_t
|
|
||||||
// is a native type.
|
|
||||||
#if (GTEST_OS_SYMBIAN && defined(_STLP_NO_WCHAR_T)) || \
|
|
||||||
(defined(_MSC_VER) && !defined(_NATIVE_WCHAR_T_DEFINED))
|
|
||||||
// wchar_t is a typedef.
|
|
||||||
#else
|
|
||||||
# define GMOCK_WCHAR_T_IS_NATIVE_ 1
|
|
||||||
#endif
|
|
||||||
|
|
||||||
// signed wchar_t and unsigned wchar_t are NOT in the C++ standard.
|
|
||||||
// Using them is a bad practice and not portable. So DON'T use them.
|
|
||||||
//
|
|
||||||
// Still, Google Mock is designed to work even if the user uses signed
|
|
||||||
// wchar_t or unsigned wchar_t (obviously, assuming the compiler
|
|
||||||
// supports them).
|
|
||||||
//
|
|
||||||
// To gcc,
|
|
||||||
// wchar_t == signed wchar_t != unsigned wchar_t == unsigned int
|
|
||||||
#ifdef __GNUC__
|
|
||||||
#if !defined(__WCHAR_UNSIGNED__)
|
|
||||||
// signed/unsigned wchar_t are valid types.
|
|
||||||
# define GMOCK_HAS_SIGNED_WCHAR_T_ 1
|
|
||||||
#endif
|
|
||||||
#endif
|
|
||||||
|
|
||||||
// In what follows, we use the term "kind" to indicate whether a type
|
|
||||||
// is bool, an integer type (excluding bool), a floating-point type,
|
|
||||||
// or none of them. This categorization is useful for determining
|
|
||||||
// when a matcher argument type can be safely converted to another
|
|
||||||
// type in the implementation of SafeMatcherCast.
|
|
||||||
enum TypeKind {
|
|
||||||
kBool, kInteger, kFloatingPoint, kOther
|
|
||||||
};
|
|
||||||
|
|
||||||
// KindOf<T>::value is the kind of type T.
|
|
||||||
template <typename T> struct KindOf {
|
|
||||||
enum { value = kOther }; // The default kind.
|
|
||||||
};
|
|
||||||
|
|
||||||
// This macro declares that the kind of 'type' is 'kind'.
|
|
||||||
#define GMOCK_DECLARE_KIND_(type, kind) \
|
|
||||||
template <> struct KindOf<type> { enum { value = kind }; }
|
|
||||||
|
|
||||||
GMOCK_DECLARE_KIND_(bool, kBool);
|
|
||||||
|
|
||||||
// All standard integer types.
|
|
||||||
GMOCK_DECLARE_KIND_(char, kInteger);
|
|
||||||
GMOCK_DECLARE_KIND_(signed char, kInteger);
|
|
||||||
GMOCK_DECLARE_KIND_(unsigned char, kInteger);
|
|
||||||
GMOCK_DECLARE_KIND_(short, kInteger); // NOLINT
|
|
||||||
GMOCK_DECLARE_KIND_(unsigned short, kInteger); // NOLINT
|
|
||||||
GMOCK_DECLARE_KIND_(int, kInteger);
|
|
||||||
GMOCK_DECLARE_KIND_(unsigned int, kInteger);
|
|
||||||
GMOCK_DECLARE_KIND_(long, kInteger); // NOLINT
|
|
||||||
GMOCK_DECLARE_KIND_(unsigned long, kInteger); // NOLINT
|
|
||||||
|
|
||||||
#if GMOCK_WCHAR_T_IS_NATIVE_
|
|
||||||
GMOCK_DECLARE_KIND_(wchar_t, kInteger);
|
|
||||||
#endif
|
|
||||||
|
|
||||||
// Non-standard integer types.
|
|
||||||
GMOCK_DECLARE_KIND_(Int64, kInteger);
|
|
||||||
GMOCK_DECLARE_KIND_(UInt64, kInteger);
|
|
||||||
|
|
||||||
// All standard floating-point types.
|
|
||||||
GMOCK_DECLARE_KIND_(float, kFloatingPoint);
|
|
||||||
GMOCK_DECLARE_KIND_(double, kFloatingPoint);
|
|
||||||
GMOCK_DECLARE_KIND_(long double, kFloatingPoint);
|
|
||||||
|
|
||||||
#undef GMOCK_DECLARE_KIND_
|
|
||||||
|
|
||||||
// Evaluates to the kind of 'type'.
|
|
||||||
#define GMOCK_KIND_OF_(type) \
|
|
||||||
static_cast< ::testing::internal::TypeKind>( \
|
|
||||||
::testing::internal::KindOf<type>::value)
|
|
||||||
|
|
||||||
// Evaluates to true iff integer type T is signed.
|
|
||||||
#define GMOCK_IS_SIGNED_(T) (static_cast<T>(-1) < 0)
|
|
||||||
|
|
||||||
// LosslessArithmeticConvertibleImpl<kFromKind, From, kToKind, To>::value
|
|
||||||
// is true iff arithmetic type From can be losslessly converted to
|
|
||||||
// arithmetic type To.
|
|
||||||
//
|
|
||||||
// It's the user's responsibility to ensure that both From and To are
|
|
||||||
// raw (i.e. has no CV modifier, is not a pointer, and is not a
|
|
||||||
// reference) built-in arithmetic types, kFromKind is the kind of
|
|
||||||
// From, and kToKind is the kind of To; the value is
|
|
||||||
// implementation-defined when the above pre-condition is violated.
|
|
||||||
template <TypeKind kFromKind, typename From, TypeKind kToKind, typename To>
|
|
||||||
struct LosslessArithmeticConvertibleImpl : public false_type {};
|
|
||||||
|
|
||||||
// Converting bool to bool is lossless.
|
|
||||||
template <>
|
|
||||||
struct LosslessArithmeticConvertibleImpl<kBool, bool, kBool, bool>
|
|
||||||
: public true_type {}; // NOLINT
|
|
||||||
|
|
||||||
// Converting bool to any integer type is lossless.
|
|
||||||
template <typename To>
|
|
||||||
struct LosslessArithmeticConvertibleImpl<kBool, bool, kInteger, To>
|
|
||||||
: public true_type {}; // NOLINT
|
|
||||||
|
|
||||||
// Converting bool to any floating-point type is lossless.
|
|
||||||
template <typename To>
|
|
||||||
struct LosslessArithmeticConvertibleImpl<kBool, bool, kFloatingPoint, To>
|
|
||||||
: public true_type {}; // NOLINT
|
|
||||||
|
|
||||||
// Converting an integer to bool is lossy.
|
|
||||||
template <typename From>
|
|
||||||
struct LosslessArithmeticConvertibleImpl<kInteger, From, kBool, bool>
|
|
||||||
: public false_type {}; // NOLINT
|
|
||||||
|
|
||||||
// Converting an integer to another non-bool integer is lossless iff
|
|
||||||
// the target type's range encloses the source type's range.
|
|
||||||
template <typename From, typename To>
|
|
||||||
struct LosslessArithmeticConvertibleImpl<kInteger, From, kInteger, To>
|
|
||||||
: public bool_constant<
|
|
||||||
// When converting from a smaller size to a larger size, we are
|
|
||||||
// fine as long as we are not converting from signed to unsigned.
|
|
||||||
((sizeof(From) < sizeof(To)) &&
|
|
||||||
(!GMOCK_IS_SIGNED_(From) || GMOCK_IS_SIGNED_(To))) ||
|
|
||||||
// When converting between the same size, the signedness must match.
|
|
||||||
((sizeof(From) == sizeof(To)) &&
|
|
||||||
(GMOCK_IS_SIGNED_(From) == GMOCK_IS_SIGNED_(To)))> {}; // NOLINT
|
|
||||||
|
|
||||||
#undef GMOCK_IS_SIGNED_
|
|
||||||
|
|
||||||
// Converting an integer to a floating-point type may be lossy, since
|
|
||||||
// the format of a floating-point number is implementation-defined.
|
|
||||||
template <typename From, typename To>
|
|
||||||
struct LosslessArithmeticConvertibleImpl<kInteger, From, kFloatingPoint, To>
|
|
||||||
: public false_type {}; // NOLINT
|
|
||||||
|
|
||||||
// Converting a floating-point to bool is lossy.
|
|
||||||
template <typename From>
|
|
||||||
struct LosslessArithmeticConvertibleImpl<kFloatingPoint, From, kBool, bool>
|
|
||||||
: public false_type {}; // NOLINT
|
|
||||||
|
|
||||||
// Converting a floating-point to an integer is lossy.
|
|
||||||
template <typename From, typename To>
|
|
||||||
struct LosslessArithmeticConvertibleImpl<kFloatingPoint, From, kInteger, To>
|
|
||||||
: public false_type {}; // NOLINT
|
|
||||||
|
|
||||||
// Converting a floating-point to another floating-point is lossless
|
|
||||||
// iff the target type is at least as big as the source type.
|
|
||||||
template <typename From, typename To>
|
|
||||||
struct LosslessArithmeticConvertibleImpl<
|
|
||||||
kFloatingPoint, From, kFloatingPoint, To>
|
|
||||||
: public bool_constant<sizeof(From) <= sizeof(To)> {}; // NOLINT
|
|
||||||
|
|
||||||
// LosslessArithmeticConvertible<From, To>::value is true iff arithmetic
|
|
||||||
// type From can be losslessly converted to arithmetic type To.
|
|
||||||
//
|
|
||||||
// It's the user's responsibility to ensure that both From and To are
|
|
||||||
// raw (i.e. has no CV modifier, is not a pointer, and is not a
|
|
||||||
// reference) built-in arithmetic types; the value is
|
|
||||||
// implementation-defined when the above pre-condition is violated.
|
|
||||||
template <typename From, typename To>
|
|
||||||
struct LosslessArithmeticConvertible
|
|
||||||
: public LosslessArithmeticConvertibleImpl<
|
|
||||||
GMOCK_KIND_OF_(From), From, GMOCK_KIND_OF_(To), To> {}; // NOLINT
|
|
||||||
|
|
||||||
// This interface knows how to report a Google Mock failure (either
|
|
||||||
// non-fatal or fatal).
|
|
||||||
class FailureReporterInterface {
|
|
||||||
public:
|
|
||||||
// The type of a failure (either non-fatal or fatal).
|
|
||||||
enum FailureType {
|
|
||||||
kNonfatal, kFatal
|
|
||||||
};
|
|
||||||
|
|
||||||
virtual ~FailureReporterInterface() {}
|
|
||||||
|
|
||||||
// Reports a failure that occurred at the given source file location.
|
|
||||||
virtual void ReportFailure(FailureType type, const char* file, int line,
|
|
||||||
const std::string& message) = 0;
|
|
||||||
};
|
|
||||||
|
|
||||||
// Returns the failure reporter used by Google Mock.
|
|
||||||
GTEST_API_ FailureReporterInterface* GetFailureReporter();
|
|
||||||
|
|
||||||
// Asserts that condition is true; aborts the process with the given
|
|
||||||
// message if condition is false. We cannot use LOG(FATAL) or CHECK()
|
|
||||||
// as Google Mock might be used to mock the log sink itself. We
|
|
||||||
// inline this function to prevent it from showing up in the stack
|
|
||||||
// trace.
|
|
||||||
inline void Assert(bool condition, const char* file, int line,
|
|
||||||
const std::string& msg) {
|
|
||||||
if (!condition) {
|
|
||||||
GetFailureReporter()->ReportFailure(FailureReporterInterface::kFatal,
|
|
||||||
file, line, msg);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
inline void Assert(bool condition, const char* file, int line) {
|
|
||||||
Assert(condition, file, line, "Assertion failed.");
|
|
||||||
}
|
|
||||||
|
|
||||||
// Verifies that condition is true; generates a non-fatal failure if
|
|
||||||
// condition is false.
|
|
||||||
inline void Expect(bool condition, const char* file, int line,
|
|
||||||
const std::string& msg) {
|
|
||||||
if (!condition) {
|
|
||||||
GetFailureReporter()->ReportFailure(FailureReporterInterface::kNonfatal,
|
|
||||||
file, line, msg);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
inline void Expect(bool condition, const char* file, int line) {
|
|
||||||
Expect(condition, file, line, "Expectation failed.");
|
|
||||||
}
|
|
||||||
|
|
||||||
// Severity level of a log.
|
|
||||||
enum LogSeverity {
|
|
||||||
kInfo = 0,
|
|
||||||
kWarning = 1
|
|
||||||
};
|
|
||||||
|
|
||||||
// Valid values for the --gmock_verbose flag.
|
|
||||||
|
|
||||||
// All logs (informational and warnings) are printed.
|
|
||||||
const char kInfoVerbosity[] = "info";
|
|
||||||
// Only warnings are printed.
|
|
||||||
const char kWarningVerbosity[] = "warning";
|
|
||||||
// No logs are printed.
|
|
||||||
const char kErrorVerbosity[] = "error";
|
|
||||||
|
|
||||||
// Returns true iff a log with the given severity is visible according
|
|
||||||
// to the --gmock_verbose flag.
|
|
||||||
GTEST_API_ bool LogIsVisible(LogSeverity severity);
|
|
||||||
|
|
||||||
// Prints the given message to stdout iff 'severity' >= the level
|
|
||||||
// specified by the --gmock_verbose flag. If stack_frames_to_skip >=
|
|
||||||
// 0, also prints the stack trace excluding the top
|
|
||||||
// stack_frames_to_skip frames. In opt mode, any positive
|
|
||||||
// stack_frames_to_skip is treated as 0, since we don't know which
|
|
||||||
// function calls will be inlined by the compiler and need to be
|
|
||||||
// conservative.
|
|
||||||
GTEST_API_ void Log(LogSeverity severity, const std::string& message,
|
|
||||||
int stack_frames_to_skip);
|
|
||||||
|
|
||||||
// A marker class that is used to resolve parameterless expectations to the
|
|
||||||
// correct overload. This must not be instantiable, to prevent client code from
|
|
||||||
// accidentally resolving to the overload; for example:
|
|
||||||
//
|
|
||||||
// ON_CALL(mock, Method({}, nullptr))...
|
|
||||||
//
|
|
||||||
class WithoutMatchers {
|
|
||||||
private:
|
|
||||||
WithoutMatchers() {}
|
|
||||||
friend GTEST_API_ WithoutMatchers GetWithoutMatchers();
|
|
||||||
};
|
|
||||||
|
|
||||||
// Internal use only: access the singleton instance of WithoutMatchers.
|
|
||||||
GTEST_API_ WithoutMatchers GetWithoutMatchers();
|
|
||||||
|
|
||||||
// FIXME: group all type utilities together.
|
|
||||||
|
|
||||||
// Type traits.
|
|
||||||
|
|
||||||
// is_reference<T>::value is non-zero iff T is a reference type.
|
|
||||||
template <typename T> struct is_reference : public false_type {};
|
|
||||||
template <typename T> struct is_reference<T&> : public true_type {};
|
|
||||||
|
|
||||||
// type_equals<T1, T2>::value is non-zero iff T1 and T2 are the same type.
|
|
||||||
template <typename T1, typename T2> struct type_equals : public false_type {};
|
|
||||||
template <typename T> struct type_equals<T, T> : public true_type {};
|
|
||||||
|
|
||||||
// remove_reference<T>::type removes the reference from type T, if any.
|
|
||||||
template <typename T> struct remove_reference { typedef T type; }; // NOLINT
|
|
||||||
template <typename T> struct remove_reference<T&> { typedef T type; }; // NOLINT
|
|
||||||
|
|
||||||
// DecayArray<T>::type turns an array type U[N] to const U* and preserves
|
|
||||||
// other types. Useful for saving a copy of a function argument.
|
|
||||||
template <typename T> struct DecayArray { typedef T type; }; // NOLINT
|
|
||||||
template <typename T, size_t N> struct DecayArray<T[N]> {
|
|
||||||
typedef const T* type;
|
|
||||||
};
|
|
||||||
// Sometimes people use arrays whose size is not available at the use site
|
|
||||||
// (e.g. extern const char kNamePrefix[]). This specialization covers that
|
|
||||||
// case.
|
|
||||||
template <typename T> struct DecayArray<T[]> {
|
|
||||||
typedef const T* type;
|
|
||||||
};
|
|
||||||
|
|
||||||
// Disable MSVC warnings for infinite recursion, since in this case the
|
|
||||||
// the recursion is unreachable.
|
|
||||||
#ifdef _MSC_VER
|
|
||||||
# pragma warning(push)
|
|
||||||
# pragma warning(disable:4717)
|
|
||||||
#endif
|
|
||||||
|
|
||||||
// Invalid<T>() is usable as an expression of type T, but will terminate
|
|
||||||
// the program with an assertion failure if actually run. This is useful
|
|
||||||
// when a value of type T is needed for compilation, but the statement
|
|
||||||
// will not really be executed (or we don't care if the statement
|
|
||||||
// crashes).
|
|
||||||
template <typename T>
|
|
||||||
inline T Invalid() {
|
|
||||||
Assert(false, "", -1, "Internal error: attempt to return invalid value");
|
|
||||||
// This statement is unreachable, and would never terminate even if it
|
|
||||||
// could be reached. It is provided only to placate compiler warnings
|
|
||||||
// about missing return statements.
|
|
||||||
return Invalid<T>();
|
|
||||||
}
|
|
||||||
|
|
||||||
#ifdef _MSC_VER
|
|
||||||
# pragma warning(pop)
|
|
||||||
#endif
|
|
||||||
|
|
||||||
// Given a raw type (i.e. having no top-level reference or const
|
|
||||||
// modifier) RawContainer that's either an STL-style container or a
|
|
||||||
// native array, class StlContainerView<RawContainer> has the
|
|
||||||
// following members:
|
|
||||||
//
|
|
||||||
// - type is a type that provides an STL-style container view to
|
|
||||||
// (i.e. implements the STL container concept for) RawContainer;
|
|
||||||
// - const_reference is a type that provides a reference to a const
|
|
||||||
// RawContainer;
|
|
||||||
// - ConstReference(raw_container) returns a const reference to an STL-style
|
|
||||||
// container view to raw_container, which is a RawContainer.
|
|
||||||
// - Copy(raw_container) returns an STL-style container view of a
|
|
||||||
// copy of raw_container, which is a RawContainer.
|
|
||||||
//
|
|
||||||
// This generic version is used when RawContainer itself is already an
|
|
||||||
// STL-style container.
|
|
||||||
template <class RawContainer>
|
|
||||||
class StlContainerView {
|
|
||||||
public:
|
|
||||||
typedef RawContainer type;
|
|
||||||
typedef const type& const_reference;
|
|
||||||
|
|
||||||
static const_reference ConstReference(const RawContainer& container) {
|
|
||||||
// Ensures that RawContainer is not a const type.
|
|
||||||
testing::StaticAssertTypeEq<RawContainer,
|
|
||||||
GTEST_REMOVE_CONST_(RawContainer)>();
|
|
||||||
return container;
|
|
||||||
}
|
|
||||||
static type Copy(const RawContainer& container) { return container; }
|
|
||||||
};
|
|
||||||
|
|
||||||
// This specialization is used when RawContainer is a native array type.
|
|
||||||
template <typename Element, size_t N>
|
|
||||||
class StlContainerView<Element[N]> {
|
|
||||||
public:
|
|
||||||
typedef GTEST_REMOVE_CONST_(Element) RawElement;
|
|
||||||
typedef internal::NativeArray<RawElement> type;
|
|
||||||
// NativeArray<T> can represent a native array either by value or by
|
|
||||||
// reference (selected by a constructor argument), so 'const type'
|
|
||||||
// can be used to reference a const native array. We cannot
|
|
||||||
// 'typedef const type& const_reference' here, as that would mean
|
|
||||||
// ConstReference() has to return a reference to a local variable.
|
|
||||||
typedef const type const_reference;
|
|
||||||
|
|
||||||
static const_reference ConstReference(const Element (&array)[N]) {
|
|
||||||
// Ensures that Element is not a const type.
|
|
||||||
testing::StaticAssertTypeEq<Element, RawElement>();
|
|
||||||
#if GTEST_OS_SYMBIAN
|
|
||||||
// The Nokia Symbian compiler confuses itself in template instantiation
|
|
||||||
// for this call without the cast to Element*:
|
|
||||||
// function call '[testing::internal::NativeArray<char *>].NativeArray(
|
|
||||||
// {lval} const char *[4], long, testing::internal::RelationToSource)'
|
|
||||||
// does not match
|
|
||||||
// 'testing::internal::NativeArray<char *>::NativeArray(
|
|
||||||
// char *const *, unsigned int, testing::internal::RelationToSource)'
|
|
||||||
// (instantiating: 'testing::internal::ContainsMatcherImpl
|
|
||||||
// <const char * (&)[4]>::Matches(const char * (&)[4]) const')
|
|
||||||
// (instantiating: 'testing::internal::StlContainerView<char *[4]>::
|
|
||||||
// ConstReference(const char * (&)[4])')
|
|
||||||
// (and though the N parameter type is mismatched in the above explicit
|
|
||||||
// conversion of it doesn't help - only the conversion of the array).
|
|
||||||
return type(const_cast<Element*>(&array[0]), N,
|
|
||||||
RelationToSourceReference());
|
|
||||||
#else
|
|
||||||
return type(array, N, RelationToSourceReference());
|
|
||||||
#endif // GTEST_OS_SYMBIAN
|
|
||||||
}
|
|
||||||
static type Copy(const Element (&array)[N]) {
|
|
||||||
#if GTEST_OS_SYMBIAN
|
|
||||||
return type(const_cast<Element*>(&array[0]), N, RelationToSourceCopy());
|
|
||||||
#else
|
|
||||||
return type(array, N, RelationToSourceCopy());
|
|
||||||
#endif // GTEST_OS_SYMBIAN
|
|
||||||
}
|
|
||||||
};
|
|
||||||
|
|
||||||
// This specialization is used when RawContainer is a native array
|
|
||||||
// represented as a (pointer, size) tuple.
|
|
||||||
template <typename ElementPointer, typename Size>
|
|
||||||
class StlContainerView< ::testing::tuple<ElementPointer, Size> > {
|
|
||||||
public:
|
|
||||||
typedef GTEST_REMOVE_CONST_(
|
|
||||||
typename internal::PointeeOf<ElementPointer>::type) RawElement;
|
|
||||||
typedef internal::NativeArray<RawElement> type;
|
|
||||||
typedef const type const_reference;
|
|
||||||
|
|
||||||
static const_reference ConstReference(
|
|
||||||
const ::testing::tuple<ElementPointer, Size>& array) {
|
|
||||||
return type(get<0>(array), get<1>(array), RelationToSourceReference());
|
|
||||||
}
|
|
||||||
static type Copy(const ::testing::tuple<ElementPointer, Size>& array) {
|
|
||||||
return type(get<0>(array), get<1>(array), RelationToSourceCopy());
|
|
||||||
}
|
|
||||||
};
|
|
||||||
|
|
||||||
// The following specialization prevents the user from instantiating
|
|
||||||
// StlContainer with a reference type.
|
|
||||||
template <typename T> class StlContainerView<T&>;
|
|
||||||
|
|
||||||
// A type transform to remove constness from the first part of a pair.
|
|
||||||
// Pairs like that are used as the value_type of associative containers,
|
|
||||||
// and this transform produces a similar but assignable pair.
|
|
||||||
template <typename T>
|
|
||||||
struct RemoveConstFromKey {
|
|
||||||
typedef T type;
|
|
||||||
};
|
|
||||||
|
|
||||||
// Partially specialized to remove constness from std::pair<const K, V>.
|
|
||||||
template <typename K, typename V>
|
|
||||||
struct RemoveConstFromKey<std::pair<const K, V> > {
|
|
||||||
typedef std::pair<K, V> type;
|
|
||||||
};
|
|
||||||
|
|
||||||
// Mapping from booleans to types. Similar to boost::bool_<kValue> and
|
|
||||||
// std::integral_constant<bool, kValue>.
|
|
||||||
template <bool kValue>
|
|
||||||
struct BooleanConstant {};
|
|
||||||
|
|
||||||
// Emit an assertion failure due to incorrect DoDefault() usage. Out-of-lined to
|
|
||||||
// reduce code size.
|
|
||||||
GTEST_API_ void IllegalDoDefault(const char* file, int line);
|
|
||||||
|
|
||||||
#if GTEST_LANG_CXX11
|
|
||||||
// Helper types for Apply() below.
|
|
||||||
template <size_t... Is> struct int_pack { typedef int_pack type; };
|
|
||||||
|
|
||||||
template <class Pack, size_t I> struct append;
|
|
||||||
template <size_t... Is, size_t I>
|
|
||||||
struct append<int_pack<Is...>, I> : int_pack<Is..., I> {};
|
|
||||||
|
|
||||||
template <size_t C>
|
|
||||||
struct make_int_pack : append<typename make_int_pack<C - 1>::type, C - 1> {};
|
|
||||||
template <> struct make_int_pack<0> : int_pack<> {};
|
|
||||||
|
|
||||||
template <typename F, typename Tuple, size_t... Idx>
|
|
||||||
auto ApplyImpl(F&& f, Tuple&& args, int_pack<Idx...>) -> decltype(
|
|
||||||
std::forward<F>(f)(std::get<Idx>(std::forward<Tuple>(args))...)) {
|
|
||||||
return std::forward<F>(f)(std::get<Idx>(std::forward<Tuple>(args))...);
|
|
||||||
}
|
|
||||||
|
|
||||||
// Apply the function to a tuple of arguments.
|
|
||||||
template <typename F, typename Tuple>
|
|
||||||
auto Apply(F&& f, Tuple&& args)
|
|
||||||
-> decltype(ApplyImpl(std::forward<F>(f), std::forward<Tuple>(args),
|
|
||||||
make_int_pack<std::tuple_size<Tuple>::value>())) {
|
|
||||||
return ApplyImpl(std::forward<F>(f), std::forward<Tuple>(args),
|
|
||||||
make_int_pack<std::tuple_size<Tuple>::value>());
|
|
||||||
}
|
|
||||||
#endif
|
|
||||||
|
|
||||||
|
|
||||||
#ifdef _MSC_VER
|
|
||||||
# pragma warning(pop)
|
|
||||||
#endif
|
|
||||||
|
|
||||||
} // namespace internal
|
|
||||||
} // namespace testing
|
|
||||||
|
|
||||||
#endif // GMOCK_INCLUDE_GMOCK_INTERNAL_GMOCK_INTERNAL_UTILS_H_
|
|
@ -1,88 +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.
|
|
||||||
|
|
||||||
//
|
|
||||||
// Low-level types and utilities for porting Google Mock to various
|
|
||||||
// platforms. All macros ending with _ and symbols defined in an
|
|
||||||
// internal namespace are subject to change without notice. Code
|
|
||||||
// outside Google Mock MUST NOT USE THEM DIRECTLY. Macros that don't
|
|
||||||
// end with _ are part of Google Mock's public API and can be used by
|
|
||||||
// code outside Google Mock.
|
|
||||||
|
|
||||||
// GOOGLETEST_CM0002 DO NOT DELETE
|
|
||||||
|
|
||||||
#ifndef GMOCK_INCLUDE_GMOCK_INTERNAL_GMOCK_PORT_H_
|
|
||||||
#define GMOCK_INCLUDE_GMOCK_INTERNAL_GMOCK_PORT_H_
|
|
||||||
|
|
||||||
#include <assert.h>
|
|
||||||
#include <stdlib.h>
|
|
||||||
#include <iostream>
|
|
||||||
|
|
||||||
// Most of the utilities needed for porting Google Mock are also
|
|
||||||
// required for Google Test and are defined in gtest-port.h.
|
|
||||||
//
|
|
||||||
// Note to maintainers: to reduce code duplication, prefer adding
|
|
||||||
// portability utilities to Google Test's gtest-port.h instead of
|
|
||||||
// here, as Google Mock depends on Google Test. Only add a utility
|
|
||||||
// here if it's truly specific to Google Mock.
|
|
||||||
|
|
||||||
#include "gtest/internal/gtest-linked_ptr.h"
|
|
||||||
#include "gtest/internal/gtest-port.h"
|
|
||||||
#include "gmock/internal/custom/gmock-port.h"
|
|
||||||
|
|
||||||
// For MS Visual C++, check the compiler version. At least VS 2003 is
|
|
||||||
// required to compile Google Mock.
|
|
||||||
#if defined(_MSC_VER) && _MSC_VER < 1310
|
|
||||||
# error "At least Visual C++ 2003 (7.1) is required to compile Google Mock."
|
|
||||||
#endif
|
|
||||||
|
|
||||||
// Macro for referencing flags. This is public as we want the user to
|
|
||||||
// use this syntax to reference Google Mock flags.
|
|
||||||
#define GMOCK_FLAG(name) FLAGS_gmock_##name
|
|
||||||
|
|
||||||
#if !defined(GMOCK_DECLARE_bool_)
|
|
||||||
|
|
||||||
// Macros for declaring flags.
|
|
||||||
# define GMOCK_DECLARE_bool_(name) extern GTEST_API_ bool GMOCK_FLAG(name)
|
|
||||||
# define GMOCK_DECLARE_int32_(name) \
|
|
||||||
extern GTEST_API_ ::testing::internal::Int32 GMOCK_FLAG(name)
|
|
||||||
# define GMOCK_DECLARE_string_(name) \
|
|
||||||
extern GTEST_API_ ::std::string GMOCK_FLAG(name)
|
|
||||||
|
|
||||||
// Macros for defining flags.
|
|
||||||
# define GMOCK_DEFINE_bool_(name, default_val, doc) \
|
|
||||||
GTEST_API_ bool GMOCK_FLAG(name) = (default_val)
|
|
||||||
# define GMOCK_DEFINE_int32_(name, default_val, doc) \
|
|
||||||
GTEST_API_ ::testing::internal::Int32 GMOCK_FLAG(name) = (default_val)
|
|
||||||
# define GMOCK_DEFINE_string_(name, default_val, doc) \
|
|
||||||
GTEST_API_ ::std::string GMOCK_FLAG(name) = (default_val)
|
|
||||||
|
|
||||||
#endif // !defined(GMOCK_DECLARE_bool_)
|
|
||||||
|
|
||||||
#endif // GMOCK_INCLUDE_GMOCK_INTERNAL_GMOCK_PORT_H_
|
|
@ -1,46 +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.
|
|
||||||
|
|
||||||
//
|
|
||||||
// Google C++ Mocking Framework (Google Mock)
|
|
||||||
//
|
|
||||||
// This file #includes all Google Mock implementation .cc files. The
|
|
||||||
// purpose is to allow a user to build Google Mock by compiling this
|
|
||||||
// file alone.
|
|
||||||
|
|
||||||
// This line ensures that gmock.h can be compiled on its own, even
|
|
||||||
// when it's fused.
|
|
||||||
#include "gmock/gmock.h"
|
|
||||||
|
|
||||||
// The following lines pull in the real gmock *.cc files.
|
|
||||||
#include "src/gmock-cardinalities.cc"
|
|
||||||
#include "src/gmock-internal-utils.cc"
|
|
||||||
#include "src/gmock-matchers.cc"
|
|
||||||
#include "src/gmock-spec-builders.cc"
|
|
||||||
#include "src/gmock.cc"
|
|
@ -1,155 +0,0 @@
|
|||||||
// 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.
|
|
||||||
|
|
||||||
|
|
||||||
// Google Mock - a framework for writing C++ mock classes.
|
|
||||||
//
|
|
||||||
// This file implements cardinalities.
|
|
||||||
|
|
||||||
#include "gmock/gmock-cardinalities.h"
|
|
||||||
|
|
||||||
#include <limits.h>
|
|
||||||
#include <ostream> // NOLINT
|
|
||||||
#include <sstream>
|
|
||||||
#include <string>
|
|
||||||
#include "gmock/internal/gmock-internal-utils.h"
|
|
||||||
#include "gtest/gtest.h"
|
|
||||||
|
|
||||||
namespace testing {
|
|
||||||
|
|
||||||
namespace {
|
|
||||||
|
|
||||||
// Implements the Between(m, n) cardinality.
|
|
||||||
class BetweenCardinalityImpl : public CardinalityInterface {
|
|
||||||
public:
|
|
||||||
BetweenCardinalityImpl(int min, int max)
|
|
||||||
: min_(min >= 0 ? min : 0),
|
|
||||||
max_(max >= min_ ? max : min_) {
|
|
||||||
std::stringstream ss;
|
|
||||||
if (min < 0) {
|
|
||||||
ss << "The invocation lower bound must be >= 0, "
|
|
||||||
<< "but is actually " << min << ".";
|
|
||||||
internal::Expect(false, __FILE__, __LINE__, ss.str());
|
|
||||||
} else if (max < 0) {
|
|
||||||
ss << "The invocation upper bound must be >= 0, "
|
|
||||||
<< "but is actually " << max << ".";
|
|
||||||
internal::Expect(false, __FILE__, __LINE__, ss.str());
|
|
||||||
} else if (min > max) {
|
|
||||||
ss << "The invocation upper bound (" << max
|
|
||||||
<< ") must be >= the invocation lower bound (" << min
|
|
||||||
<< ").";
|
|
||||||
internal::Expect(false, __FILE__, __LINE__, ss.str());
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
// Conservative estimate on the lower/upper bound of the number of
|
|
||||||
// calls allowed.
|
|
||||||
virtual int ConservativeLowerBound() const { return min_; }
|
|
||||||
virtual int ConservativeUpperBound() const { return max_; }
|
|
||||||
|
|
||||||
virtual bool IsSatisfiedByCallCount(int call_count) const {
|
|
||||||
return min_ <= call_count && call_count <= max_;
|
|
||||||
}
|
|
||||||
|
|
||||||
virtual bool IsSaturatedByCallCount(int call_count) const {
|
|
||||||
return call_count >= max_;
|
|
||||||
}
|
|
||||||
|
|
||||||
virtual void DescribeTo(::std::ostream* os) const;
|
|
||||||
|
|
||||||
private:
|
|
||||||
const int min_;
|
|
||||||
const int max_;
|
|
||||||
|
|
||||||
GTEST_DISALLOW_COPY_AND_ASSIGN_(BetweenCardinalityImpl);
|
|
||||||
};
|
|
||||||
|
|
||||||
// Formats "n times" in a human-friendly way.
|
|
||||||
inline std::string FormatTimes(int n) {
|
|
||||||
if (n == 1) {
|
|
||||||
return "once";
|
|
||||||
} else if (n == 2) {
|
|
||||||
return "twice";
|
|
||||||
} else {
|
|
||||||
std::stringstream ss;
|
|
||||||
ss << n << " times";
|
|
||||||
return ss.str();
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
// Describes the Between(m, n) cardinality in human-friendly text.
|
|
||||||
void BetweenCardinalityImpl::DescribeTo(::std::ostream* os) const {
|
|
||||||
if (min_ == 0) {
|
|
||||||
if (max_ == 0) {
|
|
||||||
*os << "never called";
|
|
||||||
} else if (max_ == INT_MAX) {
|
|
||||||
*os << "called any number of times";
|
|
||||||
} else {
|
|
||||||
*os << "called at most " << FormatTimes(max_);
|
|
||||||
}
|
|
||||||
} else if (min_ == max_) {
|
|
||||||
*os << "called " << FormatTimes(min_);
|
|
||||||
} else if (max_ == INT_MAX) {
|
|
||||||
*os << "called at least " << FormatTimes(min_);
|
|
||||||
} else {
|
|
||||||
// 0 < min_ < max_ < INT_MAX
|
|
||||||
*os << "called between " << min_ << " and " << max_ << " times";
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
} // Unnamed namespace
|
|
||||||
|
|
||||||
// Describes the given call count to an ostream.
|
|
||||||
void Cardinality::DescribeActualCallCountTo(int actual_call_count,
|
|
||||||
::std::ostream* os) {
|
|
||||||
if (actual_call_count > 0) {
|
|
||||||
*os << "called " << FormatTimes(actual_call_count);
|
|
||||||
} else {
|
|
||||||
*os << "never called";
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
// Creates a cardinality that allows at least n calls.
|
|
||||||
GTEST_API_ Cardinality AtLeast(int n) { return Between(n, INT_MAX); }
|
|
||||||
|
|
||||||
// Creates a cardinality that allows at most n calls.
|
|
||||||
GTEST_API_ Cardinality AtMost(int n) { return Between(0, n); }
|
|
||||||
|
|
||||||
// Creates a cardinality that allows any number of calls.
|
|
||||||
GTEST_API_ Cardinality AnyNumber() { return AtLeast(0); }
|
|
||||||
|
|
||||||
// Creates a cardinality that allows between min and max calls.
|
|
||||||
GTEST_API_ Cardinality Between(int min, int max) {
|
|
||||||
return Cardinality(new BetweenCardinalityImpl(min, max));
|
|
||||||
}
|
|
||||||
|
|
||||||
// Creates a cardinality that allows exactly n calls.
|
|
||||||
GTEST_API_ Cardinality Exactly(int n) { return Between(n, n); }
|
|
||||||
|
|
||||||
} // namespace testing
|
|
@ -1,203 +0,0 @@
|
|||||||
// 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.
|
|
||||||
|
|
||||||
|
|
||||||
// Google Mock - a framework for writing C++ mock classes.
|
|
||||||
//
|
|
||||||
// This file defines some utilities useful for implementing Google
|
|
||||||
// Mock. They are subject to change without notice, so please DO NOT
|
|
||||||
// USE THEM IN USER CODE.
|
|
||||||
|
|
||||||
#include "gmock/internal/gmock-internal-utils.h"
|
|
||||||
|
|
||||||
#include <ctype.h>
|
|
||||||
#include <ostream> // NOLINT
|
|
||||||
#include <string>
|
|
||||||
#include "gmock/gmock.h"
|
|
||||||
#include "gmock/internal/gmock-port.h"
|
|
||||||
#include "gtest/gtest.h"
|
|
||||||
|
|
||||||
namespace testing {
|
|
||||||
namespace internal {
|
|
||||||
|
|
||||||
// Joins a vector of strings as if they are fields of a tuple; returns
|
|
||||||
// the joined string.
|
|
||||||
GTEST_API_ std::string JoinAsTuple(const Strings& fields) {
|
|
||||||
switch (fields.size()) {
|
|
||||||
case 0:
|
|
||||||
return "";
|
|
||||||
case 1:
|
|
||||||
return fields[0];
|
|
||||||
default:
|
|
||||||
std::string result = "(" + fields[0];
|
|
||||||
for (size_t i = 1; i < fields.size(); i++) {
|
|
||||||
result += ", ";
|
|
||||||
result += fields[i];
|
|
||||||
}
|
|
||||||
result += ")";
|
|
||||||
return result;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
// Converts an identifier name to a space-separated list of lower-case
|
|
||||||
// words. Each maximum substring of the form [A-Za-z][a-z]*|\d+ is
|
|
||||||
// treated as one word. For example, both "FooBar123" and
|
|
||||||
// "foo_bar_123" are converted to "foo bar 123".
|
|
||||||
GTEST_API_ std::string ConvertIdentifierNameToWords(const char* id_name) {
|
|
||||||
std::string result;
|
|
||||||
char prev_char = '\0';
|
|
||||||
for (const char* p = id_name; *p != '\0'; prev_char = *(p++)) {
|
|
||||||
// We don't care about the current locale as the input is
|
|
||||||
// guaranteed to be a valid C++ identifier name.
|
|
||||||
const bool starts_new_word = IsUpper(*p) ||
|
|
||||||
(!IsAlpha(prev_char) && IsLower(*p)) ||
|
|
||||||
(!IsDigit(prev_char) && IsDigit(*p));
|
|
||||||
|
|
||||||
if (IsAlNum(*p)) {
|
|
||||||
if (starts_new_word && result != "")
|
|
||||||
result += ' ';
|
|
||||||
result += ToLower(*p);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
return result;
|
|
||||||
}
|
|
||||||
|
|
||||||
// This class reports Google Mock failures as Google Test failures. A
|
|
||||||
// user can define another class in a similar fashion if they intend to
|
|
||||||
// use Google Mock with a testing framework other than Google Test.
|
|
||||||
class GoogleTestFailureReporter : public FailureReporterInterface {
|
|
||||||
public:
|
|
||||||
virtual void ReportFailure(FailureType type, const char* file, int line,
|
|
||||||
const std::string& message) {
|
|
||||||
AssertHelper(type == kFatal ?
|
|
||||||
TestPartResult::kFatalFailure :
|
|
||||||
TestPartResult::kNonFatalFailure,
|
|
||||||
file,
|
|
||||||
line,
|
|
||||||
message.c_str()) = Message();
|
|
||||||
if (type == kFatal) {
|
|
||||||
posix::Abort();
|
|
||||||
}
|
|
||||||
}
|
|
||||||
};
|
|
||||||
|
|
||||||
// Returns the global failure reporter. Will create a
|
|
||||||
// GoogleTestFailureReporter and return it the first time called.
|
|
||||||
GTEST_API_ FailureReporterInterface* GetFailureReporter() {
|
|
||||||
// Points to the global failure reporter used by Google Mock. gcc
|
|
||||||
// guarantees that the following use of failure_reporter is
|
|
||||||
// thread-safe. We may need to add additional synchronization to
|
|
||||||
// protect failure_reporter if we port Google Mock to other
|
|
||||||
// compilers.
|
|
||||||
static FailureReporterInterface* const failure_reporter =
|
|
||||||
new GoogleTestFailureReporter();
|
|
||||||
return failure_reporter;
|
|
||||||
}
|
|
||||||
|
|
||||||
// Protects global resources (stdout in particular) used by Log().
|
|
||||||
static GTEST_DEFINE_STATIC_MUTEX_(g_log_mutex);
|
|
||||||
|
|
||||||
// Returns true iff a log with the given severity is visible according
|
|
||||||
// to the --gmock_verbose flag.
|
|
||||||
GTEST_API_ bool LogIsVisible(LogSeverity severity) {
|
|
||||||
if (GMOCK_FLAG(verbose) == kInfoVerbosity) {
|
|
||||||
// Always show the log if --gmock_verbose=info.
|
|
||||||
return true;
|
|
||||||
} else if (GMOCK_FLAG(verbose) == kErrorVerbosity) {
|
|
||||||
// Always hide it if --gmock_verbose=error.
|
|
||||||
return false;
|
|
||||||
} else {
|
|
||||||
// If --gmock_verbose is neither "info" nor "error", we treat it
|
|
||||||
// as "warning" (its default value).
|
|
||||||
return severity == kWarning;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
// Prints the given message to stdout iff 'severity' >= the level
|
|
||||||
// specified by the --gmock_verbose flag. If stack_frames_to_skip >=
|
|
||||||
// 0, also prints the stack trace excluding the top
|
|
||||||
// stack_frames_to_skip frames. In opt mode, any positive
|
|
||||||
// stack_frames_to_skip is treated as 0, since we don't know which
|
|
||||||
// function calls will be inlined by the compiler and need to be
|
|
||||||
// conservative.
|
|
||||||
GTEST_API_ void Log(LogSeverity severity, const std::string& message,
|
|
||||||
int stack_frames_to_skip) {
|
|
||||||
if (!LogIsVisible(severity))
|
|
||||||
return;
|
|
||||||
|
|
||||||
// Ensures that logs from different threads don't interleave.
|
|
||||||
MutexLock l(&g_log_mutex);
|
|
||||||
|
|
||||||
// "using ::std::cout;" doesn't work with Symbian's STLport, where cout is a
|
|
||||||
// macro.
|
|
||||||
|
|
||||||
if (severity == kWarning) {
|
|
||||||
// Prints a GMOCK WARNING marker to make the warnings easily searchable.
|
|
||||||
std::cout << "\nGMOCK WARNING:";
|
|
||||||
}
|
|
||||||
// Pre-pends a new-line to message if it doesn't start with one.
|
|
||||||
if (message.empty() || message[0] != '\n') {
|
|
||||||
std::cout << "\n";
|
|
||||||
}
|
|
||||||
std::cout << message;
|
|
||||||
if (stack_frames_to_skip >= 0) {
|
|
||||||
#ifdef NDEBUG
|
|
||||||
// In opt mode, we have to be conservative and skip no stack frame.
|
|
||||||
const int actual_to_skip = 0;
|
|
||||||
#else
|
|
||||||
// In dbg mode, we can do what the caller tell us to do (plus one
|
|
||||||
// for skipping this function's stack frame).
|
|
||||||
const int actual_to_skip = stack_frames_to_skip + 1;
|
|
||||||
#endif // NDEBUG
|
|
||||||
|
|
||||||
// Appends a new-line to message if it doesn't end with one.
|
|
||||||
if (!message.empty() && *message.rbegin() != '\n') {
|
|
||||||
std::cout << "\n";
|
|
||||||
}
|
|
||||||
std::cout << "Stack trace:\n"
|
|
||||||
<< ::testing::internal::GetCurrentOsStackTraceExceptTop(
|
|
||||||
::testing::UnitTest::GetInstance(), actual_to_skip);
|
|
||||||
}
|
|
||||||
std::cout << ::std::flush;
|
|
||||||
}
|
|
||||||
|
|
||||||
GTEST_API_ WithoutMatchers GetWithoutMatchers() { return WithoutMatchers(); }
|
|
||||||
|
|
||||||
GTEST_API_ void IllegalDoDefault(const char* file, int line) {
|
|
||||||
internal::Assert(
|
|
||||||
false, file, line,
|
|
||||||
"You are using DoDefault() inside a composite action like "
|
|
||||||
"DoAll() or WithArgs(). This is not supported for technical "
|
|
||||||
"reasons. Please instead spell out the default action, or "
|
|
||||||
"assign the default action to an Action variable and use "
|
|
||||||
"the variable in various places.");
|
|
||||||
}
|
|
||||||
|
|
||||||
} // namespace internal
|
|
||||||
} // namespace testing
|
|
@ -1,572 +0,0 @@
|
|||||||
// 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.
|
|
||||||
|
|
||||||
|
|
||||||
// Google Mock - a framework for writing C++ mock classes.
|
|
||||||
//
|
|
||||||
// This file implements Matcher<const string&>, Matcher<string>, and
|
|
||||||
// utilities for defining matchers.
|
|
||||||
|
|
||||||
#include "gmock/gmock-matchers.h"
|
|
||||||
#include "gmock/gmock-generated-matchers.h"
|
|
||||||
|
|
||||||
#include <string.h>
|
|
||||||
#include <iostream>
|
|
||||||
#include <sstream>
|
|
||||||
#include <string>
|
|
||||||
|
|
||||||
namespace testing {
|
|
||||||
|
|
||||||
// Constructs a matcher that matches a const std::string& whose value is
|
|
||||||
// equal to s.
|
|
||||||
Matcher<const std::string&>::Matcher(const std::string& s) { *this = Eq(s); }
|
|
||||||
|
|
||||||
#if GTEST_HAS_GLOBAL_STRING
|
|
||||||
// Constructs a matcher that matches a const std::string& whose value is
|
|
||||||
// equal to s.
|
|
||||||
Matcher<const std::string&>::Matcher(const ::string& s) {
|
|
||||||
*this = Eq(static_cast<std::string>(s));
|
|
||||||
}
|
|
||||||
#endif // GTEST_HAS_GLOBAL_STRING
|
|
||||||
|
|
||||||
// Constructs a matcher that matches a const std::string& whose value is
|
|
||||||
// equal to s.
|
|
||||||
Matcher<const std::string&>::Matcher(const char* s) {
|
|
||||||
*this = Eq(std::string(s));
|
|
||||||
}
|
|
||||||
|
|
||||||
// Constructs a matcher that matches a std::string whose value is equal to
|
|
||||||
// s.
|
|
||||||
Matcher<std::string>::Matcher(const std::string& s) { *this = Eq(s); }
|
|
||||||
|
|
||||||
#if GTEST_HAS_GLOBAL_STRING
|
|
||||||
// Constructs a matcher that matches a std::string whose value is equal to
|
|
||||||
// s.
|
|
||||||
Matcher<std::string>::Matcher(const ::string& s) {
|
|
||||||
*this = Eq(static_cast<std::string>(s));
|
|
||||||
}
|
|
||||||
#endif // GTEST_HAS_GLOBAL_STRING
|
|
||||||
|
|
||||||
// Constructs a matcher that matches a std::string whose value is equal to
|
|
||||||
// s.
|
|
||||||
Matcher<std::string>::Matcher(const char* s) { *this = Eq(std::string(s)); }
|
|
||||||
|
|
||||||
#if GTEST_HAS_GLOBAL_STRING
|
|
||||||
// Constructs a matcher that matches a const ::string& whose value is
|
|
||||||
// equal to s.
|
|
||||||
Matcher<const ::string&>::Matcher(const std::string& s) {
|
|
||||||
*this = Eq(static_cast<::string>(s));
|
|
||||||
}
|
|
||||||
|
|
||||||
// Constructs a matcher that matches a const ::string& whose value is
|
|
||||||
// equal to s.
|
|
||||||
Matcher<const ::string&>::Matcher(const ::string& s) { *this = Eq(s); }
|
|
||||||
|
|
||||||
// Constructs a matcher that matches a const ::string& whose value is
|
|
||||||
// equal to s.
|
|
||||||
Matcher<const ::string&>::Matcher(const char* s) { *this = Eq(::string(s)); }
|
|
||||||
|
|
||||||
// Constructs a matcher that matches a ::string whose value is equal to s.
|
|
||||||
Matcher<::string>::Matcher(const std::string& s) {
|
|
||||||
*this = Eq(static_cast<::string>(s));
|
|
||||||
}
|
|
||||||
|
|
||||||
// Constructs a matcher that matches a ::string whose value is equal to s.
|
|
||||||
Matcher<::string>::Matcher(const ::string& s) { *this = Eq(s); }
|
|
||||||
|
|
||||||
// Constructs a matcher that matches a string whose value is equal to s.
|
|
||||||
Matcher<::string>::Matcher(const char* s) { *this = Eq(::string(s)); }
|
|
||||||
#endif // GTEST_HAS_GLOBAL_STRING
|
|
||||||
|
|
||||||
#if GTEST_HAS_ABSL
|
|
||||||
// Constructs a matcher that matches a const absl::string_view& whose value is
|
|
||||||
// equal to s.
|
|
||||||
Matcher<const absl::string_view&>::Matcher(const std::string& s) {
|
|
||||||
*this = Eq(s);
|
|
||||||
}
|
|
||||||
|
|
||||||
#if GTEST_HAS_GLOBAL_STRING
|
|
||||||
// Constructs a matcher that matches a const absl::string_view& whose value is
|
|
||||||
// equal to s.
|
|
||||||
Matcher<const absl::string_view&>::Matcher(const ::string& s) { *this = Eq(s); }
|
|
||||||
#endif // GTEST_HAS_GLOBAL_STRING
|
|
||||||
|
|
||||||
// Constructs a matcher that matches a const absl::string_view& whose value is
|
|
||||||
// equal to s.
|
|
||||||
Matcher<const absl::string_view&>::Matcher(const char* s) {
|
|
||||||
*this = Eq(std::string(s));
|
|
||||||
}
|
|
||||||
|
|
||||||
// Constructs a matcher that matches a const absl::string_view& whose value is
|
|
||||||
// equal to s.
|
|
||||||
Matcher<const absl::string_view&>::Matcher(absl::string_view s) {
|
|
||||||
*this = Eq(std::string(s));
|
|
||||||
}
|
|
||||||
|
|
||||||
// Constructs a matcher that matches a absl::string_view whose value is equal to
|
|
||||||
// s.
|
|
||||||
Matcher<absl::string_view>::Matcher(const std::string& s) { *this = Eq(s); }
|
|
||||||
|
|
||||||
#if GTEST_HAS_GLOBAL_STRING
|
|
||||||
// Constructs a matcher that matches a absl::string_view whose value is equal to
|
|
||||||
// s.
|
|
||||||
Matcher<absl::string_view>::Matcher(const ::string& s) { *this = Eq(s); }
|
|
||||||
#endif // GTEST_HAS_GLOBAL_STRING
|
|
||||||
|
|
||||||
// Constructs a matcher that matches a absl::string_view whose value is equal to
|
|
||||||
// s.
|
|
||||||
Matcher<absl::string_view>::Matcher(const char* s) {
|
|
||||||
*this = Eq(std::string(s));
|
|
||||||
}
|
|
||||||
|
|
||||||
// Constructs a matcher that matches a absl::string_view whose value is equal to
|
|
||||||
// s.
|
|
||||||
Matcher<absl::string_view>::Matcher(absl::string_view s) {
|
|
||||||
*this = Eq(std::string(s));
|
|
||||||
}
|
|
||||||
#endif // GTEST_HAS_ABSL
|
|
||||||
|
|
||||||
namespace internal {
|
|
||||||
|
|
||||||
// Returns the description for a matcher defined using the MATCHER*()
|
|
||||||
// macro where the user-supplied description string is "", if
|
|
||||||
// 'negation' is false; otherwise returns the description of the
|
|
||||||
// negation of the matcher. 'param_values' contains a list of strings
|
|
||||||
// that are the print-out of the matcher's parameters.
|
|
||||||
GTEST_API_ std::string FormatMatcherDescription(bool negation,
|
|
||||||
const char* matcher_name,
|
|
||||||
const Strings& param_values) {
|
|
||||||
std::string result = ConvertIdentifierNameToWords(matcher_name);
|
|
||||||
if (param_values.size() >= 1) result += " " + JoinAsTuple(param_values);
|
|
||||||
return negation ? "not (" + result + ")" : result;
|
|
||||||
}
|
|
||||||
|
|
||||||
// FindMaxBipartiteMatching and its helper class.
|
|
||||||
//
|
|
||||||
// Uses the well-known Ford-Fulkerson max flow method to find a maximum
|
|
||||||
// bipartite matching. Flow is considered to be from left to right.
|
|
||||||
// There is an implicit source node that is connected to all of the left
|
|
||||||
// nodes, and an implicit sink node that is connected to all of the
|
|
||||||
// right nodes. All edges have unit capacity.
|
|
||||||
//
|
|
||||||
// Neither the flow graph nor the residual flow graph are represented
|
|
||||||
// explicitly. Instead, they are implied by the information in 'graph' and
|
|
||||||
// a vector<int> called 'left_' whose elements are initialized to the
|
|
||||||
// value kUnused. This represents the initial state of the algorithm,
|
|
||||||
// where the flow graph is empty, and the residual flow graph has the
|
|
||||||
// following edges:
|
|
||||||
// - An edge from source to each left_ node
|
|
||||||
// - An edge from each right_ node to sink
|
|
||||||
// - An edge from each left_ node to each right_ node, if the
|
|
||||||
// corresponding edge exists in 'graph'.
|
|
||||||
//
|
|
||||||
// When the TryAugment() method adds a flow, it sets left_[l] = r for some
|
|
||||||
// nodes l and r. This induces the following changes:
|
|
||||||
// - The edges (source, l), (l, r), and (r, sink) are added to the
|
|
||||||
// flow graph.
|
|
||||||
// - The same three edges are removed from the residual flow graph.
|
|
||||||
// - The reverse edges (l, source), (r, l), and (sink, r) are added
|
|
||||||
// to the residual flow graph, which is a directional graph
|
|
||||||
// representing unused flow capacity.
|
|
||||||
//
|
|
||||||
// When the method augments a flow (moving left_[l] from some r1 to some
|
|
||||||
// other r2), this can be thought of as "undoing" the above steps with
|
|
||||||
// respect to r1 and "redoing" them with respect to r2.
|
|
||||||
//
|
|
||||||
// It bears repeating that the flow graph and residual flow graph are
|
|
||||||
// never represented explicitly, but can be derived by looking at the
|
|
||||||
// information in 'graph' and in left_.
|
|
||||||
//
|
|
||||||
// As an optimization, there is a second vector<int> called right_ which
|
|
||||||
// does not provide any new information. Instead, it enables more
|
|
||||||
// efficient queries about edges entering or leaving the right-side nodes
|
|
||||||
// of the flow or residual flow graphs. The following invariants are
|
|
||||||
// maintained:
|
|
||||||
//
|
|
||||||
// left[l] == kUnused or right[left[l]] == l
|
|
||||||
// right[r] == kUnused or left[right[r]] == r
|
|
||||||
//
|
|
||||||
// . [ source ] .
|
|
||||||
// . ||| .
|
|
||||||
// . ||| .
|
|
||||||
// . ||\--> left[0]=1 ---\ right[0]=-1 ----\ .
|
|
||||||
// . || | | .
|
|
||||||
// . |\---> left[1]=-1 \--> right[1]=0 ---\| .
|
|
||||||
// . | || .
|
|
||||||
// . \----> left[2]=2 ------> right[2]=2 --\|| .
|
|
||||||
// . ||| .
|
|
||||||
// . elements matchers vvv .
|
|
||||||
// . [ sink ] .
|
|
||||||
//
|
|
||||||
// See Also:
|
|
||||||
// [1] Cormen, et al (2001). "Section 26.2: The Ford-Fulkerson method".
|
|
||||||
// "Introduction to Algorithms (Second ed.)", pp. 651-664.
|
|
||||||
// [2] "Ford-Fulkerson algorithm", Wikipedia,
|
|
||||||
// 'http://en.wikipedia.org/wiki/Ford%E2%80%93Fulkerson_algorithm'
|
|
||||||
class MaxBipartiteMatchState {
|
|
||||||
public:
|
|
||||||
explicit MaxBipartiteMatchState(const MatchMatrix& graph)
|
|
||||||
: graph_(&graph),
|
|
||||||
left_(graph_->LhsSize(), kUnused),
|
|
||||||
right_(graph_->RhsSize(), kUnused) {}
|
|
||||||
|
|
||||||
// Returns the edges of a maximal match, each in the form {left, right}.
|
|
||||||
ElementMatcherPairs Compute() {
|
|
||||||
// 'seen' is used for path finding { 0: unseen, 1: seen }.
|
|
||||||
::std::vector<char> seen;
|
|
||||||
// Searches the residual flow graph for a path from each left node to
|
|
||||||
// the sink in the residual flow graph, and if one is found, add flow
|
|
||||||
// to the graph. It's okay to search through the left nodes once. The
|
|
||||||
// edge from the implicit source node to each previously-visited left
|
|
||||||
// node will have flow if that left node has any path to the sink
|
|
||||||
// whatsoever. Subsequent augmentations can only add flow to the
|
|
||||||
// network, and cannot take away that previous flow unit from the source.
|
|
||||||
// Since the source-to-left edge can only carry one flow unit (or,
|
|
||||||
// each element can be matched to only one matcher), there is no need
|
|
||||||
// to visit the left nodes more than once looking for augmented paths.
|
|
||||||
// The flow is known to be possible or impossible by looking at the
|
|
||||||
// node once.
|
|
||||||
for (size_t ilhs = 0; ilhs < graph_->LhsSize(); ++ilhs) {
|
|
||||||
// Reset the path-marking vector and try to find a path from
|
|
||||||
// source to sink starting at the left_[ilhs] node.
|
|
||||||
GTEST_CHECK_(left_[ilhs] == kUnused)
|
|
||||||
<< "ilhs: " << ilhs << ", left_[ilhs]: " << left_[ilhs];
|
|
||||||
// 'seen' initialized to 'graph_->RhsSize()' copies of 0.
|
|
||||||
seen.assign(graph_->RhsSize(), 0);
|
|
||||||
TryAugment(ilhs, &seen);
|
|
||||||
}
|
|
||||||
ElementMatcherPairs result;
|
|
||||||
for (size_t ilhs = 0; ilhs < left_.size(); ++ilhs) {
|
|
||||||
size_t irhs = left_[ilhs];
|
|
||||||
if (irhs == kUnused) continue;
|
|
||||||
result.push_back(ElementMatcherPair(ilhs, irhs));
|
|
||||||
}
|
|
||||||
return result;
|
|
||||||
}
|
|
||||||
|
|
||||||
private:
|
|
||||||
static const size_t kUnused = static_cast<size_t>(-1);
|
|
||||||
|
|
||||||
// Perform a depth-first search from left node ilhs to the sink. If a
|
|
||||||
// path is found, flow is added to the network by linking the left and
|
|
||||||
// right vector elements corresponding each segment of the path.
|
|
||||||
// Returns true if a path to sink was found, which means that a unit of
|
|
||||||
// flow was added to the network. The 'seen' vector elements correspond
|
|
||||||
// to right nodes and are marked to eliminate cycles from the search.
|
|
||||||
//
|
|
||||||
// Left nodes will only be explored at most once because they
|
|
||||||
// are accessible from at most one right node in the residual flow
|
|
||||||
// graph.
|
|
||||||
//
|
|
||||||
// Note that left_[ilhs] is the only element of left_ that TryAugment will
|
|
||||||
// potentially transition from kUnused to another value. Any other
|
|
||||||
// left_ element holding kUnused before TryAugment will be holding it
|
|
||||||
// when TryAugment returns.
|
|
||||||
//
|
|
||||||
bool TryAugment(size_t ilhs, ::std::vector<char>* seen) {
|
|
||||||
for (size_t irhs = 0; irhs < graph_->RhsSize(); ++irhs) {
|
|
||||||
if ((*seen)[irhs]) continue;
|
|
||||||
if (!graph_->HasEdge(ilhs, irhs)) continue;
|
|
||||||
// There's an available edge from ilhs to irhs.
|
|
||||||
(*seen)[irhs] = 1;
|
|
||||||
// Next a search is performed to determine whether
|
|
||||||
// this edge is a dead end or leads to the sink.
|
|
||||||
//
|
|
||||||
// right_[irhs] == kUnused means that there is residual flow from
|
|
||||||
// right node irhs to the sink, so we can use that to finish this
|
|
||||||
// flow path and return success.
|
|
||||||
//
|
|
||||||
// Otherwise there is residual flow to some ilhs. We push flow
|
|
||||||
// along that path and call ourselves recursively to see if this
|
|
||||||
// ultimately leads to sink.
|
|
||||||
if (right_[irhs] == kUnused || TryAugment(right_[irhs], seen)) {
|
|
||||||
// Add flow from left_[ilhs] to right_[irhs].
|
|
||||||
left_[ilhs] = irhs;
|
|
||||||
right_[irhs] = ilhs;
|
|
||||||
return true;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
return false;
|
|
||||||
}
|
|
||||||
|
|
||||||
const MatchMatrix* graph_; // not owned
|
|
||||||
// Each element of the left_ vector represents a left hand side node
|
|
||||||
// (i.e. an element) and each element of right_ is a right hand side
|
|
||||||
// node (i.e. a matcher). The values in the left_ vector indicate
|
|
||||||
// outflow from that node to a node on the right_ side. The values
|
|
||||||
// in the right_ indicate inflow, and specify which left_ node is
|
|
||||||
// feeding that right_ node, if any. For example, left_[3] == 1 means
|
|
||||||
// there's a flow from element #3 to matcher #1. Such a flow would also
|
|
||||||
// be redundantly represented in the right_ vector as right_[1] == 3.
|
|
||||||
// Elements of left_ and right_ are either kUnused or mutually
|
|
||||||
// referent. Mutually referent means that left_[right_[i]] = i and
|
|
||||||
// right_[left_[i]] = i.
|
|
||||||
::std::vector<size_t> left_;
|
|
||||||
::std::vector<size_t> right_;
|
|
||||||
|
|
||||||
GTEST_DISALLOW_ASSIGN_(MaxBipartiteMatchState);
|
|
||||||
};
|
|
||||||
|
|
||||||
const size_t MaxBipartiteMatchState::kUnused;
|
|
||||||
|
|
||||||
GTEST_API_ ElementMatcherPairs FindMaxBipartiteMatching(const MatchMatrix& g) {
|
|
||||||
return MaxBipartiteMatchState(g).Compute();
|
|
||||||
}
|
|
||||||
|
|
||||||
static void LogElementMatcherPairVec(const ElementMatcherPairs& pairs,
|
|
||||||
::std::ostream* stream) {
|
|
||||||
typedef ElementMatcherPairs::const_iterator Iter;
|
|
||||||
::std::ostream& os = *stream;
|
|
||||||
os << "{";
|
|
||||||
const char* sep = "";
|
|
||||||
for (Iter it = pairs.begin(); it != pairs.end(); ++it) {
|
|
||||||
os << sep << "\n ("
|
|
||||||
<< "element #" << it->first << ", "
|
|
||||||
<< "matcher #" << it->second << ")";
|
|
||||||
sep = ",";
|
|
||||||
}
|
|
||||||
os << "\n}";
|
|
||||||
}
|
|
||||||
|
|
||||||
bool MatchMatrix::NextGraph() {
|
|
||||||
for (size_t ilhs = 0; ilhs < LhsSize(); ++ilhs) {
|
|
||||||
for (size_t irhs = 0; irhs < RhsSize(); ++irhs) {
|
|
||||||
char& b = matched_[SpaceIndex(ilhs, irhs)];
|
|
||||||
if (!b) {
|
|
||||||
b = 1;
|
|
||||||
return true;
|
|
||||||
}
|
|
||||||
b = 0;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
return false;
|
|
||||||
}
|
|
||||||
|
|
||||||
void MatchMatrix::Randomize() {
|
|
||||||
for (size_t ilhs = 0; ilhs < LhsSize(); ++ilhs) {
|
|
||||||
for (size_t irhs = 0; irhs < RhsSize(); ++irhs) {
|
|
||||||
char& b = matched_[SpaceIndex(ilhs, irhs)];
|
|
||||||
b = static_cast<char>(rand() & 1); // NOLINT
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
std::string MatchMatrix::DebugString() const {
|
|
||||||
::std::stringstream ss;
|
|
||||||
const char* sep = "";
|
|
||||||
for (size_t i = 0; i < LhsSize(); ++i) {
|
|
||||||
ss << sep;
|
|
||||||
for (size_t j = 0; j < RhsSize(); ++j) {
|
|
||||||
ss << HasEdge(i, j);
|
|
||||||
}
|
|
||||||
sep = ";";
|
|
||||||
}
|
|
||||||
return ss.str();
|
|
||||||
}
|
|
||||||
|
|
||||||
void UnorderedElementsAreMatcherImplBase::DescribeToImpl(
|
|
||||||
::std::ostream* os) const {
|
|
||||||
switch (match_flags()) {
|
|
||||||
case UnorderedMatcherRequire::ExactMatch:
|
|
||||||
if (matcher_describers_.empty()) {
|
|
||||||
*os << "is empty";
|
|
||||||
return;
|
|
||||||
}
|
|
||||||
if (matcher_describers_.size() == 1) {
|
|
||||||
*os << "has " << Elements(1) << " and that element ";
|
|
||||||
matcher_describers_[0]->DescribeTo(os);
|
|
||||||
return;
|
|
||||||
}
|
|
||||||
*os << "has " << Elements(matcher_describers_.size())
|
|
||||||
<< " and there exists some permutation of elements such that:\n";
|
|
||||||
break;
|
|
||||||
case UnorderedMatcherRequire::Superset:
|
|
||||||
*os << "a surjection from elements to requirements exists such that:\n";
|
|
||||||
break;
|
|
||||||
case UnorderedMatcherRequire::Subset:
|
|
||||||
*os << "an injection from elements to requirements exists such that:\n";
|
|
||||||
break;
|
|
||||||
}
|
|
||||||
|
|
||||||
const char* sep = "";
|
|
||||||
for (size_t i = 0; i != matcher_describers_.size(); ++i) {
|
|
||||||
*os << sep;
|
|
||||||
if (match_flags() == UnorderedMatcherRequire::ExactMatch) {
|
|
||||||
*os << " - element #" << i << " ";
|
|
||||||
} else {
|
|
||||||
*os << " - an element ";
|
|
||||||
}
|
|
||||||
matcher_describers_[i]->DescribeTo(os);
|
|
||||||
if (match_flags() == UnorderedMatcherRequire::ExactMatch) {
|
|
||||||
sep = ", and\n";
|
|
||||||
} else {
|
|
||||||
sep = "\n";
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
void UnorderedElementsAreMatcherImplBase::DescribeNegationToImpl(
|
|
||||||
::std::ostream* os) const {
|
|
||||||
switch (match_flags()) {
|
|
||||||
case UnorderedMatcherRequire::ExactMatch:
|
|
||||||
if (matcher_describers_.empty()) {
|
|
||||||
*os << "isn't empty";
|
|
||||||
return;
|
|
||||||
}
|
|
||||||
if (matcher_describers_.size() == 1) {
|
|
||||||
*os << "doesn't have " << Elements(1) << ", or has " << Elements(1)
|
|
||||||
<< " that ";
|
|
||||||
matcher_describers_[0]->DescribeNegationTo(os);
|
|
||||||
return;
|
|
||||||
}
|
|
||||||
*os << "doesn't have " << Elements(matcher_describers_.size())
|
|
||||||
<< ", or there exists no permutation of elements such that:\n";
|
|
||||||
break;
|
|
||||||
case UnorderedMatcherRequire::Superset:
|
|
||||||
*os << "no surjection from elements to requirements exists such that:\n";
|
|
||||||
break;
|
|
||||||
case UnorderedMatcherRequire::Subset:
|
|
||||||
*os << "no injection from elements to requirements exists such that:\n";
|
|
||||||
break;
|
|
||||||
}
|
|
||||||
const char* sep = "";
|
|
||||||
for (size_t i = 0; i != matcher_describers_.size(); ++i) {
|
|
||||||
*os << sep;
|
|
||||||
if (match_flags() == UnorderedMatcherRequire::ExactMatch) {
|
|
||||||
*os << " - element #" << i << " ";
|
|
||||||
} else {
|
|
||||||
*os << " - an element ";
|
|
||||||
}
|
|
||||||
matcher_describers_[i]->DescribeTo(os);
|
|
||||||
if (match_flags() == UnorderedMatcherRequire::ExactMatch) {
|
|
||||||
sep = ", and\n";
|
|
||||||
} else {
|
|
||||||
sep = "\n";
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
// Checks that all matchers match at least one element, and that all
|
|
||||||
// elements match at least one matcher. This enables faster matching
|
|
||||||
// and better error reporting.
|
|
||||||
// Returns false, writing an explanation to 'listener', if and only
|
|
||||||
// if the success criteria are not met.
|
|
||||||
bool UnorderedElementsAreMatcherImplBase::VerifyMatchMatrix(
|
|
||||||
const ::std::vector<std::string>& element_printouts,
|
|
||||||
const MatchMatrix& matrix, MatchResultListener* listener) const {
|
|
||||||
bool result = true;
|
|
||||||
::std::vector<char> element_matched(matrix.LhsSize(), 0);
|
|
||||||
::std::vector<char> matcher_matched(matrix.RhsSize(), 0);
|
|
||||||
|
|
||||||
for (size_t ilhs = 0; ilhs < matrix.LhsSize(); ilhs++) {
|
|
||||||
for (size_t irhs = 0; irhs < matrix.RhsSize(); irhs++) {
|
|
||||||
char matched = matrix.HasEdge(ilhs, irhs);
|
|
||||||
element_matched[ilhs] |= matched;
|
|
||||||
matcher_matched[irhs] |= matched;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
if (match_flags() & UnorderedMatcherRequire::Superset) {
|
|
||||||
const char* sep =
|
|
||||||
"where the following matchers don't match any elements:\n";
|
|
||||||
for (size_t mi = 0; mi < matcher_matched.size(); ++mi) {
|
|
||||||
if (matcher_matched[mi]) continue;
|
|
||||||
result = false;
|
|
||||||
if (listener->IsInterested()) {
|
|
||||||
*listener << sep << "matcher #" << mi << ": ";
|
|
||||||
matcher_describers_[mi]->DescribeTo(listener->stream());
|
|
||||||
sep = ",\n";
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
if (match_flags() & UnorderedMatcherRequire::Subset) {
|
|
||||||
const char* sep =
|
|
||||||
"where the following elements don't match any matchers:\n";
|
|
||||||
const char* outer_sep = "";
|
|
||||||
if (!result) {
|
|
||||||
outer_sep = "\nand ";
|
|
||||||
}
|
|
||||||
for (size_t ei = 0; ei < element_matched.size(); ++ei) {
|
|
||||||
if (element_matched[ei]) continue;
|
|
||||||
result = false;
|
|
||||||
if (listener->IsInterested()) {
|
|
||||||
*listener << outer_sep << sep << "element #" << ei << ": "
|
|
||||||
<< element_printouts[ei];
|
|
||||||
sep = ",\n";
|
|
||||||
outer_sep = "";
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
return result;
|
|
||||||
}
|
|
||||||
|
|
||||||
bool UnorderedElementsAreMatcherImplBase::FindPairing(
|
|
||||||
const MatchMatrix& matrix, MatchResultListener* listener) const {
|
|
||||||
ElementMatcherPairs matches = FindMaxBipartiteMatching(matrix);
|
|
||||||
|
|
||||||
size_t max_flow = matches.size();
|
|
||||||
if ((match_flags() & UnorderedMatcherRequire::Superset) &&
|
|
||||||
max_flow < matrix.RhsSize()) {
|
|
||||||
if (listener->IsInterested()) {
|
|
||||||
*listener << "where no permutation of the elements can satisfy all "
|
|
||||||
"matchers, and the closest match is "
|
|
||||||
<< max_flow << " of " << matrix.RhsSize()
|
|
||||||
<< " matchers with the pairings:\n";
|
|
||||||
LogElementMatcherPairVec(matches, listener->stream());
|
|
||||||
}
|
|
||||||
return false;
|
|
||||||
}
|
|
||||||
if ((match_flags() & UnorderedMatcherRequire::Subset) &&
|
|
||||||
max_flow < matrix.LhsSize()) {
|
|
||||||
if (listener->IsInterested()) {
|
|
||||||
*listener
|
|
||||||
<< "where not all elements can be matched, and the closest match is "
|
|
||||||
<< max_flow << " of " << matrix.RhsSize()
|
|
||||||
<< " matchers with the pairings:\n";
|
|
||||||
LogElementMatcherPairVec(matches, listener->stream());
|
|
||||||
}
|
|
||||||
return false;
|
|
||||||
}
|
|
||||||
|
|
||||||
if (matches.size() > 1) {
|
|
||||||
if (listener->IsInterested()) {
|
|
||||||
const char* sep = "where:\n";
|
|
||||||
for (size_t mi = 0; mi < matches.size(); ++mi) {
|
|
||||||
*listener << sep << " - element #" << matches[mi].first
|
|
||||||
<< " is matched by matcher #" << matches[mi].second;
|
|
||||||
sep = ",\n";
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
return true;
|
|
||||||
}
|
|
||||||
|
|
||||||
} // namespace internal
|
|
||||||
} // namespace testing
|
|
@ -1,882 +0,0 @@
|
|||||||
// 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.
|
|
||||||
|
|
||||||
|
|
||||||
// Google Mock - a framework for writing C++ mock classes.
|
|
||||||
//
|
|
||||||
// This file implements the spec builder syntax (ON_CALL and
|
|
||||||
// EXPECT_CALL).
|
|
||||||
|
|
||||||
#include "gmock/gmock-spec-builders.h"
|
|
||||||
|
|
||||||
#include <stdlib.h>
|
|
||||||
#include <iostream> // NOLINT
|
|
||||||
#include <map>
|
|
||||||
#include <set>
|
|
||||||
#include <string>
|
|
||||||
#include <vector>
|
|
||||||
#include "gmock/gmock.h"
|
|
||||||
#include "gtest/gtest.h"
|
|
||||||
|
|
||||||
#if GTEST_OS_CYGWIN || GTEST_OS_LINUX || GTEST_OS_MAC
|
|
||||||
# include <unistd.h> // NOLINT
|
|
||||||
#endif
|
|
||||||
|
|
||||||
// Silence C4800 (C4800: 'int *const ': forcing value
|
|
||||||
// to bool 'true' or 'false') for MSVC 14,15
|
|
||||||
#ifdef _MSC_VER
|
|
||||||
#if _MSC_VER <= 1900
|
|
||||||
# pragma warning(push)
|
|
||||||
# pragma warning(disable:4800)
|
|
||||||
#endif
|
|
||||||
#endif
|
|
||||||
|
|
||||||
namespace testing {
|
|
||||||
namespace internal {
|
|
||||||
|
|
||||||
// Protects the mock object registry (in class Mock), all function
|
|
||||||
// mockers, and all expectations.
|
|
||||||
GTEST_API_ GTEST_DEFINE_STATIC_MUTEX_(g_gmock_mutex);
|
|
||||||
|
|
||||||
// Logs a message including file and line number information.
|
|
||||||
GTEST_API_ void LogWithLocation(testing::internal::LogSeverity severity,
|
|
||||||
const char* file, int line,
|
|
||||||
const std::string& message) {
|
|
||||||
::std::ostringstream s;
|
|
||||||
s << file << ":" << line << ": " << message << ::std::endl;
|
|
||||||
Log(severity, s.str(), 0);
|
|
||||||
}
|
|
||||||
|
|
||||||
// Constructs an ExpectationBase object.
|
|
||||||
ExpectationBase::ExpectationBase(const char* a_file, int a_line,
|
|
||||||
const std::string& a_source_text)
|
|
||||||
: file_(a_file),
|
|
||||||
line_(a_line),
|
|
||||||
source_text_(a_source_text),
|
|
||||||
cardinality_specified_(false),
|
|
||||||
cardinality_(Exactly(1)),
|
|
||||||
call_count_(0),
|
|
||||||
retired_(false),
|
|
||||||
extra_matcher_specified_(false),
|
|
||||||
repeated_action_specified_(false),
|
|
||||||
retires_on_saturation_(false),
|
|
||||||
last_clause_(kNone),
|
|
||||||
action_count_checked_(false) {}
|
|
||||||
|
|
||||||
// Destructs an ExpectationBase object.
|
|
||||||
ExpectationBase::~ExpectationBase() {}
|
|
||||||
|
|
||||||
// Explicitly specifies the cardinality of this expectation. Used by
|
|
||||||
// the subclasses to implement the .Times() clause.
|
|
||||||
void ExpectationBase::SpecifyCardinality(const Cardinality& a_cardinality) {
|
|
||||||
cardinality_specified_ = true;
|
|
||||||
cardinality_ = a_cardinality;
|
|
||||||
}
|
|
||||||
|
|
||||||
// Retires all pre-requisites of this expectation.
|
|
||||||
void ExpectationBase::RetireAllPreRequisites()
|
|
||||||
GTEST_EXCLUSIVE_LOCK_REQUIRED_(g_gmock_mutex) {
|
|
||||||
if (is_retired()) {
|
|
||||||
// We can take this short-cut as we never retire an expectation
|
|
||||||
// until we have retired all its pre-requisites.
|
|
||||||
return;
|
|
||||||
}
|
|
||||||
|
|
||||||
::std::vector<ExpectationBase*> expectations(1, this);
|
|
||||||
while (!expectations.empty()) {
|
|
||||||
ExpectationBase* exp = expectations.back();
|
|
||||||
expectations.pop_back();
|
|
||||||
|
|
||||||
for (ExpectationSet::const_iterator it =
|
|
||||||
exp->immediate_prerequisites_.begin();
|
|
||||||
it != exp->immediate_prerequisites_.end(); ++it) {
|
|
||||||
ExpectationBase* next = it->expectation_base().get();
|
|
||||||
if (!next->is_retired()) {
|
|
||||||
next->Retire();
|
|
||||||
expectations.push_back(next);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
// Returns true iff all pre-requisites of this expectation have been
|
|
||||||
// satisfied.
|
|
||||||
bool ExpectationBase::AllPrerequisitesAreSatisfied() const
|
|
||||||
GTEST_EXCLUSIVE_LOCK_REQUIRED_(g_gmock_mutex) {
|
|
||||||
g_gmock_mutex.AssertHeld();
|
|
||||||
::std::vector<const ExpectationBase*> expectations(1, this);
|
|
||||||
while (!expectations.empty()) {
|
|
||||||
const ExpectationBase* exp = expectations.back();
|
|
||||||
expectations.pop_back();
|
|
||||||
|
|
||||||
for (ExpectationSet::const_iterator it =
|
|
||||||
exp->immediate_prerequisites_.begin();
|
|
||||||
it != exp->immediate_prerequisites_.end(); ++it) {
|
|
||||||
const ExpectationBase* next = it->expectation_base().get();
|
|
||||||
if (!next->IsSatisfied()) return false;
|
|
||||||
expectations.push_back(next);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
return true;
|
|
||||||
}
|
|
||||||
|
|
||||||
// Adds unsatisfied pre-requisites of this expectation to 'result'.
|
|
||||||
void ExpectationBase::FindUnsatisfiedPrerequisites(ExpectationSet* result) const
|
|
||||||
GTEST_EXCLUSIVE_LOCK_REQUIRED_(g_gmock_mutex) {
|
|
||||||
g_gmock_mutex.AssertHeld();
|
|
||||||
::std::vector<const ExpectationBase*> expectations(1, this);
|
|
||||||
while (!expectations.empty()) {
|
|
||||||
const ExpectationBase* exp = expectations.back();
|
|
||||||
expectations.pop_back();
|
|
||||||
|
|
||||||
for (ExpectationSet::const_iterator it =
|
|
||||||
exp->immediate_prerequisites_.begin();
|
|
||||||
it != exp->immediate_prerequisites_.end(); ++it) {
|
|
||||||
const ExpectationBase* next = it->expectation_base().get();
|
|
||||||
|
|
||||||
if (next->IsSatisfied()) {
|
|
||||||
// If *it is satisfied and has a call count of 0, some of its
|
|
||||||
// pre-requisites may not be satisfied yet.
|
|
||||||
if (next->call_count_ == 0) {
|
|
||||||
expectations.push_back(next);
|
|
||||||
}
|
|
||||||
} else {
|
|
||||||
// Now that we know next is unsatisfied, we are not so interested
|
|
||||||
// in whether its pre-requisites are satisfied. Therefore we
|
|
||||||
// don't iterate into it here.
|
|
||||||
*result += *it;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
// Describes how many times a function call matching this
|
|
||||||
// expectation has occurred.
|
|
||||||
void ExpectationBase::DescribeCallCountTo(::std::ostream* os) const
|
|
||||||
GTEST_EXCLUSIVE_LOCK_REQUIRED_(g_gmock_mutex) {
|
|
||||||
g_gmock_mutex.AssertHeld();
|
|
||||||
|
|
||||||
// Describes how many times the function is expected to be called.
|
|
||||||
*os << " Expected: to be ";
|
|
||||||
cardinality().DescribeTo(os);
|
|
||||||
*os << "\n Actual: ";
|
|
||||||
Cardinality::DescribeActualCallCountTo(call_count(), os);
|
|
||||||
|
|
||||||
// Describes the state of the expectation (e.g. is it satisfied?
|
|
||||||
// is it active?).
|
|
||||||
*os << " - " << (IsOverSaturated() ? "over-saturated" :
|
|
||||||
IsSaturated() ? "saturated" :
|
|
||||||
IsSatisfied() ? "satisfied" : "unsatisfied")
|
|
||||||
<< " and "
|
|
||||||
<< (is_retired() ? "retired" : "active");
|
|
||||||
}
|
|
||||||
|
|
||||||
// Checks the action count (i.e. the number of WillOnce() and
|
|
||||||
// WillRepeatedly() clauses) against the cardinality if this hasn't
|
|
||||||
// been done before. Prints a warning if there are too many or too
|
|
||||||
// few actions.
|
|
||||||
void ExpectationBase::CheckActionCountIfNotDone() const
|
|
||||||
GTEST_LOCK_EXCLUDED_(mutex_) {
|
|
||||||
bool should_check = false;
|
|
||||||
{
|
|
||||||
MutexLock l(&mutex_);
|
|
||||||
if (!action_count_checked_) {
|
|
||||||
action_count_checked_ = true;
|
|
||||||
should_check = true;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
if (should_check) {
|
|
||||||
if (!cardinality_specified_) {
|
|
||||||
// The cardinality was inferred - no need to check the action
|
|
||||||
// count against it.
|
|
||||||
return;
|
|
||||||
}
|
|
||||||
|
|
||||||
// The cardinality was explicitly specified.
|
|
||||||
const int action_count = static_cast<int>(untyped_actions_.size());
|
|
||||||
const int upper_bound = cardinality().ConservativeUpperBound();
|
|
||||||
const int lower_bound = cardinality().ConservativeLowerBound();
|
|
||||||
bool too_many; // True if there are too many actions, or false
|
|
||||||
// if there are too few.
|
|
||||||
if (action_count > upper_bound ||
|
|
||||||
(action_count == upper_bound && repeated_action_specified_)) {
|
|
||||||
too_many = true;
|
|
||||||
} else if (0 < action_count && action_count < lower_bound &&
|
|
||||||
!repeated_action_specified_) {
|
|
||||||
too_many = false;
|
|
||||||
} else {
|
|
||||||
return;
|
|
||||||
}
|
|
||||||
|
|
||||||
::std::stringstream ss;
|
|
||||||
DescribeLocationTo(&ss);
|
|
||||||
ss << "Too " << (too_many ? "many" : "few")
|
|
||||||
<< " actions specified in " << source_text() << "...\n"
|
|
||||||
<< "Expected to be ";
|
|
||||||
cardinality().DescribeTo(&ss);
|
|
||||||
ss << ", but has " << (too_many ? "" : "only ")
|
|
||||||
<< action_count << " WillOnce()"
|
|
||||||
<< (action_count == 1 ? "" : "s");
|
|
||||||
if (repeated_action_specified_) {
|
|
||||||
ss << " and a WillRepeatedly()";
|
|
||||||
}
|
|
||||||
ss << ".";
|
|
||||||
Log(kWarning, ss.str(), -1); // -1 means "don't print stack trace".
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
// Implements the .Times() clause.
|
|
||||||
void ExpectationBase::UntypedTimes(const Cardinality& a_cardinality) {
|
|
||||||
if (last_clause_ == kTimes) {
|
|
||||||
ExpectSpecProperty(false,
|
|
||||||
".Times() cannot appear "
|
|
||||||
"more than once in an EXPECT_CALL().");
|
|
||||||
} else {
|
|
||||||
ExpectSpecProperty(last_clause_ < kTimes,
|
|
||||||
".Times() cannot appear after "
|
|
||||||
".InSequence(), .WillOnce(), .WillRepeatedly(), "
|
|
||||||
"or .RetiresOnSaturation().");
|
|
||||||
}
|
|
||||||
last_clause_ = kTimes;
|
|
||||||
|
|
||||||
SpecifyCardinality(a_cardinality);
|
|
||||||
}
|
|
||||||
|
|
||||||
// Points to the implicit sequence introduced by a living InSequence
|
|
||||||
// object (if any) in the current thread or NULL.
|
|
||||||
GTEST_API_ ThreadLocal<Sequence*> g_gmock_implicit_sequence;
|
|
||||||
|
|
||||||
// Reports an uninteresting call (whose description is in msg) in the
|
|
||||||
// manner specified by 'reaction'.
|
|
||||||
void ReportUninterestingCall(CallReaction reaction, const std::string& msg) {
|
|
||||||
// Include a stack trace only if --gmock_verbose=info is specified.
|
|
||||||
const int stack_frames_to_skip =
|
|
||||||
GMOCK_FLAG(verbose) == kInfoVerbosity ? 3 : -1;
|
|
||||||
switch (reaction) {
|
|
||||||
case kAllow:
|
|
||||||
Log(kInfo, msg, stack_frames_to_skip);
|
|
||||||
break;
|
|
||||||
case kWarn:
|
|
||||||
Log(kWarning,
|
|
||||||
msg +
|
|
||||||
"\nNOTE: You can safely ignore the above warning unless this "
|
|
||||||
"call should not happen. Do not suppress it by blindly adding "
|
|
||||||
"an EXPECT_CALL() if you don't mean to enforce the call. "
|
|
||||||
"See "
|
|
||||||
"https://github.com/google/googletest/blob/master/googlemock/"
|
|
||||||
"docs/CookBook.md#"
|
|
||||||
"knowing-when-to-expect for details.\n",
|
|
||||||
stack_frames_to_skip);
|
|
||||||
break;
|
|
||||||
default: // FAIL
|
|
||||||
Expect(false, NULL, -1, msg);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
UntypedFunctionMockerBase::UntypedFunctionMockerBase()
|
|
||||||
: mock_obj_(NULL), name_("") {}
|
|
||||||
|
|
||||||
UntypedFunctionMockerBase::~UntypedFunctionMockerBase() {}
|
|
||||||
|
|
||||||
// Sets the mock object this mock method belongs to, and registers
|
|
||||||
// this information in the global mock registry. Will be called
|
|
||||||
// whenever an EXPECT_CALL() or ON_CALL() is executed on this mock
|
|
||||||
// method.
|
|
||||||
void UntypedFunctionMockerBase::RegisterOwner(const void* mock_obj)
|
|
||||||
GTEST_LOCK_EXCLUDED_(g_gmock_mutex) {
|
|
||||||
{
|
|
||||||
MutexLock l(&g_gmock_mutex);
|
|
||||||
mock_obj_ = mock_obj;
|
|
||||||
}
|
|
||||||
Mock::Register(mock_obj, this);
|
|
||||||
}
|
|
||||||
|
|
||||||
// Sets the mock object this mock method belongs to, and sets the name
|
|
||||||
// of the mock function. Will be called upon each invocation of this
|
|
||||||
// mock function.
|
|
||||||
void UntypedFunctionMockerBase::SetOwnerAndName(const void* mock_obj,
|
|
||||||
const char* name)
|
|
||||||
GTEST_LOCK_EXCLUDED_(g_gmock_mutex) {
|
|
||||||
// We protect name_ under g_gmock_mutex in case this mock function
|
|
||||||
// is called from two threads concurrently.
|
|
||||||
MutexLock l(&g_gmock_mutex);
|
|
||||||
mock_obj_ = mock_obj;
|
|
||||||
name_ = name;
|
|
||||||
}
|
|
||||||
|
|
||||||
// Returns the name of the function being mocked. Must be called
|
|
||||||
// after RegisterOwner() or SetOwnerAndName() has been called.
|
|
||||||
const void* UntypedFunctionMockerBase::MockObject() const
|
|
||||||
GTEST_LOCK_EXCLUDED_(g_gmock_mutex) {
|
|
||||||
const void* mock_obj;
|
|
||||||
{
|
|
||||||
// We protect mock_obj_ under g_gmock_mutex in case this mock
|
|
||||||
// function is called from two threads concurrently.
|
|
||||||
MutexLock l(&g_gmock_mutex);
|
|
||||||
Assert(mock_obj_ != NULL, __FILE__, __LINE__,
|
|
||||||
"MockObject() must not be called before RegisterOwner() or "
|
|
||||||
"SetOwnerAndName() has been called.");
|
|
||||||
mock_obj = mock_obj_;
|
|
||||||
}
|
|
||||||
return mock_obj;
|
|
||||||
}
|
|
||||||
|
|
||||||
// Returns the name of this mock method. Must be called after
|
|
||||||
// SetOwnerAndName() has been called.
|
|
||||||
const char* UntypedFunctionMockerBase::Name() const
|
|
||||||
GTEST_LOCK_EXCLUDED_(g_gmock_mutex) {
|
|
||||||
const char* name;
|
|
||||||
{
|
|
||||||
// We protect name_ under g_gmock_mutex in case this mock
|
|
||||||
// function is called from two threads concurrently.
|
|
||||||
MutexLock l(&g_gmock_mutex);
|
|
||||||
Assert(name_ != NULL, __FILE__, __LINE__,
|
|
||||||
"Name() must not be called before SetOwnerAndName() has "
|
|
||||||
"been called.");
|
|
||||||
name = name_;
|
|
||||||
}
|
|
||||||
return name;
|
|
||||||
}
|
|
||||||
|
|
||||||
// Calculates the result of invoking this mock function with the given
|
|
||||||
// arguments, prints it, and returns it. The caller is responsible
|
|
||||||
// for deleting the result.
|
|
||||||
UntypedActionResultHolderBase* UntypedFunctionMockerBase::UntypedInvokeWith(
|
|
||||||
void* const untyped_args) GTEST_LOCK_EXCLUDED_(g_gmock_mutex) {
|
|
||||||
// See the definition of untyped_expectations_ for why access to it
|
|
||||||
// is unprotected here.
|
|
||||||
if (untyped_expectations_.size() == 0) {
|
|
||||||
// No expectation is set on this mock method - we have an
|
|
||||||
// uninteresting call.
|
|
||||||
|
|
||||||
// We must get Google Mock's reaction on uninteresting calls
|
|
||||||
// made on this mock object BEFORE performing the action,
|
|
||||||
// because the action may DELETE the mock object and make the
|
|
||||||
// following expression meaningless.
|
|
||||||
const CallReaction reaction =
|
|
||||||
Mock::GetReactionOnUninterestingCalls(MockObject());
|
|
||||||
|
|
||||||
// True iff we need to print this call's arguments and return
|
|
||||||
// value. This definition must be kept in sync with
|
|
||||||
// the behavior of ReportUninterestingCall().
|
|
||||||
const bool need_to_report_uninteresting_call =
|
|
||||||
// If the user allows this uninteresting call, we print it
|
|
||||||
// only when they want informational messages.
|
|
||||||
reaction == kAllow ? LogIsVisible(kInfo) :
|
|
||||||
// If the user wants this to be a warning, we print
|
|
||||||
// it only when they want to see warnings.
|
|
||||||
reaction == kWarn
|
|
||||||
? LogIsVisible(kWarning)
|
|
||||||
:
|
|
||||||
// Otherwise, the user wants this to be an error, and we
|
|
||||||
// should always print detailed information in the error.
|
|
||||||
true;
|
|
||||||
|
|
||||||
if (!need_to_report_uninteresting_call) {
|
|
||||||
// Perform the action without printing the call information.
|
|
||||||
return this->UntypedPerformDefaultAction(
|
|
||||||
untyped_args, "Function call: " + std::string(Name()));
|
|
||||||
}
|
|
||||||
|
|
||||||
// Warns about the uninteresting call.
|
|
||||||
::std::stringstream ss;
|
|
||||||
this->UntypedDescribeUninterestingCall(untyped_args, &ss);
|
|
||||||
|
|
||||||
// Calculates the function result.
|
|
||||||
UntypedActionResultHolderBase* const result =
|
|
||||||
this->UntypedPerformDefaultAction(untyped_args, ss.str());
|
|
||||||
|
|
||||||
// Prints the function result.
|
|
||||||
if (result != NULL)
|
|
||||||
result->PrintAsActionResult(&ss);
|
|
||||||
|
|
||||||
ReportUninterestingCall(reaction, ss.str());
|
|
||||||
return result;
|
|
||||||
}
|
|
||||||
|
|
||||||
bool is_excessive = false;
|
|
||||||
::std::stringstream ss;
|
|
||||||
::std::stringstream why;
|
|
||||||
::std::stringstream loc;
|
|
||||||
const void* untyped_action = NULL;
|
|
||||||
|
|
||||||
// The UntypedFindMatchingExpectation() function acquires and
|
|
||||||
// releases g_gmock_mutex.
|
|
||||||
const ExpectationBase* const untyped_expectation =
|
|
||||||
this->UntypedFindMatchingExpectation(
|
|
||||||
untyped_args, &untyped_action, &is_excessive,
|
|
||||||
&ss, &why);
|
|
||||||
const bool found = untyped_expectation != NULL;
|
|
||||||
|
|
||||||
// True iff we need to print the call's arguments and return value.
|
|
||||||
// This definition must be kept in sync with the uses of Expect()
|
|
||||||
// and Log() in this function.
|
|
||||||
const bool need_to_report_call =
|
|
||||||
!found || is_excessive || LogIsVisible(kInfo);
|
|
||||||
if (!need_to_report_call) {
|
|
||||||
// Perform the action without printing the call information.
|
|
||||||
return
|
|
||||||
untyped_action == NULL ?
|
|
||||||
this->UntypedPerformDefaultAction(untyped_args, "") :
|
|
||||||
this->UntypedPerformAction(untyped_action, untyped_args);
|
|
||||||
}
|
|
||||||
|
|
||||||
ss << " Function call: " << Name();
|
|
||||||
this->UntypedPrintArgs(untyped_args, &ss);
|
|
||||||
|
|
||||||
// In case the action deletes a piece of the expectation, we
|
|
||||||
// generate the message beforehand.
|
|
||||||
if (found && !is_excessive) {
|
|
||||||
untyped_expectation->DescribeLocationTo(&loc);
|
|
||||||
}
|
|
||||||
|
|
||||||
UntypedActionResultHolderBase* const result =
|
|
||||||
untyped_action == NULL ?
|
|
||||||
this->UntypedPerformDefaultAction(untyped_args, ss.str()) :
|
|
||||||
this->UntypedPerformAction(untyped_action, untyped_args);
|
|
||||||
if (result != NULL)
|
|
||||||
result->PrintAsActionResult(&ss);
|
|
||||||
ss << "\n" << why.str();
|
|
||||||
|
|
||||||
if (!found) {
|
|
||||||
// No expectation matches this call - reports a failure.
|
|
||||||
Expect(false, NULL, -1, ss.str());
|
|
||||||
} else if (is_excessive) {
|
|
||||||
// We had an upper-bound violation and the failure message is in ss.
|
|
||||||
Expect(false, untyped_expectation->file(),
|
|
||||||
untyped_expectation->line(), ss.str());
|
|
||||||
} else {
|
|
||||||
// We had an expected call and the matching expectation is
|
|
||||||
// described in ss.
|
|
||||||
Log(kInfo, loc.str() + ss.str(), 2);
|
|
||||||
}
|
|
||||||
|
|
||||||
return result;
|
|
||||||
}
|
|
||||||
|
|
||||||
// Returns an Expectation object that references and co-owns exp,
|
|
||||||
// which must be an expectation on this mock function.
|
|
||||||
Expectation UntypedFunctionMockerBase::GetHandleOf(ExpectationBase* exp) {
|
|
||||||
// See the definition of untyped_expectations_ for why access to it
|
|
||||||
// is unprotected here.
|
|
||||||
for (UntypedExpectations::const_iterator it =
|
|
||||||
untyped_expectations_.begin();
|
|
||||||
it != untyped_expectations_.end(); ++it) {
|
|
||||||
if (it->get() == exp) {
|
|
||||||
return Expectation(*it);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
Assert(false, __FILE__, __LINE__, "Cannot find expectation.");
|
|
||||||
return Expectation();
|
|
||||||
// The above statement is just to make the code compile, and will
|
|
||||||
// never be executed.
|
|
||||||
}
|
|
||||||
|
|
||||||
// Verifies that all expectations on this mock function have been
|
|
||||||
// satisfied. Reports one or more Google Test non-fatal failures
|
|
||||||
// and returns false if not.
|
|
||||||
bool UntypedFunctionMockerBase::VerifyAndClearExpectationsLocked()
|
|
||||||
GTEST_EXCLUSIVE_LOCK_REQUIRED_(g_gmock_mutex) {
|
|
||||||
g_gmock_mutex.AssertHeld();
|
|
||||||
bool expectations_met = true;
|
|
||||||
for (UntypedExpectations::const_iterator it =
|
|
||||||
untyped_expectations_.begin();
|
|
||||||
it != untyped_expectations_.end(); ++it) {
|
|
||||||
ExpectationBase* const untyped_expectation = it->get();
|
|
||||||
if (untyped_expectation->IsOverSaturated()) {
|
|
||||||
// There was an upper-bound violation. Since the error was
|
|
||||||
// already reported when it occurred, there is no need to do
|
|
||||||
// anything here.
|
|
||||||
expectations_met = false;
|
|
||||||
} else if (!untyped_expectation->IsSatisfied()) {
|
|
||||||
expectations_met = false;
|
|
||||||
::std::stringstream ss;
|
|
||||||
ss << "Actual function call count doesn't match "
|
|
||||||
<< untyped_expectation->source_text() << "...\n";
|
|
||||||
// No need to show the source file location of the expectation
|
|
||||||
// in the description, as the Expect() call that follows already
|
|
||||||
// takes care of it.
|
|
||||||
untyped_expectation->MaybeDescribeExtraMatcherTo(&ss);
|
|
||||||
untyped_expectation->DescribeCallCountTo(&ss);
|
|
||||||
Expect(false, untyped_expectation->file(),
|
|
||||||
untyped_expectation->line(), ss.str());
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
// Deleting our expectations may trigger other mock objects to be deleted, for
|
|
||||||
// example if an action contains a reference counted smart pointer to that
|
|
||||||
// mock object, and that is the last reference. So if we delete our
|
|
||||||
// expectations within the context of the global mutex we may deadlock when
|
|
||||||
// this method is called again. Instead, make a copy of the set of
|
|
||||||
// expectations to delete, clear our set within the mutex, and then clear the
|
|
||||||
// copied set outside of it.
|
|
||||||
UntypedExpectations expectations_to_delete;
|
|
||||||
untyped_expectations_.swap(expectations_to_delete);
|
|
||||||
|
|
||||||
g_gmock_mutex.Unlock();
|
|
||||||
expectations_to_delete.clear();
|
|
||||||
g_gmock_mutex.Lock();
|
|
||||||
|
|
||||||
return expectations_met;
|
|
||||||
}
|
|
||||||
|
|
||||||
CallReaction intToCallReaction(int mock_behavior) {
|
|
||||||
if (mock_behavior >= kAllow && mock_behavior <= kFail) {
|
|
||||||
return static_cast<internal::CallReaction>(mock_behavior);
|
|
||||||
}
|
|
||||||
return kWarn;
|
|
||||||
}
|
|
||||||
|
|
||||||
} // namespace internal
|
|
||||||
|
|
||||||
// Class Mock.
|
|
||||||
|
|
||||||
namespace {
|
|
||||||
|
|
||||||
typedef std::set<internal::UntypedFunctionMockerBase*> FunctionMockers;
|
|
||||||
|
|
||||||
// The current state of a mock object. Such information is needed for
|
|
||||||
// detecting leaked mock objects and explicitly verifying a mock's
|
|
||||||
// expectations.
|
|
||||||
struct MockObjectState {
|
|
||||||
MockObjectState()
|
|
||||||
: first_used_file(NULL), first_used_line(-1), leakable(false) {}
|
|
||||||
|
|
||||||
// Where in the source file an ON_CALL or EXPECT_CALL is first
|
|
||||||
// invoked on this mock object.
|
|
||||||
const char* first_used_file;
|
|
||||||
int first_used_line;
|
|
||||||
::std::string first_used_test_case;
|
|
||||||
::std::string first_used_test;
|
|
||||||
bool leakable; // true iff it's OK to leak the object.
|
|
||||||
FunctionMockers function_mockers; // All registered methods of the object.
|
|
||||||
};
|
|
||||||
|
|
||||||
// A global registry holding the state of all mock objects that are
|
|
||||||
// alive. A mock object is added to this registry the first time
|
|
||||||
// Mock::AllowLeak(), ON_CALL(), or EXPECT_CALL() is called on it. It
|
|
||||||
// is removed from the registry in the mock object's destructor.
|
|
||||||
class MockObjectRegistry {
|
|
||||||
public:
|
|
||||||
// Maps a mock object (identified by its address) to its state.
|
|
||||||
typedef std::map<const void*, MockObjectState> StateMap;
|
|
||||||
|
|
||||||
// This destructor will be called when a program exits, after all
|
|
||||||
// tests in it have been run. By then, there should be no mock
|
|
||||||
// object alive. Therefore we report any living object as test
|
|
||||||
// failure, unless the user explicitly asked us to ignore it.
|
|
||||||
~MockObjectRegistry() {
|
|
||||||
// "using ::std::cout;" doesn't work with Symbian's STLport, where cout is
|
|
||||||
// a macro.
|
|
||||||
|
|
||||||
if (!GMOCK_FLAG(catch_leaked_mocks))
|
|
||||||
return;
|
|
||||||
|
|
||||||
int leaked_count = 0;
|
|
||||||
for (StateMap::const_iterator it = states_.begin(); it != states_.end();
|
|
||||||
++it) {
|
|
||||||
if (it->second.leakable) // The user said it's fine to leak this object.
|
|
||||||
continue;
|
|
||||||
|
|
||||||
// FIXME: Print the type of the leaked object.
|
|
||||||
// This can help the user identify the leaked object.
|
|
||||||
std::cout << "\n";
|
|
||||||
const MockObjectState& state = it->second;
|
|
||||||
std::cout << internal::FormatFileLocation(state.first_used_file,
|
|
||||||
state.first_used_line);
|
|
||||||
std::cout << " ERROR: this mock object";
|
|
||||||
if (state.first_used_test != "") {
|
|
||||||
std::cout << " (used in test " << state.first_used_test_case << "."
|
|
||||||
<< state.first_used_test << ")";
|
|
||||||
}
|
|
||||||
std::cout << " should be deleted but never is. Its address is @"
|
|
||||||
<< it->first << ".";
|
|
||||||
leaked_count++;
|
|
||||||
}
|
|
||||||
if (leaked_count > 0) {
|
|
||||||
std::cout << "\nERROR: " << leaked_count << " leaked mock "
|
|
||||||
<< (leaked_count == 1 ? "object" : "objects")
|
|
||||||
<< " found at program exit. Expectations on a mock object is "
|
|
||||||
"verified when the object is destructed. Leaking a mock "
|
|
||||||
"means that its expectations aren't verified, which is "
|
|
||||||
"usually a test bug. If you really intend to leak a mock, "
|
|
||||||
"you can suppress this error using "
|
|
||||||
"testing::Mock::AllowLeak(mock_object), or you may use a "
|
|
||||||
"fake or stub instead of a mock.\n";
|
|
||||||
std::cout.flush();
|
|
||||||
::std::cerr.flush();
|
|
||||||
// RUN_ALL_TESTS() has already returned when this destructor is
|
|
||||||
// called. Therefore we cannot use the normal Google Test
|
|
||||||
// failure reporting mechanism.
|
|
||||||
_exit(1); // We cannot call exit() as it is not reentrant and
|
|
||||||
// may already have been called.
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
StateMap& states() { return states_; }
|
|
||||||
|
|
||||||
private:
|
|
||||||
StateMap states_;
|
|
||||||
};
|
|
||||||
|
|
||||||
// Protected by g_gmock_mutex.
|
|
||||||
MockObjectRegistry g_mock_object_registry;
|
|
||||||
|
|
||||||
// Maps a mock object to the reaction Google Mock should have when an
|
|
||||||
// uninteresting method is called. Protected by g_gmock_mutex.
|
|
||||||
std::map<const void*, internal::CallReaction> g_uninteresting_call_reaction;
|
|
||||||
|
|
||||||
// Sets the reaction Google Mock should have when an uninteresting
|
|
||||||
// method of the given mock object is called.
|
|
||||||
void SetReactionOnUninterestingCalls(const void* mock_obj,
|
|
||||||
internal::CallReaction reaction)
|
|
||||||
GTEST_LOCK_EXCLUDED_(internal::g_gmock_mutex) {
|
|
||||||
internal::MutexLock l(&internal::g_gmock_mutex);
|
|
||||||
g_uninteresting_call_reaction[mock_obj] = reaction;
|
|
||||||
}
|
|
||||||
|
|
||||||
} // namespace
|
|
||||||
|
|
||||||
// Tells Google Mock to allow uninteresting calls on the given mock
|
|
||||||
// object.
|
|
||||||
void Mock::AllowUninterestingCalls(const void* mock_obj)
|
|
||||||
GTEST_LOCK_EXCLUDED_(internal::g_gmock_mutex) {
|
|
||||||
SetReactionOnUninterestingCalls(mock_obj, internal::kAllow);
|
|
||||||
}
|
|
||||||
|
|
||||||
// Tells Google Mock to warn the user about uninteresting calls on the
|
|
||||||
// given mock object.
|
|
||||||
void Mock::WarnUninterestingCalls(const void* mock_obj)
|
|
||||||
GTEST_LOCK_EXCLUDED_(internal::g_gmock_mutex) {
|
|
||||||
SetReactionOnUninterestingCalls(mock_obj, internal::kWarn);
|
|
||||||
}
|
|
||||||
|
|
||||||
// Tells Google Mock to fail uninteresting calls on the given mock
|
|
||||||
// object.
|
|
||||||
void Mock::FailUninterestingCalls(const void* mock_obj)
|
|
||||||
GTEST_LOCK_EXCLUDED_(internal::g_gmock_mutex) {
|
|
||||||
SetReactionOnUninterestingCalls(mock_obj, internal::kFail);
|
|
||||||
}
|
|
||||||
|
|
||||||
// Tells Google Mock the given mock object is being destroyed and its
|
|
||||||
// entry in the call-reaction table should be removed.
|
|
||||||
void Mock::UnregisterCallReaction(const void* mock_obj)
|
|
||||||
GTEST_LOCK_EXCLUDED_(internal::g_gmock_mutex) {
|
|
||||||
internal::MutexLock l(&internal::g_gmock_mutex);
|
|
||||||
g_uninteresting_call_reaction.erase(mock_obj);
|
|
||||||
}
|
|
||||||
|
|
||||||
// Returns the reaction Google Mock will have on uninteresting calls
|
|
||||||
// made on the given mock object.
|
|
||||||
internal::CallReaction Mock::GetReactionOnUninterestingCalls(
|
|
||||||
const void* mock_obj)
|
|
||||||
GTEST_LOCK_EXCLUDED_(internal::g_gmock_mutex) {
|
|
||||||
internal::MutexLock l(&internal::g_gmock_mutex);
|
|
||||||
return (g_uninteresting_call_reaction.count(mock_obj) == 0) ?
|
|
||||||
internal::intToCallReaction(GMOCK_FLAG(default_mock_behavior)) :
|
|
||||||
g_uninteresting_call_reaction[mock_obj];
|
|
||||||
}
|
|
||||||
|
|
||||||
// Tells Google Mock to ignore mock_obj when checking for leaked mock
|
|
||||||
// objects.
|
|
||||||
void Mock::AllowLeak(const void* mock_obj)
|
|
||||||
GTEST_LOCK_EXCLUDED_(internal::g_gmock_mutex) {
|
|
||||||
internal::MutexLock l(&internal::g_gmock_mutex);
|
|
||||||
g_mock_object_registry.states()[mock_obj].leakable = true;
|
|
||||||
}
|
|
||||||
|
|
||||||
// Verifies and clears all expectations on the given mock object. If
|
|
||||||
// the expectations aren't satisfied, generates one or more Google
|
|
||||||
// Test non-fatal failures and returns false.
|
|
||||||
bool Mock::VerifyAndClearExpectations(void* mock_obj)
|
|
||||||
GTEST_LOCK_EXCLUDED_(internal::g_gmock_mutex) {
|
|
||||||
internal::MutexLock l(&internal::g_gmock_mutex);
|
|
||||||
return VerifyAndClearExpectationsLocked(mock_obj);
|
|
||||||
}
|
|
||||||
|
|
||||||
// Verifies all expectations on the given mock object and clears its
|
|
||||||
// default actions and expectations. Returns true iff the
|
|
||||||
// verification was successful.
|
|
||||||
bool Mock::VerifyAndClear(void* mock_obj)
|
|
||||||
GTEST_LOCK_EXCLUDED_(internal::g_gmock_mutex) {
|
|
||||||
internal::MutexLock l(&internal::g_gmock_mutex);
|
|
||||||
ClearDefaultActionsLocked(mock_obj);
|
|
||||||
return VerifyAndClearExpectationsLocked(mock_obj);
|
|
||||||
}
|
|
||||||
|
|
||||||
// Verifies and clears all expectations on the given mock object. If
|
|
||||||
// the expectations aren't satisfied, generates one or more Google
|
|
||||||
// Test non-fatal failures and returns false.
|
|
||||||
bool Mock::VerifyAndClearExpectationsLocked(void* mock_obj)
|
|
||||||
GTEST_EXCLUSIVE_LOCK_REQUIRED_(internal::g_gmock_mutex) {
|
|
||||||
internal::g_gmock_mutex.AssertHeld();
|
|
||||||
if (g_mock_object_registry.states().count(mock_obj) == 0) {
|
|
||||||
// No EXPECT_CALL() was set on the given mock object.
|
|
||||||
return true;
|
|
||||||
}
|
|
||||||
|
|
||||||
// Verifies and clears the expectations on each mock method in the
|
|
||||||
// given mock object.
|
|
||||||
bool expectations_met = true;
|
|
||||||
FunctionMockers& mockers =
|
|
||||||
g_mock_object_registry.states()[mock_obj].function_mockers;
|
|
||||||
for (FunctionMockers::const_iterator it = mockers.begin();
|
|
||||||
it != mockers.end(); ++it) {
|
|
||||||
if (!(*it)->VerifyAndClearExpectationsLocked()) {
|
|
||||||
expectations_met = false;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
// We don't clear the content of mockers, as they may still be
|
|
||||||
// needed by ClearDefaultActionsLocked().
|
|
||||||
return expectations_met;
|
|
||||||
}
|
|
||||||
|
|
||||||
// Registers a mock object and a mock method it owns.
|
|
||||||
void Mock::Register(const void* mock_obj,
|
|
||||||
internal::UntypedFunctionMockerBase* mocker)
|
|
||||||
GTEST_LOCK_EXCLUDED_(internal::g_gmock_mutex) {
|
|
||||||
internal::MutexLock l(&internal::g_gmock_mutex);
|
|
||||||
g_mock_object_registry.states()[mock_obj].function_mockers.insert(mocker);
|
|
||||||
}
|
|
||||||
|
|
||||||
// Tells Google Mock where in the source code mock_obj is used in an
|
|
||||||
// ON_CALL or EXPECT_CALL. In case mock_obj is leaked, this
|
|
||||||
// information helps the user identify which object it is.
|
|
||||||
void Mock::RegisterUseByOnCallOrExpectCall(const void* mock_obj,
|
|
||||||
const char* file, int line)
|
|
||||||
GTEST_LOCK_EXCLUDED_(internal::g_gmock_mutex) {
|
|
||||||
internal::MutexLock l(&internal::g_gmock_mutex);
|
|
||||||
MockObjectState& state = g_mock_object_registry.states()[mock_obj];
|
|
||||||
if (state.first_used_file == NULL) {
|
|
||||||
state.first_used_file = file;
|
|
||||||
state.first_used_line = line;
|
|
||||||
const TestInfo* const test_info =
|
|
||||||
UnitTest::GetInstance()->current_test_info();
|
|
||||||
if (test_info != NULL) {
|
|
||||||
// FIXME: record the test case name when the
|
|
||||||
// ON_CALL or EXPECT_CALL is invoked from SetUpTestCase() or
|
|
||||||
// TearDownTestCase().
|
|
||||||
state.first_used_test_case = test_info->test_case_name();
|
|
||||||
state.first_used_test = test_info->name();
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
// Unregisters a mock method; removes the owning mock object from the
|
|
||||||
// registry when the last mock method associated with it has been
|
|
||||||
// unregistered. This is called only in the destructor of
|
|
||||||
// FunctionMockerBase.
|
|
||||||
void Mock::UnregisterLocked(internal::UntypedFunctionMockerBase* mocker)
|
|
||||||
GTEST_EXCLUSIVE_LOCK_REQUIRED_(internal::g_gmock_mutex) {
|
|
||||||
internal::g_gmock_mutex.AssertHeld();
|
|
||||||
for (MockObjectRegistry::StateMap::iterator it =
|
|
||||||
g_mock_object_registry.states().begin();
|
|
||||||
it != g_mock_object_registry.states().end(); ++it) {
|
|
||||||
FunctionMockers& mockers = it->second.function_mockers;
|
|
||||||
if (mockers.erase(mocker) > 0) {
|
|
||||||
// mocker was in mockers and has been just removed.
|
|
||||||
if (mockers.empty()) {
|
|
||||||
g_mock_object_registry.states().erase(it);
|
|
||||||
}
|
|
||||||
return;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
// Clears all ON_CALL()s set on the given mock object.
|
|
||||||
void Mock::ClearDefaultActionsLocked(void* mock_obj)
|
|
||||||
GTEST_EXCLUSIVE_LOCK_REQUIRED_(internal::g_gmock_mutex) {
|
|
||||||
internal::g_gmock_mutex.AssertHeld();
|
|
||||||
|
|
||||||
if (g_mock_object_registry.states().count(mock_obj) == 0) {
|
|
||||||
// No ON_CALL() was set on the given mock object.
|
|
||||||
return;
|
|
||||||
}
|
|
||||||
|
|
||||||
// Clears the default actions for each mock method in the given mock
|
|
||||||
// object.
|
|
||||||
FunctionMockers& mockers =
|
|
||||||
g_mock_object_registry.states()[mock_obj].function_mockers;
|
|
||||||
for (FunctionMockers::const_iterator it = mockers.begin();
|
|
||||||
it != mockers.end(); ++it) {
|
|
||||||
(*it)->ClearDefaultActionsLocked();
|
|
||||||
}
|
|
||||||
|
|
||||||
// We don't clear the content of mockers, as they may still be
|
|
||||||
// needed by VerifyAndClearExpectationsLocked().
|
|
||||||
}
|
|
||||||
|
|
||||||
Expectation::Expectation() {}
|
|
||||||
|
|
||||||
Expectation::Expectation(
|
|
||||||
const internal::linked_ptr<internal::ExpectationBase>& an_expectation_base)
|
|
||||||
: expectation_base_(an_expectation_base) {}
|
|
||||||
|
|
||||||
Expectation::~Expectation() {}
|
|
||||||
|
|
||||||
// Adds an expectation to a sequence.
|
|
||||||
void Sequence::AddExpectation(const Expectation& expectation) const {
|
|
||||||
if (*last_expectation_ != expectation) {
|
|
||||||
if (last_expectation_->expectation_base() != NULL) {
|
|
||||||
expectation.expectation_base()->immediate_prerequisites_
|
|
||||||
+= *last_expectation_;
|
|
||||||
}
|
|
||||||
*last_expectation_ = expectation;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
// Creates the implicit sequence if there isn't one.
|
|
||||||
InSequence::InSequence() {
|
|
||||||
if (internal::g_gmock_implicit_sequence.get() == NULL) {
|
|
||||||
internal::g_gmock_implicit_sequence.set(new Sequence);
|
|
||||||
sequence_created_ = true;
|
|
||||||
} else {
|
|
||||||
sequence_created_ = false;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
// Deletes the implicit sequence if it was created by the constructor
|
|
||||||
// of this object.
|
|
||||||
InSequence::~InSequence() {
|
|
||||||
if (sequence_created_) {
|
|
||||||
delete internal::g_gmock_implicit_sequence.get();
|
|
||||||
internal::g_gmock_implicit_sequence.set(NULL);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
} // namespace testing
|
|
||||||
|
|
||||||
#ifdef _MSC_VER
|
|
||||||
#if _MSC_VER <= 1900
|
|
||||||
# pragma warning(pop)
|
|
||||||
#endif
|
|
||||||
#endif
|
|
@ -1,204 +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.
|
|
||||||
|
|
||||||
|
|
||||||
#include "gmock/gmock.h"
|
|
||||||
#include "gmock/internal/gmock-port.h"
|
|
||||||
|
|
||||||
namespace testing {
|
|
||||||
|
|
||||||
// FIXME: support using environment variables to
|
|
||||||
// control the flag values, like what Google Test does.
|
|
||||||
|
|
||||||
GMOCK_DEFINE_bool_(catch_leaked_mocks, true,
|
|
||||||
"true iff Google Mock should report leaked mock objects "
|
|
||||||
"as failures.");
|
|
||||||
|
|
||||||
GMOCK_DEFINE_string_(verbose, internal::kWarningVerbosity,
|
|
||||||
"Controls how verbose Google Mock's output is."
|
|
||||||
" Valid values:\n"
|
|
||||||
" info - prints all messages.\n"
|
|
||||||
" warning - prints warnings and errors.\n"
|
|
||||||
" error - prints errors only.");
|
|
||||||
|
|
||||||
GMOCK_DEFINE_int32_(default_mock_behavior, 1,
|
|
||||||
"Controls the default behavior of mocks."
|
|
||||||
" Valid values:\n"
|
|
||||||
" 0 - by default, mocks act as NiceMocks.\n"
|
|
||||||
" 1 - by default, mocks act as NaggyMocks.\n"
|
|
||||||
" 2 - by default, mocks act as StrictMocks.");
|
|
||||||
|
|
||||||
namespace internal {
|
|
||||||
|
|
||||||
// Parses a string as a command line flag. The string should have the
|
|
||||||
// format "--gmock_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.
|
|
||||||
static const char* ParseGoogleMockFlagValue(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 "--gmock_".
|
|
||||||
const std::string flag_str = std::string("--gmock_") + 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 Google Mock bool flag, in the form of
|
|
||||||
// "--gmock_flag=value".
|
|
||||||
//
|
|
||||||
// On success, stores the value of the flag in *value, and returns
|
|
||||||
// true. On failure, returns false without changing *value.
|
|
||||||
static bool ParseGoogleMockBoolFlag(const char* str, const char* flag,
|
|
||||||
bool* value) {
|
|
||||||
// Gets the value of the flag as a string.
|
|
||||||
const char* const value_str = ParseGoogleMockFlagValue(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 a Google Mock string flag, in the form of
|
|
||||||
// "--gmock_flag=value".
|
|
||||||
//
|
|
||||||
// On success, stores the value of the flag in *value, and returns
|
|
||||||
// true. On failure, returns false without changing *value.
|
|
||||||
template <typename String>
|
|
||||||
static bool ParseGoogleMockStringFlag(const char* str, const char* flag,
|
|
||||||
String* value) {
|
|
||||||
// Gets the value of the flag as a string.
|
|
||||||
const char* const value_str = ParseGoogleMockFlagValue(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;
|
|
||||||
}
|
|
||||||
|
|
||||||
static bool ParseGoogleMockIntFlag(const char* str, const char* flag,
|
|
||||||
int* value) {
|
|
||||||
// Gets the value of the flag as a string.
|
|
||||||
const char* const value_str = ParseGoogleMockFlagValue(str, flag, true);
|
|
||||||
|
|
||||||
// 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);
|
|
||||||
}
|
|
||||||
|
|
||||||
// The internal implementation of InitGoogleMock().
|
|
||||||
//
|
|
||||||
// The type parameter CharType can be instantiated to either char or
|
|
||||||
// wchar_t.
|
|
||||||
template <typename CharType>
|
|
||||||
void InitGoogleMockImpl(int* argc, CharType** argv) {
|
|
||||||
// Makes sure Google Test is initialized. InitGoogleTest() is
|
|
||||||
// idempotent, so it's fine if the user has already called it.
|
|
||||||
InitGoogleTest(argc, argv);
|
|
||||||
if (*argc <= 0) return;
|
|
||||||
|
|
||||||
for (int i = 1; i != *argc; i++) {
|
|
||||||
const std::string arg_string = StreamableToString(argv[i]);
|
|
||||||
const char* const arg = arg_string.c_str();
|
|
||||||
|
|
||||||
// Do we see a Google Mock flag?
|
|
||||||
if (ParseGoogleMockBoolFlag(arg, "catch_leaked_mocks",
|
|
||||||
&GMOCK_FLAG(catch_leaked_mocks)) ||
|
|
||||||
ParseGoogleMockStringFlag(arg, "verbose", &GMOCK_FLAG(verbose)) ||
|
|
||||||
ParseGoogleMockIntFlag(arg, "default_mock_behavior",
|
|
||||||
&GMOCK_FLAG(default_mock_behavior))) {
|
|
||||||
// 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--;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
} // namespace internal
|
|
||||||
|
|
||||||
// Initializes Google Mock. This must be called before running the
|
|
||||||
// tests. In particular, it parses a command line for the flags that
|
|
||||||
// Google Mock recognizes. Whenever a Google Mock flag is seen, it is
|
|
||||||
// removed from argv, and *argc is decremented.
|
|
||||||
//
|
|
||||||
// No value is returned. Instead, the Google Mock flag variables are
|
|
||||||
// updated.
|
|
||||||
//
|
|
||||||
// Since Google Test is needed for Google Mock to work, this function
|
|
||||||
// also initializes Google Test and parses its flags, if that hasn't
|
|
||||||
// been done.
|
|
||||||
GTEST_API_ void InitGoogleMock(int* argc, char** argv) {
|
|
||||||
internal::InitGoogleMockImpl(argc, argv);
|
|
||||||
}
|
|
||||||
|
|
||||||
// This overloaded version can be used in Windows programs compiled in
|
|
||||||
// UNICODE mode.
|
|
||||||
GTEST_API_ void InitGoogleMock(int* argc, wchar_t** argv) {
|
|
||||||
internal::InitGoogleMockImpl(argc, argv);
|
|
||||||
}
|
|
||||||
|
|
||||||
} // namespace testing
|
|
@ -1,54 +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.
|
|
||||||
|
|
||||||
|
|
||||||
#include <iostream>
|
|
||||||
#include "gmock/gmock.h"
|
|
||||||
#include "gtest/gtest.h"
|
|
||||||
|
|
||||||
// MS C++ compiler/linker has a bug on Windows (not on Windows CE), which
|
|
||||||
// causes a link error when _tmain is defined in a static library and UNICODE
|
|
||||||
// is enabled. For this reason instead of _tmain, main function is used on
|
|
||||||
// Windows. See the following link to track the current status of this bug:
|
|
||||||
// https://web.archive.org/web/20170912203238/connect.microsoft.com/VisualStudio/feedback/details/394464/wmain-link-error-in-the-static-library
|
|
||||||
// // NOLINT
|
|
||||||
#if GTEST_OS_WINDOWS_MOBILE
|
|
||||||
# include <tchar.h> // NOLINT
|
|
||||||
|
|
||||||
GTEST_API_ int _tmain(int argc, TCHAR** argv) {
|
|
||||||
#else
|
|
||||||
GTEST_API_ int main(int argc, char** argv) {
|
|
||||||
#endif // GTEST_OS_WINDOWS_MOBILE
|
|
||||||
std::cout << "Running main() from gmock_main.cc\n";
|
|
||||||
// Since Google Mock depends on Google Test, InitGoogleMock() is
|
|
||||||
// also responsible for initializing Google Test. Therefore there's
|
|
||||||
// no need for calling testing::InitGoogleTest() separately.
|
|
||||||
testing::InitGoogleMock(&argc, argv);
|
|
||||||
return RUN_ALL_TESTS();
|
|
||||||
}
|
|
@ -1,157 +0,0 @@
|
|||||||
Changes for 1.7.0:
|
|
||||||
|
|
||||||
* New feature: death tests are supported on OpenBSD and in iOS
|
|
||||||
simulator now.
|
|
||||||
* New feature: Google Test now implements a protocol to allow
|
|
||||||
a test runner to detect that a test program has exited
|
|
||||||
prematurely and report it as a failure (before it would be
|
|
||||||
falsely reported as a success if the exit code is 0).
|
|
||||||
* New feature: Test::RecordProperty() can now be used outside of the
|
|
||||||
lifespan of a test method, in which case it will be attributed to
|
|
||||||
the current test case or the test program in the XML report.
|
|
||||||
* New feature (potentially breaking): --gtest_list_tests now prints
|
|
||||||
the type parameters and value parameters for each test.
|
|
||||||
* Improvement: char pointers and char arrays are now escaped properly
|
|
||||||
in failure messages.
|
|
||||||
* Improvement: failure summary in XML reports now includes file and
|
|
||||||
line information.
|
|
||||||
* Improvement: the <testsuites> XML element now has a timestamp attribute.
|
|
||||||
* Improvement: When --gtest_filter is specified, XML report now doesn't
|
|
||||||
contain information about tests that are filtered out.
|
|
||||||
* Fixed the bug where long --gtest_filter flag values are truncated in
|
|
||||||
death tests.
|
|
||||||
* Potentially breaking change: RUN_ALL_TESTS() is now implemented as a
|
|
||||||
function instead of a macro in order to work better with Clang.
|
|
||||||
* Compatibility fixes with C++ 11 and various platforms.
|
|
||||||
* Bug/warning fixes.
|
|
||||||
|
|
||||||
Changes for 1.6.0:
|
|
||||||
|
|
||||||
* New feature: ADD_FAILURE_AT() for reporting a test failure at the
|
|
||||||
given source location -- useful for writing testing utilities.
|
|
||||||
* New feature: the universal value printer is moved from Google Mock
|
|
||||||
to Google Test.
|
|
||||||
* New feature: type parameters and value parameters are reported in
|
|
||||||
the XML report now.
|
|
||||||
* A gtest_disable_pthreads CMake option.
|
|
||||||
* Colored output works in GNU Screen sessions now.
|
|
||||||
* Parameters of value-parameterized tests are now printed in the
|
|
||||||
textual output.
|
|
||||||
* Failures from ad hoc test assertions run before RUN_ALL_TESTS() are
|
|
||||||
now correctly reported.
|
|
||||||
* Arguments of ASSERT_XY and EXPECT_XY no longer need to support << to
|
|
||||||
ostream.
|
|
||||||
* More complete handling of exceptions.
|
|
||||||
* GTEST_ASSERT_XY can be used instead of ASSERT_XY in case the latter
|
|
||||||
name is already used by another library.
|
|
||||||
* --gtest_catch_exceptions is now true by default, allowing a test
|
|
||||||
program to continue after an exception is thrown.
|
|
||||||
* Value-parameterized test fixtures can now derive from Test and
|
|
||||||
WithParamInterface<T> separately, easing conversion of legacy tests.
|
|
||||||
* Death test messages are clearly marked to make them more
|
|
||||||
distinguishable from other messages.
|
|
||||||
* Compatibility fixes for Android, Google Native Client, MinGW, HP UX,
|
|
||||||
PowerPC, Lucid autotools, libCStd, Sun C++, Borland C++ Builder (Code Gear),
|
|
||||||
IBM XL C++ (Visual Age C++), and C++0x.
|
|
||||||
* Bug fixes and implementation clean-ups.
|
|
||||||
* Potentially incompatible changes: disables the harmful 'make install'
|
|
||||||
command in autotools.
|
|
||||||
|
|
||||||
Changes for 1.5.0:
|
|
||||||
|
|
||||||
* New feature: assertions can be safely called in multiple threads
|
|
||||||
where the pthreads library is available.
|
|
||||||
* New feature: predicates used inside EXPECT_TRUE() and friends
|
|
||||||
can now generate custom failure messages.
|
|
||||||
* New feature: Google Test can now be compiled as a DLL.
|
|
||||||
* New feature: fused source files are included.
|
|
||||||
* New feature: prints help when encountering unrecognized Google Test flags.
|
|
||||||
* Experimental feature: CMake build script (requires CMake 2.6.4+).
|
|
||||||
* Experimental feature: the Pump script for meta programming.
|
|
||||||
* double values streamed to an assertion are printed with enough precision
|
|
||||||
to differentiate any two different values.
|
|
||||||
* Google Test now works on Solaris and AIX.
|
|
||||||
* Build and test script improvements.
|
|
||||||
* Bug fixes and implementation clean-ups.
|
|
||||||
|
|
||||||
Potentially breaking changes:
|
|
||||||
|
|
||||||
* Stopped supporting VC++ 7.1 with exceptions disabled.
|
|
||||||
* Dropped support for 'make install'.
|
|
||||||
|
|
||||||
Changes for 1.4.0:
|
|
||||||
|
|
||||||
* New feature: the event listener API
|
|
||||||
* New feature: test shuffling
|
|
||||||
* New feature: the XML report format is closer to junitreport and can
|
|
||||||
be parsed by Hudson now.
|
|
||||||
* New feature: when a test runs under Visual Studio, its failures are
|
|
||||||
integrated in the IDE.
|
|
||||||
* New feature: /MD(d) versions of VC++ projects.
|
|
||||||
* New feature: elapsed time for the tests is printed by default.
|
|
||||||
* New feature: comes with a TR1 tuple implementation such that Boost
|
|
||||||
is no longer needed for Combine().
|
|
||||||
* New feature: EXPECT_DEATH_IF_SUPPORTED macro and friends.
|
|
||||||
* New feature: the Xcode project can now produce static gtest
|
|
||||||
libraries in addition to a framework.
|
|
||||||
* Compatibility fixes for Solaris, Cygwin, minGW, Windows Mobile,
|
|
||||||
Symbian, gcc, and C++Builder.
|
|
||||||
* Bug fixes and implementation clean-ups.
|
|
||||||
|
|
||||||
Changes for 1.3.0:
|
|
||||||
|
|
||||||
* New feature: death tests on Windows, Cygwin, and Mac.
|
|
||||||
* New feature: ability to use Google Test assertions in other testing
|
|
||||||
frameworks.
|
|
||||||
* New feature: ability to run disabled test via
|
|
||||||
--gtest_also_run_disabled_tests.
|
|
||||||
* New feature: the --help flag for printing the usage.
|
|
||||||
* New feature: access to Google Test flag values in user code.
|
|
||||||
* New feature: a script that packs Google Test into one .h and one
|
|
||||||
.cc file for easy deployment.
|
|
||||||
* New feature: support for distributing test functions to multiple
|
|
||||||
machines (requires support from the test runner).
|
|
||||||
* Bug fixes and implementation clean-ups.
|
|
||||||
|
|
||||||
Changes for 1.2.1:
|
|
||||||
|
|
||||||
* Compatibility fixes for Linux IA-64 and IBM z/OS.
|
|
||||||
* Added support for using Boost and other TR1 implementations.
|
|
||||||
* Changes to the build scripts to support upcoming release of Google C++
|
|
||||||
Mocking Framework.
|
|
||||||
* Added Makefile to the distribution package.
|
|
||||||
* Improved build instructions in README.
|
|
||||||
|
|
||||||
Changes for 1.2.0:
|
|
||||||
|
|
||||||
* New feature: value-parameterized tests.
|
|
||||||
* New feature: the ASSERT/EXPECT_(NON)FATAL_FAILURE(_ON_ALL_THREADS)
|
|
||||||
macros.
|
|
||||||
* Changed the XML report format to match JUnit/Ant's.
|
|
||||||
* Added tests to the Xcode project.
|
|
||||||
* Added scons/SConscript for building with SCons.
|
|
||||||
* Added src/gtest-all.cc for building Google Test from a single file.
|
|
||||||
* Fixed compatibility with Solaris and z/OS.
|
|
||||||
* Enabled running Python tests on systems with python 2.3 installed,
|
|
||||||
e.g. Mac OS X 10.4.
|
|
||||||
* Bug fixes.
|
|
||||||
|
|
||||||
Changes for 1.1.0:
|
|
||||||
|
|
||||||
* New feature: type-parameterized tests.
|
|
||||||
* New feature: exception assertions.
|
|
||||||
* New feature: printing elapsed time of tests.
|
|
||||||
* Improved the robustness of death tests.
|
|
||||||
* Added an Xcode project and samples.
|
|
||||||
* Adjusted the output format on Windows to be understandable by Visual Studio.
|
|
||||||
* Minor bug fixes.
|
|
||||||
|
|
||||||
Changes for 1.0.1:
|
|
||||||
|
|
||||||
* Added project files for Visual Studio 7.1.
|
|
||||||
* Fixed issues with compiling on Mac OS X.
|
|
||||||
* Fixed issues with compiling on Cygwin.
|
|
||||||
|
|
||||||
Changes for 1.0.0:
|
|
||||||
|
|
||||||
* Initial Open Source release of Google Test
|
|
@ -1,37 +0,0 @@
|
|||||||
# This file contains a list of people who've made non-trivial
|
|
||||||
# contribution to the Google C++ Testing Framework project. People
|
|
||||||
# who commit code to the project are encouraged to add their names
|
|
||||||
# here. Please keep the list sorted by first names.
|
|
||||||
|
|
||||||
Ajay Joshi <jaj@google.com>
|
|
||||||
Balázs Dán <balazs.dan@gmail.com>
|
|
||||||
Bharat Mediratta <bharat@menalto.com>
|
|
||||||
Chandler Carruth <chandlerc@google.com>
|
|
||||||
Chris Prince <cprince@google.com>
|
|
||||||
Chris Taylor <taylorc@google.com>
|
|
||||||
Dan Egnor <egnor@google.com>
|
|
||||||
Eric Roman <eroman@chromium.org>
|
|
||||||
Hady Zalek <hady.zalek@gmail.com>
|
|
||||||
Jeffrey Yasskin <jyasskin@google.com>
|
|
||||||
Jói Sigurðsson <joi@google.com>
|
|
||||||
Keir Mierle <mierle@gmail.com>
|
|
||||||
Keith Ray <keith.ray@gmail.com>
|
|
||||||
Kenton Varda <kenton@google.com>
|
|
||||||
Manuel Klimek <klimek@google.com>
|
|
||||||
Markus Heule <markus.heule@gmail.com>
|
|
||||||
Mika Raento <mikie@iki.fi>
|
|
||||||
Miklós Fazekas <mfazekas@szemafor.com>
|
|
||||||
Pasi Valminen <pasi.valminen@gmail.com>
|
|
||||||
Patrick Hanna <phanna@google.com>
|
|
||||||
Patrick Riley <pfr@google.com>
|
|
||||||
Peter Kaminski <piotrk@google.com>
|
|
||||||
Preston Jackson <preston.a.jackson@gmail.com>
|
|
||||||
Rainer Klaffenboeck <rainer.klaffenboeck@dynatrace.com>
|
|
||||||
Russ Cox <rsc@google.com>
|
|
||||||
Russ Rufer <russ@pentad.com>
|
|
||||||
Sean Mcafee <eefacm@gmail.com>
|
|
||||||
Sigurður Ásgeirsson <siggi@google.com>
|
|
||||||
Tracy Bialik <tracy@pentad.com>
|
|
||||||
Vadim Berman <vadimb@google.com>
|
|
||||||
Vlad Losev <vladl@google.com>
|
|
||||||
Zhanyong Wan <wan@google.com>
|
|
@ -1,28 +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.
|
|
@ -1,345 +0,0 @@
|
|||||||
### Generic Build Instructions
|
|
||||||
|
|
||||||
#### Setup
|
|
||||||
|
|
||||||
To build Google Test and your tests that use it, you need to tell your build
|
|
||||||
system where to find its headers and source files. The exact way to do it
|
|
||||||
depends on which build system you use, and is usually straightforward.
|
|
||||||
|
|
||||||
#### Build
|
|
||||||
|
|
||||||
Suppose you put Google Test in directory `${GTEST_DIR}`. To build it, create a
|
|
||||||
library build target (or a project as called by Visual Studio and Xcode) to
|
|
||||||
compile
|
|
||||||
|
|
||||||
${GTEST_DIR}/src/gtest-all.cc
|
|
||||||
|
|
||||||
with `${GTEST_DIR}/include` in the system header search path and `${GTEST_DIR}`
|
|
||||||
in the normal header search path. Assuming a Linux-like system and gcc,
|
|
||||||
something like the following will do:
|
|
||||||
|
|
||||||
g++ -isystem ${GTEST_DIR}/include -I${GTEST_DIR} \
|
|
||||||
-pthread -c ${GTEST_DIR}/src/gtest-all.cc
|
|
||||||
ar -rv libgtest.a gtest-all.o
|
|
||||||
|
|
||||||
(We need `-pthread` as Google Test uses threads.)
|
|
||||||
|
|
||||||
Next, you should compile your test source file with `${GTEST_DIR}/include` in
|
|
||||||
the system header search path, and link it with gtest and any other necessary
|
|
||||||
libraries:
|
|
||||||
|
|
||||||
g++ -isystem ${GTEST_DIR}/include -pthread path/to/your_test.cc libgtest.a \
|
|
||||||
-o your_test
|
|
||||||
|
|
||||||
As an example, the make/ directory contains a Makefile that you can use to build
|
|
||||||
Google Test on systems where GNU make is available (e.g. Linux, Mac OS X, and
|
|
||||||
Cygwin). It doesn't try to build Google Test's own tests. Instead, it just
|
|
||||||
builds the Google Test library and a sample test. You can use it as a starting
|
|
||||||
point for your own build script.
|
|
||||||
|
|
||||||
If the default settings are correct for your environment, the following commands
|
|
||||||
should succeed:
|
|
||||||
|
|
||||||
cd ${GTEST_DIR}/make
|
|
||||||
make
|
|
||||||
./sample1_unittest
|
|
||||||
|
|
||||||
If you see errors, try to tweak the contents of `make/Makefile` to make them go
|
|
||||||
away. There are instructions in `make/Makefile` on how to do it.
|
|
||||||
|
|
||||||
### Using CMake
|
|
||||||
|
|
||||||
Google Test comes with a CMake build script (
|
|
||||||
[CMakeLists.txt](https://github.com/google/googletest/blob/master/CMakeLists.txt))
|
|
||||||
that can be used on a wide range of platforms ("C" stands for cross-platform.).
|
|
||||||
If you don't have CMake installed already, you can download it for free from
|
|
||||||
<http://www.cmake.org/>.
|
|
||||||
|
|
||||||
CMake works by generating native makefiles or build projects that can be used in
|
|
||||||
the compiler environment of your choice. You can either build Google Test as a
|
|
||||||
standalone project or it can be incorporated into an existing CMake build for
|
|
||||||
another project.
|
|
||||||
|
|
||||||
#### Standalone CMake Project
|
|
||||||
|
|
||||||
When building Google Test as a standalone project, the typical workflow starts
|
|
||||||
with:
|
|
||||||
|
|
||||||
mkdir mybuild # Create a directory to hold the build output.
|
|
||||||
cd mybuild
|
|
||||||
cmake ${GTEST_DIR} # Generate native build scripts.
|
|
||||||
|
|
||||||
If you want to build Google Test's samples, you should replace the last command
|
|
||||||
with
|
|
||||||
|
|
||||||
cmake -Dgtest_build_samples=ON ${GTEST_DIR}
|
|
||||||
|
|
||||||
If you are on a \*nix system, you should now see a Makefile in the current
|
|
||||||
directory. Just type 'make' to build gtest.
|
|
||||||
|
|
||||||
If you use Windows and have Visual Studio installed, a `gtest.sln` file and
|
|
||||||
several `.vcproj` files will be created. You can then build them using Visual
|
|
||||||
Studio.
|
|
||||||
|
|
||||||
On Mac OS X with Xcode installed, a `.xcodeproj` file will be generated.
|
|
||||||
|
|
||||||
#### Incorporating Into An Existing CMake Project
|
|
||||||
|
|
||||||
If you want to use gtest in a project which already uses CMake, then a more
|
|
||||||
robust and flexible approach is to build gtest as part of that project directly.
|
|
||||||
This is done by making the GoogleTest source code available to the main build
|
|
||||||
and adding it using CMake's `add_subdirectory()` command. This has the
|
|
||||||
significant advantage that the same compiler and linker settings are used
|
|
||||||
between gtest and the rest of your project, so issues associated with using
|
|
||||||
incompatible libraries (eg debug/release), etc. are avoided. This is
|
|
||||||
particularly useful on Windows. Making GoogleTest's source code available to the
|
|
||||||
main build can be done a few different ways:
|
|
||||||
|
|
||||||
* Download the GoogleTest source code manually and place it at a known
|
|
||||||
location. This is the least flexible approach and can make it more difficult
|
|
||||||
to use with continuous integration systems, etc.
|
|
||||||
* Embed the GoogleTest source code as a direct copy in the main project's
|
|
||||||
source tree. This is often the simplest approach, but is also the hardest to
|
|
||||||
keep up to date. Some organizations may not permit this method.
|
|
||||||
* Add GoogleTest as a git submodule or equivalent. This may not always be
|
|
||||||
possible or appropriate. Git submodules, for example, have their own set of
|
|
||||||
advantages and drawbacks.
|
|
||||||
* Use CMake to download GoogleTest as part of the build's configure step. This
|
|
||||||
is just a little more complex, but doesn't have the limitations of the other
|
|
||||||
methods.
|
|
||||||
|
|
||||||
The last of the above methods is implemented with a small piece of CMake code in
|
|
||||||
a separate file (e.g. `CMakeLists.txt.in`) which is copied to the build area and
|
|
||||||
then invoked as a sub-build _during the CMake stage_. That directory is then
|
|
||||||
pulled into the main build with `add_subdirectory()`. For example:
|
|
||||||
|
|
||||||
New file `CMakeLists.txt.in`:
|
|
||||||
|
|
||||||
``` cmake
|
|
||||||
cmake_minimum_required(VERSION 2.8.2)
|
|
||||||
|
|
||||||
project(googletest-download NONE)
|
|
||||||
|
|
||||||
include(ExternalProject)
|
|
||||||
ExternalProject_Add(googletest
|
|
||||||
GIT_REPOSITORY https://github.com/google/googletest.git
|
|
||||||
GIT_TAG master
|
|
||||||
SOURCE_DIR "${CMAKE_BINARY_DIR}/googletest-src"
|
|
||||||
BINARY_DIR "${CMAKE_BINARY_DIR}/googletest-build"
|
|
||||||
CONFIGURE_COMMAND ""
|
|
||||||
BUILD_COMMAND ""
|
|
||||||
INSTALL_COMMAND ""
|
|
||||||
TEST_COMMAND ""
|
|
||||||
)
|
|
||||||
```
|
|
||||||
|
|
||||||
Existing build's `CMakeLists.txt`:
|
|
||||||
|
|
||||||
``` cmake
|
|
||||||
# Download and unpack googletest at configure time
|
|
||||||
configure_file(CMakeLists.txt.in googletest-download/CMakeLists.txt)
|
|
||||||
execute_process(COMMAND ${CMAKE_COMMAND} -G "${CMAKE_GENERATOR}" .
|
|
||||||
RESULT_VARIABLE result
|
|
||||||
WORKING_DIRECTORY ${CMAKE_BINARY_DIR}/googletest-download )
|
|
||||||
if(result)
|
|
||||||
message(FATAL_ERROR "CMake step for googletest failed: ${result}")
|
|
||||||
endif()
|
|
||||||
execute_process(COMMAND ${CMAKE_COMMAND} --build .
|
|
||||||
RESULT_VARIABLE result
|
|
||||||
WORKING_DIRECTORY ${CMAKE_BINARY_DIR}/googletest-download )
|
|
||||||
if(result)
|
|
||||||
message(FATAL_ERROR "Build step for googletest failed: ${result}")
|
|
||||||
endif()
|
|
||||||
|
|
||||||
# Prevent overriding the parent project's compiler/linker
|
|
||||||
# settings on Windows
|
|
||||||
set(gtest_force_shared_crt ON CACHE BOOL "" FORCE)
|
|
||||||
|
|
||||||
# Add googletest directly to our build. This defines
|
|
||||||
# the gtest and gtest_main targets.
|
|
||||||
add_subdirectory(${CMAKE_BINARY_DIR}/googletest-src
|
|
||||||
${CMAKE_BINARY_DIR}/googletest-build
|
|
||||||
EXCLUDE_FROM_ALL)
|
|
||||||
|
|
||||||
# The gtest/gtest_main targets carry header search path
|
|
||||||
# dependencies automatically when using CMake 2.8.11 or
|
|
||||||
# later. Otherwise we have to add them here ourselves.
|
|
||||||
if (CMAKE_VERSION VERSION_LESS 2.8.11)
|
|
||||||
include_directories("${gtest_SOURCE_DIR}/include")
|
|
||||||
endif()
|
|
||||||
|
|
||||||
# Now simply link against gtest or gtest_main as needed. Eg
|
|
||||||
add_executable(example example.cpp)
|
|
||||||
target_link_libraries(example gtest_main)
|
|
||||||
add_test(NAME example_test COMMAND example)
|
|
||||||
```
|
|
||||||
|
|
||||||
Note that this approach requires CMake 2.8.2 or later due to its use of the
|
|
||||||
`ExternalProject_Add()` command. The above technique is discussed in more detail
|
|
||||||
in [this separate article](http://crascit.com/2015/07/25/cmake-gtest/) which
|
|
||||||
also contains a link to a fully generalized implementation of the technique.
|
|
||||||
|
|
||||||
##### Visual Studio Dynamic vs Static Runtimes
|
|
||||||
|
|
||||||
By default, new Visual Studio projects link the C runtimes dynamically but
|
|
||||||
Google Test links them statically. This will generate an error that looks
|
|
||||||
something like the following: gtest.lib(gtest-all.obj) : error LNK2038: mismatch
|
|
||||||
detected for 'RuntimeLibrary': value 'MTd_StaticDebug' doesn't match value
|
|
||||||
'MDd_DynamicDebug' in main.obj
|
|
||||||
|
|
||||||
Google Test already has a CMake option for this: `gtest_force_shared_crt`
|
|
||||||
|
|
||||||
Enabling this option will make gtest link the runtimes dynamically too, and
|
|
||||||
match the project in which it is included.
|
|
||||||
|
|
||||||
### Legacy Build Scripts
|
|
||||||
|
|
||||||
Before settling on CMake, we have been providing hand-maintained build
|
|
||||||
projects/scripts for Visual Studio, Xcode, and Autotools. While we continue to
|
|
||||||
provide them for convenience, they are not actively maintained any more. We
|
|
||||||
highly recommend that you follow the instructions in the above sections to
|
|
||||||
integrate Google Test with your existing build system.
|
|
||||||
|
|
||||||
If you still need to use the legacy build scripts, here's how:
|
|
||||||
|
|
||||||
The msvc\ folder contains two solutions with Visual C++ projects. Open the
|
|
||||||
`gtest.sln` or `gtest-md.sln` file using Visual Studio, and you are ready to
|
|
||||||
build Google Test the same way you build any Visual Studio project. Files that
|
|
||||||
have names ending with -md use DLL versions of Microsoft runtime libraries (the
|
|
||||||
/MD or the /MDd compiler option). Files without that suffix use static versions
|
|
||||||
of the runtime libraries (the /MT or the /MTd option). Please note that one must
|
|
||||||
use the same option to compile both gtest and the test code. If you use Visual
|
|
||||||
Studio 2005 or above, we recommend the -md version as /MD is the default for new
|
|
||||||
projects in these versions of Visual Studio.
|
|
||||||
|
|
||||||
On Mac OS X, open the `gtest.xcodeproj` in the `xcode/` folder using Xcode.
|
|
||||||
Build the "gtest" target. The universal binary framework will end up in your
|
|
||||||
selected build directory (selected in the Xcode "Preferences..." -> "Building"
|
|
||||||
pane and defaults to xcode/build). Alternatively, at the command line, enter:
|
|
||||||
|
|
||||||
xcodebuild
|
|
||||||
|
|
||||||
This will build the "Release" configuration of gtest.framework in your default
|
|
||||||
build location. See the "xcodebuild" man page for more information about
|
|
||||||
building different configurations and building in different locations.
|
|
||||||
|
|
||||||
If you wish to use the Google Test Xcode project with Xcode 4.x and above, you
|
|
||||||
need to either:
|
|
||||||
|
|
||||||
* update the SDK configuration options in xcode/Config/General.xconfig.
|
|
||||||
Comment options `SDKROOT`, `MACOS_DEPLOYMENT_TARGET`, and `GCC_VERSION`. If
|
|
||||||
you choose this route you lose the ability to target earlier versions of
|
|
||||||
MacOS X.
|
|
||||||
* Install an SDK for an earlier version. This doesn't appear to be supported
|
|
||||||
by Apple, but has been reported to work
|
|
||||||
(http://stackoverflow.com/questions/5378518).
|
|
||||||
|
|
||||||
### Tweaking Google Test
|
|
||||||
|
|
||||||
Google Test can be used in diverse environments. The default configuration may
|
|
||||||
not work (or may not work well) out of the box in some environments. However,
|
|
||||||
you can easily tweak Google Test by defining control macros on the compiler
|
|
||||||
command line. Generally, these macros are named like `GTEST_XYZ` and you define
|
|
||||||
them to either 1 or 0 to enable or disable a certain feature.
|
|
||||||
|
|
||||||
We list the most frequently used macros below. For a complete list, see file
|
|
||||||
[include/gtest/internal/gtest-port.h](https://github.com/google/googletest/blob/master/include/gtest/internal/gtest-port.h).
|
|
||||||
|
|
||||||
### Choosing a TR1 Tuple Library
|
|
||||||
|
|
||||||
Some Google Test features require the C++ Technical Report 1 (TR1) tuple
|
|
||||||
library, which is not yet available with all compilers. The good news is that
|
|
||||||
Google Test implements a subset of TR1 tuple that's enough for its own need, and
|
|
||||||
will automatically use this when the compiler doesn't provide TR1 tuple.
|
|
||||||
|
|
||||||
Usually you don't need to care about which tuple library Google Test uses.
|
|
||||||
However, if your project already uses TR1 tuple, you need to tell Google Test to
|
|
||||||
use the same TR1 tuple library the rest of your project uses, or the two tuple
|
|
||||||
implementations will clash. To do that, add
|
|
||||||
|
|
||||||
-DGTEST_USE_OWN_TR1_TUPLE=0
|
|
||||||
|
|
||||||
to the compiler flags while compiling Google Test and your tests. If you want to
|
|
||||||
force Google Test to use its own tuple library, just add
|
|
||||||
|
|
||||||
-DGTEST_USE_OWN_TR1_TUPLE=1
|
|
||||||
|
|
||||||
to the compiler flags instead.
|
|
||||||
|
|
||||||
If you don't want Google Test to use tuple at all, add
|
|
||||||
|
|
||||||
-DGTEST_HAS_TR1_TUPLE=0
|
|
||||||
|
|
||||||
and all features using tuple will be disabled.
|
|
||||||
|
|
||||||
### Multi-threaded Tests
|
|
||||||
|
|
||||||
Google Test is thread-safe where the pthread library is available. After
|
|
||||||
`#include "gtest/gtest.h"`, you can check the `GTEST_IS_THREADSAFE` macro to see
|
|
||||||
whether this is the case (yes if the macro is `#defined` to 1, no if it's
|
|
||||||
undefined.).
|
|
||||||
|
|
||||||
If Google Test doesn't correctly detect whether pthread is available in your
|
|
||||||
environment, you can force it with
|
|
||||||
|
|
||||||
-DGTEST_HAS_PTHREAD=1
|
|
||||||
|
|
||||||
or
|
|
||||||
|
|
||||||
-DGTEST_HAS_PTHREAD=0
|
|
||||||
|
|
||||||
When Google Test uses pthread, you may need to add flags to your compiler and/or
|
|
||||||
linker to select the pthread library, or you'll get link errors. If you use the
|
|
||||||
CMake script or the deprecated Autotools script, this is taken care of for you.
|
|
||||||
If you use your own build script, you'll need to read your compiler and linker's
|
|
||||||
manual to figure out what flags to add.
|
|
||||||
|
|
||||||
### As a Shared Library (DLL)
|
|
||||||
|
|
||||||
Google Test is compact, so most users can build and link it as a static library
|
|
||||||
for the simplicity. You can choose to use Google Test as a shared library (known
|
|
||||||
as a DLL on Windows) if you prefer.
|
|
||||||
|
|
||||||
To compile *gtest* as a shared library, add
|
|
||||||
|
|
||||||
-DGTEST_CREATE_SHARED_LIBRARY=1
|
|
||||||
|
|
||||||
to the compiler flags. You'll also need to tell the linker to produce a shared
|
|
||||||
library instead - consult your linker's manual for how to do it.
|
|
||||||
|
|
||||||
To compile your *tests* that use the gtest shared library, add
|
|
||||||
|
|
||||||
-DGTEST_LINKED_AS_SHARED_LIBRARY=1
|
|
||||||
|
|
||||||
to the compiler flags.
|
|
||||||
|
|
||||||
Note: while the above steps aren't technically necessary today when using some
|
|
||||||
compilers (e.g. GCC), they may become necessary in the future, if we decide to
|
|
||||||
improve the speed of loading the library (see
|
|
||||||
<http://gcc.gnu.org/wiki/Visibility> for details). Therefore you are recommended
|
|
||||||
to always add the above flags when using Google Test as a shared library.
|
|
||||||
Otherwise a future release of Google Test may break your build script.
|
|
||||||
|
|
||||||
### Avoiding Macro Name Clashes
|
|
||||||
|
|
||||||
In C++, macros don't obey namespaces. Therefore two libraries that both define a
|
|
||||||
macro of the same name will clash if you `#include` both definitions. In case a
|
|
||||||
Google Test macro clashes with another library, you can force Google Test to
|
|
||||||
rename its macro to avoid the conflict.
|
|
||||||
|
|
||||||
Specifically, if both Google Test and some other code define macro FOO, you can
|
|
||||||
add
|
|
||||||
|
|
||||||
-DGTEST_DONT_DEFINE_FOO=1
|
|
||||||
|
|
||||||
to the compiler flags to tell Google Test to change the macro's name from `FOO`
|
|
||||||
to `GTEST_FOO`. Currently `FOO` can be `FAIL`, `SUCCEED`, or `TEST`. For
|
|
||||||
example, with `-DGTEST_DONT_DEFINE_TEST=1`, you'll need to write
|
|
||||||
|
|
||||||
GTEST_TEST(SomeTest, DoesThis) { ... }
|
|
||||||
|
|
||||||
instead of
|
|
||||||
|
|
||||||
TEST(SomeTest, DoesThis) { ... }
|
|
||||||
|
|
||||||
in order to define a test.
|
|
@ -1,344 +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.
|
|
||||||
|
|
||||||
//
|
|
||||||
// The Google C++ Testing and Mocking 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.
|
|
||||||
// GOOGLETEST_CM0001 DO NOT DELETE
|
|
||||||
|
|
||||||
#ifndef GTEST_INCLUDE_GTEST_GTEST_DEATH_TEST_H_
|
|
||||||
#define GTEST_INCLUDE_GTEST_GTEST_DEATH_TEST_H_
|
|
||||||
|
|
||||||
#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
|
|
||||||
|
|
||||||
namespace internal {
|
|
||||||
|
|
||||||
// Returns a Boolean value indicating whether the caller is currently
|
|
||||||
// executing in the context of the death test child process. Tools such as
|
|
||||||
// Valgrind heap checkers may need this to modify their behavior in death
|
|
||||||
// tests. IMPORTANT: This is an internal utility. Using it may break the
|
|
||||||
// implementation of death tests. User code MUST NOT use it.
|
|
||||||
GTEST_API_ bool InDeathTestChild();
|
|
||||||
|
|
||||||
} // namespace internal
|
|
||||||
|
|
||||||
// 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:
|
|
||||||
//
|
|
||||||
// GOOGLETEST_CM0005 DO NOT DELETE
|
|
||||||
// On POSIX-compliant systems (*nix), we use the <regex.h> library,
|
|
||||||
// which uses the POSIX extended regex syntax.
|
|
||||||
//
|
|
||||||
// On other platforms (e.g. Windows or Mac), 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.
|
|
||||||
//
|
|
||||||
// FIXME: 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 && !GTEST_OS_FUCHSIA
|
|
||||||
// Tests that an exit code describes an exit due to termination by a
|
|
||||||
// given signal.
|
|
||||||
// GOOGLETEST_CM0006 DO NOT DELETE
|
|
||||||
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) \
|
|
||||||
GTEST_EXECUTE_STATEMENT_(statement, regex)
|
|
||||||
|
|
||||||
# define ASSERT_DEBUG_DEATH(statement, regex) \
|
|
||||||
GTEST_EXECUTE_STATEMENT_(statement, regex)
|
|
||||||
|
|
||||||
# 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
|
|
||||||
|
|
||||||
// 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. It is exposed publicly so that
|
|
||||||
// systems that have death-tests with stricter requirements than
|
|
||||||
// GTEST_HAS_DEATH_TEST can write their own equivalent of
|
|
||||||
// EXPECT_DEATH_IF_SUPPORTED and ASSERT_DEATH_IF_SUPPORTED.
|
|
||||||
//
|
|
||||||
// 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()
|
|
||||||
|
|
||||||
// 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_
|
|
@ -1,255 +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.
|
|
||||||
|
|
||||||
//
|
|
||||||
// The Google C++ Testing and Mocking 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!
|
|
||||||
|
|
||||||
// GOOGLETEST_CM0001 DO NOT DELETE
|
|
||||||
|
|
||||||
#ifndef GTEST_INCLUDE_GTEST_GTEST_MESSAGE_H_
|
|
||||||
#define GTEST_INCLUDE_GTEST_GTEST_MESSAGE_H_
|
|
||||||
|
|
||||||
#include <limits>
|
|
||||||
|
|
||||||
#include "gtest/internal/gtest-port.h"
|
|
||||||
|
|
||||||
GTEST_DISABLE_MSC_WARNINGS_PUSH_(4251 \
|
|
||||||
/* class A needs to have dll-interface to be used by clients of class B */)
|
|
||||||
|
|
||||||
// Ensures that there is at least one operator<< in the global namespace.
|
|
||||||
// See Message& operator<<(...) below for why.
|
|
||||||
void operator<<(const testing::internal::Secret&, int);
|
|
||||||
|
|
||||||
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.
|
|
||||||
Message();
|
|
||||||
|
|
||||||
// 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 <typename T>
|
|
||||||
inline Message& operator <<(const T& value) {
|
|
||||||
StreamHelper(typename internal::is_pointer<T>::type(), value);
|
|
||||||
return *this;
|
|
||||||
}
|
|
||||||
#else
|
|
||||||
// Streams a non-pointer value to this object.
|
|
||||||
template <typename T>
|
|
||||||
inline Message& operator <<(const T& val) {
|
|
||||||
// Some libraries overload << for STL containers. These
|
|
||||||
// overloads are defined in the global namespace instead of ::std.
|
|
||||||
//
|
|
||||||
// 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. With this using declaration,
|
|
||||||
// overloads of << defined in the global namespace and those
|
|
||||||
// visible via Koenig lookup are both exposed in this function.
|
|
||||||
using ::operator <<;
|
|
||||||
*ss_ << 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 <typename T>
|
|
||||||
inline Message& operator <<(T* const& pointer) { // NOLINT
|
|
||||||
if (pointer == NULL) {
|
|
||||||
*ss_ << "(null)";
|
|
||||||
} else {
|
|
||||||
*ss_ << 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);
|
|
||||||
Message& operator <<(wchar_t* 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 an std::string.
|
|
||||||
// Each '\0' character in the buffer is replaced with "\\0".
|
|
||||||
//
|
|
||||||
// INTERNAL IMPLEMENTATION - DO NOT USE IN A USER PROGRAM.
|
|
||||||
std::string GetString() const;
|
|
||||||
|
|
||||||
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 <typename T>
|
|
||||||
inline void StreamHelper(internal::true_type /*is_pointer*/, T* pointer) {
|
|
||||||
if (pointer == NULL) {
|
|
||||||
*ss_ << "(null)";
|
|
||||||
} else {
|
|
||||||
*ss_ << pointer;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
template <typename T>
|
|
||||||
inline void StreamHelper(internal::false_type /*is_pointer*/,
|
|
||||||
const T& value) {
|
|
||||||
// See the comments in Message& operator <<(const T&) above for why
|
|
||||||
// we need this using statement.
|
|
||||||
using ::operator <<;
|
|
||||||
*ss_ << 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 internal {
|
|
||||||
|
|
||||||
// Converts a streamable value to an std::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".
|
|
||||||
template <typename T>
|
|
||||||
std::string StreamableToString(const T& streamable) {
|
|
||||||
return (Message() << streamable).GetString();
|
|
||||||
}
|
|
||||||
|
|
||||||
} // namespace internal
|
|
||||||
} // namespace testing
|
|
||||||
|
|
||||||
GTEST_DISABLE_MSC_WARNINGS_POP_() // 4251
|
|
||||||
|
|
||||||
#endif // GTEST_INCLUDE_GTEST_GTEST_MESSAGE_H_
|
|
File diff suppressed because it is too large
Load Diff
@ -1,500 +0,0 @@
|
|||||||
$$ -*- mode: c++; -*-
|
|
||||||
$var n = 50 $$ Maximum length of Values arguments we want to support.
|
|
||||||
$var maxtuple = 10 $$ Maximum number of Combine arguments we want to support.
|
|
||||||
// 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.
|
|
||||||
//
|
|
||||||
// Macros and functions for implementing parameterized tests
|
|
||||||
// in Google C++ Testing and Mocking Framework (Google Test)
|
|
||||||
//
|
|
||||||
// This file is generated by a SCRIPT. DO NOT EDIT BY HAND!
|
|
||||||
//
|
|
||||||
// GOOGLETEST_CM0001 DO NOT DELETE
|
|
||||||
#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<T> (see below for
|
|
||||||
// another inheritance scheme that's sometimes useful in more complicated
|
|
||||||
// class hierarchies), where the type of your parameter values.
|
|
||||||
// TestWithParam<T> 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<const char*> {
|
|
||||||
// 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<T> 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<T>, where T is the type of the parameter
|
|
||||||
// values. Inheriting from TestWithParam<T> satisfies that requirement because
|
|
||||||
// TestWithParam<T> 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<int> {
|
|
||||||
// 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
|
|
||||||
|
|
||||||
#include "gtest/internal/gtest-port.h"
|
|
||||||
|
|
||||||
#if !GTEST_OS_SYMBIAN
|
|
||||||
# include <utility>
|
|
||||||
#endif
|
|
||||||
|
|
||||||
#include "gtest/internal/gtest-internal.h"
|
|
||||||
#include "gtest/internal/gtest-param-util.h"
|
|
||||||
#include "gtest/internal/gtest-param-util-generated.h"
|
|
||||||
|
|
||||||
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<int> { ... };
|
|
||||||
//
|
|
||||||
// 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 <typename T, typename IncrementT>
|
|
||||||
internal::ParamGenerator<T> Range(T start, T end, IncrementT step) {
|
|
||||||
return internal::ParamGenerator<T>(
|
|
||||||
new internal::RangeGenerator<T, IncrementT>(start, end, step));
|
|
||||||
}
|
|
||||||
|
|
||||||
template <typename T>
|
|
||||||
internal::ParamGenerator<T> 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, StringTest, 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<char> GetParameterChars() {
|
|
||||||
// ::std::list<char> list;
|
|
||||||
// list.push_back('a');
|
|
||||||
// list.push_back('b');
|
|
||||||
// return list;
|
|
||||||
// }
|
|
||||||
// ::std::list<char> l = GetParameterChars();
|
|
||||||
// INSTANTIATE_TEST_CASE_P(CharSequence2,
|
|
||||||
// CharTest,
|
|
||||||
// ValuesIn(l.begin(), l.end()));
|
|
||||||
//
|
|
||||||
template <typename ForwardIterator>
|
|
||||||
internal::ParamGenerator<
|
|
||||||
typename ::testing::internal::IteratorTraits<ForwardIterator>::value_type>
|
|
||||||
ValuesIn(ForwardIterator begin, ForwardIterator end) {
|
|
||||||
typedef typename ::testing::internal::IteratorTraits<ForwardIterator>
|
|
||||||
::value_type ParamType;
|
|
||||||
return internal::ParamGenerator<ParamType>(
|
|
||||||
new internal::ValuesInIteratorRangeGenerator<ParamType>(begin, end));
|
|
||||||
}
|
|
||||||
|
|
||||||
template <typename T, size_t N>
|
|
||||||
internal::ParamGenerator<T> ValuesIn(const T (&array)[N]) {
|
|
||||||
return ValuesIn(array, array + N);
|
|
||||||
}
|
|
||||||
|
|
||||||
template <class Container>
|
|
||||||
internal::ParamGenerator<typename Container::value_type> 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 $n parameters.
|
|
||||||
//
|
|
||||||
$range i 1..n
|
|
||||||
$for i [[
|
|
||||||
$range j 1..i
|
|
||||||
|
|
||||||
template <$for j, [[typename T$j]]>
|
|
||||||
internal::ValueArray$i<$for j, [[T$j]]> Values($for j, [[T$j v$j]]) {
|
|
||||||
return internal::ValueArray$i<$for j, [[T$j]]>($for j, [[v$j]]);
|
|
||||||
}
|
|
||||||
|
|
||||||
]]
|
|
||||||
|
|
||||||
// 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<bool> {
|
|
||||||
// virtual void SetUp() {
|
|
||||||
// external_flag = GetParam();
|
|
||||||
// }
|
|
||||||
// }
|
|
||||||
// INSTANTIATE_TEST_CASE_P(BoolSequence, FlagDependentTest, Bool());
|
|
||||||
//
|
|
||||||
inline internal::ParamGenerator<bool> 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<T1, T2, ..., TN> where T1, T2, ..., TN are the types
|
|
||||||
// of elements from sequences produces by gen1, gen2, ..., genN.
|
|
||||||
//
|
|
||||||
// Combine can have up to $maxtuple 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<tuple<const char*, Color> > {...};
|
|
||||||
//
|
|
||||||
// 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<tuple<bool, bool> > {
|
|
||||||
// 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()));
|
|
||||||
//
|
|
||||||
$range i 2..maxtuple
|
|
||||||
$for i [[
|
|
||||||
$range j 1..i
|
|
||||||
|
|
||||||
template <$for j, [[typename Generator$j]]>
|
|
||||||
internal::CartesianProductHolder$i<$for j, [[Generator$j]]> Combine(
|
|
||||||
$for j, [[const Generator$j& g$j]]) {
|
|
||||||
return internal::CartesianProductHolder$i<$for j, [[Generator$j]]>(
|
|
||||||
$for j, [[g$j]]);
|
|
||||||
}
|
|
||||||
|
|
||||||
]]
|
|
||||||
# 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>(\
|
|
||||||
#test_case_name, \
|
|
||||||
::testing::internal::CodeLocation(\
|
|
||||||
__FILE__, __LINE__))->AddTestPattern(\
|
|
||||||
GTEST_STRINGIFY_(test_case_name), \
|
|
||||||
GTEST_STRINGIFY_(test_name), \
|
|
||||||
new ::testing::internal::TestMetaFactory< \
|
|
||||||
GTEST_TEST_CLASS_NAME_(\
|
|
||||||
test_case_name, test_name)>()); \
|
|
||||||
return 0; \
|
|
||||||
} \
|
|
||||||
static int gtest_registering_dummy_ GTEST_ATTRIBUTE_UNUSED_; \
|
|
||||||
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()
|
|
||||||
|
|
||||||
// The optional last argument to INSTANTIATE_TEST_CASE_P allows the user
|
|
||||||
// to specify a function or functor that generates custom test name suffixes
|
|
||||||
// based on the test parameters. The function should accept one argument of
|
|
||||||
// type testing::TestParamInfo<class ParamType>, and return std::string.
|
|
||||||
//
|
|
||||||
// testing::PrintToStringParamName is a builtin test suffix generator that
|
|
||||||
// returns the value of testing::PrintToString(GetParam()).
|
|
||||||
//
|
|
||||||
// Note: test names must be non-empty, unique, and may only contain ASCII
|
|
||||||
// alphanumeric characters or underscore. Because PrintToString adds quotes
|
|
||||||
// to std::string and C strings, it won't work for these types.
|
|
||||||
|
|
||||||
# define INSTANTIATE_TEST_CASE_P(prefix, test_case_name, generator, ...) \
|
|
||||||
static ::testing::internal::ParamGenerator<test_case_name::ParamType> \
|
|
||||||
gtest_##prefix##test_case_name##_EvalGenerator_() { return generator; } \
|
|
||||||
static ::std::string gtest_##prefix##test_case_name##_EvalGenerateName_( \
|
|
||||||
const ::testing::TestParamInfo<test_case_name::ParamType>& info) { \
|
|
||||||
return ::testing::internal::GetParamNameGen<test_case_name::ParamType> \
|
|
||||||
(__VA_ARGS__)(info); \
|
|
||||||
} \
|
|
||||||
static int gtest_##prefix##test_case_name##_dummy_ GTEST_ATTRIBUTE_UNUSED_ = \
|
|
||||||
::testing::UnitTest::GetInstance()->parameterized_test_registry(). \
|
|
||||||
GetTestCasePatternHolder<test_case_name>(\
|
|
||||||
#test_case_name, \
|
|
||||||
::testing::internal::CodeLocation(\
|
|
||||||
__FILE__, __LINE__))->AddTestCaseInstantiation(\
|
|
||||||
#prefix, \
|
|
||||||
>est_##prefix##test_case_name##_EvalGenerator_, \
|
|
||||||
>est_##prefix##test_case_name##_EvalGenerateName_, \
|
|
||||||
__FILE__, __LINE__)
|
|
||||||
|
|
||||||
} // namespace testing
|
|
||||||
|
|
||||||
#endif // GTEST_INCLUDE_GTEST_GTEST_PARAM_TEST_H_
|
|
File diff suppressed because it is too large
Load Diff
@ -1,237 +0,0 @@
|
|||||||
// 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.
|
|
||||||
|
|
||||||
//
|
|
||||||
// Utilities for testing Google Test itself and code that uses Google Test
|
|
||||||
// (e.g. frameworks built on top of Google Test).
|
|
||||||
|
|
||||||
// GOOGLETEST_CM0004 DO NOT DELETE
|
|
||||||
|
|
||||||
#ifndef GTEST_INCLUDE_GTEST_GTEST_SPI_H_
|
|
||||||
#define GTEST_INCLUDE_GTEST_GTEST_SPI_H_
|
|
||||||
|
|
||||||
#include "gtest/gtest.h"
|
|
||||||
|
|
||||||
GTEST_DISABLE_MSC_WARNINGS_PUSH_(4251 \
|
|
||||||
/* class A needs to have dll-interface to be used by clients of class B */)
|
|
||||||
|
|
||||||
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 std::string& substr);
|
|
||||||
~SingleFailureChecker();
|
|
||||||
private:
|
|
||||||
const TestPartResultArray* const results_;
|
|
||||||
const TestPartResult::Type type_;
|
|
||||||
const std::string substr_;
|
|
||||||
|
|
||||||
GTEST_DISALLOW_COPY_AND_ASSIGN_(SingleFailureChecker);
|
|
||||||
};
|
|
||||||
|
|
||||||
} // namespace internal
|
|
||||||
|
|
||||||
} // namespace testing
|
|
||||||
|
|
||||||
GTEST_DISABLE_MSC_WARNINGS_POP_() // 4251
|
|
||||||
|
|
||||||
// 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_
|
|
@ -1,183 +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.
|
|
||||||
//
|
|
||||||
// GOOGLETEST_CM0001 DO NOT DELETE
|
|
||||||
|
|
||||||
#ifndef GTEST_INCLUDE_GTEST_GTEST_TEST_PART_H_
|
|
||||||
#define GTEST_INCLUDE_GTEST_GTEST_TEST_PART_H_
|
|
||||||
|
|
||||||
#include <iosfwd>
|
|
||||||
#include <vector>
|
|
||||||
#include "gtest/internal/gtest-internal.h"
|
|
||||||
#include "gtest/internal/gtest-string.h"
|
|
||||||
|
|
||||||
GTEST_DISABLE_MSC_WARNINGS_PUSH_(4251 \
|
|
||||||
/* class A needs to have dll-interface to be used by clients of class B */)
|
|
||||||
|
|
||||||
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 == NULL ? "" : 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_.empty() ? NULL : 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 std::string ExtractSummary(const char* message);
|
|
||||||
|
|
||||||
// The name of the source file where the test part took place, or
|
|
||||||
// "" if the source file is unknown.
|
|
||||||
std::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_;
|
|
||||||
std::string summary_; // The test failure summary.
|
|
||||||
std::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<TestPartResult> array_;
|
|
||||||
|
|
||||||
GTEST_DISALLOW_COPY_AND_ASSIGN_(TestPartResultArray);
|
|
||||||
};
|
|
||||||
|
|
||||||
// This interface knows how to report a test part result.
|
|
||||||
class GTEST_API_ 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
|
|
||||||
|
|
||||||
GTEST_DISABLE_MSC_WARNINGS_POP_() // 4251
|
|
||||||
|
|
||||||
#endif // GTEST_INCLUDE_GTEST_GTEST_TEST_PART_H_
|
|
@ -1,306 +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.
|
|
||||||
|
|
||||||
|
|
||||||
// GOOGLETEST_CM0001 DO NOT DELETE
|
|
||||||
|
|
||||||
#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 <typename T>
|
|
||||||
class FooTest : public testing::Test {
|
|
||||||
public:
|
|
||||||
...
|
|
||||||
typedef std::list<T> 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<char, int, unsigned int> 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) { ... }
|
|
||||||
|
|
||||||
// TYPED_TEST_CASE takes an optional third argument which allows to specify a
|
|
||||||
// class that generates custom test name suffixes based on the type. This should
|
|
||||||
// be a class which has a static template function GetName(int index) returning
|
|
||||||
// a string for each type. The provided integer index equals the index of the
|
|
||||||
// type in the provided type list. In many cases the index can be ignored.
|
|
||||||
//
|
|
||||||
// For example:
|
|
||||||
// class MyTypeNames {
|
|
||||||
// public:
|
|
||||||
// template <typename T>
|
|
||||||
// static std::string GetName(int) {
|
|
||||||
// if (std::is_same<T, char>()) return "char";
|
|
||||||
// if (std::is_same<T, int>()) return "int";
|
|
||||||
// if (std::is_same<T, unsigned int>()) return "unsignedInt";
|
|
||||||
// }
|
|
||||||
// };
|
|
||||||
// TYPED_TEST_CASE(FooTest, MyTypes, MyTypeNames);
|
|
||||||
|
|
||||||
#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 <typename T>
|
|
||||||
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<char, int, unsigned int> 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);
|
|
||||||
//
|
|
||||||
// Similar to the optional argument of TYPED_TEST_CASE above,
|
|
||||||
// INSTANTIATE_TEST_CASE_P takes an optional fourth argument which allows to
|
|
||||||
// generate custom names.
|
|
||||||
// INSTANTIATE_TYPED_TEST_CASE_P(My, FooTest, MyTypes, MyTypeNames);
|
|
||||||
|
|
||||||
#endif // 0
|
|
||||||
|
|
||||||
#include "gtest/internal/gtest-port.h"
|
|
||||||
#include "gtest/internal/gtest-type-util.h"
|
|
||||||
|
|
||||||
// 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##_
|
|
||||||
|
|
||||||
// Expands to the name of the typedef for the NameGenerator, responsible for
|
|
||||||
// creating the suffixes of the name.
|
|
||||||
#define GTEST_NAME_GENERATOR_(TestCaseName) \
|
|
||||||
gtest_type_params_##TestCaseName##_NameGenerator
|
|
||||||
|
|
||||||
// The 'Types' template argument below must have spaces around it
|
|
||||||
// since some compilers may choke on '>>' when passing a template
|
|
||||||
// instance (e.g. Types<int>)
|
|
||||||
# define TYPED_TEST_CASE(CaseName, Types, ...) \
|
|
||||||
typedef ::testing::internal::TypeList< Types >::type GTEST_TYPE_PARAMS_( \
|
|
||||||
CaseName); \
|
|
||||||
typedef ::testing::internal::NameGeneratorSelector<__VA_ARGS__>::type \
|
|
||||||
GTEST_NAME_GENERATOR_(CaseName)
|
|
||||||
|
|
||||||
# define TYPED_TEST(CaseName, TestName) \
|
|
||||||
template <typename gtest_TypeParam_> \
|
|
||||||
class GTEST_TEST_CLASS_NAME_(CaseName, TestName) \
|
|
||||||
: public CaseName<gtest_TypeParam_> { \
|
|
||||||
private: \
|
|
||||||
typedef CaseName<gtest_TypeParam_> TestFixture; \
|
|
||||||
typedef gtest_TypeParam_ TypeParam; \
|
|
||||||
virtual void TestBody(); \
|
|
||||||
}; \
|
|
||||||
static 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("", \
|
|
||||||
::testing::internal::CodeLocation( \
|
|
||||||
__FILE__, __LINE__), \
|
|
||||||
#CaseName, #TestName, 0, \
|
|
||||||
::testing::internal::GenerateNames< \
|
|
||||||
GTEST_NAME_GENERATOR_(CaseName), \
|
|
||||||
GTEST_TYPE_PARAMS_(CaseName)>()); \
|
|
||||||
template <typename gtest_TypeParam_> \
|
|
||||||
void GTEST_TEST_CLASS_NAME_(CaseName, \
|
|
||||||
TestName)<gtest_TypeParam_>::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 <typename gtest_TypeParam_> \
|
|
||||||
class TestName : public CaseName<gtest_TypeParam_> { \
|
|
||||||
private: \
|
|
||||||
typedef CaseName<gtest_TypeParam_> 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 <typename gtest_TypeParam_> \
|
|
||||||
void GTEST_CASE_NAMESPACE_(CaseName)::TestName<gtest_TypeParam_>::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_ATTRIBUTE_UNUSED_ = \
|
|
||||||
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<int>)
|
|
||||||
# define INSTANTIATE_TYPED_TEST_CASE_P(Prefix, CaseName, Types, ...) \
|
|
||||||
static bool gtest_##Prefix##_##CaseName GTEST_ATTRIBUTE_UNUSED_ = \
|
|
||||||
::testing::internal::TypeParameterizedTestCase< \
|
|
||||||
CaseName, GTEST_CASE_NAMESPACE_(CaseName)::gtest_AllTests_, \
|
|
||||||
::testing::internal::TypeList< Types >::type>:: \
|
|
||||||
Register(#Prefix, \
|
|
||||||
::testing::internal::CodeLocation(__FILE__, __LINE__), \
|
|
||||||
>EST_TYPED_TEST_CASE_P_STATE_(CaseName), #CaseName, \
|
|
||||||
GTEST_REGISTERED_TEST_NAMES_(CaseName), \
|
|
||||||
::testing::internal::GenerateNames< \
|
|
||||||
::testing::internal::NameGeneratorSelector< \
|
|
||||||
__VA_ARGS__>::type, \
|
|
||||||
::testing::internal::TypeList< Types >::type>())
|
|
||||||
|
|
||||||
#endif // GTEST_HAS_TYPED_TEST_P
|
|
||||||
|
|
||||||
#endif // GTEST_INCLUDE_GTEST_GTEST_TYPED_TEST_H_
|
|
File diff suppressed because it is too large
Load Diff
@ -1,359 +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.
|
|
||||||
|
|
||||||
// This file is AUTOMATICALLY GENERATED on 01/02/2018 by command
|
|
||||||
// 'gen_gtest_pred_impl.py 5'. DO NOT EDIT BY HAND!
|
|
||||||
//
|
|
||||||
// Implements a family of generic predicate assertion macros.
|
|
||||||
|
|
||||||
// GOOGLETEST_CM0001 DO NOT DELETE
|
|
||||||
|
|
||||||
#ifndef GTEST_INCLUDE_GTEST_GTEST_PRED_IMPL_H_
|
|
||||||
#define GTEST_INCLUDE_GTEST_GTEST_PRED_IMPL_H_
|
|
||||||
|
|
||||||
#include "gtest/gtest.h"
|
|
||||||
|
|
||||||
namespace testing {
|
|
||||||
|
|
||||||
// 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.
|
|
||||||
|
|
||||||
// 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 <typename Pred,
|
|
||||||
typename T1>
|
|
||||||
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 <typename Pred,
|
|
||||||
typename T1,
|
|
||||||
typename T2>
|
|
||||||
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 <typename Pred,
|
|
||||||
typename T1,
|
|
||||||
typename T2,
|
|
||||||
typename T3>
|
|
||||||
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 <typename Pred,
|
|
||||||
typename T1,
|
|
||||||
typename T2,
|
|
||||||
typename T3,
|
|
||||||
typename T4>
|
|
||||||
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 <typename Pred,
|
|
||||||
typename T1,
|
|
||||||
typename T2,
|
|
||||||
typename T3,
|
|
||||||
typename T4,
|
|
||||||
typename T5>
|
|
||||||
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_)
|
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
} // namespace testing
|
|
||||||
|
|
||||||
#endif // GTEST_INCLUDE_GTEST_GTEST_PRED_IMPL_H_
|
|
@ -1,61 +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.
|
|
||||||
|
|
||||||
//
|
|
||||||
// Google C++ Testing and Mocking Framework definitions useful in production code.
|
|
||||||
// GOOGLETEST_CM0003 DO NOT DELETE
|
|
||||||
|
|
||||||
#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 PrivateMethod();
|
|
||||||
// FRIEND_TEST(MyClassTest, PrivateMethodWorks);
|
|
||||||
// };
|
|
||||||
//
|
|
||||||
// class MyClassTest : public testing::Test {
|
|
||||||
// // ...
|
|
||||||
// };
|
|
||||||
//
|
|
||||||
// TEST_F(MyClassTest, PrivateMethodWorks) {
|
|
||||||
// // Can call MyClass::PrivateMethod() here.
|
|
||||||
// }
|
|
||||||
//
|
|
||||||
// Note: The test class must be in the same namespace as the class being tested.
|
|
||||||
// For example, putting MyClassTest in an anonymous namespace will not work.
|
|
||||||
|
|
||||||
#define FRIEND_TEST(test_case_name, test_name)\
|
|
||||||
friend class test_case_name##_##test_name##_Test
|
|
||||||
|
|
||||||
#endif // GTEST_INCLUDE_GTEST_GTEST_PROD_H_
|
|
@ -1,56 +0,0 @@
|
|||||||
# Customization Points
|
|
||||||
|
|
||||||
The custom directory is an injection point for custom user configurations.
|
|
||||||
|
|
||||||
## Header `gtest.h`
|
|
||||||
|
|
||||||
### The following macros can be defined:
|
|
||||||
|
|
||||||
* `GTEST_OS_STACK_TRACE_GETTER_` - The name of an implementation of
|
|
||||||
`OsStackTraceGetterInterface`.
|
|
||||||
* `GTEST_CUSTOM_TEMPDIR_FUNCTION_` - An override for `testing::TempDir()`. See
|
|
||||||
`testing::TempDir` for semantics and signature.
|
|
||||||
|
|
||||||
## Header `gtest-port.h`
|
|
||||||
|
|
||||||
The following macros can be defined:
|
|
||||||
|
|
||||||
### Flag related macros:
|
|
||||||
|
|
||||||
* `GTEST_FLAG(flag_name)`
|
|
||||||
* `GTEST_USE_OWN_FLAGFILE_FLAG_` - Define to 0 when the system provides its
|
|
||||||
own flagfile flag parsing.
|
|
||||||
* `GTEST_DECLARE_bool_(name)`
|
|
||||||
* `GTEST_DECLARE_int32_(name)`
|
|
||||||
* `GTEST_DECLARE_string_(name)`
|
|
||||||
* `GTEST_DEFINE_bool_(name, default_val, doc)`
|
|
||||||
* `GTEST_DEFINE_int32_(name, default_val, doc)`
|
|
||||||
* `GTEST_DEFINE_string_(name, default_val, doc)`
|
|
||||||
|
|
||||||
### Logging:
|
|
||||||
|
|
||||||
* `GTEST_LOG_(severity)`
|
|
||||||
* `GTEST_CHECK_(condition)`
|
|
||||||
* Functions `LogToStderr()` and `FlushInfoLog()` have to be provided too.
|
|
||||||
|
|
||||||
### Threading:
|
|
||||||
|
|
||||||
* `GTEST_HAS_NOTIFICATION_` - Enabled if Notification is already provided.
|
|
||||||
* `GTEST_HAS_MUTEX_AND_THREAD_LOCAL_` - Enabled if `Mutex` and `ThreadLocal`
|
|
||||||
are already provided. Must also provide `GTEST_DECLARE_STATIC_MUTEX_(mutex)`
|
|
||||||
and `GTEST_DEFINE_STATIC_MUTEX_(mutex)`
|
|
||||||
* `GTEST_EXCLUSIVE_LOCK_REQUIRED_(locks)`
|
|
||||||
* `GTEST_LOCK_EXCLUDED_(locks)`
|
|
||||||
|
|
||||||
### Underlying library support features
|
|
||||||
|
|
||||||
* `GTEST_HAS_CXXABI_H_`
|
|
||||||
|
|
||||||
### Exporting API symbols:
|
|
||||||
|
|
||||||
* `GTEST_API_` - Specifier for exported symbols.
|
|
||||||
|
|
||||||
## Header `gtest-printers.h`
|
|
||||||
|
|
||||||
* See documentation at `gtest/gtest-printers.h` for details on how to define a
|
|
||||||
custom printer.
|
|
@ -1,37 +0,0 @@
|
|||||||
// Copyright 2015, 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.
|
|
||||||
//
|
|
||||||
// Injection point for custom user configurations. See README for details
|
|
||||||
//
|
|
||||||
// ** Custom implementation starts here **
|
|
||||||
|
|
||||||
#ifndef GTEST_INCLUDE_GTEST_INTERNAL_CUSTOM_GTEST_PORT_H_
|
|
||||||
#define GTEST_INCLUDE_GTEST_INTERNAL_CUSTOM_GTEST_PORT_H_
|
|
||||||
|
|
||||||
#endif // GTEST_INCLUDE_GTEST_INTERNAL_CUSTOM_GTEST_PORT_H_
|
|
@ -1,42 +0,0 @@
|
|||||||
// Copyright 2015, 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 provides an injection point for custom printers in a local
|
|
||||||
// installation of gTest.
|
|
||||||
// It will be included from gtest-printers.h and the overrides in this file
|
|
||||||
// will be visible to everyone.
|
|
||||||
//
|
|
||||||
// Injection point for custom user configurations. See README for details
|
|
||||||
//
|
|
||||||
// ** Custom implementation starts here **
|
|
||||||
|
|
||||||
#ifndef GTEST_INCLUDE_GTEST_INTERNAL_CUSTOM_GTEST_PRINTERS_H_
|
|
||||||
#define GTEST_INCLUDE_GTEST_INTERNAL_CUSTOM_GTEST_PRINTERS_H_
|
|
||||||
|
|
||||||
#endif // GTEST_INCLUDE_GTEST_INTERNAL_CUSTOM_GTEST_PRINTERS_H_
|
|
@ -1,37 +0,0 @@
|
|||||||
// Copyright 2015, 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.
|
|
||||||
//
|
|
||||||
// Injection point for custom user configurations. See README for details
|
|
||||||
//
|
|
||||||
// ** Custom implementation starts here **
|
|
||||||
|
|
||||||
#ifndef GTEST_INCLUDE_GTEST_INTERNAL_CUSTOM_GTEST_H_
|
|
||||||
#define GTEST_INCLUDE_GTEST_INTERNAL_CUSTOM_GTEST_H_
|
|
||||||
|
|
||||||
#endif // GTEST_INCLUDE_GTEST_INTERNAL_CUSTOM_GTEST_H_
|
|
@ -1,280 +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.
|
|
||||||
//
|
|
||||||
// The Google C++ Testing and Mocking Framework (Google Test)
|
|
||||||
//
|
|
||||||
// This header file defines internal utilities needed for implementing
|
|
||||||
// death tests. They are subject to change without notice.
|
|
||||||
// GOOGLETEST_CM0001 DO NOT DELETE
|
|
||||||
|
|
||||||
#ifndef GTEST_INCLUDE_GTEST_INTERNAL_GTEST_DEATH_TEST_INTERNAL_H_
|
|
||||||
#define GTEST_INCLUDE_GTEST_INTERNAL_GTEST_DEATH_TEST_INTERNAL_H_
|
|
||||||
|
|
||||||
#include "gtest/internal/gtest-internal.h"
|
|
||||||
|
|
||||||
#include <stdio.h>
|
|
||||||
|
|
||||||
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
|
|
||||||
|
|
||||||
GTEST_DISABLE_MSC_WARNINGS_PUSH_(4251 \
|
|
||||||
/* class A needs to have dll-interface to be used by clients of class B */)
|
|
||||||
|
|
||||||
// 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 std::string& message);
|
|
||||||
|
|
||||||
private:
|
|
||||||
// A string containing a description of the outcome of the last death test.
|
|
||||||
static std::string last_death_test_message_;
|
|
||||||
|
|
||||||
GTEST_DISALLOW_COPY_AND_ASSIGN_(DeathTest);
|
|
||||||
};
|
|
||||||
|
|
||||||
GTEST_DISABLE_MSC_WARNINGS_POP_() // 4251
|
|
||||||
|
|
||||||
// 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.
|
|
||||||
|
|
||||||
// This macro is for implementing ASSERT/EXPECT_DEBUG_DEATH when compiled in
|
|
||||||
// NDEBUG mode. In this case we need the statements to be executed and the macro
|
|
||||||
// must accept a streamed message even though the message is never printed.
|
|
||||||
// The regex object is not evaluated, but it is used to prevent "unused"
|
|
||||||
// warnings and to avoid an expression that doesn't compile in debug mode.
|
|
||||||
#define GTEST_EXECUTE_STATEMENT_(statement, regex) \
|
|
||||||
GTEST_AMBIGUOUS_ELSE_BLOCKER_ \
|
|
||||||
if (::testing::internal::AlwaysTrue()) { \
|
|
||||||
GTEST_SUPPRESS_UNREACHABLE_CODE_WARNING_BELOW_(statement); \
|
|
||||||
} else if (!::testing::internal::AlwaysTrue()) { \
|
|
||||||
const ::testing::internal::RE& gtest_regex = (regex); \
|
|
||||||
static_cast<void>(gtest_regex); \
|
|
||||||
} else \
|
|
||||||
::testing::Message()
|
|
||||||
|
|
||||||
// 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 std::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_);
|
|
||||||
}
|
|
||||||
|
|
||||||
const std::string& file() const { return file_; }
|
|
||||||
int line() const { return line_; }
|
|
||||||
int index() const { return index_; }
|
|
||||||
int write_fd() const { return write_fd_; }
|
|
||||||
|
|
||||||
private:
|
|
||||||
std::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();
|
|
||||||
|
|
||||||
#endif // GTEST_HAS_DEATH_TEST
|
|
||||||
|
|
||||||
} // namespace internal
|
|
||||||
} // namespace testing
|
|
||||||
|
|
||||||
#endif // GTEST_INCLUDE_GTEST_INTERNAL_GTEST_DEATH_TEST_INTERNAL_H_
|
|
@ -1,211 +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.
|
|
||||||
//
|
|
||||||
// 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 gtest/internal/gtest-internal.h.
|
|
||||||
// Do not include this header file separately!
|
|
||||||
|
|
||||||
// GOOGLETEST_CM0001 DO NOT DELETE
|
|
||||||
|
|
||||||
#ifndef GTEST_INCLUDE_GTEST_INTERNAL_GTEST_FILEPATH_H_
|
|
||||||
#define GTEST_INCLUDE_GTEST_INTERNAL_GTEST_FILEPATH_H_
|
|
||||||
|
|
||||||
#include "gtest/internal/gtest-string.h"
|
|
||||||
|
|
||||||
GTEST_DISABLE_MSC_WARNINGS_PUSH_(4251 \
|
|
||||||
/* class A needs to have dll-interface to be used by clients of class B */)
|
|
||||||
|
|
||||||
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 std::string& pathname) : pathname_(pathname) {
|
|
||||||
Normalize();
|
|
||||||
}
|
|
||||||
|
|
||||||
FilePath& operator=(const FilePath& rhs) {
|
|
||||||
Set(rhs);
|
|
||||||
return *this;
|
|
||||||
}
|
|
||||||
|
|
||||||
void Set(const FilePath& rhs) {
|
|
||||||
pathname_ = rhs.pathname_;
|
|
||||||
}
|
|
||||||
|
|
||||||
const std::string& string() 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_<number>.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 "".
|
|
||||||
bool IsEmpty() const { return pathname_.empty(); }
|
|
||||||
|
|
||||||
// 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;
|
|
||||||
|
|
||||||
std::string pathname_;
|
|
||||||
}; // class FilePath
|
|
||||||
|
|
||||||
} // namespace internal
|
|
||||||
} // namespace testing
|
|
||||||
|
|
||||||
GTEST_DISABLE_MSC_WARNINGS_POP_() // 4251
|
|
||||||
|
|
||||||
#endif // GTEST_INCLUDE_GTEST_INTERNAL_GTEST_FILEPATH_H_
|
|
File diff suppressed because it is too large
Load Diff
@ -1,243 +0,0 @@
|
|||||||
// 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.
|
|
||||||
//
|
|
||||||
// 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.
|
|
||||||
// FIXME: rename this to safe_linked_ptr to avoid
|
|
||||||
// confusion with normal linked_ptr.
|
|
||||||
|
|
||||||
// GOOGLETEST_CM0001 DO NOT DELETE
|
|
||||||
|
|
||||||
#ifndef GTEST_INCLUDE_GTEST_INTERNAL_GTEST_LINKED_PTR_H_
|
|
||||||
#define GTEST_INCLUDE_GTEST_INTERNAL_GTEST_LINKED_PTR_H_
|
|
||||||
|
|
||||||
#include <stdlib.h>
|
|
||||||
#include <assert.h>
|
|
||||||
|
|
||||||
#include "gtest/internal/gtest-port.h"
|
|
||||||
|
|
||||||
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<Superclass>(obj) vs linked_ptr<Subclass>(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<T>.
|
|
||||||
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<Base>, linked_ptr<Derived1>, and
|
|
||||||
// linked_ptr<Derived2>). 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.
|
|
||||||
void join(linked_ptr_internal const* ptr)
|
|
||||||
GTEST_LOCK_EXCLUDED_(g_linked_ptr_mutex) {
|
|
||||||
MutexLock lock(&g_linked_ptr_mutex);
|
|
||||||
|
|
||||||
linked_ptr_internal const* p = ptr;
|
|
||||||
while (p->next_ != ptr) {
|
|
||||||
assert(p->next_ != this &&
|
|
||||||
"Trying to join() a linked ring we are already in. "
|
|
||||||
"Is GMock thread safety enabled?");
|
|
||||||
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.
|
|
||||||
bool depart()
|
|
||||||
GTEST_LOCK_EXCLUDED_(g_linked_ptr_mutex) {
|
|
||||||
MutexLock lock(&g_linked_ptr_mutex);
|
|
||||||
|
|
||||||
if (next_ == this) return true;
|
|
||||||
linked_ptr_internal const* p = next_;
|
|
||||||
while (p->next_ != this) {
|
|
||||||
assert(p->next_ != next_ &&
|
|
||||||
"Trying to depart() a linked ring we are not in. "
|
|
||||||
"Is GMock thread safety enabled?");
|
|
||||||
p = p->next_;
|
|
||||||
}
|
|
||||||
p->next_ = next_;
|
|
||||||
return false;
|
|
||||||
}
|
|
||||||
|
|
||||||
private:
|
|
||||||
mutable linked_ptr_internal const* next_;
|
|
||||||
};
|
|
||||||
|
|
||||||
template <typename T>
|
|
||||||
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 <typename U> linked_ptr(linked_ptr<U> 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 <typename U> linked_ptr& operator=(linked_ptr<U> 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 <typename U>
|
|
||||||
bool operator==(linked_ptr<U> const& ptr) const {
|
|
||||||
return value_ == ptr.get();
|
|
||||||
}
|
|
||||||
template <typename U>
|
|
||||||
bool operator!=(linked_ptr<U> const& ptr) const {
|
|
||||||
return value_ != ptr.get();
|
|
||||||
}
|
|
||||||
|
|
||||||
private:
|
|
||||||
template <typename U>
|
|
||||||
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 <typename U> void copy(linked_ptr<U> const* ptr) {
|
|
||||||
value_ = ptr->get();
|
|
||||||
if (value_)
|
|
||||||
link_.join(&ptr->link_);
|
|
||||||
else
|
|
||||||
link_.join_new();
|
|
||||||
}
|
|
||||||
};
|
|
||||||
|
|
||||||
template<typename T> inline
|
|
||||||
bool operator==(T* ptr, const linked_ptr<T>& x) {
|
|
||||||
return ptr == x.get();
|
|
||||||
}
|
|
||||||
|
|
||||||
template<typename T> inline
|
|
||||||
bool operator!=(T* ptr, const linked_ptr<T>& x) {
|
|
||||||
return ptr != x.get();
|
|
||||||
}
|
|
||||||
|
|
||||||
// A function to convert T* into linked_ptr<T>
|
|
||||||
// Doing e.g. make_linked_ptr(new FooBarBaz<type>(arg)) is a shorter notation
|
|
||||||
// for linked_ptr<FooBarBaz<type> >(new FooBarBaz<type>(arg))
|
|
||||||
template <typename T>
|
|
||||||
linked_ptr<T> make_linked_ptr(T* ptr) {
|
|
||||||
return linked_ptr<T>(ptr);
|
|
||||||
}
|
|
||||||
|
|
||||||
} // namespace internal
|
|
||||||
} // namespace testing
|
|
||||||
|
|
||||||
#endif // GTEST_INCLUDE_GTEST_INTERNAL_GTEST_LINKED_PTR_H_
|
|
File diff suppressed because it is too large
Load Diff
@ -1,282 +0,0 @@
|
|||||||
$$ -*- mode: c++; -*-
|
|
||||||
$var n = 50 $$ Maximum length of Values arguments we want to support.
|
|
||||||
$var maxtuple = 10 $$ Maximum number of Combine arguments we want to support.
|
|
||||||
// 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.
|
|
||||||
|
|
||||||
|
|
||||||
// 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 $n arguments in Values,
|
|
||||||
// and at most $maxtuple 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 tuple which is
|
|
||||||
// currently set at $maxtuple.
|
|
||||||
|
|
||||||
// GOOGLETEST_CM0001 DO NOT DELETE
|
|
||||||
|
|
||||||
#ifndef GTEST_INCLUDE_GTEST_INTERNAL_GTEST_PARAM_UTIL_GENERATED_H_
|
|
||||||
#define GTEST_INCLUDE_GTEST_INTERNAL_GTEST_PARAM_UTIL_GENERATED_H_
|
|
||||||
|
|
||||||
#include "gtest/internal/gtest-param-util.h"
|
|
||||||
#include "gtest/internal/gtest-port.h"
|
|
||||||
|
|
||||||
namespace testing {
|
|
||||||
|
|
||||||
// Forward declarations of ValuesIn(), which is implemented in
|
|
||||||
// include/gtest/gtest-param-test.h.
|
|
||||||
template <typename ForwardIterator>
|
|
||||||
internal::ParamGenerator<
|
|
||||||
typename ::testing::internal::IteratorTraits<ForwardIterator>::value_type>
|
|
||||||
ValuesIn(ForwardIterator begin, ForwardIterator end);
|
|
||||||
|
|
||||||
template <typename T, size_t N>
|
|
||||||
internal::ParamGenerator<T> ValuesIn(const T (&array)[N]);
|
|
||||||
|
|
||||||
template <class Container>
|
|
||||||
internal::ParamGenerator<typename Container::value_type> ValuesIn(
|
|
||||||
const Container& container);
|
|
||||||
|
|
||||||
namespace internal {
|
|
||||||
|
|
||||||
// Used in the Values() function to provide polymorphic capabilities.
|
|
||||||
$range i 1..n
|
|
||||||
$for i [[
|
|
||||||
$range j 1..i
|
|
||||||
|
|
||||||
template <$for j, [[typename T$j]]>
|
|
||||||
class ValueArray$i {
|
|
||||||
public:
|
|
||||||
$if i==1 [[explicit ]]ValueArray$i($for j, [[T$j v$j]]) : $for j, [[v$(j)_(v$j)]] {}
|
|
||||||
|
|
||||||
template <typename T>
|
|
||||||
operator ParamGenerator<T>() const {
|
|
||||||
const T array[] = {$for j, [[static_cast<T>(v$(j)_)]]};
|
|
||||||
return ValuesIn(array);
|
|
||||||
}
|
|
||||||
|
|
||||||
ValueArray$i(const ValueArray$i& other) : $for j, [[v$(j)_(other.v$(j)_)]] {}
|
|
||||||
|
|
||||||
private:
|
|
||||||
// No implementation - assignment is unsupported.
|
|
||||||
void operator=(const ValueArray$i& other);
|
|
||||||
|
|
||||||
$for j [[
|
|
||||||
|
|
||||||
const T$j v$(j)_;
|
|
||||||
]]
|
|
||||||
|
|
||||||
};
|
|
||||||
|
|
||||||
]]
|
|
||||||
|
|
||||||
# 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.
|
|
||||||
//
|
|
||||||
$range i 2..maxtuple
|
|
||||||
$for i [[
|
|
||||||
$range j 1..i
|
|
||||||
$range k 2..i
|
|
||||||
|
|
||||||
template <$for j, [[typename T$j]]>
|
|
||||||
class CartesianProductGenerator$i
|
|
||||||
: public ParamGeneratorInterface< ::testing::tuple<$for j, [[T$j]]> > {
|
|
||||||
public:
|
|
||||||
typedef ::testing::tuple<$for j, [[T$j]]> ParamType;
|
|
||||||
|
|
||||||
CartesianProductGenerator$i($for j, [[const ParamGenerator<T$j>& g$j]])
|
|
||||||
: $for j, [[g$(j)_(g$j)]] {}
|
|
||||||
virtual ~CartesianProductGenerator$i() {}
|
|
||||||
|
|
||||||
virtual ParamIteratorInterface<ParamType>* Begin() const {
|
|
||||||
return new Iterator(this, $for j, [[g$(j)_, g$(j)_.begin()]]);
|
|
||||||
}
|
|
||||||
virtual ParamIteratorInterface<ParamType>* End() const {
|
|
||||||
return new Iterator(this, $for j, [[g$(j)_, g$(j)_.end()]]);
|
|
||||||
}
|
|
||||||
|
|
||||||
private:
|
|
||||||
class Iterator : public ParamIteratorInterface<ParamType> {
|
|
||||||
public:
|
|
||||||
Iterator(const ParamGeneratorInterface<ParamType>* base, $for j, [[
|
|
||||||
|
|
||||||
const ParamGenerator<T$j>& g$j,
|
|
||||||
const typename ParamGenerator<T$j>::iterator& current$(j)]])
|
|
||||||
: base_(base),
|
|
||||||
$for j, [[
|
|
||||||
|
|
||||||
begin$(j)_(g$j.begin()), end$(j)_(g$j.end()), current$(j)_(current$j)
|
|
||||||
]] {
|
|
||||||
ComputeCurrentValue();
|
|
||||||
}
|
|
||||||
virtual ~Iterator() {}
|
|
||||||
|
|
||||||
virtual const ParamGeneratorInterface<ParamType>* 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());
|
|
||||||
++current$(i)_;
|
|
||||||
|
|
||||||
$for k [[
|
|
||||||
if (current$(i+2-k)_ == end$(i+2-k)_) {
|
|
||||||
current$(i+2-k)_ = begin$(i+2-k)_;
|
|
||||||
++current$(i+2-k-1)_;
|
|
||||||
}
|
|
||||||
|
|
||||||
]]
|
|
||||||
ComputeCurrentValue();
|
|
||||||
}
|
|
||||||
virtual ParamIteratorInterface<ParamType>* Clone() const {
|
|
||||||
return new Iterator(*this);
|
|
||||||
}
|
|
||||||
virtual const ParamType* Current() const { return current_value_.get(); }
|
|
||||||
virtual bool Equals(const ParamIteratorInterface<ParamType>& 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<const Iterator>(&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()) ||
|
|
||||||
($for j && [[
|
|
||||||
|
|
||||||
current$(j)_ == typed_other->current$(j)_
|
|
||||||
]]);
|
|
||||||
}
|
|
||||||
|
|
||||||
private:
|
|
||||||
Iterator(const Iterator& other)
|
|
||||||
: base_(other.base_), $for j, [[
|
|
||||||
|
|
||||||
begin$(j)_(other.begin$(j)_),
|
|
||||||
end$(j)_(other.end$(j)_),
|
|
||||||
current$(j)_(other.current$(j)_)
|
|
||||||
]] {
|
|
||||||
ComputeCurrentValue();
|
|
||||||
}
|
|
||||||
|
|
||||||
void ComputeCurrentValue() {
|
|
||||||
if (!AtEnd())
|
|
||||||
current_value_.reset(new ParamType($for j, [[*current$(j)_]]));
|
|
||||||
}
|
|
||||||
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
|
|
||||||
$for j || [[
|
|
||||||
|
|
||||||
current$(j)_ == end$(j)_
|
|
||||||
]];
|
|
||||||
}
|
|
||||||
|
|
||||||
// No implementation - assignment is unsupported.
|
|
||||||
void operator=(const Iterator& other);
|
|
||||||
|
|
||||||
const ParamGeneratorInterface<ParamType>* const base_;
|
|
||||||
// begin[i]_ and end[i]_ define the i-th range that Iterator traverses.
|
|
||||||
// current[i]_ is the actual traversing iterator.
|
|
||||||
$for j [[
|
|
||||||
|
|
||||||
const typename ParamGenerator<T$j>::iterator begin$(j)_;
|
|
||||||
const typename ParamGenerator<T$j>::iterator end$(j)_;
|
|
||||||
typename ParamGenerator<T$j>::iterator current$(j)_;
|
|
||||||
]]
|
|
||||||
|
|
||||||
linked_ptr<ParamType> current_value_;
|
|
||||||
}; // class CartesianProductGenerator$i::Iterator
|
|
||||||
|
|
||||||
// No implementation - assignment is unsupported.
|
|
||||||
void operator=(const CartesianProductGenerator$i& other);
|
|
||||||
|
|
||||||
|
|
||||||
$for j [[
|
|
||||||
const ParamGenerator<T$j> g$(j)_;
|
|
||||||
|
|
||||||
]]
|
|
||||||
}; // class CartesianProductGenerator$i
|
|
||||||
|
|
||||||
|
|
||||||
]]
|
|
||||||
|
|
||||||
// INTERNAL IMPLEMENTATION - DO NOT USE IN USER CODE.
|
|
||||||
//
|
|
||||||
// Helper classes providing Combine() with polymorphic features. They allow
|
|
||||||
// casting CartesianProductGeneratorN<T> to ParamGenerator<U> if T is
|
|
||||||
// convertible to U.
|
|
||||||
//
|
|
||||||
$range i 2..maxtuple
|
|
||||||
$for i [[
|
|
||||||
$range j 1..i
|
|
||||||
|
|
||||||
template <$for j, [[class Generator$j]]>
|
|
||||||
class CartesianProductHolder$i {
|
|
||||||
public:
|
|
||||||
CartesianProductHolder$i($for j, [[const Generator$j& g$j]])
|
|
||||||
: $for j, [[g$(j)_(g$j)]] {}
|
|
||||||
template <$for j, [[typename T$j]]>
|
|
||||||
operator ParamGenerator< ::testing::tuple<$for j, [[T$j]]> >() const {
|
|
||||||
return ParamGenerator< ::testing::tuple<$for j, [[T$j]]> >(
|
|
||||||
new CartesianProductGenerator$i<$for j, [[T$j]]>(
|
|
||||||
$for j,[[
|
|
||||||
|
|
||||||
static_cast<ParamGenerator<T$j> >(g$(j)_)
|
|
||||||
]]));
|
|
||||||
}
|
|
||||||
|
|
||||||
private:
|
|
||||||
// No implementation - assignment is unsupported.
|
|
||||||
void operator=(const CartesianProductHolder$i& other);
|
|
||||||
|
|
||||||
|
|
||||||
$for j [[
|
|
||||||
const Generator$j g$(j)_;
|
|
||||||
|
|
||||||
]]
|
|
||||||
}; // class CartesianProductHolder$i
|
|
||||||
|
|
||||||
]]
|
|
||||||
|
|
||||||
# endif // GTEST_HAS_COMBINE
|
|
||||||
|
|
||||||
} // namespace internal
|
|
||||||
} // namespace testing
|
|
||||||
|
|
||||||
#endif // GTEST_INCLUDE_GTEST_INTERNAL_GTEST_PARAM_UTIL_GENERATED_H_
|
|
@ -1,724 +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.
|
|
||||||
|
|
||||||
|
|
||||||
// Type and function utilities for implementing parameterized tests.
|
|
||||||
|
|
||||||
// GOOGLETEST_CM0001 DO NOT DELETE
|
|
||||||
|
|
||||||
#ifndef GTEST_INCLUDE_GTEST_INTERNAL_GTEST_PARAM_UTIL_H_
|
|
||||||
#define GTEST_INCLUDE_GTEST_INTERNAL_GTEST_PARAM_UTIL_H_
|
|
||||||
|
|
||||||
#include <ctype.h>
|
|
||||||
|
|
||||||
#include <iterator>
|
|
||||||
#include <set>
|
|
||||||
#include <utility>
|
|
||||||
#include <vector>
|
|
||||||
|
|
||||||
#include "gtest/internal/gtest-internal.h"
|
|
||||||
#include "gtest/internal/gtest-linked_ptr.h"
|
|
||||||
#include "gtest/internal/gtest-port.h"
|
|
||||||
#include "gtest/gtest-printers.h"
|
|
||||||
|
|
||||||
namespace testing {
|
|
||||||
|
|
||||||
// Input to a parameterized test name generator, describing a test parameter.
|
|
||||||
// Consists of the parameter value and the integer parameter index.
|
|
||||||
template <class ParamType>
|
|
||||||
struct TestParamInfo {
|
|
||||||
TestParamInfo(const ParamType& a_param, size_t an_index) :
|
|
||||||
param(a_param),
|
|
||||||
index(an_index) {}
|
|
||||||
ParamType param;
|
|
||||||
size_t index;
|
|
||||||
};
|
|
||||||
|
|
||||||
// A builtin parameterized test name generator which returns the result of
|
|
||||||
// testing::PrintToString.
|
|
||||||
struct PrintToStringParamName {
|
|
||||||
template <class ParamType>
|
|
||||||
std::string operator()(const TestParamInfo<ParamType>& info) const {
|
|
||||||
return PrintToString(info.param);
|
|
||||||
}
|
|
||||||
};
|
|
||||||
|
|
||||||
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,
|
|
||||||
CodeLocation code_location);
|
|
||||||
|
|
||||||
template <typename> class ParamGeneratorInterface;
|
|
||||||
template <typename> class ParamGenerator;
|
|
||||||
|
|
||||||
// Interface for iterating over elements provided by an implementation
|
|
||||||
// of ParamGeneratorInterface<T>.
|
|
||||||
template <typename T>
|
|
||||||
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<T>* 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<T>.
|
|
||||||
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<T>::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<T>::operator==().
|
|
||||||
virtual bool Equals(const ParamIteratorInterface& other) const = 0;
|
|
||||||
};
|
|
||||||
|
|
||||||
// Class iterating over elements provided by an implementation of
|
|
||||||
// ParamGeneratorInterface<T>. It wraps ParamIteratorInterface<T>
|
|
||||||
// and implements the const forward iterator concept.
|
|
||||||
template <typename T>
|
|
||||||
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<T>* 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<T>;
|
|
||||||
explicit ParamIterator(ParamIteratorInterface<T>* impl) : impl_(impl) {}
|
|
||||||
scoped_ptr<ParamIteratorInterface<T> > impl_;
|
|
||||||
};
|
|
||||||
|
|
||||||
// ParamGeneratorInterface<T> is the binary interface to access generators
|
|
||||||
// defined in other translation units.
|
|
||||||
template <typename T>
|
|
||||||
class ParamGeneratorInterface {
|
|
||||||
public:
|
|
||||||
typedef T ParamType;
|
|
||||||
|
|
||||||
virtual ~ParamGeneratorInterface() {}
|
|
||||||
|
|
||||||
// Generator interface definition
|
|
||||||
virtual ParamIteratorInterface<T>* Begin() const = 0;
|
|
||||||
virtual ParamIteratorInterface<T>* End() const = 0;
|
|
||||||
};
|
|
||||||
|
|
||||||
// Wraps ParamGeneratorInterface<T> and provides general generator syntax
|
|
||||||
// compatible with the STL Container concept.
|
|
||||||
// This class implements copy initialization semantics and the contained
|
|
||||||
// ParamGeneratorInterface<T> instance is shared among all copies
|
|
||||||
// of the original object. This is possible because that instance is immutable.
|
|
||||||
template<typename T>
|
|
||||||
class ParamGenerator {
|
|
||||||
public:
|
|
||||||
typedef ParamIterator<T> iterator;
|
|
||||||
|
|
||||||
explicit ParamGenerator(ParamGeneratorInterface<T>* 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<const ParamGeneratorInterface<T> > 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 <typename T, typename IncrementT>
|
|
||||||
class RangeGenerator : public ParamGeneratorInterface<T> {
|
|
||||||
public:
|
|
||||||
RangeGenerator(T begin, T end, IncrementT step)
|
|
||||||
: begin_(begin), end_(end),
|
|
||||||
step_(step), end_index_(CalculateEndIndex(begin, end, step)) {}
|
|
||||||
virtual ~RangeGenerator() {}
|
|
||||||
|
|
||||||
virtual ParamIteratorInterface<T>* Begin() const {
|
|
||||||
return new Iterator(this, begin_, 0, step_);
|
|
||||||
}
|
|
||||||
virtual ParamIteratorInterface<T>* End() const {
|
|
||||||
return new Iterator(this, end_, end_index_, step_);
|
|
||||||
}
|
|
||||||
|
|
||||||
private:
|
|
||||||
class Iterator : public ParamIteratorInterface<T> {
|
|
||||||
public:
|
|
||||||
Iterator(const ParamGeneratorInterface<T>* base, T value, int index,
|
|
||||||
IncrementT step)
|
|
||||||
: base_(base), value_(value), index_(index), step_(step) {}
|
|
||||||
virtual ~Iterator() {}
|
|
||||||
|
|
||||||
virtual const ParamGeneratorInterface<T>* BaseGenerator() const {
|
|
||||||
return base_;
|
|
||||||
}
|
|
||||||
virtual void Advance() {
|
|
||||||
value_ = static_cast<T>(value_ + step_);
|
|
||||||
index_++;
|
|
||||||
}
|
|
||||||
virtual ParamIteratorInterface<T>* Clone() const {
|
|
||||||
return new Iterator(*this);
|
|
||||||
}
|
|
||||||
virtual const T* Current() const { return &value_; }
|
|
||||||
virtual bool Equals(const ParamIteratorInterface<T>& 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<const Iterator>(&other)->index_;
|
|
||||||
return index_ == other_index;
|
|
||||||
}
|
|
||||||
|
|
||||||
private:
|
|
||||||
Iterator(const Iterator& other)
|
|
||||||
: ParamIteratorInterface<T>(),
|
|
||||||
base_(other.base_), value_(other.value_), index_(other.index_),
|
|
||||||
step_(other.step_) {}
|
|
||||||
|
|
||||||
// No implementation - assignment is unsupported.
|
|
||||||
void operator=(const Iterator& other);
|
|
||||||
|
|
||||||
const ParamGeneratorInterface<T>* 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 = static_cast<T>(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 <typename T>
|
|
||||||
class ValuesInIteratorRangeGenerator : public ParamGeneratorInterface<T> {
|
|
||||||
public:
|
|
||||||
template <typename ForwardIterator>
|
|
||||||
ValuesInIteratorRangeGenerator(ForwardIterator begin, ForwardIterator end)
|
|
||||||
: container_(begin, end) {}
|
|
||||||
virtual ~ValuesInIteratorRangeGenerator() {}
|
|
||||||
|
|
||||||
virtual ParamIteratorInterface<T>* Begin() const {
|
|
||||||
return new Iterator(this, container_.begin());
|
|
||||||
}
|
|
||||||
virtual ParamIteratorInterface<T>* End() const {
|
|
||||||
return new Iterator(this, container_.end());
|
|
||||||
}
|
|
||||||
|
|
||||||
private:
|
|
||||||
typedef typename ::std::vector<T> ContainerType;
|
|
||||||
|
|
||||||
class Iterator : public ParamIteratorInterface<T> {
|
|
||||||
public:
|
|
||||||
Iterator(const ParamGeneratorInterface<T>* base,
|
|
||||||
typename ContainerType::const_iterator iterator)
|
|
||||||
: base_(base), iterator_(iterator) {}
|
|
||||||
virtual ~Iterator() {}
|
|
||||||
|
|
||||||
virtual const ParamGeneratorInterface<T>* BaseGenerator() const {
|
|
||||||
return base_;
|
|
||||||
}
|
|
||||||
virtual void Advance() {
|
|
||||||
++iterator_;
|
|
||||||
value_.reset();
|
|
||||||
}
|
|
||||||
virtual ParamIteratorInterface<T>* 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<T>& 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<const Iterator>(&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<T>(),
|
|
||||||
base_(other.base_),
|
|
||||||
iterator_(other.iterator_) {}
|
|
||||||
|
|
||||||
const ParamGeneratorInterface<T>* 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<const T> 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.
|
|
||||||
//
|
|
||||||
// Default parameterized test name generator, returns a string containing the
|
|
||||||
// integer test parameter index.
|
|
||||||
template <class ParamType>
|
|
||||||
std::string DefaultParamName(const TestParamInfo<ParamType>& info) {
|
|
||||||
Message name_stream;
|
|
||||||
name_stream << info.index;
|
|
||||||
return name_stream.GetString();
|
|
||||||
}
|
|
||||||
|
|
||||||
// INTERNAL IMPLEMENTATION - DO NOT USE IN USER CODE.
|
|
||||||
//
|
|
||||||
// Parameterized test name overload helpers, which help the
|
|
||||||
// INSTANTIATE_TEST_CASE_P macro choose between the default parameterized
|
|
||||||
// test name generator and user param name generator.
|
|
||||||
template <class ParamType, class ParamNameGenFunctor>
|
|
||||||
ParamNameGenFunctor GetParamNameGen(ParamNameGenFunctor func) {
|
|
||||||
return func;
|
|
||||||
}
|
|
||||||
|
|
||||||
template <class ParamType>
|
|
||||||
struct ParamNameGenFunc {
|
|
||||||
typedef std::string Type(const TestParamInfo<ParamType>&);
|
|
||||||
};
|
|
||||||
|
|
||||||
template <class ParamType>
|
|
||||||
typename ParamNameGenFunc<ParamType>::Type *GetParamNameGen() {
|
|
||||||
return DefaultParamName;
|
|
||||||
}
|
|
||||||
|
|
||||||
// INTERNAL IMPLEMENTATION - DO NOT USE IN USER CODE.
|
|
||||||
//
|
|
||||||
// Stores a parameter value and later creates tests parameterized with that
|
|
||||||
// value.
|
|
||||||
template <class TestClass>
|
|
||||||
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 ParamType>
|
|
||||||
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 TestCase>
|
|
||||||
class TestMetaFactory
|
|
||||||
: public TestMetaFactoryBase<typename TestCase::ParamType> {
|
|
||||||
public:
|
|
||||||
typedef typename TestCase::ParamType ParamType;
|
|
||||||
|
|
||||||
TestMetaFactory() {}
|
|
||||||
|
|
||||||
virtual TestFactoryBase* CreateTestFactory(ParamType parameter) {
|
|
||||||
return new ParameterizedTestFactory<TestCase>(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 std::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 TestCase>
|
|
||||||
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<ParamType>(GeneratorCreationFunc)();
|
|
||||||
typedef typename ParamNameGenFunc<ParamType>::Type ParamNameGeneratorFunc;
|
|
||||||
|
|
||||||
explicit ParameterizedTestCaseInfo(
|
|
||||||
const char* name, CodeLocation code_location)
|
|
||||||
: test_case_name_(name), code_location_(code_location) {}
|
|
||||||
|
|
||||||
// Test case base name for display purposes.
|
|
||||||
virtual const std::string& GetTestCaseName() const { return test_case_name_; }
|
|
||||||
// Test case id to verify identity.
|
|
||||||
virtual TypeId GetTestCaseTypeId() const { return GetTypeId<TestCase>(); }
|
|
||||||
// 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<ParamType>* meta_factory) {
|
|
||||||
tests_.push_back(linked_ptr<TestInfo>(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 std::string& instantiation_name,
|
|
||||||
GeneratorCreationFunc* func,
|
|
||||||
ParamNameGeneratorFunc* name_func,
|
|
||||||
const char* file, int line) {
|
|
||||||
instantiations_.push_back(
|
|
||||||
InstantiationInfo(instantiation_name, func, name_func, file, line));
|
|
||||||
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<TestInfo> test_info = *test_it;
|
|
||||||
for (typename InstantiationContainer::iterator gen_it =
|
|
||||||
instantiations_.begin(); gen_it != instantiations_.end();
|
|
||||||
++gen_it) {
|
|
||||||
const std::string& instantiation_name = gen_it->name;
|
|
||||||
ParamGenerator<ParamType> generator((*gen_it->generator)());
|
|
||||||
ParamNameGeneratorFunc* name_func = gen_it->name_func;
|
|
||||||
const char* file = gen_it->file;
|
|
||||||
int line = gen_it->line;
|
|
||||||
|
|
||||||
std::string test_case_name;
|
|
||||||
if ( !instantiation_name.empty() )
|
|
||||||
test_case_name = instantiation_name + "/";
|
|
||||||
test_case_name += test_info->test_case_base_name;
|
|
||||||
|
|
||||||
size_t i = 0;
|
|
||||||
std::set<std::string> test_param_names;
|
|
||||||
for (typename ParamGenerator<ParamType>::iterator param_it =
|
|
||||||
generator.begin();
|
|
||||||
param_it != generator.end(); ++param_it, ++i) {
|
|
||||||
Message test_name_stream;
|
|
||||||
|
|
||||||
std::string param_name = name_func(
|
|
||||||
TestParamInfo<ParamType>(*param_it, i));
|
|
||||||
|
|
||||||
GTEST_CHECK_(IsValidParamName(param_name))
|
|
||||||
<< "Parameterized test name '" << param_name
|
|
||||||
<< "' is invalid, in " << file
|
|
||||||
<< " line " << line << std::endl;
|
|
||||||
|
|
||||||
GTEST_CHECK_(test_param_names.count(param_name) == 0)
|
|
||||||
<< "Duplicate parameterized test name '" << param_name
|
|
||||||
<< "', in " << file << " line " << line << std::endl;
|
|
||||||
|
|
||||||
test_param_names.insert(param_name);
|
|
||||||
|
|
||||||
test_name_stream << test_info->test_base_name << "/" << param_name;
|
|
||||||
MakeAndRegisterTestInfo(
|
|
||||||
test_case_name.c_str(),
|
|
||||||
test_name_stream.GetString().c_str(),
|
|
||||||
NULL, // No type parameter.
|
|
||||||
PrintToString(*param_it).c_str(),
|
|
||||||
code_location_,
|
|
||||||
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<ParamType>* 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 std::string test_case_base_name;
|
|
||||||
const std::string test_base_name;
|
|
||||||
const scoped_ptr<TestMetaFactoryBase<ParamType> > test_meta_factory;
|
|
||||||
};
|
|
||||||
typedef ::std::vector<linked_ptr<TestInfo> > TestInfoContainer;
|
|
||||||
// Records data received from INSTANTIATE_TEST_CASE_P macros:
|
|
||||||
// <Instantiation name, Sequence generator creation function,
|
|
||||||
// Name generator function, Source file, Source line>
|
|
||||||
struct InstantiationInfo {
|
|
||||||
InstantiationInfo(const std::string &name_in,
|
|
||||||
GeneratorCreationFunc* generator_in,
|
|
||||||
ParamNameGeneratorFunc* name_func_in,
|
|
||||||
const char* file_in,
|
|
||||||
int line_in)
|
|
||||||
: name(name_in),
|
|
||||||
generator(generator_in),
|
|
||||||
name_func(name_func_in),
|
|
||||||
file(file_in),
|
|
||||||
line(line_in) {}
|
|
||||||
|
|
||||||
std::string name;
|
|
||||||
GeneratorCreationFunc* generator;
|
|
||||||
ParamNameGeneratorFunc* name_func;
|
|
||||||
const char* file;
|
|
||||||
int line;
|
|
||||||
};
|
|
||||||
typedef ::std::vector<InstantiationInfo> InstantiationContainer;
|
|
||||||
|
|
||||||
static bool IsValidParamName(const std::string& name) {
|
|
||||||
// Check for empty string
|
|
||||||
if (name.empty())
|
|
||||||
return false;
|
|
||||||
|
|
||||||
// Check for invalid characters
|
|
||||||
for (std::string::size_type index = 0; index < name.size(); ++index) {
|
|
||||||
if (!isalnum(name[index]) && name[index] != '_')
|
|
||||||
return false;
|
|
||||||
}
|
|
||||||
|
|
||||||
return true;
|
|
||||||
}
|
|
||||||
|
|
||||||
const std::string test_case_name_;
|
|
||||||
CodeLocation code_location_;
|
|
||||||
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 <class TestCase>
|
|
||||||
ParameterizedTestCaseInfo<TestCase>* GetTestCasePatternHolder(
|
|
||||||
const char* test_case_name,
|
|
||||||
CodeLocation code_location) {
|
|
||||||
ParameterizedTestCaseInfo<TestCase>* 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<TestCase>()) {
|
|
||||||
// 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, code_location);
|
|
||||||
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<TestCase> >(*it);
|
|
||||||
}
|
|
||||||
break;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
if (typed_test_info == NULL) {
|
|
||||||
typed_test_info = new ParameterizedTestCaseInfo<TestCase>(
|
|
||||||
test_case_name, code_location);
|
|
||||||
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<ParameterizedTestCaseInfoBase*> TestCaseInfoContainer;
|
|
||||||
|
|
||||||
TestCaseInfoContainer test_case_infos_;
|
|
||||||
|
|
||||||
GTEST_DISALLOW_COPY_AND_ASSIGN_(ParameterizedTestCaseRegistry);
|
|
||||||
};
|
|
||||||
|
|
||||||
} // namespace internal
|
|
||||||
} // namespace testing
|
|
||||||
|
|
||||||
#endif // GTEST_INCLUDE_GTEST_INTERNAL_GTEST_PARAM_UTIL_H_
|
|
@ -1,100 +0,0 @@
|
|||||||
// Copyright 2015, 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.
|
|
||||||
//
|
|
||||||
// The Google C++ Testing and Mocking Framework (Google Test)
|
|
||||||
//
|
|
||||||
// This header file defines the GTEST_OS_* macro.
|
|
||||||
// It is separate from gtest-port.h so that custom/gtest-port.h can include it.
|
|
||||||
|
|
||||||
#ifndef GTEST_INCLUDE_GTEST_INTERNAL_GTEST_PORT_ARCH_H_
|
|
||||||
#define GTEST_INCLUDE_GTEST_INTERNAL_GTEST_PORT_ARCH_H_
|
|
||||||
|
|
||||||
// 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
|
|
||||||
# elif defined(WINAPI_FAMILY)
|
|
||||||
# include <winapifamily.h>
|
|
||||||
# if WINAPI_FAMILY_PARTITION(WINAPI_PARTITION_DESKTOP)
|
|
||||||
# define GTEST_OS_WINDOWS_DESKTOP 1
|
|
||||||
# elif WINAPI_FAMILY_PARTITION(WINAPI_PARTITION_PHONE_APP)
|
|
||||||
# define GTEST_OS_WINDOWS_PHONE 1
|
|
||||||
# elif WINAPI_FAMILY_PARTITION(WINAPI_PARTITION_APP)
|
|
||||||
# define GTEST_OS_WINDOWS_RT 1
|
|
||||||
# elif WINAPI_FAMILY_PARTITION(WINAPI_PARTITION_TV_TITLE)
|
|
||||||
# define GTEST_OS_WINDOWS_PHONE 1
|
|
||||||
# define GTEST_OS_WINDOWS_TV_TITLE 1
|
|
||||||
# else
|
|
||||||
// WINAPI_FAMILY defined but no known partition matched.
|
|
||||||
// Default to desktop.
|
|
||||||
# define GTEST_OS_WINDOWS_DESKTOP 1
|
|
||||||
# endif
|
|
||||||
# else
|
|
||||||
# define GTEST_OS_WINDOWS_DESKTOP 1
|
|
||||||
# endif // _WIN32_WCE
|
|
||||||
#elif defined __APPLE__
|
|
||||||
# define GTEST_OS_MAC 1
|
|
||||||
# if TARGET_OS_IPHONE
|
|
||||||
# define GTEST_OS_IOS 1
|
|
||||||
# endif
|
|
||||||
#elif defined __FreeBSD__
|
|
||||||
# define GTEST_OS_FREEBSD 1
|
|
||||||
#elif defined __Fuchsia__
|
|
||||||
# define GTEST_OS_FUCHSIA 1
|
|
||||||
#elif defined __linux__
|
|
||||||
# define GTEST_OS_LINUX 1
|
|
||||||
# if defined __ANDROID__
|
|
||||||
# define GTEST_OS_LINUX_ANDROID 1
|
|
||||||
# endif
|
|
||||||
#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
|
|
||||||
#elif defined __NetBSD__
|
|
||||||
# define GTEST_OS_NETBSD 1
|
|
||||||
#elif defined __OpenBSD__
|
|
||||||
# define GTEST_OS_OPENBSD 1
|
|
||||||
#elif defined __QNX__
|
|
||||||
# define GTEST_OS_QNX 1
|
|
||||||
#endif // __CYGWIN__
|
|
||||||
|
|
||||||
#endif // GTEST_INCLUDE_GTEST_INTERNAL_GTEST_PORT_ARCH_H_
|
|
File diff suppressed because it is too large
Load Diff
@ -1,167 +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.
|
|
||||||
//
|
|
||||||
// The Google C++ Testing and Mocking 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 gtest-internal.h.
|
|
||||||
// It should not be #included by other files.
|
|
||||||
|
|
||||||
// GOOGLETEST_CM0001 DO NOT DELETE
|
|
||||||
|
|
||||||
#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 <mem.h>
|
|
||||||
#endif
|
|
||||||
|
|
||||||
#include <string.h>
|
|
||||||
#include <string>
|
|
||||||
|
|
||||||
#include "gtest/internal/gtest-port.h"
|
|
||||||
|
|
||||||
namespace testing {
|
|
||||||
namespace internal {
|
|
||||||
|
|
||||||
// String - an abstract class holding static string utilities.
|
|
||||||
class GTEST_API_ String {
|
|
||||||
public:
|
|
||||||
// Static utility methods
|
|
||||||
|
|
||||||
// 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 std::string ShowWideCString(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);
|
|
||||||
|
|
||||||
// Returns true iff the given string ends with the given suffix, ignoring
|
|
||||||
// case. Any string is considered to end with an empty suffix.
|
|
||||||
static bool EndsWithCaseInsensitive(
|
|
||||||
const std::string& str, const std::string& suffix);
|
|
||||||
|
|
||||||
// Formats an int value as "%02d".
|
|
||||||
static std::string FormatIntWidth2(int value); // "%02d" for width == 2
|
|
||||||
|
|
||||||
// Formats an int value as "%X".
|
|
||||||
static std::string FormatHexInt(int value);
|
|
||||||
|
|
||||||
// Formats a byte as "%02X".
|
|
||||||
static std::string FormatByte(unsigned char value);
|
|
||||||
|
|
||||||
private:
|
|
||||||
String(); // Not meant to be instantiated.
|
|
||||||
}; // class String
|
|
||||||
|
|
||||||
// Gets the content of the stringstream's buffer as an std::string. Each '\0'
|
|
||||||
// character in the buffer is replaced with "\\0".
|
|
||||||
GTEST_API_ std::string StringStreamToString(::std::stringstream* stream);
|
|
||||||
|
|
||||||
} // namespace internal
|
|
||||||
} // namespace testing
|
|
||||||
|
|
||||||
#endif // GTEST_INCLUDE_GTEST_INTERNAL_GTEST_STRING_H_
|
|
File diff suppressed because it is too large
Load Diff
@ -1,348 +0,0 @@
|
|||||||
$$ -*- mode: c++; -*-
|
|
||||||
$var n = 10 $$ Maximum number of tuple fields we want to support.
|
|
||||||
$$ This meta comment fixes auto-indentation in Emacs. }}
|
|
||||||
// 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.
|
|
||||||
|
|
||||||
|
|
||||||
// Implements a subset of TR1 tuple needed by Google Test and Google Mock.
|
|
||||||
|
|
||||||
// GOOGLETEST_CM0001 DO NOT DELETE
|
|
||||||
|
|
||||||
#ifndef GTEST_INCLUDE_GTEST_INTERNAL_GTEST_TUPLE_H_
|
|
||||||
#define GTEST_INCLUDE_GTEST_INTERNAL_GTEST_TUPLE_H_
|
|
||||||
|
|
||||||
#include <utility> // 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
|
|
||||||
// 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 <GTEST_$(n)_TYPENAMES_(U)> friend class tuple; \
|
|
||||||
private:
|
|
||||||
#endif
|
|
||||||
|
|
||||||
// Visual Studio 2010, 2012, and 2013 define symbols in std::tr1 that conflict
|
|
||||||
// with our own definitions. Therefore using our own tuple does not work on
|
|
||||||
// those compilers.
|
|
||||||
#if defined(_MSC_VER) && _MSC_VER >= 1600 /* 1600 is Visual Studio 2010 */
|
|
||||||
# error "gtest's tuple doesn't compile on Visual Studio 2010 or later. \
|
|
||||||
GTEST_USE_OWN_TR1_TUPLE must be set to 0 on those compilers."
|
|
||||||
#endif
|
|
||||||
|
|
||||||
|
|
||||||
$range i 0..n-1
|
|
||||||
$range j 0..n
|
|
||||||
$range k 1..n
|
|
||||||
// GTEST_n_TUPLE_(T) is the type of an n-tuple.
|
|
||||||
#define GTEST_0_TUPLE_(T) tuple<>
|
|
||||||
|
|
||||||
$for k [[
|
|
||||||
$range m 0..k-1
|
|
||||||
$range m2 k..n-1
|
|
||||||
#define GTEST_$(k)_TUPLE_(T) tuple<$for m, [[T##$m]]$for m2 [[, void]]>
|
|
||||||
|
|
||||||
]]
|
|
||||||
|
|
||||||
// GTEST_n_TYPENAMES_(T) declares a list of n typenames.
|
|
||||||
|
|
||||||
$for j [[
|
|
||||||
$range m 0..j-1
|
|
||||||
#define GTEST_$(j)_TYPENAMES_(T) $for m, [[typename T##$m]]
|
|
||||||
|
|
||||||
|
|
||||||
]]
|
|
||||||
|
|
||||||
// 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 <$for i, [[typename T$i = void]]>
|
|
||||||
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<T>::type is T if T is a reference; otherwise it's const T&.
|
|
||||||
template <typename T>
|
|
||||||
struct ByRef { typedef const T& type; }; // NOLINT
|
|
||||||
template <typename T>
|
|
||||||
struct ByRef<T&> { typedef T& type; }; // NOLINT
|
|
||||||
|
|
||||||
// A handy wrapper for ByRef.
|
|
||||||
#define GTEST_BY_REF_(T) typename ::std::tr1::gtest_internal::ByRef<T>::type
|
|
||||||
|
|
||||||
// AddRef<T>::type is T if T is a reference; otherwise it's T&. This
|
|
||||||
// is the same as tr1::add_reference<T>::type.
|
|
||||||
template <typename T>
|
|
||||||
struct AddRef { typedef T& type; }; // NOLINT
|
|
||||||
template <typename T>
|
|
||||||
struct AddRef<T&> { typedef T& type; }; // NOLINT
|
|
||||||
|
|
||||||
// A handy wrapper for AddRef.
|
|
||||||
#define GTEST_ADD_REF_(T) typename ::std::tr1::gtest_internal::AddRef<T>::type
|
|
||||||
|
|
||||||
// A helper for implementing get<k>().
|
|
||||||
template <int k> class Get;
|
|
||||||
|
|
||||||
// A helper for implementing tuple_element<k, T>. kIndexValid is true
|
|
||||||
// iff k < the number of fields in tuple type T.
|
|
||||||
template <bool kIndexValid, int kIndex, class Tuple>
|
|
||||||
struct TupleElement;
|
|
||||||
|
|
||||||
|
|
||||||
$for i [[
|
|
||||||
template <GTEST_$(n)_TYPENAMES_(T)>
|
|
||||||
struct TupleElement<true, $i, GTEST_$(n)_TUPLE_(T) > {
|
|
||||||
typedef T$i type;
|
|
||||||
};
|
|
||||||
|
|
||||||
|
|
||||||
]]
|
|
||||||
} // namespace gtest_internal
|
|
||||||
|
|
||||||
template <>
|
|
||||||
class tuple<> {
|
|
||||||
public:
|
|
||||||
tuple() {}
|
|
||||||
tuple(const tuple& /* t */) {}
|
|
||||||
tuple& operator=(const tuple& /* t */) { return *this; }
|
|
||||||
};
|
|
||||||
|
|
||||||
|
|
||||||
$for k [[
|
|
||||||
$range m 0..k-1
|
|
||||||
template <GTEST_$(k)_TYPENAMES_(T)>
|
|
||||||
class $if k < n [[GTEST_$(k)_TUPLE_(T)]] $else [[tuple]] {
|
|
||||||
public:
|
|
||||||
template <int k> friend class gtest_internal::Get;
|
|
||||||
|
|
||||||
tuple() : $for m, [[f$(m)_()]] {}
|
|
||||||
|
|
||||||
explicit tuple($for m, [[GTEST_BY_REF_(T$m) f$m]]) : [[]]
|
|
||||||
$for m, [[f$(m)_(f$m)]] {}
|
|
||||||
|
|
||||||
tuple(const tuple& t) : $for m, [[f$(m)_(t.f$(m)_)]] {}
|
|
||||||
|
|
||||||
template <GTEST_$(k)_TYPENAMES_(U)>
|
|
||||||
tuple(const GTEST_$(k)_TUPLE_(U)& t) : $for m, [[f$(m)_(t.f$(m)_)]] {}
|
|
||||||
|
|
||||||
$if k == 2 [[
|
|
||||||
template <typename U0, typename U1>
|
|
||||||
tuple(const ::std::pair<U0, U1>& p) : f0_(p.first), f1_(p.second) {}
|
|
||||||
|
|
||||||
]]
|
|
||||||
|
|
||||||
tuple& operator=(const tuple& t) { return CopyFrom(t); }
|
|
||||||
|
|
||||||
template <GTEST_$(k)_TYPENAMES_(U)>
|
|
||||||
tuple& operator=(const GTEST_$(k)_TUPLE_(U)& t) {
|
|
||||||
return CopyFrom(t);
|
|
||||||
}
|
|
||||||
|
|
||||||
$if k == 2 [[
|
|
||||||
template <typename U0, typename U1>
|
|
||||||
tuple& operator=(const ::std::pair<U0, U1>& p) {
|
|
||||||
f0_ = p.first;
|
|
||||||
f1_ = p.second;
|
|
||||||
return *this;
|
|
||||||
}
|
|
||||||
|
|
||||||
]]
|
|
||||||
|
|
||||||
GTEST_DECLARE_TUPLE_AS_FRIEND_
|
|
||||||
|
|
||||||
template <GTEST_$(k)_TYPENAMES_(U)>
|
|
||||||
tuple& CopyFrom(const GTEST_$(k)_TUPLE_(U)& t) {
|
|
||||||
|
|
||||||
$for m [[
|
|
||||||
f$(m)_ = t.f$(m)_;
|
|
||||||
|
|
||||||
]]
|
|
||||||
return *this;
|
|
||||||
}
|
|
||||||
|
|
||||||
|
|
||||||
$for m [[
|
|
||||||
T$m f$(m)_;
|
|
||||||
|
|
||||||
]]
|
|
||||||
};
|
|
||||||
|
|
||||||
|
|
||||||
]]
|
|
||||||
// 6.1.3.2 Tuple creation functions.
|
|
||||||
|
|
||||||
// Known limitations: we don't support passing an
|
|
||||||
// std::tr1::reference_wrapper<T> to make_tuple(). And we don't
|
|
||||||
// implement tie().
|
|
||||||
|
|
||||||
inline tuple<> make_tuple() { return tuple<>(); }
|
|
||||||
|
|
||||||
$for k [[
|
|
||||||
$range m 0..k-1
|
|
||||||
|
|
||||||
template <GTEST_$(k)_TYPENAMES_(T)>
|
|
||||||
inline GTEST_$(k)_TUPLE_(T) make_tuple($for m, [[const T$m& f$m]]) {
|
|
||||||
return GTEST_$(k)_TUPLE_(T)($for m, [[f$m]]);
|
|
||||||
}
|
|
||||||
|
|
||||||
]]
|
|
||||||
|
|
||||||
// 6.1.3.3 Tuple helper classes.
|
|
||||||
|
|
||||||
template <typename Tuple> struct tuple_size;
|
|
||||||
|
|
||||||
|
|
||||||
$for j [[
|
|
||||||
template <GTEST_$(j)_TYPENAMES_(T)>
|
|
||||||
struct tuple_size<GTEST_$(j)_TUPLE_(T) > {
|
|
||||||
static const int value = $j;
|
|
||||||
};
|
|
||||||
|
|
||||||
|
|
||||||
]]
|
|
||||||
template <int k, class Tuple>
|
|
||||||
struct tuple_element {
|
|
||||||
typedef typename gtest_internal::TupleElement<
|
|
||||||
k < (tuple_size<Tuple>::value), k, Tuple>::type type;
|
|
||||||
};
|
|
||||||
|
|
||||||
#define GTEST_TUPLE_ELEMENT_(k, Tuple) typename tuple_element<k, Tuple >::type
|
|
||||||
|
|
||||||
// 6.1.3.4 Element access.
|
|
||||||
|
|
||||||
namespace gtest_internal {
|
|
||||||
|
|
||||||
|
|
||||||
$for i [[
|
|
||||||
template <>
|
|
||||||
class Get<$i> {
|
|
||||||
public:
|
|
||||||
template <class Tuple>
|
|
||||||
static GTEST_ADD_REF_(GTEST_TUPLE_ELEMENT_($i, Tuple))
|
|
||||||
Field(Tuple& t) { return t.f$(i)_; } // NOLINT
|
|
||||||
|
|
||||||
template <class Tuple>
|
|
||||||
static GTEST_BY_REF_(GTEST_TUPLE_ELEMENT_($i, Tuple))
|
|
||||||
ConstField(const Tuple& t) { return t.f$(i)_; }
|
|
||||||
};
|
|
||||||
|
|
||||||
|
|
||||||
]]
|
|
||||||
} // namespace gtest_internal
|
|
||||||
|
|
||||||
template <int k, GTEST_$(n)_TYPENAMES_(T)>
|
|
||||||
GTEST_ADD_REF_(GTEST_TUPLE_ELEMENT_(k, GTEST_$(n)_TUPLE_(T)))
|
|
||||||
get(GTEST_$(n)_TUPLE_(T)& t) {
|
|
||||||
return gtest_internal::Get<k>::Field(t);
|
|
||||||
}
|
|
||||||
|
|
||||||
template <int k, GTEST_$(n)_TYPENAMES_(T)>
|
|
||||||
GTEST_BY_REF_(GTEST_TUPLE_ELEMENT_(k, GTEST_$(n)_TUPLE_(T)))
|
|
||||||
get(const GTEST_$(n)_TUPLE_(T)& t) {
|
|
||||||
return gtest_internal::Get<k>::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<k, k>::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 <int kSize1, int kSize2>
|
|
||||||
struct SameSizeTuplePrefixComparator;
|
|
||||||
|
|
||||||
template <>
|
|
||||||
struct SameSizeTuplePrefixComparator<0, 0> {
|
|
||||||
template <class Tuple1, class Tuple2>
|
|
||||||
static bool Eq(const Tuple1& /* t1 */, const Tuple2& /* t2 */) {
|
|
||||||
return true;
|
|
||||||
}
|
|
||||||
};
|
|
||||||
|
|
||||||
template <int k>
|
|
||||||
struct SameSizeTuplePrefixComparator<k, k> {
|
|
||||||
template <class Tuple1, class Tuple2>
|
|
||||||
static bool Eq(const Tuple1& t1, const Tuple2& t2) {
|
|
||||||
return SameSizeTuplePrefixComparator<k - 1, k - 1>::Eq(t1, t2) &&
|
|
||||||
::std::tr1::get<k - 1>(t1) == ::std::tr1::get<k - 1>(t2);
|
|
||||||
}
|
|
||||||
};
|
|
||||||
|
|
||||||
} // namespace gtest_internal
|
|
||||||
|
|
||||||
template <GTEST_$(n)_TYPENAMES_(T), GTEST_$(n)_TYPENAMES_(U)>
|
|
||||||
inline bool operator==(const GTEST_$(n)_TUPLE_(T)& t,
|
|
||||||
const GTEST_$(n)_TUPLE_(U)& u) {
|
|
||||||
return gtest_internal::SameSizeTuplePrefixComparator<
|
|
||||||
tuple_size<GTEST_$(n)_TUPLE_(T) >::value,
|
|
||||||
tuple_size<GTEST_$(n)_TUPLE_(U) >::value>::Eq(t, u);
|
|
||||||
}
|
|
||||||
|
|
||||||
template <GTEST_$(n)_TYPENAMES_(T), GTEST_$(n)_TYPENAMES_(U)>
|
|
||||||
inline bool operator!=(const GTEST_$(n)_TUPLE_(T)& t,
|
|
||||||
const GTEST_$(n)_TUPLE_(U)& u) { return !(t == u); }
|
|
||||||
|
|
||||||
// 6.1.4 Pairs.
|
|
||||||
// Unimplemented.
|
|
||||||
|
|
||||||
} // namespace tr1
|
|
||||||
} // namespace std
|
|
||||||
|
|
||||||
|
|
||||||
$for j [[
|
|
||||||
#undef GTEST_$(j)_TUPLE_
|
|
||||||
|
|
||||||
]]
|
|
||||||
|
|
||||||
|
|
||||||
$for j [[
|
|
||||||
#undef GTEST_$(j)_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_
|
|
File diff suppressed because it is too large
Load Diff
@ -1,314 +0,0 @@
|
|||||||
$$ -*- mode: c++; -*-
|
|
||||||
$var n = 50 $$ Maximum length of type lists we want to support.
|
|
||||||
// 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.
|
|
||||||
|
|
||||||
|
|
||||||
// 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 $n types in a list, and at most $n
|
|
||||||
// type-parameterized tests in one type-parameterized test case.
|
|
||||||
// Please contact googletestframework@googlegroups.com if you need
|
|
||||||
// more.
|
|
||||||
|
|
||||||
// GOOGLETEST_CM0001 DO NOT DELETE
|
|
||||||
|
|
||||||
#ifndef GTEST_INCLUDE_GTEST_INTERNAL_GTEST_TYPE_UTIL_H_
|
|
||||||
#define GTEST_INCLUDE_GTEST_INTERNAL_GTEST_TYPE_UTIL_H_
|
|
||||||
|
|
||||||
#include "gtest/internal/gtest-port.h"
|
|
||||||
|
|
||||||
// #ifdef __GNUC__ is too general here. It is possible to use gcc without using
|
|
||||||
// libstdc++ (which is where cxxabi.h comes from).
|
|
||||||
# if GTEST_HAS_CXXABI_H_
|
|
||||||
# include <cxxabi.h>
|
|
||||||
# elif defined(__HP_aCC)
|
|
||||||
# include <acxx_demangle.h>
|
|
||||||
# endif // GTEST_HASH_CXXABI_H_
|
|
||||||
|
|
||||||
namespace testing {
|
|
||||||
namespace internal {
|
|
||||||
|
|
||||||
// Canonicalizes a given name with respect to the Standard C++ Library.
|
|
||||||
// This handles removing the inline namespace within `std` that is
|
|
||||||
// used by various standard libraries (e.g., `std::__1`). Names outside
|
|
||||||
// of namespace std are returned unmodified.
|
|
||||||
inline std::string CanonicalizeForStdLibVersioning(std::string s) {
|
|
||||||
static const char prefix[] = "std::__";
|
|
||||||
if (s.compare(0, strlen(prefix), prefix) == 0) {
|
|
||||||
std::string::size_type end = s.find("::", strlen(prefix));
|
|
||||||
if (end != s.npos) {
|
|
||||||
// Erase everything between the initial `std` and the second `::`.
|
|
||||||
s.erase(strlen("std"), end - strlen("std"));
|
|
||||||
}
|
|
||||||
}
|
|
||||||
return s;
|
|
||||||
}
|
|
||||||
|
|
||||||
// GetTypeName<T>() 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 <typename T>
|
|
||||||
std::string GetTypeName() {
|
|
||||||
# if GTEST_HAS_RTTI
|
|
||||||
|
|
||||||
const char* const name = typeid(T).name();
|
|
||||||
# if GTEST_HAS_CXXABI_H_ || defined(__HP_aCC)
|
|
||||||
int status = 0;
|
|
||||||
// gcc's implementation of typeid(T).name() mangles the type name,
|
|
||||||
// so we have to demangle it.
|
|
||||||
# if GTEST_HAS_CXXABI_H_
|
|
||||||
using abi::__cxa_demangle;
|
|
||||||
# endif // GTEST_HAS_CXXABI_H_
|
|
||||||
char* const readable_name = __cxa_demangle(name, 0, 0, &status);
|
|
||||||
const std::string name_str(status == 0 ? readable_name : name);
|
|
||||||
free(readable_name);
|
|
||||||
return CanonicalizeForStdLibVersioning(name_str);
|
|
||||||
# else
|
|
||||||
return name;
|
|
||||||
# endif // GTEST_HAS_CXXABI_H_ || __HP_aCC
|
|
||||||
|
|
||||||
# else
|
|
||||||
|
|
||||||
return "<type>";
|
|
||||||
|
|
||||||
# endif // GTEST_HAS_RTTI
|
|
||||||
}
|
|
||||||
|
|
||||||
#if GTEST_HAS_TYPED_TEST || GTEST_HAS_TYPED_TEST_P
|
|
||||||
|
|
||||||
// AssertyTypeEq<T1, T2>::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 <typename T1, typename T2>
|
|
||||||
struct AssertTypeEq;
|
|
||||||
|
|
||||||
template <typename T>
|
|
||||||
struct AssertTypeEq<T, T> {
|
|
||||||
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<int>, Type<int, double>, 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<T1, T2, ..., TN>
|
|
||||||
// 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 <typename T1>
|
|
||||||
struct Types1 {
|
|
||||||
typedef T1 Head;
|
|
||||||
typedef Types0 Tail;
|
|
||||||
};
|
|
||||||
|
|
||||||
$range i 2..n
|
|
||||||
|
|
||||||
$for i [[
|
|
||||||
$range j 1..i
|
|
||||||
$range k 2..i
|
|
||||||
template <$for j, [[typename T$j]]>
|
|
||||||
struct Types$i {
|
|
||||||
typedef T1 Head;
|
|
||||||
typedef Types$(i-1)<$for k, [[T$k]]> 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<int>
|
|
||||||
// will appear as Types<int, None, None, ..., None> in the compiler
|
|
||||||
// errors).
|
|
||||||
//
|
|
||||||
// Our solution is to combine the best part of the two approaches: a
|
|
||||||
// user would write Types<T1, ..., TN>, and Google Test will translate
|
|
||||||
// that to TypesN<T1, ..., TN> internally to make error messages
|
|
||||||
// readable. The translation is done by the 'type' member of the
|
|
||||||
// Types template.
|
|
||||||
|
|
||||||
$range i 1..n
|
|
||||||
template <$for i, [[typename T$i = internal::None]]>
|
|
||||||
struct Types {
|
|
||||||
typedef internal::Types$n<$for i, [[T$i]]> type;
|
|
||||||
};
|
|
||||||
|
|
||||||
template <>
|
|
||||||
struct Types<$for i, [[internal::None]]> {
|
|
||||||
typedef internal::Types0 type;
|
|
||||||
};
|
|
||||||
|
|
||||||
$range i 1..n-1
|
|
||||||
$for i [[
|
|
||||||
$range j 1..i
|
|
||||||
$range k i+1..n
|
|
||||||
template <$for j, [[typename T$j]]>
|
|
||||||
struct Types<$for j, [[T$j]]$for k[[, internal::None]]> {
|
|
||||||
typedef internal::Types$i<$for j, [[T$j]]> type;
|
|
||||||
};
|
|
||||||
|
|
||||||
]]
|
|
||||||
|
|
||||||
namespace internal {
|
|
||||||
|
|
||||||
# define GTEST_TEMPLATE_ template <typename T> class
|
|
||||||
|
|
||||||
// The template "selector" struct TemplateSel<Tmpl> is used to
|
|
||||||
// represent Tmpl, which must be a class template with one type
|
|
||||||
// parameter, as a type. TemplateSel<Tmpl>::Bind<T>::type is defined
|
|
||||||
// as the type Tmpl<T>. This allows us to actually instantiate the
|
|
||||||
// template "selected" by TemplateSel<Tmpl>.
|
|
||||||
//
|
|
||||||
// This trick is necessary for simulating typedef for class templates,
|
|
||||||
// which C++ doesn't support directly.
|
|
||||||
template <GTEST_TEMPLATE_ Tmpl>
|
|
||||||
struct TemplateSel {
|
|
||||||
template <typename T>
|
|
||||||
struct Bind {
|
|
||||||
typedef Tmpl<T> type;
|
|
||||||
};
|
|
||||||
};
|
|
||||||
|
|
||||||
# define GTEST_BIND_(TmplSel, T) \
|
|
||||||
TmplSel::template Bind<T>::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<int>, Templates<int, double>,
|
|
||||||
// and etc), which C++ doesn't support directly.
|
|
||||||
template <typename T>
|
|
||||||
struct NoneT {};
|
|
||||||
|
|
||||||
// The following family of struct and struct templates are used to
|
|
||||||
// represent template lists. In particular, TemplatesN<T1, T2, ...,
|
|
||||||
// TN> 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 <GTEST_TEMPLATE_ T1>
|
|
||||||
struct Templates1 {
|
|
||||||
typedef TemplateSel<T1> Head;
|
|
||||||
typedef Templates0 Tail;
|
|
||||||
};
|
|
||||||
|
|
||||||
$range i 2..n
|
|
||||||
|
|
||||||
$for i [[
|
|
||||||
$range j 1..i
|
|
||||||
$range k 2..i
|
|
||||||
template <$for j, [[GTEST_TEMPLATE_ T$j]]>
|
|
||||||
struct Templates$i {
|
|
||||||
typedef TemplateSel<T1> Head;
|
|
||||||
typedef Templates$(i-1)<$for k, [[T$k]]> 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<list>
|
|
||||||
// will appear as Templates<list, NoneT, NoneT, ..., NoneT> in the compiler
|
|
||||||
// errors).
|
|
||||||
//
|
|
||||||
// Our solution is to combine the best part of the two approaches: a
|
|
||||||
// user would write Templates<T1, ..., TN>, and Google Test will translate
|
|
||||||
// that to TemplatesN<T1, ..., TN> internally to make error messages
|
|
||||||
// readable. The translation is done by the 'type' member of the
|
|
||||||
// Templates template.
|
|
||||||
|
|
||||||
$range i 1..n
|
|
||||||
template <$for i, [[GTEST_TEMPLATE_ T$i = NoneT]]>
|
|
||||||
struct Templates {
|
|
||||||
typedef Templates$n<$for i, [[T$i]]> type;
|
|
||||||
};
|
|
||||||
|
|
||||||
template <>
|
|
||||||
struct Templates<$for i, [[NoneT]]> {
|
|
||||||
typedef Templates0 type;
|
|
||||||
};
|
|
||||||
|
|
||||||
$range i 1..n-1
|
|
||||||
$for i [[
|
|
||||||
$range j 1..i
|
|
||||||
$range k i+1..n
|
|
||||||
template <$for j, [[GTEST_TEMPLATE_ T$j]]>
|
|
||||||
struct Templates<$for j, [[T$j]]$for k[[, NoneT]]> {
|
|
||||||
typedef Templates$i<$for j, [[T$j]]> 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 <typename T>
|
|
||||||
struct TypeList {
|
|
||||||
typedef Types1<T> type;
|
|
||||||
};
|
|
||||||
|
|
||||||
|
|
||||||
$range i 1..n
|
|
||||||
template <$for i, [[typename T$i]]>
|
|
||||||
struct TypeList<Types<$for i, [[T$i]]> > {
|
|
||||||
typedef typename Types<$for i, [[T$i]]>::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_
|
|
@ -1,47 +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.
|
|
||||||
|
|
||||||
//
|
|
||||||
// Google C++ Testing and Mocking 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.
|
|
||||||
#include "src/gtest.cc"
|
|
||||||
#include "src/gtest-death-test.cc"
|
|
||||||
#include "src/gtest-filepath.cc"
|
|
||||||
#include "src/gtest-port.cc"
|
|
||||||
#include "src/gtest-printers.cc"
|
|
||||||
#include "src/gtest-test-part.cc"
|
|
||||||
#include "src/gtest-typed-test.cc"
|
|
File diff suppressed because it is too large
Load Diff
@ -1,385 +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.
|
|
||||||
|
|
||||||
#include "gtest/internal/gtest-filepath.h"
|
|
||||||
|
|
||||||
#include <stdlib.h>
|
|
||||||
#include "gtest/internal/gtest-port.h"
|
|
||||||
#include "gtest/gtest-message.h"
|
|
||||||
|
|
||||||
#if GTEST_OS_WINDOWS_MOBILE
|
|
||||||
# include <windows.h>
|
|
||||||
#elif GTEST_OS_WINDOWS
|
|
||||||
# include <direct.h>
|
|
||||||
# include <io.h>
|
|
||||||
#elif GTEST_OS_SYMBIAN
|
|
||||||
// Symbian OpenC has PATH_MAX in sys/syslimits.h
|
|
||||||
# include <sys/syslimits.h>
|
|
||||||
#else
|
|
||||||
# include <limits.h>
|
|
||||||
# include <climits> // Some Linux distributions define PATH_MAX here.
|
|
||||||
#endif // GTEST_OS_WINDOWS_MOBILE
|
|
||||||
|
|
||||||
#include "gtest/internal/gtest-string.h"
|
|
||||||
|
|
||||||
#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 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 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 || GTEST_OS_WINDOWS_PHONE || GTEST_OS_WINDOWS_RT
|
|
||||||
// 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' };
|
|
||||||
char* result = getcwd(cwd, sizeof(cwd));
|
|
||||||
# if GTEST_OS_NACL
|
|
||||||
// getcwd will likely fail in NaCl due to the sandbox, so return something
|
|
||||||
// reasonable. The user may have provided a shim implementation for getcwd,
|
|
||||||
// however, so fallback only when failure is detected.
|
|
||||||
return FilePath(result == NULL ? kCurrentDirectoryString : cwd);
|
|
||||||
# endif // GTEST_OS_NACL
|
|
||||||
return FilePath(result == 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 {
|
|
||||||
const std::string dot_extension = std::string(".") + extension;
|
|
||||||
if (String::EndsWithCaseInsensitive(pathname_, dot_extension)) {
|
|
||||||
return FilePath(pathname_.substr(
|
|
||||||
0, pathname_.length() - dot_extension.length()));
|
|
||||||
}
|
|
||||||
return *this;
|
|
||||||
}
|
|
||||||
|
|
||||||
// Returns a pointer to the last occurrence 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(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();
|
|
||||||
std::string dir;
|
|
||||||
if (last_sep) {
|
|
||||||
dir = std::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) {
|
|
||||||
std::string file;
|
|
||||||
if (number == 0) {
|
|
||||||
file = base_name.string() + "." + extension;
|
|
||||||
} else {
|
|
||||||
file = base_name.string() + "_" + StreamableToString(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(dir.string() + kPathSeparator + relative_path.string());
|
|
||||||
}
|
|
||||||
|
|
||||||
// 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
|
|
||||||
// FIXME: 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_<number>.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(pathname_.substr(0, 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 "..".
|
|
||||||
// FIXME: 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
|
|
File diff suppressed because it is too large
Load Diff
File diff suppressed because it is too large
Load Diff
@ -1,457 +0,0 @@
|
|||||||
// 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.
|
|
||||||
|
|
||||||
|
|
||||||
// Google Test - The Google C++ Testing and Mocking Framework
|
|
||||||
//
|
|
||||||
// This file implements a universal value printer that can print a
|
|
||||||
// value of any type T:
|
|
||||||
//
|
|
||||||
// void ::testing::internal::UniversalPrinter<T>::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 "gtest/gtest-printers.h"
|
|
||||||
#include <stdio.h>
|
|
||||||
#include <cctype>
|
|
||||||
#include <cwchar>
|
|
||||||
#include <ostream> // NOLINT
|
|
||||||
#include <string>
|
|
||||||
#include "gtest/internal/gtest-port.h"
|
|
||||||
#include "src/gtest-internal-inl.h"
|
|
||||||
|
|
||||||
namespace testing {
|
|
||||||
|
|
||||||
namespace {
|
|
||||||
|
|
||||||
using ::std::ostream;
|
|
||||||
|
|
||||||
// Prints a segment of bytes in the given object.
|
|
||||||
GTEST_ATTRIBUTE_NO_SANITIZE_MEMORY_
|
|
||||||
GTEST_ATTRIBUTE_NO_SANITIZE_ADDRESS_
|
|
||||||
GTEST_ATTRIBUTE_NO_SANITIZE_THREAD_
|
|
||||||
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 << '-';
|
|
||||||
}
|
|
||||||
GTEST_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.
|
|
||||||
// FIXME: 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 hexadecimal 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 <typename UnsignedChar, typename Char>
|
|
||||||
static CharFormat PrintAsCharLiteralTo(Char c, ostream* os) {
|
|
||||||
switch (static_cast<wchar_t>(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<char>(c);
|
|
||||||
return kAsIs;
|
|
||||||
} else {
|
|
||||||
ostream::fmtflags flags = os->flags();
|
|
||||||
*os << "\\x" << std::hex << std::uppercase
|
|
||||||
<< static_cast<int>(static_cast<UnsignedChar>(c));
|
|
||||||
os->flags(flags);
|
|
||||||
return kHexEscape;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
return kSpecialEscape;
|
|
||||||
}
|
|
||||||
|
|
||||||
// Prints a wchar_t c as if it's part of a string literal, escaping it when
|
|
||||||
// necessary; returns how c was formatted.
|
|
||||||
static CharFormat PrintAsStringLiteralTo(wchar_t c, ostream* os) {
|
|
||||||
switch (c) {
|
|
||||||
case L'\'':
|
|
||||||
*os << "'";
|
|
||||||
return kAsIs;
|
|
||||||
case L'"':
|
|
||||||
*os << "\\\"";
|
|
||||||
return kSpecialEscape;
|
|
||||||
default:
|
|
||||||
return PrintAsCharLiteralTo<wchar_t>(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 PrintAsStringLiteralTo(char c, ostream* os) {
|
|
||||||
return PrintAsStringLiteralTo(
|
|
||||||
static_cast<wchar_t>(static_cast<unsigned char>(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 <typename UnsignedChar, typename Char>
|
|
||||||
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<UnsignedChar>(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 << " (" << static_cast<int>(c);
|
|
||||||
|
|
||||||
// For more convenience, we print c's code again in hexadecimal,
|
|
||||||
// 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 << ", 0x" << String::FormatHexInt(static_cast<UnsignedChar>(c));
|
|
||||||
}
|
|
||||||
*os << ")";
|
|
||||||
}
|
|
||||||
|
|
||||||
void PrintTo(unsigned char c, ::std::ostream* os) {
|
|
||||||
PrintCharAndCodeTo<unsigned char>(c, os);
|
|
||||||
}
|
|
||||||
void PrintTo(signed char c, ::std::ostream* os) {
|
|
||||||
PrintCharAndCodeTo<unsigned char>(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<wchar_t>(wc, os);
|
|
||||||
}
|
|
||||||
|
|
||||||
// Prints the given array of characters to the ostream. CharType must be either
|
|
||||||
// char or wchar_t.
|
|
||||||
// The array starts at begin, the length is len, it may include '\0' characters
|
|
||||||
// and may not be NUL-terminated.
|
|
||||||
template <typename CharType>
|
|
||||||
GTEST_ATTRIBUTE_NO_SANITIZE_MEMORY_
|
|
||||||
GTEST_ATTRIBUTE_NO_SANITIZE_ADDRESS_
|
|
||||||
GTEST_ATTRIBUTE_NO_SANITIZE_THREAD_
|
|
||||||
static CharFormat PrintCharsAsStringTo(
|
|
||||||
const CharType* begin, size_t len, ostream* os) {
|
|
||||||
const char* const kQuoteBegin = sizeof(CharType) == 1 ? "\"" : "L\"";
|
|
||||||
*os << kQuoteBegin;
|
|
||||||
bool is_previous_hex = false;
|
|
||||||
CharFormat print_format = kAsIs;
|
|
||||||
for (size_t index = 0; index < len; ++index) {
|
|
||||||
const CharType 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 << "\" " << kQuoteBegin;
|
|
||||||
}
|
|
||||||
is_previous_hex = PrintAsStringLiteralTo(cur, os) == kHexEscape;
|
|
||||||
// Remember if any characters required hex escaping.
|
|
||||||
if (is_previous_hex) {
|
|
||||||
print_format = kHexEscape;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
*os << "\"";
|
|
||||||
return print_format;
|
|
||||||
}
|
|
||||||
|
|
||||||
// Prints a (const) char/wchar_t array of 'len' elements, starting at address
|
|
||||||
// 'begin'. CharType must be either char or wchar_t.
|
|
||||||
template <typename CharType>
|
|
||||||
GTEST_ATTRIBUTE_NO_SANITIZE_MEMORY_
|
|
||||||
GTEST_ATTRIBUTE_NO_SANITIZE_ADDRESS_
|
|
||||||
GTEST_ATTRIBUTE_NO_SANITIZE_THREAD_
|
|
||||||
static void UniversalPrintCharArray(
|
|
||||||
const CharType* begin, size_t len, ostream* os) {
|
|
||||||
// The code
|
|
||||||
// const char kFoo[] = "foo";
|
|
||||||
// generates an array of 4, not 3, elements, with the last one being '\0'.
|
|
||||||
//
|
|
||||||
// Therefore when printing a char array, we don't print the last element if
|
|
||||||
// it's '\0', such that the output matches the string literal as it's
|
|
||||||
// written in the source code.
|
|
||||||
if (len > 0 && begin[len - 1] == '\0') {
|
|
||||||
PrintCharsAsStringTo(begin, len - 1, os);
|
|
||||||
return;
|
|
||||||
}
|
|
||||||
|
|
||||||
// If, however, the last element in the array is not '\0', e.g.
|
|
||||||
// const char kFoo[] = { 'f', 'o', 'o' };
|
|
||||||
// we must print the entire array. We also print a message to indicate
|
|
||||||
// that the array is not NUL-terminated.
|
|
||||||
PrintCharsAsStringTo(begin, len, os);
|
|
||||||
*os << " (no terminating NUL)";
|
|
||||||
}
|
|
||||||
|
|
||||||
// Prints a (const) char array of 'len' elements, starting at address 'begin'.
|
|
||||||
void UniversalPrintArray(const char* begin, size_t len, ostream* os) {
|
|
||||||
UniversalPrintCharArray(begin, len, os);
|
|
||||||
}
|
|
||||||
|
|
||||||
// Prints a (const) wchar_t array of 'len' elements, starting at address
|
|
||||||
// 'begin'.
|
|
||||||
void UniversalPrintArray(const wchar_t* begin, size_t len, ostream* os) {
|
|
||||||
UniversalPrintCharArray(begin, len, os);
|
|
||||||
}
|
|
||||||
|
|
||||||
// Prints the given C string to the ostream.
|
|
||||||
void PrintTo(const char* s, ostream* os) {
|
|
||||||
if (s == NULL) {
|
|
||||||
*os << "NULL";
|
|
||||||
} else {
|
|
||||||
*os << ImplicitCast_<const void*>(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_<const void*>(s) << " pointing to ";
|
|
||||||
PrintCharsAsStringTo(s, std::wcslen(s), os);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
#endif // wchar_t is native
|
|
||||||
|
|
||||||
namespace {
|
|
||||||
|
|
||||||
bool ContainsUnprintableControlCodes(const char* str, size_t length) {
|
|
||||||
const unsigned char *s = reinterpret_cast<const unsigned char *>(str);
|
|
||||||
|
|
||||||
for (size_t i = 0; i < length; i++) {
|
|
||||||
unsigned char ch = *s++;
|
|
||||||
if (std::iscntrl(ch)) {
|
|
||||||
switch (ch) {
|
|
||||||
case '\t':
|
|
||||||
case '\n':
|
|
||||||
case '\r':
|
|
||||||
break;
|
|
||||||
default:
|
|
||||||
return true;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
return false;
|
|
||||||
}
|
|
||||||
|
|
||||||
bool IsUTF8TrailByte(unsigned char t) { return 0x80 <= t && t<= 0xbf; }
|
|
||||||
|
|
||||||
bool IsValidUTF8(const char* str, size_t length) {
|
|
||||||
const unsigned char *s = reinterpret_cast<const unsigned char *>(str);
|
|
||||||
|
|
||||||
for (size_t i = 0; i < length;) {
|
|
||||||
unsigned char lead = s[i++];
|
|
||||||
|
|
||||||
if (lead <= 0x7f) {
|
|
||||||
continue; // single-byte character (ASCII) 0..7F
|
|
||||||
}
|
|
||||||
if (lead < 0xc2) {
|
|
||||||
return false; // trail byte or non-shortest form
|
|
||||||
} else if (lead <= 0xdf && (i + 1) <= length && IsUTF8TrailByte(s[i])) {
|
|
||||||
++i; // 2-byte character
|
|
||||||
} else if (0xe0 <= lead && lead <= 0xef && (i + 2) <= length &&
|
|
||||||
IsUTF8TrailByte(s[i]) &&
|
|
||||||
IsUTF8TrailByte(s[i + 1]) &&
|
|
||||||
// check for non-shortest form and surrogate
|
|
||||||
(lead != 0xe0 || s[i] >= 0xa0) &&
|
|
||||||
(lead != 0xed || s[i] < 0xa0)) {
|
|
||||||
i += 2; // 3-byte character
|
|
||||||
} else if (0xf0 <= lead && lead <= 0xf4 && (i + 3) <= length &&
|
|
||||||
IsUTF8TrailByte(s[i]) &&
|
|
||||||
IsUTF8TrailByte(s[i + 1]) &&
|
|
||||||
IsUTF8TrailByte(s[i + 2]) &&
|
|
||||||
// check for non-shortest form
|
|
||||||
(lead != 0xf0 || s[i] >= 0x90) &&
|
|
||||||
(lead != 0xf4 || s[i] < 0x90)) {
|
|
||||||
i += 3; // 4-byte character
|
|
||||||
} else {
|
|
||||||
return false;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
return true;
|
|
||||||
}
|
|
||||||
|
|
||||||
void ConditionalPrintAsText(const char* str, size_t length, ostream* os) {
|
|
||||||
if (!ContainsUnprintableControlCodes(str, length) &&
|
|
||||||
IsValidUTF8(str, length)) {
|
|
||||||
*os << "\n As Text: \"" << str << "\"";
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
} // anonymous namespace
|
|
||||||
|
|
||||||
// Prints a ::string object.
|
|
||||||
#if GTEST_HAS_GLOBAL_STRING
|
|
||||||
void PrintStringTo(const ::string& s, ostream* os) {
|
|
||||||
if (PrintCharsAsStringTo(s.data(), s.size(), os) == kHexEscape) {
|
|
||||||
if (GTEST_FLAG(print_utf8)) {
|
|
||||||
ConditionalPrintAsText(s.data(), s.size(), os);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
#endif // GTEST_HAS_GLOBAL_STRING
|
|
||||||
|
|
||||||
void PrintStringTo(const ::std::string& s, ostream* os) {
|
|
||||||
if (PrintCharsAsStringTo(s.data(), s.size(), os) == kHexEscape) {
|
|
||||||
if (GTEST_FLAG(print_utf8)) {
|
|
||||||
ConditionalPrintAsText(s.data(), s.size(), os);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
// Prints a ::wstring object.
|
|
||||||
#if GTEST_HAS_GLOBAL_WSTRING
|
|
||||||
void PrintWideStringTo(const ::wstring& s, ostream* os) {
|
|
||||||
PrintCharsAsStringTo(s.data(), s.size(), os);
|
|
||||||
}
|
|
||||||
#endif // GTEST_HAS_GLOBAL_WSTRING
|
|
||||||
|
|
||||||
#if GTEST_HAS_STD_WSTRING
|
|
||||||
void PrintWideStringTo(const ::std::wstring& s, ostream* os) {
|
|
||||||
PrintCharsAsStringTo(s.data(), s.size(), os);
|
|
||||||
}
|
|
||||||
#endif // GTEST_HAS_STD_WSTRING
|
|
||||||
|
|
||||||
} // namespace internal
|
|
||||||
|
|
||||||
} // namespace testing
|
|
@ -1,101 +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.
|
|
||||||
|
|
||||||
//
|
|
||||||
// The Google C++ Testing and Mocking Framework (Google Test)
|
|
||||||
|
|
||||||
#include "gtest/gtest-test-part.h"
|
|
||||||
#include "src/gtest-internal-inl.h"
|
|
||||||
|
|
||||||
namespace testing {
|
|
||||||
|
|
||||||
using internal::GetUnitTestImpl;
|
|
||||||
|
|
||||||
// Gets the summary of the failure message by omitting the stack trace
|
|
||||||
// in it.
|
|
||||||
std::string TestPartResult::ExtractSummary(const char* message) {
|
|
||||||
const char* const stack_trace = strstr(message, internal::kStackTraceMarker);
|
|
||||||
return stack_trace == NULL ? message :
|
|
||||||
std::string(message, stack_trace);
|
|
||||||
}
|
|
||||||
|
|
||||||
// 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<int>(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
|
|
@ -1,118 +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.
|
|
||||||
|
|
||||||
|
|
||||||
#include "gtest/gtest-typed-test.h"
|
|
||||||
|
|
||||||
#include "gtest/gtest.h"
|
|
||||||
|
|
||||||
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;
|
|
||||||
}
|
|
||||||
|
|
||||||
static std::vector<std::string> SplitIntoTestNames(const char* src) {
|
|
||||||
std::vector<std::string> name_vec;
|
|
||||||
src = SkipSpaces(src);
|
|
||||||
for (; src != NULL; src = SkipComma(src)) {
|
|
||||||
name_vec.push_back(StripTrailingSpaces(GetPrefixUntilComma(src)));
|
|
||||||
}
|
|
||||||
return name_vec;
|
|
||||||
}
|
|
||||||
|
|
||||||
// Verifies that registered_tests match the test names in
|
|
||||||
// registered_tests_; returns registered_tests if successful, or
|
|
||||||
// aborts the program otherwise.
|
|
||||||
const char* TypedTestCasePState::VerifyRegisteredTestNames(
|
|
||||||
const char* file, int line, const char* registered_tests) {
|
|
||||||
typedef RegisteredTestsMap::const_iterator RegisteredTestIter;
|
|
||||||
registered_ = true;
|
|
||||||
|
|
||||||
std::vector<std::string> name_vec = SplitIntoTestNames(registered_tests);
|
|
||||||
|
|
||||||
Message errors;
|
|
||||||
|
|
||||||
std::set<std::string> tests;
|
|
||||||
for (std::vector<std::string>::const_iterator name_it = name_vec.begin();
|
|
||||||
name_it != name_vec.end(); ++name_it) {
|
|
||||||
const std::string& name = *name_it;
|
|
||||||
if (tests.count(name) != 0) {
|
|
||||||
errors << "Test " << name << " is listed more than once.\n";
|
|
||||||
continue;
|
|
||||||
}
|
|
||||||
|
|
||||||
bool found = false;
|
|
||||||
for (RegisteredTestIter it = registered_tests_.begin();
|
|
||||||
it != registered_tests_.end();
|
|
||||||
++it) {
|
|
||||||
if (name == it->first) {
|
|
||||||
found = true;
|
|
||||||
break;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
if (found) {
|
|
||||||
tests.insert(name);
|
|
||||||
} else {
|
|
||||||
errors << "No test named " << name
|
|
||||||
<< " can be found in this test case.\n";
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
for (RegisteredTestIter it = registered_tests_.begin();
|
|
||||||
it != registered_tests_.end();
|
|
||||||
++it) {
|
|
||||||
if (tests.count(it->first) == 0) {
|
|
||||||
errors << "You forgot to list test " << it->first << ".\n";
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
const std::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
|
|
File diff suppressed because it is too large
Load Diff
@ -1,37 +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 <stdio.h>
|
|
||||||
#include "gtest/gtest.h"
|
|
||||||
|
|
||||||
GTEST_API_ int main(int argc, char **argv) {
|
|
||||||
printf("Running main() from %s\n", __FILE__);
|
|
||||||
testing::InitGoogleTest(&argc, argv);
|
|
||||||
return RUN_ALL_TESTS();
|
|
||||||
}
|
|
Loading…
Reference in New Issue
Block a user