avb_hashtree_descriptor.c 2.9 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970
  1. /*
  2. * Copyright (C) 2016 The Android Open Source Project
  3. *
  4. * Permission is hereby granted, free of charge, to any person
  5. * obtaining a copy of this software and associated documentation
  6. * files (the "Software"), to deal in the Software without
  7. * restriction, including without limitation the rights to use, copy,
  8. * modify, merge, publish, distribute, sublicense, and/or sell copies
  9. * of the Software, and to permit persons to whom the Software is
  10. * furnished to do so, subject to the following conditions:
  11. *
  12. * The above copyright notice and this permission notice shall be
  13. * included in all copies or substantial portions of the Software.
  14. *
  15. * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
  16. * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
  17. * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
  18. * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS
  19. * BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN
  20. * ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
  21. * CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
  22. * SOFTWARE.
  23. */
  24. #include "avb_hashtree_descriptor.h"
  25. #include "avb_util.h"
  26. bool avb_hashtree_descriptor_validate_and_byteswap(
  27. const AvbHashtreeDescriptor* src, AvbHashtreeDescriptor* dest) {
  28. uint64_t expected_size;
  29. avb_memcpy(dest, src, sizeof(AvbHashtreeDescriptor));
  30. if (!avb_descriptor_validate_and_byteswap((const AvbDescriptor*)src,
  31. (AvbDescriptor*)dest))
  32. return false;
  33. if (dest->parent_descriptor.tag != AVB_DESCRIPTOR_TAG_HASHTREE) {
  34. avb_error("Invalid tag for hashtree descriptor.\n");
  35. return false;
  36. }
  37. dest->dm_verity_version = avb_be32toh(dest->dm_verity_version);
  38. dest->image_size = avb_be64toh(dest->image_size);
  39. dest->tree_offset = avb_be64toh(dest->tree_offset);
  40. dest->tree_size = avb_be64toh(dest->tree_size);
  41. dest->data_block_size = avb_be32toh(dest->data_block_size);
  42. dest->hash_block_size = avb_be32toh(dest->hash_block_size);
  43. dest->fec_num_roots = avb_be32toh(dest->fec_num_roots);
  44. dest->fec_offset = avb_be64toh(dest->fec_offset);
  45. dest->fec_size = avb_be64toh(dest->fec_size);
  46. dest->partition_name_len = avb_be32toh(dest->partition_name_len);
  47. dest->salt_len = avb_be32toh(dest->salt_len);
  48. dest->root_digest_len = avb_be32toh(dest->root_digest_len);
  49. dest->flags = avb_be32toh(dest->flags);
  50. /* Check that partition_name, salt, and root_digest are fully contained. */
  51. expected_size = sizeof(AvbHashtreeDescriptor) - sizeof(AvbDescriptor);
  52. if (!avb_safe_add_to(&expected_size, dest->partition_name_len) ||
  53. !avb_safe_add_to(&expected_size, dest->salt_len) ||
  54. !avb_safe_add_to(&expected_size, dest->root_digest_len)) {
  55. avb_error("Overflow while adding up sizes.\n");
  56. return false;
  57. }
  58. if (expected_size > dest->parent_descriptor.num_bytes_following) {
  59. avb_error("Descriptor payload size overflow.\n");
  60. return false;
  61. }
  62. return true;
  63. }