comparison mc-inline.c @ 531:19f5882997f5

*** empty log message ***
author kono
date Fri, 30 Dec 2005 13:01:41 +0900
parents 58aceee8e4b4
children cecf5103679e
comparison
equal deleted inserted replaced
530:58aceee8e4b4 531:19f5882997f5
1008 return VOID; 1008 return VOID;
1009 } 1009 }
1010 1010
1011 #define round4(i) ((i+(SIZE_OF_INT-1))&~(SIZE_OF_INT-1)) 1011 #define round4(i) ((i+(SIZE_OF_INT-1))&~(SIZE_OF_INT-1))
1012 1012
1013 extern int lreg_count; 1013 // extern int lreg_count;
1014 1014
1015 extern int 1015 extern int
1016 gen_inline(int e) 1016 gen_inline(int e)
1017 { 1017 {
1018 // these saved value should be some struct 1018 // these saved value should be some struct
1024 int sdisp = pdisp; 1024 int sdisp = pdisp;
1025 int sret_register = ret_register; 1025 int sret_register = ret_register;
1026 int sret_reg_mode = ret_reg_mode; 1026 int sret_reg_mode = ret_reg_mode;
1027 int sinline_lvars = inline_lvars; 1027 int sinline_lvars = inline_lvars;
1028 int slfree=lfree; 1028 int slfree=lfree;
1029 int slreg_count=lreg_count; 1029 // int slreg_count=lreg_count;
1030 1030
1031 int narg,arg; 1031 int narg,arg;
1032 NMTBL *n = (NMTBL*)cadr(cadr(e)); 1032 NMTBL *n = (NMTBL*)cadr(cadr(e));
1033 int e1 = attr_value(n,INLINE); 1033 int e1 = attr_value(n,INLINE);
1034 int parse = car(e1); // inline parse tree 1034 int parse = car(e1); // inline parse tree
1113 ret_register = sret_register; 1113 ret_register = sret_register;
1114 ret_reg_mode = sret_reg_mode; 1114 ret_reg_mode = sret_reg_mode;
1115 inline_lvars = sinline_lvars; 1115 inline_lvars = sinline_lvars;
1116 lfree=slfree; 1116 lfree=slfree;
1117 1117
1118 if (slreg_count!=lreg_count && lreg_count>0) { 1118 // if (slreg_count!=lreg_count && lreg_count>0) {
1119 printf("## lreg_count %d != %d\n", slreg_count,lreg_count); 1119 // printf("## lreg_count %d != %d\n", slreg_count,lreg_count);
1120 } 1120 // }
1121 1121
1122 return ret_type; 1122 return ret_type;
1123 } 1123 }
1124 1124
1125 /* end */ 1125 /* end */