message.c 28 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835
  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 const upb_fielddef* 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. oneof_case =
  76. slot_read_oneof_case(self->descriptor->layout, Message_data(self), o);
  77. if (oneof_case == ONEOF_CASE_NONE) {
  78. return NULL;
  79. }
  80. // oneof_case is a field index, so find that field.
  81. f = upb_oneofdef_itof(o, oneof_case);
  82. assert(f != NULL);
  83. return f;
  84. }
  85. enum {
  86. METHOD_UNKNOWN = 0,
  87. METHOD_GETTER = 1,
  88. METHOD_SETTER = 2,
  89. METHOD_CLEAR = 3,
  90. METHOD_PRESENCE = 4,
  91. METHOD_ENUM_GETTER = 5,
  92. METHOD_WRAPPER_GETTER = 6,
  93. METHOD_WRAPPER_SETTER = 7
  94. };
  95. // Check if the field is a well known wrapper type
  96. static bool is_wrapper_type_field(const upb_fielddef* field) {
  97. char* field_type_name = rb_class2name(field_type_class(field));
  98. return strcmp(field_type_name, "Google::Protobuf::DoubleValue") == 0 ||
  99. strcmp(field_type_name, "Google::Protobuf::FloatValue") == 0 ||
  100. strcmp(field_type_name, "Google::Protobuf::Int32Value") == 0 ||
  101. strcmp(field_type_name, "Google::Protobuf::Int64Value") == 0 ||
  102. strcmp(field_type_name, "Google::Protobuf::UInt32Value") == 0 ||
  103. strcmp(field_type_name, "Google::Protobuf::UInt64Value") == 0 ||
  104. strcmp(field_type_name, "Google::Protobuf::BoolValue") == 0 ||
  105. strcmp(field_type_name, "Google::Protobuf::StringValue") == 0 ||
  106. strcmp(field_type_name, "Google::Protobuf::BytesValue") == 0;
  107. }
  108. // Get a new Ruby wrapper type and set the initial value
  109. static VALUE ruby_wrapper_type(const upb_fielddef* field, const VALUE* value) {
  110. if (is_wrapper_type_field(field) && value != Qnil) {
  111. VALUE hash = rb_hash_new();
  112. rb_hash_aset(hash, rb_str_new2("value"), value);
  113. VALUE args[1] = { hash };
  114. return rb_class_new_instance(1, args, field_type_class(field));
  115. }
  116. return Qnil;
  117. }
  118. static int extract_method_call(VALUE method_name, MessageHeader* self,
  119. const upb_fielddef **f, const upb_oneofdef **o) {
  120. Check_Type(method_name, T_SYMBOL);
  121. VALUE method_str = rb_id2str(SYM2ID(method_name));
  122. char* name = RSTRING_PTR(method_str);
  123. size_t name_len = RSTRING_LEN(method_str);
  124. int accessor_type;
  125. const upb_oneofdef* test_o;
  126. const upb_fielddef* test_f;
  127. if (name[name_len - 1] == '=') {
  128. accessor_type = METHOD_SETTER;
  129. name_len--;
  130. // We want to ensure if the proto has something named clear_foo or has_foo?,
  131. // we don't strip the prefix.
  132. } else if (strncmp("clear_", name, 6) == 0 &&
  133. !upb_msgdef_lookupname(self->descriptor->msgdef, name, name_len,
  134. &test_f, &test_o)) {
  135. accessor_type = METHOD_CLEAR;
  136. name = name + 6;
  137. name_len = name_len - 6;
  138. } else if (strncmp("has_", name, 4) == 0 && name[name_len - 1] == '?' &&
  139. !upb_msgdef_lookupname(self->descriptor->msgdef, name, name_len,
  140. &test_f, &test_o)) {
  141. accessor_type = METHOD_PRESENCE;
  142. name = name + 4;
  143. name_len = name_len - 5;
  144. } else {
  145. accessor_type = METHOD_GETTER;
  146. }
  147. bool has_field = upb_msgdef_lookupname(self->descriptor->msgdef, name, name_len,
  148. &test_f, &test_o);
  149. // Look for wrapper type accessor of the form <field_name>_as_value
  150. if (!has_field &&
  151. (accessor_type == METHOD_GETTER || accessor_type == METHOD_SETTER) &&
  152. name_len > 9 && strncmp(name + name_len - 9, "_as_value", 9) == 0) {
  153. // Find the field name
  154. char wrapper_field_name[name_len - 8];
  155. strncpy(wrapper_field_name, name, name_len - 9);
  156. wrapper_field_name[name_len - 9] = '\0';
  157. // Check if field exists and is a wrapper type
  158. const upb_oneofdef* test_o_wrapper;
  159. const upb_fielddef* test_f_wrapper;
  160. if (upb_msgdef_lookupname(self->descriptor->msgdef, wrapper_field_name, name_len - 9,
  161. &test_f_wrapper, &test_o_wrapper) &&
  162. upb_fielddef_type(test_f_wrapper) == UPB_TYPE_MESSAGE &&
  163. is_wrapper_type_field(test_f_wrapper)) {
  164. // It does exist!
  165. has_field = true;
  166. if (accessor_type == METHOD_SETTER) {
  167. accessor_type = METHOD_WRAPPER_SETTER;
  168. } else {
  169. accessor_type = METHOD_WRAPPER_GETTER;
  170. }
  171. test_o = test_o_wrapper;
  172. test_f = test_f_wrapper;
  173. }
  174. }
  175. // Look for enum accessor of the form <enum_name>_const
  176. if (!has_field && accessor_type == METHOD_GETTER &&
  177. name_len > 6 && strncmp(name + name_len - 6, "_const", 6) == 0) {
  178. // Find enum field name
  179. char enum_name[name_len - 5];
  180. strncpy(enum_name, name, name_len - 6);
  181. enum_name[name_len - 6] = '\0';
  182. // Check if enum field exists
  183. const upb_oneofdef* test_o_enum;
  184. const upb_fielddef* test_f_enum;
  185. if (upb_msgdef_lookupname(self->descriptor->msgdef, enum_name, name_len - 6,
  186. &test_f_enum, &test_o_enum) &&
  187. upb_fielddef_type(test_f_enum) == UPB_TYPE_ENUM) {
  188. // It does exist!
  189. has_field = true;
  190. accessor_type = METHOD_ENUM_GETTER;
  191. test_o = test_o_enum;
  192. test_f = test_f_enum;
  193. }
  194. }
  195. // Verify the name corresponds to a oneof or field in this message.
  196. if (!has_field) {
  197. return METHOD_UNKNOWN;
  198. }
  199. // Method calls like 'has_foo?' are not allowed if field "foo" does not have
  200. // a hasbit (e.g. repeated fields or non-message type fields for proto3
  201. // syntax).
  202. if (accessor_type == METHOD_PRESENCE && test_f != NULL &&
  203. !upb_fielddef_haspresence(test_f)) {
  204. return METHOD_UNKNOWN;
  205. }
  206. *o = test_o;
  207. *f = test_f;
  208. return accessor_type;
  209. }
  210. /*
  211. * call-seq:
  212. * Message.method_missing(*args)
  213. *
  214. * Provides accessors and setters and methods to clear and check for presence of
  215. * message fields according to their field names.
  216. *
  217. * For any field whose name does not conflict with a built-in method, an
  218. * accessor is provided with the same name as the field, and a setter is
  219. * provided with the name of the field plus the '=' suffix. Thus, given a
  220. * message instance 'msg' with field 'foo', the following code is valid:
  221. *
  222. * msg.foo = 42
  223. * puts msg.foo
  224. *
  225. * This method also provides read-only accessors for oneofs. If a oneof exists
  226. * with name 'my_oneof', then msg.my_oneof will return a Ruby symbol equal to
  227. * the name of the field in that oneof that is currently set, or nil if none.
  228. *
  229. * It also provides methods of the form 'clear_fieldname' to clear the value
  230. * of the field 'fieldname'. For basic data types, this will set the default
  231. * value of the field.
  232. *
  233. * Additionally, it provides methods of the form 'has_fieldname?', which returns
  234. * true if the field 'fieldname' is set in the message object, else false. For
  235. * 'proto3' syntax, calling this for a basic type field will result in an error.
  236. */
  237. VALUE Message_method_missing(int argc, VALUE* argv, VALUE _self) {
  238. MessageHeader* self;
  239. const upb_oneofdef* o;
  240. const upb_fielddef* f;
  241. TypedData_Get_Struct(_self, MessageHeader, &Message_type, self);
  242. if (argc < 1) {
  243. rb_raise(rb_eArgError, "Expected method name as first argument.");
  244. }
  245. int accessor_type = extract_method_call(argv[0], self, &f, &o);
  246. if (accessor_type == METHOD_UNKNOWN || (o == NULL && f == NULL) ) {
  247. return rb_call_super(argc, argv);
  248. } else if (accessor_type == METHOD_SETTER || accessor_type == METHOD_WRAPPER_SETTER) {
  249. if (argc != 2) {
  250. rb_raise(rb_eArgError, "Expected 2 arguments, received %d", argc);
  251. }
  252. rb_check_frozen(_self);
  253. } else if (argc != 1) {
  254. rb_raise(rb_eArgError, "Expected 1 argument, received %d", argc);
  255. }
  256. // Return which of the oneof fields are set
  257. if (o != NULL) {
  258. if (accessor_type == METHOD_SETTER) {
  259. rb_raise(rb_eRuntimeError, "Oneof accessors are read-only.");
  260. }
  261. const upb_fielddef* oneof_field = which_oneof_field(self, o);
  262. if (accessor_type == METHOD_PRESENCE) {
  263. return oneof_field == NULL ? Qfalse : Qtrue;
  264. } else if (accessor_type == METHOD_CLEAR) {
  265. if (oneof_field != NULL) {
  266. layout_clear(self->descriptor->layout, Message_data(self), oneof_field);
  267. }
  268. return Qnil;
  269. } else {
  270. // METHOD_ACCESSOR
  271. return oneof_field == NULL ? Qnil :
  272. ID2SYM(rb_intern(upb_fielddef_name(oneof_field)));
  273. }
  274. // Otherwise we're operating on a single proto field
  275. } else if (accessor_type == METHOD_SETTER) {
  276. layout_set(self->descriptor->layout, Message_data(self), f, argv[1]);
  277. return Qnil;
  278. } else if (accessor_type == METHOD_CLEAR) {
  279. layout_clear(self->descriptor->layout, Message_data(self), f);
  280. return Qnil;
  281. } else if (accessor_type == METHOD_PRESENCE) {
  282. return layout_has(self->descriptor->layout, Message_data(self), f);
  283. } else if (accessor_type == METHOD_WRAPPER_GETTER) {
  284. VALUE value = layout_get(self->descriptor->layout, Message_data(self), f);
  285. if (value != Qnil) {
  286. value = rb_funcall(value, rb_intern("value"), 0);
  287. }
  288. return value;
  289. } else if (accessor_type == METHOD_WRAPPER_SETTER) {
  290. VALUE wrapper = ruby_wrapper_type(f, argv[1]);
  291. layout_set(self->descriptor->layout, Message_data(self), f, wrapper);
  292. return Qnil;
  293. } else if (accessor_type == METHOD_ENUM_GETTER) {
  294. VALUE enum_type = field_type_class(f);
  295. VALUE method = rb_intern("const_get");
  296. VALUE raw_value = layout_get(self->descriptor->layout, Message_data(self), f);
  297. // Map repeated fields to a new type with ints
  298. if (upb_fielddef_label(f) == UPB_LABEL_REPEATED) {
  299. int array_size = FIX2INT(rb_funcall(raw_value, rb_intern("length"), 0));
  300. VALUE array_args[1] = { ID2SYM(rb_intern("int64")) };
  301. VALUE array = rb_class_new_instance(1, array_args, CLASS_OF(raw_value));
  302. for (int i = 0; i < array_size; i++) {
  303. VALUE entry = rb_funcall(enum_type, method, 1, rb_funcall(raw_value,
  304. rb_intern("at"), 1, INT2NUM(i)));
  305. rb_funcall(array, rb_intern("push"), 1, entry);
  306. }
  307. return array;
  308. }
  309. // Convert the value for singular fields
  310. return rb_funcall(enum_type, method, 1, raw_value);
  311. } else {
  312. return layout_get(self->descriptor->layout, Message_data(self), f);
  313. }
  314. }
  315. VALUE Message_respond_to_missing(int argc, VALUE* argv, VALUE _self) {
  316. MessageHeader* self;
  317. const upb_oneofdef* o;
  318. const upb_fielddef* f;
  319. TypedData_Get_Struct(_self, MessageHeader, &Message_type, self);
  320. if (argc < 1) {
  321. rb_raise(rb_eArgError, "Expected method name as first argument.");
  322. }
  323. int accessor_type = extract_method_call(argv[0], self, &f, &o);
  324. if (accessor_type == METHOD_UNKNOWN) {
  325. return rb_call_super(argc, argv);
  326. } else if (o != NULL) {
  327. return accessor_type == METHOD_SETTER ? Qfalse : Qtrue;
  328. } else {
  329. return Qtrue;
  330. }
  331. }
  332. VALUE create_submsg_from_hash(const upb_fielddef *f, VALUE hash) {
  333. const upb_def *d = upb_fielddef_subdef(f);
  334. assert(d != NULL);
  335. VALUE descriptor = get_def_obj(d);
  336. VALUE msgclass = rb_funcall(descriptor, rb_intern("msgclass"), 0, NULL);
  337. VALUE args[1] = { hash };
  338. return rb_class_new_instance(1, args, msgclass);
  339. }
  340. int Message_initialize_kwarg(VALUE key, VALUE val, VALUE _self) {
  341. MessageHeader* self;
  342. char *name;
  343. const upb_fielddef* f;
  344. TypedData_Get_Struct(_self, MessageHeader, &Message_type, self);
  345. if (TYPE(key) == T_STRING) {
  346. name = RSTRING_PTR(key);
  347. } else if (TYPE(key) == T_SYMBOL) {
  348. name = RSTRING_PTR(rb_id2str(SYM2ID(key)));
  349. } else {
  350. rb_raise(rb_eArgError,
  351. "Expected string or symbols as hash keys when initializing proto from hash.");
  352. }
  353. f = upb_msgdef_ntofz(self->descriptor->msgdef, name);
  354. if (f == NULL) {
  355. rb_raise(rb_eArgError,
  356. "Unknown field name '%s' in initialization map entry.", name);
  357. }
  358. if (TYPE(val) == T_NIL) {
  359. return 0;
  360. }
  361. if (is_map_field(f)) {
  362. VALUE map;
  363. if (TYPE(val) != T_HASH) {
  364. rb_raise(rb_eArgError,
  365. "Expected Hash object as initializer value for map field '%s' (given %s).",
  366. name, rb_class2name(CLASS_OF(val)));
  367. }
  368. map = layout_get(self->descriptor->layout, Message_data(self), f);
  369. Map_merge_into_self(map, val);
  370. } else if (upb_fielddef_label(f) == UPB_LABEL_REPEATED) {
  371. VALUE ary;
  372. if (TYPE(val) != T_ARRAY) {
  373. rb_raise(rb_eArgError,
  374. "Expected array as initializer value for repeated field '%s' (given %s).",
  375. name, rb_class2name(CLASS_OF(val)));
  376. }
  377. ary = layout_get(self->descriptor->layout, Message_data(self), f);
  378. for (int i = 0; i < RARRAY_LEN(val); i++) {
  379. VALUE entry = rb_ary_entry(val, i);
  380. if (TYPE(entry) == T_HASH && upb_fielddef_issubmsg(f)) {
  381. entry = create_submsg_from_hash(f, entry);
  382. }
  383. RepeatedField_push(ary, entry);
  384. }
  385. } else {
  386. if (TYPE(val) == T_HASH && upb_fielddef_issubmsg(f)) {
  387. val = create_submsg_from_hash(f, val);
  388. }
  389. layout_set(self->descriptor->layout, Message_data(self), f, val);
  390. }
  391. return 0;
  392. }
  393. /*
  394. * call-seq:
  395. * Message.new(kwargs) => new_message
  396. *
  397. * Creates a new instance of the given message class. Keyword arguments may be
  398. * provided with keywords corresponding to field names.
  399. *
  400. * Note that no literal Message class exists. Only concrete classes per message
  401. * type exist, as provided by the #msgclass method on Descriptors after they
  402. * have been added to a pool. The method definitions described here on the
  403. * Message class are provided on each concrete message class.
  404. */
  405. VALUE Message_initialize(int argc, VALUE* argv, VALUE _self) {
  406. VALUE hash_args;
  407. if (argc == 0) {
  408. return Qnil;
  409. }
  410. if (argc != 1) {
  411. rb_raise(rb_eArgError, "Expected 0 or 1 arguments.");
  412. }
  413. hash_args = argv[0];
  414. if (TYPE(hash_args) != T_HASH) {
  415. rb_raise(rb_eArgError, "Expected hash arguments.");
  416. }
  417. rb_hash_foreach(hash_args, Message_initialize_kwarg, _self);
  418. return Qnil;
  419. }
  420. /*
  421. * call-seq:
  422. * Message.dup => new_message
  423. *
  424. * Performs a shallow copy of this message and returns the new copy.
  425. */
  426. VALUE Message_dup(VALUE _self) {
  427. MessageHeader* self;
  428. VALUE new_msg;
  429. MessageHeader* new_msg_self;
  430. TypedData_Get_Struct(_self, MessageHeader, &Message_type, self);
  431. new_msg = rb_class_new_instance(0, NULL, CLASS_OF(_self));
  432. TypedData_Get_Struct(new_msg, MessageHeader, &Message_type, new_msg_self);
  433. layout_dup(self->descriptor->layout,
  434. Message_data(new_msg_self),
  435. Message_data(self));
  436. return new_msg;
  437. }
  438. // Internal only; used by Google::Protobuf.deep_copy.
  439. VALUE Message_deep_copy(VALUE _self) {
  440. MessageHeader* self;
  441. MessageHeader* new_msg_self;
  442. VALUE new_msg;
  443. TypedData_Get_Struct(_self, MessageHeader, &Message_type, self);
  444. new_msg = rb_class_new_instance(0, NULL, CLASS_OF(_self));
  445. TypedData_Get_Struct(new_msg, MessageHeader, &Message_type, new_msg_self);
  446. layout_deep_copy(self->descriptor->layout,
  447. Message_data(new_msg_self),
  448. Message_data(self));
  449. return new_msg;
  450. }
  451. /*
  452. * call-seq:
  453. * Message.==(other) => boolean
  454. *
  455. * Performs a deep comparison of this message with another. Messages are equal
  456. * if they have the same type and if each field is equal according to the :==
  457. * method's semantics (a more efficient comparison may actually be done if the
  458. * field is of a primitive type).
  459. */
  460. VALUE Message_eq(VALUE _self, VALUE _other) {
  461. MessageHeader* self;
  462. MessageHeader* other;
  463. if (TYPE(_self) != TYPE(_other)) {
  464. return Qfalse;
  465. }
  466. TypedData_Get_Struct(_self, MessageHeader, &Message_type, self);
  467. TypedData_Get_Struct(_other, MessageHeader, &Message_type, other);
  468. if (self->descriptor != other->descriptor) {
  469. return Qfalse;
  470. }
  471. return layout_eq(self->descriptor->layout,
  472. Message_data(self),
  473. Message_data(other));
  474. }
  475. /*
  476. * call-seq:
  477. * Message.hash => hash_value
  478. *
  479. * Returns a hash value that represents this message's field values.
  480. */
  481. VALUE Message_hash(VALUE _self) {
  482. MessageHeader* self;
  483. TypedData_Get_Struct(_self, MessageHeader, &Message_type, self);
  484. return layout_hash(self->descriptor->layout, Message_data(self));
  485. }
  486. /*
  487. * call-seq:
  488. * Message.inspect => string
  489. *
  490. * Returns a human-readable string representing this message. It will be
  491. * formatted as "<MessageType: field1: value1, field2: value2, ...>". Each
  492. * field's value is represented according to its own #inspect method.
  493. */
  494. VALUE Message_inspect(VALUE _self) {
  495. MessageHeader* self;
  496. VALUE str;
  497. TypedData_Get_Struct(_self, MessageHeader, &Message_type, self);
  498. str = rb_str_new2("<");
  499. str = rb_str_append(str, rb_str_new2(rb_class2name(CLASS_OF(_self))));
  500. str = rb_str_cat2(str, ": ");
  501. str = rb_str_append(str, layout_inspect(
  502. self->descriptor->layout, Message_data(self)));
  503. str = rb_str_cat2(str, ">");
  504. return str;
  505. }
  506. /*
  507. * call-seq:
  508. * Message.to_h => {}
  509. *
  510. * Returns the message as a Ruby Hash object, with keys as symbols.
  511. */
  512. VALUE Message_to_h(VALUE _self) {
  513. MessageHeader* self;
  514. VALUE hash;
  515. upb_msg_field_iter it;
  516. TypedData_Get_Struct(_self, MessageHeader, &Message_type, self);
  517. hash = rb_hash_new();
  518. for (upb_msg_field_begin(&it, self->descriptor->msgdef);
  519. !upb_msg_field_done(&it);
  520. upb_msg_field_next(&it)) {
  521. const upb_fielddef* field = upb_msg_iter_field(&it);
  522. // For proto2, do not include fields which are not set.
  523. if (upb_msgdef_syntax(self->descriptor->msgdef) == UPB_SYNTAX_PROTO2 &&
  524. field_contains_hasbit(self->descriptor->layout, field) &&
  525. !layout_has(self->descriptor->layout, Message_data(self), field)) {
  526. continue;
  527. }
  528. VALUE msg_value = layout_get(self->descriptor->layout, Message_data(self),
  529. field);
  530. VALUE msg_key = ID2SYM(rb_intern(upb_fielddef_name(field)));
  531. if (is_map_field(field)) {
  532. msg_value = Map_to_h(msg_value);
  533. } else if (upb_fielddef_label(field) == UPB_LABEL_REPEATED) {
  534. msg_value = RepeatedField_to_ary(msg_value);
  535. if (upb_msgdef_syntax(self->descriptor->msgdef) == UPB_SYNTAX_PROTO2 &&
  536. RARRAY_LEN(msg_value) == 0) {
  537. continue;
  538. }
  539. if (upb_fielddef_type(field) == UPB_TYPE_MESSAGE) {
  540. for (int i = 0; i < RARRAY_LEN(msg_value); i++) {
  541. VALUE elem = rb_ary_entry(msg_value, i);
  542. rb_ary_store(msg_value, i, Message_to_h(elem));
  543. }
  544. }
  545. } else if (msg_value != Qnil &&
  546. upb_fielddef_type(field) == UPB_TYPE_MESSAGE) {
  547. msg_value = Message_to_h(msg_value);
  548. }
  549. rb_hash_aset(hash, msg_key, msg_value);
  550. }
  551. return hash;
  552. }
  553. /*
  554. * call-seq:
  555. * Message.[](index) => value
  556. *
  557. * Accesses a field's value by field name. The provided field name should be a
  558. * string.
  559. */
  560. VALUE Message_index(VALUE _self, VALUE field_name) {
  561. MessageHeader* self;
  562. const upb_fielddef* field;
  563. TypedData_Get_Struct(_self, MessageHeader, &Message_type, self);
  564. Check_Type(field_name, T_STRING);
  565. field = upb_msgdef_ntofz(self->descriptor->msgdef, RSTRING_PTR(field_name));
  566. if (field == NULL) {
  567. return Qnil;
  568. }
  569. return layout_get(self->descriptor->layout, Message_data(self), field);
  570. }
  571. /*
  572. * call-seq:
  573. * Message.[]=(index, value)
  574. *
  575. * Sets a field's value by field name. The provided field name should be a
  576. * string.
  577. */
  578. VALUE Message_index_set(VALUE _self, VALUE field_name, VALUE value) {
  579. MessageHeader* self;
  580. const upb_fielddef* field;
  581. TypedData_Get_Struct(_self, MessageHeader, &Message_type, self);
  582. Check_Type(field_name, T_STRING);
  583. field = upb_msgdef_ntofz(self->descriptor->msgdef, RSTRING_PTR(field_name));
  584. if (field == NULL) {
  585. rb_raise(rb_eArgError, "Unknown field: %s", RSTRING_PTR(field_name));
  586. }
  587. layout_set(self->descriptor->layout, Message_data(self), field, value);
  588. return Qnil;
  589. }
  590. /*
  591. * call-seq:
  592. * Message.descriptor => descriptor
  593. *
  594. * Class method that returns the Descriptor instance corresponding to this
  595. * message class's type.
  596. */
  597. VALUE Message_descriptor(VALUE klass) {
  598. return rb_ivar_get(klass, descriptor_instancevar_interned);
  599. }
  600. VALUE build_class_from_descriptor(Descriptor* desc) {
  601. const char *name;
  602. VALUE klass;
  603. if (desc->layout == NULL) {
  604. desc->layout = create_layout(desc->msgdef);
  605. }
  606. if (desc->fill_method == NULL) {
  607. desc->fill_method = new_fillmsg_decodermethod(desc, &desc->fill_method);
  608. }
  609. name = upb_msgdef_fullname(desc->msgdef);
  610. if (name == NULL) {
  611. rb_raise(rb_eRuntimeError, "Descriptor does not have assigned name.");
  612. }
  613. klass = rb_define_class_id(
  614. // Docs say this parameter is ignored. User will assign return value to
  615. // their own toplevel constant class name.
  616. rb_intern("Message"),
  617. rb_cObject);
  618. rb_ivar_set(klass, descriptor_instancevar_interned,
  619. get_def_obj(desc->msgdef));
  620. rb_define_alloc_func(klass, Message_alloc);
  621. rb_require("google/protobuf/message_exts");
  622. rb_include_module(klass, rb_eval_string("::Google::Protobuf::MessageExts"));
  623. rb_extend_object(
  624. klass, rb_eval_string("::Google::Protobuf::MessageExts::ClassMethods"));
  625. rb_define_method(klass, "method_missing",
  626. Message_method_missing, -1);
  627. rb_define_method(klass, "respond_to_missing?",
  628. Message_respond_to_missing, -1);
  629. rb_define_method(klass, "initialize", Message_initialize, -1);
  630. rb_define_method(klass, "dup", Message_dup, 0);
  631. // Also define #clone so that we don't inherit Object#clone.
  632. rb_define_method(klass, "clone", Message_dup, 0);
  633. rb_define_method(klass, "==", Message_eq, 1);
  634. rb_define_method(klass, "eql?", Message_eq, 1);
  635. rb_define_method(klass, "hash", Message_hash, 0);
  636. rb_define_method(klass, "to_h", Message_to_h, 0);
  637. rb_define_method(klass, "inspect", Message_inspect, 0);
  638. rb_define_method(klass, "to_s", Message_inspect, 0);
  639. rb_define_method(klass, "[]", Message_index, 1);
  640. rb_define_method(klass, "[]=", Message_index_set, 2);
  641. rb_define_singleton_method(klass, "decode", Message_decode, 1);
  642. rb_define_singleton_method(klass, "encode", Message_encode, 1);
  643. rb_define_singleton_method(klass, "decode_json", Message_decode_json, -1);
  644. rb_define_singleton_method(klass, "encode_json", Message_encode_json, -1);
  645. rb_define_singleton_method(klass, "descriptor", Message_descriptor, 0);
  646. return klass;
  647. }
  648. /*
  649. * call-seq:
  650. * Enum.lookup(number) => name
  651. *
  652. * This module method, provided on each generated enum module, looks up an enum
  653. * value by number and returns its name as a Ruby symbol, or nil if not found.
  654. */
  655. VALUE enum_lookup(VALUE self, VALUE number) {
  656. int32_t num = NUM2INT(number);
  657. VALUE desc = rb_ivar_get(self, descriptor_instancevar_interned);
  658. EnumDescriptor* enumdesc = ruby_to_EnumDescriptor(desc);
  659. const char* name = upb_enumdef_iton(enumdesc->enumdef, num);
  660. if (name == NULL) {
  661. return Qnil;
  662. } else {
  663. return ID2SYM(rb_intern(name));
  664. }
  665. }
  666. /*
  667. * call-seq:
  668. * Enum.resolve(name) => number
  669. *
  670. * This module method, provided on each generated enum module, looks up an enum
  671. * value by name (as a Ruby symbol) and returns its name, or nil if not found.
  672. */
  673. VALUE enum_resolve(VALUE self, VALUE sym) {
  674. const char* name = rb_id2name(SYM2ID(sym));
  675. VALUE desc = rb_ivar_get(self, descriptor_instancevar_interned);
  676. EnumDescriptor* enumdesc = ruby_to_EnumDescriptor(desc);
  677. int32_t num = 0;
  678. bool found = upb_enumdef_ntoiz(enumdesc->enumdef, name, &num);
  679. if (!found) {
  680. return Qnil;
  681. } else {
  682. return INT2NUM(num);
  683. }
  684. }
  685. /*
  686. * call-seq:
  687. * Enum.descriptor
  688. *
  689. * This module method, provided on each generated enum module, returns the
  690. * EnumDescriptor corresponding to this enum type.
  691. */
  692. VALUE enum_descriptor(VALUE self) {
  693. return rb_ivar_get(self, descriptor_instancevar_interned);
  694. }
  695. VALUE build_module_from_enumdesc(EnumDescriptor* enumdesc) {
  696. VALUE mod = rb_define_module_id(
  697. rb_intern(upb_enumdef_fullname(enumdesc->enumdef)));
  698. upb_enum_iter it;
  699. for (upb_enum_begin(&it, enumdesc->enumdef);
  700. !upb_enum_done(&it);
  701. upb_enum_next(&it)) {
  702. const char* name = upb_enum_iter_name(&it);
  703. int32_t value = upb_enum_iter_number(&it);
  704. if (name[0] < 'A' || name[0] > 'Z') {
  705. rb_warn("Enum value '%s' does not start with an uppercase letter "
  706. "as is required for Ruby constants.",
  707. name);
  708. }
  709. rb_define_const(mod, name, INT2NUM(value));
  710. }
  711. rb_define_singleton_method(mod, "lookup", enum_lookup, 1);
  712. rb_define_singleton_method(mod, "resolve", enum_resolve, 1);
  713. rb_define_singleton_method(mod, "descriptor", enum_descriptor, 0);
  714. rb_ivar_set(mod, descriptor_instancevar_interned,
  715. get_def_obj(enumdesc->enumdef));
  716. return mod;
  717. }
  718. /*
  719. * call-seq:
  720. * Google::Protobuf.deep_copy(obj) => copy_of_obj
  721. *
  722. * Performs a deep copy of a RepeatedField instance, a Map instance, or a
  723. * message object, recursively copying its members.
  724. */
  725. VALUE Google_Protobuf_deep_copy(VALUE self, VALUE obj) {
  726. VALUE klass = CLASS_OF(obj);
  727. if (klass == cRepeatedField) {
  728. return RepeatedField_deep_copy(obj);
  729. } else if (klass == cMap) {
  730. return Map_deep_copy(obj);
  731. } else {
  732. return Message_deep_copy(obj);
  733. }
  734. }