File: several_threads.pass.cpp

package info (click to toggle)
llvm-toolchain-19 1%3A19.1.7-3~deb12u1
  • links: PTS, VCS
  • area: main
  • in suites: bookworm-proposed-updates
  • size: 1,998,492 kB
  • sloc: cpp: 6,951,680; ansic: 1,486,157; asm: 913,598; python: 232,024; f90: 80,126; objc: 75,281; lisp: 37,276; pascal: 16,990; sh: 10,009; ml: 5,058; perl: 4,724; awk: 3,523; makefile: 3,167; javascript: 2,504; xml: 892; fortran: 664; cs: 573
file content (144 lines) | stat: -rw-r--r-- 2,986 bytes parent folder | download | duplicates (8)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
//===----------------------------------------------------------------------===//
//
// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
// See https://llvm.org/LICENSE.txt for license information.
// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
//
//===----------------------------------------------------------------------===//

// UNSUPPORTED: c++03, c++11, c++14, c++17
// UNSUPPORTED: no-localization
// UNSUPPORTED: no-threads
// UNSUPPORTED: libcpp-has-no-experimental-syncstream

// <syncstream>

// template <class charT, class traits, class Allocator>
// class basic_osyncstream;

// The test writes all elements in test_strings in a random order in ss. Every
// write is done by an osyncstream. This means the output is in random order,
// but the words should be written without interleaving. To increment the
// change of interleaving words are written one character at a time.

#include <cassert>
#include <chrono>
#include <mutex>
#include <sstream>
#include <string>
#include <syncstream>
#include <thread>
#include <unordered_set>
#include <vector>

#include "test_macros.h"

static std::ostringstream ss;

static std::unordered_multiset<std::string> test_strings = {
    "C++ ",
    "is ",
    "a ",
    "general-purpose ",
    "programming ",
    "language ",
    "created ",
    "by ",
    "Bjarne ",
    "Stroustrup ",
    "as ",
    "an ",
    "extension ",
    "of ",
    "the ",
    "C ",
    "programming ",
    "language, ",
    "or ",
    "C ",
    "with ",
    "Classes. ",
    "The ",
    "language ",
    "has ",
    "expanded ",
    "significantly ",
    "over ",
    "time, ",
    "and ",
    "modern ",
    "C++ ",
    "has ",
    "object-oriented, ",
    "generic, ",
    "and ",
    "functional ",
    "features ",
    "in ",
    "addition ",
    "to ",
    "facilities ",
    "for ",
    "low-level ",
    "memory ",
    "manipulation. ",
    "It ",
    "is ",
    "almost ",
    "always ",
    "implemented ",
    "as ",
    "a ",
    "compiled ",
    "language, ",
    "and ",
    "many ",
    "vendors ",
    "provide ",
    "C++ ",
    "compilers, ",
    "including ",
    "the ",
    "Free ",
    "Software ",
    "Foundation, ",
    "LLVM, ",
    "Microsoft, ",
    "Intel, ",
    "and ",
    "IBM, ",
    "so ",
    "it ",
    "is ",
    "available ",
    "on ",
    "many ",
    "platforms."};

void f(std::string text) {
  std::osyncstream out(ss);
  for (char c : text)
    out << c;
}

void test() {
  ss = std::basic_ostringstream<char>();
  std::vector<std::thread> threads;
  for (std::string const& word : test_strings)
    threads.push_back(std::thread(f, word));

  for (auto& thread : threads)
    thread.join();

  std::string output = ss.str();
  for (const std::string& word : test_strings)
    assert(output.find(word) != std::string::npos);
}

int main(int, char**) {
  // The more we test, the more likely we catch an error
  for (size_t i = 0; i < 1024; ++i)
    test();

  return 0;
}