message.c 21 KB

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