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
|
//===-- lib/Parser/char-buffer.cpp ----------------------------------------===//
//
// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
// See https://llvm.org/LICENSE.txt for license information.
// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
//
//===----------------------------------------------------------------------===//
#include "flang/Parser/char-buffer.h"
#include "flang/Common/idioms.h"
#include <algorithm>
#include <cstddef>
#include <cstring>
namespace Fortran::parser {
char *CharBuffer::FreeSpace(std::size_t &n) {
int offset{LastBlockOffset()};
if (blocks_.empty()) {
blocks_.emplace_front();
last_ = blocks_.begin();
lastBlockEmpty_ = true;
} else if (offset == 0 && !lastBlockEmpty_) {
last_ = blocks_.emplace_after(last_);
lastBlockEmpty_ = true;
}
n = Block::capacity - offset;
return last_->data + offset;
}
void CharBuffer::Claim(std::size_t n) {
if (n > 0) {
bytes_ += n;
lastBlockEmpty_ = false;
}
}
std::size_t CharBuffer::Put(const char *data, std::size_t n) {
std::size_t chunk;
for (std::size_t at{0}; at < n; at += chunk) {
char *to{FreeSpace(chunk)};
chunk = std::min(n - at, chunk);
Claim(chunk);
std::memcpy(to, data + at, chunk);
}
return bytes_ - n;
}
std::size_t CharBuffer::Put(const std::string &str) {
return Put(str.data(), str.size());
}
std::string CharBuffer::Marshal() const {
std::string result;
std::size_t bytes{bytes_};
result.reserve(bytes);
for (const Block &block : blocks_) {
std::size_t chunk{std::min(bytes, Block::capacity)};
for (std::size_t j{0}; j < chunk; ++j) {
result += block.data[j];
}
bytes -= chunk;
}
result.shrink_to_fit();
CHECK(result.size() == bytes_);
return result;
}
} // namespace Fortran::parser
|
