mirror of https://github.com/lua/lua
124 lines
2.9 KiB
C
124 lines
2.9 KiB
C
/*
|
|
** $Id: lobject.c,v 1.25 1999/11/22 13:12:07 roberto Exp roberto $
|
|
** Some generic functions over Lua objects
|
|
** See Copyright Notice in lua.h
|
|
*/
|
|
|
|
#include <ctype.h>
|
|
#include <stdlib.h>
|
|
|
|
#define LUA_REENTRANT
|
|
|
|
#include "lobject.h"
|
|
#include "lua.h"
|
|
|
|
|
|
const char *const luaO_typenames[] = { /* ORDER LUA_T */
|
|
"userdata", "number", "string", "table", "function", "function",
|
|
"nil", "function", "mark", "mark", "mark", "line", NULL
|
|
};
|
|
|
|
|
|
const TObject luaO_nilobject = {LUA_T_NIL, {NULL}};
|
|
|
|
|
|
/*
|
|
** returns smaller power of 2 bigger than `n' (minimum is MINPOWER2)
|
|
*/
|
|
unsigned long luaO_power2 (unsigned long n) {
|
|
unsigned long p = MINPOWER2;
|
|
while (p<=n) p<<=1;
|
|
return p;
|
|
}
|
|
|
|
|
|
int luaO_equalval (const TObject *t1, const TObject *t2) {
|
|
switch (ttype(t1)) {
|
|
case LUA_T_NIL: return 1;
|
|
case LUA_T_NUMBER: return nvalue(t1) == nvalue(t2);
|
|
case LUA_T_STRING: case LUA_T_USERDATA: return svalue(t1) == svalue(t2);
|
|
case LUA_T_ARRAY: return avalue(t1) == avalue(t2);
|
|
case LUA_T_PROTO: return tfvalue(t1) == tfvalue(t2);
|
|
case LUA_T_CPROTO: return fvalue(t1) == fvalue(t2);
|
|
case LUA_T_CLOSURE: return t1->value.cl == t2->value.cl;
|
|
default:
|
|
LUA_INTERNALERROR(L, "invalid type");
|
|
return 0; /* UNREACHABLE */
|
|
}
|
|
}
|
|
|
|
|
|
#ifdef OLD_ANSI
|
|
void luaO_memup (void *dest, void *src, int size) {
|
|
while (size--)
|
|
((char *)dest)[size]=((char *)src)[size];
|
|
}
|
|
|
|
void luaO_memdown (void *dest, void *src, int size) {
|
|
int i;
|
|
for (i=0; i<size; i++)
|
|
((char *)dest)[i]=((char *)src)[i];
|
|
}
|
|
#endif
|
|
|
|
|
|
|
|
static double expten (unsigned int e) {
|
|
double exp = 10.0;
|
|
double res = 1.0;
|
|
for (; e; e>>=1) {
|
|
if (e & 1) res *= exp;
|
|
exp *= exp;
|
|
}
|
|
return res;
|
|
}
|
|
|
|
|
|
int luaO_str2d (const char *s, real *result) { /* LUA_NUMBER */
|
|
double a = 0.0;
|
|
int point = 0; /* number of decimal digits */
|
|
int sig;
|
|
while (isspace((unsigned char)*s)) s++;
|
|
sig = 1;
|
|
switch (*s) {
|
|
case '-': sig = -1; /* go through */
|
|
case '+': s++;
|
|
}
|
|
if (! (isdigit((unsigned char)*s) ||
|
|
(*s == '.' && isdigit((unsigned char)*(s+1)))))
|
|
return 0; /* not (at least one digit before or after the point) */
|
|
while (isdigit((unsigned char)*s))
|
|
a = 10.0*a + (*(s++)-'0');
|
|
if (*s == '.') {
|
|
s++;
|
|
while (isdigit((unsigned char)*s)) {
|
|
a = 10.0*a + (*(s++)-'0');
|
|
point++;
|
|
}
|
|
}
|
|
a *= sig;
|
|
if (toupper((unsigned char)*s) == 'E') {
|
|
int e = 0;
|
|
s++;
|
|
sig = 1;
|
|
switch (*s) {
|
|
case '-': sig = -1; /* go through */
|
|
case '+': s++;
|
|
}
|
|
if (!isdigit((unsigned char)*s)) return 0; /* no digit in the exponent? */
|
|
do {
|
|
e = 10*e + (*(s++)-'0');
|
|
} while (isdigit((unsigned char)*s));
|
|
point -= sig*e;
|
|
}
|
|
while (isspace((unsigned char)*s)) s++;
|
|
if (*s != '\0') return 0; /* invalid trailing characters? */
|
|
if (point != 0) {
|
|
if (point > 0) a /= expten(point);
|
|
else a *= expten(-point);
|
|
}
|
|
*result = a;
|
|
return 1;
|
|
}
|
|
|