3 static char rcsid[] = "$Id: mktab.y,v 2.6 1994/06/24 10:40:20 ceriel Exp $";
15 * (c) copyright 1987 by the Vrije Universiteit, Amsterdam, The Netherlands.
16 * See the copyright notice in the ACK home directory, in the file "Copyright".
18 * Author: Hans van Staveren
21 #define op_CBO (op_plast+1)
24 expr_t nodes[MAXNODES];
25 expr_p lastnode = nodes+1;
27 int patlen,maxpatlen,rpllen;
31 int patmnem[MAX],rplmnem[MAX],rplexpr[MAX];
32 byte nparam[N_EX_OPS];
33 bool nonumlab[N_EX_OPS];
34 bool onlyconst[N_EX_OPS];
44 /* don't add op_mli and op_mlu! */
61 %left CMPLT,CMPLE,CMPGT,CMPGE
64 %left ARTIMES,ARDIVIDE,ARMOD
65 %nonassoc NOT,COMP,UMINUS
68 %token SFIT,UFIT,NOTREG,PSIZE,WSIZE,DEFINED,SAMESIGN,ROM,ROTATE,STRING
71 %type <y_int> expr,argno,optexpr
83 mnemlist optexpr ':' replacement '\n'
89 yyerror("No CBO in replacement");
91 for (i=0; i<sizeof(CBO_instrs)/sizeof(int); i++) {
92 outpat($2, CBO_instrs[i]);
104 : expr /* special optimization */
107 rpllen=1; rplmnem[0]=0; rplexpr[0]=$1;
109 yyerror("No specials allowed");
114 repllist: /* empty */
119 { rplmnem[rpllen] = $1; rplexpr[rpllen++] = $2;
122 yyerror("No CBO in pattern");
125 yyerror("Only one CBO allowed in replacement");
132 { patlen=0; patmnem[patlen++] = $1;
135 yyerror("Only one CBO allowed in pattern");
141 { patmnem[patlen++] = $2;
144 yyerror("Only one CBO allowed in pattern");
150 optexpr : /* empty */
156 { $$ = lookup(0,EX_ARG,$2,0); }
158 { $$ = lookup(0,EX_CON,(int)(short)$1,0); }
160 { $$ = lookup(0,EX_POINTERSIZE,0,0); }
162 { $$ = lookup(0,EX_WORDSIZE,0,0); }
163 | DEFINED '(' expr ')'
164 { $$ = lookup(0,EX_DEFINED,$3,0); }
165 | SAMESIGN '(' expr ',' expr ')'
166 { $$ = lookup(1,EX_SAMESIGN,$3,$5); }
167 | SFIT '(' expr ',' expr ')'
168 { $$ = lookup(0,EX_SFIT,$3,$5); }
169 | UFIT '(' expr ',' expr ')'
170 { $$ = lookup(0,EX_UFIT,$3,$5); }
171 | ROTATE '(' expr ',' expr ')'
172 { $$ = lookup(0,EX_ROTATE,$3,$5); }
173 | NOTREG '(' expr ')'
174 { $$ = lookup(0,EX_NOTREG,$3,0); }
175 | ROM '(' argno ',' expr ')'
176 { $$ = lookup(0,EX_ROM,$3,$5); }
180 { $$ = lookup(1,EX_CMPEQ,$1,$3); }
182 { $$ = lookup(1,EX_CMPNE,$1,$3); }
184 { $$ = lookup(0,EX_CMPGT,$1,$3); }
186 { $$ = lookup(0,EX_CMPGE,$1,$3); }
188 { $$ = lookup(0,EX_CMPLT,$1,$3); }
190 { $$ = lookup(0,EX_CMPLE,$1,$3); }
192 { $$ = lookup(0,EX_OR2,$1,$3); }
194 { $$ = lookup(0,EX_AND2,$1,$3); }
196 { $$ = lookup(1,EX_OR1,$1,$3); }
198 { $$ = lookup(1,EX_XOR1,$1,$3); }
200 { $$ = lookup(1,EX_AND1,$1,$3); }
202 { $$ = lookup(1,EX_PLUS,$1,$3); }
204 { $$ = lookup(0,EX_MINUS,$1,$3); }
206 { $$ = lookup(1,EX_TIMES,$1,$3); }
208 { $$ = lookup(0,EX_DIVIDE,$1,$3); }
210 { $$ = lookup(0,EX_MOD,$1,$3); }
212 { $$ = lookup(0,EX_LSHIFT,$1,$3); }
214 { $$ = lookup(0,EX_RSHIFT,$1,$3); }
215 | ARPLUS expr %prec UMINUS
217 | ARMINUS expr %prec UMINUS
218 { $$ = lookup(0,EX_UMINUS,$2,0); }
220 { $$ = lookup(0,EX_NOT,$2,0); }
222 { $$ = lookup(0,EX_COMP,$2,0); }
225 { if ($1<1 || $1>patlen) {
234 extern char em_mnem[][4];
236 #define HASHSIZE (2*(sp_lmnem-sp_fmnem))
241 } hashmnem[HASHSIZE];
252 for(i=0;i<=sp_lmnem-sp_fmnem;i++)
253 enter(em_mnem[i],i+sp_fmnem);
256 unsigned hashname(name) register char *name; {
260 h = (h<<4)^((*name++)&BMASK);
261 h = (h<<4)^((*name++)&BMASK);
265 enter(name,value) char *name; {
268 h=hashname(name)%HASHSIZE;
269 while (hashmnem[h].h_name[0] != 0)
271 strncpy(hashmnem[h].h_name,name,3);
272 hashmnem[h].h_value = value;
275 int mlookup(name) char *name; {
278 h = hashname(name)%HASHSIZE;
279 while (strncmp(hashmnem[h].h_name,name,3) != 0 &&
280 hashmnem[h].h_name[0] != 0)
282 return(hashmnem[h].h_value&BMASK); /* 0 if not found */
295 yyerror(s) char *s; {
297 fprintf(stderr,"line %d: %s\n",lino,s);
301 lookup(comm,operator,lnode,rnode) {
304 for (p=nodes+1;p<lastnode;p++) {
305 if (p->ex_operator != operator)
307 if (!(p->ex_lnode == lnode && p->ex_rnode == rnode ||
308 comm && p->ex_lnode == rnode && p->ex_rnode == lnode))
312 if (lastnode >= &nodes[MAXNODES])
313 yyerror("node table overflow");
315 p->ex_operator = operator;
324 printf("};\n\nshort lastind = %d;\n\nexpr_t enodes[] = {\n",prevind);
325 for (p=nodes;p<lastnode;p++)
326 printf("/* %3d */\t%3d,%6u,%6u,\n",
327 p-nodes,p->ex_operator,p->ex_lnode,p->ex_rnode);
328 printf("};\n\niarg_t iargs[%d];\n",maxpatlen);
330 printf("static char rcsid[] = %s;\n",patid);
336 printf("#include \"param.h\"\n#include \"types.h\"\n");
337 printf("#include \"pattern.h\"\n\n");
338 for(i=0;i<N_EX_OPS;i++) {
343 nparam[EX_POINTERSIZE] = 0;
344 nparam[EX_WORDSIZE] = 0;
348 nparam[EX_DEFINED] = 0;
351 nparam[EX_UMINUS] = 1;
354 nparam[EX_NOTREG] = 1;
355 nonumlab[EX_CMPEQ] = FALSE;
356 nonumlab[EX_CMPNE] = FALSE;
357 onlyconst[EX_CMPEQ] = FALSE;
358 onlyconst[EX_CMPNE] = FALSE;
359 onlyconst[EX_CMPLE] = FALSE;
360 onlyconst[EX_CMPLT] = FALSE;
361 onlyconst[EX_CMPGE] = FALSE;
362 onlyconst[EX_CMPGT] = FALSE;
363 onlyconst[EX_PLUS] = FALSE;
364 onlyconst[EX_MINUS] = FALSE;
365 printf("byte nparam[] = {");
366 for (i=0;i<N_EX_OPS;i++) printf("%d,",nparam[i]);
367 printf("};\nbool nonumlab[] = {");
368 for (i=0;i<N_EX_OPS;i++) printf("%d,",nonumlab[i]);
369 printf("};\nbool onlyconst[] = {");
370 for (i=0;i<N_EX_OPS;i++) printf("%d,",onlyconst[i]);
371 printf("};\n\nbyte pattern[] = { 0\n");
375 outpat(exprno, instrno)
379 outbyte(0); outshort(prevind); prevind=curind-3;
381 for (i=0;i<patlen;i++) {
382 if (patmnem[i] == op_CBO) outbyte(instrno);
383 else outbyte(patmnem[i]);
387 for (i=0;i<rpllen;i++) {
388 if (rplmnem[i] == op_CBO) outbyte(instrno);
389 else outbyte(rplmnem[i]);
397 if (patlen>maxpatlen) maxpatlen=patlen;
409 outbyte((s>>8)&0377);