lobject.c 1.7 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778
  1. /*
  2. ** $Id: lobject.c,v 1.5 1997/10/24 17:17:24 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", "prototype", "cprototype",
  12. "nil", "function", "mark", "cmark", "line", NULL
  13. };
  14. TObject luaO_nilobject = {LUA_T_NIL, {NULL}};
  15. unsigned long luaO_nblocks = 0;
  16. /* hash dimensions values */
  17. static long dimensions[] =
  18. {5L, 11L, 23L, 47L, 97L, 197L, 397L, 797L, 1597L, 3203L, 6421L,
  19. 12853L, 25717L, 51437L, 102811L, 205619L, 411233L, 822433L,
  20. 1644817L, 3289613L, 6579211L, 13158023L, MAX_INT};
  21. int luaO_redimension (int oldsize)
  22. {
  23. int i;
  24. for (i=0; dimensions[i]<MAX_INT; i++) {
  25. if (dimensions[i] > oldsize)
  26. return dimensions[i];
  27. }
  28. lua_error("table overflow");
  29. return 0; /* to avoid warnings */
  30. }
  31. int luaO_equalObj (TObject *t1, TObject *t2)
  32. {
  33. if (ttype(t1) != ttype(t2)) return 0;
  34. switch (ttype(t1)) {
  35. case LUA_T_NIL: return 1;
  36. case LUA_T_NUMBER: return nvalue(t1) == nvalue(t2);
  37. case LUA_T_STRING: case LUA_T_USERDATA: return svalue(t1) == svalue(t2);
  38. case LUA_T_ARRAY: return avalue(t1) == avalue(t2);
  39. case LUA_T_FUNCTION: return t1->value.cl == t2->value.cl;
  40. default:
  41. lua_error("internal error in `lua_equalObj'");
  42. return 0; /* UNREACHEABLE */
  43. }
  44. }
  45. int luaO_findstring (char *name, char *list[])
  46. {
  47. int i;
  48. for (i=0; list[i]; i++)
  49. if (strcmp(list[i], name) == 0)
  50. return i;
  51. return -1; /* name not found */
  52. }
  53. void luaO_insertlist (GCnode *root, GCnode *node)
  54. {
  55. node->next = root->next;
  56. root->next = node;
  57. node->marked = 0;
  58. }