multihash-and-fixes - Updated (#158)

* multihash holds sptr to const data for performance

* multihash updates for performance

* iterator-related bugs in peer routing table fixed

* fix pr issues

Signed-off-by: Alexey-N-Chernyshov <alexey.n.chernyshov@gmail.com>

Co-authored-by: Artem <artgor4github@gmail.com>
Co-authored-by: Igor Egorov <igor@soramitsu.co.jp>

include/libp2p/multi/multihash.hpp

@@ -24,6 +24,12 @@ namespace libp2p::multi {
    */
   class Multihash {
    public:
+    Multihash(const Multihash &other) = default;
+    Multihash &operator=(const Multihash &other) = default;
+    Multihash(Multihash &&other) noexcept = default;
+    Multihash &operator=(Multihash &&other) noexcept = default;
+    ~Multihash() = default;
+
     using Buffer = common::ByteArray;
 
     static constexpr uint8_t kMaxHashLength = 127;
@@ -86,6 +92,11 @@ namespace libp2p::multi {
      */
     const Buffer &toBuffer() const;
 
+    /**
+     * @return Pre-calculated hash for std containers
+     */
+    size_t stdHash() const;
+
     bool operator==(const Multihash &other) const;
     bool operator!=(const Multihash &other) const;
     bool operator<(const Multihash &other) const;
@@ -110,9 +121,20 @@ namespace libp2p::multi {
      * Contains a one byte hash type, a one byte hash length, and the stored
      * hash itself
      */
-    std::vector<uint8_t> data_;
+    struct Data {
-    uint8_t hash_offset_{};  ///< size of non-hash data from the beginning
+      // TODO(artem): move to small_vector<const uint8_t, some_size>
-    HashType type_;
+      // as soon as toBuffer() -> span<const uint8_t> is acceptable
+      std::vector<uint8_t> bytes;
+      uint8_t hash_offset{};  ///< size of non-hash data from the beginning
+      HashType type;
+      size_t std_hash; ///< Hash for unordered containers
+
+      Data(HashType t, gsl::span<const uint8_t> h);
+    };
+
+    const Data& data() const;
+
+    std::shared_ptr<const Data> data_;
   };
 
 }  // namespace libp2p::multi
@@ -120,7 +142,9 @@ namespace libp2p::multi {
 namespace std {
   template <>
   struct hash<libp2p::multi::Multihash> {
-    size_t operator()(const libp2p::multi::Multihash &x) const;
+    size_t operator()(const libp2p::multi::Multihash &x) const {
+      return x.stdHash();
+    }
   };
 }  // namespace std
 

include/libp2p/protocol/kademlia/impl/peer_routing_table_impl.hpp

@@ -9,7 +9,8 @@
 #include <libp2p/protocol/kademlia/impl/peer_routing_table.hpp>
 
 #include <boost/assert.hpp>
-#include <deque>
+#include <boost/optional.hpp>
+#include <list>
 
 #include <libp2p/event/bus.hpp>
 #include <libp2p/log/sublogger.hpp>
@@ -50,58 +51,41 @@ namespace libp2p::protocol::kademlia {
       return std::memcmp(d1.data(), d2.data(), size) < 0;
     }
 
-    Hash256 hfrom;
+    Hash256 hfrom{};
   };
+
   /**
    * Single bucket which holds peers.
    */
-  class Bucket : public std::deque<BucketPeerInfo> {
+  class Bucket {
    public:
-    void truncate(size_t limit) {
+    size_t size() const;
-      if (size() > limit) {
-        erase(std::next(begin(), limit), end());
-      }
-    }
 
-    std::vector<peer::PeerId> peerIds() const {
+    void append(const Bucket &bucket);
-      std::vector<peer::PeerId> peerIds;
-      peerIds.reserve(size());
-      std::transform(begin(), end(), std::back_inserter(peerIds),
-                     [](const auto &bpi) { return bpi.peer_id; });
-      return peerIds;
-    }
 
-    bool contains(const peer::PeerId &p) {
+    // sort bucket in ascending order by XOR distance from node_id
-      auto it = std::find_if(begin(), end(),
+    void sort(const NodeId &node_id);
-                             [=](const auto &bpi) { return bpi.peer_id == p; });
-      return it != end();
-    }
 
-    bool remove(const peer::PeerId &p) {
+    auto find(const peer::PeerId &p) const;
-      // this shifts elements to the end
-      auto it = std::remove_if(
-          begin(), end(), [&](const auto &bpi) { return bpi.peer_id == p; });
-      if (it != end()) {
-        erase(it);
-        return true;
-      }
 
-      return false;
+    bool moveToFront(const PeerId &pid);
-    }
 
-    Bucket split(size_t commonLenPrefix, const NodeId &target) {
+    void emplaceToFront(const PeerId &pid, bool is_replaceable);
-      Bucket b{};
-      // remove shifts all elements "to be removed" to the end, other elements
-      // preserve their relative order
-      auto new_end = std::remove_if(begin(), end(), [&](const auto &bpi) {
-        return bpi.node_id.commonPrefixLen(target) > commonLenPrefix;
-      });
 
-      b.assign(std::make_move_iterator(new_end),
+    boost::optional<PeerId> removeReplaceableItem();
-               std::make_move_iterator(end()));
 
-      return b;
+    void truncate(size_t limit);
-    }
+
+    std::vector<peer::PeerId> peerIds() const;
+
+    bool contains(const peer::PeerId &p) const;
+
+    bool remove(const peer::PeerId &p);
+
+    Bucket split(size_t commonLenPrefix, const NodeId &target);
+
+   private:
+    std::list<BucketPeerInfo> peers_;
   };
 
   class PeerRoutingTableImpl

src/multi/CMakeLists.txt

@@ -21,7 +21,7 @@ libp2p_add_library(p2p_multihash
     )
 target_link_libraries(p2p_multihash
     p2p_hexutil
-    p2p_uvarint
+    p2p_varint_prefix_reader
     Boost::boost
     )
 

src/multi/multihash.cpp

@@ -5,12 +5,11 @@
 
 #include <libp2p/multi/multihash.hpp>
 
-#include <boost/algorithm/hex.hpp>
 #include <boost/container_hash/hash.hpp>
-#include <boost/format.hpp>
+#include <libp2p/basic/varint_prefix_reader.hpp>
 #include <libp2p/common/hexutil.hpp>
 #include <libp2p/common/types.hpp>
-#include <libp2p/multi/uvarint.hpp>
+#include <libp2p/log/logger.hpp>
 
 using libp2p::common::ByteArray;
 using libp2p::common::hex_upper;
@@ -37,15 +36,47 @@ OUTCOME_CPP_DEFINE_CATEGORY(libp2p::multi, Multihash::Error, e) {
 
 namespace libp2p::multi {
 
-  Multihash::Multihash(HashType type, gsl::span<const uint8_t> hash) {
+  Multihash::Multihash(HashType type, gsl::span<const uint8_t> hash)
-    type_ = type;
+      : data_(std::make_shared<const Data>(type, hash)) {}
-    UVarint uvarint{type};
+
-    auto &&bytes = uvarint.toBytes();
+  namespace {
-    data_.insert(data_.end(), bytes.begin(), bytes.end());
+    template <typename Buffer>
-    BOOST_ASSERT(hash.size() <= std::numeric_limits<uint8_t>::max());
+    inline void appendVarint(Buffer &buffer, uint64_t t) {
-    data_.push_back(static_cast<uint8_t>(hash.size()));
+      do {
-    hash_offset_ = data_.size();
+        uint8_t byte = t & 0x7F;
-    data_.insert(data_.end(), hash.begin(), hash.end());
+        t >>= 7;
+        if (t != 0) {
+          byte |= 0x80;
+        }
+        buffer.push_back(byte);
+      } while (t > 0);
+    }
+  }  // namespace
+
+  Multihash::Data::Data(HashType t, gsl::span<const uint8_t> h) : type(t) {
+    bytes.reserve(h.size() + 4);
+    appendVarint(bytes, type);
+    BOOST_ASSERT(h.size() <= std::numeric_limits<uint8_t>::max());
+    bytes.push_back(static_cast<uint8_t>(h.size()));
+    hash_offset = bytes.size();
+    bytes.insert(bytes.end(), h.begin(), h.end());
+    std_hash = boost::hash_range(bytes.begin(), bytes.end());
+  }
+
+  const Multihash::Data &Multihash::data() const {
+#if NDEBUG
+    if (data_ == nullptr) {
+      log::createLogger("Multihash")->critical("attempt to use moved object");
+      throw std::runtime_error("attempt to use moved multihash");
+    }
+#else
+    BOOST_ASSERT(data_);
+#endif
+    return *data_;
+  }
+
+  size_t Multihash::stdHash() const {
+    return data().std_hash;
   }
 
   outcome::result<Multihash> Multihash::create(HashType type,
@@ -68,11 +99,18 @@ namespace libp2p::multi {
       return Error::INPUT_TOO_SHORT;
     }
 
-    UVarint varint(b);
+    basic::VarintPrefixReader vr;
+    if (vr.consume(b) != basic::VarintPrefixReader::kReady) {
+      return Error::INPUT_TOO_SHORT;
+    }
+
+    const auto type = static_cast<HashType>(vr.value());
+    if (b.empty()) {
+      return Error::INPUT_TOO_SHORT;
+    }
 
-    const auto type = static_cast<HashType>(varint.toUInt64());
+    const uint8_t length = b[0];
-    uint8_t length = b[varint.size()];
+    gsl::span<const uint8_t> hash = b.subspan(1);
-    gsl::span<const uint8_t> hash = b.subspan(varint.size() + 1);
 
     if (length == 0) {
       return Error::ZERO_INPUT_LENGTH;
@@ -86,23 +124,29 @@ namespace libp2p::multi {
   }
 
   const HashType &Multihash::getType() const {
-    return type_;
+    return data().type;
   }
 
   gsl::span<const uint8_t> Multihash::getHash() const {
-    return gsl::span<const uint8_t>(data_).subspan(hash_offset_);
+    const auto &d = data();
+    return gsl::span<const uint8_t>(d.bytes).subspan(d.hash_offset);
   }
 
   std::string Multihash::toHex() const {
-    return hex_upper(data_);
+    return hex_upper(data().bytes);
   }
 
   const common::ByteArray &Multihash::toBuffer() const {
-    return data_;
+    return data().bytes;
   }
 
   bool Multihash::operator==(const Multihash &other) const {
-    return this->data_ == other.data_ && this->type_ == other.type_;
+    const auto &a = data();
+    const auto &b = other.data();
+    if (data_ == other.data_) {
+      return true;
+    }
+    return a.bytes == b.bytes && a.type == b.type;
   }
 
   bool Multihash::operator!=(const Multihash &other) const {
@@ -110,14 +154,12 @@ namespace libp2p::multi {
   }
 
   bool Multihash::operator<(const class libp2p::multi::Multihash &other) const {
-    return this->type_ < other.type_
+    const auto &a = data();
-        || (this->type_ == other.type_ && this->data_ < other.data_);
+    const auto &b = other.data();
+    if (a.type == b.type) {
+      return a.bytes < b.bytes;
+    }
+    return a.type < b.type;
   }
 
 }  // namespace libp2p::multi
-
-size_t std::hash<libp2p::multi::Multihash>::operator()(
-    const libp2p::multi::Multihash &x) const {
-  const auto &container = x.toBuffer();
-  return boost::hash_range(container.begin(), container.end());
-}

src/protocol/kademlia/impl/peer_routing_table_impl.cpp

@@ -36,6 +36,103 @@ namespace {
 
 namespace libp2p::protocol::kademlia {
 
+  size_t Bucket::size() const {
+    return peers_.size();
+  }
+
+  void Bucket::append(const Bucket &bucket) {
+    peers_.insert(peers_.end(), bucket.peers_.begin(), bucket.peers_.end());
+  }
+
+  void Bucket::sort(const NodeId &node_id) {
+    XorDistanceComparator cmp(node_id);
+    peers_.sort(cmp);
+  }
+
+  auto Bucket::find(const peer::PeerId &p) const {
+    return std::find_if(peers_.begin(), peers_.end(),
+                        [&p](const auto &i) { return i.peer_id == p; });
+  }
+
+  bool Bucket::moveToFront(const PeerId &pid) {
+    auto it = find(pid);
+    if (it != peers_.end()) {
+      if (it != peers_.begin()) {
+        peers_.splice(peers_.begin(), peers_, it);
+      }
+      return false;
+    }
+    return true;
+  }
+
+  void Bucket::emplaceToFront(const PeerId &pid, bool is_replaceable) {
+    peers_.emplace(peers_.begin(), pid, is_replaceable);
+  }
+
+  boost::optional<PeerId> Bucket::removeReplaceableItem() {
+    boost::optional<PeerId> result;
+
+    for (auto it = peers_.rbegin(); it != peers_.rend(); ++it) {
+      if (it->is_replaceable) {
+        result = std::move(it->peer_id);
+        peers_.erase((++it).base());
+        break;
+      }
+    }
+
+    return result;
+  }
+
+  void Bucket::truncate(size_t limit) {
+    if (limit == 0) {
+      peers_.clear();
+    } else if (peers_.size() > limit) {
+      peers_.erase(std::next(peers_.begin(), static_cast<long>(limit)),
+                   peers_.end());
+    }
+  }
+
+  std::vector<peer::PeerId> Bucket::peerIds() const {
+    std::vector<peer::PeerId> peerIds;
+    peerIds.reserve(peers_.size());
+    std::transform(peers_.begin(), peers_.end(), std::back_inserter(peerIds),
+                   [](const auto &bpi) { return bpi.peer_id; });
+    return peerIds;
+  }
+
+  bool Bucket::contains(const peer::PeerId &p) const {
+    return find(p) != peers_.end();
+  }
+
+  bool Bucket::remove(const peer::PeerId &p) {
+    auto it = find(p);
+    if (it != peers_.end()) {
+      peers_.erase(it);
+      return true;
+    }
+
+    return false;
+  }
+
+  Bucket Bucket::split(size_t commonLenPrefix, const NodeId &target) {
+    Bucket b{};
+
+    std::list<BucketPeerInfo> new_peers;
+
+    while (!peers_.empty()) {
+      auto it = peers_.begin();
+      if (it->node_id.commonPrefixLen(target) > commonLenPrefix) {
+        b.peers_.splice(b.peers_.end(), peers_, it);
+      } else {
+        new_peers.splice(new_peers.end(), peers_, it);
+      }
+    }
+
+    peers_.swap(new_peers);
+
+    return b;
+  }
+
   PeerRoutingTableImpl::PeerRoutingTableImpl(
       const Config &config,
       std::shared_ptr<peer::IdentityManager> identity_manager,
@@ -74,23 +171,36 @@ namespace libp2p::protocol::kademlia {
       // if this happens, search both surrounding buckets for nearby peers
       if (bucketId > 0) {
         auto &left = buckets_.at(bucketId - 1);
-        bucket.insert(bucket.end(), left.begin(), left.end());
+        bucket.append(left);
       }
       if (bucketId < buckets_.size() - 1) {
         auto &right = buckets_.at(bucketId + 1);
-        bucket.insert(bucket.end(), right.begin(), right.end());
+        bucket.append(right);
       }
     }
 
     // sort bucket in ascending order by XOR distance from local peer.
-    XorDistanceComparator cmp(node_id);
+    bucket.sort(node_id);
-    std::sort(bucket.begin(), bucket.end(), cmp);
 
     bucket.truncate(count);
 
     return bucket.peerIds();
   }
 
+  namespace {
+    outcome::result<bool> replacePeer(Bucket &bucket, const peer::PeerId &pid,
+                                      bool is_replaceable, event::Bus &bus) {
+      const auto removed = bucket.removeReplaceableItem();
+      if (!removed.has_value()) {
+        return PeerRoutingTableImpl::Error::PEER_REJECTED_NO_CAPACITY;
+      }
+      bus.getChannel<events::PeerRemovedChannel>().publish(removed.value());
+      bucket.emplaceToFront(pid, is_replaceable);
+      bus.getChannel<events::PeerAddedChannel>().publish(pid);
+      return true;
+    }
+  }  // namespace
+
   outcome::result<bool> PeerRoutingTableImpl::update(const peer::PeerId &pid,
                                                      bool is_permanent,
                                                      bool is_connected) {
@@ -102,12 +212,7 @@ namespace libp2p::protocol::kademlia {
 
     // Trying to find and move to front if its a long lived connected peer
     if (is_connected) {
-      auto it =
+      if (!bucket.moveToFront(pid)) {
-          std::find_if(bucket.begin(), bucket.end(),
-                       [&pid](const auto &bpi) { return bpi.peer_id == pid; });
-      if (it != bucket.end()) {
-        bucket.push_front(*it);
-        bucket.erase(it);
         return false;
       }
     } else if (bucket.contains(pid)) {
@@ -115,7 +220,7 @@ namespace libp2p::protocol::kademlia {
     }
 
     if (bucket.size() < config_.maxBucketSize) {
-      bucket.emplace_front(pid, !is_permanent);
+      bucket.emplaceToFront(pid, !is_permanent);
       bus_->getChannel<events::PeerAddedChannel>().publish(pid);
       return true;
     }
@@ -131,39 +236,15 @@ namespace libp2p::protocol::kademlia {
       auto resizedBucketId = getBucketId(buckets_, cpl);
       auto &resizedBucket = buckets_.at(resizedBucketId);
       if (resizedBucket.size() < config_.maxBucketSize) {
-        resizedBucket.emplace_front(pid, is_permanent);
+        resizedBucket.emplaceToFront(pid, !is_permanent);
         bus_->getChannel<events::PeerAddedChannel>().publish(pid);
         return true;
       }
-      auto replaceablePeerIt =
-          std::find_if(resizedBucket.rbegin(), resizedBucket.rend(),
-                       [](const auto &bpi) { return bpi.is_replaceable; });
 
-      if (replaceablePeerIt == resizedBucket.rend()) {
+      return replacePeer(resizedBucket, pid, !is_permanent, *bus_);
-        return Error::PEER_REJECTED_NO_CAPACITY;
-      }
-      auto removedPeer = (*replaceablePeerIt).peer_id;
-      bus_->getChannel<events::PeerRemovedChannel>().publish(removedPeer);
-      std::advance(replaceablePeerIt, 1);
-      resizedBucket.erase(replaceablePeerIt.base());
-      resizedBucket.emplace_front(pid, !is_permanent);
-      bus_->getChannel<events::PeerAddedChannel>().publish(pid);
-      return true;
     }
-    auto replaceablePeerIt =
-        std::find_if(bucket.rbegin(), bucket.rend(),
-                     [](const auto &bpi) { return bpi.is_replaceable; });
 
-    if (replaceablePeerIt == bucket.rend()) {
+    return replacePeer(bucket, pid, !is_permanent, *bus_);
-      return Error::PEER_REJECTED_NO_CAPACITY;
-    }
-    auto removedPeer = (*replaceablePeerIt).peer_id;
-    bus_->getChannel<events::PeerRemovedChannel>().publish(removedPeer);
-    std::advance(replaceablePeerIt, 1);
-    bucket.erase(replaceablePeerIt.base());
-    bucket.emplace_front(pid, !is_permanent);
-    bus_->getChannel<events::PeerAddedChannel>().publish(pid);
-    return true;
   }
 
   void PeerRoutingTableImpl::nextBucket() {
@@ -193,7 +274,7 @@ namespace libp2p::protocol::kademlia {
 
   std::vector<peer::PeerId> PeerRoutingTableImpl::getAllPeers() const {
     std::vector<peer::PeerId> vec;
-    for (auto &bucket : buckets_) {
+    for (const auto &bucket : buckets_) {
       auto peer_ids = bucket.peerIds();
       vec.insert(vec.end(), peer_ids.begin(), peer_ids.end());
     }