message.c 20 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654
  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. VALUE create_submsg_from_hash(const upb_fielddef *f, VALUE hash) {
  194. const upb_def *d = upb_fielddef_subdef(f);
  195. assert(d != NULL);
  196. VALUE descriptor = get_def_obj(d);
  197. VALUE msgclass = rb_funcall(descriptor, rb_intern("msgclass"), 0, NULL);
  198. VALUE args[1] = { hash };
  199. return rb_class_new_instance(1, args, msgclass);
  200. }
  201. int Message_initialize_kwarg(VALUE key, VALUE val, VALUE _self) {
  202. MessageHeader* self;
  203. char *name;
  204. const upb_fielddef* f;
  205. TypedData_Get_Struct(_self, MessageHeader, &Message_type, self);
  206. if (TYPE(key) == T_STRING) {
  207. name = RSTRING_PTR(key);
  208. } else if (TYPE(key) == T_SYMBOL) {
  209. name = RSTRING_PTR(rb_id2str(SYM2ID(key)));
  210. } else {
  211. rb_raise(rb_eArgError,
  212. "Expected string or symbols as hash keys when initializing proto from hash.");
  213. }
  214. f = upb_msgdef_ntofz(self->descriptor->msgdef, name);
  215. if (f == NULL) {
  216. rb_raise(rb_eArgError,
  217. "Unknown field name '%s' in initialization map entry.", name);
  218. }
  219. if (is_map_field(f)) {
  220. VALUE map;
  221. if (TYPE(val) != T_HASH) {
  222. rb_raise(rb_eArgError,
  223. "Expected Hash object as initializer value for map field '%s'.", name);
  224. }
  225. map = layout_get(self->descriptor->layout, Message_data(self), f);
  226. Map_merge_into_self(map, val);
  227. } else if (upb_fielddef_label(f) == UPB_LABEL_REPEATED) {
  228. VALUE ary;
  229. VALUE entry;
  230. if (TYPE(val) != T_ARRAY) {
  231. rb_raise(rb_eArgError,
  232. "Expected array as initializer value for repeated field '%s'.", name);
  233. }
  234. ary = layout_get(self->descriptor->layout, Message_data(self), f);
  235. for (int i = 0; i < RARRAY_LEN(val); i++) {
  236. entry = rb_ary_entry(val, i);
  237. if (TYPE(entry) == T_HASH && upb_fielddef_issubmsg(f)) {
  238. entry = create_submsg_from_hash(f, entry);
  239. }
  240. RepeatedField_push(ary, entry);
  241. }
  242. } else {
  243. if (TYPE(val) == T_HASH && upb_fielddef_issubmsg(f)) {
  244. val = create_submsg_from_hash(f, val);
  245. }
  246. layout_set(self->descriptor->layout, Message_data(self), f, val);
  247. }
  248. return 0;
  249. }
  250. /*
  251. * call-seq:
  252. * Message.new(kwargs) => new_message
  253. *
  254. * Creates a new instance of the given message class. Keyword arguments may be
  255. * provided with keywords corresponding to field names.
  256. *
  257. * Note that no literal Message class exists. Only concrete classes per message
  258. * type exist, as provided by the #msgclass method on Descriptors after they
  259. * have been added to a pool. The method definitions described here on the
  260. * Message class are provided on each concrete message class.
  261. */
  262. VALUE Message_initialize(int argc, VALUE* argv, VALUE _self) {
  263. VALUE hash_args;
  264. if (argc == 0) {
  265. return Qnil;
  266. }
  267. if (argc != 1) {
  268. rb_raise(rb_eArgError, "Expected 0 or 1 arguments.");
  269. }
  270. hash_args = argv[0];
  271. if (TYPE(hash_args) != T_HASH) {
  272. rb_raise(rb_eArgError, "Expected hash arguments.");
  273. }
  274. rb_hash_foreach(hash_args, Message_initialize_kwarg, _self);
  275. return Qnil;
  276. }
  277. /*
  278. * call-seq:
  279. * Message.dup => new_message
  280. *
  281. * Performs a shallow copy of this message and returns the new copy.
  282. */
  283. VALUE Message_dup(VALUE _self) {
  284. MessageHeader* self;
  285. VALUE new_msg;
  286. MessageHeader* new_msg_self;
  287. TypedData_Get_Struct(_self, MessageHeader, &Message_type, self);
  288. new_msg = rb_class_new_instance(0, NULL, CLASS_OF(_self));
  289. TypedData_Get_Struct(new_msg, MessageHeader, &Message_type, new_msg_self);
  290. layout_dup(self->descriptor->layout,
  291. Message_data(new_msg_self),
  292. Message_data(self));
  293. return new_msg;
  294. }
  295. // Internal only; used by Google::Protobuf.deep_copy.
  296. VALUE Message_deep_copy(VALUE _self) {
  297. MessageHeader* self;
  298. MessageHeader* new_msg_self;
  299. VALUE new_msg;
  300. TypedData_Get_Struct(_self, MessageHeader, &Message_type, self);
  301. new_msg = rb_class_new_instance(0, NULL, CLASS_OF(_self));
  302. TypedData_Get_Struct(new_msg, MessageHeader, &Message_type, new_msg_self);
  303. layout_deep_copy(self->descriptor->layout,
  304. Message_data(new_msg_self),
  305. Message_data(self));
  306. return new_msg;
  307. }
  308. /*
  309. * call-seq:
  310. * Message.==(other) => boolean
  311. *
  312. * Performs a deep comparison of this message with another. Messages are equal
  313. * if they have the same type and if each field is equal according to the :==
  314. * method's semantics (a more efficient comparison may actually be done if the
  315. * field is of a primitive type).
  316. */
  317. VALUE Message_eq(VALUE _self, VALUE _other) {
  318. MessageHeader* self;
  319. MessageHeader* other;
  320. if (TYPE(_self) != TYPE(_other)) {
  321. return Qfalse;
  322. }
  323. TypedData_Get_Struct(_self, MessageHeader, &Message_type, self);
  324. TypedData_Get_Struct(_other, MessageHeader, &Message_type, other);
  325. if (self->descriptor != other->descriptor) {
  326. return Qfalse;
  327. }
  328. return layout_eq(self->descriptor->layout,
  329. Message_data(self),
  330. Message_data(other));
  331. }
  332. /*
  333. * call-seq:
  334. * Message.hash => hash_value
  335. *
  336. * Returns a hash value that represents this message's field values.
  337. */
  338. VALUE Message_hash(VALUE _self) {
  339. MessageHeader* self;
  340. TypedData_Get_Struct(_self, MessageHeader, &Message_type, self);
  341. return layout_hash(self->descriptor->layout, Message_data(self));
  342. }
  343. /*
  344. * call-seq:
  345. * Message.inspect => string
  346. *
  347. * Returns a human-readable string representing this message. It will be
  348. * formatted as "<MessageType: field1: value1, field2: value2, ...>". Each
  349. * field's value is represented according to its own #inspect method.
  350. */
  351. VALUE Message_inspect(VALUE _self) {
  352. MessageHeader* self;
  353. VALUE str;
  354. TypedData_Get_Struct(_self, MessageHeader, &Message_type, self);
  355. str = rb_str_new2("<");
  356. str = rb_str_append(str, rb_str_new2(rb_class2name(CLASS_OF(_self))));
  357. str = rb_str_cat2(str, ": ");
  358. str = rb_str_append(str, layout_inspect(
  359. self->descriptor->layout, Message_data(self)));
  360. str = rb_str_cat2(str, ">");
  361. return str;
  362. }
  363. /*
  364. * call-seq:
  365. * Message.to_h => {}
  366. *
  367. * Returns the message as a Ruby Hash object, with keys as symbols.
  368. */
  369. VALUE Message_to_h(VALUE _self) {
  370. MessageHeader* self;
  371. VALUE hash;
  372. upb_msg_field_iter it;
  373. TypedData_Get_Struct(_self, MessageHeader, &Message_type, self);
  374. hash = rb_hash_new();
  375. for (upb_msg_field_begin(&it, self->descriptor->msgdef);
  376. !upb_msg_field_done(&it);
  377. upb_msg_field_next(&it)) {
  378. const upb_fielddef* field = upb_msg_iter_field(&it);
  379. VALUE msg_value = layout_get(self->descriptor->layout, Message_data(self),
  380. field);
  381. VALUE msg_key = ID2SYM(rb_intern(upb_fielddef_name(field)));
  382. if (upb_fielddef_ismap(field)) {
  383. msg_value = Map_to_h(msg_value);
  384. } else if (upb_fielddef_label(field) == UPB_LABEL_REPEATED) {
  385. msg_value = RepeatedField_to_ary(msg_value);
  386. } else if (msg_value != Qnil &&
  387. upb_fielddef_type(field) == UPB_TYPE_MESSAGE) {
  388. msg_value = Message_to_h(msg_value);
  389. }
  390. rb_hash_aset(hash, msg_key, msg_value);
  391. }
  392. return hash;
  393. }
  394. /*
  395. * call-seq:
  396. * Message.[](index) => value
  397. *
  398. * Accesses a field's value by field name. The provided field name should be a
  399. * string.
  400. */
  401. VALUE Message_index(VALUE _self, VALUE field_name) {
  402. MessageHeader* self;
  403. const upb_fielddef* field;
  404. TypedData_Get_Struct(_self, MessageHeader, &Message_type, self);
  405. Check_Type(field_name, T_STRING);
  406. field = upb_msgdef_ntofz(self->descriptor->msgdef, RSTRING_PTR(field_name));
  407. if (field == NULL) {
  408. return Qnil;
  409. }
  410. return layout_get(self->descriptor->layout, Message_data(self), field);
  411. }
  412. /*
  413. * call-seq:
  414. * Message.[]=(index, value)
  415. *
  416. * Sets a field's value by field name. The provided field name should be a
  417. * string.
  418. */
  419. VALUE Message_index_set(VALUE _self, VALUE field_name, VALUE value) {
  420. MessageHeader* self;
  421. const upb_fielddef* field;
  422. TypedData_Get_Struct(_self, MessageHeader, &Message_type, self);
  423. Check_Type(field_name, T_STRING);
  424. field = upb_msgdef_ntofz(self->descriptor->msgdef, RSTRING_PTR(field_name));
  425. if (field == NULL) {
  426. rb_raise(rb_eArgError, "Unknown field: %s", RSTRING_PTR(field_name));
  427. }
  428. layout_set(self->descriptor->layout, Message_data(self), field, value);
  429. return Qnil;
  430. }
  431. /*
  432. * call-seq:
  433. * Message.descriptor => descriptor
  434. *
  435. * Class method that returns the Descriptor instance corresponding to this
  436. * message class's type.
  437. */
  438. VALUE Message_descriptor(VALUE klass) {
  439. return rb_ivar_get(klass, descriptor_instancevar_interned);
  440. }
  441. VALUE build_class_from_descriptor(Descriptor* desc) {
  442. const char *name;
  443. VALUE klass;
  444. if (desc->layout == NULL) {
  445. desc->layout = create_layout(desc->msgdef);
  446. }
  447. if (desc->fill_method == NULL) {
  448. desc->fill_method = new_fillmsg_decodermethod(desc, &desc->fill_method);
  449. }
  450. name = upb_msgdef_fullname(desc->msgdef);
  451. if (name == NULL) {
  452. rb_raise(rb_eRuntimeError, "Descriptor does not have assigned name.");
  453. }
  454. klass = rb_define_class_id(
  455. // Docs say this parameter is ignored. User will assign return value to
  456. // their own toplevel constant class name.
  457. rb_intern("Message"),
  458. rb_cObject);
  459. rb_ivar_set(klass, descriptor_instancevar_interned,
  460. get_def_obj(desc->msgdef));
  461. rb_define_alloc_func(klass, Message_alloc);
  462. rb_require("google/protobuf/message_exts");
  463. rb_include_module(klass, rb_eval_string("Google::Protobuf::MessageExts"));
  464. rb_extend_object(
  465. klass, rb_eval_string("Google::Protobuf::MessageExts::ClassMethods"));
  466. rb_define_method(klass, "method_missing",
  467. Message_method_missing, -1);
  468. rb_define_method(klass, "respond_to_missing?",
  469. Message_respond_to_missing, -1);
  470. rb_define_method(klass, "initialize", Message_initialize, -1);
  471. rb_define_method(klass, "dup", Message_dup, 0);
  472. // Also define #clone so that we don't inherit Object#clone.
  473. rb_define_method(klass, "clone", Message_dup, 0);
  474. rb_define_method(klass, "==", Message_eq, 1);
  475. rb_define_method(klass, "hash", Message_hash, 0);
  476. rb_define_method(klass, "to_h", Message_to_h, 0);
  477. rb_define_method(klass, "to_hash", Message_to_h, 0);
  478. rb_define_method(klass, "inspect", Message_inspect, 0);
  479. rb_define_method(klass, "[]", Message_index, 1);
  480. rb_define_method(klass, "[]=", Message_index_set, 2);
  481. rb_define_singleton_method(klass, "decode", Message_decode, 1);
  482. rb_define_singleton_method(klass, "encode", Message_encode, 1);
  483. rb_define_singleton_method(klass, "decode_json", Message_decode_json, 1);
  484. rb_define_singleton_method(klass, "encode_json", Message_encode_json, -1);
  485. rb_define_singleton_method(klass, "descriptor", Message_descriptor, 0);
  486. return klass;
  487. }
  488. /*
  489. * call-seq:
  490. * Enum.lookup(number) => name
  491. *
  492. * This module method, provided on each generated enum module, looks up an enum
  493. * value by number and returns its name as a Ruby symbol, or nil if not found.
  494. */
  495. VALUE enum_lookup(VALUE self, VALUE number) {
  496. int32_t num = NUM2INT(number);
  497. VALUE desc = rb_ivar_get(self, descriptor_instancevar_interned);
  498. EnumDescriptor* enumdesc = ruby_to_EnumDescriptor(desc);
  499. const char* name = upb_enumdef_iton(enumdesc->enumdef, num);
  500. if (name == NULL) {
  501. return Qnil;
  502. } else {
  503. return ID2SYM(rb_intern(name));
  504. }
  505. }
  506. /*
  507. * call-seq:
  508. * Enum.resolve(name) => number
  509. *
  510. * This module method, provided on each generated enum module, looks up an enum
  511. * value by name (as a Ruby symbol) and returns its name, or nil if not found.
  512. */
  513. VALUE enum_resolve(VALUE self, VALUE sym) {
  514. const char* name = rb_id2name(SYM2ID(sym));
  515. VALUE desc = rb_ivar_get(self, descriptor_instancevar_interned);
  516. EnumDescriptor* enumdesc = ruby_to_EnumDescriptor(desc);
  517. int32_t num = 0;
  518. bool found = upb_enumdef_ntoiz(enumdesc->enumdef, name, &num);
  519. if (!found) {
  520. return Qnil;
  521. } else {
  522. return INT2NUM(num);
  523. }
  524. }
  525. /*
  526. * call-seq:
  527. * Enum.descriptor
  528. *
  529. * This module method, provided on each generated enum module, returns the
  530. * EnumDescriptor corresponding to this enum type.
  531. */
  532. VALUE enum_descriptor(VALUE self) {
  533. return rb_ivar_get(self, descriptor_instancevar_interned);
  534. }
  535. VALUE build_module_from_enumdesc(EnumDescriptor* enumdesc) {
  536. VALUE mod = rb_define_module_id(
  537. rb_intern(upb_enumdef_fullname(enumdesc->enumdef)));
  538. upb_enum_iter it;
  539. for (upb_enum_begin(&it, enumdesc->enumdef);
  540. !upb_enum_done(&it);
  541. upb_enum_next(&it)) {
  542. const char* name = upb_enum_iter_name(&it);
  543. int32_t value = upb_enum_iter_number(&it);
  544. if (name[0] < 'A' || name[0] > 'Z') {
  545. rb_raise(rb_eTypeError,
  546. "Enum value '%s' does not start with an uppercase letter "
  547. "as is required for Ruby constants.",
  548. name);
  549. }
  550. rb_define_const(mod, name, INT2NUM(value));
  551. }
  552. rb_define_singleton_method(mod, "lookup", enum_lookup, 1);
  553. rb_define_singleton_method(mod, "resolve", enum_resolve, 1);
  554. rb_define_singleton_method(mod, "descriptor", enum_descriptor, 0);
  555. rb_ivar_set(mod, descriptor_instancevar_interned,
  556. get_def_obj(enumdesc->enumdef));
  557. return mod;
  558. }
  559. /*
  560. * call-seq:
  561. * Google::Protobuf.deep_copy(obj) => copy_of_obj
  562. *
  563. * Performs a deep copy of a RepeatedField instance, a Map instance, or a
  564. * message object, recursively copying its members.
  565. */
  566. VALUE Google_Protobuf_deep_copy(VALUE self, VALUE obj) {
  567. VALUE klass = CLASS_OF(obj);
  568. if (klass == cRepeatedField) {
  569. return RepeatedField_deep_copy(obj);
  570. } else if (klass == cMap) {
  571. return Map_deep_copy(obj);
  572. } else {
  573. return Message_deep_copy(obj);
  574. }
  575. }