214 lines
7.9 KiB
C++
214 lines
7.9 KiB
C++
// Licensed to the Apache Software Foundation (ASF) under one
|
|
// or more contributor license agreements. See the NOTICE file
|
|
// distributed with this work for additional information
|
|
// regarding copyright ownership. The ASF licenses this file
|
|
// to you under the Apache License, Version 2.0 (the
|
|
// "License"); you may not use this file except in compliance
|
|
// with the License. You may obtain a copy of the License at
|
|
//
|
|
// http://www.apache.org/licenses/LICENSE-2.0
|
|
//
|
|
// Unless required by applicable law or agreed to in writing,
|
|
// software distributed under the License is distributed on an
|
|
// "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
|
|
// KIND, either express or implied. See the License for the
|
|
// specific language governing permissions and limitations
|
|
// under the License.
|
|
|
|
// A client sending requests to server in parallel by multiple threads.
|
|
|
|
#include <gflags/gflags.h>
|
|
#include <bthread/bthread.h>
|
|
#include <butil/logging.h>
|
|
#include <butil/string_printf.h>
|
|
#include <butil/time.h>
|
|
#include <butil/macros.h>
|
|
#include <brpc/partition_channel.h>
|
|
#include <deque>
|
|
#include "echo.pb.h"
|
|
|
|
DEFINE_int32(thread_num, 50, "Number of threads to send requests");
|
|
DEFINE_bool(use_bthread, false, "Use bthread to send requests");
|
|
DEFINE_int32(attachment_size, 0, "Carry so many byte attachment along with requests");
|
|
DEFINE_int32(request_size, 16, "Bytes of each request");
|
|
DEFINE_string(connection_type, "", "Connection type. Available values: single, pooled, short");
|
|
DEFINE_string(protocol, "baidu_std", "Protocol type. Defined in src/brpc/options.proto");
|
|
DEFINE_string(server, "file://server_list", "Mapping to servers");
|
|
DEFINE_string(load_balancer, "rr", "Name of load balancer");
|
|
DEFINE_int32(timeout_ms, 100, "RPC timeout in milliseconds");
|
|
DEFINE_int32(max_retry, 3, "Max retries(not including the first RPC)");
|
|
DEFINE_bool(dont_fail, false, "Print fatal when some call failed");
|
|
|
|
std::string g_request;
|
|
std::string g_attachment;
|
|
pthread_mutex_t g_latency_mutex = PTHREAD_MUTEX_INITIALIZER;
|
|
struct BAIDU_CACHELINE_ALIGNMENT SenderInfo {
|
|
size_t nsuccess;
|
|
int64_t latency_sum;
|
|
};
|
|
std::deque<SenderInfo> g_sender_info;
|
|
|
|
static void* sender(void* arg) {
|
|
// Normally, you should not call a Channel directly, but instead construct
|
|
// a stub Service wrapping it. stub can be shared by all threads as well.
|
|
example::EchoService_Stub stub(static_cast<google::protobuf::RpcChannel*>(arg));
|
|
|
|
SenderInfo* info = NULL;
|
|
{
|
|
BAIDU_SCOPED_LOCK(g_latency_mutex);
|
|
g_sender_info.push_back(SenderInfo());
|
|
info = &g_sender_info.back();
|
|
}
|
|
|
|
int log_id = 0;
|
|
while (!brpc::IsAskedToQuit()) {
|
|
// We will receive response synchronously, safe to put variables
|
|
// on stack.
|
|
example::EchoRequest request;
|
|
example::EchoResponse response;
|
|
brpc::Controller cntl;
|
|
|
|
request.set_message(g_request);
|
|
cntl.set_log_id(log_id++); // set by user
|
|
if (!g_attachment.empty()) {
|
|
// Set attachment which is wired to network directly instead of
|
|
// being serialized into protobuf messages.
|
|
cntl.request_attachment().append(g_attachment);
|
|
}
|
|
|
|
// Because `done'(last parameter) is NULL, this function waits until
|
|
// the response comes back or error occurs(including timedout).
|
|
stub.Echo(&cntl, &request, &response, NULL);
|
|
if (!cntl.Failed()) {
|
|
info->latency_sum += cntl.latency_us();
|
|
++info->nsuccess;
|
|
} else {
|
|
CHECK(brpc::IsAskedToQuit() || !FLAGS_dont_fail)
|
|
<< "error=" << cntl.ErrorText() << " latency=" << cntl.latency_us();
|
|
// We can't connect to the server, sleep a while. Notice that this
|
|
// is a specific sleeping to prevent this thread from spinning too
|
|
// fast. You should continue the business logic in a production
|
|
// server rather than sleeping.
|
|
bthread_usleep(50000);
|
|
}
|
|
}
|
|
return NULL;
|
|
}
|
|
|
|
class MyPartitionParser : public brpc::PartitionParser {
|
|
public:
|
|
bool ParseFromTag(const std::string& tag, brpc::Partition* out) {
|
|
// "N/M" : #N partition of M partitions.
|
|
size_t pos = tag.find_first_of('/');
|
|
if (pos == std::string::npos) {
|
|
LOG(ERROR) << "Invalid tag=" << tag;
|
|
return false;
|
|
}
|
|
char* endptr = NULL;
|
|
out->index = strtol(tag.c_str(), &endptr, 10);
|
|
if (endptr != tag.data() + pos) {
|
|
LOG(ERROR) << "Invalid index=" << butil::StringPiece(tag.data(), pos);
|
|
return false;
|
|
}
|
|
out->num_partition_kinds = strtol(tag.c_str() + pos + 1, &endptr, 10);
|
|
if (endptr != tag.c_str() + tag.size()) {
|
|
LOG(ERROR) << "Invalid num=" << tag.data() + pos + 1;
|
|
return false;
|
|
}
|
|
return true;
|
|
}
|
|
};
|
|
|
|
|
|
int main(int argc, char* argv[]) {
|
|
// Parse gflags. We recommend you to use gflags as well.
|
|
GFLAGS_NS::ParseCommandLineFlags(&argc, &argv, true);
|
|
|
|
// A Channel represents a communication line to a Server. Notice that
|
|
// Channel is thread-safe and can be shared by all threads in your program.
|
|
brpc::DynamicPartitionChannel channel;
|
|
|
|
brpc::PartitionChannelOptions options;
|
|
options.protocol = FLAGS_protocol;
|
|
options.connection_type = FLAGS_connection_type;
|
|
options.succeed_without_server = true;
|
|
options.fail_limit = 1;
|
|
options.timeout_ms = FLAGS_timeout_ms/*milliseconds*/;
|
|
options.max_retry = FLAGS_max_retry;
|
|
|
|
if (channel.Init(new MyPartitionParser(),
|
|
FLAGS_server.c_str(), FLAGS_load_balancer.c_str(),
|
|
&options) != 0) {
|
|
LOG(ERROR) << "Fail to init channel";
|
|
return -1;
|
|
}
|
|
if (FLAGS_attachment_size > 0) {
|
|
g_attachment.resize(FLAGS_attachment_size, 'a');
|
|
}
|
|
if (FLAGS_request_size <= 0) {
|
|
LOG(ERROR) << "Bad request_size=" << FLAGS_request_size;
|
|
return -1;
|
|
}
|
|
g_request.resize(FLAGS_request_size, 'r');
|
|
|
|
std::vector<bthread_t> bids;
|
|
std::vector<pthread_t> pids;
|
|
if (!FLAGS_use_bthread) {
|
|
pids.resize(FLAGS_thread_num);
|
|
for (int i = 0; i < FLAGS_thread_num; ++i) {
|
|
if (pthread_create(&pids[i], NULL, sender, &channel) != 0) {
|
|
LOG(ERROR) << "Fail to create pthread";
|
|
return -1;
|
|
}
|
|
}
|
|
} else {
|
|
bids.resize(FLAGS_thread_num);
|
|
for (int i = 0; i < FLAGS_thread_num; ++i) {
|
|
if (bthread_start_background(
|
|
&bids[i], NULL, sender, &channel) != 0) {
|
|
LOG(ERROR) << "Fail to create bthread";
|
|
return -1;
|
|
}
|
|
}
|
|
}
|
|
|
|
int64_t last_counter = 0;
|
|
int64_t last_latency_sum = 0;
|
|
std::vector<size_t> last_nsuccess(FLAGS_thread_num);
|
|
while (!brpc::IsAskedToQuit()) {
|
|
sleep(1);
|
|
int64_t latency_sum = 0;
|
|
int64_t nsuccess = 0;
|
|
pthread_mutex_lock(&g_latency_mutex);
|
|
CHECK_EQ(g_sender_info.size(), (size_t)FLAGS_thread_num);
|
|
for (size_t i = 0; i < g_sender_info.size(); ++i) {
|
|
const SenderInfo& info = g_sender_info[i];
|
|
latency_sum += info.latency_sum;
|
|
nsuccess += info.nsuccess;
|
|
if (FLAGS_dont_fail) {
|
|
CHECK(info.nsuccess > last_nsuccess[i]) << "i=" << i;
|
|
}
|
|
last_nsuccess[i] = info.nsuccess;
|
|
}
|
|
pthread_mutex_unlock(&g_latency_mutex);
|
|
|
|
const int64_t avg_latency = (latency_sum - last_latency_sum) /
|
|
std::max(nsuccess - last_counter, (int64_t)1);
|
|
LOG(INFO) << "Sending EchoRequest at qps=" << nsuccess - last_counter
|
|
<< " latency=" << avg_latency;
|
|
last_counter = nsuccess;
|
|
last_latency_sum = latency_sum;
|
|
}
|
|
|
|
LOG(INFO) << "EchoClient is going to quit";
|
|
for (int i = 0; i < FLAGS_thread_num; ++i) {
|
|
if (!FLAGS_use_bthread) {
|
|
pthread_join(pids[i], NULL);
|
|
} else {
|
|
bthread_join(bids[i], NULL);
|
|
}
|
|
}
|
|
|
|
return 0;
|
|
}
|