mirror of https://github.com/rusefi/lua.git
correction of some order dependencies in debug code.
This commit is contained in:
parent
be48c4d91e
commit
24ccc7c038
38
lua.stx
38
lua.stx
|
@ -1,6 +1,6 @@
|
||||||
%{
|
%{
|
||||||
|
|
||||||
char *rcs_luastx = "$Id: lua.stx,v 3.24 1995/10/26 14:21:56 roberto Exp roberto $";
|
char *rcs_luastx = "$Id: lua.stx,v 3.25 1995/10/26 17:02:50 roberto Exp roberto $";
|
||||||
|
|
||||||
#include <stdio.h>
|
#include <stdio.h>
|
||||||
#include <stdlib.h>
|
#include <stdlib.h>
|
||||||
|
@ -804,8 +804,8 @@ static void PrintCode (Byte *code, Byte *end)
|
||||||
p++;
|
p++;
|
||||||
break;
|
break;
|
||||||
case PUSHBYTE:
|
case PUSHBYTE:
|
||||||
printf ("%d PUSHBYTE %d\n", p-code, *(++p));
|
printf ("%d PUSHBYTE %d\n", p-code, *(p+1));
|
||||||
p++;
|
p+=2;
|
||||||
break;
|
break;
|
||||||
case PUSHWORD:
|
case PUSHWORD:
|
||||||
{
|
{
|
||||||
|
@ -850,8 +850,8 @@ static void PrintCode (Byte *code, Byte *end)
|
||||||
printf ("%d PUSHLOCAL%c\n", p-code, *p-PUSHLOCAL0+'0');
|
printf ("%d PUSHLOCAL%c\n", p-code, *p-PUSHLOCAL0+'0');
|
||||||
p++;
|
p++;
|
||||||
break;
|
break;
|
||||||
case PUSHLOCAL: printf ("%d PUSHLOCAL %d\n", p-code, *(++p));
|
case PUSHLOCAL: printf ("%d PUSHLOCAL %d\n", p-code, *(p+1));
|
||||||
p++;
|
p+=2;
|
||||||
break;
|
break;
|
||||||
case PUSHGLOBAL:
|
case PUSHGLOBAL:
|
||||||
{
|
{
|
||||||
|
@ -870,8 +870,8 @@ static void PrintCode (Byte *code, Byte *end)
|
||||||
p++;
|
p++;
|
||||||
break;
|
break;
|
||||||
case STORELOCAL:
|
case STORELOCAL:
|
||||||
printf ("%d STORELOCAL %d\n", p-code, *(++p));
|
printf ("%d STORELOCAL %d\n", p-code, *(p+1));
|
||||||
p++;
|
p+=2;
|
||||||
break;
|
break;
|
||||||
case STOREGLOBAL:
|
case STOREGLOBAL:
|
||||||
{
|
{
|
||||||
|
@ -892,25 +892,25 @@ static void PrintCode (Byte *code, Byte *end)
|
||||||
}
|
}
|
||||||
break;
|
break;
|
||||||
case STOREINDEXED0: printf ("%d STOREINDEXED0\n", (p++)-code); break;
|
case STOREINDEXED0: printf ("%d STOREINDEXED0\n", (p++)-code); break;
|
||||||
case STOREINDEXED: printf ("%d STOREINDEXED %d\n", p-code, *(++p));
|
case STOREINDEXED: printf ("%d STOREINDEXED %d\n", p-code, *(p+1));
|
||||||
p++;
|
p+=2;
|
||||||
break;
|
break;
|
||||||
case STORELIST0:
|
case STORELIST0:
|
||||||
printf("%d STORELIST0 %d\n", p-code, *(++p));
|
printf("%d STORELIST0 %d\n", p-code, *(p+1));
|
||||||
p++;
|
p+=2+;
|
||||||
break;
|
break;
|
||||||
case STORELIST:
|
case STORELIST:
|
||||||
printf("%d STORELIST %d %d\n", p-code, *(p+1), *(p+2));
|
printf("%d STORELIST %d %d\n", p-code, *(p+1), *(p+2));
|
||||||
p+=3;
|
p+=3;
|
||||||
break;
|
break;
|
||||||
case STORERECORD:
|
case STORERECORD:
|
||||||
printf("%d STORERECORD %d\n", p-code, *(++p));
|
printf("%d STORERECORD %d\n", p-code, *(p+1));
|
||||||
p += *p*sizeof(Word) + 1;
|
p += *p*sizeof(Word) + 2;
|
||||||
break;
|
break;
|
||||||
case ADJUST0: printf ("%d ADJUST0\n", (p++)-code); break;
|
case ADJUST0: printf ("%d ADJUST0\n", (p++)-code); break;
|
||||||
case ADJUST:
|
case ADJUST:
|
||||||
printf ("%d ADJUST %d\n", p-code, *(++p));
|
printf ("%d ADJUST %d\n", p-code, *(p+1));
|
||||||
p++;
|
p+=2;
|
||||||
break;
|
break;
|
||||||
case CREATEARRAY:
|
case CREATEARRAY:
|
||||||
{
|
{
|
||||||
|
@ -993,8 +993,8 @@ static void PrintCode (Byte *code, Byte *end)
|
||||||
break;
|
break;
|
||||||
case RETCODE0: printf ("%d RETCODE0\n", (p++)-code); break;
|
case RETCODE0: printf ("%d RETCODE0\n", (p++)-code); break;
|
||||||
case RETCODE:
|
case RETCODE:
|
||||||
printf ("%d RETCODE %d\n", p-code, *(++p));
|
printf ("%d RETCODE %d\n", p-code, *(p+1));
|
||||||
p++;
|
p+=2;
|
||||||
break;
|
break;
|
||||||
case SETLINE:
|
case SETLINE:
|
||||||
{
|
{
|
||||||
|
@ -1006,7 +1006,9 @@ static void PrintCode (Byte *code, Byte *end)
|
||||||
}
|
}
|
||||||
break;
|
break;
|
||||||
|
|
||||||
default: printf ("%d Cannot happen: code %d\n", (p++)-code, *(p-1)); break;
|
default: printf ("%d Cannot happen: code %d\n", p-code, *p));
|
||||||
|
p+=1;
|
||||||
|
break;
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
Loading…
Reference in New Issue