| 123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159 | /* * * Copyright 2015, Google Inc. * All rights reserved. * * Redistribution and use in source and binary forms, with or without * modification, are permitted provided that the following conditions are * met: * *     * Redistributions of source code must retain the above copyright * notice, this list of conditions and the following disclaimer. *     * Redistributions in binary form must reproduce the above * copyright notice, this list of conditions and the following disclaimer * in the documentation and/or other materials provided with the * distribution. *     * Neither the name of Google Inc. nor the names of its * contributors may be used to endorse or promote products derived from * this software without specific prior written permission. * * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. * */#include <cassert>#include <chrono>#include <memory>#include <mutex>#include <string>#include <thread>#include <vector>#include <sstream>#include <sys/signal.h>#include <grpc/grpc.h>#include <grpc/support/alloc.h>#include <grpc/support/histogram.h>#include <grpc/support/log.h>#include <grpc/support/host_port.h>#include <gflags/gflags.h>#include <grpc++/client_context.h>#include <grpc++/server.h>#include <grpc++/server_builder.h>#include <grpc++/status.h>#include <grpc++/stream.h>#include <gtest/gtest.h>#include "test/cpp/util/create_test_channel.h"#include "test/cpp/qps/client.h"#include "test/cpp/qps/qpstest.grpc.pb.h"#include "test/cpp/qps/histogram.h"#include "test/cpp/qps/interarrival.h"#include "test/cpp/qps/timer.h"namespace grpc {namespace testing {class SynchronousClient : public Client { public:  SynchronousClient(const ClientConfig& config) : Client(config) {    num_threads_ =        config.outstanding_rpcs_per_channel() * config.client_channels();    responses_.resize(num_threads_);    SetupLoadTest(config, num_threads_);  }  virtual ~SynchronousClient(){}; protected:  void WaitToIssue(int thread_idx) {    grpc_time next_time;    if (NextIssueTime(thread_idx, &next_time)) {      std::this_thread::sleep_until(next_time);    }  }  size_t num_threads_;  std::vector<SimpleResponse> responses_;};class SynchronousUnaryClient GRPC_FINAL : public SynchronousClient { public:  SynchronousUnaryClient(const ClientConfig& config)      : SynchronousClient(config) {    StartThreads(num_threads_);  }  ~SynchronousUnaryClient() { EndThreads(); }  bool ThreadFunc(Histogram* histogram, size_t thread_idx) GRPC_OVERRIDE {    WaitToIssue(thread_idx);    auto* stub = channels_[thread_idx % channels_.size()].get_stub();    double start = Timer::Now();    grpc::ClientContext context;    grpc::Status s =        stub->UnaryCall(&context, request_, &responses_[thread_idx]);    histogram->Add((Timer::Now() - start) * 1e9);    return s.IsOk();  }};class SynchronousStreamingClient GRPC_FINAL : public SynchronousClient { public:  SynchronousStreamingClient(const ClientConfig& config)      : SynchronousClient(config),        context_(num_threads_),        stream_(num_threads_) {    for (size_t thread_idx = 0; thread_idx < num_threads_; thread_idx++) {      auto* stub = channels_[thread_idx % channels_.size()].get_stub();      stream_[thread_idx] = stub->StreamingCall(&context_[thread_idx]);    }    StartThreads(num_threads_);  }  ~SynchronousStreamingClient() {    EndThreads();    for (auto stream = stream_.begin(); stream != stream_.end(); stream++) {      if (*stream) {        (*stream)->WritesDone();        EXPECT_TRUE((*stream)->Finish().IsOk());      }    }  }  bool ThreadFunc(Histogram* histogram, size_t thread_idx) GRPC_OVERRIDE {    WaitToIssue(thread_idx);    double start = Timer::Now();    if (stream_[thread_idx]->Write(request_) &&        stream_[thread_idx]->Read(&responses_[thread_idx])) {      histogram->Add((Timer::Now() - start) * 1e9);      return true;    }    return false;  } private:  std::vector<grpc::ClientContext> context_;  std::vector<std::unique_ptr<      grpc::ClientReaderWriter<SimpleRequest, SimpleResponse>>> stream_;};std::unique_ptr<Client> CreateSynchronousUnaryClient(    const ClientConfig& config) {  return std::unique_ptr<Client>(new SynchronousUnaryClient(config));}std::unique_ptr<Client> CreateSynchronousStreamingClient(    const ClientConfig& config) {  return std::unique_ptr<Client>(new SynchronousStreamingClient(config));}}  // namespace testing}  // namespace grpc
 |