blob: 94cc2d320f675c2f875997fcdec7f556112d97c0 (
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
|
/*
*
* Licensed to the Apache Software Foundation (ASF) under one
* or more contributor license agreements. See the NOTICE file
* distributed with this work for additional information
* regarding copyright ownership. The ASF licenses this file
* to you under the Apache License, Version 2.0 (the
* "License"); you may not use this file except in compliance
* with the License. You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing,
* software distributed under the License is distributed on an
* "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
* KIND, either express or implied. See the License for the
* specific language governing permissions and limitations
* under the License.
*
*/
#include "amqp_types.h"
#include "qpid/Exception.h"
#include <boost/iterator/iterator_facade.hpp>
#ifndef _Buffer_
#define _Buffer_
namespace qpid {
namespace framing {
struct OutOfBounds : qpid::Exception {};
class Content;
class FieldTable;
class Buffer
{
uint32_t size;
char* data;
uint32_t position;
uint32_t r_position;
void checkAvailable(uint32_t count) { if (position + count > size) throw OutOfBounds(); }
public:
/** Buffer input/output iterator.
* Supports using an amqp_0_10::Codec with a framing::Buffer.
*/
class Iterator : public boost::iterator_facade<
Iterator, char, boost::random_access_traversal_tag>
{
public:
Iterator(Buffer& b) : buffer(&b) {}
private:
friend class boost::iterator_core_access;
char& dereference() const { return buffer->data[buffer->position]; }
void increment() { ++buffer->position; }
bool equal(const Iterator& x) const { return buffer == x.buffer; }
Buffer* buffer;
};
friend class Iterator;
Buffer(char* data=0, uint32_t size=0);
void record();
void restore(bool reRecord = false);
void reset();
uint32_t available() { return size - position; }
uint32_t getSize() { return size; }
uint32_t getPosition() { return position; }
Iterator getIterator() { return Iterator(*this); }
void putOctet(uint8_t i);
void putShort(uint16_t i);
void putLong(uint32_t i);
void putLongLong(uint64_t i);
void putFloat(float f);
void putDouble(double f);
void putBin128(uint8_t* b);
uint8_t getOctet();
uint16_t getShort();
uint32_t getLong();
uint64_t getLongLong();
float getFloat();
double getDouble();
template <int n>
uint64_t getUInt();
template <int n>
void putUInt(uint64_t);
void putShortString(const string& s);
void putMediumString(const string& s);
void putLongString(const string& s);
void getShortString(string& s);
void getMediumString(string& s);
void getLongString(string& s);
void getBin128(uint8_t* b);
void putRawData(const string& s);
void getRawData(string& s, uint32_t size);
void putRawData(const uint8_t* data, size_t size);
void getRawData(uint8_t* data, size_t size);
template <class T> void put(const T& data) { data.encode(*this); }
template <class T> void get(T& data) { data.decode(*this); }
void dump(std::ostream&) const;
};
std::ostream& operator<<(std::ostream&, const Buffer&);
}} // namespace qpid::framing
#endif
|
