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