message.c 28 KB

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