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
102
103
104
105
106
107
|
/*
* Copyright (C) 2021 Linux Studio Plugins Project <https://lsp-plug.in/>
* (C) 2021 Vladimir Sadovnikov <sadko4u@gmail.com>
*
* This file is part of lsp-runtime-lib
* Created on: 13 мар. 2021 г.
*
* lsp-runtime-lib is free software: you can redistribute it and/or modify
* it under the terms of the GNU Lesser General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* any later version.
*
* lsp-runtime-lib is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU Lesser General Public License for more details.
*
* You should have received a copy of the GNU Lesser General Public License
* along with lsp-runtime-lib. If not, see <https://www.gnu.org/licenses/>.
*/
#ifndef LSP_PLUG_IN_RESOURCE_BUFFER_H_
#define LSP_PLUG_IN_RESOURCE_BUFFER_H_
#include <lsp-plug.in/runtime/version.h>
#include <lsp-plug.in/common/types.h>
#include <lsp-plug.in/common/status.h>
namespace lsp
{
namespace resource
{
/**
* The maximum number of characters appended to the replay buffer
* if the character repeat at the tail is used.
*/
static const size_t REPEAT_BUF_MAX = 4;
/**
* Location in the buffer
*/
typedef struct location_t
{
ssize_t offset; // Offset relative to the buffer
size_t len; // Length of the block
size_t repeat; // Number of repeats
} location_t;
/**
* Compression buffer
*/
typedef struct cbuffer_t
{
public:
uint8_t *data; // Buffer data (2 x capacity)
uint32_t *index; // Index
ssize_t head; // Head of the buffer
ssize_t tail; // Buffer tail
ssize_t cap; // Buffer capacity
public:
explicit cbuffer_t();
~cbuffer_t();
status_t init(size_t capacity);
void destroy();
public:
void append(const void *src, ssize_t count);
void append(uint8_t v);
size_t lookup(ssize_t *out, const void *src, size_t avail);
void clear();
inline size_t size() const { return tail - head; }
} cbuffer_t;
/**
* Decompression buffer
*/
typedef struct dbuffer_t
{
public:
uint8_t *data; // Buffer data (2 x capacity)
ssize_t head; // Head of the buffer
ssize_t tail; // Buffer tail
ssize_t cap; // Buffer capacity
public:
explicit dbuffer_t();
~dbuffer_t();
status_t init(size_t capacity);
void destroy();
public:
void append(const void *src, ssize_t count);
void append(uint8_t v);
void clear();
inline size_t size() const { return tail - head; }
} duffer_t;
}
}
#endif /* LSP_PLUG_IN_RESOURCE_BUFFER_H_ */
|
