filter-leech.c 2.1 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576
  1. // Copyright (C) 2004-2021 Artifex Software, Inc.
  2. //
  3. // This file is part of MuPDF.
  4. //
  5. // MuPDF is free software: you can redistribute it and/or modify it under the
  6. // terms of the GNU Affero General Public License as published by the Free
  7. // Software Foundation, either version 3 of the License, or (at your option)
  8. // any later version.
  9. //
  10. // MuPDF is distributed in the hope that it will be useful, but WITHOUT ANY
  11. // WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS
  12. // FOR A PARTICULAR PURPOSE. See the GNU Affero General Public License for more
  13. // details.
  14. //
  15. // You should have received a copy of the GNU Affero General Public License
  16. // along with MuPDF. If not, see <https://www.gnu.org/licenses/agpl-3.0.en.html>
  17. //
  18. // Alternative licensing terms are available from the licensor.
  19. // For commercial licensing, see <https://www.artifex.com/> or contact
  20. // Artifex Software, Inc., 39 Mesa Street, Suite 108A, San Francisco,
  21. // CA 94129, USA, for further information.
  22. #include "mupdf/fitz.h"
  23. #include <zlib.h>
  24. #include <string.h>
  25. typedef struct
  26. {
  27. fz_stream *chain;
  28. fz_buffer *buffer;
  29. } fz_leech;
  30. static int
  31. next_leech(fz_context *ctx, fz_stream *stm, size_t max)
  32. {
  33. fz_leech *state = stm->state;
  34. fz_buffer *buffer = state->buffer;
  35. size_t n = fz_available(ctx, state->chain, max);
  36. if (n > max)
  37. n = max;
  38. while (buffer->cap < buffer->len + n)
  39. {
  40. fz_grow_buffer(ctx, state->buffer);
  41. }
  42. memcpy(buffer->data + buffer->len, state->chain->rp, n);
  43. stm->rp = buffer->data + buffer->len;
  44. stm->wp = buffer->data + buffer->len + n;
  45. state->chain->rp += n;
  46. buffer->len += n;
  47. if (n == 0)
  48. return EOF;
  49. return *stm->rp++;
  50. }
  51. static void
  52. close_leech(fz_context *ctx, void *state_)
  53. {
  54. fz_leech *state = (fz_leech *)state_;
  55. fz_drop_stream(ctx, state->chain);
  56. fz_drop_buffer(ctx, state->buffer);
  57. fz_free(ctx, state);
  58. }
  59. fz_stream *
  60. fz_open_leecher(fz_context *ctx, fz_stream *chain, fz_buffer *buffer)
  61. {
  62. fz_leech *state = fz_malloc_struct(ctx, fz_leech);
  63. state->chain = fz_keep_stream(ctx, chain);
  64. state->buffer = fz_keep_buffer(ctx, buffer);
  65. return fz_new_stream(ctx, state, next_leech, close_leech);
  66. }