mirror of
https://github.com/RfidResearchGroup/proxmark3.git
synced 2025-08-19 21:03:48 -07:00
make style
This commit is contained in:
parent
0d9223a547
commit
0373696662
483 changed files with 56514 additions and 52451 deletions
|
@ -21,41 +21,41 @@ typedef size_t lua_UInteger;
|
|||
/* Bit type size and limits */
|
||||
|
||||
#define BIT_BITS \
|
||||
(CHAR_BIT * sizeof(lua_Integer) > BITLIB_FLOAT_BITS ? \
|
||||
BITLIB_FLOAT_BITS : (CHAR_BIT * sizeof(lua_Integer)))
|
||||
(CHAR_BIT * sizeof(lua_Integer) > BITLIB_FLOAT_BITS ? \
|
||||
BITLIB_FLOAT_BITS : (CHAR_BIT * sizeof(lua_Integer)))
|
||||
|
||||
/* This code may give warnings if BITLIB_FLOAT_* are too big to fit in
|
||||
long, but that doesn't matter since in that case they won't be
|
||||
used. */
|
||||
#define BIT_MAX \
|
||||
(CHAR_BIT * sizeof(lua_Integer) > BITLIB_FLOAT_BITS ? BITLIB_FLOAT_MAX : LUA_INTEGER_MAX)
|
||||
(CHAR_BIT * sizeof(lua_Integer) > BITLIB_FLOAT_BITS ? BITLIB_FLOAT_MAX : LUA_INTEGER_MAX)
|
||||
|
||||
#define BIT_MIN \
|
||||
(CHAR_BIT * sizeof(lua_Integer) > BITLIB_FLOAT_BITS ? BITLIB_FLOAT_MIN : LUA_INTEGER_MIN)
|
||||
(CHAR_BIT * sizeof(lua_Integer) > BITLIB_FLOAT_BITS ? BITLIB_FLOAT_MIN : LUA_INTEGER_MIN)
|
||||
|
||||
#define BIT_UMAX \
|
||||
(CHAR_BIT * sizeof(lua_Integer) > BITLIB_FLOAT_BITS ? BITLIB_FLOAT_UMAX : LUA_UINTEGER_MAX)
|
||||
(CHAR_BIT * sizeof(lua_Integer) > BITLIB_FLOAT_BITS ? BITLIB_FLOAT_UMAX : LUA_UINTEGER_MAX)
|
||||
|
||||
|
||||
/* Define TOBIT to get a bit value */
|
||||
#ifdef BUILTIN_CAST
|
||||
#define
|
||||
#define TOBIT(L, n, res) \
|
||||
((void)(res), luaL_checkinteger((L), (n)))
|
||||
((void)(res), luaL_checkinteger((L), (n)))
|
||||
#else
|
||||
#include <stdint.h>
|
||||
#include <math.h>
|
||||
|
||||
/* FIXME: Assumes lua_Number fits in a double (use of fmod). */
|
||||
#define TOBIT(L, n, res) \
|
||||
((lua_Integer)(((res) = fmod(luaL_checknumber(L, (n)), (double)BIT_UMAX + 1.0)), \
|
||||
(res) > BIT_MAX ? ((res) -= (double)BIT_UMAX, (res) -= 1) : \
|
||||
((res) < BIT_MIN ? ((res) += (double)BIT_UMAX, (res) += 1) : (res))))
|
||||
((lua_Integer)(((res) = fmod(luaL_checknumber(L, (n)), (double)BIT_UMAX + 1.0)), \
|
||||
(res) > BIT_MAX ? ((res) -= (double)BIT_UMAX, (res) -= 1) : \
|
||||
((res) < BIT_MIN ? ((res) += (double)BIT_UMAX, (res) += 1) : (res))))
|
||||
#endif
|
||||
|
||||
|
||||
#define BIT_TRUNCATE(i) \
|
||||
((i) & BIT_UMAX)
|
||||
((i) & BIT_UMAX)
|
||||
|
||||
|
||||
/* Operations
|
||||
|
@ -71,38 +71,38 @@ typedef size_t lua_UInteger;
|
|||
*/
|
||||
|
||||
#define MONADIC(name, op) \
|
||||
static int bit_ ## name(lua_State *L) { \
|
||||
lua_Number f; \
|
||||
lua_pushinteger(L, BIT_TRUNCATE(op TOBIT(L, 1, f))); \
|
||||
return 1; \
|
||||
}
|
||||
static int bit_ ## name(lua_State *L) { \
|
||||
lua_Number f; \
|
||||
lua_pushinteger(L, BIT_TRUNCATE(op TOBIT(L, 1, f))); \
|
||||
return 1; \
|
||||
}
|
||||
|
||||
#define VARIADIC(name, op) \
|
||||
static int bit_ ## name(lua_State *L) { \
|
||||
lua_Number f; \
|
||||
int n = lua_gettop(L), i; \
|
||||
lua_Integer w = TOBIT(L, 1, f); \
|
||||
for (i = 2; i <= n; i++) \
|
||||
w op TOBIT(L, i, f); \
|
||||
lua_pushinteger(L, BIT_TRUNCATE(w)); \
|
||||
return 1; \
|
||||
}
|
||||
static int bit_ ## name(lua_State *L) { \
|
||||
lua_Number f; \
|
||||
int n = lua_gettop(L), i; \
|
||||
lua_Integer w = TOBIT(L, 1, f); \
|
||||
for (i = 2; i <= n; i++) \
|
||||
w op TOBIT(L, i, f); \
|
||||
lua_pushinteger(L, BIT_TRUNCATE(w)); \
|
||||
return 1; \
|
||||
}
|
||||
|
||||
#define LOGICAL_SHIFT(name, op) \
|
||||
static int bit_ ## name(lua_State *L) { \
|
||||
lua_Number f; \
|
||||
lua_pushinteger(L, BIT_TRUNCATE(BIT_TRUNCATE((lua_UInteger)TOBIT(L, 1, f)) op \
|
||||
(unsigned)luaL_checknumber(L, 2))); \
|
||||
return 1; \
|
||||
}
|
||||
static int bit_ ## name(lua_State *L) { \
|
||||
lua_Number f; \
|
||||
lua_pushinteger(L, BIT_TRUNCATE(BIT_TRUNCATE((lua_UInteger)TOBIT(L, 1, f)) op \
|
||||
(unsigned)luaL_checknumber(L, 2))); \
|
||||
return 1; \
|
||||
}
|
||||
|
||||
#define ARITHMETIC_SHIFT(name, op) \
|
||||
static int bit_ ## name(lua_State *L) { \
|
||||
lua_Number f; \
|
||||
lua_pushinteger(L, BIT_TRUNCATE((lua_Integer)TOBIT(L, 1, f) op \
|
||||
(unsigned)luaL_checknumber(L, 2))); \
|
||||
return 1; \
|
||||
}
|
||||
static int bit_ ## name(lua_State *L) { \
|
||||
lua_Number f; \
|
||||
lua_pushinteger(L, BIT_TRUNCATE((lua_Integer)TOBIT(L, 1, f) op \
|
||||
(unsigned)luaL_checknumber(L, 2))); \
|
||||
return 1; \
|
||||
}
|
||||
|
||||
MONADIC(cast, +)
|
||||
MONADIC(bnot, ~)
|
||||
|
@ -114,18 +114,19 @@ LOGICAL_SHIFT(rshift, >>)
|
|||
ARITHMETIC_SHIFT(arshift, >>)
|
||||
|
||||
static const struct luaL_Reg bitlib[] = {
|
||||
{"cast", bit_cast},
|
||||
{"bnot", bit_bnot},
|
||||
{"band", bit_band},
|
||||
{"bor", bit_bor},
|
||||
{"bxor", bit_bxor},
|
||||
{"lshift", bit_lshift},
|
||||
{"rshift", bit_rshift},
|
||||
{"arshift", bit_arshift},
|
||||
{NULL, NULL}
|
||||
{"cast", bit_cast},
|
||||
{"bnot", bit_bnot},
|
||||
{"band", bit_band},
|
||||
{"bor", bit_bor},
|
||||
{"bxor", bit_bxor},
|
||||
{"lshift", bit_lshift},
|
||||
{"rshift", bit_rshift},
|
||||
{"arshift", bit_arshift},
|
||||
{NULL, NULL}
|
||||
};
|
||||
|
||||
LUALIB_API int luaopen_bit (lua_State *L) {
|
||||
LUALIB_API int luaopen_bit(lua_State *L)
|
||||
{
|
||||
luaL_newlib(L, bitlib);
|
||||
//luaL_register(L, "bit", bitlib);
|
||||
lua_pushnumber(L, BIT_BITS);
|
||||
|
@ -144,9 +145,10 @@ LUALIB_API int luaopen_bit (lua_State *L) {
|
|||
/*
|
||||
** Open bit library
|
||||
*/
|
||||
int set_bit_library (lua_State *L) {
|
||||
int set_bit_library(lua_State *L)
|
||||
{
|
||||
|
||||
luaL_requiref(L, "bit", luaopen_bit, 1);
|
||||
lua_pop(L, 1);
|
||||
return 1;
|
||||
luaL_requiref(L, "bit", luaopen_bit, 1);
|
||||
lua_pop(L, 1);
|
||||
return 1;
|
||||
}
|
||||
|
|
Loading…
Add table
Add a link
Reference in a new issue