aboutsummaryrefslogtreecommitdiff
path: root/ldo.c
diff options
context:
space:
mode:
authorRoberto Ierusalimschy <roberto@inf.puc-rio.br>2000-03-30 14:19:48 -0300
committerRoberto Ierusalimschy <roberto@inf.puc-rio.br>2000-03-30 14:19:48 -0300
commit556a89e53751135f45d8dd1e84651461b67e1f81 (patch)
tree85c4d8486d53e534100c4b8c9ab30c6990585496 /ldo.c
parente2c60eda16d4aff7ea42513ba7c4d33ac45d9e99 (diff)
downloadlua-556a89e53751135f45d8dd1e84651461b67e1f81.tar.gz
lua-556a89e53751135f45d8dd1e84651461b67e1f81.tar.bz2
lua-556a89e53751135f45d8dd1e84651461b67e1f81.zip
new names for debug types
Diffstat (limited to 'ldo.c')
-rw-r--r--ldo.c12
1 files changed, 6 insertions, 6 deletions
diff --git a/ldo.c b/ldo.c
index d9f6d14a..bd58c734 100644
--- a/ldo.c
+++ b/ldo.c
@@ -1,5 +1,5 @@
1/* 1/*
2** $Id: ldo.c,v 1.69 2000/03/10 18:37:44 roberto Exp roberto $ 2** $Id: ldo.c,v 1.70 2000/03/29 20:19:20 roberto Exp roberto $
3** Stack and Call structure of Lua 3** Stack and Call structure of Lua
4** See Copyright Notice in lua.h 4** See Copyright Notice in lua.h
5*/ 5*/
@@ -55,7 +55,7 @@ void luaD_checkstack (lua_State *L, int n) {
55 lua_error(L, "BAD STACK OVERFLOW! DATA CORRUPTED!"); 55 lua_error(L, "BAD STACK OVERFLOW! DATA CORRUPTED!");
56 } 56 }
57 else { 57 else {
58 lua_Dbgactreg dummy; 58 lua_Debug dummy;
59 L->stack_last += EXTRA_STACK; /* to be used by error message */ 59 L->stack_last += EXTRA_STACK; /* to be used by error message */
60 if (lua_getstack(L, L->stacksize/SLOTS_PER_F, &dummy) == 0) { 60 if (lua_getstack(L, L->stacksize/SLOTS_PER_F, &dummy) == 0) {
61 /* too few funcs on stack: doesn't look like a recursion loop */ 61 /* too few funcs on stack: doesn't look like a recursion loop */
@@ -103,7 +103,7 @@ void luaD_openstack (lua_State *L, StkId pos) {
103 103
104void luaD_lineHook (lua_State *L, StkId func, int line) { 104void luaD_lineHook (lua_State *L, StkId func, int line) {
105 if (L->allowhooks) { 105 if (L->allowhooks) {
106 lua_Dbgactreg ar; 106 lua_Debug ar;
107 struct C_Lua_Stack oldCLS = L->Cstack; 107 struct C_Lua_Stack oldCLS = L->Cstack;
108 StkId old_top = L->Cstack.lua2C = L->Cstack.base = L->top; 108 StkId old_top = L->Cstack.lua2C = L->Cstack.base = L->top;
109 L->Cstack.num = 0; 109 L->Cstack.num = 0;
@@ -119,10 +119,10 @@ void luaD_lineHook (lua_State *L, StkId func, int line) {
119} 119}
120 120
121 121
122static void luaD_callHook (lua_State *L, StkId func, lua_Dbghook callhook, 122static void luaD_callHook (lua_State *L, StkId func, lua_Hook callhook,
123 const char *event) { 123 const char *event) {
124 if (L->allowhooks) { 124 if (L->allowhooks) {
125 lua_Dbgactreg ar; 125 lua_Debug ar;
126 struct C_Lua_Stack oldCLS = L->Cstack; 126 struct C_Lua_Stack oldCLS = L->Cstack;
127 StkId old_top = L->Cstack.lua2C = L->Cstack.base = L->top; 127 StkId old_top = L->Cstack.lua2C = L->Cstack.base = L->top;
128 L->Cstack.num = 0; 128 L->Cstack.num = 0;
@@ -179,7 +179,7 @@ void luaD_callTM (lua_State *L, const TObject *f, int nParams, int nResults) {
179*/ 179*/
180void luaD_call (lua_State *L, StkId func, int nResults) { 180void luaD_call (lua_State *L, StkId func, int nResults) {
181 StkId firstResult; 181 StkId firstResult;
182 lua_Dbghook callhook = L->callhook; 182 lua_Hook callhook = L->callhook;
183 retry: /* for `function' tag method */ 183 retry: /* for `function' tag method */
184 switch (ttype(func)) { 184 switch (ttype(func)) {
185 case TAG_LCLOSURE: { 185 case TAG_LCLOSURE: {