pb_common.c 3.0 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106
  1. /* pb_common.c: Common support functions for pb_encode.c and pb_decode.c.
  2. *
  3. * 2014 Petteri Aimonen <jpa@kapsi.fi>
  4. */
  5. #include "pb_common.h"
  6. bool pb_field_iter_begin(pb_field_iter_t *iter, const pb_field_t *fields, void *dest_struct)
  7. {
  8. iter->start = fields;
  9. iter->pos = fields;
  10. iter->required_field_index = 0;
  11. iter->dest_struct = dest_struct;
  12. if (!dest_struct)
  13. {
  14. iter->pData = NULL;
  15. iter->pSize = NULL;
  16. }
  17. else
  18. {
  19. iter->pData = (char*)dest_struct + iter->pos->data_offset;
  20. iter->pSize = (char*)iter->pData + iter->pos->size_offset;
  21. }
  22. return (iter->pos->tag != 0);
  23. }
  24. bool pb_field_iter_next(pb_field_iter_t *iter)
  25. {
  26. const pb_field_t *prev_field = iter->pos;
  27. if (prev_field->tag == 0)
  28. {
  29. /* Handle empty message types, where the first field is already the terminator.
  30. * In other cases, the iter->pos never points to the terminator. */
  31. return false;
  32. }
  33. iter->pos++;
  34. if (iter->pos->tag == 0)
  35. {
  36. /* Wrapped back to beginning, reinitialize */
  37. (void)pb_field_iter_begin(iter, iter->start, iter->dest_struct);
  38. return false;
  39. }
  40. else
  41. {
  42. /* Increment the pointers based on previous field size */
  43. size_t prev_size = prev_field->data_size;
  44. if (PB_HTYPE(prev_field->type) == PB_HTYPE_ONEOF &&
  45. PB_HTYPE(iter->pos->type) == PB_HTYPE_ONEOF &&
  46. iter->pos->data_offset == PB_SIZE_MAX)
  47. {
  48. /* Don't advance pointers inside unions */
  49. return true;
  50. }
  51. else if (PB_ATYPE(prev_field->type) == PB_ATYPE_STATIC &&
  52. PB_HTYPE(prev_field->type) == PB_HTYPE_REPEATED)
  53. {
  54. /* In static arrays, the data_size tells the size of a single entry and
  55. * array_size is the number of entries */
  56. prev_size *= prev_field->array_size;
  57. }
  58. else if (PB_ATYPE(prev_field->type) == PB_ATYPE_POINTER)
  59. {
  60. /* Pointer fields always have a constant size in the main structure.
  61. * The data_size only applies to the dynamically allocated area. */
  62. prev_size = sizeof(void*);
  63. }
  64. if (PB_HTYPE(prev_field->type) == PB_HTYPE_REQUIRED)
  65. {
  66. /* Count the required fields, in order to check their presence in the
  67. * decoder. */
  68. iter->required_field_index++;
  69. }
  70. iter->pData = (char*)iter->pData + prev_size + iter->pos->data_offset;
  71. iter->pSize = (char*)iter->pData + iter->pos->size_offset;
  72. return true;
  73. }
  74. }
  75. bool pb_field_iter_find(pb_field_iter_t *iter, uint32_t tag)
  76. {
  77. const pb_field_t *start = iter->pos;
  78. do {
  79. if (iter->pos->tag == tag &&
  80. PB_LTYPE(iter->pos->type) != PB_LTYPE_EXTENSION)
  81. {
  82. /* Found the wanted field */
  83. return true;
  84. }
  85. (void)pb_field_iter_next(iter);
  86. } while (iter->pos != start);
  87. /* Searched all the way back to start, and found nothing. */
  88. return false;
  89. }