src/share/vm/adlc/forms.cpp

Tue, 28 Oct 2008 09:31:30 -0700

author
never
date
Tue, 28 Oct 2008 09:31:30 -0700
changeset 850
4d9884b01ba6
parent 631
d1605aabd0a1
child 993
3b5ac9e7e6ea
permissions
-rw-r--r--

6754519: don't emit flag fixup for NaN when condition being tested doesn't need it
Reviewed-by: kvn, rasbold

duke@435 1 /*
xdono@631 2 * Copyright 1997-2008 Sun Microsystems, Inc. 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 *
duke@435 19 * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara,
duke@435 20 * CA 95054 USA or visit www.sun.com if you need additional information or
duke@435 21 * have any questions.
duke@435 22 *
duke@435 23 */
duke@435 24
duke@435 25 // FORMS.CPP - Definitions for ADL Parser Generic & Utility Forms Classes
duke@435 26 #include "adlc.hpp"
duke@435 27
duke@435 28 //------------------------------Static Initializers----------------------------
duke@435 29 // allocate arena used by forms
duke@435 30 Arena *Form::arena = Form::generate_arena(); // = Form::generate_arena();
duke@435 31 Arena *Form::generate_arena() {
duke@435 32 return (new Arena);
duke@435 33 }
duke@435 34
duke@435 35 //------------------------------NameList---------------------------------------
duke@435 36 // reserved user-defined string
duke@435 37 const char *NameList::_signal = "$$SIGNAL$$";
never@850 38 const char *NameList::_signal2 = "$$SIGNAL2$$";
never@850 39 const char *NameList::_signal3 = "$$SIGNAL3$$";
duke@435 40
duke@435 41 // Constructor and Destructor
duke@435 42 NameList::NameList() : _cur(0), _max(4), _iter(0), _justReset(true) {
duke@435 43 _names = (const char**)malloc(_max*sizeof(char*));
duke@435 44 }
duke@435 45 NameList::~NameList() {
duke@435 46 // The following free is a double-free, and crashes the program:
duke@435 47 //free(_names); // not owner of strings
duke@435 48 }
duke@435 49
duke@435 50 void NameList::addName(const char *name) {
duke@435 51 if (_cur == _max) _names =(const char**)realloc(_names,(_max *=2)*sizeof(char*));
duke@435 52 _names[_cur++] = name;
duke@435 53 }
duke@435 54
duke@435 55 void NameList::add_signal() {
duke@435 56 addName( _signal );
duke@435 57 }
duke@435 58 void NameList::clear() {
duke@435 59 _cur = 0;
duke@435 60 _iter = 0;
duke@435 61 _justReset = true;
duke@435 62 // _max = 4; Already allocated
duke@435 63 }
duke@435 64
duke@435 65 int NameList::count() const { return _cur; }
duke@435 66
duke@435 67 void NameList::reset() { _iter = 0; _justReset = true;}
duke@435 68 const char *NameList::iter() {
duke@435 69 if (_justReset) {_justReset=false; return (_iter < _cur ? _names[_iter] : NULL);}
duke@435 70 else return (_iter <_cur-1 ? _names[++_iter] : NULL);
duke@435 71 }
duke@435 72 const char *NameList::current() { return (_iter < _cur ? _names[_iter] : NULL); }
duke@435 73
duke@435 74 // Return 'true' if current entry is signal
duke@435 75 bool NameList::current_is_signal() {
duke@435 76 const char *entry = current();
duke@435 77 return is_signal(entry);
duke@435 78 }
duke@435 79
duke@435 80 // Return true if entry is a signal
duke@435 81 bool NameList::is_signal(const char *entry) {
duke@435 82 return ( (strcmp(entry,NameList::_signal) == 0) ? true : false);
duke@435 83 }
duke@435 84
duke@435 85 // Search for a name in the list
duke@435 86 bool NameList::search(const char *name) {
duke@435 87 const char *entry;
duke@435 88 for(reset(); (entry = iter()) != NULL; ) {
duke@435 89 if(!strcmp(entry,name)) return true;
duke@435 90 }
duke@435 91 return false;
duke@435 92 }
duke@435 93
duke@435 94 // Return index of name in list
duke@435 95 int NameList::index(const char *name) {
duke@435 96 int cnt = 0;
duke@435 97 const char *entry;
duke@435 98 for(reset(); (entry = iter()) != NULL; ) {
duke@435 99 if(!strcmp(entry,name)) return cnt;
duke@435 100 cnt++;
duke@435 101 }
duke@435 102 return Not_in_list;
duke@435 103 }
duke@435 104
duke@435 105 // Return name at index in list
duke@435 106 const char *NameList::name(intptr_t index) {
duke@435 107 return ( index < _cur ? _names[index] : NULL);
duke@435 108 }
duke@435 109
duke@435 110 void NameList::dump() { output(stderr); }
duke@435 111
duke@435 112 void NameList::output(FILE *fp) {
duke@435 113 fprintf(fp, "\n");
duke@435 114
duke@435 115 // Run iteration over all entries, independent of position of iterator.
duke@435 116 const char *name = NULL;
duke@435 117 int iter = 0;
duke@435 118 bool justReset = true;
duke@435 119
duke@435 120 while( ( name = (justReset ?
duke@435 121 (justReset=false, (iter < _cur ? _names[iter] : NULL)) :
duke@435 122 (iter < _cur-1 ? _names[++iter] : NULL)) )
duke@435 123 != NULL ) {
duke@435 124 fprintf( fp, " %s,\n", name);
duke@435 125 }
duke@435 126 fprintf(fp, "\n");
duke@435 127 }
duke@435 128
duke@435 129 //------------------------------NameAndList------------------------------------
duke@435 130 // Storage for a name and an associated list of names
duke@435 131 NameAndList::NameAndList(char *name) : _name(name) {
duke@435 132 }
duke@435 133 NameAndList::~NameAndList() {
duke@435 134 }
duke@435 135
duke@435 136 // Add to entries in list
duke@435 137 void NameAndList::add_entry(const char *entry) {
duke@435 138 _list.addName(entry);
duke@435 139 }
duke@435 140
duke@435 141 // Access the name and its associated list.
duke@435 142 const char *NameAndList::name() const { return _name; }
duke@435 143 void NameAndList::reset() { _list.reset(); }
duke@435 144 const char *NameAndList::iter() { return _list.iter(); }
duke@435 145
duke@435 146 // Return the "index" entry in the list, zero-based
duke@435 147 const char *NameAndList::operator[](int index) {
duke@435 148 assert( index >= 0, "Internal Error(): index less than 0.");
duke@435 149
duke@435 150 _list.reset();
duke@435 151 const char *entry = _list.iter();
duke@435 152 // Iterate further if it isn't at index 0.
duke@435 153 for ( int position = 0; position != index; ++position ) {
duke@435 154 entry = _list.iter();
duke@435 155 }
duke@435 156
duke@435 157 return entry;
duke@435 158 }
duke@435 159
duke@435 160
duke@435 161 void NameAndList::dump() { output(stderr); }
duke@435 162 void NameAndList::output(FILE *fp) {
duke@435 163 fprintf(fp, "\n");
duke@435 164
duke@435 165 // Output the Name
duke@435 166 fprintf(fp, "Name == %s", (_name ? _name : "") );
duke@435 167
duke@435 168 // Output the associated list of names
duke@435 169 const char *name;
duke@435 170 fprintf(fp, " (");
duke@435 171 for (reset(); (name = iter()) != NULL;) {
duke@435 172 fprintf(fp, " %s,\n", name);
duke@435 173 }
duke@435 174 fprintf(fp, ")");
duke@435 175 fprintf(fp, "\n");
duke@435 176 }
duke@435 177
duke@435 178 //------------------------------Form-------------------------------------------
duke@435 179 OpClassForm *Form::is_opclass() const {
duke@435 180 return NULL;
duke@435 181 }
duke@435 182
duke@435 183 OperandForm *Form::is_operand() const {
duke@435 184 return NULL;
duke@435 185 }
duke@435 186
duke@435 187 InstructForm *Form::is_instruction() const {
duke@435 188 return NULL;
duke@435 189 }
duke@435 190
duke@435 191 MachNodeForm *Form::is_machnode() const {
duke@435 192 return NULL;
duke@435 193 }
duke@435 194
duke@435 195 AttributeForm *Form::is_attribute() const {
duke@435 196 return NULL;
duke@435 197 }
duke@435 198
duke@435 199 Effect *Form::is_effect() const {
duke@435 200 return NULL;
duke@435 201 }
duke@435 202
duke@435 203 ResourceForm *Form::is_resource() const {
duke@435 204 return NULL;
duke@435 205 }
duke@435 206
duke@435 207 PipeClassForm *Form::is_pipeclass() const {
duke@435 208 return NULL;
duke@435 209 }
duke@435 210
duke@435 211 Form::DataType Form::ideal_to_const_type(const char *name) const {
duke@435 212 if( name == NULL ) { return Form::none; }
duke@435 213
duke@435 214 if (strcmp(name,"ConI")==0) return Form::idealI;
duke@435 215 if (strcmp(name,"ConP")==0) return Form::idealP;
coleenp@548 216 if (strcmp(name,"ConN")==0) return Form::idealN;
duke@435 217 if (strcmp(name,"ConL")==0) return Form::idealL;
duke@435 218 if (strcmp(name,"ConF")==0) return Form::idealF;
duke@435 219 if (strcmp(name,"ConD")==0) return Form::idealD;
duke@435 220 if (strcmp(name,"Bool")==0) return Form::idealI;
duke@435 221
duke@435 222 return Form::none;
duke@435 223 }
duke@435 224
duke@435 225 Form::DataType Form::ideal_to_sReg_type(const char *name) const {
duke@435 226 if( name == NULL ) { return Form::none; }
duke@435 227
duke@435 228 if (strcmp(name,"sRegI")==0) return Form::idealI;
duke@435 229 if (strcmp(name,"sRegP")==0) return Form::idealP;
duke@435 230 if (strcmp(name,"sRegF")==0) return Form::idealF;
duke@435 231 if (strcmp(name,"sRegD")==0) return Form::idealD;
duke@435 232 if (strcmp(name,"sRegL")==0) return Form::idealL;
duke@435 233 return Form::none;
duke@435 234 }
duke@435 235
duke@435 236 Form::DataType Form::ideal_to_Reg_type(const char *name) const {
duke@435 237 if( name == NULL ) { return Form::none; }
duke@435 238
duke@435 239 if (strcmp(name,"RegI")==0) return Form::idealI;
duke@435 240 if (strcmp(name,"RegP")==0) return Form::idealP;
duke@435 241 if (strcmp(name,"RegF")==0) return Form::idealF;
duke@435 242 if (strcmp(name,"RegD")==0) return Form::idealD;
duke@435 243 if (strcmp(name,"RegL")==0) return Form::idealL;
duke@435 244
duke@435 245 return Form::none;
duke@435 246 }
duke@435 247
duke@435 248 // True if 'opType', an ideal name, loads or stores.
duke@435 249 Form::DataType Form::is_load_from_memory(const char *opType) const {
duke@435 250 if( strcmp(opType,"LoadB")==0 ) return Form::idealB;
duke@435 251 if( strcmp(opType,"LoadC")==0 ) return Form::idealC;
duke@435 252 if( strcmp(opType,"LoadD")==0 ) return Form::idealD;
duke@435 253 if( strcmp(opType,"LoadD_unaligned")==0 ) return Form::idealD;
duke@435 254 if( strcmp(opType,"LoadF")==0 ) return Form::idealF;
duke@435 255 if( strcmp(opType,"LoadI")==0 ) return Form::idealI;
duke@435 256 if( strcmp(opType,"LoadKlass")==0 ) return Form::idealP;
kvn@599 257 if( strcmp(opType,"LoadNKlass")==0 ) return Form::idealN;
duke@435 258 if( strcmp(opType,"LoadL")==0 ) return Form::idealL;
duke@435 259 if( strcmp(opType,"LoadL_unaligned")==0 ) return Form::idealL;
duke@435 260 if( strcmp(opType,"LoadPLocked")==0 ) return Form::idealP;
duke@435 261 if( strcmp(opType,"LoadLLocked")==0 ) return Form::idealL;
duke@435 262 if( strcmp(opType,"LoadP")==0 ) return Form::idealP;
coleenp@548 263 if( strcmp(opType,"LoadN")==0 ) return Form::idealN;
duke@435 264 if( strcmp(opType,"LoadRange")==0 ) return Form::idealI;
duke@435 265 if( strcmp(opType,"LoadS")==0 ) return Form::idealS;
duke@435 266 if( strcmp(opType,"Load16B")==0 ) return Form::idealB;
duke@435 267 if( strcmp(opType,"Load8B")==0 ) return Form::idealB;
duke@435 268 if( strcmp(opType,"Load4B")==0 ) return Form::idealB;
duke@435 269 if( strcmp(opType,"Load8C")==0 ) return Form::idealC;
duke@435 270 if( strcmp(opType,"Load4C")==0 ) return Form::idealC;
duke@435 271 if( strcmp(opType,"Load2C")==0 ) return Form::idealC;
duke@435 272 if( strcmp(opType,"Load8S")==0 ) return Form::idealS;
duke@435 273 if( strcmp(opType,"Load4S")==0 ) return Form::idealS;
duke@435 274 if( strcmp(opType,"Load2S")==0 ) return Form::idealS;
duke@435 275 if( strcmp(opType,"Load2D")==0 ) return Form::idealD;
duke@435 276 if( strcmp(opType,"Load4F")==0 ) return Form::idealF;
duke@435 277 if( strcmp(opType,"Load2F")==0 ) return Form::idealF;
duke@435 278 if( strcmp(opType,"Load4I")==0 ) return Form::idealI;
duke@435 279 if( strcmp(opType,"Load2I")==0 ) return Form::idealI;
duke@435 280 if( strcmp(opType,"Load2L")==0 ) return Form::idealL;
duke@435 281 assert( strcmp(opType,"Load") != 0, "Must type Loads" );
duke@435 282 return Form::none;
duke@435 283 }
duke@435 284
duke@435 285 Form::DataType Form::is_store_to_memory(const char *opType) const {
duke@435 286 if( strcmp(opType,"StoreB")==0) return Form::idealB;
duke@435 287 if( strcmp(opType,"StoreCM")==0) return Form::idealB;
duke@435 288 if( strcmp(opType,"StoreC")==0) return Form::idealC;
duke@435 289 if( strcmp(opType,"StoreD")==0) return Form::idealD;
duke@435 290 if( strcmp(opType,"StoreF")==0) return Form::idealF;
duke@435 291 if( strcmp(opType,"StoreI")==0) return Form::idealI;
duke@435 292 if( strcmp(opType,"StoreL")==0) return Form::idealL;
duke@435 293 if( strcmp(opType,"StoreP")==0) return Form::idealP;
coleenp@548 294 if( strcmp(opType,"StoreN")==0) return Form::idealN;
duke@435 295 if( strcmp(opType,"Store16B")==0) return Form::idealB;
duke@435 296 if( strcmp(opType,"Store8B")==0) return Form::idealB;
duke@435 297 if( strcmp(opType,"Store4B")==0) return Form::idealB;
duke@435 298 if( strcmp(opType,"Store8C")==0) return Form::idealC;
duke@435 299 if( strcmp(opType,"Store4C")==0) return Form::idealC;
duke@435 300 if( strcmp(opType,"Store2C")==0) return Form::idealC;
duke@435 301 if( strcmp(opType,"Store2D")==0) return Form::idealD;
duke@435 302 if( strcmp(opType,"Store4F")==0) return Form::idealF;
duke@435 303 if( strcmp(opType,"Store2F")==0) return Form::idealF;
duke@435 304 if( strcmp(opType,"Store4I")==0) return Form::idealI;
duke@435 305 if( strcmp(opType,"Store2I")==0) return Form::idealI;
duke@435 306 if( strcmp(opType,"Store2L")==0) return Form::idealL;
duke@435 307 assert( strcmp(opType,"Store") != 0, "Must type Stores" );
duke@435 308 return Form::none;
duke@435 309 }
duke@435 310
duke@435 311 Form::InterfaceType Form::interface_type(FormDict &globals) const {
duke@435 312 return Form::no_interface;
duke@435 313 }
duke@435 314
duke@435 315 //------------------------------FormList---------------------------------------
duke@435 316 // Destructor
duke@435 317 FormList::~FormList() {
duke@435 318 // // This list may not own its elements
duke@435 319 // Form *cur = _root;
duke@435 320 // Form *next = NULL;
duke@435 321 // for( ; (cur = next) != NULL; ) {
duke@435 322 // next = (Form *)cur->_next;
duke@435 323 // delete cur;
duke@435 324 // }
duke@435 325 };
duke@435 326
duke@435 327 //------------------------------FormDict---------------------------------------
duke@435 328 // Constructor
duke@435 329 FormDict::FormDict( CmpKey cmp, Hash hash, Arena *arena )
duke@435 330 : _form(cmp, hash, arena) {
duke@435 331 }
duke@435 332 FormDict::~FormDict() {
duke@435 333 }
duke@435 334
duke@435 335 // Return # of name-Form pairs in dict
duke@435 336 int FormDict::Size(void) const {
duke@435 337 return _form.Size();
duke@435 338 }
duke@435 339
duke@435 340 // Insert inserts the given key-value pair into the dictionary. The prior
duke@435 341 // value of the key is returned; NULL if the key was not previously defined.
duke@435 342 const Form *FormDict::Insert(const char *name, Form *form) {
duke@435 343 return (Form*)_form.Insert((void*)name, (void*)form);
duke@435 344 }
duke@435 345
duke@435 346 // Finds the value of a given key; or NULL if not found.
duke@435 347 // The dictionary is NOT changed.
duke@435 348 const Form *FormDict::operator [](const char *name) const {
duke@435 349 return (Form*)_form[name];
duke@435 350 }
duke@435 351
duke@435 352 //------------------------------FormDict::private------------------------------
duke@435 353 // Disable public use of constructor, copy-ctor, operator =, operator ==
duke@435 354 FormDict::FormDict( ) : _form(cmpkey,hashkey) {
duke@435 355 assert( false, "NotImplemented");
duke@435 356 }
duke@435 357 FormDict::FormDict( const FormDict & fd) : _form(fd._form) {
duke@435 358 }
duke@435 359 FormDict &FormDict::operator =( const FormDict &rhs) {
duke@435 360 assert( false, "NotImplemented");
duke@435 361 _form = rhs._form;
duke@435 362 return *this;
duke@435 363 }
duke@435 364 // == compares two dictionaries; they must have the same keys (their keys
duke@435 365 // must match using CmpKey) and they must have the same values (pointer
duke@435 366 // comparison). If so 1 is returned, if not 0 is returned.
duke@435 367 bool FormDict::operator ==(const FormDict &d) const {
duke@435 368 assert( false, "NotImplemented");
duke@435 369 return false;
duke@435 370 }
duke@435 371
duke@435 372 // Print out the dictionary contents as key-value pairs
duke@435 373 static void dumpkey (const void* key) { fprintf(stdout, "%s", key); }
duke@435 374 static void dumpform(const void* form) { fflush(stdout); ((Form*)form)->dump(); }
duke@435 375
duke@435 376 void FormDict::dump() {
duke@435 377 _form.print(dumpkey, dumpform);
duke@435 378 }
duke@435 379
duke@435 380 //------------------------------SourceForm-------------------------------------
duke@435 381 SourceForm::SourceForm(char* code) : _code(code) { }; // Constructor
duke@435 382 SourceForm::~SourceForm() {
duke@435 383 }
duke@435 384
duke@435 385 void SourceForm::dump() { // Debug printer
duke@435 386 output(stderr);
duke@435 387 }
duke@435 388
duke@435 389 void SourceForm::output(FILE *fp) {
duke@435 390 fprintf(fp,"\n//%s\n%s\n",classname(),(_code?_code:""));
duke@435 391 }

mercurial