Mercurial > hg > truffle
annotate src/share/vm/adlc/output_c.cpp @ 909:b32a809aab08
6866585: debug code in ciObjectFactory too slow for large objects
Reviewed-by: ysr, never, kvn
author | jcoomes |
---|---|
date | Tue, 11 Aug 2009 23:24:41 -0700 |
parents | 2056494941db |
children | 844a9d73ec22 |
rev | line source |
---|---|
0 | 1 /* |
603
dbbe28fc66b5
6778669: Patch from Red Hat -- fixes compilation errors
twisti
parents:
415
diff
changeset
|
2 * Copyright 1998-2009 Sun Microsystems, Inc. All Rights Reserved. |
0 | 3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. |
4 * | |
5 * This code is free software; you can redistribute it and/or modify it | |
6 * under the terms of the GNU General Public License version 2 only, as | |
7 * published by the Free Software Foundation. | |
8 * | |
9 * This code is distributed in the hope that it will be useful, but WITHOUT | |
10 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or | |
11 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License | |
12 * version 2 for more details (a copy is included in the LICENSE file that | |
13 * accompanied this code). | |
14 * | |
15 * You should have received a copy of the GNU General Public License version | |
16 * 2 along with this work; if not, write to the Free Software Foundation, | |
17 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. | |
18 * | |
19 * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara, | |
20 * CA 95054 USA or visit www.sun.com if you need additional information or | |
21 * have any questions. | |
22 * | |
23 */ | |
24 | |
25 // output_c.cpp - Class CPP file output routines for architecture definition | |
26 | |
27 #include "adlc.hpp" | |
28 | |
29 // Utilities to characterize effect statements | |
30 static bool is_def(int usedef) { | |
31 switch(usedef) { | |
32 case Component::DEF: | |
33 case Component::USE_DEF: return true; break; | |
34 } | |
35 return false; | |
36 } | |
37 | |
38 static bool is_use(int usedef) { | |
39 switch(usedef) { | |
40 case Component::USE: | |
41 case Component::USE_DEF: | |
42 case Component::USE_KILL: return true; break; | |
43 } | |
44 return false; | |
45 } | |
46 | |
47 static bool is_kill(int usedef) { | |
48 switch(usedef) { | |
49 case Component::KILL: | |
50 case Component::USE_KILL: return true; break; | |
51 } | |
52 return false; | |
53 } | |
54 | |
55 // Define an array containing the machine register names, strings. | |
56 static void defineRegNames(FILE *fp, RegisterForm *registers) { | |
57 if (registers) { | |
58 fprintf(fp,"\n"); | |
59 fprintf(fp,"// An array of character pointers to machine register names.\n"); | |
60 fprintf(fp,"const char *Matcher::regName[REG_COUNT] = {\n"); | |
61 | |
62 // Output the register name for each register in the allocation classes | |
63 RegDef *reg_def = NULL; | |
64 RegDef *next = NULL; | |
65 registers->reset_RegDefs(); | |
66 for( reg_def = registers->iter_RegDefs(); reg_def != NULL; reg_def = next ) { | |
67 next = registers->iter_RegDefs(); | |
68 const char *comma = (next != NULL) ? "," : " // no trailing comma"; | |
69 fprintf(fp," \"%s\"%s\n", | |
70 reg_def->_regname, comma ); | |
71 } | |
72 | |
73 // Finish defining enumeration | |
74 fprintf(fp,"};\n"); | |
75 | |
76 fprintf(fp,"\n"); | |
77 fprintf(fp,"// An array of character pointers to machine register names.\n"); | |
78 fprintf(fp,"const VMReg OptoReg::opto2vm[REG_COUNT] = {\n"); | |
79 reg_def = NULL; | |
80 next = NULL; | |
81 registers->reset_RegDefs(); | |
82 for( reg_def = registers->iter_RegDefs(); reg_def != NULL; reg_def = next ) { | |
83 next = registers->iter_RegDefs(); | |
84 const char *comma = (next != NULL) ? "," : " // no trailing comma"; | |
85 fprintf(fp,"\t%s%s\n", reg_def->_concrete, comma ); | |
86 } | |
87 // Finish defining array | |
88 fprintf(fp,"\t};\n"); | |
89 fprintf(fp,"\n"); | |
90 | |
91 fprintf(fp," OptoReg::Name OptoReg::vm2opto[ConcreteRegisterImpl::number_of_registers];\n"); | |
92 | |
93 } | |
94 } | |
95 | |
96 // Define an array containing the machine register encoding values | |
97 static void defineRegEncodes(FILE *fp, RegisterForm *registers) { | |
98 if (registers) { | |
99 fprintf(fp,"\n"); | |
100 fprintf(fp,"// An array of the machine register encode values\n"); | |
101 fprintf(fp,"const unsigned char Matcher::_regEncode[REG_COUNT] = {\n"); | |
102 | |
103 // Output the register encoding for each register in the allocation classes | |
104 RegDef *reg_def = NULL; | |
105 RegDef *next = NULL; | |
106 registers->reset_RegDefs(); | |
107 for( reg_def = registers->iter_RegDefs(); reg_def != NULL; reg_def = next ) { | |
108 next = registers->iter_RegDefs(); | |
109 const char* register_encode = reg_def->register_encode(); | |
110 const char *comma = (next != NULL) ? "," : " // no trailing comma"; | |
111 int encval; | |
112 if (!ADLParser::is_int_token(register_encode, encval)) { | |
113 fprintf(fp," %s%s // %s\n", | |
114 register_encode, comma, reg_def->_regname ); | |
115 } else { | |
116 // Output known constants in hex char format (backward compatibility). | |
117 assert(encval < 256, "Exceeded supported width for register encoding"); | |
118 fprintf(fp," (unsigned char)'\\x%X'%s // %s\n", | |
119 encval, comma, reg_def->_regname ); | |
120 } | |
121 } | |
122 // Finish defining enumeration | |
123 fprintf(fp,"};\n"); | |
124 | |
125 } // Done defining array | |
126 } | |
127 | |
128 // Output an enumeration of register class names | |
129 static void defineRegClassEnum(FILE *fp, RegisterForm *registers) { | |
130 if (registers) { | |
131 // Output an enumeration of register class names | |
132 fprintf(fp,"\n"); | |
133 fprintf(fp,"// Enumeration of register class names\n"); | |
134 fprintf(fp, "enum machRegisterClass {\n"); | |
135 registers->_rclasses.reset(); | |
136 for( const char *class_name = NULL; | |
137 (class_name = registers->_rclasses.iter()) != NULL; ) { | |
138 fprintf(fp," %s,\n", toUpper( class_name )); | |
139 } | |
140 // Finish defining enumeration | |
141 fprintf(fp, " _last_Mach_Reg_Class\n"); | |
142 fprintf(fp, "};\n"); | |
143 } | |
144 } | |
145 | |
146 // Declare an enumeration of user-defined register classes | |
147 // and a list of register masks, one for each class. | |
148 void ArchDesc::declare_register_masks(FILE *fp_hpp) { | |
149 const char *rc_name; | |
150 | |
151 if( _register ) { | |
152 // Build enumeration of user-defined register classes. | |
153 defineRegClassEnum(fp_hpp, _register); | |
154 | |
155 // Generate a list of register masks, one for each class. | |
156 fprintf(fp_hpp,"\n"); | |
157 fprintf(fp_hpp,"// Register masks, one for each register class.\n"); | |
158 _register->_rclasses.reset(); | |
159 for( rc_name = NULL; | |
160 (rc_name = _register->_rclasses.iter()) != NULL; ) { | |
161 const char *prefix = ""; | |
162 RegClass *reg_class = _register->getRegClass(rc_name); | |
163 assert( reg_class, "Using an undefined register class"); | |
164 | |
165 int len = RegisterForm::RegMask_Size(); | |
166 fprintf(fp_hpp, "extern const RegMask %s%s_mask;\n", prefix, toUpper( rc_name ) ); | |
167 | |
168 if( reg_class->_stack_or_reg ) { | |
169 fprintf(fp_hpp, "extern const RegMask %sSTACK_OR_%s_mask;\n", prefix, toUpper( rc_name ) ); | |
170 } | |
171 } | |
172 } | |
173 } | |
174 | |
175 // Generate an enumeration of user-defined register classes | |
176 // and a list of register masks, one for each class. | |
177 void ArchDesc::build_register_masks(FILE *fp_cpp) { | |
178 const char *rc_name; | |
179 | |
180 if( _register ) { | |
181 // Generate a list of register masks, one for each class. | |
182 fprintf(fp_cpp,"\n"); | |
183 fprintf(fp_cpp,"// Register masks, one for each register class.\n"); | |
184 _register->_rclasses.reset(); | |
185 for( rc_name = NULL; | |
186 (rc_name = _register->_rclasses.iter()) != NULL; ) { | |
187 const char *prefix = ""; | |
188 RegClass *reg_class = _register->getRegClass(rc_name); | |
189 assert( reg_class, "Using an undefined register class"); | |
190 | |
191 int len = RegisterForm::RegMask_Size(); | |
192 fprintf(fp_cpp, "const RegMask %s%s_mask(", prefix, toUpper( rc_name ) ); | |
193 { int i; | |
194 for( i = 0; i < len-1; i++ ) | |
195 fprintf(fp_cpp," 0x%x,",reg_class->regs_in_word(i,false)); | |
196 fprintf(fp_cpp," 0x%x );\n",reg_class->regs_in_word(i,false)); | |
197 } | |
198 | |
199 if( reg_class->_stack_or_reg ) { | |
200 int i; | |
201 fprintf(fp_cpp, "const RegMask %sSTACK_OR_%s_mask(", prefix, toUpper( rc_name ) ); | |
202 for( i = 0; i < len-1; i++ ) | |
203 fprintf(fp_cpp," 0x%x,",reg_class->regs_in_word(i,true)); | |
204 fprintf(fp_cpp," 0x%x );\n",reg_class->regs_in_word(i,true)); | |
205 } | |
206 } | |
207 } | |
208 } | |
209 | |
210 // Compute an index for an array in the pipeline_reads_NNN arrays | |
211 static int pipeline_reads_initializer(FILE *fp_cpp, NameList &pipeline_reads, PipeClassForm *pipeclass) | |
212 { | |
213 int templen = 1; | |
214 int paramcount = 0; | |
215 const char *paramname; | |
216 | |
217 if (pipeclass->_parameters.count() == 0) | |
218 return -1; | |
219 | |
220 pipeclass->_parameters.reset(); | |
221 paramname = pipeclass->_parameters.iter(); | |
222 const PipeClassOperandForm *pipeopnd = | |
223 (const PipeClassOperandForm *)pipeclass->_localUsage[paramname]; | |
224 if (pipeopnd && !pipeopnd->isWrite() && strcmp(pipeopnd->_stage, "Universal")) | |
225 pipeclass->_parameters.reset(); | |
226 | |
227 while ( (paramname = pipeclass->_parameters.iter()) != NULL ) { | |
603
dbbe28fc66b5
6778669: Patch from Red Hat -- fixes compilation errors
twisti
parents:
415
diff
changeset
|
228 const PipeClassOperandForm *tmppipeopnd = |
0 | 229 (const PipeClassOperandForm *)pipeclass->_localUsage[paramname]; |
230 | |
603
dbbe28fc66b5
6778669: Patch from Red Hat -- fixes compilation errors
twisti
parents:
415
diff
changeset
|
231 if (tmppipeopnd) |
dbbe28fc66b5
6778669: Patch from Red Hat -- fixes compilation errors
twisti
parents:
415
diff
changeset
|
232 templen += 10 + (int)strlen(tmppipeopnd->_stage); |
0 | 233 else |
234 templen += 19; | |
235 | |
236 paramcount++; | |
237 } | |
238 | |
239 // See if the count is zero | |
240 if (paramcount == 0) { | |
241 return -1; | |
242 } | |
243 | |
244 char *operand_stages = new char [templen]; | |
245 operand_stages[0] = 0; | |
246 int i = 0; | |
247 templen = 0; | |
248 | |
249 pipeclass->_parameters.reset(); | |
250 paramname = pipeclass->_parameters.iter(); | |
251 pipeopnd = (const PipeClassOperandForm *)pipeclass->_localUsage[paramname]; | |
252 if (pipeopnd && !pipeopnd->isWrite() && strcmp(pipeopnd->_stage, "Universal")) | |
253 pipeclass->_parameters.reset(); | |
254 | |
255 while ( (paramname = pipeclass->_parameters.iter()) != NULL ) { | |
603
dbbe28fc66b5
6778669: Patch from Red Hat -- fixes compilation errors
twisti
parents:
415
diff
changeset
|
256 const PipeClassOperandForm *tmppipeopnd = |
0 | 257 (const PipeClassOperandForm *)pipeclass->_localUsage[paramname]; |
258 templen += sprintf(&operand_stages[templen], " stage_%s%c\n", | |
603
dbbe28fc66b5
6778669: Patch from Red Hat -- fixes compilation errors
twisti
parents:
415
diff
changeset
|
259 tmppipeopnd ? tmppipeopnd->_stage : "undefined", |
0 | 260 (++i < paramcount ? ',' : ' ') ); |
261 } | |
262 | |
263 // See if the same string is in the table | |
264 int ndx = pipeline_reads.index(operand_stages); | |
265 | |
266 // No, add it to the table | |
267 if (ndx < 0) { | |
268 pipeline_reads.addName(operand_stages); | |
269 ndx = pipeline_reads.index(operand_stages); | |
270 | |
271 fprintf(fp_cpp, "static const enum machPipelineStages pipeline_reads_%03d[%d] = {\n%s};\n\n", | |
272 ndx+1, paramcount, operand_stages); | |
273 } | |
274 else | |
275 delete [] operand_stages; | |
276 | |
277 return (ndx); | |
278 } | |
279 | |
280 // Compute an index for an array in the pipeline_res_stages_NNN arrays | |
281 static int pipeline_res_stages_initializer( | |
282 FILE *fp_cpp, | |
283 PipelineForm *pipeline, | |
284 NameList &pipeline_res_stages, | |
285 PipeClassForm *pipeclass) | |
286 { | |
287 const PipeClassResourceForm *piperesource; | |
288 int * res_stages = new int [pipeline->_rescount]; | |
289 int i; | |
290 | |
291 for (i = 0; i < pipeline->_rescount; i++) | |
292 res_stages[i] = 0; | |
293 | |
294 for (pipeclass->_resUsage.reset(); | |
295 (piperesource = (const PipeClassResourceForm *)pipeclass->_resUsage.iter()) != NULL; ) { | |
296 int used_mask = pipeline->_resdict[piperesource->_resource]->is_resource()->mask(); | |
297 for (i = 0; i < pipeline->_rescount; i++) | |
298 if ((1 << i) & used_mask) { | |
299 int stage = pipeline->_stages.index(piperesource->_stage); | |
300 if (res_stages[i] < stage+1) | |
301 res_stages[i] = stage+1; | |
302 } | |
303 } | |
304 | |
305 // Compute the length needed for the resource list | |
306 int commentlen = 0; | |
307 int max_stage = 0; | |
308 for (i = 0; i < pipeline->_rescount; i++) { | |
309 if (res_stages[i] == 0) { | |
310 if (max_stage < 9) | |
311 max_stage = 9; | |
312 } | |
313 else { | |
314 int stagelen = (int)strlen(pipeline->_stages.name(res_stages[i]-1)); | |
315 if (max_stage < stagelen) | |
316 max_stage = stagelen; | |
317 } | |
318 | |
319 commentlen += (int)strlen(pipeline->_reslist.name(i)); | |
320 } | |
321 | |
322 int templen = 1 + commentlen + pipeline->_rescount * (max_stage + 14); | |
323 | |
324 // Allocate space for the resource list | |
325 char * resource_stages = new char [templen]; | |
326 | |
327 templen = 0; | |
328 for (i = 0; i < pipeline->_rescount; i++) { | |
329 const char * const resname = | |
330 res_stages[i] == 0 ? "undefined" : pipeline->_stages.name(res_stages[i]-1); | |
331 | |
332 templen += sprintf(&resource_stages[templen], " stage_%s%-*s // %s\n", | |
333 resname, max_stage - (int)strlen(resname) + 1, | |
334 (i < pipeline->_rescount-1) ? "," : "", | |
335 pipeline->_reslist.name(i)); | |
336 } | |
337 | |
338 // See if the same string is in the table | |
339 int ndx = pipeline_res_stages.index(resource_stages); | |
340 | |
341 // No, add it to the table | |
342 if (ndx < 0) { | |
343 pipeline_res_stages.addName(resource_stages); | |
344 ndx = pipeline_res_stages.index(resource_stages); | |
345 | |
346 fprintf(fp_cpp, "static const enum machPipelineStages pipeline_res_stages_%03d[%d] = {\n%s};\n\n", | |
347 ndx+1, pipeline->_rescount, resource_stages); | |
348 } | |
349 else | |
350 delete [] resource_stages; | |
351 | |
352 delete [] res_stages; | |
353 | |
354 return (ndx); | |
355 } | |
356 | |
357 // Compute an index for an array in the pipeline_res_cycles_NNN arrays | |
358 static int pipeline_res_cycles_initializer( | |
359 FILE *fp_cpp, | |
360 PipelineForm *pipeline, | |
361 NameList &pipeline_res_cycles, | |
362 PipeClassForm *pipeclass) | |
363 { | |
364 const PipeClassResourceForm *piperesource; | |
365 int * res_cycles = new int [pipeline->_rescount]; | |
366 int i; | |
367 | |
368 for (i = 0; i < pipeline->_rescount; i++) | |
369 res_cycles[i] = 0; | |
370 | |
371 for (pipeclass->_resUsage.reset(); | |
372 (piperesource = (const PipeClassResourceForm *)pipeclass->_resUsage.iter()) != NULL; ) { | |
373 int used_mask = pipeline->_resdict[piperesource->_resource]->is_resource()->mask(); | |
374 for (i = 0; i < pipeline->_rescount; i++) | |
375 if ((1 << i) & used_mask) { | |
376 int cycles = piperesource->_cycles; | |
377 if (res_cycles[i] < cycles) | |
378 res_cycles[i] = cycles; | |
379 } | |
380 } | |
381 | |
382 // Pre-compute the string length | |
383 int templen; | |
384 int cyclelen = 0, commentlen = 0; | |
385 int max_cycles = 0; | |
386 char temp[32]; | |
387 | |
388 for (i = 0; i < pipeline->_rescount; i++) { | |
389 if (max_cycles < res_cycles[i]) | |
390 max_cycles = res_cycles[i]; | |
391 templen = sprintf(temp, "%d", res_cycles[i]); | |
392 if (cyclelen < templen) | |
393 cyclelen = templen; | |
394 commentlen += (int)strlen(pipeline->_reslist.name(i)); | |
395 } | |
396 | |
397 templen = 1 + commentlen + (cyclelen + 8) * pipeline->_rescount; | |
398 | |
399 // Allocate space for the resource list | |
400 char * resource_cycles = new char [templen]; | |
401 | |
402 templen = 0; | |
403 | |
404 for (i = 0; i < pipeline->_rescount; i++) { | |
405 templen += sprintf(&resource_cycles[templen], " %*d%c // %s\n", | |
406 cyclelen, res_cycles[i], (i < pipeline->_rescount-1) ? ',' : ' ', pipeline->_reslist.name(i)); | |
407 } | |
408 | |
409 // See if the same string is in the table | |
410 int ndx = pipeline_res_cycles.index(resource_cycles); | |
411 | |
412 // No, add it to the table | |
413 if (ndx < 0) { | |
414 pipeline_res_cycles.addName(resource_cycles); | |
415 ndx = pipeline_res_cycles.index(resource_cycles); | |
416 | |
417 fprintf(fp_cpp, "static const uint pipeline_res_cycles_%03d[%d] = {\n%s};\n\n", | |
418 ndx+1, pipeline->_rescount, resource_cycles); | |
419 } | |
420 else | |
421 delete [] resource_cycles; | |
422 | |
423 delete [] res_cycles; | |
424 | |
425 return (ndx); | |
426 } | |
427 | |
428 //typedef unsigned long long uint64_t; | |
429 | |
430 // Compute an index for an array in the pipeline_res_mask_NNN arrays | |
431 static int pipeline_res_mask_initializer( | |
432 FILE *fp_cpp, | |
433 PipelineForm *pipeline, | |
434 NameList &pipeline_res_mask, | |
435 NameList &pipeline_res_args, | |
436 PipeClassForm *pipeclass) | |
437 { | |
438 const PipeClassResourceForm *piperesource; | |
439 const uint rescount = pipeline->_rescount; | |
440 const uint maxcycleused = pipeline->_maxcycleused; | |
441 const uint cyclemasksize = (maxcycleused + 31) >> 5; | |
442 | |
443 int i, j; | |
444 int element_count = 0; | |
445 uint *res_mask = new uint [cyclemasksize]; | |
446 uint resources_used = 0; | |
447 uint resources_used_exclusively = 0; | |
448 | |
449 for (pipeclass->_resUsage.reset(); | |
450 (piperesource = (const PipeClassResourceForm *)pipeclass->_resUsage.iter()) != NULL; ) | |
451 element_count++; | |
452 | |
453 // Pre-compute the string length | |
454 int templen; | |
455 int commentlen = 0; | |
456 int max_cycles = 0; | |
457 | |
458 int cyclelen = ((maxcycleused + 3) >> 2); | |
459 int masklen = (rescount + 3) >> 2; | |
460 | |
461 int cycledigit = 0; | |
462 for (i = maxcycleused; i > 0; i /= 10) | |
463 cycledigit++; | |
464 | |
465 int maskdigit = 0; | |
466 for (i = rescount; i > 0; i /= 10) | |
467 maskdigit++; | |
468 | |
469 static const char * pipeline_use_cycle_mask = "Pipeline_Use_Cycle_Mask"; | |
470 static const char * pipeline_use_element = "Pipeline_Use_Element"; | |
471 | |
472 templen = 1 + | |
473 (int)(strlen(pipeline_use_cycle_mask) + (int)strlen(pipeline_use_element) + | |
474 (cyclemasksize * 12) + masklen + (cycledigit * 2) + 30) * element_count; | |
475 | |
476 // Allocate space for the resource list | |
477 char * resource_mask = new char [templen]; | |
478 char * last_comma = NULL; | |
479 | |
480 templen = 0; | |
481 | |
482 for (pipeclass->_resUsage.reset(); | |
483 (piperesource = (const PipeClassResourceForm *)pipeclass->_resUsage.iter()) != NULL; ) { | |
484 int used_mask = pipeline->_resdict[piperesource->_resource]->is_resource()->mask(); | |
485 | |
486 if (!used_mask) | |
487 fprintf(stderr, "*** used_mask is 0 ***\n"); | |
488 | |
489 resources_used |= used_mask; | |
490 | |
491 uint lb, ub; | |
492 | |
493 for (lb = 0; (used_mask & (1 << lb)) == 0; lb++); | |
494 for (ub = 31; (used_mask & (1 << ub)) == 0; ub--); | |
495 | |
496 if (lb == ub) | |
497 resources_used_exclusively |= used_mask; | |
498 | |
499 int formatlen = | |
500 sprintf(&resource_mask[templen], " %s(0x%0*x, %*d, %*d, %s %s(", | |
501 pipeline_use_element, | |
502 masklen, used_mask, | |
503 cycledigit, lb, cycledigit, ub, | |
504 ((used_mask & (used_mask-1)) != 0) ? "true, " : "false,", | |
505 pipeline_use_cycle_mask); | |
506 | |
507 templen += formatlen; | |
508 | |
509 memset(res_mask, 0, cyclemasksize * sizeof(uint)); | |
510 | |
511 int cycles = piperesource->_cycles; | |
512 uint stage = pipeline->_stages.index(piperesource->_stage); | |
513 uint upper_limit = stage+cycles-1; | |
514 uint lower_limit = stage-1; | |
515 uint upper_idx = upper_limit >> 5; | |
516 uint lower_idx = lower_limit >> 5; | |
517 uint upper_position = upper_limit & 0x1f; | |
518 uint lower_position = lower_limit & 0x1f; | |
519 | |
520 uint mask = (((uint)1) << upper_position) - 1; | |
521 | |
522 while ( upper_idx > lower_idx ) { | |
523 res_mask[upper_idx--] |= mask; | |
524 mask = (uint)-1; | |
525 } | |
526 | |
527 mask -= (((uint)1) << lower_position) - 1; | |
528 res_mask[upper_idx] |= mask; | |
529 | |
530 for (j = cyclemasksize-1; j >= 0; j--) { | |
531 formatlen = | |
532 sprintf(&resource_mask[templen], "0x%08x%s", res_mask[j], j > 0 ? ", " : ""); | |
533 templen += formatlen; | |
534 } | |
535 | |
536 resource_mask[templen++] = ')'; | |
537 resource_mask[templen++] = ')'; | |
538 last_comma = &resource_mask[templen]; | |
539 resource_mask[templen++] = ','; | |
540 resource_mask[templen++] = '\n'; | |
541 } | |
542 | |
543 resource_mask[templen] = 0; | |
544 if (last_comma) | |
545 last_comma[0] = ' '; | |
546 | |
547 // See if the same string is in the table | |
548 int ndx = pipeline_res_mask.index(resource_mask); | |
549 | |
550 // No, add it to the table | |
551 if (ndx < 0) { | |
552 pipeline_res_mask.addName(resource_mask); | |
553 ndx = pipeline_res_mask.index(resource_mask); | |
554 | |
555 if (strlen(resource_mask) > 0) | |
556 fprintf(fp_cpp, "static const Pipeline_Use_Element pipeline_res_mask_%03d[%d] = {\n%s};\n\n", | |
557 ndx+1, element_count, resource_mask); | |
558 | |
559 char * args = new char [9 + 2*masklen + maskdigit]; | |
560 | |
561 sprintf(args, "0x%0*x, 0x%0*x, %*d", | |
562 masklen, resources_used, | |
563 masklen, resources_used_exclusively, | |
564 maskdigit, element_count); | |
565 | |
566 pipeline_res_args.addName(args); | |
567 } | |
568 else | |
569 delete [] resource_mask; | |
570 | |
571 delete [] res_mask; | |
572 //delete [] res_masks; | |
573 | |
574 return (ndx); | |
575 } | |
576 | |
577 void ArchDesc::build_pipe_classes(FILE *fp_cpp) { | |
578 const char *classname; | |
579 const char *resourcename; | |
580 int resourcenamelen = 0; | |
581 NameList pipeline_reads; | |
582 NameList pipeline_res_stages; | |
583 NameList pipeline_res_cycles; | |
584 NameList pipeline_res_masks; | |
585 NameList pipeline_res_args; | |
586 const int default_latency = 1; | |
587 const int non_operand_latency = 0; | |
588 const int node_latency = 0; | |
589 | |
590 if (!_pipeline) { | |
591 fprintf(fp_cpp, "uint Node::latency(uint i) const {\n"); | |
592 fprintf(fp_cpp, " // assert(false, \"pipeline functionality is not defined\");\n"); | |
593 fprintf(fp_cpp, " return %d;\n", non_operand_latency); | |
594 fprintf(fp_cpp, "}\n"); | |
595 return; | |
596 } | |
597 | |
598 fprintf(fp_cpp, "\n"); | |
599 fprintf(fp_cpp, "//------------------Pipeline Methods-----------------------------------------\n"); | |
600 fprintf(fp_cpp, "#ifndef PRODUCT\n"); | |
601 fprintf(fp_cpp, "const char * Pipeline::stageName(uint s) {\n"); | |
602 fprintf(fp_cpp, " static const char * const _stage_names[] = {\n"); | |
603 fprintf(fp_cpp, " \"undefined\""); | |
604 | |
605 for (int s = 0; s < _pipeline->_stagecnt; s++) | |
606 fprintf(fp_cpp, ", \"%s\"", _pipeline->_stages.name(s)); | |
607 | |
608 fprintf(fp_cpp, "\n };\n\n"); | |
609 fprintf(fp_cpp, " return (s <= %d ? _stage_names[s] : \"???\");\n", | |
610 _pipeline->_stagecnt); | |
611 fprintf(fp_cpp, "}\n"); | |
612 fprintf(fp_cpp, "#endif\n\n"); | |
613 | |
614 fprintf(fp_cpp, "uint Pipeline::functional_unit_latency(uint start, const Pipeline *pred) const {\n"); | |
615 fprintf(fp_cpp, " // See if the functional units overlap\n"); | |
616 #if 0 | |
617 fprintf(fp_cpp, "\n#ifndef PRODUCT\n"); | |
618 fprintf(fp_cpp, " if (TraceOptoOutput) {\n"); | |
619 fprintf(fp_cpp, " tty->print(\"# functional_unit_latency: start == %%d, this->exclusively == 0x%%03x, pred->exclusively == 0x%%03x\\n\", start, resourcesUsedExclusively(), pred->resourcesUsedExclusively());\n"); | |
620 fprintf(fp_cpp, " }\n"); | |
621 fprintf(fp_cpp, "#endif\n\n"); | |
622 #endif | |
623 fprintf(fp_cpp, " uint mask = resourcesUsedExclusively() & pred->resourcesUsedExclusively();\n"); | |
624 fprintf(fp_cpp, " if (mask == 0)\n return (start);\n\n"); | |
625 #if 0 | |
626 fprintf(fp_cpp, "\n#ifndef PRODUCT\n"); | |
627 fprintf(fp_cpp, " if (TraceOptoOutput) {\n"); | |
628 fprintf(fp_cpp, " tty->print(\"# functional_unit_latency: mask == 0x%%x\\n\", mask);\n"); | |
629 fprintf(fp_cpp, " }\n"); | |
630 fprintf(fp_cpp, "#endif\n\n"); | |
631 #endif | |
632 fprintf(fp_cpp, " for (uint i = 0; i < pred->resourceUseCount(); i++) {\n"); | |
633 fprintf(fp_cpp, " const Pipeline_Use_Element *predUse = pred->resourceUseElement(i);\n"); | |
634 fprintf(fp_cpp, " if (predUse->multiple())\n"); | |
635 fprintf(fp_cpp, " continue;\n\n"); | |
636 fprintf(fp_cpp, " for (uint j = 0; j < resourceUseCount(); j++) {\n"); | |
637 fprintf(fp_cpp, " const Pipeline_Use_Element *currUse = resourceUseElement(j);\n"); | |
638 fprintf(fp_cpp, " if (currUse->multiple())\n"); | |
639 fprintf(fp_cpp, " continue;\n\n"); | |
640 fprintf(fp_cpp, " if (predUse->used() & currUse->used()) {\n"); | |
641 fprintf(fp_cpp, " Pipeline_Use_Cycle_Mask x = predUse->mask();\n"); | |
642 fprintf(fp_cpp, " Pipeline_Use_Cycle_Mask y = currUse->mask();\n\n"); | |
643 fprintf(fp_cpp, " for ( y <<= start; x.overlaps(y); start++ )\n"); | |
644 fprintf(fp_cpp, " y <<= 1;\n"); | |
645 fprintf(fp_cpp, " }\n"); | |
646 fprintf(fp_cpp, " }\n"); | |
647 fprintf(fp_cpp, " }\n\n"); | |
648 fprintf(fp_cpp, " // There is the potential for overlap\n"); | |
649 fprintf(fp_cpp, " return (start);\n"); | |
650 fprintf(fp_cpp, "}\n\n"); | |
651 fprintf(fp_cpp, "// The following two routines assume that the root Pipeline_Use entity\n"); | |
652 fprintf(fp_cpp, "// consists of exactly 1 element for each functional unit\n"); | |
653 fprintf(fp_cpp, "// start is relative to the current cycle; used for latency-based info\n"); | |
654 fprintf(fp_cpp, "uint Pipeline_Use::full_latency(uint delay, const Pipeline_Use &pred) const {\n"); | |
655 fprintf(fp_cpp, " for (uint i = 0; i < pred._count; i++) {\n"); | |
656 fprintf(fp_cpp, " const Pipeline_Use_Element *predUse = pred.element(i);\n"); | |
657 fprintf(fp_cpp, " if (predUse->_multiple) {\n"); | |
658 fprintf(fp_cpp, " uint min_delay = %d;\n", | |
659 _pipeline->_maxcycleused+1); | |
660 fprintf(fp_cpp, " // Multiple possible functional units, choose first unused one\n"); | |
661 fprintf(fp_cpp, " for (uint j = predUse->_lb; j <= predUse->_ub; j++) {\n"); | |
662 fprintf(fp_cpp, " const Pipeline_Use_Element *currUse = element(j);\n"); | |
663 fprintf(fp_cpp, " uint curr_delay = delay;\n"); | |
664 fprintf(fp_cpp, " if (predUse->_used & currUse->_used) {\n"); | |
665 fprintf(fp_cpp, " Pipeline_Use_Cycle_Mask x = predUse->_mask;\n"); | |
666 fprintf(fp_cpp, " Pipeline_Use_Cycle_Mask y = currUse->_mask;\n\n"); | |
667 fprintf(fp_cpp, " for ( y <<= curr_delay; x.overlaps(y); curr_delay++ )\n"); | |
668 fprintf(fp_cpp, " y <<= 1;\n"); | |
669 fprintf(fp_cpp, " }\n"); | |
670 fprintf(fp_cpp, " if (min_delay > curr_delay)\n min_delay = curr_delay;\n"); | |
671 fprintf(fp_cpp, " }\n"); | |
672 fprintf(fp_cpp, " if (delay < min_delay)\n delay = min_delay;\n"); | |
673 fprintf(fp_cpp, " }\n"); | |
674 fprintf(fp_cpp, " else {\n"); | |
675 fprintf(fp_cpp, " for (uint j = predUse->_lb; j <= predUse->_ub; j++) {\n"); | |
676 fprintf(fp_cpp, " const Pipeline_Use_Element *currUse = element(j);\n"); | |
677 fprintf(fp_cpp, " if (predUse->_used & currUse->_used) {\n"); | |
678 fprintf(fp_cpp, " Pipeline_Use_Cycle_Mask x = predUse->_mask;\n"); | |
679 fprintf(fp_cpp, " Pipeline_Use_Cycle_Mask y = currUse->_mask;\n\n"); | |
680 fprintf(fp_cpp, " for ( y <<= delay; x.overlaps(y); delay++ )\n"); | |
681 fprintf(fp_cpp, " y <<= 1;\n"); | |
682 fprintf(fp_cpp, " }\n"); | |
683 fprintf(fp_cpp, " }\n"); | |
684 fprintf(fp_cpp, " }\n"); | |
685 fprintf(fp_cpp, " }\n\n"); | |
686 fprintf(fp_cpp, " return (delay);\n"); | |
687 fprintf(fp_cpp, "}\n\n"); | |
688 fprintf(fp_cpp, "void Pipeline_Use::add_usage(const Pipeline_Use &pred) {\n"); | |
689 fprintf(fp_cpp, " for (uint i = 0; i < pred._count; i++) {\n"); | |
690 fprintf(fp_cpp, " const Pipeline_Use_Element *predUse = pred.element(i);\n"); | |
691 fprintf(fp_cpp, " if (predUse->_multiple) {\n"); | |
692 fprintf(fp_cpp, " // Multiple possible functional units, choose first unused one\n"); | |
693 fprintf(fp_cpp, " for (uint j = predUse->_lb; j <= predUse->_ub; j++) {\n"); | |
694 fprintf(fp_cpp, " Pipeline_Use_Element *currUse = element(j);\n"); | |
695 fprintf(fp_cpp, " if ( !predUse->_mask.overlaps(currUse->_mask) ) {\n"); | |
696 fprintf(fp_cpp, " currUse->_used |= (1 << j);\n"); | |
697 fprintf(fp_cpp, " _resources_used |= (1 << j);\n"); | |
698 fprintf(fp_cpp, " currUse->_mask.Or(predUse->_mask);\n"); | |
699 fprintf(fp_cpp, " break;\n"); | |
700 fprintf(fp_cpp, " }\n"); | |
701 fprintf(fp_cpp, " }\n"); | |
702 fprintf(fp_cpp, " }\n"); | |
703 fprintf(fp_cpp, " else {\n"); | |
704 fprintf(fp_cpp, " for (uint j = predUse->_lb; j <= predUse->_ub; j++) {\n"); | |
705 fprintf(fp_cpp, " Pipeline_Use_Element *currUse = element(j);\n"); | |
706 fprintf(fp_cpp, " currUse->_used |= (1 << j);\n"); | |
707 fprintf(fp_cpp, " _resources_used |= (1 << j);\n"); | |
708 fprintf(fp_cpp, " currUse->_mask.Or(predUse->_mask);\n"); | |
709 fprintf(fp_cpp, " }\n"); | |
710 fprintf(fp_cpp, " }\n"); | |
711 fprintf(fp_cpp, " }\n"); | |
712 fprintf(fp_cpp, "}\n\n"); | |
713 | |
714 fprintf(fp_cpp, "uint Pipeline::operand_latency(uint opnd, const Pipeline *pred) const {\n"); | |
715 fprintf(fp_cpp, " int const default_latency = 1;\n"); | |
716 fprintf(fp_cpp, "\n"); | |
717 #if 0 | |
718 fprintf(fp_cpp, "#ifndef PRODUCT\n"); | |
719 fprintf(fp_cpp, " if (TraceOptoOutput) {\n"); | |
720 fprintf(fp_cpp, " tty->print(\"# operand_latency(%%d), _read_stage_count = %%d\\n\", opnd, _read_stage_count);\n"); | |
721 fprintf(fp_cpp, " }\n"); | |
722 fprintf(fp_cpp, "#endif\n\n"); | |
723 #endif | |
724 fprintf(fp_cpp, " assert(this, \"NULL pipeline info\")\n"); | |
725 fprintf(fp_cpp, " assert(pred, \"NULL predecessor pipline info\")\n\n"); | |
726 fprintf(fp_cpp, " if (pred->hasFixedLatency())\n return (pred->fixedLatency());\n\n"); | |
727 fprintf(fp_cpp, " // If this is not an operand, then assume a dependence with 0 latency\n"); | |
728 fprintf(fp_cpp, " if (opnd > _read_stage_count)\n return (0);\n\n"); | |
729 fprintf(fp_cpp, " uint writeStage = pred->_write_stage;\n"); | |
730 fprintf(fp_cpp, " uint readStage = _read_stages[opnd-1];\n"); | |
731 #if 0 | |
732 fprintf(fp_cpp, "\n#ifndef PRODUCT\n"); | |
733 fprintf(fp_cpp, " if (TraceOptoOutput) {\n"); | |
734 fprintf(fp_cpp, " tty->print(\"# operand_latency: writeStage=%%s readStage=%%s, opnd=%%d\\n\", stageName(writeStage), stageName(readStage), opnd);\n"); | |
735 fprintf(fp_cpp, " }\n"); | |
736 fprintf(fp_cpp, "#endif\n\n"); | |
737 #endif | |
738 fprintf(fp_cpp, "\n"); | |
739 fprintf(fp_cpp, " if (writeStage == stage_undefined || readStage == stage_undefined)\n"); | |
740 fprintf(fp_cpp, " return (default_latency);\n"); | |
741 fprintf(fp_cpp, "\n"); | |
742 fprintf(fp_cpp, " int delta = writeStage - readStage;\n"); | |
743 fprintf(fp_cpp, " if (delta < 0) delta = 0;\n\n"); | |
744 #if 0 | |
745 fprintf(fp_cpp, "\n#ifndef PRODUCT\n"); | |
746 fprintf(fp_cpp, " if (TraceOptoOutput) {\n"); | |
747 fprintf(fp_cpp, " tty->print(\"# operand_latency: delta=%%d\\n\", delta);\n"); | |
748 fprintf(fp_cpp, " }\n"); | |
749 fprintf(fp_cpp, "#endif\n\n"); | |
750 #endif | |
751 fprintf(fp_cpp, " return (delta);\n"); | |
752 fprintf(fp_cpp, "}\n\n"); | |
753 | |
754 if (!_pipeline) | |
755 /* Do Nothing */; | |
756 | |
757 else if (_pipeline->_maxcycleused <= | |
758 #ifdef SPARC | |
759 64 | |
760 #else | |
761 32 | |
762 #endif | |
763 ) { | |
764 fprintf(fp_cpp, "Pipeline_Use_Cycle_Mask operator&(const Pipeline_Use_Cycle_Mask &in1, const Pipeline_Use_Cycle_Mask &in2) {\n"); | |
765 fprintf(fp_cpp, " return Pipeline_Use_Cycle_Mask(in1._mask & in2._mask);\n"); | |
766 fprintf(fp_cpp, "}\n\n"); | |
767 fprintf(fp_cpp, "Pipeline_Use_Cycle_Mask operator|(const Pipeline_Use_Cycle_Mask &in1, const Pipeline_Use_Cycle_Mask &in2) {\n"); | |
768 fprintf(fp_cpp, " return Pipeline_Use_Cycle_Mask(in1._mask | in2._mask);\n"); | |
769 fprintf(fp_cpp, "}\n\n"); | |
770 } | |
771 else { | |
772 uint l; | |
773 uint masklen = (_pipeline->_maxcycleused + 31) >> 5; | |
774 fprintf(fp_cpp, "Pipeline_Use_Cycle_Mask operator&(const Pipeline_Use_Cycle_Mask &in1, const Pipeline_Use_Cycle_Mask &in2) {\n"); | |
775 fprintf(fp_cpp, " return Pipeline_Use_Cycle_Mask("); | |
776 for (l = 1; l <= masklen; l++) | |
777 fprintf(fp_cpp, "in1._mask%d & in2._mask%d%s\n", l, l, l < masklen ? ", " : ""); | |
778 fprintf(fp_cpp, ");\n"); | |
779 fprintf(fp_cpp, "}\n\n"); | |
780 fprintf(fp_cpp, "Pipeline_Use_Cycle_Mask operator|(const Pipeline_Use_Cycle_Mask &in1, const Pipeline_Use_Cycle_Mask &in2) {\n"); | |
781 fprintf(fp_cpp, " return Pipeline_Use_Cycle_Mask("); | |
782 for (l = 1; l <= masklen; l++) | |
783 fprintf(fp_cpp, "in1._mask%d | in2._mask%d%s", l, l, l < masklen ? ", " : ""); | |
784 fprintf(fp_cpp, ");\n"); | |
785 fprintf(fp_cpp, "}\n\n"); | |
786 fprintf(fp_cpp, "void Pipeline_Use_Cycle_Mask::Or(const Pipeline_Use_Cycle_Mask &in2) {\n "); | |
787 for (l = 1; l <= masklen; l++) | |
788 fprintf(fp_cpp, " _mask%d |= in2._mask%d;", l, l); | |
789 fprintf(fp_cpp, "\n}\n\n"); | |
790 } | |
791 | |
792 /* Get the length of all the resource names */ | |
793 for (_pipeline->_reslist.reset(), resourcenamelen = 0; | |
794 (resourcename = _pipeline->_reslist.iter()) != NULL; | |
795 resourcenamelen += (int)strlen(resourcename)); | |
796 | |
797 // Create the pipeline class description | |
798 | |
799 fprintf(fp_cpp, "static const Pipeline pipeline_class_Zero_Instructions(0, 0, true, 0, 0, false, false, false, false, NULL, NULL, NULL, Pipeline_Use(0, 0, 0, NULL));\n\n"); | |
800 fprintf(fp_cpp, "static const Pipeline pipeline_class_Unknown_Instructions(0, 0, true, 0, 0, false, true, true, false, NULL, NULL, NULL, Pipeline_Use(0, 0, 0, NULL));\n\n"); | |
801 | |
802 fprintf(fp_cpp, "const Pipeline_Use_Element Pipeline_Use::elaborated_elements[%d] = {\n", _pipeline->_rescount); | |
803 for (int i1 = 0; i1 < _pipeline->_rescount; i1++) { | |
804 fprintf(fp_cpp, " Pipeline_Use_Element(0, %d, %d, false, Pipeline_Use_Cycle_Mask(", i1, i1); | |
805 uint masklen = (_pipeline->_maxcycleused + 31) >> 5; | |
806 for (int i2 = masklen-1; i2 >= 0; i2--) | |
807 fprintf(fp_cpp, "0%s", i2 > 0 ? ", " : ""); | |
808 fprintf(fp_cpp, "))%s\n", i1 < (_pipeline->_rescount-1) ? "," : ""); | |
809 } | |
810 fprintf(fp_cpp, "};\n\n"); | |
811 | |
812 fprintf(fp_cpp, "const Pipeline_Use Pipeline_Use::elaborated_use(0, 0, %d, (Pipeline_Use_Element *)&elaborated_elements[0]);\n\n", | |
813 _pipeline->_rescount); | |
814 | |
815 for (_pipeline->_classlist.reset(); (classname = _pipeline->_classlist.iter()) != NULL; ) { | |
816 fprintf(fp_cpp, "\n"); | |
817 fprintf(fp_cpp, "// Pipeline Class \"%s\"\n", classname); | |
818 PipeClassForm *pipeclass = _pipeline->_classdict[classname]->is_pipeclass(); | |
819 int maxWriteStage = -1; | |
820 int maxMoreInstrs = 0; | |
821 int paramcount = 0; | |
822 int i = 0; | |
823 const char *paramname; | |
824 int resource_count = (_pipeline->_rescount + 3) >> 2; | |
825 | |
826 // Scan the operands, looking for last output stage and number of inputs | |
827 for (pipeclass->_parameters.reset(); (paramname = pipeclass->_parameters.iter()) != NULL; ) { | |
828 const PipeClassOperandForm *pipeopnd = | |
829 (const PipeClassOperandForm *)pipeclass->_localUsage[paramname]; | |
830 if (pipeopnd) { | |
831 if (pipeopnd->_iswrite) { | |
832 int stagenum = _pipeline->_stages.index(pipeopnd->_stage); | |
833 int moreinsts = pipeopnd->_more_instrs; | |
834 if ((maxWriteStage+maxMoreInstrs) < (stagenum+moreinsts)) { | |
835 maxWriteStage = stagenum; | |
836 maxMoreInstrs = moreinsts; | |
837 } | |
838 } | |
839 } | |
840 | |
841 if (i++ > 0 || (pipeopnd && !pipeopnd->isWrite())) | |
842 paramcount++; | |
843 } | |
844 | |
845 // Create the list of stages for the operands that are read | |
846 // Note that we will build a NameList to reduce the number of copies | |
847 | |
848 int pipeline_reads_index = pipeline_reads_initializer(fp_cpp, pipeline_reads, pipeclass); | |
849 | |
850 int pipeline_res_stages_index = pipeline_res_stages_initializer( | |
851 fp_cpp, _pipeline, pipeline_res_stages, pipeclass); | |
852 | |
853 int pipeline_res_cycles_index = pipeline_res_cycles_initializer( | |
854 fp_cpp, _pipeline, pipeline_res_cycles, pipeclass); | |
855 | |
856 int pipeline_res_mask_index = pipeline_res_mask_initializer( | |
857 fp_cpp, _pipeline, pipeline_res_masks, pipeline_res_args, pipeclass); | |
858 | |
859 #if 0 | |
860 // Process the Resources | |
861 const PipeClassResourceForm *piperesource; | |
862 | |
863 unsigned resources_used = 0; | |
864 unsigned exclusive_resources_used = 0; | |
865 unsigned resource_groups = 0; | |
866 for (pipeclass->_resUsage.reset(); | |
867 (piperesource = (const PipeClassResourceForm *)pipeclass->_resUsage.iter()) != NULL; ) { | |
868 int used_mask = _pipeline->_resdict[piperesource->_resource]->is_resource()->mask(); | |
869 if (used_mask) | |
870 resource_groups++; | |
871 resources_used |= used_mask; | |
872 if ((used_mask & (used_mask-1)) == 0) | |
873 exclusive_resources_used |= used_mask; | |
874 } | |
875 | |
876 if (resource_groups > 0) { | |
877 fprintf(fp_cpp, "static const uint pipeline_res_or_masks_%03d[%d] = {", | |
878 pipeclass->_num, resource_groups); | |
879 for (pipeclass->_resUsage.reset(), i = 1; | |
880 (piperesource = (const PipeClassResourceForm *)pipeclass->_resUsage.iter()) != NULL; | |
881 i++ ) { | |
882 int used_mask = _pipeline->_resdict[piperesource->_resource]->is_resource()->mask(); | |
883 if (used_mask) { | |
884 fprintf(fp_cpp, " 0x%0*x%c", resource_count, used_mask, i < (int)resource_groups ? ',' : ' '); | |
885 } | |
886 } | |
887 fprintf(fp_cpp, "};\n\n"); | |
888 } | |
889 #endif | |
890 | |
891 // Create the pipeline class description | |
892 fprintf(fp_cpp, "static const Pipeline pipeline_class_%03d(", | |
893 pipeclass->_num); | |
894 if (maxWriteStage < 0) | |
895 fprintf(fp_cpp, "(uint)stage_undefined"); | |
896 else if (maxMoreInstrs == 0) | |
897 fprintf(fp_cpp, "(uint)stage_%s", _pipeline->_stages.name(maxWriteStage)); | |
898 else | |
899 fprintf(fp_cpp, "((uint)stage_%s)+%d", _pipeline->_stages.name(maxWriteStage), maxMoreInstrs); | |
900 fprintf(fp_cpp, ", %d, %s, %d, %d, %s, %s, %s, %s,\n", | |
901 paramcount, | |
902 pipeclass->hasFixedLatency() ? "true" : "false", | |
903 pipeclass->fixedLatency(), | |
904 pipeclass->InstructionCount(), | |
905 pipeclass->hasBranchDelay() ? "true" : "false", | |
906 pipeclass->hasMultipleBundles() ? "true" : "false", | |
907 pipeclass->forceSerialization() ? "true" : "false", | |
908 pipeclass->mayHaveNoCode() ? "true" : "false" ); | |
909 if (paramcount > 0) { | |
910 fprintf(fp_cpp, "\n (enum machPipelineStages * const) pipeline_reads_%03d,\n ", | |
911 pipeline_reads_index+1); | |
912 } | |
913 else | |
914 fprintf(fp_cpp, " NULL,"); | |
915 fprintf(fp_cpp, " (enum machPipelineStages * const) pipeline_res_stages_%03d,\n", | |
916 pipeline_res_stages_index+1); | |
917 fprintf(fp_cpp, " (uint * const) pipeline_res_cycles_%03d,\n", | |
918 pipeline_res_cycles_index+1); | |
919 fprintf(fp_cpp, " Pipeline_Use(%s, (Pipeline_Use_Element *)", | |
920 pipeline_res_args.name(pipeline_res_mask_index)); | |
921 if (strlen(pipeline_res_masks.name(pipeline_res_mask_index)) > 0) | |
922 fprintf(fp_cpp, "&pipeline_res_mask_%03d[0]", | |
923 pipeline_res_mask_index+1); | |
924 else | |
925 fprintf(fp_cpp, "NULL"); | |
926 fprintf(fp_cpp, "));\n"); | |
927 } | |
928 | |
929 // Generate the Node::latency method if _pipeline defined | |
930 fprintf(fp_cpp, "\n"); | |
931 fprintf(fp_cpp, "//------------------Inter-Instruction Latency--------------------------------\n"); | |
932 fprintf(fp_cpp, "uint Node::latency(uint i) {\n"); | |
933 if (_pipeline) { | |
934 #if 0 | |
935 fprintf(fp_cpp, "#ifndef PRODUCT\n"); | |
936 fprintf(fp_cpp, " if (TraceOptoOutput) {\n"); | |
937 fprintf(fp_cpp, " tty->print(\"# %%4d->latency(%%d)\\n\", _idx, i);\n"); | |
938 fprintf(fp_cpp, " }\n"); | |
939 fprintf(fp_cpp, "#endif\n"); | |
940 #endif | |
941 fprintf(fp_cpp, " uint j;\n"); | |
942 fprintf(fp_cpp, " // verify in legal range for inputs\n"); | |
943 fprintf(fp_cpp, " assert(i < len(), \"index not in range\");\n\n"); | |
944 fprintf(fp_cpp, " // verify input is not null\n"); | |
945 fprintf(fp_cpp, " Node *pred = in(i);\n"); | |
946 fprintf(fp_cpp, " if (!pred)\n return %d;\n\n", | |
947 non_operand_latency); | |
948 fprintf(fp_cpp, " if (pred->is_Proj())\n pred = pred->in(0);\n\n"); | |
949 fprintf(fp_cpp, " // if either node does not have pipeline info, use default\n"); | |
950 fprintf(fp_cpp, " const Pipeline *predpipe = pred->pipeline();\n"); | |
951 fprintf(fp_cpp, " assert(predpipe, \"no predecessor pipeline info\");\n\n"); | |
952 fprintf(fp_cpp, " if (predpipe->hasFixedLatency())\n return predpipe->fixedLatency();\n\n"); | |
953 fprintf(fp_cpp, " const Pipeline *currpipe = pipeline();\n"); | |
954 fprintf(fp_cpp, " assert(currpipe, \"no pipeline info\");\n\n"); | |
955 fprintf(fp_cpp, " if (!is_Mach())\n return %d;\n\n", | |
956 node_latency); | |
957 fprintf(fp_cpp, " const MachNode *m = as_Mach();\n"); | |
958 fprintf(fp_cpp, " j = m->oper_input_base();\n"); | |
959 fprintf(fp_cpp, " if (i < j)\n return currpipe->functional_unit_latency(%d, predpipe);\n\n", | |
960 non_operand_latency); | |
961 fprintf(fp_cpp, " // determine which operand this is in\n"); | |
962 fprintf(fp_cpp, " uint n = m->num_opnds();\n"); | |
963 fprintf(fp_cpp, " int delta = %d;\n\n", | |
964 non_operand_latency); | |
965 fprintf(fp_cpp, " uint k;\n"); | |
966 fprintf(fp_cpp, " for (k = 1; k < n; k++) {\n"); | |
967 fprintf(fp_cpp, " j += m->_opnds[k]->num_edges();\n"); | |
968 fprintf(fp_cpp, " if (i < j)\n"); | |
969 fprintf(fp_cpp, " break;\n"); | |
970 fprintf(fp_cpp, " }\n"); | |
971 fprintf(fp_cpp, " if (k < n)\n"); | |
972 fprintf(fp_cpp, " delta = currpipe->operand_latency(k,predpipe);\n\n"); | |
973 fprintf(fp_cpp, " return currpipe->functional_unit_latency(delta, predpipe);\n"); | |
974 } | |
975 else { | |
976 fprintf(fp_cpp, " // assert(false, \"pipeline functionality is not defined\");\n"); | |
977 fprintf(fp_cpp, " return %d;\n", | |
978 non_operand_latency); | |
979 } | |
980 fprintf(fp_cpp, "}\n\n"); | |
981 | |
982 // Output the list of nop nodes | |
983 fprintf(fp_cpp, "// Descriptions for emitting different functional unit nops\n"); | |
984 const char *nop; | |
985 int nopcnt = 0; | |
986 for ( _pipeline->_noplist.reset(); (nop = _pipeline->_noplist.iter()) != NULL; nopcnt++ ); | |
987 | |
988 fprintf(fp_cpp, "void Bundle::initialize_nops(MachNode * nop_list[%d], Compile *C) {\n", nopcnt); | |
989 int i = 0; | |
990 for ( _pipeline->_noplist.reset(); (nop = _pipeline->_noplist.iter()) != NULL; i++ ) { | |
991 fprintf(fp_cpp, " nop_list[%d] = (MachNode *) new (C) %sNode();\n", i, nop); | |
992 } | |
993 fprintf(fp_cpp, "};\n\n"); | |
994 fprintf(fp_cpp, "#ifndef PRODUCT\n"); | |
995 fprintf(fp_cpp, "void Bundle::dump() const {\n"); | |
996 fprintf(fp_cpp, " static const char * bundle_flags[] = {\n"); | |
997 fprintf(fp_cpp, " \"\",\n"); | |
998 fprintf(fp_cpp, " \"use nop delay\",\n"); | |
999 fprintf(fp_cpp, " \"use unconditional delay\",\n"); | |
1000 fprintf(fp_cpp, " \"use conditional delay\",\n"); | |
1001 fprintf(fp_cpp, " \"used in conditional delay\",\n"); | |
1002 fprintf(fp_cpp, " \"used in unconditional delay\",\n"); | |
1003 fprintf(fp_cpp, " \"used in all conditional delays\",\n"); | |
1004 fprintf(fp_cpp, " };\n\n"); | |
1005 | |
1006 fprintf(fp_cpp, " static const char *resource_names[%d] = {", _pipeline->_rescount); | |
1007 for (i = 0; i < _pipeline->_rescount; i++) | |
1008 fprintf(fp_cpp, " \"%s\"%c", _pipeline->_reslist.name(i), i < _pipeline->_rescount-1 ? ',' : ' '); | |
1009 fprintf(fp_cpp, "};\n\n"); | |
1010 | |
1011 // See if the same string is in the table | |
1012 fprintf(fp_cpp, " bool needs_comma = false;\n\n"); | |
1013 fprintf(fp_cpp, " if (_flags) {\n"); | |
1014 fprintf(fp_cpp, " tty->print(\"%%s\", bundle_flags[_flags]);\n"); | |
1015 fprintf(fp_cpp, " needs_comma = true;\n"); | |
1016 fprintf(fp_cpp, " };\n"); | |
1017 fprintf(fp_cpp, " if (instr_count()) {\n"); | |
1018 fprintf(fp_cpp, " tty->print(\"%%s%%d instr%%s\", needs_comma ? \", \" : \"\", instr_count(), instr_count() != 1 ? \"s\" : \"\");\n"); | |
1019 fprintf(fp_cpp, " needs_comma = true;\n"); | |
1020 fprintf(fp_cpp, " };\n"); | |
1021 fprintf(fp_cpp, " uint r = resources_used();\n"); | |
1022 fprintf(fp_cpp, " if (r) {\n"); | |
1023 fprintf(fp_cpp, " tty->print(\"%%sresource%%s:\", needs_comma ? \", \" : \"\", (r & (r-1)) != 0 ? \"s\" : \"\");\n"); | |
1024 fprintf(fp_cpp, " for (uint i = 0; i < %d; i++)\n", _pipeline->_rescount); | |
1025 fprintf(fp_cpp, " if ((r & (1 << i)) != 0)\n"); | |
1026 fprintf(fp_cpp, " tty->print(\" %%s\", resource_names[i]);\n"); | |
1027 fprintf(fp_cpp, " needs_comma = true;\n"); | |
1028 fprintf(fp_cpp, " };\n"); | |
1029 fprintf(fp_cpp, " tty->print(\"\\n\");\n"); | |
1030 fprintf(fp_cpp, "}\n"); | |
1031 fprintf(fp_cpp, "#endif\n"); | |
1032 } | |
1033 | |
1034 // --------------------------------------------------------------------------- | |
1035 //------------------------------Utilities to build Instruction Classes-------- | |
1036 // --------------------------------------------------------------------------- | |
1037 | |
1038 static void defineOut_RegMask(FILE *fp, const char *node, const char *regMask) { | |
1039 fprintf(fp,"const RegMask &%sNode::out_RegMask() const { return (%s); }\n", | |
1040 node, regMask); | |
1041 } | |
1042 | |
1043 // Scan the peepmatch and output a test for each instruction | |
1044 static void check_peepmatch_instruction_tree(FILE *fp, PeepMatch *pmatch, PeepConstraint *pconstraint) { | |
603
dbbe28fc66b5
6778669: Patch from Red Hat -- fixes compilation errors
twisti
parents:
415
diff
changeset
|
1045 int parent = -1; |
dbbe28fc66b5
6778669: Patch from Red Hat -- fixes compilation errors
twisti
parents:
415
diff
changeset
|
1046 int inst_position = 0; |
dbbe28fc66b5
6778669: Patch from Red Hat -- fixes compilation errors
twisti
parents:
415
diff
changeset
|
1047 const char* inst_name = NULL; |
dbbe28fc66b5
6778669: Patch from Red Hat -- fixes compilation errors
twisti
parents:
415
diff
changeset
|
1048 int input = 0; |
0 | 1049 fprintf(fp, " // Check instruction sub-tree\n"); |
1050 pmatch->reset(); | |
1051 for( pmatch->next_instruction( parent, inst_position, inst_name, input ); | |
1052 inst_name != NULL; | |
1053 pmatch->next_instruction( parent, inst_position, inst_name, input ) ) { | |
1054 // If this is not a placeholder | |
1055 if( ! pmatch->is_placeholder() ) { | |
1056 // Define temporaries 'inst#', based on parent and parent's input index | |
1057 if( parent != -1 ) { // root was initialized | |
603
dbbe28fc66b5
6778669: Patch from Red Hat -- fixes compilation errors
twisti
parents:
415
diff
changeset
|
1058 fprintf(fp, " inst%d = inst%d->in(%d);\n", |
0 | 1059 inst_position, parent, input); |
1060 } | |
1061 | |
1062 // When not the root | |
1063 // Test we have the correct instruction by comparing the rule | |
1064 if( parent != -1 ) { | |
603
dbbe28fc66b5
6778669: Patch from Red Hat -- fixes compilation errors
twisti
parents:
415
diff
changeset
|
1065 fprintf(fp, " matches = matches && ( inst%d->rule() == %s_rule );", |
0 | 1066 inst_position, inst_name); |
1067 } | |
1068 } else { | |
1069 // Check that user did not try to constrain a placeholder | |
1070 assert( ! pconstraint->constrains_instruction(inst_position), | |
1071 "fatal(): Can not constrain a placeholder instruction"); | |
1072 } | |
1073 } | |
1074 } | |
1075 | |
603
dbbe28fc66b5
6778669: Patch from Red Hat -- fixes compilation errors
twisti
parents:
415
diff
changeset
|
1076 static void print_block_index(FILE *fp, int inst_position) { |
0 | 1077 assert( inst_position >= 0, "Instruction number less than zero"); |
1078 fprintf(fp, "block_index"); | |
1079 if( inst_position != 0 ) { | |
603
dbbe28fc66b5
6778669: Patch from Red Hat -- fixes compilation errors
twisti
parents:
415
diff
changeset
|
1080 fprintf(fp, " - %d", inst_position); |
0 | 1081 } |
1082 } | |
1083 | |
1084 // Scan the peepmatch and output a test for each instruction | |
1085 static void check_peepmatch_instruction_sequence(FILE *fp, PeepMatch *pmatch, PeepConstraint *pconstraint) { | |
603
dbbe28fc66b5
6778669: Patch from Red Hat -- fixes compilation errors
twisti
parents:
415
diff
changeset
|
1086 int parent = -1; |
dbbe28fc66b5
6778669: Patch from Red Hat -- fixes compilation errors
twisti
parents:
415
diff
changeset
|
1087 int inst_position = 0; |
dbbe28fc66b5
6778669: Patch from Red Hat -- fixes compilation errors
twisti
parents:
415
diff
changeset
|
1088 const char* inst_name = NULL; |
dbbe28fc66b5
6778669: Patch from Red Hat -- fixes compilation errors
twisti
parents:
415
diff
changeset
|
1089 int input = 0; |
0 | 1090 fprintf(fp, " // Check instruction sub-tree\n"); |
1091 pmatch->reset(); | |
1092 for( pmatch->next_instruction( parent, inst_position, inst_name, input ); | |
1093 inst_name != NULL; | |
1094 pmatch->next_instruction( parent, inst_position, inst_name, input ) ) { | |
1095 // If this is not a placeholder | |
1096 if( ! pmatch->is_placeholder() ) { | |
1097 // Define temporaries 'inst#', based on parent and parent's input index | |
1098 if( parent != -1 ) { // root was initialized | |
1099 fprintf(fp, " // Identify previous instruction if inside this block\n"); | |
1100 fprintf(fp, " if( "); | |
1101 print_block_index(fp, inst_position); | |
1102 fprintf(fp, " > 0 ) {\n Node *n = block->_nodes.at("); | |
1103 print_block_index(fp, inst_position); | |
603
dbbe28fc66b5
6778669: Patch from Red Hat -- fixes compilation errors
twisti
parents:
415
diff
changeset
|
1104 fprintf(fp, ");\n inst%d = (n->is_Mach()) ? ", inst_position); |
0 | 1105 fprintf(fp, "n->as_Mach() : NULL;\n }\n"); |
1106 } | |
1107 | |
1108 // When not the root | |
1109 // Test we have the correct instruction by comparing the rule. | |
1110 if( parent != -1 ) { | |
603
dbbe28fc66b5
6778669: Patch from Red Hat -- fixes compilation errors
twisti
parents:
415
diff
changeset
|
1111 fprintf(fp, " matches = matches && (inst%d != NULL) && (inst%d->rule() == %s_rule);\n", |
0 | 1112 inst_position, inst_position, inst_name); |
1113 } | |
1114 } else { | |
1115 // Check that user did not try to constrain a placeholder | |
1116 assert( ! pconstraint->constrains_instruction(inst_position), | |
1117 "fatal(): Can not constrain a placeholder instruction"); | |
1118 } | |
1119 } | |
1120 } | |
1121 | |
1122 // Build mapping for register indices, num_edges to input | |
1123 static void build_instruction_index_mapping( FILE *fp, FormDict &globals, PeepMatch *pmatch ) { | |
603
dbbe28fc66b5
6778669: Patch from Red Hat -- fixes compilation errors
twisti
parents:
415
diff
changeset
|
1124 int parent = -1; |
dbbe28fc66b5
6778669: Patch from Red Hat -- fixes compilation errors
twisti
parents:
415
diff
changeset
|
1125 int inst_position = 0; |
dbbe28fc66b5
6778669: Patch from Red Hat -- fixes compilation errors
twisti
parents:
415
diff
changeset
|
1126 const char* inst_name = NULL; |
dbbe28fc66b5
6778669: Patch from Red Hat -- fixes compilation errors
twisti
parents:
415
diff
changeset
|
1127 int input = 0; |
0 | 1128 fprintf(fp, " // Build map to register info\n"); |
1129 pmatch->reset(); | |
1130 for( pmatch->next_instruction( parent, inst_position, inst_name, input ); | |
1131 inst_name != NULL; | |
1132 pmatch->next_instruction( parent, inst_position, inst_name, input ) ) { | |
1133 // If this is not a placeholder | |
1134 if( ! pmatch->is_placeholder() ) { | |
1135 // Define temporaries 'inst#', based on self's inst_position | |
1136 InstructForm *inst = globals[inst_name]->is_instruction(); | |
1137 if( inst != NULL ) { | |
1138 char inst_prefix[] = "instXXXX_"; | |
603
dbbe28fc66b5
6778669: Patch from Red Hat -- fixes compilation errors
twisti
parents:
415
diff
changeset
|
1139 sprintf(inst_prefix, "inst%d_", inst_position); |
0 | 1140 char receiver[] = "instXXXX->"; |
603
dbbe28fc66b5
6778669: Patch from Red Hat -- fixes compilation errors
twisti
parents:
415
diff
changeset
|
1141 sprintf(receiver, "inst%d->", inst_position); |
0 | 1142 inst->index_temps( fp, globals, inst_prefix, receiver ); |
1143 } | |
1144 } | |
1145 } | |
1146 } | |
1147 | |
1148 // Generate tests for the constraints | |
1149 static void check_peepconstraints(FILE *fp, FormDict &globals, PeepMatch *pmatch, PeepConstraint *pconstraint) { | |
1150 fprintf(fp, "\n"); | |
1151 fprintf(fp, " // Check constraints on sub-tree-leaves\n"); | |
1152 | |
1153 // Build mapping from num_edges to local variables | |
1154 build_instruction_index_mapping( fp, globals, pmatch ); | |
1155 | |
1156 // Build constraint tests | |
1157 if( pconstraint != NULL ) { | |
1158 fprintf(fp, " matches = matches &&"); | |
1159 bool first_constraint = true; | |
1160 while( pconstraint != NULL ) { | |
1161 // indentation and connecting '&&' | |
1162 const char *indentation = " "; | |
1163 fprintf(fp, "\n%s%s", indentation, (!first_constraint ? "&& " : " ")); | |
1164 | |
1165 // Only have '==' relation implemented | |
1166 if( strcmp(pconstraint->_relation,"==") != 0 ) { | |
1167 assert( false, "Unimplemented()" ); | |
1168 } | |
1169 | |
1170 // LEFT | |
603
dbbe28fc66b5
6778669: Patch from Red Hat -- fixes compilation errors
twisti
parents:
415
diff
changeset
|
1171 int left_index = pconstraint->_left_inst; |
0 | 1172 const char *left_op = pconstraint->_left_op; |
1173 // Access info on the instructions whose operands are compared | |
1174 InstructForm *inst_left = globals[pmatch->instruction_name(left_index)]->is_instruction(); | |
1175 assert( inst_left, "Parser should guaranty this is an instruction"); | |
1176 int left_op_base = inst_left->oper_input_base(globals); | |
1177 // Access info on the operands being compared | |
1178 int left_op_index = inst_left->operand_position(left_op, Component::USE); | |
1179 if( left_op_index == -1 ) { | |
1180 left_op_index = inst_left->operand_position(left_op, Component::DEF); | |
1181 if( left_op_index == -1 ) { | |
1182 left_op_index = inst_left->operand_position(left_op, Component::USE_DEF); | |
1183 } | |
1184 } | |
1185 assert( left_op_index != NameList::Not_in_list, "Did not find operand in instruction"); | |
1186 ComponentList components_left = inst_left->_components; | |
1187 const char *left_comp_type = components_left.at(left_op_index)->_type; | |
1188 OpClassForm *left_opclass = globals[left_comp_type]->is_opclass(); | |
1189 Form::InterfaceType left_interface_type = left_opclass->interface_type(globals); | |
1190 | |
1191 | |
1192 // RIGHT | |
1193 int right_op_index = -1; | |
603
dbbe28fc66b5
6778669: Patch from Red Hat -- fixes compilation errors
twisti
parents:
415
diff
changeset
|
1194 int right_index = pconstraint->_right_inst; |
0 | 1195 const char *right_op = pconstraint->_right_op; |
1196 if( right_index != -1 ) { // Match operand | |
1197 // Access info on the instructions whose operands are compared | |
1198 InstructForm *inst_right = globals[pmatch->instruction_name(right_index)]->is_instruction(); | |
1199 assert( inst_right, "Parser should guaranty this is an instruction"); | |
1200 int right_op_base = inst_right->oper_input_base(globals); | |
1201 // Access info on the operands being compared | |
1202 right_op_index = inst_right->operand_position(right_op, Component::USE); | |
1203 if( right_op_index == -1 ) { | |
1204 right_op_index = inst_right->operand_position(right_op, Component::DEF); | |
1205 if( right_op_index == -1 ) { | |
1206 right_op_index = inst_right->operand_position(right_op, Component::USE_DEF); | |
1207 } | |
1208 } | |
1209 assert( right_op_index != NameList::Not_in_list, "Did not find operand in instruction"); | |
1210 ComponentList components_right = inst_right->_components; | |
1211 const char *right_comp_type = components_right.at(right_op_index)->_type; | |
1212 OpClassForm *right_opclass = globals[right_comp_type]->is_opclass(); | |
1213 Form::InterfaceType right_interface_type = right_opclass->interface_type(globals); | |
1214 assert( right_interface_type == left_interface_type, "Both must be same interface"); | |
1215 | |
1216 } else { // Else match register | |
1217 // assert( false, "should be a register" ); | |
1218 } | |
1219 | |
1220 // | |
1221 // Check for equivalence | |
1222 // | |
1223 // fprintf(fp, "phase->eqv( "); | |
1224 // fprintf(fp, "inst%d->in(%d+%d) /* %s */, inst%d->in(%d+%d) /* %s */", | |
1225 // left_index, left_op_base, left_op_index, left_op, | |
1226 // right_index, right_op_base, right_op_index, right_op ); | |
1227 // fprintf(fp, ")"); | |
1228 // | |
1229 switch( left_interface_type ) { | |
1230 case Form::register_interface: { | |
1231 // Check that they are allocated to the same register | |
1232 // Need parameter for index position if not result operand | |
1233 char left_reg_index[] = ",instXXXX_idxXXXX"; | |
1234 if( left_op_index != 0 ) { | |
1235 assert( (left_index <= 9999) && (left_op_index <= 9999), "exceed string size"); | |
1236 // Must have index into operands | |
1237 sprintf(left_reg_index,",inst%d_idx%d", left_index, left_op_index); | |
1238 } else { | |
1239 strcpy(left_reg_index, ""); | |
1240 } | |
1241 fprintf(fp, "(inst%d->_opnds[%d]->reg(ra_,inst%d%s) /* %d.%s */", | |
1242 left_index, left_op_index, left_index, left_reg_index, left_index, left_op ); | |
1243 fprintf(fp, " == "); | |
1244 | |
1245 if( right_index != -1 ) { | |
1246 char right_reg_index[18] = ",instXXXX_idxXXXX"; | |
1247 if( right_op_index != 0 ) { | |
1248 assert( (right_index <= 9999) && (right_op_index <= 9999), "exceed string size"); | |
1249 // Must have index into operands | |
1250 sprintf(right_reg_index,",inst%d_idx%d", right_index, right_op_index); | |
1251 } else { | |
1252 strcpy(right_reg_index, ""); | |
1253 } | |
1254 fprintf(fp, "/* %d.%s */ inst%d->_opnds[%d]->reg(ra_,inst%d%s)", | |
1255 right_index, right_op, right_index, right_op_index, right_index, right_reg_index ); | |
1256 } else { | |
1257 fprintf(fp, "%s_enc", right_op ); | |
1258 } | |
1259 fprintf(fp,")"); | |
1260 break; | |
1261 } | |
1262 case Form::constant_interface: { | |
1263 // Compare the '->constant()' values | |
1264 fprintf(fp, "(inst%d->_opnds[%d]->constant() /* %d.%s */", | |
1265 left_index, left_op_index, left_index, left_op ); | |
1266 fprintf(fp, " == "); | |
1267 fprintf(fp, "/* %d.%s */ inst%d->_opnds[%d]->constant())", | |
1268 right_index, right_op, right_index, right_op_index ); | |
1269 break; | |
1270 } | |
1271 case Form::memory_interface: { | |
1272 // Compare 'base', 'index', 'scale', and 'disp' | |
1273 // base | |
1274 fprintf(fp, "( \n"); | |
1275 fprintf(fp, " (inst%d->_opnds[%d]->base(ra_,inst%d,inst%d_idx%d) /* %d.%s$$base */", | |
1276 left_index, left_op_index, left_index, left_index, left_op_index, left_index, left_op ); | |
1277 fprintf(fp, " == "); | |
1278 fprintf(fp, "/* %d.%s$$base */ inst%d->_opnds[%d]->base(ra_,inst%d,inst%d_idx%d)) &&\n", | |
1279 right_index, right_op, right_index, right_op_index, right_index, right_index, right_op_index ); | |
1280 // index | |
1281 fprintf(fp, " (inst%d->_opnds[%d]->index(ra_,inst%d,inst%d_idx%d) /* %d.%s$$index */", | |
1282 left_index, left_op_index, left_index, left_index, left_op_index, left_index, left_op ); | |
1283 fprintf(fp, " == "); | |
1284 fprintf(fp, "/* %d.%s$$index */ inst%d->_opnds[%d]->index(ra_,inst%d,inst%d_idx%d)) &&\n", | |
1285 right_index, right_op, right_index, right_op_index, right_index, right_index, right_op_index ); | |
1286 // scale | |
1287 fprintf(fp, " (inst%d->_opnds[%d]->scale() /* %d.%s$$scale */", | |
1288 left_index, left_op_index, left_index, left_op ); | |
1289 fprintf(fp, " == "); | |
1290 fprintf(fp, "/* %d.%s$$scale */ inst%d->_opnds[%d]->scale()) &&\n", | |
1291 right_index, right_op, right_index, right_op_index ); | |
1292 // disp | |
1293 fprintf(fp, " (inst%d->_opnds[%d]->disp(ra_,inst%d,inst%d_idx%d) /* %d.%s$$disp */", | |
1294 left_index, left_op_index, left_index, left_index, left_op_index, left_index, left_op ); | |
1295 fprintf(fp, " == "); | |
1296 fprintf(fp, "/* %d.%s$$disp */ inst%d->_opnds[%d]->disp(ra_,inst%d,inst%d_idx%d))\n", | |
1297 right_index, right_op, right_index, right_op_index, right_index, right_index, right_op_index ); | |
1298 fprintf(fp, ") \n"); | |
1299 break; | |
1300 } | |
1301 case Form::conditional_interface: { | |
1302 // Compare the condition code being tested | |
1303 assert( false, "Unimplemented()" ); | |
1304 break; | |
1305 } | |
1306 default: { | |
1307 assert( false, "ShouldNotReachHere()" ); | |
1308 break; | |
1309 } | |
1310 } | |
1311 | |
1312 // Advance to next constraint | |
1313 pconstraint = pconstraint->next(); | |
1314 first_constraint = false; | |
1315 } | |
1316 | |
1317 fprintf(fp, ";\n"); | |
1318 } | |
1319 } | |
1320 | |
1321 // // EXPERIMENTAL -- TEMPORARY code | |
1322 // static Form::DataType get_operand_type(FormDict &globals, InstructForm *instr, const char *op_name ) { | |
1323 // int op_index = instr->operand_position(op_name, Component::USE); | |
1324 // if( op_index == -1 ) { | |
1325 // op_index = instr->operand_position(op_name, Component::DEF); | |
1326 // if( op_index == -1 ) { | |
1327 // op_index = instr->operand_position(op_name, Component::USE_DEF); | |
1328 // } | |
1329 // } | |
1330 // assert( op_index != NameList::Not_in_list, "Did not find operand in instruction"); | |
1331 // | |
1332 // ComponentList components_right = instr->_components; | |
1333 // char *right_comp_type = components_right.at(op_index)->_type; | |
1334 // OpClassForm *right_opclass = globals[right_comp_type]->is_opclass(); | |
1335 // Form::InterfaceType right_interface_type = right_opclass->interface_type(globals); | |
1336 // | |
1337 // return; | |
1338 // } | |
1339 | |
1340 // Construct the new sub-tree | |
1341 static void generate_peepreplace( FILE *fp, FormDict &globals, PeepMatch *pmatch, PeepConstraint *pconstraint, PeepReplace *preplace, int max_position ) { | |
1342 fprintf(fp, " // IF instructions and constraints matched\n"); | |
1343 fprintf(fp, " if( matches ) {\n"); | |
1344 fprintf(fp, " // generate the new sub-tree\n"); | |
1345 fprintf(fp, " assert( true, \"Debug stopping point\");\n"); | |
1346 if( preplace != NULL ) { | |
1347 // Get the root of the new sub-tree | |
1348 const char *root_inst = NULL; | |
1349 preplace->next_instruction(root_inst); | |
1350 InstructForm *root_form = globals[root_inst]->is_instruction(); | |
1351 assert( root_form != NULL, "Replacement instruction was not previously defined"); | |
1352 fprintf(fp, " %sNode *root = new (C) %sNode();\n", root_inst, root_inst); | |
1353 | |
603
dbbe28fc66b5
6778669: Patch from Red Hat -- fixes compilation errors
twisti
parents:
415
diff
changeset
|
1354 int inst_num; |
0 | 1355 const char *op_name; |
1356 int opnds_index = 0; // define result operand | |
1357 // Then install the use-operands for the new sub-tree | |
1358 // preplace->reset(); // reset breaks iteration | |
1359 for( preplace->next_operand( inst_num, op_name ); | |
1360 op_name != NULL; | |
1361 preplace->next_operand( inst_num, op_name ) ) { | |
1362 InstructForm *inst_form; | |
1363 inst_form = globals[pmatch->instruction_name(inst_num)]->is_instruction(); | |
1364 assert( inst_form, "Parser should guaranty this is an instruction"); | |
1365 int inst_op_num = inst_form->operand_position(op_name, Component::USE); | |
1366 if( inst_op_num == NameList::Not_in_list ) | |
1367 inst_op_num = inst_form->operand_position(op_name, Component::USE_DEF); | |
1368 assert( inst_op_num != NameList::Not_in_list, "Did not find operand as USE"); | |
1369 // find the name of the OperandForm from the local name | |
1370 const Form *form = inst_form->_localNames[op_name]; | |
1371 OperandForm *op_form = form->is_operand(); | |
1372 if( opnds_index == 0 ) { | |
1373 // Initial setup of new instruction | |
1374 fprintf(fp, " // ----- Initial setup -----\n"); | |
1375 // | |
1376 // Add control edge for this node | |
1377 fprintf(fp, " root->add_req(_in[0]); // control edge\n"); | |
1378 // Add unmatched edges from root of match tree | |
1379 int op_base = root_form->oper_input_base(globals); | |
1380 for( int unmatched_edge = 1; unmatched_edge < op_base; ++unmatched_edge ) { | |
603
dbbe28fc66b5
6778669: Patch from Red Hat -- fixes compilation errors
twisti
parents:
415
diff
changeset
|
1381 fprintf(fp, " root->add_req(inst%d->in(%d)); // unmatched ideal edge\n", |
0 | 1382 inst_num, unmatched_edge); |
1383 } | |
1384 // If new instruction captures bottom type | |
1385 if( root_form->captures_bottom_type() ) { | |
1386 // Get bottom type from instruction whose result we are replacing | |
603
dbbe28fc66b5
6778669: Patch from Red Hat -- fixes compilation errors
twisti
parents:
415
diff
changeset
|
1387 fprintf(fp, " root->_bottom_type = inst%d->bottom_type();\n", inst_num); |
0 | 1388 } |
1389 // Define result register and result operand | |
603
dbbe28fc66b5
6778669: Patch from Red Hat -- fixes compilation errors
twisti
parents:
415
diff
changeset
|
1390 fprintf(fp, " ra_->add_reference(root, inst%d);\n", inst_num); |
dbbe28fc66b5
6778669: Patch from Red Hat -- fixes compilation errors
twisti
parents:
415
diff
changeset
|
1391 fprintf(fp, " ra_->set_oop (root, ra_->is_oop(inst%d));\n", inst_num); |
dbbe28fc66b5
6778669: Patch from Red Hat -- fixes compilation errors
twisti
parents:
415
diff
changeset
|
1392 fprintf(fp, " ra_->set_pair(root->_idx, ra_->get_reg_second(inst%d), ra_->get_reg_first(inst%d));\n", inst_num, inst_num); |
dbbe28fc66b5
6778669: Patch from Red Hat -- fixes compilation errors
twisti
parents:
415
diff
changeset
|
1393 fprintf(fp, " root->_opnds[0] = inst%d->_opnds[0]->clone(C); // result\n", inst_num); |
0 | 1394 fprintf(fp, " // ----- Done with initial setup -----\n"); |
1395 } else { | |
1396 if( (op_form == NULL) || (op_form->is_base_constant(globals) == Form::none) ) { | |
1397 // Do not have ideal edges for constants after matching | |
603
dbbe28fc66b5
6778669: Patch from Red Hat -- fixes compilation errors
twisti
parents:
415
diff
changeset
|
1398 fprintf(fp, " for( unsigned x%d = inst%d_idx%d; x%d < inst%d_idx%d; x%d++ )\n", |
0 | 1399 inst_op_num, inst_num, inst_op_num, |
1400 inst_op_num, inst_num, inst_op_num+1, inst_op_num ); | |
603
dbbe28fc66b5
6778669: Patch from Red Hat -- fixes compilation errors
twisti
parents:
415
diff
changeset
|
1401 fprintf(fp, " root->add_req( inst%d->in(x%d) );\n", |
0 | 1402 inst_num, inst_op_num ); |
1403 } else { | |
1404 fprintf(fp, " // no ideal edge for constants after matching\n"); | |
1405 } | |
603
dbbe28fc66b5
6778669: Patch from Red Hat -- fixes compilation errors
twisti
parents:
415
diff
changeset
|
1406 fprintf(fp, " root->_opnds[%d] = inst%d->_opnds[%d]->clone(C);\n", |
0 | 1407 opnds_index, inst_num, inst_op_num ); |
1408 } | |
1409 ++opnds_index; | |
1410 } | |
1411 }else { | |
1412 // Replacing subtree with empty-tree | |
1413 assert( false, "ShouldNotReachHere();"); | |
1414 } | |
1415 | |
1416 // Return the new sub-tree | |
1417 fprintf(fp, " deleted = %d;\n", max_position+1 /*zero to one based*/); | |
1418 fprintf(fp, " return root; // return new root;\n"); | |
1419 fprintf(fp, " }\n"); | |
1420 } | |
1421 | |
1422 | |
1423 // Define the Peephole method for an instruction node | |
1424 void ArchDesc::definePeephole(FILE *fp, InstructForm *node) { | |
1425 // Generate Peephole function header | |
1426 fprintf(fp, "MachNode *%sNode::peephole( Block *block, int block_index, PhaseRegAlloc *ra_, int &deleted, Compile* C ) {\n", node->_ident); | |
1427 fprintf(fp, " bool matches = true;\n"); | |
1428 | |
1429 // Identify the maximum instruction position, | |
1430 // generate temporaries that hold current instruction | |
1431 // | |
1432 // MachNode *inst0 = NULL; | |
1433 // ... | |
1434 // MachNode *instMAX = NULL; | |
1435 // | |
1436 int max_position = 0; | |
1437 Peephole *peep; | |
1438 for( peep = node->peepholes(); peep != NULL; peep = peep->next() ) { | |
1439 PeepMatch *pmatch = peep->match(); | |
1440 assert( pmatch != NULL, "fatal(), missing peepmatch rule"); | |
1441 if( max_position < pmatch->max_position() ) max_position = pmatch->max_position(); | |
1442 } | |
1443 for( int i = 0; i <= max_position; ++i ) { | |
1444 if( i == 0 ) { | |
603
dbbe28fc66b5
6778669: Patch from Red Hat -- fixes compilation errors
twisti
parents:
415
diff
changeset
|
1445 fprintf(fp, " MachNode *inst0 = this;\n"); |
0 | 1446 } else { |
1447 fprintf(fp, " MachNode *inst%d = NULL;\n", i); | |
1448 } | |
1449 } | |
1450 | |
1451 // For each peephole rule in architecture description | |
1452 // Construct a test for the desired instruction sub-tree | |
1453 // then check the constraints | |
1454 // If these match, Generate the new subtree | |
1455 for( peep = node->peepholes(); peep != NULL; peep = peep->next() ) { | |
1456 int peephole_number = peep->peephole_number(); | |
1457 PeepMatch *pmatch = peep->match(); | |
1458 PeepConstraint *pconstraint = peep->constraints(); | |
1459 PeepReplace *preplace = peep->replacement(); | |
1460 | |
1461 // Root of this peephole is the current MachNode | |
1462 assert( true, // %%name?%% strcmp( node->_ident, pmatch->name(0) ) == 0, | |
1463 "root of PeepMatch does not match instruction"); | |
1464 | |
1465 // Make each peephole rule individually selectable | |
1466 fprintf(fp, " if( (OptoPeepholeAt == -1) || (OptoPeepholeAt==%d) ) {\n", peephole_number); | |
1467 fprintf(fp, " matches = true;\n"); | |
1468 // Scan the peepmatch and output a test for each instruction | |
1469 check_peepmatch_instruction_sequence( fp, pmatch, pconstraint ); | |
1470 | |
1471 // Check constraints and build replacement inside scope | |
1472 fprintf(fp, " // If instruction subtree matches\n"); | |
1473 fprintf(fp, " if( matches ) {\n"); | |
1474 | |
1475 // Generate tests for the constraints | |
1476 check_peepconstraints( fp, _globalNames, pmatch, pconstraint ); | |
1477 | |
1478 // Construct the new sub-tree | |
1479 generate_peepreplace( fp, _globalNames, pmatch, pconstraint, preplace, max_position ); | |
1480 | |
1481 // End of scope for this peephole's constraints | |
1482 fprintf(fp, " }\n"); | |
1483 // Closing brace '}' to make each peephole rule individually selectable | |
1484 fprintf(fp, " } // end of peephole rule #%d\n", peephole_number); | |
1485 fprintf(fp, "\n"); | |
1486 } | |
1487 | |
1488 fprintf(fp, " return NULL; // No peephole rules matched\n"); | |
1489 fprintf(fp, "}\n"); | |
1490 fprintf(fp, "\n"); | |
1491 } | |
1492 | |
1493 // Define the Expand method for an instruction node | |
1494 void ArchDesc::defineExpand(FILE *fp, InstructForm *node) { | |
1495 unsigned cnt = 0; // Count nodes we have expand into | |
1496 unsigned i; | |
1497 | |
1498 // Generate Expand function header | |
1499 fprintf(fp,"MachNode *%sNode::Expand(State *state, Node_List &proj_list) {\n", node->_ident); | |
1500 fprintf(fp,"Compile* C = Compile::current();\n"); | |
1501 // Generate expand code | |
1502 if( node->expands() ) { | |
1503 const char *opid; | |
1504 int new_pos, exp_pos; | |
1505 const char *new_id = NULL; | |
1506 const Form *frm = NULL; | |
1507 InstructForm *new_inst = NULL; | |
1508 OperandForm *new_oper = NULL; | |
1509 unsigned numo = node->num_opnds() + | |
1510 node->_exprule->_newopers.count(); | |
1511 | |
1512 // If necessary, generate any operands created in expand rule | |
1513 if (node->_exprule->_newopers.count()) { | |
1514 for(node->_exprule->_newopers.reset(); | |
1515 (new_id = node->_exprule->_newopers.iter()) != NULL; cnt++) { | |
1516 frm = node->_localNames[new_id]; | |
1517 assert(frm, "Invalid entry in new operands list of expand rule"); | |
1518 new_oper = frm->is_operand(); | |
1519 char *tmp = (char *)node->_exprule->_newopconst[new_id]; | |
1520 if (tmp == NULL) { | |
1521 fprintf(fp," MachOper *op%d = new (C) %sOper();\n", | |
1522 cnt, new_oper->_ident); | |
1523 } | |
1524 else { | |
1525 fprintf(fp," MachOper *op%d = new (C) %sOper(%s);\n", | |
1526 cnt, new_oper->_ident, tmp); | |
1527 } | |
1528 } | |
1529 } | |
1530 cnt = 0; | |
1531 // Generate the temps to use for DAG building | |
1532 for(i = 0; i < numo; i++) { | |
1533 if (i < node->num_opnds()) { | |
1534 fprintf(fp," MachNode *tmp%d = this;\n", i); | |
1535 } | |
1536 else { | |
1537 fprintf(fp," MachNode *tmp%d = NULL;\n", i); | |
1538 } | |
1539 } | |
1540 // Build mapping from num_edges to local variables | |
1541 fprintf(fp," unsigned num0 = 0;\n"); | |
1542 for( i = 1; i < node->num_opnds(); i++ ) { | |
1543 fprintf(fp," unsigned num%d = opnd_array(%d)->num_edges();\n",i,i); | |
1544 } | |
1545 | |
1546 // Build a mapping from operand index to input edges | |
1547 fprintf(fp," unsigned idx0 = oper_input_base();\n"); | |
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
1548 |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
1549 // The order in which inputs are added to a node is very |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
1550 // strange. Store nodes get a memory input before Expand is |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
1551 // called and all other nodes get it afterwards so |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
1552 // oper_input_base is wrong during expansion. This code adjusts |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
1553 // is so that expansion will work correctly. |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
1554 bool missing_memory_edge = node->_matrule->needs_ideal_memory_edge(_globalNames) && |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
1555 node->is_ideal_store() == Form::none; |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
1556 if (missing_memory_edge) { |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
1557 fprintf(fp," idx0--; // Adjust base because memory edge hasn't been inserted yet\n"); |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
1558 } |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
1559 |
0 | 1560 for( i = 0; i < node->num_opnds(); i++ ) { |
1561 fprintf(fp," unsigned idx%d = idx%d + num%d;\n", | |
1562 i+1,i,i); | |
1563 } | |
1564 | |
1565 // Declare variable to hold root of expansion | |
1566 fprintf(fp," MachNode *result = NULL;\n"); | |
1567 | |
1568 // Iterate over the instructions 'node' expands into | |
1569 ExpandRule *expand = node->_exprule; | |
1570 NameAndList *expand_instr = NULL; | |
1571 for(expand->reset_instructions(); | |
1572 (expand_instr = expand->iter_instructions()) != NULL; cnt++) { | |
1573 new_id = expand_instr->name(); | |
1574 | |
1575 InstructForm* expand_instruction = (InstructForm*)globalAD->globalNames()[new_id]; | |
1576 if (expand_instruction->has_temps()) { | |
1577 globalAD->syntax_err(node->_linenum, "In %s: expand rules using instructs with TEMPs aren't supported: %s", | |
1578 node->_ident, new_id); | |
1579 } | |
1580 | |
1581 // Build the node for the instruction | |
1582 fprintf(fp,"\n %sNode *n%d = new (C) %sNode();\n", new_id, cnt, new_id); | |
1583 // Add control edge for this node | |
1584 fprintf(fp," n%d->add_req(_in[0]);\n", cnt); | |
1585 // Build the operand for the value this node defines. | |
1586 Form *form = (Form*)_globalNames[new_id]; | |
1587 assert( form, "'new_id' must be a defined form name"); | |
1588 // Grab the InstructForm for the new instruction | |
1589 new_inst = form->is_instruction(); | |
1590 assert( new_inst, "'new_id' must be an instruction name"); | |
1591 if( node->is_ideal_if() && new_inst->is_ideal_if() ) { | |
1592 fprintf(fp, " ((MachIfNode*)n%d)->_prob = _prob;\n",cnt); | |
1593 fprintf(fp, " ((MachIfNode*)n%d)->_fcnt = _fcnt;\n",cnt); | |
1594 } | |
1595 | |
1596 if( node->is_ideal_fastlock() && new_inst->is_ideal_fastlock() ) { | |
1597 fprintf(fp, " ((MachFastLockNode*)n%d)->_counters = _counters;\n",cnt); | |
1598 } | |
1599 | |
1600 const char *resultOper = new_inst->reduce_result(); | |
1601 fprintf(fp," n%d->set_opnd_array(0, state->MachOperGenerator( %s, C ));\n", | |
1602 cnt, machOperEnum(resultOper)); | |
1603 | |
1604 // get the formal operand NameList | |
1605 NameList *formal_lst = &new_inst->_parameters; | |
1606 formal_lst->reset(); | |
1607 | |
1608 // Handle any memory operand | |
1609 int memory_operand = new_inst->memory_operand(_globalNames); | |
1610 if( memory_operand != InstructForm::NO_MEMORY_OPERAND ) { | |
1611 int node_mem_op = node->memory_operand(_globalNames); | |
1612 assert( node_mem_op != InstructForm::NO_MEMORY_OPERAND, | |
1613 "expand rule member needs memory but top-level inst doesn't have any" ); | |
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
1614 if (!missing_memory_edge) { |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
1615 // Copy memory edge |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
1616 fprintf(fp," n%d->add_req(_in[1]);\t// Add memory edge\n", cnt); |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
1617 } |
0 | 1618 } |
1619 | |
1620 // Iterate over the new instruction's operands | |
415
4d9884b01ba6
6754519: don't emit flag fixup for NaN when condition being tested doesn't need it
never
parents:
196
diff
changeset
|
1621 int prev_pos = -1; |
0 | 1622 for( expand_instr->reset(); (opid = expand_instr->iter()) != NULL; ) { |
1623 // Use 'parameter' at current position in list of new instruction's formals | |
1624 // instead of 'opid' when looking up info internal to new_inst | |
1625 const char *parameter = formal_lst->iter(); | |
1626 // Check for an operand which is created in the expand rule | |
1627 if ((exp_pos = node->_exprule->_newopers.index(opid)) != -1) { | |
1628 new_pos = new_inst->operand_position(parameter,Component::USE); | |
1629 exp_pos += node->num_opnds(); | |
1630 // If there is no use of the created operand, just skip it | |
1631 if (new_pos != -1) { | |
1632 //Copy the operand from the original made above | |
1633 fprintf(fp," n%d->set_opnd_array(%d, op%d->clone(C)); // %s\n", | |
1634 cnt, new_pos, exp_pos-node->num_opnds(), opid); | |
1635 // Check for who defines this operand & add edge if needed | |
1636 fprintf(fp," if(tmp%d != NULL)\n", exp_pos); | |
1637 fprintf(fp," n%d->add_req(tmp%d);\n", cnt, exp_pos); | |
1638 } | |
1639 } | |
1640 else { | |
1641 // Use operand name to get an index into instruction component list | |
1642 // ins = (InstructForm *) _globalNames[new_id]; | |
1643 exp_pos = node->operand_position_format(opid); | |
1644 assert(exp_pos != -1, "Bad expand rule"); | |
415
4d9884b01ba6
6754519: don't emit flag fixup for NaN when condition being tested doesn't need it
never
parents:
196
diff
changeset
|
1645 if (prev_pos > exp_pos && expand_instruction->_matrule != NULL) { |
4d9884b01ba6
6754519: don't emit flag fixup for NaN when condition being tested doesn't need it
never
parents:
196
diff
changeset
|
1646 // For the add_req calls below to work correctly they need |
4d9884b01ba6
6754519: don't emit flag fixup for NaN when condition being tested doesn't need it
never
parents:
196
diff
changeset
|
1647 // to added in the same order that a match would add them. |
4d9884b01ba6
6754519: don't emit flag fixup for NaN when condition being tested doesn't need it
never
parents:
196
diff
changeset
|
1648 // This means that they would need to be in the order of |
4d9884b01ba6
6754519: don't emit flag fixup for NaN when condition being tested doesn't need it
never
parents:
196
diff
changeset
|
1649 // the components list instead of the formal parameters. |
4d9884b01ba6
6754519: don't emit flag fixup for NaN when condition being tested doesn't need it
never
parents:
196
diff
changeset
|
1650 // This is a sort of hidden invariant that previously |
4d9884b01ba6
6754519: don't emit flag fixup for NaN when condition being tested doesn't need it
never
parents:
196
diff
changeset
|
1651 // wasn't checked and could lead to incorrectly |
4d9884b01ba6
6754519: don't emit flag fixup for NaN when condition being tested doesn't need it
never
parents:
196
diff
changeset
|
1652 // constructed nodes. |
4d9884b01ba6
6754519: don't emit flag fixup for NaN when condition being tested doesn't need it
never
parents:
196
diff
changeset
|
1653 syntax_err(node->_linenum, "For expand in %s to work, parameter declaration order in %s must follow matchrule\n", |
4d9884b01ba6
6754519: don't emit flag fixup for NaN when condition being tested doesn't need it
never
parents:
196
diff
changeset
|
1654 node->_ident, new_inst->_ident); |
4d9884b01ba6
6754519: don't emit flag fixup for NaN when condition being tested doesn't need it
never
parents:
196
diff
changeset
|
1655 } |
4d9884b01ba6
6754519: don't emit flag fixup for NaN when condition being tested doesn't need it
never
parents:
196
diff
changeset
|
1656 prev_pos = exp_pos; |
0 | 1657 |
1658 new_pos = new_inst->operand_position(parameter,Component::USE); | |
1659 if (new_pos != -1) { | |
1660 // Copy the operand from the ExpandNode to the new node | |
1661 fprintf(fp," n%d->set_opnd_array(%d, opnd_array(%d)->clone(C)); // %s\n", | |
1662 cnt, new_pos, exp_pos, opid); | |
1663 // For each operand add appropriate input edges by looking at tmp's | |
1664 fprintf(fp," if(tmp%d == this) {\n", exp_pos); | |
1665 // Grab corresponding edges from ExpandNode and insert them here | |
1666 fprintf(fp," for(unsigned i = 0; i < num%d; i++) {\n", exp_pos); | |
1667 fprintf(fp," n%d->add_req(_in[i + idx%d]);\n", cnt, exp_pos); | |
1668 fprintf(fp," }\n"); | |
1669 fprintf(fp," }\n"); | |
1670 // This value is generated by one of the new instructions | |
1671 fprintf(fp," else n%d->add_req(tmp%d);\n", cnt, exp_pos); | |
1672 } | |
1673 } | |
1674 | |
1675 // Update the DAG tmp's for values defined by this instruction | |
1676 int new_def_pos = new_inst->operand_position(parameter,Component::DEF); | |
1677 Effect *eform = (Effect *)new_inst->_effects[parameter]; | |
1678 // If this operand is a definition in either an effects rule | |
1679 // or a match rule | |
1680 if((eform) && (is_def(eform->_use_def))) { | |
1681 // Update the temp associated with this operand | |
1682 fprintf(fp," tmp%d = n%d;\n", exp_pos, cnt); | |
1683 } | |
1684 else if( new_def_pos != -1 ) { | |
1685 // Instruction defines a value but user did not declare it | |
1686 // in the 'effect' clause | |
1687 fprintf(fp," tmp%d = n%d;\n", exp_pos, cnt); | |
1688 } | |
1689 } // done iterating over a new instruction's operands | |
1690 | |
1691 // Invoke Expand() for the newly created instruction. | |
1692 fprintf(fp," result = n%d->Expand( state, proj_list );\n", cnt); | |
1693 assert( !new_inst->expands(), "Do not have complete support for recursive expansion"); | |
1694 } // done iterating over new instructions | |
1695 fprintf(fp,"\n"); | |
1696 } // done generating expand rule | |
1697 | |
1698 else if( node->_matrule != NULL ) { | |
1699 // Remove duplicated operands and inputs which use the same name. | |
1700 // Seach through match operands for the same name usage. | |
1701 uint cur_num_opnds = node->num_opnds(); | |
1702 if( cur_num_opnds > 1 && cur_num_opnds != node->num_unique_opnds() ) { | |
1703 Component *comp = NULL; | |
1704 // Build mapping from num_edges to local variables | |
1705 fprintf(fp," unsigned num0 = 0;\n"); | |
1706 for( i = 1; i < cur_num_opnds; i++ ) { | |
1707 fprintf(fp," unsigned num%d = opnd_array(%d)->num_edges();\n",i,i); | |
1708 } | |
1709 // Build a mapping from operand index to input edges | |
1710 fprintf(fp," unsigned idx0 = oper_input_base();\n"); | |
1711 for( i = 0; i < cur_num_opnds; i++ ) { | |
1712 fprintf(fp," unsigned idx%d = idx%d + num%d;\n", | |
1713 i+1,i,i); | |
1714 } | |
1715 | |
1716 uint new_num_opnds = 1; | |
1717 node->_components.reset(); | |
1718 // Skip first unique operands. | |
1719 for( i = 1; i < cur_num_opnds; i++ ) { | |
1720 comp = node->_components.iter(); | |
1721 if( (int)i != node->unique_opnds_idx(i) ) { | |
1722 break; | |
1723 } | |
1724 new_num_opnds++; | |
1725 } | |
1726 // Replace not unique operands with next unique operands. | |
1727 for( ; i < cur_num_opnds; i++ ) { | |
1728 comp = node->_components.iter(); | |
1729 int j = node->unique_opnds_idx(i); | |
1730 // unique_opnds_idx(i) is unique if unique_opnds_idx(j) is not unique. | |
1731 if( j != node->unique_opnds_idx(j) ) { | |
1732 fprintf(fp," set_opnd_array(%d, opnd_array(%d)->clone(C)); // %s\n", | |
1733 new_num_opnds, i, comp->_name); | |
1734 // delete not unique edges here | |
1735 fprintf(fp," for(unsigned i = 0; i < num%d; i++) {\n", i); | |
1736 fprintf(fp," set_req(i + idx%d, _in[i + idx%d]);\n", new_num_opnds, i); | |
1737 fprintf(fp," }\n"); | |
1738 fprintf(fp," num%d = num%d;\n", new_num_opnds, i); | |
1739 fprintf(fp," idx%d = idx%d + num%d;\n", new_num_opnds+1, new_num_opnds, new_num_opnds); | |
1740 new_num_opnds++; | |
1741 } | |
1742 } | |
1743 // delete the rest of edges | |
1744 fprintf(fp," for(int i = idx%d - 1; i >= (int)idx%d; i--) {\n", cur_num_opnds, new_num_opnds); | |
603
dbbe28fc66b5
6778669: Patch from Red Hat -- fixes compilation errors
twisti
parents:
415
diff
changeset
|
1745 fprintf(fp," del_req(i);\n"); |
0 | 1746 fprintf(fp," }\n"); |
1747 fprintf(fp," _num_opnds = %d;\n", new_num_opnds); | |
785 | 1748 assert(new_num_opnds == node->num_unique_opnds(), "what?"); |
0 | 1749 } |
1750 } | |
1751 | |
1752 | |
1753 // Generate projections for instruction's additional DEFs and KILLs | |
1754 if( ! node->expands() && (node->needs_projections() || node->has_temps())) { | |
1755 // Get string representing the MachNode that projections point at | |
1756 const char *machNode = "this"; | |
1757 // Generate the projections | |
1758 fprintf(fp," // Add projection edges for additional defs or kills\n"); | |
1759 | |
1760 // Examine each component to see if it is a DEF or KILL | |
1761 node->_components.reset(); | |
1762 // Skip the first component, if already handled as (SET dst (...)) | |
1763 Component *comp = NULL; | |
1764 // For kills, the choice of projection numbers is arbitrary | |
1765 int proj_no = 1; | |
1766 bool declared_def = false; | |
1767 bool declared_kill = false; | |
1768 | |
1769 while( (comp = node->_components.iter()) != NULL ) { | |
1770 // Lookup register class associated with operand type | |
1771 Form *form = (Form*)_globalNames[comp->_type]; | |
1772 assert( form, "component type must be a defined form"); | |
1773 OperandForm *op = form->is_operand(); | |
1774 | |
1775 if (comp->is(Component::TEMP)) { | |
1776 fprintf(fp, " // TEMP %s\n", comp->_name); | |
1777 if (!declared_def) { | |
1778 // Define the variable "def" to hold new MachProjNodes | |
1779 fprintf(fp, " MachTempNode *def;\n"); | |
1780 declared_def = true; | |
1781 } | |
1782 if (op && op->_interface && op->_interface->is_RegInterface()) { | |
1783 fprintf(fp," def = new (C) MachTempNode(state->MachOperGenerator( %s, C ));\n", | |
1784 machOperEnum(op->_ident)); | |
1785 fprintf(fp," add_req(def);\n"); | |
1786 int idx = node->operand_position_format(comp->_name); | |
1787 fprintf(fp," set_opnd_array(%d, state->MachOperGenerator( %s, C ));\n", | |
1788 idx, machOperEnum(op->_ident)); | |
1789 } else { | |
1790 assert(false, "can't have temps which aren't registers"); | |
1791 } | |
1792 } else if (comp->isa(Component::KILL)) { | |
1793 fprintf(fp, " // DEF/KILL %s\n", comp->_name); | |
1794 | |
1795 if (!declared_kill) { | |
1796 // Define the variable "kill" to hold new MachProjNodes | |
1797 fprintf(fp, " MachProjNode *kill;\n"); | |
1798 declared_kill = true; | |
1799 } | |
1800 | |
1801 assert( op, "Support additional KILLS for base operands"); | |
1802 const char *regmask = reg_mask(*op); | |
1803 const char *ideal_type = op->ideal_type(_globalNames, _register); | |
1804 | |
1805 if (!op->is_bound_register()) { | |
1806 syntax_err(node->_linenum, "In %s only bound registers can be killed: %s %s\n", | |
1807 node->_ident, comp->_type, comp->_name); | |
1808 } | |
1809 | |
1810 fprintf(fp," kill = "); | |
1811 fprintf(fp,"new (C, 1) MachProjNode( %s, %d, (%s), Op_%s );\n", | |
1812 machNode, proj_no++, regmask, ideal_type); | |
1813 fprintf(fp," proj_list.push(kill);\n"); | |
1814 } | |
1815 } | |
1816 } | |
1817 | |
1818 fprintf(fp,"\n"); | |
1819 if( node->expands() ) { | |
603
dbbe28fc66b5
6778669: Patch from Red Hat -- fixes compilation errors
twisti
parents:
415
diff
changeset
|
1820 fprintf(fp," return result;\n"); |
0 | 1821 } else { |
1822 fprintf(fp," return this;\n"); | |
1823 } | |
1824 fprintf(fp,"}\n"); | |
1825 fprintf(fp,"\n"); | |
1826 } | |
1827 | |
1828 | |
1829 //------------------------------Emit Routines---------------------------------- | |
1830 // Special classes and routines for defining node emit routines which output | |
1831 // target specific instruction object encodings. | |
1832 // Define the ___Node::emit() routine | |
1833 // | |
1834 // (1) void ___Node::emit(CodeBuffer &cbuf, PhaseRegAlloc *ra_) const { | |
1835 // (2) // ... encoding defined by user | |
1836 // (3) | |
1837 // (4) } | |
1838 // | |
1839 | |
1840 class DefineEmitState { | |
1841 private: | |
1842 enum reloc_format { RELOC_NONE = -1, | |
1843 RELOC_IMMEDIATE = 0, | |
1844 RELOC_DISP = 1, | |
1845 RELOC_CALL_DISP = 2 }; | |
1846 enum literal_status{ LITERAL_NOT_SEEN = 0, | |
1847 LITERAL_SEEN = 1, | |
1848 LITERAL_ACCESSED = 2, | |
1849 LITERAL_OUTPUT = 3 }; | |
1850 // Temporaries that describe current operand | |
1851 bool _cleared; | |
1852 OpClassForm *_opclass; | |
1853 OperandForm *_operand; | |
1854 int _operand_idx; | |
1855 const char *_local_name; | |
1856 const char *_operand_name; | |
1857 bool _doing_disp; | |
1858 bool _doing_constant; | |
1859 Form::DataType _constant_type; | |
1860 DefineEmitState::literal_status _constant_status; | |
1861 DefineEmitState::literal_status _reg_status; | |
1862 bool _doing_emit8; | |
1863 bool _doing_emit_d32; | |
1864 bool _doing_emit_d16; | |
1865 bool _doing_emit_hi; | |
1866 bool _doing_emit_lo; | |
1867 bool _may_reloc; | |
1868 bool _must_reloc; | |
1869 reloc_format _reloc_form; | |
1870 const char * _reloc_type; | |
1871 bool _processing_noninput; | |
1872 | |
1873 NameList _strings_to_emit; | |
1874 | |
1875 // Stable state, set by constructor | |
1876 ArchDesc &_AD; | |
1877 FILE *_fp; | |
1878 EncClass &_encoding; | |
1879 InsEncode &_ins_encode; | |
1880 InstructForm &_inst; | |
1881 | |
1882 public: | |
1883 DefineEmitState(FILE *fp, ArchDesc &AD, EncClass &encoding, | |
1884 InsEncode &ins_encode, InstructForm &inst) | |
1885 : _AD(AD), _fp(fp), _encoding(encoding), _ins_encode(ins_encode), _inst(inst) { | |
1886 clear(); | |
1887 } | |
1888 | |
1889 void clear() { | |
1890 _cleared = true; | |
1891 _opclass = NULL; | |
1892 _operand = NULL; | |
1893 _operand_idx = 0; | |
1894 _local_name = ""; | |
1895 _operand_name = ""; | |
1896 _doing_disp = false; | |
1897 _doing_constant= false; | |
1898 _constant_type = Form::none; | |
1899 _constant_status = LITERAL_NOT_SEEN; | |
1900 _reg_status = LITERAL_NOT_SEEN; | |
1901 _doing_emit8 = false; | |
1902 _doing_emit_d32= false; | |
1903 _doing_emit_d16= false; | |
1904 _doing_emit_hi = false; | |
1905 _doing_emit_lo = false; | |
1906 _may_reloc = false; | |
1907 _must_reloc = false; | |
1908 _reloc_form = RELOC_NONE; | |
1909 _reloc_type = AdlcVMDeps::none_reloc_type(); | |
1910 _strings_to_emit.clear(); | |
1911 } | |
1912 | |
1913 // Track necessary state when identifying a replacement variable | |
1914 void update_state(const char *rep_var) { | |
1915 // A replacement variable or one of its subfields | |
1916 // Obtain replacement variable from list | |
1917 if ( (*rep_var) != '$' ) { | |
1918 // A replacement variable, '$' prefix | |
1919 // check_rep_var( rep_var ); | |
1920 if ( Opcode::as_opcode_type(rep_var) != Opcode::NOT_AN_OPCODE ) { | |
1921 // No state needed. | |
1922 assert( _opclass == NULL, | |
1923 "'primary', 'secondary' and 'tertiary' don't follow operand."); | |
1924 } else { | |
1925 // Lookup its position in parameter list | |
1926 int param_no = _encoding.rep_var_index(rep_var); | |
1927 if ( param_no == -1 ) { | |
1928 _AD.syntax_err( _encoding._linenum, | |
1929 "Replacement variable %s not found in enc_class %s.\n", | |
1930 rep_var, _encoding._name); | |
1931 } | |
1932 | |
1933 // Lookup the corresponding ins_encode parameter | |
1934 const char *inst_rep_var = _ins_encode.rep_var_name(_inst, param_no); | |
1935 if (inst_rep_var == NULL) { | |
1936 _AD.syntax_err( _ins_encode._linenum, | |
1937 "Parameter %s not passed to enc_class %s from instruct %s.\n", | |
1938 rep_var, _encoding._name, _inst._ident); | |
1939 } | |
1940 | |
1941 // Check if instruction's actual parameter is a local name in the instruction | |
1942 const Form *local = _inst._localNames[inst_rep_var]; | |
1943 OpClassForm *opc = (local != NULL) ? local->is_opclass() : NULL; | |
1944 // Note: assert removed to allow constant and symbolic parameters | |
1945 // assert( opc, "replacement variable was not found in local names"); | |
1946 // Lookup the index position iff the replacement variable is a localName | |
1947 int idx = (opc != NULL) ? _inst.operand_position_format(inst_rep_var) : -1; | |
1948 | |
1949 if ( idx != -1 ) { | |
1950 // This is a local in the instruction | |
1951 // Update local state info. | |
1952 _opclass = opc; | |
1953 _operand_idx = idx; | |
1954 _local_name = rep_var; | |
1955 _operand_name = inst_rep_var; | |
1956 | |
1957 // !!!!! | |
1958 // Do not support consecutive operands. | |
1959 assert( _operand == NULL, "Unimplemented()"); | |
1960 _operand = opc->is_operand(); | |
1961 } | |
1962 else if( ADLParser::is_literal_constant(inst_rep_var) ) { | |
1963 // Instruction provided a constant expression | |
1964 // Check later that encoding specifies $$$constant to resolve as constant | |
1965 _constant_status = LITERAL_SEEN; | |
1966 } | |
1967 else if( Opcode::as_opcode_type(inst_rep_var) != Opcode::NOT_AN_OPCODE ) { | |
1968 // Instruction provided an opcode: "primary", "secondary", "tertiary" | |
1969 // Check later that encoding specifies $$$constant to resolve as constant | |
1970 _constant_status = LITERAL_SEEN; | |
1971 } | |
1972 else if((_AD.get_registers() != NULL ) && (_AD.get_registers()->getRegDef(inst_rep_var) != NULL)) { | |
1973 // Instruction provided a literal register name for this parameter | |
1974 // Check that encoding specifies $$$reg to resolve.as register. | |
1975 _reg_status = LITERAL_SEEN; | |
1976 } | |
1977 else { | |
1978 // Check for unimplemented functionality before hard failure | |
1979 assert( strcmp(opc->_ident,"label")==0, "Unimplemented() Label"); | |
1980 assert( false, "ShouldNotReachHere()"); | |
1981 } | |
1982 } // done checking which operand this is. | |
1983 } else { | |
1984 // | |
1985 // A subfield variable, '$$' prefix | |
1986 // Check for fields that may require relocation information. | |
1987 // Then check that literal register parameters are accessed with 'reg' or 'constant' | |
1988 // | |
1989 if ( strcmp(rep_var,"$disp") == 0 ) { | |
1990 _doing_disp = true; | |
1991 assert( _opclass, "Must use operand or operand class before '$disp'"); | |
1992 if( _operand == NULL ) { | |
1993 // Only have an operand class, generate run-time check for relocation | |
1994 _may_reloc = true; | |
1995 _reloc_form = RELOC_DISP; | |
1996 _reloc_type = AdlcVMDeps::oop_reloc_type(); | |
1997 } else { | |
1998 // Do precise check on operand: is it a ConP or not | |
1999 // | |
2000 // Check interface for value of displacement | |
2001 assert( ( _operand->_interface != NULL ), | |
2002 "$disp can only follow memory interface operand"); | |
2003 MemInterface *mem_interface= _operand->_interface->is_MemInterface(); | |
2004 assert( mem_interface != NULL, | |
2005 "$disp can only follow memory interface operand"); | |
2006 const char *disp = mem_interface->_disp; | |
2007 | |
2008 if( disp != NULL && (*disp == '$') ) { | |
2009 // MemInterface::disp contains a replacement variable, | |
2010 // Check if this matches a ConP | |
2011 // | |
2012 // Lookup replacement variable, in operand's component list | |
2013 const char *rep_var_name = disp + 1; // Skip '$' | |
2014 const Component *comp = _operand->_components.search(rep_var_name); | |
2015 assert( comp != NULL,"Replacement variable not found in components"); | |
2016 const char *type = comp->_type; | |
2017 // Lookup operand form for replacement variable's type | |
2018 const Form *form = _AD.globalNames()[type]; | |
2019 assert( form != NULL, "Replacement variable's type not found"); | |
2020 OperandForm *op = form->is_operand(); | |
2021 assert( op, "Attempting to emit a non-register or non-constant"); | |
2022 // Check if this is a constant | |
2023 if (op->_matrule && op->_matrule->is_base_constant(_AD.globalNames())) { | |
2024 // Check which constant this name maps to: _c0, _c1, ..., _cn | |
2025 // const int idx = _operand.constant_position(_AD.globalNames(), comp); | |
2026 // assert( idx != -1, "Constant component not found in operand"); | |
2027 Form::DataType dtype = op->is_base_constant(_AD.globalNames()); | |
2028 if ( dtype == Form::idealP ) { | |
2029 _may_reloc = true; | |
2030 // No longer true that idealP is always an oop | |
2031 _reloc_form = RELOC_DISP; | |
2032 _reloc_type = AdlcVMDeps::oop_reloc_type(); | |
2033 } | |
2034 } | |
2035 | |
2036 else if( _operand->is_user_name_for_sReg() != Form::none ) { | |
2037 // The only non-constant allowed access to disp is an operand sRegX in a stackSlotX | |
2038 assert( op->ideal_to_sReg_type(type) != Form::none, "StackSlots access displacements using 'sRegs'"); | |
2039 _may_reloc = false; | |
2040 } else { | |
2041 assert( false, "fatal(); Only stackSlots can access a non-constant using 'disp'"); | |
2042 } | |
2043 } | |
2044 } // finished with precise check of operand for relocation. | |
2045 } // finished with subfield variable | |
2046 else if ( strcmp(rep_var,"$constant") == 0 ) { | |
2047 _doing_constant = true; | |
2048 if ( _constant_status == LITERAL_NOT_SEEN ) { | |
2049 // Check operand for type of constant | |
2050 assert( _operand, "Must use operand before '$$constant'"); | |
2051 Form::DataType dtype = _operand->is_base_constant(_AD.globalNames()); | |
2052 _constant_type = dtype; | |
2053 if ( dtype == Form::idealP ) { | |
2054 _may_reloc = true; | |
2055 // No longer true that idealP is always an oop | |
2056 // // _must_reloc = true; | |
2057 _reloc_form = RELOC_IMMEDIATE; | |
2058 _reloc_type = AdlcVMDeps::oop_reloc_type(); | |
2059 } else { | |
2060 // No relocation information needed | |
2061 } | |
2062 } else { | |
2063 // User-provided literals may not require relocation information !!!!! | |
2064 assert( _constant_status == LITERAL_SEEN, "Must know we are processing a user-provided literal"); | |
2065 } | |
2066 } | |
2067 else if ( strcmp(rep_var,"$label") == 0 ) { | |
2068 // Calls containing labels require relocation | |
2069 if ( _inst.is_ideal_call() ) { | |
2070 _may_reloc = true; | |
2071 // !!!!! !!!!! | |
2072 _reloc_type = AdlcVMDeps::none_reloc_type(); | |
2073 } | |
2074 } | |
2075 | |
2076 // literal register parameter must be accessed as a 'reg' field. | |
2077 if ( _reg_status != LITERAL_NOT_SEEN ) { | |
2078 assert( _reg_status == LITERAL_SEEN, "Must have seen register literal before now"); | |
2079 if (strcmp(rep_var,"$reg") == 0 || reg_conversion(rep_var) != NULL) { | |
2080 _reg_status = LITERAL_ACCESSED; | |
2081 } else { | |
2082 assert( false, "invalid access to literal register parameter"); | |
2083 } | |
2084 } | |
2085 // literal constant parameters must be accessed as a 'constant' field | |
2086 if ( _constant_status != LITERAL_NOT_SEEN ) { | |
2087 assert( _constant_status == LITERAL_SEEN, "Must have seen constant literal before now"); | |
2088 if( strcmp(rep_var,"$constant") == 0 ) { | |
2089 _constant_status = LITERAL_ACCESSED; | |
2090 } else { | |
2091 assert( false, "invalid access to literal constant parameter"); | |
2092 } | |
2093 } | |
2094 } // end replacement and/or subfield | |
2095 | |
2096 } | |
2097 | |
2098 void add_rep_var(const char *rep_var) { | |
2099 // Handle subfield and replacement variables. | |
2100 if ( ( *rep_var == '$' ) && ( *(rep_var+1) == '$' ) ) { | |
2101 // Check for emit prefix, '$$emit32' | |
2102 assert( _cleared, "Can not nest $$$emit32"); | |
2103 if ( strcmp(rep_var,"$$emit32") == 0 ) { | |
2104 _doing_emit_d32 = true; | |
2105 } | |
2106 else if ( strcmp(rep_var,"$$emit16") == 0 ) { | |
2107 _doing_emit_d16 = true; | |
2108 } | |
2109 else if ( strcmp(rep_var,"$$emit_hi") == 0 ) { | |
2110 _doing_emit_hi = true; | |
2111 } | |
2112 else if ( strcmp(rep_var,"$$emit_lo") == 0 ) { | |
2113 _doing_emit_lo = true; | |
2114 } | |
2115 else if ( strcmp(rep_var,"$$emit8") == 0 ) { | |
2116 _doing_emit8 = true; | |
2117 } | |
2118 else { | |
2119 _AD.syntax_err(_encoding._linenum, "Unsupported $$operation '%s'\n",rep_var); | |
2120 assert( false, "fatal();"); | |
2121 } | |
2122 } | |
2123 else { | |
2124 // Update state for replacement variables | |
2125 update_state( rep_var ); | |
2126 _strings_to_emit.addName(rep_var); | |
2127 } | |
2128 _cleared = false; | |
2129 } | |
2130 | |
2131 void emit_replacement() { | |
2132 // A replacement variable or one of its subfields | |
2133 // Obtain replacement variable from list | |
2134 // const char *ec_rep_var = encoding->_rep_vars.iter(); | |
2135 const char *rep_var; | |
2136 _strings_to_emit.reset(); | |
2137 while ( (rep_var = _strings_to_emit.iter()) != NULL ) { | |
2138 | |
2139 if ( (*rep_var) == '$' ) { | |
2140 // A subfield variable, '$$' prefix | |
2141 emit_field( rep_var ); | |
2142 } else { | |
624 | 2143 if (_strings_to_emit.peek() != NULL && |
2144 strcmp(_strings_to_emit.peek(), "$Address") == 0) { | |
2145 fprintf(_fp, "Address::make_raw("); | |
2146 | |
2147 emit_rep_var( rep_var ); | |
2148 fprintf(_fp,"->base(ra_,this,idx%d), ", _operand_idx); | |
2149 | |
2150 _reg_status = LITERAL_ACCESSED; | |
2151 emit_rep_var( rep_var ); | |
2152 fprintf(_fp,"->index(ra_,this,idx%d), ", _operand_idx); | |
2153 | |
2154 _reg_status = LITERAL_ACCESSED; | |
2155 emit_rep_var( rep_var ); | |
2156 fprintf(_fp,"->scale(), "); | |
2157 | |
2158 _reg_status = LITERAL_ACCESSED; | |
2159 emit_rep_var( rep_var ); | |
2160 Form::DataType stack_type = _operand ? _operand->is_user_name_for_sReg() : Form::none; | |
2161 if( _operand && _operand_idx==0 && stack_type != Form::none ) { | |
2162 fprintf(_fp,"->disp(ra_,this,0), "); | |
2163 } else { | |
2164 fprintf(_fp,"->disp(ra_,this,idx%d), ", _operand_idx); | |
2165 } | |
2166 | |
2167 _reg_status = LITERAL_ACCESSED; | |
2168 emit_rep_var( rep_var ); | |
2169 fprintf(_fp,"->disp_is_oop())"); | |
2170 | |
2171 // skip trailing $Address | |
2172 _strings_to_emit.iter(); | |
2173 } else { | |
2174 // A replacement variable, '$' prefix | |
2175 const char* next = _strings_to_emit.peek(); | |
2176 const char* next2 = _strings_to_emit.peek(2); | |
2177 if (next != NULL && next2 != NULL && strcmp(next2, "$Register") == 0 && | |
2178 (strcmp(next, "$base") == 0 || strcmp(next, "$index") == 0)) { | |
2179 // handle $rev_var$$base$$Register and $rev_var$$index$$Register by | |
2180 // producing as_Register(opnd_array(#)->base(ra_,this,idx1)). | |
2181 fprintf(_fp, "as_Register("); | |
2182 // emit the operand reference | |
2183 emit_rep_var( rep_var ); | |
2184 rep_var = _strings_to_emit.iter(); | |
2185 assert(strcmp(rep_var, "$base") == 0 || strcmp(rep_var, "$index") == 0, "bad pattern"); | |
2186 // handle base or index | |
2187 emit_field(rep_var); | |
2188 rep_var = _strings_to_emit.iter(); | |
2189 assert(strcmp(rep_var, "$Register") == 0, "bad pattern"); | |
2190 // close up the parens | |
2191 fprintf(_fp, ")"); | |
2192 } else { | |
2193 emit_rep_var( rep_var ); | |
2194 } | |
2195 } | |
0 | 2196 } // end replacement and/or subfield |
2197 } | |
2198 } | |
2199 | |
2200 void emit_reloc_type(const char* type) { | |
2201 fprintf(_fp, "%s", type) | |
2202 ; | |
2203 } | |
2204 | |
2205 | |
2206 void gen_emit_x_reloc(const char *d32_lo_hi ) { | |
2207 fprintf(_fp,"emit_%s_reloc(cbuf, ", d32_lo_hi ); | |
2208 emit_replacement(); fprintf(_fp,", "); | |
2209 emit_reloc_type( _reloc_type ); fprintf(_fp,", "); | |
2210 fprintf(_fp, "%d", _reloc_form);fprintf(_fp, ");"); | |
2211 } | |
2212 | |
2213 | |
2214 void emit() { | |
2215 // | |
2216 // "emit_d32_reloc(" or "emit_hi_reloc" or "emit_lo_reloc" | |
2217 // | |
2218 // Emit the function name when generating an emit function | |
2219 if ( _doing_emit_d32 || _doing_emit_hi || _doing_emit_lo ) { | |
2220 const char *d32_hi_lo = _doing_emit_d32 ? "d32" : (_doing_emit_hi ? "hi" : "lo"); | |
2221 // In general, relocatable isn't known at compiler compile time. | |
2222 // Check results of prior scan | |
2223 if ( ! _may_reloc ) { | |
2224 // Definitely don't need relocation information | |
2225 fprintf( _fp, "emit_%s(cbuf, ", d32_hi_lo ); | |
2226 emit_replacement(); fprintf(_fp, ")"); | |
2227 } | |
2228 else if ( _must_reloc ) { | |
2229 // Must emit relocation information | |
2230 gen_emit_x_reloc( d32_hi_lo ); | |
2231 } | |
2232 else { | |
2233 // Emit RUNTIME CHECK to see if value needs relocation info | |
2234 // If emitting a relocatable address, use 'emit_d32_reloc' | |
2235 const char *disp_constant = _doing_disp ? "disp" : _doing_constant ? "constant" : "INVALID"; | |
2236 assert( (_doing_disp || _doing_constant) | |
2237 && !(_doing_disp && _doing_constant), | |
2238 "Must be emitting either a displacement or a constant"); | |
2239 fprintf(_fp,"\n"); | |
2240 fprintf(_fp,"if ( opnd_array(%d)->%s_is_oop() ) {\n", | |
2241 _operand_idx, disp_constant); | |
2242 fprintf(_fp," "); | |
2243 gen_emit_x_reloc( d32_hi_lo ); fprintf(_fp,"\n"); | |
2244 fprintf(_fp,"} else {\n"); | |
2245 fprintf(_fp," emit_%s(cbuf, ", d32_hi_lo); | |
2246 emit_replacement(); fprintf(_fp, ");\n"); fprintf(_fp,"}"); | |
2247 } | |
2248 } | |
2249 else if ( _doing_emit_d16 ) { | |
2250 // Relocation of 16-bit values is not supported | |
2251 fprintf(_fp,"emit_d16(cbuf, "); | |
2252 emit_replacement(); fprintf(_fp, ")"); | |
2253 // No relocation done for 16-bit values | |
2254 } | |
2255 else if ( _doing_emit8 ) { | |
2256 // Relocation of 8-bit values is not supported | |
2257 fprintf(_fp,"emit_d8(cbuf, "); | |
2258 emit_replacement(); fprintf(_fp, ")"); | |
2259 // No relocation done for 8-bit values | |
2260 } | |
2261 else { | |
2262 // Not an emit# command, just output the replacement string. | |
2263 emit_replacement(); | |
2264 } | |
2265 | |
2266 // Get ready for next state collection. | |
2267 clear(); | |
2268 } | |
2269 | |
2270 private: | |
2271 | |
2272 // recognizes names which represent MacroAssembler register types | |
2273 // and return the conversion function to build them from OptoReg | |
2274 const char* reg_conversion(const char* rep_var) { | |
2275 if (strcmp(rep_var,"$Register") == 0) return "as_Register"; | |
2276 if (strcmp(rep_var,"$FloatRegister") == 0) return "as_FloatRegister"; | |
2277 #if defined(IA32) || defined(AMD64) | |
2278 if (strcmp(rep_var,"$XMMRegister") == 0) return "as_XMMRegister"; | |
2279 #endif | |
2280 return NULL; | |
2281 } | |
2282 | |
2283 void emit_field(const char *rep_var) { | |
2284 const char* reg_convert = reg_conversion(rep_var); | |
2285 | |
2286 // A subfield variable, '$$subfield' | |
2287 if ( strcmp(rep_var, "$reg") == 0 || reg_convert != NULL) { | |
2288 // $reg form or the $Register MacroAssembler type conversions | |
2289 assert( _operand_idx != -1, | |
2290 "Must use this subfield after operand"); | |
2291 if( _reg_status == LITERAL_NOT_SEEN ) { | |
2292 if (_processing_noninput) { | |
2293 const Form *local = _inst._localNames[_operand_name]; | |
2294 OperandForm *oper = local->is_operand(); | |
2295 const RegDef* first = oper->get_RegClass()->find_first_elem(); | |
2296 if (reg_convert != NULL) { | |
2297 fprintf(_fp, "%s(%s_enc)", reg_convert, first->_regname); | |
2298 } else { | |
2299 fprintf(_fp, "%s_enc", first->_regname); | |
2300 } | |
2301 } else { | |
2302 fprintf(_fp,"->%s(ra_,this", reg_convert != NULL ? reg_convert : "reg"); | |
2303 // Add parameter for index position, if not result operand | |
2304 if( _operand_idx != 0 ) fprintf(_fp,",idx%d", _operand_idx); | |
2305 fprintf(_fp,")"); | |
2306 } | |
2307 } else { | |
2308 assert( _reg_status == LITERAL_OUTPUT, "should have output register literal in emit_rep_var"); | |
2309 // Register literal has already been sent to output file, nothing more needed | |
2310 } | |
2311 } | |
2312 else if ( strcmp(rep_var,"$base") == 0 ) { | |
2313 assert( _operand_idx != -1, | |
2314 "Must use this subfield after operand"); | |
2315 assert( ! _may_reloc, "UnImplemented()"); | |
2316 fprintf(_fp,"->base(ra_,this,idx%d)", _operand_idx); | |
2317 } | |
2318 else if ( strcmp(rep_var,"$index") == 0 ) { | |
2319 assert( _operand_idx != -1, | |
2320 "Must use this subfield after operand"); | |
2321 assert( ! _may_reloc, "UnImplemented()"); | |
2322 fprintf(_fp,"->index(ra_,this,idx%d)", _operand_idx); | |
2323 } | |
2324 else if ( strcmp(rep_var,"$scale") == 0 ) { | |
2325 assert( ! _may_reloc, "UnImplemented()"); | |
2326 fprintf(_fp,"->scale()"); | |
2327 } | |
2328 else if ( strcmp(rep_var,"$cmpcode") == 0 ) { | |
2329 assert( ! _may_reloc, "UnImplemented()"); | |
2330 fprintf(_fp,"->ccode()"); | |
2331 } | |
2332 else if ( strcmp(rep_var,"$constant") == 0 ) { | |
2333 if( _constant_status == LITERAL_NOT_SEEN ) { | |
2334 if ( _constant_type == Form::idealD ) { | |
2335 fprintf(_fp,"->constantD()"); | |
2336 } else if ( _constant_type == Form::idealF ) { | |
2337 fprintf(_fp,"->constantF()"); | |
2338 } else if ( _constant_type == Form::idealL ) { | |
2339 fprintf(_fp,"->constantL()"); | |
2340 } else { | |
2341 fprintf(_fp,"->constant()"); | |
2342 } | |
2343 } else { | |
2344 assert( _constant_status == LITERAL_OUTPUT, "should have output constant literal in emit_rep_var"); | |
2345 // Cosntant literal has already been sent to output file, nothing more needed | |
2346 } | |
2347 } | |
2348 else if ( strcmp(rep_var,"$disp") == 0 ) { | |
2349 Form::DataType stack_type = _operand ? _operand->is_user_name_for_sReg() : Form::none; | |
2350 if( _operand && _operand_idx==0 && stack_type != Form::none ) { | |
2351 fprintf(_fp,"->disp(ra_,this,0)"); | |
2352 } else { | |
2353 fprintf(_fp,"->disp(ra_,this,idx%d)", _operand_idx); | |
2354 } | |
2355 } | |
2356 else if ( strcmp(rep_var,"$label") == 0 ) { | |
2357 fprintf(_fp,"->label()"); | |
2358 } | |
2359 else if ( strcmp(rep_var,"$method") == 0 ) { | |
2360 fprintf(_fp,"->method()"); | |
2361 } | |
2362 else { | |
2363 printf("emit_field: %s\n",rep_var); | |
2364 assert( false, "UnImplemented()"); | |
2365 } | |
2366 } | |
2367 | |
2368 | |
2369 void emit_rep_var(const char *rep_var) { | |
2370 _processing_noninput = false; | |
2371 // A replacement variable, originally '$' | |
2372 if ( Opcode::as_opcode_type(rep_var) != Opcode::NOT_AN_OPCODE ) { | |
415
4d9884b01ba6
6754519: don't emit flag fixup for NaN when condition being tested doesn't need it
never
parents:
196
diff
changeset
|
2373 if (!_inst._opcode->print_opcode(_fp, Opcode::as_opcode_type(rep_var) )) { |
4d9884b01ba6
6754519: don't emit flag fixup for NaN when condition being tested doesn't need it
never
parents:
196
diff
changeset
|
2374 // Missing opcode |
4d9884b01ba6
6754519: don't emit flag fixup for NaN when condition being tested doesn't need it
never
parents:
196
diff
changeset
|
2375 _AD.syntax_err( _inst._linenum, |
4d9884b01ba6
6754519: don't emit flag fixup for NaN when condition being tested doesn't need it
never
parents:
196
diff
changeset
|
2376 "Missing $%s opcode definition in %s, used by encoding %s\n", |
4d9884b01ba6
6754519: don't emit flag fixup for NaN when condition being tested doesn't need it
never
parents:
196
diff
changeset
|
2377 rep_var, _inst._ident, _encoding._name); |
4d9884b01ba6
6754519: don't emit flag fixup for NaN when condition being tested doesn't need it
never
parents:
196
diff
changeset
|
2378 } |
0 | 2379 } |
2380 else { | |
2381 // Lookup its position in parameter list | |
2382 int param_no = _encoding.rep_var_index(rep_var); | |
2383 if ( param_no == -1 ) { | |
2384 _AD.syntax_err( _encoding._linenum, | |
2385 "Replacement variable %s not found in enc_class %s.\n", | |
2386 rep_var, _encoding._name); | |
2387 } | |
2388 // Lookup the corresponding ins_encode parameter | |
2389 const char *inst_rep_var = _ins_encode.rep_var_name(_inst, param_no); | |
2390 | |
2391 // Check if instruction's actual parameter is a local name in the instruction | |
2392 const Form *local = _inst._localNames[inst_rep_var]; | |
2393 OpClassForm *opc = (local != NULL) ? local->is_opclass() : NULL; | |
2394 // Note: assert removed to allow constant and symbolic parameters | |
2395 // assert( opc, "replacement variable was not found in local names"); | |
2396 // Lookup the index position iff the replacement variable is a localName | |
2397 int idx = (opc != NULL) ? _inst.operand_position_format(inst_rep_var) : -1; | |
2398 if( idx != -1 ) { | |
2399 if (_inst.is_noninput_operand(idx)) { | |
2400 // This operand isn't a normal input so printing it is done | |
2401 // specially. | |
2402 _processing_noninput = true; | |
2403 } else { | |
2404 // Output the emit code for this operand | |
2405 fprintf(_fp,"opnd_array(%d)",idx); | |
2406 } | |
2407 assert( _operand == opc->is_operand(), | |
2408 "Previous emit $operand does not match current"); | |
2409 } | |
2410 else if( ADLParser::is_literal_constant(inst_rep_var) ) { | |
2411 // else check if it is a constant expression | |
2412 // Removed following assert to allow primitive C types as arguments to encodings | |
2413 // assert( _constant_status == LITERAL_ACCESSED, "Must be processing a literal constant parameter"); | |
2414 fprintf(_fp,"(%s)", inst_rep_var); | |
2415 _constant_status = LITERAL_OUTPUT; | |
2416 } | |
2417 else if( Opcode::as_opcode_type(inst_rep_var) != Opcode::NOT_AN_OPCODE ) { | |
2418 // else check if "primary", "secondary", "tertiary" | |
2419 assert( _constant_status == LITERAL_ACCESSED, "Must be processing a literal constant parameter"); | |
415
4d9884b01ba6
6754519: don't emit flag fixup for NaN when condition being tested doesn't need it
never
parents:
196
diff
changeset
|
2420 if (!_inst._opcode->print_opcode(_fp, Opcode::as_opcode_type(inst_rep_var) )) { |
4d9884b01ba6
6754519: don't emit flag fixup for NaN when condition being tested doesn't need it
never
parents:
196
diff
changeset
|
2421 // Missing opcode |
4d9884b01ba6
6754519: don't emit flag fixup for NaN when condition being tested doesn't need it
never
parents:
196
diff
changeset
|
2422 _AD.syntax_err( _inst._linenum, |
4d9884b01ba6
6754519: don't emit flag fixup for NaN when condition being tested doesn't need it
never
parents:
196
diff
changeset
|
2423 "Missing $%s opcode definition in %s\n", |
4d9884b01ba6
6754519: don't emit flag fixup for NaN when condition being tested doesn't need it
never
parents:
196
diff
changeset
|
2424 rep_var, _inst._ident); |
4d9884b01ba6
6754519: don't emit flag fixup for NaN when condition being tested doesn't need it
never
parents:
196
diff
changeset
|
2425 |
4d9884b01ba6
6754519: don't emit flag fixup for NaN when condition being tested doesn't need it
never
parents:
196
diff
changeset
|
2426 } |
0 | 2427 _constant_status = LITERAL_OUTPUT; |
2428 } | |
2429 else if((_AD.get_registers() != NULL ) && (_AD.get_registers()->getRegDef(inst_rep_var) != NULL)) { | |
2430 // Instruction provided a literal register name for this parameter | |
2431 // Check that encoding specifies $$$reg to resolve.as register. | |
2432 assert( _reg_status == LITERAL_ACCESSED, "Must be processing a literal register parameter"); | |
2433 fprintf(_fp,"(%s_enc)", inst_rep_var); | |
2434 _reg_status = LITERAL_OUTPUT; | |
2435 } | |
2436 else { | |
2437 // Check for unimplemented functionality before hard failure | |
2438 assert( strcmp(opc->_ident,"label")==0, "Unimplemented() Label"); | |
2439 assert( false, "ShouldNotReachHere()"); | |
2440 } | |
2441 // all done | |
2442 } | |
2443 } | |
2444 | |
2445 }; // end class DefineEmitState | |
2446 | |
2447 | |
2448 void ArchDesc::defineSize(FILE *fp, InstructForm &inst) { | |
2449 | |
2450 //(1) | |
2451 // Output instruction's emit prototype | |
2452 fprintf(fp,"uint %sNode::size(PhaseRegAlloc *ra_) const {\n", | |
2453 inst._ident); | |
2454 | |
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
2455 fprintf(fp, " assert(VerifyOops || MachNode::size(ra_) <= %s, \"bad fixed size\");\n", inst._size); |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
2456 |
0 | 2457 //(2) |
2458 // Print the size | |
2459 fprintf(fp, " return (VerifyOops ? MachNode::size(ra_) : %s);\n", inst._size); | |
2460 | |
2461 // (3) and (4) | |
2462 fprintf(fp,"}\n"); | |
2463 } | |
2464 | |
2465 void ArchDesc::defineEmit(FILE *fp, InstructForm &inst) { | |
2466 InsEncode *ins_encode = inst._insencode; | |
2467 | |
2468 // (1) | |
2469 // Output instruction's emit prototype | |
2470 fprintf(fp,"void %sNode::emit(CodeBuffer &cbuf, PhaseRegAlloc *ra_) const {\n", | |
2471 inst._ident); | |
2472 | |
2473 // If user did not define an encode section, | |
2474 // provide stub that does not generate any machine code. | |
2475 if( (_encode == NULL) || (ins_encode == NULL) ) { | |
2476 fprintf(fp, " // User did not define an encode section.\n"); | |
2477 fprintf(fp,"}\n"); | |
2478 return; | |
2479 } | |
2480 | |
2481 // Save current instruction's starting address (helps with relocation). | |
2482 fprintf( fp, " cbuf.set_inst_mark();\n"); | |
2483 | |
2484 // // // idx0 is only needed for syntactic purposes and only by "storeSSI" | |
2485 // fprintf( fp, " unsigned idx0 = 0;\n"); | |
2486 | |
2487 // Output each operand's offset into the array of registers. | |
2488 inst.index_temps( fp, _globalNames ); | |
2489 | |
2490 // Output this instruction's encodings | |
2491 const char *ec_name; | |
2492 bool user_defined = false; | |
2493 ins_encode->reset(); | |
2494 while ( (ec_name = ins_encode->encode_class_iter()) != NULL ) { | |
2495 fprintf(fp, " {"); | |
2496 // Output user-defined encoding | |
2497 user_defined = true; | |
2498 | |
2499 const char *ec_code = NULL; | |
2500 const char *ec_rep_var = NULL; | |
2501 EncClass *encoding = _encode->encClass(ec_name); | |
2502 if (encoding == NULL) { | |
2503 fprintf(stderr, "User did not define contents of this encode_class: %s\n", ec_name); | |
2504 abort(); | |
2505 } | |
2506 | |
2507 if (ins_encode->current_encoding_num_args() != encoding->num_args()) { | |
2508 globalAD->syntax_err(ins_encode->_linenum, "In %s: passing %d arguments to %s but expecting %d", | |
2509 inst._ident, ins_encode->current_encoding_num_args(), | |
2510 ec_name, encoding->num_args()); | |
2511 } | |
2512 | |
2513 DefineEmitState pending(fp, *this, *encoding, *ins_encode, inst ); | |
2514 encoding->_code.reset(); | |
2515 encoding->_rep_vars.reset(); | |
2516 // Process list of user-defined strings, | |
2517 // and occurrences of replacement variables. | |
2518 // Replacement Vars are pushed into a list and then output | |
2519 while ( (ec_code = encoding->_code.iter()) != NULL ) { | |
2520 if ( ! encoding->_code.is_signal( ec_code ) ) { | |
2521 // Emit pending code | |
2522 pending.emit(); | |
2523 pending.clear(); | |
2524 // Emit this code section | |
2525 fprintf(fp,"%s", ec_code); | |
2526 } else { | |
2527 // A replacement variable or one of its subfields | |
2528 // Obtain replacement variable from list | |
2529 ec_rep_var = encoding->_rep_vars.iter(); | |
2530 pending.add_rep_var(ec_rep_var); | |
2531 } | |
2532 } | |
2533 // Emit pending code | |
2534 pending.emit(); | |
2535 pending.clear(); | |
2536 fprintf(fp, "}\n"); | |
2537 } // end while instruction's encodings | |
2538 | |
2539 // Check if user stated which encoding to user | |
2540 if ( user_defined == false ) { | |
2541 fprintf(fp, " // User did not define which encode class to use.\n"); | |
2542 } | |
2543 | |
2544 // (3) and (4) | |
2545 fprintf(fp,"}\n"); | |
2546 } | |
2547 | |
2548 // --------------------------------------------------------------------------- | |
2549 //--------Utilities to build MachOper and MachNode derived Classes------------ | |
2550 // --------------------------------------------------------------------------- | |
2551 | |
2552 //------------------------------Utilities to build Operand Classes------------ | |
2553 static void defineIn_RegMask(FILE *fp, FormDict &globals, OperandForm &oper) { | |
2554 uint num_edges = oper.num_edges(globals); | |
2555 if( num_edges != 0 ) { | |
2556 // Method header | |
2557 fprintf(fp, "const RegMask *%sOper::in_RegMask(int index) const {\n", | |
2558 oper._ident); | |
2559 | |
2560 // Assert that the index is in range. | |
2561 fprintf(fp, " assert(0 <= index && index < %d, \"index out of range\");\n", | |
2562 num_edges); | |
2563 | |
2564 // Figure out if all RegMasks are the same. | |
2565 const char* first_reg_class = oper.in_reg_class(0, globals); | |
2566 bool all_same = true; | |
2567 assert(first_reg_class != NULL, "did not find register mask"); | |
2568 | |
2569 for (uint index = 1; all_same && index < num_edges; index++) { | |
2570 const char* some_reg_class = oper.in_reg_class(index, globals); | |
2571 assert(some_reg_class != NULL, "did not find register mask"); | |
2572 if (strcmp(first_reg_class, some_reg_class) != 0) { | |
2573 all_same = false; | |
2574 } | |
2575 } | |
2576 | |
2577 if (all_same) { | |
2578 // Return the sole RegMask. | |
2579 if (strcmp(first_reg_class, "stack_slots") == 0) { | |
2580 fprintf(fp," return &(Compile::current()->FIRST_STACK_mask());\n"); | |
2581 } else { | |
2582 fprintf(fp," return &%s_mask;\n", toUpper(first_reg_class)); | |
2583 } | |
2584 } else { | |
2585 // Build a switch statement to return the desired mask. | |
2586 fprintf(fp," switch (index) {\n"); | |
2587 | |
2588 for (uint index = 0; index < num_edges; index++) { | |
2589 const char *reg_class = oper.in_reg_class(index, globals); | |
2590 assert(reg_class != NULL, "did not find register mask"); | |
2591 if( !strcmp(reg_class, "stack_slots") ) { | |
2592 fprintf(fp, " case %d: return &(Compile::current()->FIRST_STACK_mask());\n", index); | |
2593 } else { | |
2594 fprintf(fp, " case %d: return &%s_mask;\n", index, toUpper(reg_class)); | |
2595 } | |
2596 } | |
2597 fprintf(fp," }\n"); | |
2598 fprintf(fp," ShouldNotReachHere();\n"); | |
2599 fprintf(fp," return NULL;\n"); | |
2600 } | |
2601 | |
2602 // Method close | |
2603 fprintf(fp, "}\n\n"); | |
2604 } | |
2605 } | |
2606 | |
2607 // generate code to create a clone for a class derived from MachOper | |
2608 // | |
2609 // (0) MachOper *MachOperXOper::clone(Compile* C) const { | |
2610 // (1) return new (C) MachXOper( _ccode, _c0, _c1, ..., _cn); | |
2611 // (2) } | |
2612 // | |
2613 static void defineClone(FILE *fp, FormDict &globalNames, OperandForm &oper) { | |
2614 fprintf(fp,"MachOper *%sOper::clone(Compile* C) const {\n", oper._ident); | |
2615 // Check for constants that need to be copied over | |
2616 const int num_consts = oper.num_consts(globalNames); | |
2617 const bool is_ideal_bool = oper.is_ideal_bool(); | |
2618 if( (num_consts > 0) ) { | |
2619 fprintf(fp," return new (C) %sOper(", oper._ident); | |
2620 // generate parameters for constants | |
2621 int i = 0; | |
2622 fprintf(fp,"_c%d", i); | |
2623 for( i = 1; i < num_consts; ++i) { | |
2624 fprintf(fp,", _c%d", i); | |
2625 } | |
2626 // finish line (1) | |
2627 fprintf(fp,");\n"); | |
2628 } | |
2629 else { | |
2630 assert( num_consts == 0, "Currently support zero or one constant per operand clone function"); | |
2631 fprintf(fp," return new (C) %sOper();\n", oper._ident); | |
2632 } | |
2633 // finish method | |
2634 fprintf(fp,"}\n"); | |
2635 } | |
2636 | |
2637 static void define_hash(FILE *fp, char *operand) { | |
2638 fprintf(fp,"uint %sOper::hash() const { return 5; }\n", operand); | |
2639 } | |
2640 | |
2641 static void define_cmp(FILE *fp, char *operand) { | |
2642 fprintf(fp,"uint %sOper::cmp( const MachOper &oper ) const { return opcode() == oper.opcode(); }\n", operand); | |
2643 } | |
2644 | |
2645 | |
2646 // Helper functions for bug 4796752, abstracted with minimal modification | |
2647 // from define_oper_interface() | |
2648 OperandForm *rep_var_to_operand(const char *encoding, OperandForm &oper, FormDict &globals) { | |
2649 OperandForm *op = NULL; | |
2650 // Check for replacement variable | |
2651 if( *encoding == '$' ) { | |
2652 // Replacement variable | |
2653 const char *rep_var = encoding + 1; | |
2654 // Lookup replacement variable, rep_var, in operand's component list | |
2655 const Component *comp = oper._components.search(rep_var); | |
2656 assert( comp != NULL, "Replacement variable not found in components"); | |
2657 // Lookup operand form for replacement variable's type | |
2658 const char *type = comp->_type; | |
2659 Form *form = (Form*)globals[type]; | |
2660 assert( form != NULL, "Replacement variable's type not found"); | |
2661 op = form->is_operand(); | |
2662 assert( op, "Attempting to emit a non-register or non-constant"); | |
2663 } | |
2664 | |
2665 return op; | |
2666 } | |
2667 | |
2668 int rep_var_to_constant_index(const char *encoding, OperandForm &oper, FormDict &globals) { | |
2669 int idx = -1; | |
2670 // Check for replacement variable | |
2671 if( *encoding == '$' ) { | |
2672 // Replacement variable | |
2673 const char *rep_var = encoding + 1; | |
2674 // Lookup replacement variable, rep_var, in operand's component list | |
2675 const Component *comp = oper._components.search(rep_var); | |
2676 assert( comp != NULL, "Replacement variable not found in components"); | |
2677 // Lookup operand form for replacement variable's type | |
2678 const char *type = comp->_type; | |
2679 Form *form = (Form*)globals[type]; | |
2680 assert( form != NULL, "Replacement variable's type not found"); | |
2681 OperandForm *op = form->is_operand(); | |
2682 assert( op, "Attempting to emit a non-register or non-constant"); | |
2683 // Check that this is a constant and find constant's index: | |
2684 if (op->_matrule && op->_matrule->is_base_constant(globals)) { | |
2685 idx = oper.constant_position(globals, comp); | |
2686 } | |
2687 } | |
2688 | |
2689 return idx; | |
2690 } | |
2691 | |
2692 bool is_regI(const char *encoding, OperandForm &oper, FormDict &globals ) { | |
2693 bool is_regI = false; | |
2694 | |
2695 OperandForm *op = rep_var_to_operand(encoding, oper, globals); | |
2696 if( op != NULL ) { | |
2697 // Check that this is a register | |
2698 if ( (op->_matrule && op->_matrule->is_base_register(globals)) ) { | |
2699 // Register | |
2700 const char* ideal = op->ideal_type(globals); | |
2701 is_regI = (ideal && (op->ideal_to_Reg_type(ideal) == Form::idealI)); | |
2702 } | |
2703 } | |
2704 | |
2705 return is_regI; | |
2706 } | |
2707 | |
2708 bool is_conP(const char *encoding, OperandForm &oper, FormDict &globals ) { | |
2709 bool is_conP = false; | |
2710 | |
2711 OperandForm *op = rep_var_to_operand(encoding, oper, globals); | |
2712 if( op != NULL ) { | |
2713 // Check that this is a constant pointer | |
2714 if (op->_matrule && op->_matrule->is_base_constant(globals)) { | |
2715 // Constant | |
2716 Form::DataType dtype = op->is_base_constant(globals); | |
2717 is_conP = (dtype == Form::idealP); | |
2718 } | |
2719 } | |
2720 | |
2721 return is_conP; | |
2722 } | |
2723 | |
2724 | |
2725 // Define a MachOper interface methods | |
2726 void ArchDesc::define_oper_interface(FILE *fp, OperandForm &oper, FormDict &globals, | |
2727 const char *name, const char *encoding) { | |
2728 bool emit_position = false; | |
2729 int position = -1; | |
2730 | |
2731 fprintf(fp," virtual int %s", name); | |
2732 // Generate access method for base, index, scale, disp, ... | |
2733 if( (strcmp(name,"base") == 0) || (strcmp(name,"index") == 0) ) { | |
2734 fprintf(fp,"(PhaseRegAlloc *ra_, const Node *node, int idx) const { \n"); | |
2735 emit_position = true; | |
2736 } else if ( (strcmp(name,"disp") == 0) ) { | |
2737 fprintf(fp,"(PhaseRegAlloc *ra_, const Node *node, int idx) const { \n"); | |
2738 } else { | |
2739 fprintf(fp,"() const { "); | |
2740 } | |
2741 | |
2742 // Check for hexadecimal value OR replacement variable | |
2743 if( *encoding == '$' ) { | |
2744 // Replacement variable | |
2745 const char *rep_var = encoding + 1; | |
2746 fprintf(fp,"// Replacement variable: %s\n", encoding+1); | |
2747 // Lookup replacement variable, rep_var, in operand's component list | |
2748 const Component *comp = oper._components.search(rep_var); | |
2749 assert( comp != NULL, "Replacement variable not found in components"); | |
2750 // Lookup operand form for replacement variable's type | |
2751 const char *type = comp->_type; | |
2752 Form *form = (Form*)globals[type]; | |
2753 assert( form != NULL, "Replacement variable's type not found"); | |
2754 OperandForm *op = form->is_operand(); | |
2755 assert( op, "Attempting to emit a non-register or non-constant"); | |
2756 // Check that this is a register or a constant and generate code: | |
2757 if ( (op->_matrule && op->_matrule->is_base_register(globals)) ) { | |
2758 // Register | |
2759 int idx_offset = oper.register_position( globals, rep_var); | |
2760 position = idx_offset; | |
2761 fprintf(fp," return (int)ra_->get_encode(node->in(idx"); | |
2762 if ( idx_offset > 0 ) fprintf(fp, "+%d",idx_offset); | |
2763 fprintf(fp,"));\n"); | |
2764 } else if ( op->ideal_to_sReg_type(op->_ident) != Form::none ) { | |
2765 // StackSlot for an sReg comes either from input node or from self, when idx==0 | |
2766 fprintf(fp," if( idx != 0 ) {\n"); | |
2767 fprintf(fp," // Access register number for input operand\n"); | |
2768 fprintf(fp," return ra_->reg2offset(ra_->get_reg_first(node->in(idx)));/* sReg */\n"); | |
2769 fprintf(fp," }\n"); | |
2770 fprintf(fp," // Access register number from myself\n"); | |
2771 fprintf(fp," return ra_->reg2offset(ra_->get_reg_first(node));/* sReg */\n"); | |
2772 } else if (op->_matrule && op->_matrule->is_base_constant(globals)) { | |
2773 // Constant | |
2774 // Check which constant this name maps to: _c0, _c1, ..., _cn | |
2775 const int idx = oper.constant_position(globals, comp); | |
2776 assert( idx != -1, "Constant component not found in operand"); | |
2777 // Output code for this constant, type dependent. | |
2778 fprintf(fp," return (int)" ); | |
2779 oper.access_constant(fp, globals, (uint)idx /* , const_type */); | |
2780 fprintf(fp,";\n"); | |
2781 } else { | |
2782 assert( false, "Attempting to emit a non-register or non-constant"); | |
2783 } | |
2784 } | |
2785 else if( *encoding == '0' && *(encoding+1) == 'x' ) { | |
2786 // Hex value | |
2787 fprintf(fp,"return %s;", encoding); | |
2788 } else { | |
2789 assert( false, "Do not support octal or decimal encode constants"); | |
2790 } | |
2791 fprintf(fp," }\n"); | |
2792 | |
2793 if( emit_position && (position != -1) && (oper.num_edges(globals) > 0) ) { | |
2794 fprintf(fp," virtual int %s_position() const { return %d; }\n", name, position); | |
2795 MemInterface *mem_interface = oper._interface->is_MemInterface(); | |
2796 const char *base = mem_interface->_base; | |
2797 const char *disp = mem_interface->_disp; | |
2798 if( emit_position && (strcmp(name,"base") == 0) | |
2799 && base != NULL && is_regI(base, oper, globals) | |
2800 && disp != NULL && is_conP(disp, oper, globals) ) { | |
2801 // Found a memory access using a constant pointer for a displacement | |
2802 // and a base register containing an integer offset. | |
2803 // In this case the base and disp are reversed with respect to what | |
2804 // is expected by MachNode::get_base_and_disp() and MachNode::adr_type(). | |
2805 // Provide a non-NULL return for disp_as_type() that will allow adr_type() | |
2806 // to correctly compute the access type for alias analysis. | |
2807 // | |
2808 // See BugId 4796752, operand indOffset32X in i486.ad | |
2809 int idx = rep_var_to_constant_index(disp, oper, globals); | |
2810 fprintf(fp," virtual const TypePtr *disp_as_type() const { return _c%d; }\n", idx); | |
2811 } | |
2812 } | |
2813 } | |
2814 | |
2815 // | |
2816 // Construct the method to copy _idx, inputs and operands to new node. | |
2817 static void define_fill_new_machnode(bool used, FILE *fp_cpp) { | |
2818 fprintf(fp_cpp, "\n"); | |
2819 fprintf(fp_cpp, "// Copy _idx, inputs and operands to new node\n"); | |
2820 fprintf(fp_cpp, "void MachNode::fill_new_machnode( MachNode* node, Compile* C) const {\n"); | |
2821 if( !used ) { | |
2822 fprintf(fp_cpp, " // This architecture does not have cisc or short branch instructions\n"); | |
2823 fprintf(fp_cpp, " ShouldNotCallThis();\n"); | |
2824 fprintf(fp_cpp, "}\n"); | |
2825 } else { | |
2826 // New node must use same node index for access through allocator's tables | |
2827 fprintf(fp_cpp, " // New node must use same node index\n"); | |
2828 fprintf(fp_cpp, " node->set_idx( _idx );\n"); | |
2829 // Copy machine-independent inputs | |
2830 fprintf(fp_cpp, " // Copy machine-independent inputs\n"); | |
2831 fprintf(fp_cpp, " for( uint j = 0; j < req(); j++ ) {\n"); | |
2832 fprintf(fp_cpp, " node->add_req(in(j));\n"); | |
2833 fprintf(fp_cpp, " }\n"); | |
2834 // Copy machine operands to new MachNode | |
2835 fprintf(fp_cpp, " // Copy my operands, except for cisc position\n"); | |
2836 fprintf(fp_cpp, " int nopnds = num_opnds();\n"); | |
2837 fprintf(fp_cpp, " assert( node->num_opnds() == (uint)nopnds, \"Must have same number of operands\");\n"); | |
2838 fprintf(fp_cpp, " MachOper **to = node->_opnds;\n"); | |
2839 fprintf(fp_cpp, " for( int i = 0; i < nopnds; i++ ) {\n"); | |
2840 fprintf(fp_cpp, " if( i != cisc_operand() ) \n"); | |
2841 fprintf(fp_cpp, " to[i] = _opnds[i]->clone(C);\n"); | |
2842 fprintf(fp_cpp, " }\n"); | |
2843 fprintf(fp_cpp, "}\n"); | |
2844 } | |
2845 fprintf(fp_cpp, "\n"); | |
2846 } | |
2847 | |
2848 //------------------------------defineClasses---------------------------------- | |
2849 // Define members of MachNode and MachOper classes based on | |
2850 // operand and instruction lists | |
2851 void ArchDesc::defineClasses(FILE *fp) { | |
2852 | |
2853 // Define the contents of an array containing the machine register names | |
2854 defineRegNames(fp, _register); | |
2855 // Define an array containing the machine register encoding values | |
2856 defineRegEncodes(fp, _register); | |
2857 // Generate an enumeration of user-defined register classes | |
2858 // and a list of register masks, one for each class. | |
2859 // Only define the RegMask value objects in the expand file. | |
2860 // Declare each as an extern const RegMask ...; in ad_<arch>.hpp | |
2861 declare_register_masks(_HPP_file._fp); | |
2862 // build_register_masks(fp); | |
2863 build_register_masks(_CPP_EXPAND_file._fp); | |
2864 // Define the pipe_classes | |
2865 build_pipe_classes(_CPP_PIPELINE_file._fp); | |
2866 | |
2867 // Generate Machine Classes for each operand defined in AD file | |
2868 fprintf(fp,"\n"); | |
2869 fprintf(fp,"\n"); | |
2870 fprintf(fp,"//------------------Define classes derived from MachOper---------------------\n"); | |
2871 // Iterate through all operands | |
2872 _operands.reset(); | |
2873 OperandForm *oper; | |
2874 for( ; (oper = (OperandForm*)_operands.iter()) != NULL; ) { | |
2875 // Ensure this is a machine-world instruction | |
2876 if ( oper->ideal_only() ) continue; | |
2877 // !!!!! | |
2878 // The declaration of labelOper is in machine-independent file: machnode | |
2879 if ( strcmp(oper->_ident,"label") == 0 ) { | |
2880 defineIn_RegMask(_CPP_MISC_file._fp, _globalNames, *oper); | |
2881 | |
2882 fprintf(fp,"MachOper *%sOper::clone(Compile* C) const {\n", oper->_ident); | |
2883 fprintf(fp," return new (C) %sOper(_label, _block_num);\n", oper->_ident); | |
2884 fprintf(fp,"}\n"); | |
2885 | |
2886 fprintf(fp,"uint %sOper::opcode() const { return %s; }\n", | |
2887 oper->_ident, machOperEnum(oper->_ident)); | |
2888 // // Currently all XXXOper::Hash() methods are identical (990820) | |
2889 // define_hash(fp, oper->_ident); | |
2890 // // Currently all XXXOper::Cmp() methods are identical (990820) | |
2891 // define_cmp(fp, oper->_ident); | |
2892 fprintf(fp,"\n"); | |
2893 | |
2894 continue; | |
2895 } | |
2896 | |
2897 // The declaration of methodOper is in machine-independent file: machnode | |
2898 if ( strcmp(oper->_ident,"method") == 0 ) { | |
2899 defineIn_RegMask(_CPP_MISC_file._fp, _globalNames, *oper); | |
2900 | |
2901 fprintf(fp,"MachOper *%sOper::clone(Compile* C) const {\n", oper->_ident); | |
2902 fprintf(fp," return new (C) %sOper(_method);\n", oper->_ident); | |
2903 fprintf(fp,"}\n"); | |
2904 | |
2905 fprintf(fp,"uint %sOper::opcode() const { return %s; }\n", | |
2906 oper->_ident, machOperEnum(oper->_ident)); | |
2907 // // Currently all XXXOper::Hash() methods are identical (990820) | |
2908 // define_hash(fp, oper->_ident); | |
2909 // // Currently all XXXOper::Cmp() methods are identical (990820) | |
2910 // define_cmp(fp, oper->_ident); | |
2911 fprintf(fp,"\n"); | |
2912 | |
2913 continue; | |
2914 } | |
2915 | |
2916 defineIn_RegMask(fp, _globalNames, *oper); | |
2917 defineClone(_CPP_CLONE_file._fp, _globalNames, *oper); | |
2918 // // Currently all XXXOper::Hash() methods are identical (990820) | |
2919 // define_hash(fp, oper->_ident); | |
2920 // // Currently all XXXOper::Cmp() methods are identical (990820) | |
2921 // define_cmp(fp, oper->_ident); | |
2922 | |
2923 // side-call to generate output that used to be in the header file: | |
2924 extern void gen_oper_format(FILE *fp, FormDict &globals, OperandForm &oper, bool for_c_file); | |
2925 gen_oper_format(_CPP_FORMAT_file._fp, _globalNames, *oper, true); | |
2926 | |
2927 } | |
2928 | |
2929 | |
2930 // Generate Machine Classes for each instruction defined in AD file | |
2931 fprintf(fp,"//------------------Define members for classes derived from MachNode----------\n"); | |
2932 // Output the definitions for out_RegMask() // & kill_RegMask() | |
2933 _instructions.reset(); | |
2934 InstructForm *instr; | |
2935 MachNodeForm *machnode; | |
2936 for( ; (instr = (InstructForm*)_instructions.iter()) != NULL; ) { | |
2937 // Ensure this is a machine-world instruction | |
2938 if ( instr->ideal_only() ) continue; | |
2939 | |
2940 defineOut_RegMask(_CPP_MISC_file._fp, instr->_ident, reg_mask(*instr)); | |
2941 } | |
2942 | |
2943 bool used = false; | |
2944 // Output the definitions for expand rules & peephole rules | |
2945 _instructions.reset(); | |
2946 for( ; (instr = (InstructForm*)_instructions.iter()) != NULL; ) { | |
2947 // Ensure this is a machine-world instruction | |
2948 if ( instr->ideal_only() ) continue; | |
2949 // If there are multiple defs/kills, or an explicit expand rule, build rule | |
2950 if( instr->expands() || instr->needs_projections() || | |
2951 instr->has_temps() || | |
2952 instr->_matrule != NULL && | |
2953 instr->num_opnds() != instr->num_unique_opnds() ) | |
2954 defineExpand(_CPP_EXPAND_file._fp, instr); | |
2955 // If there is an explicit peephole rule, build it | |
2956 if ( instr->peepholes() ) | |
2957 definePeephole(_CPP_PEEPHOLE_file._fp, instr); | |
2958 | |
2959 // Output code to convert to the cisc version, if applicable | |
2960 used |= instr->define_cisc_version(*this, fp); | |
2961 | |
2962 // Output code to convert to the short branch version, if applicable | |
2963 used |= instr->define_short_branch_methods(fp); | |
2964 } | |
2965 | |
2966 // Construct the method called by cisc_version() to copy inputs and operands. | |
2967 define_fill_new_machnode(used, fp); | |
2968 | |
2969 // Output the definitions for labels | |
2970 _instructions.reset(); | |
2971 while( (instr = (InstructForm*)_instructions.iter()) != NULL ) { | |
2972 // Ensure this is a machine-world instruction | |
2973 if ( instr->ideal_only() ) continue; | |
2974 | |
2975 // Access the fields for operand Label | |
2976 int label_position = instr->label_position(); | |
2977 if( label_position != -1 ) { | |
2978 // Set the label | |
2979 fprintf(fp,"void %sNode::label_set( Label& label, uint block_num ) {\n", instr->_ident); | |
2980 fprintf(fp," labelOper* oper = (labelOper*)(opnd_array(%d));\n", | |
2981 label_position ); | |
2982 fprintf(fp," oper->_label = &label;\n"); | |
2983 fprintf(fp," oper->_block_num = block_num;\n"); | |
2984 fprintf(fp,"}\n"); | |
2985 } | |
2986 } | |
2987 | |
2988 // Output the definitions for methods | |
2989 _instructions.reset(); | |
2990 while( (instr = (InstructForm*)_instructions.iter()) != NULL ) { | |
2991 // Ensure this is a machine-world instruction | |
2992 if ( instr->ideal_only() ) continue; | |
2993 | |
2994 // Access the fields for operand Label | |
2995 int method_position = instr->method_position(); | |
2996 if( method_position != -1 ) { | |
2997 // Access the method's address | |
2998 fprintf(fp,"void %sNode::method_set( intptr_t method ) {\n", instr->_ident); | |
2999 fprintf(fp," ((methodOper*)opnd_array(%d))->_method = method;\n", | |
3000 method_position ); | |
3001 fprintf(fp,"}\n"); | |
3002 fprintf(fp,"\n"); | |
3003 } | |
3004 } | |
3005 | |
3006 // Define this instruction's number of relocation entries, base is '0' | |
3007 _instructions.reset(); | |
3008 while( (instr = (InstructForm*)_instructions.iter()) != NULL ) { | |
3009 // Output the definition for number of relocation entries | |
3010 uint reloc_size = instr->reloc(_globalNames); | |
3011 if ( reloc_size != 0 ) { | |
3012 fprintf(fp,"int %sNode::reloc() const {\n", instr->_ident); | |
3013 fprintf(fp, " return %d;\n", reloc_size ); | |
3014 fprintf(fp,"}\n"); | |
3015 fprintf(fp,"\n"); | |
3016 } | |
3017 } | |
3018 fprintf(fp,"\n"); | |
3019 | |
3020 // Output the definitions for code generation | |
3021 // | |
3022 // address ___Node::emit(address ptr, PhaseRegAlloc *ra_) const { | |
3023 // // ... encoding defined by user | |
3024 // return ptr; | |
3025 // } | |
3026 // | |
3027 _instructions.reset(); | |
3028 for( ; (instr = (InstructForm*)_instructions.iter()) != NULL; ) { | |
3029 // Ensure this is a machine-world instruction | |
3030 if ( instr->ideal_only() ) continue; | |
3031 | |
3032 if (instr->_insencode) defineEmit(fp, *instr); | |
3033 if (instr->_size) defineSize(fp, *instr); | |
3034 | |
3035 // side-call to generate output that used to be in the header file: | |
3036 extern void gen_inst_format(FILE *fp, FormDict &globals, InstructForm &oper, bool for_c_file); | |
3037 gen_inst_format(_CPP_FORMAT_file._fp, _globalNames, *instr, true); | |
3038 } | |
3039 | |
3040 // Output the definitions for alias analysis | |
3041 _instructions.reset(); | |
3042 for( ; (instr = (InstructForm*)_instructions.iter()) != NULL; ) { | |
3043 // Ensure this is a machine-world instruction | |
3044 if ( instr->ideal_only() ) continue; | |
3045 | |
3046 // Analyze machine instructions that either USE or DEF memory. | |
3047 int memory_operand = instr->memory_operand(_globalNames); | |
3048 // Some guys kill all of memory | |
3049 if ( instr->is_wide_memory_kill(_globalNames) ) { | |
3050 memory_operand = InstructForm::MANY_MEMORY_OPERANDS; | |
3051 } | |
3052 | |
3053 if ( memory_operand != InstructForm::NO_MEMORY_OPERAND ) { | |
3054 if( memory_operand == InstructForm::MANY_MEMORY_OPERANDS ) { | |
3055 fprintf(fp,"const TypePtr *%sNode::adr_type() const { return TypePtr::BOTTOM; }\n", instr->_ident); | |
3056 fprintf(fp,"const MachOper* %sNode::memory_operand() const { return (MachOper*)-1; }\n", instr->_ident); | |
3057 } else { | |
3058 fprintf(fp,"const MachOper* %sNode::memory_operand() const { return _opnds[%d]; }\n", instr->_ident, memory_operand); | |
3059 } | |
3060 } | |
3061 } | |
3062 | |
3063 // Get the length of the longest identifier | |
3064 int max_ident_len = 0; | |
3065 _instructions.reset(); | |
3066 | |
3067 for ( ; (instr = (InstructForm*)_instructions.iter()) != NULL; ) { | |
3068 if (instr->_ins_pipe && _pipeline->_classlist.search(instr->_ins_pipe)) { | |
3069 int ident_len = (int)strlen(instr->_ident); | |
3070 if( max_ident_len < ident_len ) | |
3071 max_ident_len = ident_len; | |
3072 } | |
3073 } | |
3074 | |
3075 // Emit specifically for Node(s) | |
3076 fprintf(_CPP_PIPELINE_file._fp, "const Pipeline * %*s::pipeline_class() { return %s; }\n", | |
3077 max_ident_len, "Node", _pipeline ? "(&pipeline_class_Zero_Instructions)" : "NULL"); | |
3078 fprintf(_CPP_PIPELINE_file._fp, "const Pipeline * %*s::pipeline() const { return %s; }\n", | |
3079 max_ident_len, "Node", _pipeline ? "(&pipeline_class_Zero_Instructions)" : "NULL"); | |
3080 fprintf(_CPP_PIPELINE_file._fp, "\n"); | |
3081 | |
3082 fprintf(_CPP_PIPELINE_file._fp, "const Pipeline * %*s::pipeline_class() { return %s; }\n", | |
3083 max_ident_len, "MachNode", _pipeline ? "(&pipeline_class_Unknown_Instructions)" : "NULL"); | |
3084 fprintf(_CPP_PIPELINE_file._fp, "const Pipeline * %*s::pipeline() const { return pipeline_class(); }\n", | |
3085 max_ident_len, "MachNode"); | |
3086 fprintf(_CPP_PIPELINE_file._fp, "\n"); | |
3087 | |
3088 // Output the definitions for machine node specific pipeline data | |
3089 _machnodes.reset(); | |
3090 | |
3091 for ( ; (machnode = (MachNodeForm*)_machnodes.iter()) != NULL; ) { | |
3092 fprintf(_CPP_PIPELINE_file._fp, "const Pipeline * %sNode::pipeline() const { return (&pipeline_class_%03d); }\n", | |
3093 machnode->_ident, ((class PipeClassForm *)_pipeline->_classdict[machnode->_machnode_pipe])->_num); | |
3094 } | |
3095 | |
3096 fprintf(_CPP_PIPELINE_file._fp, "\n"); | |
3097 | |
3098 // Output the definitions for instruction pipeline static data references | |
3099 _instructions.reset(); | |
3100 | |
3101 for ( ; (instr = (InstructForm*)_instructions.iter()) != NULL; ) { | |
3102 if (instr->_ins_pipe && _pipeline->_classlist.search(instr->_ins_pipe)) { | |
3103 fprintf(_CPP_PIPELINE_file._fp, "\n"); | |
3104 fprintf(_CPP_PIPELINE_file._fp, "const Pipeline * %*sNode::pipeline_class() { return (&pipeline_class_%03d); }\n", | |
3105 max_ident_len, instr->_ident, ((class PipeClassForm *)_pipeline->_classdict[instr->_ins_pipe])->_num); | |
3106 fprintf(_CPP_PIPELINE_file._fp, "const Pipeline * %*sNode::pipeline() const { return (&pipeline_class_%03d); }\n", | |
3107 max_ident_len, instr->_ident, ((class PipeClassForm *)_pipeline->_classdict[instr->_ins_pipe])->_num); | |
3108 } | |
3109 } | |
3110 } | |
3111 | |
3112 | |
3113 // -------------------------------- maps ------------------------------------ | |
3114 | |
3115 // Information needed to generate the ReduceOp mapping for the DFA | |
3116 class OutputReduceOp : public OutputMap { | |
3117 public: | |
3118 OutputReduceOp(FILE *hpp, FILE *cpp, FormDict &globals, ArchDesc &AD) | |
3119 : OutputMap(hpp, cpp, globals, AD) {}; | |
3120 | |
3121 void declaration() { fprintf(_hpp, "extern const int reduceOp[];\n"); } | |
3122 void definition() { fprintf(_cpp, "const int reduceOp[] = {\n"); } | |
3123 void closing() { fprintf(_cpp, " 0 // no trailing comma\n"); | |
3124 OutputMap::closing(); | |
3125 } | |
3126 void map(OpClassForm &opc) { | |
3127 const char *reduce = opc._ident; | |
3128 if( reduce ) fprintf(_cpp, " %s_rule", reduce); | |
3129 else fprintf(_cpp, " 0"); | |
3130 } | |
3131 void map(OperandForm &oper) { | |
3132 // Most operands without match rules, e.g. eFlagsReg, do not have a result operand | |
3133 const char *reduce = (oper._matrule ? oper.reduce_result() : NULL); | |
3134 // operand stackSlot does not have a match rule, but produces a stackSlot | |
3135 if( oper.is_user_name_for_sReg() != Form::none ) reduce = oper.reduce_result(); | |
3136 if( reduce ) fprintf(_cpp, " %s_rule", reduce); | |
3137 else fprintf(_cpp, " 0"); | |
3138 } | |
3139 void map(InstructForm &inst) { | |
3140 const char *reduce = (inst._matrule ? inst.reduce_result() : NULL); | |
3141 if( reduce ) fprintf(_cpp, " %s_rule", reduce); | |
3142 else fprintf(_cpp, " 0"); | |
3143 } | |
3144 void map(char *reduce) { | |
3145 if( reduce ) fprintf(_cpp, " %s_rule", reduce); | |
3146 else fprintf(_cpp, " 0"); | |
3147 } | |
3148 }; | |
3149 | |
3150 // Information needed to generate the LeftOp mapping for the DFA | |
3151 class OutputLeftOp : public OutputMap { | |
3152 public: | |
3153 OutputLeftOp(FILE *hpp, FILE *cpp, FormDict &globals, ArchDesc &AD) | |
3154 : OutputMap(hpp, cpp, globals, AD) {}; | |
3155 | |
3156 void declaration() { fprintf(_hpp, "extern const int leftOp[];\n"); } | |
3157 void definition() { fprintf(_cpp, "const int leftOp[] = {\n"); } | |
3158 void closing() { fprintf(_cpp, " 0 // no trailing comma\n"); | |
3159 OutputMap::closing(); | |
3160 } | |
3161 void map(OpClassForm &opc) { fprintf(_cpp, " 0"); } | |
3162 void map(OperandForm &oper) { | |
3163 const char *reduce = oper.reduce_left(_globals); | |
3164 if( reduce ) fprintf(_cpp, " %s_rule", reduce); | |
3165 else fprintf(_cpp, " 0"); | |
3166 } | |
3167 void map(char *name) { | |
3168 const char *reduce = _AD.reduceLeft(name); | |
3169 if( reduce ) fprintf(_cpp, " %s_rule", reduce); | |
3170 else fprintf(_cpp, " 0"); | |
3171 } | |
3172 void map(InstructForm &inst) { | |
3173 const char *reduce = inst.reduce_left(_globals); | |
3174 if( reduce ) fprintf(_cpp, " %s_rule", reduce); | |
3175 else fprintf(_cpp, " 0"); | |
3176 } | |
3177 }; | |
3178 | |
3179 | |
3180 // Information needed to generate the RightOp mapping for the DFA | |
3181 class OutputRightOp : public OutputMap { | |
3182 public: | |
3183 OutputRightOp(FILE *hpp, FILE *cpp, FormDict &globals, ArchDesc &AD) | |
3184 : OutputMap(hpp, cpp, globals, AD) {}; | |
3185 | |
3186 void declaration() { fprintf(_hpp, "extern const int rightOp[];\n"); } | |
3187 void definition() { fprintf(_cpp, "const int rightOp[] = {\n"); } | |
3188 void closing() { fprintf(_cpp, " 0 // no trailing comma\n"); | |
3189 OutputMap::closing(); | |
3190 } | |
3191 void map(OpClassForm &opc) { fprintf(_cpp, " 0"); } | |
3192 void map(OperandForm &oper) { | |
3193 const char *reduce = oper.reduce_right(_globals); | |
3194 if( reduce ) fprintf(_cpp, " %s_rule", reduce); | |
3195 else fprintf(_cpp, " 0"); | |
3196 } | |
3197 void map(char *name) { | |
3198 const char *reduce = _AD.reduceRight(name); | |
3199 if( reduce ) fprintf(_cpp, " %s_rule", reduce); | |
3200 else fprintf(_cpp, " 0"); | |
3201 } | |
3202 void map(InstructForm &inst) { | |
3203 const char *reduce = inst.reduce_right(_globals); | |
3204 if( reduce ) fprintf(_cpp, " %s_rule", reduce); | |
3205 else fprintf(_cpp, " 0"); | |
3206 } | |
3207 }; | |
3208 | |
3209 | |
3210 // Information needed to generate the Rule names for the DFA | |
3211 class OutputRuleName : public OutputMap { | |
3212 public: | |
3213 OutputRuleName(FILE *hpp, FILE *cpp, FormDict &globals, ArchDesc &AD) | |
3214 : OutputMap(hpp, cpp, globals, AD) {}; | |
3215 | |
3216 void declaration() { fprintf(_hpp, "extern const char *ruleName[];\n"); } | |
3217 void definition() { fprintf(_cpp, "const char *ruleName[] = {\n"); } | |
3218 void closing() { fprintf(_cpp, " \"no trailing comma\"\n"); | |
3219 OutputMap::closing(); | |
3220 } | |
3221 void map(OpClassForm &opc) { fprintf(_cpp, " \"%s\"", _AD.machOperEnum(opc._ident) ); } | |
3222 void map(OperandForm &oper) { fprintf(_cpp, " \"%s\"", _AD.machOperEnum(oper._ident) ); } | |
3223 void map(char *name) { fprintf(_cpp, " \"%s\"", name ? name : "0"); } | |
3224 void map(InstructForm &inst){ fprintf(_cpp, " \"%s\"", inst._ident ? inst._ident : "0"); } | |
3225 }; | |
3226 | |
3227 | |
3228 // Information needed to generate the swallowed mapping for the DFA | |
3229 class OutputSwallowed : public OutputMap { | |
3230 public: | |
3231 OutputSwallowed(FILE *hpp, FILE *cpp, FormDict &globals, ArchDesc &AD) | |
3232 : OutputMap(hpp, cpp, globals, AD) {}; | |
3233 | |
3234 void declaration() { fprintf(_hpp, "extern const bool swallowed[];\n"); } | |
3235 void definition() { fprintf(_cpp, "const bool swallowed[] = {\n"); } | |
3236 void closing() { fprintf(_cpp, " false // no trailing comma\n"); | |
3237 OutputMap::closing(); | |
3238 } | |
3239 void map(OperandForm &oper) { // Generate the entry for this opcode | |
3240 const char *swallowed = oper.swallowed(_globals) ? "true" : "false"; | |
3241 fprintf(_cpp, " %s", swallowed); | |
3242 } | |
3243 void map(OpClassForm &opc) { fprintf(_cpp, " false"); } | |
3244 void map(char *name) { fprintf(_cpp, " false"); } | |
3245 void map(InstructForm &inst){ fprintf(_cpp, " false"); } | |
3246 }; | |
3247 | |
3248 | |
3249 // Information needed to generate the decision array for instruction chain rule | |
3250 class OutputInstChainRule : public OutputMap { | |
3251 public: | |
3252 OutputInstChainRule(FILE *hpp, FILE *cpp, FormDict &globals, ArchDesc &AD) | |
3253 : OutputMap(hpp, cpp, globals, AD) {}; | |
3254 | |
3255 void declaration() { fprintf(_hpp, "extern const bool instruction_chain_rule[];\n"); } | |
3256 void definition() { fprintf(_cpp, "const bool instruction_chain_rule[] = {\n"); } | |
3257 void closing() { fprintf(_cpp, " false // no trailing comma\n"); | |
3258 OutputMap::closing(); | |
3259 } | |
3260 void map(OpClassForm &opc) { fprintf(_cpp, " false"); } | |
3261 void map(OperandForm &oper) { fprintf(_cpp, " false"); } | |
3262 void map(char *name) { fprintf(_cpp, " false"); } | |
3263 void map(InstructForm &inst) { // Check for simple chain rule | |
3264 const char *chain = inst.is_simple_chain_rule(_globals) ? "true" : "false"; | |
3265 fprintf(_cpp, " %s", chain); | |
3266 } | |
3267 }; | |
3268 | |
3269 | |
3270 //---------------------------build_map------------------------------------ | |
3271 // Build mapping from enumeration for densely packed operands | |
3272 // TO result and child types. | |
3273 void ArchDesc::build_map(OutputMap &map) { | |
3274 FILE *fp_hpp = map.decl_file(); | |
3275 FILE *fp_cpp = map.def_file(); | |
3276 int idx = 0; | |
3277 OperandForm *op; | |
3278 OpClassForm *opc; | |
3279 InstructForm *inst; | |
3280 | |
3281 // Construct this mapping | |
3282 map.declaration(); | |
3283 fprintf(fp_cpp,"\n"); | |
3284 map.definition(); | |
3285 | |
3286 // Output the mapping for operands | |
3287 map.record_position(OutputMap::BEGIN_OPERANDS, idx ); | |
3288 _operands.reset(); | |
3289 for(; (op = (OperandForm*)_operands.iter()) != NULL; ) { | |
3290 // Ensure this is a machine-world instruction | |
3291 if ( op->ideal_only() ) continue; | |
3292 | |
3293 // Generate the entry for this opcode | |
3294 map.map(*op); fprintf(fp_cpp, ", // %d\n", idx); | |
3295 ++idx; | |
3296 }; | |
3297 fprintf(fp_cpp, " // last operand\n"); | |
3298 | |
3299 // Place all user-defined operand classes into the mapping | |
3300 map.record_position(OutputMap::BEGIN_OPCLASSES, idx ); | |
3301 _opclass.reset(); | |
3302 for(; (opc = (OpClassForm*)_opclass.iter()) != NULL; ) { | |
3303 map.map(*opc); fprintf(fp_cpp, ", // %d\n", idx); | |
3304 ++idx; | |
3305 }; | |
3306 fprintf(fp_cpp, " // last operand class\n"); | |
3307 | |
3308 // Place all internally defined operands into the mapping | |
3309 map.record_position(OutputMap::BEGIN_INTERNALS, idx ); | |
3310 _internalOpNames.reset(); | |
3311 char *name = NULL; | |
3312 for(; (name = (char *)_internalOpNames.iter()) != NULL; ) { | |
3313 map.map(name); fprintf(fp_cpp, ", // %d\n", idx); | |
3314 ++idx; | |
3315 }; | |
3316 fprintf(fp_cpp, " // last internally defined operand\n"); | |
3317 | |
3318 // Place all user-defined instructions into the mapping | |
3319 if( map.do_instructions() ) { | |
3320 map.record_position(OutputMap::BEGIN_INSTRUCTIONS, idx ); | |
3321 // Output all simple instruction chain rules first | |
3322 map.record_position(OutputMap::BEGIN_INST_CHAIN_RULES, idx ); | |
3323 { | |
3324 _instructions.reset(); | |
3325 for(; (inst = (InstructForm*)_instructions.iter()) != NULL; ) { | |
3326 // Ensure this is a machine-world instruction | |
3327 if ( inst->ideal_only() ) continue; | |
3328 if ( ! inst->is_simple_chain_rule(_globalNames) ) continue; | |
3329 if ( inst->rematerialize(_globalNames, get_registers()) ) continue; | |
3330 | |
3331 map.map(*inst); fprintf(fp_cpp, ", // %d\n", idx); | |
3332 ++idx; | |
3333 }; | |
3334 map.record_position(OutputMap::BEGIN_REMATERIALIZE, idx ); | |
3335 _instructions.reset(); | |
3336 for(; (inst = (InstructForm*)_instructions.iter()) != NULL; ) { | |
3337 // Ensure this is a machine-world instruction | |
3338 if ( inst->ideal_only() ) continue; | |
3339 if ( ! inst->is_simple_chain_rule(_globalNames) ) continue; | |
3340 if ( ! inst->rematerialize(_globalNames, get_registers()) ) continue; | |
3341 | |
3342 map.map(*inst); fprintf(fp_cpp, ", // %d\n", idx); | |
3343 ++idx; | |
3344 }; | |
3345 map.record_position(OutputMap::END_INST_CHAIN_RULES, idx ); | |
3346 } | |
3347 // Output all instructions that are NOT simple chain rules | |
3348 { | |
3349 _instructions.reset(); | |
3350 for(; (inst = (InstructForm*)_instructions.iter()) != NULL; ) { | |
3351 // Ensure this is a machine-world instruction | |
3352 if ( inst->ideal_only() ) continue; | |
3353 if ( inst->is_simple_chain_rule(_globalNames) ) continue; | |
3354 if ( ! inst->rematerialize(_globalNames, get_registers()) ) continue; | |
3355 | |
3356 map.map(*inst); fprintf(fp_cpp, ", // %d\n", idx); | |
3357 ++idx; | |
3358 }; | |
3359 map.record_position(OutputMap::END_REMATERIALIZE, idx ); | |
3360 _instructions.reset(); | |
3361 for(; (inst = (InstructForm*)_instructions.iter()) != NULL; ) { | |
3362 // Ensure this is a machine-world instruction | |
3363 if ( inst->ideal_only() ) continue; | |
3364 if ( inst->is_simple_chain_rule(_globalNames) ) continue; | |
3365 if ( inst->rematerialize(_globalNames, get_registers()) ) continue; | |
3366 | |
3367 map.map(*inst); fprintf(fp_cpp, ", // %d\n", idx); | |
3368 ++idx; | |
3369 }; | |
3370 } | |
3371 fprintf(fp_cpp, " // last instruction\n"); | |
3372 map.record_position(OutputMap::END_INSTRUCTIONS, idx ); | |
3373 } | |
3374 // Finish defining table | |
3375 map.closing(); | |
3376 }; | |
3377 | |
3378 | |
3379 // Helper function for buildReduceMaps | |
3380 char reg_save_policy(const char *calling_convention) { | |
3381 char callconv; | |
3382 | |
3383 if (!strcmp(calling_convention, "NS")) callconv = 'N'; | |
3384 else if (!strcmp(calling_convention, "SOE")) callconv = 'E'; | |
3385 else if (!strcmp(calling_convention, "SOC")) callconv = 'C'; | |
3386 else if (!strcmp(calling_convention, "AS")) callconv = 'A'; | |
3387 else callconv = 'Z'; | |
3388 | |
3389 return callconv; | |
3390 } | |
3391 | |
3392 //---------------------------generate_assertion_checks------------------- | |
3393 void ArchDesc::generate_adlc_verification(FILE *fp_cpp) { | |
3394 fprintf(fp_cpp, "\n"); | |
3395 | |
3396 fprintf(fp_cpp, "#ifndef PRODUCT\n"); | |
3397 fprintf(fp_cpp, "void Compile::adlc_verification() {\n"); | |
3398 globalDefs().print_asserts(fp_cpp); | |
3399 fprintf(fp_cpp, "}\n"); | |
3400 fprintf(fp_cpp, "#endif\n"); | |
3401 fprintf(fp_cpp, "\n"); | |
3402 } | |
3403 | |
3404 //---------------------------addSourceBlocks----------------------------- | |
3405 void ArchDesc::addSourceBlocks(FILE *fp_cpp) { | |
3406 if (_source.count() > 0) | |
3407 _source.output(fp_cpp); | |
3408 | |
3409 generate_adlc_verification(fp_cpp); | |
3410 } | |
3411 //---------------------------addHeaderBlocks----------------------------- | |
3412 void ArchDesc::addHeaderBlocks(FILE *fp_hpp) { | |
3413 if (_header.count() > 0) | |
3414 _header.output(fp_hpp); | |
3415 } | |
3416 //-------------------------addPreHeaderBlocks---------------------------- | |
3417 void ArchDesc::addPreHeaderBlocks(FILE *fp_hpp) { | |
3418 // Output #defines from definition block | |
3419 globalDefs().print_defines(fp_hpp); | |
3420 | |
3421 if (_pre_header.count() > 0) | |
3422 _pre_header.output(fp_hpp); | |
3423 } | |
3424 | |
3425 //---------------------------buildReduceMaps----------------------------- | |
3426 // Build mapping from enumeration for densely packed operands | |
3427 // TO result and child types. | |
3428 void ArchDesc::buildReduceMaps(FILE *fp_hpp, FILE *fp_cpp) { | |
3429 RegDef *rdef; | |
3430 RegDef *next; | |
3431 | |
3432 // The emit bodies currently require functions defined in the source block. | |
3433 | |
3434 // Build external declarations for mappings | |
3435 fprintf(fp_hpp, "\n"); | |
3436 fprintf(fp_hpp, "extern const char register_save_policy[];\n"); | |
3437 fprintf(fp_hpp, "extern const char c_reg_save_policy[];\n"); | |
3438 fprintf(fp_hpp, "extern const int register_save_type[];\n"); | |
3439 fprintf(fp_hpp, "\n"); | |
3440 | |
3441 // Construct Save-Policy array | |
3442 fprintf(fp_cpp, "// Map from machine-independent register number to register_save_policy\n"); | |
3443 fprintf(fp_cpp, "const char register_save_policy[] = {\n"); | |
3444 _register->reset_RegDefs(); | |
3445 for( rdef = _register->iter_RegDefs(); rdef != NULL; rdef = next ) { | |
3446 next = _register->iter_RegDefs(); | |
3447 char policy = reg_save_policy(rdef->_callconv); | |
3448 const char *comma = (next != NULL) ? "," : " // no trailing comma"; | |
3449 fprintf(fp_cpp, " '%c'%s\n", policy, comma); | |
3450 } | |
3451 fprintf(fp_cpp, "};\n\n"); | |
3452 | |
3453 // Construct Native Save-Policy array | |
3454 fprintf(fp_cpp, "// Map from machine-independent register number to c_reg_save_policy\n"); | |
3455 fprintf(fp_cpp, "const char c_reg_save_policy[] = {\n"); | |
3456 _register->reset_RegDefs(); | |
3457 for( rdef = _register->iter_RegDefs(); rdef != NULL; rdef = next ) { | |
3458 next = _register->iter_RegDefs(); | |
3459 char policy = reg_save_policy(rdef->_c_conv); | |
3460 const char *comma = (next != NULL) ? "," : " // no trailing comma"; | |
3461 fprintf(fp_cpp, " '%c'%s\n", policy, comma); | |
3462 } | |
3463 fprintf(fp_cpp, "};\n\n"); | |
3464 | |
3465 // Construct Register Save Type array | |
3466 fprintf(fp_cpp, "// Map from machine-independent register number to register_save_type\n"); | |
3467 fprintf(fp_cpp, "const int register_save_type[] = {\n"); | |
3468 _register->reset_RegDefs(); | |
3469 for( rdef = _register->iter_RegDefs(); rdef != NULL; rdef = next ) { | |
3470 next = _register->iter_RegDefs(); | |
3471 const char *comma = (next != NULL) ? "," : " // no trailing comma"; | |
3472 fprintf(fp_cpp, " %s%s\n", rdef->_idealtype, comma); | |
3473 } | |
3474 fprintf(fp_cpp, "};\n\n"); | |
3475 | |
3476 // Construct the table for reduceOp | |
3477 OutputReduceOp output_reduce_op(fp_hpp, fp_cpp, _globalNames, *this); | |
3478 build_map(output_reduce_op); | |
3479 // Construct the table for leftOp | |
3480 OutputLeftOp output_left_op(fp_hpp, fp_cpp, _globalNames, *this); | |
3481 build_map(output_left_op); | |
3482 // Construct the table for rightOp | |
3483 OutputRightOp output_right_op(fp_hpp, fp_cpp, _globalNames, *this); | |
3484 build_map(output_right_op); | |
3485 // Construct the table of rule names | |
3486 OutputRuleName output_rule_name(fp_hpp, fp_cpp, _globalNames, *this); | |
3487 build_map(output_rule_name); | |
3488 // Construct the boolean table for subsumed operands | |
3489 OutputSwallowed output_swallowed(fp_hpp, fp_cpp, _globalNames, *this); | |
3490 build_map(output_swallowed); | |
3491 // // // Preserve in case we decide to use this table instead of another | |
3492 //// Construct the boolean table for instruction chain rules | |
3493 //OutputInstChainRule output_inst_chain(fp_hpp, fp_cpp, _globalNames, *this); | |
3494 //build_map(output_inst_chain); | |
3495 | |
3496 } | |
3497 | |
3498 | |
3499 //---------------------------buildMachOperGenerator--------------------------- | |
3500 | |
3501 // Recurse through match tree, building path through corresponding state tree, | |
3502 // Until we reach the constant we are looking for. | |
3503 static void path_to_constant(FILE *fp, FormDict &globals, | |
3504 MatchNode *mnode, uint idx) { | |
3505 if ( ! mnode) return; | |
3506 | |
3507 unsigned position = 0; | |
3508 const char *result = NULL; | |
3509 const char *name = NULL; | |
3510 const char *optype = NULL; | |
3511 | |
3512 // Base Case: access constant in ideal node linked to current state node | |
3513 // Each type of constant has its own access function | |
3514 if ( (mnode->_lChild == NULL) && (mnode->_rChild == NULL) | |
3515 && mnode->base_operand(position, globals, result, name, optype) ) { | |
3516 if ( strcmp(optype,"ConI") == 0 ) { | |
3517 fprintf(fp, "_leaf->get_int()"); | |
3518 } else if ( (strcmp(optype,"ConP") == 0) ) { | |
3519 fprintf(fp, "_leaf->bottom_type()->is_ptr()"); | |
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
3520 } else if ( (strcmp(optype,"ConN") == 0) ) { |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
3521 fprintf(fp, "_leaf->bottom_type()->is_narrowoop()"); |
0 | 3522 } else if ( (strcmp(optype,"ConF") == 0) ) { |
3523 fprintf(fp, "_leaf->getf()"); | |
3524 } else if ( (strcmp(optype,"ConD") == 0) ) { | |
3525 fprintf(fp, "_leaf->getd()"); | |
3526 } else if ( (strcmp(optype,"ConL") == 0) ) { | |
3527 fprintf(fp, "_leaf->get_long()"); | |
3528 } else if ( (strcmp(optype,"Con")==0) ) { | |
3529 // !!!!! - Update if adding a machine-independent constant type | |
3530 fprintf(fp, "_leaf->get_int()"); | |
3531 assert( false, "Unsupported constant type, pointer or indefinite"); | |
3532 } else if ( (strcmp(optype,"Bool") == 0) ) { | |
3533 fprintf(fp, "_leaf->as_Bool()->_test._test"); | |
3534 } else { | |
3535 assert( false, "Unsupported constant type"); | |
3536 } | |
3537 return; | |
3538 } | |
3539 | |
3540 // If constant is in left child, build path and recurse | |
3541 uint lConsts = (mnode->_lChild) ? (mnode->_lChild->num_consts(globals) ) : 0; | |
3542 uint rConsts = (mnode->_rChild) ? (mnode->_rChild->num_consts(globals) ) : 0; | |
3543 if ( (mnode->_lChild) && (lConsts > idx) ) { | |
3544 fprintf(fp, "_kids[0]->"); | |
3545 path_to_constant(fp, globals, mnode->_lChild, idx); | |
3546 return; | |
3547 } | |
3548 // If constant is in right child, build path and recurse | |
3549 if ( (mnode->_rChild) && (rConsts > (idx - lConsts) ) ) { | |
3550 idx = idx - lConsts; | |
3551 fprintf(fp, "_kids[1]->"); | |
3552 path_to_constant(fp, globals, mnode->_rChild, idx); | |
3553 return; | |
3554 } | |
3555 assert( false, "ShouldNotReachHere()"); | |
3556 } | |
3557 | |
3558 // Generate code that is executed when generating a specific Machine Operand | |
3559 static void genMachOperCase(FILE *fp, FormDict &globalNames, ArchDesc &AD, | |
3560 OperandForm &op) { | |
3561 const char *opName = op._ident; | |
3562 const char *opEnumName = AD.machOperEnum(opName); | |
3563 uint num_consts = op.num_consts(globalNames); | |
3564 | |
3565 // Generate the case statement for this opcode | |
3566 fprintf(fp, " case %s:", opEnumName); | |
3567 fprintf(fp, "\n return new (C) %sOper(", opName); | |
3568 // Access parameters for constructor from the stat object | |
3569 // | |
3570 // Build access to condition code value | |
3571 if ( (num_consts > 0) ) { | |
3572 uint i = 0; | |
3573 path_to_constant(fp, globalNames, op._matrule, i); | |
3574 for ( i = 1; i < num_consts; ++i ) { | |
3575 fprintf(fp, ", "); | |
3576 path_to_constant(fp, globalNames, op._matrule, i); | |
3577 } | |
3578 } | |
3579 fprintf(fp, " );\n"); | |
3580 } | |
3581 | |
3582 | |
3583 // Build switch to invoke "new" MachNode or MachOper | |
3584 void ArchDesc::buildMachOperGenerator(FILE *fp_cpp) { | |
3585 int idx = 0; | |
3586 | |
3587 // Build switch to invoke 'new' for a specific MachOper | |
3588 fprintf(fp_cpp, "\n"); | |
3589 fprintf(fp_cpp, "\n"); | |
3590 fprintf(fp_cpp, | |
3591 "//------------------------- MachOper Generator ---------------\n"); | |
3592 fprintf(fp_cpp, | |
3593 "// A switch statement on the dense-packed user-defined type system\n" | |
3594 "// that invokes 'new' on the corresponding class constructor.\n"); | |
3595 fprintf(fp_cpp, "\n"); | |
3596 fprintf(fp_cpp, "MachOper *State::MachOperGenerator"); | |
3597 fprintf(fp_cpp, "(int opcode, Compile* C)"); | |
3598 fprintf(fp_cpp, "{\n"); | |
3599 fprintf(fp_cpp, "\n"); | |
3600 fprintf(fp_cpp, " switch(opcode) {\n"); | |
3601 | |
3602 // Place all user-defined operands into the mapping | |
3603 _operands.reset(); | |
3604 int opIndex = 0; | |
3605 OperandForm *op; | |
3606 for( ; (op = (OperandForm*)_operands.iter()) != NULL; ) { | |
3607 // Ensure this is a machine-world instruction | |
3608 if ( op->ideal_only() ) continue; | |
3609 | |
3610 genMachOperCase(fp_cpp, _globalNames, *this, *op); | |
3611 }; | |
3612 | |
3613 // Do not iterate over operand classes for the operand generator!!! | |
3614 | |
3615 // Place all internal operands into the mapping | |
3616 _internalOpNames.reset(); | |
3617 const char *iopn; | |
3618 for( ; (iopn = _internalOpNames.iter()) != NULL; ) { | |
3619 const char *opEnumName = machOperEnum(iopn); | |
3620 // Generate the case statement for this opcode | |
3621 fprintf(fp_cpp, " case %s:", opEnumName); | |
3622 fprintf(fp_cpp, " return NULL;\n"); | |
3623 }; | |
3624 | |
3625 // Generate the default case for switch(opcode) | |
3626 fprintf(fp_cpp, " \n"); | |
3627 fprintf(fp_cpp, " default:\n"); | |
3628 fprintf(fp_cpp, " fprintf(stderr, \"Default MachOper Generator invoked for: \\n\");\n"); | |
3629 fprintf(fp_cpp, " fprintf(stderr, \" opcode = %cd\\n\", opcode);\n", '%'); | |
3630 fprintf(fp_cpp, " break;\n"); | |
3631 fprintf(fp_cpp, " }\n"); | |
3632 | |
3633 // Generate the closing for method Matcher::MachOperGenerator | |
3634 fprintf(fp_cpp, " return NULL;\n"); | |
3635 fprintf(fp_cpp, "};\n"); | |
3636 } | |
3637 | |
3638 | |
3639 //---------------------------buildMachNode------------------------------------- | |
3640 // Build a new MachNode, for MachNodeGenerator or cisc-spilling | |
3641 void ArchDesc::buildMachNode(FILE *fp_cpp, InstructForm *inst, const char *indent) { | |
3642 const char *opType = NULL; | |
3643 const char *opClass = inst->_ident; | |
3644 | |
3645 // Create the MachNode object | |
3646 fprintf(fp_cpp, "%s %sNode *node = new (C) %sNode();\n",indent, opClass,opClass); | |
3647 | |
3648 if ( (inst->num_post_match_opnds() != 0) ) { | |
3649 // Instruction that contains operands which are not in match rule. | |
3650 // | |
3651 // Check if the first post-match component may be an interesting def | |
3652 bool dont_care = false; | |
3653 ComponentList &comp_list = inst->_components; | |
3654 Component *comp = NULL; | |
3655 comp_list.reset(); | |
3656 if ( comp_list.match_iter() != NULL ) dont_care = true; | |
3657 | |
3658 // Insert operands that are not in match-rule. | |
3659 // Only insert a DEF if the do_care flag is set | |
3660 comp_list.reset(); | |
3661 while ( comp = comp_list.post_match_iter() ) { | |
3662 // Check if we don't care about DEFs or KILLs that are not USEs | |
3663 if ( dont_care && (! comp->isa(Component::USE)) ) { | |
3664 continue; | |
3665 } | |
3666 dont_care = true; | |
3667 // For each operand not in the match rule, call MachOperGenerator | |
3668 // with the enum for the opcode that needs to be built | |
3669 // and the node just built, the parent of the operand. | |
3670 ComponentList clist = inst->_components; | |
3671 int index = clist.operand_position(comp->_name, comp->_usedef); | |
3672 const char *opcode = machOperEnum(comp->_type); | |
3673 const char *parent = "node"; | |
3674 fprintf(fp_cpp, "%s node->set_opnd_array(%d, ", indent, index); | |
3675 fprintf(fp_cpp, "MachOperGenerator(%s, C));\n", opcode); | |
3676 } | |
3677 } | |
3678 else if ( inst->is_chain_of_constant(_globalNames, opType) ) { | |
3679 // An instruction that chains from a constant! | |
3680 // In this case, we need to subsume the constant into the node | |
3681 // at operand position, oper_input_base(). | |
3682 // | |
3683 // Fill in the constant | |
3684 fprintf(fp_cpp, "%s node->_opnd_array[%d] = ", indent, | |
3685 inst->oper_input_base(_globalNames)); | |
3686 // ##### | |
3687 // Check for multiple constants and then fill them in. | |
3688 // Just like MachOperGenerator | |
3689 const char *opName = inst->_matrule->_rChild->_opType; | |
3690 fprintf(fp_cpp, "new (C) %sOper(", opName); | |
3691 // Grab operand form | |
3692 OperandForm *op = (_globalNames[opName])->is_operand(); | |
3693 // Look up the number of constants | |
3694 uint num_consts = op->num_consts(_globalNames); | |
3695 if ( (num_consts > 0) ) { | |
3696 uint i = 0; | |
3697 path_to_constant(fp_cpp, _globalNames, op->_matrule, i); | |
3698 for ( i = 1; i < num_consts; ++i ) { | |
3699 fprintf(fp_cpp, ", "); | |
3700 path_to_constant(fp_cpp, _globalNames, op->_matrule, i); | |
3701 } | |
3702 } | |
3703 fprintf(fp_cpp, " );\n"); | |
3704 // ##### | |
3705 } | |
3706 | |
3707 // Fill in the bottom_type where requested | |
3708 if ( inst->captures_bottom_type() ) { | |
3709 fprintf(fp_cpp, "%s node->_bottom_type = _leaf->bottom_type();\n", indent); | |
3710 } | |
3711 if( inst->is_ideal_if() ) { | |
3712 fprintf(fp_cpp, "%s node->_prob = _leaf->as_If()->_prob;\n", indent); | |
3713 fprintf(fp_cpp, "%s node->_fcnt = _leaf->as_If()->_fcnt;\n", indent); | |
3714 } | |
3715 if( inst->is_ideal_fastlock() ) { | |
3716 fprintf(fp_cpp, "%s node->_counters = _leaf->as_FastLock()->counters();\n", indent); | |
3717 } | |
3718 | |
3719 } | |
3720 | |
3721 //---------------------------declare_cisc_version------------------------------ | |
3722 // Build CISC version of this instruction | |
3723 void InstructForm::declare_cisc_version(ArchDesc &AD, FILE *fp_hpp) { | |
3724 if( AD.can_cisc_spill() ) { | |
3725 InstructForm *inst_cisc = cisc_spill_alternate(); | |
3726 if (inst_cisc != NULL) { | |
3727 fprintf(fp_hpp, " virtual int cisc_operand() const { return %d; }\n", cisc_spill_operand()); | |
3728 fprintf(fp_hpp, " virtual MachNode *cisc_version(int offset, Compile* C);\n"); | |
3729 fprintf(fp_hpp, " virtual void use_cisc_RegMask();\n"); | |
3730 fprintf(fp_hpp, " virtual const RegMask *cisc_RegMask() const { return _cisc_RegMask; }\n"); | |
3731 } | |
3732 } | |
3733 } | |
3734 | |
3735 //---------------------------define_cisc_version------------------------------- | |
3736 // Build CISC version of this instruction | |
3737 bool InstructForm::define_cisc_version(ArchDesc &AD, FILE *fp_cpp) { | |
3738 InstructForm *inst_cisc = this->cisc_spill_alternate(); | |
3739 if( AD.can_cisc_spill() && (inst_cisc != NULL) ) { | |
3740 const char *name = inst_cisc->_ident; | |
3741 assert( inst_cisc->num_opnds() == this->num_opnds(), "Must have same number of operands"); | |
3742 OperandForm *cisc_oper = AD.cisc_spill_operand(); | |
3743 assert( cisc_oper != NULL, "insanity check"); | |
3744 const char *cisc_oper_name = cisc_oper->_ident; | |
3745 assert( cisc_oper_name != NULL, "insanity check"); | |
3746 // | |
3747 // Set the correct reg_mask_or_stack for the cisc operand | |
3748 fprintf(fp_cpp, "\n"); | |
3749 fprintf(fp_cpp, "void %sNode::use_cisc_RegMask() {\n", this->_ident); | |
3750 // Lookup the correct reg_mask_or_stack | |
3751 const char *reg_mask_name = cisc_reg_mask_name(); | |
3752 fprintf(fp_cpp, " _cisc_RegMask = &STACK_OR_%s;\n", reg_mask_name); | |
3753 fprintf(fp_cpp, "}\n"); | |
3754 // | |
3755 // Construct CISC version of this instruction | |
3756 fprintf(fp_cpp, "\n"); | |
3757 fprintf(fp_cpp, "// Build CISC version of this instruction\n"); | |
3758 fprintf(fp_cpp, "MachNode *%sNode::cisc_version( int offset, Compile* C ) {\n", this->_ident); | |
3759 // Create the MachNode object | |
3760 fprintf(fp_cpp, " %sNode *node = new (C) %sNode();\n", name, name); | |
3761 // Fill in the bottom_type where requested | |
3762 if ( this->captures_bottom_type() ) { | |
3763 fprintf(fp_cpp, " node->_bottom_type = bottom_type();\n"); | |
3764 } | |
785 | 3765 |
3766 uint cur_num_opnds = num_opnds(); | |
3767 if (cur_num_opnds > 1 && cur_num_opnds != num_unique_opnds()) { | |
3768 fprintf(fp_cpp," node->_num_opnds = %d;\n", num_unique_opnds()); | |
3769 } | |
3770 | |
0 | 3771 fprintf(fp_cpp, "\n"); |
3772 fprintf(fp_cpp, " // Copy _idx, inputs and operands to new node\n"); | |
3773 fprintf(fp_cpp, " fill_new_machnode(node, C);\n"); | |
3774 // Construct operand to access [stack_pointer + offset] | |
3775 fprintf(fp_cpp, " // Construct operand to access [stack_pointer + offset]\n"); | |
3776 fprintf(fp_cpp, " node->set_opnd_array(cisc_operand(), new (C) %sOper(offset));\n", cisc_oper_name); | |
3777 fprintf(fp_cpp, "\n"); | |
3778 | |
3779 // Return result and exit scope | |
3780 fprintf(fp_cpp, " return node;\n"); | |
3781 fprintf(fp_cpp, "}\n"); | |
3782 fprintf(fp_cpp, "\n"); | |
3783 return true; | |
3784 } | |
3785 return false; | |
3786 } | |
3787 | |
3788 //---------------------------declare_short_branch_methods---------------------- | |
3789 // Build prototypes for short branch methods | |
3790 void InstructForm::declare_short_branch_methods(FILE *fp_hpp) { | |
3791 if (has_short_branch_form()) { | |
3792 fprintf(fp_hpp, " virtual MachNode *short_branch_version(Compile* C);\n"); | |
3793 } | |
3794 } | |
3795 | |
3796 //---------------------------define_short_branch_methods----------------------- | |
3797 // Build definitions for short branch methods | |
3798 bool InstructForm::define_short_branch_methods(FILE *fp_cpp) { | |
3799 if (has_short_branch_form()) { | |
3800 InstructForm *short_branch = short_branch_form(); | |
3801 const char *name = short_branch->_ident; | |
3802 | |
3803 // Construct short_branch_version() method. | |
3804 fprintf(fp_cpp, "// Build short branch version of this instruction\n"); | |
3805 fprintf(fp_cpp, "MachNode *%sNode::short_branch_version(Compile* C) {\n", this->_ident); | |
3806 // Create the MachNode object | |
3807 fprintf(fp_cpp, " %sNode *node = new (C) %sNode();\n", name, name); | |
3808 if( is_ideal_if() ) { | |
3809 fprintf(fp_cpp, " node->_prob = _prob;\n"); | |
3810 fprintf(fp_cpp, " node->_fcnt = _fcnt;\n"); | |
3811 } | |
3812 // Fill in the bottom_type where requested | |
3813 if ( this->captures_bottom_type() ) { | |
3814 fprintf(fp_cpp, " node->_bottom_type = bottom_type();\n"); | |
3815 } | |
3816 | |
3817 fprintf(fp_cpp, "\n"); | |
3818 // Short branch version must use same node index for access | |
3819 // through allocator's tables | |
3820 fprintf(fp_cpp, " // Copy _idx, inputs and operands to new node\n"); | |
3821 fprintf(fp_cpp, " fill_new_machnode(node, C);\n"); | |
3822 | |
3823 // Return result and exit scope | |
3824 fprintf(fp_cpp, " return node;\n"); | |
3825 fprintf(fp_cpp, "}\n"); | |
3826 fprintf(fp_cpp,"\n"); | |
3827 return true; | |
3828 } | |
3829 return false; | |
3830 } | |
3831 | |
3832 | |
3833 //---------------------------buildMachNodeGenerator---------------------------- | |
3834 // Build switch to invoke appropriate "new" MachNode for an opcode | |
3835 void ArchDesc::buildMachNodeGenerator(FILE *fp_cpp) { | |
3836 | |
3837 // Build switch to invoke 'new' for a specific MachNode | |
3838 fprintf(fp_cpp, "\n"); | |
3839 fprintf(fp_cpp, "\n"); | |
3840 fprintf(fp_cpp, | |
3841 "//------------------------- MachNode Generator ---------------\n"); | |
3842 fprintf(fp_cpp, | |
3843 "// A switch statement on the dense-packed user-defined type system\n" | |
3844 "// that invokes 'new' on the corresponding class constructor.\n"); | |
3845 fprintf(fp_cpp, "\n"); | |
3846 fprintf(fp_cpp, "MachNode *State::MachNodeGenerator"); | |
3847 fprintf(fp_cpp, "(int opcode, Compile* C)"); | |
3848 fprintf(fp_cpp, "{\n"); | |
3849 fprintf(fp_cpp, " switch(opcode) {\n"); | |
3850 | |
3851 // Provide constructor for all user-defined instructions | |
3852 _instructions.reset(); | |
3853 int opIndex = operandFormCount(); | |
3854 InstructForm *inst; | |
3855 for( ; (inst = (InstructForm*)_instructions.iter()) != NULL; ) { | |
3856 // Ensure that matrule is defined. | |
3857 if ( inst->_matrule == NULL ) continue; | |
3858 | |
3859 int opcode = opIndex++; | |
3860 const char *opClass = inst->_ident; | |
3861 char *opType = NULL; | |
3862 | |
3863 // Generate the case statement for this instruction | |
3864 fprintf(fp_cpp, " case %s_rule:", opClass); | |
3865 | |
3866 // Start local scope | |
3867 fprintf(fp_cpp, " {\n"); | |
3868 // Generate code to construct the new MachNode | |
3869 buildMachNode(fp_cpp, inst, " "); | |
3870 // Return result and exit scope | |
3871 fprintf(fp_cpp, " return node;\n"); | |
3872 fprintf(fp_cpp, " }\n"); | |
3873 } | |
3874 | |
3875 // Generate the default case for switch(opcode) | |
3876 fprintf(fp_cpp, " \n"); | |
3877 fprintf(fp_cpp, " default:\n"); | |
3878 fprintf(fp_cpp, " fprintf(stderr, \"Default MachNode Generator invoked for: \\n\");\n"); | |
3879 fprintf(fp_cpp, " fprintf(stderr, \" opcode = %cd\\n\", opcode);\n", '%'); | |
3880 fprintf(fp_cpp, " break;\n"); | |
3881 fprintf(fp_cpp, " };\n"); | |
3882 | |
3883 // Generate the closing for method Matcher::MachNodeGenerator | |
3884 fprintf(fp_cpp, " return NULL;\n"); | |
3885 fprintf(fp_cpp, "}\n"); | |
3886 } | |
3887 | |
3888 | |
3889 //---------------------------buildInstructMatchCheck-------------------------- | |
3890 // Output the method to Matcher which checks whether or not a specific | |
3891 // instruction has a matching rule for the host architecture. | |
3892 void ArchDesc::buildInstructMatchCheck(FILE *fp_cpp) const { | |
3893 fprintf(fp_cpp, "\n\n"); | |
3894 fprintf(fp_cpp, "const bool Matcher::has_match_rule(int opcode) {\n"); | |
3895 fprintf(fp_cpp, " assert(_last_machine_leaf < opcode && opcode < _last_opcode, \"opcode in range\");\n"); | |
3896 fprintf(fp_cpp, " return _hasMatchRule[opcode];\n"); | |
3897 fprintf(fp_cpp, "}\n\n"); | |
3898 | |
3899 fprintf(fp_cpp, "const bool Matcher::_hasMatchRule[_last_opcode] = {\n"); | |
3900 int i; | |
3901 for (i = 0; i < _last_opcode - 1; i++) { | |
3902 fprintf(fp_cpp, " %-5s, // %s\n", | |
3903 _has_match_rule[i] ? "true" : "false", | |
3904 NodeClassNames[i]); | |
3905 } | |
3906 fprintf(fp_cpp, " %-5s // %s\n", | |
3907 _has_match_rule[i] ? "true" : "false", | |
3908 NodeClassNames[i]); | |
3909 fprintf(fp_cpp, "};\n"); | |
3910 } | |
3911 | |
3912 //---------------------------buildFrameMethods--------------------------------- | |
3913 // Output the methods to Matcher which specify frame behavior | |
3914 void ArchDesc::buildFrameMethods(FILE *fp_cpp) { | |
3915 fprintf(fp_cpp,"\n\n"); | |
3916 // Stack Direction | |
3917 fprintf(fp_cpp,"bool Matcher::stack_direction() const { return %s; }\n\n", | |
3918 _frame->_direction ? "true" : "false"); | |
3919 // Sync Stack Slots | |
3920 fprintf(fp_cpp,"int Compile::sync_stack_slots() const { return %s; }\n\n", | |
3921 _frame->_sync_stack_slots); | |
3922 // Java Stack Alignment | |
3923 fprintf(fp_cpp,"uint Matcher::stack_alignment_in_bytes() { return %s; }\n\n", | |
3924 _frame->_alignment); | |
3925 // Java Return Address Location | |
3926 fprintf(fp_cpp,"OptoReg::Name Matcher::return_addr() const {"); | |
3927 if (_frame->_return_addr_loc) { | |
3928 fprintf(fp_cpp," return OptoReg::Name(%s_num); }\n\n", | |
3929 _frame->_return_addr); | |
3930 } | |
3931 else { | |
3932 fprintf(fp_cpp," return OptoReg::stack2reg(%s); }\n\n", | |
3933 _frame->_return_addr); | |
3934 } | |
3935 // Java Stack Slot Preservation | |
3936 fprintf(fp_cpp,"uint Compile::in_preserve_stack_slots() "); | |
3937 fprintf(fp_cpp,"{ return %s; }\n\n", _frame->_in_preserve_slots); | |
3938 // Top Of Stack Slot Preservation, for both Java and C | |
3939 fprintf(fp_cpp,"uint Compile::out_preserve_stack_slots() "); | |
3940 fprintf(fp_cpp,"{ return SharedRuntime::out_preserve_stack_slots(); }\n\n"); | |
3941 // varargs C out slots killed | |
3942 fprintf(fp_cpp,"uint Compile::varargs_C_out_slots_killed() const "); | |
3943 fprintf(fp_cpp,"{ return %s; }\n\n", _frame->_varargs_C_out_slots_killed); | |
3944 // Java Argument Position | |
3945 fprintf(fp_cpp,"void Matcher::calling_convention(BasicType *sig_bt, VMRegPair *regs, uint length, bool is_outgoing) {\n"); | |
3946 fprintf(fp_cpp,"%s\n", _frame->_calling_convention); | |
3947 fprintf(fp_cpp,"}\n\n"); | |
3948 // Native Argument Position | |
3949 fprintf(fp_cpp,"void Matcher::c_calling_convention(BasicType *sig_bt, VMRegPair *regs, uint length) {\n"); | |
3950 fprintf(fp_cpp,"%s\n", _frame->_c_calling_convention); | |
3951 fprintf(fp_cpp,"}\n\n"); | |
3952 // Java Return Value Location | |
3953 fprintf(fp_cpp,"OptoRegPair Matcher::return_value(int ideal_reg, bool is_outgoing) {\n"); | |
3954 fprintf(fp_cpp,"%s\n", _frame->_return_value); | |
3955 fprintf(fp_cpp,"}\n\n"); | |
3956 // Native Return Value Location | |
3957 fprintf(fp_cpp,"OptoRegPair Matcher::c_return_value(int ideal_reg, bool is_outgoing) {\n"); | |
3958 fprintf(fp_cpp,"%s\n", _frame->_c_return_value); | |
3959 fprintf(fp_cpp,"}\n\n"); | |
3960 | |
3961 // Inline Cache Register, mask definition, and encoding | |
3962 fprintf(fp_cpp,"OptoReg::Name Matcher::inline_cache_reg() {"); | |
3963 fprintf(fp_cpp," return OptoReg::Name(%s_num); }\n\n", | |
3964 _frame->_inline_cache_reg); | |
3965 fprintf(fp_cpp,"const RegMask &Matcher::inline_cache_reg_mask() {"); | |
3966 fprintf(fp_cpp," return INLINE_CACHE_REG_mask; }\n\n"); | |
3967 fprintf(fp_cpp,"int Matcher::inline_cache_reg_encode() {"); | |
3968 fprintf(fp_cpp," return _regEncode[inline_cache_reg()]; }\n\n"); | |
3969 | |
3970 // Interpreter's Method Oop Register, mask definition, and encoding | |
3971 fprintf(fp_cpp,"OptoReg::Name Matcher::interpreter_method_oop_reg() {"); | |
3972 fprintf(fp_cpp," return OptoReg::Name(%s_num); }\n\n", | |
3973 _frame->_interpreter_method_oop_reg); | |
3974 fprintf(fp_cpp,"const RegMask &Matcher::interpreter_method_oop_reg_mask() {"); | |
3975 fprintf(fp_cpp," return INTERPRETER_METHOD_OOP_REG_mask; }\n\n"); | |
3976 fprintf(fp_cpp,"int Matcher::interpreter_method_oop_reg_encode() {"); | |
3977 fprintf(fp_cpp," return _regEncode[interpreter_method_oop_reg()]; }\n\n"); | |
3978 | |
3979 // Interpreter's Frame Pointer Register, mask definition, and encoding | |
3980 fprintf(fp_cpp,"OptoReg::Name Matcher::interpreter_frame_pointer_reg() {"); | |
3981 if (_frame->_interpreter_frame_pointer_reg == NULL) | |
3982 fprintf(fp_cpp," return OptoReg::Bad; }\n\n"); | |
3983 else | |
3984 fprintf(fp_cpp," return OptoReg::Name(%s_num); }\n\n", | |
3985 _frame->_interpreter_frame_pointer_reg); | |
3986 fprintf(fp_cpp,"const RegMask &Matcher::interpreter_frame_pointer_reg_mask() {"); | |
3987 if (_frame->_interpreter_frame_pointer_reg == NULL) | |
3988 fprintf(fp_cpp," static RegMask dummy; return dummy; }\n\n"); | |
3989 else | |
3990 fprintf(fp_cpp," return INTERPRETER_FRAME_POINTER_REG_mask; }\n\n"); | |
3991 | |
3992 // Frame Pointer definition | |
3993 /* CNC - I can not contemplate having a different frame pointer between | |
3994 Java and native code; makes my head hurt to think about it. | |
3995 fprintf(fp_cpp,"OptoReg::Name Matcher::frame_pointer() const {"); | |
3996 fprintf(fp_cpp," return OptoReg::Name(%s_num); }\n\n", | |
3997 _frame->_frame_pointer); | |
3998 */ | |
3999 // (Native) Frame Pointer definition | |
4000 fprintf(fp_cpp,"OptoReg::Name Matcher::c_frame_pointer() const {"); | |
4001 fprintf(fp_cpp," return OptoReg::Name(%s_num); }\n\n", | |
4002 _frame->_frame_pointer); | |
4003 | |
4004 // Number of callee-save + always-save registers for calling convention | |
4005 fprintf(fp_cpp, "// Number of callee-save + always-save registers\n"); | |
4006 fprintf(fp_cpp, "int Matcher::number_of_saved_registers() {\n"); | |
4007 RegDef *rdef; | |
4008 int nof_saved_registers = 0; | |
4009 _register->reset_RegDefs(); | |
4010 while( (rdef = _register->iter_RegDefs()) != NULL ) { | |
4011 if( !strcmp(rdef->_callconv, "SOE") || !strcmp(rdef->_callconv, "AS") ) | |
4012 ++nof_saved_registers; | |
4013 } | |
4014 fprintf(fp_cpp, " return %d;\n", nof_saved_registers); | |
4015 fprintf(fp_cpp, "};\n\n"); | |
4016 } | |
4017 | |
4018 | |
4019 | |
4020 | |
4021 static int PrintAdlcCisc = 0; | |
4022 //---------------------------identify_cisc_spilling---------------------------- | |
4023 // Get info for the CISC_oracle and MachNode::cisc_version() | |
4024 void ArchDesc::identify_cisc_spill_instructions() { | |
4025 | |
4026 // Find the user-defined operand for cisc-spilling | |
4027 if( _frame->_cisc_spilling_operand_name != NULL ) { | |
4028 const Form *form = _globalNames[_frame->_cisc_spilling_operand_name]; | |
4029 OperandForm *oper = form ? form->is_operand() : NULL; | |
4030 // Verify the user's suggestion | |
4031 if( oper != NULL ) { | |
4032 // Ensure that match field is defined. | |
4033 if ( oper->_matrule != NULL ) { | |
4034 MatchRule &mrule = *oper->_matrule; | |
4035 if( strcmp(mrule._opType,"AddP") == 0 ) { | |
4036 MatchNode *left = mrule._lChild; | |
4037 MatchNode *right= mrule._rChild; | |
4038 if( left != NULL && right != NULL ) { | |
4039 const Form *left_op = _globalNames[left->_opType]->is_operand(); | |
4040 const Form *right_op = _globalNames[right->_opType]->is_operand(); | |
4041 if( (left_op != NULL && right_op != NULL) | |
4042 && (left_op->interface_type(_globalNames) == Form::register_interface) | |
4043 && (right_op->interface_type(_globalNames) == Form::constant_interface) ) { | |
4044 // Successfully verified operand | |
4045 set_cisc_spill_operand( oper ); | |
4046 if( _cisc_spill_debug ) { | |
4047 fprintf(stderr, "\n\nVerified CISC-spill operand %s\n\n", oper->_ident); | |
4048 } | |
4049 } | |
4050 } | |
4051 } | |
4052 } | |
4053 } | |
4054 } | |
4055 | |
4056 if( cisc_spill_operand() != NULL ) { | |
4057 // N^2 comparison of instructions looking for a cisc-spilling version | |
4058 _instructions.reset(); | |
4059 InstructForm *instr; | |
4060 for( ; (instr = (InstructForm*)_instructions.iter()) != NULL; ) { | |
4061 // Ensure that match field is defined. | |
4062 if ( instr->_matrule == NULL ) continue; | |
4063 | |
4064 MatchRule &mrule = *instr->_matrule; | |
4065 Predicate *pred = instr->build_predicate(); | |
4066 | |
4067 // Grab the machine type of the operand | |
4068 const char *rootOp = instr->_ident; | |
4069 mrule._machType = rootOp; | |
4070 | |
4071 // Find result type for match | |
4072 const char *result = instr->reduce_result(); | |
4073 | |
4074 if( PrintAdlcCisc ) fprintf(stderr, " new instruction %s \n", instr->_ident ? instr->_ident : " "); | |
4075 bool found_cisc_alternate = false; | |
4076 _instructions.reset2(); | |
4077 InstructForm *instr2; | |
4078 for( ; !found_cisc_alternate && (instr2 = (InstructForm*)_instructions.iter2()) != NULL; ) { | |
4079 // Ensure that match field is defined. | |
4080 if( PrintAdlcCisc ) fprintf(stderr, " instr2 == %s \n", instr2->_ident ? instr2->_ident : " "); | |
4081 if ( instr2->_matrule != NULL | |
4082 && (instr != instr2 ) // Skip self | |
4083 && (instr2->reduce_result() != NULL) // want same result | |
4084 && (strcmp(result, instr2->reduce_result()) == 0)) { | |
4085 MatchRule &mrule2 = *instr2->_matrule; | |
4086 Predicate *pred2 = instr2->build_predicate(); | |
4087 found_cisc_alternate = instr->cisc_spills_to(*this, instr2); | |
4088 } | |
4089 } | |
4090 } | |
4091 } | |
4092 } | |
4093 | |
4094 //---------------------------build_cisc_spilling------------------------------- | |
4095 // Get info for the CISC_oracle and MachNode::cisc_version() | |
4096 void ArchDesc::build_cisc_spill_instructions(FILE *fp_hpp, FILE *fp_cpp) { | |
4097 // Output the table for cisc spilling | |
4098 fprintf(fp_cpp, "// The following instructions can cisc-spill\n"); | |
4099 _instructions.reset(); | |
4100 InstructForm *inst = NULL; | |
4101 for(; (inst = (InstructForm*)_instructions.iter()) != NULL; ) { | |
4102 // Ensure this is a machine-world instruction | |
4103 if ( inst->ideal_only() ) continue; | |
4104 const char *inst_name = inst->_ident; | |
4105 int operand = inst->cisc_spill_operand(); | |
4106 if( operand != AdlcVMDeps::Not_cisc_spillable ) { | |
4107 InstructForm *inst2 = inst->cisc_spill_alternate(); | |
4108 fprintf(fp_cpp, "// %s can cisc-spill operand %d to %s\n", inst->_ident, operand, inst2->_ident); | |
4109 } | |
4110 } | |
4111 fprintf(fp_cpp, "\n\n"); | |
4112 } | |
4113 | |
4114 //---------------------------identify_short_branches---------------------------- | |
4115 // Get info for our short branch replacement oracle. | |
4116 void ArchDesc::identify_short_branches() { | |
4117 // Walk over all instructions, checking to see if they match a short | |
4118 // branching alternate. | |
4119 _instructions.reset(); | |
4120 InstructForm *instr; | |
4121 while( (instr = (InstructForm*)_instructions.iter()) != NULL ) { | |
4122 // The instruction must have a match rule. | |
4123 if (instr->_matrule != NULL && | |
4124 instr->is_short_branch()) { | |
4125 | |
4126 _instructions.reset2(); | |
4127 InstructForm *instr2; | |
4128 while( (instr2 = (InstructForm*)_instructions.iter2()) != NULL ) { | |
4129 instr2->check_branch_variant(*this, instr); | |
4130 } | |
4131 } | |
4132 } | |
4133 } | |
4134 | |
4135 | |
4136 //---------------------------identify_unique_operands--------------------------- | |
4137 // Identify unique operands. | |
4138 void ArchDesc::identify_unique_operands() { | |
4139 // Walk over all instructions. | |
4140 _instructions.reset(); | |
4141 InstructForm *instr; | |
4142 while( (instr = (InstructForm*)_instructions.iter()) != NULL ) { | |
4143 // Ensure this is a machine-world instruction | |
4144 if (!instr->ideal_only()) { | |
4145 instr->set_unique_opnds(); | |
4146 } | |
4147 } | |
4148 } |