transmission/libtransmission/benc.h

// This file Copyright © 2022 Mnemosyne LLC.
// It may be used under GPLv2 (SPDX: GPL-2.0), GPLv3 (SPDX: GPL-3.0),
// or any future license endorsed by Mnemosyne LLC.
// License text can be found in the licenses/ folder.

#pragma once

#include <algorithm>
#include <array>
#include <cctype>
#include <cerrno>
#include <cstddef>
#include <cstdint>
#include <cstdlib>
#include <optional>
#include <string_view>

#include "error.h"

namespace transmission::benc
{

namespace impl
{

std::optional<int64_t> ParseInt(std::string_view* benc);

std::optional<std::string_view> ParseString(std::string_view* benc);

} // namespace impl

struct Handler
{
    virtual ~Handler() = default;

    virtual bool Int64(int64_t) = 0;
    virtual bool String(std::string_view) = 0;

    virtual bool StartDict() = 0;
    virtual bool Key(std::string_view) = 0;
    virtual bool EndDict() = 0;

    virtual bool StartArray() = 0;
    virtual bool EndArray() = 0;
};

template<std::size_t MaxDepth>
struct BasicHandler : public Handler
{
    bool Int64(int64_t) override
    {
        return true;
    }

    bool String(std::string_view) override
    {
        return true;
    }

    bool StartDict() override
    {
        push();
        return true;
    }

    bool Key(std::string_view key) override
    {
        keys_[depth_] = key;
        return true;
    }

    bool EndDict() override
    {
        pop();
        return true;
    }

    bool StartArray() override
    {
        push();
        return true;
    }

    bool EndArray() override
    {
        pop();
        return true;
    }

    auto key(size_t i) const
    {
        return keys_[i];
    }

    auto depth() const
    {
        return depth_;
    }

    auto currentKey() const
    {
        return key(depth());
    }

private:
    void push()
    {
        ++depth_;
        keys_[depth_] = {};
    }

    void pop()
    {
        --depth_;
    }

    size_t depth_ = 0;
    std::array<std::string_view, MaxDepth> keys_;
};

template<std::size_t MaxDepth>
struct ParserStack
{
    enum class ParentType
    {
        Array,
        Dict
    };
    struct Node
    {
        ParentType parent_type;
        size_t n_children_walked;
    };
    std::array<Node, MaxDepth> stack;
    std::size_t depth = 0;

    void clear()
    {
        depth = 0;
    }

    void tokenWalked()
    {
        ++stack[depth].n_children_walked;
    }

    Node& current()
    {
        return stack[depth];
    }
    Node& current() const
    {
        return stack[depth];
    }

    [[nodiscard]] bool expectingDictKey() const
    {
        return depth > 0 && stack[depth].parent_type == ParentType::Dict && (stack[depth].n_children_walked % 2) == 0;
    }

    std::optional<ParentType> parentType() const
    {
        if (depth == 0)
        {
            return {};
        }

        return stack[depth].parent_type;
    }

    std::optional<ParentType> pop(tr_error** error)
    {
        if (depth == 0)
        {
            tr_error_set(error, EILSEQ, "Cannot pop empty stack");
            return {};
        }

        if (stack[depth].parent_type == ParentType::Dict && ((stack[depth].n_children_walked % 2) != 0))
        {
            tr_error_set(error, EILSEQ, "Premature end-of-dict found. Malformed benc?");
            return {};
        }

        auto const ret = stack[depth].parent_type;
        --depth;
        return ret;
    }

    bool push(ParentType parent_type, tr_error** error)
    {
        if (depth + 1 >= std::size(stack))
        {
            tr_error_set(error, E2BIG, "Max stack depth reached; unable to continue parsing");
            return false;
        }

        ++depth;
        current() = { parent_type, 0 };
        return true;
    }
};

template<size_t MaxDepth>
bool parse(
    std::string_view benc,
    ParserStack<MaxDepth>& stack,
    Handler& handler,
    char const** setme_end = nullptr,
    tr_error** error = nullptr)
{
    stack.clear();

    int err = 0;
    for (;;)
    {
        if (std::empty(benc))
        {
            err = EILSEQ;
        }

        if (err != 0)
        {
            break;
        }

        switch (benc.front())
        {
        case 'i': // int
            if (auto const value = impl::ParseInt(&benc); !value)
            {
                tr_error_set(error, err, "Malformed benc? Unable to parse integer");
            }
            else if (!handler.Int64(*value))
            {
                err = ECANCELED;
                tr_error_set(error, err, "Handler indicated parser should stop");
            }
            else
            {
                stack.tokenWalked();
            }
            break;

        case 'l': // list
        case 'd': // dict
            {
                bool ok = benc.front() == 'l' ? stack.push(ParserStack<MaxDepth>::ParentType::Array, error) :
                                                stack.push(ParserStack<MaxDepth>::ParentType::Dict, error);
                if (!ok)
                {
                    err = EILSEQ;
                    break;
                }

                ok = benc.front() == 'l' ? handler.StartArray() : handler.StartDict();
                if (!ok)
                {
                    err = ECANCELED;
                    tr_error_set(error, err, "Handler indicated parser should stop");
                    break;
                }

                benc.remove_prefix(1);
                break;
            }
        case 'e': // end of list or dict
            benc.remove_prefix(1);

            if (auto const parent_type = stack.pop(error); !parent_type)
            {
                err = EILSEQ;
            }
            else
            {
                stack.tokenWalked();

                if (auto const ok = *parent_type == ParserStack<MaxDepth>::ParentType::Array ? handler.EndArray() :
                                                                                               handler.EndDict();
                    !ok)
                {
                    err = ECANCELED;
                    tr_error_set(error, err, "Handler indicated parser should stop");
                }
            }
            break;

        case '0':
        case '1':
        case '2':
        case '3':
        case '4':
        case '5':
        case '6':
        case '7':
        case '8':
        case '9': // string
            if (auto const sv = impl::ParseString(&benc); !sv)
            {
                err = EILSEQ;
                tr_error_set(error, err, "Malformed benc? Unable to parse string");
            }
            else if (bool const ok = stack.expectingDictKey() ? handler.Key(*sv) : handler.String(*sv); !ok)
            {
                err = ECANCELED;
                tr_error_set(error, err, "Handler indicated parser should stop");
            }
            else
            {
                stack.tokenWalked();
            }
            break;

        default: // invalid bencoded text... march past it
            benc.remove_prefix(1);
            break;
        }

        if (stack.depth == 0)
        {
            break;
        }
    }

    if (err != 0)
    {
        errno = err;
        return false;
    }

    if (stack.depth != 0)
    {
        err = EILSEQ;
        tr_error_set(error, err, "premature end-of-data reached");
        errno = err;
        return false;
    }

    if (stack.stack[0].n_children_walked == 0)
    {
        err = EILSEQ;
        tr_error_set(error, err, "no data found");
        errno = err;
        return false;
    }

    if (setme_end != nullptr)
    {
        *setme_end = std::data(benc);
    }

    return true;
}

} // namespace transmission::benc