summaryrefslogtreecommitdiff
path: root/src/buffer.cc
blob: d39ec86e6b540048e03628bf53987c9f7fcf3f4d (plain)
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
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
#include "buffer.hh"

#include <algorithm>
#include <cassert>
#include <vector>

namespace {

class Round : public Buffer {
public:
  explicit Round(size_t size)
    : data_(std::make_unique<char[]>(size)), size_(size) {}

  bool empty() const override {
    return rptr_ == wptr_ && !full_;
  }

  bool full() const override {
    return rptr_ == wptr_ && full_;
  }

  void clear() override {
    rptr_ = wptr_ = 0;
    full_ = false;
  }

  char const* rbuf(size_t want, size_t& avail) override {
    if (rptr_ < wptr_) {
      avail = wptr_ - rptr_;
    } else if (rptr_ == wptr_ && !full_) {
      avail = 0;
    } else {
      avail = size_ - rptr_;
      if (want > avail) {
        auto* target = data_.get();
        for (; rptr_ < size_; ++rptr_) {
          std::swap(*target, data_[rptr_]);
          ++target;
        }
        rptr_ = 0;
        wptr_ += avail;
        if (wptr_ == size_) {
          assert(full_);
          wptr_ = 0;
          avail = size_ - rptr_;
        } else {
          avail = wptr_ - rptr_;
        }
      }
    }
    return data_.get() + rptr_;
  }

  void rcommit(size_t bytes) override {
    if (bytes == 0)
      return;
    full_ = false;
    assert(rptr_ < wptr_ ? rptr_ + bytes <= wptr_ : rptr_ + bytes <= size_);
    rptr_ += bytes;
    if (rptr_ == size_)
      rptr_ = 0;
    if (rptr_ == wptr_)
      rptr_ = wptr_ = 0;
  }

  char* wbuf(size_t request, size_t& avail) override {
    if (wptr_ < rptr_) {
      avail = rptr_ - wptr_;
    } else if (rptr_ == wptr_ && full_) {
      avail = 0;
    } else {
      avail = size_ - wptr_;
      if (avail < request && wptr_ != 0 && rptr_ != 0) {
        std::copy(data_.get() + rptr_, data_.get() + wptr_, data_.get());
        auto size = wptr_ - rptr_;
        wptr_ = size;
        rptr_ = 0;
        avail = size_ - wptr_;
      }
    }
    return data_.get() + wptr_;
  }

  void wcommit(size_t bytes) override {
    if (bytes == 0)
      return;
    assert(wptr_ < rptr_ ? wptr_ + bytes <= rptr_ : wptr_ + bytes <= size_);
    wptr_ += bytes;
    if (wptr_ == size_)
      wptr_ = 0;
    if (wptr_ == rptr_)
      full_ = true;
  }

private:
  std::unique_ptr<char[]> data_;
  size_t const size_;
  size_t rptr_{0};
  size_t wptr_{0};
  bool full_{false};
};

class Growing : public Buffer {
public:
  Growing(size_t base_size, size_t max_size)
    : base_size_(base_size), max_size_(max_size), data_(base_size) {
  }

  bool empty() const override {
    return rptr_ == wptr_;
  }

  bool full() const override {
    return rptr_ == 0 && wptr_ == max_size_;
  }

  void clear() override {
    data_.resize(base_size_);
    rptr_ = wptr_ = 0;
  }

  char const* rbuf(size_t, size_t& avail) override {
    avail = wptr_ - rptr_;
    return data_.data() + rptr_;
  }

  void rcommit(size_t bytes) override {
    assert(rptr_ + bytes <= wptr_);
    rptr_ += bytes;
    if (rptr_ == wptr_)
      rptr_ = wptr_ = 0;
  }

  char* wbuf(size_t request, size_t& avail) override {
    avail = data_.size() - wptr_;
    if (request > avail && rptr_ > 0) {
      std::copy(data_.begin() + rptr_, data_.begin() + wptr_, data_.begin());
      wptr_ -= rptr_;
      rptr_ = 0;
      avail = data_.size() - wptr_;
    }
    if (request > avail && data_.size() < max_size_) {
      data_.resize(
          std::min(max_size_,
                   data_.size() + std::max(request - avail,
                                           (max_size_ - base_size_) / 8)));
      avail = data_.size() - wptr_;
    }
    return data_.data() + wptr_;
  }

  void wcommit(size_t bytes) override {
    assert(wptr_ + bytes <= data_.size());
    wptr_ += bytes;
  }

private:
  size_t const base_size_;
  size_t const max_size_;
  std::vector<char> data_;
  size_t rptr_{0};
  size_t wptr_{0};
};

class Null : public Buffer {
public:
  bool empty() const override {
    return true;
  }

  char const* rbuf(size_t, size_t& avail) override {
    avail = 0;
    return buf_;
  }

  void rcommit(size_t bytes) override {
    assert(bytes == 0);
  }

  bool full() const override {
    return false;
  }

  void clear() override {}

  char* wbuf(size_t, size_t& avail) override {
    avail = sizeof(buf_);
    return buf_;
  }

  void wcommit(size_t) override {
  }

private:
  char buf_[4096];
};

}  // namespace

std::unique_ptr<Buffer> Buffer::fixed(size_t size) {
  return std::make_unique<Round>(size);
}

std::unique_ptr<Buffer> Buffer::growing(size_t base_size, size_t max_size) {
  return std::make_unique<Growing>(base_size, max_size);
}

std::unique_ptr<Buffer> Buffer::null() {
  return std::make_unique<Null>();
}

size_t Buffer::write(void const* data, size_t len) {
  assert(data);
  if (len == 0)
    return 0;
  auto* d = reinterpret_cast<char const*>(data);
  size_t wrote = 0;
  while (true) {
    size_t avail;
    auto want = len - wrote;
    auto* ptr = wbuf(want, avail);
    if (avail == 0)
      return wrote;
    if (avail >= want) {
      std::copy_n(d + wrote, want, ptr);
      wcommit(want);
      return len;
    }
    std::copy_n(d + wrote, avail, ptr);
    wcommit(avail);
    wrote += avail;
  }
}