1997-06-16 20:50:22 +04:00
|
|
|
/*
|
2018-08-23 20:26:12 +03:00
|
|
|
** $Id: lzio.c $
|
2012-05-14 17:34:18 +04:00
|
|
|
** Buffered streams
|
1997-09-16 23:25:59 +04:00
|
|
|
** See Copyright Notice in lua.h
|
1997-06-16 20:50:22 +04:00
|
|
|
*/
|
|
|
|
|
2002-12-04 20:38:31 +03:00
|
|
|
#define lzio_c
|
2004-05-01 00:13:38 +04:00
|
|
|
#define LUA_CORE
|
2002-12-04 20:38:31 +03:00
|
|
|
|
2014-11-02 22:19:04 +03:00
|
|
|
#include "lprefix.h"
|
|
|
|
|
|
|
|
|
|
|
|
#include <string.h>
|
|
|
|
|
2000-06-12 17:52:05 +04:00
|
|
|
#include "lua.h"
|
|
|
|
|
2002-06-03 21:46:34 +04:00
|
|
|
#include "llimits.h"
|
2002-10-08 22:46:08 +04:00
|
|
|
#include "lmem.h"
|
2003-08-28 00:57:52 +04:00
|
|
|
#include "lstate.h"
|
1997-09-16 23:25:59 +04:00
|
|
|
#include "lzio.h"
|
|
|
|
|
1997-06-16 20:50:22 +04:00
|
|
|
|
2002-06-03 21:46:34 +04:00
|
|
|
int luaZ_fill (ZIO *z) {
|
|
|
|
size_t size;
|
2003-08-28 00:57:52 +04:00
|
|
|
lua_State *L = z->L;
|
|
|
|
const char *buff;
|
|
|
|
lua_unlock(L);
|
|
|
|
buff = z->reader(L, z->data, &size);
|
|
|
|
lua_lock(L);
|
2011-02-23 16:13:10 +03:00
|
|
|
if (buff == NULL || size == 0)
|
2011-02-17 20:34:16 +03:00
|
|
|
return EOZ;
|
2011-02-23 16:13:10 +03:00
|
|
|
z->n = size - 1; /* discount char being returned */
|
2002-06-03 21:46:34 +04:00
|
|
|
z->p = buff;
|
2011-07-15 16:35:32 +04:00
|
|
|
return cast_uchar(*(z->p++));
|
1997-06-16 20:50:22 +04:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2005-05-17 23:49:15 +04:00
|
|
|
void luaZ_init (lua_State *L, ZIO *z, lua_Reader reader, void *data) {
|
2003-08-26 00:00:50 +04:00
|
|
|
z->L = L;
|
2002-06-06 16:40:22 +04:00
|
|
|
z->reader = reader;
|
|
|
|
z->data = data;
|
2002-06-03 21:46:34 +04:00
|
|
|
z->n = 0;
|
|
|
|
z->p = NULL;
|
1997-06-16 20:50:22 +04:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
/* --------------------------------------------------------------- read --- */
|
2023-09-05 21:30:45 +03:00
|
|
|
|
|
|
|
static int checkbuffer (ZIO *z) {
|
|
|
|
if (z->n == 0) { /* no bytes in buffer? */
|
|
|
|
if (luaZ_fill(z) == EOZ) /* try to read more */
|
|
|
|
return 0; /* no more input */
|
|
|
|
else {
|
|
|
|
z->n++; /* luaZ_fill consumed first byte; put it back */
|
|
|
|
z->p--;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return 1; /* now buffer has something */
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2002-08-05 22:45:02 +04:00
|
|
|
size_t luaZ_read (ZIO *z, void *b, size_t n) {
|
1997-06-16 20:50:22 +04:00
|
|
|
while (n) {
|
2000-05-24 17:54:49 +04:00
|
|
|
size_t m;
|
2023-09-05 21:30:45 +03:00
|
|
|
if (!checkbuffer(z))
|
|
|
|
return n; /* no more input; return number of missing bytes */
|
1999-02-26 00:07:26 +03:00
|
|
|
m = (n <= z->n) ? n : z->n; /* min. between n and z->n */
|
1997-06-16 20:50:22 +04:00
|
|
|
memcpy(b, z->p, m);
|
|
|
|
z->n -= m;
|
|
|
|
z->p += m;
|
|
|
|
b = (char *)b + m;
|
|
|
|
n -= m;
|
|
|
|
}
|
|
|
|
return 0;
|
|
|
|
}
|
2002-06-03 21:46:34 +04:00
|
|
|
|
2023-09-05 21:30:45 +03:00
|
|
|
|
|
|
|
const void *luaZ_getaddr (ZIO* z, size_t n) {
|
|
|
|
const void *res;
|
|
|
|
if (!checkbuffer(z))
|
|
|
|
return NULL; /* no more input */
|
|
|
|
if (z->n < n) /* not enough bytes? */
|
|
|
|
return NULL; /* block not whole; cannot give an address */
|
|
|
|
res = z->p; /* get block address */
|
|
|
|
z->n -= n; /* consume these bytes */
|
|
|
|
z->p += n;
|
|
|
|
return res;
|
|
|
|
}
|