OLD | NEW |
1 /* Copyright (c) 2010, Google Inc. | 1 /* |
| 2 * |
| 3 * Copyright 2015-2016, Google Inc. |
2 * All rights reserved. | 4 * All rights reserved. |
3 * | 5 * |
4 * Redistribution and use in source and binary forms, with or without | 6 * Redistribution and use in source and binary forms, with or without |
5 * modification, are permitted provided that the following conditions are | 7 * modification, are permitted provided that the following conditions are |
6 * met: | 8 * met: |
7 * | 9 * |
8 * * Redistributions of source code must retain the above copyright | 10 * * Redistributions of source code must retain the above copyright |
9 * notice, this list of conditions and the following disclaimer. | 11 * notice, this list of conditions and the following disclaimer. |
10 * * Redistributions in binary form must reproduce the above | 12 * * Redistributions in binary form must reproduce the above |
11 * copyright notice, this list of conditions and the following disclaimer | 13 * copyright notice, this list of conditions and the following disclaimer |
12 * in the documentation and/or other materials provided with the | 14 * in the documentation and/or other materials provided with the |
13 * distribution. | 15 * distribution. |
14 * * Neither the name of Google Inc. nor the names of its | 16 * * Neither the name of Google Inc. nor the names of its |
15 * contributors may be used to endorse or promote products derived from | 17 * contributors may be used to endorse or promote products derived from |
16 * this software without specific prior written permission. | 18 * this software without specific prior written permission. |
17 * | 19 * |
18 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS | 20 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS |
19 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT | 21 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT |
20 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR | 22 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR |
21 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT | 23 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT |
22 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, | 24 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, |
23 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT | 25 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT |
24 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, | 26 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |
25 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY | 27 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
26 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT | 28 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
27 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE | 29 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE |
28 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. | 30 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
29 * | 31 * |
30 * --- | |
31 * This file is an internal part spinlock.cc and once.cc | |
32 * It may not be used directly by code outside of //base. | |
33 */ | 32 */ |
34 | 33 |
35 #ifndef BASE_SPINLOCK_INTERNAL_H_ | 34 #ifndef TEST_QPS_DRIVER_H |
36 #define BASE_SPINLOCK_INTERNAL_H_ | 35 #define TEST_QPS_DRIVER_H |
37 | 36 |
38 #include <config.h> | 37 #include <memory> |
39 #include "base/basictypes.h" | |
40 #include "base/atomicops.h" | |
41 | 38 |
42 namespace base { | 39 #include "test/cpp/qps/histogram.h" |
43 namespace internal { | 40 #include "src/proto/grpc/testing/control.grpc.pb.h" |
44 | 41 |
45 // SpinLockWait() waits until it can perform one of several transitions from | 42 namespace grpc { |
46 // "from" to "to". It returns when it performs a transition where done==true. | 43 namespace testing { |
47 struct SpinLockWaitTransition { | 44 class ResourceUsage { |
48 int32 from; | 45 public: |
49 int32 to; | 46 ResourceUsage(double w, double u, double s, int c) |
50 bool done; | 47 : wall_time_(w), user_time_(u), system_time_(s), cores_(c) {} |
| 48 double wall_time() const { return wall_time_; } |
| 49 double user_time() const { return user_time_; } |
| 50 double system_time() const { return system_time_; } |
| 51 int cores() const { return cores_; } |
| 52 |
| 53 private: |
| 54 double wall_time_; |
| 55 double user_time_; |
| 56 double system_time_; |
| 57 int cores_; |
51 }; | 58 }; |
52 | 59 |
53 // Wait until *w can transition from trans[i].from to trans[i].to for some i | 60 struct ScenarioResult { |
54 // satisfying 0<=i<n && trans[i].done, atomically make the transition, | 61 Histogram latencies; |
55 // then return the old value of *w. Make any other atomic tranistions | 62 std::vector<ResourceUsage> client_resources; |
56 // where !trans[i].done, but continue waiting. | 63 std::vector<ResourceUsage> server_resources; |
57 int32 SpinLockWait(volatile Atomic32 *w, int n, | 64 ClientConfig client_config; |
58 const SpinLockWaitTransition trans[]); | 65 ServerConfig server_config; |
59 void SpinLockWake(volatile Atomic32 *w, bool all); | 66 }; |
60 void SpinLockDelay(volatile Atomic32 *w, int32 value, int loop); | |
61 | 67 |
62 } // namespace internal | 68 std::unique_ptr<ScenarioResult> RunScenario( |
63 } // namespace base | 69 const grpc::testing::ClientConfig& client_config, size_t num_clients, |
| 70 const grpc::testing::ServerConfig& server_config, size_t num_servers, |
| 71 int warmup_seconds, int benchmark_seconds, int spawn_local_worker_count); |
| 72 |
| 73 void RunQuit(); |
| 74 } // namespace testing |
| 75 } // namespace grpc |
| 76 |
64 #endif | 77 #endif |
OLD | NEW |