|
|
@@ -0,0 +1,427 @@
|
|
|
+/* http://www.inf.puc-rio.br/~roberto/struct/
|
|
|
+** {======================================================
|
|
|
+** Library for packing/unpacking structures.
|
|
|
+** $Id: struct.c,v 1.8 2018/05/16 11:00:23 roberto Exp $
|
|
|
+** See Copyright Notice at the end of this file
|
|
|
+** =======================================================
|
|
|
+*/
|
|
|
+/*
|
|
|
+** Valid formats:
|
|
|
+** > - big endian
|
|
|
+** < - little endian
|
|
|
+** ![num] - alignment
|
|
|
+** x - pading
|
|
|
+** b/B - signed/unsigned byte
|
|
|
+** h/H - signed/unsigned short
|
|
|
+** l/L - signed/unsigned long
|
|
|
+** T - size_t
|
|
|
+** i/In - signed/unsigned integer with size 'n' (default is size of int)
|
|
|
+** cn - sequence of 'n' chars (from/to a string); when packing, n==0 means
|
|
|
+ the whole string; when unpacking, n==0 means use the previous
|
|
|
+ read number as the string length
|
|
|
+** s - zero-terminated string
|
|
|
+** f - float
|
|
|
+** d - double
|
|
|
+** ' ' - ignored
|
|
|
+*/
|
|
|
+
|
|
|
+
|
|
|
+#include <ctype.h>
|
|
|
+#include <limits.h>
|
|
|
+#include <stddef.h>
|
|
|
+#include <string.h>
|
|
|
+
|
|
|
+
|
|
|
+#include "lua.h"
|
|
|
+#include "lauxlib.h"
|
|
|
+
|
|
|
+
|
|
|
+#if (LUA_VERSION_NUM >= 502)
|
|
|
+
|
|
|
+#define luaL_register(L,n,f) luaL_newlib(L,f)
|
|
|
+
|
|
|
+#endif
|
|
|
+
|
|
|
+
|
|
|
+/* basic integer type */
|
|
|
+#if !defined(STRUCT_INT)
|
|
|
+#define STRUCT_INT long
|
|
|
+#endif
|
|
|
+
|
|
|
+typedef STRUCT_INT Inttype;
|
|
|
+
|
|
|
+/* corresponding unsigned version */
|
|
|
+typedef unsigned STRUCT_INT Uinttype;
|
|
|
+
|
|
|
+
|
|
|
+/* maximum size (in bytes) for integral types */
|
|
|
+#define MAXINTSIZE 32
|
|
|
+
|
|
|
+/* is 'x' a power of 2? */
|
|
|
+#define isp2(x) ((x) > 0 && ((x) & ((x) - 1)) == 0)
|
|
|
+
|
|
|
+/* dummy structure to get alignment requirements */
|
|
|
+struct cD {
|
|
|
+ char c;
|
|
|
+ double d;
|
|
|
+};
|
|
|
+
|
|
|
+
|
|
|
+#define PADDING (sizeof(struct cD) - sizeof(double))
|
|
|
+#define MAXALIGN (PADDING > sizeof(int) ? PADDING : sizeof(int))
|
|
|
+
|
|
|
+
|
|
|
+/* endian options */
|
|
|
+#define BIG 0
|
|
|
+#define LITTLE 1
|
|
|
+
|
|
|
+
|
|
|
+static union {
|
|
|
+ int dummy;
|
|
|
+ char endian;
|
|
|
+} const native = {1};
|
|
|
+
|
|
|
+
|
|
|
+typedef struct Header {
|
|
|
+ int endian;
|
|
|
+ int align;
|
|
|
+} Header;
|
|
|
+
|
|
|
+
|
|
|
+static int getnum (const char **fmt, int df) {
|
|
|
+ if (!isdigit(**fmt)) /* no number? */
|
|
|
+ return df; /* return default value */
|
|
|
+ else {
|
|
|
+ int a = 0;
|
|
|
+ do {
|
|
|
+ a = a*10 + *((*fmt)++) - '0';
|
|
|
+ } while (isdigit(**fmt));
|
|
|
+ return a;
|
|
|
+ }
|
|
|
+}
|
|
|
+
|
|
|
+
|
|
|
+#define defaultoptions(h) ((h)->endian = native.endian, (h)->align = 1)
|
|
|
+
|
|
|
+
|
|
|
+
|
|
|
+static size_t optsize (lua_State *L, char opt, const char **fmt) {
|
|
|
+ switch (opt) {
|
|
|
+ case 'B': case 'b': return sizeof(char);
|
|
|
+ case 'H': case 'h': return sizeof(short);
|
|
|
+ case 'L': case 'l': return sizeof(long);
|
|
|
+ case 'T': return sizeof(size_t);
|
|
|
+ case 'f': return sizeof(float);
|
|
|
+ case 'd': return sizeof(double);
|
|
|
+ case 'x': return 1;
|
|
|
+ case 'c': return getnum(fmt, 1);
|
|
|
+ case 'i': case 'I': {
|
|
|
+ int sz = getnum(fmt, sizeof(int));
|
|
|
+ if (sz > MAXINTSIZE)
|
|
|
+ luaL_error(L, "integral size %d is larger than limit of %d",
|
|
|
+ sz, MAXINTSIZE);
|
|
|
+ return sz;
|
|
|
+ }
|
|
|
+ default: return 0; /* other cases do not need alignment */
|
|
|
+ }
|
|
|
+}
|
|
|
+
|
|
|
+
|
|
|
+/*
|
|
|
+** return number of bytes needed to align an element of size 'size'
|
|
|
+** at current position 'len'
|
|
|
+*/
|
|
|
+static int gettoalign (size_t len, Header *h, int opt, size_t size) {
|
|
|
+ if (size == 0 || opt == 'c') return 0;
|
|
|
+ if (size > (size_t)h->align)
|
|
|
+ size = h->align; /* respect max. alignment */
|
|
|
+ return (size - (len & (size - 1))) & (size - 1);
|
|
|
+}
|
|
|
+
|
|
|
+
|
|
|
+/*
|
|
|
+** options to control endianess and alignment
|
|
|
+*/
|
|
|
+static void controloptions (lua_State *L, int opt, const char **fmt,
|
|
|
+ Header *h) {
|
|
|
+ switch (opt) {
|
|
|
+ case ' ': return; /* ignore white spaces */
|
|
|
+ case '>': h->endian = BIG; return;
|
|
|
+ case '<': h->endian = LITTLE; return;
|
|
|
+ case '!': {
|
|
|
+ int a = getnum(fmt, MAXALIGN);
|
|
|
+ if (!isp2(a))
|
|
|
+ luaL_error(L, "alignment %d is not a power of 2", a);
|
|
|
+ h->align = a;
|
|
|
+ return;
|
|
|
+ }
|
|
|
+ default: {
|
|
|
+ const char *msg = lua_pushfstring(L, "invalid format option '%c'", opt);
|
|
|
+ luaL_argerror(L, 1, msg);
|
|
|
+ }
|
|
|
+ }
|
|
|
+}
|
|
|
+
|
|
|
+
|
|
|
+static void putinteger (lua_State *L, luaL_Buffer *b, int arg, int endian,
|
|
|
+ int size) {
|
|
|
+ lua_Number n = luaL_checknumber(L, arg);
|
|
|
+ Uinttype value;
|
|
|
+ char buff[MAXINTSIZE];
|
|
|
+ if (n < 0)
|
|
|
+ value = (Uinttype)(Inttype)n;
|
|
|
+ else
|
|
|
+ value = (Uinttype)n;
|
|
|
+ if (endian == LITTLE) {
|
|
|
+ int i;
|
|
|
+ for (i = 0; i < size; i++) {
|
|
|
+ buff[i] = (value & 0xff);
|
|
|
+ value >>= 8;
|
|
|
+ }
|
|
|
+ }
|
|
|
+ else {
|
|
|
+ int i;
|
|
|
+ for (i = size - 1; i >= 0; i--) {
|
|
|
+ buff[i] = (value & 0xff);
|
|
|
+ value >>= 8;
|
|
|
+ }
|
|
|
+ }
|
|
|
+ luaL_addlstring(b, buff, size);
|
|
|
+}
|
|
|
+
|
|
|
+
|
|
|
+static void correctbytes (char *b, int size, int endian) {
|
|
|
+ if (endian != native.endian) {
|
|
|
+ int i = 0;
|
|
|
+ while (i < --size) {
|
|
|
+ char temp = b[i];
|
|
|
+ b[i++] = b[size];
|
|
|
+ b[size] = temp;
|
|
|
+ }
|
|
|
+ }
|
|
|
+}
|
|
|
+
|
|
|
+
|
|
|
+static int b_pack (lua_State *L) {
|
|
|
+ luaL_Buffer b;
|
|
|
+ const char *fmt = luaL_checkstring(L, 1);
|
|
|
+ Header h;
|
|
|
+ int arg = 2;
|
|
|
+ size_t totalsize = 0;
|
|
|
+ defaultoptions(&h);
|
|
|
+ lua_pushnil(L); /* mark to separate arguments from string buffer */
|
|
|
+ luaL_buffinit(L, &b);
|
|
|
+ while (*fmt != '\0') {
|
|
|
+ int opt = *fmt++;
|
|
|
+ size_t size = optsize(L, opt, &fmt);
|
|
|
+ int toalign = gettoalign(totalsize, &h, opt, size);
|
|
|
+ totalsize += toalign;
|
|
|
+ while (toalign-- > 0) luaL_addchar(&b, '\0');
|
|
|
+ switch (opt) {
|
|
|
+ case 'b': case 'B': case 'h': case 'H':
|
|
|
+ case 'l': case 'L': case 'T': case 'i': case 'I': { /* integer types */
|
|
|
+ putinteger(L, &b, arg++, h.endian, size);
|
|
|
+ break;
|
|
|
+ }
|
|
|
+ case 'x': {
|
|
|
+ luaL_addchar(&b, '\0');
|
|
|
+ break;
|
|
|
+ }
|
|
|
+ case 'f': {
|
|
|
+ float f = (float)luaL_checknumber(L, arg++);
|
|
|
+ correctbytes((char *)&f, size, h.endian);
|
|
|
+ luaL_addlstring(&b, (char *)&f, size);
|
|
|
+ break;
|
|
|
+ }
|
|
|
+ case 'd': {
|
|
|
+ double d = luaL_checknumber(L, arg++);
|
|
|
+ correctbytes((char *)&d, size, h.endian);
|
|
|
+ luaL_addlstring(&b, (char *)&d, size);
|
|
|
+ break;
|
|
|
+ }
|
|
|
+ case 'c': case 's': {
|
|
|
+ size_t l;
|
|
|
+ const char *s = luaL_checklstring(L, arg++, &l);
|
|
|
+ if (size == 0) size = l;
|
|
|
+ luaL_argcheck(L, l >= (size_t)size, arg, "string too short");
|
|
|
+ luaL_addlstring(&b, s, size);
|
|
|
+ if (opt == 's') {
|
|
|
+ luaL_addchar(&b, '\0'); /* add zero at the end */
|
|
|
+ size++;
|
|
|
+ }
|
|
|
+ break;
|
|
|
+ }
|
|
|
+ default: controloptions(L, opt, &fmt, &h);
|
|
|
+ }
|
|
|
+ totalsize += size;
|
|
|
+ }
|
|
|
+ luaL_pushresult(&b);
|
|
|
+ return 1;
|
|
|
+}
|
|
|
+
|
|
|
+
|
|
|
+static lua_Number getinteger (const char *buff, int endian,
|
|
|
+ int issigned, int size) {
|
|
|
+ Uinttype l = 0;
|
|
|
+ int i;
|
|
|
+ if (endian == BIG) {
|
|
|
+ for (i = 0; i < size; i++) {
|
|
|
+ l <<= 8;
|
|
|
+ l |= (Uinttype)(unsigned char)buff[i];
|
|
|
+ }
|
|
|
+ }
|
|
|
+ else {
|
|
|
+ for (i = size - 1; i >= 0; i--) {
|
|
|
+ l <<= 8;
|
|
|
+ l |= (Uinttype)(unsigned char)buff[i];
|
|
|
+ }
|
|
|
+ }
|
|
|
+ if (!issigned)
|
|
|
+ return (lua_Number)l;
|
|
|
+ else { /* signed format */
|
|
|
+ Uinttype mask = (Uinttype)(~((Uinttype)0)) << (size*8 - 1);
|
|
|
+ if (l & mask) /* negative value? */
|
|
|
+ l |= mask; /* signal extension */
|
|
|
+ return (lua_Number)(Inttype)l;
|
|
|
+ }
|
|
|
+}
|
|
|
+
|
|
|
+
|
|
|
+static int b_unpack (lua_State *L) {
|
|
|
+ Header h;
|
|
|
+ const char *fmt = luaL_checkstring(L, 1);
|
|
|
+ size_t ld;
|
|
|
+ const char *data = luaL_checklstring(L, 2, &ld);
|
|
|
+ size_t pos = (size_t)luaL_optinteger(L, 3, 1) - 1;
|
|
|
+ int n = 0; /* number of results */
|
|
|
+ luaL_argcheck(L, pos <= ld, 3, "initial position out of string");
|
|
|
+ defaultoptions(&h);
|
|
|
+ while (*fmt) {
|
|
|
+ int opt = *fmt++;
|
|
|
+ size_t size = optsize(L, opt, &fmt);
|
|
|
+ pos += gettoalign(pos, &h, opt, size);
|
|
|
+ luaL_argcheck(L, size <= ld - pos, 2, "data string too short");
|
|
|
+ /* stack space for item + next position */
|
|
|
+ luaL_checkstack(L, 2, "too many results");
|
|
|
+ switch (opt) {
|
|
|
+ case 'b': case 'B': case 'h': case 'H':
|
|
|
+ case 'l': case 'L': case 'T': case 'i': case 'I': { /* integer types */
|
|
|
+ int issigned = islower(opt);
|
|
|
+ lua_Number res = getinteger(data+pos, h.endian, issigned, size);
|
|
|
+ lua_pushnumber(L, res); n++;
|
|
|
+ break;
|
|
|
+ }
|
|
|
+ case 'x': {
|
|
|
+ break;
|
|
|
+ }
|
|
|
+ case 'f': {
|
|
|
+ float f;
|
|
|
+ memcpy(&f, data+pos, size);
|
|
|
+ correctbytes((char *)&f, sizeof(f), h.endian);
|
|
|
+ lua_pushnumber(L, f); n++;
|
|
|
+ break;
|
|
|
+ }
|
|
|
+ case 'd': {
|
|
|
+ double d;
|
|
|
+ memcpy(&d, data+pos, size);
|
|
|
+ correctbytes((char *)&d, sizeof(d), h.endian);
|
|
|
+ lua_pushnumber(L, d); n++;
|
|
|
+ break;
|
|
|
+ }
|
|
|
+ case 'c': {
|
|
|
+ if (size == 0) {
|
|
|
+ if (n == 0 || !lua_isnumber(L, -1))
|
|
|
+ luaL_error(L, "format 'c0' needs a previous size");
|
|
|
+ size = lua_tonumber(L, -1);
|
|
|
+ lua_pop(L, 1); n--;
|
|
|
+ luaL_argcheck(L, size <= ld - pos, 2, "data string too short");
|
|
|
+ }
|
|
|
+ lua_pushlstring(L, data+pos, size); n++;
|
|
|
+ break;
|
|
|
+ }
|
|
|
+ case 's': {
|
|
|
+ const char *e = (const char *)memchr(data+pos, '\0', ld - pos);
|
|
|
+ if (e == NULL)
|
|
|
+ luaL_error(L, "unfinished string in data");
|
|
|
+ size = (e - (data+pos)) + 1;
|
|
|
+ lua_pushlstring(L, data+pos, size - 1); n++;
|
|
|
+ break;
|
|
|
+ }
|
|
|
+ default: controloptions(L, opt, &fmt, &h);
|
|
|
+ }
|
|
|
+ pos += size;
|
|
|
+ }
|
|
|
+ lua_pushinteger(L, pos + 1); /* next position */
|
|
|
+ return n + 1;
|
|
|
+}
|
|
|
+
|
|
|
+
|
|
|
+static int b_size (lua_State *L) {
|
|
|
+ Header h;
|
|
|
+ const char *fmt = luaL_checkstring(L, 1);
|
|
|
+ size_t pos = 0;
|
|
|
+ defaultoptions(&h);
|
|
|
+ while (*fmt) {
|
|
|
+ int opt = *fmt++;
|
|
|
+ size_t size = optsize(L, opt, &fmt);
|
|
|
+ pos += gettoalign(pos, &h, opt, size);
|
|
|
+ if (opt == 's')
|
|
|
+ luaL_argerror(L, 1, "option 's' has no fixed size");
|
|
|
+ else if (opt == 'c' && size == 0)
|
|
|
+ luaL_argerror(L, 1, "option 'c0' has no fixed size");
|
|
|
+ if (!isalnum(opt))
|
|
|
+ controloptions(L, opt, &fmt, &h);
|
|
|
+ pos += size;
|
|
|
+ }
|
|
|
+ lua_pushinteger(L, pos);
|
|
|
+ return 1;
|
|
|
+}
|
|
|
+
|
|
|
+/* }====================================================== */
|
|
|
+
|
|
|
+
|
|
|
+
|
|
|
+static const struct luaL_Reg thislib[] = {
|
|
|
+ {"pack", b_pack},
|
|
|
+ {"unpack", b_unpack},
|
|
|
+ {"size", b_size},
|
|
|
+ {NULL, NULL}
|
|
|
+};
|
|
|
+
|
|
|
+
|
|
|
+LUALIB_API int luaopen_struct (lua_State *L);
|
|
|
+
|
|
|
+LUALIB_API int luaopen_struct (lua_State *L) {
|
|
|
+
|
|
|
+ /* added to global environment */
|
|
|
+ luaL_newlib(L, thislib);
|
|
|
+ lua_pushvalue(L, -1);
|
|
|
+ lua_setglobal(L, "struct");
|
|
|
+
|
|
|
+ return 1;
|
|
|
+}
|
|
|
+
|
|
|
+
|
|
|
+/******************************************************************************
|
|
|
+* Copyright (C) 2010-2018 Lua.org, PUC-Rio. All rights reserved.
|
|
|
+*
|
|
|
+* Permission is hereby granted, free of charge, to any person obtaining
|
|
|
+* a copy of this software and associated documentation files (the
|
|
|
+* "Software"), to deal in the Software without restriction, including
|
|
|
+* without limitation the rights to use, copy, modify, merge, publish,
|
|
|
+* distribute, sublicense, and/or sell copies of the Software, and to
|
|
|
+* permit persons to whom the Software is furnished to do so, subject to
|
|
|
+* the following conditions:
|
|
|
+*
|
|
|
+* The above copyright notice and this permission notice shall be
|
|
|
+* included in all copies or substantial portions of the Software.
|
|
|
+*
|
|
|
+* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
|
|
|
+* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
|
|
|
+* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.
|
|
|
+* IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY
|
|
|
+* CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,
|
|
|
+* TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
|
|
|
+* SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
|
|
|
+******************************************************************************/
|
|
|
+
|
bel2125