libddwaf-src 2.0.1

Source distribution and build integration for DataDog/libddwaf
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101

// Unless explicitly stated otherwise all files in this repository are
// dual-licensed under the Apache-2.0 License or BSD-3-Clause License.
//
// This product includes software developed at Datadog (https://www.datadoghq.com/).
// Copyright 2021 Datadog, Inc.

#pragma once

#include <cstddef>
#include <string_view>
#include <unordered_set>
#include <vector>

namespace ddwaf {

template <typename T> struct base_token {
    T type{T::unknown};
    std::string_view str;
    std::size_t index{};
};

template <typename T> class base_tokenizer {
public:
    explicit base_tokenizer(std::string_view str, std::unordered_set<T> skip_tokens = {})
        : buffer_(str), skip_tokens_(std::move(skip_tokens))
    {}

protected:
    [[nodiscard]] char peek() const
    {
        if (idx_ >= buffer_.size()) {
            [[unlikely]] return '\0';
        }
        return buffer_[idx_];
    }
    [[nodiscard]] char prev(std::size_t offset = 1) const
    {
        if (idx_ < offset) {
            [[unlikely]] return '\0';
        }
        return buffer_[idx_ - 1];
    }

    bool advance(std::size_t offset = 1) { return (idx_ += offset) < buffer_.size(); }

    [[nodiscard]] char next(std::size_t offset = 1)
    {
        if ((idx_ + offset) >= buffer_.size()) {
            [[unlikely]] return '\0';
        }
        return buffer_[idx_ + offset];
    }

    bool eof() { return idx_ >= buffer_.size(); }

    [[nodiscard]] std::size_t index() const { return idx_; }

    std::string_view substr(std::size_t start, std::size_t size = std::string_view::npos)
    {
        return buffer_.substr(start, size);
    }

    std::string_view substr() { return buffer_.substr(idx_); }

    void add_token(T type, std::size_t size = 1)
    {
        base_token<T> token;
        token.index = index();
        token.type = type;
        token.str = substr(token.index, size);
        emplace_token(token);
        advance(token.str.size() - 1);
    }

    void add_token_from(T type, std::size_t begin)
    {
        base_token<T> token;
        token.index = begin;
        token.type = type;
        token.str = substr(begin, index() - begin);
        emplace_token(token);
    }

    void emplace_token(const base_token<T> &token)
    {
        if (!skip_tokens_.contains(token.type)) {
            tokens_.emplace_back(token);
        }
    }

    T current_token_type() const { return tokens_.back().type; }

    base_token<T> &current_token() { return tokens_.back(); }

    std::string_view buffer_;
    std::size_t idx_{0};
    std::unordered_set<T> skip_tokens_{};
    std::vector<base_token<T>> tokens_{};
};

} // namespace ddwaf