message.c 19 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622
  1. // Protocol Buffers - Google's data interchange format
  2. // Copyright 2014 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. #include "protobuf.h"
  31. // -----------------------------------------------------------------------------
  32. // Class/module creation from msgdefs and enumdefs, respectively.
  33. // -----------------------------------------------------------------------------
  34. void* Message_data(void* msg) {
  35. return ((uint8_t *)msg) + sizeof(MessageHeader);
  36. }
  37. void Message_mark(void* _self) {
  38. MessageHeader* self = (MessageHeader *)_self;
  39. layout_mark(self->descriptor->layout, Message_data(self));
  40. }
  41. void Message_free(void* self) {
  42. xfree(self);
  43. }
  44. rb_data_type_t Message_type = {
  45. "Message",
  46. { Message_mark, Message_free, NULL },
  47. };
  48. VALUE Message_alloc(VALUE klass) {
  49. VALUE descriptor = rb_ivar_get(klass, descriptor_instancevar_interned);
  50. Descriptor* desc = ruby_to_Descriptor(descriptor);
  51. MessageHeader* msg = (MessageHeader*)ALLOC_N(
  52. uint8_t, sizeof(MessageHeader) + desc->layout->size);
  53. VALUE ret;
  54. memset(Message_data(msg), 0, desc->layout->size);
  55. // We wrap first so that everything in the message object is GC-rooted in case
  56. // a collection happens during object creation in layout_init().
  57. ret = TypedData_Wrap_Struct(klass, &Message_type, msg);
  58. msg->descriptor = desc;
  59. rb_ivar_set(ret, descriptor_instancevar_interned, descriptor);
  60. layout_init(desc->layout, Message_data(msg));
  61. return ret;
  62. }
  63. static VALUE which_oneof_field(MessageHeader* self, const upb_oneofdef* o) {
  64. upb_oneof_iter it;
  65. size_t case_ofs;
  66. uint32_t oneof_case;
  67. const upb_fielddef* first_field;
  68. const upb_fielddef* f;
  69. // If no fields in the oneof, always nil.
  70. if (upb_oneofdef_numfields(o) == 0) {
  71. return Qnil;
  72. }
  73. // Grab the first field in the oneof so we can get its layout info to find the
  74. // oneof_case field.
  75. upb_oneof_begin(&it, o);
  76. assert(!upb_oneof_done(&it));
  77. first_field = upb_oneof_iter_field(&it);
  78. assert(upb_fielddef_containingoneof(first_field) != NULL);
  79. case_ofs =
  80. self->descriptor->layout->
  81. fields[upb_fielddef_index(first_field)].case_offset;
  82. oneof_case = *((uint32_t*)((char*)Message_data(self) + case_ofs));
  83. if (oneof_case == ONEOF_CASE_NONE) {
  84. return Qnil;
  85. }
  86. // oneof_case is a field index, so find that field.
  87. f = upb_oneofdef_itof(o, oneof_case);
  88. assert(f != NULL);
  89. return ID2SYM(rb_intern(upb_fielddef_name(f)));
  90. }
  91. /*
  92. * call-seq:
  93. * Message.method_missing(*args)
  94. *
  95. * Provides accessors and setters for message fields according to their field
  96. * names. For any field whose name does not conflict with a built-in method, an
  97. * accessor is provided with the same name as the field, and a setter is
  98. * provided with the name of the field plus the '=' suffix. Thus, given a
  99. * message instance 'msg' with field 'foo', the following code is valid:
  100. *
  101. * msg.foo = 42
  102. * puts msg.foo
  103. *
  104. * This method also provides read-only accessors for oneofs. If a oneof exists
  105. * with name 'my_oneof', then msg.my_oneof will return a Ruby symbol equal to
  106. * the name of the field in that oneof that is currently set, or nil if none.
  107. */
  108. VALUE Message_method_missing(int argc, VALUE* argv, VALUE _self) {
  109. MessageHeader* self;
  110. VALUE method_name, method_str;
  111. char* name;
  112. size_t name_len;
  113. bool setter;
  114. const upb_oneofdef* o;
  115. const upb_fielddef* f;
  116. TypedData_Get_Struct(_self, MessageHeader, &Message_type, self);
  117. if (argc < 1) {
  118. rb_raise(rb_eArgError, "Expected method name as first argument.");
  119. }
  120. method_name = argv[0];
  121. if (!SYMBOL_P(method_name)) {
  122. rb_raise(rb_eArgError, "Expected symbol as method name.");
  123. }
  124. method_str = rb_id2str(SYM2ID(method_name));
  125. name = RSTRING_PTR(method_str);
  126. name_len = RSTRING_LEN(method_str);
  127. setter = false;
  128. // Setters have names that end in '='.
  129. if (name[name_len - 1] == '=') {
  130. setter = true;
  131. name_len--;
  132. }
  133. // See if this name corresponds to either a oneof or field in this message.
  134. if (!upb_msgdef_lookupname(self->descriptor->msgdef, name, name_len, &f,
  135. &o)) {
  136. return rb_call_super(argc, argv);
  137. }
  138. if (o != NULL) {
  139. // This is a oneof -- return which field inside the oneof is set.
  140. if (setter) {
  141. rb_raise(rb_eRuntimeError, "Oneof accessors are read-only.");
  142. }
  143. return which_oneof_field(self, o);
  144. } else {
  145. // This is a field -- get or set the field's value.
  146. assert(f);
  147. if (setter) {
  148. if (argc < 2) {
  149. rb_raise(rb_eArgError, "No value provided to setter.");
  150. }
  151. layout_set(self->descriptor->layout, Message_data(self), f, argv[1]);
  152. return Qnil;
  153. } else {
  154. return layout_get(self->descriptor->layout, Message_data(self), f);
  155. }
  156. }
  157. }
  158. VALUE Message_respond_to_missing(int argc, VALUE* argv, VALUE _self) {
  159. MessageHeader* self;
  160. VALUE method_name, method_str;
  161. char* name;
  162. size_t name_len;
  163. bool setter;
  164. const upb_oneofdef* o;
  165. const upb_fielddef* f;
  166. TypedData_Get_Struct(_self, MessageHeader, &Message_type, self);
  167. if (argc < 1) {
  168. rb_raise(rb_eArgError, "Expected method name as first argument.");
  169. }
  170. method_name = argv[0];
  171. if (!SYMBOL_P(method_name)) {
  172. rb_raise(rb_eArgError, "Expected symbol as method name.");
  173. }
  174. method_str = rb_id2str(SYM2ID(method_name));
  175. name = RSTRING_PTR(method_str);
  176. name_len = RSTRING_LEN(method_str);
  177. setter = false;
  178. // Setters have names that end in '='.
  179. if (name[name_len - 1] == '=') {
  180. setter = true;
  181. name_len--;
  182. }
  183. // See if this name corresponds to either a oneof or field in this message.
  184. if (!upb_msgdef_lookupname(self->descriptor->msgdef, name, name_len, &f,
  185. &o)) {
  186. return rb_call_super(argc, argv);
  187. }
  188. if (o != NULL) {
  189. return setter ? Qfalse : Qtrue;
  190. }
  191. return Qtrue;
  192. }
  193. int Message_initialize_kwarg(VALUE key, VALUE val, VALUE _self) {
  194. MessageHeader* self;
  195. VALUE method_str;
  196. char* name;
  197. const upb_fielddef* f;
  198. TypedData_Get_Struct(_self, MessageHeader, &Message_type, self);
  199. if (!SYMBOL_P(key)) {
  200. rb_raise(rb_eArgError,
  201. "Expected symbols as hash keys in initialization map.");
  202. }
  203. method_str = rb_id2str(SYM2ID(key));
  204. name = RSTRING_PTR(method_str);
  205. f = upb_msgdef_ntofz(self->descriptor->msgdef, name);
  206. if (f == NULL) {
  207. rb_raise(rb_eArgError,
  208. "Unknown field name '%s' in initialization map entry.", name);
  209. }
  210. if (is_map_field(f)) {
  211. VALUE map;
  212. if (TYPE(val) != T_HASH) {
  213. rb_raise(rb_eArgError,
  214. "Expected Hash object as initializer value for map field '%s'.", name);
  215. }
  216. map = layout_get(self->descriptor->layout, Message_data(self), f);
  217. Map_merge_into_self(map, val);
  218. } else if (upb_fielddef_label(f) == UPB_LABEL_REPEATED) {
  219. VALUE ary;
  220. if (TYPE(val) != T_ARRAY) {
  221. rb_raise(rb_eArgError,
  222. "Expected array as initializer value for repeated field '%s'.", name);
  223. }
  224. ary = layout_get(self->descriptor->layout, Message_data(self), f);
  225. for (int i = 0; i < RARRAY_LEN(val); i++) {
  226. RepeatedField_push(ary, rb_ary_entry(val, i));
  227. }
  228. } else {
  229. layout_set(self->descriptor->layout, Message_data(self), f, val);
  230. }
  231. return 0;
  232. }
  233. /*
  234. * call-seq:
  235. * Message.new(kwargs) => new_message
  236. *
  237. * Creates a new instance of the given message class. Keyword arguments may be
  238. * provided with keywords corresponding to field names.
  239. *
  240. * Note that no literal Message class exists. Only concrete classes per message
  241. * type exist, as provided by the #msgclass method on Descriptors after they
  242. * have been added to a pool. The method definitions described here on the
  243. * Message class are provided on each concrete message class.
  244. */
  245. VALUE Message_initialize(int argc, VALUE* argv, VALUE _self) {
  246. VALUE hash_args;
  247. if (argc == 0) {
  248. return Qnil;
  249. }
  250. if (argc != 1) {
  251. rb_raise(rb_eArgError, "Expected 0 or 1 arguments.");
  252. }
  253. hash_args = argv[0];
  254. if (TYPE(hash_args) != T_HASH) {
  255. rb_raise(rb_eArgError, "Expected hash arguments.");
  256. }
  257. rb_hash_foreach(hash_args, Message_initialize_kwarg, _self);
  258. return Qnil;
  259. }
  260. /*
  261. * call-seq:
  262. * Message.dup => new_message
  263. *
  264. * Performs a shallow copy of this message and returns the new copy.
  265. */
  266. VALUE Message_dup(VALUE _self) {
  267. MessageHeader* self;
  268. VALUE new_msg;
  269. MessageHeader* new_msg_self;
  270. TypedData_Get_Struct(_self, MessageHeader, &Message_type, self);
  271. new_msg = rb_class_new_instance(0, NULL, CLASS_OF(_self));
  272. TypedData_Get_Struct(new_msg, MessageHeader, &Message_type, new_msg_self);
  273. layout_dup(self->descriptor->layout,
  274. Message_data(new_msg_self),
  275. Message_data(self));
  276. return new_msg;
  277. }
  278. // Internal only; used by Google::Protobuf.deep_copy.
  279. VALUE Message_deep_copy(VALUE _self) {
  280. MessageHeader* self;
  281. MessageHeader* new_msg_self;
  282. VALUE new_msg;
  283. TypedData_Get_Struct(_self, MessageHeader, &Message_type, self);
  284. new_msg = rb_class_new_instance(0, NULL, CLASS_OF(_self));
  285. TypedData_Get_Struct(new_msg, MessageHeader, &Message_type, new_msg_self);
  286. layout_deep_copy(self->descriptor->layout,
  287. Message_data(new_msg_self),
  288. Message_data(self));
  289. return new_msg;
  290. }
  291. /*
  292. * call-seq:
  293. * Message.==(other) => boolean
  294. *
  295. * Performs a deep comparison of this message with another. Messages are equal
  296. * if they have the same type and if each field is equal according to the :==
  297. * method's semantics (a more efficient comparison may actually be done if the
  298. * field is of a primitive type).
  299. */
  300. VALUE Message_eq(VALUE _self, VALUE _other) {
  301. MessageHeader* self;
  302. MessageHeader* other;
  303. if (TYPE(_self) != TYPE(_other)) {
  304. return Qfalse;
  305. }
  306. TypedData_Get_Struct(_self, MessageHeader, &Message_type, self);
  307. TypedData_Get_Struct(_other, MessageHeader, &Message_type, other);
  308. if (self->descriptor != other->descriptor) {
  309. return Qfalse;
  310. }
  311. return layout_eq(self->descriptor->layout,
  312. Message_data(self),
  313. Message_data(other));
  314. }
  315. /*
  316. * call-seq:
  317. * Message.hash => hash_value
  318. *
  319. * Returns a hash value that represents this message's field values.
  320. */
  321. VALUE Message_hash(VALUE _self) {
  322. MessageHeader* self;
  323. TypedData_Get_Struct(_self, MessageHeader, &Message_type, self);
  324. return layout_hash(self->descriptor->layout, Message_data(self));
  325. }
  326. /*
  327. * call-seq:
  328. * Message.inspect => string
  329. *
  330. * Returns a human-readable string representing this message. It will be
  331. * formatted as "<MessageType: field1: value1, field2: value2, ...>". Each
  332. * field's value is represented according to its own #inspect method.
  333. */
  334. VALUE Message_inspect(VALUE _self) {
  335. MessageHeader* self;
  336. VALUE str;
  337. TypedData_Get_Struct(_self, MessageHeader, &Message_type, self);
  338. str = rb_str_new2("<");
  339. str = rb_str_append(str, rb_str_new2(rb_class2name(CLASS_OF(_self))));
  340. str = rb_str_cat2(str, ": ");
  341. str = rb_str_append(str, layout_inspect(
  342. self->descriptor->layout, Message_data(self)));
  343. str = rb_str_cat2(str, ">");
  344. return str;
  345. }
  346. VALUE Message_to_h(VALUE _self) {
  347. MessageHeader* self;
  348. VALUE hash;
  349. upb_msg_field_iter it;
  350. TypedData_Get_Struct(_self, MessageHeader, &Message_type, self);
  351. hash = rb_hash_new();
  352. for (upb_msg_field_begin(&it, self->descriptor->msgdef);
  353. !upb_msg_field_done(&it);
  354. upb_msg_field_next(&it)) {
  355. const upb_fielddef* field = upb_msg_iter_field(&it);
  356. VALUE msg_value = layout_get(self->descriptor->layout, Message_data(self),
  357. field);
  358. VALUE msg_key = ID2SYM(rb_intern(upb_fielddef_name(field)));
  359. if (upb_fielddef_label(field) == UPB_LABEL_REPEATED) {
  360. msg_value = RepeatedField_to_ary(msg_value);
  361. }
  362. rb_hash_aset(hash, msg_key, msg_value);
  363. }
  364. return hash;
  365. }
  366. /*
  367. * call-seq:
  368. * Message.[](index) => value
  369. *
  370. * Accesses a field's value by field name. The provided field name should be a
  371. * string.
  372. */
  373. VALUE Message_index(VALUE _self, VALUE field_name) {
  374. MessageHeader* self;
  375. const upb_fielddef* field;
  376. TypedData_Get_Struct(_self, MessageHeader, &Message_type, self);
  377. Check_Type(field_name, T_STRING);
  378. field = upb_msgdef_ntofz(self->descriptor->msgdef, RSTRING_PTR(field_name));
  379. if (field == NULL) {
  380. return Qnil;
  381. }
  382. return layout_get(self->descriptor->layout, Message_data(self), field);
  383. }
  384. /*
  385. * call-seq:
  386. * Message.[]=(index, value)
  387. *
  388. * Sets a field's value by field name. The provided field name should be a
  389. * string.
  390. */
  391. VALUE Message_index_set(VALUE _self, VALUE field_name, VALUE value) {
  392. MessageHeader* self;
  393. const upb_fielddef* field;
  394. TypedData_Get_Struct(_self, MessageHeader, &Message_type, self);
  395. Check_Type(field_name, T_STRING);
  396. field = upb_msgdef_ntofz(self->descriptor->msgdef, RSTRING_PTR(field_name));
  397. if (field == NULL) {
  398. rb_raise(rb_eArgError, "Unknown field: %s", RSTRING_PTR(field_name));
  399. }
  400. layout_set(self->descriptor->layout, Message_data(self), field, value);
  401. return Qnil;
  402. }
  403. /*
  404. * call-seq:
  405. * Message.descriptor => descriptor
  406. *
  407. * Class method that returns the Descriptor instance corresponding to this
  408. * message class's type.
  409. */
  410. VALUE Message_descriptor(VALUE klass) {
  411. return rb_ivar_get(klass, descriptor_instancevar_interned);
  412. }
  413. VALUE build_class_from_descriptor(Descriptor* desc) {
  414. const char *name;
  415. VALUE klass;
  416. if (desc->layout == NULL) {
  417. desc->layout = create_layout(desc->msgdef);
  418. }
  419. if (desc->fill_method == NULL) {
  420. desc->fill_method = new_fillmsg_decodermethod(desc, &desc->fill_method);
  421. }
  422. name = upb_msgdef_fullname(desc->msgdef);
  423. if (name == NULL) {
  424. rb_raise(rb_eRuntimeError, "Descriptor does not have assigned name.");
  425. }
  426. klass = rb_define_class_id(
  427. // Docs say this parameter is ignored. User will assign return value to
  428. // their own toplevel constant class name.
  429. rb_intern("Message"),
  430. rb_cObject);
  431. rb_ivar_set(klass, descriptor_instancevar_interned,
  432. get_def_obj(desc->msgdef));
  433. rb_define_alloc_func(klass, Message_alloc);
  434. rb_require("google/protobuf/message_exts");
  435. rb_include_module(klass, rb_eval_string("Google::Protobuf::MessageExts"));
  436. rb_extend_object(
  437. klass, rb_eval_string("Google::Protobuf::MessageExts::ClassMethods"));
  438. rb_define_method(klass, "method_missing",
  439. Message_method_missing, -1);
  440. rb_define_method(klass, "respond_to_missing?",
  441. Message_respond_to_missing, -1);
  442. rb_define_method(klass, "initialize", Message_initialize, -1);
  443. rb_define_method(klass, "dup", Message_dup, 0);
  444. // Also define #clone so that we don't inherit Object#clone.
  445. rb_define_method(klass, "clone", Message_dup, 0);
  446. rb_define_method(klass, "==", Message_eq, 1);
  447. rb_define_method(klass, "hash", Message_hash, 0);
  448. rb_define_method(klass, "to_h", Message_to_h, 0);
  449. rb_define_method(klass, "to_hash", Message_to_h, 0);
  450. rb_define_method(klass, "inspect", Message_inspect, 0);
  451. rb_define_method(klass, "[]", Message_index, 1);
  452. rb_define_method(klass, "[]=", Message_index_set, 2);
  453. rb_define_singleton_method(klass, "decode", Message_decode, 1);
  454. rb_define_singleton_method(klass, "encode", Message_encode, 1);
  455. rb_define_singleton_method(klass, "decode_json", Message_decode_json, 1);
  456. rb_define_singleton_method(klass, "encode_json", Message_encode_json, -1);
  457. rb_define_singleton_method(klass, "descriptor", Message_descriptor, 0);
  458. return klass;
  459. }
  460. /*
  461. * call-seq:
  462. * Enum.lookup(number) => name
  463. *
  464. * This module method, provided on each generated enum module, looks up an enum
  465. * value by number and returns its name as a Ruby symbol, or nil if not found.
  466. */
  467. VALUE enum_lookup(VALUE self, VALUE number) {
  468. int32_t num = NUM2INT(number);
  469. VALUE desc = rb_ivar_get(self, descriptor_instancevar_interned);
  470. EnumDescriptor* enumdesc = ruby_to_EnumDescriptor(desc);
  471. const char* name = upb_enumdef_iton(enumdesc->enumdef, num);
  472. if (name == NULL) {
  473. return Qnil;
  474. } else {
  475. return ID2SYM(rb_intern(name));
  476. }
  477. }
  478. /*
  479. * call-seq:
  480. * Enum.resolve(name) => number
  481. *
  482. * This module method, provided on each generated enum module, looks up an enum
  483. * value by name (as a Ruby symbol) and returns its name, or nil if not found.
  484. */
  485. VALUE enum_resolve(VALUE self, VALUE sym) {
  486. const char* name = rb_id2name(SYM2ID(sym));
  487. VALUE desc = rb_ivar_get(self, descriptor_instancevar_interned);
  488. EnumDescriptor* enumdesc = ruby_to_EnumDescriptor(desc);
  489. int32_t num = 0;
  490. bool found = upb_enumdef_ntoiz(enumdesc->enumdef, name, &num);
  491. if (!found) {
  492. return Qnil;
  493. } else {
  494. return INT2NUM(num);
  495. }
  496. }
  497. /*
  498. * call-seq:
  499. * Enum.descriptor
  500. *
  501. * This module method, provided on each generated enum module, returns the
  502. * EnumDescriptor corresponding to this enum type.
  503. */
  504. VALUE enum_descriptor(VALUE self) {
  505. return rb_ivar_get(self, descriptor_instancevar_interned);
  506. }
  507. VALUE build_module_from_enumdesc(EnumDescriptor* enumdesc) {
  508. VALUE mod = rb_define_module_id(
  509. rb_intern(upb_enumdef_fullname(enumdesc->enumdef)));
  510. upb_enum_iter it;
  511. for (upb_enum_begin(&it, enumdesc->enumdef);
  512. !upb_enum_done(&it);
  513. upb_enum_next(&it)) {
  514. const char* name = upb_enum_iter_name(&it);
  515. int32_t value = upb_enum_iter_number(&it);
  516. if (name[0] < 'A' || name[0] > 'Z') {
  517. rb_raise(rb_eTypeError,
  518. "Enum value '%s' does not start with an uppercase letter "
  519. "as is required for Ruby constants.",
  520. name);
  521. }
  522. rb_define_const(mod, name, INT2NUM(value));
  523. }
  524. rb_define_singleton_method(mod, "lookup", enum_lookup, 1);
  525. rb_define_singleton_method(mod, "resolve", enum_resolve, 1);
  526. rb_define_singleton_method(mod, "descriptor", enum_descriptor, 0);
  527. rb_ivar_set(mod, descriptor_instancevar_interned,
  528. get_def_obj(enumdesc->enumdef));
  529. return mod;
  530. }
  531. /*
  532. * call-seq:
  533. * Google::Protobuf.deep_copy(obj) => copy_of_obj
  534. *
  535. * Performs a deep copy of a RepeatedField instance, a Map instance, or a
  536. * message object, recursively copying its members.
  537. */
  538. VALUE Google_Protobuf_deep_copy(VALUE self, VALUE obj) {
  539. VALUE klass = CLASS_OF(obj);
  540. if (klass == cRepeatedField) {
  541. return RepeatedField_deep_copy(obj);
  542. } else if (klass == cMap) {
  543. return Map_deep_copy(obj);
  544. } else {
  545. return Message_deep_copy(obj);
  546. }
  547. }