head 1.2; access; symbols netbsd-11-0-RC5:1.2 netbsd-11-0-RC4:1.2 netbsd-11-0-RC3:1.2 netbsd-11-0-RC2:1.2 netbsd-11-0-RC1:1.2 perseant-exfatfs-base-20250801:1.2 netbsd-11:1.2.0.10 netbsd-11-base:1.2 netbsd-10-1-RELEASE:1.2 perseant-exfatfs-base-20240630:1.2 perseant-exfatfs:1.2.0.8 perseant-exfatfs-base:1.2 netbsd-8-3-RELEASE:1.1.1.1 netbsd-9-4-RELEASE:1.1.1.1 netbsd-10-0-RELEASE:1.2 netbsd-10-0-RC6:1.2 netbsd-10-0-RC5:1.2 netbsd-10-0-RC4:1.2 netbsd-10-0-RC3:1.2 netbsd-10-0-RC2:1.2 netbsd-10-0-RC1:1.2 netbsd-10:1.2.0.6 netbsd-10-base:1.2 netbsd-9-3-RELEASE:1.1.1.1 cjep_sun2x-base1:1.2 cjep_sun2x:1.2.0.4 cjep_sun2x-base:1.2 cjep_staticlib_x-base1:1.2 netbsd-9-2-RELEASE:1.1.1.1 cjep_staticlib_x:1.2.0.2 cjep_staticlib_x-base:1.2 netbsd-9-1-RELEASE:1.1.1.1 phil-wifi-20200421:1.1.1.1 phil-wifi-20200411:1.1.1.1 is-mlppp:1.1.1.1.0.40 is-mlppp-base:1.1.1.1 phil-wifi-20200406:1.1.1.1 netbsd-8-2-RELEASE:1.1.1.1 netbsd-9-0-RELEASE:1.1.1.1 netbsd-9-0-RC2:1.1.1.1 netbsd-9-0-RC1:1.1.1.1 phil-wifi-20191119:1.1.1.1 netbsd-9:1.1.1.1.0.38 netbsd-9-base:1.1.1.1 phil-wifi-20190609:1.1.1.1 netbsd-8-1-RELEASE:1.1.1.1 netbsd-8-1-RC1:1.1.1.1 pgoyette-compat-merge-20190127:1.1.1.1 pgoyette-compat-20190127:1.1.1.1 pgoyette-compat-20190118:1.1.1.1 pgoyette-compat-1226:1.1.1.1 pgoyette-compat-1126:1.1.1.1 pgoyette-compat-1020:1.1.1.1 pgoyette-compat-0930:1.1.1.1 pgoyette-compat-0906:1.1.1.1 netbsd-7-2-RELEASE:1.1.1.1 pgoyette-compat-0728:1.1.1.1 netbsd-8-0-RELEASE:1.1.1.1 phil-wifi:1.1.1.1.0.36 phil-wifi-base:1.1.1.1 pgoyette-compat-0625:1.1.1.1 netbsd-8-0-RC2:1.1.1.1 pgoyette-compat-0521:1.1.1.1 pgoyette-compat-0502:1.1.1.1 pgoyette-compat-0422:1.1.1.1 netbsd-8-0-RC1:1.1.1.1 pgoyette-compat-0415:1.1.1.1 pgoyette-compat-0407:1.1.1.1 pgoyette-compat-0330:1.1.1.1 pgoyette-compat-0322:1.1.1.1 pgoyette-compat-0315:1.1.1.1 netbsd-7-1-2-RELEASE:1.1.1.1 pgoyette-compat:1.1.1.1.0.34 pgoyette-compat-base:1.1.1.1 netbsd-7-1-1-RELEASE:1.1.1.1 matt-nb8-mediatek:1.1.1.1.0.32 matt-nb8-mediatek-base:1.1.1.1 perseant-stdc-iso10646:1.1.1.1.0.30 perseant-stdc-iso10646-base:1.1.1.1 netbsd-8:1.1.1.1.0.28 netbsd-8-base:1.1.1.1 prg-localcount2-base3:1.1.1.1 prg-localcount2-base2:1.1.1.1 prg-localcount2-base1:1.1.1.1 prg-localcount2:1.1.1.1.0.26 prg-localcount2-base:1.1.1.1 pgoyette-localcount-20170426:1.1.1.1 bouyer-socketcan-base1:1.1.1.1 pgoyette-localcount-20170320:1.1.1.1 netbsd-7-1:1.1.1.1.0.24 netbsd-7-1-RELEASE:1.1.1.1 netbsd-7-1-RC2:1.1.1.1 netbsd-7-nhusb-base-20170116:1.1.1.1 bouyer-socketcan:1.1.1.1.0.22 bouyer-socketcan-base:1.1.1.1 pgoyette-localcount-20170107:1.1.1.1 netbsd-7-1-RC1:1.1.1.1 pgoyette-localcount-20161104:1.1.1.1 netbsd-7-0-2-RELEASE:1.1.1.1 localcount-20160914:1.1.1.1 netbsd-7-nhusb:1.1.1.1.0.20 netbsd-7-nhusb-base:1.1.1.1 pgoyette-localcount-20160806:1.1.1.1 pgoyette-localcount-20160726:1.1.1.1 pgoyette-localcount:1.1.1.1.0.18 pgoyette-localcount-base:1.1.1.1 netbsd-7-0-1-RELEASE:1.1.1.1 netbsd-7-0:1.1.1.1.0.16 netbsd-7-0-RELEASE:1.1.1.1 netbsd-7-0-RC3:1.1.1.1 netbsd-7-0-RC2:1.1.1.1 netbsd-7-0-RC1:1.1.1.1 netbsd-7:1.1.1.1.0.14 netbsd-7-base:1.1.1.1 yamt-pagecache:1.1.1.1.0.12 yamt-pagecache-base9:1.1.1.1 tls-earlyentropy:1.1.1.1.0.10 tls-earlyentropy-base:1.1.1.1 riastradh-xf86-video-intel-2-7-1-pre-2-21-15:1.1.1.1 riastradh-drm2-base3:1.1.1.1 kyua-cli-0-7:1.1.1.1 riastradh-drm2-base2:1.1.1.1 riastradh-drm2-base1:1.1.1.1 riastradh-drm2:1.1.1.1.0.2 riastradh-drm2-base:1.1.1.1 khorben-n900:1.1.1.1.0.8 agc-symver:1.1.1.1.0.6 agc-symver-base:1.1.1.1 tls-maxphys-base:1.1.1.1 tls-maxphys:1.1.1.1.0.4 kyua-cli-0-6:1.1.1.1 GOOGLE-CODE:1.1.1; locks; strict; comment @// @; 1.2 date 2020.07.02.14.04.00; author lukem; state Exp; branches; next 1.1; commitid YUoDcZ95aoStLveC; 1.1 date 2013.02.23.12.34.06; author jmmv; state Exp; branches 1.1.1.1; next ; 1.1.1.1 date 2013.02.23.12.34.06; author jmmv; state Exp; branches 1.1.1.1.4.1 1.1.1.1.12.1; next ; 1.1.1.1.4.1 date 2013.02.23.12.34.06; author tls; state dead; branches; next 1.1.1.1.4.2; 1.1.1.1.4.2 date 2013.02.25.00.26.15; author tls; state Exp; branches; next ; 1.1.1.1.12.1 date 2013.02.23.12.34.06; author yamt; state dead; branches; next 1.1.1.1.12.2; commitid h3iiOYJJCkPr7yBx; 1.1.1.1.12.2 date 2014.05.22.15.45.29; author yamt; state Exp; branches; next ; commitid h3iiOYJJCkPr7yBx; desc @@ 1.2 log @kyua-cli: convert auto_ptr to unique_ptr Update kyua-cli to C++11 and use unique_ptr instead of auto_ptr, (with std::move() where appropriate), to avoid deprecated warning by g++ 8. (I didn't change some of the code that could arguably be refactored to use unique_ptr or shared_ptr instead of raw pointers and therefore remove the special case destructor handling). @ text @// Copyright 2012 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 "utils/config/lua_module.hpp" #include #include #include #include #include "utils/config/tree.ipp" #include "utils/defs.hpp" namespace config = utils::config; namespace { /// Non-native type to use as a leaf node. struct custom_type { /// The value recorded in the object. int value; /// Constructs a new object. /// /// \param value_ The value to store in the object. explicit custom_type(const int value_) : value(value_) { } }; /// Custom implementation of a node type for testing purposes. class custom_node : public config::typed_leaf_node< custom_type > { public: /// Copies the node. /// /// \return A dynamically-allocated node. virtual base_node* deep_copy(void) const { std::unique_ptr< custom_node > new_node(new custom_node()); new_node->_value = _value; return new_node.release(); } /// Pushes the node's value onto the Lua stack. /// /// \param state The Lua state onto which to push the value. void push_lua(lutok::state& state) const { state.push_integer(value().value * 5); } /// Sets the value of the node from an entry in the Lua stack. /// /// \param state The Lua state from which to get the value. /// \param value_index The stack index in which the value resides. void set_lua(lutok::state& state, const int value_index) { ATF_REQUIRE(state.is_number(value_index)); set(custom_type(state.to_integer(value_index) * 2)); } /// Sets the value of the node from a raw string representation. /// /// \post The test case is marked as failed, as this function is not /// supposed to be invoked by the lua_module code. /// /// \param unused_raw_value The value to set the node to. void set_string(const std::string& UTILS_UNUSED_PARAM(raw_value)) { ATF_FAIL("Should not be used"); } /// Converts the contents of the node to a string. /// /// \post The test case is marked as failed, as this function is not /// supposed to be invoked by the lua_module code. /// /// \return Nothing. std::string to_string(void) const { ATF_FAIL("Should not be used"); } }; } // anonymous namespace ATF_TEST_CASE_WITHOUT_HEAD(top__valid_types); ATF_TEST_CASE_BODY(top__valid_types) { config::tree tree; tree.define< config::bool_node >("top_boolean"); tree.define< config::int_node >("top_integer"); tree.define< config::string_node >("top_string"); { lutok::state state; config::redirect(state, tree); lutok::do_string(state, "top_boolean = true\n" "top_integer = 12345\n" "top_string = 'a foo'\n"); } ATF_REQUIRE_EQ(true, tree.lookup< config::bool_node >("top_boolean")); ATF_REQUIRE_EQ(12345, tree.lookup< config::int_node >("top_integer")); ATF_REQUIRE_EQ("a foo", tree.lookup< config::string_node >("top_string")); } ATF_TEST_CASE_WITHOUT_HEAD(top__reuse); ATF_TEST_CASE_BODY(top__reuse) { config::tree tree; tree.define< config::int_node >("first"); tree.define< config::int_node >("second"); { lutok::state state; config::redirect(state, tree); lutok::do_string(state, "first = 100; second = first * 2"); } ATF_REQUIRE_EQ(100, tree.lookup< config::int_node >("first")); ATF_REQUIRE_EQ(200, tree.lookup< config::int_node >("second")); } ATF_TEST_CASE_WITHOUT_HEAD(top__reset); ATF_TEST_CASE_BODY(top__reset) { config::tree tree; tree.define< config::int_node >("first"); { lutok::state state; config::redirect(state, tree); lutok::do_string(state, "first = 100; first = 200"); } ATF_REQUIRE_EQ(200, tree.lookup< config::int_node >("first")); } ATF_TEST_CASE_WITHOUT_HEAD(top__already_set_on_entry); ATF_TEST_CASE_BODY(top__already_set_on_entry) { config::tree tree; tree.define< config::int_node >("first"); tree.set< config::int_node >("first", 100); { lutok::state state; config::redirect(state, tree); lutok::do_string(state, "first = first * 15"); } ATF_REQUIRE_EQ(1500, tree.lookup< config::int_node >("first")); } ATF_TEST_CASE_WITHOUT_HEAD(subtree__valid_types); ATF_TEST_CASE_BODY(subtree__valid_types) { config::tree tree; tree.define< config::bool_node >("root.boolean"); tree.define< config::int_node >("root.a.integer"); tree.define< config::string_node >("root.string"); { lutok::state state; config::redirect(state, tree); lutok::do_string(state, "root.boolean = true\n" "root.a.integer = 12345\n" "root.string = 'a foo'\n"); } ATF_REQUIRE_EQ(true, tree.lookup< config::bool_node >("root.boolean")); ATF_REQUIRE_EQ(12345, tree.lookup< config::int_node >("root.a.integer")); ATF_REQUIRE_EQ("a foo", tree.lookup< config::string_node >("root.string")); } ATF_TEST_CASE_WITHOUT_HEAD(subtree__reuse); ATF_TEST_CASE_BODY(subtree__reuse) { config::tree tree; tree.define< config::int_node >("a.first"); tree.define< config::int_node >("a.second"); { lutok::state state; config::redirect(state, tree); lutok::do_string(state, "a.first = 100; a.second = a.first * 2"); } ATF_REQUIRE_EQ(100, tree.lookup< config::int_node >("a.first")); ATF_REQUIRE_EQ(200, tree.lookup< config::int_node >("a.second")); } ATF_TEST_CASE_WITHOUT_HEAD(subtree__reset); ATF_TEST_CASE_BODY(subtree__reset) { config::tree tree; tree.define< config::int_node >("a.first"); { lutok::state state; config::redirect(state, tree); lutok::do_string(state, "a.first = 100; a.first = 200"); } ATF_REQUIRE_EQ(200, tree.lookup< config::int_node >("a.first")); } ATF_TEST_CASE_WITHOUT_HEAD(subtree__already_set_on_entry); ATF_TEST_CASE_BODY(subtree__already_set_on_entry) { config::tree tree; tree.define< config::int_node >("a.first"); tree.set< config::int_node >("a.first", 100); { lutok::state state; config::redirect(state, tree); lutok::do_string(state, "a.first = a.first * 15"); } ATF_REQUIRE_EQ(1500, tree.lookup< config::int_node >("a.first")); } ATF_TEST_CASE_WITHOUT_HEAD(subtree__override_inner); ATF_TEST_CASE_BODY(subtree__override_inner) { config::tree tree; tree.define_dynamic("root"); { lutok::state state; config::redirect(state, tree); lutok::do_string(state, "root.test = 'a'"); ATF_REQUIRE_THROW_RE(lutok::error, "Invalid value for key 'root'", lutok::do_string(state, "root = 'b'")); // Ensure that the previous assignment to 'root' did not cause any // inconsistencies in the environment that would prevent a new // assignment from working. lutok::do_string(state, "root.test2 = 'c'"); } ATF_REQUIRE_EQ("a", tree.lookup< config::string_node >("root.test")); ATF_REQUIRE_EQ("c", tree.lookup< config::string_node >("root.test2")); } ATF_TEST_CASE_WITHOUT_HEAD(dynamic_subtree__strings); ATF_TEST_CASE_BODY(dynamic_subtree__strings) { config::tree tree; tree.define_dynamic("root"); lutok::state state; config::redirect(state, tree); lutok::do_string(state, "root.key1 = 1234\n" "root.a.b.key2 = 'foo bar'\n"); ATF_REQUIRE_EQ("1234", tree.lookup< config::string_node >("root.key1")); ATF_REQUIRE_EQ("foo bar", tree.lookup< config::string_node >("root.a.b.key2")); } ATF_TEST_CASE_WITHOUT_HEAD(dynamic_subtree__invalid_types); ATF_TEST_CASE_BODY(dynamic_subtree__invalid_types) { config::tree tree; tree.define_dynamic("root"); lutok::state state; config::redirect(state, tree); ATF_REQUIRE_THROW_RE(lutok::error, "Invalid value for key 'root.boolean' " "\\(Not a string\\)", lutok::do_string(state, "root.boolean = true")); ATF_REQUIRE_THROW_RE(lutok::error, "Invalid value for key 'root.table' " "\\(Not a string\\)", lutok::do_string(state, "root.table = {}")); ATF_REQUIRE(!tree.is_set("root.boolean")); ATF_REQUIRE(!tree.is_set("root.table")); } ATF_TEST_CASE_WITHOUT_HEAD(locals); ATF_TEST_CASE_BODY(locals) { config::tree tree; tree.define< config::int_node >("the_key"); { lutok::state state; config::redirect(state, tree); lutok::do_string(state, "local function generate()\n" " return 15\n" "end\n" "local test_var = 20\n" "the_key = generate() + test_var\n"); } ATF_REQUIRE_EQ(35, tree.lookup< config::int_node >("the_key")); } ATF_TEST_CASE_WITHOUT_HEAD(custom_node); ATF_TEST_CASE_BODY(custom_node) { config::tree tree; tree.define< custom_node >("key1"); tree.define< custom_node >("key2"); tree.set< custom_node >("key2", custom_type(10)); { lutok::state state; config::redirect(state, tree); lutok::do_string(state, "key1 = 512\n"); lutok::do_string(state, "key2 = key2 * 2\n"); } ATF_REQUIRE_EQ(1024, tree.lookup< custom_node >("key1").value); ATF_REQUIRE_EQ(200, tree.lookup< custom_node >("key2").value); } ATF_TEST_CASE_WITHOUT_HEAD(invalid_key); ATF_TEST_CASE_BODY(invalid_key) { config::tree tree; lutok::state state; config::redirect(state, tree); ATF_REQUIRE_THROW_RE(lutok::error, "Empty component in key 'root.'", lutok::do_string(state, "root['']['a'] = 12345\n")); } ATF_TEST_CASE_WITHOUT_HEAD(unknown_key); ATF_TEST_CASE_BODY(unknown_key) { config::tree tree; tree.define< config::bool_node >("static.bool"); lutok::state state; config::redirect(state, tree); ATF_REQUIRE_THROW_RE(lutok::error, "Unknown configuration property 'static.int'", lutok::do_string(state, "static.int = 12345\n")); } ATF_TEST_CASE_WITHOUT_HEAD(value_error); ATF_TEST_CASE_BODY(value_error) { config::tree tree; tree.define< config::bool_node >("a.b"); lutok::state state; config::redirect(state, tree); ATF_REQUIRE_THROW_RE(lutok::error, "Invalid value for key 'a.b' \\(Not a boolean\\)", lutok::do_string(state, "a.b = 12345\n")); ATF_REQUIRE_THROW_RE(lutok::error, "Invalid value for key 'a'", lutok::do_string(state, "a = 1\n")); } ATF_INIT_TEST_CASES(tcs) { ATF_ADD_TEST_CASE(tcs, top__valid_types); ATF_ADD_TEST_CASE(tcs, top__reuse); ATF_ADD_TEST_CASE(tcs, top__reset); ATF_ADD_TEST_CASE(tcs, top__already_set_on_entry); ATF_ADD_TEST_CASE(tcs, subtree__valid_types); ATF_ADD_TEST_CASE(tcs, subtree__reuse); ATF_ADD_TEST_CASE(tcs, subtree__reset); ATF_ADD_TEST_CASE(tcs, subtree__already_set_on_entry); ATF_ADD_TEST_CASE(tcs, subtree__override_inner); ATF_ADD_TEST_CASE(tcs, dynamic_subtree__strings); ATF_ADD_TEST_CASE(tcs, dynamic_subtree__invalid_types); ATF_ADD_TEST_CASE(tcs, locals); ATF_ADD_TEST_CASE(tcs, custom_node); ATF_ADD_TEST_CASE(tcs, invalid_key); ATF_ADD_TEST_CASE(tcs, unknown_key); ATF_ADD_TEST_CASE(tcs, value_error); } @ 1.1 log @Initial revision @ text @d70 1 a70 1 std::auto_ptr< custom_node > new_node(new custom_node()); @ 1.1.1.1 log @Initial import of Kyua CLI, version 0.6: This is the main component of Kyua and its build will be guarded by the MKKYUA knob. core@@ has approved this import. Description: Kyua (pronounced Q.A.) is a testing framework for both developers and users. Kyua is different from most other testing frameworks in that it puts the end user experience before anything else. There are multiple reasons for users to run the tests themselves, and Kyua ensures that they can do so in the most convenient way. This module, kyua-cli, provides the command-line interface to the Kyua runtime system. The major purpose of this tool is to run test cases and generate unified reports for their results. @ text @@ 1.1.1.1.12.1 log @file lua_module_test.cpp was added on branch yamt-pagecache on 2014-05-22 15:45:29 +0000 @ text @d1 441 @ 1.1.1.1.12.2 log @sync with head. for a reference, the tree before this commit was tagged as yamt-pagecache-tag8. this commit was splitted into small chunks to avoid a limitation of cvs. ("Protocol error: too many arguments") @ text @a0 441 // Copyright 2012 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 "utils/config/lua_module.hpp" #include #include #include #include #include "utils/config/tree.ipp" #include "utils/defs.hpp" namespace config = utils::config; namespace { /// Non-native type to use as a leaf node. struct custom_type { /// The value recorded in the object. int value; /// Constructs a new object. /// /// \param value_ The value to store in the object. explicit custom_type(const int value_) : value(value_) { } }; /// Custom implementation of a node type for testing purposes. class custom_node : public config::typed_leaf_node< custom_type > { public: /// Copies the node. /// /// \return A dynamically-allocated node. virtual base_node* deep_copy(void) const { std::auto_ptr< custom_node > new_node(new custom_node()); new_node->_value = _value; return new_node.release(); } /// Pushes the node's value onto the Lua stack. /// /// \param state The Lua state onto which to push the value. void push_lua(lutok::state& state) const { state.push_integer(value().value * 5); } /// Sets the value of the node from an entry in the Lua stack. /// /// \param state The Lua state from which to get the value. /// \param value_index The stack index in which the value resides. void set_lua(lutok::state& state, const int value_index) { ATF_REQUIRE(state.is_number(value_index)); set(custom_type(state.to_integer(value_index) * 2)); } /// Sets the value of the node from a raw string representation. /// /// \post The test case is marked as failed, as this function is not /// supposed to be invoked by the lua_module code. /// /// \param unused_raw_value The value to set the node to. void set_string(const std::string& UTILS_UNUSED_PARAM(raw_value)) { ATF_FAIL("Should not be used"); } /// Converts the contents of the node to a string. /// /// \post The test case is marked as failed, as this function is not /// supposed to be invoked by the lua_module code. /// /// \return Nothing. std::string to_string(void) const { ATF_FAIL("Should not be used"); } }; } // anonymous namespace ATF_TEST_CASE_WITHOUT_HEAD(top__valid_types); ATF_TEST_CASE_BODY(top__valid_types) { config::tree tree; tree.define< config::bool_node >("top_boolean"); tree.define< config::int_node >("top_integer"); tree.define< config::string_node >("top_string"); { lutok::state state; config::redirect(state, tree); lutok::do_string(state, "top_boolean = true\n" "top_integer = 12345\n" "top_string = 'a foo'\n"); } ATF_REQUIRE_EQ(true, tree.lookup< config::bool_node >("top_boolean")); ATF_REQUIRE_EQ(12345, tree.lookup< config::int_node >("top_integer")); ATF_REQUIRE_EQ("a foo", tree.lookup< config::string_node >("top_string")); } ATF_TEST_CASE_WITHOUT_HEAD(top__reuse); ATF_TEST_CASE_BODY(top__reuse) { config::tree tree; tree.define< config::int_node >("first"); tree.define< config::int_node >("second"); { lutok::state state; config::redirect(state, tree); lutok::do_string(state, "first = 100; second = first * 2"); } ATF_REQUIRE_EQ(100, tree.lookup< config::int_node >("first")); ATF_REQUIRE_EQ(200, tree.lookup< config::int_node >("second")); } ATF_TEST_CASE_WITHOUT_HEAD(top__reset); ATF_TEST_CASE_BODY(top__reset) { config::tree tree; tree.define< config::int_node >("first"); { lutok::state state; config::redirect(state, tree); lutok::do_string(state, "first = 100; first = 200"); } ATF_REQUIRE_EQ(200, tree.lookup< config::int_node >("first")); } ATF_TEST_CASE_WITHOUT_HEAD(top__already_set_on_entry); ATF_TEST_CASE_BODY(top__already_set_on_entry) { config::tree tree; tree.define< config::int_node >("first"); tree.set< config::int_node >("first", 100); { lutok::state state; config::redirect(state, tree); lutok::do_string(state, "first = first * 15"); } ATF_REQUIRE_EQ(1500, tree.lookup< config::int_node >("first")); } ATF_TEST_CASE_WITHOUT_HEAD(subtree__valid_types); ATF_TEST_CASE_BODY(subtree__valid_types) { config::tree tree; tree.define< config::bool_node >("root.boolean"); tree.define< config::int_node >("root.a.integer"); tree.define< config::string_node >("root.string"); { lutok::state state; config::redirect(state, tree); lutok::do_string(state, "root.boolean = true\n" "root.a.integer = 12345\n" "root.string = 'a foo'\n"); } ATF_REQUIRE_EQ(true, tree.lookup< config::bool_node >("root.boolean")); ATF_REQUIRE_EQ(12345, tree.lookup< config::int_node >("root.a.integer")); ATF_REQUIRE_EQ("a foo", tree.lookup< config::string_node >("root.string")); } ATF_TEST_CASE_WITHOUT_HEAD(subtree__reuse); ATF_TEST_CASE_BODY(subtree__reuse) { config::tree tree; tree.define< config::int_node >("a.first"); tree.define< config::int_node >("a.second"); { lutok::state state; config::redirect(state, tree); lutok::do_string(state, "a.first = 100; a.second = a.first * 2"); } ATF_REQUIRE_EQ(100, tree.lookup< config::int_node >("a.first")); ATF_REQUIRE_EQ(200, tree.lookup< config::int_node >("a.second")); } ATF_TEST_CASE_WITHOUT_HEAD(subtree__reset); ATF_TEST_CASE_BODY(subtree__reset) { config::tree tree; tree.define< config::int_node >("a.first"); { lutok::state state; config::redirect(state, tree); lutok::do_string(state, "a.first = 100; a.first = 200"); } ATF_REQUIRE_EQ(200, tree.lookup< config::int_node >("a.first")); } ATF_TEST_CASE_WITHOUT_HEAD(subtree__already_set_on_entry); ATF_TEST_CASE_BODY(subtree__already_set_on_entry) { config::tree tree; tree.define< config::int_node >("a.first"); tree.set< config::int_node >("a.first", 100); { lutok::state state; config::redirect(state, tree); lutok::do_string(state, "a.first = a.first * 15"); } ATF_REQUIRE_EQ(1500, tree.lookup< config::int_node >("a.first")); } ATF_TEST_CASE_WITHOUT_HEAD(subtree__override_inner); ATF_TEST_CASE_BODY(subtree__override_inner) { config::tree tree; tree.define_dynamic("root"); { lutok::state state; config::redirect(state, tree); lutok::do_string(state, "root.test = 'a'"); ATF_REQUIRE_THROW_RE(lutok::error, "Invalid value for key 'root'", lutok::do_string(state, "root = 'b'")); // Ensure that the previous assignment to 'root' did not cause any // inconsistencies in the environment that would prevent a new // assignment from working. lutok::do_string(state, "root.test2 = 'c'"); } ATF_REQUIRE_EQ("a", tree.lookup< config::string_node >("root.test")); ATF_REQUIRE_EQ("c", tree.lookup< config::string_node >("root.test2")); } ATF_TEST_CASE_WITHOUT_HEAD(dynamic_subtree__strings); ATF_TEST_CASE_BODY(dynamic_subtree__strings) { config::tree tree; tree.define_dynamic("root"); lutok::state state; config::redirect(state, tree); lutok::do_string(state, "root.key1 = 1234\n" "root.a.b.key2 = 'foo bar'\n"); ATF_REQUIRE_EQ("1234", tree.lookup< config::string_node >("root.key1")); ATF_REQUIRE_EQ("foo bar", tree.lookup< config::string_node >("root.a.b.key2")); } ATF_TEST_CASE_WITHOUT_HEAD(dynamic_subtree__invalid_types); ATF_TEST_CASE_BODY(dynamic_subtree__invalid_types) { config::tree tree; tree.define_dynamic("root"); lutok::state state; config::redirect(state, tree); ATF_REQUIRE_THROW_RE(lutok::error, "Invalid value for key 'root.boolean' " "\\(Not a string\\)", lutok::do_string(state, "root.boolean = true")); ATF_REQUIRE_THROW_RE(lutok::error, "Invalid value for key 'root.table' " "\\(Not a string\\)", lutok::do_string(state, "root.table = {}")); ATF_REQUIRE(!tree.is_set("root.boolean")); ATF_REQUIRE(!tree.is_set("root.table")); } ATF_TEST_CASE_WITHOUT_HEAD(locals); ATF_TEST_CASE_BODY(locals) { config::tree tree; tree.define< config::int_node >("the_key"); { lutok::state state; config::redirect(state, tree); lutok::do_string(state, "local function generate()\n" " return 15\n" "end\n" "local test_var = 20\n" "the_key = generate() + test_var\n"); } ATF_REQUIRE_EQ(35, tree.lookup< config::int_node >("the_key")); } ATF_TEST_CASE_WITHOUT_HEAD(custom_node); ATF_TEST_CASE_BODY(custom_node) { config::tree tree; tree.define< custom_node >("key1"); tree.define< custom_node >("key2"); tree.set< custom_node >("key2", custom_type(10)); { lutok::state state; config::redirect(state, tree); lutok::do_string(state, "key1 = 512\n"); lutok::do_string(state, "key2 = key2 * 2\n"); } ATF_REQUIRE_EQ(1024, tree.lookup< custom_node >("key1").value); ATF_REQUIRE_EQ(200, tree.lookup< custom_node >("key2").value); } ATF_TEST_CASE_WITHOUT_HEAD(invalid_key); ATF_TEST_CASE_BODY(invalid_key) { config::tree tree; lutok::state state; config::redirect(state, tree); ATF_REQUIRE_THROW_RE(lutok::error, "Empty component in key 'root.'", lutok::do_string(state, "root['']['a'] = 12345\n")); } ATF_TEST_CASE_WITHOUT_HEAD(unknown_key); ATF_TEST_CASE_BODY(unknown_key) { config::tree tree; tree.define< config::bool_node >("static.bool"); lutok::state state; config::redirect(state, tree); ATF_REQUIRE_THROW_RE(lutok::error, "Unknown configuration property 'static.int'", lutok::do_string(state, "static.int = 12345\n")); } ATF_TEST_CASE_WITHOUT_HEAD(value_error); ATF_TEST_CASE_BODY(value_error) { config::tree tree; tree.define< config::bool_node >("a.b"); lutok::state state; config::redirect(state, tree); ATF_REQUIRE_THROW_RE(lutok::error, "Invalid value for key 'a.b' \\(Not a boolean\\)", lutok::do_string(state, "a.b = 12345\n")); ATF_REQUIRE_THROW_RE(lutok::error, "Invalid value for key 'a'", lutok::do_string(state, "a = 1\n")); } ATF_INIT_TEST_CASES(tcs) { ATF_ADD_TEST_CASE(tcs, top__valid_types); ATF_ADD_TEST_CASE(tcs, top__reuse); ATF_ADD_TEST_CASE(tcs, top__reset); ATF_ADD_TEST_CASE(tcs, top__already_set_on_entry); ATF_ADD_TEST_CASE(tcs, subtree__valid_types); ATF_ADD_TEST_CASE(tcs, subtree__reuse); ATF_ADD_TEST_CASE(tcs, subtree__reset); ATF_ADD_TEST_CASE(tcs, subtree__already_set_on_entry); ATF_ADD_TEST_CASE(tcs, subtree__override_inner); ATF_ADD_TEST_CASE(tcs, dynamic_subtree__strings); ATF_ADD_TEST_CASE(tcs, dynamic_subtree__invalid_types); ATF_ADD_TEST_CASE(tcs, locals); ATF_ADD_TEST_CASE(tcs, custom_node); ATF_ADD_TEST_CASE(tcs, invalid_key); ATF_ADD_TEST_CASE(tcs, unknown_key); ATF_ADD_TEST_CASE(tcs, value_error); } @ 1.1.1.1.4.1 log @file lua_module_test.cpp was added on branch tls-maxphys on 2013-02-25 00:26:15 +0000 @ text @d1 441 @ 1.1.1.1.4.2 log @resync with head @ text @a0 441 // Copyright 2012 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 "utils/config/lua_module.hpp" #include #include #include #include #include "utils/config/tree.ipp" #include "utils/defs.hpp" namespace config = utils::config; namespace { /// Non-native type to use as a leaf node. struct custom_type { /// The value recorded in the object. int value; /// Constructs a new object. /// /// \param value_ The value to store in the object. explicit custom_type(const int value_) : value(value_) { } }; /// Custom implementation of a node type for testing purposes. class custom_node : public config::typed_leaf_node< custom_type > { public: /// Copies the node. /// /// \return A dynamically-allocated node. virtual base_node* deep_copy(void) const { std::auto_ptr< custom_node > new_node(new custom_node()); new_node->_value = _value; return new_node.release(); } /// Pushes the node's value onto the Lua stack. /// /// \param state The Lua state onto which to push the value. void push_lua(lutok::state& state) const { state.push_integer(value().value * 5); } /// Sets the value of the node from an entry in the Lua stack. /// /// \param state The Lua state from which to get the value. /// \param value_index The stack index in which the value resides. void set_lua(lutok::state& state, const int value_index) { ATF_REQUIRE(state.is_number(value_index)); set(custom_type(state.to_integer(value_index) * 2)); } /// Sets the value of the node from a raw string representation. /// /// \post The test case is marked as failed, as this function is not /// supposed to be invoked by the lua_module code. /// /// \param unused_raw_value The value to set the node to. void set_string(const std::string& UTILS_UNUSED_PARAM(raw_value)) { ATF_FAIL("Should not be used"); } /// Converts the contents of the node to a string. /// /// \post The test case is marked as failed, as this function is not /// supposed to be invoked by the lua_module code. /// /// \return Nothing. std::string to_string(void) const { ATF_FAIL("Should not be used"); } }; } // anonymous namespace ATF_TEST_CASE_WITHOUT_HEAD(top__valid_types); ATF_TEST_CASE_BODY(top__valid_types) { config::tree tree; tree.define< config::bool_node >("top_boolean"); tree.define< config::int_node >("top_integer"); tree.define< config::string_node >("top_string"); { lutok::state state; config::redirect(state, tree); lutok::do_string(state, "top_boolean = true\n" "top_integer = 12345\n" "top_string = 'a foo'\n"); } ATF_REQUIRE_EQ(true, tree.lookup< config::bool_node >("top_boolean")); ATF_REQUIRE_EQ(12345, tree.lookup< config::int_node >("top_integer")); ATF_REQUIRE_EQ("a foo", tree.lookup< config::string_node >("top_string")); } ATF_TEST_CASE_WITHOUT_HEAD(top__reuse); ATF_TEST_CASE_BODY(top__reuse) { config::tree tree; tree.define< config::int_node >("first"); tree.define< config::int_node >("second"); { lutok::state state; config::redirect(state, tree); lutok::do_string(state, "first = 100; second = first * 2"); } ATF_REQUIRE_EQ(100, tree.lookup< config::int_node >("first")); ATF_REQUIRE_EQ(200, tree.lookup< config::int_node >("second")); } ATF_TEST_CASE_WITHOUT_HEAD(top__reset); ATF_TEST_CASE_BODY(top__reset) { config::tree tree; tree.define< config::int_node >("first"); { lutok::state state; config::redirect(state, tree); lutok::do_string(state, "first = 100; first = 200"); } ATF_REQUIRE_EQ(200, tree.lookup< config::int_node >("first")); } ATF_TEST_CASE_WITHOUT_HEAD(top__already_set_on_entry); ATF_TEST_CASE_BODY(top__already_set_on_entry) { config::tree tree; tree.define< config::int_node >("first"); tree.set< config::int_node >("first", 100); { lutok::state state; config::redirect(state, tree); lutok::do_string(state, "first = first * 15"); } ATF_REQUIRE_EQ(1500, tree.lookup< config::int_node >("first")); } ATF_TEST_CASE_WITHOUT_HEAD(subtree__valid_types); ATF_TEST_CASE_BODY(subtree__valid_types) { config::tree tree; tree.define< config::bool_node >("root.boolean"); tree.define< config::int_node >("root.a.integer"); tree.define< config::string_node >("root.string"); { lutok::state state; config::redirect(state, tree); lutok::do_string(state, "root.boolean = true\n" "root.a.integer = 12345\n" "root.string = 'a foo'\n"); } ATF_REQUIRE_EQ(true, tree.lookup< config::bool_node >("root.boolean")); ATF_REQUIRE_EQ(12345, tree.lookup< config::int_node >("root.a.integer")); ATF_REQUIRE_EQ("a foo", tree.lookup< config::string_node >("root.string")); } ATF_TEST_CASE_WITHOUT_HEAD(subtree__reuse); ATF_TEST_CASE_BODY(subtree__reuse) { config::tree tree; tree.define< config::int_node >("a.first"); tree.define< config::int_node >("a.second"); { lutok::state state; config::redirect(state, tree); lutok::do_string(state, "a.first = 100; a.second = a.first * 2"); } ATF_REQUIRE_EQ(100, tree.lookup< config::int_node >("a.first")); ATF_REQUIRE_EQ(200, tree.lookup< config::int_node >("a.second")); } ATF_TEST_CASE_WITHOUT_HEAD(subtree__reset); ATF_TEST_CASE_BODY(subtree__reset) { config::tree tree; tree.define< config::int_node >("a.first"); { lutok::state state; config::redirect(state, tree); lutok::do_string(state, "a.first = 100; a.first = 200"); } ATF_REQUIRE_EQ(200, tree.lookup< config::int_node >("a.first")); } ATF_TEST_CASE_WITHOUT_HEAD(subtree__already_set_on_entry); ATF_TEST_CASE_BODY(subtree__already_set_on_entry) { config::tree tree; tree.define< config::int_node >("a.first"); tree.set< config::int_node >("a.first", 100); { lutok::state state; config::redirect(state, tree); lutok::do_string(state, "a.first = a.first * 15"); } ATF_REQUIRE_EQ(1500, tree.lookup< config::int_node >("a.first")); } ATF_TEST_CASE_WITHOUT_HEAD(subtree__override_inner); ATF_TEST_CASE_BODY(subtree__override_inner) { config::tree tree; tree.define_dynamic("root"); { lutok::state state; config::redirect(state, tree); lutok::do_string(state, "root.test = 'a'"); ATF_REQUIRE_THROW_RE(lutok::error, "Invalid value for key 'root'", lutok::do_string(state, "root = 'b'")); // Ensure that the previous assignment to 'root' did not cause any // inconsistencies in the environment that would prevent a new // assignment from working. lutok::do_string(state, "root.test2 = 'c'"); } ATF_REQUIRE_EQ("a", tree.lookup< config::string_node >("root.test")); ATF_REQUIRE_EQ("c", tree.lookup< config::string_node >("root.test2")); } ATF_TEST_CASE_WITHOUT_HEAD(dynamic_subtree__strings); ATF_TEST_CASE_BODY(dynamic_subtree__strings) { config::tree tree; tree.define_dynamic("root"); lutok::state state; config::redirect(state, tree); lutok::do_string(state, "root.key1 = 1234\n" "root.a.b.key2 = 'foo bar'\n"); ATF_REQUIRE_EQ("1234", tree.lookup< config::string_node >("root.key1")); ATF_REQUIRE_EQ("foo bar", tree.lookup< config::string_node >("root.a.b.key2")); } ATF_TEST_CASE_WITHOUT_HEAD(dynamic_subtree__invalid_types); ATF_TEST_CASE_BODY(dynamic_subtree__invalid_types) { config::tree tree; tree.define_dynamic("root"); lutok::state state; config::redirect(state, tree); ATF_REQUIRE_THROW_RE(lutok::error, "Invalid value for key 'root.boolean' " "\\(Not a string\\)", lutok::do_string(state, "root.boolean = true")); ATF_REQUIRE_THROW_RE(lutok::error, "Invalid value for key 'root.table' " "\\(Not a string\\)", lutok::do_string(state, "root.table = {}")); ATF_REQUIRE(!tree.is_set("root.boolean")); ATF_REQUIRE(!tree.is_set("root.table")); } ATF_TEST_CASE_WITHOUT_HEAD(locals); ATF_TEST_CASE_BODY(locals) { config::tree tree; tree.define< config::int_node >("the_key"); { lutok::state state; config::redirect(state, tree); lutok::do_string(state, "local function generate()\n" " return 15\n" "end\n" "local test_var = 20\n" "the_key = generate() + test_var\n"); } ATF_REQUIRE_EQ(35, tree.lookup< config::int_node >("the_key")); } ATF_TEST_CASE_WITHOUT_HEAD(custom_node); ATF_TEST_CASE_BODY(custom_node) { config::tree tree; tree.define< custom_node >("key1"); tree.define< custom_node >("key2"); tree.set< custom_node >("key2", custom_type(10)); { lutok::state state; config::redirect(state, tree); lutok::do_string(state, "key1 = 512\n"); lutok::do_string(state, "key2 = key2 * 2\n"); } ATF_REQUIRE_EQ(1024, tree.lookup< custom_node >("key1").value); ATF_REQUIRE_EQ(200, tree.lookup< custom_node >("key2").value); } ATF_TEST_CASE_WITHOUT_HEAD(invalid_key); ATF_TEST_CASE_BODY(invalid_key) { config::tree tree; lutok::state state; config::redirect(state, tree); ATF_REQUIRE_THROW_RE(lutok::error, "Empty component in key 'root.'", lutok::do_string(state, "root['']['a'] = 12345\n")); } ATF_TEST_CASE_WITHOUT_HEAD(unknown_key); ATF_TEST_CASE_BODY(unknown_key) { config::tree tree; tree.define< config::bool_node >("static.bool"); lutok::state state; config::redirect(state, tree); ATF_REQUIRE_THROW_RE(lutok::error, "Unknown configuration property 'static.int'", lutok::do_string(state, "static.int = 12345\n")); } ATF_TEST_CASE_WITHOUT_HEAD(value_error); ATF_TEST_CASE_BODY(value_error) { config::tree tree; tree.define< config::bool_node >("a.b"); lutok::state state; config::redirect(state, tree); ATF_REQUIRE_THROW_RE(lutok::error, "Invalid value for key 'a.b' \\(Not a boolean\\)", lutok::do_string(state, "a.b = 12345\n")); ATF_REQUIRE_THROW_RE(lutok::error, "Invalid value for key 'a'", lutok::do_string(state, "a = 1\n")); } ATF_INIT_TEST_CASES(tcs) { ATF_ADD_TEST_CASE(tcs, top__valid_types); ATF_ADD_TEST_CASE(tcs, top__reuse); ATF_ADD_TEST_CASE(tcs, top__reset); ATF_ADD_TEST_CASE(tcs, top__already_set_on_entry); ATF_ADD_TEST_CASE(tcs, subtree__valid_types); ATF_ADD_TEST_CASE(tcs, subtree__reuse); ATF_ADD_TEST_CASE(tcs, subtree__reset); ATF_ADD_TEST_CASE(tcs, subtree__already_set_on_entry); ATF_ADD_TEST_CASE(tcs, subtree__override_inner); ATF_ADD_TEST_CASE(tcs, dynamic_subtree__strings); ATF_ADD_TEST_CASE(tcs, dynamic_subtree__invalid_types); ATF_ADD_TEST_CASE(tcs, locals); ATF_ADD_TEST_CASE(tcs, custom_node); ATF_ADD_TEST_CASE(tcs, invalid_key); ATF_ADD_TEST_CASE(tcs, unknown_key); ATF_ADD_TEST_CASE(tcs, value_error); } @