google-protobuf 3.13.0 → 3.15.6

Sign up to get free protection for your applications and to get access to all the features.

Potentially problematic release.


This version of google-protobuf might be problematic. Click here for more details.

@@ -0,0 +1,101 @@
1
+ // Protocol Buffers - Google's data interchange format
2
+ // Copyright 2008 Google Inc. All rights reserved.
3
+ // https://developers.google.com/protocol-buffers/
4
+ //
5
+ // Redistribution and use in source and binary forms, with or without
6
+ // modification, are permitted provided that the following conditions are
7
+ // met:
8
+ //
9
+ // * Redistributions of source code must retain the above copyright
10
+ // notice, this list of conditions and the following disclaimer.
11
+ // * Redistributions in binary form must reproduce the above
12
+ // copyright notice, this list of conditions and the following disclaimer
13
+ // in the documentation and/or other materials provided with the
14
+ // distribution.
15
+ // * Neither the name of Google Inc. nor the names of its
16
+ // contributors may be used to endorse or promote products derived from
17
+ // this software without specific prior written permission.
18
+ //
19
+ // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
20
+ // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
21
+ // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
22
+ // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
23
+ // OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
24
+ // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
25
+ // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
26
+ // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
27
+ // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
28
+ // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
29
+ // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
30
+
31
+ #ifndef RUBY_PROTOBUF_MESSAGE_H_
32
+ #define RUBY_PROTOBUF_MESSAGE_H_
33
+
34
+ #include <ruby/ruby.h>
35
+
36
+ #include "protobuf.h"
37
+ #include "ruby-upb.h"
38
+
39
+ // Gets the underlying upb_msg* and upb_msgdef for the given Ruby message
40
+ // wrapper. Requires that |value| is indeed a message object.
41
+ const upb_msg *Message_Get(VALUE value, const upb_msgdef **m);
42
+
43
+ // Like Message_Get(), but checks that the object is not frozen and returns a
44
+ // mutable pointer.
45
+ upb_msg *Message_GetMutable(VALUE value, const upb_msgdef **m);
46
+
47
+ // Returns the Arena object for this message.
48
+ VALUE Message_GetArena(VALUE value);
49
+
50
+ // Converts |value| into a upb_msg value of the expected upb_msgdef type,
51
+ // raising an error if this is not possible. Used when assigning |value| to a
52
+ // field of another message, which means the message must be of a particular
53
+ // type.
54
+ //
55
+ // This will perform automatic conversions in some cases (for example, Time ->
56
+ // Google::Protobuf::Timestamp). If any new message is created, it will be
57
+ // created on |arena|, and any existing message will have its arena fused with
58
+ // |arena|.
59
+ const upb_msg* Message_GetUpbMessage(VALUE value, const upb_msgdef* m,
60
+ const char* name, upb_arena* arena);
61
+
62
+ // Gets or constructs a Ruby wrapper object for the given message. The wrapper
63
+ // object will reference |arena| and ensure that it outlives this object.
64
+ VALUE Message_GetRubyWrapper(upb_msg* msg, const upb_msgdef* m, VALUE arena);
65
+
66
+ // Gets the given field from this message.
67
+ VALUE Message_getfield(VALUE _self, const upb_fielddef* f);
68
+
69
+ // Implements #inspect for this message, printing the text to |b|.
70
+ void Message_PrintMessage(StringBuilder* b, const upb_msg* msg,
71
+ const upb_msgdef* m);
72
+
73
+ // Returns a hash value for the given message.
74
+ uint64_t Message_Hash(const upb_msg *msg, const upb_msgdef *m, uint64_t seed);
75
+
76
+ // Returns a deep copy of the given message.
77
+ upb_msg* Message_deep_copy(const upb_msg* msg, const upb_msgdef* m,
78
+ upb_arena *arena);
79
+
80
+ // Returns true if these two messages are equal.
81
+ bool Message_Equal(const upb_msg *m1, const upb_msg *m2, const upb_msgdef *m);
82
+
83
+ // Checks that this Ruby object is a message, and raises an exception if not.
84
+ void Message_CheckClass(VALUE klass);
85
+
86
+ // Returns a new Hash object containing the contents of this message.
87
+ VALUE Scalar_CreateHash(upb_msgval val, TypeInfo type_info);
88
+
89
+ // Creates a message class or enum module for this descriptor, respectively.
90
+ VALUE build_class_from_descriptor(VALUE descriptor);
91
+ VALUE build_module_from_enumdesc(VALUE _enumdesc);
92
+
93
+ // Returns the Descriptor/EnumDescriptor for the given message class or enum
94
+ // module, respectively. Returns nil if this is not a message class or enum
95
+ // module.
96
+ VALUE MessageOrEnum_GetDescriptor(VALUE klass);
97
+
98
+ // Call at startup to register all types in this module.
99
+ void Message_register(VALUE protobuf);
100
+
101
+ #endif // RUBY_PROTOBUF_MESSAGE_H_
@@ -30,62 +30,324 @@
30
30
 
31
31
  #include "protobuf.h"
32
32
 
33
+ #include <ruby/version.h>
34
+
35
+ #include "defs.h"
36
+ #include "map.h"
37
+ #include "message.h"
38
+ #include "repeated_field.h"
39
+
33
40
  VALUE cError;
34
- VALUE cParseError;
35
41
  VALUE cTypeError;
36
- VALUE c_only_cookie = Qnil;
37
42
 
38
- static VALUE cached_empty_string = Qnil;
39
- static VALUE cached_empty_bytes = Qnil;
43
+ const upb_fielddef* map_field_key(const upb_fielddef* field) {
44
+ const upb_msgdef *entry = upb_fielddef_msgsubdef(field);
45
+ return upb_msgdef_itof(entry, 1);
46
+ }
47
+
48
+ const upb_fielddef* map_field_value(const upb_fielddef* field) {
49
+ const upb_msgdef *entry = upb_fielddef_msgsubdef(field);
50
+ return upb_msgdef_itof(entry, 2);
51
+ }
52
+
53
+ // -----------------------------------------------------------------------------
54
+ // StringBuilder, for inspect
55
+ // -----------------------------------------------------------------------------
56
+
57
+ struct StringBuilder {
58
+ size_t size;
59
+ size_t cap;
60
+ char *data;
61
+ };
62
+
63
+ typedef struct StringBuilder StringBuilder;
40
64
 
41
- static VALUE create_frozen_string(const char* str, size_t size, bool binary) {
42
- VALUE str_rb = rb_str_new(str, size);
65
+ static size_t StringBuilder_SizeOf(size_t cap) {
66
+ return sizeof(StringBuilder) + cap;
67
+ }
68
+
69
+ StringBuilder* StringBuilder_New() {
70
+ const size_t cap = 128;
71
+ StringBuilder* builder = malloc(sizeof(*builder));
72
+ builder->size = 0;
73
+ builder->cap = cap;
74
+ builder->data = malloc(builder->cap);
75
+ return builder;
76
+ }
77
+
78
+ void StringBuilder_Free(StringBuilder* b) {
79
+ free(b->data);
80
+ free(b);
81
+ }
82
+
83
+ void StringBuilder_Printf(StringBuilder* b, const char *fmt, ...) {
84
+ size_t have = b->cap - b->size;
85
+ size_t n;
86
+ va_list args;
87
+
88
+ va_start(args, fmt);
89
+ n = vsnprintf(&b->data[b->size], have, fmt, args);
90
+ va_end(args);
91
+
92
+ if (have <= n) {
93
+ while (have <= n) {
94
+ b->cap *= 2;
95
+ have = b->cap - b->size;
96
+ }
97
+ b->data = realloc(b->data, StringBuilder_SizeOf(b->cap));
98
+ va_start(args, fmt);
99
+ n = vsnprintf(&b->data[b->size], have, fmt, args);
100
+ va_end(args);
101
+ PBRUBY_ASSERT(n < have);
102
+ }
43
103
 
44
- rb_enc_associate(str_rb,
45
- binary ? kRubyString8bitEncoding : kRubyStringUtf8Encoding);
46
- rb_obj_freeze(str_rb);
47
- return str_rb;
104
+ b->size += n;
48
105
  }
49
106
 
50
- VALUE get_frozen_string(const char* str, size_t size, bool binary) {
51
- if (size == 0) {
52
- return binary ? cached_empty_bytes : cached_empty_string;
107
+ VALUE StringBuilder_ToRubyString(StringBuilder* b) {
108
+ VALUE ret = rb_str_new(b->data, b->size);
109
+ rb_enc_associate(ret, rb_utf8_encoding());
110
+ return ret;
111
+ }
112
+
113
+ static void StringBuilder_PrintEnum(StringBuilder* b, int32_t val,
114
+ const upb_enumdef* e) {
115
+ const char *name = upb_enumdef_iton(e, val);
116
+ if (name) {
117
+ StringBuilder_Printf(b, ":%s", name);
53
118
  } else {
54
- // It is harder to memoize non-empty strings. The obvious approach would be
55
- // to use a Ruby hash keyed by string as memo table, but looking up in such a table
56
- // requires constructing a string (the very thing we're trying to avoid).
57
- //
58
- // Since few fields have defaults, we will just optimize the empty string
59
- // case for now.
60
- return create_frozen_string(str, size, binary);
119
+ StringBuilder_Printf(b, "%" PRId32, val);
120
+ }
121
+ }
122
+
123
+ void StringBuilder_PrintMsgval(StringBuilder* b, upb_msgval val,
124
+ TypeInfo info) {
125
+ switch (info.type) {
126
+ case UPB_TYPE_BOOL:
127
+ StringBuilder_Printf(b, "%s", val.bool_val ? "true" : "false");
128
+ break;
129
+ case UPB_TYPE_FLOAT: {
130
+ VALUE str = rb_inspect(DBL2NUM(val.float_val));
131
+ StringBuilder_Printf(b, "%s", RSTRING_PTR(str));
132
+ break;
133
+ }
134
+ case UPB_TYPE_DOUBLE: {
135
+ VALUE str = rb_inspect(DBL2NUM(val.double_val));
136
+ StringBuilder_Printf(b, "%s", RSTRING_PTR(str));
137
+ break;
138
+ }
139
+ case UPB_TYPE_INT32:
140
+ StringBuilder_Printf(b, "%" PRId32, val.int32_val);
141
+ break;
142
+ case UPB_TYPE_UINT32:
143
+ StringBuilder_Printf(b, "%" PRIu32, val.uint32_val);
144
+ break;
145
+ case UPB_TYPE_INT64:
146
+ StringBuilder_Printf(b, "%" PRId64, val.int64_val);
147
+ break;
148
+ case UPB_TYPE_UINT64:
149
+ StringBuilder_Printf(b, "%" PRIu64, val.uint64_val);
150
+ break;
151
+ case UPB_TYPE_STRING:
152
+ StringBuilder_Printf(b, "\"%.*s\"", (int)val.str_val.size, val.str_val.data);
153
+ break;
154
+ case UPB_TYPE_BYTES:
155
+ StringBuilder_Printf(b, "\"%.*s\"", (int)val.str_val.size, val.str_val.data);
156
+ break;
157
+ case UPB_TYPE_ENUM:
158
+ StringBuilder_PrintEnum(b, val.int32_val, info.def.enumdef);
159
+ break;
160
+ case UPB_TYPE_MESSAGE:
161
+ Message_PrintMessage(b, val.msg_val, info.def.msgdef);
162
+ break;
61
163
  }
62
164
  }
63
165
 
64
166
  // -----------------------------------------------------------------------------
65
- // Utilities.
167
+ // Arena
66
168
  // -----------------------------------------------------------------------------
67
169
 
68
- // Raises a Ruby error if |status| is not OK, using its error message.
69
- void check_upb_status(const upb_status* status, const char* msg) {
70
- if (!upb_ok(status)) {
71
- rb_raise(rb_eRuntimeError, "%s: %s\n", msg, upb_status_errmsg(status));
170
+ typedef struct {
171
+ upb_arena *arena;
172
+ VALUE pinned_objs;
173
+ } Arena;
174
+
175
+ static void Arena_mark(void *data) {
176
+ Arena *arena = data;
177
+ rb_gc_mark(arena->pinned_objs);
178
+ }
179
+
180
+ static void Arena_free(void *data) {
181
+ Arena *arena = data;
182
+ upb_arena_free(arena->arena);
183
+ }
184
+
185
+ static VALUE cArena;
186
+
187
+ const rb_data_type_t Arena_type = {
188
+ "Google::Protobuf::Internal::Arena",
189
+ { Arena_mark, Arena_free, NULL },
190
+ .flags = RUBY_TYPED_FREE_IMMEDIATELY,
191
+ };
192
+
193
+ static VALUE Arena_alloc(VALUE klass) {
194
+ Arena *arena = ALLOC(Arena);
195
+ arena->arena = upb_arena_new();
196
+ arena->pinned_objs = Qnil;
197
+ return TypedData_Wrap_Struct(klass, &Arena_type, arena);
198
+ }
199
+
200
+ upb_arena *Arena_get(VALUE _arena) {
201
+ Arena *arena;
202
+ TypedData_Get_Struct(_arena, Arena, &Arena_type, arena);
203
+ return arena->arena;
204
+ }
205
+
206
+ VALUE Arena_new() {
207
+ return Arena_alloc(cArena);
208
+ }
209
+
210
+ void Arena_Pin(VALUE _arena, VALUE obj) {
211
+ Arena *arena;
212
+ TypedData_Get_Struct(_arena, Arena, &Arena_type, arena);
213
+ if (arena->pinned_objs == Qnil) {
214
+ arena->pinned_objs = rb_ary_new();
72
215
  }
216
+ rb_ary_push(arena->pinned_objs, obj);
73
217
  }
74
218
 
75
- // String encodings: we look these up once, at load time, and then cache them
76
- // here.
77
- rb_encoding* kRubyStringUtf8Encoding;
78
- rb_encoding* kRubyStringASCIIEncoding;
79
- rb_encoding* kRubyString8bitEncoding;
219
+ void Arena_register(VALUE module) {
220
+ VALUE internal = rb_define_module_under(module, "Internal");
221
+ VALUE klass = rb_define_class_under(internal, "Arena", rb_cObject);
222
+ rb_define_alloc_func(klass, Arena_alloc);
223
+ rb_gc_register_address(&cArena);
224
+ cArena = klass;
225
+ }
80
226
 
81
- // Ruby-interned string: "descriptor". We use this identifier to store an
82
- // instance variable on message classes we create in order to link them back to
83
- // their descriptors.
227
+ // -----------------------------------------------------------------------------
228
+ // Object Cache
229
+ // -----------------------------------------------------------------------------
230
+
231
+ // A pointer -> Ruby Object cache that keeps references to Ruby wrapper
232
+ // objects. This allows us to look up any Ruby wrapper object by the address
233
+ // of the object it is wrapping. That way we can avoid ever creating two
234
+ // different wrapper objects for the same C object, which saves memory and
235
+ // preserves object identity.
84
236
  //
85
- // We intern this once at module load time then use the interned identifier at
86
- // runtime in order to avoid the cost of repeatedly interning in hot paths.
87
- const char* kDescriptorInstanceVar = "descriptor";
88
- ID descriptor_instancevar_interned;
237
+ // We use WeakMap for the cache. For Ruby <2.7 we also need a secondary Hash
238
+ // to store WeakMap keys because Ruby <2.7 WeakMap doesn't allow non-finalizable
239
+ // keys.
240
+
241
+ #if RUBY_API_VERSION_CODE >= 20700
242
+ #define USE_SECONDARY_MAP 0
243
+ #else
244
+ #define USE_SECONDARY_MAP 1
245
+ #endif
246
+
247
+ #if USE_SECONDARY_MAP
248
+
249
+ // Maps Numeric -> Object. The object is then used as a key into the WeakMap.
250
+ // This is needed for Ruby <2.7 where a number cannot be a key to WeakMap.
251
+ // The object is used only for its identity; it does not contain any data.
252
+ VALUE secondary_map = Qnil;
253
+
254
+ static void SecondaryMap_Init() {
255
+ rb_gc_register_address(&secondary_map);
256
+ secondary_map = rb_hash_new();
257
+ }
258
+
259
+ static VALUE SecondaryMap_Get(VALUE key) {
260
+ VALUE ret = rb_hash_lookup(secondary_map, key);
261
+ if (ret == Qnil) {
262
+ ret = rb_eval_string("Object.new");
263
+ rb_hash_aset(secondary_map, key, ret);
264
+ }
265
+ return ret;
266
+ }
267
+
268
+ #endif
269
+
270
+ static VALUE ObjectCache_GetKey(const void* key) {
271
+ char buf[sizeof(key)];
272
+ memcpy(&buf, &key, sizeof(key));
273
+ intptr_t key_int = (intptr_t)key;
274
+ PBRUBY_ASSERT((key_int & 3) == 0);
275
+ VALUE ret = LL2NUM(key_int >> 2);
276
+ #if USE_SECONDARY_MAP
277
+ ret = SecondaryMap_Get(ret);
278
+ #endif
279
+ return ret;
280
+ }
281
+
282
+ // Public ObjectCache API.
283
+
284
+ VALUE weak_obj_cache = Qnil;
285
+ ID item_get;
286
+ ID item_set;
287
+
288
+ static void ObjectCache_Init() {
289
+ rb_gc_register_address(&weak_obj_cache);
290
+ VALUE klass = rb_eval_string("ObjectSpace::WeakMap");
291
+ weak_obj_cache = rb_class_new_instance(0, NULL, klass);
292
+ item_get = rb_intern("[]");
293
+ item_set = rb_intern("[]=");
294
+ #if USE_SECONDARY_MAP
295
+ SecondaryMap_Init();
296
+ #endif
297
+ }
298
+
299
+ void ObjectCache_Add(const void* key, VALUE val) {
300
+ PBRUBY_ASSERT(ObjectCache_Get(key) == Qnil);
301
+ VALUE key_rb = ObjectCache_GetKey(key);
302
+ rb_funcall(weak_obj_cache, item_set, 2, key_rb, val);
303
+ PBRUBY_ASSERT(ObjectCache_Get(key) == val);
304
+ }
305
+
306
+ // Returns the cached object for this key, if any. Otherwise returns Qnil.
307
+ VALUE ObjectCache_Get(const void* key) {
308
+ VALUE key_rb = ObjectCache_GetKey(key);
309
+ return rb_funcall(weak_obj_cache, item_get, 1, key_rb);
310
+ }
311
+
312
+ /*
313
+ * call-seq:
314
+ * Google::Protobuf.discard_unknown(msg)
315
+ *
316
+ * Discard unknown fields in the given message object and recursively discard
317
+ * unknown fields in submessages.
318
+ */
319
+ static VALUE Google_Protobuf_discard_unknown(VALUE self, VALUE msg_rb) {
320
+ const upb_msgdef *m;
321
+ upb_msg *msg = Message_GetMutable(msg_rb, &m);
322
+ if (!upb_msg_discardunknown(msg, m, 128)) {
323
+ rb_raise(rb_eRuntimeError, "Messages nested too deeply.");
324
+ }
325
+
326
+ return Qnil;
327
+ }
328
+
329
+ /*
330
+ * call-seq:
331
+ * Google::Protobuf.deep_copy(obj) => copy_of_obj
332
+ *
333
+ * Performs a deep copy of a RepeatedField instance, a Map instance, or a
334
+ * message object, recursively copying its members.
335
+ */
336
+ VALUE Google_Protobuf_deep_copy(VALUE self, VALUE obj) {
337
+ VALUE klass = CLASS_OF(obj);
338
+ if (klass == cRepeatedField) {
339
+ return RepeatedField_deep_copy(obj);
340
+ } else if (klass == cMap) {
341
+ return Map_deep_copy(obj);
342
+ } else {
343
+ VALUE new_arena_rb = Arena_new();
344
+ upb_arena *new_arena = Arena_get(new_arena_rb);
345
+ const upb_msgdef *m;
346
+ const upb_msg *msg = Message_Get(obj, &m);
347
+ upb_msg* new_msg = Message_deep_copy(msg, m, new_arena);
348
+ return Message_GetRubyWrapper(new_msg, m, new_arena_rb);
349
+ }
350
+ }
89
351
 
90
352
  // -----------------------------------------------------------------------------
91
353
  // Initialization/entry point.
@@ -93,44 +355,24 @@ ID descriptor_instancevar_interned;
93
355
 
94
356
  // This must be named "Init_protobuf_c" because the Ruby module is named
95
357
  // "protobuf_c" -- the VM looks for this symbol in our .so.
358
+ __attribute__ ((visibility ("default")))
96
359
  void Init_protobuf_c() {
360
+ ObjectCache_Init();
361
+
97
362
  VALUE google = rb_define_module("Google");
98
363
  VALUE protobuf = rb_define_module_under(google, "Protobuf");
99
- VALUE internal = rb_define_module_under(protobuf, "Internal");
100
-
101
- descriptor_instancevar_interned = rb_intern(kDescriptorInstanceVar);
102
- DescriptorPool_register(protobuf);
103
- Descriptor_register(protobuf);
104
- FileDescriptor_register(protobuf);
105
- FieldDescriptor_register(protobuf);
106
- OneofDescriptor_register(protobuf);
107
- EnumDescriptor_register(protobuf);
108
- MessageBuilderContext_register(internal);
109
- OneofBuilderContext_register(internal);
110
- EnumBuilderContext_register(internal);
111
- FileBuilderContext_register(internal);
112
- Builder_register(internal);
364
+
365
+ Arena_register(protobuf);
366
+ Defs_register(protobuf);
113
367
  RepeatedField_register(protobuf);
114
368
  Map_register(protobuf);
369
+ Message_register(protobuf);
115
370
 
116
371
  cError = rb_const_get(protobuf, rb_intern("Error"));
117
- cParseError = rb_const_get(protobuf, rb_intern("ParseError"));
118
372
  cTypeError = rb_const_get(protobuf, rb_intern("TypeError"));
119
373
 
120
374
  rb_define_singleton_method(protobuf, "discard_unknown",
121
375
  Google_Protobuf_discard_unknown, 1);
122
376
  rb_define_singleton_method(protobuf, "deep_copy",
123
377
  Google_Protobuf_deep_copy, 1);
124
-
125
- kRubyStringUtf8Encoding = rb_utf8_encoding();
126
- kRubyStringASCIIEncoding = rb_usascii_encoding();
127
- kRubyString8bitEncoding = rb_ascii8bit_encoding();
128
-
129
- rb_gc_register_address(&c_only_cookie);
130
- c_only_cookie = rb_class_new_instance(0, NULL, rb_cObject);
131
-
132
- rb_gc_register_address(&cached_empty_string);
133
- rb_gc_register_address(&cached_empty_bytes);
134
- cached_empty_string = create_frozen_string("", 0, false);
135
- cached_empty_bytes = create_frozen_string("", 0, true);
136
378
  }