home *** CD-ROM | disk | FTP | other *** search
/ EuroCD 3 / EuroCD 3.iso / Programming / vbcc / datatypes / dtgen.c < prev    next >
Encoding:
C/C++ Source or Header  |  1998-06-24  |  7.8 KB  |  303 lines
  1. #include <stdio.h>
  2. #include <string.h>
  3. #include <stdlib.h>
  4.  
  5. struct dtlist {char *spec,*descr;} dts[]={
  6. #include "datatypes.h"
  7. };
  8.  
  9. struct dtconvlist {char *from,*to,*filef,*filet;int size;} cnvs[]={
  10. #include "dtconv.h"
  11. };
  12.  
  13. int dtcnt=sizeof(dts)/sizeof(dts[0]);
  14. int cnvcnt=sizeof(cnvs)/sizeof(cnvs[0]);
  15.  
  16. char *have;
  17.  
  18. #define CHAR 1
  19. #define UCHAR 2
  20. #define SHORT 3 
  21. #define USHORT 4
  22. #define INT 5
  23. #define UINT 6
  24. #define LONG 7
  25. #define ULONG 8
  26. #define FLOAT 9
  27. #define DOUBLE 10
  28. #define POINTER 11
  29.  
  30. #define TYPECNT POINTER
  31.  
  32. char *typen[TYPECNT+1]={"error","char","uchar","short","ushort","int","uint",
  33.                 "long","ulong","float","double","pointer"};
  34. char *ftypen[TYPECNT+1]={"error","char","unsigned char","short","unsigned short",
  35.                                  "int","unsigned int","long","unsigned long",
  36.                                  "float","double","char *"};
  37.  
  38. int dt[TYPECNT+1],cnv[TYPECNT+1];
  39. char *nt[TYPECNT+1];
  40. FILE *fin,*cout,*hout;
  41. int crosscompiler;
  42.  
  43. void *mymalloc(size_t size)
  44. {
  45.   void *p=malloc(size);
  46.   if(!p){
  47.     printf("Out of memory!\n");
  48.     exit(EXIT_FAILURE);
  49.   }
  50.   return p;
  51. }
  52.  
  53. int askyn(void)
  54. {
  55.   char in[8];
  56.   do{
  57.     printf("Type y or n: ");
  58.     fflush(stdout);
  59.     fgets(in,127,stdin);
  60.   }while(*in!='y'&&*in!='n');
  61.   return *in=='y';
  62. }
  63.  
  64. char *asktype(void)
  65. {
  66.   char *in=mymalloc(128);
  67.   printf("Enter that type: ");
  68.   fflush(stdout);
  69.   fgets(in,127,stdin);
  70.   if(in[strlen(in)-1]=='\n') in[strlen(in)-1]=0;
  71.   return in;
  72. }
  73.  
  74. int tst(int type,char *spec)
  75. {
  76.   int i,j;
  77.   for(i=0;i<dtcnt;i++){
  78.     if(strstr(spec,dts[i].spec)){ 
  79.       if(have[i]==-2) continue;
  80.       if(have[i]>=0){
  81. /*     printf("auto: %s == %s\n",dts[i].spec,nt[have[i]]); */
  82.     dt[type]=i;
  83.     nt[type]=nt[have[i]];
  84.     cnv[type]=-1;
  85.     return 1;
  86.       }else{
  87.     printf("Does your system/compiler support a type implemented as\n%s?\n",dts[i].descr);
  88.     if(askyn()){
  89.       dt[type]=i;
  90.       nt[type]=asktype();
  91.       have[i]=type;
  92.       cnv[type]=-1;
  93.       return 1;
  94.     }else{
  95.       have[i]=-2;
  96.     }
  97.       }
  98.     }
  99.   }
  100.   for(j=0;j<cnvcnt;j++){
  101.     char *s=0;
  102.     if(strstr(spec,cnvs[j].from)) s=cnvs[j].to;
  103. /*     if(strstr(spec,cnvs[j].to)) s=cnvs[j].from; */
  104.     if(s){
  105.       for(i=0;i<dtcnt;i++){
  106.     if(!strcmp(s,dts[i].spec)){
  107.       if(have[i]==-2) continue;
  108.       if(have[i]>=0){
  109.         dt[type]=i;
  110.         nt[type]=nt[have[i]];
  111.         cnv[type]=j;
  112.         return 2;
  113.       }else{
  114.         printf("Does your system/compiler support a type implemented as\n%s?\n",dts[i].descr);
  115.         if(askyn()){
  116.           dt[type]=i;
  117.           nt[type]=asktype();
  118.           have[i]=type;
  119.           cnv[type]=j;
  120.           return 2;
  121.         }else{
  122.           have[i]=-2;
  123.         }
  124.       }
  125.     }
  126.       }
  127.     }
  128.   }
  129.   return 0;
  130. }
  131.     
  132. char *castfrom(int type)
  133. {
  134.   if(cnv[type]>=0){
  135.     char *s=mymalloc(16);
  136.     sprintf(s,"dtcnv%df",type);
  137.     return s;
  138.   }else{
  139.     return "";
  140.   }
  141. }
  142. char *castto(int type)
  143. {
  144.   if(cnv[type]>=0){
  145.     char *s=mymalloc(16);
  146.     sprintf(s,"dtcnv%dt",type);
  147.     return s;
  148.   }else{
  149.     return "";
  150.   }
  151. } 
  152. void gen_cast(char *name,int from,int to)
  153. {
  154.   fprintf(hout,"#define %s(x) %s((%s)%s(x))\n",name,castto(to),nt[to],castfrom(from));
  155. }
  156. void gen_2op(char *name,char *op,int type)
  157. {
  158.   fprintf(hout,"#define %s(a,b) %s(%s(a)%s%s(b))\n",name,castto(type),castfrom(type),op,castfrom(type));
  159. } 
  160. void gen_1op(char *name,char *op,int type)
  161. {
  162.   fprintf(hout,"#define %s(a) %s(%s%s(a))\n",name,castto(type),op,castfrom(type));
  163. } 
  164. void gen_cmp(char *name,char *op,int type)
  165. {
  166.   fprintf(hout,"#define %s(a,b) (%s(a)%s%s(b))\n",name,castfrom(type),op,castfrom(type));
  167. } 
  168. main(int argc,char **argv)
  169. {
  170.   char type[128],spec[128];
  171.   int i,r;
  172.   if(argc!=4){ printf("Usage: dtgen <config-file> <output-file.h> <output-file.c>\n");exit(EXIT_FAILURE);}
  173. /*   printf("%d datatypes, %d conversions\n",dtcnt,cnvcnt); */
  174.   have=mymalloc(dtcnt*sizeof(*have));
  175.   memset(have,-1,sizeof(*have)*dtcnt);
  176.   fin=fopen(argv[1],"r");
  177.   if(!fin){ printf("Could not open <%s> for input!\n",argv[1]);exit(EXIT_FAILURE);}
  178.   hout=fopen(argv[2],"w");
  179.   if(!hout){ printf("Could not open <%s> for output!\n",argv[2]);exit(EXIT_FAILURE);}
  180.   cout=fopen(argv[3],"w");
  181.   if(!hout){ printf("Could not open <%s> for output!\n",argv[3]);exit(EXIT_FAILURE);}
  182.   printf("Are you building a cross-compiler?\n");
  183.   crosscompiler=askyn();
  184.   for(i=1;i<=TYPECNT;i++){
  185.     fgets(spec,127,fin);
  186. /*     printf("Specs for z%s:\n%s\n",typen[i],spec); */
  187.     if(!crosscompiler){
  188.       dt[i]=i;
  189.       nt[i]=ftypen[i];
  190.       have[i]=i;
  191.       cnv[i]=-1;
  192.     }else{
  193.       if(!tst(i,spec)){
  194.     printf("Problem! Your system does not seem to provide all of the data types\n"
  195.            "this version of vbcc needs.\nWrite to volker@vb.franken.de!\n");
  196.     exit(EXIT_FAILURE);
  197.       }
  198.     }
  199.   }
  200.   fprintf(hout,"\n\n/* Machine generated file. DON'T TOUCH ME! */\n\n\n");
  201.   fprintf(cout,"\n\n/* Machine generated file. DON'T TOUCH ME! */\n\n\n");
  202.   fprintf(cout,"#include \"dt.h\"\n\n");
  203.   for(i=1;i<=TYPECNT;i++){
  204.     if(cnv[i]>=0){
  205.       fprintf(hout,"typedef struct {char a[%d];} dt%df;\n",cnvs[cnv[i]].size,i);
  206.       fprintf(hout,"typedef dt%df z%s;\n",i,typen[i]);
  207.       fprintf(hout,"typedef %s dt%dt;\n",nt[i],i);
  208.       fprintf(hout,"dt%dt dtcnv%df(dt%df);\n",i,i,i);
  209.       fprintf(hout,"dt%df dtcnv%dt(dt%dt);\n",i,i,i);
  210.       fprintf(cout,"#undef DTTTYPE\n#define DTTTYPE dt%dt\n",i);
  211.       fprintf(cout,"#undef DTFTYPE\n#define DTFTYPE dt%df\n",i);
  212.       fprintf(cout,"dt%dt dtcnv%df(dt%df\n",i,i,i);
  213.       fprintf(cout,"#include \"%s\"\n",cnvs[cnv[i]].filef);
  214.       fprintf(cout,"dt%df dtcnv%dt(dt%dt\n",i,i,i);
  215.       fprintf(cout,"#include \"%s\"\n",cnvs[cnv[i]].filet);
  216.     }else{
  217.       fprintf(hout,"typedef %s z%s;\n",nt[i],typen[i]);
  218.     }
  219.   }
  220.  
  221.   gen_cast("zc2zl",CHAR,LONG);
  222.   gen_cast("zs2zl",SHORT,LONG);
  223.   gen_cast("zi2zl",INT,LONG);
  224.   gen_cast("zl2zc",LONG,CHAR);
  225.   gen_cast("zl2zs",LONG,SHORT);
  226.   gen_cast("zl2zi",LONG,INT);
  227.   gen_cast("zuc2zul",UCHAR,ULONG);
  228.   gen_cast("zus2zul",USHORT,ULONG);
  229.   gen_cast("zui2zul",UINT,ULONG);
  230.   gen_cast("zul2zuc",ULONG,UCHAR);
  231.   gen_cast("zul2zus",ULONG,USHORT);
  232.   gen_cast("zul2zui",ULONG,UINT);
  233.   gen_cast("zul2zl",ULONG,LONG);
  234.   gen_cast("zl2zul",LONG,ULONG);
  235.   gen_cast("zf2zd",FLOAT,DOUBLE);
  236.   gen_cast("zd2zf",DOUBLE,FLOAT);
  237.   gen_cast("zd2zl",DOUBLE,LONG);
  238.   gen_cast("zl2zd",LONG,DOUBLE);
  239.   gen_cast("zd2zul",DOUBLE,ULONG);
  240.   gen_cast("zul2zd",ULONG,DOUBLE);
  241.   gen_cast("zp2zul",POINTER,ULONG);
  242.   gen_cast("zul2zp",ULONG,POINTER);
  243.  
  244.   fprintf(hout,"#define l2zl(x) %s((%s)(x))\n",castto(LONG),nt[LONG]);
  245.   fprintf(hout,"#define ul2zul(x) %s((%s)(x))\n",castto(ULONG),nt[ULONG]);
  246.   fprintf(hout,"#define d2zd(x) %s((%s)(x))\n",castto(DOUBLE),nt[DOUBLE]);
  247.   fprintf(hout,"#define zl2l(x) ((long)%s(x))\n",castfrom(LONG));
  248.   fprintf(hout,"#define zul2ul(x) ((unsigned long)%s(x))\n",castfrom(ULONG));
  249.   fprintf(hout,"#define zd2d(x) ((double)%s(x))\n",castfrom(DOUBLE));
  250.  
  251.   gen_2op("zladd","+",LONG);
  252.   gen_2op("zuladd","+",ULONG);
  253.   gen_2op("zdadd","+",DOUBLE);
  254.   gen_2op("zlsub","-",LONG);
  255.   gen_2op("zulsub","-",ULONG);
  256.   gen_2op("zdsub","-",DOUBLE);
  257.   gen_2op("zlmult","*",LONG);
  258.   gen_2op("zulmult","*",ULONG);
  259.   gen_2op("zdmult","*",DOUBLE);
  260.   gen_2op("zldiv","/",LONG);
  261.   gen_2op("zuldiv","/",ULONG);
  262.   gen_2op("zddiv","/",DOUBLE);
  263.   gen_2op("zlmod","%",LONG);
  264.   gen_2op("zulmod","%",ULONG);
  265.   gen_2op("zllshift","<<",LONG);
  266.   gen_2op("zullshift","<<",ULONG);
  267.   gen_2op("zlrshift",">>",LONG);
  268.   gen_2op("zulrshift",">>",ULONG);
  269.   gen_2op("zland","&",LONG);
  270.   gen_2op("zuland","&",ULONG);
  271.   gen_2op("zlor","|",LONG);
  272.   gen_2op("zulor","|",ULONG);
  273.   gen_2op("zlxor","^",LONG);
  274.   gen_2op("zulxor","^",ULONG);
  275.   gen_2op("zlmod","%",LONG);
  276.   gen_2op("zulmod","%",ULONG);
  277.  
  278.   gen_1op("zlkompl","~",LONG);
  279.   gen_1op("zulkompl","~",ULONG);
  280.  
  281.   gen_cmp("zlleq","<=",LONG);
  282.   gen_cmp("zulleq","<=",ULONG);
  283.   gen_cmp("zdleq","<=",DOUBLE);
  284.   gen_cmp("zpleq","<=",POINTER);
  285.   gen_cmp("zleqto","==",LONG);
  286.   gen_cmp("zuleqto","==",ULONG);
  287.   gen_cmp("zdeqto","==",DOUBLE);
  288.   gen_cmp("zpeqto","==",POINTER);
  289.  
  290.  
  291.   fclose(fin);
  292.   fclose(hout);
  293.   fclose(cout);
  294.   free(have);  
  295.   return 0;
  296. }
  297.  
  298.  
  299.  
  300.  
  301.  
  302.  
  303.