lzio.c 1.6 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485
  1. /*
  2. ** $Id: lzio.c,v 1.27 2003/08/27 20:57:52 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 "lstate.h"
  12. #include "lzio.h"
  13. int luaZ_fill (ZIO *z) {
  14. size_t size;
  15. lua_State *L = z->L;
  16. const char *buff;
  17. lua_unlock(L);
  18. buff = z->reader(L, z->data, &size);
  19. lua_lock(L);
  20. if (buff == NULL || size == 0) return EOZ;
  21. z->n = size - 1;
  22. z->p = buff;
  23. return char2int(*(z->p++));
  24. }
  25. int luaZ_lookahead (ZIO *z) {
  26. if (z->n == 0) {
  27. int c = luaZ_fill(z);
  28. if (c == EOZ) return c;
  29. z->n++;
  30. z->p--;
  31. }
  32. return char2int(*z->p);
  33. }
  34. void luaZ_init (lua_State *L, ZIO *z, lua_Chunkreader reader, void *data) {
  35. z->L = L;
  36. z->reader = reader;
  37. z->data = data;
  38. z->n = 0;
  39. z->p = NULL;
  40. }
  41. /* --------------------------------------------------------------- read --- */
  42. size_t luaZ_read (ZIO *z, void *b, size_t n) {
  43. while (n) {
  44. size_t m;
  45. if (z->n == 0) {
  46. if (luaZ_fill(z) == EOZ)
  47. return n; /* return number of missing bytes */
  48. else {
  49. ++z->n; /* filbuf removed first byte; put back it */
  50. --z->p;
  51. }
  52. }
  53. m = (n <= z->n) ? n : z->n; /* min. between n and z->n */
  54. memcpy(b, z->p, m);
  55. z->n -= m;
  56. z->p += m;
  57. b = (char *)b + m;
  58. n -= m;
  59. }
  60. return 0;
  61. }
  62. /* ------------------------------------------------------------------------ */
  63. char *luaZ_openspace (lua_State *L, Mbuffer *buff, size_t n) {
  64. if (n > buff->buffsize) {
  65. if (n < LUA_MINBUFFER) n = LUA_MINBUFFER;
  66. luaZ_resizebuffer(L, buff, n);
  67. }
  68. return buff->buffer;
  69. }