head 1.1; branch 1.1.1; access; symbols netbsd-11-0-RC4:1.1.1.1 netbsd-11-0-RC3:1.1.1.1 netbsd-11-0-RC2:1.1.1.1 netbsd-11-0-RC1:1.1.1.1 perseant-exfatfs-base-20250801:1.1.1.1 netbsd-11:1.1.1.1.0.50 netbsd-11-base:1.1.1.1 netbsd-10-1-RELEASE:1.1.1.1 perseant-exfatfs-base-20240630:1.1.1.1 perseant-exfatfs:1.1.1.1.0.48 perseant-exfatfs-base:1.1.1.1 netbsd-8-3-RELEASE:1.1.1.1 netbsd-9-4-RELEASE:1.1.1.1 netbsd-10-0-RELEASE:1.1.1.1 netbsd-10-0-RC6:1.1.1.1 netbsd-10-0-RC5:1.1.1.1 netbsd-10-0-RC4:1.1.1.1 netbsd-10-0-RC3:1.1.1.1 netbsd-10-0-RC2:1.1.1.1 netbsd-10-0-RC1:1.1.1.1 netbsd-10:1.1.1.1.0.46 netbsd-10-base:1.1.1.1 netbsd-9-3-RELEASE:1.1.1.1 cjep_sun2x-base1:1.1.1.1 cjep_sun2x:1.1.1.1.0.44 cjep_sun2x-base:1.1.1.1 cjep_staticlib_x-base1:1.1.1.1 netbsd-9-2-RELEASE:1.1.1.1 cjep_staticlib_x:1.1.1.1.0.42 cjep_staticlib_x-base:1.1.1.1 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.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.16; 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.1 log @Initial revision @ 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/tree.hpp" #if !defined(UTILS_CONFIG_TREE_IPP) #define UTILS_CONFIG_TREE_IPP #include #include "utils/config/exceptions.hpp" #include "utils/config/nodes.ipp" #include "utils/format/macros.hpp" #include "utils/sanity.hpp" namespace utils { /// Registers a key as valid and having a specific type. /// /// This method does not raise errors on invalid/unknown keys or other /// tree-related issues. The reasons is that define() is a method that does not /// depend on user input: it is intended to pre-populate the tree with a /// specific structure, and that happens once at coding time. /// /// \tparam LeafType The node type of the leaf we are defining. /// \param dotted_key The key to be registered in dotted representation. template< class LeafType > void config::tree::define(const std::string& dotted_key) { try { const detail::tree_key key = detail::parse_key(dotted_key); _root->define(key, 0, detail::new_node< LeafType >); } catch (const error& e) { UNREACHABLE_MSG(F("define() failing due to key errors is a programming " "mistake: %s") % e.what()); } } /// Gets a read-only reference to the value of a leaf addressed by its key. /// /// \tparam LeafType The node type of the leaf we are querying. /// \param dotted_key The key to be registered in dotted representation. /// /// \return A reference to the value in the located leaf, if successful. /// /// \throw invalid_key_error If the provided key has an invalid format. /// \throw unknown_key_error If the provided key is unknown. template< class LeafType > const typename LeafType::value_type& config::tree::lookup(const std::string& dotted_key) const { const detail::tree_key key = detail::parse_key(dotted_key); const detail::base_node* raw_node = _root->lookup_ro(key, 0); try { const LeafType& child = dynamic_cast< const LeafType& >(*raw_node); if (child.is_set()) return child.value(); else throw unknown_key_error(key); } catch (const std::bad_cast& unused_error) { throw unknown_key_error(key); } } /// Gets a read-write reference to the value of a leaf addressed by its key. /// /// \tparam LeafType The node type of the leaf we are querying. /// \param dotted_key The key to be registered in dotted representation. /// /// \return A reference to the value in the located leaf, if successful. /// /// \throw invalid_key_error If the provided key has an invalid format. /// \throw unknown_key_error If the provided key is unknown. template< class LeafType > typename LeafType::value_type& config::tree::lookup_rw(const std::string& dotted_key) { const detail::tree_key key = detail::parse_key(dotted_key); detail::base_node* raw_node = _root->lookup_rw( key, 0, detail::new_node< LeafType >); try { LeafType& child = dynamic_cast< LeafType& >(*raw_node); if (child.is_set()) return child.value(); else throw unknown_key_error(key); } catch (const std::bad_cast& unused_error) { throw unknown_key_error(key); } } /// Sets the value of a leaf addressed by its key. /// /// \tparam LeafType The node type of the leaf we are setting. /// \param dotted_key The key to be registered in dotted representation. /// \param value The value to set into the node. /// /// \throw invalid_key_error If the provided key has an invalid format. /// \throw unknown_key_error If the provided key is unknown. /// \throw value_error If the value mismatches the node type. template< class LeafType > void config::tree::set(const std::string& dotted_key, const typename LeafType::value_type& value) { const detail::tree_key key = detail::parse_key(dotted_key); leaf_node* raw_node = _root->lookup_rw(key, 0, detail::new_node< LeafType >); try { LeafType& child = dynamic_cast< LeafType& >(*raw_node); child.set(value); } catch (const std::bad_cast& unused_error) { throw value_error(F("Invalid value for key '%s'") % detail::flatten_key(key)); } } } // namespace utils #endif // !defined(UTILS_CONFIG_TREE_IPP) @ 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 tree.ipp was added on branch yamt-pagecache on 2014-05-22 15:45:29 +0000 @ text @d1 151 @ 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 151 // 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/tree.hpp" #if !defined(UTILS_CONFIG_TREE_IPP) #define UTILS_CONFIG_TREE_IPP #include #include "utils/config/exceptions.hpp" #include "utils/config/nodes.ipp" #include "utils/format/macros.hpp" #include "utils/sanity.hpp" namespace utils { /// Registers a key as valid and having a specific type. /// /// This method does not raise errors on invalid/unknown keys or other /// tree-related issues. The reasons is that define() is a method that does not /// depend on user input: it is intended to pre-populate the tree with a /// specific structure, and that happens once at coding time. /// /// \tparam LeafType The node type of the leaf we are defining. /// \param dotted_key The key to be registered in dotted representation. template< class LeafType > void config::tree::define(const std::string& dotted_key) { try { const detail::tree_key key = detail::parse_key(dotted_key); _root->define(key, 0, detail::new_node< LeafType >); } catch (const error& e) { UNREACHABLE_MSG(F("define() failing due to key errors is a programming " "mistake: %s") % e.what()); } } /// Gets a read-only reference to the value of a leaf addressed by its key. /// /// \tparam LeafType The node type of the leaf we are querying. /// \param dotted_key The key to be registered in dotted representation. /// /// \return A reference to the value in the located leaf, if successful. /// /// \throw invalid_key_error If the provided key has an invalid format. /// \throw unknown_key_error If the provided key is unknown. template< class LeafType > const typename LeafType::value_type& config::tree::lookup(const std::string& dotted_key) const { const detail::tree_key key = detail::parse_key(dotted_key); const detail::base_node* raw_node = _root->lookup_ro(key, 0); try { const LeafType& child = dynamic_cast< const LeafType& >(*raw_node); if (child.is_set()) return child.value(); else throw unknown_key_error(key); } catch (const std::bad_cast& unused_error) { throw unknown_key_error(key); } } /// Gets a read-write reference to the value of a leaf addressed by its key. /// /// \tparam LeafType The node type of the leaf we are querying. /// \param dotted_key The key to be registered in dotted representation. /// /// \return A reference to the value in the located leaf, if successful. /// /// \throw invalid_key_error If the provided key has an invalid format. /// \throw unknown_key_error If the provided key is unknown. template< class LeafType > typename LeafType::value_type& config::tree::lookup_rw(const std::string& dotted_key) { const detail::tree_key key = detail::parse_key(dotted_key); detail::base_node* raw_node = _root->lookup_rw( key, 0, detail::new_node< LeafType >); try { LeafType& child = dynamic_cast< LeafType& >(*raw_node); if (child.is_set()) return child.value(); else throw unknown_key_error(key); } catch (const std::bad_cast& unused_error) { throw unknown_key_error(key); } } /// Sets the value of a leaf addressed by its key. /// /// \tparam LeafType The node type of the leaf we are setting. /// \param dotted_key The key to be registered in dotted representation. /// \param value The value to set into the node. /// /// \throw invalid_key_error If the provided key has an invalid format. /// \throw unknown_key_error If the provided key is unknown. /// \throw value_error If the value mismatches the node type. template< class LeafType > void config::tree::set(const std::string& dotted_key, const typename LeafType::value_type& value) { const detail::tree_key key = detail::parse_key(dotted_key); leaf_node* raw_node = _root->lookup_rw(key, 0, detail::new_node< LeafType >); try { LeafType& child = dynamic_cast< LeafType& >(*raw_node); child.set(value); } catch (const std::bad_cast& unused_error) { throw value_error(F("Invalid value for key '%s'") % detail::flatten_key(key)); } } } // namespace utils #endif // !defined(UTILS_CONFIG_TREE_IPP) @ 1.1.1.1.4.1 log @file tree.ipp was added on branch tls-maxphys on 2013-02-25 00:26:16 +0000 @ text @d1 151 @ 1.1.1.1.4.2 log @resync with head @ text @a0 151 // 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/tree.hpp" #if !defined(UTILS_CONFIG_TREE_IPP) #define UTILS_CONFIG_TREE_IPP #include #include "utils/config/exceptions.hpp" #include "utils/config/nodes.ipp" #include "utils/format/macros.hpp" #include "utils/sanity.hpp" namespace utils { /// Registers a key as valid and having a specific type. /// /// This method does not raise errors on invalid/unknown keys or other /// tree-related issues. The reasons is that define() is a method that does not /// depend on user input: it is intended to pre-populate the tree with a /// specific structure, and that happens once at coding time. /// /// \tparam LeafType The node type of the leaf we are defining. /// \param dotted_key The key to be registered in dotted representation. template< class LeafType > void config::tree::define(const std::string& dotted_key) { try { const detail::tree_key key = detail::parse_key(dotted_key); _root->define(key, 0, detail::new_node< LeafType >); } catch (const error& e) { UNREACHABLE_MSG(F("define() failing due to key errors is a programming " "mistake: %s") % e.what()); } } /// Gets a read-only reference to the value of a leaf addressed by its key. /// /// \tparam LeafType The node type of the leaf we are querying. /// \param dotted_key The key to be registered in dotted representation. /// /// \return A reference to the value in the located leaf, if successful. /// /// \throw invalid_key_error If the provided key has an invalid format. /// \throw unknown_key_error If the provided key is unknown. template< class LeafType > const typename LeafType::value_type& config::tree::lookup(const std::string& dotted_key) const { const detail::tree_key key = detail::parse_key(dotted_key); const detail::base_node* raw_node = _root->lookup_ro(key, 0); try { const LeafType& child = dynamic_cast< const LeafType& >(*raw_node); if (child.is_set()) return child.value(); else throw unknown_key_error(key); } catch (const std::bad_cast& unused_error) { throw unknown_key_error(key); } } /// Gets a read-write reference to the value of a leaf addressed by its key. /// /// \tparam LeafType The node type of the leaf we are querying. /// \param dotted_key The key to be registered in dotted representation. /// /// \return A reference to the value in the located leaf, if successful. /// /// \throw invalid_key_error If the provided key has an invalid format. /// \throw unknown_key_error If the provided key is unknown. template< class LeafType > typename LeafType::value_type& config::tree::lookup_rw(const std::string& dotted_key) { const detail::tree_key key = detail::parse_key(dotted_key); detail::base_node* raw_node = _root->lookup_rw( key, 0, detail::new_node< LeafType >); try { LeafType& child = dynamic_cast< LeafType& >(*raw_node); if (child.is_set()) return child.value(); else throw unknown_key_error(key); } catch (const std::bad_cast& unused_error) { throw unknown_key_error(key); } } /// Sets the value of a leaf addressed by its key. /// /// \tparam LeafType The node type of the leaf we are setting. /// \param dotted_key The key to be registered in dotted representation. /// \param value The value to set into the node. /// /// \throw invalid_key_error If the provided key has an invalid format. /// \throw unknown_key_error If the provided key is unknown. /// \throw value_error If the value mismatches the node type. template< class LeafType > void config::tree::set(const std::string& dotted_key, const typename LeafType::value_type& value) { const detail::tree_key key = detail::parse_key(dotted_key); leaf_node* raw_node = _root->lookup_rw(key, 0, detail::new_node< LeafType >); try { LeafType& child = dynamic_cast< LeafType& >(*raw_node); child.set(value); } catch (const std::bad_cast& unused_error) { throw value_error(F("Invalid value for key '%s'") % detail::flatten_key(key)); } } } // namespace utils #endif // !defined(UTILS_CONFIG_TREE_IPP) @