lzio.c 1.6 KB

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