1*b0d29bc4SBrooks Davis // Copyright 2010 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 #include <cstdlib>
30*b0d29bc4SBrooks Davis #include <cstring>
31*b0d29bc4SBrooks Davis #include <iostream>
32*b0d29bc4SBrooks Davis
33*b0d29bc4SBrooks Davis #include "utils/defs.hpp"
34*b0d29bc4SBrooks Davis #include "utils/test_utils.ipp"
35*b0d29bc4SBrooks Davis
36*b0d29bc4SBrooks Davis
37*b0d29bc4SBrooks Davis namespace {
38*b0d29bc4SBrooks Davis
39*b0d29bc4SBrooks Davis
40*b0d29bc4SBrooks Davis /// Prints a fake but valid test case list and then aborts.
41*b0d29bc4SBrooks Davis ///
42*b0d29bc4SBrooks Davis /// \param argv The original arguments of the program.
43*b0d29bc4SBrooks Davis ///
44*b0d29bc4SBrooks Davis /// \return Nothing because this dies before returning.
45*b0d29bc4SBrooks Davis static int
helper_abort_test_cases_list(int,char ** argv)46*b0d29bc4SBrooks Davis helper_abort_test_cases_list(int /* argc */, char** argv)
47*b0d29bc4SBrooks Davis {
48*b0d29bc4SBrooks Davis for (const char* const* arg = argv; *arg != NULL; arg++) {
49*b0d29bc4SBrooks Davis if (std::strcmp(*arg, "-l") == 0) {
50*b0d29bc4SBrooks Davis std::cout << "Content-Type: application/X-atf-tp; "
51*b0d29bc4SBrooks Davis "version=\"1\"\n\n";
52*b0d29bc4SBrooks Davis std::cout << "ident: foo\n";
53*b0d29bc4SBrooks Davis }
54*b0d29bc4SBrooks Davis }
55*b0d29bc4SBrooks Davis utils::abort_without_coredump();
56*b0d29bc4SBrooks Davis }
57*b0d29bc4SBrooks Davis
58*b0d29bc4SBrooks Davis
59*b0d29bc4SBrooks Davis /// Just returns without printing anything as the test case list.
60*b0d29bc4SBrooks Davis ///
61*b0d29bc4SBrooks Davis /// \return Always 0, as required for test programs.
62*b0d29bc4SBrooks Davis static int
helper_empty_test_cases_list(int,char **)63*b0d29bc4SBrooks Davis helper_empty_test_cases_list(int /* argc */, char** /* argv */)
64*b0d29bc4SBrooks Davis {
65*b0d29bc4SBrooks Davis return EXIT_SUCCESS;
66*b0d29bc4SBrooks Davis }
67*b0d29bc4SBrooks Davis
68*b0d29bc4SBrooks Davis
69*b0d29bc4SBrooks Davis /// Prints a correctly-formatted test case list but empty.
70*b0d29bc4SBrooks Davis ///
71*b0d29bc4SBrooks Davis /// \param argv The original arguments of the program.
72*b0d29bc4SBrooks Davis ///
73*b0d29bc4SBrooks Davis /// \return Always 0, as required for test programs.
74*b0d29bc4SBrooks Davis static int
helper_zero_test_cases(int,char ** argv)75*b0d29bc4SBrooks Davis helper_zero_test_cases(int /* argc */, char** argv)
76*b0d29bc4SBrooks Davis {
77*b0d29bc4SBrooks Davis for (const char* const* arg = argv; *arg != NULL; arg++) {
78*b0d29bc4SBrooks Davis if (std::strcmp(*arg, "-l") == 0)
79*b0d29bc4SBrooks Davis std::cout << "Content-Type: application/X-atf-tp; "
80*b0d29bc4SBrooks Davis "version=\"1\"\n\n";
81*b0d29bc4SBrooks Davis }
82*b0d29bc4SBrooks Davis return EXIT_SUCCESS;
83*b0d29bc4SBrooks Davis }
84*b0d29bc4SBrooks Davis
85*b0d29bc4SBrooks Davis
86*b0d29bc4SBrooks Davis /// Mapping of the name of a helper to its implementation.
87*b0d29bc4SBrooks Davis struct helper {
88*b0d29bc4SBrooks Davis /// The name of the helper, as will be provided by the user on the CLI.
89*b0d29bc4SBrooks Davis const char* name;
90*b0d29bc4SBrooks Davis
91*b0d29bc4SBrooks Davis /// A pointer to the function implementing the helper.
92*b0d29bc4SBrooks Davis int (*hook)(int, char**);
93*b0d29bc4SBrooks Davis };
94*b0d29bc4SBrooks Davis
95*b0d29bc4SBrooks Davis
96*b0d29bc4SBrooks Davis /// NULL-terminated table mapping helper names to their implementations.
97*b0d29bc4SBrooks Davis static const helper helpers[] = {
98*b0d29bc4SBrooks Davis { "abort_test_cases_list", helper_abort_test_cases_list, },
99*b0d29bc4SBrooks Davis { "empty_test_cases_list", helper_empty_test_cases_list, },
100*b0d29bc4SBrooks Davis { "zero_test_cases", helper_zero_test_cases, },
101*b0d29bc4SBrooks Davis { NULL, NULL, },
102*b0d29bc4SBrooks Davis };
103*b0d29bc4SBrooks Davis
104*b0d29bc4SBrooks Davis
105*b0d29bc4SBrooks Davis } // anonymous namespace
106*b0d29bc4SBrooks Davis
107*b0d29bc4SBrooks Davis
108*b0d29bc4SBrooks Davis /// Entry point to the ATF-less helpers.
109*b0d29bc4SBrooks Davis ///
110*b0d29bc4SBrooks Davis /// The caller must select a helper to execute by defining the HELPER
111*b0d29bc4SBrooks Davis /// environment variable to the name of the desired helper. Think of this main
112*b0d29bc4SBrooks Davis /// method as a subprogram dispatcher, to avoid having many individual helper
113*b0d29bc4SBrooks Davis /// binaries.
114*b0d29bc4SBrooks Davis ///
115*b0d29bc4SBrooks Davis /// \todo Maybe we should really have individual helper binaries. It would
116*b0d29bc4SBrooks Davis /// avoid a significant amount of complexity here and in the tests, at the
117*b0d29bc4SBrooks Davis /// expense of some extra files and extra build logic.
118*b0d29bc4SBrooks Davis ///
119*b0d29bc4SBrooks Davis /// \param argc The user argument count; delegated to the helper.
120*b0d29bc4SBrooks Davis /// \param argv The user arguments; delegated to the helper.
121*b0d29bc4SBrooks Davis ///
122*b0d29bc4SBrooks Davis /// \return The exit code of the helper, which depends on the requested helper.
123*b0d29bc4SBrooks Davis int
main(int argc,char ** argv)124*b0d29bc4SBrooks Davis main(int argc, char** argv)
125*b0d29bc4SBrooks Davis {
126*b0d29bc4SBrooks Davis const char* command = std::getenv("HELPER");
127*b0d29bc4SBrooks Davis if (command == NULL) {
128*b0d29bc4SBrooks Davis std::cerr << "Usage error: HELPER must be set to a helper name\n";
129*b0d29bc4SBrooks Davis std::exit(EXIT_FAILURE);
130*b0d29bc4SBrooks Davis }
131*b0d29bc4SBrooks Davis
132*b0d29bc4SBrooks Davis const struct helper* iter = helpers;
133*b0d29bc4SBrooks Davis for (; iter->name != NULL && std::strcmp(iter->name, command) != 0; iter++)
134*b0d29bc4SBrooks Davis ;
135*b0d29bc4SBrooks Davis if (iter->name == NULL) {
136*b0d29bc4SBrooks Davis std::cerr << "Usage error: unknown command " << command << "\n";
137*b0d29bc4SBrooks Davis std::exit(EXIT_FAILURE);
138*b0d29bc4SBrooks Davis }
139*b0d29bc4SBrooks Davis
140*b0d29bc4SBrooks Davis return iter->hook(argc, argv);
141*b0d29bc4SBrooks Davis }
142