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