SHAMapInnerNode.h

#pragma once
 
#include <xrpl/basics/IntrusivePointer.h>
#include <xrpl/shamap/SHAMapNodeID.h>
#include <xrpl/shamap/detail/TaggedPointer.h>
 
#include <atomic>
#include <cstdint>
#include <optional>
#include <string>
 
namespace xrpl {
 
class SHAMapInnerNode final : public SHAMapTreeNode, public CountedObject<SHAMapInnerNode>
{
public:
    static inline constexpr unsigned int branchFactor = 16;
 
private:
    TaggedPointer hashesAndChildren_;
 
    std::uint32_t fullBelowGen_ = 0;
    std::uint16_t isBranch_ = 0;
 
    mutable std::atomic<std::uint16_t> lock_ = 0;
 
    void
    resizeChildArrays(std::uint8_t toAllocate);
 
    std::optional<int>
    getChildIndex(int i) const;
 
    template <class F>
    void
    iterChildren(F&& f) const;
 
    template <class F>
    void
    iterNonEmptyChildIndexes(F&& f) const;
 
public:
    explicit SHAMapInnerNode(std::uint32_t cowid, std::uint8_t numAllocatedChildren = 2);
 
    SHAMapInnerNode(SHAMapInnerNode const&) = delete;
    SHAMapInnerNode&
    operator=(SHAMapInnerNode const&) = delete;
    ~SHAMapInnerNode();
 
    // Needed to support intrusive weak pointers
    void
    partialDestructor() override;
 
    intr_ptr::SharedPtr<SHAMapTreeNode>
    clone(std::uint32_t cowid) const override;
 
    SHAMapNodeType
    getType() const override
    {
        return SHAMapNodeType::tnINNER;
    }
 
    bool
    isLeaf() const override
    {
        return false;
    }
 
    bool
    isInner() const override
    {
        return true;
    }
 
    bool
    isEmpty() const;
 
    bool
    isEmptyBranch(int m) const;
 
    int
    getBranchCount() const;
 
    SHAMapHash const&
    getChildHash(int m) const;
 
    void
    setChild(int m, intr_ptr::SharedPtr<SHAMapTreeNode> child);
 
    void
    shareChild(int m, intr_ptr::SharedPtr<SHAMapTreeNode> const& child);
 
    SHAMapTreeNode*
    getChildPointer(int branch);
 
    intr_ptr::SharedPtr<SHAMapTreeNode>
    getChild(int branch);
 
    intr_ptr::SharedPtr<SHAMapTreeNode>
    canonicalizeChild(int branch, intr_ptr::SharedPtr<SHAMapTreeNode> node);
 
    // sync functions
    bool
    isFullBelow(std::uint32_t generation) const;
 
    void
    setFullBelowGen(std::uint32_t gen);
 
    void
    updateHash() override;
 
    void
    updateHashDeep();
 
    void
    serializeForWire(Serializer&) const override;
 
    void
    serializeWithPrefix(Serializer&) const override;
 
    std::string
    getString(SHAMapNodeID const&) const override;
 
    void
    invariants(bool is_root = false) const override;
 
    static intr_ptr::SharedPtr<SHAMapTreeNode>
    makeFullInner(Slice data, SHAMapHash const& hash, bool hashValid);
 
    static intr_ptr::SharedPtr<SHAMapTreeNode>
    makeCompressedInner(Slice data);
};
 
inline bool
SHAMapInnerNode::isEmpty() const
{
    return isBranch_ == 0;
}
 
inline bool
SHAMapInnerNode::isEmptyBranch(int m) const
{
    return (isBranch_ & (1 << m)) == 0;
}
 
inline int
SHAMapInnerNode::getBranchCount() const
{
    return popcnt16(isBranch_);
}
 
inline bool
SHAMapInnerNode::isFullBelow(std::uint32_t generation) const
{
    return fullBelowGen_ == generation;
}
 
inline void
SHAMapInnerNode::setFullBelowGen(std::uint32_t gen)
{
    fullBelowGen_ = gen;
}
 
}  // namespace xrpl