| /* |
| * |
| * 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. |
| * |
| */ |
| |
| #ifndef TEST_QPS_HISTOGRAM_H |
| #define TEST_QPS_HISTOGRAM_H |
| |
| #include <grpc/support/histogram.h> |
| #include "src/proto/grpc/testing/stats.grpc.pb.h" |
| |
| namespace grpc { |
| namespace testing { |
| |
| class Histogram { |
| public: |
| // TODO: look into making histogram params not hardcoded for C++ |
| Histogram() |
| : impl_(gpr_histogram_create(default_resolution(), |
| default_max_possible())) {} |
| ~Histogram() { |
| if (impl_) gpr_histogram_destroy(impl_); |
| } |
| Histogram(Histogram&& other) : impl_(other.impl_) { other.impl_ = nullptr; } |
| |
| void Merge(const Histogram& h) { gpr_histogram_merge(impl_, h.impl_); } |
| void Add(double value) { gpr_histogram_add(impl_, value); } |
| double Percentile(double pctile) const { |
| return gpr_histogram_percentile(impl_, pctile); |
| } |
| double Count() const { return gpr_histogram_count(impl_); } |
| void Swap(Histogram* other) { std::swap(impl_, other->impl_); } |
| void FillProto(HistogramData* p) { |
| size_t n; |
| const auto* data = gpr_histogram_get_contents(impl_, &n); |
| for (size_t i = 0; i < n; i++) { |
| p->add_bucket(data[i]); |
| } |
| p->set_min_seen(gpr_histogram_minimum(impl_)); |
| p->set_max_seen(gpr_histogram_maximum(impl_)); |
| p->set_sum(gpr_histogram_sum(impl_)); |
| p->set_sum_of_squares(gpr_histogram_sum_of_squares(impl_)); |
| p->set_count(gpr_histogram_count(impl_)); |
| } |
| void MergeProto(const HistogramData& p) { |
| gpr_histogram_merge_contents(impl_, &*p.bucket().begin(), p.bucket_size(), |
| p.min_seen(), p.max_seen(), p.sum(), |
| p.sum_of_squares(), p.count()); |
| } |
| |
| static double default_resolution() { return 0.01; } |
| static double default_max_possible() { return 60e9; } |
| |
| private: |
| Histogram(const Histogram&); |
| Histogram& operator=(const Histogram&); |
| |
| gpr_histogram* impl_; |
| }; |
| } |
| } |
| |
| #endif /* TEST_QPS_HISTOGRAM_H */ |