2014-11-18 22:19:58 +00:00
|
|
|
// Protocol Buffers - Google's data interchange format
|
|
|
|
// Copyright 2014 Google Inc. All rights reserved.
|
|
|
|
// https://developers.google.com/protocol-buffers/
|
|
|
|
//
|
|
|
|
// Redistribution and use in source and binary forms, with or without
|
|
|
|
// modification, are permitted provided that the following conditions are
|
|
|
|
// met:
|
|
|
|
//
|
|
|
|
// * Redistributions of source code must retain the above copyright
|
|
|
|
// notice, this list of conditions and the following disclaimer.
|
|
|
|
// * Redistributions in binary form must reproduce the above
|
|
|
|
// copyright notice, this list of conditions and the following disclaimer
|
|
|
|
// in the documentation and/or other materials provided with the
|
|
|
|
// distribution.
|
|
|
|
// * Neither the name of Google Inc. nor the names of its
|
|
|
|
// contributors may be used to endorse or promote products derived from
|
|
|
|
// this software without specific prior written permission.
|
|
|
|
//
|
|
|
|
// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
|
|
|
|
// "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
|
|
|
|
// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
|
|
|
|
// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
|
|
|
|
// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
|
|
|
|
// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
|
|
|
|
// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
|
|
|
|
// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
|
|
|
|
// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
|
|
|
// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
|
|
|
|
// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
|
|
|
|
|
|
|
#include "protobuf.h"
|
|
|
|
|
2019-03-06 23:44:38 +00:00
|
|
|
// -----------------------------------------------------------------------------
|
|
|
|
// Global map from upb {msg,enum}defs to wrapper Descriptor/EnumDescriptor
|
|
|
|
// instances.
|
|
|
|
// -----------------------------------------------------------------------------
|
|
|
|
|
|
|
|
// This is a hash table from def objects (encoded by converting pointers to
|
|
|
|
// Ruby integers) to MessageDef/EnumDef instances (as Ruby values).
|
|
|
|
VALUE upb_def_to_ruby_obj_map;
|
|
|
|
|
2015-07-15 18:05:10 +00:00
|
|
|
VALUE cError;
|
|
|
|
VALUE cParseError;
|
2018-06-27 03:24:24 +00:00
|
|
|
VALUE cTypeError;
|
2019-03-06 23:44:38 +00:00
|
|
|
|
|
|
|
void add_def_obj(const void* def, VALUE value) {
|
|
|
|
rb_hash_aset(upb_def_to_ruby_obj_map, ULL2NUM((intptr_t)def), value);
|
|
|
|
}
|
|
|
|
|
|
|
|
VALUE get_def_obj(const void* def) {
|
|
|
|
return rb_hash_aref(upb_def_to_ruby_obj_map, ULL2NUM((intptr_t)def));
|
|
|
|
}
|
2014-11-18 22:19:58 +00:00
|
|
|
|
2019-08-13 11:54:11 +00:00
|
|
|
static VALUE cached_empty_string = Qnil;
|
|
|
|
static VALUE cached_empty_bytes = Qnil;
|
|
|
|
|
|
|
|
static VALUE create_frozen_string(const char* str, size_t size, bool binary) {
|
|
|
|
VALUE str_rb = rb_str_new(str, size);
|
|
|
|
|
|
|
|
rb_enc_associate(str_rb,
|
|
|
|
binary ? kRubyString8bitEncoding : kRubyStringUtf8Encoding);
|
|
|
|
rb_obj_freeze(str_rb);
|
|
|
|
return str_rb;
|
|
|
|
}
|
|
|
|
|
|
|
|
VALUE get_frozen_string(const char* str, size_t size, bool binary) {
|
|
|
|
if (size == 0) {
|
|
|
|
return binary ? cached_empty_bytes : cached_empty_string;
|
|
|
|
} else {
|
|
|
|
// It is harder to memoize non-empty strings. The obvious approach would be
|
|
|
|
// to use a Ruby hash keyed by string as memo table, but looking up in such a table
|
|
|
|
// requires constructing a string (the very thing we're trying to avoid).
|
|
|
|
//
|
|
|
|
// Since few fields have defaults, we will just optimize the empty string
|
|
|
|
// case for now.
|
|
|
|
return create_frozen_string(str, size, binary);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2014-11-18 22:19:58 +00:00
|
|
|
// -----------------------------------------------------------------------------
|
|
|
|
// Utilities.
|
|
|
|
// -----------------------------------------------------------------------------
|
|
|
|
|
|
|
|
// Raises a Ruby error if |status| is not OK, using its error message.
|
|
|
|
void check_upb_status(const upb_status* status, const char* msg) {
|
|
|
|
if (!upb_ok(status)) {
|
|
|
|
rb_raise(rb_eRuntimeError, "%s: %s\n", msg, upb_status_errmsg(status));
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
// String encodings: we look these up once, at load time, and then cache them
|
|
|
|
// here.
|
|
|
|
rb_encoding* kRubyStringUtf8Encoding;
|
|
|
|
rb_encoding* kRubyStringASCIIEncoding;
|
|
|
|
rb_encoding* kRubyString8bitEncoding;
|
|
|
|
|
2015-05-19 22:33:48 +00:00
|
|
|
// Ruby-interned string: "descriptor". We use this identifier to store an
|
|
|
|
// instance variable on message classes we create in order to link them back to
|
|
|
|
// their descriptors.
|
|
|
|
//
|
|
|
|
// We intern this once at module load time then use the interned identifier at
|
|
|
|
// runtime in order to avoid the cost of repeatedly interning in hot paths.
|
|
|
|
const char* kDescriptorInstanceVar = "descriptor";
|
|
|
|
ID descriptor_instancevar_interned;
|
|
|
|
|
2014-11-18 22:19:58 +00:00
|
|
|
// -----------------------------------------------------------------------------
|
|
|
|
// Initialization/entry point.
|
|
|
|
// -----------------------------------------------------------------------------
|
|
|
|
|
|
|
|
// This must be named "Init_protobuf_c" because the Ruby module is named
|
|
|
|
// "protobuf_c" -- the VM looks for this symbol in our .so.
|
|
|
|
void Init_protobuf_c() {
|
|
|
|
VALUE google = rb_define_module("Google");
|
|
|
|
VALUE protobuf = rb_define_module_under(google, "Protobuf");
|
|
|
|
VALUE internal = rb_define_module_under(protobuf, "Internal");
|
2015-07-10 18:56:06 +00:00
|
|
|
|
|
|
|
descriptor_instancevar_interned = rb_intern(kDescriptorInstanceVar);
|
2014-11-18 22:19:58 +00:00
|
|
|
DescriptorPool_register(protobuf);
|
|
|
|
Descriptor_register(protobuf);
|
2017-08-25 19:11:15 +00:00
|
|
|
FileDescriptor_register(protobuf);
|
2014-11-18 22:19:58 +00:00
|
|
|
FieldDescriptor_register(protobuf);
|
2015-01-14 02:14:39 +00:00
|
|
|
OneofDescriptor_register(protobuf);
|
2014-11-18 22:19:58 +00:00
|
|
|
EnumDescriptor_register(protobuf);
|
|
|
|
MessageBuilderContext_register(internal);
|
2015-01-14 02:14:39 +00:00
|
|
|
OneofBuilderContext_register(internal);
|
2014-11-18 22:19:58 +00:00
|
|
|
EnumBuilderContext_register(internal);
|
2017-08-25 19:11:15 +00:00
|
|
|
FileBuilderContext_register(internal);
|
2014-11-18 22:19:58 +00:00
|
|
|
Builder_register(internal);
|
|
|
|
RepeatedField_register(protobuf);
|
2015-01-06 23:44:09 +00:00
|
|
|
Map_register(protobuf);
|
2014-11-18 22:19:58 +00:00
|
|
|
|
2015-07-15 18:05:10 +00:00
|
|
|
cError = rb_const_get(protobuf, rb_intern("Error"));
|
|
|
|
cParseError = rb_const_get(protobuf, rb_intern("ParseError"));
|
2018-06-27 03:24:24 +00:00
|
|
|
cTypeError = rb_const_get(protobuf, rb_intern("TypeError"));
|
2015-07-15 18:05:10 +00:00
|
|
|
|
2017-12-07 22:18:38 +00:00
|
|
|
rb_define_singleton_method(protobuf, "discard_unknown",
|
|
|
|
Google_Protobuf_discard_unknown, 1);
|
2014-11-18 22:19:58 +00:00
|
|
|
rb_define_singleton_method(protobuf, "deep_copy",
|
|
|
|
Google_Protobuf_deep_copy, 1);
|
|
|
|
|
|
|
|
kRubyStringUtf8Encoding = rb_utf8_encoding();
|
|
|
|
kRubyStringASCIIEncoding = rb_usascii_encoding();
|
|
|
|
kRubyString8bitEncoding = rb_ascii8bit_encoding();
|
|
|
|
|
2019-03-06 23:44:38 +00:00
|
|
|
rb_gc_register_address(&upb_def_to_ruby_obj_map);
|
|
|
|
upb_def_to_ruby_obj_map = rb_hash_new();
|
2019-08-13 11:54:11 +00:00
|
|
|
|
|
|
|
rb_gc_register_address(&cached_empty_string);
|
|
|
|
rb_gc_register_address(&cached_empty_bytes);
|
|
|
|
cached_empty_string = create_frozen_string("", 0, false);
|
|
|
|
cached_empty_bytes = create_frozen_string("", 0, true);
|
2014-11-18 22:19:58 +00:00
|
|
|
}
|