duke@435: /* xdono@631: * Copyright 1997-2008 Sun Microsystems, Inc. All Rights Reserved. duke@435: * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. duke@435: * duke@435: * This code is free software; you can redistribute it and/or modify it duke@435: * under the terms of the GNU General Public License version 2 only, as duke@435: * published by the Free Software Foundation. duke@435: * duke@435: * This code is distributed in the hope that it will be useful, but WITHOUT duke@435: * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or duke@435: * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License duke@435: * version 2 for more details (a copy is included in the LICENSE file that duke@435: * accompanied this code). duke@435: * duke@435: * You should have received a copy of the GNU General Public License version duke@435: * 2 along with this work; if not, write to the Free Software Foundation, duke@435: * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. duke@435: * duke@435: * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara, duke@435: * CA 95054 USA or visit www.sun.com if you need additional information or duke@435: * have any questions. duke@435: * duke@435: */ duke@435: duke@435: // FORMS.CPP - Definitions for ADL Parser Generic & Utility Forms Classes duke@435: #include "adlc.hpp" duke@435: duke@435: //------------------------------Static Initializers---------------------------- duke@435: // allocate arena used by forms duke@435: Arena *Form::arena = Form::generate_arena(); // = Form::generate_arena(); duke@435: Arena *Form::generate_arena() { duke@435: return (new Arena); duke@435: } duke@435: duke@435: //------------------------------NameList--------------------------------------- duke@435: // reserved user-defined string duke@435: const char *NameList::_signal = "$$SIGNAL$$"; never@850: const char *NameList::_signal2 = "$$SIGNAL2$$"; never@850: const char *NameList::_signal3 = "$$SIGNAL3$$"; duke@435: duke@435: // Constructor and Destructor duke@435: NameList::NameList() : _cur(0), _max(4), _iter(0), _justReset(true) { duke@435: _names = (const char**)malloc(_max*sizeof(char*)); duke@435: } duke@435: NameList::~NameList() { duke@435: // The following free is a double-free, and crashes the program: duke@435: //free(_names); // not owner of strings duke@435: } duke@435: duke@435: void NameList::addName(const char *name) { duke@435: if (_cur == _max) _names =(const char**)realloc(_names,(_max *=2)*sizeof(char*)); duke@435: _names[_cur++] = name; duke@435: } duke@435: duke@435: void NameList::add_signal() { duke@435: addName( _signal ); duke@435: } duke@435: void NameList::clear() { duke@435: _cur = 0; duke@435: _iter = 0; duke@435: _justReset = true; duke@435: // _max = 4; Already allocated duke@435: } duke@435: duke@435: int NameList::count() const { return _cur; } duke@435: duke@435: void NameList::reset() { _iter = 0; _justReset = true;} duke@435: const char *NameList::iter() { duke@435: if (_justReset) {_justReset=false; return (_iter < _cur ? _names[_iter] : NULL);} duke@435: else return (_iter <_cur-1 ? _names[++_iter] : NULL); duke@435: } duke@435: const char *NameList::current() { return (_iter < _cur ? _names[_iter] : NULL); } duke@435: duke@435: // Return 'true' if current entry is signal duke@435: bool NameList::current_is_signal() { duke@435: const char *entry = current(); duke@435: return is_signal(entry); duke@435: } duke@435: duke@435: // Return true if entry is a signal duke@435: bool NameList::is_signal(const char *entry) { duke@435: return ( (strcmp(entry,NameList::_signal) == 0) ? true : false); duke@435: } duke@435: duke@435: // Search for a name in the list duke@435: bool NameList::search(const char *name) { duke@435: const char *entry; duke@435: for(reset(); (entry = iter()) != NULL; ) { duke@435: if(!strcmp(entry,name)) return true; duke@435: } duke@435: return false; duke@435: } duke@435: duke@435: // Return index of name in list duke@435: int NameList::index(const char *name) { duke@435: int cnt = 0; duke@435: const char *entry; duke@435: for(reset(); (entry = iter()) != NULL; ) { duke@435: if(!strcmp(entry,name)) return cnt; duke@435: cnt++; duke@435: } duke@435: return Not_in_list; duke@435: } duke@435: duke@435: // Return name at index in list duke@435: const char *NameList::name(intptr_t index) { duke@435: return ( index < _cur ? _names[index] : NULL); duke@435: } duke@435: duke@435: void NameList::dump() { output(stderr); } duke@435: duke@435: void NameList::output(FILE *fp) { duke@435: fprintf(fp, "\n"); duke@435: duke@435: // Run iteration over all entries, independent of position of iterator. duke@435: const char *name = NULL; duke@435: int iter = 0; duke@435: bool justReset = true; duke@435: duke@435: while( ( name = (justReset ? duke@435: (justReset=false, (iter < _cur ? _names[iter] : NULL)) : duke@435: (iter < _cur-1 ? _names[++iter] : NULL)) ) duke@435: != NULL ) { duke@435: fprintf( fp, " %s,\n", name); duke@435: } duke@435: fprintf(fp, "\n"); duke@435: } duke@435: duke@435: //------------------------------NameAndList------------------------------------ duke@435: // Storage for a name and an associated list of names duke@435: NameAndList::NameAndList(char *name) : _name(name) { duke@435: } duke@435: NameAndList::~NameAndList() { duke@435: } duke@435: duke@435: // Add to entries in list duke@435: void NameAndList::add_entry(const char *entry) { duke@435: _list.addName(entry); duke@435: } duke@435: duke@435: // Access the name and its associated list. duke@435: const char *NameAndList::name() const { return _name; } duke@435: void NameAndList::reset() { _list.reset(); } duke@435: const char *NameAndList::iter() { return _list.iter(); } duke@435: duke@435: // Return the "index" entry in the list, zero-based duke@435: const char *NameAndList::operator[](int index) { duke@435: assert( index >= 0, "Internal Error(): index less than 0."); duke@435: duke@435: _list.reset(); duke@435: const char *entry = _list.iter(); duke@435: // Iterate further if it isn't at index 0. duke@435: for ( int position = 0; position != index; ++position ) { duke@435: entry = _list.iter(); duke@435: } duke@435: duke@435: return entry; duke@435: } duke@435: duke@435: duke@435: void NameAndList::dump() { output(stderr); } duke@435: void NameAndList::output(FILE *fp) { duke@435: fprintf(fp, "\n"); duke@435: duke@435: // Output the Name duke@435: fprintf(fp, "Name == %s", (_name ? _name : "") ); duke@435: duke@435: // Output the associated list of names duke@435: const char *name; duke@435: fprintf(fp, " ("); duke@435: for (reset(); (name = iter()) != NULL;) { duke@435: fprintf(fp, " %s,\n", name); duke@435: } duke@435: fprintf(fp, ")"); duke@435: fprintf(fp, "\n"); duke@435: } duke@435: duke@435: //------------------------------Form------------------------------------------- duke@435: OpClassForm *Form::is_opclass() const { duke@435: return NULL; duke@435: } duke@435: duke@435: OperandForm *Form::is_operand() const { duke@435: return NULL; duke@435: } duke@435: duke@435: InstructForm *Form::is_instruction() const { duke@435: return NULL; duke@435: } duke@435: duke@435: MachNodeForm *Form::is_machnode() const { duke@435: return NULL; duke@435: } duke@435: duke@435: AttributeForm *Form::is_attribute() const { duke@435: return NULL; duke@435: } duke@435: duke@435: Effect *Form::is_effect() const { duke@435: return NULL; duke@435: } duke@435: duke@435: ResourceForm *Form::is_resource() const { duke@435: return NULL; duke@435: } duke@435: duke@435: PipeClassForm *Form::is_pipeclass() const { duke@435: return NULL; duke@435: } duke@435: duke@435: Form::DataType Form::ideal_to_const_type(const char *name) const { duke@435: if( name == NULL ) { return Form::none; } duke@435: duke@435: if (strcmp(name,"ConI")==0) return Form::idealI; duke@435: if (strcmp(name,"ConP")==0) return Form::idealP; coleenp@548: if (strcmp(name,"ConN")==0) return Form::idealN; duke@435: if (strcmp(name,"ConL")==0) return Form::idealL; duke@435: if (strcmp(name,"ConF")==0) return Form::idealF; duke@435: if (strcmp(name,"ConD")==0) return Form::idealD; duke@435: if (strcmp(name,"Bool")==0) return Form::idealI; duke@435: duke@435: return Form::none; duke@435: } duke@435: duke@435: Form::DataType Form::ideal_to_sReg_type(const char *name) const { duke@435: if( name == NULL ) { return Form::none; } duke@435: duke@435: if (strcmp(name,"sRegI")==0) return Form::idealI; duke@435: if (strcmp(name,"sRegP")==0) return Form::idealP; duke@435: if (strcmp(name,"sRegF")==0) return Form::idealF; duke@435: if (strcmp(name,"sRegD")==0) return Form::idealD; duke@435: if (strcmp(name,"sRegL")==0) return Form::idealL; duke@435: return Form::none; duke@435: } duke@435: duke@435: Form::DataType Form::ideal_to_Reg_type(const char *name) const { duke@435: if( name == NULL ) { return Form::none; } duke@435: duke@435: if (strcmp(name,"RegI")==0) return Form::idealI; duke@435: if (strcmp(name,"RegP")==0) return Form::idealP; duke@435: if (strcmp(name,"RegF")==0) return Form::idealF; duke@435: if (strcmp(name,"RegD")==0) return Form::idealD; duke@435: if (strcmp(name,"RegL")==0) return Form::idealL; duke@435: duke@435: return Form::none; duke@435: } duke@435: duke@435: // True if 'opType', an ideal name, loads or stores. duke@435: Form::DataType Form::is_load_from_memory(const char *opType) const { duke@435: if( strcmp(opType,"LoadB")==0 ) return Form::idealB; twisti@993: if( strcmp(opType,"LoadUS")==0 ) return Form::idealC; duke@435: if( strcmp(opType,"LoadD")==0 ) return Form::idealD; duke@435: if( strcmp(opType,"LoadD_unaligned")==0 ) return Form::idealD; duke@435: if( strcmp(opType,"LoadF")==0 ) return Form::idealF; duke@435: if( strcmp(opType,"LoadI")==0 ) return Form::idealI; duke@435: if( strcmp(opType,"LoadKlass")==0 ) return Form::idealP; kvn@599: if( strcmp(opType,"LoadNKlass")==0 ) return Form::idealN; duke@435: if( strcmp(opType,"LoadL")==0 ) return Form::idealL; duke@435: if( strcmp(opType,"LoadL_unaligned")==0 ) return Form::idealL; duke@435: if( strcmp(opType,"LoadPLocked")==0 ) return Form::idealP; duke@435: if( strcmp(opType,"LoadLLocked")==0 ) return Form::idealL; duke@435: if( strcmp(opType,"LoadP")==0 ) return Form::idealP; coleenp@548: if( strcmp(opType,"LoadN")==0 ) return Form::idealN; duke@435: if( strcmp(opType,"LoadRange")==0 ) return Form::idealI; duke@435: if( strcmp(opType,"LoadS")==0 ) return Form::idealS; duke@435: if( strcmp(opType,"Load16B")==0 ) return Form::idealB; duke@435: if( strcmp(opType,"Load8B")==0 ) return Form::idealB; duke@435: if( strcmp(opType,"Load4B")==0 ) return Form::idealB; duke@435: if( strcmp(opType,"Load8C")==0 ) return Form::idealC; duke@435: if( strcmp(opType,"Load4C")==0 ) return Form::idealC; duke@435: if( strcmp(opType,"Load2C")==0 ) return Form::idealC; duke@435: if( strcmp(opType,"Load8S")==0 ) return Form::idealS; duke@435: if( strcmp(opType,"Load4S")==0 ) return Form::idealS; duke@435: if( strcmp(opType,"Load2S")==0 ) return Form::idealS; duke@435: if( strcmp(opType,"Load2D")==0 ) return Form::idealD; duke@435: if( strcmp(opType,"Load4F")==0 ) return Form::idealF; duke@435: if( strcmp(opType,"Load2F")==0 ) return Form::idealF; duke@435: if( strcmp(opType,"Load4I")==0 ) return Form::idealI; duke@435: if( strcmp(opType,"Load2I")==0 ) return Form::idealI; duke@435: if( strcmp(opType,"Load2L")==0 ) return Form::idealL; duke@435: assert( strcmp(opType,"Load") != 0, "Must type Loads" ); duke@435: return Form::none; duke@435: } duke@435: duke@435: Form::DataType Form::is_store_to_memory(const char *opType) const { duke@435: if( strcmp(opType,"StoreB")==0) return Form::idealB; duke@435: if( strcmp(opType,"StoreCM")==0) return Form::idealB; duke@435: if( strcmp(opType,"StoreC")==0) return Form::idealC; duke@435: if( strcmp(opType,"StoreD")==0) return Form::idealD; duke@435: if( strcmp(opType,"StoreF")==0) return Form::idealF; duke@435: if( strcmp(opType,"StoreI")==0) return Form::idealI; duke@435: if( strcmp(opType,"StoreL")==0) return Form::idealL; duke@435: if( strcmp(opType,"StoreP")==0) return Form::idealP; coleenp@548: if( strcmp(opType,"StoreN")==0) return Form::idealN; duke@435: if( strcmp(opType,"Store16B")==0) return Form::idealB; duke@435: if( strcmp(opType,"Store8B")==0) return Form::idealB; duke@435: if( strcmp(opType,"Store4B")==0) return Form::idealB; duke@435: if( strcmp(opType,"Store8C")==0) return Form::idealC; duke@435: if( strcmp(opType,"Store4C")==0) return Form::idealC; duke@435: if( strcmp(opType,"Store2C")==0) return Form::idealC; duke@435: if( strcmp(opType,"Store2D")==0) return Form::idealD; duke@435: if( strcmp(opType,"Store4F")==0) return Form::idealF; duke@435: if( strcmp(opType,"Store2F")==0) return Form::idealF; duke@435: if( strcmp(opType,"Store4I")==0) return Form::idealI; duke@435: if( strcmp(opType,"Store2I")==0) return Form::idealI; duke@435: if( strcmp(opType,"Store2L")==0) return Form::idealL; duke@435: assert( strcmp(opType,"Store") != 0, "Must type Stores" ); duke@435: return Form::none; duke@435: } duke@435: duke@435: Form::InterfaceType Form::interface_type(FormDict &globals) const { duke@435: return Form::no_interface; duke@435: } duke@435: duke@435: //------------------------------FormList--------------------------------------- duke@435: // Destructor duke@435: FormList::~FormList() { duke@435: // // This list may not own its elements duke@435: // Form *cur = _root; duke@435: // Form *next = NULL; duke@435: // for( ; (cur = next) != NULL; ) { duke@435: // next = (Form *)cur->_next; duke@435: // delete cur; duke@435: // } duke@435: }; duke@435: duke@435: //------------------------------FormDict--------------------------------------- duke@435: // Constructor duke@435: FormDict::FormDict( CmpKey cmp, Hash hash, Arena *arena ) duke@435: : _form(cmp, hash, arena) { duke@435: } duke@435: FormDict::~FormDict() { duke@435: } duke@435: duke@435: // Return # of name-Form pairs in dict duke@435: int FormDict::Size(void) const { duke@435: return _form.Size(); duke@435: } duke@435: duke@435: // Insert inserts the given key-value pair into the dictionary. The prior duke@435: // value of the key is returned; NULL if the key was not previously defined. duke@435: const Form *FormDict::Insert(const char *name, Form *form) { duke@435: return (Form*)_form.Insert((void*)name, (void*)form); duke@435: } duke@435: duke@435: // Finds the value of a given key; or NULL if not found. duke@435: // The dictionary is NOT changed. duke@435: const Form *FormDict::operator [](const char *name) const { duke@435: return (Form*)_form[name]; duke@435: } duke@435: duke@435: //------------------------------FormDict::private------------------------------ duke@435: // Disable public use of constructor, copy-ctor, operator =, operator == duke@435: FormDict::FormDict( ) : _form(cmpkey,hashkey) { duke@435: assert( false, "NotImplemented"); duke@435: } duke@435: FormDict::FormDict( const FormDict & fd) : _form(fd._form) { duke@435: } duke@435: FormDict &FormDict::operator =( const FormDict &rhs) { duke@435: assert( false, "NotImplemented"); duke@435: _form = rhs._form; duke@435: return *this; duke@435: } duke@435: // == compares two dictionaries; they must have the same keys (their keys duke@435: // must match using CmpKey) and they must have the same values (pointer duke@435: // comparison). If so 1 is returned, if not 0 is returned. duke@435: bool FormDict::operator ==(const FormDict &d) const { duke@435: assert( false, "NotImplemented"); duke@435: return false; duke@435: } duke@435: duke@435: // Print out the dictionary contents as key-value pairs duke@435: static void dumpkey (const void* key) { fprintf(stdout, "%s", key); } duke@435: static void dumpform(const void* form) { fflush(stdout); ((Form*)form)->dump(); } duke@435: duke@435: void FormDict::dump() { duke@435: _form.print(dumpkey, dumpform); duke@435: } duke@435: duke@435: //------------------------------SourceForm------------------------------------- duke@435: SourceForm::SourceForm(char* code) : _code(code) { }; // Constructor duke@435: SourceForm::~SourceForm() { duke@435: } duke@435: duke@435: void SourceForm::dump() { // Debug printer duke@435: output(stderr); duke@435: } duke@435: duke@435: void SourceForm::output(FILE *fp) { duke@435: fprintf(fp,"\n//%s\n%s\n",classname(),(_code?_code:"")); duke@435: }