//------------------------------------------------------------------------------ /* This file is part of rippled: https://github.com/ripple/rippled Copyright (c) 2012, 2013 Ripple Labs Inc. Permission to use, copy, modify, and/or distribute this software for any purpose with or without fee is hereby granted, provided that the above copyright notice and this permission notice appear in all copies. THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY SPECIAL , DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE. */ //============================================================================== #ifndef RIPPLE_OVERLAY_TRAFFIC_H_INCLUDED #define RIPPLE_OVERLAY_TRAFFIC_H_INCLUDED #include #include #include #include namespace ripple { class TrafficCount { public: using count_t = std::atomic ; class TrafficStats { public: count_t bytesIn; count_t bytesOut; count_t messagesIn; count_t messagesOut; TrafficStats() : bytesIn(0), bytesOut(0), messagesIn(0), messagesOut(0) { ; } TrafficStats(const TrafficStats& ts) : bytesIn (ts.bytesIn.load()) , bytesOut (ts.bytesOut.load()) , messagesIn (ts.messagesIn.load()) , messagesOut (ts.messagesOut.load()) { ; } operator bool () const { return messagesIn || messagesOut; } }; enum class category { CT_base, // basic peer overhead, must be first CT_overlay, // overlay management CT_transaction, CT_proposal, CT_validation, CT_get_ledger, // ledgers we try to get CT_share_ledger, // ledgers we share CT_get_trans, // transaction sets we try to get CT_share_trans, // transaction sets we get CT_unknown // must be last }; static const char* getName (category c); static category categorize ( ::google::protobuf::Message const& message, int type, bool inbound); void addCount (category cat, bool inbound, int number) { if (inbound) { counts_[cat].bytesIn += number; ++counts_[cat].messagesIn; } else { counts_[cat].bytesOut += number; ++counts_[cat].messagesOut; } } TrafficCount() { for (category i = category::CT_base; i <= category::CT_unknown; i = safe_cast(safe_cast>(i) + 1)) { counts_[i]; } } std::map getCounts () const { std::map ret; for (auto& i : counts_) { if (i.second) ret.emplace (std::piecewise_construct, std::forward_as_tuple (getName (i.first)), std::forward_as_tuple (i.second)); } return ret; } protected: std::map counts_; }; } #endif