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
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
|
/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4; fill-column: 100 -*- */
/*
* This file is part of the LibreOffice project.
*
* This Source Code Form is subject to the terms of the Mozilla Public
* License, v. 2.0. If a copy of the MPL was not distributed with this
* file, You can obtain one at http://mozilla.org/MPL/2.0/.
*/
#include <config.h>
#include <unistd.h>
#include <algorithm>
#include <chrono>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <iostream>
#include <numeric>
#include <thread>
#include <Poco/Net/HTTPRequest.h>
#include <Poco/Net/HTTPResponse.h>
#include <Poco/Thread.h>
#include <Poco/URI.h>
#include <Poco/Util/Application.h>
#include <Poco/Util/HelpFormatter.h>
#include <Poco/Util/Option.h>
#include <Poco/Util/OptionSet.h>
#include "Replay.hpp"
#include <TraceFile.hpp>
#include <test/helpers.hpp>
/// Stress testing and performance/scalability benchmarking tool.
class Stress: public Poco::Util::Application
{
public:
Stress();
static bool Benchmark;
static size_t Iterations;
static bool NoDelay;
unsigned _numClients;
std::string _serverURI;
protected:
void defineOptions(Poco::Util::OptionSet& options) override;
void handleOption(const std::string& name, const std::string& value) override;
int main(const std::vector<std::string>& args) override;
};
using Poco::Thread;
using Poco::Util::Application;
using Poco::Util::HelpFormatter;
using Poco::Util::Option;
using Poco::Util::OptionSet;
long percentile(std::vector<long>& v, const double percentile)
{
std::sort(v.begin(), v.end());
const size_t N = v.size();
const double n = (N - 1) * percentile / 100.0 + 1;
if (n <= 1)
{
return v[0];
}
else if (n >= N)
{
return v[N - 1];
}
const auto k = static_cast<int>(n);
const double d = n - k;
return v[k - 1] + d * (v[k] - v[k - 1]);
}
std::mutex Connection::Mutex;
//static constexpr auto FIRST_ROW_TILES = "tilecombine part=0 width=256 height=256 tileposx=0,3840,7680 tileposy=0,0,0 tilewidth=3840 tileheight=3840";
static constexpr const char* FIRST_PAGE_TILES = "tilecombine part=0 width=256 height=256 tileposx=0,3840,7680,11520,0,3840,7680,11520,0,3840,7680,11520,0,3840,7680,11520 tileposy=0,0,0,0,3840,3840,3840,3840,7680,7680,7680,7680,11520,11520,11520,11520 tilewidth=3840 tileheight=3840";
static constexpr int FIRST_PAGE_TILE_COUNT = 16;
/// Main thread class to replay a trace file.
class Worker: public Replay
{
public:
Worker(const std::string& serverUri, const std::string& uri) : Replay(serverUri, uri, Stress::NoDelay)
{
}
std::vector<long> getLatencyStats() const { return _latencyStats; }
std::vector<long> getRenderingStats() const { return _renderingStats; }
std::vector<long> getCacheStats() const { return _cacheStats; }
void run() override
{
try
{
if (Stress::Benchmark)
{
benchmark();
}
else
{
replay();
}
}
catch (const Poco::Exception &e)
{
std::cout << "Error: " << e.name() << ' '
<< e.message() << std::endl;
}
catch (const std::exception &e)
{
std::cout << "Error: " << e.what() << std::endl;
}
}
private:
bool modifyDoc(const std::shared_ptr<Connection>& con)
{
const auto startModify = std::chrono::steady_clock::now();
con->send("key type=input char=97 key=0"); // a
//con->send("key type=input char=0 key=1283"); // backspace
const bool success = !con->recv("invalidatetiles:").empty();
const auto now = std::chrono::steady_clock::now();
const std::chrono::microseconds::rep deltaModify = std::chrono::duration_cast<std::chrono::microseconds>(now - startModify).count();
_latencyStats.push_back(deltaModify);
return success;
}
bool renderTile(const std::shared_ptr<Connection>& con)
{
modifyDoc(con);
const auto start = std::chrono::steady_clock::now();
const int expectedTilesCount = FIRST_PAGE_TILE_COUNT;
con->send(FIRST_PAGE_TILES);
for (int i = 0; i < expectedTilesCount; ++i)
{
if (helpers::getTileMessage(*con->getWS(), con->getName()).empty())
{
return false;
}
}
const auto now = std::chrono::steady_clock::now();
const std::chrono::microseconds::rep delta = std::chrono::duration_cast<std::chrono::microseconds>(now - start).count();
_renderingStats.push_back(delta / expectedTilesCount);
return true;
}
bool fetchCachedTile(const std::shared_ptr<Connection>& con)
{
const auto start = std::chrono::steady_clock::now();
const int expectedTilesCount = FIRST_PAGE_TILE_COUNT;
con->send(FIRST_PAGE_TILES);
for (int i = 0; i < expectedTilesCount; ++i)
{
if (helpers::getTileMessage(*con->getWS(), con->getName()).empty())
{
return false;
}
}
const auto now = std::chrono::steady_clock::now();
const std::chrono::microseconds::rep delta = std::chrono::duration_cast<std::chrono::microseconds>(now - start).count();
_cacheStats.push_back(delta / expectedTilesCount);
return true;
}
void benchmark()
{
std::cout << "Running " << Stress::Iterations << " iterations of Benchmark." << std::endl;
_cacheStats.reserve(Stress::Iterations * 4);
_latencyStats.reserve(Stress::Iterations * 4);
_renderingStats.reserve(Stress::Iterations * 4);
static std::atomic<unsigned> SessionId;
const size_t sessionId = ++SessionId;
std::shared_ptr<Connection> connection = Connection::create(_serverUri, _uri, std::to_string(sessionId));
connection->load();
for (size_t i = 0; i < Stress::Iterations; ++i)
{
renderTile(connection);
fetchCachedTile(connection);
}
}
private:
std::vector<long> _latencyStats;
std::vector<long> _renderingStats;
std::vector<long> _cacheStats;
};
bool Stress::NoDelay = false;
bool Stress::Benchmark = false;
size_t Stress::Iterations = 100;
Stress::Stress() :
_numClients(1),
#if ENABLE_SSL
_serverURI("https://127.0.0.1:" + std::to_string(DEFAULT_CLIENT_PORT_NUMBER))
#else
_serverURI("http://127.0.0.1:" + std::to_string(DEFAULT_CLIENT_PORT_NUMBER))
#endif
{
}
void Stress::defineOptions(OptionSet& optionSet)
{
Application::defineOptions(optionSet);
optionSet.addOption(Option("help", "", "Display help information on command line arguments.")
.required(false).repeatable(false));
optionSet.addOption(Option("bench", "", "Performance benchmark. The argument is a document URL to load.")
.required(false).repeatable(false));
optionSet.addOption(Option("iter", "", "Number of iterations to use for Benchmarking.")
.required(false).repeatable(false)
.argument("iter"));
optionSet.addOption(Option("nodelay", "", "Replay at full speed disregarding original timing.")
.required(false).repeatable(false));
optionSet.addOption(Option("clientsperdoc", "", "Number of simultaneous clients on each doc.")
.required(false).repeatable(false)
.argument("concurrency"));
optionSet.addOption(Option("server", "", "URI of LOOL server")
.required(false).repeatable(false)
.argument("uri"));
}
void Stress::handleOption(const std::string& optionName,
const std::string& value)
{
Application::handleOption(optionName, value);
if (optionName == "help")
{
HelpFormatter helpFormatter(options());
helpFormatter.setCommand(commandName());
helpFormatter.setUsage("OPTIONS");
helpFormatter.setHeader("LibreOffice Online tool.");
helpFormatter.format(std::cerr);
std::exit(Application::EXIT_OK);
}
else if (optionName == "bench")
Stress::Benchmark = true;
else if (optionName == "iter")
Stress::Iterations = std::max(std::stoi(value), 1);
else if (optionName == "nodelay")
Stress::NoDelay = true;
else if (optionName == "clientsperdoc")
_numClients = std::max(std::stoi(value), 1);
else if (optionName == "server")
_serverURI = value;
else
{
std::cout << "Unknown option: " << optionName << std::endl;
exit(1);
}
}
int Stress::main(const std::vector<std::string>& args)
{
std::vector<std::unique_ptr<Thread>> clients(_numClients * args.size());
if (args.size() == 0)
{
std::cerr << "Usage: loolstress [--bench] <tracefile | url> " << std::endl;
std::cerr << " Trace files may be plain text or gzipped (with .gz extension)." << std::endl;
std::cerr << " --help for full arguments list." << std::endl;
return Application::EXIT_NOINPUT;
}
std::vector<std::shared_ptr<Worker>> workers;
unsigned index = 0;
for (size_t i = 0; i < args.size(); ++i)
{
std::cout << "Arg: " << args[i] << std::endl;
for (unsigned j = 0; j < _numClients; ++j, ++index)
{
workers.emplace_back(new Worker(_serverURI, args[i]));
clients[index].reset(new Thread());
clients[index]->start(*workers[workers.size() - 1]);
}
}
for (const auto& client : clients)
{
client->join();
}
if (Stress::Benchmark)
{
std::vector<long> latencyStats;
std::vector<long> renderingStats;
std::vector<long> cachedStats;
for (const auto& worker : workers)
{
const std::vector<long> latencyStat = worker->getLatencyStats();
latencyStats.insert(latencyStats.end(), latencyStat.begin(), latencyStat.end());
const std::vector<long> renderingStat = worker->getRenderingStats();
renderingStats.insert(renderingStats.end(), renderingStat.begin(), renderingStat.end());
const std::vector<long> cachedStat = worker->getCacheStats();
cachedStats.insert(cachedStats.end(), cachedStat.begin(), cachedStat.end());
}
if (!latencyStats.empty() && !renderingStats.empty() && !cachedStats.empty())
{
std::cerr << "\nResults:\n";
std::cerr << "Iterations: " << Stress::Iterations << "\n";
std::cerr << "Latency best: " << latencyStats[0] << " microsecs, 95th percentile: " << percentile(latencyStats, 95) << " microsecs." << std::endl;
std::cerr << "Tile best: " << renderingStats[0] << " microsecs, rendering 95th percentile: " << percentile(renderingStats, 95) << " microsecs." << std::endl;
std::cerr << "Cached best: " << cachedStats[0] << " microsecs, tile 95th percentile: " << percentile(cachedStats, 95) << " microsecs." << std::endl;
const auto renderingTime = std::accumulate(renderingStats.begin(), renderingStats.end(), 0L);
const double renderedPixels = 256 * 256 * renderingStats.size();
const double pixelsPerSecRendered = renderedPixels / renderingTime;
std::cerr << "Rendering power: " << pixelsPerSecRendered << " MPixels/sec." << std::endl;
const auto cacheTime = std::accumulate(cachedStats.begin(), cachedStats.end(), 0L);
const double cachePixels = 256 * 256 * cachedStats.size();
const double pixelsPerSecCached = cachePixels / cacheTime;
std::cerr << "Cache power: " << pixelsPerSecCached << " MPixels/sec." << std::endl;
}
}
return Application::EXIT_OK;
}
POCO_APP_MAIN(Stress)
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */
|