1*b0d29bc4SBrooks Davis // Copyright 2015 The Kyua Authors. 2*b0d29bc4SBrooks Davis // All rights reserved. 3*b0d29bc4SBrooks Davis // 4*b0d29bc4SBrooks Davis // Redistribution and use in source and binary forms, with or without 5*b0d29bc4SBrooks Davis // modification, are permitted provided that the following conditions are 6*b0d29bc4SBrooks Davis // met: 7*b0d29bc4SBrooks Davis // 8*b0d29bc4SBrooks Davis // * Redistributions of source code must retain the above copyright 9*b0d29bc4SBrooks Davis // notice, this list of conditions and the following disclaimer. 10*b0d29bc4SBrooks Davis // * Redistributions in binary form must reproduce the above copyright 11*b0d29bc4SBrooks Davis // notice, this list of conditions and the following disclaimer in the 12*b0d29bc4SBrooks Davis // documentation and/or other materials provided with the distribution. 13*b0d29bc4SBrooks Davis // * Neither the name of Google Inc. nor the names of its contributors 14*b0d29bc4SBrooks Davis // may be used to endorse or promote products derived from this software 15*b0d29bc4SBrooks Davis // without specific prior written permission. 16*b0d29bc4SBrooks Davis // 17*b0d29bc4SBrooks Davis // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS 18*b0d29bc4SBrooks Davis // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT 19*b0d29bc4SBrooks Davis // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR 20*b0d29bc4SBrooks Davis // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT 21*b0d29bc4SBrooks Davis // OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, 22*b0d29bc4SBrooks Davis // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT 23*b0d29bc4SBrooks Davis // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, 24*b0d29bc4SBrooks Davis // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY 25*b0d29bc4SBrooks Davis // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT 26*b0d29bc4SBrooks Davis // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE 27*b0d29bc4SBrooks Davis // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 28*b0d29bc4SBrooks Davis 29*b0d29bc4SBrooks Davis /// \file engine/tap_parser.hpp 30*b0d29bc4SBrooks Davis /// Utilities to parse TAP test program output. 31*b0d29bc4SBrooks Davis 32*b0d29bc4SBrooks Davis #if !defined(ENGINE_TAP_PARSER_HPP) 33*b0d29bc4SBrooks Davis #define ENGINE_TAP_PARSER_HPP 34*b0d29bc4SBrooks Davis 35*b0d29bc4SBrooks Davis #include "engine/tap_parser_fwd.hpp" 36*b0d29bc4SBrooks Davis 37*b0d29bc4SBrooks Davis #include <cstddef> 38*b0d29bc4SBrooks Davis #include <ostream> 39*b0d29bc4SBrooks Davis #include <string> 40*b0d29bc4SBrooks Davis 41*b0d29bc4SBrooks Davis #include "utils/fs/path_fwd.hpp" 42*b0d29bc4SBrooks Davis 43*b0d29bc4SBrooks Davis namespace engine { 44*b0d29bc4SBrooks Davis 45*b0d29bc4SBrooks Davis 46*b0d29bc4SBrooks Davis /// TAP plan representing all tests being skipped. 47*b0d29bc4SBrooks Davis extern const engine::tap_plan all_skipped_plan; 48*b0d29bc4SBrooks Davis 49*b0d29bc4SBrooks Davis 50*b0d29bc4SBrooks Davis /// TAP output representation and parser. 51*b0d29bc4SBrooks Davis class tap_summary { 52*b0d29bc4SBrooks Davis /// Whether the test program bailed out early or not. 53*b0d29bc4SBrooks Davis bool _bailed_out; 54*b0d29bc4SBrooks Davis 55*b0d29bc4SBrooks Davis /// The TAP plan. Only valid if not bailed out. 56*b0d29bc4SBrooks Davis tap_plan _plan; 57*b0d29bc4SBrooks Davis 58*b0d29bc4SBrooks Davis /// If not empty, the reason why all tests were skipped. 59*b0d29bc4SBrooks Davis std::string _all_skipped_reason; 60*b0d29bc4SBrooks Davis 61*b0d29bc4SBrooks Davis /// Total number of 'ok' tests. Only valid if not balied out. 62*b0d29bc4SBrooks Davis std::size_t _ok_count; 63*b0d29bc4SBrooks Davis 64*b0d29bc4SBrooks Davis /// Total number of 'not ok' tests. Only valid if not balied out. 65*b0d29bc4SBrooks Davis std::size_t _not_ok_count; 66*b0d29bc4SBrooks Davis 67*b0d29bc4SBrooks Davis tap_summary(const bool, const tap_plan&, const std::string&, 68*b0d29bc4SBrooks Davis const std::size_t, const std::size_t); 69*b0d29bc4SBrooks Davis 70*b0d29bc4SBrooks Davis public: 71*b0d29bc4SBrooks Davis // Yes, these three constructors indicate that we really ought to have three 72*b0d29bc4SBrooks Davis // different classes and select between them at runtime. But doing so would 73*b0d29bc4SBrooks Davis // be overly complex for our really simple needs here. 74*b0d29bc4SBrooks Davis static tap_summary new_bailed_out(void); 75*b0d29bc4SBrooks Davis static tap_summary new_all_skipped(const std::string&); 76*b0d29bc4SBrooks Davis static tap_summary new_results(const tap_plan&, const std::size_t, 77*b0d29bc4SBrooks Davis const std::size_t); 78*b0d29bc4SBrooks Davis 79*b0d29bc4SBrooks Davis bool bailed_out(void) const; 80*b0d29bc4SBrooks Davis const tap_plan& plan(void) const; 81*b0d29bc4SBrooks Davis const std::string& all_skipped_reason(void) const; 82*b0d29bc4SBrooks Davis std::size_t ok_count(void) const; 83*b0d29bc4SBrooks Davis std::size_t not_ok_count(void) const; 84*b0d29bc4SBrooks Davis 85*b0d29bc4SBrooks Davis bool operator==(const tap_summary&) const; 86*b0d29bc4SBrooks Davis bool operator!=(const tap_summary&) const; 87*b0d29bc4SBrooks Davis }; 88*b0d29bc4SBrooks Davis 89*b0d29bc4SBrooks Davis 90*b0d29bc4SBrooks Davis std::ostream& operator<<(std::ostream&, const tap_summary&); 91*b0d29bc4SBrooks Davis 92*b0d29bc4SBrooks Davis 93*b0d29bc4SBrooks Davis tap_summary parse_tap_output(const utils::fs::path&); 94*b0d29bc4SBrooks Davis 95*b0d29bc4SBrooks Davis 96*b0d29bc4SBrooks Davis } // namespace engine 97*b0d29bc4SBrooks Davis 98*b0d29bc4SBrooks Davis 99*b0d29bc4SBrooks Davis #endif // !defined(ENGINE_TAP_PARSER_HPP) 100