encode_decode.c 58 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099110011011102110311041105110611071108110911101111111211131114111511161117111811191120112111221123112411251126112711281129113011311132113311341135113611371138113911401141114211431144114511461147114811491150115111521153115411551156115711581159116011611162116311641165116611671168116911701171117211731174117511761177117811791180118111821183118411851186118711881189119011911192119311941195119611971198119912001201120212031204120512061207120812091210121112121213121412151216121712181219122012211222122312241225122612271228122912301231123212331234123512361237123812391240124112421243124412451246124712481249125012511252125312541255125612571258125912601261126212631264126512661267126812691270127112721273127412751276127712781279128012811282128312841285128612871288128912901291129212931294129512961297129812991300130113021303130413051306130713081309131013111312131313141315131613171318131913201321132213231324132513261327132813291330133113321333133413351336133713381339134013411342134313441345134613471348134913501351135213531354135513561357135813591360136113621363136413651366136713681369137013711372137313741375137613771378137913801381138213831384138513861387138813891390139113921393139413951396139713981399140014011402140314041405140614071408140914101411141214131414141514161417141814191420142114221423142414251426142714281429143014311432143314341435143614371438143914401441144214431444144514461447144814491450145114521453145414551456145714581459146014611462146314641465146614671468146914701471147214731474147514761477147814791480148114821483148414851486148714881489149014911492149314941495149614971498149915001501150215031504150515061507150815091510151115121513151415151516151715181519152015211522152315241525152615271528152915301531153215331534153515361537153815391540154115421543154415451546154715481549155015511552155315541555155615571558155915601561156215631564156515661567156815691570157115721573157415751576157715781579158015811582158315841585158615871588158915901591159215931594159515961597159815991600160116021603160416051606160716081609161016111612161316141615161616171618161916201621162216231624162516261627162816291630163116321633163416351636163716381639164016411642164316441645164616471648164916501651165216531654165516561657165816591660166116621663166416651666166716681669167016711672167316741675167616771678167916801681168216831684168516861687168816891690169116921693169416951696169716981699170017011702170317041705170617071708170917101711171217131714171517161717171817191720172117221723172417251726172717281729173017311732173317341735173617371738
  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. // This function is equivalent to rb_str_cat(), but unlike the real
  32. // rb_str_cat(), it doesn't leak memory in some versions of Ruby.
  33. // For more information, see:
  34. // https://bugs.ruby-lang.org/issues/11328
  35. VALUE noleak_rb_str_cat(VALUE rb_str, const char *str, long len) {
  36. char *p;
  37. size_t oldlen = RSTRING_LEN(rb_str);
  38. rb_str_modify_expand(rb_str, len);
  39. p = RSTRING_PTR(rb_str);
  40. memcpy(p + oldlen, str, len);
  41. rb_str_set_len(rb_str, oldlen + len);
  42. return rb_str;
  43. }
  44. // The code below also comes from upb's prototype Ruby binding, developed by
  45. // haberman@.
  46. /* stringsink *****************************************************************/
  47. static void *stringsink_start(void *_sink, const void *hd, size_t size_hint) {
  48. stringsink *sink = _sink;
  49. sink->len = 0;
  50. return sink;
  51. }
  52. static size_t stringsink_string(void *_sink, const void *hd, const char *ptr,
  53. size_t len, const upb_bufhandle *handle) {
  54. stringsink *sink = _sink;
  55. size_t new_size = sink->size;
  56. UPB_UNUSED(hd);
  57. UPB_UNUSED(handle);
  58. while (sink->len + len > new_size) {
  59. new_size *= 2;
  60. }
  61. if (new_size != sink->size) {
  62. sink->ptr = realloc(sink->ptr, new_size);
  63. sink->size = new_size;
  64. }
  65. memcpy(sink->ptr + sink->len, ptr, len);
  66. sink->len += len;
  67. return len;
  68. }
  69. void stringsink_init(stringsink *sink) {
  70. upb_byteshandler_init(&sink->handler);
  71. upb_byteshandler_setstartstr(&sink->handler, stringsink_start, NULL);
  72. upb_byteshandler_setstring(&sink->handler, stringsink_string, NULL);
  73. upb_bytessink_reset(&sink->sink, &sink->handler, sink);
  74. sink->size = 32;
  75. sink->ptr = malloc(sink->size);
  76. sink->len = 0;
  77. }
  78. void stringsink_uninit(stringsink *sink) {
  79. free(sink->ptr);
  80. }
  81. // -----------------------------------------------------------------------------
  82. // Parsing.
  83. // -----------------------------------------------------------------------------
  84. #define DEREF(msg, ofs, type) *(type*)(((uint8_t *)msg) + ofs)
  85. typedef struct {
  86. size_t ofs;
  87. int32_t hasbit;
  88. } field_handlerdata_t;
  89. // Creates a handlerdata that contains the offset and the hasbit for the field
  90. static const void* newhandlerdata(upb_handlers* h, uint32_t ofs, int32_t hasbit) {
  91. field_handlerdata_t *hd = ALLOC(field_handlerdata_t);
  92. hd->ofs = ofs;
  93. hd->hasbit = hasbit;
  94. upb_handlers_addcleanup(h, hd, xfree);
  95. return hd;
  96. }
  97. typedef struct {
  98. size_t ofs;
  99. int32_t hasbit;
  100. VALUE subklass;
  101. } submsg_handlerdata_t;
  102. // Creates a handlerdata that contains offset and submessage type information.
  103. static const void *newsubmsghandlerdata(upb_handlers* h,
  104. uint32_t ofs,
  105. int32_t hasbit,
  106. VALUE subklass) {
  107. submsg_handlerdata_t *hd = ALLOC(submsg_handlerdata_t);
  108. hd->ofs = ofs;
  109. hd->hasbit = hasbit;
  110. hd->subklass = subklass;
  111. upb_handlers_addcleanup(h, hd, xfree);
  112. return hd;
  113. }
  114. typedef struct {
  115. size_t ofs; // union data slot
  116. size_t case_ofs; // oneof_case field
  117. uint32_t oneof_case_num; // oneof-case number to place in oneof_case field
  118. VALUE subklass;
  119. } oneof_handlerdata_t;
  120. static const void *newoneofhandlerdata(upb_handlers *h,
  121. uint32_t ofs,
  122. uint32_t case_ofs,
  123. const upb_fielddef *f,
  124. const Descriptor* desc) {
  125. oneof_handlerdata_t *hd = ALLOC(oneof_handlerdata_t);
  126. hd->ofs = ofs;
  127. hd->case_ofs = case_ofs;
  128. // We reuse the field tag number as a oneof union discriminant tag. Note that
  129. // we don't expose these numbers to the user, so the only requirement is that
  130. // we have some unique ID for each union case/possibility. The field tag
  131. // numbers are already present and are easy to use so there's no reason to
  132. // create a separate ID space. In addition, using the field tag number here
  133. // lets us easily look up the field in the oneof accessor.
  134. hd->oneof_case_num = upb_fielddef_number(f);
  135. if (is_value_field(f)) {
  136. hd->oneof_case_num |= ONEOF_CASE_MASK;
  137. }
  138. hd->subklass = field_type_class(desc->layout, f);
  139. upb_handlers_addcleanup(h, hd, xfree);
  140. return hd;
  141. }
  142. // A handler that starts a repeated field. Gets the Repeated*Field instance for
  143. // this field (such an instance always exists even in an empty message).
  144. static void *startseq_handler(void* closure, const void* hd) {
  145. MessageHeader* msg = closure;
  146. const size_t *ofs = hd;
  147. return (void*)DEREF(msg, *ofs, VALUE);
  148. }
  149. // Handlers that append primitive values to a repeated field.
  150. #define DEFINE_APPEND_HANDLER(type, ctype) \
  151. static bool append##type##_handler(void *closure, const void *hd, \
  152. ctype val) { \
  153. VALUE ary = (VALUE)closure; \
  154. RepeatedField_push_native(ary, &val); \
  155. return true; \
  156. }
  157. DEFINE_APPEND_HANDLER(bool, bool)
  158. DEFINE_APPEND_HANDLER(int32, int32_t)
  159. DEFINE_APPEND_HANDLER(uint32, uint32_t)
  160. DEFINE_APPEND_HANDLER(float, float)
  161. DEFINE_APPEND_HANDLER(int64, int64_t)
  162. DEFINE_APPEND_HANDLER(uint64, uint64_t)
  163. DEFINE_APPEND_HANDLER(double, double)
  164. // Appends a string to a repeated field.
  165. static void* appendstr_handler(void *closure,
  166. const void *hd,
  167. size_t size_hint) {
  168. VALUE ary = (VALUE)closure;
  169. VALUE str = rb_str_new2("");
  170. rb_enc_associate(str, kRubyStringUtf8Encoding);
  171. RepeatedField_push_native(ary, &str);
  172. return (void*)str;
  173. }
  174. static void set_hasbit(void *closure, int32_t hasbit) {
  175. if (hasbit > 0) {
  176. uint8_t* storage = closure;
  177. storage[hasbit/8] |= 1 << (hasbit % 8);
  178. }
  179. }
  180. // Appends a 'bytes' string to a repeated field.
  181. static void* appendbytes_handler(void *closure,
  182. const void *hd,
  183. size_t size_hint) {
  184. VALUE ary = (VALUE)closure;
  185. VALUE str = rb_str_new2("");
  186. rb_enc_associate(str, kRubyString8bitEncoding);
  187. RepeatedField_push_native(ary, &str);
  188. return (void*)str;
  189. }
  190. // Sets a non-repeated string field in a message.
  191. static void* str_handler(void *closure,
  192. const void *hd,
  193. size_t size_hint) {
  194. MessageHeader* msg = closure;
  195. const field_handlerdata_t *fieldhandler = hd;
  196. VALUE str = rb_str_new2("");
  197. rb_enc_associate(str, kRubyStringUtf8Encoding);
  198. DEREF(msg, fieldhandler->ofs, VALUE) = str;
  199. set_hasbit(closure, fieldhandler->hasbit);
  200. return (void*)str;
  201. }
  202. // Sets a non-repeated 'bytes' field in a message.
  203. static void* bytes_handler(void *closure,
  204. const void *hd,
  205. size_t size_hint) {
  206. MessageHeader* msg = closure;
  207. const field_handlerdata_t *fieldhandler = hd;
  208. VALUE str = rb_str_new2("");
  209. rb_enc_associate(str, kRubyString8bitEncoding);
  210. DEREF(msg, fieldhandler->ofs, VALUE) = str;
  211. set_hasbit(closure, fieldhandler->hasbit);
  212. return (void*)str;
  213. }
  214. static size_t stringdata_handler(void* closure, const void* hd,
  215. const char* str, size_t len,
  216. const upb_bufhandle* handle) {
  217. VALUE rb_str = (VALUE)closure;
  218. noleak_rb_str_cat(rb_str, str, len);
  219. return len;
  220. }
  221. static bool stringdata_end_handler(void* closure, const void* hd) {
  222. VALUE rb_str = (VALUE)closure;
  223. rb_obj_freeze(rb_str);
  224. return true;
  225. }
  226. static bool appendstring_end_handler(void* closure, const void* hd) {
  227. VALUE rb_str = (VALUE)closure;
  228. rb_obj_freeze(rb_str);
  229. return true;
  230. }
  231. // Appends a submessage to a repeated field (a regular Ruby array for now).
  232. static void *appendsubmsg_handler(void *closure, const void *hd) {
  233. VALUE ary = (VALUE)closure;
  234. const submsg_handlerdata_t *submsgdata = hd;
  235. MessageHeader* submsg;
  236. VALUE submsg_rb = rb_class_new_instance(0, NULL, submsgdata->subklass);
  237. RepeatedField_push(ary, submsg_rb);
  238. TypedData_Get_Struct(submsg_rb, MessageHeader, &Message_type, submsg);
  239. return submsg;
  240. }
  241. // Appends a wrapper to a repeated field (a regular Ruby array for now).
  242. static void *appendwrapper_handler(void *closure, const void *hd) {
  243. VALUE ary = (VALUE)closure;
  244. int size = RepeatedField_size(ary);
  245. (void)hd;
  246. RepeatedField_push(ary, Qnil);
  247. return RepeatedField_index_native(ary, size);
  248. }
  249. // Sets a non-repeated submessage field in a message.
  250. static void *submsg_handler(void *closure, const void *hd) {
  251. MessageHeader* msg = closure;
  252. const submsg_handlerdata_t* submsgdata = hd;
  253. VALUE submsg_rb;
  254. MessageHeader* submsg;
  255. if (DEREF(msg, submsgdata->ofs, VALUE) == Qnil) {
  256. DEREF(msg, submsgdata->ofs, VALUE) =
  257. rb_class_new_instance(0, NULL, submsgdata->subklass);
  258. }
  259. set_hasbit(closure, submsgdata->hasbit);
  260. submsg_rb = DEREF(msg, submsgdata->ofs, VALUE);
  261. TypedData_Get_Struct(submsg_rb, MessageHeader, &Message_type, submsg);
  262. return submsg;
  263. }
  264. static void* startwrapper(void* closure, const void* hd) {
  265. char* msg = closure;
  266. const submsg_handlerdata_t* submsgdata = hd;
  267. set_hasbit(closure, submsgdata->hasbit);
  268. return msg + submsgdata->ofs;
  269. }
  270. // Handler data for startmap/endmap handlers.
  271. typedef struct {
  272. size_t ofs;
  273. upb_fieldtype_t key_field_type;
  274. upb_fieldtype_t value_field_type;
  275. VALUE subklass;
  276. } map_handlerdata_t;
  277. // Temporary frame for map parsing: at the beginning of a map entry message, a
  278. // submsg handler allocates a frame to hold (i) a reference to the Map object
  279. // into which this message will be inserted and (ii) storage slots to
  280. // temporarily hold the key and value for this map entry until the end of the
  281. // submessage. When the submessage ends, another handler is called to insert the
  282. // value into the map.
  283. typedef struct {
  284. VALUE map;
  285. const map_handlerdata_t* handlerdata;
  286. char key_storage[NATIVE_SLOT_MAX_SIZE];
  287. char value_storage[NATIVE_SLOT_MAX_SIZE];
  288. } map_parse_frame_t;
  289. static void MapParseFrame_mark(void* _self) {
  290. map_parse_frame_t* frame = _self;
  291. // This shouldn't strictly be necessary since this should be rooted by the
  292. // message itself, but it can't hurt.
  293. rb_gc_mark(frame->map);
  294. native_slot_mark(frame->handlerdata->key_field_type, &frame->key_storage);
  295. native_slot_mark(frame->handlerdata->value_field_type, &frame->value_storage);
  296. }
  297. void MapParseFrame_free(void* self) {
  298. xfree(self);
  299. }
  300. rb_data_type_t MapParseFrame_type = {
  301. "MapParseFrame",
  302. { MapParseFrame_mark, MapParseFrame_free, NULL },
  303. };
  304. // Handler to begin a map entry: allocates a temporary frame. This is the
  305. // 'startsubmsg' handler on the msgdef that contains the map field.
  306. static void *startmap_handler(void *closure, const void *hd) {
  307. MessageHeader* msg = closure;
  308. const map_handlerdata_t* mapdata = hd;
  309. map_parse_frame_t* frame = ALLOC(map_parse_frame_t);
  310. VALUE map_rb = DEREF(msg, mapdata->ofs, VALUE);
  311. frame->handlerdata = mapdata;
  312. frame->map = map_rb;
  313. native_slot_init(mapdata->key_field_type, &frame->key_storage);
  314. native_slot_init(mapdata->value_field_type, &frame->value_storage);
  315. Map_set_frame(map_rb,
  316. TypedData_Wrap_Struct(rb_cObject, &MapParseFrame_type, frame));
  317. return frame;
  318. }
  319. static bool endmap_handler(void *closure, const void *hd) {
  320. MessageHeader* msg = closure;
  321. const map_handlerdata_t* mapdata = hd;
  322. VALUE map_rb = DEREF(msg, mapdata->ofs, VALUE);
  323. Map_set_frame(map_rb, Qnil);
  324. return true;
  325. }
  326. // Handler to end a map entry: inserts the value defined during the message into
  327. // the map. This is the 'endmsg' handler on the map entry msgdef.
  328. static bool endmapentry_handler(void* closure, const void* hd, upb_status* s) {
  329. map_parse_frame_t* frame = closure;
  330. const map_handlerdata_t* mapdata = hd;
  331. VALUE key = native_slot_get(
  332. mapdata->key_field_type, Qnil,
  333. &frame->key_storage);
  334. VALUE value = native_slot_get(
  335. mapdata->value_field_type, mapdata->subklass,
  336. &frame->value_storage);
  337. Map_index_set(frame->map, key, value);
  338. return true;
  339. }
  340. // Allocates a new map_handlerdata_t given the map entry message definition. If
  341. // the offset of the field within the parent message is also given, that is
  342. // added to the handler data as well. Note that this is called *twice* per map
  343. // field: once in the parent message handler setup when setting the startsubmsg
  344. // handler and once in the map entry message handler setup when setting the
  345. // key/value and endmsg handlers. The reason is that there is no easy way to
  346. // pass the handlerdata down to the sub-message handler setup.
  347. static map_handlerdata_t* new_map_handlerdata(
  348. size_t ofs,
  349. const upb_msgdef* mapentry_def,
  350. const Descriptor* desc) {
  351. const upb_fielddef* key_field;
  352. const upb_fielddef* value_field;
  353. map_handlerdata_t* hd = ALLOC(map_handlerdata_t);
  354. hd->ofs = ofs;
  355. key_field = upb_msgdef_itof(mapentry_def, MAP_KEY_FIELD);
  356. assert(key_field != NULL);
  357. hd->key_field_type = upb_fielddef_type(key_field);
  358. value_field = upb_msgdef_itof(mapentry_def, MAP_VALUE_FIELD);
  359. assert(value_field != NULL);
  360. hd->value_field_type = upb_fielddef_type(value_field);
  361. hd->subklass = field_type_class(desc->layout, value_field);
  362. return hd;
  363. }
  364. // Handlers that set primitive values in oneofs.
  365. #define DEFINE_ONEOF_HANDLER(type, ctype) \
  366. static bool oneof##type##_handler(void *closure, const void *hd, \
  367. ctype val) { \
  368. const oneof_handlerdata_t *oneofdata = hd; \
  369. DEREF(closure, oneofdata->case_ofs, uint32_t) = \
  370. oneofdata->oneof_case_num; \
  371. DEREF(closure, oneofdata->ofs, ctype) = val; \
  372. return true; \
  373. }
  374. DEFINE_ONEOF_HANDLER(bool, bool)
  375. DEFINE_ONEOF_HANDLER(int32, int32_t)
  376. DEFINE_ONEOF_HANDLER(uint32, uint32_t)
  377. DEFINE_ONEOF_HANDLER(float, float)
  378. DEFINE_ONEOF_HANDLER(int64, int64_t)
  379. DEFINE_ONEOF_HANDLER(uint64, uint64_t)
  380. DEFINE_ONEOF_HANDLER(double, double)
  381. #undef DEFINE_ONEOF_HANDLER
  382. // Handlers for strings in a oneof.
  383. static void *oneofstr_handler(void *closure,
  384. const void *hd,
  385. size_t size_hint) {
  386. MessageHeader* msg = closure;
  387. const oneof_handlerdata_t *oneofdata = hd;
  388. VALUE str = rb_str_new2("");
  389. rb_enc_associate(str, kRubyStringUtf8Encoding);
  390. DEREF(msg, oneofdata->case_ofs, uint32_t) =
  391. oneofdata->oneof_case_num;
  392. DEREF(msg, oneofdata->ofs, VALUE) = str;
  393. return (void*)str;
  394. }
  395. static void *oneofbytes_handler(void *closure,
  396. const void *hd,
  397. size_t size_hint) {
  398. MessageHeader* msg = closure;
  399. const oneof_handlerdata_t *oneofdata = hd;
  400. VALUE str = rb_str_new2("");
  401. rb_enc_associate(str, kRubyString8bitEncoding);
  402. DEREF(msg, oneofdata->case_ofs, uint32_t) =
  403. oneofdata->oneof_case_num;
  404. DEREF(msg, oneofdata->ofs, VALUE) = str;
  405. return (void*)str;
  406. }
  407. static bool oneofstring_end_handler(void* closure, const void* hd) {
  408. VALUE rb_str = rb_str_new2("");
  409. rb_obj_freeze(rb_str);
  410. return true;
  411. }
  412. // Handler for a submessage field in a oneof.
  413. static void *oneofsubmsg_handler(void *closure,
  414. const void *hd) {
  415. MessageHeader* msg = closure;
  416. const oneof_handlerdata_t *oneofdata = hd;
  417. uint32_t oldcase = DEREF(msg, oneofdata->case_ofs, uint32_t);
  418. VALUE submsg_rb;
  419. MessageHeader* submsg;
  420. if (oldcase != oneofdata->oneof_case_num ||
  421. DEREF(msg, oneofdata->ofs, VALUE) == Qnil) {
  422. DEREF(msg, oneofdata->ofs, VALUE) =
  423. rb_class_new_instance(0, NULL, oneofdata->subklass);
  424. }
  425. // Set the oneof case *after* allocating the new class instance -- otherwise,
  426. // if the Ruby GC is invoked as part of a call into the VM, it might invoke
  427. // our mark routines, and our mark routines might see the case value
  428. // indicating a VALUE is present and expect a valid VALUE. See comment in
  429. // layout_set() for more detail: basically, the change to the value and the
  430. // case must be atomic w.r.t. the Ruby VM.
  431. DEREF(msg, oneofdata->case_ofs, uint32_t) = oneofdata->oneof_case_num;
  432. submsg_rb = DEREF(msg, oneofdata->ofs, VALUE);
  433. TypedData_Get_Struct(submsg_rb, MessageHeader, &Message_type, submsg);
  434. return submsg;
  435. }
  436. static void* oneof_startwrapper(void* closure, const void* hd) {
  437. char* msg = closure;
  438. const oneof_handlerdata_t *oneofdata = hd;
  439. DEREF(msg, oneofdata->case_ofs, uint32_t) = oneofdata->oneof_case_num;
  440. return msg + oneofdata->ofs;
  441. }
  442. bool is_wrapper(const upb_msgdef* m) {
  443. switch (upb_msgdef_wellknowntype(m)) {
  444. case UPB_WELLKNOWN_DOUBLEVALUE:
  445. case UPB_WELLKNOWN_FLOATVALUE:
  446. case UPB_WELLKNOWN_INT64VALUE:
  447. case UPB_WELLKNOWN_UINT64VALUE:
  448. case UPB_WELLKNOWN_INT32VALUE:
  449. case UPB_WELLKNOWN_UINT32VALUE:
  450. case UPB_WELLKNOWN_STRINGVALUE:
  451. case UPB_WELLKNOWN_BYTESVALUE:
  452. case UPB_WELLKNOWN_BOOLVALUE:
  453. return true;
  454. default:
  455. return false;
  456. }
  457. }
  458. // Set up handlers for a repeated field.
  459. static void add_handlers_for_repeated_field(upb_handlers *h,
  460. const Descriptor* desc,
  461. const upb_fielddef *f,
  462. size_t offset) {
  463. upb_handlerattr attr = UPB_HANDLERATTR_INIT;
  464. attr.handler_data = newhandlerdata(h, offset, -1);
  465. upb_handlers_setstartseq(h, f, startseq_handler, &attr);
  466. switch (upb_fielddef_type(f)) {
  467. #define SET_HANDLER(utype, ltype) \
  468. case utype: \
  469. upb_handlers_set##ltype(h, f, append##ltype##_handler, NULL); \
  470. break;
  471. SET_HANDLER(UPB_TYPE_BOOL, bool);
  472. SET_HANDLER(UPB_TYPE_INT32, int32);
  473. SET_HANDLER(UPB_TYPE_UINT32, uint32);
  474. SET_HANDLER(UPB_TYPE_ENUM, int32);
  475. SET_HANDLER(UPB_TYPE_FLOAT, float);
  476. SET_HANDLER(UPB_TYPE_INT64, int64);
  477. SET_HANDLER(UPB_TYPE_UINT64, uint64);
  478. SET_HANDLER(UPB_TYPE_DOUBLE, double);
  479. #undef SET_HANDLER
  480. case UPB_TYPE_STRING:
  481. case UPB_TYPE_BYTES: {
  482. bool is_bytes = upb_fielddef_type(f) == UPB_TYPE_BYTES;
  483. upb_handlers_setstartstr(h, f, is_bytes ?
  484. appendbytes_handler : appendstr_handler,
  485. NULL);
  486. upb_handlers_setstring(h, f, stringdata_handler, NULL);
  487. upb_handlers_setendstr(h, f, appendstring_end_handler, NULL);
  488. break;
  489. }
  490. case UPB_TYPE_MESSAGE: {
  491. VALUE subklass = field_type_class(desc->layout, f);
  492. upb_handlerattr attr = UPB_HANDLERATTR_INIT;
  493. attr.handler_data = newsubmsghandlerdata(h, 0, -1, subklass);
  494. if (is_wrapper(upb_fielddef_msgsubdef(f))) {
  495. upb_handlers_setstartsubmsg(h, f, appendwrapper_handler, &attr);
  496. } else {
  497. upb_handlers_setstartsubmsg(h, f, appendsubmsg_handler, &attr);
  498. }
  499. break;
  500. }
  501. }
  502. }
  503. static bool doublewrapper_handler(void* closure, const void* hd, double val) {
  504. VALUE* rbval = closure;
  505. *rbval = DBL2NUM(val);
  506. return true;
  507. }
  508. static bool floatwrapper_handler(void* closure, const void* hd, float val) {
  509. VALUE* rbval = closure;
  510. *rbval = DBL2NUM(val);
  511. return true;
  512. }
  513. static bool int64wrapper_handler(void* closure, const void* hd, int64_t val) {
  514. VALUE* rbval = closure;
  515. *rbval = LL2NUM(val);
  516. return true;
  517. }
  518. static bool uint64wrapper_handler(void* closure, const void* hd, uint64_t val) {
  519. VALUE* rbval = closure;
  520. *rbval = ULL2NUM(val);
  521. return true;
  522. }
  523. static bool int32wrapper_handler(void* closure, const void* hd, int32_t val) {
  524. VALUE* rbval = closure;
  525. *rbval = INT2NUM(val);
  526. return true;
  527. }
  528. static bool uint32wrapper_handler(void* closure, const void* hd, uint32_t val) {
  529. VALUE* rbval = closure;
  530. *rbval = UINT2NUM(val);
  531. return true;
  532. }
  533. static size_t stringwrapper_handler(void* closure, const void* hd,
  534. const char* ptr, size_t len,
  535. const upb_bufhandle* handle) {
  536. VALUE* rbval = closure;
  537. *rbval = get_frozen_string(ptr, len, false);
  538. return len;
  539. }
  540. static size_t byteswrapper_handler(void* closure, const void* hd,
  541. const char* ptr, size_t len,
  542. const upb_bufhandle* handle) {
  543. VALUE* rbval = closure;
  544. *rbval = get_frozen_string(ptr, len, true);
  545. return len;
  546. }
  547. static bool boolwrapper_handler(void* closure, const void* hd, bool val) {
  548. VALUE* rbval = closure;
  549. if (val) {
  550. *rbval = Qtrue;
  551. } else {
  552. *rbval = Qfalse;
  553. }
  554. return true;
  555. }
  556. // Set up handlers for a singular field.
  557. static void add_handlers_for_singular_field(const Descriptor* desc,
  558. upb_handlers* h,
  559. const upb_fielddef* f,
  560. size_t offset, size_t hasbit_off) {
  561. // The offset we pass to UPB points to the start of the Message,
  562. // rather than the start of where our data is stored.
  563. int32_t hasbit = -1;
  564. if (hasbit_off != MESSAGE_FIELD_NO_HASBIT) {
  565. hasbit = hasbit_off + sizeof(MessageHeader) * 8;
  566. }
  567. switch (upb_fielddef_type(f)) {
  568. case UPB_TYPE_BOOL:
  569. case UPB_TYPE_INT32:
  570. case UPB_TYPE_UINT32:
  571. case UPB_TYPE_ENUM:
  572. case UPB_TYPE_FLOAT:
  573. case UPB_TYPE_INT64:
  574. case UPB_TYPE_UINT64:
  575. case UPB_TYPE_DOUBLE:
  576. upb_msg_setscalarhandler(h, f, offset, hasbit);
  577. break;
  578. case UPB_TYPE_STRING:
  579. case UPB_TYPE_BYTES: {
  580. bool is_bytes = upb_fielddef_type(f) == UPB_TYPE_BYTES;
  581. upb_handlerattr attr = UPB_HANDLERATTR_INIT;
  582. attr.handler_data = newhandlerdata(h, offset, hasbit);
  583. upb_handlers_setstartstr(h, f,
  584. is_bytes ? bytes_handler : str_handler,
  585. &attr);
  586. upb_handlers_setstring(h, f, stringdata_handler, &attr);
  587. upb_handlers_setendstr(h, f, stringdata_end_handler, &attr);
  588. break;
  589. }
  590. case UPB_TYPE_MESSAGE: {
  591. upb_handlerattr attr = UPB_HANDLERATTR_INIT;
  592. attr.handler_data = newsubmsghandlerdata(
  593. h, offset, hasbit, field_type_class(desc->layout, f));
  594. if (is_wrapper(upb_fielddef_msgsubdef(f))) {
  595. upb_handlers_setstartsubmsg(h, f, startwrapper, &attr);
  596. } else {
  597. upb_handlers_setstartsubmsg(h, f, submsg_handler, &attr);
  598. }
  599. }
  600. }
  601. }
  602. // Adds handlers to a map field.
  603. static void add_handlers_for_mapfield(upb_handlers* h,
  604. const upb_fielddef* fielddef,
  605. size_t offset,
  606. const Descriptor* desc) {
  607. const upb_msgdef* map_msgdef = upb_fielddef_msgsubdef(fielddef);
  608. map_handlerdata_t* hd = new_map_handlerdata(offset, map_msgdef, desc);
  609. upb_handlerattr attr = UPB_HANDLERATTR_INIT;
  610. upb_handlers_addcleanup(h, hd, xfree);
  611. attr.handler_data = hd;
  612. upb_handlers_setstartsubmsg(h, fielddef, startmap_handler, &attr);
  613. upb_handlers_setendsubmsg(h, fielddef, endmap_handler, &attr);
  614. }
  615. // Adds handlers to a map-entry msgdef.
  616. static void add_handlers_for_mapentry(const upb_msgdef* msgdef, upb_handlers* h,
  617. const Descriptor* desc) {
  618. const upb_fielddef* key_field = map_entry_key(msgdef);
  619. const upb_fielddef* value_field = map_entry_value(msgdef);
  620. map_handlerdata_t* hd = new_map_handlerdata(0, msgdef, desc);
  621. upb_handlerattr attr = UPB_HANDLERATTR_INIT;
  622. upb_handlers_addcleanup(h, hd, xfree);
  623. attr.handler_data = hd;
  624. upb_handlers_setendmsg(h, endmapentry_handler, &attr);
  625. add_handlers_for_singular_field(
  626. desc, h, key_field,
  627. offsetof(map_parse_frame_t, key_storage),
  628. MESSAGE_FIELD_NO_HASBIT);
  629. add_handlers_for_singular_field(
  630. desc, h, value_field,
  631. offsetof(map_parse_frame_t, value_storage),
  632. MESSAGE_FIELD_NO_HASBIT);
  633. }
  634. static void add_handlers_for_wrapper(const upb_msgdef* msgdef,
  635. upb_handlers* h) {
  636. const upb_fielddef* f = upb_msgdef_itof(msgdef, 1);
  637. switch (upb_msgdef_wellknowntype(msgdef)) {
  638. case UPB_WELLKNOWN_DOUBLEVALUE:
  639. upb_handlers_setdouble(h, f, doublewrapper_handler, NULL);
  640. break;
  641. case UPB_WELLKNOWN_FLOATVALUE:
  642. upb_handlers_setfloat(h, f, floatwrapper_handler, NULL);
  643. break;
  644. case UPB_WELLKNOWN_INT64VALUE:
  645. upb_handlers_setint64(h, f, int64wrapper_handler, NULL);
  646. break;
  647. case UPB_WELLKNOWN_UINT64VALUE:
  648. upb_handlers_setuint64(h, f, uint64wrapper_handler, NULL);
  649. break;
  650. case UPB_WELLKNOWN_INT32VALUE:
  651. upb_handlers_setint32(h, f, int32wrapper_handler, NULL);
  652. break;
  653. case UPB_WELLKNOWN_UINT32VALUE:
  654. upb_handlers_setuint32(h, f, uint32wrapper_handler, NULL);
  655. break;
  656. case UPB_WELLKNOWN_STRINGVALUE:
  657. upb_handlers_setstring(h, f, stringwrapper_handler, NULL);
  658. break;
  659. case UPB_WELLKNOWN_BYTESVALUE:
  660. upb_handlers_setstring(h, f, byteswrapper_handler, NULL);
  661. break;
  662. case UPB_WELLKNOWN_BOOLVALUE:
  663. upb_handlers_setbool(h, f, boolwrapper_handler, NULL);
  664. return;
  665. default:
  666. rb_raise(rb_eRuntimeError,
  667. "Internal logic error with well-known types.");
  668. }
  669. }
  670. // Set up handlers for a oneof field.
  671. static void add_handlers_for_oneof_field(upb_handlers *h,
  672. const upb_fielddef *f,
  673. size_t offset,
  674. size_t oneof_case_offset,
  675. const Descriptor* desc) {
  676. upb_handlerattr attr = UPB_HANDLERATTR_INIT;
  677. attr.handler_data =
  678. newoneofhandlerdata(h, offset, oneof_case_offset, f, desc);
  679. switch (upb_fielddef_type(f)) {
  680. #define SET_HANDLER(utype, ltype) \
  681. case utype: \
  682. upb_handlers_set##ltype(h, f, oneof##ltype##_handler, &attr); \
  683. break;
  684. SET_HANDLER(UPB_TYPE_BOOL, bool);
  685. SET_HANDLER(UPB_TYPE_INT32, int32);
  686. SET_HANDLER(UPB_TYPE_UINT32, uint32);
  687. SET_HANDLER(UPB_TYPE_ENUM, int32);
  688. SET_HANDLER(UPB_TYPE_FLOAT, float);
  689. SET_HANDLER(UPB_TYPE_INT64, int64);
  690. SET_HANDLER(UPB_TYPE_UINT64, uint64);
  691. SET_HANDLER(UPB_TYPE_DOUBLE, double);
  692. #undef SET_HANDLER
  693. case UPB_TYPE_STRING:
  694. case UPB_TYPE_BYTES: {
  695. bool is_bytes = upb_fielddef_type(f) == UPB_TYPE_BYTES;
  696. upb_handlers_setstartstr(h, f, is_bytes ?
  697. oneofbytes_handler : oneofstr_handler,
  698. &attr);
  699. upb_handlers_setstring(h, f, stringdata_handler, NULL);
  700. upb_handlers_setendstr(h, f, oneofstring_end_handler, &attr);
  701. break;
  702. }
  703. case UPB_TYPE_MESSAGE: {
  704. if (is_wrapper(upb_fielddef_msgsubdef(f))) {
  705. upb_handlers_setstartsubmsg(h, f, oneof_startwrapper, &attr);
  706. } else {
  707. upb_handlers_setstartsubmsg(h, f, oneofsubmsg_handler, &attr);
  708. }
  709. break;
  710. }
  711. }
  712. }
  713. static bool unknown_field_handler(void* closure, const void* hd,
  714. const char* buf, size_t size) {
  715. MessageHeader* msg = (MessageHeader*)closure;
  716. UPB_UNUSED(hd);
  717. if (msg->unknown_fields == NULL) {
  718. msg->unknown_fields = malloc(sizeof(stringsink));
  719. stringsink_init(msg->unknown_fields);
  720. }
  721. stringsink_string(msg->unknown_fields, NULL, buf, size, NULL);
  722. return true;
  723. }
  724. size_t get_field_offset(MessageLayout* layout, const upb_fielddef* f) {
  725. return layout->fields[upb_fielddef_index(f)].offset + sizeof(MessageHeader);
  726. }
  727. void add_handlers_for_message(const void *closure, upb_handlers *h) {
  728. const VALUE descriptor_pool = (VALUE)closure;
  729. const upb_msgdef* msgdef = upb_handlers_msgdef(h);
  730. Descriptor* desc =
  731. ruby_to_Descriptor(get_msgdef_obj(descriptor_pool, msgdef));
  732. upb_msg_field_iter i;
  733. upb_handlerattr attr = UPB_HANDLERATTR_INIT;
  734. // Ensure layout exists. We may be invoked to create handlers for a given
  735. // message if we are included as a submsg of another message type before our
  736. // class is actually built, so to work around this, we just create the layout
  737. // (and handlers, in the class-building function) on-demand.
  738. if (desc->layout == NULL) {
  739. create_layout(desc);
  740. }
  741. // If this is a mapentry message type, set up a special set of handlers and
  742. // bail out of the normal (user-defined) message type handling.
  743. if (upb_msgdef_mapentry(msgdef)) {
  744. add_handlers_for_mapentry(msgdef, h, desc);
  745. return;
  746. }
  747. // If this is a wrapper type, use special handlers and bail.
  748. if (is_wrapper(msgdef)) {
  749. add_handlers_for_wrapper(msgdef, h);
  750. return;
  751. }
  752. upb_handlers_setunknown(h, unknown_field_handler, &attr);
  753. for (upb_msg_field_begin(&i, desc->msgdef);
  754. !upb_msg_field_done(&i);
  755. upb_msg_field_next(&i)) {
  756. const upb_fielddef *f = upb_msg_iter_field(&i);
  757. const upb_oneofdef *oneof = upb_fielddef_containingoneof(f);
  758. size_t offset = get_field_offset(desc->layout, f);
  759. if (oneof) {
  760. size_t oneof_case_offset =
  761. desc->layout->oneofs[upb_oneofdef_index(oneof)].case_offset +
  762. sizeof(MessageHeader);
  763. add_handlers_for_oneof_field(h, f, offset, oneof_case_offset, desc);
  764. } else if (is_map_field(f)) {
  765. add_handlers_for_mapfield(h, f, offset, desc);
  766. } else if (upb_fielddef_isseq(f)) {
  767. add_handlers_for_repeated_field(h, desc, f, offset);
  768. } else {
  769. add_handlers_for_singular_field(
  770. desc, h, f, offset,
  771. desc->layout->fields[upb_fielddef_index(f)].hasbit);
  772. }
  773. }
  774. }
  775. // Constructs the handlers for filling a message's data into an in-memory
  776. // object.
  777. const upb_handlers* get_fill_handlers(Descriptor* desc) {
  778. DescriptorPool* pool = ruby_to_DescriptorPool(desc->descriptor_pool);
  779. return upb_handlercache_get(pool->fill_handler_cache, desc->msgdef);
  780. }
  781. static const upb_pbdecodermethod *msgdef_decodermethod(Descriptor* desc) {
  782. DescriptorPool* pool = ruby_to_DescriptorPool(desc->descriptor_pool);
  783. return upb_pbcodecache_get(pool->fill_method_cache, desc->msgdef);
  784. }
  785. static const upb_json_parsermethod *msgdef_jsonparsermethod(Descriptor* desc) {
  786. DescriptorPool* pool = ruby_to_DescriptorPool(desc->descriptor_pool);
  787. return upb_json_codecache_get(pool->json_fill_method_cache, desc->msgdef);
  788. }
  789. static const upb_handlers* msgdef_pb_serialize_handlers(Descriptor* desc) {
  790. DescriptorPool* pool = ruby_to_DescriptorPool(desc->descriptor_pool);
  791. return upb_handlercache_get(pool->pb_serialize_handler_cache, desc->msgdef);
  792. }
  793. static const upb_handlers* msgdef_json_serialize_handlers(
  794. Descriptor* desc, bool preserve_proto_fieldnames) {
  795. DescriptorPool* pool = ruby_to_DescriptorPool(desc->descriptor_pool);
  796. if (preserve_proto_fieldnames) {
  797. return upb_handlercache_get(pool->json_serialize_handler_preserve_cache,
  798. desc->msgdef);
  799. } else {
  800. return upb_handlercache_get(pool->json_serialize_handler_cache,
  801. desc->msgdef);
  802. }
  803. }
  804. // Stack-allocated context during an encode/decode operation. Contains the upb
  805. // environment and its stack-based allocator, an initial buffer for allocations
  806. // to avoid malloc() when possible, and a template for Ruby exception messages
  807. // if any error occurs.
  808. #define STACK_ENV_STACKBYTES 4096
  809. typedef struct {
  810. upb_arena *arena;
  811. upb_status status;
  812. const char* ruby_error_template;
  813. char allocbuf[STACK_ENV_STACKBYTES];
  814. } stackenv;
  815. static void stackenv_init(stackenv* se, const char* errmsg);
  816. static void stackenv_uninit(stackenv* se);
  817. static void stackenv_init(stackenv* se, const char* errmsg) {
  818. se->ruby_error_template = errmsg;
  819. se->arena =
  820. upb_arena_init(se->allocbuf, sizeof(se->allocbuf), &upb_alloc_global);
  821. upb_status_clear(&se->status);
  822. }
  823. static void stackenv_uninit(stackenv* se) {
  824. upb_arena_free(se->arena);
  825. if (!upb_ok(&se->status)) {
  826. // TODO(haberman): have a way to verify that this is actually a parse error,
  827. // instead of just throwing "parse error" unconditionally.
  828. VALUE errmsg = rb_str_new2(upb_status_errmsg(&se->status));
  829. rb_raise(cParseError, se->ruby_error_template, errmsg);
  830. }
  831. }
  832. /*
  833. * call-seq:
  834. * MessageClass.decode(data) => message
  835. *
  836. * Decodes the given data (as a string containing bytes in protocol buffers wire
  837. * format) under the interpretration given by this message class's definition
  838. * and returns a message object with the corresponding field values.
  839. */
  840. VALUE Message_decode(VALUE klass, VALUE data) {
  841. VALUE descriptor = rb_ivar_get(klass, descriptor_instancevar_interned);
  842. Descriptor* desc = ruby_to_Descriptor(descriptor);
  843. VALUE msgklass = Descriptor_msgclass(descriptor);
  844. VALUE msg_rb;
  845. MessageHeader* msg;
  846. if (TYPE(data) != T_STRING) {
  847. rb_raise(rb_eArgError, "Expected string for binary protobuf data.");
  848. }
  849. msg_rb = rb_class_new_instance(0, NULL, msgklass);
  850. TypedData_Get_Struct(msg_rb, MessageHeader, &Message_type, msg);
  851. {
  852. const upb_pbdecodermethod* method = msgdef_decodermethod(desc);
  853. const upb_handlers* h = upb_pbdecodermethod_desthandlers(method);
  854. const upb_msgdef* m = upb_handlers_msgdef(h);
  855. VALUE wrapper = Qnil;
  856. void* ptr = msg;
  857. stackenv se;
  858. upb_sink sink;
  859. upb_pbdecoder* decoder;
  860. stackenv_init(&se, "Error occurred during parsing: %" PRIsVALUE);
  861. if (is_wrapper(m)) {
  862. ptr = &wrapper;
  863. }
  864. upb_sink_reset(&sink, h, ptr);
  865. decoder = upb_pbdecoder_create(se.arena, method, sink, &se.status);
  866. upb_bufsrc_putbuf(RSTRING_PTR(data), RSTRING_LEN(data),
  867. upb_pbdecoder_input(decoder));
  868. stackenv_uninit(&se);
  869. if (is_wrapper(m)) {
  870. msg_rb = ruby_wrapper_type(msgklass, wrapper);
  871. }
  872. }
  873. return msg_rb;
  874. }
  875. /*
  876. * call-seq:
  877. * MessageClass.decode_json(data, options = {}) => message
  878. *
  879. * Decodes the given data (as a string containing bytes in protocol buffers wire
  880. * format) under the interpretration given by this message class's definition
  881. * and returns a message object with the corresponding field values.
  882. *
  883. * @param options [Hash] options for the decoder
  884. * ignore_unknown_fields: set true to ignore unknown fields (default is to
  885. * raise an error)
  886. */
  887. VALUE Message_decode_json(int argc, VALUE* argv, VALUE klass) {
  888. VALUE descriptor = rb_ivar_get(klass, descriptor_instancevar_interned);
  889. Descriptor* desc = ruby_to_Descriptor(descriptor);
  890. VALUE msgklass = Descriptor_msgclass(descriptor);
  891. VALUE msg_rb;
  892. VALUE data = argv[0];
  893. VALUE ignore_unknown_fields = Qfalse;
  894. MessageHeader* msg;
  895. if (argc < 1 || argc > 2) {
  896. rb_raise(rb_eArgError, "Expected 1 or 2 arguments.");
  897. }
  898. if (argc == 2) {
  899. VALUE hash_args = argv[1];
  900. if (TYPE(hash_args) != T_HASH) {
  901. rb_raise(rb_eArgError, "Expected hash arguments.");
  902. }
  903. ignore_unknown_fields = rb_hash_lookup2(
  904. hash_args, ID2SYM(rb_intern("ignore_unknown_fields")), Qfalse);
  905. }
  906. if (TYPE(data) != T_STRING) {
  907. rb_raise(rb_eArgError, "Expected string for JSON data.");
  908. }
  909. // TODO(cfallin): Check and respect string encoding. If not UTF-8, we need to
  910. // convert, because string handlers pass data directly to message string
  911. // fields.
  912. msg_rb = rb_class_new_instance(0, NULL, msgklass);
  913. TypedData_Get_Struct(msg_rb, MessageHeader, &Message_type, msg);
  914. {
  915. const upb_json_parsermethod* method = msgdef_jsonparsermethod(desc);
  916. const upb_handlers* h = get_fill_handlers(desc);
  917. const upb_msgdef* m = upb_handlers_msgdef(h);
  918. stackenv se;
  919. upb_sink sink;
  920. upb_json_parser* parser;
  921. DescriptorPool* pool = ruby_to_DescriptorPool(generated_pool);
  922. stackenv_init(&se, "Error occurred during parsing: %" PRIsVALUE);
  923. if (is_wrapper(m)) {
  924. rb_raise(
  925. rb_eRuntimeError,
  926. "Parsing a wrapper type from JSON at the top level does not work.");
  927. }
  928. upb_sink_reset(&sink, h, msg);
  929. parser = upb_json_parser_create(se.arena, method, pool->symtab, sink,
  930. &se.status, RTEST(ignore_unknown_fields));
  931. upb_bufsrc_putbuf(RSTRING_PTR(data), RSTRING_LEN(data),
  932. upb_json_parser_input(parser));
  933. stackenv_uninit(&se);
  934. }
  935. return msg_rb;
  936. }
  937. // -----------------------------------------------------------------------------
  938. // Serializing.
  939. // -----------------------------------------------------------------------------
  940. /* msgvisitor *****************************************************************/
  941. static void putmsg(VALUE msg, const Descriptor* desc, upb_sink sink, int depth,
  942. bool emit_defaults, bool is_json, bool open_msg);
  943. static upb_selector_t getsel(const upb_fielddef *f, upb_handlertype_t type) {
  944. upb_selector_t ret;
  945. bool ok = upb_handlers_getselector(f, type, &ret);
  946. UPB_ASSERT(ok);
  947. return ret;
  948. }
  949. static void putstr(VALUE str, const upb_fielddef *f, upb_sink sink) {
  950. upb_sink subsink;
  951. if (str == Qnil) return;
  952. assert(BUILTIN_TYPE(str) == RUBY_T_STRING);
  953. // We should be guaranteed that the string has the correct encoding because
  954. // we ensured this at assignment time and then froze the string.
  955. if (upb_fielddef_type(f) == UPB_TYPE_STRING) {
  956. assert(rb_enc_from_index(ENCODING_GET(str)) == kRubyStringUtf8Encoding);
  957. } else {
  958. assert(rb_enc_from_index(ENCODING_GET(str)) == kRubyString8bitEncoding);
  959. }
  960. upb_sink_startstr(sink, getsel(f, UPB_HANDLER_STARTSTR), RSTRING_LEN(str),
  961. &subsink);
  962. upb_sink_putstring(subsink, getsel(f, UPB_HANDLER_STRING), RSTRING_PTR(str),
  963. RSTRING_LEN(str), NULL);
  964. upb_sink_endstr(sink, getsel(f, UPB_HANDLER_ENDSTR));
  965. }
  966. static void putsubmsg(VALUE submsg, const upb_fielddef *f, upb_sink sink,
  967. int depth, bool emit_defaults, bool is_json) {
  968. upb_sink subsink;
  969. VALUE descriptor;
  970. Descriptor* subdesc;
  971. if (submsg == Qnil) return;
  972. descriptor = rb_ivar_get(submsg, descriptor_instancevar_interned);
  973. subdesc = ruby_to_Descriptor(descriptor);
  974. upb_sink_startsubmsg(sink, getsel(f, UPB_HANDLER_STARTSUBMSG), &subsink);
  975. putmsg(submsg, subdesc, subsink, depth + 1, emit_defaults, is_json, true);
  976. upb_sink_endsubmsg(sink, getsel(f, UPB_HANDLER_ENDSUBMSG));
  977. }
  978. static void putary(VALUE ary, const upb_fielddef* f, upb_sink sink, int depth,
  979. bool emit_defaults, bool is_json) {
  980. upb_sink subsink;
  981. upb_fieldtype_t type = upb_fielddef_type(f);
  982. upb_selector_t sel = 0;
  983. int size;
  984. int i;
  985. VALUE type_class = ruby_to_RepeatedField(ary)->field_type_class;
  986. if (ary == Qnil) return;
  987. if (!emit_defaults && NUM2INT(RepeatedField_length(ary)) == 0) return;
  988. size = NUM2INT(RepeatedField_length(ary));
  989. if (size == 0 && !emit_defaults) return;
  990. upb_sink_startseq(sink, getsel(f, UPB_HANDLER_STARTSEQ), &subsink);
  991. if (upb_fielddef_isprimitive(f)) {
  992. sel = getsel(f, upb_handlers_getprimitivehandlertype(f));
  993. }
  994. for (i = 0; i < size; i++) {
  995. void* memory = RepeatedField_index_native(ary, i);
  996. switch (type) {
  997. #define T(upbtypeconst, upbtype, ctype) \
  998. case upbtypeconst: \
  999. upb_sink_put##upbtype(subsink, sel, *((ctype*)memory)); \
  1000. break;
  1001. T(UPB_TYPE_FLOAT, float, float)
  1002. T(UPB_TYPE_DOUBLE, double, double)
  1003. T(UPB_TYPE_BOOL, bool, int8_t)
  1004. case UPB_TYPE_ENUM:
  1005. T(UPB_TYPE_INT32, int32, int32_t)
  1006. T(UPB_TYPE_UINT32, uint32, uint32_t)
  1007. T(UPB_TYPE_INT64, int64, int64_t)
  1008. T(UPB_TYPE_UINT64, uint64, uint64_t)
  1009. case UPB_TYPE_STRING:
  1010. case UPB_TYPE_BYTES:
  1011. putstr(*((VALUE *)memory), f, subsink);
  1012. break;
  1013. case UPB_TYPE_MESSAGE: {
  1014. VALUE val = native_slot_get(UPB_TYPE_MESSAGE, type_class, memory);
  1015. putsubmsg(val, f, subsink, depth, emit_defaults, is_json);
  1016. break;
  1017. }
  1018. #undef T
  1019. }
  1020. }
  1021. upb_sink_endseq(sink, getsel(f, UPB_HANDLER_ENDSEQ));
  1022. }
  1023. static void put_ruby_value(VALUE value, const upb_fielddef* f, VALUE type_class,
  1024. int depth, upb_sink sink, bool emit_defaults,
  1025. bool is_json) {
  1026. upb_selector_t sel = 0;
  1027. if (depth > ENCODE_MAX_NESTING) {
  1028. rb_raise(rb_eRuntimeError,
  1029. "Maximum recursion depth exceeded during encoding.");
  1030. }
  1031. if (upb_fielddef_isprimitive(f)) {
  1032. sel = getsel(f, upb_handlers_getprimitivehandlertype(f));
  1033. }
  1034. switch (upb_fielddef_type(f)) {
  1035. case UPB_TYPE_INT32:
  1036. upb_sink_putint32(sink, sel, NUM2INT(value));
  1037. break;
  1038. case UPB_TYPE_INT64:
  1039. upb_sink_putint64(sink, sel, NUM2LL(value));
  1040. break;
  1041. case UPB_TYPE_UINT32:
  1042. upb_sink_putuint32(sink, sel, NUM2UINT(value));
  1043. break;
  1044. case UPB_TYPE_UINT64:
  1045. upb_sink_putuint64(sink, sel, NUM2ULL(value));
  1046. break;
  1047. case UPB_TYPE_FLOAT:
  1048. upb_sink_putfloat(sink, sel, NUM2DBL(value));
  1049. break;
  1050. case UPB_TYPE_DOUBLE:
  1051. upb_sink_putdouble(sink, sel, NUM2DBL(value));
  1052. break;
  1053. case UPB_TYPE_ENUM: {
  1054. if (TYPE(value) == T_SYMBOL) {
  1055. value = rb_funcall(type_class, rb_intern("resolve"), 1, value);
  1056. }
  1057. upb_sink_putint32(sink, sel, NUM2INT(value));
  1058. break;
  1059. }
  1060. case UPB_TYPE_BOOL:
  1061. upb_sink_putbool(sink, sel, value == Qtrue);
  1062. break;
  1063. case UPB_TYPE_STRING:
  1064. case UPB_TYPE_BYTES:
  1065. putstr(value, f, sink);
  1066. break;
  1067. case UPB_TYPE_MESSAGE:
  1068. putsubmsg(value, f, sink, depth, emit_defaults, is_json);
  1069. }
  1070. }
  1071. static void putmap(VALUE map, const upb_fielddef* f, upb_sink sink, int depth,
  1072. bool emit_defaults, bool is_json) {
  1073. Map* self;
  1074. upb_sink subsink;
  1075. const upb_fielddef* key_field;
  1076. const upb_fielddef* value_field;
  1077. Map_iter it;
  1078. if (map == Qnil) return;
  1079. if (!emit_defaults && Map_length(map) == 0) return;
  1080. self = ruby_to_Map(map);
  1081. upb_sink_startseq(sink, getsel(f, UPB_HANDLER_STARTSEQ), &subsink);
  1082. assert(upb_fielddef_type(f) == UPB_TYPE_MESSAGE);
  1083. key_field = map_field_key(f);
  1084. value_field = map_field_value(f);
  1085. for (Map_begin(map, &it); !Map_done(&it); Map_next(&it)) {
  1086. VALUE key = Map_iter_key(&it);
  1087. VALUE value = Map_iter_value(&it);
  1088. upb_status status;
  1089. upb_sink entry_sink;
  1090. upb_sink_startsubmsg(subsink, getsel(f, UPB_HANDLER_STARTSUBMSG),
  1091. &entry_sink);
  1092. upb_sink_startmsg(entry_sink);
  1093. put_ruby_value(key, key_field, Qnil, depth + 1, entry_sink, emit_defaults,
  1094. is_json);
  1095. put_ruby_value(value, value_field, self->value_type_class, depth + 1,
  1096. entry_sink, emit_defaults, is_json);
  1097. upb_sink_endmsg(entry_sink, &status);
  1098. upb_sink_endsubmsg(subsink, getsel(f, UPB_HANDLER_ENDSUBMSG));
  1099. }
  1100. upb_sink_endseq(sink, getsel(f, UPB_HANDLER_ENDSEQ));
  1101. }
  1102. static const upb_handlers* msgdef_json_serialize_handlers(
  1103. Descriptor* desc, bool preserve_proto_fieldnames);
  1104. static void putjsonany(VALUE msg_rb, const Descriptor* desc, upb_sink sink,
  1105. int depth, bool emit_defaults) {
  1106. upb_status status;
  1107. MessageHeader* msg = NULL;
  1108. const upb_fielddef* type_field = upb_msgdef_itof(desc->msgdef, UPB_ANY_TYPE);
  1109. const upb_fielddef* value_field = upb_msgdef_itof(desc->msgdef, UPB_ANY_VALUE);
  1110. size_t type_url_offset;
  1111. VALUE type_url_str_rb;
  1112. const upb_msgdef *payload_type = NULL;
  1113. TypedData_Get_Struct(msg_rb, MessageHeader, &Message_type, msg);
  1114. upb_sink_startmsg(sink);
  1115. /* Handle type url */
  1116. type_url_offset = desc->layout->fields[upb_fielddef_index(type_field)].offset;
  1117. type_url_str_rb = DEREF(Message_data(msg), type_url_offset, VALUE);
  1118. if (RSTRING_LEN(type_url_str_rb) > 0) {
  1119. putstr(type_url_str_rb, type_field, sink);
  1120. }
  1121. {
  1122. const char* type_url_str = RSTRING_PTR(type_url_str_rb);
  1123. size_t type_url_len = RSTRING_LEN(type_url_str_rb);
  1124. DescriptorPool* pool = ruby_to_DescriptorPool(generated_pool);
  1125. if (type_url_len <= 20 ||
  1126. strncmp(type_url_str, "type.googleapis.com/", 20) != 0) {
  1127. rb_raise(rb_eRuntimeError, "Invalid type url: %s", type_url_str);
  1128. return;
  1129. }
  1130. /* Resolve type url */
  1131. type_url_str += 20;
  1132. type_url_len -= 20;
  1133. payload_type = upb_symtab_lookupmsg2(
  1134. pool->symtab, type_url_str, type_url_len);
  1135. if (payload_type == NULL) {
  1136. rb_raise(rb_eRuntimeError, "Unknown type: %s", type_url_str);
  1137. return;
  1138. }
  1139. }
  1140. {
  1141. uint32_t value_offset;
  1142. VALUE value_str_rb;
  1143. size_t value_len;
  1144. value_offset = desc->layout->fields[upb_fielddef_index(value_field)].offset;
  1145. value_str_rb = DEREF(Message_data(msg), value_offset, VALUE);
  1146. value_len = RSTRING_LEN(value_str_rb);
  1147. if (value_len > 0) {
  1148. VALUE payload_desc_rb = get_msgdef_obj(generated_pool, payload_type);
  1149. Descriptor* payload_desc = ruby_to_Descriptor(payload_desc_rb);
  1150. VALUE payload_class = Descriptor_msgclass(payload_desc_rb);
  1151. upb_sink subsink;
  1152. bool is_wellknown;
  1153. VALUE payload_msg_rb = Message_decode(payload_class, value_str_rb);
  1154. is_wellknown =
  1155. upb_msgdef_wellknowntype(payload_desc->msgdef) !=
  1156. UPB_WELLKNOWN_UNSPECIFIED;
  1157. if (is_wellknown) {
  1158. upb_sink_startstr(sink, getsel(value_field, UPB_HANDLER_STARTSTR), 0,
  1159. &subsink);
  1160. }
  1161. subsink.handlers =
  1162. msgdef_json_serialize_handlers(payload_desc, true);
  1163. subsink.closure = sink.closure;
  1164. putmsg(payload_msg_rb, payload_desc, subsink, depth, emit_defaults, true,
  1165. is_wellknown);
  1166. }
  1167. }
  1168. upb_sink_endmsg(sink, &status);
  1169. }
  1170. static void putjsonlistvalue(
  1171. VALUE msg_rb, const Descriptor* desc,
  1172. upb_sink sink, int depth, bool emit_defaults) {
  1173. upb_status status;
  1174. upb_sink subsink;
  1175. MessageHeader* msg = NULL;
  1176. const upb_fielddef* f = upb_msgdef_itof(desc->msgdef, 1);
  1177. uint32_t offset =
  1178. desc->layout->fields[upb_fielddef_index(f)].offset +
  1179. sizeof(MessageHeader);
  1180. VALUE ary;
  1181. TypedData_Get_Struct(msg_rb, MessageHeader, &Message_type, msg);
  1182. upb_sink_startmsg(sink);
  1183. ary = DEREF(msg, offset, VALUE);
  1184. if (ary == Qnil || RepeatedField_size(ary) == 0) {
  1185. upb_sink_startseq(sink, getsel(f, UPB_HANDLER_STARTSEQ), &subsink);
  1186. upb_sink_endseq(sink, getsel(f, UPB_HANDLER_ENDSEQ));
  1187. } else {
  1188. putary(ary, f, sink, depth, emit_defaults, true);
  1189. }
  1190. upb_sink_endmsg(sink, &status);
  1191. }
  1192. static void putmsg(VALUE msg_rb, const Descriptor* desc,
  1193. upb_sink sink, int depth, bool emit_defaults,
  1194. bool is_json, bool open_msg) {
  1195. MessageHeader* msg;
  1196. upb_msg_field_iter i;
  1197. upb_status status;
  1198. if (is_json &&
  1199. upb_msgdef_wellknowntype(desc->msgdef) == UPB_WELLKNOWN_ANY) {
  1200. putjsonany(msg_rb, desc, sink, depth, emit_defaults);
  1201. return;
  1202. }
  1203. if (is_json &&
  1204. upb_msgdef_wellknowntype(desc->msgdef) == UPB_WELLKNOWN_LISTVALUE) {
  1205. putjsonlistvalue(msg_rb, desc, sink, depth, emit_defaults);
  1206. return;
  1207. }
  1208. if (open_msg) {
  1209. upb_sink_startmsg(sink);
  1210. }
  1211. // Protect against cycles (possible because users may freely reassign message
  1212. // and repeated fields) by imposing a maximum recursion depth.
  1213. if (depth > ENCODE_MAX_NESTING) {
  1214. rb_raise(rb_eRuntimeError,
  1215. "Maximum recursion depth exceeded during encoding.");
  1216. }
  1217. TypedData_Get_Struct(msg_rb, MessageHeader, &Message_type, msg);
  1218. if (desc != msg->descriptor) {
  1219. rb_raise(rb_eArgError,
  1220. "The type of given msg is '%s', expect '%s'.",
  1221. upb_msgdef_fullname(msg->descriptor->msgdef),
  1222. upb_msgdef_fullname(desc->msgdef));
  1223. }
  1224. for (upb_msg_field_begin(&i, desc->msgdef);
  1225. !upb_msg_field_done(&i);
  1226. upb_msg_field_next(&i)) {
  1227. upb_fielddef *f = upb_msg_iter_field(&i);
  1228. const upb_oneofdef *oneof = upb_fielddef_containingoneof(f);
  1229. bool is_matching_oneof = false;
  1230. uint32_t offset =
  1231. desc->layout->fields[upb_fielddef_index(f)].offset +
  1232. sizeof(MessageHeader);
  1233. if (oneof) {
  1234. uint32_t oneof_case =
  1235. slot_read_oneof_case(desc->layout, Message_data(msg), oneof);
  1236. // For a oneof, check that this field is actually present -- skip all the
  1237. // below if not.
  1238. if (oneof_case != upb_fielddef_number(f)) {
  1239. continue;
  1240. }
  1241. // Otherwise, fall through to the appropriate singular-field handler
  1242. // below.
  1243. is_matching_oneof = true;
  1244. }
  1245. if (is_map_field(f)) {
  1246. VALUE map = DEREF(msg, offset, VALUE);
  1247. if (map != Qnil || emit_defaults) {
  1248. putmap(map, f, sink, depth, emit_defaults, is_json);
  1249. }
  1250. } else if (upb_fielddef_isseq(f)) {
  1251. VALUE ary = DEREF(msg, offset, VALUE);
  1252. if (ary != Qnil) {
  1253. putary(ary, f, sink, depth, emit_defaults, is_json);
  1254. }
  1255. } else if (upb_fielddef_isstring(f)) {
  1256. VALUE str = DEREF(msg, offset, VALUE);
  1257. bool is_default = false;
  1258. if (upb_msgdef_syntax(desc->msgdef) == UPB_SYNTAX_PROTO2) {
  1259. is_default = layout_has(desc->layout, Message_data(msg), f) == Qfalse;
  1260. } else if (upb_msgdef_syntax(desc->msgdef) == UPB_SYNTAX_PROTO3) {
  1261. is_default = RSTRING_LEN(str) == 0;
  1262. }
  1263. if (is_matching_oneof || emit_defaults || !is_default) {
  1264. putstr(str, f, sink);
  1265. }
  1266. } else if (upb_fielddef_issubmsg(f)) {
  1267. // OPT: could try to avoid the layout_get() (which will expand lazy
  1268. // wrappers).
  1269. VALUE val = layout_get(desc->layout, Message_data(msg), f);
  1270. putsubmsg(val, f, sink, depth, emit_defaults, is_json);
  1271. } else {
  1272. upb_selector_t sel = getsel(f, upb_handlers_getprimitivehandlertype(f));
  1273. #define T(upbtypeconst, upbtype, ctype, default_value) \
  1274. case upbtypeconst: { \
  1275. ctype value = DEREF(msg, offset, ctype); \
  1276. bool is_default = false; \
  1277. if (upb_fielddef_haspresence(f)) { \
  1278. is_default = layout_has(desc->layout, Message_data(msg), f) == Qfalse; \
  1279. } else if (upb_msgdef_syntax(desc->msgdef) == UPB_SYNTAX_PROTO3) { \
  1280. is_default = default_value == value; \
  1281. } \
  1282. if (is_matching_oneof || emit_defaults || !is_default) { \
  1283. upb_sink_put##upbtype(sink, sel, value); \
  1284. } \
  1285. } break;
  1286. switch (upb_fielddef_type(f)) {
  1287. T(UPB_TYPE_FLOAT, float, float, 0.0)
  1288. T(UPB_TYPE_DOUBLE, double, double, 0.0)
  1289. T(UPB_TYPE_BOOL, bool, uint8_t, 0)
  1290. case UPB_TYPE_ENUM:
  1291. T(UPB_TYPE_INT32, int32, int32_t, 0)
  1292. T(UPB_TYPE_UINT32, uint32, uint32_t, 0)
  1293. T(UPB_TYPE_INT64, int64, int64_t, 0)
  1294. T(UPB_TYPE_UINT64, uint64, uint64_t, 0)
  1295. case UPB_TYPE_STRING:
  1296. case UPB_TYPE_BYTES:
  1297. case UPB_TYPE_MESSAGE: rb_raise(rb_eRuntimeError, "Internal error.");
  1298. }
  1299. #undef T
  1300. }
  1301. }
  1302. {
  1303. stringsink* unknown = msg->unknown_fields;
  1304. if (unknown != NULL) {
  1305. upb_sink_putunknown(sink, unknown->ptr, unknown->len);
  1306. }
  1307. }
  1308. if (open_msg) {
  1309. upb_sink_endmsg(sink, &status);
  1310. }
  1311. }
  1312. /*
  1313. * call-seq:
  1314. * MessageClass.encode(msg) => bytes
  1315. *
  1316. * Encodes the given message object to its serialized form in protocol buffers
  1317. * wire format.
  1318. */
  1319. VALUE Message_encode(VALUE klass, VALUE msg_rb) {
  1320. VALUE descriptor = rb_ivar_get(klass, descriptor_instancevar_interned);
  1321. Descriptor* desc = ruby_to_Descriptor(descriptor);
  1322. stringsink sink;
  1323. stringsink_init(&sink);
  1324. {
  1325. const upb_handlers* serialize_handlers =
  1326. msgdef_pb_serialize_handlers(desc);
  1327. stackenv se;
  1328. upb_pb_encoder* encoder;
  1329. VALUE ret;
  1330. stackenv_init(&se, "Error occurred during encoding: %" PRIsVALUE);
  1331. encoder = upb_pb_encoder_create(se.arena, serialize_handlers, sink.sink);
  1332. putmsg(msg_rb, desc, upb_pb_encoder_input(encoder), 0, false, false, true);
  1333. ret = rb_str_new(sink.ptr, sink.len);
  1334. stackenv_uninit(&se);
  1335. stringsink_uninit(&sink);
  1336. return ret;
  1337. }
  1338. }
  1339. /*
  1340. * call-seq:
  1341. * MessageClass.encode_json(msg, options = {}) => json_string
  1342. *
  1343. * Encodes the given message object into its serialized JSON representation.
  1344. * @param options [Hash] options for the decoder
  1345. * preserve_proto_fieldnames: set true to use original fieldnames (default is to camelCase)
  1346. * emit_defaults: set true to emit 0/false values (default is to omit them)
  1347. */
  1348. VALUE Message_encode_json(int argc, VALUE* argv, VALUE klass) {
  1349. VALUE descriptor = rb_ivar_get(klass, descriptor_instancevar_interned);
  1350. Descriptor* desc = ruby_to_Descriptor(descriptor);
  1351. VALUE msg_rb;
  1352. VALUE preserve_proto_fieldnames = Qfalse;
  1353. VALUE emit_defaults = Qfalse;
  1354. stringsink sink;
  1355. if (argc < 1 || argc > 2) {
  1356. rb_raise(rb_eArgError, "Expected 1 or 2 arguments.");
  1357. }
  1358. msg_rb = argv[0];
  1359. if (argc == 2) {
  1360. VALUE hash_args = argv[1];
  1361. if (TYPE(hash_args) != T_HASH) {
  1362. rb_raise(rb_eArgError, "Expected hash arguments.");
  1363. }
  1364. preserve_proto_fieldnames = rb_hash_lookup2(
  1365. hash_args, ID2SYM(rb_intern("preserve_proto_fieldnames")), Qfalse);
  1366. emit_defaults = rb_hash_lookup2(
  1367. hash_args, ID2SYM(rb_intern("emit_defaults")), Qfalse);
  1368. }
  1369. stringsink_init(&sink);
  1370. {
  1371. const upb_handlers* serialize_handlers =
  1372. msgdef_json_serialize_handlers(desc, RTEST(preserve_proto_fieldnames));
  1373. upb_json_printer* printer;
  1374. stackenv se;
  1375. VALUE ret;
  1376. stackenv_init(&se, "Error occurred during encoding: %" PRIsVALUE);
  1377. printer = upb_json_printer_create(se.arena, serialize_handlers, sink.sink);
  1378. putmsg(msg_rb, desc, upb_json_printer_input(printer), 0,
  1379. RTEST(emit_defaults), true, true);
  1380. ret = rb_enc_str_new(sink.ptr, sink.len, rb_utf8_encoding());
  1381. stackenv_uninit(&se);
  1382. stringsink_uninit(&sink);
  1383. return ret;
  1384. }
  1385. }
  1386. static void discard_unknown(VALUE msg_rb, const Descriptor* desc) {
  1387. MessageHeader* msg;
  1388. upb_msg_field_iter it;
  1389. TypedData_Get_Struct(msg_rb, MessageHeader, &Message_type, msg);
  1390. {
  1391. stringsink* unknown = msg->unknown_fields;
  1392. if (unknown != NULL) {
  1393. stringsink_uninit(unknown);
  1394. msg->unknown_fields = NULL;
  1395. }
  1396. }
  1397. for (upb_msg_field_begin(&it, desc->msgdef);
  1398. !upb_msg_field_done(&it);
  1399. upb_msg_field_next(&it)) {
  1400. upb_fielddef *f = upb_msg_iter_field(&it);
  1401. const upb_oneofdef *oneof = upb_fielddef_containingoneof(f);
  1402. uint32_t offset =
  1403. desc->layout->fields[upb_fielddef_index(f)].offset +
  1404. sizeof(MessageHeader);
  1405. if (oneof) {
  1406. uint32_t oneof_case =
  1407. slot_read_oneof_case(desc->layout, Message_data(msg), oneof);
  1408. // For a oneof, check that this field is actually present -- skip all the
  1409. // below if not.
  1410. if (oneof_case != upb_fielddef_number(f)) {
  1411. continue;
  1412. }
  1413. // Otherwise, fall through to the appropriate singular-field handler
  1414. // below.
  1415. }
  1416. if (!upb_fielddef_issubmsg(f)) {
  1417. continue;
  1418. }
  1419. if (is_map_field(f)) {
  1420. VALUE map;
  1421. Map_iter map_it;
  1422. if (!upb_fielddef_issubmsg(map_field_value(f))) continue;
  1423. map = DEREF(msg, offset, VALUE);
  1424. if (map == Qnil) continue;
  1425. for (Map_begin(map, &map_it); !Map_done(&map_it); Map_next(&map_it)) {
  1426. VALUE submsg = Map_iter_value(&map_it);
  1427. VALUE descriptor = rb_ivar_get(submsg, descriptor_instancevar_interned);
  1428. const Descriptor* subdesc = ruby_to_Descriptor(descriptor);
  1429. discard_unknown(submsg, subdesc);
  1430. }
  1431. } else if (upb_fielddef_isseq(f)) {
  1432. VALUE ary = DEREF(msg, offset, VALUE);
  1433. int size;
  1434. int i;
  1435. if (ary == Qnil) continue;
  1436. size = NUM2INT(RepeatedField_length(ary));
  1437. for (i = 0; i < size; i++) {
  1438. void* memory = RepeatedField_index_native(ary, i);
  1439. VALUE submsg = *((VALUE *)memory);
  1440. VALUE descriptor = rb_ivar_get(submsg, descriptor_instancevar_interned);
  1441. const Descriptor* subdesc = ruby_to_Descriptor(descriptor);
  1442. discard_unknown(submsg, subdesc);
  1443. }
  1444. } else {
  1445. VALUE submsg = DEREF(msg, offset, VALUE);
  1446. VALUE descriptor;
  1447. const Descriptor* subdesc;
  1448. if (submsg == Qnil) continue;
  1449. descriptor = rb_ivar_get(submsg, descriptor_instancevar_interned);
  1450. subdesc = ruby_to_Descriptor(descriptor);
  1451. discard_unknown(submsg, subdesc);
  1452. }
  1453. }
  1454. }
  1455. /*
  1456. * call-seq:
  1457. * Google::Protobuf.discard_unknown(msg)
  1458. *
  1459. * Discard unknown fields in the given message object and recursively discard
  1460. * unknown fields in submessages.
  1461. */
  1462. VALUE Google_Protobuf_discard_unknown(VALUE self, VALUE msg_rb) {
  1463. VALUE klass = CLASS_OF(msg_rb);
  1464. VALUE descriptor = rb_ivar_get(klass, descriptor_instancevar_interned);
  1465. Descriptor* desc = ruby_to_Descriptor(descriptor);
  1466. if (klass == cRepeatedField || klass == cMap) {
  1467. rb_raise(rb_eArgError, "Expected proto msg for discard unknown.");
  1468. } else {
  1469. discard_unknown(msg_rb, desc);
  1470. }
  1471. return Qnil;
  1472. }