fuzz_data_producer.c 2.5 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889
  1. /*
  2. * Copyright (c) 2016-2021, Facebook, Inc.
  3. * All rights reserved.
  4. *
  5. * This source code is licensed under both the BSD-style license (found in the
  6. * LICENSE file in the root directory of this source tree) and the GPLv2 (found
  7. * in the COPYING file in the root directory of this source tree).
  8. * You may select, at your option, one of the above-listed licenses.
  9. */
  10. #include "fuzz_data_producer.h"
  11. struct FUZZ_dataProducer_s{
  12. const uint8_t *data;
  13. size_t size;
  14. };
  15. FUZZ_dataProducer_t *FUZZ_dataProducer_create(const uint8_t *data, size_t size) {
  16. FUZZ_dataProducer_t *producer = FUZZ_malloc(sizeof(FUZZ_dataProducer_t));
  17. producer->data = data;
  18. producer->size = size;
  19. return producer;
  20. }
  21. void FUZZ_dataProducer_free(FUZZ_dataProducer_t *producer) { free(producer); }
  22. uint32_t FUZZ_dataProducer_uint32Range(FUZZ_dataProducer_t *producer, uint32_t min,
  23. uint32_t max) {
  24. FUZZ_ASSERT(min <= max);
  25. uint32_t range = max - min;
  26. uint32_t rolling = range;
  27. uint32_t result = 0;
  28. while (rolling > 0 && producer->size > 0) {
  29. uint8_t next = *(producer->data + producer->size - 1);
  30. producer->size -= 1;
  31. result = (result << 8) | next;
  32. rolling >>= 8;
  33. }
  34. if (range == 0xffffffff) {
  35. return result;
  36. }
  37. return min + result % (range + 1);
  38. }
  39. uint32_t FUZZ_dataProducer_uint32(FUZZ_dataProducer_t *producer) {
  40. return FUZZ_dataProducer_uint32Range(producer, 0, 0xffffffff);
  41. }
  42. int32_t FUZZ_dataProducer_int32Range(FUZZ_dataProducer_t *producer,
  43. int32_t min, int32_t max)
  44. {
  45. FUZZ_ASSERT(min <= max);
  46. if (min < 0)
  47. return (int)FUZZ_dataProducer_uint32Range(producer, 0, max - min) + min;
  48. return FUZZ_dataProducer_uint32Range(producer, min, max);
  49. }
  50. size_t FUZZ_dataProducer_remainingBytes(FUZZ_dataProducer_t *producer){
  51. return producer->size;
  52. }
  53. int FUZZ_dataProducer_empty(FUZZ_dataProducer_t *producer) {
  54. return producer->size == 0;
  55. }
  56. size_t FUZZ_dataProducer_contract(FUZZ_dataProducer_t *producer, size_t newSize)
  57. {
  58. newSize = newSize > producer->size ? producer->size : newSize;
  59. size_t remaining = producer->size - newSize;
  60. producer->data = producer->data + remaining;
  61. producer->size = newSize;
  62. return remaining;
  63. }
  64. size_t FUZZ_dataProducer_reserveDataPrefix(FUZZ_dataProducer_t *producer)
  65. {
  66. size_t producerSliceSize = FUZZ_dataProducer_uint32Range(
  67. producer, 0, producer->size);
  68. return FUZZ_dataProducer_contract(producer, producerSliceSize);
  69. }