insert.cpp

// Copyright 2020 The Division Authors.
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
//      https://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writing, software
// distributed under the License is distributed on an "AS IS" BASIS,
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
// See the License for the specific language governing permissions and
// limitations under the License.
// Author dietoad@gmail.com && firedtoad@gmail.com

#include "linked_list.h"
#include "plf_list.h"
#include <benchmark/benchmark.h>
#include <boost/intrusive/list.hpp>
#include <boost/intrusive/list_hook.hpp>
#include <iostream>
#include <list>
#include <llvm/ADT/FoldingSet.h>
#include <llvm/ADT/ImmutableList.h>
#include <llvm/ADT/ilist.h>
#include <llvm/ADT/simple_ilist.h>

using mode               = boost::intrusive::link_mode<boost::intrusive::safe_link>;
using constant_time_size = boost::intrusive::constant_time_size<true>;

struct SList : public boost::intrusive::list_base_hook<mode>
{
    int x{};
};

struct LNode : public llvm::ilist_node<LNode, llvm::ilist_tag<LNode>>
{
    int x{};
};

struct INode
{
    int x{};
    void Profile(llvm::FoldingSetNodeID &ID) const {}
};

static void BenchListInsert(benchmark::State &state)
{
    for (auto _ : state)
    {
        std::list<SList> v;
        for (auto i = 0; i < state.range(0); i++)
        {
            v.push_back({});
        }
    }
}

BENCHMARK(BenchListInsert)->Range(1, 65536);

struct BUNode : public SList, public butil::LinkNode<BUNode>
{
    int x{};
};

static void BenchBUListInsert(benchmark::State &state)
{
    for (auto _ : state)
    {
        butil::LinkedList<BUNode> v;
        std::vector<BUNode> vs;
        vs.resize(state.range(0));
        for (auto i = 0; i < state.range(0); i++)
        {
            v.Append(&vs[i]);
        }
    }
}

BENCHMARK(BenchBUListInsert)->Range(1, 65536);

static void BenchIntrusiveListInsert(benchmark::State &state)
{

    for (auto _ : state)
    {
        std::vector<SList> lst(state.range(0));
        boost::intrusive::list<SList, constant_time_size> v;
        for (auto i = 0; i < state.range(0); i++)
        {
            v.push_back(lst[i]);
        }
    }
}

BENCHMARK(BenchIntrusiveListInsert)->Range(1, 65536);

static void BenchPlfListInsert(benchmark::State &state)
{

    for (auto _ : state)
    {
        plf::list<SList> v;
        for (auto i = 0; i < state.range(0); i++)
        {
            v.push_back({});
        }
    }
}

BENCHMARK(BenchPlfListInsert)->Range(1, 65536);

static void BenchAdtList(benchmark::State &state)
{

    for (auto _ : state)
    {
        llvm::ilist<LNode, llvm::ilist_tag<LNode>> v;
        for (auto i = 0; i < state.range(0); i++)
        {
            v.push_back(new LNode);
        }
    }
}

BENCHMARK(BenchAdtList)->Range(1, 65536);

static void BenchAdtSimpleList(benchmark::State &state)
{

    for (auto _ : state)
    {
        llvm::simple_ilist<LNode, llvm::ilist_tag<LNode>> v;
        std::vector<LNode> vs;
        vs.resize(state.range(0));
        for (auto i = 0; i < state.range(0); i++)
        {
            v.push_back(vs[i]);
        }
    }
}

BENCHMARK(BenchAdtSimpleList)->Range(1, 65536);

static void BenchAdtImmutableList(benchmark::State &state)
{

    for (auto _ : state)
    {
        llvm::ImmutableList<INode>::Factory factory;
        auto list = factory.getEmptyList();
        std::vector<INode> vn;
        vn.resize(state.range(0));
        for (auto i = 0; i < state.range(0); i++)
        {
            list = factory.emplace(list, vn[i]);
        }
    }
}

BENCHMARK(BenchAdtImmutableList)->Range(1, 65536);

int main(int argc, char **argv)
{

    butil::LinkedList<BUNode> v;
    std::vector<BUNode> vs;
    vs.resize(10, {});
    for (auto i = 0; i < 10; i++)
    {
        vs[i].x = i;
        v.Append(&vs[i]);
    }


    for (auto it : v)
    {
        std::cout << it.value()->x << '\n';
    }
    benchmark::Initialize(&argc, argv);
    benchmark::RunSpecifiedBenchmarks();
    return 0;
}