undump.c 5.2 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326
  1. /*
  2. ** undump.c
  3. ** load bytecodes from files
  4. */
  5. char* rcs_undump="$Id: undump.c,v 1.13 1996/03/12 20:00:40 lhf Exp lhf $";
  6. #include <stdio.h>
  7. #include <string.h>
  8. #include "opcode.h"
  9. #include "mem.h"
  10. #include "table.h"
  11. #include "undump.h"
  12. static int swapword=0;
  13. static int swapfloat=0;
  14. static TFunc* Main=NULL; /* functions in a chunk */
  15. static TFunc* lastF=NULL;
  16. static void warn(char* s) /* TODO: remove */
  17. {
  18. #if 0
  19. fprintf(stderr,"undump: %s\n",s);
  20. #endif
  21. }
  22. static void FixCode(Byte* code, Byte* end) /* swap words */
  23. {
  24. Byte* p;
  25. for (p=code; p!=end;)
  26. {
  27. OpCode op=(OpCode)*p;
  28. switch (op)
  29. {
  30. case PUSHNIL:
  31. case PUSH0:
  32. case PUSH1:
  33. case PUSH2:
  34. case PUSHLOCAL0:
  35. case PUSHLOCAL1:
  36. case PUSHLOCAL2:
  37. case PUSHLOCAL3:
  38. case PUSHLOCAL4:
  39. case PUSHLOCAL5:
  40. case PUSHLOCAL6:
  41. case PUSHLOCAL7:
  42. case PUSHLOCAL8:
  43. case PUSHLOCAL9:
  44. case PUSHINDEXED:
  45. case STORELOCAL0:
  46. case STORELOCAL1:
  47. case STORELOCAL2:
  48. case STORELOCAL3:
  49. case STORELOCAL4:
  50. case STORELOCAL5:
  51. case STORELOCAL6:
  52. case STORELOCAL7:
  53. case STORELOCAL8:
  54. case STORELOCAL9:
  55. case STOREINDEXED0:
  56. case ADJUST0:
  57. case EQOP:
  58. case LTOP:
  59. case LEOP:
  60. case GTOP:
  61. case GEOP:
  62. case ADDOP:
  63. case SUBOP:
  64. case MULTOP:
  65. case DIVOP:
  66. case POWOP:
  67. case CONCOP:
  68. case MINUSOP:
  69. case NOTOP:
  70. case POP:
  71. case RETCODE0:
  72. p++;
  73. break;
  74. case PUSHBYTE:
  75. case PUSHLOCAL:
  76. case STORELOCAL:
  77. case STOREINDEXED:
  78. case STORELIST0:
  79. case ADJUST:
  80. case RETCODE:
  81. p+=2;
  82. break;
  83. case STORELIST:
  84. case CALLFUNC:
  85. p+=3;
  86. break;
  87. case PUSHFUNCTION:
  88. p+=5;
  89. break;
  90. case PUSHWORD:
  91. case PUSHSELF:
  92. case CREATEARRAY:
  93. case ONTJMP:
  94. case ONFJMP:
  95. case JMP:
  96. case UPJMP:
  97. case IFFJMP:
  98. case IFFUPJMP:
  99. case SETLINE:
  100. case PUSHSTRING:
  101. case PUSHGLOBAL:
  102. case STOREGLOBAL:
  103. {
  104. Byte t;
  105. t=p[1]; p[1]=p[2]; p[2]=t;
  106. p+=3;
  107. break;
  108. }
  109. case PUSHFLOAT:
  110. {
  111. Byte t;
  112. t=p[1]; p[1]=p[4]; p[4]=t;
  113. t=p[2]; p[2]=p[3]; p[3]=t;
  114. p+=5;
  115. break;
  116. }
  117. case STORERECORD:
  118. {
  119. int n=*++p;
  120. p++;
  121. while (n--)
  122. {
  123. Byte t;
  124. t=p[0]; p[0]=p[1]; p[1]=t;
  125. p+=2;
  126. }
  127. break;
  128. }
  129. default:
  130. lua_error("corrupt binary file");
  131. break;
  132. }
  133. }
  134. }
  135. static void Unthread(Byte* code, int i, int v)
  136. {
  137. while (i!=0)
  138. {
  139. CodeWord c;
  140. Byte* p=code+i;
  141. get_word(c,p);
  142. i=c.w;
  143. c.w=v;
  144. p[-2]=c.m.c1;
  145. p[-1]=c.m.c2;
  146. }
  147. }
  148. static int LoadWord(FILE* D)
  149. {
  150. Word w;
  151. fread(&w,sizeof(w),1,D);
  152. if (swapword)
  153. {
  154. Byte* p=(Byte*)&w; /* TODO: need union? */
  155. Byte t;
  156. t=p[0]; p[0]=p[1]; p[1]=t;
  157. }
  158. return w;
  159. }
  160. static int LoadSize(FILE* D)
  161. {
  162. Word hi=LoadWord(D);
  163. Word lo=LoadWord(D);
  164. int s=(hi<<16)|lo;
  165. if ((Word)s != s) lua_error("code too long");
  166. return s;
  167. }
  168. static char* LoadBlock(int size, FILE* D)
  169. {
  170. char* b=luaI_malloc(size);
  171. fread(b,size,1,D);
  172. return b;
  173. }
  174. static char* LoadString(FILE* D)
  175. {
  176. int size=LoadWord(D);
  177. char *b=luaI_buffer(size);
  178. fread(b,size,1,D);
  179. return b;
  180. }
  181. static char* LoadNewString(FILE* D)
  182. {
  183. return LoadBlock(LoadWord(D),D);
  184. }
  185. static void LoadFunction(FILE* D)
  186. {
  187. TFunc* tf=new(TFunc);
  188. tf->next=NULL;
  189. tf->locvars=NULL;
  190. tf->size=LoadSize(D);
  191. tf->lineDefined=LoadWord(D);
  192. if (IsMain(tf)) /* new main */
  193. {
  194. tf->fileName=LoadNewString(D);
  195. Main=lastF=tf;
  196. }
  197. else /* fix PUSHFUNCTION */
  198. {
  199. CodeCode c;
  200. Byte* p;
  201. tf->marked=LoadWord(D);
  202. tf->fileName=Main->fileName;
  203. p=Main->code+tf->marked;
  204. c.tf=tf;
  205. *p++=c.m.c1; *p++=c.m.c2; *p++=c.m.c3; *p++=c.m.c4;
  206. lastF=lastF->next=tf;
  207. }
  208. tf->code=LoadBlock(tf->size,D);
  209. if (swapword || swapfloat) FixCode(tf->code,tf->code+tf->size);
  210. while (1) /* unthread */
  211. {
  212. int c=getc(D);
  213. if (c==ID_VAR) /* global var */
  214. {
  215. int i=LoadWord(D);
  216. char* s=LoadString(D);
  217. int v=luaI_findsymbolbyname(s);
  218. Unthread(tf->code,i,v);
  219. }
  220. else if (c==ID_STR) /* constant string */
  221. {
  222. int i=LoadWord(D);
  223. char* s=LoadString(D);
  224. int v=luaI_findconstantbyname(s);
  225. Unthread(tf->code,i,v);
  226. }
  227. else
  228. {
  229. ungetc(c,D);
  230. break;
  231. }
  232. }
  233. }
  234. static void LoadSignature(FILE* D)
  235. {
  236. char* s=SIGNATURE;
  237. while (*s!=0 && getc(D)==*s)
  238. ++s;
  239. if (*s!=0) lua_error("bad signature");
  240. }
  241. static void LoadHeader(FILE* D) /* TODO: error handling */
  242. {
  243. Word w,tw=TEST_WORD;
  244. float f,tf=TEST_FLOAT;
  245. LoadSignature(D);
  246. getc(D); /* skip version */
  247. fread(&w,sizeof(w),1,D); /* test word */
  248. if (w!=tw)
  249. {
  250. swapword=1;
  251. warn("different byte order");
  252. }
  253. fread(&f,sizeof(f),1,D); /* test float */
  254. if (f!=tf)
  255. {
  256. Byte* p=(Byte*)&f; /* TODO: need union? */
  257. Byte t;
  258. swapfloat=1;
  259. t=p[0]; p[0]=p[3]; p[3]=t;
  260. t=p[1]; p[1]=p[2]; p[2]=t;
  261. if (f!=tf) /* TODO: try another perm? */
  262. lua_error("different float representation");
  263. else
  264. warn("different byte order in floats");
  265. }
  266. }
  267. static void LoadChunk(FILE* D)
  268. {
  269. LoadHeader(D);
  270. while (1)
  271. {
  272. int c=getc(D);
  273. if (c==ID_FUN) LoadFunction(D); else { ungetc(c,D); break; }
  274. }
  275. }
  276. /*
  277. ** load one chunk from a file.
  278. ** return list of functions found, headed by main, or NULL at EOF.
  279. */
  280. TFunc* luaI_undump1(FILE* D)
  281. {
  282. while (1)
  283. {
  284. int c=getc(D);
  285. if (c==ID_CHUNK)
  286. {
  287. LoadChunk(D);
  288. return Main;
  289. }
  290. else if (c==EOF)
  291. return NULL;
  292. else
  293. lua_error("not a lua binary file");
  294. }
  295. }
  296. /*
  297. ** load and run all chunks in a file
  298. */
  299. int luaI_undump(FILE* D)
  300. {
  301. TFunc* m;
  302. while ((m=luaI_undump1(D)))
  303. {
  304. int status=luaI_dorun(m);
  305. luaI_freefunc(m);
  306. if (status!=0) return status;
  307. }
  308. return 0;
  309. }