1997-06-16 20:50:22 +04:00
|
|
|
/*
|
2002-12-04 20:38:31 +03:00
|
|
|
** $Id: lzio.c,v 1.22 2002/10/08 18:46:08 roberto Exp roberto $
|
1997-09-16 23:25:59 +04:00
|
|
|
** a generic input stream interface
|
|
|
|
** See Copyright Notice in lua.h
|
1997-06-16 20:50:22 +04:00
|
|
|
*/
|
|
|
|
|
1997-09-16 23:25:59 +04:00
|
|
|
|
1997-06-16 20:50:22 +04:00
|
|
|
#include <string.h>
|
1997-09-16 23:25:59 +04:00
|
|
|
|
2002-12-04 20:38:31 +03:00
|
|
|
#define lzio_c
|
|
|
|
|
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"
|
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;
|
2002-08-06 21:26:45 +04:00
|
|
|
const char *buff = z->reader(NULL, z->data, &size);
|
2002-06-03 21:46:34 +04:00
|
|
|
if (buff == NULL || size == 0) return EOZ;
|
|
|
|
z->n = size - 1;
|
|
|
|
z->p = buff;
|
1999-08-17 00:52:00 +04:00
|
|
|
return *(z->p++);
|
1997-06-16 20:50:22 +04:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2002-06-04 00:11:07 +04:00
|
|
|
int luaZ_lookahead (ZIO *z) {
|
|
|
|
if (z->n == 0) {
|
|
|
|
int c = luaZ_fill(z);
|
|
|
|
if (c == EOZ) return c;
|
|
|
|
z->n++;
|
|
|
|
z->p--;
|
|
|
|
}
|
|
|
|
return *z->p;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2002-06-06 16:40:22 +04:00
|
|
|
void luaZ_init (ZIO *z, lua_Chunkreader reader, void *data, const char *name) {
|
|
|
|
z->reader = reader;
|
|
|
|
z->data = data;
|
1999-08-17 00:52:00 +04:00
|
|
|
z->name = name;
|
2002-06-03 21:46:34 +04:00
|
|
|
z->n = 0;
|
|
|
|
z->p = NULL;
|
1997-06-16 20:50:22 +04:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
/* --------------------------------------------------------------- read --- */
|
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;
|
1997-06-16 20:50:22 +04:00
|
|
|
if (z->n == 0) {
|
2002-06-03 21:46:34 +04:00
|
|
|
if (luaZ_fill(z) == EOZ)
|
1999-02-26 00:07:26 +03:00
|
|
|
return n; /* return number of missing bytes */
|
2001-03-26 18:31:49 +04:00
|
|
|
else {
|
|
|
|
++z->n; /* filbuf removed first byte; put back it */
|
|
|
|
--z->p;
|
|
|
|
}
|
1997-06-16 20:50:22 +04:00
|
|
|
}
|
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
|
|
|
|
2002-10-08 22:46:08 +04:00
|
|
|
/* ------------------------------------------------------------------------ */
|
|
|
|
char *luaZ_openspace (lua_State *L, Mbuffer *buff, size_t n) {
|
|
|
|
if (n > buff->buffsize) {
|
|
|
|
if (n < LUA_MINBUFFER) n = LUA_MINBUFFER;
|
|
|
|
luaM_reallocvector(L, buff->buffer, buff->buffsize, n, char);
|
|
|
|
buff->buffsize = n;
|
|
|
|
}
|
|
|
|
return buff->buffer;
|
|
|
|
}
|
|
|
|
|
|
|
|
|