repeated_field.c 21 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660
  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. // Repeated field container type.
  33. // -----------------------------------------------------------------------------
  34. const rb_data_type_t RepeatedField_type = {
  35. "Google::Protobuf::RepeatedField",
  36. { RepeatedField_mark, RepeatedField_free, NULL },
  37. };
  38. VALUE cRepeatedField;
  39. RepeatedField* ruby_to_RepeatedField(VALUE _self) {
  40. RepeatedField* self;
  41. TypedData_Get_Struct(_self, RepeatedField, &RepeatedField_type, self);
  42. return self;
  43. }
  44. void* RepeatedField_memoryat(RepeatedField* self, int index, int element_size) {
  45. return ((uint8_t *)self->elements) + index * element_size;
  46. }
  47. static int index_position(VALUE _index, RepeatedField* repeated_field) {
  48. int index = NUM2INT(_index);
  49. if (index < 0 && repeated_field->size > 0) {
  50. index = repeated_field->size + index;
  51. }
  52. return index;
  53. }
  54. VALUE RepeatedField_subarray(VALUE _self, long beg, long len) {
  55. RepeatedField* self = ruby_to_RepeatedField(_self);
  56. int element_size = native_slot_size(self->field_type);
  57. upb_fieldtype_t field_type = self->field_type;
  58. VALUE field_type_class = self->field_type_class;
  59. size_t off = beg * element_size;
  60. VALUE ary = rb_ary_new2(len);
  61. for (int i = beg; i < beg + len; i++, off += element_size) {
  62. void* mem = ((uint8_t *)self->elements) + off;
  63. VALUE elem = native_slot_get(field_type, field_type_class, mem);
  64. rb_ary_push(ary, elem);
  65. }
  66. return ary;
  67. }
  68. /*
  69. * call-seq:
  70. * RepeatedField.each(&block)
  71. *
  72. * Invokes the block once for each element of the repeated field. RepeatedField
  73. * also includes Enumerable; combined with this method, the repeated field thus
  74. * acts like an ordinary Ruby sequence.
  75. */
  76. VALUE RepeatedField_each(VALUE _self) {
  77. RepeatedField* self = ruby_to_RepeatedField(_self);
  78. upb_fieldtype_t field_type = self->field_type;
  79. VALUE field_type_class = self->field_type_class;
  80. int element_size = native_slot_size(field_type);
  81. size_t off = 0;
  82. for (int i = 0; i < self->size; i++, off += element_size) {
  83. void* memory = (void *) (((uint8_t *)self->elements) + off);
  84. VALUE val = native_slot_get(field_type, field_type_class, memory);
  85. rb_yield(val);
  86. }
  87. return _self;
  88. }
  89. /*
  90. * call-seq:
  91. * RepeatedField.[](index) => value
  92. *
  93. * Accesses the element at the given index. Returns nil on out-of-bounds
  94. */
  95. VALUE RepeatedField_index(int argc, VALUE* argv, VALUE _self) {
  96. RepeatedField* self = ruby_to_RepeatedField(_self);
  97. int element_size = native_slot_size(self->field_type);
  98. upb_fieldtype_t field_type = self->field_type;
  99. VALUE field_type_class = self->field_type_class;
  100. VALUE arg = argv[0];
  101. long beg, len;
  102. if (argc == 1){
  103. if (FIXNUM_P(arg)) {
  104. /* standard case */
  105. void* memory;
  106. int index = index_position(argv[0], self);
  107. if (index < 0 || index >= self->size) {
  108. return Qnil;
  109. }
  110. memory = RepeatedField_memoryat(self, index, element_size);
  111. return native_slot_get(field_type, field_type_class, memory);
  112. }else{
  113. /* check if idx is Range */
  114. switch (rb_range_beg_len(arg, &beg, &len, self->size, 0)) {
  115. case Qfalse:
  116. break;
  117. case Qnil:
  118. return Qnil;
  119. default:
  120. return RepeatedField_subarray(_self, beg, len);
  121. }
  122. }
  123. }
  124. /* assume 2 arguments */
  125. beg = NUM2LONG(argv[0]);
  126. len = NUM2LONG(argv[1]);
  127. if (beg < 0) {
  128. beg += self->size;
  129. }
  130. if (beg >= self->size) {
  131. return Qnil;
  132. }
  133. return RepeatedField_subarray(_self, beg, len);
  134. }
  135. /*
  136. * call-seq:
  137. * RepeatedField.[]=(index, value)
  138. *
  139. * Sets the element at the given index. On out-of-bounds assignments, extends
  140. * the array and fills the hole (if any) with default values.
  141. */
  142. VALUE RepeatedField_index_set(VALUE _self, VALUE _index, VALUE val) {
  143. RepeatedField* self = ruby_to_RepeatedField(_self);
  144. upb_fieldtype_t field_type = self->field_type;
  145. VALUE field_type_class = self->field_type_class;
  146. int element_size = native_slot_size(field_type);
  147. void* memory;
  148. int index = index_position(_index, self);
  149. if (index < 0 || index >= (INT_MAX - 1)) {
  150. return Qnil;
  151. }
  152. if (index >= self->size) {
  153. upb_fieldtype_t field_type = self->field_type;
  154. int element_size = native_slot_size(field_type);
  155. RepeatedField_reserve(self, index + 1);
  156. for (int i = self->size; i <= index; i++) {
  157. void* elem = RepeatedField_memoryat(self, i, element_size);
  158. native_slot_init(field_type, elem);
  159. }
  160. self->size = index + 1;
  161. }
  162. memory = RepeatedField_memoryat(self, index, element_size);
  163. native_slot_set("", field_type, field_type_class, memory, val);
  164. return Qnil;
  165. }
  166. static int kInitialSize = 8;
  167. void RepeatedField_reserve(RepeatedField* self, int new_size) {
  168. void* old_elems = self->elements;
  169. int elem_size = native_slot_size(self->field_type);
  170. if (new_size <= self->capacity) {
  171. return;
  172. }
  173. if (self->capacity == 0) {
  174. self->capacity = kInitialSize;
  175. }
  176. while (self->capacity < new_size) {
  177. self->capacity *= 2;
  178. }
  179. self->elements = ALLOC_N(uint8_t, elem_size * self->capacity);
  180. if (old_elems != NULL) {
  181. memcpy(self->elements, old_elems, self->size * elem_size);
  182. xfree(old_elems);
  183. }
  184. }
  185. /*
  186. * call-seq:
  187. * RepeatedField.push(value)
  188. *
  189. * Adds a new element to the repeated field.
  190. */
  191. VALUE RepeatedField_push(VALUE _self, VALUE val) {
  192. RepeatedField* self = ruby_to_RepeatedField(_self);
  193. upb_fieldtype_t field_type = self->field_type;
  194. int element_size = native_slot_size(field_type);
  195. void* memory;
  196. RepeatedField_reserve(self, self->size + 1);
  197. memory = (void *) (((uint8_t *)self->elements) + self->size * element_size);
  198. native_slot_set("", field_type, self->field_type_class, memory, val);
  199. // native_slot_set may raise an error; bump size only after set.
  200. self->size++;
  201. return _self;
  202. }
  203. VALUE RepeatedField_push_vararg(VALUE _self, VALUE args) {
  204. for (int i = 0; i < RARRAY_LEN(args); i++) {
  205. RepeatedField_push(_self, rb_ary_entry(args, i));
  206. }
  207. return _self;
  208. }
  209. // Used by parsing handlers.
  210. void RepeatedField_push_native(VALUE _self, void* data) {
  211. RepeatedField* self = ruby_to_RepeatedField(_self);
  212. upb_fieldtype_t field_type = self->field_type;
  213. int element_size = native_slot_size(field_type);
  214. void* memory;
  215. RepeatedField_reserve(self, self->size + 1);
  216. memory = (void *) (((uint8_t *)self->elements) + self->size * element_size);
  217. memcpy(memory, data, element_size);
  218. self->size++;
  219. }
  220. void* RepeatedField_index_native(VALUE _self, int index) {
  221. RepeatedField* self = ruby_to_RepeatedField(_self);
  222. upb_fieldtype_t field_type = self->field_type;
  223. int element_size = native_slot_size(field_type);
  224. return RepeatedField_memoryat(self, index, element_size);
  225. }
  226. int RepeatedField_size(VALUE _self) {
  227. RepeatedField* self = ruby_to_RepeatedField(_self);
  228. return self->size;
  229. }
  230. /*
  231. * Private ruby method, used by RepeatedField.pop
  232. */
  233. VALUE RepeatedField_pop_one(VALUE _self) {
  234. RepeatedField* self = ruby_to_RepeatedField(_self);
  235. upb_fieldtype_t field_type = self->field_type;
  236. VALUE field_type_class = self->field_type_class;
  237. int element_size = native_slot_size(field_type);
  238. int index;
  239. void* memory;
  240. VALUE ret;
  241. if (self->size == 0) {
  242. return Qnil;
  243. }
  244. index = self->size - 1;
  245. memory = RepeatedField_memoryat(self, index, element_size);
  246. ret = native_slot_get(field_type, field_type_class, memory);
  247. self->size--;
  248. return ret;
  249. }
  250. /*
  251. * call-seq:
  252. * RepeatedField.replace(list)
  253. *
  254. * Replaces the contents of the repeated field with the given list of elements.
  255. */
  256. VALUE RepeatedField_replace(VALUE _self, VALUE list) {
  257. RepeatedField* self = ruby_to_RepeatedField(_self);
  258. Check_Type(list, T_ARRAY);
  259. self->size = 0;
  260. for (int i = 0; i < RARRAY_LEN(list); i++) {
  261. RepeatedField_push(_self, rb_ary_entry(list, i));
  262. }
  263. return list;
  264. }
  265. /*
  266. * call-seq:
  267. * RepeatedField.clear
  268. *
  269. * Clears (removes all elements from) this repeated field.
  270. */
  271. VALUE RepeatedField_clear(VALUE _self) {
  272. RepeatedField* self = ruby_to_RepeatedField(_self);
  273. self->size = 0;
  274. return _self;
  275. }
  276. /*
  277. * call-seq:
  278. * RepeatedField.length
  279. *
  280. * Returns the length of this repeated field.
  281. */
  282. VALUE RepeatedField_length(VALUE _self) {
  283. RepeatedField* self = ruby_to_RepeatedField(_self);
  284. return INT2NUM(self->size);
  285. }
  286. static VALUE RepeatedField_new_this_type(VALUE _self) {
  287. RepeatedField* self = ruby_to_RepeatedField(_self);
  288. VALUE new_rptfield = Qnil;
  289. VALUE element_type = fieldtype_to_ruby(self->field_type);
  290. if (self->field_type_class != Qnil) {
  291. new_rptfield = rb_funcall(CLASS_OF(_self), rb_intern("new"), 2,
  292. element_type, self->field_type_class);
  293. } else {
  294. new_rptfield = rb_funcall(CLASS_OF(_self), rb_intern("new"), 1,
  295. element_type);
  296. }
  297. return new_rptfield;
  298. }
  299. /*
  300. * call-seq:
  301. * RepeatedField.dup => repeated_field
  302. *
  303. * Duplicates this repeated field with a shallow copy. References to all
  304. * non-primitive element objects (e.g., submessages) are shared.
  305. */
  306. VALUE RepeatedField_dup(VALUE _self) {
  307. RepeatedField* self = ruby_to_RepeatedField(_self);
  308. VALUE new_rptfield = RepeatedField_new_this_type(_self);
  309. RepeatedField* new_rptfield_self = ruby_to_RepeatedField(new_rptfield);
  310. upb_fieldtype_t field_type = self->field_type;
  311. size_t elem_size = native_slot_size(field_type);
  312. size_t off = 0;
  313. RepeatedField_reserve(new_rptfield_self, self->size);
  314. for (int i = 0; i < self->size; i++, off += elem_size) {
  315. void* to_mem = (uint8_t *)new_rptfield_self->elements + off;
  316. void* from_mem = (uint8_t *)self->elements + off;
  317. native_slot_dup(field_type, to_mem, from_mem);
  318. new_rptfield_self->size++;
  319. }
  320. return new_rptfield;
  321. }
  322. // Internal only: used by Google::Protobuf.deep_copy.
  323. VALUE RepeatedField_deep_copy(VALUE _self) {
  324. RepeatedField* self = ruby_to_RepeatedField(_self);
  325. VALUE new_rptfield = RepeatedField_new_this_type(_self);
  326. RepeatedField* new_rptfield_self = ruby_to_RepeatedField(new_rptfield);
  327. upb_fieldtype_t field_type = self->field_type;
  328. size_t elem_size = native_slot_size(field_type);
  329. size_t off = 0;
  330. RepeatedField_reserve(new_rptfield_self, self->size);
  331. for (int i = 0; i < self->size; i++, off += elem_size) {
  332. void* to_mem = (uint8_t *)new_rptfield_self->elements + off;
  333. void* from_mem = (uint8_t *)self->elements + off;
  334. native_slot_deep_copy(field_type, to_mem, from_mem);
  335. new_rptfield_self->size++;
  336. }
  337. return new_rptfield;
  338. }
  339. /*
  340. * call-seq:
  341. * RepeatedField.to_ary => array
  342. *
  343. * Used when converted implicitly into array, e.g. compared to an Array.
  344. * Also called as a fallback of Object#to_a
  345. */
  346. VALUE RepeatedField_to_ary(VALUE _self) {
  347. RepeatedField* self = ruby_to_RepeatedField(_self);
  348. upb_fieldtype_t field_type = self->field_type;
  349. size_t elem_size = native_slot_size(field_type);
  350. size_t off = 0;
  351. VALUE ary = rb_ary_new2(self->size);
  352. for (int i = 0; i < self->size; i++, off += elem_size) {
  353. void* mem = ((uint8_t *)self->elements) + off;
  354. VALUE elem = native_slot_get(field_type, self->field_type_class, mem);
  355. rb_ary_push(ary, elem);
  356. }
  357. return ary;
  358. }
  359. /*
  360. * call-seq:
  361. * RepeatedField.==(other) => boolean
  362. *
  363. * Compares this repeated field to another. Repeated fields are equal if their
  364. * element types are equal, their lengths are equal, and each element is equal.
  365. * Elements are compared as per normal Ruby semantics, by calling their :==
  366. * methods (or performing a more efficient comparison for primitive types).
  367. *
  368. * Repeated fields with dissimilar element types are never equal, even if value
  369. * comparison (for example, between integers and floats) would have otherwise
  370. * indicated that every element has equal value.
  371. */
  372. VALUE RepeatedField_eq(VALUE _self, VALUE _other) {
  373. RepeatedField* self;
  374. RepeatedField* other;
  375. if (_self == _other) {
  376. return Qtrue;
  377. }
  378. if (TYPE(_other) == T_ARRAY) {
  379. VALUE self_ary = RepeatedField_to_ary(_self);
  380. return rb_equal(self_ary, _other);
  381. }
  382. self = ruby_to_RepeatedField(_self);
  383. other = ruby_to_RepeatedField(_other);
  384. if (self->field_type != other->field_type ||
  385. self->field_type_class != other->field_type_class ||
  386. self->size != other->size) {
  387. return Qfalse;
  388. }
  389. {
  390. upb_fieldtype_t field_type = self->field_type;
  391. size_t elem_size = native_slot_size(field_type);
  392. size_t off = 0;
  393. for (int i = 0; i < self->size; i++, off += elem_size) {
  394. void* self_mem = ((uint8_t *)self->elements) + off;
  395. void* other_mem = ((uint8_t *)other->elements) + off;
  396. if (!native_slot_eq(field_type, self_mem, other_mem)) {
  397. return Qfalse;
  398. }
  399. }
  400. return Qtrue;
  401. }
  402. }
  403. /*
  404. * call-seq:
  405. * RepeatedField.hash => hash_value
  406. *
  407. * Returns a hash value computed from this repeated field's elements.
  408. */
  409. VALUE RepeatedField_hash(VALUE _self) {
  410. RepeatedField* self = ruby_to_RepeatedField(_self);
  411. st_index_t h = rb_hash_start(0);
  412. VALUE hash_sym = rb_intern("hash");
  413. upb_fieldtype_t field_type = self->field_type;
  414. VALUE field_type_class = self->field_type_class;
  415. size_t elem_size = native_slot_size(field_type);
  416. size_t off = 0;
  417. for (int i = 0; i < self->size; i++, off += elem_size) {
  418. void* mem = ((uint8_t *)self->elements) + off;
  419. VALUE elem = native_slot_get(field_type, field_type_class, mem);
  420. h = rb_hash_uint(h, NUM2LONG(rb_funcall(elem, hash_sym, 0)));
  421. }
  422. h = rb_hash_end(h);
  423. return INT2FIX(h);
  424. }
  425. /*
  426. * call-seq:
  427. * RepeatedField.+(other) => repeated field
  428. *
  429. * Returns a new repeated field that contains the concatenated list of this
  430. * repeated field's elements and other's elements. The other (second) list may
  431. * be either another repeated field or a Ruby array.
  432. */
  433. VALUE RepeatedField_plus(VALUE _self, VALUE list) {
  434. VALUE dupped = RepeatedField_dup(_self);
  435. if (TYPE(list) == T_ARRAY) {
  436. for (int i = 0; i < RARRAY_LEN(list); i++) {
  437. VALUE elem = rb_ary_entry(list, i);
  438. RepeatedField_push(dupped, elem);
  439. }
  440. } else if (RB_TYPE_P(list, T_DATA) && RTYPEDDATA_P(list) &&
  441. RTYPEDDATA_TYPE(list) == &RepeatedField_type) {
  442. RepeatedField* self = ruby_to_RepeatedField(_self);
  443. RepeatedField* list_rptfield = ruby_to_RepeatedField(list);
  444. if (self->field_type != list_rptfield->field_type ||
  445. self->field_type_class != list_rptfield->field_type_class) {
  446. rb_raise(rb_eArgError,
  447. "Attempt to append RepeatedField with different element type.");
  448. }
  449. for (int i = 0; i < list_rptfield->size; i++) {
  450. void* mem = RepeatedField_index_native(list, i);
  451. RepeatedField_push_native(dupped, mem);
  452. }
  453. } else {
  454. rb_raise(rb_eArgError, "Unknown type appending to RepeatedField");
  455. }
  456. return dupped;
  457. }
  458. /*
  459. * call-seq:
  460. * RepeatedField.concat(other) => self
  461. *
  462. * concats the passed in array to self. Returns a Ruby array.
  463. */
  464. VALUE RepeatedField_concat(VALUE _self, VALUE list) {
  465. Check_Type(list, T_ARRAY);
  466. for (int i = 0; i < RARRAY_LEN(list); i++) {
  467. RepeatedField_push(_self, rb_ary_entry(list, i));
  468. }
  469. return _self;
  470. }
  471. void validate_type_class(upb_fieldtype_t type, VALUE klass) {
  472. if (rb_ivar_get(klass, descriptor_instancevar_interned) == Qnil) {
  473. rb_raise(rb_eArgError,
  474. "Type class has no descriptor. Please pass a "
  475. "class or enum as returned by the DescriptorPool.");
  476. }
  477. if (type == UPB_TYPE_MESSAGE) {
  478. VALUE desc = rb_ivar_get(klass, descriptor_instancevar_interned);
  479. if (!RB_TYPE_P(desc, T_DATA) || !RTYPEDDATA_P(desc) ||
  480. RTYPEDDATA_TYPE(desc) != &_Descriptor_type) {
  481. rb_raise(rb_eArgError, "Descriptor has an incorrect type.");
  482. }
  483. if (rb_get_alloc_func(klass) != &Message_alloc) {
  484. rb_raise(rb_eArgError,
  485. "Message class was not returned by the DescriptorPool.");
  486. }
  487. } else if (type == UPB_TYPE_ENUM) {
  488. VALUE enumdesc = rb_ivar_get(klass, descriptor_instancevar_interned);
  489. if (!RB_TYPE_P(enumdesc, T_DATA) || !RTYPEDDATA_P(enumdesc) ||
  490. RTYPEDDATA_TYPE(enumdesc) != &_EnumDescriptor_type) {
  491. rb_raise(rb_eArgError, "Descriptor has an incorrect type.");
  492. }
  493. }
  494. }
  495. void RepeatedField_init_args(int argc, VALUE* argv,
  496. VALUE _self) {
  497. RepeatedField* self = ruby_to_RepeatedField(_self);
  498. VALUE ary = Qnil;
  499. if (argc < 1) {
  500. rb_raise(rb_eArgError, "Expected at least 1 argument.");
  501. }
  502. self->field_type = ruby_to_fieldtype(argv[0]);
  503. if (self->field_type == UPB_TYPE_MESSAGE ||
  504. self->field_type == UPB_TYPE_ENUM) {
  505. if (argc < 2) {
  506. rb_raise(rb_eArgError, "Expected at least 2 arguments for message/enum.");
  507. }
  508. self->field_type_class = argv[1];
  509. if (argc > 2) {
  510. ary = argv[2];
  511. }
  512. validate_type_class(self->field_type, self->field_type_class);
  513. } else {
  514. if (argc > 2) {
  515. rb_raise(rb_eArgError, "Too many arguments: expected 1 or 2.");
  516. }
  517. if (argc > 1) {
  518. ary = argv[1];
  519. }
  520. }
  521. if (ary != Qnil) {
  522. if (!RB_TYPE_P(ary, T_ARRAY)) {
  523. rb_raise(rb_eArgError, "Expected array as initialize argument");
  524. }
  525. for (int i = 0; i < RARRAY_LEN(ary); i++) {
  526. RepeatedField_push(_self, rb_ary_entry(ary, i));
  527. }
  528. }
  529. }
  530. // Mark, free, alloc, init and class setup functions.
  531. void RepeatedField_mark(void* _self) {
  532. RepeatedField* self = (RepeatedField*)_self;
  533. upb_fieldtype_t field_type = self->field_type;
  534. int element_size = native_slot_size(field_type);
  535. rb_gc_mark(self->field_type_class);
  536. for (int i = 0; i < self->size; i++) {
  537. void* memory = (((uint8_t *)self->elements) + i * element_size);
  538. native_slot_mark(self->field_type, memory);
  539. }
  540. }
  541. void RepeatedField_free(void* _self) {
  542. RepeatedField* self = (RepeatedField*)_self;
  543. xfree(self->elements);
  544. xfree(self);
  545. }
  546. /*
  547. * call-seq:
  548. * RepeatedField.new(type, type_class = nil, initial_elems = [])
  549. *
  550. * Creates a new repeated field. The provided type must be a Ruby symbol, and
  551. * can take on the same values as those accepted by FieldDescriptor#type=. If
  552. * the type is :message or :enum, type_class must be non-nil, and must be the
  553. * Ruby class or module returned by Descriptor#msgclass or
  554. * EnumDescriptor#enummodule, respectively. An initial list of elements may also
  555. * be provided.
  556. */
  557. VALUE RepeatedField_alloc(VALUE klass) {
  558. RepeatedField* self = ALLOC(RepeatedField);
  559. self->elements = NULL;
  560. self->size = 0;
  561. self->capacity = 0;
  562. self->field_type = -1;
  563. self->field_type_class = Qnil;
  564. return TypedData_Wrap_Struct(klass, &RepeatedField_type, self);
  565. }
  566. VALUE RepeatedField_init(int argc, VALUE* argv, VALUE self) {
  567. RepeatedField_init_args(argc, argv, self);
  568. return Qnil;
  569. }
  570. void RepeatedField_register(VALUE module) {
  571. VALUE klass = rb_define_class_under(
  572. module, "RepeatedField", rb_cObject);
  573. rb_define_alloc_func(klass, RepeatedField_alloc);
  574. rb_gc_register_address(&cRepeatedField);
  575. cRepeatedField = klass;
  576. rb_define_method(klass, "initialize",
  577. RepeatedField_init, -1);
  578. rb_define_method(klass, "each", RepeatedField_each, 0);
  579. rb_define_method(klass, "[]", RepeatedField_index, -1);
  580. rb_define_method(klass, "at", RepeatedField_index, -1);
  581. rb_define_method(klass, "[]=", RepeatedField_index_set, 2);
  582. rb_define_method(klass, "push", RepeatedField_push_vararg, -2);
  583. rb_define_method(klass, "<<", RepeatedField_push, 1);
  584. rb_define_private_method(klass, "pop_one", RepeatedField_pop_one, 0);
  585. rb_define_method(klass, "replace", RepeatedField_replace, 1);
  586. rb_define_method(klass, "clear", RepeatedField_clear, 0);
  587. rb_define_method(klass, "length", RepeatedField_length, 0);
  588. rb_define_method(klass, "size", RepeatedField_length, 0);
  589. rb_define_method(klass, "dup", RepeatedField_dup, 0);
  590. // Also define #clone so that we don't inherit Object#clone.
  591. rb_define_method(klass, "clone", RepeatedField_dup, 0);
  592. rb_define_method(klass, "==", RepeatedField_eq, 1);
  593. rb_define_method(klass, "to_ary", RepeatedField_to_ary, 0);
  594. rb_define_method(klass, "hash", RepeatedField_hash, 0);
  595. rb_define_method(klass, "+", RepeatedField_plus, 1);
  596. rb_define_method(klass, "concat", RepeatedField_concat, 1);
  597. rb_include_module(klass, rb_mEnumerable);
  598. }