开通博客赚积分
发布资源赚积分
分类

源码开发语言/平台
当前位置：首页 > 源码/资料 > 汇编语言 > 查看源码
CodeGen.c
资源名称：C语言编译器.rar　[点击查看]
上传用户：wqdrylgs
上传日期：2007-02-09
资源大小：65k
文件大小：18k
源码类别：

汇编语言

开发平台：

WINDOWS

CodeGen.c：源码内容
  1. #include <stdlib.h>
  2. #include "globals.h"
  3. #include "parse.h"
  4. #include "symtab.h"
  6. static int label_num = 0;
  7. TreeNode * Fun;
  9. void GenLabel(char lab[LABEL_SIZE])
  10. {
  11. static int i=1;
  12. char temp[LABEL_SIZE];
  13. strcpy(lab,"L");
  14. _itoa(i,temp,10);
  15. strcat(lab,temp);
  16. i++;
  17. }
  20. void StackSegmentBegin(void)
  21. {
  22. fprintf(inter_code,";*******************************************************n");
  23. fprintf(inter_code,"Stack_segtsegmentn");
  24. fprintf(inter_code,"tdwt1024 dup(?)n");
  25. fprintf(inter_code,"ttostlabeltwordn");
  26. fprintf(inter_code,"Stack_segtendsn");
  27. fprintf(inter_code,";*******************************************************n");
  28. fprintf(inter_code,"Data_segtsegmentn");
  29. }
  31. void StackSegmentEnd(void)
  32. {
  33. fprintf(inter_code,"Data_segtendsn");
  34. fprintf(inter_code,";*******************************************************n");
  35. }
  37. void CodeSegmentBegin(void)
  38. {
  39. fprintf(inter_code,"Code_segtsegmentn");
  40. fprintf(inter_code,"tassumetCS:Code_seg, DS:Data_seg, SS:Stack_segn");
  41. }
  43. void CodeSegmentEnd(void)
  44. {
  45. fprintf(inter_code,"Code_segtendsn");
  46. fprintf(inter_code,"tendtstartn");
  47. fprintf(inter_code,";*******************************************************n");
  48. }
  50. void VarDec_ini(char *name, int value)//local variable declaration with initial value
  51. {
  52. int os;
  53. ValEntry * pEntry = malloc(sizeof(ValEntry));
  55. if(pTable ->nestlevel == 0)
  56. fprintf(inter_code,"t%stdwt%dn",name,value);
  57. else
  58. {
  59. Lookup_Var(pTable, pTable ->funEntry, name, pEntry);
  60. os = pEntry ->offset;
  62. fprintf(inter_code,"tPUSHtAXn");//为该变量占个位置，迫使sp移动
  63. fprintf(inter_code,"tPUSHtAXn");//store value
  64. fprintf(inter_code,"tMOVtAX , %dn",value);
  65. fprintf(inter_code,"tPUSHtBPn");//calculate variable address
  66. fprintf(inter_code,"tADDtBP , %dn",os);
  67. fprintf(inter_code,"tMOVtSS:[BP] , AXn",os);//store value
  68. fprintf(inter_code,"tPOPtBPn");
  69. fprintf(inter_code,"tPOPtAXn");
  70. }
  71. }
  73. void VarDec(char *name)//local variable declaration without initial value
  74. {
  75. if(pTable ->nestlevel == 0)
  76. fprintf(inter_code,"t%stdwt?n",name);
  77. else
  78. fprintf(inter_code,"tPUSHtAXn");//为该变量占个位置，迫使sp移动
  79. }
  81. void ArrDec(char *name, int entitynum)
  82. {
  83. int i;
  84. if(pTable ->nestlevel == 0)
  85. fprintf(inter_code,"t%stdwt%d dup(?)n",name,entitynum);//to data file
  86. else
  87. for(i = 0; i < entitynum; i ++)
  88. fprintf(inter_code,"tPUSHtAXn");//为该变量占个位置，迫使sp移动
  89. }
  91. void ent(char *name, int para, int retvalue)
  92. {
  93. fprintf(inter_code,"t%stproctfarn",name);//to code file
  94. if(!strcmp("main",name)){//main function
  95. fprintf(inter_code,"start:n");
  96. fprintf(inter_code,"tMOVtAX , Stack_segn");
  97. fprintf(inter_code,"tMOVtSS , AXn");
  98. fprintf(inter_code,"tMOVtSP , offset tosnn");
  99. fprintf(inter_code,"tPUSHtDSn");
  100. fprintf(inter_code,"tSUBtAX , AXn");
  101. fprintf(inter_code,"tPUSHtAXnn");
  102. fprintf(inter_code,"tMOVtAX , Data_segn");
  103. fprintf(inter_code,"tMOVtDS , AXn");
  104. }
  105. fprintf(inter_code,"tPUSHtAXn");
  106. fprintf(inter_code,"tPUSHtBXn");
  107. fprintf(inter_code,"tPUSHtCXn");
  108. fprintf(inter_code,"tPUSHtDXn");
  109. fprintf(inter_code,"tPUSHtBPn");
  110. fprintf(inter_code,"tMOVtBP , SPn");//begin to accept local variables
  111. }
  114. //--------------------------------------------------
  115. void adi(void)
  116. {
  117. fprintf(inter_code,"tPOPtBXn");
  118. fprintf(inter_code,"tPOPtAXn");
  119. fprintf(inter_code,"tADDtAX , BXn");
  120. fprintf(inter_code,"tPUSHtAXn");
  121. }
  123. void andi(void)
  124. {
  125. fprintf(inter_code,"tPOPtBXn");
  126. fprintf(inter_code,"tPOPtAXn");
  127. fprintf(inter_code,"tANDtAX , BXn");
  128. fprintf(inter_code,"tPUSHtAXn");
  129. }
  131. void compound_enter(void)
  132. {
  133. }
  135. void compound_exit(void)
  136. {
  137. pTable = pTable->parent;
  138. }
  140. void cup(char *name, int paranum) //function call end, 'int' is the number of actual parameters
  141. {
  142. fprintf(inter_code,"tCALLt%sn",name);
  143. }
  145. void divi(void)
  146. {
  147. fprintf(inter_code,"tPOPtBXn");
  148. fprintf(inter_code,"tPOPtAXn");
  149. fprintf(inter_code,"tPUSHtDXn");
  150. fprintf(inter_code,"tIDIVtBXn");
  151. fprintf(inter_code,"tPOPtDXn");
  152. fprintf(inter_code,"tPUSHtAXn");
  153. }
  155. void equi(void)
  156. {
  157. fprintf(inter_code,"tPOPtBXn");
  158. fprintf(inter_code,"tPOPtAXn");
  159. fprintf(inter_code,"tCMPtAX , BXn");
  160. fprintf(inter_code,"tJEtLabel%dn",label_num);
  161. fprintf(inter_code,"tMOVtAX , 0n");
  162. fprintf(inter_code,"tPUSHtAXn");
  163. fprintf(inter_code,"tJMPtLabel%dn",label_num + 1);
  164. fprintf(inter_code,"Label%d:",label_num);
  165. fprintf(inter_code,"tMOVtAX , 1n");
  166. fprintf(inter_code,"tPUSHtAXn");
  167. fprintf(inter_code,"Label%d:",label_num + 1);
  168. label_num += 2;
  169. }
  171. void leave(char *name)
  172. {
  173. fprintf(inter_code,"t%stendpn",name);
  174. }
  176. void fjp(char*label)
  177. {
  178. fprintf(inter_code,"tPOPtAXn");
  179. fprintf(inter_code,"tCMPtAX , 0n");
  180. fprintf(inter_code,"tJEt%sn",label);
  181. }
  183. void gorei(void)
  184. {
  185. fprintf(inter_code,"tPOPtBXn");
  186. fprintf(inter_code,"tPOPtAXn");
  187. fprintf(inter_code,"tCMPtAX , BXn");
  188. fprintf(inter_code,"tJGEtLabel%dn",label_num);
  189. fprintf(inter_code,"tMOVtAX , 0n");
  190. fprintf(inter_code,"tPUSHtAXn");
  191. fprintf(inter_code,"tJMPtLabel%dn",label_num+1);
  192. fprintf(inter_code,"Label%d:",label_num);
  193. fprintf(inter_code,"tMOVtAX , 1n");
  194. fprintf(inter_code,"tPUSHtAXn");
  195. fprintf(inter_code,"Label%d:",label_num+1);
  196. label_num += 2;
  197. }
  199. void greater(void)
  200. {
  201. fprintf(inter_code,"tPOPtBXn");
  202. fprintf(inter_code,"tPOPtAXn");
  203. fprintf(inter_code,"tCMPtAX , BXn");
  204. fprintf(inter_code,"tJGtLabel%dn",label_num);
  205. fprintf(inter_code,"tMOVtAX , 0n");
  206. fprintf(inter_code,"tPUSHtAXn");
  207. fprintf(inter_code,"tJMPtLabel%dn",label_num+1);
  208. fprintf(inter_code,"Label%d:",label_num);
  209. fprintf(inter_code,"tMOVtAX , 1n");
  210. fprintf(inter_code,"tPUSHtAXn");
  211. fprintf(inter_code,"Label%d:",label_num+1);
  212. label_num += 2;
  213. }
  215. void ind(char *name)
  216. {
  217. if(pTable ->nestlevel == 0){
  218. fprintf(inter_code,"tPOPtBXn");
  219. fprintf(inter_code,"tPUSHtDS:[BX]n");
  220. }
  221. else{
  222. fprintf(inter_code,"tPOPtBXn");
  223. fprintf(inter_code,"tPUSHtBPn");
  224. fprintf(inter_code,"tMOVtBP , BXn");
  225. fprintf(inter_code,"tPUSHtSS:[BP]n");
  226. fprintf(inter_code,"tPOPtBPn");
  227. }
  228. }
  230. void ixa_elem_size(void)
  231. {
  232. fprintf(inter_code,"tPOPtAXn");
  233. fprintf(inter_code,"tPOPtBXn");
  234. fprintf(inter_code,"tSHLtAX , %dn",EXP_VARIABLE_LENGTH);//AX * VARIABLE_LENGTH
  235. fprintf(inter_code,"tADDtAX , BXn");
  236. fprintf(inter_code,"tPUSHtAXn");
  237. }
  239. void lab(char *label)
  240. {
  241. fprintf(inter_code,"%s :n",label);
  242. }
  244. void ldl(char value)
  245. {
  246. fprintf(inter_code,"tMOVtAX , %dn",(int)value);
  247. fprintf(inter_code,"tPUSHtAXn");
  248. }
  250. void lda(char *name)//load address
  251. {
  252. int addr = 0;
  253. ValEntry * pEntry = malloc(sizeof(ValEntry));
  254. if(pTable ->nestlevel == 0){
  255. fprintf(inter_code,"tLEAtAX , %sn",name);
  256. fprintf(inter_code,"tPUSHtAXn");
  257. }
  258. else{
  259. Lookup_Var(pTable, pTable ->funEntry, name, pEntry);
  260. addr = pEntry->offset;
  261. fprintf(inter_code,"tMOVtAX , BPn");
  262. fprintf(inter_code,"tADDtAX , %dn",addr);
  263. fprintf(inter_code,"tPUSHtAXn");
  264. }
  265. }
  267. void ldc(int value)//load constant
  268. {
  269. fprintf(inter_code,"tMOVtAX , %dn",value);
  270. fprintf(inter_code,"tPUSHtAXn");
  271. }
  273. void less(void)
  274. {
  275. fprintf(inter_code,"tPOPtBXn");
  276. fprintf(inter_code,"tPOPtAXn");
  277. fprintf(inter_code,"tCMPtAX , BXn");
  278. fprintf(inter_code,"tJLtLabel%dn",label_num);
  279. fprintf(inter_code,"tMOVtAX , 0n");
  280. fprintf(inter_code,"tPUSHtAXn");
  281. fprintf(inter_code,"tJMPtLabel%dn",label_num+1);
  282. fprintf(inter_code,"Label%d:",label_num);
  283. fprintf(inter_code,"tMOVtAX , 1n");
  284. fprintf(inter_code,"tPUSHtAXn");
  285. fprintf(inter_code,"Label%d:",label_num+1);
  286. label_num += 2;
  287. }
  289. void lod(char *name)
  290. {
  291. int addr = 0;
  292. ValEntry * pEntry = malloc(sizeof(ValEntry));
  293. Lookup_Var(pTable, pTable ->funEntry, name, pEntry);
  294. if(pTable ->nestlevel == 0){
  295. fprintf(inter_code,"tMOVtAX , %sn",name);
  296. fprintf(inter_code,"tPUSHtAXn");
  297. }
  298. else{
  299. Lookup_Var(pTable,pTable ->funEntry, name,pEntry);
  300. addr = pEntry ->offset;
  301. fprintf(inter_code,"tPUSHtBPn");
  302. fprintf(inter_code,"tADDtBP , %dn",addr);
  303. fprintf(inter_code,"tMOVtAX , SS:[BP]n");
  304. fprintf(inter_code,"tPOPtBPn");
  305. fprintf(inter_code,"tPUSHtAXn");
  306. }
  307. }
  309. void lorei(void)
  310. {
  311. fprintf(inter_code,"tPOPtBXn");
  312. fprintf(inter_code,"tPOPtAXn");
  313. fprintf(inter_code,"tCMPtAX , BXn");
  314. fprintf(inter_code,"tJLEtLabel%dn",label_num);
  315. fprintf(inter_code,"tMOVtAX , 0n");
  316. fprintf(inter_code,"tPUSHtAXn");
  317. fprintf(inter_code,"tJMPtLabel%dn",label_num+1);
  318. fprintf(inter_code,"Label%d:",label_num);
  319. fprintf(inter_code,"tMOVtAX , 1n");
  320. fprintf(inter_code,"tPUSHtAXn");
  321. fprintf(inter_code,"Label%d:",label_num+1);
  322. label_num += 2;
  323. }
  325. void mst(char *name)
  326. {
  327. }
  329. void multi(void)
  330. {
  331. fprintf(inter_code,"tPOPtBXn");
  332. fprintf(inter_code,"tPOPtAXn");
  333. fprintf(inter_code,"tPUSHtDXn");
  334. fprintf(inter_code,"tIMULtBXn");
  335. fprintf(inter_code,"tPOPtDXn");
  336. fprintf(inter_code,"tPUSHtAXn");
  337. }
  339. void neqi(void)
  340. {
  341. fprintf(inter_code,"tPOPtBXn");
  342. fprintf(inter_code,"tPOPtAXn");
  343. fprintf(inter_code,"tCMPtAX , BXn");
  344. fprintf(inter_code,"tJNEtLabel%dn",label_num);
  345. fprintf(inter_code,"tMOVtAX , 0n");
  346. fprintf(inter_code,"tPUSHtAXn");
  347. fprintf(inter_code,"tJMPtLabel%dn",label_num+1);
  348. fprintf(inter_code,"Label%d:",label_num);
  349. fprintf(inter_code,"tMOVtAX , 1n");
  350. fprintf(inter_code,"tPUSHtAXn");
  351. fprintf(inter_code,"Label%d:",label_num+1);
  352. label_num += 2;
  353. }
  355. void ori(void)
  356. {
  357. fprintf(inter_code,"tPOPtBXn");
  358. fprintf(inter_code,"tPOPtAXn");
  359. fprintf(inter_code,"tORtAX , BXn");
  360. fprintf(inter_code,"tPUSHtAXn");
  361. }
  363. void pop(void)
  364. {
  365. fprintf(inter_code,"tPOPtAXn");
  366. }
  368. void ret(int r,char * name)
  369. {
  370. int addr = 0;
  371. FunEntry * pEntry = malloc(sizeof(FunEntry));
  372. if(r){//if the function has a return value
  373. fprintf(inter_code,"tPOPtAXn");//get the return value from the top of the stack
  374. pEntry = Lookup_Fun(name);
  375. addr = pEntry ->ret_val;
  376. fprintf(inter_code,"tPUSHtBPn");
  377. fprintf(inter_code,"tADDtBP , %dn",addr);
  378. fprintf(inter_code,"tMOVtSS:[BP] , AXn");
  379. fprintf(inter_code,"tPOPtBPn");
  380. }
  381. fprintf(inter_code,"tMOVtSP , BPn");//release local parameters
  382. fprintf(inter_code,"tPOPtBPn");//pop bp
  383. fprintf(inter_code,"tPOPtDXn");
  384. fprintf(inter_code,"tPOPtCXn");
  385. fprintf(inter_code,"tPOPtBXn");
  386. fprintf(inter_code,"tPOPtAXn");
  388. fprintf(inter_code,"tRETn");
  389. }
  391. void stn(char *name)
  392. {
  393. if(pTable ->nestlevel == 0){
  394. fprintf(inter_code,"tPOPtBXn");//get the value from the top of the stack
  395. fprintf(inter_code,"tPOPtAXn");//get the actual address at STACK segment
  396. fprintf(inter_code,"tMOVtDS:[AX] , BXn");//load value
  397. fprintf(inter_code,"tPUSHtBXn");
  398. }
  399. else{
  400. fprintf(inter_code,"tPOPtBXn");//get the value from the top of the stack
  401. fprintf(inter_code,"tPOPtAXn");//get the actual address at STACK segment
  402. fprintf(inter_code,"tPUSHtBPn");
  403. fprintf(inter_code,"tMOVtBP , AXn");
  404. fprintf(inter_code,"tMOVtSS:[BP] , BXn");//load value
  405. fprintf(inter_code,"tPOPtBPn");
  406. fprintf(inter_code,"tPUSHtBXn");
  407. }
  408. }
  410. void subi(void)
  411. {
  412. fprintf(inter_code,"tPOPtDXn");
  413. fprintf(inter_code,"tPOPtCXn");
  414. fprintf(inter_code,"tSUBtCX , DXn");
  415. fprintf(inter_code,"tPUSHtCXn");
  416. }
  418. void ujp(char *label)
  419. {
  420. fprintf(inter_code,"tJMPt%sn",label);
  421. }
  423. void write(void)
  424. {
  425. fprintf(inter_code,"tWRITEtproctfarn");//to code file
  426. fprintf(inter_code,"tPUSHtAXn");
  427. fprintf(inter_code,"tPUSHtBXn");
  428. fprintf(inter_code,"tPUSHtCXn");
  429. fprintf(inter_code,"tPUSHtDXn");
  430. fprintf(inter_code,"tPUSHtBPn");
  431. fprintf(inter_code,"tMOVtBP , SPn");//begin to accept local variables
  432. fprintf(inter_code,"tMOVtBX , [BP + 14]n");
  433. fprintf(inter_code,"tMOVtCX , 10000n");
  434. fprintf(inter_code,"tCMPtBX , CXn");
  435. fprintf(inter_code,"tJLtw_label1n");
  436. fprintf(inter_code,"tCALLtWRITE_SUBn");
  437. fprintf(inter_code,"w_label1:n");
  438. fprintf(inter_code,"tMOVtCX , 1000n");
  439. fprintf(inter_code,"tCMPtBX , CXn");
  440. fprintf(inter_code,"tJLtw_label2n");
  441. fprintf(inter_code,"tCALLtWRITE_SUBn");
  442. fprintf(inter_code,"w_label2:n");
  443. fprintf(inter_code,"tMOVtCX , 100n");
  444. fprintf(inter_code,"tCMPtBX , CXn");
  445. fprintf(inter_code,"tJLtw_label3n");
  446. fprintf(inter_code,"tCALLtWRITE_SUBn");
  447. fprintf(inter_code,"w_label3:n");
  448. fprintf(inter_code,"tMOVtCX , 10n");
  449. fprintf(inter_code,"tCMPtBX , CXn");
  450. fprintf(inter_code,"tJLtw_label4n");
  451. fprintf(inter_code,"tCALLtWRITE_SUBn");
  452. fprintf(inter_code,"w_label4:n");
  453. fprintf(inter_code,"tMOVtCX , 1n");
  454. fprintf(inter_code,"tCALLtWRITE_SUBn");
  455. fprintf(inter_code,"tMOVtSP , BPn");//release local parameters
  456. fprintf(inter_code,"tPOPtBPn");//pop bp
  457. fprintf(inter_code,"tPOPtDXn");
  458. fprintf(inter_code,"tPOPtCXn");
  459. fprintf(inter_code,"tPOPtBXn");
  460. fprintf(inter_code,"tPOPtAXn");
  461. fprintf(inter_code,"tRETn");
  462. fprintf(inter_code,"tWRITEtendpnn");
  464. fprintf(inter_code,"tWRITE_SUBtproctnearn");
  465. fprintf(inter_code,"tMOVtAX , BXn");
  466. fprintf(inter_code,"tMOVtDX , 0n");
  467. fprintf(inter_code,"tDIVtCXn");
  468. fprintf(inter_code,"tMOVtBX , DXn");
  469. fprintf(inter_code,"tMOVtDL , ALn");
  470. fprintf(inter_code,"tADDtDL , '0'n");
  471. fprintf(inter_code,"tMOVtAH , 02hn");
  472. fprintf(inter_code,"tINTt21hn");
  473. fprintf(inter_code,"tRETn");
  474. fprintf(inter_code,"tWRITE_SUBtendpnn");
  475. }
  477. void CodeGen_TreeNode(TreeNode * node)
  478. {
  479. TreeNode * temp;
  480. int count;
  481. while (node != NULL) 
  482. {
  483. switch(node ->nodekind){
  484. case Dec:
  485. switch(node-> kind.dec){
  486. case FunDecK:
  487. // more code to be filled
  488. break;
  489. case FunDefK:
  490. Fun = node;
  491. count = 0;
  492. temp = node-> child[0];
  493. while(temp)
  494. {
  495. count ++;
  496. temp = temp-> sibling;
  497. }
  498. ent(node ->attr.name, count, (node -> type != Void)? TRUE:FALSE);
  499. temp = node -> child[0]; // Param
  500. if(temp)
  501. CodeGen_TreeNode(temp);
  502. CodeGen_TreeNode(node ->child[1]); // comp_dec
  503. if(node -> type == Void)
  504. ret(FALSE,node ->attr.name);
  505. else
  506. ret(TRUE,node ->attr.name);
  507. leave(node ->attr.name);
  508. break;
  509. case VarK:
  510. temp = node -> child[0];
  511. if(node ->kind.exp == NumK)
  512. while(temp)
  513. {
  514. if(temp -> nodekind == Stmt) // AssignK ini
  515. VarDec_ini(temp ->child[0] ->attr.name, temp->child[1]->attr.val.i);
  516. else
  517. {
  518. if(temp ->child[0] == NULL)
  519. VarDec(temp ->attr.name);
  520. else
  521. ArrDec(temp ->attr.name, temp ->child[0] ->attr.val.i);
  522. }
  523. temp = temp ->sibling;
  524. }
  525. break;
  526. case CompK:
  527. pTable = node ->attr.table;
  528. temp = node ->child[0];
  529. if(temp) // Dec
  530. CodeGen_TreeNode(temp);
  531. temp = node ->child[1];
  532. if(temp) //stmt
  533. CodeGen_TreeNode(temp);
  534. compound_exit();
  535. break;
  536. case ParamK:
  537. break;
  538. default:
  539. break;
  540. }
  541. break;
  542. case Stmt:
  543. switch(node ->kind.stmt){
  544. case IfK:
  545. temp = node ->child[0];
  546. GenLabel(pTable ->lab1);
  547. GenLabel(pTable ->lab2);
  548. if(temp ->kind.exp == NumK) // optimize
  549. {
  550. if(temp -> attr.val.i == 0)
  551. ujp(pTable ->lab1);
  552. }
  553. else 
  554. {
  555. CodeGen_TreeNode(temp);
  556. fjp(pTable ->lab1);
  557. }
  558. pTable = node ->child[1] ->attr.table;
  559. if(node ->child[1])
  560. CodeGen_TreeNode(node ->child[1]);
  562. if(node ->child[2]) 
  563. ujp(pTable ->lab2);
  564. lab(pTable ->lab1);
  565. if(node ->child[2]) 
  566. {
  567. pTable = node ->child[2] ->attr.table;
  568. CodeGen_TreeNode(node ->child[2]);
  569. lab(pTable ->lab2);
  570. }
  571. break;
  572. case WhileK:
  573. GenLabel(pTable ->lab1);
  574. GenLabel(pTable ->lab2);
  575. lab(pTable ->lab1);
  576. temp = node ->child[0];
  577. if(temp ->kind.exp == NumK) // optimize
  578. {
  579. if(temp ->attr.val.i == 0)
  580. ujp(pTable ->lab2);
  581. }
  582. else
  583. {
  584. CodeGen_TreeNode(temp);
  585. fjp(pTable ->lab2);
  586. }
  587. if(node -> child[1])
  588. CodeGen_TreeNode(node -> child[1]);
  589. ujp(pTable ->lab1);
  590. lab(pTable ->lab2);
  591. break;
  592. case CallK:
  593. mst(node -> attr.name);
  594. temp = node ->child[0];
  595. CodeGen_TreeNode(temp);
  596. cup(node ->attr.name, count);
  597. while(temp) // Param
  598. {
  599. pop();
  600. temp = temp -> sibling;
  601. }
  603. if(node ->call_stmt == 1)
  604. pop();
  605. break;
  606. case ReturnK:
  607. temp = node -> child[0];
  608. if(temp)
  609. {
  610. CodeGen_TreeNode(temp);
  611. ret(TRUE,pTable ->funEntry ->name);
  612. }
  613. else ret(FALSE,pTable ->funEntry ->name);
  614. break;
  615. case BreakK:
  616. ujp(pTable ->parent ->lab2);
  617. break;
  618.         case ContinueK:
  619. ujp(pTable ->parent ->lab1);
  620. break;
  621. case AssignK:
  622. temp = node -> child[0];
  623. lda(temp ->attr.name);
  624. if(temp -> child[0])  //Arr
  625. {
  626. CodeGen_TreeNode(temp -> child[0]);
  627. ixa_elem_size();
  628. }
  629. CodeGen_TreeNode(node -> child[1]);
  630. stn(node -> child[0] ->attr.name);
  631. pop();
  632. break;
  633. default:
  634. break;
  635. }
  636. break;
  637. case Exp:
  638. switch(node -> kind.exp){
  639. case OpK:
  640. if(node -> child[0])
  641. CodeGen_TreeNode(node -> child[0]);
  642. if(node -> child[1])
  643. CodeGen_TreeNode(node -> child[1]);
  644. switch(node -> attr.op) {
  645. case PLUS: adi(); break;
  646. case SUB: subi(); break;
  647. case MUT: multi(); break;
  648. case DIV: divi(); break;
  649. case EQ: equi(); break;
  650. case NEQ: neqi(); break;
  651. case LE: lorei(); break;
  652. case GE: gorei(); break;
  653. case LT: less(); break;
  654. case GT: greater(); break;
  655. case AND: andi(); break;
  656. case OR: ori(); break;
  657. default: yyerror("Unknown Operator!");
  658. break;
  659. }
  660. break;
  661. case FnumK:
  662. //  more code to be filled
  663. break;
  664. case NumK:
  665. ldc(node -> attr.val.i);
  666. break;
  667. case CharK:
  668. // ldc(node -> attr.val.i);
  669. break;
  670. case IdK:
  671. lod(node -> attr.name);
  672. break;
  673. case NotK:
  674. break;
  675. default:
  676. break;
  677. }
  678. break;
  679. default:
  680. break;
  681. }
  682.     node = node->sibling;
  683. }
  684. }