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 integration/helpers/race.cpp
30*b0d29bc4SBrooks Davis /// Creates a file and reads it back, looking for races.
31*b0d29bc4SBrooks Davis ///
32*b0d29bc4SBrooks Davis /// This program should fail with high chances if it is called multiple times at
33*b0d29bc4SBrooks Davis /// once with TEST_ENV_shared_file pointing to the same file.
34*b0d29bc4SBrooks Davis
35*b0d29bc4SBrooks Davis extern "C" {
36*b0d29bc4SBrooks Davis #include <sys/types.h>
37*b0d29bc4SBrooks Davis
38*b0d29bc4SBrooks Davis #include <unistd.h>
39*b0d29bc4SBrooks Davis }
40*b0d29bc4SBrooks Davis
41*b0d29bc4SBrooks Davis #include <cstdlib>
42*b0d29bc4SBrooks Davis #include <fstream>
43*b0d29bc4SBrooks Davis #include <iostream>
44*b0d29bc4SBrooks Davis
45*b0d29bc4SBrooks Davis #include "utils/format/macros.hpp"
46*b0d29bc4SBrooks Davis #include "utils/fs/operations.hpp"
47*b0d29bc4SBrooks Davis #include "utils/fs/path.hpp"
48*b0d29bc4SBrooks Davis #include "utils/env.hpp"
49*b0d29bc4SBrooks Davis #include "utils/optional.ipp"
50*b0d29bc4SBrooks Davis #include "utils/stream.hpp"
51*b0d29bc4SBrooks Davis
52*b0d29bc4SBrooks Davis namespace fs = utils::fs;
53*b0d29bc4SBrooks Davis
54*b0d29bc4SBrooks Davis using utils::optional;
55*b0d29bc4SBrooks Davis
56*b0d29bc4SBrooks Davis
57*b0d29bc4SBrooks Davis /// Entry point to the helper test program.
58*b0d29bc4SBrooks Davis ///
59*b0d29bc4SBrooks Davis /// \return EXIT_SUCCESS if no race is detected; EXIT_FAILURE otherwise.
60*b0d29bc4SBrooks Davis int
main(void)61*b0d29bc4SBrooks Davis main(void)
62*b0d29bc4SBrooks Davis {
63*b0d29bc4SBrooks Davis const optional< std::string > shared_file = utils::getenv(
64*b0d29bc4SBrooks Davis "TEST_ENV_shared_file");
65*b0d29bc4SBrooks Davis if (!shared_file) {
66*b0d29bc4SBrooks Davis std::cerr << "Environment variable TEST_ENV_shared_file not defined\n";
67*b0d29bc4SBrooks Davis std::exit(EXIT_FAILURE);
68*b0d29bc4SBrooks Davis }
69*b0d29bc4SBrooks Davis const fs::path shared_path(shared_file.get());
70*b0d29bc4SBrooks Davis
71*b0d29bc4SBrooks Davis if (fs::exists(shared_path)) {
72*b0d29bc4SBrooks Davis std::cerr << "Shared file already exists; created by a concurrent "
73*b0d29bc4SBrooks Davis "test?";
74*b0d29bc4SBrooks Davis std::exit(EXIT_FAILURE);
75*b0d29bc4SBrooks Davis }
76*b0d29bc4SBrooks Davis
77*b0d29bc4SBrooks Davis const std::string contents = F("%s") % ::getpid();
78*b0d29bc4SBrooks Davis
79*b0d29bc4SBrooks Davis std::ofstream output(shared_path.c_str());
80*b0d29bc4SBrooks Davis if (!output) {
81*b0d29bc4SBrooks Davis std::cerr << "Failed to create shared file; conflict with a concurrent "
82*b0d29bc4SBrooks Davis "test?";
83*b0d29bc4SBrooks Davis std::exit(EXIT_FAILURE);
84*b0d29bc4SBrooks Davis }
85*b0d29bc4SBrooks Davis output << contents;
86*b0d29bc4SBrooks Davis output.close();
87*b0d29bc4SBrooks Davis
88*b0d29bc4SBrooks Davis ::usleep(10000);
89*b0d29bc4SBrooks Davis
90*b0d29bc4SBrooks Davis const std::string read_contents = utils::read_file(shared_path);
91*b0d29bc4SBrooks Davis if (read_contents != contents) {
92*b0d29bc4SBrooks Davis std::cerr << "Shared file contains unexpected contents; modified by a "
93*b0d29bc4SBrooks Davis "concurrent test?";
94*b0d29bc4SBrooks Davis std::exit(EXIT_FAILURE);
95*b0d29bc4SBrooks Davis }
96*b0d29bc4SBrooks Davis
97*b0d29bc4SBrooks Davis fs::unlink(shared_path);
98*b0d29bc4SBrooks Davis std::exit(EXIT_SUCCESS);
99*b0d29bc4SBrooks Davis }
100