lzio.c 1.6 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384
  1. /*
  2. ** $Id: lzio.c,v 1.31.1.1 2007/12/27 13:02:25 roberto Exp $
  3. ** a generic input stream interface
  4. ** See Copyright Notice in lua.h
  5. */
  6. #if 0
  7. #include <string.h>
  8. #endif
  9. #define lzio_c
  10. #define LUA_CORE
  11. #include "lua.h"
  12. #include "llimits.h"
  13. #include "lmem.h"
  14. #include "lstate.h"
  15. #include "lzio.h"
  16. int luaZ_fill (ZIO *z) {
  17. size_t size;
  18. lua_State *L = z->L;
  19. const char *buff;
  20. lua_unlock(L);
  21. buff = z->reader(L, z->data, &size);
  22. lua_lock(L);
  23. if (buff == NULL || size == 0) return EOZ;
  24. z->n = size - 1;
  25. z->p = buff;
  26. return char2int(*(z->p++));
  27. }
  28. int luaZ_lookahead (ZIO *z) {
  29. if (z->n == 0) {
  30. if (luaZ_fill(z) == EOZ)
  31. return EOZ;
  32. else {
  33. z->n++; /* luaZ_fill removed first byte; put back it */
  34. z->p--;
  35. }
  36. }
  37. return char2int(*z->p);
  38. }
  39. void luaZ_init (lua_State *L, ZIO *z, lua_Reader reader, void *data) {
  40. z->L = L;
  41. z->reader = reader;
  42. z->data = data;
  43. z->n = 0;
  44. z->p = NULL;
  45. }
  46. /* --------------------------------------------------------------- read --- */
  47. size_t luaZ_read (ZIO *z, void *b, size_t n) {
  48. while (n) {
  49. size_t m;
  50. if (luaZ_lookahead(z) == EOZ)
  51. return n; /* return number of missing bytes */
  52. m = (n <= z->n) ? n : z->n; /* min. between n and z->n */
  53. memcpy(b, z->p, m);
  54. z->n -= m;
  55. z->p += m;
  56. b = (char *)b + m;
  57. n -= m;
  58. }
  59. return 0;
  60. }
  61. /* ------------------------------------------------------------------------ */
  62. char *luaZ_openspace (lua_State *L, Mbuffer *buff, size_t n) {
  63. if (n > buff->buffsize) {
  64. if (n < LUA_MINBUFFER) n = LUA_MINBUFFER;
  65. luaZ_resizebuffer(L, buff, n);
  66. }
  67. return buff->buffer;
  68. }