message.c 18 KB

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