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 // Dumps all environment variables.
30*b0d29bc4SBrooks Davis //
31*b0d29bc4SBrooks Davis // This helper program allows comparing the printed environment variables
32*b0d29bc4SBrooks Davis // to what 'kyua report --verbose' may output. It does so by sorting the
33*b0d29bc4SBrooks Davis // variables and allowing the caller to customize how the output looks
34*b0d29bc4SBrooks Davis // like (indentation for each line and for continuation lines).
35*b0d29bc4SBrooks Davis
36*b0d29bc4SBrooks Davis #include <cstdlib>
37*b0d29bc4SBrooks Davis #include <iostream>
38*b0d29bc4SBrooks Davis
39*b0d29bc4SBrooks Davis #include "utils/env.hpp"
40*b0d29bc4SBrooks Davis #include "utils/text/operations.ipp"
41*b0d29bc4SBrooks Davis
42*b0d29bc4SBrooks Davis namespace text = utils::text;
43*b0d29bc4SBrooks Davis
44*b0d29bc4SBrooks Davis
45*b0d29bc4SBrooks Davis int
main(const int argc,const char * const * const argv)46*b0d29bc4SBrooks Davis main(const int argc, const char* const* const argv)
47*b0d29bc4SBrooks Davis {
48*b0d29bc4SBrooks Davis if (argc != 3) {
49*b0d29bc4SBrooks Davis std::cerr << "Usage: dump_env <prefix> <continuation-prefix>\n";
50*b0d29bc4SBrooks Davis return EXIT_FAILURE;
51*b0d29bc4SBrooks Davis }
52*b0d29bc4SBrooks Davis const char* prefix = argv[1];
53*b0d29bc4SBrooks Davis const char* continuation_prefix = argv[2];
54*b0d29bc4SBrooks Davis
55*b0d29bc4SBrooks Davis const std::map< std::string, std::string > env = utils::getallenv();
56*b0d29bc4SBrooks Davis for (std::map< std::string, std::string >::const_iterator
57*b0d29bc4SBrooks Davis iter = env.begin(); iter != env.end(); ++iter) {
58*b0d29bc4SBrooks Davis const std::string& name = (*iter).first;
59*b0d29bc4SBrooks Davis const std::vector< std::string > value = text::split(
60*b0d29bc4SBrooks Davis (*iter).second, '\n');
61*b0d29bc4SBrooks Davis
62*b0d29bc4SBrooks Davis if (value.empty()) {
63*b0d29bc4SBrooks Davis std::cout << prefix << name << "=\n";
64*b0d29bc4SBrooks Davis } else {
65*b0d29bc4SBrooks Davis std::cout << prefix << name << '=' << value[0] << '\n';
66*b0d29bc4SBrooks Davis for (std::vector< std::string >::size_type i = 1;
67*b0d29bc4SBrooks Davis i < value.size(); ++i) {
68*b0d29bc4SBrooks Davis std::cout << continuation_prefix << value[i] << '\n';
69*b0d29bc4SBrooks Davis }
70*b0d29bc4SBrooks Davis }
71*b0d29bc4SBrooks Davis }
72*b0d29bc4SBrooks Davis
73*b0d29bc4SBrooks Davis return EXIT_SUCCESS;
74*b0d29bc4SBrooks Davis }
75