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