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
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
| //===-- MsgPackDocument.h - MsgPack Document --------------------*- C++ -*-===//
//
// 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
//
//===----------------------------------------------------------------------===//
///
/// This file declares a class that exposes a simple in-memory representation
/// of a document of MsgPack objects, that can be read from MsgPack, written to
/// MsgPack, and inspected and modified in memory. This is intended to be a
/// lighter-weight (in terms of memory allocations) replacement for
/// MsgPackTypes.
///
//===----------------------------------------------------------------------===//
#ifndef LLVM_BINARYFORMAT_MSGPACKDOCUMENT_H
#define LLVM_BINARYFORMAT_MSGPACKDOCUMENT_H
#include "llvm/BinaryFormat/MsgPackReader.h"
#include <map>
namespace llvm {
namespace msgpack {
class ArrayDocNode;
class Document;
class MapDocNode;
/// The kind of a DocNode and its owning Document.
struct KindAndDocument {
Document *Doc;
Type Kind;
};
/// A node in a MsgPack Document. This is a simple copyable and
/// passable-by-value type that does not own any memory.
class DocNode {
friend Document;
public:
typedef std::map<DocNode, DocNode> MapTy;
typedef std::vector<DocNode> ArrayTy;
private:
// Using KindAndDocument allows us to squeeze Kind and a pointer to the
// owning Document into the same word. Having a pointer to the owning
// Document makes the API of DocNode more convenient, and allows its use in
// YAMLIO.
const KindAndDocument *KindAndDoc;
protected:
// The union of different values.
union {
int64_t Int;
uint64_t UInt;
bool Bool;
double Float;
StringRef Raw;
ArrayTy *Array;
MapTy *Map;
};
public:
DocNode() : KindAndDoc(nullptr) {}
// Type methods
bool isMap() const { return getKind() == Type::Map; }
bool isArray() const { return getKind() == Type::Array; }
bool isScalar() const { return !isMap() && !isArray(); }
bool isString() const { return getKind() == Type::String; }
// Accessors
bool isEmpty() const { return !KindAndDoc; }
Type getKind() const { return KindAndDoc->Kind; }
Document *getDocument() const { return KindAndDoc->Doc; }
int64_t &getInt() {
assert(getKind() == Type::Int);
return Int;
}
uint64_t &getUInt() {
assert(getKind() == Type::UInt);
return UInt;
}
bool &getBool() {
assert(getKind() == Type::Boolean);
return Bool;
}
double &getFloat() {
assert(getKind() == Type::Float);
return Float;
}
int64_t getInt() const {
assert(getKind() == Type::Int);
return Int;
}
uint64_t getUInt() const {
assert(getKind() == Type::UInt);
return UInt;
}
bool getBool() const {
assert(getKind() == Type::Boolean);
return Bool;
}
double getFloat() const {
assert(getKind() == Type::Float);
return Float;
}
StringRef getString() const {
assert(getKind() == Type::String);
return Raw;
}
/// Get an ArrayDocNode for an array node. If Convert, convert the node to an
/// array node if necessary.
ArrayDocNode &getArray(bool Convert = false) {
if (getKind() != Type::Array) {
assert(Convert);
convertToArray();
}
// This could be a static_cast, except ArrayDocNode is a forward reference.
return *reinterpret_cast<ArrayDocNode *>(this);
}
/// Get a MapDocNode for a map node. If Convert, convert the node to a map
/// node if necessary.
MapDocNode &getMap(bool Convert = false) {
if (getKind() != Type::Map) {
assert(Convert);
convertToMap();
}
// This could be a static_cast, except MapDocNode is a forward reference.
return *reinterpret_cast<MapDocNode *>(this);
}
/// Comparison operator, used for map keys.
friend bool operator<(const DocNode &Lhs, const DocNode &Rhs) {
// This has to cope with one or both of the nodes being default-constructed,
// such that KindAndDoc is not set.
if (Lhs.KindAndDoc != Rhs.KindAndDoc) {
if (!Rhs.KindAndDoc)
return false;
if (!Lhs.KindAndDoc)
return true;
return (unsigned)Lhs.getKind() < (unsigned)Rhs.getKind();
}
switch (Lhs.getKind()) {
case Type::Int:
return Lhs.Int < Rhs.Int;
case Type::UInt:
return Lhs.UInt < Rhs.UInt;
case Type::Nil:
return false;
case Type::Boolean:
return Lhs.Bool < Rhs.Bool;
case Type::Float:
return Lhs.Float < Rhs.Float;
case Type::String:
case Type::Binary:
return Lhs.Raw < Rhs.Raw;
default:
llvm_unreachable("bad map key type");
}
}
/// Equality operator
friend bool operator==(const DocNode &Lhs, const DocNode &Rhs) {
return !(Lhs < Rhs) && !(Rhs < Lhs);
}
/// Convert this node to a string, assuming it is scalar.
std::string toString() const;
/// Convert the StringRef and use it to set this DocNode (assuming scalar). If
/// it is a string, copy the string into the Document's strings list so we do
/// not rely on S having a lifetime beyond this call. Tag is "" or a YAML tag.
StringRef fromString(StringRef S, StringRef Tag = "");
private:
// Private constructor setting KindAndDoc, used by methods in Document.
DocNode(const KindAndDocument *KindAndDoc) : KindAndDoc(KindAndDoc) {}
void convertToArray();
void convertToMap();
};
/// A DocNode that is a map.
class MapDocNode : public DocNode {
public:
MapDocNode() {}
MapDocNode(DocNode &N) : DocNode(N) { assert(getKind() == Type::Map); }
// Map access methods.
size_t size() const { return Map->size(); }
bool empty() const { return !size(); }
MapTy::iterator begin() { return Map->begin(); }
MapTy::iterator end() { return Map->end(); }
MapTy::iterator find(DocNode Key) { return Map->find(Key); }
MapTy::iterator find(StringRef Key);
/// Member access. The string data must remain valid for the lifetime of the
/// Document.
DocNode &operator[](StringRef S);
/// Member access.
DocNode &operator[](DocNode Key);
};
/// A DocNode that is an array.
class ArrayDocNode : public DocNode {
public:
ArrayDocNode() {}
ArrayDocNode(DocNode &N) : DocNode(N) { assert(getKind() == Type::Array); }
// Array access methods.
size_t size() const { return Array->size(); }
bool empty() const { return !size(); }
ArrayTy::iterator begin() { return Array->begin(); }
ArrayTy::iterator end() { return Array->end(); }
void push_back(DocNode N) {
assert(N.getDocument() == getDocument());
Array->push_back(N);
}
/// Element access. This extends the array if necessary.
DocNode &operator[](size_t Index);
};
/// Simple in-memory representation of a document of msgpack objects with
/// ability to find and create array and map elements. Does not currently cope
/// with any extension types.
class Document {
// Maps, arrays and strings used by nodes in the document. No attempt is made
// to free unused ones.
std::vector<std::unique_ptr<DocNode::MapTy>> Maps;
std::vector<std::unique_ptr<DocNode::ArrayTy>> Arrays;
std::vector<std::unique_ptr<char[]>> Strings;
// The root node of the document.
DocNode Root;
// The KindAndDocument structs pointed to by nodes in the document.
KindAndDocument KindAndDocs[size_t(Type::Extension) + 1];
// Whether YAML output uses hex for UInt.
bool HexMode = false;
public:
Document() {
clear();
for (unsigned T = 0; T != size_t(Type::Extension) + 1; ++T)
KindAndDocs[T] = {this, Type(T)};
}
/// Get ref to the document's root element.
DocNode &getRoot() { return Root; }
/// Restore the Document to an empty state.
void clear() { getRoot() = getNode(); }
/// Create a nil node associated with this Document.
DocNode getNode() {
auto N = DocNode(&KindAndDocs[size_t(Type::Nil)]);
return N;
}
/// Create an Int node associated with this Document.
DocNode getNode(int64_t V) {
auto N = DocNode(&KindAndDocs[size_t(Type::Int)]);
N.Int = V;
return N;
}
/// Create an Int node associated with this Document.
DocNode getNode(int V) {
auto N = DocNode(&KindAndDocs[size_t(Type::Int)]);
N.Int = V;
return N;
}
/// Create a UInt node associated with this Document.
DocNode getNode(uint64_t V) {
auto N = DocNode(&KindAndDocs[size_t(Type::UInt)]);
N.UInt = V;
return N;
}
/// Create a UInt node associated with this Document.
DocNode getNode(unsigned V) {
auto N = DocNode(&KindAndDocs[size_t(Type::UInt)]);
N.UInt = V;
return N;
}
/// Create a Boolean node associated with this Document.
DocNode getNode(bool V) {
auto N = DocNode(&KindAndDocs[size_t(Type::Boolean)]);
N.Bool = V;
return N;
}
/// Create a Float node associated with this Document.
DocNode getNode(double V) {
auto N = DocNode(&KindAndDocs[size_t(Type::Float)]);
N.Float = V;
return N;
}
/// Create a String node associated with this Document. If !Copy, the passed
/// string must remain valid for the lifetime of the Document.
DocNode getNode(StringRef V, bool Copy = false) {
if (Copy)
V = addString(V);
auto N = DocNode(&KindAndDocs[size_t(Type::String)]);
N.Raw = V;
return N;
}
/// Create a String node associated with this Document. If !Copy, the passed
/// string must remain valid for the lifetime of the Document.
DocNode getNode(const char *V, bool Copy = false) {
return getNode(StringRef(V), Copy);
}
/// Create an empty Map node associated with this Document.
MapDocNode getMapNode() {
auto N = DocNode(&KindAndDocs[size_t(Type::Map)]);
Maps.push_back(std::unique_ptr<DocNode::MapTy>(new DocNode::MapTy));
N.Map = Maps.back().get();
return N.getMap();
}
/// Create an empty Array node associated with this Document.
ArrayDocNode getArrayNode() {
auto N = DocNode(&KindAndDocs[size_t(Type::Array)]);
Arrays.push_back(std::unique_ptr<DocNode::ArrayTy>(new DocNode::ArrayTy));
N.Array = Arrays.back().get();
return N.getArray();
}
/// Read a MsgPack document from a binary MsgPack blob.
/// The blob data must remain valid for the lifetime of this Document (because
/// a string object in the document contains a StringRef into the original
/// blob).
/// If Multi, then this sets root to an array and adds top-level objects to
/// it. If !Multi, then it only reads a single top-level object, even if there
/// are more, and sets root to that.
/// Returns false if failed due to illegal format.
bool readFromBlob(StringRef Blob, bool Multi);
/// Write a MsgPack document to a binary MsgPack blob.
void writeToBlob(std::string &Blob);
/// Copy a string into the Document's strings list, and return the copy that
/// is owned by the Document.
StringRef addString(StringRef S) {
Strings.push_back(std::unique_ptr<char[]>(new char[S.size()]));
memcpy(&Strings.back()[0], S.data(), S.size());
return StringRef(&Strings.back()[0], S.size());
}
/// Set whether YAML output uses hex for UInt. Default off.
void setHexMode(bool Val = true) { HexMode = Val; }
/// Get Hexmode flag.
bool getHexMode() const { return HexMode; }
/// Convert MsgPack Document to YAML text.
void toYAML(raw_ostream &OS);
/// Read YAML text into the MsgPack document. Returns false on failure.
bool fromYAML(StringRef S);
};
} // namespace msgpack
} // namespace llvm
#endif // LLVM_BINARYFORMAT_MSGPACKDOCUMENT_H
|