lobject.c 2.1 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394
  1. /*
  2. ** $Id: lobject.c,v 1.9 1997/12/26 18:38:16 roberto Exp roberto $
  3. ** Some generic functions over Lua objects
  4. ** See Copyright Notice in lua.h
  5. */
  6. #include <stdlib.h>
  7. #include <string.h>
  8. #include "lobject.h"
  9. #include "lua.h"
  10. char *luaO_typenames[] = { /* ORDER LUA_T */
  11. "userdata", "number", "string", "table", "function", "function",
  12. "nil", "function", "mark", "mark", "mark", "line", NULL
  13. };
  14. TObject luaO_nilobject = {LUA_T_NIL, {NULL}};
  15. /* hash dimensions values */
  16. static long dimensions[] =
  17. {5L, 11L, 23L, 47L, 97L, 197L, 397L, 797L, 1597L, 3203L, 6421L,
  18. 12853L, 25717L, 51437L, 102811L, 205619L, 411233L, 822433L,
  19. 1644817L, 3289613L, 6579211L, 13158023L, MAX_INT};
  20. int luaO_redimension (int oldsize)
  21. {
  22. int i;
  23. for (i=0; dimensions[i]<MAX_INT; i++) {
  24. if (dimensions[i] > oldsize)
  25. return dimensions[i];
  26. }
  27. lua_error("table overflow");
  28. return 0; /* to avoid warnings */
  29. }
  30. int luaO_equalObj (TObject *t1, TObject *t2)
  31. {
  32. if (ttype(t1) != ttype(t2)) return 0;
  33. switch (ttype(t1)) {
  34. case LUA_T_NIL: return 1;
  35. case LUA_T_NUMBER: return nvalue(t1) == nvalue(t2);
  36. case LUA_T_STRING: case LUA_T_USERDATA: return svalue(t1) == svalue(t2);
  37. case LUA_T_ARRAY: return avalue(t1) == avalue(t2);
  38. case LUA_T_PROTO: return tfvalue(t1) == tfvalue(t2);
  39. case LUA_T_CPROTO: return fvalue(t1) == fvalue(t2);
  40. case LUA_T_CLOSURE: return t1->value.cl == t2->value.cl;
  41. default:
  42. lua_error("internal error in `lua_equalObj'");
  43. return 0; /* UNREACHEABLE */
  44. }
  45. }
  46. int luaO_findstring (char *name, char *list[])
  47. {
  48. int i;
  49. for (i=0; list[i]; i++)
  50. if (strcmp(list[i], name) == 0)
  51. return i;
  52. return -1; /* name not found */
  53. }
  54. void luaO_insertlist (GCnode *root, GCnode *node)
  55. {
  56. node->next = root->next;
  57. root->next = node;
  58. node->marked = 0;
  59. }
  60. #ifdef OLD_ANSI
  61. void luaO_memup (void *dest, void *src, int size)
  62. {
  63. char *d = dest;
  64. char *s = src;
  65. while (size--) d[size]=s[size];
  66. }
  67. void luaO_memdown (void *dest, void *src, int size)
  68. {
  69. char *d = dest;
  70. char *s = src;
  71. int i;
  72. for (i=0; i<size; i++) d[i]=s[i];
  73. }
  74. #endif