xahaud/src/ripple/shamap/tests/FetchPack.test.cpp

//------------------------------------------------------------------------------
/*
    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.
*/
//==============================================================================

#include <BeastConfig.h>
#include <ripple/shamap/SHAMap.h>
#include <ripple/basics/StringUtilities.h>
#include <ripple/basics/UnorderedContainers.h>
#include <ripple/nodestore/DummyScheduler.h>
#include <ripple/nodestore/Manager.h>
#include <ripple/protocol/UInt160.h>
#include <beast/chrono/manual_clock.h>
#include <beast/module/core/maths/Random.h>
#include <beast/unit_test/suite.h>
#include <functional>
#include <stdexcept>

namespace ripple {

class FetchPack_test : public beast::unit_test::suite
{
public:
    enum
    {
        tableItems = 100,
        tableItemsExtra = 20
    };

    using Map = hash_map <uint256, Blob> ;
    using Table = SHAMap;
    using Item = SHAMapItem;

    struct Handler
    {
        void operator()(std::uint32_t refNum) const
        {
            throw std::runtime_error("missing node");
        }
    };

    struct TestFilter : SHAMapSyncFilter
    {
        TestFilter (Map& map, beast::Journal journal) : mMap (map), mJournal (journal)
        {
        }

        void gotNode (bool fromFilter,
            SHAMapNodeID const& id, uint256 const& nodeHash,
                Blob& nodeData, SHAMapTreeNode::TNType type)
        {
        }

        bool haveNode (SHAMapNodeID const& id,
            uint256 const& nodeHash, Blob& nodeData)
        {
            Map::iterator it = mMap.find (nodeHash);
            if (it == mMap.end ())
            {
                mJournal.fatal << "Test filter missing node";
                return false;
            }
            nodeData = it->second;
            return true;
        }

        Map& mMap;
        beast::Journal mJournal;
    };

    std::shared_ptr <Item>
    make_random_item (beast::Random& r)
    {
        Serializer s;
        for (int d = 0; d < 3; ++d)
            s.add32 (r.nextInt ());
        return std::make_shared <Item> (
            to256(s.getRIPEMD160()), s.peekData ());
    }

    void
    add_random_items (std::size_t n, Table& t, beast::Random& r)
    {
        while (n--)
        {
            std::shared_ptr <SHAMapItem> item (
                make_random_item (r));
            auto const result (t.addItem (*item, false, false));
            assert (result);
            (void) result;
        }
    }

    void on_fetch (Map& map, uint256 const& hash, Blob const& blob)
    {
        Serializer s (blob);
        expect (s.getSHA512Half() == hash, "Hash mismatch");
        map.emplace (hash, blob);
    }

    void run ()
    {
        beast::manual_clock <std::chrono::steady_clock> clock;  // manual advance clock
        beast::Journal const j;                            // debug journal

        FullBelowCache fullBelowCache ("test.full_below", clock);
        TreeNodeCache treeNodeCache ("test.tree_node_cache", 65536, 60, clock, j);
        NodeStore::DummyScheduler scheduler;
        auto db = NodeStore::Manager::instance().make_Database (
            "test", scheduler, j, 0, parseDelimitedKeyValueString("type=memory|path=FetchPack"));

        std::shared_ptr <Table> t1 (std::make_shared <Table> (
            smtFREE, fullBelowCache, treeNodeCache, *db, Handler(), beast::Journal()));

        pass ();

//         beast::Random r;
//         add_random_items (tableItems, *t1, r);
//         std::shared_ptr <Table> t2 (t1->snapShot (true));
//
//         add_random_items (tableItemsExtra, *t1, r);
//         add_random_items (tableItemsExtra, *t2, r);

        // turn t1 into t2
//         Map map;
//         t2->getFetchPack (t1.get(), true, 1000000, std::bind (
//             &FetchPack_test::on_fetch, this, std::ref (map), std::placeholders::_1, std::placeholders::_2));
//         t1->getFetchPack (nullptr, true, 1000000, std::bind (
//             &FetchPack_test::on_fetch, this, std::ref (map), std::placeholders::_1, std::placeholders::_2));

        // try to rebuild t2 from the fetch pack
//         std::shared_ptr <Table> t3;
//         try
//         {
//             TestFilter filter (map, beast::Journal());
//
//             t3 = std::make_shared <Table> (smtFREE, t2->getHash (),
//                 fullBelowCache);
//
//             expect (t3->fetchRoot (t2->getHash (), &filter), "unable to get root");
//
//             // everything should be in the pack, no hashes should be needed
//             std::vector <uint256> hashes = t3->getNeededHashes(1, &filter);
//             expect (hashes.empty(), "missing hashes");
//
//             expect (t3->getHash () == t2->getHash (), "root hashes do not match");
//             expect (t3->deepCompare (*t2), "failed compare");
//         }
//         catch (...)
//         {
//             fail ("unhandled exception");
//         }
    }
};

BEAST_DEFINE_TESTSUITE(FetchPack,ripple_app,ripple);

}