peter klausler | dd9923b | 2018-02-16 19:42:17 | [diff] [blame] | 1 | #ifndef FORTRAN_PARSER_CHAR_BUFFER_H_ |
| 2 | #define FORTRAN_PARSER_CHAR_BUFFER_H_ |
peter klausler | 15fdae6 | 2018-01-30 19:47:17 | [diff] [blame] | 3 | |
| 4 | // Defines a simple expandable buffer suitable for efficiently accumulating |
| 5 | // a stream of bytes. |
| 6 | |
| 7 | #include <forward_list> |
| 8 | #include <string> |
| 9 | #include <utility> |
| 10 | #include <vector> |
| 11 | |
| 12 | namespace Fortran { |
peter klausler | 0ba1a14 | 2018-02-07 20:04:42 | [diff] [blame] | 13 | namespace parser { |
peter klausler | 15fdae6 | 2018-01-30 19:47:17 | [diff] [blame] | 14 | |
| 15 | class CharBuffer { |
peter klausler | bdea10d | 2018-02-05 20:54:36 | [diff] [blame] | 16 | public: |
peter klausler | 15fdae6 | 2018-01-30 19:47:17 | [diff] [blame] | 17 | CharBuffer() {} |
| 18 | CharBuffer(CharBuffer &&that) |
peter klausler | 16c6f53 | 2018-02-05 22:29:26 | [diff] [blame] | 19 | : blocks_(std::move(that.blocks_)), last_{that.last_}, bytes_{that.bytes_}, |
| 20 | lastBlockEmpty_{that.lastBlockEmpty_} { |
peter klausler | 15fdae6 | 2018-01-30 19:47:17 | [diff] [blame] | 21 | that.clear(); |
| 22 | } |
| 23 | CharBuffer &operator=(CharBuffer &&that) { |
| 24 | blocks_ = std::move(that.blocks_); |
| 25 | last_ = that.last_; |
| 26 | bytes_ = that.bytes_; |
| 27 | lastBlockEmpty_ = that.lastBlockEmpty_; |
| 28 | that.clear(); |
| 29 | return *this; |
| 30 | } |
| 31 | |
peter klausler | 09865ff | 2018-02-09 22:04:11 | [diff] [blame] | 32 | size_t size() const { return bytes_; } |
peter klausler | 15fdae6 | 2018-01-30 19:47:17 | [diff] [blame] | 33 | |
| 34 | void clear() { |
| 35 | blocks_.clear(); |
| 36 | last_ = blocks_.end(); |
| 37 | bytes_ = 0; |
| 38 | lastBlockEmpty_ = false; |
| 39 | } |
| 40 | |
| 41 | char *FreeSpace(size_t *); |
| 42 | void Claim(size_t); |
| 43 | void Put(const char *data, size_t n); |
| 44 | void Put(const std::string &); |
peter klausler | 15fdae6 | 2018-01-30 19:47:17 | [diff] [blame] | 45 | void Put(char x) { Put(&x, 1); } |
peter klausler | 15fdae6 | 2018-01-30 19:47:17 | [diff] [blame] | 46 | |
peter klausler | bdea10d | 2018-02-05 20:54:36 | [diff] [blame] | 47 | private: |
peter klausler | 15fdae6 | 2018-01-30 19:47:17 | [diff] [blame] | 48 | struct Block { |
| 49 | static constexpr size_t capacity{1 << 20}; |
| 50 | char data[capacity]; |
| 51 | }; |
| 52 | |
peter klausler | bdea10d | 2018-02-05 20:54:36 | [diff] [blame] | 53 | public: |
peter klausler | 15fdae6 | 2018-01-30 19:47:17 | [diff] [blame] | 54 | class iterator { |
peter klausler | bdea10d | 2018-02-05 20:54:36 | [diff] [blame] | 55 | public: |
peter klausler | 15fdae6 | 2018-01-30 19:47:17 | [diff] [blame] | 56 | iterator() {} |
| 57 | iterator(std::forward_list<Block>::const_iterator block, int offset) |
| 58 | : block_{block}, offset_{offset} {} |
| 59 | iterator(const iterator &that) |
| 60 | : block_{that.block_}, offset_{that.offset_} {} |
| 61 | iterator &operator=(const iterator &that) { |
| 62 | block_ = that.block_; |
| 63 | offset_ = that.offset_; |
| 64 | return *this; |
| 65 | } |
| 66 | const char &operator*() const { return block_->data[offset_]; } |
| 67 | iterator &operator++() { |
| 68 | if (++offset_ == Block::capacity) { |
| 69 | ++block_; |
| 70 | offset_ = 0; |
| 71 | } |
| 72 | return *this; |
| 73 | } |
| 74 | iterator operator++(int) { |
| 75 | iterator result{*this}; |
| 76 | ++*this; |
| 77 | return result; |
| 78 | } |
| 79 | iterator &operator+=(size_t n) { |
| 80 | while (n >= Block::capacity - offset_) { |
| 81 | n -= Block::capacity - offset_; |
| 82 | offset_ = 0; |
| 83 | ++block_; |
| 84 | } |
| 85 | offset_ += n; |
| 86 | return *this; |
| 87 | } |
| 88 | bool operator==(const iterator &that) const { |
| 89 | return block_ == that.block_ && offset_ == that.offset_; |
| 90 | } |
| 91 | bool operator!=(const iterator &that) const { |
| 92 | return block_ != that.block_ || offset_ != that.offset_; |
| 93 | } |
peter klausler | 16c6f53 | 2018-02-05 22:29:26 | [diff] [blame] | 94 | |
peter klausler | bdea10d | 2018-02-05 20:54:36 | [diff] [blame] | 95 | private: |
peter klausler | 15fdae6 | 2018-01-30 19:47:17 | [diff] [blame] | 96 | std::forward_list<Block>::const_iterator block_; |
| 97 | int offset_; |
| 98 | }; |
| 99 | |
| 100 | iterator begin() const { return iterator(blocks_.begin(), 0); } |
| 101 | iterator end() const { |
| 102 | int offset = LastBlockOffset(); |
| 103 | if (offset != 0 || lastBlockEmpty_) { |
| 104 | return iterator(last_, offset); |
| 105 | } |
| 106 | return iterator(blocks_.end(), 0); |
| 107 | } |
| 108 | |
peter klausler | bdea10d | 2018-02-05 20:54:36 | [diff] [blame] | 109 | private: |
peter klausler | 15fdae6 | 2018-01-30 19:47:17 | [diff] [blame] | 110 | int LastBlockOffset() const { return bytes_ % Block::capacity; } |
| 111 | std::forward_list<Block> blocks_; |
| 112 | std::forward_list<Block>::iterator last_{blocks_.end()}; |
| 113 | size_t bytes_{0}; |
| 114 | bool lastBlockEmpty_{false}; |
| 115 | }; |
peter klausler | 0ba1a14 | 2018-02-07 20:04:42 | [diff] [blame] | 116 | } // namespace parser |
peter klausler | 15fdae6 | 2018-01-30 19:47:17 | [diff] [blame] | 117 | } // namespace Fortran |
peter klausler | dd9923b | 2018-02-16 19:42:17 | [diff] [blame] | 118 | #endif // FORTRAN_PARSER_CHAR_BUFFER_H_ |