file.cc 1.4 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950
  1. /* Copyright (c) 2017, Google Inc.
  2. *
  3. * Permission to use, copy, modify, and/or distribute this software for any
  4. * purpose with or without fee is hereby granted, provided that the above
  5. * copyright notice and this permission notice appear in all copies.
  6. *
  7. * THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
  8. * WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
  9. * MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY
  10. * SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
  11. * WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION
  12. * OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF OR IN
  13. * CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE. */
  14. #include <stdio.h>
  15. #include <algorithm>
  16. #include <vector>
  17. #include "internal.h"
  18. bool ReadAll(std::vector<uint8_t> *out, FILE *file) {
  19. out->clear();
  20. constexpr size_t kMaxSize = 1024 * 1024;
  21. size_t len = 0;
  22. out->resize(128);
  23. for (;;) {
  24. len += fread(out->data() + len, 1, out->size() - len, file);
  25. if (feof(file)) {
  26. out->resize(len);
  27. return true;
  28. }
  29. if (ferror(file)) {
  30. return false;
  31. }
  32. if (len == out->size()) {
  33. if (out->size() == kMaxSize) {
  34. fprintf(stderr, "Input too large.\n");
  35. return false;
  36. }
  37. size_t cap = std::min(out->size() * 2, kMaxSize);
  38. out->resize(cap);
  39. }
  40. }
  41. }